-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree.c
188 lines (156 loc) · 4.97 KB
/
tree.c
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
#include "tree.h"
#include "color.h"
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
static void
prepare_add(struct tree *tree)
{
if (tree->capacity == tree->count) {
if (tree->capacity == 0)
tree->capacity = 8;
else
tree->capacity *= 2;
tree->nodes = realloc(
tree->nodes,
sizeof(struct node) * tree->capacity);
}
}
static int
add(struct tree *tree, int parent_idx, int last_sibling_idx, struct nstr *name, enum type type)
{
prepare_add(tree);
struct node *new = &tree->nodes[tree->count];
new->name = name;
new->sibling_idx = -1;
new->child_idx = -1;
new->type = type;
// Link node into the tree
if (last_sibling_idx >= 0)
tree->nodes[last_sibling_idx].sibling_idx = (int) tree->count;
else if (parent_idx >= 0)
tree->nodes[parent_idx].child_idx = (int) tree->count;
return (int) tree->count++;
}
struct find_result {
int node_idx;
int last_sibling_idx;
};
static struct find_result
find(struct tree *tree, int parent_idx, char *name, size_t len)
{
struct find_result result;
result.last_sibling_idx = -1;
if (tree->count) {
int sibling_idx = -1;
if (parent_idx >= 0)
sibling_idx = tree->nodes[parent_idx].child_idx;
else
sibling_idx = 0;
while (sibling_idx >= 0) {
// If this node already exists, no need to add it again
struct nstr *sibling_name = tree->nodes[sibling_idx].name;
if (sibling_name->n == len && !memcmp(sibling_name->str, name, (size_t)len)) {
result.node_idx = sibling_idx;
return result;
}
result.last_sibling_idx = sibling_idx;
sibling_idx = tree->nodes[sibling_idx].sibling_idx;
}
}
result.node_idx = -1;
return result;
}
static int
find_or_add(struct tree *tree, struct nstr_block *nstrbp, int parent_idx, char *name, size_t len, enum type type)
{
struct find_result found = find(tree, parent_idx, name, len);
if (found.node_idx >= 0)
return found.node_idx;
else
return add(tree, parent_idx, found.last_sibling_idx, nstr_dup(nstrbp, (nstrlen)len, name), type);
}
void
tree_add_path(struct tree *tree, struct nstr_block *nstrbp, int parent_idx, char *path, size_t off, enum type type)
{
size_t height = 0;
for (;;) {
while (path[off] == '/') off++;
// Occurs on trailing slash
if (path[off] == '\0')
break;
++height;
char *slash = strchr(path+off, '/');
if (!slash) {
// Leaf node
// TODO strchr with len
find_or_add(tree, nstrbp, parent_idx, path+off, strlen(path+off), type);
break;
} else {
int grandparent_idx = parent_idx;
size_t len = (size_t)(slash-path)-off;
struct find_result found_parent = find(tree, grandparent_idx, path+off, len);
if (found_parent.node_idx >= 0) {
parent_idx = found_parent.node_idx;
} else {
*slash = '\0';
enum type parent_type = get_type(path);
*slash = '/';
struct nstr *parent_name = nstr_dup(nstrbp, (nstrlen)len, path+off);
parent_idx = add(tree, grandparent_idx, found_parent.last_sibling_idx, parent_name, parent_type);
}
off += len+1;
}
}
if (height > tree->height)
tree->height = height;
}
static void
print_nodes(struct tree *tree, int *tree_path, int depth, int node_idx)
{
for (;;) {
struct node node = tree->nodes[node_idx];
int child_idx = node.child_idx;
int next_idx = node.sibling_idx;
for (int anscestor = 0; anscestor < depth; anscestor++) {
if (tree->nodes[tree_path[anscestor]].sibling_idx < 0)
printf(" ");
else
printf("│ ");
}
if (next_idx < 0) {
printf("└── ");
} else {
printf("├── ");
}
print_node(node);
if (child_idx >= 0) {
tree_path[depth++] = node_idx;
node_idx = child_idx;
} else {
while (next_idx < 0 && depth > 0) {
node_idx = tree_path[--depth];
next_idx = tree->nodes[node_idx].sibling_idx;
}
if (next_idx < 0)
break;
node_idx = next_idx;
}
}
}
void
print_tree(struct tree *tree)
{
int *path = malloc(sizeof(int) * tree->height);
int root_idx;
// If all paths have a common root component, we draw that as the
// tree's root. Not if we only have a single lonely path -- that would
// just echo that path.
if (tree->count > 1 && tree->nodes[0].sibling_idx < 0) {
print_node(tree->nodes[0]);
root_idx = 1;
} else {
root_idx = 0;
}
print_nodes(tree, path, 0, root_idx);
}