Searched refs:test_node (Results 1 – 3 of 3) sorted by relevance
| /Linux-v4.19/lib/ |
| D | rbtree_test.c | 17 struct test_node { struct
27 static struct test_node *nodes = NULL; argument
31 static void insert(struct test_node *node, struct rb_root_cached *root) in insert()
38 if (key < rb_entry(parent, struct test_node, rb)->key) in insert()
48 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached()
56 if (key < rb_entry(parent, struct test_node, rb)->key) in insert_cached()
68 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase()
73 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached()
79 static inline u32 augment_recompute(struct test_node *node) in augment_recompute()
83 child_augmented = rb_entry(node->rb.rb_left, struct test_node, in augment_recompute()
[all …]
|
| D | plist.c | 182 static struct plist_node __initdata test_node[241]; variable
228 for (i = 0; i < ARRAY_SIZE(test_node); i++) in plist_test()
229 plist_node_init(test_node + i, 0); in plist_test()
233 i = r % ARRAY_SIZE(test_node); in plist_test()
234 if (plist_node_empty(test_node + i)) { in plist_test()
236 test_node[i].prio = r % 99; in plist_test()
237 plist_add(test_node + i, &test_head); in plist_test()
240 plist_del(test_node + i, &test_head); in plist_test()
244 if (!plist_node_empty(test_node + i)) { in plist_test()
245 plist_test_requeue(test_node + i); in plist_test()
[all …]
|
| /Linux-v4.19/mm/ |
| D | kmemleak-test.c | 34 struct test_node { struct
49 struct test_node *elem; in kmemleak_test_init() argument
100 struct test_node *elem, *tmp; in kmemleak_test_exit()
|
