Symbols

loading (4/5)...

Files

loading (4/5)...

Summary Syntax Arguments Related References Call Tree Data Use Lifecycle

SourceVuESP-IDF Framework and ExamplesESP-IDFlist_delete_node()

list_delete_node() function

Syntax

Show:

Summary

Declaration

Definition

from list.h:27

list_node_t *list_delete_node(list_t *list, list_node_t *node);

Implemented in list.c:301

Arguments

Argument

list

node

References

Code

Location

Referrer

list_node_t *list_delete_node(list_t *list, list_node_t *node)

list.c:301

list_node_t *list_delete_node(list_t *list, list_node_t *node);

list.h:27

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

list.c:214

list_delete()

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

list.c:224

list_delete()

Call Tree

list_delete_node() is called by 1 function and calls 2 functions:

list_delete()

list_delete_node()

__assert_func()

free()

Data Use

list_delete_node() reads 2 variables and writes 1 variable:

list_node_t::next

list_t::length

list_delete_node()

list_t::length

Class Tree

All items filtered out

Override Tree

All items filtered out

Implementations

All items filtered out

Instances

Lifecycle

list_delete_node() allocates 1 types:

list_node_t

list_delete_node()

list_delete_node() function

Syntax

Arguments

Related Functions

Examples

References

Call Tree

Data Use

Class Tree

Override Tree

Implementations

Instances

Lifecycle