Searched refs:test_node (Results 1 – 3 of 3) sorted by relevance
| /linux/lib/ |
| A D | rbtree_test.c | 18 struct test_node { struct
28 static struct test_node *nodes = NULL; argument
83 struct test_node, rb, u32, augmented, NODE_VAL) in RB_DECLARE_CALLBACKS_MAX() argument
85 static void insert_augmented(struct test_node *node, in RB_DECLARE_CALLBACKS_MAX()
91 struct test_node *parent; in RB_DECLARE_CALLBACKS_MAX()
95 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS_MAX()
115 struct test_node *parent; in insert_augmented_cached()
120 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached()
173 struct test_node *cur, *n; in check_postorder_foreach()
198 struct test_node *node = rb_entry(rb, struct test_node, rb); in check()
[all …]
|
| A D | plist.c | 227 for (i = 0; i < ARRAY_SIZE(test_node); i++) in plist_test()
228 plist_node_init(test_node + i, 0); in plist_test()
232 i = r % ARRAY_SIZE(test_node); in plist_test()
233 if (plist_node_empty(test_node + i)) { in plist_test()
235 test_node[i].prio = r % 99; in plist_test()
236 plist_add(test_node + i, &test_head); in plist_test()
239 plist_del(test_node + i, &test_head); in plist_test()
243 if (!plist_node_empty(test_node + i)) { in plist_test()
244 plist_test_requeue(test_node + i); in plist_test()
250 if (plist_node_empty(test_node + i)) in plist_test()
[all …]
|
| /linux/samples/kmemleak/ |
| A D | kmemleak-test.c | 22 struct test_node { struct
37 struct test_node *elem; in kmemleak_test_init() argument
88 struct test_node *elem, *tmp; in kmemleak_test_exit()
|
Completed in 6 milliseconds