glob.c 19 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82
/*
 * Copyright (c) 1989 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.
 */
#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)glob.c	5.12 (Berkeley) 6/24/91";
#endif /* LIBC_SCCS and not lint */
/*
 * Glob: the interface is a superset of the one defined in POSIX 1003.2,
 * draft 9.
 *
 * 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_ALTNOT:
 *	Use ^ instead of ! for "not".
 * gl_matchc:
 *	Number of matches in the current invocation of glob.
 */

#ifdef WINNT_NATIVE
	#pragma warning(disable:4244)
#endif /* WINNT_NATIVE */

#define Char __Char
#include "sh.h"
#include "glob.h"

#undef Char
#undef QUOTE
#undef TILDE
#undef META
#undef ismeta
#undef Strchr

#ifndef S_ISDIR
#define S_ISDIR(a)	(((a) & S_IFMT) == S_IFDIR)
#endif

#if !defined(S_ISLNK) && defined(S_IFLNK)
#define S_ISLNK(a)	(((a) & S_IFMT) == S_IFLNK)
#endif

#if !defined(S_ISLNK) && !defined(lstat)
#define lstat stat
#endif

typedef unsigned short Char;

83 84 85
static	int	 glob1 		(Char *, glob_t *, int);
static	int	 glob2		(struct strbuf *, const Char *, glob_t *, int);
static	int	 glob3		(struct strbuf *, const Char *, const Char *,
86
				 const Char *, glob_t *, int);
87 88 89 90 91
static	void	 globextend	(const char *, glob_t *);
static	int	 match		(const char *, const Char *, const Char *,
				 int);
static	int	 compare	(const void *, const void *);
static 	DIR	*Opendir	(const char *);
92
#ifdef S_IFLNK
93
static	int	 Lstat		(const char *, struct stat *);
94
#endif
95 96
static	int	 Stat		(const char *, struct stat *sb);
static 	Char 	*Strchr		(Char *, int);
97
#ifdef DEBUG
98
static	void	 qprintf	(const Char *);
99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120
#endif

#define	DOLLAR		'$'
#define	DOT		'.'
#define	EOS		'\0'
#define	LBRACKET	'['
#define	NOT		'!'
#define ALTNOT		'^'
#define	QUESTION	'?'
#define	QUOTE		'\\'
#define	RANGE		'-'
#define	RBRACKET	']'
#define	SEP		'/'
#define	STAR		'*'
#define	TILDE		'~'
#define	UNDERSCORE	'_'

#define	M_META		0x8000
#define M_PROTECT	0x4000
#define	M_MASK		0xffff
#define	M_ASCII		0x00ff

121
#define	LCHAR(c)	((c)&M_ASCII)
122 123 124 125 126 127 128 129 130 131 132
#define	META(c)		((c)|M_META)
#define	M_ALL		META('*')
#define	M_END		META(']')
#define	M_NOT		META('!')
#define	M_ALTNOT	META('^')
#define	M_ONE		META('?')
#define	M_RNG		META('-')
#define	M_SET		META('[')
#define	ismeta(c)	(((c)&M_META) != 0)

int
133
globcharcoll(__Char c1, __Char c2, int cs)
134
{
135 136
#if defined(NLS) && defined(LC_COLLATE) && defined(HAVE_STRCOLL)
# if defined(WIDE_STRINGS)
137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155
    wchar_t s1[2], s2[2];

    if (c1 == c2)
	return (0);
    if (cs) {
	c1 = towlower(c1);
	c2 = towlower(c2);
    } else {
	/* This should not be here, but I'll rather leave it in than engage in
	   a LC_COLLATE flamewar about a shell I don't use... */
	if (iswlower(c1) && iswupper(c2))
	    return (1);
	if (iswupper(c1) && iswlower(c2))
	    return (-1);
    }
    s1[0] = c1;
    s2[0] = c2;
    s1[1] = s2[1] = '\0';
    return wcscoll(s1, s2);
156
# else /* not WIDE_STRINGS */
157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191
    char s1[2], s2[2];

    if (c1 == c2)
	return (0);
    /*
     * From kevin lyda <kevin@suberic.net>:
     * strcoll does not guarantee case sorting, so we pre-process now:
     */
    if (cs) {
	c1 = islower(c1) ? c1 : tolower(c1);
	c2 = islower(c2) ? c2 : tolower(c2);
    } else {
	if (islower(c1) && isupper(c2))
	    return (1);
	if (isupper(c1) && islower(c2))
	    return (-1);
    }
    s1[0] = c1;
    s2[0] = c2;
    s1[1] = s2[1] = '\0';
    return strcoll(s1, s2);
# endif
#else
    return (c1 - c2);
#endif
}

