-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathwatcher_io.c
More file actions
269 lines (145 loc) · 4.35 KB
/
watcher_io.c
File metadata and controls
269 lines (145 loc) · 4.35 KB
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
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
#include "watcher_io.h"
char *get_rel_path(char *abs_path){
char *ptr = strrchr(abs_path,'/');
if(ptr == NULL){
return NULL;
}
ptr++;
char *trv = ptr;
int size = 0;
do{
trv++;
size++;
}while(*trv!='\0');
char *ret =(char*)malloc(sizeof(char)*(size+1));
char *ret_trv = ret;
do{
*ret_trv = *ptr;
ret_trv++;
ptr++;
}while(*ptr!='\0');
*ret_trv = '\0';
return ret;
}
struct dnode *init_tree(char *loc){
return get_tree(loc);
}
struct fnode *find_fnode_abs(struct dnode *tree, char *loc){
struct dnode *trv = tree;
char *rel_root = get_rel_path(trv->location);
/*Now we find where rel_root is in loc.
but first, we need to protect loc with strdup.
dont forget to free this memory.*/
char *trv_loc = strdup(loc);
char *token = strtok(trv_loc,"/");
if(token == NULL){
free(rel_root);
free(trv_loc);
return NULL;
}
while(strcmp(rel_root,token)!=0){
token = strtok(NULL, "/");
if(token == NULL){
free(rel_root);
free(trv_loc);
return NULL;
}
}
// we wont need this condition actually, it's just there
while(token!=NULL){
// check in the file linked list first, maybe we found it.
struct fnode_list *li = trv->flist;
while(li != NULL){
if(strcmp(li->val->location,loc) == 0){
free(rel_root);
free(trv_loc);
return li->val;
}
else{
li = li->next;
}
}
// alright so that didnt work
token = strtok(NULL,"/"); // this is the next subdirectory
// file does not exist
if(token == NULL){
free(rel_root);
free(trv_loc);
return NULL;
}
struct dnode_list *dli = trv->dlist;
int flag = 0;
while(dli != NULL){
char *rel_dir = get_rel_path(dli->val->location);
if(strcmp(rel_dir,token) == 0){
trv = dli->val;
flag = 1;
break;
}
else{
dli = dli->next;
}
}
if(flag == 0){
free(rel_root);
free(trv_loc);
return NULL; // the file does not exist, as the subdir doesnt.
}
}
free(rel_root);
free(trv_loc);
return NULL; // File does not exist.
}
int write_abs(struct dnode *tree, char *loc, char *content){
struct fnode *f = find_fnode_abs(tree,loc);
if(f == NULL){
return -1;
}
free_str(f->text); // we're gonna add our own string.
f->text = (struct str_blk *)malloc(sizeof(struct str_blk));
int t_len = strlen(content);
char *move = content;
if(((content + t_len) - move) > BLK_SIZE-1){
char *buffer = (char *)malloc(sizeof(char)*(BLK_SIZE));
memcpy(buffer, move, BLK_SIZE-1);
move+=BLK_SIZE-1;
buffer[BLK_SIZE-1] = '\0';
f->text->content = buffer;
f->text->next = NULL;
}
else{
int left = (content + t_len) - move;
char *buffer =(char*)malloc(sizeof(char)*(left+1));
memcpy(buffer,content,left);
buffer[left] = '\0';
f->text->content = buffer;
f->text->next = NULL;
return 0;
}
while(*move!='\0'){
// subtracting pointers to find out how many chars left
if(((content + t_len) - move) >= BLK_SIZE-1){
char *buffer = (char *)malloc(sizeof(char)*(BLK_SIZE));
memcpy(buffer, move, BLK_SIZE-1);
buffer[BLK_SIZE-1] = '\0';
move+=BLK_SIZE-1;
add_str(f->text,buffer);
}
else{
int left = (content + t_len) - move;
char *buffer =(char*)malloc(sizeof(char)*(left+1));
memcpy(buffer,move,left);
buffer[left] = '\0';
add_str(f->text, buffer);
return 0;
}
}
return -2; // unusual cases, as all cases of failure and success have been covered.
}
struct str_blk *read_abs(struct dnode *tree, char *loc){
struct fnode *f = find_fnode_abs(tree, loc);
if(f == NULL){
return NULL;
}
return f->text;
}