| /third_party/node/deps/cares/src/lib/ |
| 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 | 65 struct list_node* list_head; in find_query_by_id()
66 struct list_node* list_node; in find_query_by_id() local
71 for (list_node = list_head->next; list_node != list_head; in find_query_by_id()
72 list_node = list_node->next) in find_query_by_id()
74 struct query *q = list_node->data; in find_query_by_id()
|
| D | ares_private.h | 192 struct list_node queries_to_server;
215 struct list_node queries_by_qid; /* hopefully in same cache line as qid */
216 struct list_node queries_by_timeout;
217 struct list_node queries_to_server;
218 struct list_node all_queries;
320 struct list_node all_queries;
323 struct list_node queries_by_qid[ARES_QID_TABLE_SIZE];
326 struct list_node queries_by_timeout[ARES_TIMEOUT_TABLE_SIZE];
|
| D | ares_process.c | 537 struct list_node* list_head; in process_timeouts()
538 struct list_node* list_node; in process_timeouts() local
548 for (list_node = list_head->next; list_node != list_head; ) in process_timeouts()
550 query = list_node->data; in process_timeouts()
551 list_node = list_node->next; /* in case the query gets deleted */ in process_timeouts()
571 struct list_node* list_head; in process_answer()
572 struct list_node* list_node; in process_answer() local
592 for (list_node = list_head->next; list_node != list_head; in process_answer()
593 list_node = list_node->next) in process_answer()
595 struct query *q = list_node->data; in process_answer()
[all …]
|
| /third_party/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 | 186 struct list_node queries_to_server;
209 struct list_node queries_by_qid; /* hopefully in same cache line as qid */
210 struct list_node queries_by_timeout;
211 struct list_node queries_to_server;
212 struct list_node all_queries;
314 struct list_node all_queries;
317 struct list_node queries_by_qid[ARES_QID_TABLE_SIZE];
320 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 …]
|
| /third_party/boost/boost/container/detail/ |
| D | block_list.hpp | 38 struct list_node struct
40 list_node *next; argument
41 list_node *previous; argument
46 typedef list_node node;
47 typedef list_node* node_ptr;
48 typedef const list_node* const_node_ptr;
64 : public list_node
75 list_node m_list;
122 list_node *n = list_algo::node_traits::get_next(&m_list); in release()
|
| /third_party/boost/libs/unordered/test/helpers/ |
| D | list.hpp | 40 template <typename T> class list_node;
45 template <typename T> class list_node class
47 list_node(list_node const&);
48 list_node& operator=(list_node const&);
52 list_node* next_;
54 list_node(T const& v) : value_(v), next_(0) {} in list_node() function in test::test_detail::list_node
55 list_node(T const& v, list_node* n) : value_(v), next_(n) {} in list_node() function in test::test_detail::list_node
61 typedef list_node<T> node;
88 typedef list_node<T> node;
124 typedef list_node<T> node;
[all …]
|
| /third_party/boost/libs/interprocess/example/ |
| D | doc_offset_ptr.cpp | 22 struct list_node struct
24 offset_ptr<list_node> next; argument
65 offset_ptr<list_node> prev = 0, current, first; in main()
69 current = static_cast<list_node*>(segment.allocate(sizeof(list_node))); in main()
|
| /third_party/boost/boost/intrusive/detail/ |
| D | list_node.hpp | 36 struct list_node struct
38 typedef typename pointer_rebind<VoidPointer, list_node>::type node_ptr; argument
46 typedef list_node<VoidPointer> node;
|
| /third_party/boost/libs/intrusive/test/ |
| D | container_size_test.cpp | 86 …typedef list< node< list_base_hook<> >, header_holder_type< heap_node_holder< list_node<void*>* > … in test_sizes()
91 …ok<> >, constant_time_size<false>, header_holder_type< heap_node_holder< list_node<void*>* > > > c; in test_sizes()
|
| /third_party/boost/boost/container/ |
| D | list.hpp | 71 struct list_node struct
112 BOOST_CONTAINER_FORCEINLINE ~list_node() in ~list_node() argument
125 struct iiterator_node_value_type< list_node<T,VoidPointer> > {
138 typedef typename dtl::list_node
|
| /third_party/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()
238 struct list_node *curr; in attr_list_destroy()
275 struct list_node *node = calloc(1, sizeof(*node)); in list_prepend()
896 struct list_node *curr; in cil_print_attr_list()
913 struct list_node *curr; in search_attr_list()
[all …]
|
| /third_party/uboot/u-boot-2020.01/drivers/net/ |
| D | e1000.h | 1077 struct list_head list_node; member
|
| D | e1000.c | 5732 list_add_tail(&hw->list_node, &e1000_hw_list); in e1000_initialize()
5752 list_for_each_entry(hw, &e1000_hw_list, list_node) in e1000_find_card()
|