| /external/swiftshader/third_party/LLVM/lib/Target/Alpha/ |
| D | AlphaLLRP.cpp | 51 MachineInstr* prev[3] = {0,0,0}; in runOnMachineFunction() local
60 prev[0] = prev[1] = prev[2] = 0; //Slots cleared at fetch boundary in runOnMachineFunction()
71 if (prev[0] && in runOnMachineFunction()
72 prev[0]->getOperand(2).getReg() == MI->getOperand(2).getReg()&& in runOnMachineFunction()
73 prev[0]->getOperand(1).getImm() == MI->getOperand(1).getImm()){ in runOnMachineFunction()
74 prev[0] = prev[1]; in runOnMachineFunction()
75 prev[1] = prev[2]; in runOnMachineFunction()
76 prev[2] = 0; in runOnMachineFunction()
82 } else if (prev[1] in runOnMachineFunction()
83 && prev[1]->getOperand(2).getReg() == in runOnMachineFunction()
[all …]
|
| /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/mesa3d/src/util/ |
| D | list.h | 49 struct list_head *prev; member
55 item->prev = item; in list_inithead()
61 item->prev = list; in list_add()
63 list->next->prev = item; in list_add()
70 item->prev = list->prev; in list_addtail()
71 list->prev->next = item; in list_addtail()
72 list->prev = item; in list_addtail()
82 to->prev = from->prev; in list_replace()
84 from->next->prev = to; in list_replace()
85 from->prev->next = to; in list_replace()
[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()
115 n->prev = NULL; in exec_node_init()
133 return n->prev; in exec_node_get_prev_const()
139 return n->prev; in exec_node_get_prev()
145 n->next->prev = n->prev; in exec_node_remove()
146 n->prev->next = n->next; in exec_node_remove()
148 n->prev = NULL; in exec_node_remove()
155 n->prev = n; in exec_node_self_link()
162 after->prev = n; in exec_node_insert_after()
[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/ltp/utils/ffsb-6.0-rc2/ |
| D | list.c | 12 list->prev = list; in INIT_LIST_HEAD()
16 struct list_head *prev, struct list_head *next) in __list_add() argument
18 next->prev = new; in __list_add()
20 new->prev = prev; in __list_add()
21 prev->next = new; in __list_add()
24 void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
26 next->prev = prev; in __list_del()
27 prev->next = next; in __list_del()
37 __list_add(new, head->prev, head); in list_add_tail()
42 __list_del(entry->prev, entry->next); in list_del()
[all …]
|
| D | cirlist.c | 43 cl->head->prev = cl->head; in cl_insert_tail()
48 assert(cl->head->prev == cl->head); in cl_insert_tail()
50 cl->head->prev = new; in cl_insert_tail()
52 new->prev = cl->head; in cl_insert_tail()
55 assert(cl->head->prev != cl->head); in cl_insert_tail()
58 new->prev = (cl->head)->prev; in cl_insert_tail()
59 cl->head->prev->next = new; in cl_insert_tail()
60 cl->head->prev = new; in cl_insert_tail()
78 assert(cl->head->prev == cl->head); in cl_remove_head()
86 newhead->prev = newhead; in cl_remove_head()
[all …]
|
| /external/adhd/cras/src/common/ |
| D | utlist.h | 147 (add)->prev = (head)->prev; \
148 (head)->prev = (add); \
150 (add)->prev = (add); \
157 (add)->prev = (head)->prev; \
158 (head)->prev->next = (add); \
159 (head)->prev = (add); \
163 (head)->prev = (head); \
175 (add)->prev = (next_node)->prev; \
176 (next_node)->prev->next = (add); \
178 (next_node)->prev = (add); \
[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/u-boot/include/linux/ |
| D | list.h | 23 struct list_head *next, *prev; member
34 list->prev = list; in INIT_LIST_HEAD()
44 struct list_head *prev, in __list_add() argument
47 next->prev = new; in __list_add()
49 new->prev = prev; in __list_add()
50 prev->next = new; in __list_add()
76 __list_add(new, head->prev, head); in list_add_tail()
86 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
88 next->prev = prev; in __list_del()
89 prev->next = next; in __list_del()
[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/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/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/honggfuzz/libhfuzz/ |
| D | instrument.c | 98 register uint8_t prev = ATOMIC_BTS(feedback->bbMapPc, pos); in __cyg_profile_func_enter() local
99 if (!prev) { in __cyg_profile_func_enter()
114 register uint8_t prev = ATOMIC_BTS(feedback->bbMapPc, ret); in __sanitizer_cov_trace_pc() local
115 if (!prev) { in __sanitizer_cov_trace_pc()
126 uint8_t prev = ATOMIC_GET(feedback->bbMapCmp[pos]); in __sanitizer_cov_trace_cmp1() local
127 if (prev < v) { in __sanitizer_cov_trace_cmp1()
129 ATOMIC_POST_ADD(feedback->pidFeedbackCmp[my_thread_no], v - prev); in __sanitizer_cov_trace_cmp1()
136 uint8_t prev = ATOMIC_GET(feedback->bbMapCmp[pos]); in __sanitizer_cov_trace_cmp2() local
137 if (prev < v) { in __sanitizer_cov_trace_cmp2()
139 ATOMIC_POST_ADD(feedback->pidFeedbackCmp[my_thread_no], v - prev); in __sanitizer_cov_trace_cmp2()
[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/python/cpython3/Modules/_sqlite/ |
| D | cache.c | 43 node->prev = NULL; in pysqlite_new_node()
132 if (node->prev && node->count > node->prev->count) { in pysqlite_cache_get()
133 ptr = node->prev; in pysqlite_cache_get()
135 while (ptr->prev && node->count > ptr->prev->count) { in pysqlite_cache_get()
136 ptr = ptr->prev; in pysqlite_cache_get()
140 node->next->prev = node->prev; in pysqlite_cache_get()
142 self->last = node->prev; in pysqlite_cache_get()
144 if (node->prev) { in pysqlite_cache_get()
145 node->prev->next = node->next; in pysqlite_cache_get()
147 if (ptr->prev) { in pysqlite_cache_get()
[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/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/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/curl/lib/ |
| D | llist.c | 64 list->head->prev = NULL; in Curl_llist_insert_next()
71 ne->prev = e; in Curl_llist_insert_next()
73 list->head->prev = ne; in Curl_llist_insert_next()
77 e->next->prev = ne; in Curl_llist_insert_next()
106 e->next->prev = NULL; in Curl_llist_remove()
109 if(!e->prev) in Curl_llist_remove()
112 e->prev->next = e->next; in Curl_llist_remove()
115 list->tail = e->prev; in Curl_llist_remove()
117 e->next->prev = e->prev; in Curl_llist_remove()
123 e->prev = NULL; in Curl_llist_remove()
[all …]
|
| /external/skia/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/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/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/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 …]
|