⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 glob.c

📁 Newlib 嵌入式 C库 标准实现代码
💻 C
📖 第 1 页 / 共 2 页
字号:
/* * Copyright (c) 1989, 1993 *	The Regents of the University of California.  All rights reserved. * * This code is derived from software contributed to Berkeley by * Guido van Rossum. * * 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. All advertising materials mentioning features or use of this software *    must display the following acknowledgement: *	This product includes software developed by the University of *	California, Berkeley and its contributors. * 4. 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. */#if defined(LIBC_SCCS) && !defined(lint)static char sccsid[] = "@(#)glob.c	8.3 (Berkeley) 10/13/93";#endif /* LIBC_SCCS and not lint */#include <sys/cdefs.h>/* * glob(3) -- a superset of the one defined in POSIX 1003.2. * * The [!...] convention to negate a range is supported (SysV, Posix, ksh). * * Optional extra services, controlled by flags not defined by POSIX: * * 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. */#include <sys/param.h>#include <sys/types.h>#include <sys/stat.h>#include <ctype.h>#include <dirent.h>#include <errno.h>#include <glob.h>#include <pwd.h>#include <stdio.h>#include <stdlib.h>#include <string.h>#include <unistd.h>#include "collate.h"#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		','#ifndef DEBUG#define	M_QUOTE		0x8000#define	M_PROTECT	0x4000#define	M_MASK		0xffff#define	M_ASCII		0x00fftypedef u_short Char;#else#define	M_QUOTE		0x80#define	M_PROTECT	0x40#define	M_MASK		0xff#define	M_ASCII		0x7ftypedef char Char;#endif#define	CHAR(c)		((Char)((c)&M_ASCII))#define	META(c)		((Char)((c)|M_QUOTE))#define	M_ALL		META('*')#define	M_END		META(']')#define	M_NOT		META('!')#define	M_ONE		META('?')#define	M_RNG		META('-')#define	M_SET		META('[')#define	ismeta(c)	(((c)&M_QUOTE) != 0)static int	 compare(const void *, const void *);static int	 g_Ctoc(const Char *, char *, u_int);static int	 g_lstat(Char *, struct stat *, glob_t *);static DIR	*g_opendir(Char *, glob_t *);static Char	*g_strchr(Char *, int);#ifdef notdefstatic Char	*g_strcat(Char *, const Char *);#endifstatic int	 g_stat(Char *, struct stat *, glob_t *);static int	 glob0(const Char *, glob_t *, int *);static int	 glob1(Char *, glob_t *, int *);static int	 glob2(Char *, Char *, Char *, Char *, glob_t *, int *);static int	 glob3(Char *, Char *, Char *, Char *, Char *, glob_t *, int *);static int	 globextend(const Char *, glob_t *, int *);static const Char *			 globtilde(const Char *, Char *, size_t, glob_t *);static int	 globexp1(const Char *, glob_t *, int *);static int	 globexp2(const Char *, const Char *, glob_t *, int *, int *);static int	 match(Char *, Char *, Char *);#ifdef DEBUGstatic void	 qprintf(const char *, Char *);#endifintglob(pattern, flags, errfunc, pglob)	const char *pattern;	int flags, (*errfunc)(const char *, int);	glob_t *pglob;{	const u_char *patnext;	int c, limit;	Char *bufnext, *bufend, patbuf[MAXPATHLEN];	patnext = (u_char *) pattern;	if (!(flags & GLOB_APPEND)) {		pglob->gl_pathc = 0;		pglob->gl_pathv = NULL;		if (!(flags & GLOB_DOOFFS))			pglob->gl_offs = 0;	}	if (flags & GLOB_LIMIT) {		limit = pglob->gl_matchc;		if (limit == 0)			limit = ARG_MAX;	} else		limit = 0;	pglob->gl_flags = flags & ~GLOB_MAGCHAR;	pglob->gl_errfunc = errfunc;	pglob->gl_matchc = 0;	bufnext = patbuf;	bufend = bufnext + MAXPATHLEN - 1;	if (flags & GLOB_QUOTE) {		/* Protect the quoted characters. */		while (bufnext < bufend && (c = *patnext++) != EOS)			if (c == QUOTE) {				if ((c = *patnext++) == EOS) {					c = QUOTE;					--patnext;				}				*bufnext++ = c | M_PROTECT;			}			else				*bufnext++ = c;	}	else	    while (bufnext < bufend && (c = *patnext++) != EOS)		    *bufnext++ = c;	*bufnext = EOS;	if (flags & GLOB_BRACE)	    return globexp1(patbuf, pglob, &limit);	else	    return glob0(patbuf, pglob, &limit);}/* * Expand recursively a glob {} pattern. When there is no more expansion * invoke the standard globbing routine to glob the rest of the magic * characters */static intglobexp1(pattern, pglob, limit)	const Char *pattern;	glob_t *pglob;	int *limit;{	const Char* ptr = pattern;	int rv;	/* Protect a single {}, for find(1), like csh */	if (pattern[0] == LBRACE && pattern[1] == RBRACE && pattern[2] == EOS)		return glob0(pattern, pglob, limit);	while ((ptr = (const Char *) g_strchr((Char *) ptr, LBRACE)) != NULL)		if (!globexp2(ptr, pattern, pglob, &rv, limit))			return rv;	return glob0(pattern, pglob, limit);}/* * 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 intglobexp2(ptr, pattern, pglob, rv, limit)	const Char *ptr, *pattern;	glob_t *pglob;	int *rv, *limit;{	int     i;	Char   *lm, *ls;	const Char *pe, *pm, *pl;	Char    patbuf[MAXPATHLEN];	/* copy part up to the brace */	for (lm = patbuf, pm = pattern; pm != ptr; *lm++ = *pm++)		continue;	*lm = EOS;	ls = lm;	/* Find the balanced brace */	for (i = 0, pe = ++ptr; *pe; pe++)		if (*pe == LBRACKET) {			/* Ignore everything between [] */			for (pm = pe++; *pe != RBRACKET && *pe != EOS; pe++)				continue;			if (*pe == EOS) {				/*				 * We could not find a matching RBRACKET.				 * Ignore and just look for RBRACE				 */				pe = pm;			}		}		else if (*pe == LBRACE)			i++;		else if (*pe == RBRACE) {			if (i == 0)				break;			i--;		}	/* Non matching braces; just glob the pattern */	if (i != 0 || *pe == EOS) {		*rv = glob0(patbuf, pglob, limit);		return 0;	}	for (i = 0, pl = pm = ptr; pm <= pe; pm++)		switch (*pm) {		case LBRACKET:			/* Ignore everything between [] */			for (pl = pm++; *pm != RBRACKET && *pm != EOS; pm++)				continue;			if (*pm == 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 == COMMA)				break;			else {				/* Append the current string */				for (lm = ls; (pl < pm); *lm++ = *pl++)					continue;				/*				 * Append the rest of the pattern after the				 * closing brace				 */				for (pl = pe + 1; (*lm++ = *pl++) != EOS;)					continue;				/* Expand the current pattern */#ifdef DEBUG				qprintf("globexp2:", patbuf);#endif				*rv = globexp1(patbuf, pglob, limit);				/* move after the comma, to the next string */				pl = pm + 1;			}			break;		default:			break;		}	*rv = 0;	return 0;}/* * expand tilde from the passwd file. */static const Char *globtilde(pattern, patbuf, patbuf_len, pglob)	const Char *pattern;	Char *patbuf;	size_t patbuf_len;	glob_t *pglob;{	struct passwd *pwd;	char *h;	const Char *p;	Char *b, *eb;	if (*pattern != 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, h = (char *) patbuf;	    h < (char *)eb && *p && *p != SLASH; *h++ = *p++)		continue;	*h = EOS;	if (((char *) patbuf)[0] == EOS) {		/*		 * handle a plain ~ or ~/ by expanding $HOME first (iff		 * we're not running setuid or setgid) and then trying		 * the password file		 */		if (#ifndef	__NETBSD_SYSCALLS		    issetugid() != 0 ||#endif		    (h = getenv("HOME")) == NULL) {/* If we are not EL/IX level 4, we cannot use getpwxxx interfaces */#if !defined(_ELIX_LEVEL) || _ELIX_LEVEL >= 4			if (((h = getlogin()) != NULL &&			     (pwd = getpwnam(h)) != NULL) ||			    (pwd = getpwuid(getuid())) != NULL)				h = pwd->pw_dir;			else#endif /* !_ELIX_LEVEL || _ELIX_LEVEL >= 4 */				return pattern;		}	}	else {		/*		 * Expand a ~user		 */#if !defined(_ELIX_LEVEL) || _ELIX_LEVEL >= 4		if ((pwd = getpwnam((char*) patbuf)) != NULL)			h = pwd->pw_dir;		else#endif /* !_ELIX_LEVEL || _ELIX_LEVEL >= 4 */			return pattern;	}	/* Copy the home directory */	for (b = patbuf; b < eb && *h; *b++ = *h++)		continue;	/* Append the rest of the pattern */	while (b < eb && (*b++ = *p++) != EOS)		continue;	*b = EOS;	return patbuf;}/* * 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. */static intglob0(pattern, pglob, limit)	const Char *pattern;	glob_t *pglob;	int *limit;{	const Char *qpatnext;	int c, err, oldpathc;	Char *bufnext, patbuf[MAXPATHLEN];	qpatnext = globtilde(pattern, patbuf, MAXPATHLEN, pglob);	oldpathc = pglob->gl_pathc;	bufnext = patbuf;	/* We don't need to check for buffer overflow any more. */	while ((c = *qpatnext++) != EOS) {		switch (c) {		case LBRACKET:			c = *qpatnext;			if (c == NOT)				++qpatnext;			if (*qpatnext == EOS ||			    g_strchr((Char *) qpatnext+1, RBRACKET) == NULL) {				*bufnext++ = LBRACKET;				if (c == NOT)					--qpatnext;				break;			}			*bufnext++ = M_SET;

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -