| /external/llvm-project/clang/test/CodeGenCXX/ |
| D | pr29160.cpp | 18 #define STAMP(thiz, prev) using thiz = Foo< \ argument
19 prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, \
20 prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, \
21 prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev, prev \
|
| /external/selinux/python/sepolicy/ |
| D | sepolicy-bash-completion.sh | 65 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]}
100 if [ "$prev" = "-P" -o "$prev" = "--policy" ]; then
108 if [ "$prev" = "-b" -o "$prev" = "--boolean" ]; then
115 … if [ "$prev" = "-s" -o "$prev" = "--source" -o "$prev" = "-t" -o "$prev" = "--target" ]; then
118 elif [ "$prev" = "-c" -o "$prev" = "--class" ]; then
125 if [ "$prev" = "--name" -o "$prev" = "-n" ]; then
127 elif test "$prev" = "-p" || test "$prev" = "--path" ; then
131 elif test "$prev" = "-w" || test "$prev" = "--writepath" ; then
135 elif [ "$prev" = "--domain" -o "$prev" = "-d" ]; then
138 elif [ "$prev" = "--newtype" ]; then
[all …]
|
| /external/libwebsockets/lib/core/ |
| D | lws_dll.c | 45 d->next->prev = d; in lws_dll_add_head()
47 d->prev = NULL; in lws_dll_add_head()
53 if (!phead->prev) in lws_dll_add_head()
54 phead->prev = d; in lws_dll_add_head()
56 assert(d->prev != d); in lws_dll_add_head()
69 d->prev = phead->prev; in lws_dll_add_tail()
71 if (d->prev) in lws_dll_add_tail()
72 d->prev->next = d; in lws_dll_add_tail()
76 phead->prev = d; in lws_dll_add_tail()
82 assert(d->prev != d); in lws_dll_add_tail()
[all …]
|
| D | lws_dll2.c | 57 d->next->prev = d; in lws_dll2_add_head()
59 d->prev = NULL; in lws_dll2_add_head()
98 d->prev = after->prev; in lws_dll2_add_before()
102 if (after->prev) in lws_dll2_add_before()
103 after->prev->next = d; in lws_dll2_add_before()
109 after->prev = d; in lws_dll2_add_before()
123 d->prev = owner->tail; in lws_dll2_add_tail()
125 if (d->prev) in lws_dll2_add_tail()
126 d->prev->next = d; in lws_dll2_add_tail()
148 d->next->prev = d->prev; in lws_dll2_remove()
[all …]
|
| /external/mesa3d/src/compiler/glsl/ |
| D | list.h | 55 struct exec_node *prev; member
60 exec_node() : next(NULL), prev(NULL) in exec_node()
121 n->prev = NULL; in exec_node_init()
139 return n->prev; in exec_node_get_prev_const()
145 return n->prev; in exec_node_get_prev()
151 n->next->prev = n->prev; in exec_node_remove()
152 n->prev->next = n->next; in exec_node_remove()
154 n->prev = NULL; in exec_node_remove()
161 n->prev = n; in exec_node_self_link()
168 after->prev = n; in exec_node_insert_after()
[all …]
|
| /external/mesa3d/src/util/ |
| D | list.h | 54 struct list_head *prev; member
60 item->prev = item; in list_inithead()
66 item->prev = list; in list_add()
68 list->next->prev = item; in list_add()
75 item->prev = list->prev; in list_addtail()
76 list->prev->next = item; in list_addtail()
77 list->prev = item; in list_addtail()
87 to->prev = from->prev; in list_replace()
89 from->next->prev = to; in list_replace()
90 from->prev->next = to; in list_replace()
[all …]
|
| /external/libdrm/ |
| D | libdrm_lists.h | 36 struct _drmMMListHead *prev; member
42 (__item)->prev = (__item); \
48 (__item)->prev = (__list); \
50 (__list)->next->prev = (__item); \
57 (__item)->prev = (__list)->prev; \
58 (__list)->prev->next = (__item); \
59 (__list)->prev = (__item); \
64 (__item)->prev->next = (__item)->next; \
65 (__item)->next->prev = (__item)->prev; \
70 (__item)->prev->next = (__item)->next; \
[all …]
|
| D | util_double_list.h | 43 struct list_head *prev; member
49 item->prev = item; in list_inithead()
55 item->prev = list; in list_add()
57 list->next->prev = item; in list_add()
64 item->prev = list->prev; in list_addtail()
65 list->prev->next = item; in list_addtail()
66 list->prev = item; in list_addtail()
71 to->prev = from->prev; in list_replace()
73 from->next->prev = to; in list_replace()
74 from->prev->next = to; in list_replace()
[all …]
|
| /external/adhd/cras/src/common/ |
| D | utlist.h | 146 (add)->prev = (head)->prev; \
147 (head)->prev = (add); \
149 (add)->prev = (add); \
156 (add)->prev = (head)->prev; \
157 (head)->prev->next = (add); \
158 (head)->prev = (add); \
162 (head)->prev = (head); \
174 (add)->prev = (next_node)->prev; \
175 (next_node)->prev->next = (add); \
177 (next_node)->prev = (add); \
[all …]
|
| /external/libxkbcommon/src/ |
| D | util-list.c | 37 list->prev = list; in list_init()
44 assert((list->next != NULL && list->prev != NULL) || in list_insert()
46 assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) || in list_insert()
49 elm->prev = list; in list_insert()
52 elm->next->prev = elm; in list_insert()
58 assert((list->next != NULL && list->prev != NULL) || in list_append()
60 assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) || in list_append()
64 elm->prev = list->prev; in list_append()
65 list->prev = elm; in list_append()
66 elm->prev->next = elm; in list_append()
[all …]
|
| /external/virglrenderer/src/gallium/auxiliary/util/ |
| D | u_double_list.h | 47 struct list_head *prev; member
53 item->prev = item; in list_inithead()
59 item->prev = list; in list_add()
61 list->next->prev = item; in list_add()
68 item->prev = list->prev; in list_addtail()
69 list->prev->next = item; in list_addtail()
70 list->prev = item; in list_addtail()
75 to->prev = from->prev; in list_replace()
77 from->next->prev = to; in list_replace()
78 from->prev->next = to; in list_replace()
[all …]
|
| /external/blktrace/btt/ |
| D | list.h | 35 struct list_head *next, *prev; member
46 list->prev = list; in INIT_LIST_HEAD()
56 struct list_head *prev, in __list_add() argument
59 next->prev = new; in __list_add()
61 new->prev = prev; in __list_add()
62 prev->next = new; in __list_add()
88 __list_add(new, head->prev, head); in list_add_tail()
98 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
100 next->prev = prev; in __list_del()
101 prev->next = next; in __list_del()
[all …]
|
| /external/rust/crates/parking_lot/src/ |
| D | elision.rs | 59 let prev: usize; in elision_compare_exchange_acquire() localVariable
61 : "={eax}" (prev), "+*m" (self) in elision_compare_exchange_acquire()
65 if prev == current { in elision_compare_exchange_acquire()
66 Ok(prev) in elision_compare_exchange_acquire()
68 Err(prev) in elision_compare_exchange_acquire()
76 let prev: usize; in elision_compare_exchange_acquire() localVariable
78 : "={rax}" (prev), "+*m" (self) in elision_compare_exchange_acquire()
82 if prev == current { in elision_compare_exchange_acquire()
83 Ok(prev) in elision_compare_exchange_acquire()
85 Err(prev) in elision_compare_exchange_acquire()
[all …]
|
| /external/e2fsprogs/lib/ext2fs/ |
| D | kernel-list.h | 15 struct list_head *next, *prev; member
21 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 struct list_head * prev, in __list_add() argument
38 next->prev = new; in __list_add()
40 new->prev = prev; in __list_add()
41 prev->next = new; in __list_add()
57 __list_add(new, head->prev, head); in list_add_tail()
67 static __inline__ void __list_del(struct list_head * prev, in __list_del() argument
70 next->prev = prev; in __list_del()
71 prev->next = next; in __list_del()
[all …]
|
| /external/blktrace/iowatcher/ |
| D | list.h | 49 struct list_head *next, *prev; member
60 list->prev = list; in INIT_LIST_HEAD()
71 struct list_head *prev, in __list_add() argument
74 next->prev = new; in __list_add()
76 new->prev = prev; in __list_add()
77 prev->next = new; in __list_add()
81 struct list_head *prev,
113 __list_add(new, head->prev, head); in list_add_tail()
123 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
125 next->prev = prev; in __list_del()
[all …]
|
| /external/e2fsprogs/lib/blkid/ |
| D | list.h | 33 struct list_head *next, *prev; member
39 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
49 struct list_head * prev, in __list_add() argument
52 next->prev = add; in __list_add()
54 add->prev = prev; in __list_add()
55 prev->next = add; in __list_add()
81 __list_add(add, head->prev, head); in list_add_tail()
91 _INLINE_ void __list_del(struct list_head * prev, in __list_del() argument
94 next->prev = prev; in __list_del()
95 prev->next = next; in __list_del()
[all …]
|
| /external/ltp/testcases/realtime/include/ |
| D | list.h | 61 struct list_head *next, *prev; member
72 list->prev = list; in INIT_LIST_HEAD()
82 struct list_head *prev, in __list_add() argument
85 next->prev = new; in __list_add()
87 new->prev = prev; in __list_add()
88 prev->next = new; in __list_add()
114 __list_add(new, head->prev, head); in list_add_tail()
124 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
126 next->prev = prev; in __list_del()
127 prev->next = next; in __list_del()
[all …]
|
| /external/python/cpython3/Modules/_sqlite/ |
| D | cache.c | 43 node->prev = NULL; in pysqlite_new_node()
131 if (node->prev && node->count > node->prev->count) { in pysqlite_cache_get()
132 ptr = node->prev; in pysqlite_cache_get()
134 while (ptr->prev && node->count > ptr->prev->count) { in pysqlite_cache_get()
135 ptr = ptr->prev; in pysqlite_cache_get()
139 node->next->prev = node->prev; in pysqlite_cache_get()
141 self->last = node->prev; in pysqlite_cache_get()
143 if (node->prev) { in pysqlite_cache_get()
144 node->prev->next = node->next; in pysqlite_cache_get()
146 if (ptr->prev) { in pysqlite_cache_get()
[all …]
|
| /external/bzip2/ |
| D | format.pl | 43 my ($prev, $curr, $str);
44 $prev = ''; $curr = '';
47 print OUTFILE $prev;
48 $prev = $curr;
52 if ( $prev =~ /<programlisting>$|<screen>$/ ) {
53 chomp $prev;
54 $curr = join( '', $prev, "<![CDATA[", $curr );
55 $prev = '';
59 chomp $prev;
60 $curr = join( '', $prev, "]]>", $curr );
[all …]
|
| /external/python/cpython2/Modules/_sqlite/ |
| D | cache.c | 44 node->prev = NULL; in pysqlite_new_node()
133 if (node->prev && node->count > node->prev->count) { in pysqlite_cache_get()
134 ptr = node->prev; in pysqlite_cache_get()
136 while (ptr->prev && node->count > ptr->prev->count) { in pysqlite_cache_get()
137 ptr = ptr->prev; in pysqlite_cache_get()
141 node->next->prev = node->prev; in pysqlite_cache_get()
143 self->last = node->prev; in pysqlite_cache_get()
145 if (node->prev) { in pysqlite_cache_get()
146 node->prev->next = node->next; in pysqlite_cache_get()
148 if (ptr->prev) { in pysqlite_cache_get()
[all …]
|
| /external/kmod/libkmod/ |
| D | libkmod-list.c | 33 node->prev = node; in list_node_init()
46 node->prev = list->prev; in list_node_append()
47 list->prev->next = node; in list_node_append()
48 list->prev = node; in list_node_append()
54 if (node->prev == node || node->next == node) in list_node_remove()
57 node->prev->next = node->next; in list_node_remove()
58 node->next->prev = node->prev; in list_node_remove()
71 node->prev = list; in list_node_insert_after()
73 list->next->prev = node; in list_node_insert_after()
86 node->prev = list->prev; in list_node_insert_before()
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/tests/ |
| D | while_test.cc | 58 auto prev = Parameter(&builder, 0, result_shape, "prev"); in XLA_TEST_F() local
59 Gt(ConstantR0<int32>(&builder, 5), prev); in XLA_TEST_F()
67 auto prev = Parameter(&builder, 0, result_shape, "prev"); in XLA_TEST_F() local
69 Add(input, prev); in XLA_TEST_F()
94 auto prev = Parameter(&builder, 0, result_shape, "prev"); in XLA_TEST_F() local
95 Gt(ConstantR0<int64>(&builder, 5), prev); in XLA_TEST_F()
103 auto prev = Parameter(&builder, 0, result_shape, "prev"); in XLA_TEST_F() local
105 Add(input, prev); in XLA_TEST_F()
125 auto prev = Parameter(&builder, 0, result_shape, "prev"); in XLA_TEST_F() local
126 Gt(ConstantR0<int32>(&builder, 5), prev); in XLA_TEST_F()
[all …]
|
| /external/selinux/python/semanage/ |
| D | semanage-bash-completion.sh | 72 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]}
88 if [ "$prev" = "-a" -a "$command" = "permissive" ]; then
92 if [ "$verb" = "" -a "$prev" = "semanage" ]; then
94 elif [ "$verb" = "" -a "$prev" = "-S" -o "$prev" = "--store" ]; then
97 elif [ "$verb" = "" -a "$prev" = "-p" -o "$prev" = "--proto" ]; then
100 elif [ "$verb" = "" -a "$prev" = "-R" -o "$prev" = "-r" -o "$prev" = "--role" ]; then
101 if [ "$command" != "user" -o "$prev" != "-r" ]; then
107 elif [ "$verb" = "" -a "$prev" = "-s" -o "$prev" = "--seuser" ]; then
110 elif [ "$verb" = "" -a "$prev" = "-f" -o "$prev" = "--ftype" ]; then
113 elif [ "$verb" = "" -a "$prev" = "-t" -o "$prev" = "--types" ]; then
|
| /external/skqp/src/compute/skc/platforms/cl_12/kernels/ |
| D | segment_ttrk.cl | 83 #define SKC_YX(row,prev) \
84 (as_uint2(r##row).hi ^ as_uint2(r##prev).hi)
86 #define SKC_IS_PK(row,prev) \
87 ((uint)(SKC_YX(row,prev) - 1) < SKC_TTRK_HI_MASK_X)
131 #define HS_SLAB_ROW(row,prev) \
132 HS_KEY_TYPE const r##row = (vout + gmem_idx)[prev * HS_SLAB_WIDTH];
164 #define HS_SLAB_ROW(row,prev) \
180 #define HS_SLAB_ROW(row,prev) \
207 #define HS_SLAB_ROW(row,prev) \
208 diffs |= ((c##row != c##prev) << prev);
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/cares/cares/ |
| D | ares_llist.c | 28 head->prev = head; in ares__init_list_head()
35 node->prev = NULL; in ares__init_list_node()
42 return ((head->next == head) && (head->prev == head)); in ares__is_list_empty()
49 new_node->prev = old_node->prev; in ares__insert_in_list()
50 old_node->prev->next = new_node; in ares__insert_in_list()
51 old_node->prev = new_node; in ares__insert_in_list()
57 node->prev->next = node->next; in ares__remove_from_list()
58 node->next->prev = node->prev; in ares__remove_from_list()
59 node->prev = NULL; in ares__remove_from_list()
|