Home
last modified time | relevance | path

Searched refs:test_head (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/lib/
H 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()
[all...]
/kernel/linux/linux-6.6/lib/
H 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()
[all...]
/kernel/linux/linux-5.10/drivers/misc/lkdtm/
H A Dbugs.c264 * test_head.next = &test_head in lkdtm_CORRUPT_LIST_ADD()
265 * test_head.prev = &test_head in lkdtm_CORRUPT_LIST_ADD()
267 LIST_HEAD(test_head); in lkdtm_CORRUPT_LIST_ADD()
276 * test_head.next->prev = &good.node in lkdtm_CORRUPT_LIST_ADD()
277 * good.node.next = test_head.next in lkdtm_CORRUPT_LIST_ADD()
278 * good.node.prev = test_head in lkdtm_CORRUPT_LIST_ADD()
279 * test_head.next = good.node in lkdtm_CORRUPT_LIST_ADD()
281 list_add(&good.node, &test_head); in lkdtm_CORRUPT_LIST_ADD()
[all...]
/kernel/linux/linux-6.6/drivers/misc/lkdtm/
H A Dbugs.c404 * test_head.next = &test_head in lkdtm_CORRUPT_LIST_ADD()
405 * test_head.prev = &test_head in lkdtm_CORRUPT_LIST_ADD()
407 LIST_HEAD(test_head); in lkdtm_CORRUPT_LIST_ADD()
416 * test_head.next->prev = &good.node in lkdtm_CORRUPT_LIST_ADD()
417 * good.node.next = test_head.next in lkdtm_CORRUPT_LIST_ADD()
418 * good.node.prev = test_head in lkdtm_CORRUPT_LIST_ADD()
419 * test_head.next = good.node in lkdtm_CORRUPT_LIST_ADD()
421 list_add(&good.node, &test_head); in lkdtm_CORRUPT_LIST_ADD()
[all...]

Completed in 3 milliseconds