Searched refs:test_node (Results 1 – 2 of 2) sorted by relevance
| /linux/lib/ |
| H A D | plist.c | 203 static struct plist_node __initdata test_node[241]; variable
249 for (i = 0; i < ARRAY_SIZE(test_node); i++) in plist_test()
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()
265 if (!plist_node_empty(test_node + i)) { in plist_test()
266 plist_test_requeue(test_node + i); in plist_test()
[all …]
|
| H A D | rbtree_test.c | 19 struct test_node { struct
29 static struct test_node *nodes = NULL; argument
33 static void insert(struct test_node *node, struct rb_root_cached *root) in insert()
40 if (key < rb_entry(parent, struct test_node, rb)->key) in insert()
50 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached()
58 if (key < rb_entry(parent, struct test_node, rb)->key) in insert_cached()
70 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase()
75 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached()
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()
[all …]
|