Searched refs:test_head (Results 1 – 2 of 2) sorted by relevance
30 static struct plist_head test_head; variable 209 if (plist_head_empty(&test_head)) { in plist_test_check() 214 prio_pos = first = plist_first(&test_head); in plist_test_check() 215 plist_for_each(node_pos, &test_head) { in plist_test_check() 236 plist_requeue(node, &test_head); in plist_test_requeue() 238 if (node != plist_last(&test_head)) in plist_test_requeue() 248 plist_head_init(&test_head); 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() 274 plist_del(test_node + i, &test_head); in plist_test() [all...]
461 * test_head.next = &test_head in lkdtm_CORRUPT_LIST_ADD() 462 * test_head.prev = &test_head in lkdtm_CORRUPT_LIST_ADD() 464 LIST_HEAD(test_head); in lkdtm_CORRUPT_LIST_ADD() 473 * test_head.next->prev = &good.node in lkdtm_CORRUPT_LIST_ADD() 474 * good.node.next = test_head.next in lkdtm_CORRUPT_LIST_ADD() 475 * good.node.prev = test_head in lkdtm_CORRUPT_LIST_ADD() 476 * test_head.next = good.node in lkdtm_CORRUPT_LIST_ADD() 478 list_add(&good.node, &test_head); in lkdtm_CORRUPT_LIST_ADD() [all...]