/*
 * Need to dodge two kernel bugs:
 * opendir("") != opendir(".")
 * NAMEI_BUG: on plain files trailing slashes are ignored in some kernels.
 *            POSIX specifies that they should be ignored in directories.
 */

static DIR *
192
Opendir(const char *str)
193 194 195 196 197 198 199 200 201 202 203
{
#if defined(hpux) || defined(__hpux)
    struct stat st;
#endif

    if (!*str)
	return (opendir("."));
#if defined(hpux) || defined(__hpux)
    /*
     * Opendir on some device files hangs, so avoid it
     */
204
    if (stat(str, &st) == -1 || !S_ISDIR(st.st_mode))
205 206
	return NULL;
#endif
207
    return opendir(str);
208 209 210 211
}

#ifdef S_IFLNK
static int
212
Lstat(const char *fn, struct stat *sb)
213
{
214
    int st;
215

216
    st = lstat(fn, sb);
217
# ifdef NAMEI_BUG
218 219
    if (*fn != 0 && strend(fn)[-1] == '/' && !S_ISDIR(sb->st_mode))
	st = -1;
220
# endif	/* NAMEI_BUG */
221
    return st;
222 223 224 225 226 227
}
#else
#define Lstat Stat
#endif /* S_IFLNK */

static int
228
Stat(const char *fn, struct stat *sb)
229
{
230
    int st;
231

232
    st = stat(fn, sb);
233
#ifdef NAMEI_BUG
234 235
    if (*fn != 0 && strend(fn)[-1] == '/' && !S_ISDIR(sb->st_mode))
	st = -1;
236
#endif /* NAMEI_BUG */
237
    return st;
238 239 240
}

static Char *
241
Strchr(Char *str, int ch)
242 243 244 245 246 247 248 249 250 251
{
    do
	if (*str == ch)
	    return (str);
    while (*str++);
    return (NULL);
}

#ifdef DEBUG
static void
252
qprintf(const Char *s)
253
{
254
    const Char *p;
255 256 257 258 259 260 261 262 263 264 265 266 267 268

    for (p = s; *p; p++)
	printf("%c", *p & 0xff);
    printf("\n");
    for (p = s; *p; p++)
	printf("%c", *p & M_PROTECT ? '"' : ' ');
    printf("\n");
    for (p = s; *p; p++)
	printf("%c", *p & M_META ? '_' : ' ');
    printf("\n");
}
#endif /* DEBUG */

static int
269
compare(const void *p, const void *q)
270
{
271 272
#if defined(NLS) && defined(HAVE_STRCOLL)
    return (strcoll(*(char *const *) p, *(char *const *) q));
273
#else
274 275
    return (strcmp(*(char *const *) p, *(char *const *) q));
#endif /* NLS && HAVE_STRCOLL */
276 277 278 279 280 281 282 283 284 285
}

