/external/qemu/android/utils/ |
D | list.h | 32 ACList* prev; member 39 list->next = list->prev = list; in alist_init() 55 entry->prev = list; in alist_insert_head() 56 next->prev = entry; in alist_insert_head() 63 ACList* const prev = list->prev; in alist_insert_tail() local 65 entry->prev = prev; in alist_insert_tail() 66 prev->next = entry; in alist_insert_tail() 67 list->prev = entry; in alist_insert_tail() 76 ACList* const prev = entry->prev; in alist_remove() local 77 prev->next = next; in alist_remove() [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/openssh/ |
D | monitor_mm.c | 214 struct mm_share *mms, *prev, tmp; in mm_free() local 230 prev = mms; in mm_free() 231 if (RB_LEFT(prev, next)) { in mm_free() 232 prev = RB_LEFT(prev, next); in mm_free() 233 while (RB_RIGHT(prev, next)) in mm_free() 234 prev = RB_RIGHT(prev, next); in mm_free() 236 if (RB_PARENT(prev, next) && in mm_free() 237 (prev == RB_RIGHT(RB_PARENT(prev, next), next))) in mm_free() 238 prev = RB_PARENT(prev, next); in mm_free() 240 while (RB_PARENT(prev, next) && in mm_free() [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/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/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/linux-tools-perf/util/include/linux/added/ |
D | list.h | 14 list->prev = list; in INIT_LIST_HEAD() 25 struct list_head *prev, in __list_add() argument 28 next->prev = new; in __list_add() 30 new->prev = prev; in __list_add() 31 prev->next = new; in __list_add() 35 struct list_head *prev, 63 __list_add(new, head->prev, head); in list_add_tail() 73 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument 75 next->prev = prev; in __list_del() 76 prev->next = next; in __list_del() [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/chromium/net/disk_cache/ |
D | rankings.cc | 246 if (head.Data()->prev != my_head.value() && // Normal path. in Insert() 247 head.Data()->prev != node->address().value()) { // FinishInsert(). in Insert() 252 head.Data()->prev = node->address().value(); in Insert() 259 node->Data()->prev = node->address().value(); in Insert() 307 node->Data()->next, node->Data()->prev, list); in Remove() 313 Addr prev_addr(node->Data()->prev); in Remove() 323 CacheRankingsBlock prev(backend_->File(prev_addr), prev_addr); in Remove() local 324 if (!GetRanking(&next) || !GetRanking(&prev)) in Remove() 327 if (!CheckLinks(node, &prev, &next, &list)) in Remove() 331 prev.Data()->next = next.address().value(); in Remove() [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/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/freetype/src/cache/ |
D | ftcmru.c | 37 FTC_MruNode last = first->prev; in FTC_MruNode_Prepend() 58 first->prev = node; in FTC_MruNode_Prepend() 61 node->prev = last; in FTC_MruNode_Prepend() 66 node->prev = node; in FTC_MruNode_Prepend() 83 FTC_MruNode prev, next, last; in FTC_MruNode_Up() local 102 prev = node->prev; in FTC_MruNode_Up() 105 prev->next = next; in FTC_MruNode_Up() 106 next->prev = prev; in FTC_MruNode_Up() 108 last = first->prev; in FTC_MruNode_Up() 111 first->prev = node; in FTC_MruNode_Up() [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 …]
|
/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 …]
|
D | zone.c | 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 new->prev = base; in Z_TagMalloc() 196 new->next->prev = new; in Z_TagMalloc() 234 if ( block->next->prev != block) in Z_Print() [all …]
|
/external/icu4c/common/ |
D | ucnvbocu.cpp | 398 int32_t prev, c, diff; in _Bocu1FromUnicodeWithOffsets() local 414 prev=(int32_t)cnv->fromUnicodeStatus; in _Bocu1FromUnicodeWithOffsets() 415 if(prev==0) { in _Bocu1FromUnicodeWithOffsets() 416 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets() 438 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets() 445 diff=c-prev; in _Bocu1FromUnicodeWithOffsets() 447 prev=BOCU1_SIMPLE_PREV(c); in _Bocu1FromUnicodeWithOffsets() 474 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets() 510 diff=c-prev; in _Bocu1FromUnicodeWithOffsets() 511 prev=BOCU1_PREV(c); in _Bocu1FromUnicodeWithOffsets() [all …]
|
/external/kernel-headers/original/asm-mips/ |
D | system.h | 48 #define __mips_mt_fpaff_switch_to(prev) \ argument 50 struct thread_info *__prev_ti = task_thread_info(prev); \ 54 (!(KSTK_STATUS(prev) & ST0_CU1))) { \ 56 prev->cpus_allowed = prev->thread.user_cpus_allowed; \ 62 #define __mips_mt_fpaff_switch_to(prev) do { (void) (prev); } while (0) argument 65 #define switch_to(prev, next, last) \ argument 67 __mips_mt_fpaff_switch_to(prev); \ 69 __save_dsp(prev); \ 70 (last) = resume(prev, next, task_thread_info(next)); \ 73 #define finish_arch_switch(prev) \ argument
|
/external/wpa_supplicant_8/src/utils/ |
D | list.h | 17 struct dl_list *prev; member 23 list->prev = list; in dl_list_init() 29 item->prev = list; in dl_list_add() 30 list->next->prev = item; in dl_list_add() 36 dl_list_add(list->prev, item); in dl_list_add_tail() 41 item->next->prev = item->prev; in dl_list_del() 42 item->prev->next = item->next; in dl_list_del() 44 item->prev = NULL; in dl_list_del() 74 dl_list_entry((list)->prev, type, member)) 88 for (item = dl_list_entry((list)->prev, type, member); \ [all …]
|
/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 …]
|
/external/libusb-compat/libusb/ |
D | usbi.h | 29 ent->next->prev = ent; \ 32 ent->prev = NULL; \ 38 if (ent->prev) \ 39 ent->prev->next = ent->next; \ 43 ent->next->prev = ent->prev; \ 44 ent->prev = NULL; \
|