Searched refs:test_node (Results 1 – 3 of 3) sorted by relevance
| /linux-6.15/lib/ |
| H A D | plist.c | 250 plist_node_init(test_node + i, 0); in plist_test()
254 i = r % ARRAY_SIZE(test_node); in plist_test()
255 if (plist_node_empty(test_node + i)) { in plist_test()
257 test_node[i].prio = r % 99; in plist_test()
258 plist_add(test_node + i, &test_head); in plist_test()
261 plist_del(test_node + i, &test_head); in plist_test()
266 plist_test_requeue(test_node + i); in plist_test()
272 if (plist_node_empty(test_node + i)) in plist_test()
274 plist_del(test_node + i, &test_head); in plist_test()
292 plist_node_init(test_node + i, 0); in plist_test()
[all …]
|
| H A D | rbtree_test.c | 19 struct test_node { struct
29 static struct test_node *nodes = NULL; argument
84 struct test_node, rb, u32, augmented, NODE_VAL) in RB_DECLARE_CALLBACKS_MAX() argument
86 static void insert_augmented(struct test_node *node, in RB_DECLARE_CALLBACKS_MAX()
92 struct test_node *parent; in RB_DECLARE_CALLBACKS_MAX()
96 parent = rb_entry(rb_parent, struct test_node, rb); in RB_DECLARE_CALLBACKS_MAX()
116 struct test_node *parent; in insert_augmented_cached()
121 parent = rb_entry(rb_parent, struct test_node, rb); in insert_augmented_cached()
174 struct test_node *cur, *n; in check_postorder_foreach()
199 struct test_node *node = rb_entry(rb, struct test_node, rb); in check()
[all …]
|
| /linux-6.15/samples/kmemleak/ |
| H A D | kmemleak-test.c | 22 struct test_node { struct
37 struct test_node *elem; in kmemleak_test_init() argument
90 struct test_node *elem, *tmp; in kmemleak_test_exit()
|