Home
last modified time | relevance | path

Searched refs:test_head (Results 1 – 2 of 2) sorted by relevance

/linux-6.3-rc2/lib/
A Dplist.c30 static struct plist_head test_head; variable
187 if (plist_head_empty(&test_head)) { in plist_test_check()
192 prio_pos = first = plist_first(&test_head); in plist_test_check()
193 plist_for_each(node_pos, &test_head) { in plist_test_check()
214 plist_requeue(node, &test_head); in plist_test_requeue()
216 if (node != plist_last(&test_head)) in plist_test_requeue()
226 plist_head_init(&test_head); 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()
252 plist_del(test_node + i, &test_head); in plist_test()
/linux-6.3-rc2/drivers/misc/lkdtm/
A Dbugs.c367 LIST_HEAD(test_head); in lkdtm_CORRUPT_LIST_ADD()
381 list_add(&good.node, &test_head); in lkdtm_CORRUPT_LIST_ADD()
389 test_head.next = redirection; in lkdtm_CORRUPT_LIST_ADD()
390 list_add(&bad.node, &test_head); in lkdtm_CORRUPT_LIST_ADD()
402 LIST_HEAD(test_head); in lkdtm_CORRUPT_LIST_DEL()
407 list_add(&item.node, &test_head); in lkdtm_CORRUPT_LIST_DEL()
413 list_add(&item.node, &test_head); in lkdtm_CORRUPT_LIST_DEL()

Completed in 4 milliseconds