Rev 3310 | Rev 3346 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3310 | Rev 3326 | ||
---|---|---|---|
1 | /* Copyright (c) 2008, Tim Post <tinkertim@gmail.com> |
1 | /* Copyright (c) 2008, Tim Post <tinkertim@gmail.com> |
2 | * All rights reserved. |
2 | * All rights reserved. |
3 | * |
3 | * |
4 | * Redistribution and use in source and binary forms, with or without |
4 | * Redistribution and use in source and binary forms, with or without |
5 | * modification, are permitted provided that the following conditions are met: |
5 | * modification, are permitted provided that the following conditions are met: |
6 | * |
6 | * |
7 | * Redistributions of source code must retain the above copyright notice, this |
7 | * Redistributions of source code must retain the above copyright notice, this |
8 | * list of conditions and the following disclaimer. |
8 | * list of conditions and the following disclaimer. |
9 | * |
9 | * |
10 | * Redistributions in binary form must reproduce the above copyright notice, |
10 | * Redistributions in binary form must reproduce the above copyright notice, |
11 | * this list of conditions and the following disclaimer in the documentation |
11 | * this list of conditions and the following disclaimer in the documentation |
12 | * and/or other materials provided with the distribution. |
12 | * and/or other materials provided with the distribution. |
13 | * |
13 | * |
14 | * Neither the name of the original program's authors nor the names of its |
14 | * Neither the name of the original program's authors nor the names of its |
15 | * contributors may be used to endorse or promote products derived from this |
15 | * contributors may be used to endorse or promote products derived from this |
16 | * software without specific prior written permission. |
16 | * software without specific prior written permission. |
17 | * |
17 | * |
18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
18 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
19 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
19 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
20 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
20 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
21 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
21 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
22 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
22 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
23 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
23 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
24 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
24 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
25 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
25 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
26 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
26 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
27 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
27 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
28 | * POSSIBILITY OF SUCH DAMAGE. |
28 | * POSSIBILITY OF SUCH DAMAGE. |
29 | */ |
29 | */ |
30 | 30 | ||
31 | /* NOTE: |
31 | /* NOTE: |
32 | * This is a bit of an ugly hack, working around the absence of fstat / etc. |
32 | * This is a bit of an ugly hack, working around the absence of fstat / etc. |
33 | * As more stuff is completed and exposed in libc, this will improve */ |
33 | * As more stuff is completed and exposed in libc, this will improve */ |
34 | 34 | ||
35 | #include <stdio.h> |
35 | #include <stdio.h> |
36 | #include <stdlib.h> |
36 | #include <stdlib.h> |
37 | #include <unistd.h> |
37 | #include <unistd.h> |
38 | #include <dirent.h> |
38 | #include <dirent.h> |
39 | #include <fcntl.h> |
39 | #include <fcntl.h> |
40 | #include <sys/types.h> |
40 | #include <sys/types.h> |
41 | #include <sys/stat.h> |
41 | #include <sys/stat.h> |
42 | #include <string.h> |
42 | #include <string.h> |
43 | 43 | ||
44 | #include "errors.h" |
44 | #include "errors.h" |
45 | #include "config.h" |
45 | #include "config.h" |
46 | #include "util.h" |
46 | #include "util.h" |
47 | #include "entry.h" |
47 | #include "entry.h" |
48 | #include "ls.h" |
48 | #include "ls.h" |
49 | #include "cmds.h" |
49 | #include "cmds.h" |
50 | 50 | ||
51 | static char *cmdname = "ls"; |
51 | static char *cmdname = "ls"; |
52 | 52 | ||
53 | unsigned int ls_scope(const char *path) |
53 | unsigned int ls_scope(const char *path) |
54 | { |
54 | { |
55 | int fd; |
55 | int fd; |
56 | DIR *dirp; |
56 | DIR *dirp; |
57 | 57 | ||
58 | dirp = opendir(path); |
58 | dirp = opendir(path); |
59 | if (dirp) { |
59 | if (dirp) { |
60 | closedir(dirp); |
60 | closedir(dirp); |
61 | return LS_DIR; |
61 | return LS_DIR; |
62 | } |
62 | } |
63 | 63 | ||
64 | fd = open(path, O_RDONLY); |
64 | fd = open(path, O_RDONLY); |
65 | if (fd > 0) { |
65 | if (fd > 0) { |
66 | close(fd); |
66 | close(fd); |
67 | return LS_FILE; |
67 | return LS_FILE; |
68 | } |
68 | } |
69 | 69 | ||
70 | return LS_BOGUS; |
70 | return LS_BOGUS; |
71 | } |
71 | } |
72 | 72 | ||
73 | void ls_print(const char *f) |
73 | void ls_scan_dir(const char *d, DIR *dirp) |
74 | { |
74 | { |
- | 75 | struct dirent *dp; |
|
75 | unsigned int scope; |
76 | unsigned int scope; |
- | 77 | char *buff; |
|
76 | 78 | ||
77 | scope = ls_scope(f); |
79 | if (! dirp) |
- | 80 | return; |
|
78 | 81 | ||
79 | /* If this function is called in a readdir loop, LS_BOGUS |
82 | buff = (char *)malloc(PATH_MAX); |
80 | * can be treated as LS_FILE, since we aren't presenting |
83 | if (NULL == buff) { |
81 | * the full path to open(), just pointer->d_name as obtained |
- | |
82 | * from opendir(). This will not happen if ../path/to/file |
84 | cli_error(CL_ENOMEM, "ls: failed to scan %s", d); |
83 | * is passed, as may be the argument to ls */ |
85 | return; |
- | 86 | } |
|
84 | 87 | ||
- | 88 | while ((dp = readdir(dirp))) { |
|
- | 89 | memset(buff, 0, sizeof(buff)); |
|
- | 90 | /* Don't worry if inserting a double slash, this will be fixed by |
|
- | 91 | * absolutize() later with subsequent calls to open() or readdir() */ |
|
- | 92 | snprintf(buff, PATH_MAX - 1, "%s/%s", d, dp->d_name); |
|
- | 93 | scope = ls_scope(buff); |
|
85 | switch (scope) { |
94 | switch (scope) { |
86 | case LS_DIR: |
95 | case LS_DIR: |
87 | printf("%-40s <DIR>\n", f); |
96 | ls_print_dir(dp->d_name); |
88 | break; |
97 | break; |
89 | case LS_FILE: |
98 | case LS_FILE: |
90 | printf("%-40s\n", f); |
99 | ls_print_file(dp->d_name); |
91 | break; |
100 | break; |
92 | /* This is never reached unless in a readdir() loop */ |
- | |
93 | case LS_BOGUS: |
101 | case LS_BOGUS: |
- | 102 | /* Odd chance it was deleted from the time readdir() found |
|
- | 103 | * it and the time that it was scoped */ |
|
94 | printf("%-40s\n", f); |
104 | printf("ls: skipping bogus node %s\n", dp->d_name); |
95 | break; |
105 | break; |
- | 106 | } |
|
96 | } |
107 | } |
- | 108 | ||
- | 109 | free(buff); |
|
- | 110 | ||
- | 111 | return; |
|
- | 112 | } |
|
- | 113 | ||
- | 114 | /* ls_print_* currently does nothing more than print the entry. |
|
- | 115 | * in the future, we will likely pass the absolute path, and |
|
- | 116 | * some sort of ls_options structure that controls how each |
|
- | 117 | * entry is printed and what is printed about it. |
|
- | 118 | * |
|
- | 119 | * Now we just print basic DOS style lists */ |
|
- | 120 | ||
- | 121 | void ls_print_dir(const char *d) |
|
- | 122 | { |
|
- | 123 | printf("%-40s\t<DIR>\n", d); |
|
- | 124 | ||
- | 125 | return; |
|
- | 126 | } |
|
- | 127 | ||
- | 128 | void ls_print_file(const char *f) |
|
- | 129 | { |
|
- | 130 | printf("%-40s\n", f); |
|
- | 131 | ||
97 | return; |
132 | return; |
98 | } |
133 | } |
99 | 134 | ||
100 | /* Dispays help for ls in various levels */ |
- | |
101 | void * help_cmd_ls(unsigned int level) |
135 | void * help_cmd_ls(unsigned int level) |
102 | { |
136 | { |
103 | if (level == HELP_SHORT) { |
137 | if (level == HELP_SHORT) { |
104 | printf("`%s' lists files and directories.\n", cmdname); |
138 | printf("`%s' lists files and directories.\n", cmdname); |
105 | } else { |
139 | } else { |
106 | help_cmd_ls(HELP_SHORT); |
140 | help_cmd_ls(HELP_SHORT); |
107 | printf(" `%s' [path], if no path is given the current " |
141 | printf(" `%s' [path], if no path is given the current " |
108 | "working directory is used.\n", cmdname); |
142 | "working directory is used.\n", cmdname); |
109 | } |
143 | } |
110 | 144 | ||
111 | return CMD_VOID; |
145 | return CMD_VOID; |
112 | } |
146 | } |
113 | 147 | ||
114 | int * cmd_ls(char **argv) |
148 | int * cmd_ls(char **argv) |
115 | { |
149 | { |
116 | unsigned int argc; |
150 | unsigned int argc; |
117 | unsigned int scope; |
151 | unsigned int scope; |
118 | char *buff; |
152 | char *buff; |
119 | - | ||
120 | DIR *dirp; |
153 | DIR *dirp; |
121 | struct dirent *dp; |
- | |
122 | 154 | ||
123 | /* Count the arguments */ |
155 | /* Count the arguments */ |
124 | for (argc = 0; argv[argc] != NULL; argc ++); |
156 | for (argc = 0; argv[argc] != NULL; argc ++); |
125 | 157 | ||
126 | if (argc > 2) { |
- | |
127 | printf("%s - Too many arguments. Try `help %s extended'\n", |
- | |
128 | cmdname, cmdname); |
- | |
129 | return CMD_FAILURE; |
- | |
130 | } |
- | |
131 | - | ||
132 | buff = (char *) malloc(PATH_MAX); |
158 | buff = (char *) malloc(PATH_MAX); |
133 | if (NULL == buff) { |
159 | if (NULL == buff) { |
134 | cli_error(CL_ENOMEM, "%s: ", cmdname); |
160 | cli_error(CL_ENOMEM, "%s: ", cmdname); |
135 | return CMD_FAILURE; |
161 | return CMD_FAILURE; |
136 | } |
162 | } |
137 | memset(buff, 0, sizeof(buff)); |
163 | memset(buff, 0, sizeof(buff)); |
138 | 164 | ||
139 | if (argc == 1) |
165 | if (argc == 1) |
140 | getcwd(buff, PATH_MAX); |
166 | getcwd(buff, PATH_MAX); |
141 | else |
167 | else |
142 | strncpy(buff, argv[1], PATH_MAX); |
168 | strncpy(buff, argv[1], PATH_MAX); |
143 | 169 | ||
144 | scope = ls_scope(buff); |
170 | scope = ls_scope(buff); |
145 | 171 | ||
146 | switch (scope) { |
172 | switch (scope) { |
147 | case LS_BOGUS: |
173 | case LS_BOGUS: |
148 | cli_error(CL_ENOENT, buff); |
174 | cli_error(CL_ENOENT, buff); |
149 | free(buff); |
175 | free(buff); |
150 | return CMD_FAILURE; |
176 | return CMD_FAILURE; |
151 | case LS_FILE: |
177 | case LS_FILE: |
152 | ls_print(buff); |
178 | ls_print_file(buff); |
153 | break; |
179 | break; |
154 | case LS_DIR: |
180 | case LS_DIR: |
155 | dirp = opendir(buff); |
181 | dirp = opendir(buff); |
156 | while ((dp = readdir(dirp))) |
182 | if (! dirp) { |
- | 183 | /* May have been deleted between scoping it and opening it */ |
|
- | 184 | cli_error(CL_EFAIL, "Could not stat %s", buff); |
|
- | 185 | free(buff); |
|
- | 186 | return CMD_FAILURE; |
|
- | 187 | } |
|
157 | ls_print(dp->d_name); |
188 | ls_scan_dir(buff, dirp); |
158 | closedir(dirp); |
189 | closedir(dirp); |
159 | break; |
190 | break; |
160 | } |
191 | } |
161 | 192 | ||
162 | free(buff); |
193 | free(buff); |
163 | 194 | ||
164 | return CMD_SUCCESS; |
195 | return CMD_SUCCESS; |
165 | - | ||
166 | } |
196 | } |
167 | 197 | ||
168 | 198 |