/*
 * 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
286 287
glob(const char *pattern, int flags, int (*errfunc) (const char *, int),
     glob_t *pglob)
288 289
{
    int     err, oldpathc;
290 291
    Char *bufnext, m_not;
    const unsigned char *patnext;
292
    int     c, not;
293
    Char *qpatnext, *patbuf;
294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316
    int     no_match;

    patnext = (const unsigned char *) pattern;
    if (!(flags & GLOB_APPEND)) {
	pglob->gl_pathc = 0;
	pglob->gl_pathv = NULL;
	if (!(flags & GLOB_DOOFFS))
	    pglob->gl_offs = 0;
    }
    pglob->gl_flags = flags & ~GLOB_MAGCHAR;
    pglob->gl_errfunc = errfunc;
    oldpathc = pglob->gl_pathc;
    pglob->gl_matchc = 0;

    if (pglob->gl_flags & GLOB_ALTNOT) {
	not = ALTNOT;
	m_not = M_ALTNOT;
    }
    else {
	not = NOT;
	m_not = M_NOT;
    }

317
    patbuf = xmalloc((strlen(pattern) + 1) * sizeof(*patbuf));
318 319 320 321 322 323 324 325
    bufnext = patbuf;

    no_match = *patnext == not;
    if (no_match)
	patnext++;

    if (flags & GLOB_QUOTE) {
	/* Protect the quoted characters */
326
	while ((c = *patnext++) != EOS) {
327 328 329 330 331
#ifdef WIDE_STRINGS
	    int len;
	    
	    len = mblen((const char *)(patnext - 1), MB_LEN_MAX);
	    if (len == -1)
332
		TCSH_IGNORE(mblen(NULL, 0));
333
	    else if (len > 1) {
334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349
		*bufnext++ = (Char) c;
		while (--len != 0)
		    *bufnext++ = (Char) (*patnext++ | M_PROTECT);
	    } else
#endif /* WIDE_STRINGS */
	    if (c == QUOTE) {
		if ((c = *patnext++) == EOS) {
		    c = QUOTE;
		    --patnext;
		}
		*bufnext++ = (Char) (c | M_PROTECT);
	    }
	    else
		*bufnext++ = (Char) c;
	}
    }
350 351
    else
	while ((c = *patnext++) != EOS)
352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375
	    *bufnext++ = (Char) c;
    *bufnext = EOS;

    bufnext = patbuf;
    qpatnext = patbuf;
    while ((c = *qpatnext++) != EOS) {
	switch (c) {
	case LBRACKET:
	    c = *qpatnext;
	    if (c == not)
		++qpatnext;
	    if (*qpatnext == EOS ||
		Strchr(qpatnext + 1, RBRACKET) == NULL) {
		*bufnext++ = LBRACKET;
		if (c == not)
		    --qpatnext;
		break;
	    }
	    pglob->gl_flags |= GLOB_MAGCHAR;
	    *bufnext++ = M_SET;
	    if (c == not)
		*bufnext++ = m_not;
	    c = *qpatnext++;
	    do {
376
		*bufnext++ = LCHAR(c);
377 378 379
		if (*qpatnext == RANGE &&
		    (c = qpatnext[1]) != RBRACKET) {
		    *bufnext++ = M_RNG;
380
		    *bufnext++ = LCHAR(c);
381 382 383 384 385 386 387 388 389 390 391
		    qpatnext += 2;
		}
	    } while ((c = *qpatnext++) != RBRACKET);
	    *bufnext++ = M_END;
	    break;
	case QUESTION:
	    pglob->gl_flags |= GLOB_MAGCHAR;
	    *bufnext++ = M_ONE;
	    break;
	case STAR:
	    pglob->gl_flags |= GLOB_MAGCHAR;
392 393
	    /* collapse adjacent stars to one [or three if globstar],
	     * to avoid exponential behavior
394
	     */
395 396 397 398
	    if (bufnext == patbuf || bufnext[-1] != M_ALL ||
	       ((flags & GLOB_STAR) != 0 && 
		 (bufnext - 1 == patbuf || bufnext[-2] != M_ALL ||
		 bufnext - 2 == patbuf || bufnext[-3] != M_ALL)))
399 400 401
		*bufnext++ = M_ALL;
	    break;
	default:
402
	    *bufnext++ = LCHAR(c);
403 404 405 406 407 408 409 410
	    break;
	}
    }
    *bufnext = EOS;
#ifdef DEBUG
    qprintf(patbuf);
#endif

