vis
a vi-like editor based on Plan 9's structural regular expressions
git clone https://9o.is/git/vis.git
text-test.c
(16037B)
1 #include <stddef.h>
2 #include <stdbool.h>
3 #include <string.h>
4 #include <errno.h>
5 #include <stdio.h>
6 #include <unistd.h>
7 #include "tap.h"
8 #include "text.h"
9 #include "text-util.h"
10 #include "util.h"
11
12 #ifndef BUFSIZ
13 #define BUFSIZ 1024
14 #endif
15
16 static bool insert(Text *txt, size_t pos, const char *data) {
17 return text_insert(txt, pos, data, strlen(data));
18 }
19
20 static bool isempty(Text *txt) {
21 return text_size(txt) == 0;
22 }
23
24 static bool compare_iterator_forward(Iterator *it, const char *data) {
25 char buf[BUFSIZ] = "", b;
26 while (text_iterator_byte_get(it, &b)) {
27 buf[it->pos] = b;
28 text_iterator_byte_next(it, NULL);
29 }
30 return strcmp(data, buf) == 0;
31 }
32
33 static bool compare_iterator_backward(Iterator *it, const char *data) {
34 char buf[BUFSIZ] = "", b;
35 while (text_iterator_byte_get(it, &b)) {
36 buf[it->pos] = b;
37 text_iterator_byte_prev(it, NULL);
38 }
39 return strcmp(data, buf) == 0;
40 }
41
42 static bool compare_iterator_both(Text *txt, const char *data) {
43 Iterator it = text_iterator_get(txt, 0);
44 bool forward = compare_iterator_forward(&it, data);
45 text_iterator_byte_prev(&it, NULL);
46 bool forward_backward = compare_iterator_backward(&it, data);
47 it = text_iterator_get(txt, text_size(txt));
48 bool backward = compare_iterator_backward(&it, data);
49 text_iterator_byte_next(&it, NULL);
50 bool backward_forward = compare_iterator_forward(&it, data);
51 return forward && backward && forward_backward && backward_forward;
52 }
53
54 static bool compare(Text *txt, const char *data) {
55 char buf[BUFSIZ];
56 size_t len = text_bytes_get(txt, 0, sizeof(buf)-1, buf);
57 buf[len] = '\0';
58 return len == strlen(data) && strcmp(buf, data) == 0 &&
59 compare_iterator_both(txt, data);
60 }
61
62 static void iterator_find_everywhere(Text *txt, char *data) {
63 size_t len = strlen(data);
64
65 Iterator it = text_iterator_get(txt, 0);
66
67 for (size_t i = 0; i < len; i++) {
68 ok(text_iterator_byte_find_next(&it, data[i]) && it.pos == i && text_iterator_byte_next(&it, NULL) && it.pos == i+1, "Iterator find byte next at current position");
69 }
70 ok(!text_iterator_byte_find_next(&it, data[len-1]) && it.pos == len, "Iterator find byte next at EOF");
71
72 for (size_t i = len; i-- > 0;) {
73 ok(text_iterator_byte_find_prev(&it, data[i]) && it.pos == i, "Iterator find byte prev at current position");
74 }
75 ok(!text_iterator_byte_find_prev(&it, data[0]) && it.pos == 0, "Iterator find byte prev at BOF");
76
77 }
78
79 static void iterator_find_next(Text *txt, size_t start, char b, size_t match) {
80 Iterator it = text_iterator_get(txt, start);
81 bool found = text_iterator_byte_find_next(&it, b);
82 ok((found && it.pos == match) || (!found && it.pos == text_size(txt)),"Iterator byte find next (start: %zu, match: %zu)", start, match);
83 }
84
85 static void iterator_find_prev(Text *txt, size_t start, char b, size_t match) {
86 Iterator it = text_iterator_get(txt, start);
87 bool found = text_iterator_byte_find_prev(&it, b);
88 ok((found && it.pos == match) || (!found && it.pos == 0),"Iterator byte find prev (start: %zu, match: %zu)", start, match);
89 }
90
91 int main(int argc, char *argv[]) {
92 Text *txt;
93
94 plan_no_plan();
95
96 skip_if(TIS_INTERPRETER, 2, "I/O related") {
97
98 const char *filename = "data";
99 unlink(filename);
100
101 enum TextLoadMethod load_method[] = {
102 TEXT_LOAD_AUTO,
103 TEXT_LOAD_READ,
104 TEXT_LOAD_MMAP,
105 };
106
107 for (size_t i = 0; i < LENGTH(load_method); i++) {
108 txt = text_load_method("/", load_method[i]);
109 ok(txt == NULL && errno == EISDIR, "Opening directory (method %zu)", i);
110
111 if (access("/etc/shadow", F_OK) == 0 && access("/etc/shadow", R_OK) != 0) {
112 txt = text_load_method("/etc/shadow", load_method[i]);
113 ok(txt == NULL && errno == EACCES, "Opening file without sufficient permissions (method %zu)", i);
114 }
115 }
116
117 char buf[BUFSIZ] = "Hello World!\n";
118 txt = text_load(NULL);
119 ok(txt && insert(txt, 0, buf) && compare(txt, buf), "Inserting into empty text");
120 ok(txt && text_save(txt, filename), "Text save");
121 text_free(txt);
122
123 for (size_t i = 0; i < LENGTH(load_method); i++) {
124 txt = text_load_method(filename, load_method[i]);
125 ok(txt && compare(txt, buf), "Load text (method %zu)", i);
126 text_free(txt);
127 }
128
129 enum TextSaveMethod save_method[] = {
130 TEXT_SAVE_AUTO,
131 TEXT_SAVE_ATOMIC,
132 TEXT_SAVE_INPLACE,
133 };
134
135 for (size_t l = 0; l < LENGTH(load_method); l++) {
136 for (size_t s = 0; s < LENGTH(save_method); s++) {
137 #ifdef __CYGWIN__
138 if (load_method[l] == TEXT_LOAD_MMAP && save_method[s] == TEXT_SAVE_INPLACE)
139 continue;
140 #endif
141 snprintf(buf, sizeof buf, "Hello World: (%zu, %zu)\n", l, s);
142 txt = text_load_method(filename, load_method[l]);
143 ok(txt, "Load (%zu, %zu)", l, s);
144 ok(txt && text_delete(txt, 0, text_size(txt)) && isempty(txt), "Empty (%zu, %zu)", l, s);
145 ok(txt && insert(txt, 0, buf) && compare(txt, buf), "Preparing to save (%zu, %zu)", l, s);
146 ok(txt && text_save_method(txt, filename, save_method[s]), "Text save (%zu, %zu)", l, s);
147 text_free(txt);
148
149 txt = text_load(filename);
150 ok(txt && compare(txt, buf), "Verify save (%zu, %zu)", l, s);
151 text_free(txt);
152 }
153 }
154
155 int (*creation[])(const char*, const char*) = { symlink, link };
156 const char *names[] = { "symlink", "hardlink" };
157
158 for (size_t i = 0; i < LENGTH(names); i++) {
159 const char *linkname = names[i];
160 unlink(linkname);
161 ok(creation[i](filename, linkname) == 0, "%s creation", names[i]);
162
163 snprintf(buf, sizeof buf, "%s\n", names[i]);
164 txt = text_load(NULL);
165 ok(txt && insert(txt, 0, buf) && compare(txt, buf), "Preparing %s content", names[i]);
166 ok(txt && text_save(txt, linkname), "Text save %s", names[i]);
167 text_free(txt);
168
169 txt = text_load(linkname);
170 ok(txt && compare(txt, buf), "Load %s", names[i]);
171
172 ok(txt && !text_save_method(txt, linkname, TEXT_SAVE_ATOMIC), "Text save %s atomic", names[i]);
173 text_free(txt);
174 }
175 }
176
177 txt = text_load(NULL);
178 ok(txt != NULL && isempty(txt), "Opening empty file");
179
180 Iterator it = text_iterator_get(txt, 0);
181 ok(text_iterator_valid(&it) && it.pos == 0, "Iterator on empty file");
182 char b = '_';
183 ok(text_iterator_byte_get(&it, &b) && b == '\0', "Read EOF from iterator of empty file");
184 b = '_';
185 ok(!text_iterator_byte_prev(&it, &b) && b == '_' &&
186 !text_iterator_valid(&it), "Moving iterator beyond start of file");
187 ok(!text_iterator_byte_get(&it, &b) && b == '_' &&
188 !text_iterator_valid(&it), "Access iterator beyond start of file");
189 ok(text_iterator_byte_next(&it, &b) && b == '\0' &&
190 text_iterator_valid(&it), "Moving iterator back from beyond start of file");
191 b = '_';
192 ok(text_iterator_byte_get(&it, &b) && b == '\0' &&
193 text_iterator_valid(&it), "Accessing iterator after moving back from beyond start of file");
194 b = '_';
195 ok(!text_iterator_byte_next(&it, &b) && b == '_' &&
196 !text_iterator_valid(&it), "Moving iterator beyond end of file");
197 ok(!text_iterator_byte_get(&it, &b) && b == '_' &&
198 !text_iterator_valid(&it), "Accessing iterator beyond end of file");
199 ok(text_iterator_byte_prev(&it, &b) && b == '\0' &&
200 text_iterator_valid(&it), "Moving iterator back from beyond end of file");
201 b = '_';
202 ok(text_iterator_byte_get(&it, &b) && b == '\0' &&
203 text_iterator_valid(&it), "Accessing iterator after moving back from beyond start of file");
204
205 ok(text_state(txt) > 0, "State on empty file");
206 ok(text_undo(txt) == EPOS && isempty(txt), "Undo on empty file");
207 ok(text_redo(txt) == EPOS && isempty(txt), "Redo on empty file");
208
209 char data[] = "a\nb\nc\n";
210 size_t data_len = strlen(data);
211 ok(insert(txt, 0, data), "Inserting new lines");
212 iterator_find_everywhere(txt, data);
213 iterator_find_next(txt, 0, 'a', 0);
214 iterator_find_next(txt, 0, 'b', 2);
215 iterator_find_next(txt, 0, 'c', 4);
216 iterator_find_next(txt, 0, 'e', EPOS);
217 iterator_find_prev(txt, data_len, 'a', 0);
218 iterator_find_prev(txt, data_len, 'b', 2);
219 iterator_find_prev(txt, data_len, 'c', 4);
220 iterator_find_prev(txt, data_len, 'e', EPOS);
221 ok(text_undo(txt) == 0 && isempty(txt), "Undo to empty document 1");
222
223 ok(insert(txt, 1, "") && isempty(txt), "Inserting empty data");
224 ok(!insert(txt, 1, " ") && isempty(txt), "Inserting with invalid offset");
225
226 /* test cached insertion (i.e. in-place with only one piece) */
227 ok(insert(txt, 0, "3") && compare(txt, "3"), "Inserting into empty document (cached)");
228 ok(insert(txt, 0, "1") && compare(txt, "13"), "Inserting at begin (cached)");
229 ok(insert(txt, 1, "2") && compare(txt, "123"), "Inserting in middle (cached)");
230 ok(insert(txt, text_size(txt), "4") && compare(txt, "1234"), "Inserting at end (cached)");
231
232 ok(text_delete(txt, text_size(txt), 0) && compare(txt, "1234"), "Deleting empty range");
233 ok(!text_delete(txt, text_size(txt), 1) && compare(txt, "1234"), "Deleting invalid offset");
234 ok(!text_delete(txt, 0, text_size(txt)+5) && compare(txt, "1234"), "Deleting invalid range");
235
236 ok(text_undo(txt) == 0 && compare(txt, ""), "Reverting to empty document");
237 ok(text_redo(txt) != EPOS /* == text_size(txt) */ && compare(txt, "1234"), "Restoring previsous content");
238
239 /* test cached deletion (i.e. in-place with only one piece) */
240 ok(text_delete(txt, text_size(txt)-1, 1) && compare(txt, "123"), "Deleting at end (cached)");
241 ok(text_delete(txt, 1, 1) && compare(txt, "13"), "Deleting in middle (cached)");
242 ok(text_delete(txt, 0, 1) && compare(txt, "3"), "Deleting at begin (cached)");
243 ok(text_delete(txt, 0, 1) && compare(txt, ""), "Deleting to empty document (cached)");
244
245 /* test regular insertion (i.e. with multiple pieces) */
246 text_snapshot(txt);
247 ok(insert(txt, 0, "3") && compare(txt, "3"), "Inserting into empty document");
248 text_snapshot(txt);
249 ok(insert(txt, 0, "1") && compare(txt, "13"), "Inserting at begin");
250 text_snapshot(txt);
251 ok(insert(txt, 1, "2") && compare(txt, "123"), "Inserting in between");
252 text_snapshot(txt);
253 ok(insert(txt, text_size(txt), "46") && compare(txt, "12346"), "Inserting at end");
254 text_snapshot(txt);
255 ok(insert(txt, 4, "5") && compare(txt, "123456"), "Inserting in middle");
256 text_snapshot(txt);
257 ok(insert(txt, text_size(txt), "789") && compare(txt, "123456789"), "Inserting at end");
258 text_snapshot(txt);
259 ok(insert(txt, text_size(txt), "0") && compare(txt, "1234567890"), "Inserting at end");
260
261 /* test simple undo / redo oparations */
262 ok(text_undo(txt) != EPOS && compare(txt, "123456789"), "Undo 1");
263 ok(text_undo(txt) != EPOS && compare(txt, "123456"), "Undo 2");
264 ok(text_undo(txt) != EPOS && compare(txt, "12346"), "Undo 3");
265 ok(text_undo(txt) != EPOS && compare(txt, "123"), "Undo 4");
266 ok(text_undo(txt) != EPOS && compare(txt, "13"), "Undo 5");
267 ok(text_undo(txt) != EPOS && compare(txt, "3"), "Undo 6");
268 ok(text_undo(txt) != EPOS && compare(txt, ""), "Undo 7");
269 ok(text_redo(txt) != EPOS && compare(txt, "3"), "Redo 1");
270 ok(text_redo(txt) != EPOS && compare(txt, "13"), "Redo 2");
271 ok(text_redo(txt) != EPOS && compare(txt, "123"), "Redo 3");
272 ok(text_redo(txt) != EPOS && compare(txt, "12346"), "Redo 4");
273 ok(text_redo(txt) != EPOS && compare(txt, "123456"), "Redo 5");
274 ok(text_redo(txt) != EPOS && compare(txt, "123456789"), "Redo 6");
275 ok(text_redo(txt) != EPOS && compare(txt, "1234567890"), "Redo 7");
276 ok(text_earlier(txt) != EPOS && compare(txt, "123456789"), "Earlier 1");
277 ok(text_earlier(txt) != EPOS && compare(txt, "123456"), "Earlier 2");
278 ok(text_earlier(txt) != EPOS && compare(txt, "12346"), "Earlier 3");
279 ok(text_earlier(txt) != EPOS && compare(txt, "123"), "Earlier 4");
280 ok(text_earlier(txt) != EPOS && compare(txt, "13"), "Earlier 5");
281 ok(text_earlier(txt) != EPOS && compare(txt, "3"), "Earlier 6");
282 ok(text_earlier(txt) != EPOS && compare(txt, ""), "Earlier 7");
283 ok(text_later(txt) != EPOS && compare(txt, "3"), "Later 1");
284 ok(text_later(txt) != EPOS && compare(txt, "13"), "Later 2");
285 ok(text_later(txt) != EPOS && compare(txt, "123"), "Later 3");
286 ok(text_later(txt) != EPOS && compare(txt, "12346"), "Later 4");
287 ok(text_later(txt) != EPOS && compare(txt, "123456"), "Later 5");
288 ok(text_later(txt) != EPOS && compare(txt, "123456789"), "Later 6");
289 ok(text_later(txt) != EPOS && compare(txt, "1234567890"), "Later 7");
290
291 /* test regular deletion (i.e. with multiple pieces) */
292 ok(text_delete(txt, 8, 2) && compare(txt, "12345678"), "Deleting midway start");
293 text_undo(txt);
294 ok(text_delete(txt, 2, 6) && compare(txt, "1290"), "Deleting midway end");
295 text_undo(txt);
296 ok(text_delete(txt, 7, 1) && compare(txt, "123456790"), "Deleting midway both same piece");
297 text_undo(txt);
298 ok(text_delete(txt, 0, 5) && compare(txt, "67890"), "Deleting at begin");
299 text_undo(txt);
300 ok(text_delete(txt, 5, 5) && compare(txt, "12345"), "Deleting at end");
301
302 ok(text_mark_get(txt, text_mark_set(txt, -1)) == EPOS, "Mark invalid 1");
303 ok(text_mark_get(txt, text_mark_set(txt, text_size(txt)+1)) == EPOS, "Mark invalid 2");
304
305 const char *chunk = "new content";
306 const size_t delta = strlen(chunk);
307 size_t positions[] = { 0, 1, text_size(txt)/2, text_size(txt)-1 };
308 text_snapshot(txt);
309 for (size_t i = 0; i < LENGTH(positions); i++) {
310 size_t pos = positions[i];
311 Mark bof = text_mark_set(txt, 0);
312 ok(text_mark_get(txt, bof) == 0, "Mark at beginning of file");
313 Mark mof = text_mark_set(txt, pos);
314 ok(text_mark_get(txt, mof) == pos, "Mark in the middle");
315 Mark eof = text_mark_set(txt, text_size(txt));
316 ok(text_mark_get(txt, eof) == text_size(txt), "Mark at end of file");
317 ok(insert(txt, pos, chunk), "Insert before mark");
318 ok(text_mark_get(txt, bof) == ((pos == 0) ? delta : 0), "Mark at beginning adjusted 1");
319 ok(text_mark_get(txt, mof) == pos+delta, "Mark in the middle adjusted 1");
320 ok(text_mark_get(txt, eof) == text_size(txt), "Mark at end adjusted 1");
321 ok(insert(txt, pos+delta+1, chunk), "Insert after mark");
322 ok(text_mark_get(txt, bof) == ((pos == 0) ? delta : 0), "Mark at beginning adjusted 2");
323 ok(text_mark_get(txt, mof) == pos+delta, "Mark in the middle adjusted 2");
324 ok(text_mark_get(txt, eof) == text_size(txt), "Mark at end adjusted 2");
325 text_snapshot(txt);
326 ok(text_delete(txt, pos+delta, 1), "Deleting mark");
327 ok(text_mark_get(txt, mof) == EPOS, "Mark in the middle deleted");
328 text_undo(txt);
329 ok(text_mark_get(txt, mof) == pos+delta, "Mark restored");
330 text_undo(txt);
331 }
332
333 text_snapshot(txt);
334
335 /* Test branching of the revision tree:
336 *
337 * 0 -- 1 -- 2 -- 3
338 * \
339 * `-- 4 -- 5 -- 6 -- 7
340 */
341 typedef struct {
342 time_t state;
343 char data[8];
344 } Rev;
345
346 Rev revs[8];
347 size_t rev = 0;
348
349 for (size_t i = 0; i < LENGTH(revs)/2; i++) {
350 snprintf(revs[i].data, sizeof revs[i].data, "%zu", i);
351 ok(text_delete(txt, 0, text_size(txt)) && text_size(txt) == 0, "Delete everything %zu", i);
352 ok(insert(txt, 0, revs[i].data) && compare(txt, revs[i].data), "Creating state %zu", i);
353 revs[i].state = text_state(txt);
354 text_snapshot(txt);
355 rev = i;
356 }
357
358 for (size_t i = 0; i < LENGTH(revs)/4; i++) {
359 rev--;
360 ok(text_undo(txt) != EPOS && compare(txt, revs[rev].data), "Undo to state %zu", rev);
361 }
362
363 for (size_t i = LENGTH(revs)/2; i < LENGTH(revs); i++) {
364 snprintf(revs[i].data, sizeof revs[i].data, "%zu", i);
365 ok(text_delete(txt, 0, text_size(txt)) && text_size(txt) == 0, "Delete everything %zu", i);
366 ok(insert(txt, 0, revs[i].data) && compare(txt, revs[i].data), "Creating state %zu", i);
367 revs[i].state = text_state(txt);
368 text_snapshot(txt);
369 rev++;
370 }
371
372 while (rev > 0) {
373 text_undo(txt);
374 rev--;
375 }
376
377 ok(compare(txt, revs[0].data), "Undo along main branch to state 0");
378
379 for (size_t i = 1; i < LENGTH(revs); i++) {
380 ok(text_later(txt) != EPOS && compare(txt, revs[i].data), "Advance to state %zu", i);
381 }
382
383 for (size_t i = 0; i < LENGTH(revs); i++) {
384 time_t state = revs[i].state;
385 ok(text_restore(txt, state) != EPOS && text_state(txt) == state, "Restore state %zu", i);
386 }
387
388 for (size_t i = LENGTH(revs)-1; i > 0; i--) {
389 ok(text_earlier(txt) != EPOS && compare(txt, revs[i-1].data), "Revert to state %zu", i-1);
390 }
391
392 for (size_t i = 1; i < LENGTH(revs)/2; i++) {
393 text_redo(txt);
394 }
395
396 rev = LENGTH(revs)/2-1;
397 ok(compare(txt, revs[rev].data), "Redo along main branch to state %zu", rev);
398 ok(text_redo(txt) == EPOS, "End of main branch");
399
400 text_free(txt);
401
402 return exit_status();
403 }