fnmatch.c revision 1.2 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1989 The Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * Guido van Rossum.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd */
36 1.1 cgd
37 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
38 1.1 cgd static char sccsid[] = "@(#)fnmatch.c 5.4 (Berkeley) 2/23/91";
39 1.1 cgd #endif /* LIBC_SCCS and not lint */
40 1.1 cgd
41 1.1 cgd /*
42 1.1 cgd * Function fnmatch() as proposed in Posix 1003.2 B.6 (rev. 9).
43 1.1 cgd * Compares a filename or pathname to a pattern.
44 1.1 cgd */
45 1.1 cgd
46 1.1 cgd #include <unistd.h>
47 1.1 cgd #include <string.h>
48 1.1 cgd
49 1.1 cgd #define EOS '\0'
50 1.1 cgd
51 1.1 cgd static char *
52 1.1 cgd rangematch(pattern, test)
53 1.1 cgd register char *pattern, test;
54 1.1 cgd {
55 1.1 cgd register char c, c2;
56 1.1 cgd int negate, ok;
57 1.1 cgd
58 1.1 cgd if (negate = (*pattern == '!'))
59 1.1 cgd ++pattern;
60 1.1 cgd
61 1.1 cgd /*
62 1.1 cgd * TO DO: quoting
63 1.1 cgd */
64 1.1 cgd
65 1.1 cgd for (ok = 0; (c = *pattern++) != ']';) {
66 1.1 cgd if (c == EOS)
67 1.1 cgd return(NULL); /* illegal pattern */
68 1.1 cgd if (*pattern == '-' && (c2 = pattern[1]) != EOS && c2 != ']') {
69 1.1 cgd if (c <= test && test <= c2)
70 1.1 cgd ok = 1;
71 1.1 cgd pattern += 2;
72 1.1 cgd }
73 1.1 cgd else if (c == test)
74 1.1 cgd ok = 1;
75 1.1 cgd }
76 1.1 cgd return(ok == negate ? NULL : pattern);
77 1.1 cgd }
78 1.1 cgd
79 1.1 cgd fnmatch(pattern, string, flags)
80 1.1 cgd register const char *pattern;
81 1.1 cgd register const char *string;
82 1.1 cgd int flags;
83 1.1 cgd {
84 1.1 cgd register char c;
85 1.1 cgd char test, *rangematch();
86 1.1 cgd
87 1.1 cgd for (;;)
88 1.1 cgd switch (c = *pattern++) {
89 1.1 cgd case EOS:
90 1.2 mycroft return(!(*string == EOS));
91 1.1 cgd case '?':
92 1.2 mycroft if (((test = *string++) == EOS) ||
93 1.2 mycroft ((test == '/') && (flags & FNM_PATHNAME)))
94 1.2 mycroft return(1);
95 1.1 cgd break;
96 1.1 cgd case '*':
97 1.1 cgd c = *pattern;
98 1.1 cgd /* collapse multiple stars */
99 1.1 cgd while (c == '*')
100 1.1 cgd c = *++pattern;
101 1.1 cgd
102 1.1 cgd /* optimize for pattern with * at end or before / */
103 1.1 cgd if (c == EOS)
104 1.1 cgd if (flags & FNM_PATHNAME)
105 1.2 mycroft return(index(string, '/') != NULL);
106 1.1 cgd else
107 1.2 mycroft return(0);
108 1.2 mycroft else if ((c == '/') && (flags & FNM_PATHNAME)) {
109 1.2 mycroft if ((string = index(string, '/')) == NULL)
110 1.1 cgd return(1);
111 1.1 cgd break;
112 1.1 cgd }
113 1.1 cgd
114 1.1 cgd /* general case, use recursion */
115 1.1 cgd while ((test = *string) != EOS) {
116 1.2 mycroft if (!fnmatch(pattern, string, flags))
117 1.2 mycroft return(0);
118 1.1 cgd if (test == '/' && flags & FNM_PATHNAME)
119 1.1 cgd break;
120 1.1 cgd ++string;
121 1.1 cgd }
122 1.2 mycroft return(1);
123 1.1 cgd case '[':
124 1.1 cgd if ((test = *string++) == EOS ||
125 1.1 cgd test == '/' && flags & FNM_PATHNAME)
126 1.2 mycroft return(1);
127 1.1 cgd if ((pattern = rangematch(pattern, test)) == NULL)
128 1.2 mycroft return(1);
129 1.1 cgd break;
130 1.1 cgd case '\\':
131 1.1 cgd if (flags & FNM_QUOTE) {
132 1.1 cgd if ((c = *pattern++) == EOS) {
133 1.1 cgd c = '\\';
134 1.1 cgd --pattern;
135 1.1 cgd }
136 1.1 cgd if (c != *string++)
137 1.2 mycroft return(1);
138 1.1 cgd break;
139 1.1 cgd }
140 1.1 cgd /* FALLTHROUGH */
141 1.1 cgd default:
142 1.1 cgd if (c != *string++)
143 1.2 mycroft return(1);
144 1.1 cgd break;
145 1.1 cgd }
146 1.1 cgd }
147