|
|
1.1 root 1: /*-
2: * Copyright (c) 1990 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted provided
6: * that: (1) source distributions retain this entire copyright notice and
7: * comment, and (2) distributions including binaries display the following
8: * acknowledgement: ``This product includes software developed by the
9: * University of California, Berkeley and its contributors'' in the
10: * documentation or other materials provided with the distribution and in
11: * all advertising materials mentioning features or use of this software.
12: * Neither the name of the University nor the names of its contributors may
13: * be used to endorse or promote products derived from this software without
14: * specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
16: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
17: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: */
19:
20: #ifndef lint
21: static char sccsid[] = "@(#)oldsyntax.c 5.1 (Berkeley) 5/12/90";
22: #endif /* not lint */
23:
24: #include <stdio.h>
25:
26: /*
27: * oldsyntax --
28: * move the path names to the beginning of the argv array, and return
29: * a pointer to them. The old find syntax assumes all command arguments
30: * up to the first one beginning with a '-', '(' or '!' are pathnames.
31: */
32: char **
33: oldsyntax(argvp)
34: char ***argvp;
35: {
36: register char **argv;
37:
38: /*
39: * find first '-', '(' or '!' to delimit paths; if no paths, it's
40: * an error. Shift the array back one at the same time, creating
41: * a separate array of pathnames.
42: */
43: for (argv = *argvp + 1;; ++argv) {
44: argv[-1] = argv[0];
45: if (!*argv || **argv == '-' || **argv == '!' || **argv == '(')
46: break;
47: }
48:
49: if (argv == *argvp + 1)
50: usage();
51:
52: argv[-1] = NULL;
53: *argvp = argv; /* move argv value */
54: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.