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
|
/*
* Mini find implementation for busybox
*
* Copyright (C) 1998 by Erik Andersen <andersee@debian.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include <stdio.h>
#include <unistd.h>
#include <dirent.h>
#include "internal.h"
static char* pattern=NULL;
static char* directory=NULL;
static int dereferenceFlag=FALSE;
static const char find_usage[] = "find [path...] [expression]\n"
"default path is the current directory; default expression is -print\n"
"expression may consist of:\n";
static int fileAction(const char *fileName)
{
if (pattern==NULL)
fprintf(stdout, "%s\n", fileName);
else if (match(fileName, pattern) == TRUE)
fprintf(stdout, "%s\n", fileName);
return( TRUE);
}
static int dirAction(const char *fileName)
{
DIR *dir;
struct dirent *entry;
if (pattern==NULL)
fprintf(stdout, "%s\n", fileName);
else if (match(fileName, pattern) == TRUE)
fprintf(stdout, "%s\n", fileName);
dir = opendir( fileName);
if (!dir) {
perror("Can't open directory");
exit(FALSE);
}
while ((entry = readdir(dir)) != NULL) {
char dirName[NAME_MAX];
sprintf(dirName, "%s/%s", fileName, entry->d_name);
recursiveAction( dirName, TRUE, dereferenceFlag, fileAction, dirAction);
}
return( TRUE);
}
int find_main(int argc, char **argv)
{
if (argc <= 1) {
dirAction( ".");
}
/* peel off the "find" */
argc--;
argv++;
if (**argv != '-') {
directory=*argv;
argc--;
argv++;
}
/* Parse any options */
while (**argv == '-') {
int stopit=FALSE;
while (*++(*argv) && stopit==FALSE) switch (**argv) {
case 'f':
if (strcmp(*argv, "follow")==0) {
argc--;
argv++;
dereferenceFlag=TRUE;
}
break;
case 'n':
if (strcmp(*argv, "name")==0) {
if (argc-- > 1) {
pattern=*(++argv);
stopit=-TRUE;
} else {
fprintf(stderr, "Usage: %s\n", find_usage);
exit( FALSE);
}
}
break;
case '-':
/* Ignore all long options */
break;
default:
fprintf(stderr, "Usage: %s\n", find_usage);
exit( FALSE);
}
if (argc-- > 1)
argv++;
if (**argv != '-')
break;
else
break;
}
dirAction( directory);
exit(TRUE);
}
#ifdef foobar
#include "internal.h"
#include <errno.h>
#include <stdio.h>
const char find_usage[] = "find dir [pattern]\n"
"\n"
"\tFind files.\n";
extern int
find_main(struct FileInfo * i, int argc, char * * argv)
{
i->recursive=1;
i->processDirectoriesAfterTheirContents=1;
return monadic_main(i, argc, argv);
}
extern int
find_fn(const struct FileInfo * i)
{
printf("%s\n",i->source);
return(0);
}
#endif
|
