| /third_party/harfbuzz/src/ |
| D | hb-ot-head-table.hh | 44 struct head struct
48 static constexpr hb_tag_t tableTag = HB_OT_TAG_head;
50 unsigned int get_upem () const in get_upem()
57 bool serialize (hb_serialize_context_t *c) const in serialize()
63 bool subset (hb_subset_context_t *c) const in subset()
69 enum mac_style_flag_t {
78 bool is_bold () const { return macStyle & BOLD; } in is_bold()
79 bool is_italic () const { return macStyle & ITALIC; } in is_italic()
80 bool is_condensed () const { return macStyle & CONDENSED; } in is_condensed()
82 bool sanitize (hb_sanitize_context_t *c) const in sanitize()
[all …]
|
| /third_party/flutter/skia/third_party/externals/harfbuzz/src/ |
| D | hb-ot-head-table.hh | 44 struct head struct
48 static constexpr hb_tag_t tableTag = HB_OT_TAG_head;
50 unsigned int get_upem () const in get_upem()
57 enum mac_style_flag_t {
66 bool is_bold () const { return macStyle & BOLD; } in is_bold()
67 bool is_italic () const { return macStyle & ITALIC; } in is_italic()
68 bool is_condensed () const { return macStyle & CONDENSED; } in is_condensed()
70 bool sanitize (hb_sanitize_context_t *c) const in sanitize()
79 FixedVersion<>version; /* Version of the head table--currently
81 FixedVersion<>fontRevision; /* Set by font manufacturer. */
[all …]
|
| /third_party/Linux_Kernel/include/linux/ |
| D | plist.h | 95 #define PLIST_HEAD_INIT(head) \ argument
104 #define PLIST_HEAD(head) \ argument
124 plist_head_init(struct plist_head *head) in plist_head_init()
151 #define plist_for_each(pos, head) \ argument
161 #define plist_for_each_continue(pos, head) \ argument
172 #define plist_for_each_safe(pos, n, head) \ argument
181 #define plist_for_each_entry(pos, head, mem) \ argument
193 #define plist_for_each_entry_continue(pos, head, m) \ argument
205 #define plist_for_each_entry_safe(pos, n, head, m) \ argument
212 static inline int plist_head_empty(const struct plist_head *head) in plist_head_empty()
[all …]
|
| D | btree-128.h | 5 static inline void btree_init_mempool128(struct btree_head128 *head, in btree_init_mempool128()
11 static inline int btree_init128(struct btree_head128 *head) in btree_init128()
16 static inline void btree_destroy128(struct btree_head128 *head) in btree_destroy128()
21 static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2) in btree_lookup128()
27 static inline void *btree_get_prev128(struct btree_head128 *head, in btree_get_prev128()
40 static inline int btree_insert128(struct btree_head128 *head, u64 k1, u64 k2, in btree_insert128()
48 static inline int btree_update128(struct btree_head128 *head, u64 k1, u64 k2, in btree_update128()
56 static inline void *btree_remove128(struct btree_head128 *head, u64 k1, u64 k2) in btree_remove128()
62 static inline void *btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2) in btree_last128()
89 static inline size_t btree_visitor128(struct btree_head128 *head, in btree_visitor128()
[all …]
|
| D | list.h | 61 static inline void list_add(struct list_head *new, struct list_head *head) in list_add()
75 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail()
154 static inline void list_move(struct list_head *list, struct list_head *head) in list_move()
166 struct list_head *head) in list_move_tail()
178 const struct list_head *head) in list_is_last()
187 static inline int list_empty(const struct list_head *head) in list_empty()
205 static inline int list_empty_careful(const struct list_head *head) in list_empty_careful()
215 static inline void list_rotate_left(struct list_head *head) in list_rotate_left()
229 static inline int list_is_singular(const struct list_head *head) in list_is_singular()
235 struct list_head *head, struct list_head *entry) in __list_cut_position()
[all …]
|
| D | circ_buf.h | 10 int head; member
15 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1)) argument
20 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size)) argument
25 #define CIRC_CNT_TO_END(head,tail,size) \ argument
31 #define CIRC_SPACE_TO_END(head,tail,size) \ argument
|
| D | rculist.h | 78 static inline void list_add_rcu(struct list_head *new, struct list_head *head) in list_add_rcu()
100 struct list_head *head) in list_add_tail_rcu()
199 struct list_head *head, in list_splice_init_rcu()
302 #define list_for_each_entry_rcu(pos, head, member) \ argument
316 #define list_for_each_entry_continue_rcu(pos, head, member) \ argument
369 #define hlist_first_rcu(head) (*((struct hlist_node __rcu **)(&(head)->first))) argument
459 #define __hlist_for_each_rcu(pos, head) \ argument
474 #define hlist_for_each_entry_rcu(pos, head, member) \ argument
494 #define hlist_for_each_entry_rcu_notrace(pos, head, member) \ argument
511 #define hlist_for_each_entry_rcu_bh(pos, head, member) \ argument
|
| D | timerqueue.h | 14 struct rb_root head; member
35 struct timerqueue_node *timerqueue_getnext(struct timerqueue_head *head) in timerqueue_getnext()
45 static inline void timerqueue_init_head(struct timerqueue_head *head) in timerqueue_init_head()
|
| /third_party/libcoap/include/coap2/ |
| D | utlist.h | 314 #define LL_PREPEND(head,add) \ argument
317 #define LL_PREPEND2(head,add,next) \ argument
338 #define LL_APPEND(head,add) \ argument
341 #define LL_APPEND2(head,add,next) \ argument
354 #define LL_INSERT_INORDER(head,add,cmp) \ argument
357 #define LL_INSERT_INORDER2(head,add,cmp,next) \ argument
369 #define LL_LOWER_BOUND(head,elt,like,cmp) \ argument
372 #define LL_LOWER_BOUND2(head,elt,like,cmp,next) \ argument
385 #define LL_DELETE(head,del) \ argument
388 #define LL_DELETE2(head,del,next) \ argument
[all …]
|
| D | uthash.h | 123 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \ argument
135 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
178 #define HASH_MAKE_TABLE(hh,head) \ argument
200 #define HASH_REPLACE_BYHASHVALUE_INORDER(hh,head,fieldname,keylen_in,hashval,add,replaced,cmpfcn) \ argument
210 #define HASH_REPLACE_BYHASHVALUE(hh,head,fieldname,keylen_in,hashval,add,replaced) \ argument
220 #define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced) \ argument
227 #define HASH_REPLACE_INORDER(hh,head,fieldname,keylen_in,add,replaced,cmpfcn) \ argument
234 #define HASH_APPEND_LIST(hh, head, add) \ argument
242 #define HASH_AKBI_INNER_LOOP(hh,head,add,cmpfcn) \ argument
253 #define HASH_AKBI_INNER_LOOP(hh,head,add,cmpfcn) \ argument
[all …]
|
| /third_party/ltp/testcases/realtime/include/ |
| D | list.h | 99 static inline void list_add(struct list_head *new, struct list_head *head) in list_add()
112 static inline void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail()
158 static inline void list_move(struct list_head *list, struct list_head *head) in list_move()
170 struct list_head *head) in list_move_tail()
180 static inline int list_empty(const struct list_head *head) in list_empty()
197 static inline int list_empty_careful(const struct list_head *head) in list_empty_careful()
204 struct list_head *head) in __list_splice()
222 static inline void list_splice(struct list_head *list, struct list_head *head) in list_splice()
236 struct list_head *head) in list_splice_init()
271 #define list_for_each(pos, head) \ argument
[all …]
|
| /third_party/FreeBSD/sys/sys/ |
| D | queue.h | 132 #define QMD_TRACE_HEAD(head) do { \ argument
148 #define QMD_TRACE_HEAD(head) argument
189 #define SLIST_HEAD_INITIALIZER(head) \ argument
228 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
230 #define SLIST_FIRST(head) ((head)->slh_first) argument
232 #define SLIST_FOREACH(var, head, field) \ argument
237 #define SLIST_FOREACH_FROM(var, head, field) \ argument
242 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
247 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
252 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
[all …]
|
| /third_party/quickjs/ |
| D | list.h | 42 static inline void init_list_head(struct list_head *head) in init_list_head()
59 static inline void list_add(struct list_head *el, struct list_head *head) in list_add()
65 static inline void list_add_tail(struct list_head *el, struct list_head *head) in list_add_tail()
86 #define list_for_each(el, head) \ argument
89 #define list_for_each_safe(el, el1, head) \ argument
93 #define list_for_each_prev(el, head) \ argument
96 #define list_for_each_prev_safe(el, el1, head) \ argument
|
| /third_party/pulseaudio/src/pulsecore/ |
| D | llist.h | 51 #define PA_LLIST_PREPEND(t,head,item) \ argument
62 #define PA_LLIST_REMOVE(t,head,item) \ argument
78 #define PA_LLIST_FIND_HEAD(t,item,head) \ argument
88 #define PA_LLIST_INSERT_AFTER(t,head,a,b) \ argument
105 #define PA_LLIST_FOREACH(i,head) \ argument
108 #define PA_LLIST_FOREACH_SAFE(i,n,head) \ argument
|
| /third_party/eudev/src/shared/ |
| D | list.h | 34 #define LIST_HEAD_INIT(head) \ argument
48 #define LIST_PREPEND(name,head,item) \ argument
59 #define LIST_REMOVE(name,head,item) \ argument
75 #define LIST_FIND_HEAD(name,item,head) \ argument
101 #define LIST_INSERT_AFTER(name,head,a,b) \ argument
121 #define LIST_FOREACH(name,i,head) \ argument
124 #define LIST_FOREACH_SAFE(name,i,n,head) \ argument
135 #define LIST_LOOP_BUT_ONE(name,i,head,p) \ argument
|
| /third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/ |
| D | list.h | 70 list_empty(const struct list_head *head) in list_empty()
77 list_empty_careful(const struct list_head *head) in list_empty_careful()
160 #define list_for_each(p, head) \ argument
163 #define list_for_each_safe(p, n, head) \ argument
183 #define list_for_each_entry_safe_from(pos, n, head, member) \ argument
208 list_add(struct list_head *new, struct list_head *head) in list_add()
215 list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail()
222 list_move(struct list_head *list, struct list_head *head) in list_move()
230 list_move_tail(struct list_head *entry, struct list_head *head) in list_move_tail()
238 list_bulk_move_tail(struct list_head *head, struct list_head *first, in list_bulk_move_tail()
[all …]
|
| /third_party/libdrm/intel/ |
| D | uthash.h | 119 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \ argument
131 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
172 #define HASH_MAKE_TABLE(hh,head) \ argument
191 #define HASH_REPLACE_BYHASHVALUE_INORDER(hh,head,fieldname,keylen_in,hashval,add,replaced,cmpfcn) \ argument
201 #define HASH_REPLACE_BYHASHVALUE(hh,head,fieldname,keylen_in,hashval,add,replaced) \ argument
211 #define HASH_REPLACE(hh,head,fieldname,keylen_in,add,replaced) \ argument
218 #define HASH_REPLACE_INORDER(hh,head,fieldname,keylen_in,add,replaced,cmpfcn) \ argument
225 #define HASH_APPEND_LIST(hh, head, add) \ argument
233 #define HASH_ADD_KEYPTR_BYHASHVALUE_INORDER(hh,head,keyptr,keylen_in,hashval,add,cmpfcn) \ argument
271 #define HASH_ADD_KEYPTR_INORDER(hh,head,keyptr,keylen_in,add,cmpfcn) \ argument
[all …]
|
| /third_party/e2fsprogs/lib/blkid/ |
| D | list.h | 66 _INLINE_ void list_add(struct list_head *add, struct list_head *head) in list_add()
79 _INLINE_ void list_add_tail(struct list_head *add, struct list_head *head) in list_add_tail()
124 _INLINE_ int list_empty(struct list_head *head) in list_empty()
134 _INLINE_ void list_splice(struct list_head *list, struct list_head *head) in list_splice()
164 #define list_for_each(pos, head) \ argument
174 #define list_for_each_safe(pos, pnext, head) \ argument
|
| /third_party/libxkbcommon/src/ |
| D | util-list.h | 54 #define list_first_entry(head, pos, member) \ argument
57 #define list_last_entry(head, pos, member) \ argument
60 #define list_for_each(pos, head, member) \ argument
65 #define list_for_each_safe(pos, tmp, head, member) \ argument
|
| /third_party/e2fsprogs/lib/ext2fs/ |
| D | kernel-list.h | 47 static __inline__ void list_add(struct list_head *new, struct list_head *head) in list_add()
55 static __inline__ void list_add_tail(struct list_head *new, struct list_head *head) in list_add_tail()
79 static __inline__ int list_empty(struct list_head *head) in list_empty()
87 static __inline__ void list_splice(struct list_head *list, struct list_head *head) in list_splice()
106 #define list_for_each(pos, head) \ argument
|
| /third_party/libuv/include/uv/ |
| D | 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
94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ argument
100 #define SPLAY_LINKLEFT(head, tmp, field) do { \ argument
106 #define SPLAY_LINKRIGHT(head, tmp, field) do { \ argument
112 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ argument
292 #define SPLAY_FOREACH(x, name, head) \ argument
324 #define RB_ROOT(head) (head)->rbh_root argument
325 #define RB_EMPTY(head) (RB_ROOT(head) == NULL) argument
[all …]
|
| /third_party/boost/boost/preprocessor/list/ |
| D | adt.hpp | 24 # define BOOST_PP_LIST_CONS(head, tail) (head, tail) argument
40 # define BOOST_PP_LIST_FIRST_I(head, tail) head argument
52 # define BOOST_PP_LIST_REST_I(head, tail) tail argument
59 # define BOOST_PP_LIST_IS_CONS_(head, tail) 1 argument
|
| /third_party/libinput/src/ |
| D | util-list.h | 53 #define list_first_entry(head, pos, member) \ argument
56 #define list_for_each(pos, head, member) \ argument
61 #define list_for_each_safe(pos, tmp, head, member) \ argument
|
| /third_party/node/deps/cares/src/ |
| D | ares_freeaddrinfo.c | 27 void ares__freeaddrinfo_cnames(struct ares_addrinfo_cname *head) in ares__freeaddrinfo_cnames()
40 void ares__freeaddrinfo_nodes(struct ares_addrinfo_node *head) in ares__freeaddrinfo_nodes()
|
| /third_party/cares/ |
| D | ares_freeaddrinfo.c | 27 void ares__freeaddrinfo_cnames(struct ares_addrinfo_cname *head) in ares__freeaddrinfo_cnames()
40 void ares__freeaddrinfo_nodes(struct ares_addrinfo_node *head) in ares__freeaddrinfo_nodes()
|