Searched refs:test_node (Results 1 – 2 of 2) sorted by relevance
| /lib/ |
| D | rbtree_test.c | 10 struct test_node { struct
20 static struct test_node nodes[NODES]; argument
24 static void insert(struct test_node *node, struct rb_root *root) in insert()
31 if (key < rb_entry(parent, struct test_node, rb)->key) in insert()
41 static inline void erase(struct test_node *node, struct rb_root *root) in erase()
46 static inline u32 augment_recompute(struct test_node *node) in augment_recompute()
50 child_augmented = rb_entry(node->rb.rb_left, struct test_node, in augment_recompute()
56 child_augmented = rb_entry(node->rb.rb_right, struct test_node, in augment_recompute()
64 RB_DECLARE_CALLBACKS(static, augment_callbacks, struct test_node, rb, in RB_DECLARE_CALLBACKS() argument
67 static void insert_augmented(struct test_node *node, struct rb_root *root) in RB_DECLARE_CALLBACKS()
[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 …]
|