| /external/chromium/third_party/libevent/compat/sys/ |
| D | queue.h | 93 #define SLIST_HEAD_INITIALIZER(head) \ argument
106 #define SLIST_FIRST(head) ((head)->slh_first) argument
107 #define SLIST_END(head) NULL argument
108 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
111 #define SLIST_FOREACH(var, head, field) \ argument
112 for((var) = SLIST_FIRST(head); \
113 (var) != SLIST_END(head); \
119 #define SLIST_INIT(head) { \ argument
120 SLIST_FIRST(head) = SLIST_END(head); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
|
| /external/qemu/ |
| D | qemu-queue.h | 87 #define QLIST_HEAD_INITIALIZER(head) \ argument
99 #define QLIST_INIT(head) do { \ argument
100 (head)->lh_first = NULL; \
118 #define QLIST_INSERT_HEAD(head, elm, field) do { \ argument
119 if (((elm)->field.le_next = (head)->lh_first) != NULL) \
120 (head)->lh_first->field.le_prev = &(elm)->field.le_next;\
121 (head)->lh_first = (elm); \
122 (elm)->field.le_prev = &(head)->lh_first; \
132 #define QLIST_FOREACH(var, head, field) \ argument
133 for ((var) = ((head)->lh_first); \
[all …]
|
| D | sys-tree.h | 88 #define SPLAY_ROOT(head) (head)->sph_root argument
89 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
92 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
93 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
94 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
95 (head)->sph_root = tmp; \
98 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
99 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
100 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
101 (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/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_PREVPTR(var, varp, head, field) \ argument
206 for ((varp) = &SLIST_FIRST((head)); \
207 ((var) = *(varp)) != SLIST_END(head); \
[all …]
|
| D | sys-tree.h | 79 #define SPLAY_ROOT(head) (head)->sph_root argument
80 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) argument
83 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ argument
84 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
85 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
86 (head)->sph_root = tmp; \
89 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
90 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
91 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
92 (head)->sph_root = tmp; \
[all …]
|
| /external/linux-tools-perf/util/include/linux/added/ |
| D | list.h | 47 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
49 __list_add(new, head, head->next); in list_add()
61 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
63 __list_add(new, head->prev, head); in list_add_tail()
134 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
137 list_add(list, head); in list_move()
146 struct list_head *head) in list_move_tail() argument
149 list_add_tail(list, head); in list_move_tail()
158 const struct list_head *head) in list_is_last() argument
160 return list->next == head; in list_is_last()
[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/kernel-headers/original/linux/ |
| D | list.h | 60 static inline void list_add(struct list_head *new, struct list_head *head) in list_add() argument
62 __list_add(new, head, head->next); in list_add()
73 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
75 __list_add(new, head->prev, head); in list_add_tail()
110 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu() argument
112 __list_add_rcu(new, head, head->next); in list_add_rcu()
132 struct list_head *head) in list_add_tail_rcu() argument
134 __list_add_rcu(new, head->prev, head); in list_add_tail_rcu()
249 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
252 list_add(list, head); in list_move()
[all …]
|
| D | plist.h | 104 #define PLIST_HEAD_INIT(head, _lock) \ argument
106 .prio_list = LIST_HEAD_INIT((head).prio_list), \
107 .node_list = LIST_HEAD_INIT((head).node_list), \
129 plist_head_init(struct plist_head *head, spinlock_t *lock) in plist_head_init() argument
131 INIT_LIST_HEAD(&head->prio_list); in plist_head_init()
132 INIT_LIST_HEAD(&head->node_list); in plist_head_init()
134 head->lock = lock; in plist_head_init()
150 extern void plist_add(struct plist_node *node, struct plist_head *head);
151 extern void plist_del(struct plist_node *node, struct plist_head *head);
159 #define plist_for_each(pos, head) \ argument
[all …]
|
| /external/libnl-headers/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/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/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/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/v8/tools/ |
| D | profile_view.js | 49 var head;
56 if (viewParent === head) {
62 var viewNode = createViewNode(node.label, totalWeight, selfWeight, head);
66 head = viewNode;
70 var view = this.createView(head);
81 ViewBuilder.prototype.createView = function(head) { argument
82 return new ProfileView(head);
99 funcName, totalTime, selfTime, head) { argument
101 funcName, totalTime, selfTime, head);
112 function ProfileView(head) { argument
[all …]
|
| /external/oprofile/libutil/ |
| D | op_list.h | 64 static __inline__ void list_add(struct list_head * new_entry, struct list_head * head) in list_add() argument
66 __list_add(new_entry, head, head->next); in list_add()
77 static __inline__ void list_add_tail(struct list_head * new_entry, struct list_head * head) in list_add_tail() argument
79 __list_add(new_entry, head->prev, head); in list_add_tail()
120 static __inline__ int list_empty(struct list_head const * head) in list_empty() argument
122 return head->next == head; in list_empty()
130 static __inline__ void list_splice(struct list_head * list, struct list_head * head) in list_splice() argument
136 struct list_head * at = head->next; in list_splice()
138 first->prev = head; in list_splice()
139 head->next = first; in list_splice()
[all …]
|
| /external/e2fsprogs/lib/blkid/ |
| D | list.h | 61 _INLINE_ void list_add(struct list_head *add, struct list_head *head) in list_add() argument
63 __list_add(add, head, head->next); in list_add()
74 _INLINE_ void list_add_tail(struct list_head *add, struct list_head *head) in list_add_tail() argument
76 __list_add(add, head->prev, head); in list_add_tail()
119 _INLINE_ int list_empty(struct list_head *head) in list_empty() argument
121 return head->next == head; in list_empty()
129 _INLINE_ void list_splice(struct list_head *list, struct list_head *head) in list_splice() argument
135 struct list_head *at = head->next; in list_splice()
137 first->prev = head; in list_splice()
138 head->next = first; in list_splice()
[all …]
|
| /external/compiler-rt/lib/interception/ |
| D | interception_win.cc | 89 size_t head = 0; in OverrideFunction() local
90 while (head < 5) { in OverrideFunction()
91 switch (old_bytes[head]) { in OverrideFunction()
95 head++; in OverrideFunction()
98 switch (*(unsigned short*)(old_bytes + head)) { // NOLINT in OverrideFunction()
102 head += 2; in OverrideFunction()
105 head += 3; in OverrideFunction()
108 head += 6; in OverrideFunction()
111 switch (0x00FFFFFF & *(unsigned int*)(old_bytes + head)) { in OverrideFunction()
116 head += 4; in OverrideFunction()
[all …]
|
| /external/e2fsprogs/lib/ext2fs/ |
| D | kernel-list.h | 50 static __inline__ void list_add(struct list_head *new, struct list_head *head) in list_add() argument
52 __list_add(new, head, head->next); in list_add()
58 static __inline__ void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail() argument
60 __list_add(new, head->prev, head); in list_add_tail()
82 static __inline__ int list_empty(struct list_head *head) in list_empty() argument
84 return head->next == head; in list_empty()
90 static __inline__ void list_splice(struct list_head *list, struct list_head *head) in list_splice() argument
96 struct list_head *at = head->next; in list_splice()
98 first->prev = head; in list_splice()
99 head->next = first; in list_splice()
[all …]
|
| /external/yaffs2/yaffs2/ |
| D | devextras.h | 93 static __inline__ void list_add(struct list_head *new, struct list_head *head) in list_add() argument
95 __list_add(new, head, head->next); in list_add()
107 struct list_head *head) in list_add_tail() argument
109 __list_add(new, head->prev, head); in list_add_tail()
151 static __inline__ int list_empty(struct list_head *head) in list_empty() argument
153 return head->next == head; in list_empty()
162 struct list_head *head) in list_splice() argument
168 struct list_head *at = head->next; in list_splice()
170 first->prev = head; in list_splice()
171 head->next = first; in list_splice()
[all …]
|
| /external/checkpolicy/ |
| D | queue.c | 21 q->head = q->tail = NULL; in queue_create()
40 if (q->head == NULL) { in queue_insert()
41 q->head = q->tail = newnode; in queue_insert()
64 if (q->head == NULL) { in queue_push()
65 q->head = q->tail = newnode; in queue_push()
67 newnode->next = q->head; in queue_push()
68 q->head = newnode; in queue_push()
82 if (q->head == NULL) in queue_remove()
85 node = q->head; in queue_remove()
86 q->head = q->head->next; in queue_remove()
[all …]
|
| /external/skia/src/utils/ |
| D | SkSfntUtils.cpp | 33 bool SkSfntUtils::ReadTable_head(SkFontID fontID, SkSfntTable_head* head) { in ReadTable_head() argument
44 head->fVersion = parse_be32(p); in ReadTable_head()
45 head->fRevision = parse_be32(p); in ReadTable_head()
46 head->fCheckSumAdjustment = parse_be32(p); in ReadTable_head()
47 head->fMagicNumber = parse_be32(p); in ReadTable_head()
48 head->fFlags = parse_be16(p); in ReadTable_head()
49 head->fUnitsPerEm = parse_be16(p); in ReadTable_head()
50 head->fDateCreated = parse_be64(p); in ReadTable_head()
51 head->fDateModified = parse_be64(p); in ReadTable_head()
52 head->fXMin = parse_be16(p); in ReadTable_head()
[all …]
|
| /external/mesa3d/src/glsl/ |
| D | list.h | 287 struct exec_node *head; member
318 head = (exec_node *) & tail; in make_empty()
320 tail_pred = (exec_node *) & head; in make_empty()
335 return head == (exec_node *) &tail; in is_empty()
340 return !is_empty() ? head : NULL; in get_head()
345 return !is_empty() ? head : NULL; in get_head()
360 n->next = head; in push_head()
361 n->prev = (exec_node *) &head; in push_head()
364 head = n; in push_head()
380 n->prev->next = head; in push_degenerate_list_at_head()
[all …]
|
| /external/chromium/net/base/ |
| D | address_list.cc | 40 struct addrinfo* head; member
113 void AddressList::Adopt(struct addrinfo* head) { in Adopt() argument
114 data_ = new Data(head, true /*is_system_created*/); in Adopt()
117 void AddressList::Copy(const struct addrinfo* head, bool recursive) { in Copy() argument
118 data_ = new Data(CreateCopyOfAddrinfo(head, recursive), in Copy()
122 void AddressList::Append(const struct addrinfo* head) { in Append() argument
123 DCHECK(head); in Append()
126 new_head = CreateCopyOfAddrinfo(data_->head, true); in Append()
129 new_head = data_->head; in Append()
135 copy_ptr->ai_next = CreateCopyOfAddrinfo(head, true); in Append()
[all …]
|
| /external/ipsec-tools/src/racoon/ |
| D | genlist.c | 50 genlist_insert (struct genlist *head, void *data) in genlist_insert() argument
54 TAILQ_INSERT_HEAD(head, entry, chain); in genlist_insert()
59 genlist_append (struct genlist *head, void *data) in genlist_append() argument
63 TAILQ_INSERT_TAIL(head, entry, chain); in genlist_append()
68 genlist_foreach (struct genlist *head, genlist_func_t func, void *arg) in genlist_foreach() argument
72 TAILQ_FOREACH(p, head, chain) { in genlist_foreach()
82 genlist_next (struct genlist *head, struct genlist_entry **buf) in genlist_next() argument
86 if (head) in genlist_next()
87 p = TAILQ_FIRST(head); in genlist_next()
96 genlist_free (struct genlist *head, genlist_freedata_t func) in genlist_free() argument
[all …]
|