| /external/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/mesa3d/src/glsl/ |
| D | list.h | 80 struct exec_node *prev; member
102 exec_node() : next(NULL), prev(NULL) in exec_node()
119 return prev; in get_prev()
124 return prev; in get_prev()
129 next->prev = prev; in remove()
130 prev->next = next; in remove()
132 prev = NULL; in remove()
143 prev = this; in self_link()
152 after->prev = this; in insert_after()
154 this->next->prev = after; in insert_after()
[all …]
|
| /external/kernel-headers/original/asm-x86/ |
| D | cmpxchg_32.h | 122 unsigned long prev; in __cmpxchg() local
126 : "=a"(prev) in __cmpxchg()
129 return prev; in __cmpxchg()
132 : "=a"(prev) in __cmpxchg()
135 return prev; in __cmpxchg()
138 : "=a"(prev) in __cmpxchg()
141 return prev; in __cmpxchg()
155 unsigned long prev; in __sync_cmpxchg() local
159 : "=a"(prev) in __sync_cmpxchg()
162 return prev; in __sync_cmpxchg()
[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/bluetooth/glib/glib/ |
| D | glist.c | 131 new_list->prev = last; in g_list_append()
137 new_list->prev = NULL; in g_list_append()
175 new_list->prev = list->prev; in g_list_prepend()
176 if (list->prev) in g_list_prepend()
177 list->prev->next = new_list; in g_list_prepend()
178 list->prev = new_list; in g_list_prepend()
181 new_list->prev = NULL; in g_list_prepend()
217 new_list->prev = tmp_list->prev; in g_list_insert()
218 if (tmp_list->prev) in g_list_insert()
219 tmp_list->prev->next = new_list; in g_list_insert()
[all …]
|
| /external/e2fsprogs/lib/ext2fs/ |
| D | kernel-list.h | 15 struct list_head *next, *prev; member
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
38 struct list_head * prev, in __list_add() argument
41 next->prev = new; in __list_add()
43 new->prev = prev; in __list_add()
44 prev->next = new; in __list_add()
60 __list_add(new, head->prev, head); in list_add_tail()
70 static __inline__ void __list_del(struct list_head * prev, in __list_del() argument
73 next->prev = prev; in __list_del()
74 prev->next = next; in __list_del()
[all …]
|
| /external/e2fsprogs/lib/blkid/ |
| D | list.h | 25 struct list_head *next, *prev; member
34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
44 struct list_head * prev, in __list_add() argument
47 next->prev = add; in __list_add()
49 add->prev = prev; in __list_add()
50 prev->next = add; in __list_add()
76 __list_add(add, head->prev, head); in list_add_tail()
86 _INLINE_ void __list_del(struct list_head * prev, in __list_del() argument
89 next->prev = prev; in __list_del()
90 prev->next = next; in __list_del()
[all …]
|
| /external/oprofile/libutil/ |
| D | op_list.h | 25 struct list_head * next, * prev; member
37 ptr->prev = ptr; in list_init()
47 struct list_head * prev, in __list_add() argument
50 next->prev = new_entry; in __list_add()
52 new_entry->prev = prev; in __list_add()
53 prev->next = new_entry; in __list_add()
79 __list_add(new_entry, head->prev, head); in list_add_tail()
89 static __inline__ void __list_del(struct list_head * prev, in __list_del() argument
92 next->prev = prev; in __list_del()
93 prev->next = next; in __list_del()
[all …]
|
| /external/chromium/net/disk_cache/ |
| D | rankings.cc | 242 if (head.Data()->prev != my_head.value() && // Normal path. in Insert()
243 head.Data()->prev != node->address().value()) { // FinishInsert(). in Insert()
248 head.Data()->prev = node->address().value(); in Insert()
255 node->Data()->prev = node->address().value(); in Insert()
303 node->Data()->next, node->Data()->prev, list); in Remove()
307 Addr prev_addr(node->Data()->prev); in Remove()
317 CacheRankingsBlock prev(backend_->File(prev_addr), prev_addr); in Remove() local
318 if (!GetRanking(&next) || !GetRanking(&prev)) in Remove()
321 if (!CheckLinks(node, &prev, &next, &list)) in Remove()
325 prev.Data()->next = next.address().value(); in Remove()
[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/kernel-headers/original/linux/ |
| D | list.h | 22 struct list_head *next, *prev; member
33 list->prev = list; in INIT_LIST_HEAD()
43 struct list_head *prev, in __list_add() argument
46 next->prev = new; in __list_add()
48 new->prev = prev; in __list_add()
49 prev->next = new; in __list_add()
75 __list_add(new, head->prev, head); in list_add_tail()
85 struct list_head * prev, struct list_head * next) in __list_add_rcu() argument
88 new->prev = prev; in __list_add_rcu()
90 next->prev = new; in __list_add_rcu()
[all …]
|
| /external/yaffs2/yaffs2/ |
| D | devextras.h | 57 struct list_head *next, *prev; member
66 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
76 struct list_head *prev, in __list_add() argument
79 next->prev = new; in __list_add()
81 new->prev = prev; in __list_add()
82 prev->next = new; in __list_add()
109 __list_add(new, head->prev, head); in list_add_tail()
119 static __inline__ void __list_del(struct list_head *prev, in __list_del() argument
122 next->prev = prev; in __list_del()
123 prev->next = next; in __list_del()
[all …]
|
| /external/icu4c/i18n/ |
| D | bocsu.c | 123 int32_t c, prev; in u_writeIdenticalLevelRun() local
126 prev=0; in u_writeIdenticalLevelRun()
130 if(prev<0x4e00 || prev>=0xa000) { in u_writeIdenticalLevelRun()
131 prev=(prev&~0x7f)-SLOPE_REACH_NEG_1; in u_writeIdenticalLevelRun()
137 prev=0x9fff-SLOPE_REACH_POS_2; in u_writeIdenticalLevelRun()
141 p=u_writeDiff(c-prev, p); in u_writeIdenticalLevelRun()
142 prev=c; in u_writeIdenticalLevelRun()
167 int32_t c, prev; in u_lengthOfIdenticalLevelRun() local
170 prev=0; in u_lengthOfIdenticalLevelRun()
174 if(prev<0x4e00 || prev>=0xa000) { in u_lengthOfIdenticalLevelRun()
[all …]
|
| /external/mesa3d/src/mesa/main/ |
| D | simple_list.h | 42 struct simple_node *prev; member
52 (elem)->next->prev = (elem)->prev; \
53 (elem)->prev->next = (elem)->next; \
64 (elem)->prev = list; \
66 (list)->next->prev = elem; \
79 (elem)->prev = (list)->prev; \
80 (list)->prev->next = elem; \
81 (list)->prev = elem; \
116 (sentinal)->prev = sentinal; \
135 #define last_elem(list) ((list)->prev)
[all …]
|
| /external/iptables/libiptc/ |
| D | linux_list.h | 54 struct list_head *next, *prev; member
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
73 struct list_head *prev, in __list_add() argument
76 next->prev = new; in __list_add()
78 new->prev = prev; in __list_add()
79 prev->next = new; in __list_add()
105 __list_add(new, head->prev, head); in list_add_tail()
115 struct list_head * prev, struct list_head * next) in __list_add_rcu() argument
118 new->prev = prev; in __list_add_rcu()
120 next->prev = new; in __list_add_rcu()
[all …]
|
| /external/libnl-headers/netlink/ |
| D | list.h | 18 struct nl_list_head * prev; member
24 list->prev = list; in NL_INIT_LIST_HEAD()
28 struct nl_list_head *prev, in __nl_list_add() argument
31 prev->next = obj; in __nl_list_add()
32 obj->prev = prev; in __nl_list_add()
33 next->prev = obj; in __nl_list_add()
40 __nl_list_add(obj, head->prev, head); in nl_list_add_tail()
51 obj->next->prev = obj->prev; in nl_list_del()
52 obj->prev->next = obj->next; in nl_list_del()
71 ((pos)->member.prev == (head))
[all …]
|
| /external/quake/quake/src/WinQuake/ |
| D | r_edge.cpp | 198 edgestoadd->prev = edgelist->prev; in R_InsertNewEdges()
199 edgelist->prev->next = edgestoadd; in R_InsertNewEdges()
200 edgelist->prev = edgestoadd; in R_InsertNewEdges()
219 pedge->next->prev = pedge->prev; in R_RemoveEdges()
220 pedge->prev->next = pedge->next; in R_RemoveEdges()
242 if (pedge->u < pedge->prev->u) in R_StepActiveU()
247 if (pedge->u < pedge->prev->u) in R_StepActiveU()
252 if (pedge->u < pedge->prev->u) in R_StepActiveU()
257 if (pedge->u < pedge->prev->u) in R_StepActiveU()
271 pedge->next->prev = pedge->prev; in R_StepActiveU()
[all …]
|
| D | zone.cpp | 34 struct memblock_s *next, *prev; member
80 zone->blocklist.next = zone->blocklist.prev = block = in Z_ClearZone()
87 block->prev = block->next = &zone->blocklist; in Z_ClearZone()
114 other = block->prev; in Z_Free()
119 other->next->prev = other; in Z_Free()
130 block->next->prev = block; in Z_Free()
172 start = base->prev; in Z_TagMalloc()
193 newm->prev = base; in Z_TagMalloc()
196 newm->next->prev = newm; in Z_TagMalloc()
234 if ( block->next->prev != block) in Z_Print()
[all …]
|
| /external/quake/quake/src/QW/client/ |
| D | r_edge.c | 198 edgestoadd->prev = edgelist->prev; in R_InsertNewEdges()
199 edgelist->prev->next = edgestoadd; in R_InsertNewEdges()
200 edgelist->prev = edgestoadd; in R_InsertNewEdges()
219 pedge->next->prev = pedge->prev; in R_RemoveEdges()
220 pedge->prev->next = pedge->next; in R_RemoveEdges()
242 if (pedge->u < pedge->prev->u) in R_StepActiveU()
247 if (pedge->u < pedge->prev->u) in R_StepActiveU()
252 if (pedge->u < pedge->prev->u) in R_StepActiveU()
257 if (pedge->u < pedge->prev->u) in R_StepActiveU()
271 pedge->next->prev = pedge->prev; in R_StepActiveU()
[all …]
|
| /external/icu4c/common/ |
| D | ucnvbocu.c | 393 int32_t prev, c, diff; in _Bocu1FromUnicodeWithOffsets() local
409 prev=(int32_t)cnv->fromUnicodeStatus; in _Bocu1FromUnicodeWithOffsets()
410 if(prev==0) { in _Bocu1FromUnicodeWithOffsets()
411 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets()
433 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets()
440 diff=c-prev; in _Bocu1FromUnicodeWithOffsets()
442 prev=BOCU1_SIMPLE_PREV(c); in _Bocu1FromUnicodeWithOffsets()
469 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets()
505 diff=c-prev; in _Bocu1FromUnicodeWithOffsets()
506 prev=BOCU1_PREV(c); in _Bocu1FromUnicodeWithOffsets()
[all …]
|
| /external/wpa_supplicant_8/src/utils/ |
| D | list.h | 23 struct dl_list *prev; member
29 list->prev = list; in dl_list_init()
35 item->prev = list; in dl_list_add()
36 list->next->prev = item; in dl_list_add()
42 dl_list_add(list->prev, item); in dl_list_add_tail()
47 item->next->prev = item->prev; in dl_list_del()
48 item->prev->next = item->next; in dl_list_del()
50 item->prev = NULL; in dl_list_del()
80 dl_list_entry((list)->prev, type, member))
94 for (item = dl_list_entry((list)->prev, type, member); \
[all …]
|
| /external/astl/src/ |
| D | ios_base.cpp | 53 fmtflags prev = mFlags; in flags() local
55 return prev; in flags()
59 fmtflags prev = mFlags; in setf() local
61 return prev; in setf()
65 fmtflags prev = mFlags; in setf() local
68 return prev; in setf()
76 const streamsize prev = mPrecision; in precision() local
80 return prev; in precision()
84 const streamsize prev = mWidth; in width() local
88 return prev; in width()
|
| /external/qemu/ |
| D | qemu-error.c | 66 assert(!loc->prev); in loc_push_restore()
67 loc->prev = cur_loc; in loc_push_restore()
81 loc->prev = NULL; in loc_push_none()
91 assert(cur_loc == loc && loc->prev); in loc_pop()
92 cur_loc = loc->prev; in loc_pop()
93 loc->prev = NULL; in loc_pop()
103 loc->prev = NULL; in loc_save()
112 Location *prev = cur_loc->prev; in loc_restore() local
113 assert(!loc->prev); in loc_restore()
115 cur_loc->prev = prev; in loc_restore()
|
| /external/libxml2/ |
| D | list.c | 34 struct _xmlLink *prev; member
61 (lk->prev)->next = lk->next; in xmlLinkDeallocator()
62 (lk->next)->prev = lk->prev; in xmlLinkDeallocator()
124 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
207 l->sentinel->prev = l->sentinel; in xmlListCreate()
288 lkPlace = lkPlace->prev; in xmlListInsert()
290 (lkPlace->next)->prev = lkNew; in xmlListInsert()
292 lkNew->prev = lkPlace; in xmlListInsert()
321 (lkPlace->next)->prev = lkNew; in xmlListAppend()
323 lkNew->prev = lkPlace; in xmlListAppend()
[all …]
|
| /external/srec/seti/sltsEngine/src/ |
| D | linklist_impl.c | 58 n->next = n->prev = 0; in ClearLNodeArray()
73 (g_LNodeAllocArray[i].node).prev = NULL; in AllocNode()
135 (list->head)->prev = NULL; in Insert()
151 newnode->prev = list->curr; in Insert()
163 newnode->prev = NULL; in Insert()
164 (list->head)->prev = newnode; in Insert()
174 newnode->prev = list->curr; in Insert()
177 (newnode->next)->prev = newnode; in Insert()
212 (list->head)->prev = NULL; in Delete()
221 list->tail = curr->prev; in Delete()
[all …]
|