Home
last modified time | relevance | path

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

12345678910>>...51

/external/selinux/python/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/swiftshader/third_party/LLVM/lib/Target/Alpha/
DAlphaLLRP.cpp51 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/ltp/utils/ffsb-6.0-rc2/
Dlist.c12 list->prev = list; in INIT_LIST_HEAD()
16 struct list_head *prev, struct list_head *next) in __list_add() argument
18 next->prev = new; in __list_add()
20 new->prev = prev; in __list_add()
21 prev->next = new; in __list_add()
24 void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
26 next->prev = prev; in __list_del()
27 prev->next = next; in __list_del()
37 __list_add(new, head->prev, head); in list_add_tail()
42 __list_del(entry->prev, entry->next); in list_del()
[all …]
Dcirlist.c43 cl->head->prev = cl->head; in cl_insert_tail()
48 assert(cl->head->prev == cl->head); in cl_insert_tail()
50 cl->head->prev = new; in cl_insert_tail()
52 new->prev = cl->head; in cl_insert_tail()
55 assert(cl->head->prev != cl->head); in cl_insert_tail()
58 new->prev = (cl->head)->prev; in cl_insert_tail()
59 cl->head->prev->next = new; in cl_insert_tail()
60 cl->head->prev = new; in cl_insert_tail()
78 assert(cl->head->prev == cl->head); in cl_remove_head()
86 newhead->prev = newhead; in cl_remove_head()
[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/syslinux/com32/include/linux/
Dlist.h24 struct list_head *next, *prev; member
35 list->prev = list; in INIT_LIST_HEAD()
45 struct list_head *prev, in __list_add() argument
48 next->prev = new; in __list_add()
50 new->prev = prev; in __list_add()
51 prev->next = new; in __list_add()
79 __list_add(new, head->prev, head); in list_add_tail()
90 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
92 next->prev = prev; in __list_del()
93 prev->next = next; in __list_del()
[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/openssh/
Dmonitor_mm.c219 struct mm_share *mms, *prev, tmp; in mm_free() local
235 prev = mms; in mm_free()
236 if (RB_LEFT(prev, next)) { in mm_free()
237 prev = RB_LEFT(prev, next); in mm_free()
238 while (RB_RIGHT(prev, next)) in mm_free()
239 prev = RB_RIGHT(prev, next); in mm_free()
241 if (RB_PARENT(prev, next) && in mm_free()
242 (prev == RB_RIGHT(RB_PARENT(prev, next), next))) in mm_free()
243 prev = RB_PARENT(prev, next); in mm_free()
245 while (RB_PARENT(prev, next) && in mm_free()
[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/syslinux/gpxe/src/include/gpxe/
Dlist.h29 struct list_head *prev; member
38 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
48 struct list_head *prev, in __list_add() argument
50 next->prev = new; in __list_add()
52 new->prev = prev; in __list_add()
53 prev->next = new; in __list_add()
69 assert ( (head)->next->prev == (head) ); \
70 assert ( (head)->prev->next == (head) ); \
85 __list_add ( new, head->prev, head ); in list_add_tail()
88 assert ( (head)->next->prev == (head) ); \
[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/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/ltp/testcases/realtime/include/
Dlist.h61 struct list_head *next, *prev; member
72 list->prev = list; in INIT_LIST_HEAD()
82 struct list_head *prev, in __list_add() argument
85 next->prev = new; in __list_add()
87 new->prev = prev; in __list_add()
88 prev->next = new; in __list_add()
114 __list_add(new, head->prev, head); in list_add_tail()
124 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
126 next->prev = prev; in __list_del()
127 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/syslinux/core/fs/
Dcache.c20 struct cache *prev, *cur; in cache_init() local
41 head->prev = &cache[dev->cache_entries-1]; in cache_init()
42 head->prev->next = head; in cache_init()
46 prev = head; in cache_init()
52 cur->prev = prev; in cache_init()
53 prev->next = cur; in cache_init()
55 prev = cur++; in cache_init()
67 cs->prev->next = cs->next; in cache_lock_block()
68 cs->next->prev = cs->prev; in cache_lock_block()
70 cs->next = cs->prev = NULL; in cache_lock_block()
[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/kmod/libkmod/
Dlibkmod-list.c33 node->prev = node; in list_node_init()
46 node->prev = list->prev; in list_node_append()
47 list->prev->next = node; in list_node_append()
48 list->prev = node; in list_node_append()
54 if (node->prev == node || node->next == node) in list_node_remove()
57 node->prev->next = node->next; in list_node_remove()
58 node->next->prev = node->prev; in list_node_remove()
71 node->prev = list; in list_node_insert_after()
73 list->next->prev = node; in list_node_insert_after()
86 node->prev = list->prev; in list_node_insert_before()
[all …]
/external/curl/lib/
Dllist.c81 list->head->prev = NULL; in Curl_llist_insert_next()
88 ne->prev = e; in Curl_llist_insert_next()
90 list->head->prev = ne; in Curl_llist_insert_next()
94 e->next->prev = ne; in Curl_llist_insert_next()
124 e->next->prev = NULL; in Curl_llist_remove()
127 e->prev->next = e->next; in Curl_llist_remove()
129 list->tail = e->prev; in Curl_llist_remove()
131 e->next->prev = e->prev; in Curl_llist_remove()
137 e->prev = NULL; in Curl_llist_remove()
180 e->next->prev = NULL; in Curl_llist_move()
[all …]
/external/selinux/python/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/libnetfilter_conntrack/include/internal/
Dlinux_list.h59 struct list_head *next, *prev; member
68 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
78 struct list_head *prev, in __list_add() argument
81 next->prev = new; in __list_add()
83 new->prev = prev; in __list_add()
84 prev->next = new; in __list_add()
110 __list_add(new, head->prev, head); in list_add_tail()
120 struct list_head * prev, struct list_head * next) in __list_add_rcu() argument
123 new->prev = prev; in __list_add_rcu()
125 next->prev = new; in __list_add_rcu()
[all …]

12345678910>>...51