📄 bsd_glob.c
字号:
*bufnext++ = M_SET; if (c == BG_NOT) *bufnext++ = M_NOT; c = *qpatnext++; do { *bufnext++ = CHAR(c); if (*qpatnext == BG_RANGE && (c = qpatnext[1]) != BG_RBRACKET) { *bufnext++ = M_RNG; *bufnext++ = CHAR(c); qpatnext += 2; } } while ((c = *qpatnext++) != BG_RBRACKET); pglob->gl_flags |= GLOB_MAGCHAR; *bufnext++ = M_END; break; case BG_QUESTION: pglob->gl_flags |= GLOB_MAGCHAR; *bufnext++ = M_ONE; break; case BG_STAR: pglob->gl_flags |= GLOB_MAGCHAR; /* collapse adjacent stars to one, * to avoid exponential behavior */ if (bufnext == patbuf || bufnext[-1] != M_ALL) *bufnext++ = M_ALL; break; default: *bufnext++ = CHAR(c); break; } } *bufnext = BG_EOS;#ifdef GLOB_DEBUG qprintf("glob0:", patbuf);#endif /* GLOB_DEBUG */ if ((err = glob1(patbuf, pglob)) != 0) { pglob->gl_flags = oldflags; return(err); } /* * If there was no match we are going to append the pattern * if GLOB_NOCHECK was specified or if GLOB_NOMAGIC was specified * and the pattern did not contain any magic characters * GLOB_NOMAGIC is there just for compatibility with csh. */ if (pglob->gl_pathc == oldpathc && ((pglob->gl_flags & GLOB_NOCHECK) || ((pglob->gl_flags & GLOB_NOMAGIC) && !(pglob->gl_flags & GLOB_MAGCHAR)))) {#ifdef GLOB_DEBUG printf("calling globextend from glob0\n");#endif /* GLOB_DEBUG */ pglob->gl_flags = oldflags; return(globextend(qpat, pglob)); } else if (!(pglob->gl_flags & GLOB_NOSORT)) qsort(pglob->gl_pathv + pglob->gl_offs + oldpathc, pglob->gl_pathc - oldpathc, sizeof(char *), (pglob->gl_flags & (GLOB_ALPHASORT|GLOB_NOCASE)) ? ci_compare : compare); pglob->gl_flags = oldflags; return(0);}static intci_compare(const void *p, const void *q){ const char *pp = *(const char **)p; const char *qq = *(const char **)q; int ci; while (*pp && *qq) { if (tolower(*pp) != tolower(*qq)) break; ++pp; ++qq; } ci = tolower(*pp) - tolower(*qq); if (ci == 0) return compare(p, q); return ci;}static intcompare(const void *p, const void *q){ return(strcmp(*(char **)p, *(char **)q));}static intglob1(Char *pattern, glob_t *pglob){ Char pathbuf[MAXPATHLEN+1]; /* A null pathname is invalid -- POSIX 1003.1 sect. 2.4. */ if (*pattern == BG_EOS) return(0); return(glob2(pathbuf, pathbuf, pattern, pglob));}/* * The functions glob2 and glob3 are mutually recursive; there is one level * of recursion for each segment in the pattern that contains one or more * meta characters. */static intglob2(Char *pathbuf, Char *pathend, Char *pattern, glob_t *pglob){ Stat_t sb; Char *p, *q; int anymeta; /* * Loop over pattern segments until end of pattern or until * segment with meta character found. */ for (anymeta = 0;;) { if (*pattern == BG_EOS) { /* End of pattern? */ *pathend = BG_EOS; if (g_lstat(pathbuf, &sb, pglob)) return(0); if (((pglob->gl_flags & GLOB_MARK) && pathend[-1] != BG_SEP#ifdef DOSISH && pathend[-1] != BG_SEP2#endif ) && (S_ISDIR(sb.st_mode) || (S_ISLNK(sb.st_mode) && (g_stat(pathbuf, &sb, pglob) == 0) && S_ISDIR(sb.st_mode)))) { *pathend++ = BG_SEP; *pathend = BG_EOS; } ++pglob->gl_matchc;#ifdef GLOB_DEBUG printf("calling globextend from glob2\n");#endif /* GLOB_DEBUG */ return(globextend(pathbuf, pglob)); } /* Find end of next segment, copy tentatively to pathend. */ q = pathend; p = pattern; while (*p != BG_EOS && *p != BG_SEP#ifdef DOSISH && *p != BG_SEP2#endif ) { if (ismeta(*p)) anymeta = 1; *q++ = *p++; } if (!anymeta) { /* No expansion, do next segment. */ pathend = q; pattern = p; while (*pattern == BG_SEP#ifdef DOSISH || *pattern == BG_SEP2#endif ) *pathend++ = *pattern++; } else /* Need expansion, recurse. */ return(glob3(pathbuf, pathend, pattern, p, pglob)); } /* NOTREACHED */}static intglob3(Char *pathbuf, Char *pathend, Char *pattern, Char *restpattern, glob_t *pglob){ register Direntry_t *dp; DIR *dirp; int err; int nocase; char buf[MAXPATHLEN]; /* * The readdirfunc declaration can't be prototyped, because it is * assigned, below, to two functions which are prototyped in glob.h * and dirent.h as taking pointers to differently typed opaque * structures. */ Direntry_t *(*readdirfunc)(DIR*); *pathend = BG_EOS; errno = 0;#ifdef VMS { Char *q = pathend; if (q - pathbuf > 5) { q -= 5; if (q[0] == '.' && tolower(q[1]) == 'd' && tolower(q[2]) == 'i' && tolower(q[3]) == 'r' && q[4] == '/') { q[0] = '/'; q[1] = BG_EOS; pathend = q+1; } } }#endif if ((dirp = g_opendir(pathbuf, pglob)) == NULL) { /* TODO: don't call for ENOENT or ENOTDIR? */ if (pglob->gl_errfunc) { g_Ctoc(pathbuf, buf); if (pglob->gl_errfunc(buf, errno) || (pglob->gl_flags & GLOB_ERR)) return (GLOB_ABEND); } return(0); } err = 0; nocase = ((pglob->gl_flags & GLOB_NOCASE) != 0); /* Search directory for matching names. */ if (pglob->gl_flags & GLOB_ALTDIRFUNC) readdirfunc = (Direntry_t *(*)(DIR *))pglob->gl_readdir; else readdirfunc = my_readdir; while ((dp = (*readdirfunc)(dirp))) { register U8 *sc; register Char *dc; /* Initial BG_DOT must be matched literally. */ if (dp->d_name[0] == BG_DOT && *pattern != BG_DOT) continue; for (sc = (U8 *) dp->d_name, dc = pathend; (*dc++ = *sc++) != BG_EOS;) continue; if (!match(pathend, pattern, restpattern, nocase)) { *pathend = BG_EOS; continue; } err = glob2(pathbuf, --dc, restpattern, pglob); if (err) break; } if (pglob->gl_flags & GLOB_ALTDIRFUNC) (*pglob->gl_closedir)(dirp); else PerlDir_close(dirp); return(err);}/* * Extend the gl_pathv member of a glob_t structure to accomodate a new item, * add the new item, and update gl_pathc. * * This assumes the BSD realloc, which only copies the block when its size * crosses a power-of-two boundary; for v7 realloc, this would cause quadratic * behavior. * * Return 0 if new item added, error code if memory couldn't be allocated. * * Invariant of the glob_t structure: * Either gl_pathc is zero and gl_pathv is NULL; or gl_pathc > 0 and * gl_pathv points to (gl_offs + gl_pathc + 1) items. */static intglobextend(const Char *path, glob_t *pglob){ register char **pathv; register int i; char *copy; const Char *p;#ifdef GLOB_DEBUG printf("Adding "); for (p = path; *p; p++) (void)printf("%c", CHAR(*p)); printf("\n");#endif /* GLOB_DEBUG */ if (pglob->gl_pathv) pathv = Renew(pglob->gl_pathv, (2 + pglob->gl_pathc + pglob->gl_offs),char*); else New(0,pathv,(2 + pglob->gl_pathc + pglob->gl_offs),char*); if (pathv == NULL) return(GLOB_NOSPACE); if (pglob->gl_pathv == NULL && pglob->gl_offs > 0) { /* first time around -- clear initial gl_offs items */ pathv += pglob->gl_offs; for (i = pglob->gl_offs; --i >= 0; ) *--pathv = NULL; } pglob->gl_pathv = pathv; for (p = path; *p++;) continue; New(0, copy, p-path, char); if (copy != NULL) { g_Ctoc(path, copy); pathv[pglob->gl_offs + pglob->gl_pathc++] = copy; } pathv[pglob->gl_offs + pglob->gl_pathc] = NULL; return(copy == NULL ? GLOB_NOSPACE : 0);}/* * pattern matching function for filenames. Each occurrence of the * * pattern causes a recursion level. */static intmatch(register Char *name, register Char *pat, register Char *patend, int nocase){ int ok, negate_range; Char c, k; while (pat < patend) { c = *pat++; switch (c & M_MASK) { case M_ALL: if (pat == patend) return(1); do if (match(name, pat, patend, nocase)) return(1); while (*name++ != BG_EOS); return(0); case M_ONE: if (*name++ == BG_EOS) return(0); break; case M_SET: ok = 0; if ((k = *name++) == BG_EOS) return(0); if ((negate_range = ((*pat & M_MASK) == M_NOT)) != BG_EOS) ++pat; while (((c = *pat++) & M_MASK) != M_END) if ((*pat & M_MASK) == M_RNG) { if (nocase) { if (tolower(c) <= tolower(k) && tolower(k) <= tolower(pat[1])) ok = 1; } else { if (c <= k && k <= pat[1]) ok = 1; } pat += 2; } else if (nocase ? (tolower(c) == tolower(k)) : (c == k)) ok = 1; if (ok == negate_range) return(0); break; default: k = *name++; if (nocase ? (tolower(k) != tolower(c)) : (k != c)) return(0); break; } } return(*name == BG_EOS);}/* Free allocated data belonging to a glob_t structure. */voidbsd_globfree(glob_t *pglob){ register int i; register char **pp; if (pglob->gl_pathv != NULL) { pp = pglob->gl_pathv + pglob->gl_offs; for (i = pglob->gl_pathc; i--; ++pp) if (*pp) Safefree(*pp); Safefree(pglob->gl_pathv); }}static DIR *g_opendir(register Char *str, glob_t *pglob){ char buf[MAXPATHLEN]; if (!*str) {#ifdef MACOS_TRADITIONAL strcpy(buf, ":");#else strcpy(buf, ".");#endif } else { g_Ctoc(str, buf); } if (pglob->gl_flags & GLOB_ALTDIRFUNC) return((*pglob->gl_opendir)(buf)); else return(PerlDir_open(buf));}static intg_lstat(register Char *fn, Stat_t *sb, glob_t *pglob){ char buf[MAXPATHLEN]; g_Ctoc(fn, buf); if (pglob->gl_flags & GLOB_ALTDIRFUNC) return((*pglob->gl_lstat)(buf, sb));#ifdef HAS_LSTAT return(PerlLIO_lstat(buf, sb));#else return(PerlLIO_stat(buf, sb));#endif /* HAS_LSTAT */}static intg_stat(register Char *fn, Stat_t *sb, glob_t *pglob){ char buf[MAXPATHLEN]; g_Ctoc(fn, buf); if (pglob->gl_flags & GLOB_ALTDIRFUNC) return((*pglob->gl_stat)(buf, sb)); return(PerlLIO_stat(buf, sb));}static Char *g_strchr(Char *str, int ch){ do { if (*str == ch) return (str); } while (*str++); return (NULL);}#ifdef notdefstatic Char *g_strcat(Char *dst, const Char *src){ Char *sdst = dst; while (*dst++) continue; --dst; while((*dst++ = *src++) != BG_EOS) continue; return (sdst);}#endifstatic voidg_Ctoc(register const Char *str, char *buf){ register char *dc; for (dc = buf; (*dc++ = *str++) != BG_EOS;) continue;}#ifdef GLOB_DEBUGstatic voidqprintf(const char *str, register Char *s){ register Char *p; (void)printf("%s:\n", str); for (p = s; *p; p++) (void)printf("%c", CHAR(*p)); (void)printf("\n"); for (p = s; *p; p++) (void)printf("%c", *p & M_PROTECT ? '"' : ' '); (void)printf("\n"); for (p = s; *p; p++) (void)printf("%c", ismeta(*p) ? '_' : ' '); (void)printf("\n");}#endif /* GLOB_DEBUG */
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -