Rev 4268 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 4268 | Rev 4587 | ||
---|---|---|---|
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 | static inline off_t flen(const char *f) |
- | |
54 | { |
- | |
55 | int fd; |
- | |
56 | off_t size; |
- | |
57 | - | ||
58 | fd = open(f, O_RDONLY); |
- | |
59 | if (fd == -1) |
- | |
60 | return 0; |
- | |
61 | - | ||
62 | size = lseek(fd, 0, SEEK_END); |
- | |
63 | close(fd); |
- | |
64 | - | ||
65 | if (size < 0) |
- | |
66 | size = 0; |
- | |
67 | - | ||
68 | return size; |
- | |
69 | } |
- | |
70 | - | ||
71 | static unsigned int ls_scope(const char *path) |
- | |
72 | { |
- | |
73 | int fd; |
- | |
74 | DIR *dirp; |
- | |
75 | - | ||
76 | dirp = opendir(path); |
- | |
77 | if (dirp) { |
- | |
78 | closedir(dirp); |
- | |
79 | return LS_DIR; |
- | |
80 | } |
- | |
81 | - | ||
82 | fd = open(path, O_RDONLY); |
- | |
83 | if (fd > 0) { |
- | |
84 | close(fd); |
- | |
85 | return LS_FILE; |
- | |
86 | } |
- | |
87 | - | ||
88 | return LS_BOGUS; |
- | |
89 | } |
- | |
90 | - | ||
91 | static void ls_scan_dir(const char *d, DIR *dirp) |
53 | static void ls_scan_dir(const char *d, DIR *dirp) |
92 | { |
54 | { |
93 | struct dirent *dp; |
55 | struct dirent *dp; |
94 | unsigned int scope; |
- | |
95 | char *buff; |
56 | char *buff; |
96 | 57 | ||
97 | if (! dirp) |
58 | if (! dirp) |
98 | return; |
59 | return; |
99 | 60 | ||
100 | buff = (char *)malloc(PATH_MAX); |
61 | buff = (char *)malloc(PATH_MAX); |
101 | if (NULL == buff) { |
62 | if (NULL == buff) { |
102 | cli_error(CL_ENOMEM, "ls: failed to scan %s", d); |
63 | cli_error(CL_ENOMEM, "ls: failed to scan %s", d); |
103 | return; |
64 | return; |
104 | } |
65 | } |
105 | 66 | ||
106 | while ((dp = readdir(dirp))) { |
67 | while ((dp = readdir(dirp))) { |
107 | memset(buff, 0, sizeof(buff)); |
68 | memset(buff, 0, sizeof(buff)); |
108 | /* Don't worry if inserting a double slash, this will be fixed by |
69 | /* Don't worry if inserting a double slash, this will be fixed by |
109 | * absolutize() later with subsequent calls to open() or readdir() */ |
70 | * absolutize() later with subsequent calls to open() or readdir() */ |
110 | snprintf(buff, PATH_MAX - 1, "%s/%s", d, dp->d_name); |
71 | snprintf(buff, PATH_MAX - 1, "%s/%s", d, dp->d_name); |
111 | scope = ls_scope(buff); |
- | |
112 | switch (scope) { |
- | |
113 | case LS_DIR: |
- | |
114 | ls_print_dir(dp->d_name); |
- | |
115 | break; |
- | |
116 | case LS_FILE: |
- | |
117 | ls_print_file(dp->d_name, buff); |
72 | ls_print(dp->d_name, buff); |
118 | break; |
- | |
119 | case LS_BOGUS: |
- | |
120 | /* Odd chance it was deleted from the time readdir() found |
- | |
121 | * it and the time that it was scoped */ |
- | |
122 | printf("ls: skipping bogus node %s\n", dp->d_name); |
- | |
123 | break; |
- | |
124 | } |
- | |
125 | } |
73 | } |
126 | 74 | ||
127 | free(buff); |
75 | free(buff); |
128 | 76 | ||
129 | return; |
77 | return; |
130 | } |
78 | } |
131 | 79 | ||
132 | /* ls_print_* currently does nothing more than print the entry. |
80 | /* ls_print currently does nothing more than print the entry. |
133 | * in the future, we will likely pass the absolute path, and |
81 | * in the future, we will likely pass the absolute path, and |
134 | * some sort of ls_options structure that controls how each |
82 | * some sort of ls_options structure that controls how each |
135 | * entry is printed and what is printed about it. |
83 | * entry is printed and what is printed about it. |
136 | * |
84 | * |
137 | * Now we just print basic DOS style lists */ |
85 | * Now we just print basic DOS style lists */ |
138 | 86 | ||
139 | static void ls_print_dir(const char *d) |
87 | static void ls_print(const char *name, const char *pathname) |
140 | { |
88 | { |
141 | printf("%-40s\t<dir>\n", d); |
89 | struct stat s; |
- | 90 | int rc; |
|
142 | 91 | ||
- | 92 | if (rc = stat(pathname, &s)) { |
|
- | 93 | /* Odd chance it was deleted from the time readdir() found it */ |
|
- | 94 | printf("ls: skipping bogus node %s\n", pathname); |
|
- | 95 | printf("rc=%d\n", rc); |
|
143 | return; |
96 | return; |
144 | } |
97 | } |
145 | 98 | ||
- | 99 | if (s.is_file) |
|
146 | static void ls_print_file(const char *name, const char *pathname) |
100 | printf("%-40s\t%llu\n", name, (long long) s.size); |
147 | { |
101 | else |
148 | printf("%-40s\t%llu\n", name, (long long) flen(pathname)); |
102 | printf("%-40s\n", name); |
149 | 103 | ||
150 | return; |
104 | return; |
151 | } |
105 | } |
152 | 106 | ||
153 | void help_cmd_ls(unsigned int level) |
107 | void help_cmd_ls(unsigned int level) |
154 | { |
108 | { |
155 | if (level == HELP_SHORT) { |
109 | if (level == HELP_SHORT) { |
156 | printf("`%s' lists files and directories.\n", cmdname); |
110 | printf("`%s' lists files and directories.\n", cmdname); |
157 | } else { |
111 | } else { |
158 | help_cmd_ls(HELP_SHORT); |
112 | help_cmd_ls(HELP_SHORT); |
159 | printf(" `%s' [path], if no path is given the current " |
113 | printf(" `%s' [path], if no path is given the current " |
160 | "working directory is used.\n", cmdname); |
114 | "working directory is used.\n", cmdname); |
161 | } |
115 | } |
162 | 116 | ||
163 | return; |
117 | return; |
164 | } |
118 | } |
165 | 119 | ||
166 | int cmd_ls(char **argv) |
120 | int cmd_ls(char **argv) |
167 | { |
121 | { |
168 | unsigned int argc; |
122 | unsigned int argc; |
169 | unsigned int scope; |
123 | struct stat s; |
170 | char *buff; |
124 | char *buff; |
171 | DIR *dirp; |
125 | DIR *dirp; |
172 | 126 | ||
173 | argc = cli_count_args(argv); |
127 | argc = cli_count_args(argv); |
174 | 128 | ||
175 | buff = (char *) malloc(PATH_MAX); |
129 | buff = (char *) malloc(PATH_MAX); |
176 | if (NULL == buff) { |
130 | if (NULL == buff) { |
177 | cli_error(CL_ENOMEM, "%s: ", cmdname); |
131 | cli_error(CL_ENOMEM, "%s: ", cmdname); |
178 | return CMD_FAILURE; |
132 | return CMD_FAILURE; |
179 | } |
133 | } |
180 | memset(buff, 0, sizeof(buff)); |
134 | memset(buff, 0, sizeof(buff)); |
181 | 135 | ||
182 | if (argc == 1) |
136 | if (argc == 1) |
183 | getcwd(buff, PATH_MAX); |
137 | getcwd(buff, PATH_MAX); |
184 | else |
138 | else |
185 | str_cpy(buff, PATH_MAX, argv[1]); |
139 | str_cpy(buff, PATH_MAX, argv[1]); |
186 | 140 | ||
187 | scope = ls_scope(buff); |
- | |
188 | - | ||
189 | switch (scope) { |
141 | if (stat(buff, &s)) { |
190 | case LS_BOGUS: |
- | |
191 | cli_error(CL_ENOENT, buff); |
142 | cli_error(CL_ENOENT, buff); |
192 | free(buff); |
143 | free(buff); |
193 | return CMD_FAILURE; |
144 | return CMD_FAILURE; |
- | 145 | } |
|
- | 146 | ||
194 | case LS_FILE: |
147 | if (s.is_file) { |
195 | ls_print_file(buff, buff); |
148 | ls_print(buff, buff); |
196 | break; |
149 | } else { |
197 | case LS_DIR: |
- | |
198 | dirp = opendir(buff); |
150 | dirp = opendir(buff); |
199 | if (! dirp) { |
151 | if (!dirp) { |
200 | /* May have been deleted between scoping it and opening it */ |
152 | /* May have been deleted between scoping it and opening it */ |
201 | cli_error(CL_EFAIL, "Could not stat %s", buff); |
153 | cli_error(CL_EFAIL, "Could not stat %s", buff); |
202 | free(buff); |
154 | free(buff); |
203 | return CMD_FAILURE; |
155 | return CMD_FAILURE; |
204 | } |
156 | } |
205 | ls_scan_dir(buff, dirp); |
157 | ls_scan_dir(buff, dirp); |
206 | closedir(dirp); |
158 | closedir(dirp); |
207 | break; |
- | |
208 | } |
159 | } |
209 | 160 | ||
210 | free(buff); |
161 | free(buff); |
211 | 162 | ||
212 | return CMD_SUCCESS; |
163 | return CMD_SUCCESS; |
213 | } |
164 | } |
214 | 165 | ||
215 | 166 |