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
|
/*
* Copyright (c) 1995 The Regents of the University of California.
* All rights reserved.
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose, without fee, and without written agreement is
* hereby granted, provided that the above copyright notice and the following
* two paragraphs appear in all copies of this software.
*
* IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT
* OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF
* CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
* ON AN "AS IS" BASIS, AND THE UNIVERSITY OF CALIFORNIA HAS NO OBLIGATION TO
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
*/
#include "tk.h"
#include "all.h"
#include <sys/file.h>
#include <sys/stat.h>
#include <sys/param.h>
#include <time.h>
#include <string.h>
#include <dirent.h>
#define MAX_FILES 1000
#define MAX_NAME_LEN 256
#define MAX_STRING_LEN MAX_NAME_LEN
typedef int boolean;
#define TRUE 1
#define FALSE 0
extern char currentPath[MAXPATHLEN];
char globString[1024];
static DIR * dfd;
void ResetPath(void);
int ListDirectory(ClientData nulldata, Tcl_Interp *interp, int argc,
char **argv);
int ChangeDirectory(ClientData nulldata, Tcl_Interp *interp, int argc,
char **argv);
void SortFiles(int numStrings, char strings[MAX_FILES][MAX_NAME_LEN],
boolean *dirList, int permute[]);
static void UpdatePath(Tcl_Interp *interp, char *directory);
static boolean MatchesGlob(char *string, char *glob);
void
ResetPath() {
if (getwd(currentPath) == 0) {
fprintf(stderr, "Error getting pathname!!!\n");
exit(1);
}
strcpy(¤tPath[strlen(currentPath)], "/");
dfd = opendir(currentPath);
if (dfd == NULL) {
fprintf(stderr, "can't open '%s'\n", currentPath);
exit(1);
}
}
static void
UpdatePath(Tcl_Interp *interp, char *directory) {
int length;
char *charPtr;
length = strlen(currentPath);
if (streq(directory, "./"))
return /* nothing */ ;
else if (streq(directory, "../")) {
/* delete backwards up to '/' */
if (length < 2) {
fprintf(stderr, "Error: backing up from root directory!!!\n");
exit(1);
}
charPtr = ¤tPath[length-2];
while ((charPtr != currentPath) && (*charPtr != '/'))
--charPtr;
++charPtr; /* leave the '/' */
*charPtr = '\0';
} else {
strcpy(¤tPath[length], directory);
}
}
int
ChangeDirectory(ClientData nulldata, Tcl_Interp *interp, int argc,
char **argv) {
char *directory = argv[1];
UpdatePath(interp, directory);
fprintf(stdout, "Opening directory: '%s'\n", currentPath);
dfd = opendir(currentPath);
if (dfd == NULL) {
fprintf(stderr, "can't open '%s'\n", currentPath);
return TCL_OK; /* shouldn't, really */
}
return TCL_OK;
}
int
ListDirectory(ClientData nulldata, Tcl_Interp *interp, int argc,
char **argv) {
struct dirent * dp;
struct stat stbuf;
char command[256];
char fileName[MAX_FILES][MAX_NAME_LEN];
boolean dirList[MAX_FILES];
int permute[MAX_FILES];
int fileCount = 0;
int index;
char fullName[MAXPATHLEN];
char * restPtr;
sprintf(command, "ShowCurrentDirectory %s", currentPath);
Tcl_Eval(interp, command, 0, (char **) NULL);
if (dfd == NULL) {
fprintf(stderr, "TRIED TO LIST NULL DIRECTORY\n");
return TCL_OK;
}
/* check if root directory */
if (strlen(currentPath) != 1) {
sprintf(fileName[fileCount], "../");
dirList[fileCount] = TRUE;
++fileCount;
}
strcpy(fullName, currentPath);
restPtr = &fullName[strlen(fullName)];
while ((dp = readdir(dfd)) != NULL) {
strcpy(restPtr, dp->d_name);
stat(fullName, &stbuf);
if (dp->d_name[0] != '.') {
if (S_ISDIR(stbuf.st_mode)) {
sprintf(fileName[fileCount], "%s/", dp->d_name);
dirList[fileCount] = TRUE;
++fileCount;
} else {
if (MatchesGlob(dp->d_name, globString)) {
strcpy(fileName[fileCount], dp->d_name);
dirList[fileCount] = FALSE;
++fileCount;
}
}
}
}
SortFiles(fileCount, fileName, dirList, permute);
for (index = 0; index < fileCount; ++index) {
sprintf(command, "AddBrowseFile %s", fileName[permute[index]]);
Tcl_Eval(interp, command, 0, (char **) NULL);
}
closedir(dfd);
return TCL_OK;
}
void
SortFiles(int numStrings, char strings[MAX_FILES][MAX_NAME_LEN],
boolean *dirList, int permute[]) {
int i;
int numDirs;
int ptr;
for (i = 0; i < numStrings; ++i)
permute[i] = i;
/* put all directories at front */
numDirs = 0;
ptr = numStrings-1;
while (numDirs != ptr) {
/* go past dirs */
while ((numDirs < ptr) && (dirList[permute[numDirs]]))
++numDirs;
/* go past non-dirs */
while ((numDirs < ptr) && (! dirList[permute[ptr]]))
--ptr;
if (numDirs != ptr) {
int const temp = permute[numDirs];
permute[numDirs] = ptr;
permute[ptr] = temp;
}
}
if (dirList[permute[numDirs]])
++numDirs;
for (i = 0; i < numDirs; ++i) {
int j;
for (j = i + 1; j < numDirs; ++j) {
if (strcmp(&strings[permute[j]][0], &strings[permute[i]][0]) < 0) {
int const temp = permute[j];
permute[j] = permute[i];
permute[i] = temp;
}
}
}
for (i = numDirs; i < numStrings; ++i) {
int j;
for (j = i + 1; j < numStrings; ++j) {
if (strcmp(&strings[permute[j]][0], &strings[permute[i]][0]) < 0) {
int const temp = permute[j];
permute[j] = permute[i];
permute[i] = temp;
}
}
}
}
int
SetBrowseGlob(ClientData nulldata, Tcl_Interp *interp,
int argc, char **argv) {
if (argc == 2) {
strcpy(globString, argv[1]);
fprintf(stdout, "GLOB: %s\n", globString);
return TCL_OK;
}
Tcl_AppendResult(interp,
"wrong args: should be \"", argv[0]," string\"",
NULL);
return TCL_ERROR;
}
static boolean
MatchesGlob(char *string, char *glob) {
char * stringRight;
char * globRight;
while ((*glob != '\0') && (*glob != '*')) {
/* match left side */
if ((*string == '\0') || (*string != *glob))
return FALSE;
++string;
++glob;
}
if (*glob == '\0') /* no star */
return TRUE;
/* now match right side */
stringRight = &string[strlen(string)-1];
globRight = &glob[strlen(glob)-1];
while (*globRight != '*') {
if ((stringRight < string) || (*stringRight != *globRight))
return FALSE;
--globRight;
--stringRight;
}
return TRUE;
}
|