/external/libevent/compat/sys/ |
D | queue.h | 46 * added to the list after an existing element or at the head of the list. 47 * Elements being removed from the head of the list should use the explicit 57 * or after an existing element or at the head of the list. A list 60 * A simple queue is headed by a pair of pointers, one the head of the 63 * head of the list. New elements can be added to the list before or after 64 * an existing element, at the head of the list, or at the end of the 67 * A tail queue is headed by a pair of pointers, one to the head of the 71 * after an existing element, at the head of the list, or at the end of 74 * A circle queue is headed by a pair of pointers, one to the head of the 78 * an existing element, at the head of the list, or at the end of the list. [all …]
|
/external/openssh/openbsd-compat/ |
D | sys-queue.h | 137 * added to the list after an existing element or at the head of the list. 138 * Elements being removed from the head of the list should use the explicit 148 * or after an existing element or at the head of the list. A list 151 * A simple queue is headed by a pair of pointers, one the head of the 154 * head of the list. New elements can be added to the list before or after 155 * an existing element, at the head of the list, or at the end of the 158 * A tail queue is headed by a pair of pointers, one to the head of the 162 * after an existing element, at the head of the list, or at the end of 165 * A circle queue is headed by a pair of pointers, one to the head of the 169 * an existing element, at the head of the list, or at the end of the list. [all …]
|
D | sys-tree.h | 84 #define SPLAY_ROOT(head) (head)->sph_root argument 85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument 88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument 89 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 90 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 91 (head)->sph_root = tmp; \ 94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument 95 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \ 96 SPLAY_LEFT(tmp, field) = (head)->sph_root; \ 97 (head)->sph_root = tmp; \ [all …]
|
/external/iperf3/src/ |
D | queue.h | 46 * added to the list after an existing element or at the head of the list. 47 * Elements being removed from the head of the list should use the explicit 57 * or after an existing element or at the head of the list. A list 60 * A simple queue is headed by a pair of pointers, one the head of the 63 * head of the list. New elements can be added to the list before or after 64 * an existing element, at the head of the list, or at the end of the 67 * A tail queue is headed by a pair of pointers, one to the head of the 71 * after an existing element, at the head of the list, or at the end of 74 * A circle queue is headed by a pair of pointers, one to the head of the 78 * an existing element, at the head of the list, or at the end of the list. [all …]
|
/external/libiio/src/iiod/ |
D | queue.h | 43 * head of the list. Elements being removed from the head of the list 53 * or after an existing element or at the head of the list. A list 56 * A simple queue is headed by a pair of pointers, one the head of the 59 * head of the list. New elements can be added to the list after 60 * an existing element, at the head of the list, or at the end of the 63 * A tail queue is headed by a pair of pointers, one to the head of the 67 * after an existing element, at the head of the list, or at the end of 70 * A circle queue is headed by a pair of pointers, one to the head of the 74 * an existing element, at the head of the list, or at the end of the list. 89 #define LIST_HEAD_INITIALIZER(head) \ argument [all …]
|
/external/libevent/ |
D | ht-internal.h | 41 #define HT_EMPTY(head) \ argument 42 ((head)->hth_n_entries == 0) 44 /* How many elements in 'head'? */ 45 #define HT_SIZE(head) \ argument 46 ((head)->hth_n_entries) 49 #define HT_MEM_USAGE(head) \ argument 50 (sizeof(*head) + (head)->hth_table_length * sizeof(void*)) 52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument 53 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument 54 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument [all …]
|
/external/usrsctp/usrsctplib/ |
D | user_queue.h | 41 * added to the list after an existing element or at the head of the list. 42 * Elements being removed from the head of the list should use the explicit 49 * head of the list and the other to the tail of the list. The elements are 52 * to the list after an existing element, at the head of the list, or at the 53 * end of the list. Elements being removed from the head of the tail queue 63 * or after an existing element or at the head of the list. A list 66 * A tail queue is headed by a pair of pointers, one to the head of the 70 * after an existing element, at the head of the list, or at the end of 102 /* Store the last 2 places the queue element or head was altered */ 114 #define QMD_TRACE_HEAD(head) do { \ argument [all …]
|
/external/ipsec-tools/src/include-glibc/sys/ |
D | queue.h | 50 * added to the list after an existing element or at the head of the list. 51 * Elements being removed from the head of the list should use the explicit 58 * head of the list and the other to the tail of the list. The elements are 61 * to the list after an existing element, at the head of the list, or at the 62 * end of the list. Elements being removed from the head of the tail queue 72 * or after an existing element or at the head of the list. A list 75 * A tail queue is headed by a pair of pointers, one to the head of the 79 * after an existing element, at the head of the list, or at the end of 114 #define SLIST_HEAD_INITIALIZER(head) \ argument 125 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument [all …]
|
/external/libwebsockets/lib/misc/lwsac/ |
D | lwsac.c | 29 lws_list_ptr_insert(lws_list_ptr *head, lws_list_ptr *add, in lws_list_ptr_insert() argument 32 while (sort_func && *head) { in lws_list_ptr_insert() 33 if (sort_func(add, *head) <= 0) in lws_list_ptr_insert() 36 head = *head; in lws_list_ptr_insert() 39 *add = *head; in lws_list_ptr_insert() 40 *head = add; in lws_list_ptr_insert() 73 lwsac_extend(struct lwsac *head, int amount) in lwsac_extend() argument 78 assert(head); in lwsac_extend() 79 lachead = (struct lwsac_head *)&head[1]; in lwsac_extend() 96 _lwsac_use(struct lwsac **head, size_t ensure, size_t chunk_size, char backfill) in _lwsac_use() argument [all …]
|
/external/blktrace/iowatcher/ |
D | list.h | 88 * @head: list head to add it after 90 * Insert a new entry after the specified head. 94 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument 96 __list_add(new, head, head->next); in list_add() 99 extern void list_add(struct list_head *new, struct list_head *head); 106 * @head: list head to add it before 108 * Insert a new entry before the specified head. 111 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument 113 __list_add(new, head->prev, head); in list_add_tail() 178 * list_move - delete from one list and add as another's head [all …]
|
/external/ltp/testcases/realtime/include/ |
D | list.h | 94 * @head: list head to add it after 96 * Insert a new entry after the specified head. 99 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument 101 __list_add(new, head, head->next); in list_add() 107 * @head: list head to add it before 109 * Insert a new entry before the specified head. 112 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument 114 __list_add(new, head->prev, head); in list_add_tail() 154 * list_move - delete from one list and add as another's head 156 * @head: the head that will precede our entry [all …]
|
/external/libnfnetlink/include/ |
D | linux_list.h | 89 * @head: list head to add it after 91 * Insert a new entry after the specified head. 94 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument 96 __list_add(new, head, head->next); in list_add() 102 * @head: list head to add it before 104 * Insert a new entry before the specified head. 107 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument 109 __list_add(new, head->prev, head); in list_add_tail() 131 * @head: list head to add it after 133 * Insert a new entry after the specified head. [all …]
|
/external/iptables/libiptc/ |
D | linux_list.h | 85 * @head: list head to add it after 87 * Insert a new entry after the specified head. 90 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument 92 __list_add(new, head, head->next); in list_add() 98 * @head: list head to add it before 100 * Insert a new entry before the specified head. 103 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument 105 __list_add(new, head->prev, head); in list_add_tail() 127 * @head: list head to add it after 129 * Insert a new entry after the specified head. [all …]
|
/external/libnetfilter_conntrack/include/internal/ |
D | linux_list.h | 90 * @head: list head to add it after 92 * Insert a new entry after the specified head. 95 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument 97 __list_add(new, head, head->next); in list_add() 103 * @head: list head to add it before 105 * Insert a new entry before the specified head. 108 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument 110 __list_add(new, head->prev, head); in list_add_tail() 132 * @head: list head to add it after 134 * Insert a new entry after the specified head. [all …]
|
/external/libevent/WIN32-Code/ |
D | tree.h | 77 #define SPLAY_ROOT(head) (head)->sph_root argument 78 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument 81 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument 82 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 83 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 84 (head)->sph_root = tmp; \ 87 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument 88 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \ 89 SPLAY_LEFT(tmp, field) = (head)->sph_root; \ 90 (head)->sph_root = tmp; \ [all …]
|
/external/jemalloc_new/test/unit/ |
D | ql.c | 17 test_empty_list(list_head_t *head) { in test_empty_list() argument 21 assert_ptr_null(ql_first(head), "Unexpected element for empty list"); in test_empty_list() 22 assert_ptr_null(ql_last(head, link), in test_empty_list() 26 ql_foreach(t, head, link) { in test_empty_list() 32 ql_reverse_foreach(t, head, link) { in test_empty_list() 39 list_head_t head; in TEST_BEGIN() local 41 ql_new(&head); in TEST_BEGIN() 42 test_empty_list(&head); in TEST_BEGIN() 57 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) { in test_entries_list() argument 61 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch"); in test_entries_list() [all …]
|
/external/libnetfilter_conntrack/src/conntrack/ |
D | build_mnl.c | 118 switch(ct->head.orig.protonum) { in nfct_build_protoinfo() 123 if (!(test_bit(ATTR_TCP_STATE, ct->head.set) || in nfct_build_protoinfo() 124 test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) || in nfct_build_protoinfo() 125 test_bit(ATTR_TCP_FLAGS_REPL, ct->head.set) || in nfct_build_protoinfo() 126 test_bit(ATTR_TCP_MASK_ORIG, ct->head.set) || in nfct_build_protoinfo() 127 test_bit(ATTR_TCP_MASK_REPL, ct->head.set) || in nfct_build_protoinfo() 128 test_bit(ATTR_TCP_WSCALE_ORIG, ct->head.set) || in nfct_build_protoinfo() 129 test_bit(ATTR_TCP_WSCALE_REPL, ct->head.set))) { in nfct_build_protoinfo() 134 if (test_bit(ATTR_TCP_STATE, ct->head.set)) { in nfct_build_protoinfo() 138 if (test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) && in nfct_build_protoinfo() [all …]
|
D | build.c | 111 switch(ct->head.orig.protonum) { in __build_protoinfo() 116 if (!(test_bit(ATTR_TCP_STATE, ct->head.set) || in __build_protoinfo() 117 test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) || in __build_protoinfo() 118 test_bit(ATTR_TCP_FLAGS_REPL, ct->head.set) || in __build_protoinfo() 119 test_bit(ATTR_TCP_MASK_ORIG, ct->head.set) || in __build_protoinfo() 120 test_bit(ATTR_TCP_MASK_REPL, ct->head.set) || in __build_protoinfo() 121 test_bit(ATTR_TCP_WSCALE_ORIG, ct->head.set) || in __build_protoinfo() 122 test_bit(ATTR_TCP_WSCALE_REPL, ct->head.set))) { in __build_protoinfo() 127 if (test_bit(ATTR_TCP_STATE, ct->head.set)) in __build_protoinfo() 132 if (test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) && in __build_protoinfo() [all …]
|
/external/adhd/cras/src/common/ |
D | utlist.h | 40 * Either way, the pointer to the head of the list must be initialized to NULL. 64 #define LL_PREPEND(head, add) \ argument 66 (add)->next = head; \ 67 head = add; \ 82 #define LL_APPEND(head, add) \ argument 84 __typeof(head) _tmp; \ 86 if (head) { \ 87 _tmp = head; \ 92 (head) = (add); \ 96 #define LL_DELETE(head, del) \ argument [all …]
|
/external/libdrm/intel/ |
D | uthash.h | 119 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \ argument 122 if (head) { \ 124 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \ 125 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \ 126 …HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, … 131 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument 135 HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out); \ 172 #define HASH_MAKE_TABLE(hh,head) \ argument 174 (head)->hh.tbl = (UT_hash_table*)uthash_malloc( \ 176 if (!((head)->hh.tbl)) { uthash_fatal( "out of memory"); } \ [all …]
|
/external/flatbuffers/lobster/ |
D | flatbuffers.lobster | 40 head = 0 53 return buf.length - head 57 return offset { head } 75 object_end = head 83 let object_offset = head 113 head = object_offset 121 buf.write_int32_le(buf.length - object_offset, head - object_offset) 124 vtables.push(head) 129 buf, head = buf.write_int8_le_back(head, 0) 137 let align_size = ((~(head + additional_bytes)) + 1) & (size - 1) [all …]
|
/external/ltp/testcases/kernel/syscalls/epoll2/include/ |
D | dbllist.h | 26 #define DBL_LIST_ADDH(new, head) DBL_LIST_ADD(new, head, (head)->pNext) argument 28 #define DBL_LIST_ADDT(new, head) DBL_LIST_ADD(new, (head)->pPrev, head) argument 44 #define DBL_LIST_EMTPY(head) ((head)->pNext == head) argument 46 #define DBL_LIST_SPLICE(list, head) \ argument 51 struct list_head * at = (head)->pNext; \ 52 (first)->pPrev = head; \ 53 (head)->pNext = first; \ 68 #define DBL_LIST_FIRST(head) (((head)->pNext != (head)) ? (head)->pNext: NULL) argument 70 #define DBL_LIST_LAST(head) (((head)->pPrev != (head)) ? (head)->pPrev: NULL) argument 74 #define DBL_LIST_FOR_EACH(pos, head) for (pos = (head)->pNext; pos != (head); pos = (pos)->pNext) argument [all …]
|
/external/curl/tests/unit/ |
D | unit1300.c | 57 struct Curl_llist_element *head; variable 69 * 2: list head will be NULL 75 fail_unless(llist.head == NULL, "list head should initiate to NULL"); 86 * 2: list head will hold the data "unusedData_case1" 87 * 3: list tail will be the same as list head 90 Curl_llist_insert_next(&llist, llist.head, &unusedData_case1, &case1_list); 94 /*test that the list head data holds my unusedData */ 95 fail_unless(llist.head->ptr == &unusedData_case1, 96 "head ptr should be first entry"); 98 fail_unless(llist.tail == llist.head, [all …]
|
/external/libwebsockets/lib/core/ |
D | buflist.c | 34 lws_buflist_append_segment(struct lws_buflist **head, const uint8_t *buf, in lws_buflist_append_segment() argument 38 int first = !*head; in lws_buflist_append_segment() 39 void *p = *head; in lws_buflist_append_segment() 46 while (*head) { in lws_buflist_append_segment() 51 if (*head == (*head)->next) { in lws_buflist_append_segment() 55 head = &((*head)->next); in lws_buflist_append_segment() 77 *head = nbuf; in lws_buflist_append_segment() 83 lws_buflist_destroy_segment(struct lws_buflist **head) in lws_buflist_destroy_segment() argument 85 struct lws_buflist *old = *head; in lws_buflist_destroy_segment() 87 assert(*head); in lws_buflist_destroy_segment() [all …]
|
/external/linux-kselftest/tools/testing/selftests/arm64/signal/testcases/ |
D | testcases.c | 5 struct _aarch64_ctx *get_header(struct _aarch64_ctx *head, uint32_t magic, in get_header() argument 11 if (!head || resv_sz < HDR_SZ) in get_header() 15 head->magic != magic && head->magic) { in get_header() 16 offs += head->size; in get_header() 17 head = GET_RESV_NEXT_HEAD(head); in get_header() 19 if (head->magic == magic) { in get_header() 20 found = head; in get_header() 59 struct _aarch64_ctx *head = in validate_reserved() local 65 while (head && !terminated && offs < resv_sz) { in validate_reserved() 66 if ((uint64_t)head & 0x0fUL) { in validate_reserved() [all …]
|