Searched refs:list_node (Results 1 – 12 of 12) sorted by relevance
/external/c-ares/ |
D | ares_llist.h | 22 struct list_node { struct 23 struct list_node *prev; argument 24 struct list_node *next; argument 28 void ares__init_list_head(struct list_node* head); argument 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 …]
|
D | ares_llist.c | 27 void ares__init_list_head(struct list_node* head) { in ares__init_list_head() 34 void ares__init_list_node(struct list_node* node, void* d) { in ares__init_list_node() 41 int ares__is_list_empty(struct list_node* head) { in ares__is_list_empty() 46 void ares__insert_in_list(struct list_node* new_node, in ares__insert_in_list() 47 struct list_node* old_node) { in ares__insert_in_list() 55 void ares__remove_from_list(struct list_node* node) { in ares__remove_from_list() 65 void ares__swap_lists(struct list_node* head_a, in ares__swap_lists() 66 struct list_node* head_b) { in ares__swap_lists() 69 struct list_node old_a = *head_a; in ares__swap_lists() 70 struct list_node old_b = *head_b; in ares__swap_lists()
|
D | ares_cancel.c | 29 struct list_node* list_head; in ares_cancel() 30 struct list_node* list_node; in ares_cancel() local 34 for (list_node = list_head->next; list_node != list_head; ) in ares_cancel() 36 query = list_node->data; in ares_cancel() 37 list_node = list_node->next; /* since we're deleting the query */ in ares_cancel()
|
D | ares_timeout.c | 37 struct list_node* list_head; in ares_timeout() 38 struct list_node* list_node; in ares_timeout() local 52 for (list_node = list_head->next; list_node != list_head; in ares_timeout() 53 list_node = list_node->next) in ares_timeout() 55 query = list_node->data; in ares_timeout()
|
D | ares_destroy.c | 42 struct list_node* list_head; in ares_destroy() 43 struct list_node* list_node; in ares_destroy() local 49 for (list_node = list_head->next; list_node != list_head; ) in ares_destroy() 51 query = list_node->data; in ares_destroy() 52 list_node = list_node->next; /* since we're deleting the query */ in ares_destroy()
|
D | ares_query.c | 75 struct list_node* list_head; in find_query_by_id() 76 struct list_node* list_node; in find_query_by_id() local 81 for (list_node = list_head->next; list_node != list_head; in find_query_by_id() 82 list_node = list_node->next) in find_query_by_id() 84 struct query *q = list_node->data; in find_query_by_id()
|
D | 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];
|
D | ares_process.c | 507 struct list_node* list_head; in process_timeouts() 508 struct list_node* list_node; in process_timeouts() local 519 for (list_node = list_head->next; list_node != list_head; ) in process_timeouts() 521 query = list_node->data; in process_timeouts() 522 list_node = list_node->next; /* in case the query gets deleted */ in process_timeouts() 542 struct list_node* list_head; in process_answer() 543 struct list_node* list_node; in process_answer() local 564 for (list_node = list_head->next; list_node != list_head; in process_answer() 565 list_node = list_node->next) in process_answer() 567 struct query *q = list_node->data; in process_answer() [all …]
|
/external/kmod/libkmod/ |
D | libkmod-list.c | 30 static inline struct list_node *list_node_init(struct list_node *node) in list_node_init() 38 static inline void list_node_append(struct list_node *list, in list_node_append() 39 struct list_node *node) in list_node_append() 52 static inline struct list_node *list_node_remove(struct list_node *node) in list_node_remove() 63 static inline void list_node_insert_after(struct list_node *list, in list_node_insert_after() 64 struct list_node *node) in list_node_insert_after() 77 static inline void list_node_insert_before(struct list_node *list, in list_node_insert_before() 78 struct list_node *node) in list_node_insert_before() 91 static inline void list_node_append_list(struct list_node *list1, in list_node_append_list() 92 struct list_node *list2) in list_node_append_list() [all …]
|
D | libkmod-internal.h | 53 struct list_node { struct 54 struct list_node *next, *prev; argument 58 struct list_node node;
|
/external/selinux/libsepol/src/ |
D | module_to_cil.c | 182 struct list_node { struct 184 struct list_node *next; argument 188 struct list_node *head; 199 struct list_node *curr = (*list)->head; in list_destroy() 200 struct list_node *tmp; in list_destroy() 214 struct list_node *curr = role_list->head; in role_list_destroy() 231 struct list_node *curr = (*attr_list)->head; in attr_list_destroy() 262 struct list_node *node = calloc(1, sizeof(*node)); in list_prepend() 884 struct list_node *curr; in cil_print_attr_list() 901 struct list_node *curr; in search_attr_list() [all …]
|
/external/v8/src/crankshaft/ |
D | hydrogen-instructions.cc | 525 HUseListNode* list_node = use_list_; in ReplaceAllUsesWith() local 526 HValue* value = list_node->value(); in ReplaceAllUsesWith() 528 value->InternalSetOperandAt(list_node->index(), other); in ReplaceAllUsesWith() 529 use_list_ = list_node->tail(); in ReplaceAllUsesWith() 530 list_node->set_tail(other->use_list_); in ReplaceAllUsesWith() 531 other->use_list_ = list_node; in ReplaceAllUsesWith()
|