Add note about reboot before 'make upgrade' step.
[dragonfly.git] / contrib / tcsh-6 / glob.c
blob3680403288159439c3b74039e07e3f9e45418b70
1 /*
2 * Copyright (c) 1989 The Regents of the University of California.
3 * All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Guido van Rossum.
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.
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.
32 #if defined(LIBC_SCCS) && !defined(lint)
33 static char sccsid[] = "@(#)glob.c 5.12 (Berkeley) 6/24/91";
34 #endif /* LIBC_SCCS and not lint */
36 * Glob: the interface is a superset of the one defined in POSIX 1003.2,
37 * draft 9.
39 * The [!...] convention to negate a range is supported (SysV, Posix, ksh).
41 * Optional extra services, controlled by flags not defined by POSIX:
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.
54 #ifdef WINNT_NATIVE
55 #pragma warning(disable:4244)
56 #endif /* WINNT_NATIVE */
58 #define Char __Char
59 #include "sh.h"
60 #include "glob.h"
62 #undef Char
63 #undef QUOTE
64 #undef TILDE
65 #undef META
66 #undef ismeta
67 #undef Strchr
69 #ifndef S_ISDIR
70 #define S_ISDIR(a) (((a) & S_IFMT) == S_IFDIR)
71 #endif
73 #if !defined(S_ISLNK) && defined(S_IFLNK)
74 #define S_ISLNK(a) (((a) & S_IFMT) == S_IFLNK)
75 #endif
77 #if !defined(S_ISLNK) && !defined(lstat)
78 #define lstat stat
79 #endif
81 typedef unsigned short Char;
83 static int glob1 (Char *, glob_t *, int);
84 static int glob2 (struct strbuf *, const Char *, glob_t *, int);
85 static int glob3 (struct strbuf *, const Char *, const Char *,
86 const Char *, glob_t *, int);
87 static void globextend (const char *, glob_t *);
88 static int match (const char *, const Char *, const Char *,
89 int);
90 static int compare (const void *, const void *);
91 static DIR *Opendir (const char *);
92 #ifdef S_IFLNK
93 static int Lstat (const char *, struct stat *);
94 #endif
95 static int Stat (const char *, struct stat *sb);
96 static Char *Strchr (Char *, int);
97 #ifdef DEBUG
98 static void qprintf (const Char *);
99 #endif
101 #define DOLLAR '$'
102 #define DOT '.'
103 #define EOS '\0'
104 #define LBRACKET '['
105 #define NOT '!'
106 #define ALTNOT '^'
107 #define QUESTION '?'
108 #define QUOTE '\\'
109 #define RANGE '-'
110 #define RBRACKET ']'
111 #define SEP '/'
112 #define STAR '*'
113 #define TILDE '~'
114 #define UNDERSCORE '_'
116 #define M_META 0x8000
117 #define M_PROTECT 0x4000
118 #define M_MASK 0xffff
119 #define M_ASCII 0x00ff
121 #define LCHAR(c) ((c)&M_ASCII)
122 #define META(c) ((c)|M_META)
123 #define M_ALL META('*')
124 #define M_END META(']')
125 #define M_NOT META('!')
126 #define M_ALTNOT META('^')
127 #define M_ONE META('?')
128 #define M_RNG META('-')
129 #define M_SET META('[')
130 #define ismeta(c) (((c)&M_META) != 0)
133 globcharcoll(__Char c1, __Char c2, int cs)
135 #if defined(NLS) && defined(LC_COLLATE) && defined(HAVE_STRCOLL)
136 # if defined(WIDE_STRINGS)
137 wchar_t s1[2], s2[2];
139 if (c1 == c2)
140 return (0);
141 if (cs) {
142 c1 = towlower(c1);
143 c2 = towlower(c2);
144 } else {
145 /* This should not be here, but I'll rather leave it in than engage in
146 a LC_COLLATE flamewar about a shell I don't use... */
147 if (iswlower(c1) && iswupper(c2))
148 return (1);
149 if (iswupper(c1) && iswlower(c2))
150 return (-1);
152 s1[0] = c1;
153 s2[0] = c2;
154 s1[1] = s2[1] = '\0';
155 return wcscoll(s1, s2);
156 # else /* not WIDE_STRINGS */
157 char s1[2], s2[2];
159 if (c1 == c2)
160 return (0);
162 * From kevin lyda <kevin@suberic.net>:
163 * strcoll does not guarantee case sorting, so we pre-process now:
165 if (cs) {
166 c1 = islower(c1) ? c1 : tolower(c1);
167 c2 = islower(c2) ? c2 : tolower(c2);
168 } else {
169 if (islower(c1) && isupper(c2))
170 return (1);
171 if (isupper(c1) && islower(c2))
172 return (-1);
174 s1[0] = c1;
175 s2[0] = c2;
176 s1[1] = s2[1] = '\0';
177 return strcoll(s1, s2);
178 # endif
179 #else
180 return (c1 - c2);
181 #endif
185 * Need to dodge two kernel bugs:
186 * opendir("") != opendir(".")
187 * NAMEI_BUG: on plain files trailing slashes are ignored in some kernels.
188 * POSIX specifies that they should be ignored in directories.
191 static DIR *
192 Opendir(const char *str)
194 #if defined(hpux) || defined(__hpux)
195 struct stat st;
196 #endif
198 if (!*str)
199 return (opendir("."));
200 #if defined(hpux) || defined(__hpux)
202 * Opendir on some device files hangs, so avoid it
204 if (stat(str, &st) == -1 || !S_ISDIR(st.st_mode))
205 return NULL;
206 #endif
207 return opendir(str);
210 #ifdef S_IFLNK
211 static int
212 Lstat(const char *fn, struct stat *sb)
214 int st;
216 st = lstat(fn, sb);
217 # ifdef NAMEI_BUG
218 if (*fn != 0 && strend(fn)[-1] == '/' && !S_ISDIR(sb->st_mode))
219 st = -1;
220 # endif /* NAMEI_BUG */
221 return st;
223 #else
224 #define Lstat Stat
225 #endif /* S_IFLNK */
227 static int
228 Stat(const char *fn, struct stat *sb)
230 int st;
232 st = stat(fn, sb);
233 #ifdef NAMEI_BUG
234 if (*fn != 0 && strend(fn)[-1] == '/' && !S_ISDIR(sb->st_mode))
235 st = -1;
236 #endif /* NAMEI_BUG */
237 return st;
240 static Char *
241 Strchr(Char *str, int ch)
244 if (*str == ch)
245 return (str);
246 while (*str++);
247 return (NULL);
250 #ifdef DEBUG
251 static void
252 qprintf(const Char *s)
254 const Char *p;
256 for (p = s; *p; p++)
257 printf("%c", *p & 0xff);
258 printf("\n");
259 for (p = s; *p; p++)
260 printf("%c", *p & M_PROTECT ? '"' : ' ');
261 printf("\n");
262 for (p = s; *p; p++)
263 printf("%c", *p & M_META ? '_' : ' ');
264 printf("\n");
266 #endif /* DEBUG */
268 static int
269 compare(const void *p, const void *q)
271 #if defined(NLS) && defined(HAVE_STRCOLL)
272 return (strcoll(*(char *const *) p, *(char *const *) q));
273 #else
274 return (strcmp(*(char *const *) p, *(char *const *) q));
275 #endif /* NLS && HAVE_STRCOLL */
279 * The main glob() routine: compiles the pattern (optionally processing
280 * quotes), calls glob1() to do the real pattern matching, and finally
281 * sorts the list (unless unsorted operation is requested). Returns 0
282 * if things went well, nonzero if errors occurred. It is not an error
283 * to find no matches.
286 glob(const char *pattern, int flags, int (*errfunc) (const char *, int),
287 glob_t *pglob)
289 int err, oldpathc;
290 Char *bufnext, m_not;
291 const unsigned char *patnext;
292 int c, not;
293 Char *qpatnext, *patbuf;
294 int no_match;
296 patnext = (const unsigned char *) pattern;
297 if (!(flags & GLOB_APPEND)) {
298 pglob->gl_pathc = 0;
299 pglob->gl_pathv = NULL;
300 if (!(flags & GLOB_DOOFFS))
301 pglob->gl_offs = 0;
303 pglob->gl_flags = flags & ~GLOB_MAGCHAR;
304 pglob->gl_errfunc = errfunc;
305 oldpathc = pglob->gl_pathc;
306 pglob->gl_matchc = 0;
308 if (pglob->gl_flags & GLOB_ALTNOT) {
309 not = ALTNOT;
310 m_not = M_ALTNOT;
312 else {
313 not = NOT;
314 m_not = M_NOT;
317 patbuf = xmalloc((strlen(pattern) + 1) * sizeof(*patbuf));
318 bufnext = patbuf;
320 no_match = *patnext == not;
321 if (no_match)
322 patnext++;
324 if (flags & GLOB_QUOTE) {
325 /* Protect the quoted characters */
326 while ((c = *patnext++) != EOS) {
327 #ifdef WIDE_STRINGS
328 int len;
330 len = mblen((const char *)(patnext - 1), MB_LEN_MAX);
331 if (len == -1)
332 TCSH_IGNORE(mblen(NULL, 0));
333 else if (len > 1) {
334 *bufnext++ = (Char) c;
335 while (--len != 0)
336 *bufnext++ = (Char) (*patnext++ | M_PROTECT);
337 } else
338 #endif /* WIDE_STRINGS */
339 if (c == QUOTE) {
340 if ((c = *patnext++) == EOS) {
341 c = QUOTE;
342 --patnext;
344 *bufnext++ = (Char) (c | M_PROTECT);
346 else
347 *bufnext++ = (Char) c;
350 else
351 while ((c = *patnext++) != EOS)
352 *bufnext++ = (Char) c;
353 *bufnext = EOS;
355 bufnext = patbuf;
356 qpatnext = patbuf;
357 while ((c = *qpatnext++) != EOS) {
358 switch (c) {
359 case LBRACKET:
360 c = *qpatnext;
361 if (c == not)
362 ++qpatnext;
363 if (*qpatnext == EOS ||
364 Strchr(qpatnext + 1, RBRACKET) == NULL) {
365 *bufnext++ = LBRACKET;
366 if (c == not)
367 --qpatnext;
368 break;
370 pglob->gl_flags |= GLOB_MAGCHAR;
371 *bufnext++ = M_SET;
372 if (c == not)
373 *bufnext++ = m_not;
374 c = *qpatnext++;
375 do {
376 *bufnext++ = LCHAR(c);
377 if (*qpatnext == RANGE &&
378 (c = qpatnext[1]) != RBRACKET) {
379 *bufnext++ = M_RNG;
380 *bufnext++ = LCHAR(c);
381 qpatnext += 2;
383 } while ((c = *qpatnext++) != RBRACKET);
384 *bufnext++ = M_END;
385 break;
386 case QUESTION:
387 pglob->gl_flags |= GLOB_MAGCHAR;
388 *bufnext++ = M_ONE;
389 break;
390 case STAR:
391 pglob->gl_flags |= GLOB_MAGCHAR;
392 /* collapse adjacent stars to one [or three if globstar],
393 * to avoid exponential behavior
395 if (bufnext == patbuf || bufnext[-1] != M_ALL ||
396 ((flags & GLOB_STAR) != 0 &&
397 (bufnext - 1 == patbuf || bufnext[-2] != M_ALL ||
398 bufnext - 2 == patbuf || bufnext[-3] != M_ALL)))
399 *bufnext++ = M_ALL;
400 break;
401 default:
402 *bufnext++ = LCHAR(c);
403 break;
406 *bufnext = EOS;
407 #ifdef DEBUG
408 qprintf(patbuf);
409 #endif
411 if ((err = glob1(patbuf, pglob, no_match)) != 0) {
412 xfree(patbuf);
413 return (err);
417 * If there was no match we are going to append the pattern
418 * if GLOB_NOCHECK was specified or if GLOB_NOMAGIC was specified
419 * and the pattern did not contain any magic characters
420 * GLOB_NOMAGIC is there just for compatibility with csh.
422 if (pglob->gl_pathc == oldpathc &&
423 ((flags & GLOB_NOCHECK) ||
424 ((flags & GLOB_NOMAGIC) && !(pglob->gl_flags & GLOB_MAGCHAR)))) {
425 if (!(flags & GLOB_QUOTE))
426 globextend(pattern, pglob);
427 else {
428 char *copy, *dest;
429 const char *src;
431 /* copy pattern, interpreting quotes */
432 copy = xmalloc(strlen(pattern) + 1);
433 dest = copy;
434 src = pattern;
435 while (*src != EOS) {
436 if (*src == QUOTE) {
437 if (*++src == EOS)
438 --src;
440 *dest++ = *src++;
442 *dest = EOS;
443 globextend(copy, pglob);
444 xfree(copy);
446 xfree(patbuf);
447 return 0;
449 else if (!(flags & GLOB_NOSORT) && (pglob->gl_pathc != oldpathc))
450 qsort(pglob->gl_pathv + pglob->gl_offs + oldpathc,
451 pglob->gl_pathc - oldpathc, sizeof(char *), compare);
452 xfree(patbuf);
453 return (0);
456 static int
457 glob1(Char *pattern, glob_t *pglob, int no_match)
459 struct strbuf pathbuf = strbuf_INIT;
460 int err;
463 * a null pathname is invalid -- POSIX 1003.1 sect. 2.4.
465 if (*pattern == EOS)
466 return (0);
467 err = glob2(&pathbuf, pattern, pglob, no_match);
468 xfree(pathbuf.s);
469 return err;
473 * functions glob2 and glob3 are mutually recursive; there is one level
474 * of recursion for each segment in the pattern that contains one or
475 * more meta characters.
477 static int
478 glob2(struct strbuf *pathbuf, const Char *pattern, glob_t *pglob, int no_match)
480 struct stat sbuf;
481 int anymeta;
482 const Char *p;
483 size_t orig_len;
486 * loop over pattern segments until end of pattern or until segment with
487 * meta character found.
489 anymeta = 0;
490 for (;;) {
491 if (*pattern == EOS) { /* end of pattern? */
492 strbuf_terminate(pathbuf);
494 if (Lstat(pathbuf->s, &sbuf))
495 return (0);
497 if (((pglob->gl_flags & GLOB_MARK) &&
498 pathbuf->s[pathbuf->len - 1] != SEP) &&
499 (S_ISDIR(sbuf.st_mode)
500 #ifdef S_IFLNK
501 || (S_ISLNK(sbuf.st_mode) &&
502 (Stat(pathbuf->s, &sbuf) == 0) &&
503 S_ISDIR(sbuf.st_mode))
504 #endif
505 )) {
506 strbuf_append1(pathbuf, SEP);
507 strbuf_terminate(pathbuf);
509 ++pglob->gl_matchc;
510 globextend(pathbuf->s, pglob);
511 return 0;
514 /* find end of next segment, tentatively copy to pathbuf */
515 p = pattern;
516 orig_len = pathbuf->len;
517 while (*p != EOS && *p != SEP) {
518 if (ismeta(*p))
519 anymeta = 1;
520 strbuf_append1(pathbuf, *p++);
523 if (!anymeta) { /* no expansion, do next segment */
524 pattern = p;
525 while (*pattern == SEP)
526 strbuf_append1(pathbuf, *pattern++);
528 else { /* need expansion, recurse */
529 pathbuf->len = orig_len;
530 return (glob3(pathbuf, pattern, p, pattern, pglob, no_match));
533 /* NOTREACHED */
536 static size_t
537 One_Char_mbtowc(__Char *pwc, const Char *s, size_t n)
539 #ifdef WIDE_STRINGS
540 char buf[MB_LEN_MAX], *p;
542 if (n > MB_LEN_MAX)
543 n = MB_LEN_MAX;
544 p = buf;
545 while (p < buf + n && (*p++ = LCHAR(*s++)) != 0)
547 return one_mbtowc(pwc, buf, n);
548 #else
549 *pwc = *s & CHAR;
550 return 1;
551 #endif
554 static int
555 glob3(struct strbuf *pathbuf, const Char *pattern, const Char *restpattern,
556 const Char *pglobstar, glob_t *pglob, int no_match)
558 DIR *dirp;
559 struct dirent *dp;
560 struct stat sbuf;
561 int err;
562 Char m_not = (pglob->gl_flags & GLOB_ALTNOT) ? M_ALTNOT : M_NOT;
563 size_t orig_len;
564 int globstar = 0;
565 int chase_symlinks = 0;
566 const Char *termstar = NULL;
568 strbuf_terminate(pathbuf);
569 orig_len = pathbuf->len;
570 errno = err = 0;
572 while (pglobstar < restpattern) {
573 __Char wc;
574 size_t width = One_Char_mbtowc(&wc, pglobstar, MB_LEN_MAX);
575 if ((pglobstar[0] & M_MASK) == M_ALL &&
576 (pglobstar[width] & M_MASK) == M_ALL) {
577 globstar = 1;
578 chase_symlinks = (pglobstar[2 * width] & M_MASK) == M_ALL;
579 termstar = pglobstar + (2 + chase_symlinks) * width;
580 break;
582 pglobstar += width;
585 if (globstar) {
586 err = pglobstar==pattern && termstar==restpattern ?
587 *restpattern == EOS ?
588 glob2(pathbuf, restpattern - 1, pglob, no_match) :
589 glob2(pathbuf, restpattern + 1, pglob, no_match) :
590 glob3(pathbuf, pattern, restpattern, termstar, pglob, no_match);
591 if (err)
592 return err;
593 pathbuf->len = orig_len;
594 strbuf_terminate(pathbuf);
597 if (*pathbuf->s && (Lstat(pathbuf->s, &sbuf) || !S_ISDIR(sbuf.st_mode)
598 #ifdef S_IFLINK
599 && ((globstar && !chase_symlinks) || !S_ISLNK(sbuf.st_mode))
600 #endif
602 return 0;
604 if (!(dirp = Opendir(pathbuf->s))) {
605 /* todo: don't call for ENOENT or ENOTDIR? */
606 if ((pglob->gl_errfunc && (*pglob->gl_errfunc) (pathbuf->s, errno)) ||
607 (pglob->gl_flags & GLOB_ERR))
608 return (GLOB_ABEND);
609 else
610 return (0);
613 /* search directory for matching names */
614 while ((dp = readdir(dirp)) != NULL) {
615 /* initial DOT must be matched literally */
616 if (dp->d_name[0] == DOT && *pattern != DOT)
617 if (!(pglob->gl_flags & GLOB_DOT) || !dp->d_name[1] ||
618 (dp->d_name[1] == DOT && !dp->d_name[2]))
619 continue; /*unless globdot and not . or .. */
620 pathbuf->len = orig_len;
621 strbuf_append(pathbuf, dp->d_name);
622 strbuf_terminate(pathbuf);
624 if (globstar) {
625 #ifdef S_IFLNK
626 if (!chase_symlinks &&
627 (Lstat(pathbuf->s, &sbuf) || S_ISLNK(sbuf.st_mode)))
628 continue;
629 #endif
630 if (match(pathbuf->s + orig_len, pattern, termstar,
631 (int)m_not) == no_match)
632 continue;
633 strbuf_append1(pathbuf, SEP);
634 strbuf_terminate(pathbuf);
635 if ((err = glob2(pathbuf, pglobstar, pglob, no_match)) != 0)
636 break;
637 } else {
638 if (match(pathbuf->s + orig_len, pattern, restpattern,
639 (int) m_not) == no_match)
640 continue;
641 if ((err = glob2(pathbuf, restpattern, pglob, no_match)) != 0)
642 break;
645 /* todo: check error from readdir? */
646 closedir(dirp);
647 return (err);
652 * Extend the gl_pathv member of a glob_t structure to accomodate a new item,
653 * add the new item, and update gl_pathc.
655 * This assumes the BSD realloc, which only copies the block when its size
656 * crosses a power-of-two boundary; for v7 realloc, this would cause quadratic
657 * behavior.
659 * Return 0 if new item added, error code if memory couldn't be allocated.
661 * Invariant of the glob_t structure:
662 * Either gl_pathc is zero and gl_pathv is NULL; or gl_pathc > 0 and
663 * gl_pathv points to (gl_offs + gl_pathc + 1) items.
665 static void
666 globextend(const char *path, glob_t *pglob)
668 char **pathv;
669 int i;
670 size_t newsize;
672 newsize = sizeof(*pathv) * (2 + pglob->gl_pathc + pglob->gl_offs);
673 pathv = xrealloc(pglob->gl_pathv, newsize);
675 if (pglob->gl_pathv == NULL && pglob->gl_offs > 0) {
676 /* first time around -- clear initial gl_offs items */
677 pathv += pglob->gl_offs;
678 for (i = pglob->gl_offs; --i >= 0;)
679 *--pathv = NULL;
681 pglob->gl_pathv = pathv;
683 pathv[pglob->gl_offs + pglob->gl_pathc++] = strsave(path);
684 pathv[pglob->gl_offs + pglob->gl_pathc] = NULL;
688 * pattern matching function for filenames. Each occurrence of the *
689 * pattern causes a recursion level.
691 static int
692 match(const char *name, const Char *pat, const Char *patend, int m_not)
694 int ok, negate_range;
695 Char c;
697 while (pat < patend) {
698 size_t lwk;
699 __Char wc, wk;
701 c = *pat; /* Only for M_MASK bits */
702 pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
703 lwk = one_mbtowc(&wk, name, MB_LEN_MAX);
704 switch (c & M_MASK) {
705 case M_ALL:
706 while (pat < patend && (*pat & M_MASK) == M_ALL) /* eat consecutive '*' */
707 pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
708 if (pat == patend)
709 return (1);
710 while (!match(name, pat, patend, m_not)) {
711 if (*name == EOS)
712 return (0);
713 name += lwk;
714 lwk = one_mbtowc(&wk, name, MB_LEN_MAX);
716 return (1);
717 case M_ONE:
718 if (*name == EOS)
719 return (0);
720 name += lwk;
721 break;
722 case M_SET:
723 ok = 0;
724 if (*name == EOS)
725 return (0);
726 name += lwk;
727 if ((negate_range = ((*pat & M_MASK) == m_not)) != 0)
728 ++pat;
729 while ((*pat & M_MASK) != M_END) {
730 pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
731 if ((*pat & M_MASK) == M_RNG) {
732 __Char wc2;
734 pat++;
735 pat += One_Char_mbtowc(&wc2, pat, MB_LEN_MAX);
736 if (globcharcoll(wc, wk, 0) <= 0 &&
737 globcharcoll(wk, wc2, 0) <= 0)
738 ok = 1;
739 } else if (wc == wk)
740 ok = 1;
742 pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
743 if (ok == negate_range)
744 return (0);
745 break;
746 default:
747 if (*name == EOS || samecase(wk) != samecase(wc))
748 return (0);
749 name += lwk;
750 break;
753 return (*name == EOS);
756 /* free allocated data belonging to a glob_t structure */
757 void
758 globfree(glob_t *pglob)
760 int i;
761 char **pp;
763 if (pglob->gl_pathv != NULL) {
764 pp = pglob->gl_pathv + pglob->gl_offs;
765 for (i = pglob->gl_pathc; i--; ++pp)
766 if (*pp)
767 xfree(*pp), *pp = NULL;
768 xfree(pglob->gl_pathv), pglob->gl_pathv = NULL;