OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:list_node_t
(Results
1 - 7
of
7
) sorted by null
/external/bluetooth/bluedroid/osi/include/
list.h
6
struct
list_node_t
;
7
typedef struct
list_node_t
list_node_t
;
typedef in typeref:struct:list_node_t
26
bool list_insert_after(list_t *list,
list_node_t
*prev_node, void *data);
35
list_node_t
*list_begin(const list_t *list);
36
list_node_t
*list_end(const list_t *list);
37
list_node_t
*list_next(const
list_node_t
*node);
38
void *list_node(const
list_node_t
*node);
/external/bluetooth/bluedroid/osi/src/
list.c
6
typedef struct
list_node_t
{
struct
7
struct
list_node_t
*next;
9
}
list_node_t
;
typedef in typeref:struct:list_node_t
12
list_node_t
*head;
13
list_node_t
*tail;
18
static
list_node_t
*list_free_node_(list_t *list,
list_node_t
*node);
74
bool list_insert_after(list_t *list,
list_node_t
*prev_node, void *data) {
79
list_node_t
*node = (
list_node_t
*)malloc(sizeof(list_node_t))
[
all
...]
reactor.c
129
for (const
list_node_t
*iter = list_begin(reactor->objects); iter != list_end(reactor->objects); iter = list_next(iter)) {
160
for (const
list_node_t
*iter = list_begin(reactor->objects); ret > 0 && iter != list_end(reactor->objects); iter = list_next(iter)) {
config.c
152
for (const
list_node_t
*node = list_begin(sec->entries); node != list_end(sec->entries); node = list_next(node)) {
238
for (const
list_node_t
*node = list_begin(config->sections); node != list_end(config->sections); node = list_next(node)) {
271
for (const
list_node_t
*node = list_begin(sec->entries); node != list_end(sec->entries); node = list_next(node)) {
alarm.c
135
for (
list_node_t
*node = list_begin(alarms); node != list_end(alarms); node = list_next(node)) {
136
list_node_t
*next = list_next(node);
fixed_queue.c
74
for (const
list_node_t
*node = list_begin(queue->list); node != list_end(queue->list); node = list_next(node))
/external/bluetooth/bluedroid/osi/test/
list_test.cpp
117
for (const
list_node_t
*node = list_begin(list); node != list_end(list); node = list_next(node), ++i)
131
for (const
list_node_t
*node = list_begin(list); node != list_end(list); node = list_next(node), --i)
Completed in 24 milliseconds