2 Unix SMB/CIFS implementation.
3 filename matching routine
4 Copyright (C) Andrew Tridgell 1992-2004
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 This module was originally based on fnmatch.c copyright by the Free
23 Software Foundation. It bears little (if any) resemblence to that
30 static int null_match(const char *p)
42 the max_n structure is purely for efficiency, it doesn't contribute
43 to the matching algorithm except by ensuring that the algorithm does
44 not grow exponentially
53 p and n are the pattern and string being matched. The max_n array is
54 an optimisation only. The ldot pointer is NULL if the string does
55 not contain a '.', otherwise it points at the last dot in 'n'.
57 static int ms_fnmatch_core(const char *p, const char *n,
58 struct max_n *max_n, const char *ldot)
64 while ((c = next_codepoint(p, &size))) {
69 /* a '*' matches zero or more characters of any type */
70 if (max_n->predot && max_n->predot <= n) {
73 for (i=0; n[i]; i += size_n) {
74 next_codepoint(n+i, &size_n);
75 if (ms_fnmatch_core(p, n+i, max_n+1, ldot) == 0) {
79 if (!max_n->predot || max_n->predot > n) max_n->predot = n;
83 /* a '<' matches zero or more characters of
84 any type, but stops matching at the last
86 if (max_n->predot && max_n->predot <= n) {
89 if (max_n->postdot && max_n->postdot <= n && n <= ldot) {
92 for (i=0; n[i]; i += size_n) {
93 next_codepoint(n+i, &size_n);
94 if (ms_fnmatch_core(p, n+i, max_n+1, ldot) == 0) return 0;
96 if (ms_fnmatch_core(p, n+i+size_n, max_n+1, ldot) == 0) return 0;
97 if (!max_n->postdot || max_n->postdot > n) max_n->postdot = n;
101 if (!max_n->predot || max_n->predot > n) max_n->predot = n;
102 return null_match(p);
105 /* a '?' matches any single character */
109 next_codepoint(n, &size_n);
114 /* a '?' matches any single character, but
115 treats '.' specially */
117 if (! n[1] && null_match(p) == 0) {
122 if (! *n) return null_match(p);
123 next_codepoint(n, &size_n);
128 /* a bit like a soft '.' */
129 if (*n == 0 && null_match(p) == 0) {
132 if (*n != '.') return -1;
133 next_codepoint(n, &size_n);
138 c2 = next_codepoint(n, &size_n);
139 if (c != c2 && codepoint_cmpi(c, c2) != 0) {
154 int ms_fnmatch(const char *pattern, const char *string, enum protocol_types protocol)
157 struct max_n *max_n = NULL;
159 if (strcmp(string, "..") == 0) {
163 if (strpbrk(pattern, "<>*?\"") == NULL) {
164 /* this is not just an optmisation - it is essential
165 for LANMAN1 correctness */
166 return strcasecmp_m(pattern, string);
169 if (protocol <= PROTOCOL_LANMAN2) {
170 char *p = talloc_strdup(NULL, pattern);
175 for older negotiated protocols it is possible to
176 translate the pattern to produce a "new style"
177 pattern that exactly matches w2k behaviour
182 } else if (p[i] == '.' &&
187 } else if (p[i] == '*' &&
192 ret = ms_fnmatch(p, string, PROTOCOL_NT1);
197 for (count=i=0;pattern[i];i++) {
198 if (pattern[i] == '*' || pattern[i] == '<') count++;
201 max_n = talloc_array(NULL, struct max_n, count);
205 memset(max_n, 0, sizeof(struct max_n) * count);
207 ret = ms_fnmatch_core(pattern, string, max_n, strrchr(string, '.'));
215 /* a generic fnmatch function - uses for non-CIFS pattern matching */
216 int gen_fnmatch(const char *pattern, const char *string)
218 return ms_fnmatch(pattern, string, PROTOCOL_NT1);