File: test_list.c

package info (click to toggle)
vlock 2.2.2-5
  • links: PTS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 488 kB
  • ctags: 324
  • sloc: ansic: 2,950; sh: 873; makefile: 236
file content (188 lines) | stat: -rw-r--r-- 4,044 bytes parent folder | download | duplicates (7)
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
#include <CUnit/CUnit.h>

#include "list.h"

#include "test_list.h"

void test_list_new(void)
{
  struct list *l = list_new();

  CU_ASSERT_PTR_NOT_NULL_FATAL(l);
  CU_ASSERT_PTR_NULL(l->first);
  CU_ASSERT_PTR_NULL(l->last);

  list_free(l);
}

void test_list_copy(void)
{
  struct list *l = list_new();
  struct list *m;

  list_append(l, (void *)1);
  list_append(l, (void *)2);
  list_append(l, (void *)3);

  m = list_copy(l);

  CU_ASSERT_EQUAL(list_length(l), list_length(m));
  CU_ASSERT_PTR_NOT_EQUAL(l, m);

  for (struct list_item *item_l = l->first, *item_m = m->first;
      item_l != NULL && item_m != NULL;
      item_l = item_l->next, item_m = item_m->next) {
    CU_ASSERT_PTR_EQUAL(item_l->data, item_m->data);
    CU_ASSERT_PTR_NOT_EQUAL(item_l, item_m);
  }

  list_free(m);
  list_free(l);
}

void test_list_free(void)
{
  struct list *l = list_new();

  list_append(l, (void *)1);
  list_append(l, (void *)2);
  list_append(l, (void *)3);

  list_free(l);

  CU_PASS("list_free() didn't crash");
}

void test_list_length(void)
{
  struct list *l = list_new();

  CU_ASSERT(list_length(l) == 0);

  list_append(l, (void *)1);
  CU_ASSERT(list_length(l) == 1);

  list_append(l, (void *)2);
  CU_ASSERT(list_length(l) == 2);

  list_append(l, (void *)3);
  CU_ASSERT(list_length(l) == 3);

  list_append(l, (void *)4);
  CU_ASSERT(list_length(l) == 4);

  list_free(l);
}

void test_list_append(void)
{
  struct list *l = list_new();

  list_append(l, (void *)1);

  CU_ASSERT_PTR_EQUAL(l->first, l->last);
  CU_ASSERT_PTR_NULL(l->first->previous);
  CU_ASSERT_PTR_NULL(l->last->next);

  CU_ASSERT_PTR_EQUAL(l->first->data, (void *)1);

  list_append(l, (void *)2);

  CU_ASSERT_PTR_NOT_EQUAL(l->first, l->last);
  CU_ASSERT_PTR_EQUAL(l->first->next, l->last);
  CU_ASSERT_PTR_EQUAL(l->last->previous, l->first);
  CU_ASSERT_PTR_NULL(l->first->previous);
  CU_ASSERT_PTR_NULL(l->last->next);

  CU_ASSERT_PTR_EQUAL(l->last->data, (void *)2);

  list_append(l, (void *)3);

  CU_ASSERT_PTR_EQUAL(l->first->next, l->last->previous);
  CU_ASSERT_PTR_EQUAL(l->last->previous->previous, l->first);
  CU_ASSERT_PTR_NULL(l->first->previous);
  CU_ASSERT_PTR_NULL(l->last->next);

  CU_ASSERT_PTR_EQUAL(l->last->data, (void *)3);

  list_free(l);
}

void test_list_delete_item(void)
{
  struct list *l = list_new();

  list_append(l, (void *)1);

  list_delete_item(l, l->first);

  CU_ASSERT_PTR_NULL(l->first);
  CU_ASSERT_PTR_NULL(l->last);

  list_append(l, (void *)1);
  list_append(l, (void *)2);
  list_append(l, (void *)3);

  list_delete_item(l, l->first->next);

  CU_ASSERT_PTR_EQUAL(l->first->next, l->last);
  CU_ASSERT_PTR_EQUAL(l->last->previous, l->first);

  CU_ASSERT_PTR_EQUAL(l->first->data, (void *)1)
  CU_ASSERT_PTR_EQUAL(l->last->data, (void *)3)

  list_free(l);
}

void test_list_delete(void)
{
  struct list *l = list_new();

  list_append(l, (void *)1);
  list_append(l, (void *)2);
  list_append(l, (void *)3);

  list_delete(l, (void *)2);

  CU_ASSERT_PTR_EQUAL(l->first->next, l->last);
  CU_ASSERT_PTR_EQUAL(l->last->previous, l->first);

  CU_ASSERT_PTR_EQUAL(l->first->data, (void *)1)
  CU_ASSERT_PTR_EQUAL(l->last->data, (void *)3)

  list_delete(l, (void *)1);
  list_delete(l, (void *)3);

  CU_ASSERT(list_length(l) == 0);

  list_delete(l, (void *)4);

  list_free(l);
}

void test_list_find(void)
{
  struct list *l = list_new();

  list_append(l, (void *)1);
  list_append(l, (void *)2);
  list_append(l, (void *)3);

  CU_ASSERT_PTR_EQUAL(list_find(l, (void *)2), l->first->next);
  CU_ASSERT_PTR_NULL(list_find(l, (void *)4));
  CU_ASSERT_PTR_NULL(list_find(l, NULL));

  list_free(l);
}

CU_TestInfo list_tests[] = {
  { "test_list_new", test_list_new },
  { "test_list_copy", test_list_copy },
  { "test_list_free", test_list_free },
  { "test_list_length", test_list_length },
  { "test_list_append", test_list_append },
  { "test_list_delete_item", test_list_delete_item },
  { "test_list_delete", test_list_delete },
  { "test_list_find", test_list_find },
  CU_TEST_INFO_NULL,
};