/*	$OpenBSD: glob.c,v 1.47 2017/05/08 14:53:27 millert Exp $ */

/*

 * 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. 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(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/stat.h>

#include <ctype.h>

#include <dirent.h>

#include <errno.h>

#include <glob.h>

#include <limits.h>

#include <pwd.h>

#include <stdint.h>

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <unistd.h>

#include "charclass.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		0x00ff

typedef u_short Char;

#else

#define	M_QUOTE		0x80

#define	M_PROTECT	0x40

#define	M_MASK		0xff

#define	M_ASCII		0x7f

typedef 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	M_CLASS		META(':')

#define	ismeta(c)	(((c)&M_QUOTE) != 0)

#define	GLOB_LIMIT_MALLOC	65536

#define	GLOB_LIMIT_STAT		2048

#define	GLOB_LIMIT_READDIR	16384

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 Char *, char *, u_int);

static int	 g_lstat(Char *, struct stat *, glob_t *);

static DIR	*g_opendir(Char *, glob_t *);

static Char	*g_strchr(const Char *, int);

static int	 g_strncmp(const Char *, const char *, size_t);

static int	 g_stat(Char *, struct stat *, glob_t *);

static int	 glob0(const Char *, glob_t *, struct glob_lim *);

static int	 glob1(Char *, Char *, glob_t *, struct glob_lim *);

static int	 glob2(Char *, Char *, Char *, Char *, Char *, Char *,

		    glob_t *, struct glob_lim *);

static int	 glob3(Char *, Char *, Char *, Char *, Char *,

		    Char *, Char *, glob_t *, struct glob_lim *);

static int	 globextend(const Char *, glob_t *, struct glob_lim *,

		    struct stat *);

static const Char *

		 globtilde(const Char *, Char *, size_t, glob_t *);

static int	 globexp1(const Char *, glob_t *, struct glob_lim *);

static int	 globexp2(const Char *, const Char *, glob_t *,

		    struct glob_lim *);

static int	 match(Char *, Char *, Char *);

#ifdef DEBUG

static void	 qprintf(const char *, Char *);

#endif

int

glob(const char *pattern, int flags, int (*errfunc)(const char *, int),

    glob_t *pglob)

{

	const u_char *patnext;

	int c;

	patnext = (u_char *) pattern;

	}

	else {

		/* Protect the quoted characters. */

					c = QUOTE;

				}

	}

	else

}

/*

 * 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 int

globexp1(const Char *pattern, glob_t *pglob, struct glob_lim *limitp)

{

	const Char* ptr = pattern;

	/* Protect a single {}, for find(1), like csh */

}

/*

 * 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 Char *ptr, const Char *pattern, glob_t *pglob,

    struct glob_lim *limitp)

{

	int     i, rv;

	Char   *lm, *ls;

	const Char *pe, *pm, *pl;

	/* copy part up to the brace */

		;

	ls = lm;

	/* Find the balanced brace */

			/* Ignore everything between [] */

				;

				/*

				 * We could not find a matching RBRACKET.

				 * Ignore and just look for RBRACE

				 */

				pe = pm;

			}

				break;

		}

	/* Non matching braces; just glob the pattern */

		case LBRACKET:

			/* Ignore everything between [] */

				;

				/*

				 * We could not find a matching RBRACKET.

				 * Ignore and just look for RBRACE

				 */

				pm = pl;

			}

			break;

		case LBRACE:

		case RBRACE:

			}

			/* FALLTHROUGH */

		case COMMA:

				break;

			else {

				/* Append the current string */

					;

				/*

				 * Append the rest of the pattern after the

				 * closing brace

				 */

					;

				/* Expand the current pattern */

#ifdef DEBUG

				qprintf("globexp2:", patbuf);

#endif

				/* move after the comma, to the next string */

			}

		default:

			break;

		}

	}

}

/*

 * expand tilde from the passwd file.

 */

static const Char *

globtilde(const Char *pattern, Char *patbuf, size_t patbuf_len, glob_t *pglob)

{

	const Char *p;

	Char *b, *eb;

	/* Copy up to the end of the string or / */

		;

#if 0

	if (h == (char *)eb)

		return what;

#endif

		/*

		 * handle a plain ~ or ~/ by expanding $HOME

		 * first and then trying the password file

		 */

			    &pwd);

			else

		}

	} else {

		/*

		 * Expand a ~user

		 */

		    &pwd);

		else

	}

	/* Copy the home directory */

		;

	/* Append the rest of the pattern */

		;

}

static int

g_strncmp(const Char *s1, const char *s2, size_t n)

{

	int rv = 0;

			break;

			break;

	}

}

static int

g_charclass(const Char **patternp, Char **bufnextp)

