ESP-IDF
_slist::tail
is only used within ESP-IDF.
Symbol previews are coming soon...
Symbols
loading (2/5)...
Files
loading (3/5)...
Summary
Syntax
Examples
References
Call Tree
Data Use
Class Tree
Override Tree
Implementations
Instances
Lifecycle
SourceVu
ESP-IDF Framework and Examples
ESP-IDF
_slist::tail
_slist::tail field
Syntax
Show:
Summary
Declaration
from
slist.h:36
sys_snode_t
*
tail
;
Examples
References
from
examples
Code
Location
Referrer
sys_snode_t
*
tail
;
slist.h:36
sys_snode_t
*
tail
;
slist.h:36
.
struct_slist_off_tail
=
offsetof
(
struct
_slist
,
tail
)
,
ext.c:4219
list
->
tail
=
NULL
;
slist.h:195
sys_slist_init()
return
list
->
tail
;
slist.h:233
sys_slist_peek_tail()
if
(
!
list
->
tail
)
{
slist.h:276
sys_slist_prepend()
list
->
tail
=
list
->
head
;
slist.h:277
sys_slist_prepend()
if
(
!
list
->
tail
)
{
slist.h:294
sys_slist_append()
list
->
tail
=
node
;
slist.h:295
sys_slist_append()
list
->
tail
->
next
=
node
;
slist.h:298
sys_slist_append()
list
->
tail
=
node
;
slist.h:299
sys_slist_append()
if
(
!
list
->
tail
)
{
slist.h:317
sys_slist_append_list()
list
->
tail
=
(
sys_snode_t
*
)
tail
;
slist.h:319
sys_slist_append_list()
list
->
tail
->
next
=
(
sys_snode_t
*
)
head
;
slist.h:321
sys_slist_append_list()
list
->
tail
=
(
sys_snode_t
*
)
tail
;
slist.h:322
sys_slist_append_list()
list_to_append
->
tail
)
;
slist.h:339
sys_slist_merge_slist()
if
(
list
->
tail
==
node
)
{
slist.h:381
sys_slist_get_not_empty()
list
->
tail
=
list
->
head
;
slist.h:382
sys_slist_get_not_empty()
if
(
list
->
tail
==
node
)
{
slist.h:420
sys_slist_remove()
list
->
tail
=
list
->
head
;
slist.h:421
sys_slist_remove()
if
(
list
->
tail
==
node
)
{
slist.h:427
sys_slist_remove()
list
->
tail
=
prev_node
;
slist.h:428
sys_slist_remove()
list
->
tail
=
NULL
;
slist.h:195
sys_slist_init()
return
list
->
tail
;
slist.h:233
sys_slist_peek_tail()
if
(
!
list
->
tail
)
{
slist.h:276
sys_slist_prepend()
list
->
tail
=
list
->
head
;
slist.h:277
sys_slist_prepend()
if
(
!
list
->
tail
)
{
slist.h:294
sys_slist_append()
list
->
tail
=
node
;
slist.h:295
sys_slist_append()
list
->
tail
->
next
=
node
;
slist.h:298
sys_slist_append()
list
->
tail
=
node
;
slist.h:299
sys_slist_append()
if
(
!
list
->
tail
)
{
slist.h:317
sys_slist_append_list()
list
->
tail
=
(
sys_snode_t
*
)
tail
;
slist.h:319
sys_slist_append_list()
list
->
tail
->
next
=
(
sys_snode_t
*
)
head
;
slist.h:321
sys_slist_append_list()
list
->
tail
=
(
sys_snode_t
*
)
tail
;
slist.h:322
sys_slist_append_list()
list_to_append
->
tail
)
;
slist.h:339
sys_slist_merge_slist()
if
(
list
->
tail
==
node
)
{
slist.h:381
sys_slist_get_not_empty()
list
->
tail
=
list
->
head
;
slist.h:382
sys_slist_get_not_empty()
if
(
list
->
tail
==
node
)
{
slist.h:420
sys_slist_remove()
list
->
tail
=
list
->
head
;
slist.h:421
sys_slist_remove()
if
(
list
->
tail
==
node
)
{
slist.h:427
sys_slist_remove()
list
->
tail
=
prev_node
;
slist.h:428
sys_slist_remove()
Call Tree
from
examples
All items filtered out
All items filtered out
Data Use
from
examples
_slist::tail
is written by 6 functions and is read by 7 functions:
sys_slist_init()
sys_slist_prepend()
sys_slist_append()
sys_slist_append_list()
sys_slist_get_not_empty()
sys_slist_remove()
All items filtered out
_slist::tail
sys_slist_peek_tail()
sys_slist_prepend()
sys_slist_append()
sys_slist_append_list()
sys_slist_merge_slist()
sys_slist_get_not_empty()
sys_slist_remove()
All items filtered out
Class Tree
from
examples
All items filtered out
All items filtered out
Override Tree
from
examples
All items filtered out
All items filtered out
Implementations
from
examples
All items filtered out
All items filtered out
Instances
from
examples
Lifecycle
from
examples
All items filtered out
All items filtered out