Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 25 of 1201) sorted by relevance

12345678910>>...49

/external/qemu/android/utils/
Dlist.h32 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/chromium_org/third_party/npapi/npspy/extern/nspr/
Dprclist.h47 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/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
Du_double_list.h47 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 …]
Du_simple_list.h47 (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/mesa3d/src/gallium/auxiliary/util/
Du_double_list.h47 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 …]
Du_simple_list.h47 (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/glsl/
Dlist.h76 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/glsl/
Dlist.h76 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/kernel-headers/original/asm-x86/
Dcmpxchg_32.h122 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/
Dlist.h35 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/
Dmonitor_mm.c214 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/
Dkernel-list.h15 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/
Dlist.h25 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/
Dop_list.h25 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/
Dformat.pl43 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/linux-tools-perf/util/include/linux/added/
Dlist.h14 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/chromium/net/disk_cache/
Drankings.cc246 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/
Dlist.h22 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/
Ddevextras.h57 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/third_party/icu/source/i18n/
Dbocsu.c123 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/chromium_org/net/disk_cache/
Drankings.cc255 if (head.Data()->prev != my_head.value() && // Normal path. in Insert()
256 head.Data()->prev != node->address().value()) { // FinishInsert(). in Insert()
261 head.Data()->prev = node->address().value(); in Insert()
268 node->Data()->prev = node->address().value(); in Insert()
317 node->Data()->next, node->Data()->prev, list); in Remove()
323 Addr prev_addr(node->Data()->prev); in Remove()
334 CacheRankingsBlock prev(backend_->File(prev_addr), prev_addr); in Remove() local
335 if (!GetRanking(&next) || !GetRanking(&prev)) { in Remove()
340 if (!CheckLinks(node, &prev, &next, &list)) in Remove()
344 prev.Data()->next = next.address().value(); in Remove()
[all …]
/external/chromium_org/third_party/mesa/src/src/mesa/main/
Dsimple_list.h46 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/
Dsimple_list.h46 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/iptables/libiptc/
Dlinux_list.h54 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/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/
Dnouveau_heap.c77 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()

12345678910>>...49