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
|
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <limits.h>
#include <dirent.h>
#include <errno.h>
#include <sys/stat.h>
#include <sys/types.h>
#include "common.h"
uint8_t no_net = 0;
int set_no_net(UNUSED int argc, UNUSED char** argv)
{
#ifndef NDEBUG
puts("[NO_NET] set");
#endif
no_net = 1;
return EXIT_SUCCESS;
}
void print_help(const struct Command* commands, const size_t commands_size,
const struct Flag* flags, size_t flags_size)
{
size_t longestStr;
size_t length;
if (commands_size)
{
longestStr = 0;
for (size_t i = 0; i < commands_size; ++i)
{
length = strlen(commands[i].name);
if (length > longestStr) longestStr = length;
}
fprintf(stderr, "\nList of commands:\n");
for (size_t i = 0; i < commands_size; ++i)
{
fprintf(stderr, "\t%-*s\t %s\n", (int)longestStr, commands[i].name, commands[i].description);
}
}
if (flags_size)
{
longestStr = 0;
for (size_t i = 0; i < flags_size; ++i)
{
length = strlen(flags[i].name);
if (length > longestStr) longestStr = length;
}
fprintf(stderr, "\nList of flags:\n");
for (size_t i = 0; i < flags_size; ++i)
{
fprintf(stderr, "\t");
if (flags[i].variant & ONE)
fprintf(stderr, "-%c", flags[i].name[0]);
else
fprintf(stderr, " ");
if (flags[i].variant & TWO)
{
if (flags[i].variant & ONE) fprintf(stderr, ",");
fprintf(stderr, " --%-*s", (int)longestStr, flags[i].name);
}
fprintf(stderr, "\t %s\n", flags[i].description);
}
}
}
struct stat getStat(const char* path)
{
// fill with 0s by default in the case stat fails
struct stat sb = {0};
// the return value signifies if stat failes (e.g. file not found)
// unimportant for us if it fails it won't touch sb
stat(path, &sb);
return sb;
}
int isFile(const char* path)
{
struct stat sb = getStat(path);
return S_ISREG(sb.st_mode)
#ifndef _WIN32
|| S_ISLNK(sb.st_mode)
#endif
;
}
int isDir(const char* path)
{
struct stat sb = getStat(path);
return S_ISDIR(sb.st_mode)
#ifndef _WIN32
|| S_ISLNK(sb.st_mode)
#endif
;
}
int makeDir(const char* path)
{
char pathcpy[PATH_MAX];
char *index;
strncpy(pathcpy, path, PATH_MAX-1); // make a mutable copy of the path
for(index = pathcpy+1; *index; ++index)
{
if (*index == '/')
{
*index = '\0';
if (mkdir(pathcpy, 0755) != 0)
{
if (errno != EEXIST)
return -1;
}
*index = '/';
}
}
return mkdir(path, 0755);
}
int removeDir(const char *path)
{
DIR *d = opendir(path);
size_t path_len = strlen(path);
int r = -1;
if (d) {
struct dirent *p;
r = 0;
while (!r && (p=readdir(d))) {
char *buf;
size_t len;
// Skip the names "." and ".." as we don't want to recurse on them.
if (!strcmp(p->d_name, ".") || !strcmp(p->d_name, ".."))
continue;
len = path_len + strlen(p->d_name) + 2;
buf = malloc(len);
if (buf) {
struct stat statbuf = {0};
snprintf(buf, len, "%s/%s", path, p->d_name);
if (!stat(buf, &statbuf)) {
if (S_ISDIR(statbuf.st_mode))
r = removeDir(buf);
#ifndef _WIN32
else if (S_ISLNK(statbuf.st_mode))
r = unlink(buf);
#endif
else
r = remove(buf);
}
else // it is very likely that we found a dangling symlink which is not detected by stat
{
r = unlink(buf);
}
free(buf);
}
}
closedir(d);
}
if (!r)
r = rmdir(path);
return r;
}
|
