Home
last modified time | relevance | path

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

12345678910>>...47

/external/selinux/policycoreutils/sepolicy/
Dsepolicy-bash-completion.sh65 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/mockito/cglib-and-asm/src/org/mockito/asm/tree/
DInsnList.java228 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/libdrm/
Dlibdrm_lists.h36 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 …]
Dutil_double_list.h43 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/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/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/fio/
Dflist.h28 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/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/c-ares/
Dares_llist.c28 head->prev = head; in ares__init_list_head()
35 node->prev = NULL; in ares__init_list_node()
42 return ((head->next == head) && (head->prev == head)); in ares__is_list_empty()
49 new_node->prev = old_node->prev; in ares__insert_in_list()
50 old_node->prev->next = new_node; in ares__insert_in_list()
51 old_node->prev = new_node; in ares__insert_in_list()
57 node->prev->next = node->next; in ares__remove_from_list()
58 node->next->prev = node->prev; in ares__remove_from_list()
59 node->prev = NULL; in ares__remove_from_list()
76 old_a.next->prev = head_b; in ares__swap_lists()
[all …]
/external/e2fsprogs/lib/ext2fs/
Dkernel-list.h15 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/
Dlist.h25 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/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/curl/lib/
Dllist.c79 list->head->prev = NULL; in Curl_llist_insert_next()
86 ne->prev = e; in Curl_llist_insert_next()
88 list->head->prev = ne; in Curl_llist_insert_next()
92 e->next->prev = ne; in Curl_llist_insert_next()
122 e->next->prev = NULL; in Curl_llist_remove()
125 e->prev->next = e->next; in Curl_llist_remove()
127 list->tail = e->prev; in Curl_llist_remove()
129 e->next->prev = e->prev; in Curl_llist_remove()
135 e->prev = NULL; in Curl_llist_remove()
178 e->next->prev = NULL; in Curl_llist_move()
[all …]
/external/selinux/policycoreutils/semanage/
Dsemanage-bash-completion.sh72 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]}
88 if [ "$prev" = "-a" -a "$command" = "permissive" ]; then
92 if [ "$verb" = "" -a "$prev" = "semanage" ]; then
94 elif [ "$verb" = "" -a "$prev" = "-S" -o "$prev" = "--store" ]; then
97 elif [ "$verb" = "" -a "$prev" = "-p" -o "$prev" = "--proto" ]; then
100 elif [ "$verb" = "" -a "$prev" = "-R" -o "$prev" = "-r" -o "$prev" = "--role" ]; then
101 if [ "$command" != "user" -o "$prev" != "-r" ]; then
107 elif [ "$verb" = "" -a "$prev" = "-s" -o "$prev" = "--seuser" ]; then
110 elif [ "$verb" = "" -a "$prev" = "-f" -o "$prev" = "--ftype" ]; then
113 elif [ "$verb" = "" -a "$prev" = "-t" -o "$prev" = "--types" ]; then
/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/okhttp/okio/okio/src/main/java/okio/
DSegment.java55 Segment prev; field in Segment
82 prev.next = next; in pop()
83 next.prev = prev; in pop()
85 prev = null; in pop()
94 segment.prev = this; in push()
96 next.prev = segment; in push()
114 prev.push(prefix); in split()
123 if (prev == this) throw new IllegalStateException(); in compact()
124 if (!prev.owner) return; // Cannot compact: prev isn't writable. in compact()
126 int availableByteCount = SIZE - prev.limit + (prev.shared ? 0 : prev.pos); in compact()
[all …]
/external/v8/src/base/
Datomicops_internals_arm64_gcc.h28 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/chromium-trace/catapult/third_party/vinn/third_party/parse5/lib/tree_adapters/
Dhtmlparser2.js68 prev: null, property
96 prev: null, property
106 prev: null, property
116 prev: null, property
163 var prev = parentNode.children[parentNode.children.length - 1]; variable
165 if (prev) {
166 prev.next = newNode;
167 newNode.prev = prev;
176 prev = referenceNode.prev;
178 if (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/f2fs-tools/include/
Dlist.h14 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/icu/icu4c/source/common/
Ducnvbocu.cpp398 int32_t prev, c, diff; in _Bocu1FromUnicodeWithOffsets() local
412 prev=(int32_t)cnv->fromUnicodeStatus; in _Bocu1FromUnicodeWithOffsets()
413 if(prev==0) { in _Bocu1FromUnicodeWithOffsets()
414 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets()
436 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets()
443 diff=c-prev; in _Bocu1FromUnicodeWithOffsets()
445 prev=BOCU1_SIMPLE_PREV(c); in _Bocu1FromUnicodeWithOffsets()
472 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets()
508 diff=c-prev; in _Bocu1FromUnicodeWithOffsets()
509 prev=BOCU1_PREV(c); in _Bocu1FromUnicodeWithOffsets()
[all …]
/external/freetype/src/cache/
Dftcmru.c37 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/libnl/include/netlink/
Dlist.h18 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/mesa3d/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>>...47