2 * Ported to Linux's Second Extended File System as part of the
3 * dump and restore backup suit
4 * Remy Card <card@Linux.EU.Org>, 1994-1997
5 * Stelian Pop <stelian@popies.net>, 1999-2000
6 * Stelian Pop <stelian@popies.net> - AlcĂ´ve <www.alcove.com>, 2000-2002
10 * Copyright (c) 1989, 1993
11 * The Regents of the University of California. All rights reserved.
13 * This code is derived from software contributed to Berkeley by
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
24 * 3. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42 * glob(3) -- a superset of the one defined in POSIX 1003.2.
44 * The [!...] convention to negate a range is supported (SysV, Posix, ksh).
46 * Optional extra services, controlled by flags not defined by POSIX:
49 * Escaping convention: \ inhibits any special meaning the following
50 * character might have (except \ at end of string is retained).
52 * Set in gl_flags if pattern contained a globbing character.
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]
57 * Use alternately specified directory access functions.
59 * expand ~user/foo to the /home/dir/of/user/foo
61 * expand {1,2}{a,b} to 1a 1b 2a 2b
63 * Number of matches in the current invocation of glob.
67 static const char rcsid[] =
68 "$Id: compatglob.c,v 1.9 2003/03/30 15:40:35 stelian Exp $";
75 #include <sys/param.h>
81 #include <compatglob.h>
100 #define UNDERSCORE '_'
108 #define M_QUOTE 0x8000
109 #define M_PROTECT 0x4000
110 #define M_MASK 0xffff
111 #define M_ASCII 0x00ff
113 typedef u_short Char;
118 #define M_PROTECT 0x40
127 #define CHAR(c) ((Char)((c)&M_ASCII))
128 #define META(c) ((Char)((c)|M_QUOTE))
129 #define M_ALL META('*')
130 #define M_END META(']')
131 #define M_NOT META('!')
132 #define M_ONE META('?')
133 #define M_RNG META('-')
134 #define M_SET META('[')
135 #define ismeta(c) (((c)&M_QUOTE) != 0)
138 static int compare __P((const void *, const void *));
139 static void g_Ctoc __P((const Char *, char *));
140 static int g_lstat __P((Char *, struct stat *, glob_t *));
141 static DIR *g_opendir __P((Char *, glob_t *));
142 static Char *g_strchr __P((Char *, int));
144 static Char *g_strcat __P((Char *, const Char *));
146 static int g_stat __P((Char *, struct stat *, glob_t *));
147 static int glob0 __P((const Char *, glob_t *));
148 static int glob1 __P((Char *, glob_t *));
149 static int glob2 __P((Char *, Char *, Char *, glob_t *));
150 static int glob3 __P((Char *, Char *, Char *, Char *, glob_t *));
151 static int globextend __P((const Char *, glob_t *));
152 static const Char * globtilde __P((const Char *, Char *, size_t, glob_t *));
153 static int globexp1 __P((const Char *, glob_t *));
154 static int globexp2 __P((const Char *, const Char *, glob_t *, int *));
155 static int match __P((Char *, Char *, Char *));
157 static void qprintf __P((const char *, Char *));
161 glob(const char *pattern, int flags, int (*errfunc) __P((const char *, int)), glob_t *pglob)
163 const u_char *patnext;
165 Char *bufnext, *bufend, patbuf[MAXPATHLEN+1];
167 patnext = (u_char *) pattern;
168 if (!(flags & GLOB_APPEND)) {
170 pglob->gl_pathv = NULL;
171 if (!(flags & GLOB_DOOFFS))
174 pglob->gl_flags = flags & ~GLOB_MAGCHAR;
175 pglob->gl_errfunc = errfunc;
176 pglob->gl_matchc = 0;
179 bufend = bufnext + MAXPATHLEN;
180 if (flags & GLOB_QUOTE) {
181 /* Protect the quoted characters. */
182 while (bufnext < bufend && (c = *patnext++) != EOS)
184 if ((c = *patnext++) == EOS) {
188 *bufnext++ = c | M_PROTECT;
194 while (bufnext < bufend && (c = *patnext++) != EOS)
198 if (flags & GLOB_BRACE)
199 return globexp1(patbuf, pglob);
201 return glob0(patbuf, pglob);
205 * Expand recursively a glob {} pattern. When there is no more expansion
206 * invoke the standard globbing routine to glob the rest of the magic
209 static int globexp1(const Char *pattern, glob_t *pglob)
211 const Char* ptr = pattern;
214 /* Protect a single {}, for find(1), like csh */
215 if (pattern[0] == LBRACE && pattern[1] == RBRACE && pattern[2] == EOS)
216 return glob0(pattern, pglob);
218 while ((ptr = (const Char *) g_strchr((Char *) ptr, LBRACE)) != NULL)
219 if (!globexp2(ptr, pattern, pglob, &rv))
222 return glob0(pattern, pglob);
227 * Recursive brace globbing helper. Tries to expand a single brace.
228 * If it succeeds then it invokes globexp1 with the new pattern.
229 * If it fails then it tries to glob the rest of the pattern and returns.
231 static int globexp2(const Char *ptr, const Char *pattern, glob_t *pglob, int *rv)
235 const Char *pe, *pm, *pl;
236 Char patbuf[MAXPATHLEN + 1];
238 /* copy part up to the brace */
239 for (lm = patbuf, pm = pattern; pm != ptr; *lm++ = *pm++)
243 /* Find the balanced brace */
244 for (i = 0, pe = ++ptr; *pe; pe++)
245 if (*pe == LBRACKET) {
246 /* Ignore everything between [] */
247 for (pm = pe++; *pe != RBRACKET && *pe != EOS; pe++)
251 * We could not find a matching RBRACKET.
252 * Ignore and just look for RBRACE
257 else if (*pe == LBRACE)
259 else if (*pe == RBRACE) {
265 /* Non matching braces; just glob the pattern */
266 if (i != 0 || *pe == EOS) {
267 *rv = glob0(patbuf, pglob);
271 for (i = 0, pl = pm = ptr; pm <= pe; pm++)
274 /* Ignore everything between [] */
275 for (pl = pm++; *pm != RBRACKET && *pm != EOS; pm++)
279 * We could not find a matching RBRACKET.
280 * Ignore and just look for RBRACE
297 if (i && *pm == COMMA)
300 /* Append the current string */
301 for (lm = ls; (pl < pm); *lm++ = *pl++)
304 * Append the rest of the pattern after the
307 for (pl = pe + 1; (*lm++ = *pl++) != EOS;)
310 /* Expand the current pattern */
312 qprintf("globexp2:", patbuf);
314 *rv = globexp1(patbuf, pglob);
316 /* move after the comma, to the next string */
331 * expand tilde from the passwd file.
334 globtilde(const Char *pattern, Char *patbuf, size_t patbuf_len, glob_t *pglob)
341 if (*pattern != TILDE || !(pglob->gl_flags & GLOB_TILDE))
345 * Copy up to the end of the string or /
347 eb = &patbuf[patbuf_len - 1];
348 for (p = pattern + 1, h = (char *) patbuf;
349 h < (char *)eb && *p && *p != SLASH; *h++ = *p++)
354 if (((char *) patbuf)[0] == EOS) {
356 * handle a plain ~ or ~/ by expanding $HOME first if
357 * we're not running setuid or setgid) and then trying
362 #ifndef __NETBSD_SYSCALLS
366 (h = getenv("HOME")) == NULL) {
367 if (((h = getlogin()) != NULL &&
368 (pwd = getpwnam(h)) != NULL) ||
369 (pwd = getpwuid(getuid())) != NULL)
379 if ((pwd = getpwnam((char*) patbuf)) == NULL)
385 /* Copy the home directory */
386 for (b = patbuf; b < eb && *h; *b++ = *h++)
389 /* Append the rest of the pattern */
390 while (b < eb && (*b++ = *p++) != EOS)
399 * The main glob() routine: compiles the pattern (optionally processing
400 * quotes), calls glob1() to do the real pattern matching, and finally
401 * sorts the list (unless unsorted operation is requested). Returns 0
402 * if things went well, nonzero if errors occurred. It is not an error
403 * to find no matches.
406 glob0(const Char *pattern, glob_t *pglob)
408 const Char *qpatnext;
409 int c, err, oldpathc;
410 Char *bufnext, patbuf[MAXPATHLEN+1];
412 qpatnext = globtilde(pattern, patbuf, sizeof(patbuf) / sizeof(Char),
414 oldpathc = pglob->gl_pathc;
417 /* We don't need to check for buffer overflow any more. */
418 while ((c = *qpatnext++) != EOS) {
424 if (*qpatnext == EOS ||
425 g_strchr((Char *) qpatnext+1, RBRACKET) == NULL) {
426 *bufnext++ = LBRACKET;
436 *bufnext++ = CHAR(c);
437 if (*qpatnext == RANGE &&
438 (c = qpatnext[1]) != RBRACKET) {
440 *bufnext++ = CHAR(c);
443 } while ((c = *qpatnext++) != RBRACKET);
444 pglob->gl_flags |= GLOB_MAGCHAR;
448 pglob->gl_flags |= GLOB_MAGCHAR;
452 pglob->gl_flags |= GLOB_MAGCHAR;
453 /* collapse adjacent stars to one,
454 * to avoid exponential behavior
456 if (bufnext == patbuf || bufnext[-1] != M_ALL)
460 *bufnext++ = CHAR(c);
466 qprintf("glob0:", patbuf);
469 if ((err = glob1(patbuf, pglob)) != 0)
473 * If there was no match we are going to append the pattern
474 * if GLOB_NOCHECK was specified or if GLOB_NOMAGIC was specified
475 * and the pattern did not contain any magic characters
476 * GLOB_NOMAGIC is there just for compatibility with csh.
478 if (pglob->gl_pathc == oldpathc &&
479 ((pglob->gl_flags & GLOB_NOCHECK) ||
480 ((pglob->gl_flags & GLOB_NOMAGIC) &&
481 !(pglob->gl_flags & GLOB_MAGCHAR))))
482 return(globextend(pattern, pglob));
483 else if (!(pglob->gl_flags & GLOB_NOSORT))
484 qsort(pglob->gl_pathv + pglob->gl_offs + oldpathc,
485 pglob->gl_pathc - oldpathc, sizeof(char *), compare);
490 compare(const void *p, const void *q)
492 return(strcmp(*(char **)p, *(char **)q));
496 glob1(Char *pattern, glob_t *pglob)
498 Char pathbuf[MAXPATHLEN+1];
500 /* A null pathname is invalid -- POSIX 1003.1 sect. 2.4. */
503 return(glob2(pathbuf, pathbuf, pattern, pglob));
507 * The functions glob2 and glob3 are mutually recursive; there is one level
508 * of recursion for each segment in the pattern that contains one or more
512 glob2(Char *pathbuf, Char *pathend, Char *pattern, glob_t *pglob)
519 * Loop over pattern segments until end of pattern or until
520 * segment with meta character found.
522 for (anymeta = 0;;) {
523 if (*pattern == EOS) { /* End of pattern? */
525 if (g_lstat(pathbuf, &sb, pglob))
528 if (((pglob->gl_flags & GLOB_MARK) &&
529 pathend[-1] != SEP) && (S_ISDIR(sb.st_mode)
530 || (S_ISLNK(sb.st_mode) &&
531 (g_stat(pathbuf, &sb, pglob) == 0) &&
532 S_ISDIR(sb.st_mode)))) {
537 return(globextend(pathbuf, pglob));
540 /* Find end of next segment, copy tentatively to pathend. */
543 while (*p != EOS && *p != SEP) {
549 if (!anymeta) { /* No expansion, do next segment. */
552 while (*pattern == SEP)
553 *pathend++ = *pattern++;
554 } else /* Need expansion, recurse. */
555 return(glob3(pathbuf, pathend, pattern, p, pglob));
561 glob3(Char *pathbuf, Char *pathend, Char *pattern, Char *restpattern, glob_t *pglob)
566 char buf[MAXPATHLEN];
569 * The readdirfunc declaration can't be prototyped, because it is
570 * assigned, below, to two functions which are prototyped in glob.h
571 * and dirent.h as taking pointers to differently typed opaque
574 struct dirent *(*readdirfunc)();
579 if ((dirp = g_opendir(pathbuf, pglob)) == NULL) {
580 /* TODO: don't call for ENOENT or ENOTDIR? */
581 if (pglob->gl_errfunc) {
582 g_Ctoc(pathbuf, buf);
583 if (pglob->gl_errfunc(buf, errno) ||
584 pglob->gl_flags & GLOB_ERR)
592 /* Search directory for matching names. */
593 if (pglob->gl_flags & GLOB_ALTDIRFUNC)
594 readdirfunc = pglob->gl_readdir;
596 readdirfunc = readdir;
597 while ((dp = (*readdirfunc)(dirp))) {
601 /* Initial DOT must be matched literally. */
602 if (dp->d_name[0] == DOT && *pattern != DOT)
604 for (sc = (u_char *) dp->d_name, dc = pathend;
605 (*dc++ = *sc++) != EOS;)
607 if (!match(pathend, pattern, restpattern)) {
611 err = glob2(pathbuf, --dc, restpattern, pglob);
616 if (pglob->gl_flags & GLOB_ALTDIRFUNC)
617 (*pglob->gl_closedir)(dirp);
625 * Extend the gl_pathv member of a glob_t structure to accomodate a new item,
626 * add the new item, and update gl_pathc.
628 * This assumes the BSD realloc, which only copies the block when its size
629 * crosses a power-of-two boundary; for v7 realloc, this would cause quadratic
632 * Return 0 if new item added, error code if memory couldn't be allocated.
634 * Invariant of the glob_t structure:
635 * Either gl_pathc is zero and gl_pathv is NULL; or gl_pathc > 0 and
636 * gl_pathv points to (gl_offs + gl_pathc + 1) items.
639 globextend(const Char *path, glob_t *pglob)
647 newsize = sizeof(*pathv) * (2 + pglob->gl_pathc + pglob->gl_offs);
648 pathv = pglob->gl_pathv ?
649 realloc((char *)pglob->gl_pathv, newsize) :
652 return(GLOB_NOSPACE);
654 if (pglob->gl_pathv == NULL && pglob->gl_offs > 0) {
655 /* first time around -- clear initial gl_offs items */
656 pathv += pglob->gl_offs;
657 for (i = pglob->gl_offs; --i >= 0; )
660 pglob->gl_pathv = pathv;
662 for (p = path; *p++;)
664 if ((copy = malloc(p - path)) != NULL) {
666 pathv[pglob->gl_offs + pglob->gl_pathc++] = copy;
668 pathv[pglob->gl_offs + pglob->gl_pathc] = NULL;
669 return(copy == NULL ? GLOB_NOSPACE : 0);
673 * pattern matching function for filenames. Each occurrence of the *
674 * pattern causes a recursion level.
677 match(Char *name, Char *pat, Char *patend)
679 int ok, negate_range;
682 while (pat < patend) {
684 switch (c & M_MASK) {
689 if (match(name, pat, patend))
691 while (*name++ != EOS);
699 if ((k = *name++) == EOS)
701 if ((negate_range = ((*pat & M_MASK) == M_NOT)) != EOS)
703 while (((c = *pat++) & M_MASK) != M_END)
704 if ((*pat & M_MASK) == M_RNG) {
705 if (c <= k && k <= pat[1])
710 if (ok == negate_range)
719 return(*name == EOS);
722 /* Free allocated data belonging to a glob_t structure. */
724 globfree(glob_t *pglob)
729 if (pglob->gl_pathv != NULL) {
730 pp = pglob->gl_pathv + pglob->gl_offs;
731 for (i = pglob->gl_pathc; i--; ++pp)
734 free(pglob->gl_pathv);
739 g_opendir(Char *str, glob_t *pglob)
741 char buf[MAXPATHLEN];
748 if (pglob->gl_flags & GLOB_ALTDIRFUNC)
749 return((*pglob->gl_opendir)(buf));
751 return(opendir(buf));
755 g_lstat(Char *fn, struct stat *sb, glob_t *pglob)
757 char buf[MAXPATHLEN];
760 if (pglob->gl_flags & GLOB_ALTDIRFUNC)
761 return((*pglob->gl_lstat)(buf, sb));
762 return(lstat(buf, sb));
766 g_stat(Char *fn, struct stat *sb, glob_t *pglob)
768 char buf[MAXPATHLEN];
771 if (pglob->gl_flags & GLOB_ALTDIRFUNC)
772 return((*pglob->gl_stat)(buf, sb));
773 return(stat(buf, sb));
777 g_strchr(Char *str, int ch)
788 g_strcat(Char *dst, const Char *src)
795 while((*dst++ = *src++) != EOS)
803 g_Ctoc(const Char *str, char *buf)
807 for (dc = buf; (*dc++ = *str++) != EOS;)
813 qprintf(const char *str, Char *s)
817 (void)printf("%s:\n", str);
819 (void)printf("%c", CHAR(*p));
822 (void)printf("%c", *p & M_PROTECT ? '"' : ' ');
825 (void)printf("%c", ismeta(*p) ? '_' : ' ');
830 #endif /* ! HAVE_GLOB */