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 smb_ucs2_t
*p
)
33 if (*p
!= UCS2_CHAR('*') &&
34 *p
!= UCS2_CHAR('<') &&
35 *p
!= UCS2_CHAR('"') &&
36 *p
!= UCS2_CHAR('>')) return -1;
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
47 const smb_ucs2_t
*predot
;
48 const smb_ucs2_t
*postdot
;
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 smb_ucs2_t
*p
, const smb_ucs2_t
*n
,
58 struct max_n
*max_n
, const smb_ucs2_t
*ldot
,
59 BOOL is_case_sensitive
)
66 /* a '*' matches zero or more characters of any type */
68 if (max_n
->predot
&& max_n
->predot
<= n
) {
71 for (i
=0; n
[i
]; i
++) {
72 if (ms_fnmatch_core(p
, n
+i
, max_n
+1, ldot
, is_case_sensitive
) == 0) {
76 if (!max_n
->predot
|| max_n
->predot
> n
) max_n
->predot
= n
;
79 /* a '<' matches zero or more characters of
80 any type, but stops matching at the last
83 if (max_n
->predot
&& max_n
->predot
<= n
) {
86 if (max_n
->postdot
&& max_n
->postdot
<= n
&& n
<= ldot
) {
89 for (i
=0; n
[i
]; i
++) {
90 if (ms_fnmatch_core(p
, n
+i
, max_n
+1, ldot
, is_case_sensitive
) == 0) return 0;
92 if (ms_fnmatch_core(p
, n
+i
+1, max_n
+1, ldot
, is_case_sensitive
) == 0) return 0;
93 if (!max_n
->postdot
|| max_n
->postdot
> n
) max_n
->postdot
= n
;
97 if (!max_n
->predot
|| max_n
->predot
> n
) max_n
->predot
= n
;
100 /* a '?' matches any single character */
108 /* a '?' matches any single character */
110 if (n
[0] == UCS2_CHAR('.')) {
111 if (! n
[1] && null_match(p
) == 0) {
116 if (! *n
) return null_match(p
);
121 if (*n
== 0 && null_match(p
) == 0) {
124 if (*n
!= UCS2_CHAR('.')) return -1;
130 if (is_case_sensitive
) {
133 if (toupper_w(c
) != toupper_w(*n
)) {
149 int ms_fnmatch(const char *pattern
, const char *string
, BOOL translate_pattern
,
150 BOOL is_case_sensitive
)
154 struct max_n
*max_n
= NULL
;
156 if (strcmp(string
, "..") == 0) {
160 if (strpbrk(pattern
, "<>*?\"") == NULL
) {
161 /* this is not just an optmisation - it is essential
162 for LANMAN1 correctness */
163 if (is_case_sensitive
) {
164 return strcmp(pattern
, string
);
166 return StrCaseCmp(pattern
, string
);
170 if (push_ucs2(NULL
, p
, pattern
, sizeof(p
), STR_TERMINATE
) == (size_t)-1) {
171 /* Not quite the right answer, but finding the right one
172 under this failure case is expensive, and it's pretty close */
176 if (push_ucs2(NULL
, s
, string
, sizeof(s
), STR_TERMINATE
) == (size_t)-1) {
177 /* Not quite the right answer, but finding the right one
178 under this failure case is expensive, and it's pretty close */
182 if (translate_pattern
) {
184 for older negotiated protocols it is possible to
185 translate the pattern to produce a "new style"
186 pattern that exactly matches w2k behaviour
189 if (p
[i
] == UCS2_CHAR('?')) {
190 p
[i
] = UCS2_CHAR('>');
191 } else if (p
[i
] == UCS2_CHAR('.') &&
192 (p
[i
+1] == UCS2_CHAR('?') ||
193 p
[i
+1] == UCS2_CHAR('*') ||
195 p
[i
] = UCS2_CHAR('"');
196 } else if (p
[i
] == UCS2_CHAR('*') && p
[i
+1] == UCS2_CHAR('.')) {
197 p
[i
] = UCS2_CHAR('<');
202 for (count
=i
=0;p
[i
];i
++) {
203 if (p
[i
] == UCS2_CHAR('*') || p
[i
] == UCS2_CHAR('<')) count
++;
207 max_n
= SMB_CALLOC_ARRAY(struct max_n
, count
);
213 ret
= ms_fnmatch_core(p
, s
, max_n
, strrchr_w(s
, UCS2_CHAR('.')), is_case_sensitive
);
223 /* a generic fnmatch function - uses for non-CIFS pattern matching */
224 int gen_fnmatch(const char *pattern
, const char *string
)
226 return ms_fnmatch(pattern
, string
, PROTOCOL_NT1
, False
);