411 412
    if ((err = glob1(patbuf, pglob, no_match)) != 0) {
	xfree(patbuf);
413
	return (err);
414
    }
415 416 417 418 419 420 421 422 423 424

    /*
     * 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 && 
	((flags & GLOB_NOCHECK) || 
	 ((flags & GLOB_NOMAGIC) && !(pglob->gl_flags & GLOB_MAGCHAR)))) {
425 426
	if (!(flags & GLOB_QUOTE))
	    globextend(pattern, pglob);
427
	else {
428 429 430 431 432 433 434 435 436 437 438
	    char *copy, *dest;
	    const char *src;

	    /* copy pattern, interpreting quotes */
	    copy = xmalloc(strlen(pattern) + 1);
	    dest = copy;
	    src = pattern;
	    while (*src != EOS) {
		if (*src == QUOTE) {
		    if (*++src == EOS)
			--src;
439
		}
440
		*dest++ = *src++;
441
	    }
442 443 444
	    *dest = EOS;
	    globextend(copy, pglob);
	    xfree(copy);
445
	}
446 447
	xfree(patbuf);
	return 0;
448 449
    }
    else if (!(flags & GLOB_NOSORT) && (pglob->gl_pathc != oldpathc))
450 451 452
	qsort(pglob->gl_pathv + pglob->gl_offs + oldpathc,
	      pglob->gl_pathc - oldpathc, sizeof(char *), compare);
    xfree(patbuf);
453 454 455 456
    return (0);
}

static int
457
glob1(Char *pattern, glob_t *pglob, int no_match)
458
{
459 460
    struct strbuf pathbuf = strbuf_INIT;
    int err;
461 462 463 464 465 466

    /*
     * a null pathname is invalid -- POSIX 1003.1 sect. 2.4.
     */
    if (*pattern == EOS)
	return (0);
467 468 469
    err = glob2(&pathbuf, pattern, pglob, no_match);
    xfree(pathbuf.s);
    return err;
470 471 472 473 474 475 476 477
}

/*
 * 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
478
glob2(struct strbuf *pathbuf, const Char *pattern, glob_t *pglob, int no_match)
479 480 481
{
    struct stat sbuf;
    int anymeta;
482 483
    const Char *p;
    size_t orig_len;
484 485 486 487 488 489 490 491

    /*
     * loop over pattern segments until end of pattern or until segment with
     * meta character found.
     */
    anymeta = 0;
    for (;;) {
	if (*pattern == EOS) {	/* end of pattern? */
492
	    strbuf_terminate(pathbuf);
493

494
	    if (Lstat(pathbuf->s, &sbuf))
495 496 497
		return (0);

	    if (((pglob->gl_flags & GLOB_MARK) &&
498
		 pathbuf->s[pathbuf->len - 1] != SEP) &&
499 500 501
		(S_ISDIR(sbuf.st_mode)
#ifdef S_IFLNK
		 || (S_ISLNK(sbuf.st_mode) &&
502
		     (Stat(pathbuf->s, &sbuf) == 0) &&
503 504 505
		     S_ISDIR(sbuf.st_mode))
#endif
		 )) {
506 507
		strbuf_append1(pathbuf, SEP);
		strbuf_terminate(pathbuf);
508 509
	    }
	    ++pglob->gl_matchc;
510 511
	    globextend(pathbuf->s, pglob);
	    return 0;
512 513
	}

514
	/* find end of next segment, tentatively copy to pathbuf */
515
	p = pattern;
516
	orig_len = pathbuf->len;
517 518 519
	while (*p != EOS && *p != SEP) {
	    if (ismeta(*p))
		anymeta = 1;
520
	    strbuf_append1(pathbuf, *p++);
521 522 523 524 525
	}

	if (!anymeta) {		/* no expansion, do next segment */
	    pattern = p;
	    while (*pattern == SEP)
526 527 528 529
		strbuf_append1(pathbuf, *pattern++);
	}
	else {			/* need expansion, recurse */
	    pathbuf->len = orig_len;
530
	    return (glob3(pathbuf, pattern, p, pattern, pglob, no_match));
531 532 533 534 535
	}
    }
    /* NOTREACHED */
}

