Home
last modified time | relevance | path

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

/linux-6.3-rc2/lib/
A Dplist.c76 struct list_head *node_next = &head->node_list; in plist_add() local
89 node_next = &iter->node_list; in plist_add()
101 list_add_tail(&node->node_list, node_next); in plist_add()
148 struct list_head *node_next = &head->node_list; in plist_requeue() local
166 node_next = &iter->node_list; in plist_requeue()
170 list_add_tail(&node->node_list, node_next); in plist_requeue()
/linux-6.3-rc2/tools/testing/selftests/kvm/lib/
A Dsparsebit.c219 static struct node *node_next(struct sparsebit *s, struct node *np) in node_next() function
632 tmp = node_next(s, nodep); in node_reduce()
746 next = node_next(s, nodep); in node_reduce()
1122 nodep2 = node_next(s, nodep1); in sparsebit_first_clear()
1238 candidate = node_next(s, candidate); in sparsebit_next_set()
1277 nodep2 = node_next(s, nodep1); in sparsebit_next_clear()
1421 for (next = node_next(s, nodep); in sparsebit_set_num()
1423 next = node_next(s, nodep)) { in sparsebit_set_num()
1484 for (next = node_next(s, nodep); in sparsebit_clear_num()
1486 next = node_next(s, nodep)) { in sparsebit_clear_num()
[all …]

Completed in 11 milliseconds