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 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 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 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750
|
/*
* Copyright (c) 1980 Regents of the University of California.
* All rights reserved.
*
* 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.
*/
/*
* From: @(#)glob.c 5.9 (Berkeley) 2/25/91
*/
char glob_rcsid[] =
"$Id: glob.c,v 1.9 1999/10/02 13:25:23 netbug Exp $";
/*
* C-shell glob for random programs.
*/
#include <sys/param.h>
#include <sys/stat.h>
#include <dirent.h>
#include <pwd.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "ftp_var.h" /* for protos only */
#include "glob.h"
#define QUOTE 0200
#define TRIM 0177
#define eq(a,b) (strcmp(a, b)==0)
#define GAVSIZ (ARG_MAX/6)
#define isdir(d) ((d.st_mode & S_IFMT) == S_IFDIR)
const char *globerr;
extern const char *home;
typedef struct {
const char *text;
} centry;
typedef struct {
char *text;
} entry;
static entry *gargv; /* Pointer to the (stack) arglist */
static entry *sortbas;
static int gargc; /* Number args in gargv */
static int gnleft; /* space left before we hit max args length */
static short gflag;
static int globcnt;
static const char *globchars = "`{[*?";
static char *gpath;
static char *gpathp, *lastgpathp;
static int globbed;
static const char *entp;
static int tglob(char c);
static char *strspl(const char *, const char *);
static char *strend(char *);
static char **copyblk(entry *);
static char **cloneblk(const centry *);
static void addpath(char c);
static void acollect(const char *);
static void collect(const char *);
static void expand(const char *);
static void Gcat(const char *, const char *);
static void ginit(entry *);
static void matchdir(const char *);
static void rscan(centry *, int (*f)(char));
static void sort(void);
static void efree(entry *);
static int amatch(const char *, const char *);
static int execbrc(const char *, const char *);
static int match(const char *, const char *);
static int gethdir(char *homedir);
static int letter(char c);
static int digit(char c);
static int any(int c, const char *s);
char **
ftpglob(const char *v)
{
char agpath[BUFSIZ];
entry agargv[GAVSIZ];
centry vv[2];
vv[0].text = v;
vv[1].text = NULL;
gflag = 0;
rscan(vv, tglob);
if (gflag == 0) {
return cloneblk(vv);
}
globerr = 0;
gpath = agpath;
gpathp = gpath;
*gpathp = 0;
/* added ()'s to sizeof, (ambigious math for the compiler) */
lastgpathp = agpath + (sizeof(agpath)- 2);
ginit(agargv);
globcnt = 0;
collect(v);
if (globcnt == 0 && (gflag&1)) {
efree(gargv);
gargv = NULL;
return NULL;
}
else {
char **rv = copyblk(gargv);
gargv = NULL;
return rv;
}
}
static
void
ginit(entry *agargv)
{
agargv[0].text = NULL;
gargv = agargv;
sortbas = agargv;
gargc = 0;
gnleft = ARG_MAX - 4;
}
static
void
collect(const char *as)
{
if (eq(as, "{") || eq(as, "{}")) {
Gcat(as, "");
sort();
}
else {
acollect(as);
}
}
static
void
acollect(const char *as)
{
int ogargc = gargc;
gpathp = gpath; *gpathp = 0; globbed = 0;
expand(as);
if (gargc != ogargc)
sort();
}
static
void
sort(void)
{
entry *p1, *p2, c;
entry *Gvp = &gargv[gargc];
p1 = sortbas;
while (p1 < Gvp-1) {
p2 = p1;
while (++p2 < Gvp)
if (strcmp(p1->text, p2->text) > 0)
c = *p1, *p1 = *p2, *p2 = c;
p1++;
}
sortbas = Gvp;
}
static
void
expand(const char *as)
{
const char *cs;
const char *oldcs;
char *sgpathp;
struct stat stb;
sgpathp = gpathp;
cs = as;
if (*cs == '~' && gpathp == gpath) {
addpath('~');
for (cs++; letter(*cs) || digit(*cs) || *cs == '-';)
addpath(*cs++);
if (!*cs || *cs == '/') {
if (gpathp != gpath + 1) {
*gpathp = 0;
if (gethdir(gpath + 1))
globerr = "Unknown user name after ~";
/*
* Was: strcpy(gpath, gpath + 1);
* but that's WRONG
*/
memmove(gpath, gpath+1, strlen(gpath+1)+1);
}
else {
(void) strcpy(gpath, home);
}
gpathp = strend(gpath);
}
}
while (!any(*cs, globchars)) {
if (*cs == 0) {
if (!globbed)
Gcat(gpath, "");
else if (stat(gpath, &stb) >= 0) {
Gcat(gpath, "");
globcnt++;
}
goto endit;
}
addpath(*cs++);
}
oldcs = cs;
while (cs > as && *cs != '/')
cs--, gpathp--;
if (*cs == '/')
cs++, gpathp++;
*gpathp = 0;
if (*oldcs == '{') {
(void) execbrc(cs, ((char *)0));
return;
}
matchdir(cs);
endit:
gpathp = sgpathp;
*gpathp = 0;
}
static
void
matchdir(const char *pattern)
{
struct stat stb;
register struct dirent *dp;
DIR *dirp;
#if 0
#ifdef __linux__
if (gpath == NULL || *gpath == '\0')
gpath = "./";
#endif
#endif
dirp = opendir((!gpath || !*gpath) ? "./" : gpath);
if (dirp == NULL) {
if (globbed)
return;
goto patherr2;
}
if (fstat(dirfd(dirp), &stb) < 0)
goto patherr1;
if (!isdir(stb)) {
errno = ENOTDIR;
goto patherr1;
}
while ((dp = readdir(dirp)) != NULL) {
if (dp->d_ino == 0)
continue;
if (match(dp->d_name, pattern)) {
Gcat(gpath, dp->d_name);
globcnt++;
}
}
closedir(dirp);
return;
patherr1:
closedir(dirp);
patherr2:
globerr = "Bad directory components";
}
static
int
execbrc(const char *p, const char *s)
{
char restbuf[BUFSIZ + 2];
const char *pe, *pm, *pl;
int brclev = 0;
char *lm, *sgpathp;
for (lm = restbuf; *p != '{'; *lm++ = *p++)
continue;
for (pe = ++p; *pe; pe++)
switch (*pe) {
case '{':
brclev++;
continue;
case '}':
if (brclev == 0)
goto pend;
brclev--;
continue;
case '[':
for (pe++; *pe && *pe != ']'; pe++)
continue;
continue;
}
pend:
brclev = 0;
for (pl = pm = p; pm <= pe; pm++)
switch (*pm & (QUOTE|TRIM)) {
case '{':
brclev++;
continue;
case '}':
if (brclev) {
brclev--;
continue;
}
goto doit;
case ','|QUOTE:
case ',':
if (brclev)
continue;
doit:
#if 0
savec = *pm;
*pm = 0;
strcpy(lm, pl);
*pm = savec;
#else
strncpy(lm, pl, pm-pl);
lm[pm-pl] = 0;
#endif
(void) strcat(restbuf, pe + 1);
if (s == 0) {
sgpathp = gpathp;
expand(restbuf);
gpathp = sgpathp;
*gpathp = 0;
}
else if (amatch(s, restbuf)) {
return (1);
}
sort();
pl = pm + 1;
if (brclev)
return (0);
continue;
case '[':
for (pm++; *pm && *pm != ']'; pm++)
continue;
if (!*pm)
pm--;
continue;
}
if (brclev)
goto doit;
return (0);
}
static
int
match(const char *s, const char *p)
{
int c;
const char *sentp;
char sglobbed = globbed;
if (*s == '.' && *p != '.')
return (0);
sentp = entp;
entp = s;
c = amatch(s, p);
entp = sentp;
globbed = sglobbed;
return (c);
}
static
int
amatch(const char *s, const char *p)
{
register int scc;
int ok, lc;
char *sgpathp;
struct stat stb;
int c, cc;
globbed = 1;
for (;;) {
scc = *s++ & TRIM;
switch (c = *p++) {
case '{':
return (execbrc(p - 1, s - 1));
case '[':
ok = 0;
lc = 077777;
while ((cc = *p++) != 0) {
if (cc == ']') {
if (ok)
break;
return (0);
}
if (cc == '-') {
if (lc <= scc && scc <= *p++)
ok++;
} else
if (scc == (lc = cc))
ok++;
}
if (cc == 0) {
if (ok)
p--;
else
return 0;
}
continue;
case '*':
if (!*p)
return (1);
if (*p == '/') {
p++;
goto slash;
}
s--;
do {
if (amatch(s, p))
return (1);
} while (*s++);
return (0);
case 0:
return (scc == 0);
default:
if (c != scc)
return (0);
continue;
case '?':
if (scc == 0)
return (0);
continue;
case '/':
if (scc)
return (0);
slash:
s = entp;
sgpathp = gpathp;
while (*s)
addpath(*s++);
addpath('/');
if (stat(gpath, &stb) == 0 && isdir(stb)) {
if (*p == 0) {
Gcat(gpath, "");
globcnt++;
} else {
expand(p);
}
}
gpathp = sgpathp;
*gpathp = 0;
return (0);
}
}
}
#if 0 /* dead code */
static
int
Gmatch(const char *s, const char *p)
{
register int scc;
int ok, lc;
int c, cc;
for (;;) {
scc = *s++ & TRIM;
switch (c = *p++) {
case '[':
ok = 0;
lc = 077777;
while ((cc = *p++) != 0) {
if (cc == ']') {
if (ok)
break;
return (0);
}
if (cc == '-') {
if (lc <= scc && scc <= *p++)
ok++;
} else
if (scc == (lc = cc))
ok++;
}
if (cc == 0)
if (ok)
p--;
else
return 0;
continue;
case '*':
if (!*p)
return (1);
for (s--; *s; s++)
if (Gmatch(s, p))
return (1);
return (0);
case 0:
return (scc == 0);
default:
if ((c & TRIM) != scc)
return (0);
continue;
case '?':
if (scc == 0)
return (0);
continue;
}
}
}
#endif
static
void
Gcat(const char *s1, const char *s2)
{
int len = strlen(s1) + strlen(s2) + 1;
if (len >= gnleft || gargc >= GAVSIZ - 1) {
globerr = "Arguments too long";
}
else {
gargc++;
gnleft -= len;
gargv[gargc].text = NULL;
gargv[gargc - 1].text = strspl(s1, s2);
}
}
static
void
addpath(char c)
{
if (gpathp >= lastgpathp)
globerr = "Pathname too long";
else {
*gpathp++ = c;
*gpathp = 0;
}
}
static void
rscan(centry *t, int (*f)(char))
{
const char *p;
char c;
while ((p = (t++)->text) != NULL) {
if (f == tglob) {
if (*p == '~')
gflag |= 2;
else if (eq(p, "{") || eq(p, "{}"))
continue;
}
while ((c = *p++) != 0)
(*f)(c);
}
}
static
int
tglob(char c)
{
if (any(c, globchars))
gflag |= c == '{' ? 2 : 1;
return (c);
}
static int
letter(char c)
{
return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '_';
}
static int
digit(char c)
{
return (c >= '0' && c <= '9');
}
static
int
any(int c, const char *s)
{
while (*s) if (*s++ == c) return 1;
return 0;
}
static
int
cblklen(const centry *av)
{
int i = 0;
while ((av++)->text) i++;
return i;
}
static
int
blklen(const entry *av)
{
int i = 0;
while ((av++)->text) i++;
return i;
}
void
blkfree(char **av)
{
int i;
for (i=0; av[i]; i++) free(av[i]);
}
static
void
efree(entry *av)
{
int i;
for (i=0; av[i].text; i++) free(av[i].text);
}
static
char *
strspl(const char *cp, const char *dp)
{
char *ep = malloc(strlen(cp) + strlen(dp) + 1);
if (ep == NULL) fatal("Out of memory");
strcpy(ep, cp);
strcat(ep, dp);
return ep;
}
static
char **
copyblk(entry *v)
{
int i;
char **nv = malloc((blklen(v) + 1) * sizeof(char **));
if (nv == NULL) fatal("Out of memory");
for (i=0; v[i].text; i++) {
nv[i] = v[i].text;
v[i].text = NULL;
}
nv[i] = NULL;
return nv;
}
static
char **
cloneblk(const centry *v)
{
int i;
char **nv = malloc((cblklen(v) + 1) * sizeof(char **));
if (nv == NULL) fatal("Out of memory");
for (i=0; v[i].text; i++) {
nv[i] = strdup(v[i].text);
}
nv[i] = NULL;
return nv;
}
static
char *
strend(char *cp)
{
while (*cp)
cp++;
return (cp);
}
/*
* Extract a home directory from the password file
* The argument points to a buffer where the name of the
* user whose home directory is sought is currently.
* We write the home directory of the user back there.
*
* XXX, this needs buffer length checking and stuff.
*/
static
int
gethdir(char *homedir)
{
register struct passwd *pp = getpwnam(homedir);
if (!pp || homedir + strlen(pp->pw_dir) >= lastgpathp)
return 1;
strcpy(homedir, pp->pw_dir);
return 0;
}
|