| /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/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/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/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/chromium-trace/catapult/third_party/vinn/third_party/parse5/test/data/tree_construction/ |
| D | tests3.dat | 2 <head></head><style></style>
4 Line: 1 Col: 6 Unexpected start tag (head). Expected DOCTYPE.
5 Line: 1 Col: 20 Unexpected start tag (style) that can be in head. Moved.
8 | <head>
13 <head></head><script></script>
15 Line: 1 Col: 6 Unexpected start tag (head). Expected DOCTYPE.
16 Line: 1 Col: 21 Unexpected start tag (script) that can be in head. Moved.
19 | <head>
24 <head></head><!-- --><style></style><!-- --><script></script>
26 Line: 1 Col: 6 Unexpected start tag (head). Expected DOCTYPE.
[all …]
|
| D | entities01.dat | 6 | <head>
15 | <head>
24 | <head>
33 | <head>
42 | <head>
51 | <head>
60 | <head>
69 | <head>
79 | <head>
88 | <head>
[all …]
|
| D | domjs-unsafe.dat | 7 | <head>
19 | <head>
31 | <head>
42 | <head>
52 | <head>
63 | <head>
74 | <head>
85 | <head>
96 | <head>
107 | <head>
[all …]
|
| D | tests19.dat | 7 | <head>
20 | <head>
24 <!doctype html><head></head></p><!--foo-->
29 | <head>
39 | <head>
50 | <head>
61 | <head>
72 | <head>
83 | <head>
93 | <head>
[all …]
|
| D | webkit01.dat | 7 | <head>
16 | <head>
25 | <head>
35 | <head>
47 | <head>
67 | <head>
82 | <head>
102 | <head>
114 | <head>
126 | <head>
[all …]
|
| D | plain-text-unsafe.dat | 6 | <head>
16 | <head>
24 | <head>
32 | <head>
41 | <head>
50 | <head>
58 | <head>
67 | <head>
75 | <head>
83 | <head>
[all …]
|
| D | html5test-com.dat | 6 | <head>
15 | <head>
25 | <head>
35 | <head>
45 | <head>
56 | <head>
64 | <head>
73 | <head>
82 | <head>
91 | <head>
[all …]
|
| D | tests20.dat | 7 | <head>
19 | <head>
31 | <head>
43 | <head>
55 | <head>
67 | <head>
79 | <head>
91 | <head>
103 | <head>
115 | <head>
[all …]
|
| D | template.dat | 7 | <head>
19 | <head>
31 | <head>
43 | <head>
50 <head><template><div></div></template></head>
55 | <head>
69 | <head>
87 | <head>
101 | <head>
111 | <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/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/minijail/ |
| D | syscall_filter.c | 54 void append_filter_block(struct filter_block *head, in append_filter_block() argument
63 if (head->instrs == NULL) { in append_filter_block()
64 new_last = head; in append_filter_block()
67 if (head->next != NULL) { in append_filter_block()
68 head->last->next = new_last; in append_filter_block()
69 head->last = new_last; in append_filter_block()
71 head->last = head->next = new_last; in append_filter_block()
73 head->total_len += len; in append_filter_block()
94 void append_ret_kill(struct filter_block *head) in append_ret_kill() argument
98 append_filter_block(head, filter, ONE_INSTR); in append_ret_kill()
[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 …]
|
| /external/blktrace/btt/ |
| D | list.h | 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()
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()
127 #define __list_for_each(pos, head) \ argument
128 for (pos = (head)->next; pos != (head); pos = pos->next)
136 #define list_for_each_safe(pos, n, head) \ argument
137 for (pos = (head)->next, n = pos->next; pos != (head); \
165 static inline int list_empty(const struct list_head *head) in list_empty() argument
167 return head->next == head; in list_empty()
[all …]
|
| /external/curl/tests/unit/ |
| D | unit1300.c | 61 struct curl_llist_element *head; variable
80 fail_unless(llist->head == NULL, "list head should initiate to NULL");
95 curlErrCode = Curl_llist_insert_next(llist, llist->head, &unusedData_case1);
100 fail_unless(llist->head->ptr == &unusedData_case1,
103 fail_unless(llist->tail == llist->head,
115 curlErrCode = Curl_llist_insert_next(llist, llist->head,
118 fail_unless(llist->head->next->ptr == &unusedData_case3,
137 curlErrCode = Curl_llist_insert_next(llist, llist->head,
140 fail_unless(llist->head->next->ptr == &unusedData_case2,
168 head=llist->head;
[all …]
|
| /external/toybox/toys/pending/ |
| D | tcpsvd.c | 65 struct list *head; member
124 struct list_pid *prev, *free_node, *head = *pids; in delete() local
127 if (!head) return NULL; in delete()
129 while (head) { in delete()
130 if (head->pid == pid) { in delete()
131 ip = head->ip; in delete()
132 free_node = head; in delete()
133 if (!prev) *pids = head->next; in delete()
134 else prev->next = head->next; in delete()
138 prev = head; in delete()
[all …]
|
| /external/e2fsprogs/lib/blkid/ |
| D | list.h | 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()
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()
116 _INLINE_ int list_empty(struct list_head *head) in list_empty() argument
118 return head->next == head; in list_empty()
126 _INLINE_ void list_splice(struct list_head *list, struct list_head *head) in list_splice() argument
132 struct list_head *at = head->next; in list_splice()
134 first->prev = head; in list_splice()
135 head->next = first; in list_splice()
[all …]
|
| /external/f2fs-tools/include/ |
| D | list.h | 38 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
40 __list_add(new, head, head->next); in list_add()
43 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
45 __list_add(new, head->prev, head); in list_add_tail()
66 static inline int list_empty(const struct list_head *head) in list_empty() argument
68 return head->next == head; in list_empty()
74 #define list_for_each(pos, head) \ argument
75 for (pos = (head)->next; pos != (head); pos = pos->next)
77 #define list_for_each_safe(pos, n, head) \ argument
78 for (pos = (head)->next, n = pos->next; pos != (head); \
[all …]
|