Lines Matching refs:test_node
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()
271 for (i = 0; i < ARRAY_SIZE(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()
291 for (i = 0; i < ARRAY_SIZE(test_node); i++) { in plist_test()
292 plist_node_init(test_node + i, 0); in plist_test()
293 test_node[i].prio = test_data[i]; in plist_test()
296 for (i = 0; i < ARRAY_SIZE(test_node); i++) { in plist_test()
297 if (plist_node_empty(test_node + i)) { in plist_test()
299 plist_add(test_node + i, &test_head); in plist_test()