lib/ms_fnmatch.c

ソースコードを見る。

データ構造
struct	max_n
関数
static int	null_match (const smb_ucs2_t *p)
static int	ms_fnmatch_core (const smb_ucs2_t *p, const smb_ucs2_t *n, struct max_n *max_n, const smb_ucs2_t *ldot, BOOL is_case_sensitive)
int	ms_fnmatch (const char *pattern, const char *string, BOOL translate_pattern, BOOL is_case_sensitive)
int	gen_fnmatch (const char *pattern, const char *string)

---

関数

static int null_match

(

const smb_ucs2_t *

p

)

[static]

ms_fnmatch.c の 30 行で定義されています。

参照元 ms_fnmatch_core().

{
        for (;*p;p++) {
                if (*p != UCS2_CHAR('*') &&
                    *p != UCS2_CHAR('<') &&
                    *p != UCS2_CHAR('"') &&
                    *p != UCS2_CHAR('>')) return -1;
        }
        return 0;
}

static int ms_fnmatch_core	(	const smb_ucs2_t *	p,
		const smb_ucs2_t *	n,
		struct max_n *	max_n,
		const smb_ucs2_t *	ldot,
		BOOL	is_case_sensitive
	)			[static]

ms_fnmatch.c の 57 行で定義されています。

参照先 c・null_match()・max_n::postdot・max_n::predot・toupper_w().

参照元 ms_fnmatch().

{
        smb_ucs2_t c;
        int i;

        while ((c = *p++)) {
                switch (c) {
                        /* a '*' matches zero or more characters of any type */
                case UCS2_CHAR('*'):
                        if (max_n->predot && max_n->predot <= n) {
                                return null_match(p);
                        }
                        for (i=0; n[i]; i++) {
                                if (ms_fnmatch_core(p, n+i, max_n+1, ldot, is_case_sensitive) == 0) {
                                        return 0;
                                }
                        }
                        if (!max_n->predot || max_n->predot > n) max_n->predot = n;
                        return null_match(p);

                        /* a '<' matches zero or more characters of
                           any type, but stops matching at the last
                           '.' in the string. */
                case UCS2_CHAR('<'):
                        if (max_n->predot && max_n->predot <= n) {
                                return null_match(p);
                        }
                        if (max_n->postdot && max_n->postdot <= n && n <= ldot) {
                                return -1;
                        }
                        for (i=0; n[i]; i++) {
                                if (ms_fnmatch_core(p, n+i, max_n+1, ldot, is_case_sensitive) == 0) return 0;
                                if (n+i == ldot) {
                                        if (ms_fnmatch_core(p, n+i+1, max_n+1, ldot, is_case_sensitive) == 0) return 0;
                                        if (!max_n->postdot || max_n->postdot > n) max_n->postdot = n;
                                        return -1;
                                }
                        }
                        if (!max_n->predot || max_n->predot > n) max_n->predot = n;
                        return null_match(p);

                        /* a '?' matches any single character */
                case UCS2_CHAR('?'):
                        if (! *n) {
                                return -1;
                        }
                        n++;
                        break;

                        /* a '?' matches any single character */
                case UCS2_CHAR('>'):
                        if (n[0] == UCS2_CHAR('.')) {
                                if (! n[1] && null_match(p) == 0) {
                                        return 0;
                                }
                                break;
                        }
                        if (! *n) return null_match(p);
                        n++;
                        break;

                case UCS2_CHAR('"'):
                        if (*n == 0 && null_match(p) == 0) {
                                return 0;
                        }
                        if (*n != UCS2_CHAR('.')) return -1;
                        n++;
                        break;

                default:
                        if (c != *n) {
                                if (is_case_sensitive) {
                                        return -1;
                                }
                                if (toupper_w(c) != toupper_w(*n)) {
                                        return -1;
                                }
                        }
                        n++;
                        break;
                }
        }
        
        if (! *n) {
                return 0;
        }
        
        return -1;
}

int ms_fnmatch	(	const char *	pattern,
		const char *	string,
		BOOL	translate_pattern,
		BOOL	is_case_sensitive
	)

ms_fnmatch.c の 149 行で定義されています。

参照先 ms_fnmatch_core()・push_ucs2()・StrCaseCmp()・strrchr_w().

参照元 gen_fnmatch()・mask_match()・mask_match_search()・reg_match_one().

{
        wpstring p, s;
        int ret, count, i;
        struct max_n *max_n = NULL;

        if (strcmp(string, "..") == 0) {
                string = ".";
        }

        if (strpbrk(pattern, "<>*?\"") == NULL) {
                /* this is not just an optmisation - it is essential
                   for LANMAN1 correctness */
                if (is_case_sensitive) {
                        return strcmp(pattern, string);
                } else {
                        return StrCaseCmp(pattern, string);
                }
        }

        if (push_ucs2(NULL, p, pattern, sizeof(p), STR_TERMINATE) == (size_t)-1) {
                /* Not quite the right answer, but finding the right one
                  under this failure case is expensive, and it's pretty close */
                return -1;
        }

        if (push_ucs2(NULL, s, string, sizeof(s), STR_TERMINATE) == (size_t)-1) {
                /* Not quite the right answer, but finding the right one
                   under this failure case is expensive, and it's pretty close */
                return -1;
        }

        if (translate_pattern) {
                /*
                  for older negotiated protocols it is possible to
                  translate the pattern to produce a "new style"
                  pattern that exactly matches w2k behaviour
                */
                for (i=0;p[i];i++) {
                        if (p[i] == UCS2_CHAR('?')) {
                                p[i] = UCS2_CHAR('>');
                        } else if (p[i] == UCS2_CHAR('.') && 
                                   (p[i+1] == UCS2_CHAR('?') || 
                                    p[i+1] == UCS2_CHAR('*') ||
                                    p[i+1] == 0)) {
                                p[i] = UCS2_CHAR('"');
                        } else if (p[i] == UCS2_CHAR('*') && p[i+1] == UCS2_CHAR('.')) {
                                p[i] = UCS2_CHAR('<');
                        }
                }
        }

        for (count=i=0;p[i];i++) {
                if (p[i] == UCS2_CHAR('*') || p[i] == UCS2_CHAR('<')) count++;
        }

        if (count != 0) {
                max_n = SMB_CALLOC_ARRAY(struct max_n, count);
                if (!max_n) {
                        return -1;
                }
        }

        ret = ms_fnmatch_core(p, s, max_n, strrchr_w(s, UCS2_CHAR('.')), is_case_sensitive);

        if (max_n) {
                free(max_n);
        }

        return ret;
}

int gen_fnmatch	(	const char *	pattern,
		const char *	string
	)

ms_fnmatch.c の 224 行で定義されています。

参照先 ms_fnmatch()・PROTOCOL_NT1.

参照元 file_find()・interpret_interface().

{
        return ms_fnmatch(pattern, string, PROTOCOL_NT1, False);
}

---