diff options
author | Gary Mills <gary_mills@fastmail.fm> | 2013-10-23 10:01:05 -0500 |
---|---|---|
committer | Dan McDonald <danmcd@nexenta.com> | 2013-11-01 10:49:14 -0400 |
commit | a5229c74bcec7e2b136379c59a46f4b0717fd516 (patch) | |
tree | 559fe9b129f70b41bf8f02a73aea47787d30c9f2 /usr/src/lib/libc/port/regex/glob.c | |
parent | ad17c019951cba3a3dcfcb81207a844fea04f536 (diff) | |
download | illumos-gate-a5229c74bcec7e2b136379c59a46f4b0717fd516.tar.gz |
1097 glob(3c) needs to support non-POSIX options
3341 The sftp command should use the native glob()
Reviewed by: Robert Mustacchi <rm@joyent.com>
Reviewed by: Gordon Ross <gordon.w.ross@gmail.com>
Reviewed by: Albert Lee <trisk@nexenta.com>
Approved by: Dan McDonald <danmcd@nexenta.com>
Diffstat (limited to 'usr/src/lib/libc/port/regex/glob.c')
-rw-r--r-- | usr/src/lib/libc/port/regex/glob.c | 1471 |
1 files changed, 1254 insertions, 217 deletions
diff --git a/usr/src/lib/libc/port/regex/glob.c b/usr/src/lib/libc/port/regex/glob.c index c557b6f44d..425f9c8724 100644 --- a/usr/src/lib/libc/port/regex/glob.c +++ b/usr/src/lib/libc/port/regex/glob.c @@ -1,299 +1,1336 @@ /* - * CDDL HEADER START - * - * The contents of this file are subject to the terms of the - * Common Development and Distribution License (the "License"). - * You may not use this file except in compliance with the License. - * - * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE - * or http://www.opensolaris.org/os/licensing. - * See the License for the specific language governing permissions - * and limitations under the License. - * - * When distributing Covered Code, include this CDDL HEADER in each - * file and include the License file at usr/src/OPENSOLARIS.LICENSE. - * If applicable, add the following below this CDDL HEADER, with the - * fields enclosed by brackets "[]" replaced with your own identifying - * information: Portions Copyright [yyyy] [name of copyright owner] - * - * CDDL HEADER END - */ - -/* - * Copyright 2008 Sun Microsystems, Inc. All rights reserved. - * Use is subject to license terms. + * Copyright (c) 2013 Gary Mills */ - +/* $OpenBSD: glob.c,v 1.39 2012/01/20 07:09:42 tedu Exp $ */ /* - * This code is MKS code ported to Solaris originally with minimum - * modifications so that upgrades from MKS would readily integrate. - * The MKS basis for this modification was: + * Copyright (c) 1989, 1993 + * The Regents of the University of California. All rights reserved. * - * $Id: glob.c 1.31 1994/04/07 22:50:43 mark + * This code is derived from software contributed to Berkeley by + * Guido van Rossum. * - * Additional modifications have been made to this code to make it - * 64-bit clean. + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * 1. Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * 2. Redistributions in binary form must reproduce the above copyright + * notice, this list of conditions and the following disclaimer in the + * documentation and/or other materials provided with the distribution. + * 3. Neither the name of the University nor the names of its contributors + * may be used to endorse or promote products derived from this software + * without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE + * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF + * SUCH DAMAGE. */ /* - * glob, globfree -- POSIX.2 compatible file name expansion routines. + * glob(3) -- a superset of the one defined in POSIX 1003.2. + * + * The [!...] convention to negate a range is supported (SysV, Posix, ksh). * - * Copyright 1985, 1991 by Mortice Kern Systems Inc. All rights reserved. + * Optional extra services, controlled by flags not defined by POSIX: * - * Written by Eric Gisin. + * GLOB_QUOTE: + * Escaping convention: \ inhibits any special meaning the following + * character might have (except \ at end of string is retained). + * GLOB_MAGCHAR: + * Set in gl_flags if pattern contained a globbing character. + * GLOB_NOMAGIC: + * Same as GLOB_NOCHECK, but it will only append pattern if it did + * not contain any magic characters. [Used in csh style globbing] + * GLOB_ALTDIRFUNC: + * Use alternately specified directory access functions. + * GLOB_TILDE: + * expand ~user/foo to the /home/dir/of/user/foo + * GLOB_BRACE: + * expand {1,2}{a,b} to 1a 1b 2a 2b + * gl_matchc: + * Number of matches in the current invocation of glob. */ -#pragma ident "%Z%%M% %I% %E% SMI" +#include "lint.h" -#pragma weak _glob = glob -#pragma weak _globfree = globfree +#include <sys/param.h> +#include <sys/stat.h> -#include "lint.h" -#include <stdio.h> -#include <unistd.h> +#include <ctype.h> +#include <dirent.h> +#include <errno.h> +#include <glob.h> #include <limits.h> +#include <pwd.h> +#include <stdio.h> #include <stdlib.h> #include <string.h> -#include <dirent.h> -#include <sys/stat.h> -#include <glob.h> -#include <errno.h> -#include <fnmatch.h> +#include <unistd.h> +#include <wchar.h> +#include <wctype.h> -#define GLOB__CHECK 0x80 /* stat generated paths */ +/* + * This is the legacy glob_t prior to illumos enhancement 1097, + * used when old programs call the old libc glob functions. + * (New programs call the _glob_ext, _globfree_ext functions.) + * This struct should be considered "carved in stone". + */ +typedef struct old_glob { + size_t gl_pathc; /* Count of paths matched by pattern */ + char **gl_pathv; /* List of matched pathnames */ + size_t gl_offs; /* # of slots reserved in gl_pathv */ + /* following are internal to the implementation */ + char **gl_pathp; /* gl_pathv + gl_offs */ + int gl_pathn; /* # of elements allocated */ +} old_glob_t; + +/* + * For old programs, the external names need to be the old names: + * glob() and globfree() . We've redefined those already to + * _glob_ext() and _globfree_ext() . Now redefine old_glob() + * and old_globfree() to glob() and globfree() . + */ +#ifdef __PRAGMA_REDEFINE_EXTNAME +#pragma redefine_extname old_glob glob +#pragma redefine_extname old_globfree globfree +#endif /* __PRAGMA_REDEFINE_EXTNAME */ +extern int old_glob(const char *, int, int (*)(const char *, int), + old_glob_t *); +extern void old_globfree(old_glob_t *); -#define INITIAL 8 /* initial pathv allocation */ -#define NULLCPP ((char **)0) /* Null char ** */ -#define NAME_MAX 1024 /* something large */ +#define DOLLAR '$' +#define DOT '.' +#define EOS '\0' +#define LBRACKET '[' +#define NOT '!' +#define QUESTION '?' +#define QUOTE '\\' +#define RANGE '-' +#define RBRACKET ']' +#define SEP '/' +#define STAR '*' +#define TILDE '~' +#define UNDERSCORE '_' +#define LBRACE '{' +#define RBRACE '}' +#define SLASH '/' +#define COMMA ',' +#define COLON ':' -static int globit(size_t, const char *, glob_t *, int, - int (*)(const char *, int), char **); -static int pstrcmp(const void *, const void *); -static int append(glob_t *, const char *); +#define M_QUOTE 0x800000 +#define M_PROTECT 0x400000 + +typedef struct wcat { + wchar_t w_wc; + uint_t w_at; +} wcat_t; + +#define M_ALL '*' /* Plus M_QUOTE */ +#define M_END ']' /* Plus M_QUOTE */ +#define M_NOT '!' /* Plus M_QUOTE */ +#define M_ONE '?' /* Plus M_QUOTE */ +#define M_RNG '-' /* Plus M_QUOTE */ +#define M_SET '[' /* Plus M_QUOTE */ +#define M_CLASS ':' /* Plus M_QUOTE */ +#define ismeta(c) (((c).w_at&M_QUOTE) != 0) + +#define INITIAL 8 /* initial pathv allocation */ + +#define GLOB_LIMIT_MALLOC 65536 +#define GLOB_LIMIT_STAT 2048 +#define GLOB_LIMIT_READDIR 16384 + +/* Limit of recursion during matching attempts. */ +#define GLOB_LIMIT_RECUR 64 + +struct glob_lim { + size_t glim_malloc; + size_t glim_stat; + size_t glim_readdir; +}; + +struct glob_path_stat { + char *gps_path; + struct stat *gps_stat; +}; + +static int compare(const void *, const void *); +static int compare_gps(const void *, const void *); +static int g_Ctoc(const wcat_t *, char *, uint_t); +static int g_lstat(wcat_t *, struct stat *, glob_t *); +static DIR *g_opendir(wcat_t *, glob_t *); +static wcat_t *g_strchr(const wcat_t *, wchar_t); +static int g_stat(wcat_t *, struct stat *, glob_t *); +static int glob0(const wcat_t *, glob_t *, struct glob_lim *, + int (*)(const char *, int)); +static int glob1(wcat_t *, wcat_t *, glob_t *, struct glob_lim *, + int (*)(const char *, int)); +static int glob2(wcat_t *, wcat_t *, wcat_t *, wcat_t *, wcat_t *, + wcat_t *, glob_t *, struct glob_lim *, + int (*)(const char *, int)); +static int glob3(wcat_t *, wcat_t *, wcat_t *, wcat_t *, wcat_t *, + wcat_t *, wcat_t *, glob_t *, struct glob_lim *, + int (*)(const char *, int)); +static int globextend(const wcat_t *, glob_t *, struct glob_lim *, + struct stat *); +static +const wcat_t *globtilde(const wcat_t *, wcat_t *, size_t, glob_t *); +static int globexp1(const wcat_t *, glob_t *, struct glob_lim *, + int (*)(const char *, int)); +static int globexp2(const wcat_t *, const wcat_t *, glob_t *, + struct glob_lim *, int (*)(const char *, int)); +static int match(wcat_t *, wcat_t *, wcat_t *, int); /* - * Free all space consumed by glob. + * Extended glob() function, selected by #pragma redefine_extname + * in glob.h with the external name _glob_ext() . */ -void -globfree(glob_t *gp) +int +_glob_ext(const char *pattern, int flags, int (*errfunc)(const char *, int), + glob_t *pglob) { - size_t i; + const char *patnext; + int n; + size_t patlen; + wchar_t c; + wcat_t *bufnext, *bufend, patbuf[MAXPATHLEN]; + struct glob_lim limit = { 0, 0, 0 }; - if (gp->gl_pathv == 0) - return; + if ((patlen = strnlen(pattern, PATH_MAX)) == PATH_MAX) + return (GLOB_NOMATCH); - for (i = gp->gl_offs; i < gp->gl_offs + gp->gl_pathc; ++i) - free(gp->gl_pathv[i]); - free((void *)gp->gl_pathv); + patnext = pattern; + if (!(flags & GLOB_APPEND)) { + pglob->gl_pathc = 0; + pglob->gl_pathn = 0; + pglob->gl_pathv = NULL; + if ((flags & GLOB_KEEPSTAT) != 0) + pglob->gl_statv = NULL; + if (!(flags & GLOB_DOOFFS)) + pglob->gl_offs = 0; + } + pglob->gl_flags = flags & ~GLOB_MAGCHAR; + pglob->gl_matchc = 0; + + if (pglob->gl_offs >= INT_MAX || pglob->gl_pathc >= INT_MAX || + pglob->gl_pathc >= INT_MAX - pglob->gl_offs - 1) + return (GLOB_NOSPACE); - gp->gl_pathc = 0; - gp->gl_pathv = NULLCPP; + bufnext = patbuf; + bufend = bufnext + MAXPATHLEN - 1; + patlen += 1; + if (flags & GLOB_NOESCAPE) { + while (bufnext < bufend) { + if ((n = mbtowc(&c, patnext, patlen)) > 0) { + patnext += n; + patlen -= n; + bufnext->w_at = 0; + (bufnext++)->w_wc = c; + } else if (n == 0) { + break; + } else { + return (GLOB_NOMATCH); + } + } + } else { + /* Protect the quoted characters. */ + while (bufnext < bufend) { + if ((n = mbtowc(&c, patnext, patlen)) > 0) { + patnext += n; + patlen -= n; + if (c == QUOTE) { + n = mbtowc(&c, patnext, patlen); + if (n < 0) + return (GLOB_NOMATCH); + if (n > 0) { + patnext += n; + patlen -= n; + } + if (n == 0) + c = QUOTE; + bufnext->w_at = M_PROTECT; + (bufnext++)->w_wc = c; + } else { + bufnext->w_at = 0; + (bufnext++)->w_wc = c; + } + } else if (n == 0) { + break; + } else { + return (GLOB_NOMATCH); + } + } + } + bufnext->w_at = 0; + bufnext->w_wc = EOS; + + if (flags & GLOB_BRACE) + return (globexp1(patbuf, pglob, &limit, errfunc)); + else + return (glob0(patbuf, pglob, &limit, errfunc)); } /* - * Do filename expansion. + * Expand recursively a glob {} pattern. When there is no more expansion + * invoke the standard globbing routine to glob the rest of the magic + * characters */ -int -glob(const char *pattern, int flags, - int (*errfn)(const char *, int), glob_t *gp) +static int +globexp1(const wcat_t *pattern, glob_t *pglob, struct glob_lim *limitp, + int (*errfunc)(const char *, int)) { - int rv; - size_t i; - size_t ipathc; - char *path; + const wcat_t *ptr = pattern; - if ((flags & GLOB_DOOFFS) == 0) - gp->gl_offs = 0; + /* Protect a single {}, for find(1), like csh */ + if (pattern[0].w_wc == LBRACE && pattern[1].w_wc == RBRACE && + pattern[2].w_wc == EOS) + return (glob0(pattern, pglob, limitp, errfunc)); - if (!(flags & GLOB_APPEND)) { - gp->gl_pathc = 0; - gp->gl_pathn = gp->gl_offs + INITIAL; - gp->gl_pathv = (char **)malloc(sizeof (char *) * gp->gl_pathn); + if ((ptr = (const wcat_t *) g_strchr(ptr, LBRACE)) != NULL) + return (globexp2(ptr, pattern, pglob, limitp, errfunc)); - if (gp->gl_pathv == NULLCPP) - return (GLOB_NOSPACE); - gp->gl_pathp = gp->gl_pathv + gp->gl_offs; + return (glob0(pattern, pglob, limitp, errfunc)); +} + + +/* + * Recursive brace globbing helper. Tries to expand a single brace. + * If it succeeds then it invokes globexp1 with the new pattern. + * If it fails then it tries to glob the rest of the pattern and returns. + */ +static int +globexp2(const wcat_t *ptr, const wcat_t *pattern, glob_t *pglob, + struct glob_lim *limitp, int (*errfunc)(const char *, int)) +{ + int i, rv; + wcat_t *lm, *ls; + const wcat_t *pe, *pm, *pl; + wcat_t patbuf[MAXPATHLEN]; + + /* copy part up to the brace */ + for (lm = patbuf, pm = pattern; pm != ptr; *lm++ = *pm++) + ; + lm->w_at = 0; + lm->w_wc = EOS; + ls = lm; + + /* Find the balanced brace */ + for (i = 0, pe = ++ptr; pe->w_wc != EOS; pe++) + if (pe->w_wc == LBRACKET) { + /* Ignore everything between [] */ + for (pm = pe++; pe->w_wc != RBRACKET && + pe->w_wc != EOS; pe++) + ; + if (pe->w_wc == EOS) { + /* + * We could not find a matching RBRACKET. + * Ignore and just look for RBRACE + */ + pe = pm; + } + } else if (pe->w_wc == LBRACE) { + i++; + } else if (pe->w_wc == RBRACE) { + if (i == 0) + break; + i--; + } + + /* Non matching braces; just glob the pattern */ + if (i != 0 || pe->w_wc == EOS) + return (glob0(patbuf, pglob, limitp, errfunc)); + + for (i = 0, pl = pm = ptr; pm <= pe; pm++) { + switch (pm->w_wc) { + case LBRACKET: + /* Ignore everything between [] */ + for (pl = pm++; pm->w_wc != RBRACKET && pm->w_wc != EOS; + pm++) + ; + if (pm->w_wc == EOS) { + /* + * We could not find a matching RBRACKET. + * Ignore and just look for RBRACE + */ + pm = pl; + } + break; + + case LBRACE: + i++; + break; + + case RBRACE: + if (i) { + i--; + break; + } + /* FALLTHROUGH */ + case COMMA: + if (i && pm->w_wc == COMMA) + break; + else { + /* Append the current string */ + for (lm = ls; (pl < pm); *lm++ = *pl++) + ; + + /* + * Append the rest of the pattern after the + * closing brace + */ + for (pl = pe + 1; + (*lm++ = *pl++).w_wc != EOS; /* */) + ; + + /* Expand the current pattern */ + rv = globexp1(patbuf, pglob, limitp, errfunc); + if (rv && rv != GLOB_NOMATCH) + return (rv); - for (i = 0; i < gp->gl_offs; ++i) - gp->gl_pathv[i] = NULL; + /* move after the comma, to the next string */ + pl = pm + 1; + } + break; + + default: + break; + } } + return (0); +} - if ((path = malloc(strlen(pattern)+1)) == NULL) - return (GLOB_NOSPACE); - ipathc = gp->gl_pathc; - rv = globit(0, pattern, gp, flags, errfn, &path); - if (rv == GLOB_ABORTED) { +/* + * expand tilde from the passwd file. + */ +static const wcat_t * +globtilde(const wcat_t *pattern, wcat_t *patbuf, size_t patbuf_len, + glob_t *pglob) +{ + struct passwd *pwd; + char *h; + const wcat_t *p; + wcat_t *b, *eb, *q; + int n; + size_t lenh; + wchar_t c; + + if (pattern->w_wc != TILDE || !(pglob->gl_flags & GLOB_TILDE)) + return (pattern); + + /* Copy up to the end of the string or / */ + eb = &patbuf[patbuf_len - 1]; + for (p = pattern + 1, q = patbuf; + q < eb && p->w_wc != EOS && p->w_wc != SLASH; *q++ = *p++) + ; + + q->w_at = 0; + q->w_wc = EOS; + + /* What to do if patbuf is full? */ + + if (patbuf[0].w_wc == EOS) { + /* + * handle a plain ~ or ~/ by expanding $HOME + * first and then trying the password file + */ + if (issetugid() != 0) + return (pattern); + if ((h = getenv("HOME")) == NULL) { + if ((pwd = getpwuid(getuid())) == NULL) + return (pattern); + else + h = pwd->pw_dir; + } + } else { /* - * User's error function returned non-zero, or GLOB_ERR was - * set, and we encountered a directory we couldn't search. + * Expand a ~user */ - free(path); - return (GLOB_ABORTED); + if ((pwd = getpwnam((char *)patbuf)) == NULL) + return (pattern); + else + h = pwd->pw_dir; } - i = gp->gl_pathc - ipathc; - if (i >= 1 && !(flags & GLOB_NOSORT)) { - qsort((char *)(gp->gl_pathp+ipathc), i, sizeof (char *), - pstrcmp); - } - if (i == 0) { - if (flags & GLOB_NOCHECK) - (void) append(gp, pattern); - else - rv = GLOB_NOMATCH; + /* Copy the home directory */ + lenh = strlen(h) + 1; + for (b = patbuf; b < eb && *h != EOS; b++) { + if ((n = mbtowc(&c, h, lenh)) > 0) { + h += n; + lenh -= n; + b->w_at = 0; + b->w_wc = c; + } else if (n < 0) { + return (pattern); + } else { + break; + } } - gp->gl_pathp[gp->gl_pathc] = NULL; - free(path); - return (rv); + /* Append the rest of the pattern */ + while (b < eb && (*b++ = *p++).w_wc != EOS) + ; + b->w_at = 0; + b->w_wc = EOS; + + return (patbuf); } +static int +g_charclass(const wcat_t **patternp, wcat_t **bufnextp) +{ + const wcat_t *pattern = *patternp + 1; + wcat_t *bufnext = *bufnextp; + const wcat_t *colon; + char cbuf[MB_LEN_MAX + 32]; + wctype_t cc; + size_t len; + + if ((colon = g_strchr(pattern, COLON)) == NULL || + colon[1].w_wc != RBRACKET) + return (1); /* not a character class */ + + len = (size_t)(colon - pattern); + if (len + MB_LEN_MAX + 1 > sizeof (cbuf)) + return (-1); /* invalid character class */ + { + wchar_t w; + const wcat_t *s1 = pattern; + char *s2 = cbuf; + size_t n = len; + + /* Copy the string. */ + while (n > 0) { + w = (s1++)->w_wc; + /* Character class names must be ASCII. */ + if (iswascii(w)) { + n--; + *s2++ = w; + } else { + return (-1); /* invalid character class */ + } + } + *s2 = EOS; + } + if ((cc = wctype(cbuf)) == 0) + return (-1); /* invalid character class */ + bufnext->w_at = M_QUOTE; + (bufnext++)->w_wc = M_CLASS; + bufnext->w_at = 0; + (bufnext++)->w_wc = cc; + *bufnextp = bufnext; + *patternp += len + 3; + + return (0); +} /* - * Recursive routine to match glob pattern, and walk directories. + * The main glob() routine: compiles the pattern (optionally processing + * quotes), calls glob1() to do the real pattern matching, and finally + * sorts the list (unless unsorted operation is requested). Returns 0 + * if things went well, nonzero if errors occurred. It is not an error + * to find no matches. */ -int -globit(size_t dend, const char *sp, glob_t *gp, int flags, - int (*errfn)(const char *, int), char **path) +static int +glob0(const wcat_t *pattern, glob_t *pglob, struct glob_lim *limitp, + int (*errfunc)(const char *, int)) { - size_t n; - size_t m; - ssize_t end = 0; /* end of expanded directory */ - char *pat = (char *)sp; /* pattern component */ - char *dp = (*path) + dend; - int expand = 0; /* path has pattern */ - char *cp; - struct stat64 sb; - DIR *dirp; - struct dirent64 *d; - int err; + const wcat_t *qpatnext; + int err, oldpathc; + wchar_t c; + int a; + wcat_t *bufnext, patbuf[MAXPATHLEN]; - for (;;) - switch (*dp++ = *(unsigned char *)sp++) { - case '\0': /* end of source path */ - if (expand) - goto Expand; - else { - if (!(flags & GLOB_NOCHECK) || - flags & (GLOB__CHECK|GLOB_MARK)) - if (stat64(*path, &sb) < 0) { - return (0); - } - if (flags & GLOB_MARK && S_ISDIR(sb.st_mode)) { - *dp = '\0'; - *--dp = '/'; + qpatnext = globtilde(pattern, patbuf, MAXPATHLEN, pglob); + oldpathc = pglob->gl_pathc; + bufnext = patbuf; + + /* + * We don't need to check for buffer overflow any more. + * The pattern has already been copied to an internal buffer. + */ + while ((a = qpatnext->w_at), (c = (qpatnext++)->w_wc) != EOS) { + switch (c) { + case LBRACKET: + if (a != 0) { + bufnext->w_at = a; + (bufnext++)->w_wc = c; + break; + } + a = qpatnext->w_at; + c = qpatnext->w_wc; + if (a == 0 && c == NOT) + ++qpatnext; + if (qpatnext->w_wc == EOS || + g_strchr(qpatnext+1, RBRACKET) == NULL) { + bufnext->w_at = 0; + (bufnext++)->w_wc = LBRACKET; + if (a == 0 && c == NOT) + --qpatnext; + break; + } + bufnext->w_at = M_QUOTE; + (bufnext++)->w_wc = M_SET; + if (a == 0 && c == NOT) { + bufnext->w_at = M_QUOTE; + (bufnext++)->w_wc = M_NOT; + } + a = qpatnext->w_at; + c = (qpatnext++)->w_wc; + do { + if (a == 0 && c == LBRACKET && + qpatnext->w_wc == COLON) { + do { + err = g_charclass(&qpatnext, + &bufnext); + if (err) + break; + a = qpatnext->w_at; + c = (qpatnext++)->w_wc; + } while (a == 0 && c == LBRACKET && + qpatnext->w_wc == COLON); + if (err == -1 && + !(pglob->gl_flags & GLOB_NOCHECK)) + return (GLOB_NOMATCH); + if (a == 0 && c == RBRACKET) + break; } - if (append(gp, *path) < 0) { - return (GLOB_NOSPACE); + bufnext->w_at = a; + (bufnext++)->w_wc = c; + if (qpatnext->w_at == 0 && + qpatnext->w_wc == RANGE) { + a = qpatnext[1].w_at; + c = qpatnext[1].w_wc; + if (qpatnext[1].w_at != 0 || + qpatnext[1].w_wc != RBRACKET) { + bufnext->w_at = M_QUOTE; + (bufnext++)->w_wc = M_RNG; + bufnext->w_at = a; + (bufnext++)->w_wc = c; + qpatnext += 2; + } } - return (0); + a = qpatnext->w_at; + c = (qpatnext++)->w_wc; + } while (a != 0 || c != RBRACKET); + pglob->gl_flags |= GLOB_MAGCHAR; + bufnext->w_at = M_QUOTE; + (bufnext++)->w_wc = M_END; + break; + case QUESTION: + if (a != 0) { + bufnext->w_at = a; + (bufnext++)->w_wc = c; + break; } - /*NOTREACHED*/ - - case '*': - case '?': - case '[': - case '\\': - ++expand; + pglob->gl_flags |= GLOB_MAGCHAR; + bufnext->w_at = M_QUOTE; + (bufnext++)->w_wc = M_ONE; break; - - case '/': - if (expand) - goto Expand; - end = dp - *path; - pat = (char *)sp; + case STAR: + if (a != 0) { + bufnext->w_at = a; + (bufnext++)->w_wc = c; + break; + } + pglob->gl_flags |= GLOB_MAGCHAR; + /* + * collapse adjacent stars to one, + * to avoid exponential behavior + */ + if (bufnext == patbuf || + bufnext[-1].w_at != M_QUOTE || + bufnext[-1].w_wc != M_ALL) { + bufnext->w_at = M_QUOTE; + (bufnext++)->w_wc = M_ALL; + } break; + default: + bufnext->w_at = a; + (bufnext++)->w_wc = c; + break; + } + } + bufnext->w_at = 0; + bufnext->w_wc = EOS; - Expand: - /* determine directory and open it */ - (*path)[end] = '\0'; - dirp = opendir(**path == '\0' ? "." : *path); - if (dirp == NULL) { - if (errfn != 0 && errfn(*path, errno) != 0 || - flags&GLOB_ERR) { - return (GLOB_ABORTED); - } - return (0); + if ((err = glob1(patbuf, patbuf+MAXPATHLEN-1, pglob, limitp, errfunc)) + != 0) + 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) { + if ((pglob->gl_flags & GLOB_NOCHECK) || + ((pglob->gl_flags & GLOB_NOMAGIC) && + !(pglob->gl_flags & GLOB_MAGCHAR))) + return (globextend(pattern, pglob, limitp, NULL)); + else + return (GLOB_NOMATCH); + } + if (!(pglob->gl_flags & GLOB_NOSORT)) { + if ((pglob->gl_flags & GLOB_KEEPSTAT)) { + /* Keep the paths and stat info synced during sort */ + struct glob_path_stat *path_stat; + int i; + int n = pglob->gl_pathc - oldpathc; + int o = pglob->gl_offs + oldpathc; + + if ((path_stat = calloc(n, sizeof (*path_stat))) == + NULL) + return (GLOB_NOSPACE); + for (i = 0; i < n; i++) { + path_stat[i].gps_path = pglob->gl_pathv[o + i]; + path_stat[i].gps_stat = pglob->gl_statv[o + i]; + } + qsort(path_stat, n, sizeof (*path_stat), compare_gps); + for (i = 0; i < n; i++) { + pglob->gl_pathv[o + i] = path_stat[i].gps_path; + pglob->gl_statv[o + i] = path_stat[i].gps_stat; } + free(path_stat); + } else { + qsort(pglob->gl_pathv + pglob->gl_offs + oldpathc, + pglob->gl_pathc - oldpathc, sizeof (char *), + compare); + } + } + return (0); +} + +static int +compare(const void *p, const void *q) +{ + return (strcmp(*(char **)p, *(char **)q)); +} + +static int +compare_gps(const void *_p, const void *_q) +{ + const struct glob_path_stat *p = (const struct glob_path_stat *)_p; + const struct glob_path_stat *q = (const struct glob_path_stat *)_q; + + return (strcmp(p->gps_path, q->gps_path)); +} - /* extract pattern component */ - n = sp - pat; - if ((cp = malloc(n)) == NULL) { - (void) closedir(dirp); +static int +glob1(wcat_t *pattern, wcat_t *pattern_last, glob_t *pglob, + struct glob_lim *limitp, int (*errfunc)(const char *, int)) +{ + wcat_t pathbuf[MAXPATHLEN]; + + /* A null pathname is invalid -- POSIX 1003.1 sect. 2.4. */ + if (pattern->w_wc == EOS) + return (0); + return (glob2(pathbuf, pathbuf+MAXPATHLEN-1, + pathbuf, pathbuf+MAXPATHLEN-1, + pattern, pattern_last, pglob, limitp, errfunc)); +} + +/* + * 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 int +glob2(wcat_t *pathbuf, wcat_t *pathbuf_last, wcat_t *pathend, + wcat_t *pathend_last, wcat_t *pattern, wcat_t *pattern_last, + glob_t *pglob, struct glob_lim *limitp, int (*errfunc)(const char *, int)) +{ + struct stat sb; + wcat_t *p, *q; + int anymeta; + + /* + * Loop over pattern segments until end of pattern or until + * segment with meta character found. + */ + for (anymeta = 0; ; ) { + if (pattern->w_wc == EOS) { /* End of pattern? */ + pathend->w_at = 0; + pathend->w_wc = EOS; + + if ((pglob->gl_flags & GLOB_LIMIT) && + limitp->glim_stat++ >= GLOB_LIMIT_STAT) { + errno = 0; + pathend->w_at = 0; + (pathend++)->w_wc = SEP; + pathend->w_at = 0; + pathend->w_wc = EOS; return (GLOB_NOSPACE); } - pat = memcpy(cp, pat, n); - pat[n-1] = '\0'; - if (*--sp != '\0') - flags |= GLOB__CHECK; - - /* expand path to max. expansion */ - n = dp - *path; - *path = realloc(*path, - strlen(*path) + NAME_MAX + strlen(sp) + 1); - if (*path == NULL) { - (void) closedir(dirp); - free(pat); + if (g_lstat(pathbuf, &sb, pglob)) + return (0); + + if (((pglob->gl_flags & GLOB_MARK) && + (pathend[-1].w_at != 0 || + pathend[-1].w_wc != SEP)) && + (S_ISDIR(sb.st_mode) || + (S_ISLNK(sb.st_mode) && + (g_stat(pathbuf, &sb, pglob) == 0) && + S_ISDIR(sb.st_mode)))) { + if (pathend+1 > pathend_last) + return (GLOB_NOSPACE); + pathend->w_at = 0; + (pathend++)->w_wc = SEP; + pathend->w_at = 0; + pathend->w_wc = EOS; + } + ++pglob->gl_matchc; + return (globextend(pathbuf, pglob, limitp, &sb)); + } + + /* Find end of next segment, copy tentatively to pathend. */ + q = pathend; + p = pattern; + while (p->w_wc != EOS && p->w_wc != SEP) { + if (ismeta(*p)) + anymeta = 1; + if (q+1 > pathend_last) return (GLOB_NOSPACE); + *q++ = *p++; + } + + if (!anymeta) { /* No expansion, do next segment. */ + pathend = q; + pattern = p; + while (pattern->w_wc == SEP) { + if (pathend+1 > pathend_last) + return (GLOB_NOSPACE); + *pathend++ = *pattern++; } - dp = (*path) + n; - - /* read directory and match entries */ - err = 0; - while ((d = readdir64(dirp)) != NULL) { - cp = d->d_name; - if ((flags&GLOB_NOESCAPE) - ? fnmatch(pat, cp, FNM_PERIOD|FNM_NOESCAPE) - : fnmatch(pat, cp, FNM_PERIOD)) - continue; - - n = strlen(cp); - (void) memcpy((*path) + end, cp, n); - m = dp - *path; - err = globit(end+n, sp, gp, flags, errfn, path); - dp = (*path) + m; /* globit can move path */ - if (err != 0) - break; + } else { + /* Need expansion, recurse. */ + return (glob3(pathbuf, pathbuf_last, pathend, + pathend_last, pattern, p, pattern_last, + pglob, limitp, errfunc)); + } + } + /* NOTREACHED */ +} + +static int +glob3(wcat_t *pathbuf, wcat_t *pathbuf_last, wcat_t *pathend, + wcat_t *pathend_last, wcat_t *pattern, wcat_t *restpattern, + wcat_t *restpattern_last, glob_t *pglob, struct glob_lim *limitp, + int (*errfunc)(const char *, int)) +{ + struct dirent *dp; + DIR *dirp; + int err; + 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. + */ + struct dirent *(*readdirfunc)(void *); + + if (pathend > pathend_last) + return (GLOB_NOSPACE); + pathend->w_at = 0; + pathend->w_wc = EOS; + errno = 0; + + if ((dirp = g_opendir(pathbuf, pglob)) == NULL) { + /* TODO: don't call for ENOENT or ENOTDIR? */ + if (errfunc) { + if (g_Ctoc(pathbuf, buf, sizeof (buf))) + return (GLOB_ABORTED); + if (errfunc(buf, errno) || + pglob->gl_flags & GLOB_ERR) + return (GLOB_ABORTED); + } + return (0); + } + + err = 0; + + /* Search directory for matching names. */ + if (pglob->gl_flags & GLOB_ALTDIRFUNC) + readdirfunc = pglob->gl_readdir; + else + readdirfunc = (struct dirent *(*)(void *))readdir; + while ((dp = (*readdirfunc)(dirp))) { + char *sc; + wcat_t *dc; + int n; + int lensc; + wchar_t w; + + if ((pglob->gl_flags & GLOB_LIMIT) && + limitp->glim_readdir++ >= GLOB_LIMIT_READDIR) { + errno = 0; + pathend->w_at = 0; + (pathend++)->w_wc = SEP; + pathend->w_at = 0; + pathend->w_wc = EOS; + err = GLOB_NOSPACE; + break; + } + + /* Initial DOT must be matched literally. */ + if (dp->d_name[0] == DOT && pattern->w_wc != DOT) + continue; + dc = pathend; + sc = dp->d_name; + lensc = strlen(sc) + 1; + while (dc < pathend_last) { + if ((n = mbtowc(&w, sc, lensc)) <= 0) { + sc += 1; + lensc -= 1; + dc->w_at = 0; + dc->w_wc = EOS; + } else { + sc += n; + lensc -= n; + dc->w_at = 0; + dc->w_wc = w; } + dc++; + if (n <= 0) + break; + } + if (dc >= pathend_last) { + dc->w_at = 0; + dc->w_wc = EOS; + err = GLOB_NOSPACE; + break; + } + if (n < 0) { + err = GLOB_NOMATCH; + break; + } - (void) closedir(dirp); - free(pat); - return (err); + if (!match(pathend, pattern, restpattern, GLOB_LIMIT_RECUR)) { + pathend->w_at = 0; + pathend->w_wc = EOS; + continue; } - /* NOTREACHED */ + err = glob2(pathbuf, pathbuf_last, --dc, pathend_last, + restpattern, restpattern_last, pglob, limitp, + errfunc); + if (err) + break; + } + + if (pglob->gl_flags & GLOB_ALTDIRFUNC) + (*pglob->gl_closedir)(dirp); + else + (void) closedir(dirp); + return (err); } + /* - * Comparison routine for two name arguments, called by qsort. + * Extend the gl_pathv member of a glob_t structure to accommodate a new item, + * add the new item, and update gl_pathc. Avoids excessive reallocation + * by doubling the number of elements each time. Uses gl_pathn to contain + * the number. + * + * 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. */ -int -pstrcmp(const void *npp1, const void *npp2) +static int +globextend(const wcat_t *path, glob_t *pglob, struct glob_lim *limitp, + struct stat *sb) { - return (strcoll(*(char **)npp1, *(char **)npp2)); + char **pathv; + ssize_t i; + size_t allocn, newn, len; + char *copy = NULL; + const wcat_t *p; + struct stat **statv; + char junk[MB_LEN_MAX]; + int n; + + allocn = pglob->gl_pathn; + newn = 2 + pglob->gl_pathc + pglob->gl_offs; + + if (newn <= allocn) { + pathv = pglob->gl_pathv; + if ((pglob->gl_flags & GLOB_KEEPSTAT) != 0) + statv = pglob->gl_statv; + } else { + if (allocn == 0) + allocn = pglob->gl_offs + INITIAL; + allocn *= 2; + if (pglob->gl_offs >= INT_MAX || + pglob->gl_pathc >= INT_MAX || + allocn >= INT_MAX || + SIZE_MAX / sizeof (*pathv) <= allocn || + SIZE_MAX / sizeof (*statv) <= allocn) { + nospace: + for (i = pglob->gl_offs; i < (ssize_t)(newn - 2); + i++) { + if (pglob->gl_pathv && pglob->gl_pathv[i]) + free(pglob->gl_pathv[i]); + if ((pglob->gl_flags & GLOB_KEEPSTAT) != 0 && + pglob->gl_statv && pglob->gl_statv[i]) + free(pglob->gl_statv[i]); + } + if (pglob->gl_pathv) { + free(pglob->gl_pathv); + pglob->gl_pathv = NULL; + } + if ((pglob->gl_flags & GLOB_KEEPSTAT) != 0 && + pglob->gl_statv) { + free(pglob->gl_statv); + pglob->gl_statv = NULL; + } + return (GLOB_NOSPACE); + } + limitp->glim_malloc += allocn * sizeof (*pathv); + pathv = realloc(pglob->gl_pathv, allocn * sizeof (*pathv)); + if (pathv == NULL) + goto nospace; + if ((pglob->gl_flags & GLOB_KEEPSTAT) != 0) { + limitp->glim_malloc += allocn * sizeof (*statv); + statv = realloc(pglob->gl_statv, + allocn * sizeof (*statv)); + if (statv == NULL) + goto nospace; + } + } + pglob->gl_pathn = allocn; + + 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; + + if ((pglob->gl_flags & GLOB_KEEPSTAT) != 0) { + if (pglob->gl_statv == NULL && pglob->gl_offs > 0) { + /* first time around -- clear initial gl_offs items */ + statv += pglob->gl_offs; + for (i = pglob->gl_offs; --i >= 0; ) + *--statv = NULL; + } + pglob->gl_statv = statv; + if (sb == NULL) + statv[pglob->gl_offs + pglob->gl_pathc] = NULL; + else { + limitp->glim_malloc += sizeof (**statv); + if ((statv[pglob->gl_offs + pglob->gl_pathc] = + malloc(sizeof (**statv))) == NULL) + goto copy_error; + (void) memcpy(statv[pglob->gl_offs + pglob->gl_pathc], + sb, sizeof (*sb)); + } + statv[pglob->gl_offs + pglob->gl_pathc + 1] = NULL; + } + + len = MB_LEN_MAX; + p = path; + while ((n = wctomb(junk, p->w_wc)) > 0) { + len += n; + if ((p++)->w_wc == EOS) + break; + } + if (n < 0) + return (GLOB_NOMATCH); + + limitp->glim_malloc += len; + if ((copy = malloc(len)) != NULL) { + if (g_Ctoc(path, copy, len)) { + free(copy); + return (GLOB_NOSPACE); + } + pathv[pglob->gl_offs + pglob->gl_pathc++] = copy; + } + pathv[pglob->gl_offs + pglob->gl_pathc] = NULL; + + if ((pglob->gl_flags & GLOB_LIMIT) && + limitp->glim_malloc >= GLOB_LIMIT_MALLOC) { + errno = 0; + return (GLOB_NOSPACE); + } + copy_error: + return (copy == NULL ? GLOB_NOSPACE : 0); } + /* - * Add a new matched filename to the glob_t structure, increasing the - * size of that array, as required. + * pattern matching function for filenames. Each occurrence of the * + * pattern causes a recursion level. */ -int -append(glob_t *gp, const char *str) +static int +match(wcat_t *name, wcat_t *pat, wcat_t *patend, int recur) { - char *cp; + int ok, negate_range; + wcat_t c, k; - if ((cp = malloc(strlen(str)+1)) == NULL) - return (GLOB_NOSPACE); - gp->gl_pathp[gp->gl_pathc++] = strcpy(cp, str); + if (recur-- == 0) + return (1); - if ((gp->gl_pathc + gp->gl_offs) >= gp->gl_pathn) { - gp->gl_pathn *= 2; - gp->gl_pathv = (char **)realloc((void *)gp->gl_pathv, - gp->gl_pathn * sizeof (char *)); - if (gp->gl_pathv == NULLCPP) - return (GLOB_NOSPACE); - gp->gl_pathp = gp->gl_pathv + gp->gl_offs; + while (pat < patend) { + c = *pat++; + switch (c.w_wc) { + case M_ALL: + if (c.w_at != M_QUOTE) { + k = *name++; + if (k.w_at != c.w_at || k.w_wc != c.w_wc) + return (0); + break; + } + while (pat < patend && pat->w_at == M_QUOTE && + pat->w_wc == M_ALL) + pat++; /* eat consecutive '*' */ + if (pat == patend) + return (1); + do { + if (match(name, pat, patend, recur)) + return (1); + } while ((name++)->w_wc != EOS); + return (0); + case M_ONE: + if (c.w_at != M_QUOTE) { + k = *name++; + if (k.w_at != c.w_at || k.w_wc != c.w_wc) + return (0); + break; + } + if ((name++)->w_wc == EOS) + return (0); + break; + case M_SET: + if (c.w_at != M_QUOTE) { + k = *name++; + if (k.w_at != c.w_at || k.w_wc != c.w_wc) + return (0); + break; + } + ok = 0; + if ((k = *name++).w_wc == EOS) + return (0); + if ((negate_range = (pat->w_at == M_QUOTE && + pat->w_wc == M_NOT)) != 0) + ++pat; + while (((c = *pat++).w_at != M_QUOTE) || + c.w_wc != M_END) { + if (c.w_at == M_QUOTE && c.w_wc == M_CLASS) { + wcat_t cc; + + cc.w_at = pat->w_at; + cc.w_wc = pat->w_wc; + if (iswctype(k.w_wc, cc.w_wc)) + ok = 1; + ++pat; + } + if (pat->w_at == M_QUOTE && + pat->w_wc == M_RNG) { + if (c.w_wc <= k.w_wc && + k.w_wc <= pat[1].w_wc) + ok = 1; + pat += 2; + } else if (c.w_wc == k.w_wc) + ok = 1; + } + if (ok == negate_range) + return (0); + break; + default: + k = *name++; + if (k.w_at != c.w_at || k.w_wc != c.w_wc) + return (0); + break; + } } - return (0); + return (name->w_wc == EOS); +} + +/* + * Extended globfree() function, selected by #pragma redefine_extname + * in glob.h with the external name _globfree_ext() . + */ +void +_globfree_ext(glob_t *pglob) +{ + int i; + char **pp; + + if (pglob->gl_pathv != NULL) { + pp = pglob->gl_pathv + pglob->gl_offs; + for (i = pglob->gl_pathc; i--; ++pp) + if (*pp) + free(*pp); + free(pglob->gl_pathv); + pglob->gl_pathv = NULL; + } + if ((pglob->gl_flags & GLOB_KEEPSTAT) != 0 && + pglob->gl_statv != NULL) { + for (i = 0; i < pglob->gl_pathc; i++) { + if (pglob->gl_statv[i] != NULL) + free(pglob->gl_statv[i]); + } + free(pglob->gl_statv); + pglob->gl_statv = NULL; + } +} + +static DIR * +g_opendir(wcat_t *str, glob_t *pglob) +{ + char buf[MAXPATHLEN]; + + if (str->w_wc == EOS) + (void) strlcpy(buf, ".", sizeof (buf)); + else { + if (g_Ctoc(str, buf, sizeof (buf))) + return (NULL); + } + + if (pglob->gl_flags & GLOB_ALTDIRFUNC) + return ((*pglob->gl_opendir)(buf)); + + return (opendir(buf)); +} + +static int +g_lstat(wcat_t *fn, struct stat *sb, glob_t *pglob) +{ + char buf[MAXPATHLEN]; + + if (g_Ctoc(fn, buf, sizeof (buf))) + return (-1); + if (pglob->gl_flags & GLOB_ALTDIRFUNC) + return ((*pglob->gl_lstat)(buf, sb)); + return (lstat(buf, sb)); } + +static int +g_stat(wcat_t *fn, struct stat *sb, glob_t *pglob) +{ + char buf[MAXPATHLEN]; + + if (g_Ctoc(fn, buf, sizeof (buf))) + return (-1); + if (pglob->gl_flags & GLOB_ALTDIRFUNC) + return ((*pglob->gl_stat)(buf, sb)); + return (stat(buf, sb)); +} + +static wcat_t * +g_strchr(const wcat_t *str, wchar_t ch) +{ + do { + if (str->w_at == 0 && str->w_wc == ch) + return ((wcat_t *)str); + } while ((str++)->w_wc != EOS); + return (NULL); +} + +static int +g_Ctoc(const wcat_t *str, char *buf, uint_t len) +{ + int n; + wchar_t w; + + while (len >= MB_LEN_MAX) { + w = (str++)->w_wc; + if ((n = wctomb(buf, w)) > 0) { + len -= n; + buf += n; + } + if (n < 0) + break; + if (w == EOS) + return (0); + } + return (1); +} + +/* glob() function with legacy glob structure */ +int +old_glob(const char *pattern, int flags, int (*errfunc)(const char *, int), + old_glob_t *pglob) +{ + + glob_t gl; + int rv; + + flags &= GLOB_POSIX; + + (void) memset(&gl, 0, sizeof (gl)); + + /* + * Copy all the members, old to new. There's + * really no point in micro-optimizing the copying. + * Other members are set to zero. + */ + gl.gl_pathc = pglob->gl_pathc; + gl.gl_pathv = pglob->gl_pathv; + gl.gl_offs = pglob->gl_offs; + gl.gl_pathp = pglob->gl_pathp; + gl.gl_pathn = pglob->gl_pathn; + + rv = _glob_ext(pattern, flags, errfunc, &gl); + + /* + * Copy all the members, new to old. There's + * really no point in micro-optimizing the copying. + */ + pglob->gl_pathc = gl.gl_pathc; + pglob->gl_pathv = gl.gl_pathv; + pglob->gl_offs = gl.gl_offs; + pglob->gl_pathp = gl.gl_pathp; + pglob->gl_pathn = gl.gl_pathn; + + return (rv); +} + +/* globfree() function with legacy glob structure */ +void +old_globfree(old_glob_t *pglob) +{ + glob_t gl; + + (void) memset(&gl, 0, sizeof (gl)); + + /* + * Copy all the members, old to new. There's + * really no point in micro-optimizing the copying. + * Other members are set to zero. + */ + gl.gl_pathc = pglob->gl_pathc; + gl.gl_pathv = pglob->gl_pathv; + gl.gl_offs = pglob->gl_offs; + gl.gl_pathp = pglob->gl_pathp; + gl.gl_pathn = pglob->gl_pathn; + + _globfree_ext(&gl); + + /* + * Copy all the members, new to old. There's + * really no point in micro-optimizing the copying. + */ + pglob->gl_pathc = gl.gl_pathc; + pglob->gl_pathv = gl.gl_pathv; + pglob->gl_offs = gl.gl_offs; + pglob->gl_pathp = gl.gl_pathp; + pglob->gl_pathn = gl.gl_pathn; + +} + +/* End */ |