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
|
/*
* Copyright (c) 1980 Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms are permitted
* provided that the above copyright notice and this paragraph are
* duplicated in all such forms and that any documentation,
* advertising materials, and other materials related to such
* distribution and use acknowledge that the software was developed
* by the University of California, Berkeley. The name of the
* University may not be used to endorse or promote products derived
* from this software without specific prior written permission.
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*/
/* 24-DEC-92 Modified for use with VMS-fsp V2.6.3 <S.A.Pechler@bdk.tue.nl>
* 27-JAN-93 Stripped leading spaces in arguments <S.A.Pechler@bdk.tue.nl>
* 17-MAY-93 Removed all VMS modifications <S.A.Pechler@bdk.tue.nl>
*/
/*
* C-shell glob for random programs.
*/
#include "tweak.h"
#include "client_def.h"
#include "c_extern.h"
#ifdef HAVE_LIMITS_H
#include <limits.h>
#endif
#ifndef NCARGS
#define NCARGS ARG_MAX
#endif
#define QUOTE 0200
#define TRIM 0177
#define eq(a,b) (strcmp(a, b)==0)
#define GAVSIZ (NCARGS/6)
#define isdir(d) ((d.st_mode & S_IFMT) == S_IFDIR)
static char **gargv; /* Pointer to the (stack) arglist */
static int gargc; /* Number args in gargv */
static int gnleft;
static int gflag;
char *globerr;
extern int errno;
static int globcnt;
char *globchars = "`{[*?";
static char *gpath, *gpathp, *lastgpathp;
static int globbed;
static char *entp;
static char **sortbas;
static int any PROTO2(register int, c, register char *, s)
{
while (*s)
if (*s++ == c) return(1);
return(0);
}
static int tglob PROTO1(char, c)
{
if (any(c, globchars))
gflag |= c == '{' ? 2 : 1;
return (c);
}
static int addpath PROTO1(char, c)
{
if (gpathp >= lastgpathp) globerr = "Pathname too long";
else {
*gpathp++ = c;
*gpathp = 0;
}
return(0);
}
static int ginit PROTO1(char **, agargv)
{
agargv[0] = 0; gargv = agargv; sortbas = agargv; gargc = 0;
gnleft = NCARGS - 4;
return(0);
}
static int sort PROTO0((void))
{
register char **p1, **p2, *c;
char **Gvp = &gargv[gargc];
p1 = sortbas;
while (p1 < Gvp-1) {
p2 = p1;
while (++p2 < Gvp)
if (strcmp(*p1, *p2) > 0) {
c = *p1;
*p1 = *p2;
*p2 = c;
}
p1++;
}
sortbas = Gvp;
}
static char *strspl PROTO2(register char *, cp, register char *, dp)
{
register char *ep = (char *)malloc((unsigned)(strlen(cp) + strlen(dp) + 1));
if (ep == (char *)0) {
perror("Out of memory 1");
exit(1);
}
(void) strcpy(ep, cp);
(void) strcat(ep, dp);
return (ep);
}
static int Gcat PROTO2(char *, s1, char *, s2)
{
register int len = strlen(s1) + strlen(s2) + 1;
if (len >= gnleft || gargc >= GAVSIZ - 1) globerr = "Arguments too long";
else {
gargc++;
gnleft -= len;
gargv[gargc] = 0;
gargv[gargc - 1] = strspl(s1, s2);
}
return(0);
}
static int execbrc PROTO0((char *, char *));
static int expand PROTO1(char *, as)
{
register char *cs;
register char *sgpathp, *oldcs;
struct stat stb;
sgpathp = gpathp;
cs = as;
while (!any(*cs, globchars)) {
if (*cs == 0) {
if (!globbed) Gcat(gpath, "");
else if (util_stat(gpath, &stb) >= 0) {
Gcat(gpath, "");
globcnt++;
}
break;
}
addpath(*cs++);
}
if(*cs) {
oldcs = cs;
while (cs > as && *cs != '/') {
cs--; gpathp--;
}
if (*cs == '/') {
cs++; gpathp++;
}
*gpathp = 0;
if (*oldcs == '{') {
(void) execbrc(cs, ((char *)0));
return(0);
}
matchdir(cs);
}
gpathp = sgpathp;
*gpathp = 0;
}
static int amatch PROTO2(char *, s, 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++) {
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 (util_stat(gpath, &stb) == 0 && isdir(stb))
if (*p == 0) {
Gcat(gpath, "");
globcnt++;
} else expand(p);
gpathp = sgpathp;
*gpathp = 0;
return (0);
}
}
}
static int match PROTO2(char *, s, char *, p)
{
register int c;
register char *sentp;
char sglobbed = globbed;
if (*s == '.' && *p != '.') return (0);
sentp = entp;
entp = s;
c = amatch(s, p);
entp = sentp;
globbed = sglobbed;
return (c);
}
int matchdir PROTO1(char *, pattern)
{
struct stat stb;
register struct rdirent *dp;
RDIR *dirp;
dirp = util_opendir(gpath);
if (dirp == NULL) {
if (globbed) return;
globerr = "Bad directory components";
return;
}
if (util_stat(gpath, &stb) < 0) {
util_closedir(dirp);
globerr = "Bad directory components";
}
if (!isdir(stb)) {
errno = ENOTDIR;
util_closedir(dirp);
globerr = "Bad directory components";
}
while ((dp = util_readdir(dirp)) != NULL) {
if (dp->d_fileno == 0) continue;
if (match(dp->d_name, pattern)) {
Gcat(gpath, dp->d_name);
globcnt++;
}
}
util_closedir(dirp);
}
static int execbrc PROTO2(char *, p, char *, s)
{
char restbuf[BUFSIZ + 2];
register char *pe, *pm, *pl;
int brclev = 0;
char *lm, savec, *sgpathp;
for (lm = restbuf; *p != '{'; *lm++ = *p++);
for (pe = ++p; *pe; pe++)
switch (*pe) {
case '{':
brclev++;
continue;
case '}':
if (brclev == 0) goto pend;
brclev--;
continue;
case '[':
for (pe++; *pe && *pe != ']'; pe++);
}
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:
savec = *pm;
*pm = 0;
(void) strcpy(lm, pl);
(void) strcat(restbuf, pe + 1);
*pm = savec;
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++);
if (!*pm) pm--;
continue;
}
if (brclev) goto doit;
return (0);
}
int acollect PROTO1(register char *, as)
{
register int ogargc = gargc;
gpathp = gpath; *gpathp = 0; globbed = 0;
expand(as);
if (gargc != ogargc) sort();
}
static int collect PROTO1(register char *, as)
{
if (eq(as, "{") || eq(as, "{}")) {
Gcat(as, "");
sort();
} else acollect(as);
}
static int blkfree PROTO1(char **, av0)
{
register char **av = av0;
while (*av) free(*av++);
}
static int blklen PROTO1(register char **, av)
{
register int i = 0;
while (*av++) i++;
return (i);
}
static char **blkcpy PROTO2(char **, oav, register char **, bv)
{
register char **av = oav;
while (*av++ = *bv++) continue;
return (oav);
}
static char **copyblk PROTO1(register char **, v)
{
register char **nv;
nv = (char **)malloc((unsigned)((blklen(v) + 1) * sizeof(char **)));
if (nv == (char **)0) {
perror("Out of memory 2");
exit(2);
}
return (blkcpy(nv, v));
}
#ifdef HAVE_ANSI_PROTO
typedef int (*charfunc) (char) ;
static int rscan (register char **t, charfunc f)
#else
static int rscan(t, f)
register char **t;
int (*f)();
#endif
{
register char *p, c;
while (p = *t++) {
#ifdef HAVE_ANSI_PROTO
if (f == (charfunc) tglob)
#else
if (f == tglob)
#endif
if (*p == '~') gflag |= 2;
else if (eq(p, "{") || eq(p, "{}")) continue;
while (c = *p++) (*f)(c);
}
}
char **glob PROTO1(register char *, v)
{
char agpath[BUFSIZ];
char *agargv[GAVSIZ];
char *vv[2];
vv[0] = v;
vv[1] = 0;
gflag = 0;
#ifdef HAVE_ANSI_PROTO
rscan(vv, (charfunc) tglob);
#else
rscan(vv, tglob);
#endif
if (gflag == 0) return (copyblk(vv));
globerr = 0;
gpath = agpath; gpathp = gpath; *gpathp = 0;
lastgpathp = &gpath[sizeof agpath - 2];
ginit(agargv); globcnt = 0;
collect(v);
if (globcnt == 0 && (gflag&1)) {
blkfree(gargv), gargv = 0;
return (0);
} else return (gargv = copyblk(gargv));
}
|