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

1234567891011>>

/external/bison/build-aux/
H A DMakefile.am2 EXTRA_DIST = prev-version.txt
/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/qemu/android/utils/
H A Dlist.h32 ACList* prev; member in struct:ACList
39 list->next = list->prev = list;
55 entry->prev = list;
56 next->prev = entry;
63 ACList* const prev = list->prev; local
65 entry->prev = prev;
66 prev->next = entry;
67 list->prev
76 ACList* const prev = entry->prev; local
[all...]
/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/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
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
35 * the prev/next entries already!
38 struct list_head * prev,
41 next->prev = new;
43 new->prev = prev;
44 prev->next = new;
60 __list_add(new, head->prev, hea
37 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument
70 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/external/linux-tools-perf/util/include/linux/
H A Dlist.h26 begin->prev->next = end->next;
27 end->next->prev = begin->prev;
/external/kernel-headers/original/asm-generic/
H A Dmutex-xchg.h95 int prev = atomic_xchg(count, 0); local
97 if (unlikely(prev < 0)) {
100 * state. If while doing so we get back a prev value of 1
109 prev = atomic_xchg(count, prev);
110 if (prev < 0)
111 prev = 0;
115 return prev;
/external/mesa3d/src/mesa/main/
H A Dsimple_list.h42 struct simple_node *prev; member in struct:simple_node
52 (elem)->next->prev = (elem)->prev; \
53 (elem)->prev->next = (elem)->next; \
64 (elem)->prev = list; \
66 (list)->next->prev = elem; \
79 (elem)->prev = (list)->prev; \
80 (list)->prev->next = elem; \
81 (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
34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
41 * the prev/next entries already!
44 struct list_head * prev,
47 next->prev = add;
49 add->prev = prev;
50 prev->next = add;
76 __list_add(add, head->prev, hea
43 __list_add(struct list_head * add, struct list_head * prev, struct list_head * next) argument
86 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/external/oprofile/libutil/
H A Dop_list.h19 * sometimes we already know the next/prev entries and we can
25 struct list_head * next, * prev; member in struct:list_head
37 ptr->prev = ptr;
44 * the prev/next entries already!
47 struct list_head * prev,
50 next->prev = new_entry;
52 new_entry->prev = prev;
53 prev->next = new_entry;
79 __list_add(new_entry, head->prev, hea
46 __list_add(struct list_head * new_entry, struct list_head * prev, struct list_head * next) argument
89 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/external/skia/include/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/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...]
/external/astl/src/
H A Dios_base.cpp53 fmtflags prev = mFlags; local
55 return prev;
59 fmtflags prev = mFlags; local
61 return prev;
65 fmtflags prev = mFlags; local
68 return prev;
76 const streamsize prev = mPrecision; local
80 return prev;
84 const streamsize prev = mWidth; local
88 return prev;
[all...]
/external/libnl-headers/netlink/
H A Dlist.h18 struct nl_list_head * prev; member in struct:nl_list_head
24 list->prev = list;
28 struct nl_list_head *prev,
31 prev->next = obj;
32 obj->prev = prev;
33 next->prev = obj;
40 __nl_list_add(obj, head->prev, head);
51 obj->next->prev = obj->prev;
27 __nl_list_add(struct nl_list_head *obj, struct nl_list_head *prev, struct nl_list_head *next) argument
[all...]
/external/chromium/net/disk_cache/
H A Dmem_rankings.cc29 MemEntryImpl* prev = node->prev(); local
36 tail_ = prev;
38 if (prev)
39 prev->set_next(next);
42 next->set_prev(prev);
64 return node->prev();
/external/webkit/Source/JavaScriptCore/wtf/
H A DSentinelLinkedList.h33 // Node* prev();
85 Node* prev = &m_headSentinel; local
88 node->setPrev(prev);
91 prev->setNext(node);
97 Node* prev = node->prev(); local
100 prev->setNext(next);
101 next->setPrev(prev);
/external/kernel-headers/original/asm-mips/
H A Dsystem.h48 #define __mips_mt_fpaff_switch_to(prev) \
50 struct thread_info *__prev_ti = task_thread_info(prev); \
54 (!(KSTK_STATUS(prev) & ST0_CU1))) { \
56 prev->cpus_allowed = prev->thread.user_cpus_allowed; \
62 #define __mips_mt_fpaff_switch_to(prev) do { (void) (prev); } while (0)
65 #define switch_to(prev, next, last) \
67 __mips_mt_fpaff_switch_to(prev); \
69 __save_dsp(prev); \
[all...]
/external/openssl/crypto/x509v3/
H A Dtabtest.c71 int i, prev = -1, bad = 0; local
78 if((*tmp)->ext_nid < prev) bad = 1;
79 prev = (*tmp)->ext_nid;
/external/qemu/
H A Dqemu-error.c66 assert(!loc->prev);
67 loc->prev = cur_loc;
81 loc->prev = NULL;
91 assert(cur_loc == loc && loc->prev);
92 cur_loc = loc->prev;
93 loc->prev = NULL;
103 loc->prev = NULL;
112 Location *prev = cur_loc->prev; local
113 assert(!loc->prev);
[all...]
/external/wpa_supplicant_8/hostapd/src/utils/
H A Dlist.h17 struct dl_list *prev; member in struct:dl_list
23 list->prev = list;
29 item->prev = list;
30 list->next->prev = item;
36 dl_list_add(list->prev, item);
41 item->next->prev = item->prev;
42 item->prev->next = item->next;
44 item->prev = NULL;
74 dl_list_entry((list)->prev, typ
[all...]
/external/wpa_supplicant_8/src/utils/
H A Dlist.h17 struct dl_list *prev; member in struct:dl_list
23 list->prev = list;
29 item->prev = list;
30 list->next->prev = item;
36 dl_list_add(list->prev, item);
41 item->next->prev = item->prev;
42 item->prev->next = item->next;
44 item->prev = NULL;
74 dl_list_entry((list)->prev, typ
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/utils/
H A Dlist.h17 struct dl_list *prev; member in struct:dl_list
23 list->prev = list;
29 item->prev = list;
30 list->next->prev = item;
36 dl_list_add(list->prev, item);
41 item->next->prev = item->prev;
42 item->prev->next = item->next;
44 item->prev = NULL;
74 dl_list_entry((list)->prev, typ
[all...]
/external/kernel-headers/original/asm-x86/
H A Dcmpxchg_32.h122 unsigned long prev; local
126 : "=a"(prev)
129 return prev;
132 : "=a"(prev)
135 return prev;
138 : "=a"(prev)
141 return prev;
155 unsigned long prev; local
159 : "=a"(prev)
162 return prev;
182 unsigned long prev; local
258 unsigned long long prev; local
272 unsigned long long prev; local
[all...]
/external/mesa3d/src/glsl/
H A Dlist.h29 * contain no data. The head sentinel can be identified by its \c prev
34 * tail sentinel or the tail sentinel's \c prev poiner points to the head
45 * - A \c tail pointer that represents the \c prev pointer of the head
48 * - A \c tail_prev pointer that represents the \c prev pointer of the
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
80 struct exec_node *prev; member in struct:exec_node
102 exec_node() : next(NULL), prev(NULL)
119 return prev;
124 return prev;
129 next->prev
[all...]
/external/openssh/
H A Dmonitor_mm.c214 struct mm_share *mms, *prev, tmp; local
230 prev = mms;
231 if (RB_LEFT(prev, next)) {
232 prev = RB_LEFT(prev, next);
233 while (RB_RIGHT(prev, next))
234 prev = RB_RIGHT(prev, next);
236 if (RB_PARENT(prev, next) &&
237 (prev
[all...]

Completed in 908 milliseconds

1234567891011>>