| /external/rust/crates/grpcio-sys/grpc/third_party/cares/cares/ |
| 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);
|
| D | ares_cancel.c | 29 struct list_node list_head_copy; in ares_cancel()
30 struct list_node* list_head; in ares_cancel()
31 struct list_node* list_node; in ares_cancel() local
47 for (list_node = list_head_copy.next; list_node != &list_head_copy; ) in ares_cancel()
49 query = list_node->data; in ares_cancel()
50 list_node = list_node->next; /* since we're deleting the query */ in ares_cancel()
|
| D | ares_timeout.c | 42 struct list_node* list_head; in ares_timeout()
43 struct list_node* list_node; in ares_timeout() local
57 for (list_node = list_head->next; list_node != list_head; in ares_timeout()
58 list_node = list_node->next) in ares_timeout()
60 query = list_node->data; in ares_timeout()
|
| D | ares_destroy.c | 47 struct list_node* list_head; in ares_destroy()
48 struct list_node* list_node; in ares_destroy() local
54 for (list_node = list_head->next; list_node != list_head; ) in ares_destroy()
56 query = list_node->data; in ares_destroy()
57 list_node = list_node->next; /* since we're deleting the query */ in ares_destroy()
|
| 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()
|
| D | ares_query.c | 71 struct list_node* list_head; in find_query_by_id()
72 struct list_node* list_node; in find_query_by_id() local
77 for (list_node = list_head->next; list_node != list_head; in find_query_by_id()
78 list_node = list_node->next) in find_query_by_id()
80 struct query *q = list_node->data; in find_query_by_id()
|
| D | ares_private.h | 181 struct list_node queries_to_server;
204 struct list_node queries_by_qid; /* hopefully in same cache line as qid */
205 struct list_node queries_by_timeout;
206 struct list_node queries_to_server;
207 struct list_node all_queries;
309 struct list_node all_queries;
312 struct list_node queries_by_qid[ARES_QID_TABLE_SIZE];
315 struct list_node queries_by_timeout[ARES_TIMEOUT_TABLE_SIZE];
|
| D | ares_process.c | 542 struct list_node* list_head; in process_timeouts()
543 struct list_node* list_node; in process_timeouts() local
553 for (list_node = list_head->next; list_node != list_head; ) in process_timeouts()
555 query = list_node->data; in process_timeouts()
556 list_node = list_node->next; /* in case the query gets deleted */ in process_timeouts()
576 struct list_node* list_head; in process_answer()
577 struct list_node* list_node; in process_answer() local
597 for (list_node = list_head->next; list_node != list_head; in process_answer()
598 list_node = list_node->next) in process_answer()
600 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/tpm2-tss/src/tss2-fapi/ |
| D | ifapi_keystore.c | 48 NODE_STR_T *list_node = *list_node1; in initialize_explicit_key_path() local
54 if (list_node == NULL) { in initialize_explicit_key_path()
60 if (strncmp("P_", list_node->str, 2) == 0) { in initialize_explicit_key_path()
61 profile = list_node->str; in initialize_explicit_key_path()
62 list_node = list_node->next; in initialize_explicit_key_path()
73 if (list_node == NULL) { in initialize_explicit_key_path()
77 if (strcmp(list_node->str, "HS") == 0 || in initialize_explicit_key_path()
78 strcmp(list_node->str, "HE") == 0 || in initialize_explicit_key_path()
79 strcmp(list_node->str, "HP") == 0 || in initialize_explicit_key_path()
80 strcmp(list_node->str, "HN") == 0 || in initialize_explicit_key_path()
[all …]
|
| D | fapi_util.c | 214 NODE_STR_T *list_node = *list_node1; in init_explicit_key_path() local
220 if (list_node == NULL) { in init_explicit_key_path()
227 if (strncmp("P_", list_node->str, 2) == 0) { in init_explicit_key_path()
228 profile = list_node->str; in init_explicit_key_path()
229 list_node = list_node->next; in init_explicit_key_path()
239 if (list_node == NULL) { in init_explicit_key_path()
243 if (strcmp(list_node->str, "HS") == 0 || in init_explicit_key_path()
244 strcmp(list_node->str, "HE") == 0 || in init_explicit_key_path()
245 strcmp(list_node->str, "HP") == 0 || in init_explicit_key_path()
246 strcmp(list_node->str, "HN") == 0 || in init_explicit_key_path()
[all …]
|
| /external/dynamic_depth/internal/xmpmeta/xml/ |
| D | serializer_impl.cc | 117 xmlNodePtr list_node = in CreateListSerializer() local
123 xmlAddChild(list_node, seq_node); in CreateListSerializer()
124 xmlAddChild(node_, list_node); in CreateListSerializer()
|
| D | deserializer_impl.cc | 156 const xmlNodePtr list_node = [&] { in CreateDeserializerFromListElementAt() local
164 if (list_node == nullptr) { in CreateDeserializerFromListElementAt()
168 xmlNodePtr seq_node = GetFirstSeqElement(list_node); in CreateDeserializerFromListElementAt()
|
| /external/selinux/libsepol/src/ |
| D | module_to_cil.c | 188 struct list_node { struct
190 struct list_node *next; argument
194 struct list_node *head;
205 struct list_node *curr = (*list)->head; in list_destroy()
206 struct list_node *tmp; in list_destroy()
220 struct list_node *curr; in role_list_destroy()
242 struct list_node *curr = (*attr_list)->head; in attr_list_destroy()
273 struct list_node *node = calloc(1, sizeof(*node)); in list_prepend()
894 struct list_node *curr; in cil_print_attr_list()
911 struct list_node *curr; in search_attr_list()
[all …]
|
| /external/libabigail/tests/data/test-diff-filter/ |
| D | test-PR27569-v0.abi | 12497 …<var-decl name="list_node" type-id="72f469ec" visibility="default" filepath="include/linux/pm_doma…
32634 …<var-decl name="list_node" type-id="72f469ec" visibility="default" filepath="include/linux/dma-buf…
42354 …<var-decl name="list_node" type-id="72f469ec" visibility="default" filepath="include/linux/dma-buf…
71115 …<var-decl name="list_node" type-id="72f469ec" visibility="default" filepath="include/linux/pm_doma…
|
| D | test-PR27569-v1.abi | 12497 …<var-decl name="list_node" type-id="72f469ec" visibility="default" filepath="include/linux/pm_doma…
32663 …<var-decl name="list_node" type-id="72f469ec" visibility="default" filepath="include/linux/dma-buf…
42383 …<var-decl name="list_node" type-id="72f469ec" visibility="default" filepath="include/linux/dma-buf…
71129 …<var-decl name="list_node" type-id="72f469ec" visibility="default" filepath="include/linux/pm_doma…
|