blob: 46f5327dac4c21fa43d11a853f65f9febd61eaf3 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
/*
* Written by Ozan S. Yigit, 1994. Public domain.
* Copied from https://github.com/public-domain/glob.git
*/
#ifndef NEGATE
#define NEGATE '^' /* std cset negation char */
#endif
#define TRUE 1
#define FALSE 0
int amatch(char *str, char *p)
{
int negate;
int match;
int c;
while (*p) {
if (!*str && *p != '*')
return FALSE;
switch (c = *p++) {
case '*':
while (*p == '*')
p++;
if (!*p)
return TRUE;
if (*p != '?' && *p != '[' && *p != '\\')
while (*str && *p != *str)
str++;
while (*str) {
if (amatch(str, p))
return TRUE;
str++;
}
return FALSE;
case '?':
if (*str)
break;
return FALSE;
/*
* set specification is inclusive, that is [a-z] is a, z and
* everything in between. this means [z-a] may be interpreted
* as a set that contains z, a and nothing in between.
*/
case '[':
if (*p != NEGATE)
negate = FALSE;
else {
negate = TRUE;
p++;
}
match = FALSE;
while (!match && (c = *p++)) {
if (!*p)
return FALSE;
if (*p == '-') { /* c-c */
if (!*++p)
return FALSE;
if (*p != ']') {
if (*str == c || *str == *p ||
(*str > c && *str < *p))
match = TRUE;
} else { /* c-] */
if (*str >= c)
match = TRUE;
break;
}
} else { /* cc or c] */
if (c == *str)
match = TRUE;
if (*p != ']') {
if (*p == *str)
match = TRUE;
} else
break;
}
}
if (negate == match)
return FALSE;
/*
* if there is a match, skip past the cset and continue on
*/
while (*p && *p != ']')
p++;
if (!*p++) /* oops! */
return FALSE;
break;
case '\\':
if (*p)
c = *p++;
default:
if (c != *str)
return FALSE;
break;
}
str++;
}
return !*str;
}
|
