Annotation of src/lib/libc/gen/glob.c, Revision 1.17
1.17 ! christos 1: /* $NetBSD: glob.c,v 1.16 2006/03/26 18:11:22 christos Exp $ */
1.5 cgd 2:
1.1 cgd 3: /*
1.12 christos 4: * Copyright (c) 1989, 1993
5: * The Regents of the University of California. All rights reserved.
6: *
7: * This code is derived from software contributed to Berkeley by
8: * Guido van Rossum.
9: *
10: * Redistribution and use in source and binary forms, with or without
11: * modification, are permitted provided that the following conditions
12: * are met:
13: * 1. Redistributions of source code must retain the above copyright
14: * notice, this list of conditions and the following disclaimer.
15: * 2. Redistributions in binary form must reproduce the above copyright
16: * notice, this list of conditions and the following disclaimer in the
17: * documentation and/or other materials provided with the distribution.
18: * 3. Neither the name of the University nor the names of its contributors
19: * may be used to endorse or promote products derived from this software
20: * without specific prior written permission.
21: *
22: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32: * SUCH DAMAGE.
1.1 cgd 33: */
34:
1.12 christos 35: #include <sys/cdefs.h>
36: #if defined(LIBC_SCCS) && !defined(lint)
37: #if 0
38: static char sccsid[] = "@(#)glob.c 8.3 (Berkeley) 10/13/93";
39: #else
1.17 ! christos 40: __RCSID("$NetBSD: glob.c,v 1.16 2006/03/26 18:11:22 christos Exp $");
1.12 christos 41: #endif
42: #endif /* LIBC_SCCS and not lint */
1.1 cgd 43:
1.12 christos 44: /*
45: * glob(3) -- a superset of the one defined in POSIX 1003.2.
46: *
47: * The [!...] convention to negate a range is supported (SysV, Posix, ksh).
48: *
49: * Optional extra services, controlled by flags not defined by POSIX:
50: *
51: * GLOB_MAGCHAR:
52: * Set in gl_flags if pattern contained a globbing character.
53: * GLOB_NOMAGIC:
54: * Same as GLOB_NOCHECK, but it will only append pattern if it did
55: * not contain any magic characters. [Used in csh style globbing]
56: * GLOB_ALTDIRFUNC:
57: * Use alternately specified directory access functions.
58: * GLOB_TILDE:
59: * expand ~user/foo to the /home/dir/of/user/foo
60: * GLOB_BRACE:
61: * expand {1,2}{a,b} to 1a 1b 2a 2b
62: * gl_matchc:
63: * Number of matches in the current invocation of glob.
64: */
65:
66: #include "namespace.h"
67: #include <sys/param.h>
68: #include <sys/stat.h>
69:
70: #include <assert.h>
71: #include <ctype.h>
72: #include <dirent.h>
73: #include <errno.h>
74: #include <glob.h>
75: #include <pwd.h>
76: #include <stdio.h>
77: #include <stdlib.h>
78: #include <string.h>
79: #include <unistd.h>
80:
81: #ifdef HAVE_NBTOOL_CONFIG_H
82: #define NO_GETPW_R
83: #endif
84:
85: /*
86: * XXX: For NetBSD 1.4.x compatibility. (kill me l8r)
87: */
88: #ifndef _DIAGASSERT
89: #define _DIAGASSERT(a)
90: #endif
91:
92: #define DOLLAR '$'
93: #define DOT '.'
94: #define EOS '\0'
95: #define LBRACKET '['
96: #define NOT '!'
97: #define QUESTION '?'
98: #define QUOTE '\\'
99: #define RANGE '-'
100: #define RBRACKET ']'
101: #define SEP '/'
102: #define STAR '*'
103: #define TILDE '~'
104: #define UNDERSCORE '_'
105: #define LBRACE '{'
106: #define RBRACE '}'
107: #define SLASH '/'
108: #define COMMA ','
109:
1.15 christos 110: #ifndef USE_8BIT_CHARS
1.12 christos 111:
112: #define M_QUOTE 0x8000
113: #define M_PROTECT 0x4000
114: #define M_MASK 0xffff
115: #define M_ASCII 0x00ff
116:
117: typedef u_short Char;
118:
119: #else
120:
1.15 christos 121: #define M_QUOTE (Char)0x80
122: #define M_PROTECT (Char)0x40
123: #define M_MASK (Char)0xff
124: #define M_ASCII (Char)0x7f
1.12 christos 125:
126: typedef char Char;
127:
128: #endif
129:
130:
131: #define CHAR(c) ((Char)((c)&M_ASCII))
132: #define META(c) ((Char)((c)|M_QUOTE))
133: #define M_ALL META('*')
134: #define M_END META(']')
135: #define M_NOT META('!')
136: #define M_ONE META('?')
137: #define M_RNG META('-')
138: #define M_SET META('[')
139: #define ismeta(c) (((c)&M_QUOTE) != 0)
140:
141:
142: static int compare __P((const void *, const void *));
143: static int g_Ctoc __P((const Char *, char *, size_t));
144: static int g_lstat __P((Char *, __gl_stat_t *, glob_t *));
145: static DIR *g_opendir __P((Char *, glob_t *));
146: static Char *g_strchr __P((const Char *, int));
147: static int g_stat __P((Char *, __gl_stat_t *, glob_t *));
148: static int glob0 __P((const Char *, glob_t *));
149: static int glob1 __P((Char *, glob_t *, size_t *));
150: static int glob2 __P((Char *, Char *, Char *, Char *, glob_t *,
151: size_t *));
152: static int glob3 __P((Char *, Char *, Char *, Char *, Char *, glob_t *,
153: size_t *));
154: static int globextend __P((const Char *, glob_t *, size_t *));
155: static const Char *globtilde __P((const Char *, Char *, size_t, glob_t *));
156: static int globexp1 __P((const Char *, glob_t *));
157: static int globexp2 __P((const Char *, const Char *, glob_t *, int *));
158: static int match __P((Char *, Char *, Char *));
159: #ifdef DEBUG
160: static void qprintf __P((const char *, Char *));
161: #endif
162:
163: int
164: glob(pattern, flags, errfunc, pglob)
165: const char *pattern;
166: int flags, (*errfunc) __P((const char *, int));
167: glob_t *pglob;
168: {
169: const u_char *patnext;
170: int c;
171: Char *bufnext, *bufend, patbuf[MAXPATHLEN+1];
172:
173: _DIAGASSERT(pattern != NULL);
174:
175: patnext = (const u_char *) pattern;
176: if (!(flags & GLOB_APPEND)) {
177: pglob->gl_pathc = 0;
178: pglob->gl_pathv = NULL;
179: if (!(flags & GLOB_DOOFFS))
180: pglob->gl_offs = 0;
181: }
182: pglob->gl_flags = flags & ~GLOB_MAGCHAR;
183: pglob->gl_errfunc = errfunc;
184: pglob->gl_matchc = 0;
185:
186: bufnext = patbuf;
187: bufend = bufnext + MAXPATHLEN;
188: if (flags & GLOB_NOESCAPE) {
189: while (bufnext < bufend && (c = *patnext++) != EOS)
190: *bufnext++ = c;
191: } else {
192: /* Protect the quoted characters. */
193: while (bufnext < bufend && (c = *patnext++) != EOS)
194: if (c == QUOTE) {
195: if ((c = *patnext++) == EOS) {
196: c = QUOTE;
197: --patnext;
198: }
199: *bufnext++ = c | M_PROTECT;
200: }
201: else
202: *bufnext++ = c;
203: }
204: *bufnext = EOS;
205:
206: if (flags & GLOB_BRACE)
207: return globexp1(patbuf, pglob);
208: else
209: return glob0(patbuf, pglob);
210: }
211:
212: /*
213: * Expand recursively a glob {} pattern. When there is no more expansion
214: * invoke the standard globbing routine to glob the rest of the magic
215: * characters
216: */
217: static int
218: globexp1(pattern, pglob)
219: const Char *pattern;
220: glob_t *pglob;
221: {
222: const Char* ptr = pattern;
223: int rv;
224:
225: _DIAGASSERT(pattern != NULL);
226: _DIAGASSERT(pglob != NULL);
227:
228: /* Protect a single {}, for find(1), like csh */
229: if (pattern[0] == LBRACE && pattern[1] == RBRACE && pattern[2] == EOS)
230: return glob0(pattern, pglob);
231:
232: while ((ptr = (const Char *) g_strchr(ptr, LBRACE)) != NULL)
233: if (!globexp2(ptr, pattern, pglob, &rv))
234: return rv;
235:
236: return glob0(pattern, pglob);
237: }
238:
239:
240: /*
241: * Recursive brace globbing helper. Tries to expand a single brace.
242: * If it succeeds then it invokes globexp1 with the new pattern.
243: * If it fails then it tries to glob the rest of the pattern and returns.
244: */
245: static int
246: globexp2(ptr, pattern, pglob, rv)
247: const Char *ptr, *pattern;
248: glob_t *pglob;
249: int *rv;
250: {
251: int i;
252: Char *lm, *ls;
253: const Char *pe, *pm, *pl;
254: Char patbuf[MAXPATHLEN + 1];
255:
256: _DIAGASSERT(ptr != NULL);
257: _DIAGASSERT(pattern != NULL);
258: _DIAGASSERT(pglob != NULL);
259: _DIAGASSERT(rv != NULL);
260:
261: /* copy part up to the brace */
262: for (lm = patbuf, pm = pattern; pm != ptr; *lm++ = *pm++)
263: continue;
264: ls = lm;
265:
266: /* Find the balanced brace */
267: for (i = 0, pe = ++ptr; *pe; pe++)
268: if (*pe == LBRACKET) {
269: /* Ignore everything between [] */
270: for (pm = pe++; *pe != RBRACKET && *pe != EOS; pe++)
271: continue;
272: if (*pe == EOS) {
273: /*
274: * We could not find a matching RBRACKET.
275: * Ignore and just look for RBRACE
276: */
277: pe = pm;
278: }
279: }
280: else if (*pe == LBRACE)
281: i++;
282: else if (*pe == RBRACE) {
283: if (i == 0)
284: break;
285: i--;
286: }
287:
288: /* Non matching braces; just glob the pattern */
289: if (i != 0 || *pe == EOS) {
290: /*
291: * we use `pattern', not `patbuf' here so that that
292: * unbalanced braces are passed to the match
293: */
294: *rv = glob0(pattern, pglob);
295: return 0;
296: }
297:
298: for (i = 0, pl = pm = ptr; pm <= pe; pm++) {
299: switch (*pm) {
300: case LBRACKET:
301: /* Ignore everything between [] */
302: for (pl = pm++; *pm != RBRACKET && *pm != EOS; pm++)
303: continue;
304: if (*pm == EOS) {
305: /*
306: * We could not find a matching RBRACKET.
307: * Ignore and just look for RBRACE
308: */
309: pm = pl;
310: }
311: break;
312:
313: case LBRACE:
314: i++;
315: break;
316:
317: case RBRACE:
318: if (i) {
319: i--;
320: break;
321: }
322: /* FALLTHROUGH */
323: case COMMA:
324: if (i && *pm == COMMA)
325: break;
326: else {
327: /* Append the current string */
328: for (lm = ls; (pl < pm); *lm++ = *pl++)
329: continue;
330: /*
331: * Append the rest of the pattern after the
332: * closing brace
333: */
334: for (pl = pe + 1; (*lm++ = *pl++) != EOS;)
335: continue;
336:
337: /* Expand the current pattern */
338: #ifdef DEBUG
339: qprintf("globexp2:", patbuf);
340: #endif
341: *rv = globexp1(patbuf, pglob);
342:
343: /* move after the comma, to the next string */
344: pl = pm + 1;
345: }
346: break;
347:
348: default:
349: break;
350: }
351: }
352: *rv = 0;
353: return 0;
354: }
355:
356:
357:
358: /*
359: * expand tilde from the passwd file.
360: */
361: static const Char *
362: globtilde(pattern, patbuf, patsize, pglob)
363: const Char *pattern;
364: Char *patbuf;
365: size_t patsize;
366: glob_t *pglob;
367: {
368: struct passwd *pwd;
369: const char *h;
370: const Char *p;
371: Char *b;
372: char *d;
373: Char *pend = &patbuf[patsize / sizeof(Char)];
374: #ifndef NO_GETPW_R
375: struct passwd pwres;
376: char pwbuf[1024];
377: #endif
378:
379: pend--;
380:
381: _DIAGASSERT(pattern != NULL);
382: _DIAGASSERT(patbuf != NULL);
383: _DIAGASSERT(pglob != NULL);
384:
385: if (*pattern != TILDE || !(pglob->gl_flags & GLOB_TILDE))
386: return pattern;
387:
388: /* Copy up to the end of the string or / */
389: for (p = pattern + 1, d = (char *)(void *)patbuf;
390: d < (char *)(void *)pend && *p && *p != SLASH;
391: *d++ = *p++)
392: continue;
393:
394: if (d == (char *)(void *)pend)
395: return NULL;
396:
397: *d = EOS;
398: d = (char *)(void *)patbuf;
399:
400: if (*d == EOS) {
401: /*
402: * handle a plain ~ or ~/ by expanding $HOME
403: * first and then trying the password file
404: */
405: if ((h = getenv("HOME")) == NULL) {
406: #ifdef NO_GETPW_R
407: if ((pwd = getpwuid(getuid())) == NULL)
408: #else
409: if (getpwuid_r(getuid(), &pwres, pwbuf, sizeof(pwbuf),
410: &pwd) != 0 || pwd == NULL)
411: #endif
412: return pattern;
413: else
414: h = pwd->pw_dir;
415: }
416: }
417: else {
418: /*
419: * Expand a ~user
420: */
421: #ifdef NO_GETPW_R
422: if ((pwd = getpwnam(d)) == NULL)
423: #else
424: if (getpwnam_r(d, &pwres, pwbuf, sizeof(pwbuf), &pwd) != 0 ||
425: pwd == NULL)
426: #endif
427: return pattern;
428: else
429: h = pwd->pw_dir;
430: }
431:
432: /* Copy the home directory */
433: for (b = patbuf; b < pend && *h; *b++ = *h++)
434: continue;
435:
436: if (b == pend)
437: return NULL;
438:
439: /* Append the rest of the pattern */
440: while (b < pend && (*b++ = *p++) != EOS)
441: continue;
442:
443: if (b == pend)
444: return NULL;
445:
446: return patbuf;
447: }
448:
449:
450: /*
451: * The main glob() routine: compiles the pattern (optionally processing
452: * quotes), calls glob1() to do the real pattern matching, and finally
453: * sorts the list (unless unsorted operation is requested). Returns 0
454: * if things went well, nonzero if errors occurred. It is not an error
455: * to find no matches.
456: */
457: static int
458: glob0(pattern, pglob)
459: const Char *pattern;
460: glob_t *pglob;
461: {
462: const Char *qpatnext;
1.16 christos 463: int c, error;
464: __gl_size_t oldpathc;
1.12 christos 465: Char *bufnext, patbuf[MAXPATHLEN+1];
466: size_t limit = 0;
467:
468: _DIAGASSERT(pattern != NULL);
469: _DIAGASSERT(pglob != NULL);
470:
471: if ((qpatnext = globtilde(pattern, patbuf, sizeof(patbuf),
472: pglob)) == NULL)
473: return GLOB_ABEND;
474: oldpathc = pglob->gl_pathc;
475: bufnext = patbuf;
476:
477: /* We don't need to check for buffer overflow any more. */
478: while ((c = *qpatnext++) != EOS) {
479: switch (c) {
480: case LBRACKET:
481: c = *qpatnext;
482: if (c == NOT)
483: ++qpatnext;
484: if (*qpatnext == EOS ||
485: g_strchr(qpatnext+1, RBRACKET) == NULL) {
486: *bufnext++ = LBRACKET;
487: if (c == NOT)
488: --qpatnext;
489: break;
490: }
491: *bufnext++ = M_SET;
492: if (c == NOT)
493: *bufnext++ = M_NOT;
494: c = *qpatnext++;
495: do {
496: *bufnext++ = CHAR(c);
497: if (*qpatnext == RANGE &&
498: (c = qpatnext[1]) != RBRACKET) {
499: *bufnext++ = M_RNG;
500: *bufnext++ = CHAR(c);
501: qpatnext += 2;
502: }
503: } while ((c = *qpatnext++) != RBRACKET);
504: pglob->gl_flags |= GLOB_MAGCHAR;
505: *bufnext++ = M_END;
506: break;
507: case QUESTION:
508: pglob->gl_flags |= GLOB_MAGCHAR;
509: *bufnext++ = M_ONE;
510: break;
511: case STAR:
512: pglob->gl_flags |= GLOB_MAGCHAR;
513: /* collapse adjacent stars to one,
514: * to avoid exponential behavior
515: */
516: if (bufnext == patbuf || bufnext[-1] != M_ALL)
517: *bufnext++ = M_ALL;
518: break;
519: default:
520: *bufnext++ = CHAR(c);
521: break;
522: }
523: }
524: *bufnext = EOS;
525: #ifdef DEBUG
526: qprintf("glob0:", patbuf);
527: #endif
528:
529: if ((error = glob1(patbuf, pglob, &limit)) != 0)
530: return(error);
531:
532: if (pglob->gl_pathc == oldpathc) {
533: /*
534: * If there was no match we are going to append the pattern
535: * if GLOB_NOCHECK was specified or if GLOB_NOMAGIC was
536: * specified and the pattern did not contain any magic
537: * characters GLOB_NOMAGIC is there just for compatibility
538: * with csh.
539: */
540: if ((pglob->gl_flags & GLOB_NOCHECK) ||
541: ((pglob->gl_flags & (GLOB_NOMAGIC|GLOB_MAGCHAR))
542: == GLOB_NOMAGIC)) {
543: return globextend(pattern, pglob, &limit);
544: } else {
545: return (GLOB_NOMATCH);
546: }
547: } else if (!(pglob->gl_flags & GLOB_NOSORT)) {
548: qsort(pglob->gl_pathv + pglob->gl_offs + oldpathc,
549: (size_t)pglob->gl_pathc - oldpathc, sizeof(char *),
550: compare);
551: }
552:
553: return(0);
554: }
555:
556: static int
557: compare(p, q)
558: const void *p, *q;
559: {
560:
561: _DIAGASSERT(p != NULL);
562: _DIAGASSERT(q != NULL);
563:
564: return(strcoll(*(const char * const *)p, *(const char * const *)q));
565: }
566:
567: static int
568: glob1(pattern, pglob, limit)
569: Char *pattern;
570: glob_t *pglob;
571: size_t *limit;
572: {
573: Char pathbuf[MAXPATHLEN+1];
574:
575: _DIAGASSERT(pattern != NULL);
576: _DIAGASSERT(pglob != NULL);
577:
578: /* A null pathname is invalid -- POSIX 1003.1 sect. 2.4. */
579: if (*pattern == EOS)
580: return(0);
581: /*
582: * we save one character so that we can use ptr >= limit,
583: * in the general case when we are appending non nul chars only.
584: */
1.13 elad 585: return(glob2(pathbuf, pathbuf,
586: pathbuf + (sizeof(pathbuf) / sizeof(*pathbuf)) - 1,
587: pattern,
1.12 christos 588: pglob, limit));
589: }
590:
591: /*
592: * The functions glob2 and glob3 are mutually recursive; there is one level
593: * of recursion for each segment in the pattern that contains one or more
594: * meta characters.
595: */
596: static int
597: glob2(pathbuf, pathend, pathlim, pattern, pglob, limit)
598: Char *pathbuf, *pathend, *pathlim, *pattern;
599: glob_t *pglob;
600: size_t *limit;
601: {
602: __gl_stat_t sb;
603: Char *p, *q;
604: int anymeta;
605:
606: _DIAGASSERT(pathbuf != NULL);
607: _DIAGASSERT(pathend != NULL);
608: _DIAGASSERT(pattern != NULL);
609: _DIAGASSERT(pglob != NULL);
610:
611: /*
612: * Loop over pattern segments until end of pattern or until
613: * segment with meta character found.
614: */
615: for (anymeta = 0;;) {
616: if (*pattern == EOS) { /* End of pattern? */
617: *pathend = EOS;
618: if (g_lstat(pathbuf, &sb, pglob))
619: return(0);
620:
621: if (((pglob->gl_flags & GLOB_MARK) &&
622: pathend[-1] != SEP) && (S_ISDIR(sb.st_mode) ||
623: (S_ISLNK(sb.st_mode) &&
624: (g_stat(pathbuf, &sb, pglob) == 0) &&
625: S_ISDIR(sb.st_mode)))) {
626: if (pathend >= pathlim)
627: return (GLOB_ABORTED);
628: *pathend++ = SEP;
629: *pathend = EOS;
630: }
631: ++pglob->gl_matchc;
632: return(globextend(pathbuf, pglob, limit));
633: }
634:
635: /* Find end of next segment, copy tentatively to pathend. */
636: q = pathend;
637: p = pattern;
638: while (*p != EOS && *p != SEP) {
639: if (ismeta(*p))
640: anymeta = 1;
641: if (q >= pathlim)
642: return GLOB_ABORTED;
643: *q++ = *p++;
644: }
645:
646: if (!anymeta) { /* No expansion, do next segment. */
647: pathend = q;
648: pattern = p;
649: while (*pattern == SEP) {
650: if (pathend >= pathlim)
651: return GLOB_ABORTED;
652: *pathend++ = *pattern++;
653: }
654: } else /* Need expansion, recurse. */
655: return(glob3(pathbuf, pathend, pathlim, pattern, p,
656: pglob, limit));
657: }
658: /* NOTREACHED */
659: }
660:
661: static int
662: glob3(pathbuf, pathend, pathlim, pattern, restpattern, pglob, limit)
663: Char *pathbuf, *pathend, *pathlim, *pattern, *restpattern;
664: glob_t *pglob;
665: size_t *limit;
666: {
667: struct dirent *dp;
668: DIR *dirp;
669: int error;
670: char buf[MAXPATHLEN];
671:
672: /*
673: * The readdirfunc declaration can't be prototyped, because it is
674: * assigned, below, to two functions which are prototyped in glob.h
675: * and dirent.h as taking pointers to differently typed opaque
676: * structures.
677: */
678: struct dirent *(*readdirfunc) __P((void *));
679:
680: _DIAGASSERT(pathbuf != NULL);
681: _DIAGASSERT(pathend != NULL);
682: _DIAGASSERT(pattern != NULL);
683: _DIAGASSERT(restpattern != NULL);
684: _DIAGASSERT(pglob != NULL);
685:
686: *pathend = EOS;
687: errno = 0;
688:
689: if ((dirp = g_opendir(pathbuf, pglob)) == NULL) {
690: if (pglob->gl_errfunc) {
691: if (g_Ctoc(pathbuf, buf, sizeof(buf)))
692: return (GLOB_ABORTED);
693: if (pglob->gl_errfunc(buf, errno) ||
694: pglob->gl_flags & GLOB_ERR)
695: return (GLOB_ABORTED);
696: }
697: /*
698: * Posix/XOpen: glob should return when it encounters a
699: * directory that it cannot open or read
700: * XXX: Should we ignore ENOTDIR and ENOENT though?
701: * I think that Posix had in mind EPERM...
702: */
703: if (pglob->gl_flags & GLOB_ERR)
704: return (GLOB_ABORTED);
705:
706: return(0);
707: }
708:
709: error = 0;
710:
711: /* Search directory for matching names. */
712: if (pglob->gl_flags & GLOB_ALTDIRFUNC)
713: readdirfunc = pglob->gl_readdir;
714: else
715: readdirfunc = (struct dirent *(*)__P((void *))) readdir;
716: while ((dp = (*readdirfunc)(dirp)) != NULL) {
717: u_char *sc;
718: Char *dc;
719:
720: /* Initial DOT must be matched literally. */
721: if (dp->d_name[0] == DOT && *pattern != DOT)
722: continue;
723: /*
724: * The resulting string contains EOS, so we can
725: * use the pathlim character, if it is the nul
726: */
727: for (sc = (u_char *) dp->d_name, dc = pathend;
728: dc <= pathlim && (*dc++ = *sc++) != EOS;)
729: continue;
730:
731: /*
732: * Have we filled the buffer without seeing EOS?
733: */
734: if (dc > pathlim && *pathlim != EOS) {
735: /*
736: * Abort when requested by caller, otherwise
737: * reset pathend back to last SEP and continue
738: * with next dir entry.
739: */
740: if (pglob->gl_flags & GLOB_ERR) {
741: error = GLOB_ABORTED;
742: break;
743: }
744: else {
745: *pathend = EOS;
746: continue;
747: }
748: }
749:
750: if (!match(pathend, pattern, restpattern)) {
751: *pathend = EOS;
752: continue;
753: }
754: error = glob2(pathbuf, --dc, pathlim, restpattern, pglob, limit);
755: if (error)
756: break;
757: }
758:
759: if (pglob->gl_flags & GLOB_ALTDIRFUNC)
760: (*pglob->gl_closedir)(dirp);
761: else
762: closedir(dirp);
763:
764: /*
765: * Again Posix X/Open issue with regards to error handling.
766: */
767: if ((error || errno) && (pglob->gl_flags & GLOB_ERR))
768: return (GLOB_ABORTED);
769:
770: return(error);
771: }
772:
773:
774: /*
1.17 ! christos 775: * Extend the gl_pathv member of a glob_t structure to accommodate a new item,
1.12 christos 776: * add the new item, and update gl_pathc.
777: *
778: * This assumes the BSD realloc, which only copies the block when its size
779: * crosses a power-of-two boundary; for v7 realloc, this would cause quadratic
780: * behavior.
781: *
782: * Return 0 if new item added, error code if memory couldn't be allocated.
783: *
784: * Invariant of the glob_t structure:
785: * Either gl_pathc is zero and gl_pathv is NULL; or gl_pathc > 0 and
786: * gl_pathv points to (gl_offs + gl_pathc + 1) items.
787: */
788: static int
789: globextend(path, pglob, limit)
790: const Char *path;
791: glob_t *pglob;
792: size_t *limit;
793: {
794: char **pathv;
1.16 christos 795: size_t i, newsize, len;
1.12 christos 796: char *copy;
797: const Char *p;
798:
799: _DIAGASSERT(path != NULL);
800: _DIAGASSERT(pglob != NULL);
801:
802: newsize = sizeof(*pathv) * (2 + pglob->gl_pathc + pglob->gl_offs);
803: pathv = pglob->gl_pathv ? realloc(pglob->gl_pathv, newsize) :
804: malloc(newsize);
805: if (pathv == NULL)
806: return(GLOB_NOSPACE);
807:
808: if (pglob->gl_pathv == NULL && pglob->gl_offs > 0) {
809: /* first time around -- clear initial gl_offs items */
810: pathv += pglob->gl_offs;
1.16 christos 811: for (i = pglob->gl_offs + 1; --i > 0; )
1.12 christos 812: *--pathv = NULL;
813: }
814: pglob->gl_pathv = pathv;
815:
816: for (p = path; *p++;)
817: continue;
818: len = (size_t)(p - path);
819: *limit += len;
820: if ((copy = malloc(len)) != NULL) {
821: if (g_Ctoc(path, copy, len)) {
822: free(copy);
823: return(GLOB_ABORTED);
824: }
825: pathv[pglob->gl_offs + pglob->gl_pathc++] = copy;
826: }
827: pathv[pglob->gl_offs + pglob->gl_pathc] = NULL;
828:
829: if ((pglob->gl_flags & GLOB_LIMIT) && (newsize + *limit) >= ARG_MAX) {
830: errno = 0;
831: return(GLOB_NOSPACE);
832: }
833:
834: return(copy == NULL ? GLOB_NOSPACE : 0);
835: }
836:
837:
838: /*
839: * pattern matching function for filenames. Each occurrence of the *
840: * pattern causes a recursion level.
841: */
842: static int
843: match(name, pat, patend)
844: Char *name, *pat, *patend;
845: {
846: int ok, negate_range;
847: Char c, k;
848:
849: _DIAGASSERT(name != NULL);
850: _DIAGASSERT(pat != NULL);
851: _DIAGASSERT(patend != NULL);
852:
853: while (pat < patend) {
854: c = *pat++;
855: switch (c & M_MASK) {
856: case M_ALL:
857: if (pat == patend)
858: return(1);
859: do
860: if (match(name, pat, patend))
861: return(1);
862: while (*name++ != EOS);
863: return(0);
864: case M_ONE:
865: if (*name++ == EOS)
866: return(0);
867: break;
868: case M_SET:
869: ok = 0;
870: if ((k = *name++) == EOS)
871: return(0);
872: if ((negate_range = ((*pat & M_MASK) == M_NOT)) != EOS)
873: ++pat;
874: while (((c = *pat++) & M_MASK) != M_END)
875: if ((*pat & M_MASK) == M_RNG) {
876: if (c <= k && k <= pat[1])
877: ok = 1;
878: pat += 2;
879: } else if (c == k)
880: ok = 1;
881: if (ok == negate_range)
882: return(0);
883: break;
884: default:
885: if (*name++ != c)
886: return(0);
887: break;
888: }
889: }
890: return(*name == EOS);
891: }
892:
893: /* Free allocated data belonging to a glob_t structure. */
894: void
895: globfree(pglob)
896: glob_t *pglob;
897: {
1.16 christos 898: size_t i;
1.12 christos 899: char **pp;
900:
901: _DIAGASSERT(pglob != NULL);
902:
903: if (pglob->gl_pathv != NULL) {
904: pp = pglob->gl_pathv + pglob->gl_offs;
905: for (i = pglob->gl_pathc; i--; ++pp)
906: if (*pp)
907: free(*pp);
908: free(pglob->gl_pathv);
909: pglob->gl_pathv = NULL;
910: pglob->gl_pathc = 0;
911: }
912: }
913:
914: static DIR *
915: g_opendir(str, pglob)
916: Char *str;
917: glob_t *pglob;
918: {
919: char buf[MAXPATHLEN];
920:
921: _DIAGASSERT(str != NULL);
922: _DIAGASSERT(pglob != NULL);
923:
924: if (!*str)
925: (void)strlcpy(buf, ".", sizeof(buf));
926: else {
927: if (g_Ctoc(str, buf, sizeof(buf)))
928: return NULL;
929: }
930:
931: if (pglob->gl_flags & GLOB_ALTDIRFUNC)
932: return((*pglob->gl_opendir)(buf));
933:
934: return(opendir(buf));
935: }
936:
937: static int
938: g_lstat(fn, sb, pglob)
939: Char *fn;
940: __gl_stat_t *sb;
941: glob_t *pglob;
942: {
943: char buf[MAXPATHLEN];
944:
945: _DIAGASSERT(fn != NULL);
946: _DIAGASSERT(sb != NULL);
947: _DIAGASSERT(pglob != NULL);
948:
949: if (g_Ctoc(fn, buf, sizeof(buf)))
950: return -1;
951: if (pglob->gl_flags & GLOB_ALTDIRFUNC)
952: return((*pglob->gl_lstat)(buf, sb));
953: return(lstat(buf, sb));
954: }
955:
956: static int
957: g_stat(fn, sb, pglob)
958: Char *fn;
959: __gl_stat_t *sb;
960: glob_t *pglob;
961: {
962: char buf[MAXPATHLEN];
963:
964: _DIAGASSERT(fn != NULL);
965: _DIAGASSERT(sb != NULL);
966: _DIAGASSERT(pglob != NULL);
967:
968: if (g_Ctoc(fn, buf, sizeof(buf)))
969: return -1;
970: if (pglob->gl_flags & GLOB_ALTDIRFUNC)
971: return((*pglob->gl_stat)(buf, sb));
972: return(stat(buf, sb));
973: }
974:
975: static Char *
976: g_strchr(str, ch)
977: const Char *str;
978: int ch;
979: {
980:
981: _DIAGASSERT(str != NULL);
982:
983: do {
984: if (*str == ch)
1.14 christos 985: return __UNCONST(str);
1.12 christos 986: } while (*str++);
987: return NULL;
988: }
989:
990: static int
991: g_Ctoc(str, buf, len)
992: const Char *str;
993: char *buf;
994: size_t len;
995: {
996: char *dc;
997:
998: _DIAGASSERT(str != NULL);
999: _DIAGASSERT(buf != NULL);
1000:
1001: if (len == 0)
1002: return 1;
1003:
1004: for (dc = buf; len && (*dc++ = *str++) != EOS; len--)
1005: continue;
1006:
1007: return len == 0;
1008: }
1009:
1010: #ifdef DEBUG
1011: static void
1012: qprintf(str, s)
1013: const char *str;
1014: Char *s;
1015: {
1016: Char *p;
1017:
1018: _DIAGASSERT(str != NULL);
1019: _DIAGASSERT(s != NULL);
1020:
1021: (void)printf("%s:\n", str);
1022: for (p = s; *p; p++)
1023: (void)printf("%c", CHAR(*p));
1024: (void)printf("\n");
1025: for (p = s; *p; p++)
1026: (void)printf("%c", *p & M_PROTECT ? '"' : ' ');
1027: (void)printf("\n");
1028: for (p = s; *p; p++)
1029: (void)printf("%c", ismeta(*p) ? '_' : ' ');
1030: (void)printf("\n");
1031: }
1032: #endif
CVSweb <webmaster@jp.NetBSD.org>