Searched refs:test_node (Results 1 – 2 of 2) sorted by relevance
| /lib/ |
| D | plist.c | 181 static struct plist_node __initdata test_node[241]; variable
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()
[all …]
|
| D | rbtree_test.c | 18 struct test_node { struct
28 static struct test_node *nodes = NULL; argument
32 static void insert(struct test_node *node, struct rb_root_cached *root) in insert()
39 if (key < rb_entry(parent, struct test_node, rb)->key) in insert()
49 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached()
57 if (key < rb_entry(parent, struct test_node, rb)->key) in insert_cached()
69 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase()
74 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached()
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()
[all …]
|