| /external/openssh/openbsd-compat/ |
| D | sys-queue.h | 184 #define SLIST_HEAD_INITIALIZER(head) \ argument
195 #define SLIST_FIRST(head) ((head)->slh_first) argument
196 #define SLIST_END(head) NULL argument
197 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
200 #define SLIST_FOREACH(var, head, field) \ argument
201 for((var) = SLIST_FIRST(head); \
202 (var) != SLIST_END(head); \
205 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
206 for ((var) = SLIST_FIRST(head); \
213 #define SLIST_INIT(head) { \ argument
[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/ipsec-tools/src/include-glibc/sys/ |
| D | queue.h | 114 #define SLIST_HEAD_INITIALIZER(head) \ argument
125 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
127 #define SLIST_FIRST(head) ((head)->slh_first) argument
129 #define SLIST_FOREACH(var, head, field) \ argument
130 for ((var) = SLIST_FIRST((head)); \
134 #define SLIST_INIT(head) do { \ argument
135 SLIST_FIRST((head)) = NULL; \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
[all …]
|
| /external/libevent/ |
| D | ht-internal.h | 41 #define HT_EMPTY(head) \ argument
42 ((head)->hth_n_entries == 0)
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
53 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) argument
[all …]
|
| /external/syslinux/com32/include/linux/ |
| D | list.h | 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()
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()
147 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
150 list_add(list, head); in list_move()
159 struct list_head *head) in list_move_tail() argument
162 list_add_tail(list, head); in list_move_tail()
171 const struct list_head *head) in list_is_last() argument
173 return list->next == head; in list_is_last()
[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/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/ltp/testcases/realtime/include/ |
| D | list.h | 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()
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()
158 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
161 list_add(list, head); in list_move()
170 struct list_head *head) in list_move_tail() argument
173 list_add_tail(list, head); in list_move_tail()
180 static inline int list_empty(const struct list_head *head) in list_empty() argument
182 return head->next == head; in list_empty()
[all …]
|
| /external/libnetfilter_conntrack/include/internal/ |
| D | linux_list.h | 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()
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()
145 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu() argument
147 __list_add_rcu(new, head, head->next); in list_add_rcu()
167 struct list_head *head) in list_add_tail_rcu() argument
169 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
243 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
246 list_add(list, head); in list_move()
[all …]
|
| /external/iptables/libiptc/ |
| D | linux_list.h | 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()
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()
140 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu() argument
142 __list_add_rcu(new, head, head->next); in list_add_rcu()
162 struct list_head *head) in list_add_tail_rcu() argument
164 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
238 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
241 list_add(list, head); in list_move()
[all …]
|
| /external/libnfnetlink/include/ |
| D | linux_list.h | 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()
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()
144 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu() argument
146 __list_add_rcu(new, head, head->next); in list_add_rcu()
166 struct list_head *head) in list_add_tail_rcu() argument
168 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
242 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
245 list_add(list, head); in list_move()
[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/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/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/syslinux/gpxe/src/include/gpxe/ |
| D | list.h | 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) ); \
84 struct list_head *head ) { in list_add_tail() argument
85 __list_add ( new, head->prev, head ); in list_add_tail()
87 #define list_add_tail( new, head ) do { \ argument
88 assert ( (head)->next->prev == (head) ); \
[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/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/minijail/ |
| D | syscall_filter.c | 65 void append_filter_block(struct filter_block *head, struct sock_filter *instrs, in append_filter_block() argument
74 if (head->instrs == NULL) { in append_filter_block()
75 new_last = head; in append_filter_block()
78 if (head->next != NULL) { in append_filter_block()
79 head->last->next = new_last; in append_filter_block()
80 head->last = new_last; in append_filter_block()
82 head->last = head->next = new_last; in append_filter_block()
84 head->total_len += len; in append_filter_block()
105 void append_ret_kill(struct filter_block *head) in append_ret_kill() argument
109 append_filter_block(head, filter, ONE_INSTR); in append_ret_kill()
[all …]
|
| /external/strace/tests/ |
| D | caps.c | 45 int * const head = tail_alloc(sizeof(int) * 2); in main() local
46 head[0] = v3; in main()
47 head[1] = 0; in main()
51 capget(head + 2, tail_data); in main()
52 capget(head, tail_data + ARRAY_SIZE(data)); in main()
54 if (capget(head, tail_data)) in main()
56 if (head[0] != v3) in main()
62 capset(head + 2, tail_data); in main()
64 head[0] = 0xbadc0ded; in main()
65 head[1] = 2718281828U; in main()
[all …]
|
| /external/strace/tests-m32/ |
| D | caps.c | 45 int * const head = tail_alloc(sizeof(int) * 2); in main() local
46 head[0] = v3; in main()
47 head[1] = 0; in main()
51 capget(head + 2, tail_data); in main()
52 capget(head, tail_data + ARRAY_SIZE(data)); in main()
54 if (capget(head, tail_data)) in main()
56 if (head[0] != v3) in main()
62 capset(head + 2, tail_data); in main()
64 head[0] = 0xbadc0ded; in main()
65 head[1] = 2718281828U; in main()
[all …]
|
| /external/strace/tests-mx32/ |
| D | caps.c | 45 int * const head = tail_alloc(sizeof(int) * 2); in main() local
46 head[0] = v3; in main()
47 head[1] = 0; in main()
51 capget(head + 2, tail_data); in main()
52 capget(head, tail_data + ARRAY_SIZE(data)); in main()
54 if (capget(head, tail_data)) in main()
56 if (head[0] != v3) in main()
62 capset(head + 2, tail_data); in main()
64 head[0] = 0xbadc0ded; in main()
65 head[1] = 2718281828U; in main()
[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 …]
|
| /external/fio/ |
| D | flist.h | 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()
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
140 __flist_splice(list, head, head->next); in flist_splice()
144 struct flist_head *head) in flist_splice_tail() argument
147 __flist_splice(list, head->prev, head); in flist_splice_tail()
[all …]
|
| /external/fsck_msdos/ |
| D | fat.c | 420 clearchain(struct bootblock *boot, struct fatEntry *fat, cl_t head) in clearchain() argument
424 for (p = head; p >= CLUST_FIRST && p < boot->NumClusters; p = q) { in clearchain()
425 if (fat[p].head != head) in clearchain()
428 fat[p].next = fat[p].head = CLUST_FREE; in clearchain()
434 tryclear(struct bootblock *boot, struct fatEntry *fat, cl_t head, cl_t *trunc) in tryclear() argument
436 if (ask(1, "Clear chain starting at %u", head)) { in tryclear()
437 clearchain(boot, fat, head); in tryclear()
452 cl_t head, p, h, n, wdk; in checkfat() local
460 for (head = CLUST_FIRST; head < boot->NumClusters; head++) { in checkfat()
462 if (fat[head].head != 0 /* cluster already belongs to some chain */ in checkfat()
[all …]
|