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
|
#include <dirent.h>
#include <err.h>
#include <errno.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/stat.h>
#include <sys/types.h>
#define REPO ".cvn"
#define INDEX "index"
#define MALLOC(s) _xmalloc((s), __FILE__, __LINE__)
#define REALLOC(p, s) _xrealloc((p), (s), __FILE__, __LINE__)
static inline void init(int argc, char *argv[]);
static inline void status(int argc, char *argv[]);
static inline void traverse(void);
static inline uint8_t ignore(const char *path);
static inline int cmp(const void *a, const void *b);
static inline void *_xmalloc(size_t s, const char *file, int line);
static inline void *_xrealloc(void *ptr, size_t s, const char *file, int line);
struct command {
char *name;
void (*func)(int argc, char *argv[]);
};
struct command cmd[] = {
{"init", init},
{"status", status},
{NULL, NULL}
};
int main(int argc, char *argv[])
{
uint8_t i;
if (argc < 2) {
fprintf(stderr, "Usage: %s <command> [<args>]\n", argv[0]);
return 1;
}
for (i = 0; cmd[i].name != NULL; i++) {
if (strcmp(argv[1], cmd[i].name) == 0) {
cmd[i].func(argc - 1, argv + 1);
return 0;
}
}
return 0;
}
static inline void init(int argc, char *argv[])
{
char *branch;
int opt, repo_fd, idx_fd;
optind = 1;
while ((opt = getopt(argc, argv, "b:")) != -1) {
switch (opt) {
case 'b':
branch = optarg;
break;
default:
break;
}
}
if (mkdir(REPO, 0755) == -1) {
if (errno != EEXIST) {
perror("Failed to create repository");
return;
}
}
if ((repo_fd = open(REPO, O_RDONLY | O_DIRECTORY)) == -1) {
perror("Failed to open repository");
return;
}
if ((idx_fd = openat(repo_fd, INDEX,
O_WRONLY | O_CREAT | O_EXCL, 0644)) == -1) {
if (errno != EEXIST) {
close(repo_fd);
perror("Failed to create index");
return;
}
} else
close(idx_fd);
close(repo_fd);
printf("Initialized repository in %s\n", REPO);
}
static inline void status(int argc, char *argv[])
{
traverse();
}
struct node {
char *path;
unsigned char is_dir;
struct node *parent;
};
static inline void traverse(void)
{
DIR *dir;
char *rel_path;
struct stat st;
struct dirent *entry;
struct node *cur_dir, *root, *new_node;
struct node **dirs, **tree;
size_t dirs_len, tree_len;
size_t dirs_cap, tree_cap;
tree_len = 0, tree_cap = 512;
tree = MALLOC(sizeof(tree[0]) * tree_cap);
dirs_len = 0, dirs_cap = 512;
dirs = MALLOC(sizeof(dirs[0]) * dirs_cap);
root = MALLOC(sizeof(struct node));
root->path = strdup(".");
root->is_dir = 1;
root->parent = NULL;
dirs[dirs_len++] = root;
while (dirs_len > 0) {
cur_dir = dirs[--dirs_len];
if (!(dir = opendir(cur_dir->path))) {
warn("Failed to open directory %s", cur_dir->path);
continue;
}
if (tree_len >= tree_cap - 1) {
tree_cap <<= 1;
tree = REALLOC(tree, sizeof(tree[0]) * tree_cap);
}
tree[tree_len++] = cur_dir;
while ((entry = readdir(dir))) {
if (ignore(entry->d_name))
continue;
if (asprintf(&rel_path, "%s/%s", cur_dir->path, entry->d_name) == -1)
err(1, "asprintf() failed");
if (lstat(rel_path, &st) == -1) {
warn("lstat() failed: %s", rel_path);
free(rel_path);
continue;
}
if (S_ISDIR(st.st_mode)) {
if (dirs_len >= dirs_cap) {
dirs_cap <<= 1;
dirs = REALLOC(dirs, sizeof(dirs[0]) * dirs_cap);
}
new_node = MALLOC(sizeof(struct node));
new_node->path = rel_path;
new_node->is_dir = 1;
new_node->parent = cur_dir;
dirs[dirs_len++] = new_node;
} else {
if (tree_len >= tree_cap) {
tree_cap <<= 1;
tree = REALLOC(tree, sizeof(tree[0]) * tree_cap);
}
new_node = MALLOC(sizeof(struct node));
new_node->path = rel_path;
new_node->is_dir = 0;
new_node->parent = cur_dir;
tree[tree_len++] = new_node;
}
}
closedir(dir);
}
for (int i = (int)tree_len - 1; i >= 0; i--) {
printf("Entry: %s, parent: %s\n",
tree[i]->path,
tree[i]->parent ? tree[i]->parent->path : "NONE");
}
for (size_t i = 0; i < tree_len; i++) {
free(tree[i]->path);
free(tree[i]);
}
free(tree);
free(dirs);
}
static inline int cmp(const void *a, const void *b)
{
return strcmp(*(const char **)a, *(const char **)b);
}
static inline unsigned char ignore(const char *path)
{
return strcmp(path, ".") == 0 ||
strcmp(path, "..") == 0 ||
strcmp(path, REPO) == 0;
}
static inline void *_xmalloc(size_t s, const char *file, int line)
{
void *p = malloc(s);
if (!p)
err(1, "%s:%d: malloc", file, line);
return p;
}
static inline void *_xrealloc(void *ptr, size_t s,
const char *file, int line)
{
void *p = realloc(ptr, s);
if (!p)
err(1, "%s:%d: realloc", file, line);
return p;
}
|
