| /external/c-ares/ |
| ares_llist.h | 22 struct list_node { struct
23 struct list_node *prev;
24 struct list_node *next;
28 void ares__init_list_head(struct list_node* head);
30 void ares__init_list_node(struct list_node* node, void* d);
32 int ares__is_list_empty(struct list_node* head);
34 void ares__insert_in_list(struct list_node* new_node,
35 struct list_node* old_node);
37 void ares__remove_from_list(struct list_node* node);
39 void ares__swap_lists(struct list_node* head_a
[all...] |
| ares_cancel.c | 29 struct list_node* list_head;
30 struct list_node* list_node; local
34 for (list_node = list_head->next; list_node != list_head; )
36 query = list_node->data;
37 list_node = list_node->next; /* since we're deleting the query */
|
| ares_timeout.c | 37 struct list_node* list_head;
38 struct list_node* list_node; local
52 for (list_node = list_head->next; list_node != list_head;
53 list_node = list_node->next)
55 query = list_node->data;
|
| ares_llist.c | 27 void ares__init_list_head(struct list_node* head) {
34 void ares__init_list_node(struct list_node* node, void* d) {
41 int ares__is_list_empty(struct list_node* head) {
46 void ares__insert_in_list(struct list_node* new_node,
47 struct list_node* old_node) {
55 void ares__remove_from_list(struct list_node* node) {
65 void ares__swap_lists(struct list_node* head_a,
66 struct list_node* head_b) {
69 struct list_node old_a = *head_a;
70 struct list_node old_b = *head_b
[all...] |
| ares_destroy.c | 42 struct list_node* list_head;
43 struct list_node* list_node; local
49 for (list_node = list_head->next; list_node != list_head; )
51 query = list_node->data;
52 list_node = list_node->next; /* since we're deleting the query */
|
| ares_query.c | 75 struct list_node* list_head;
76 struct list_node* list_node; local
81 for (list_node = list_head->next; list_node != list_head;
82 list_node = list_node->next)
84 struct query *q = list_node->data;
|
| ares_private.h | 167 struct list_node queries_to_server;
190 struct list_node queries_by_qid; /* hopefully in same cache line as qid */
191 struct list_node queries_by_timeout;
192 struct list_node queries_to_server;
193 struct list_node all_queries;
294 struct list_node all_queries;
297 struct list_node queries_by_qid[ARES_QID_TABLE_SIZE];
300 struct list_node queries_by_timeout[ARES_TIMEOUT_TABLE_SIZE];
|
| ares_process.c | 507 struct list_node* list_head;
508 struct list_node* list_node; local
519 for (list_node = list_head->next; list_node != list_head; )
521 query = list_node->data;
522 list_node = list_node->next; /* in case the query gets deleted */
542 struct list_node* list_head;
543 struct list_node* list_node local
635 struct list_node* list_node; local
[all...] |
| /device/google/marlin/power/ |
| list.h | 30 struct list_node { struct
31 struct list_node *next;
37 int init_list_head(struct list_node *head);
38 struct list_node * add_list_node(struct list_node *head, void *data);
39 int remove_list_node(struct list_node *head, struct list_node *del_node);
40 void dump_list(struct list_node *head);
41 struct list_node *find_node(struct list_node *head, void *comparison_data)
[all...] |
| list.c | 37 int init_list_head(struct list_node *head)
47 struct list_node *add_list_node(struct list_node *head, void *data)
49 /* Create a new list_node. And put 'data' into it. */
50 struct list_node *new_node;
56 if (!(new_node = malloc(sizeof(struct list_node)))) {
69 int is_list_empty(struct list_node *head)
77 int remove_list_node(struct list_node *head, struct list_node *del_node)
79 struct list_node *current_node
[all...] |
| /device/google/wahoo/power/ |
| list.h | 30 struct list_node { struct
31 struct list_node *next;
37 int init_list_head(struct list_node *head);
38 struct list_node * add_list_node(struct list_node *head, void *data);
39 int remove_list_node(struct list_node *head, struct list_node *del_node);
40 void dump_list(struct list_node *head);
41 struct list_node *find_node(struct list_node *head, void *comparison_data)
[all...] |
| list.c | 37 int init_list_head(struct list_node *head)
47 struct list_node *add_list_node(struct list_node *head, void *data)
49 /* Create a new list_node. And put 'data' into it. */
50 struct list_node *new_node;
56 if (!(new_node = malloc(sizeof(struct list_node)))) {
69 int is_list_empty(struct list_node *head)
77 int remove_list_node(struct list_node *head, struct list_node *del_node)
79 struct list_node *current_node
[all...] |
| utils.c | 50 static struct list_node active_hint_list_head;
231 struct list_node *found_node = find_node(&active_hint_list_head,
284 struct list_node *found_node;
|
| /device/huawei/angler/power/ |
| list.h | 30 struct list_node { struct
31 struct list_node *next;
37 int init_list_head(struct list_node *head);
38 struct list_node * add_list_node(struct list_node *head, void *data);
39 int remove_list_node(struct list_node *head, struct list_node *del_node);
40 void dump_list(struct list_node *head);
41 struct list_node *find_node(struct list_node *head, void *comparison_data)
[all...] |
| list.c | 37 int init_list_head(struct list_node *head)
47 struct list_node *add_list_node(struct list_node *head, void *data)
49 /* Create a new list_node. And put 'data' into it. */
50 struct list_node *new_node;
56 if (!(new_node = malloc(sizeof(struct list_node)))) {
69 int is_list_empty(struct list_node *head)
77 int remove_list_node(struct list_node *head, struct list_node *del_node)
79 struct list_node *current_node
[all...] |
| utils.c | 51 static struct list_node active_hint_list_head;
268 struct list_node *found_node;
|
| /device/lge/bullhead/power/ |
| list.h | 30 struct list_node { struct
31 struct list_node *next;
37 int init_list_head(struct list_node *head);
38 struct list_node * add_list_node(struct list_node *head, void *data);
39 int remove_list_node(struct list_node *head, struct list_node *del_node);
40 void dump_list(struct list_node *head);
41 struct list_node *find_node(struct list_node *head, void *comparison_data)
[all...] |
| list.c | 37 int init_list_head(struct list_node *head)
47 struct list_node *add_list_node(struct list_node *head, void *data)
49 /* Create a new list_node. And put 'data' into it. */
50 struct list_node *new_node;
56 if (!(new_node = malloc(sizeof(struct list_node)))) {
69 int is_list_empty(struct list_node *head)
77 int remove_list_node(struct list_node *head, struct list_node *del_node)
79 struct list_node *current_node
[all...] |
| utils.c | 51 static struct list_node active_hint_list_head;
263 struct list_node *found_node;
|
| /device/google/marlin/dataservices/datatop/src/ |
| datatop_linked_list.c | 57 struct dtop_linked_list *list_node; local
58 list_node = malloc(sizeof(struct dtop_linked_list));
60 if (!list_node) {
65 list_node->data = data;
66 list_node->next_ptr = list;
67 list = list_node;
|
| /external/kmod/libkmod/ |
| libkmod-list.c | 30 static inline struct list_node *list_node_init(struct list_node *node)
38 static inline void list_node_append(struct list_node *list,
39 struct list_node *node)
52 static inline struct list_node *list_node_remove(struct list_node *node)
63 static inline void list_node_insert_after(struct list_node *list,
64 struct list_node *node)
77 static inline void list_node_insert_before(struct list_node *list,
78 struct list_node *node
[all...] |
| /system/bt/osi/test/ |
| list_test.cc | 114 EXPECT_EQ(list_node(node), &x[i]);
128 EXPECT_EQ(list_node(node), &x[i]);
191 int* rc_val = (int*)list_node(rc);
197 rc_val = (int*)list_node(rc);
203 rc_val = (int*)list_node(rc);
|
| /system/bt/osi/include/ |
| list.h | 139 void* list_node(const list_node_t* node);
|
| /system/bt/btif/src/ |
| btif_profile_queue.cc | 81 if (((connect_node_t*)list_node(node))->uuid == p_param->uuid) {
123 connection_request = (connect_node_t*)list_node(node);
|
| /system/bt/osi/src/ |
| config.cc | 114 section_t* sec = static_cast<section_t*>(list_node(node));
119 entry_t* entry = static_cast<entry_t*>(list_node(node_entry));
222 entry_t* entry = static_cast<entry_t*>(list_node(node));
275 const section_t* section = (const section_t*)list_node(lnode);
327 const section_t* section = (const section_t*)list_node(node);
336 const entry_t* entry = (const entry_t*)list_node(enode);
481 section_t* sec = static_cast<section_t*>(list_node(node));
512 entry_t* entry = static_cast<entry_t*>(list_node(node));
|
