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
|
#include "utils.h"
#include <stic.h>
#include <limits.h> /* INT_MAX */
#include <test-utils.h>
#include "../../src/compat/fs_limits.h"
#include "../../src/filelist.h"
#include "../../src/status.h"
int
load_tree(view_t *view, const char path[], const char cwd[])
{
return load_limited_tree(view, path, cwd, INT_MAX);
}
int
load_limited_tree(view_t *view, const char path[], const char cwd[], int depth)
{
char abs_path[PATH_MAX + 1];
make_abs_path(abs_path, sizeof(abs_path), path, "", cwd);
return flist_load_tree(view, abs_path, depth);
}
void
load_view(view_t *view)
{
curr_stats.load_stage = 2;
load_saving_pos(view);
curr_stats.load_stage = 0;
}
void
validate_tree(const view_t *view)
{
int i;
for(i = 0; i < view->list_rows; ++i)
{
const dir_entry_t *const e = &view->dir_entry[i];
assert_true(i + e->child_count + 1 <= view->list_rows);
assert_true(i - e->child_pos >= 0);
if(e->child_pos != 0)
{
const int j = i - e->child_pos;
const dir_entry_t *const p = &view->dir_entry[j];
assert_true(p->child_count >= e->child_pos);
assert_true(j + p->child_count >= e->child_pos + e->child_count);
}
}
validate_parents(view->dir_entry, view->list_rows);
}
void
validate_parents(const dir_entry_t *entries, int nchildren)
{
int i = 0;
while(i < nchildren)
{
const int parent = entries[0].child_pos;
if(parent == 0)
{
assert_int_equal(0, entries[i].child_pos);
}
else
{
assert_int_equal(parent + i, entries[i].child_pos);
}
validate_parents(&entries[i] + 1, entries[i].child_count);
i += entries[i].child_count + 1;
}
}
/* vim: set tabstop=2 softtabstop=2 shiftwidth=2 noexpandtab cinoptions-=(0 : */
/* vim: set cinoptions+=t0 : */
|
