ESP-IDF
hash_map_t::bucket
is only used within ESP-IDF.
Symbol previews are coming soon...
Symbols
loading...
Files
loading...
Summary
Syntax
Examples
References
Call Tree
Data Use
Class Tree
Override Tree
Implementations
Instances
Lifecycle
SourceVu
ESP-IDF Framework and Examples
ESP-IDF
hash_map_t::bucket
hash_map_t::bucket field
Syntax
Show:
Summary
Declaration
from
hash_map.c:31
hash_map_bucket_t
*
bucket
;
Examples
References
from
examples
Code
Location
Referrer
hash_map_bucket_t
*
bucket
;
hash_map.c:31
hash_map
->
bucket
=
osi_calloc
(
sizeof
(
hash_map_bucket_t
)
*
num_bucket
)
;
hash_map.c:70
hash_map_new_internal()
if
(
hash_map
->
bucket
==
NULL
)
{
hash_map.c:71
hash_map_new_internal()
osi_free
(
hash_map
->
bucket
)
;
hash_map.c:94
hash_map_free()
list_t
*
hash_bucket_list
=
hash_map
->
bucket
[
hash_key
]
.
list
;
hash_map.c:120
hash_map_has_key()
if
(
hash_map
->
bucket
[
hash_key
]
.
list
==
NULL
)
{
hash_map.c:133
hash_map_set()
hash_map
->
bucket
[
hash_key
]
.
list
=
list_new_internal
(
bucket_free_
)
;
hash_map.c:134
hash_map_set()
if
(
hash_map
->
bucket
[
hash_key
]
.
list
==
NULL
)
{
hash_map.c:135
hash_map_set()
list_t
*
hash_bucket_list
=
hash_map
->
bucket
[
hash_key
]
.
list
;
hash_map.c:139
hash_map_set()
list_t
*
hash_bucket_list
=
hash_map
->
bucket
[
hash_key
]
.
list
;
hash_map.c:168
hash_map_erase()
if
(
list_is_empty
(
hash_map
->
bucket
[
hash_key
]
.
list
)
)
{
hash_map.c:177
hash_map_erase()
list_free
(
hash_map
->
bucket
[
hash_key
]
.
list
)
;
hash_map.c:178
hash_map_erase()
hash_map
->
bucket
[
hash_key
]
.
list
=
NULL
;
hash_map.c:179
hash_map_erase()
list_t
*
hash_bucket_list
=
hash_map
->
bucket
[
hash_key
]
.
list
;
hash_map.c:190
hash_map_get()
if
(
hash_map
->
bucket
[
i
]
.
list
==
NULL
)
{
hash_map.c:205
hash_map_clear()
list_free
(
hash_map
->
bucket
[
i
]
.
list
)
;
hash_map.c:208
hash_map_clear()
hash_map
->
bucket
[
i
]
.
list
=
NULL
;
hash_map.c:209
hash_map_clear()
if
(
hash_map
->
bucket
[
i
]
.
list
==
NULL
)
{
hash_map.c:219
hash_map_foreach()
for
(
const
list_node_t
*
iter
=
list_begin
(
hash_map
->
bucket
[
i
]
.
list
)
;
hash_map.c:222
hash_map_foreach()
iter
!=
list_end
(
hash_map
->
bucket
[
i
]
.
list
)
;
hash_map.c:223
hash_map_foreach()
Call Tree
from
examples
All items filtered out
All items filtered out
Data Use
from
examples
hash_map_t::bucket
is written by 1 function and is read by 8 functions:
hash_map_new_internal()
All items filtered out
hash_map_t::bucket
hash_map_new_internal()
hash_map_free()
hash_map_has_key()
hash_map_set()
hash_map_erase()
hash_map_get()
hash_map_clear()
hash_map_foreach()
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