536 537 538 539 540
static size_t
One_Char_mbtowc(__Char *pwc, const Char *s, size_t n)
{
#ifdef WIDE_STRINGS
    char buf[MB_LEN_MAX], *p;
541

542 543 544 545 546 547 548 549 550 551 552 553
    if (n > MB_LEN_MAX)
	n = MB_LEN_MAX;
    p = buf;
    while (p < buf + n && (*p++ = LCHAR(*s++)) != 0)
	;
    return one_mbtowc(pwc, buf, n);
#else
    *pwc = *s & CHAR;
    return 1;
#endif
}
 
554
static int
555
glob3(struct strbuf *pathbuf, const Char *pattern, const Char *restpattern,
556
      const Char *pglobstar, glob_t *pglob, int no_match)
557 558 559
{
    DIR    *dirp;
    struct dirent *dp;
560
    struct stat sbuf;
561 562
    int     err;
    Char m_not = (pglob->gl_flags & GLOB_ALTNOT) ? M_ALTNOT : M_NOT;
563
    size_t orig_len;
564 565
    int globstar = 0;
    int chase_symlinks = 0;
566
    const Char *termstar = NULL;
567

568
    strbuf_terminate(pathbuf);
569 570
    orig_len = pathbuf->len;
    errno = err = 0;
571

572
    while (pglobstar < restpattern) {
573
	__Char wc;
574 575 576
	size_t width = One_Char_mbtowc(&wc, pglobstar, MB_LEN_MAX);
	if ((pglobstar[0] & M_MASK) == M_ALL &&
	    (pglobstar[width] & M_MASK) == M_ALL) {
577
	    globstar = 1;
578 579
	    chase_symlinks = (pglobstar[2 * width] & M_MASK) == M_ALL;
	    termstar = pglobstar + (2 + chase_symlinks) * width;
580 581
	    break;
	}
582
        pglobstar += width;
583 584
    } 

585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603
    if (globstar) {
	err = pglobstar==pattern && termstar==restpattern ?
		*restpattern == EOS ?
		glob2(pathbuf, restpattern - 1, pglob, no_match) :
		glob2(pathbuf, restpattern + 1, pglob, no_match) :
		glob3(pathbuf, pattern, restpattern, termstar, pglob, no_match);
	if (err)
	    return err;
	pathbuf->len = orig_len;
	strbuf_terminate(pathbuf);
    }

    if (*pathbuf->s && (Lstat(pathbuf->s, &sbuf) || !S_ISDIR(sbuf.st_mode)
#ifdef S_IFLINK
	     && ((globstar && !chase_symlinks) || !S_ISLNK(sbuf.st_mode))
#endif
	))
	return 0;

604
    if (!(dirp = Opendir(pathbuf->s))) {
605
	/* todo: don't call for ENOENT or ENOTDIR? */
606
	if ((pglob->gl_errfunc && (*pglob->gl_errfunc) (pathbuf->s, errno)) ||
607 608 609 610 611 612 613 614 615 616
	    (pglob->gl_flags & GLOB_ERR))
	    return (GLOB_ABEND);
	else
	    return (0);
    }

    /* search directory for matching names */
    while ((dp = readdir(dirp)) != NULL) {
	/* initial DOT must be matched literally */
	if (dp->d_name[0] == DOT && *pattern != DOT)
617 618 619
	    if (!(pglob->gl_flags & GLOB_DOT) || !dp->d_name[1] ||
		(dp->d_name[1] == DOT && !dp->d_name[2]))
		continue; /*unless globdot and not . or .. */
620 621 622
	pathbuf->len = orig_len;
	strbuf_append(pathbuf, dp->d_name);
	strbuf_terminate(pathbuf);
623

624
	if (globstar) {
625
#ifdef S_IFLNK
626 627
	    if (!chase_symlinks &&
		(Lstat(pathbuf->s, &sbuf) || S_ISLNK(sbuf.st_mode)))
628 629
		    continue;
#endif
630 631
	    if (match(pathbuf->s + orig_len, pattern, termstar,
		(int)m_not) == no_match) 
632 633 634
		    continue;
	    strbuf_append1(pathbuf, SEP);
	    strbuf_terminate(pathbuf);
635
	    if ((err = glob2(pathbuf, pglobstar, pglob, no_match)) != 0)
636 637 638 639 640 641 642 643
		break;
	} else {
	    if (match(pathbuf->s + orig_len, pattern, restpattern,
		(int) m_not) == no_match)
		continue;
	    if ((err = glob2(pathbuf, restpattern, pglob, no_match)) != 0)
		break;
	}
644 645
    }
    /* todo: check error from readdir? */
646
    closedir(dirp);
647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664
    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.
 */
665 666
static void
globextend(const char *path, glob_t *pglob)
667 668 669
{
    char **pathv;
    int i;
670
    size_t newsize;
671 672

    newsize = sizeof(*pathv) * (2 + pglob->gl_pathc + pglob->gl_offs);
673
    pathv = xrealloc(pglob->gl_pathv, newsize);
674 675 676 677 678 679 680 681 682

    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;

683
    pathv[pglob->gl_offs + pglob->gl_pathc++] = strsave(path);
684 685 686 687 688 689 690 691
    pathv[pglob->gl_offs + pglob->gl_pathc] = NULL;
}

/*
 * pattern matching function for filenames.  Each occurrence of the *
 * pattern causes a recursion level.
 */
static  int
692
match(const char *name, const Char *pat, const Char *patend, int m_not)
693 694
{
    int ok, negate_range;
695
    Char c;
696 697 698

    while (pat < patend) {
	size_t lwk;
699
	__Char wc, wk;
700 701

	c = *pat; /* Only for M_MASK bits */
702 703
	pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
	lwk = one_mbtowc(&wk, name, MB_LEN_MAX);
704 705
	switch (c & M_MASK) {
	case M_ALL:
706
	    while (pat < patend && (*pat & M_MASK) == M_ALL)  /* eat consecutive '*' */
707
		pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
708 709 710
	    if (pat == patend)
	        return (1);
	    while (!match(name, pat, patend, m_not)) {
711
		if (*name == EOS)
712
		    return (0);
713
		name += lwk;
714
		lwk = one_mbtowc(&wk, name, MB_LEN_MAX);
715
	    }
716
	    return (1);
717 718 719 720 721 722 723 724 725 726 727 728 729
	case M_ONE:
	    if (*name == EOS)
		return (0);
	    name += lwk;
	    break;
	case M_SET:
	    ok = 0;
	    if (*name == EOS)
		return (0);
	    name += lwk;
	    if ((negate_range = ((*pat & M_MASK) == m_not)) != 0)
		++pat;
	    while ((*pat & M_MASK) != M_END) {
730
		pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
731
		if ((*pat & M_MASK) == M_RNG) {
732 733
		    __Char wc2;

734
		    pat++;
735
		    pat += One_Char_mbtowc(&wc2, pat, MB_LEN_MAX);
736 737 738 739 740 741
		    if (globcharcoll(wc, wk, 0) <= 0 &&
			globcharcoll(wk, wc2, 0) <= 0)
			ok = 1;
		} else if (wc == wk)
		    ok = 1;
	    }
742
	    pat += One_Char_mbtowc(&wc, pat, MB_LEN_MAX);
743 744 745 746
	    if (ok == negate_range)
		return (0);
	    break;
	default:
747
	    if (*name == EOS || samecase(wk) != samecase(wc))
748
		return (0);
749
	    name += lwk;
750 751 752 753 754 755 756 757
	    break;
	}
    }
    return (*name == EOS);
}

/* free allocated data belonging to a glob_t structure */
void
758
globfree(glob_t *pglob)
759 760 761 762 763 764 765 766
{
    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)
767 768
		xfree(*pp), *pp = NULL;
	xfree(pglob->gl_pathv), pglob->gl_pathv = NULL;
769 770
    }
}