glob.c revision 316958 
1/*
2 * Copyright (c) 1989 The Regents of the University of California.
3 * All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Guido van Rossum.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 *    notice, this list of conditions and the following disclaimer in the
15 *    documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 *    may be used to endorse or promote products derived from this software
18 *    without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 */
32#if defined(LIBC_SCCS) && !defined(lint)
33static char sccsid[] = "@(#)glob.c	5.12 (Berkeley) 6/24/91";
34#endif /* LIBC_SCCS and not lint */
35/*
36 * Glob: the interface is a superset of the one defined in POSIX 1003.2,
37 * draft 9.
38 *
39 * The [!...] convention to negate a range is supported (SysV, Posix, ksh).
40 *
41 * Optional extra services, controlled by flags not defined by POSIX:
42 *
43 * GLOB_QUOTE:
44 *	Escaping convention: \ inhibits any special meaning the following
45 *	character might have (except \ at end of string is retained).
46 * GLOB_MAGCHAR:
47 *	Set in gl_flags if pattern contained a globbing character.
48 * GLOB_ALTNOT:
49 *	Use ^ instead of ! for "not".
50 * gl_matchc:
51 *	Number of matches in the current invocation of glob.
52 */
53
54#ifdef WINNT_NATIVE
55	#pragma warning(disable:4244)
56#endif /* WINNT_NATIVE */
57
58#define Char __Char
59#include "sh.h"
60#include "glob.h"
61
62#ifndef HAVE_MBLEN
63#undef mblen
64#define mblen(_s,_n)	mbrlen((_s),(_n),NULL)
65#endif
66
67#undef Char
68#undef QUOTE
69#undef TILDE
70#undef META
71#undef ismeta
72#undef Strchr
73
74#ifndef S_ISDIR
75#define S_ISDIR(a)	(((a) & S_IFMT) == S_IFDIR)
76#endif
77
78#if !defined(S_ISLNK) && defined(S_IFLNK)
79#define S_ISLNK(a)	(((a) & S_IFMT) == S_IFLNK)
80#endif
81
82#if !defined(S_ISLNK) && !defined(lstat)
83#define lstat stat
84#endif
85
86typedef unsigned short Char;
87
88static	int	 glob1 		(Char *, glob_t *, int);
89static	int	 glob2		(struct strbuf *, const Char *, glob_t *, int);
90static	int	 glob3		(struct strbuf *, const Char *, const Char *,
91				 const Char *, glob_t *, int);
92static	void	 globextend	(const char *, glob_t *);
93static	int	 match		(const char *, const Char *, const Char *,
94				 int);
95static	int	 compare	(const void *, const void *);
96static 	DIR	*Opendir	(const char *);
97#ifdef S_IFLNK
98static	int	 Lstat		(const char *, struct stat *);
99#endif
100static	int	 Stat		(const char *, struct stat *sb);
101static 	Char 	*Strchr		(Char *, int);
102#ifdef DEBUG
103static	void	 qprintf	(const Char *);
104#endif
105
106#define	DOLLAR		'$'
107#define	DOT		'.'
108#define	EOS		'\0'
109#define	LBRACKET	'['
110#define	NOT		'!'
111#define ALTNOT		'^'
112#define	QUESTION	'?'
113#define	QUOTE		'\\'
114#define	RANGE		'-'
115#define	RBRACKET	']'
116#define	SEP		'/'
117#define	STAR		'*'
118#define	TILDE		'~'
119#define	UNDERSCORE	'_'
120
121#define	M_META		0x8000
122#define M_PROTECT	0x4000
123#define	M_MASK		0xffff
124#define	M_ASCII		0x00ff
125
126#define	LCHAR(c)	((c)&M_ASCII)
127#define	META(c)		((c)|M_META)
128#define	M_ALL		META('*')
129#define	M_END		META(']')
130#define	M_NOT		META('!')
131#define	M_ALTNOT	META('^')
132#define	M_ONE		META('?')
133#define	M_RNG		META('-')
134#define	M_SET		META('[')
135#define	ismeta(c)	(((c)&M_META) != 0)
136
137int
138globcharcoll(__Char c1, __Char c2, int cs)
139{
140#if defined(NLS) && defined(LC_COLLATE) && defined(HAVE_STRCOLL)
141# if defined(WIDE_STRINGS)
142    wchar_t s1[2], s2[2];
143
144    if (c1 == c2)
145	return (0);
146    if (cs) {
147	c1 = towlower(c1);
148	c2 = towlower(c2);
149    } else {
150	/* This should not be here, but I'll rather leave it in than engage in
151	   a LC_COLLATE flamewar about a shell I don't use... */
152	if (iswlower(c1) && iswupper(c2))
153	    return (1);
154	if (iswupper(c1) && iswlower(c2))
155	    return (-1);
156    }
157    s1[0] = c1;
158    s2[0] = c2;
159    s1[1] = s2[1] = '\0';
160    return wcscoll(s1, s2);
161# else /* not WIDE_STRINGS */
162    char s1[2], s2[2];
163
164    if (c1 == c2)
165	return (0);
166    /*
167     * From kevin lyda <kevin@suberic.net>:
168     * strcoll does not guarantee case sorting, so we pre-process now:
169     */
170    if (cs) {
171	c1 = islower(c1) ? c1 : tolower(c1);
172	c2 = islower(c2) ? c2 : tolower(c2);
173    } else {
174	if (islower(c1) && isupper(c2))
175	    return (1);
176	if (isupper(c1) && islower(c2))
177	    return (-1);
178    }
179    s1[0] = c1;
180    s2[0] = c2;
181    s1[1] = s2[1] = '\0';
182    return strcoll(s1, s2);
183# endif
184#else
185    return (c1 - c2);
186#endif
187}
188
189/*
190 * Need to dodge two kernel bugs:
191 * opendir("") != opendir(".")
192 * NAMEI_BUG: on plain files trailing slashes are ignored in some kernels.
193 *            POSIX specifies that they should be ignored in directories.
194 */
195
196static DIR *
197Opendir(const char *str)
198{
199#if defined(hpux) || defined(__hpux)
200    struct stat st;
201#endif
202
203    if (!*str)
204	return (opendir("."));
205#if defined(hpux) || defined(__hpux)
206    /*
207     * Opendir on some device files hangs, so avoid it
208     */
209    if (stat(str, &st) == -1 || !S_ISDIR(st.st_mode))
210	return NULL;
211#endif
212    return opendir(str);
213}
214
215#ifdef S_IFLNK
216static int
217Lstat(const char *fn, struct stat *sb)
218{
219    int st;
220
221    st = lstat(fn, sb);
222# ifdef NAMEI_BUG
223    if (*fn != 0 && strend(fn)[-1] == '/' && !S_ISDIR(sb->st_mode))
224	st = -1;
225# endif	/* NAMEI_BUG */
226    return st;
227}
228#else
229#define Lstat Stat
230#endif /* S_IFLNK */
231
232static int
233Stat(const char *fn, struct stat *sb)
234{
235    int st;
236
237    st = stat(fn, sb);
238#ifdef NAMEI_BUG
239    if (*fn != 0 && strend(fn)[-1] == '/' && !S_ISDIR(sb->st_mode))
240	st = -1;
241#endif /* NAMEI_BUG */
242    return st;
243}
244
245static Char *
246Strchr(Char *str, int ch)
247{
248    do
249	if (*str == ch)
250	    return (str);
251    while (*str++);
252    return (NULL);
253}
254
255#ifdef DEBUG
256static void
257qprintf(const Char *s)
258{
259    const Char *p;
260
261    for (p = s; *p; p++)
262	printf("%c", *p & 0xff);
263    printf("\n");
264    for (p = s; *p; p++)
265	printf("%c", *p & M_PROTECT ? '"' : ' ');
266    printf("\n");
267    for (p = s; *p; p++)
268	printf("%c", *p & M_META ? '_' : ' ');
269    printf("\n");
270}
271#endif /* DEBUG */
272
273static int
274compare(const void *p, const void *q)
275{
276#if defined(NLS) && defined(HAVE_STRCOLL)
277    return (strcoll(*(char *const *) p, *(char *const *) q));
278#else
279    return (strcmp(*(char *const *) p, *(char *const *) q));
280#endif /* NLS && HAVE_STRCOLL */
281}
282
283/*
284 * The main glob() routine: compiles the pattern (optionally processing
285 * quotes), calls glob1() to do the real pattern matching, and finally
286 * sorts the list (unless unsorted operation is requested).  Returns 0
287 * if things went well, nonzero if errors occurred.  It is not an error
288 * to find no matches.
289 */
290int
291glob(const char *pattern, int flags, int (*errfunc) (const char *, int),
292     glob_t *pglob)
293{
294    int     err, oldpathc;
295    Char *bufnext, m_not;
296    const unsigned char *patnext;
297    int     c, not;
298    Char *qpatnext, *patbuf;
299    int     no_match;
300
301    patnext = (const unsigned char *) pattern;
302    if (!(flags & GLOB_APPEND)) {
303	pglob->gl_pathc = 0;
304	pglob->gl_pathv = NULL;
305	if (!(flags & GLOB_DOOFFS))
306	    pglob->gl_offs = 0;
307    }
308    pglob->gl_flags = flags & ~GLOB_MAGCHAR;
309    pglob->gl_errfunc = errfunc;
310    oldpathc = pglob->gl_pathc;
311    pglob->gl_matchc = 0;
312
313    if (pglob->gl_flags & GLOB_ALTNOT) {
314	not = ALTNOT;
315	m_not = M_ALTNOT;
316    }
317    else {
318	not = NOT;
319	m_not = M_NOT;
320    }
321
322    patbuf = xmalloc((strlen(pattern) + 1) * sizeof(*patbuf));
323    bufnext = patbuf;
324
325    no_match = *patnext == not;
326    if (no_match)
327	patnext++;
328
329    if (flags & GLOB_QUOTE) {
330	/* Protect the quoted characters */
331	while ((c = *patnext++) != EOS) {
332#ifdef WIDE_STRINGS
333	    int len;
334
335	    len = mblen((const char *)(patnext - 1), MB_LEN_MAX);
336	    if (len == -1)
337		TCSH_IGNORE(mblen(NULL, 0));
338	    else if (len > 1) {
339		*bufnext++ = (Char) c;
340		while (--len != 0)
341		    *bufnext++ = (Char) (*patnext++ | M_PROTECT);
342	    } else
343#endif /* WIDE_STRINGS */
344	    if (c == QUOTE) {
345		if ((c = *patnext++) == EOS) {
346		    c = QUOTE;
347		    --patnext;
348		}
349		*bufnext++ = (Char) (c | M_PROTECT);
350	    }
351	    else
352		*bufnext++ = (Char) c;
353	}
354    }
355    else
356	while ((c = *patnext++) != EOS)
357	    *bufnext++ = (Char) c;
358    *bufnext = EOS;
359
360    bufnext = patbuf;
361    qpatnext = patbuf;
362    while ((c = *qpatnext++) != EOS) {
363	switch (c) {
364	case LBRACKET:
365	    c = *qpatnext;
366	    if (c == not)
367		++qpatnext;
368	    if (*qpatnext == EOS ||
369		Strchr(qpatnext + 1, RBRACKET) == NULL) {
370		*bufnext++ = LBRACKET;
371		if (c == not)
372		    --qpatnext;
373		break;
374	    }
375	    pglob->gl_flags |= GLOB_MAGCHAR;
376	    *bufnext++ = M_SET;
377	    if (c == not)
378		*bufnext++ = m_not;
379	    c = *qpatnext++;
380	    do {
381		*bufnext++ = LCHAR(c);
382		if (*qpatnext == RANGE &&
383		    (c = qpatnext[1]) != RBRACKET) {
384		    *bufnext++ = M_RNG;
385		    *bufnext++ = LCHAR(c);
386		    qpatnext += 2;
387		}
388	    } while ((c = *qpatnext++) != RBRACKET);
389	    *bufnext++ = M_END;
390	    break;
391	case QUESTION:
392	    pglob->gl_flags |= GLOB_MAGCHAR;
393	    *bufnext++ = M_ONE;
394	    break;
395	case STAR:
396	    pglob->gl_flags |= GLOB_MAGCHAR;
397	    /* collapse adjacent stars to one [or three if globstar],
398	     * to avoid exponential behavior
399	     */
400	    if (bufnext == patbuf || bufnext[-1] != M_ALL ||
401	       ((flags & GLOB_STAR) != 0 &&
402		 (bufnext - 1 == patbuf || bufnext[-2] != M_ALL ||
403		 bufnext - 2 == patbuf || bufnext[-3] != M_ALL)))
404		*bufnext++ = M_ALL;
405	    break;
406	default:
407	    *bufnext++ = LCHAR(c);
408	    break;
409	}
410    }
411    *bufnext = EOS;
412#ifdef DEBUG
413    qprintf(patbuf);
414#endif
415
416    if ((err = glob1(patbuf, pglob, no_match)) != 0) {
417	xfree(patbuf);
418	return (err);
419    }
420
421    /*
422     * If there was no match we are going to append the pattern
423     * if GLOB_NOCHECK was specified or if GLOB_NOMAGIC was specified
424     * and the pattern did not contain any magic characters
425     * GLOB_NOMAGIC is there just for compatibility with csh.
426     */
427    if (pglob->gl_pathc == oldpathc &&
428	((flags & GLOB_NOCHECK) ||
429	 ((flags & GLOB_NOMAGIC) && !(pglob->gl_flags & GLOB_MAGCHAR)))) {
430	if (!(flags & GLOB_QUOTE))
431	    globextend(pattern, pglob);
432	else {
433	    char *copy, *dest;
434	    const char *src;
435
436	    /* copy pattern, interpreting quotes */
437	    copy = xmalloc(strlen(pattern) + 1);
438	    dest = copy;
439	    src = pattern;
440	    while (*src != EOS) {
441		/* Don't interpret quotes. The spec does not say we should do */
442		if (*src == QUOTE) {
443		    if (*++src == EOS)
444			--src;
445		}
446		*dest++ = *src++;
447	    }
448	    *dest = EOS;
449	    globextend(copy, pglob);
450	    xfree(copy);
451	}
452	xfree(patbuf);
453	return 0;
454    }
455    else if (!(flags & GLOB_NOSORT) && (pglob->gl_pathc != oldpathc))
456	qsort(pglob->gl_pathv + pglob->gl_offs + oldpathc,
457	      pglob->gl_pathc - oldpathc, sizeof(char *), compare);
458    xfree(patbuf);
459    return (0);
460}
461
462static int
463glob1(Char *pattern, glob_t *pglob, int no_match)
464{
465    struct strbuf pathbuf = strbuf_INIT;
466    int err;
467
468    /*
469     * a null pathname is invalid -- POSIX 1003.1 sect. 2.4.
470     */
471    if (*pattern == EOS)
472	return (0);
473    err = glob2(&pathbuf, pattern, pglob, no_match);
474    xfree(pathbuf.s);
475    return err;
476}
477
478/*
479 * functions glob2 and glob3 are mutually recursive; there is one level
480 * of recursion for each segment in the pattern that contains one or
481 * more meta characters.
482 */
483static int
484glob2(struct strbuf *pathbuf, const Char *pattern, glob_t *pglob, int no_match)
485{
486    struct stat sbuf;
487    int anymeta;
488    const Char *p;
489    size_t orig_len;
490
491    /*
492     * loop over pattern segments until end of pattern or until segment with
493     * meta character found.
494     */
495    anymeta = 0;
496    for (;;) {
497	if (*pattern == EOS) {	/* end of pattern? */
498	    strbuf_terminate(pathbuf);
499
500	    if (Lstat(pathbuf->s, &sbuf))
501		return (0);
502
503	    if (((pglob->gl_flags & GLOB_MARK) &&
504		 pathbuf->s[pathbuf->len - 1] != SEP) &&
505		(S_ISDIR(sbuf.st_mode)
506#ifdef S_IFLNK
507		 || (S_ISLNK(sbuf.st_mode) &&
508		     (Stat(pathbuf->s, &sbuf) == 0) &&
509		     S_ISDIR(sbuf.st_mode))
510#endif
511		 )) {
512		strbuf_append1(pathbuf, SEP);
513		strbuf_terminate(pathbuf);
514	    }
515	    ++pglob->gl_matchc;
516	    globextend(pathbuf->s, pglob);
517	    return 0;
518	}
519
520	/* find end of next segment, tentatively copy to pathbuf */
521	p = pattern;
522	orig_len = pathbuf->len;
523	while (*p != EOS && *p != SEP) {
524	    if (ismeta(*p))
525		anymeta = 1;
526	    strbuf_append1(pathbuf, *p++);
527	}
528
529	if (!anymeta) {		/* no expansion, do next segment */
530	    pattern = p;
531	    while (*pattern == SEP)
532		strbuf_append1(pathbuf, *pattern++);
533	}
534	else {			/* need expansion, recurse */
535	    pathbuf->len = orig_len;
536	    return (glob3(pathbuf, pattern, p, pattern, pglob, no_match));
537	}
538    }
539    /* NOTREACHED */
540}
541
542static size_t
543One_Char_mbtowc(__Char *pwc, const Char *s, size_t n)
544{
545#ifdef WIDE_STRINGS
546    char buf[MB_LEN_MAX], *p;
547
548    if (n > MB_LEN_MAX)
549	n = MB_LEN_MAX;
550    p = buf;
551    while (p < buf + n && (*p++ = LCHAR(*s++)) != 0)
552	;
553    return one_mbtowc(pwc, buf, n);
554#else
555    *pwc = *s & CHAR;
556    return 1;
557#endif
558}
559
560static int
561glob3(struct strbuf *pathbuf, const Char *pattern, const Char *restpattern,
562      const Char *pglobstar, glob_t *pglob, int no_match)
563{
564    DIR    *dirp;
565    struct dirent *dp;
566    struct stat sbuf;
567    int     err;
568    Char m_not = (pglob->gl_flags & GLOB_ALTNOT) ? M_ALTNOT : M_NOT;
569    size_t orig_len;
570    int globstar = 0;
571    int chase_symlinks = 0;
572    const Char *termstar = NULL;
573
574    strbuf_terminate(pathbuf);
575    orig_len = pathbuf->len;
576    errno = err = 0;
577
578    while (pglobstar < restpattern) {
579	__Char wc;
580	size_t width = One_Char_mbtowc(&wc, pglobstar, MB_LEN_MAX);
581	if ((pglobstar[0] & M_MASK) == M_ALL &&
582	    (pglobstar[width] & M_MASK) == M_ALL) {
583	    globstar = 1;
584	    chase_symlinks = (pglobstar[2 * width] & M_MASK) == M_ALL;
585	    termstar = pglobstar + (2 + chase_symlinks) * width;
586	    break;
587	}
588        pglobstar += width;
589    }
590
591    if (globstar) {
592	err = pglobstar==pattern && termstar==restpattern ?
593		*restpattern == EOS ?
594		glob2(pathbuf, restpattern - 1, pglob, no_match) :
595		glob2(pathbuf, restpattern + 1, pglob, no_match) :
596		glob3(pathbuf, pattern, restpattern, termstar, pglob, no_match);
597	if (err)
598	    return err;
599	pathbuf->len = orig_len;
600	strbuf_terminate(pathbuf);
601    }
602
603    if (*pathbuf->s && (Lstat(pathbuf->s, &sbuf) || !S_ISDIR(sbuf.st_mode)
604#ifdef S_IFLINK
605	     && ((globstar && !chase_symlinks) || !S_ISLNK(sbuf.st_mode))
606#endif
607	))
608	return 0;
609
610    if (!(dirp = Opendir(pathbuf->s))) {
611	/* todo: don't call for ENOENT or ENOTDIR? */
612	if ((pglob->gl_errfunc && (*pglob->gl_errfunc) (pathbuf->s, errno)) ||
613	    (pglob->gl_flags & GLOB_ERR))
614	    return (GLOB_ABEND);
615	else
616	    return (0);
617    }
618
619    /* search directory for matching names */
620    while ((dp = readdir(dirp)) != NULL) {
621	/* initial DOT must be matched literally */
622	if (dp->d_name[0] == DOT && *pattern != DOT)
623	    if (!(pglob->gl_flags & GLOB_DOT) || !dp->d_name[1] ||
624		(dp->d_name[1] == DOT && !dp->d_name[2]))
625		continue; /*unless globdot and not . or .. */
626	pathbuf->len = orig_len;
627	strbuf_append(pathbuf, dp->d_name);
628	strbuf_terminate(pathbuf);
629
630	if (globstar) {
631#ifdef S_IFLNK
632	    if (!chase_symlinks &&
633		(Lstat(pathbuf->s, &sbuf) || S_ISLNK(sbuf.st_mode)))
634		    continue;
635#endif
636	    if (match(pathbuf->s + orig_len, pattern, termstar,
637		(int)m_not) == no_match)
638		    continue;
639	    strbuf_append1(pathbuf, SEP);
640	    strbuf_terminate(pathbuf);
641	    if ((err = glob2(pathbuf, pglobstar, pglob, no_match)) != 0)
642		break;
643	} else {
644	    if (match(pathbuf->s + orig_len, pattern, restpattern,
645		(int) m_not) == no_match)
646		continue;
647	    if ((err = glob2(pathbuf, restpattern, pglob, no_match)) != 0)
648		break;
649	}
650    }
651    /* todo: check error from readdir? */
652    closedir(dirp);
653    return (err);
654}
655
656
657/*
658 * Extend the gl_pathv member of a glob_t structure to accomodate a new item,
659 * add the new item, and update gl_pathc.
660 *
661 * This assumes the BSD realloc, which only copies the block when its size
662 * crosses a power-of-two boundary; for v7 realloc, this would cause quadratic
663 * behavior.
664 *
665 * Return 0 if new item added, error code if memory couldn't be allocated.
666 *
667 * Invariant of the glob_t structure:
668 *	Either gl_pathc is zero and gl_pathv is NULL; or gl_pathc > 0 and
669 *	 gl_pathv points to (gl_offs + gl_pathc + 1) items.
670 */
671static void
672globextend(const char *path, glob_t *pglob)
673{
674    char **pathv;
675    int i;
676    size_t newsize;
677
678    newsize = sizeof(*pathv) * (2 + pglob->gl_pathc + pglob->gl_offs);
679    pathv = xrealloc(pglob->gl_pathv, newsize);
680
681    if (pglob->gl_pathv == NULL && pglob->gl_offs > 0) {
682	/* first time around -- clear initial gl_offs items */
683	pathv += pglob->gl_offs;
684	for (i = pglob->gl_offs; --i >= 0;)
685	    *--pathv = NULL;
686    }
687    pglob->gl_pathv = pathv;
688
689    pathv[pglob->gl_offs + pglob->gl_pathc++] = strsave(path);
690    pathv[pglob->gl_offs + pglob->gl_pathc] = NULL;
691}
692
693/*
694 * pattern matching function for filenames.  Each occurrence of the *
695 * pattern causes a recursion level.
696 */
697static  int
698match(const char *name, const Char *pat, const Char *patend, int m_not)
699{
700    int ok, negate_range;
701    Char c;
702
703    while (pat < patend) {
704	size_t lwk;
705	__Char wc, wk;
706
707	c = *pat; /* Only for M_MASK bits */
708	pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
709	lwk = one_mbtowc(&wk, name, MB_LEN_MAX);
710	switch (c & M_MASK) {
711	case M_ALL:
712	    while (pat < patend && (*pat & M_MASK) == M_ALL)  /* eat consecutive '*' */
713		pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
714	    if (pat == patend)
715	        return (1);
716	    while (!match(name, pat, patend, m_not)) {
717		if (*name == EOS)
718		    return (0);
719		name += lwk;
720		lwk = one_mbtowc(&wk, name, MB_LEN_MAX);
721	    }
722	    return (1);
723	case M_ONE:
724	    if (*name == EOS)
725		return (0);
726	    name += lwk;
727	    break;
728	case M_SET:
729	    ok = 0;
730	    if (*name == EOS)
731		return (0);
732	    name += lwk;
733	    if ((negate_range = ((*pat & M_MASK) == m_not)) != 0)
734		++pat;
735	    while ((*pat & M_MASK) != M_END) {
736		pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
737		if ((*pat & M_MASK) == M_RNG) {
738		    __Char wc2;
739
740		    pat++;
741		    pat += One_Char_mbtowc(&wc2, pat, MB_LEN_MAX);
742		    if (globcharcoll(wc, wk, 0) <= 0 &&
743			globcharcoll(wk, wc2, 0) <= 0)
744			ok = 1;
745		} else if (wc == wk)
746		    ok = 1;
747	    }
748	    pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
749	    if (ok == negate_range)
750		return (0);
751	    break;
752	default:
753	    if (*name == EOS || samecase(wk) != samecase(wc))
754		return (0);
755	    name += lwk;
756	    break;
757	}
758    }
759    return (*name == EOS);
760}
761
762/* free allocated data belonging to a glob_t structure */
763void
764globfree(glob_t *pglob)
765{
766    int i;
767    char **pp;
768
769    if (pglob->gl_pathv != NULL) {
770	pp = pglob->gl_pathv + pglob->gl_offs;
771	for (i = pglob->gl_pathc; i--; ++pp)
772	    if (*pp)
773		xfree(*pp), *pp = NULL;
774	xfree(pglob->gl_pathv), pglob->gl_pathv = NULL;
775    }
776}
777