{

	const Char *colon;

	struct cclass *cc;

	size_t len;

			break;

	}

}

/*

 * 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 int

glob0(const Char *pattern, glob_t *pglob, struct glob_lim *limitp)

{

	int c, err, oldpathc;

	/* We don't need to check for buffer overflow any more. */

		case LBRACKET:

				break;

			}

					do {

						    &bufnext);

							break;

						break;

				}

				}

		case QUESTION:

		case STAR:

			/* collapse adjacent stars to one,

			 * to avoid exponential behavior

			 */

			break;

		default:

		}

	}

#ifdef DEBUG

	qprintf("glob0:", patbuf);

#endif

	/*

	 * 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.

	 */

		else

	}

			/* Keep the paths and stat info synced during sort */

			struct glob_path_stat *path_stat;

			int i;

			}

			}

			    compare);

		}

	}

}

static int

compare(const void *p, const void *q)

{

}

static int

compare_gps(const void *_p, const void *_q)

{

}

static int

glob1(Char *pattern, Char *pattern_last, glob_t *pglob, struct glob_lim *limitp)

{

	/* A null pathname is invalid -- POSIX 1003.1 sect. 2.4. */

	    pathbuf, pathbuf+PATH_MAX-1,

	    pattern, pattern_last, pglob, limitp));

}

/*

 * 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(Char *pathbuf, Char *pathbuf_last, Char *pathend, Char *pathend_last,

    Char *pattern, Char *pattern_last, glob_t *pglob, struct glob_lim *limitp)

{

	Char *p, *q;

	int anymeta;

	/*

	 * Loop over pattern segments until end of pattern or until

	 * segment with meta character found.

	 */

			}

			}

		}

		/* Find end of next segment, copy tentatively to pathend. */

		q = pathend;

		p = pattern;

		}

			pathend = q;

			pattern = p;

			}

		} else

			/* Need expansion, recurse. */

			    pathend_last, pattern, p, pattern_last,

			    pglob, limitp));

	}

	/* NOTREACHED */

}

static int

glob3(Char *pathbuf, Char *pathbuf_last, Char *pathend, Char *pathend_last,

    Char *pattern, Char *restpattern, Char *restpattern_last, glob_t *pglob,

    struct glob_lim *limitp)

{

	struct dirent *dp;

	DIR *dirp;

	int err;

	/*

	 * 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 *);

		/* TODO: don't call for ENOENT or ENOTDIR? */

		}

	}

	err = 0;

	/* Search directory for matching names. */

	else

		readdirfunc = (struct dirent *(*)(void *))readdir;

		u_char *sc;

		Char *dc;

			err = GLOB_NOSPACE;

		}

		/* Initial DOT must be matched literally. */

		dc = pathend;

			;

			err = 1;

		}

		}

		    restpattern, restpattern_last, pglob, limitp);

	}

	else

}

/*

 * Extend the gl_pathv member of a glob_t structure to accommodate 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 int

globextend(const Char *path, glob_t *pglob, struct glob_lim *limitp,

    struct stat *sb)

{

	char **pathv;

	ssize_t i;

	size_t newn, len;

	char *copy = NULL;

	const Char *p;

	struct stat **statv;

	    SIZE_MAX / sizeof(*statv) <= newn) {

 nospace:

		}

	}

		goto nospace;

		/* first time around -- clear initial gl_offs items */

	}

			goto nospace;

			/* first time around -- clear initial gl_offs items */

		}

		else {

			}

				goto copy_error;

			    sizeof(*sb));

		}

	}

		;

		}

	}

	    GLOB_LIMIT_MALLOC) {

	}

 copy_error:

}

/*

 * pattern matching function for filenames.  Each occurrence of the *

 * pattern causes an iteration.

 *

 * Note, this function differs from the original as per the discussion

 * here: https://research.swtch.com/glob

 *

 * Basically we removed the recursion and made it use the algorithm

 * from Russ Cox to not go quadratic on cases like a file called

 * ("a" x 100) . "x" matched against a pattern like "a*a*a*a*a*a*a*y".

 */

static int

match(Char *name, Char *pat, Char *patend)

{

	int ok, negate_range;

	Char c, k;

	Char *nextp = NULL;

loop:

		case M_ALL:

		case M_ONE:

				goto fail;

			break;

		case M_SET:

			ok = 0;

				goto fail;

				}

			}

				goto fail;

			break;

		default:

				goto fail;

			break;

		}

	}

fail:

		pat = nextp;

		name = nextn;

	}

}

/* Free allocated data belonging to a glob_t structure. */

void

globfree(glob_t *pglob)

{

	int i;

	char **pp;

	}

		}

	}

}

static DIR *

g_opendir(Char *str, glob_t *pglob)

{

	else {

	}