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
|
//===-- sanitizer_list_test.cc --------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file is a part of ThreadSanitizer/AddressSanitizer runtime.
//
//===----------------------------------------------------------------------===//
#include "sanitizer_common/sanitizer_list.h"
#include "gtest/gtest.h"
namespace __sanitizer {
struct ListItem {
ListItem *next;
};
typedef IntrusiveList<ListItem> List;
// Check that IntrusiveList can be made thread-local.
static THREADLOCAL List static_list;
static void SetList(List *l, ListItem *x = 0,
ListItem *y = 0, ListItem *z = 0) {
l->clear();
if (x) l->push_back(x);
if (y) l->push_back(y);
if (z) l->push_back(z);
}
static void CheckList(List *l, ListItem *i1, ListItem *i2 = 0, ListItem *i3 = 0,
ListItem *i4 = 0, ListItem *i5 = 0, ListItem *i6 = 0) {
if (i1) {
CHECK_EQ(l->front(), i1);
l->pop_front();
}
if (i2) {
CHECK_EQ(l->front(), i2);
l->pop_front();
}
if (i3) {
CHECK_EQ(l->front(), i3);
l->pop_front();
}
if (i4) {
CHECK_EQ(l->front(), i4);
l->pop_front();
}
if (i5) {
CHECK_EQ(l->front(), i5);
l->pop_front();
}
if (i6) {
CHECK_EQ(l->front(), i6);
l->pop_front();
}
CHECK(l->empty());
}
TEST(SanitizerCommon, IntrusiveList) {
ListItem items[6];
CHECK_EQ(static_list.size(), 0);
List l;
l.clear();
ListItem *x = &items[0];
ListItem *y = &items[1];
ListItem *z = &items[2];
ListItem *a = &items[3];
ListItem *b = &items[4];
ListItem *c = &items[5];
CHECK_EQ(l.size(), 0);
l.push_back(x);
CHECK_EQ(l.size(), 1);
CHECK_EQ(l.back(), x);
CHECK_EQ(l.front(), x);
l.pop_front();
CHECK(l.empty());
l.CheckConsistency();
l.push_front(x);
CHECK_EQ(l.size(), 1);
CHECK_EQ(l.back(), x);
CHECK_EQ(l.front(), x);
l.pop_front();
CHECK(l.empty());
l.CheckConsistency();
l.push_front(x);
l.push_front(y);
l.push_front(z);
CHECK_EQ(l.size(), 3);
CHECK_EQ(l.front(), z);
CHECK_EQ(l.back(), x);
l.CheckConsistency();
l.pop_front();
CHECK_EQ(l.size(), 2);
CHECK_EQ(l.front(), y);
CHECK_EQ(l.back(), x);
l.pop_front();
l.pop_front();
CHECK(l.empty());
l.CheckConsistency();
l.push_back(x);
l.push_back(y);
l.push_back(z);
CHECK_EQ(l.size(), 3);
CHECK_EQ(l.front(), x);
CHECK_EQ(l.back(), z);
l.CheckConsistency();
l.pop_front();
CHECK_EQ(l.size(), 2);
CHECK_EQ(l.front(), y);
CHECK_EQ(l.back(), z);
l.pop_front();
l.pop_front();
CHECK(l.empty());
l.CheckConsistency();
List l1, l2;
l1.clear();
l2.clear();
l1.append_front(&l2);
CHECK(l1.empty());
CHECK(l2.empty());
l1.append_back(&l2);
CHECK(l1.empty());
CHECK(l2.empty());
SetList(&l1, x);
CheckList(&l1, x);
SetList(&l1, x, y, z);
SetList(&l2, a, b, c);
l1.append_back(&l2);
CheckList(&l1, x, y, z, a, b, c);
CHECK(l2.empty());
SetList(&l1, x, y);
SetList(&l2);
l1.append_front(&l2);
CheckList(&l1, x, y);
CHECK(l2.empty());
}
} // namespace __sanitizer
|
