| /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
| D | InsnList.java | 228 next.prev = insn; in set()
232 AbstractInsnNode prev = location.prev; in set() local
233 insn.prev = prev; in set()
234 if (prev != null) { in set()
235 prev.next = insn; in set()
247 location.prev = null; in set()
269 insn.prev = last; in add()
297 elem.prev = last; in add()
321 first.prev = insn; in insert()
349 first.prev = elem; in insert()
[all …]
|
| /external/qemu/android/utils/ |
| D | list.h | 36 ACList* prev; member
43 list->next = list->prev = list; in alist_init()
59 entry->prev = list; in alist_insert_head()
60 next->prev = entry; in alist_insert_head()
67 ACList* const prev = list->prev; in alist_insert_tail() local
69 entry->prev = prev; in alist_insert_tail()
70 prev->next = entry; in alist_insert_tail()
71 list->prev = entry; in alist_insert_tail()
80 ACList* const prev = entry->prev; in alist_remove() local
81 prev->next = next; in alist_remove()
[all …]
|
| /external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
| D | prclist.h | 47 PRCList *prev; member
56 (_e)->prev = (_l)->prev; \
57 (_l)->prev->next = (_e); \
58 (_l)->prev = (_e); \
67 (_e)->prev = (_l); \
68 (_l)->next->prev = (_e); \
81 ((_e)->prev)
95 #define PR_LIST_TAIL(_l) (_l)->prev
102 (_e)->prev->next = (_e)->next; \
103 (_e)->next->prev = (_e)->prev; \
[all …]
|
| /external/mesa3d/src/glsl/ |
| D | list.h | 76 struct exec_node *prev; member
98 exec_node() : next(NULL), prev(NULL) in exec_node()
115 return prev; in get_prev()
120 return prev; in get_prev()
125 next->prev = prev; in remove()
126 prev->next = next; in remove()
128 prev = NULL; in remove()
139 prev = this; in self_link()
148 after->prev = this; in insert_after()
150 this->next->prev = after; in insert_after()
[all …]
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| D | list.h | 76 struct exec_node *prev; member
98 exec_node() : next(NULL), prev(NULL) in exec_node()
115 return prev; in get_prev()
120 return prev; in get_prev()
125 next->prev = prev; in remove()
126 prev->next = next; in remove()
128 prev = NULL; in remove()
139 prev = this; in self_link()
148 after->prev = this; in insert_after()
150 this->next->prev = after; in insert_after()
[all …]
|
| /external/mesa3d/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 …]
|
| D | u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
50 (elem)->prev = elem; \
61 (elem)->prev = list; \
63 (list)->next->prev = elem; \
76 (elem)->prev = (list)->prev; \
77 (list)->prev->next = elem; \
78 (list)->prev = elem; \
113 (sentinal)->prev = sentinal; \
132 #define last_elem(list) ((list)->prev)
[all …]
|
| /external/chromium_org/third_party/mesa/src/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 …]
|
| D | u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \
48 (elem)->prev->next = (elem)->next; \
50 (elem)->prev = elem; \
61 (elem)->prev = list; \
63 (list)->next->prev = elem; \
76 (elem)->prev = (list)->prev; \
77 (list)->prev->next = elem; \
78 (list)->prev = elem; \
113 (sentinal)->prev = sentinal; \
132 #define last_elem(list) ((list)->prev)
[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/fio/ |
| D | flist.h | 28 struct flist_head *next, *prev; member
37 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
47 struct flist_head *prev, in __flist_add() argument
50 next->prev = new_entry; in __flist_add()
52 new_entry->prev = prev; in __flist_add()
53 prev->next = new_entry; in __flist_add()
73 __flist_add(new_entry, head->prev, head); in flist_add_tail()
83 static inline void __flist_del(struct flist_head *prev, in __flist_del() argument
86 next->prev = prev; in __flist_del()
87 prev->next = next; in __flist_del()
[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/e2fsprogs/lib/blkid/ |
| D | list.h | 25 struct list_head *next, *prev; member
31 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
41 struct list_head * prev, in __list_add() argument
44 next->prev = add; in __list_add()
46 add->prev = prev; in __list_add()
47 prev->next = add; in __list_add()
73 __list_add(add, head->prev, head); in list_add_tail()
83 _INLINE_ void __list_del(struct list_head * prev, in __list_del() argument
86 next->prev = prev; in __list_del()
87 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/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/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/chromium_org/net/disk_cache/blockfile/ |
| D | rankings.cc | 260 if (head.Data()->prev != my_head.value() && // Normal path. in Insert()
261 head.Data()->prev != node->address().value()) { // FinishInsert(). in Insert()
266 head.Data()->prev = node->address().value(); in Insert()
273 node->Data()->prev = node->address().value(); in Insert()
322 node->Data()->next, node->Data()->prev, list); in Remove()
328 Addr prev_addr(node->Data()->prev); in Remove()
339 CacheRankingsBlock prev(backend_->File(prev_addr), prev_addr); in Remove() local
340 if (!GetRanking(&next) || !GetRanking(&prev)) { in Remove()
345 if (!CheckLinks(node, &prev, &next, &list)) in Remove()
349 prev.Data()->next = next.address().value(); in Remove()
[all …]
|
| /external/linux-tools-perf/perf-3.12.0/include/linux/ |
| D | list.h | 27 list->prev = list; in INIT_LIST_HEAD()
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()
48 struct list_head *prev,
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/chromium_org/third_party/mesa/src/src/mesa/main/ |
| D | simple_list.h | 46 struct simple_node *prev; member
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
68 (elem)->prev = list; \
70 (list)->next->prev = elem; \
83 (elem)->prev = (list)->prev; \
84 (list)->prev->next = elem; \
85 (list)->prev = elem; \
120 (sentinal)->prev = sentinal; \
139 #define last_elem(list) ((list)->prev)
[all …]
|
| /external/mesa3d/src/mesa/main/ |
| D | simple_list.h | 46 struct simple_node *prev; member
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
68 (elem)->prev = list; \
70 (list)->next->prev = elem; \
83 (elem)->prev = (list)->prev; \
84 (list)->prev->next = elem; \
85 (list)->prev = elem; \
120 (sentinal)->prev = sentinal; \
139 #define last_elem(list) ((list)->prev)
[all …]
|
| /external/chromium_org/v8/src/base/ |
| D | atomicops_internals_arm64_gcc.h | 28 Atomic32 prev; in NoBarrier_CompareAndSwap() local
39 : [prev]"=&r" (prev), in NoBarrier_CompareAndSwap()
47 return prev; in NoBarrier_CompareAndSwap()
105 Atomic32 prev; in Acquire_CompareAndSwap() local
107 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); in Acquire_CompareAndSwap()
110 return prev; in Acquire_CompareAndSwap()
116 Atomic32 prev; in Release_CompareAndSwap() local
119 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value); in Release_CompareAndSwap()
121 return prev; in Release_CompareAndSwap()
178 Atomic64 prev; in NoBarrier_CompareAndSwap() local
[all …]
|
| /external/f2fs-tools/include/ |
| D | list.h | 14 struct list_head *next, *prev; member
25 list->prev = list; in INIT_LIST_HEAD()
29 struct list_head *prev, in __list_add() argument
32 next->prev = new; in __list_add()
34 new->prev = prev; in __list_add()
35 prev->next = new; in __list_add()
45 __list_add(new, head->prev, head); in list_add_tail()
48 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
50 next->prev = prev; in __list_del()
51 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/mesa3d/src/gallium/drivers/nouveau/ |
| D | nouveau_heap.c | 77 heap->next->prev = r; in nouveau_heap_alloc()
78 r->prev = heap; in nouveau_heap_alloc()
106 new->prev = r->prev; in nouveau_heap_free()
107 if (r->prev) in nouveau_heap_free()
108 r->prev->next = new; in nouveau_heap_free()
116 if (r->prev && !r->prev->in_use) { in nouveau_heap_free()
117 r->prev->next = r->next; in nouveau_heap_free()
119 r->next->prev = r->prev; in nouveau_heap_free()
120 r->prev->size += r->size; in nouveau_heap_free()
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
| D | nouveau_heap.c | 77 heap->next->prev = r; in nouveau_heap_alloc()
78 r->prev = heap; in nouveau_heap_alloc()
106 new->prev = r->prev; in nouveau_heap_free()
107 if (r->prev) in nouveau_heap_free()
108 r->prev->next = new; in nouveau_heap_free()
116 if (r->prev && !r->prev->in_use) { in nouveau_heap_free()
117 r->prev->next = r->next; in nouveau_heap_free()
119 r->next->prev = r->prev; in nouveau_heap_free()
120 r->prev->size += r->size; in nouveau_heap_free()
|