1
/* $Revision: 0.2.18.1 $
3
** Do shell-style pattern matching for ?, \, [], and * characters.
4
** Might not be robust in face of malformed patterns; e.g., "foo[a-"
5
** could cause a segmentation violation. It is 8bit clean.
7
** Written by Rich $alz, mirror!rs, Wed Nov 26 19:03:17 EST 1986.
8
** Rich $alz is now <rsalz@osf.org>.
9
** April, 1991: Replaced mutually-recursive calls with in-line code
10
** for the star character.
12
** Special thanks to Lars Mathiesen <thorinn@diku.dk> for the ABORT code.
13
** This can greatly speed up failing wildcard patterns. For example:
14
** pattern: -*-*-*-*-*-*-12-*-*-*-m-*-*-*
15
** text 1: -adobe-courier-bold-o-normal--12-120-75-75-m-70-iso8859-1
16
** text 2: -adobe-courier-bold-o-normal--12-120-75-75-X-70-iso8859-1
17
** Text 1 matches with 51 calls, while text 2 fails with 54 calls. Without
18
** the ABORT code, it takes 22310 calls to fail. Ugh. The following
19
** explanation is from Lars:
20
** The precondition that must be fulfilled is that DoMatch will consume
21
** at least one character in text. This is true if *p is neither '*' nor
22
** '\0'.) The last return has ABORT instead of FALSE to avoid quadratic
23
** behaviour in cases like pattern "*a*b*c*d" with text "abcxxxxx". With
24
** FALSE, each star-loop has to run to the end of the text; with ABORT
25
** only the last one does.
27
** Once the control of one instance of DoMatch enters the star-loop, that
28
** instance will return either TRUE or ABORT, and any calling instance
29
** will therefore return immediately after (without calling recursively
30
** again). In effect, only one star-loop is ever active. It would be
31
** possible to modify the code to maintain this context explicitly,
32
** eliminating all recursive calls at the cost of some complication and
33
** loss of clarity (and the ABORT stuff seems to be unclear enough by
34
** itself). I think it would be unwise to try to get this into a
35
** released version unless you have a good test data base to try it out
48
/* What character marks an inverted character class? */
49
#define NEGATE_CLASS '^'
50
/* Is "*" a common pattern? */
51
#define OPTIMIZE_JUST_STAR
52
/* Do tar(1) matching rules, which ignore a trailing slash? */
53
#undef MATCH_TAR_PATTERN
57
** Match text and p, return TRUE, FALSE, or ABORT.
68
for ( ; *p; text++, p++) {
69
if (*text == '\0' && *p != '*')
73
/* Literal match with following character. */
77
if (toupper (*text) != toupper (*p))
85
/* Consecutive stars act just like one. */
88
/* Trailing star matches everything. */
91
if ((matched = DoMatch(text++, p)) != FALSE)
95
reverse = p[1] == NEGATE_CLASS ? TRUE : FALSE;
97
/* Inverted character class. */
100
if (p[1] == ']' || p[1] == '-')
101
if (toupper (*++p) == toupper(*text))
103
for (last = *p; *++p && *p != ']'; last = *p)
104
/* This next line requires a good C compiler. */
105
if (*p == '-' && p[1] != ']'
106
? *text <= *++p && *text >= last
107
: toupper (*text) == toupper (*p))
109
if (matched == reverse)
115
#ifdef MATCH_TAR_PATTERN
118
#endif /* MATCH_TAR_ATTERN */
119
return *text == '\0';
124
** User-level routine. Returns TRUE or FALSE.
131
#ifdef OPTIMIZE_JUST_STAR
132
if (p[0] == '*' && p[1] == '\0')
134
#endif /* OPTIMIZE_JUST_STAR */
135
return DoMatch(text, p) == TRUE;
143
/* Yes, we use gets not fgets. Sue me. */
153
printf("Wildmat tester. Enter pattern, then strings to test.\n");
154
printf("A blank line gets prompts for a new pattern; a blank pattern\n");
155
printf("exits the program.\n");
158
printf("\nEnter pattern: ");
159
(void)fflush(stdout);
160
if (gets(p) == NULL || p[0] == '\0')
163
printf("Enter text: ");
164
(void)fflush(stdout);
165
if (gets(text) == NULL)
168
/* Blank line; go back and get a new pattern. */
170
printf(" %s\n", wildmat(text, p) ? "YES" : "NO");
177
#endif /* defined(TEST) */
added
removed
support/nfs/wildmat.c
