/external/openssh/openbsd-compat/ |
D | sys-queue.h | 131 * added to the list after an existing element or at the head of the list. 132 * Elements being removed from the head of the list should use the explicit 142 * or after an existing element or at the head of the list. A list 145 * A simple queue is headed by a pair of pointers, one the head of the 148 * head of the list. New elements can be added to the list before or after 149 * an existing element, at the head of the list, or at the end of the 152 * A tail queue is headed by a pair of pointers, one to the head of the 156 * after an existing element, at the head of the list, or at the end of 159 * A circle queue is headed by a pair of pointers, one to the head of the 163 * 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/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) 48 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument 49 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument 50 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument 51 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument 52 #define HT_START(name, head) name##_HT_START(head) argument [all …]
|
/external/syslinux/com32/include/linux/ |
D | list.h | 5 …ernel.org/?p=linux/kernel/git/stable/linux-2.6.25.y.git;a=blob_plain;f=include/linux/list.h;hb=HEAD 57 * @head: list head to add it after 59 * Insert a new entry after the specified head. 62 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument 64 __list_add(new, head, head->next); in list_add() 72 * @head: list head to add it before 74 * Insert a new entry before the specified head. 77 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument 79 __list_add(new, head->prev, head); in list_add_tail() 143 * list_move - delete from one list and add as another's head [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/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/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/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/ltp/utils/ffsb-6.0-rc2/ |
D | cirlist.c | 27 cl->head = NULL; in init_cirlist() 40 assert(cl->head == NULL); in cl_insert_tail() 41 cl->head = new; in cl_insert_tail() 42 cl->head->next = cl->head; in cl_insert_tail() 43 cl->head->prev = cl->head; in cl_insert_tail() 47 assert(cl->head->next == cl->head); in cl_insert_tail() 48 assert(cl->head->prev == cl->head); in cl_insert_tail() 49 cl->head->next = new; in cl_insert_tail() 50 cl->head->prev = new; in cl_insert_tail() 51 new->next = cl->head; in cl_insert_tail() [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/jemalloc/test/unit/ |
D | ql.c | 15 test_empty_list(list_head_t *head) in test_empty_list() argument 20 assert_ptr_null(ql_first(head), "Unexpected element for empty list"); in test_empty_list() 21 assert_ptr_null(ql_last(head, link), in test_empty_list() 25 ql_foreach(t, head, link) { in test_empty_list() 31 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() 58 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) in test_entries_list() argument 63 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch"); in test_entries_list() [all …]
|
/external/syslinux/gpxe/src/include/gpxe/ |
D | list.h | 57 * Add a new entry to the head of a list 60 * @v head List head to add it after 62 * Insert a new entry after the specified head. This is good for 65 static inline void list_add ( struct list_head *new, struct list_head *head ) { in list_add() argument 66 __list_add ( new, head, head->next ); in list_add() 68 #define list_add( new, head ) do { \ argument 69 assert ( (head)->next->prev == (head) ); \ 70 assert ( (head)->prev->next == (head) ); \ 71 list_add ( (new), (head) ); \ 78 * @v head List head to add it before [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/dhcpcd-6.8.2/compat/ |
D | queue.h | 41 #define TAILQ_END(head) (NULL) argument 52 #define TAILQ_HEAD_INITIALIZER(head) \ argument 53 { TAILQ_END(head), &(head).tqh_first } 67 #define TAILQ_FIRST(head) ((head)->tqh_first) argument 69 #define TAILQ_LAST(head, headname) \ argument 70 (*(((struct headname *)((head)->tqh_last))->tqh_last)) 73 #define TAILQ_EMPTY(head) (TAILQ_FIRST(head) == TAILQ_END(head)) argument 77 #define TAILQ_FOREACH(var, head, field) \ argument 78 for ((var) = ((head)->tqh_first); \ 79 (var) != TAILQ_END(head); \ [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/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 | 61 struct curl_llist_element *head; variable 74 * 2: list head will be NULL 80 fail_unless(llist->head == NULL, "list head should initiate to NULL"); 91 * 2: list head will hold the data "unusedData_case1" 92 * 3: list tail will be the same as list head 95 curlErrCode = Curl_llist_insert_next(llist, llist->head, &unusedData_case1); 99 /*test that the list head data holds my unusedData */ 100 fail_unless(llist->head->ptr == &unusedData_case1, 103 fail_unless(llist->tail == llist->head, 109 * list has 1 element, adding one element after the head [all …]
|
/external/blktrace/btt/ |
D | list.h | 68 * @head: list head to add it after 70 * Insert a new entry after the specified head. 73 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument 75 __list_add(new, head, head->next); in list_add() 81 * @head: list head to add it before 83 * Insert a new entry before the specified head. 86 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument 88 __list_add(new, head->prev, head); in list_add_tail() 120 * @head: the head for your list. 127 #define __list_for_each(pos, head) \ argument [all …]
|
/external/fio/ |
D | flist.h | 59 * @head: list head to add it after 61 * Insert a new entry after the specified head. 65 struct flist_head *head) in flist_add() argument 67 __flist_add(new_entry, head, head->next); in flist_add() 71 struct flist_head *head) in flist_add_tail() argument 73 __flist_add(new_entry, head->prev, head); in flist_add_tail() 115 * @head: the list to test. 117 static inline int flist_empty(const struct flist_head *head) in flist_empty() argument 119 return head->next == head; in flist_empty() 137 struct flist_head *head) in flist_splice() argument [all …]
|
/external/libnl/include/netlink/ |
D | list.h | 38 struct nl_list_head *head) in nl_list_add_tail() argument 40 __nl_list_add(obj, head->prev, head); in nl_list_add_tail() 44 struct nl_list_head *head) in nl_list_add_head() argument 46 __nl_list_add(obj, head, head->next); in nl_list_add_head() 55 static inline int nl_list_empty(struct nl_list_head *head) in nl_list_empty() argument 57 return head->next == head; in nl_list_empty() 67 #define nl_list_at_tail(pos, head, member) \ argument 68 ((pos)->member.next == (head)) 70 #define nl_list_at_head(pos, head, member) \ argument 71 ((pos)->member.prev == (head)) [all …]
|
/external/e2fsprogs/lib/blkid/ |
D | list.h | 53 * @head: list head to add it after 55 * Insert a new entry after the specified head. 58 _INLINE_ void list_add(struct list_head *add, struct list_head *head) in list_add() argument 60 __list_add(add, head, head->next); in list_add() 66 * @head: list head to add it before 68 * Insert a new entry before the specified head. 71 _INLINE_ void list_add_tail(struct list_head *add, struct list_head *head) in list_add_tail() argument 73 __list_add(add, head->prev, head); in list_add_tail() 114 * @head: the list to test. 116 _INLINE_ int list_empty(struct list_head *head) in list_empty() argument [all …]
|
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
D | TemplateList.java | 140 TemplateSubPatternAssociation head = in dumpAssociationTables() local 143 while (null != head) in dumpAssociationTables() 145 System.out.print("(" + head.getTargetString() + ", " in dumpAssociationTables() 146 + head.getPattern() + ")"); in dumpAssociationTables() 148 head = head.getNext(); in dumpAssociationTables() 154 TemplateSubPatternAssociation head = m_wildCardPatterns; in dumpAssociationTables() local 158 while (null != head) in dumpAssociationTables() 160 System.out.print("(" + head.getTargetString() + ", " in dumpAssociationTables() 161 + head.getPattern() + ")"); in dumpAssociationTables() 163 head = head.getNext(); in dumpAssociationTables() [all …]
|
/external/toybox/tests/ |
D | head.test | 7 testing "head, stdin" "head -n 1 && echo yes" "one\nyes\n" "" "one\ntwo" 8 testing "head, stdin via -" "head -n 1 - && echo yes" "one\nyes\n" "" "one\ntwo" 9 testing "head, file" "head input -n 1 && echo yes" "one\nyes\n" "one\ntwo" "" 10 testing "-number" "head -2 input && echo yes" "one\ntwo\nyes\n" \ 12 testing "head, default lines" "head" "1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n" "" "1\n2\n3\n4\n5\n6\n7\n8\n… 15 testing "-v file" "head -v -n 1 input" "==> input <==\none\n" "one\ntwo\n" "" 16 testing "-v stdin" "head -v -n 1 | sed 's/==> standard input <==/==> - <==/'" \ 19 testing "file and stdin" "head -n 1 input - | sed 's/==> standard input <==/==> - <==/'" \ 25 testing "head, multiple files" "head -n 2 input file1" "==> input <==\none\ntwo\n\n==> file1 <==\nf… 26 testing "-q, multiple files" "head -q -n 2 input file1" "one\ntwo\nfoo\nbar\n" \ [all …]
|
/external/f2fs-tools/tools/ |
D | f2fstat.c | 69 static inline void remove_newline(char **head) in remove_newline() argument 72 if (**head == '\n') { in remove_newline() 73 *head = *head + 1; in remove_newline() 87 char *head, *tail; in f2fstat() local 126 head = buf; in f2fstat() 129 head = strstr(buf, opt->partname); in f2fstat() 130 if (head == NULL) in f2fstat() 135 remove_newline(&head); in f2fstat() 136 tail = strchr(head, ':'); in f2fstat() 140 if (strlen(head) >= sizeof(keyname)) { in f2fstat() [all …]
|