Home
last modified time | relevance | path

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

12345678910>>...88

/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/mesa3d/src/compiler/glsl/
Dlist.h55 struct exec_node *prev; member
60 exec_node() : next(NULL), prev(NULL) in exec_node()
121 n->prev = NULL; in exec_node_init()
139 return n->prev; in exec_node_get_prev_const()
145 return n->prev; in exec_node_get_prev()
151 n->next->prev = n->prev; in exec_node_remove()
152 n->prev->next = n->next; in exec_node_remove()
154 n->prev = NULL; in exec_node_remove()
161 n->prev = n; in exec_node_self_link()
168 after->prev = n; in exec_node_insert_after()
[all …]
/external/openthread/src/core/utils/
Dheap.cpp67 Block * prev = nullptr; in CAlloc() local
77 prev = &BlockSuper(); in CAlloc()
78 curr = &BlockNext(*prev); in CAlloc()
82 prev = curr; in CAlloc()
88 prev->SetNext(curr->GetNext()); in CAlloc()
99 if (prev->GetSize() < newBlockSize) in CAlloc()
101 BlockInsert(*prev, newBlock); in CAlloc()
124 Block *prev = &aPrev; in BlockInsert() local
126 …for (Block *block = &BlockNext(*prev); block->GetSize() < aBlock.GetSize(); block = &BlockNext(*bl… in BlockInsert()
128 prev = block; in BlockInsert()
[all …]
/external/wmediumd/wmediumd/
Dlist.h29 struct list_head *next, *prev; member
47 list->prev = list; in INIT_LIST_HEAD()
51 struct list_head *prev, in __list_add_valid() argument
68 struct list_head *prev, in __list_add() argument
71 if (!__list_add_valid(new_elem, prev, next)) in __list_add()
74 next->prev = new_elem; in __list_add()
76 new_elem->prev = prev; in __list_add()
77 WRITE_ONCE(prev->next, new_elem); in __list_add()
104 __list_add(new_elem, head->prev, head); in list_add_tail()
114 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
[all …]
/external/virglrenderer/src/mesa/util/
Dlist.h54 struct list_head *prev; member
60 item->prev = item; in list_inithead()
66 item->prev = list; in list_add()
68 list->next->prev = item; in list_add()
75 item->prev = list->prev; in list_addtail()
76 list->prev->next = item; in list_addtail()
77 list->prev = item; in list_addtail()
87 to->prev = from->prev; in list_replace()
89 from->next->prev = to; in list_replace()
90 from->prev->next = to; in list_replace()
[all …]
/external/mesa3d/src/util/
Dlist.h54 struct list_head *prev; member
60 item->prev = item; in list_inithead()
66 item->prev = list; in list_add()
68 list->next->prev = item; in list_add()
75 item->prev = list->prev; in list_addtail()
76 list->prev->next = item; in list_addtail()
77 list->prev = item; in list_addtail()
87 to->prev = from->prev; in list_replace()
89 from->next->prev = to; in list_replace()
90 from->prev->next = to; in list_replace()
[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/trace-cmd/tracecmd/
Dtrace-cmd.bash76 local prev=$1
81 case "$prev" in
108 local prev=$1
113 case "$prev" in
125 local prev=$1
130 case "$prev" in
132 cmd_options "$prev" "$cur"
145 local prev=$1
150 case "$prev" in
203 local prev=$1
[all …]
/external/selinux/python/semanage/
Dsemanage-bash-completion.sh75 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]}
91 if [ "$prev" = "-a" -a "$command" = "permissive" ]; then
95 if [ "$prev" = "-d" ] || [ "$prev" = "--disable" ] \
96 || [ "$prev" = "-e" ] || [ "$prev" = "--enable" ] \
97 || [ "$prev" = "-r" ] || [ "$prev" = "--remove" ]; then
102 if [ "$verb" = "" -a "$prev" = "semanage" ]; then
104 elif [ "$verb" = "" -a "$prev" = "-S" -o "$prev" = "--store" ]; then
107 elif [ "$verb" = "" -a "$prev" = "-p" -o "$prev" = "--proto" ]; then
110 elif [ "$verb" = "" -a "$prev" = "-R" -o "$prev" = "-r" -o "$prev" = "--role" ]; then
111 if [ "$command" != "user" -o "$prev" != "-r" ]; then
[all …]
/external/libxkbcommon/src/
Dutil-list.c37 list->prev = list; in list_init()
44 assert((list->next != NULL && list->prev != NULL) || in list_insert()
46 assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) || in list_insert()
49 elm->prev = list; in list_insert()
52 elm->next->prev = elm; in list_insert()
58 assert((list->next != NULL && list->prev != NULL) || in list_append()
60 assert(((elm->next == NULL && elm->prev == NULL) || list_empty(elm)) || in list_append()
64 elm->prev = list->prev; in list_append()
65 list->prev = elm; in list_append()
66 elm->prev->next = elm; in list_append()
[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/blktrace/iowatcher/
Dlist.h49 struct list_head *next, *prev; member
60 list->prev = list; in INIT_LIST_HEAD()
71 struct list_head *prev, in __list_add() argument
74 next->prev = new; in __list_add()
76 new->prev = prev; in __list_add()
77 prev->next = new; in __list_add()
81 struct list_head *prev,
113 __list_add(new, head->prev, head); in list_add_tail()
123 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
125 next->prev = prev; in __list_del()
[all …]
/external/e2fsprogs/lib/ext2fs/
Dkernel-list.h17 struct list_head *next, *prev; member
23 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
37 struct list_head * prev, in __list_add() argument
40 next->prev = new; in __list_add()
42 new->prev = prev; in __list_add()
43 prev->next = new; in __list_add()
59 __list_add(new, head->prev, head); in list_add_tail()
69 static __inline__ void __list_del(struct list_head * prev, in __list_del() argument
72 next->prev = prev; in __list_del()
73 prev->next = next; in __list_del()
[all …]
/external/exfatprogs/include/
Dlist.h33 struct list_head *next, *prev; member
42 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
52 struct list_head *prev, in __list_add() argument
55 next->prev = new; in __list_add()
57 new->prev = prev; in __list_add()
58 prev->next = new; in __list_add()
84 __list_add(new, head->prev, head); in list_add_tail()
95 static inline void __list_del(struct list_head *prev, struct list_head *next) in __list_del() argument
97 next->prev = prev; in __list_del()
98 prev->next = next; in __list_del()
[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/cronet/net/disk_cache/blockfile/
Drankings.cc264 if (head.Data()->prev != my_head.value() && // Normal path. in Insert()
265 head.Data()->prev != node->address().value()) { // FinishInsert(). in Insert()
270 head.Data()->prev = node->address().value(); in Insert()
277 node->Data()->prev = node->address().value(); in Insert()
330 Addr prev_addr(node->Data()->prev); in Remove()
341 CacheRankingsBlock prev(backend_->File(prev_addr), prev_addr); in Remove() local
342 if (!GetRanking(&next) || !GetRanking(&prev)) { in Remove()
347 if (!CheckLinks(node, &prev, &next, &list)) in Remove()
351 prev.Data()->next = next.address().value(); in Remove()
352 next.Data()->prev = prev.address().value(); in Remove()
[all …]
/external/e2fsprogs/lib/blkid/
Dlist.h33 struct list_head *next, *prev; member
39 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
49 struct list_head * prev, in __list_add() argument
52 next->prev = add; in __list_add()
54 add->prev = prev; in __list_add()
55 prev->next = add; in __list_add()
81 __list_add(add, head->prev, head); in list_add_tail()
91 _INLINE_ void __list_del(struct list_head * prev, in __list_del() argument
94 next->prev = prev; in __list_del()
95 prev->next = next; in __list_del()
[all …]
/external/perfetto/src/trace_processor/metrics/sql/chrome/
Devent_latency_scroll_jank_cause.sql87 COALESCE(next.slice_id, prev.slice_id) as slice_id,
88 COALESCE(next.name, prev.name) as name,
89 COALESCE(next.event_latency_id, prev.event_latency_id) as event_latency_id,
90 COALESCE(next.event_latency_track_id, prev.event_latency_track_id) as track_id,
91 COALESCE(next.event_latency_dur, prev.event_latency_dur) as event_latency_dur,
92 COALESCE(next.event_latency_ts, prev.event_latency_ts) as event_latency_ts,
93 COALESCE(next.event_type, prev.event_type) as event_type,
94 COALESCE(next.event_latency_ts, prev.event_latency_ts) as ts,
95 COALESCE(next.event_latency_dur, prev.event_latency_dur) as dur,
96 COALESCE(next.jank, prev.jank) as jank,
[all …]
/external/python/cpython2/Modules/_sqlite/
Dcache.c44 node->prev = NULL; in pysqlite_new_node()
133 if (node->prev && node->count > node->prev->count) { in pysqlite_cache_get()
134 ptr = node->prev; in pysqlite_cache_get()
136 while (ptr->prev && node->count > ptr->prev->count) { in pysqlite_cache_get()
137 ptr = ptr->prev; in pysqlite_cache_get()
141 node->next->prev = node->prev; in pysqlite_cache_get()
143 self->last = node->prev; in pysqlite_cache_get()
145 if (node->prev) { in pysqlite_cache_get()
146 node->prev->next = node->next; in pysqlite_cache_get()
148 if (ptr->prev) { in pysqlite_cache_get()
[all …]
/external/trace-cmd/tracecmd/include/
Dlist.h14 struct list_head *prev; member
20 list->prev = list; in list_head_init()
27 p->prev = head; in list_add()
29 next->prev = p; in list_add()
35 struct list_head *prev = head->prev; in list_add_tail() local
37 p->prev = prev; in list_add_tail()
39 prev->next = p; in list_add_tail()
40 head->prev = p; in list_add_tail()
46 struct list_head *prev = p->prev; in list_del() local
48 next->prev = prev; in list_del()
[all …]
/external/tensorflow/tensorflow/compiler/xla/tests/
Dwhile_test.cc57 auto prev = Parameter(&builder, 0, result_shape, "prev"); in XLA_TEST_F() local
58 Gt(ConstantR0<int32_t>(&builder, 5), prev); in XLA_TEST_F()
66 auto prev = Parameter(&builder, 0, result_shape, "prev"); in XLA_TEST_F() local
68 Add(input, prev); in XLA_TEST_F()
93 auto prev = Parameter(&builder, 0, result_shape, "prev"); in XLA_TEST_F() local
94 Gt(ConstantR0<int64_t>(&builder, 5), prev); in XLA_TEST_F()
102 auto prev = Parameter(&builder, 0, result_shape, "prev"); in XLA_TEST_F() local
104 Add(input, prev); in XLA_TEST_F()
124 auto prev = Parameter(&builder, 0, result_shape, "prev"); in XLA_TEST_F() local
125 Gt(ConstantR0<int32_t>(&builder, 5), prev); in XLA_TEST_F()
[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/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/bpftool/include/linux/
Dlist.h20 list->prev = list; in INIT_LIST_HEAD()
24 struct list_head *prev, in __list_add() argument
27 next->prev = new; in __list_add()
29 new->prev = prev; in __list_add()
30 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, struct list_head * next) in __list_del() argument
69 next->prev = prev; in __list_del()
70 prev->next = next; in __list_del()
81 __list_del(entry->prev, entry->next); in __list_del_entry()
[all …]

12345678910>>...88