list_node_t::next - syntax, references, description

References

Code

Location

Referrer

struct list_node_t *next;

list.c:8

node->next = prev_node->next;

list.c:123

list_insert_after()

prev_node->next = node;

list.c:125

list_insert_after()

node->next = list->head;

node->next = NULL;

list->tail->next = node;

list.c:167

list_append()

for (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->next)

list.c:192

list_remove()

prev->next = list_free_node(list, node);

list.c:194

list_remove()

for (list_node_t *prev = list->head, *node = list->head->next; node; prev = node, node = node->next)

list.c:222

list_delete()

prev->next = list_delete_node(list, node);

list.c:224

list_delete()

list_node_t *next = node->next;

return node->next;

list_node_t *next = node->next;

list.c:289

list_free_node()

list_node_t *next = node->next;

list.c:306

list_delete_node()

Call Tree

All items filtered out

Data Use

list_node_t::next is written by 5 functions and is read by 7 functions:

list_node_t::next

Class Tree

All items filtered out

Override Tree

All items filtered out

Implementations

All items filtered out

Instances

Lifecycle

All items filtered out

list_node_t::next field

Syntax

Examples

References

Call Tree

Data Use

Class Tree

Override Tree

Implementations

Instances

Lifecycle