node_next
list_add_tail(&node->node_list, node_next);
struct list_head *node_next = &head->node_list;
node_next = &iter->node_list;
node_next = &iter->node_list;
list_add_tail(&node->node_list, node_next);
struct list_head *node_next = &head->node_list;
node_next = &iter->node_list;
node_next = &iter->node_list;
nodep2 = node_next(s, nodep1);
candidate = node_next(s, candidate);
nodep2 = node_next(s, nodep1);
for (next = node_next(s, nodep);
next = node_next(s, nodep)) {
for (next = node_next(s, nodep);
next = node_next(s, nodep)) {
for (nodep = node_first(s); nodep; nodep = node_next(s, nodep)) {
prev = nodep, nodep = node_next(s, nodep)) {
tmp = node_next(s, nodep);
next = node_next(s, nodep);