Searched refs:prev (Results 1 - 25 of 1300) sorted by relevance

1234567891011>>

/external/bzip2/
H A 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, "]]>",
[all...]
/external/libunwind/src/mi/
H A Ddyn-cancel.c35 if (di->prev)
36 di->prev->next = di->next;
41 di->next->prev = di->prev;
45 di->next = di->prev = NULL;
/external/libusb-compat/libusb/
H A Dusbi.h29 ent->next->prev = ent; \
32 ent->prev = NULL; \
38 if (ent->prev) \
39 ent->prev->next = ent->next; \
43 ent->next->prev = ent->prev; \
44 ent->prev = NULL; \
/external/c-ares/
H A Dares_llist.c28 head->prev = head;
35 node->prev = NULL;
42 return ((head->next == head) && (head->prev == head));
49 new_node->prev = old_node->prev;
50 old_node->prev->next = new_node;
51 old_node->prev = new_node;
57 node->prev->next = node->next;
58 node->next->prev = node->prev;
[all...]
/external/libdrm/
H A Dlibdrm_lists.h36 struct _drmMMListHead *prev; member in struct:_drmMMListHead
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
[all...]
H A Dutil_double_list.h43 struct list_head *prev; member in struct:list_head
49 item->prev = item;
55 item->prev = list;
57 list->next->prev = item;
64 item->prev = list->prev;
65 list->prev->next = item;
66 list->prev = item;
71 to->prev = from->prev;
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Dkernel-list.h9 * sometimes we already know the next/prev entries and we can
15 struct list_head *next, *prev; member in struct:list_head
21 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
32 * the prev/next entries already!
35 struct list_head * prev,
38 next->prev = new;
40 new->prev = prev;
41 prev->next = new;
57 __list_add(new, head->prev, hea
34 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument
67 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/external/v8/test/mjsunit/
H A Ddeserialize-script-id.js13 scripts.reduce(function(prev, cur) {
14 assertTrue(prev === undefined || prev.id != cur.id);
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/
H A DInsnList.java228 next.prev = insn;
232 AbstractInsnNode prev = location.prev;
233 insn.prev = prev;
234 if (prev != null) {
235 prev.next = insn;
247 location.prev = null;
269 insn.prev = last;
297 elem.prev
567 AbstractInsnNode prev; field in class:InsnList.InsnListIterator
[all...]
/external/selinux/policycoreutils/sepolicy/
H A 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"
[all...]
/external/toybox/lib/
H A Dllist.c60 dlist->next->prev = dlist->prev;
61 dlist->prev->next = *pdlist = dlist->next;
71 new->prev = (*list)->prev;
72 (*list)->prev->next = new;
73 (*list)->prev = new;
74 } else *list = new->next = new->prev = new;
96 end = end->prev;
97 end->next->prev
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A 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
[all...]
H A Du_double_list.h47 struct list_head *prev; member in struct:list_head
53 item->prev = item;
59 item->prev = list;
61 list->next->prev = item;
68 item->prev = list->prev;
69 list->prev->next = item;
70 list->prev = item;
75 to->prev = from->prev;
[all...]
/external/mesa3d/src/mesa/main/
H A Dsimple_list.h46 struct simple_node *prev; member in struct:simple_node
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
[all...]
/external/e2fsprogs/lib/blkid/
H A Dlist.h19 * sometimes we already know the next/prev entries and we can
25 struct list_head *next, *prev; member in struct:list_head
31 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
38 * the prev/next entries already!
41 struct list_head * prev,
44 next->prev = add;
46 add->prev = prev;
47 prev->next = add;
73 __list_add(add, head->prev, hea
40 __list_add(struct list_head * add, struct list_head * prev, struct list_head * next) argument
83 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/
H A Dnext_permutation.pass.cpp39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
H A Dnext_permutation_comp.pass.cpp41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
H A Dprev_permutation.pass.cpp39 int prev[sa]; local
46 std::copy(ia, ia+e, prev);
51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
H A Dprev_permutation_comp.pass.cpp41 int prev[sa]; local
48 std::copy(ia, ia+e, prev);
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
/external/selinux/policycoreutils/setsebool/
H A Dsetsebool-bash-completion.sh30 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]}
33 if [ "$verb" = "" -a "$prev" = "setsebool" -o "$prev" = "-P" ]; then
43 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]}
46 if [ "$verb" = "" -a "$prev" == "getsebool" ]; then
50 if [ "$verb" = "" -a "$prev" != "-a" ]; then
/external/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_heap.c77 heap->next->prev = r;
78 r->prev = heap;
106 new->prev = r->prev;
107 if (r->prev)
108 r->prev->next = new;
116 if (r->prev && !r->prev->in_use) {
117 r->prev->next = r->next;
119 r->next->prev
[all...]
/external/libopus/src/
H A Dopus_multistream.c57 int get_left_channel(const ChannelLayout *layout, int stream_id, int prev) argument
60 i = (prev<0) ? 0 : prev+1;
69 int get_right_channel(const ChannelLayout *layout, int stream_id, int prev) argument
72 i = (prev<0) ? 0 : prev+1;
81 int get_mono_channel(const ChannelLayout *layout, int stream_id, int prev) argument
84 i = (prev<0) ? 0 : prev+1;
/external/skia/src/core/
H A DSkAutoKern.h15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16)
16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
/external/fio/
H A Dflist.h22 * sometimes we already know the next/prev entries and we can
28 struct flist_head *next, *prev; member in struct:flist_head
37 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
44 * the prev/next entries already!
47 struct flist_head *prev,
50 next->prev = new_entry;
52 new_entry->prev = prev;
53 prev->next = new_entry;
73 __flist_add(new_entry, head->prev, hea
46 __flist_add(struct flist_head *new_entry, struct flist_head *prev, struct flist_head *next) argument
83 __flist_del(struct flist_head *prev, struct flist_head * next) argument
122 __flist_splice(const struct flist_head *list, struct flist_head *prev, struct flist_head *next) argument
[all...]
/external/blktrace/btt/
H A Dlist.h35 struct list_head *next, *prev; member in struct:list_head
46 list->prev = list;
53 * the prev/next entries already!
56 struct list_head *prev,
59 next->prev = new;
61 new->prev = prev;
62 prev->next = new;
88 __list_add(new, head->prev, head);
92 * Delete a list entry by making the prev/nex
55 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
98 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]

Completed in 3353 milliseconds

1234567891011>>