lib/plist.c

203

static struct plist_node __initdata test_node[241];

lib/plist.c

249

for (i = 0; i < ARRAY_SIZE(test_node); i++)

lib/plist.c

250

plist_node_init(test_node + i, 0);

lib/plist.c

254

i = r % ARRAY_SIZE(test_node);

lib/plist.c

255

if (plist_node_empty(test_node + i)) {

lib/plist.c

257

test_node[i].prio = r % 99;

lib/plist.c

258

plist_add(test_node + i, &test_head);

lib/plist.c

261

plist_del(test_node + i, &test_head);

lib/plist.c

265

if (!plist_node_empty(test_node + i)) {

lib/plist.c

266

plist_test_requeue(test_node + i);

lib/plist.c

271

for (i = 0; i < ARRAY_SIZE(test_node); i++) {

lib/plist.c

272

if (plist_node_empty(test_node + i))

lib/plist.c

274

plist_del(test_node + i, &test_head);

lib/plist.c

291

for (i = 0; i < ARRAY_SIZE(test_node); i++) {

lib/plist.c

292

plist_node_init(test_node + i, 0);

lib/plist.c

293

test_node[i].prio = test_data[i];

lib/plist.c

296

for (i = 0; i < ARRAY_SIZE(test_node); i++) {

lib/plist.c

297

if (plist_node_empty(test_node + i)) {

lib/plist.c

299

plist_add(test_node + i, &test_head);

lib/rbtree_test.c

110

static void insert_augmented_cached(struct test_node *node,

lib/rbtree_test.c

116

struct test_node *parent;

lib/rbtree_test.c

121

parent = rb_entry(rb_parent, struct test_node, rb);

lib/rbtree_test.c

139

static void erase_augmented(struct test_node *node, struct rb_root_cached *root)

lib/rbtree_test.c

144

static void erase_augmented_cached(struct test_node *node,

lib/rbtree_test.c

174

struct test_node *cur, *n;

lib/rbtree_test.c

199

struct test_node *node = rb_entry(rb, struct test_node, rb);

lib/rbtree_test.c

225

struct test_node *node = rb_entry(rb, struct test_node, rb);

lib/rbtree_test.c

228

subtree = rb_entry(node->rb.rb_left, struct test_node,

lib/rbtree_test.c

234

subtree = rb_entry(node->rb.rb_right, struct test_node,

lib/rbtree_test.c

29

static struct test_node *nodes = NULL;

lib/rbtree_test.c

33

static void insert(struct test_node *node, struct rb_root_cached *root)

lib/rbtree_test.c

40

if (key < rb_entry(parent, struct test_node, rb)->key)

lib/rbtree_test.c

50

static void insert_cached(struct test_node *node, struct rb_root_cached *root)

lib/rbtree_test.c

58

if (key < rb_entry(parent, struct test_node, rb)->key)

lib/rbtree_test.c

70

static inline void erase(struct test_node *node, struct rb_root_cached *root)

lib/rbtree_test.c

75

static inline void erase_cached(struct test_node *node, struct rb_root_cached *root)

lib/rbtree_test.c

84

struct test_node, rb, u32, augmented, NODE_VAL)

lib/rbtree_test.c

86

static void insert_augmented(struct test_node *node,

lib/rbtree_test.c

92

struct test_node *parent;

lib/rbtree_test.c

96

parent = rb_entry(rb_parent, struct test_node, rb);

samples/kmemleak/kmemleak-test.c

37

struct test_node *elem;

samples/kmemleak/kmemleak-test.c

90

struct test_node *elem, *tmp;