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 3 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, see <http://www.gnu.org/licenses/>.
21 This module was originally based on fnmatch.c copyright by the Free
22 Software Foundation. It bears little (if any) resemblence to that
28 * @brief MS-style Filename matching
33 static int null_match(const char *p)
45 the max_n structure is purely for efficiency, it doesn't contribute
46 to the matching algorithm except by ensuring that the algorithm does
47 not grow exponentially
56 p and n are the pattern and string being matched. The max_n array is
57 an optimisation only. The ldot pointer is NULL if the string does
58 not contain a '.', otherwise it points at the last dot in 'n'.
60 static int ms_fnmatch_core(const char *p, const char *n,
61 struct max_n *max_n, const char *ldot)
67 while ((c = next_codepoint(p, &size))) {
72 /* a '*' matches zero or more characters of any type */
73 if (max_n->predot && max_n->predot <= n) {
76 for (i=0; n[i]; i += size_n) {
77 next_codepoint(n+i, &size_n);
78 if (ms_fnmatch_core(p, n+i, max_n+1, ldot) == 0) {
82 if (!max_n->predot || max_n->predot > n) max_n->predot = n;
86 /* a '<' matches zero or more characters of
87 any type, but stops matching at the last
89 if (max_n->predot && max_n->predot <= n) {
92 if (max_n->postdot && max_n->postdot <= n && n <= ldot) {
95 for (i=0; n[i]; i += size_n) {
96 next_codepoint(n+i, &size_n);
97 if (ms_fnmatch_core(p, n+i, max_n+1, ldot) == 0) return 0;
99 if (ms_fnmatch_core(p, n+i+size_n, max_n+1, ldot) == 0) return 0;
100 if (!max_n->postdot || max_n->postdot > n) max_n->postdot = n;
104 if (!max_n->predot || max_n->predot > n) max_n->predot = n;
105 return null_match(p);
108 /* a '?' matches any single character */
112 next_codepoint(n, &size_n);
117 /* a '?' matches any single character, but
118 treats '.' specially */
120 if (! n[1] && null_match(p) == 0) {
125 if (! *n) return null_match(p);
126 next_codepoint(n, &size_n);
131 /* a bit like a soft '.' */
132 if (*n == 0 && null_match(p) == 0) {
135 if (*n != '.') return -1;
136 next_codepoint(n, &size_n);
141 c2 = next_codepoint(n, &size_n);
142 if (c != c2 && codepoint_cmpi(c, c2) != 0) {
157 int ms_fnmatch(const char *pattern, const char *string, enum protocol_types protocol)
160 struct max_n *max_n = NULL;
162 if (strcmp(string, "..") == 0) {
166 if (strpbrk(pattern, "<>*?\"") == NULL) {
167 /* this is not just an optimisation - it is essential
168 for LANMAN1 correctness */
169 return strcasecmp_m(pattern, string);
172 if (protocol <= PROTOCOL_LANMAN2) {
173 char *p = talloc_strdup(NULL, pattern);
178 for older negotiated protocols it is possible to
179 translate the pattern to produce a "new style"
180 pattern that exactly matches w2k behaviour
185 } else if (p[i] == '.' &&
190 } else if (p[i] == '*' &&
195 ret = ms_fnmatch(p, string, PROTOCOL_NT1);
200 for (count=i=0;pattern[i];i++) {
201 if (pattern[i] == '*' || pattern[i] == '<') count++;
204 max_n = talloc_zero_array(NULL, struct max_n, count);
209 ret = ms_fnmatch_core(pattern, string, max_n, strrchr(string, '.'));
217 /** a generic fnmatch function - uses for non-CIFS pattern matching */
218 int gen_fnmatch(const char *pattern, const char *string)
220 return ms_fnmatch(pattern, string, PROTOCOL_NT1);