list_t::head - syntax, references, description

References

Code

Location

Referrer

list_node_t *head;

list.c:13

list->head = list->tail = NULL;

list.c:30

list_new_internal()

return list->head->data;

list.c:97

list_front()

node->next = list->head;

list->head = node;

list->tail = list->head;

list->head = node;

if (list->head->data == data) {

list.c:183

list_remove()

list_node_t *next = list_free_node(list, list->head);

list.c:184

list_remove()

if (list->tail == list->head) {

list->head = next;

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

list.c:192

list_remove()

if (list->head->data == data) {

list.c:213

list_delete()

list_node_t *next = list_delete_node(list, list->head);

list.c:214

list_delete()

if (list->tail == list->head) {

list->head = next;

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

list.c:222

list_delete()

for (list_node_t *node = list->head; node; ) {

list->head = NULL;

for (list_node_t *node = list->head; node; ) {

return list->head;

Call Tree

All items filtered out

Data Use

list_t::head is written by 6 functions and is read by 7 functions:

list_t::head

Class Tree

All items filtered out

Override Tree

All items filtered out

Implementations

All items filtered out

Instances

Lifecycle

All items filtered out

list_t::head field

Syntax

Examples

References

Call Tree

Data Use

Class Tree

Override Tree

Implementations

Instances

Lifecycle