Searched defs:prev (Results 1 - 25 of 316) sorted by relevance

1234567891011>>

/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/dbus/dbus/
H A Ddbus-list.h36 DBusList *prev; /**< Previous list node. */ member in struct:DBusList
94 #define _dbus_list_get_prev_link(list, link) ((link) == *(list) ? NULL : (link)->prev)
/external/astl/src/
H A Dlist.cpp66 ListNodeBase *const prev = mPrev; local
67 prev->mNext = next;
68 next->mPrev = prev;
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/bluetooth/glib/glib/
H A Dglist.h44 GList *prev; member in struct:_GList
110 #define g_list_previous(list) ((list) ? (((GList *)(list))->prev) : NULL)
/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/kernel-headers/original/linux/netfilter/
H A Dxt_limit.h14 unsigned long prev; member in struct:xt_rateinfo
/external/opencore/codecs_v2/video/m4v_h263/dec/src/
H A Dmb_utils.cpp25 void PutSKIPPED_MB(uint8 *comp, uint8 *prev, int width) argument
34 temp0 = (int32 *)prev;
43 prev += width;
45 temp0 = (int32 *)prev;
54 prev += width;
56 temp0 = (int32 *)prev;
65 prev += width;
67 temp0 = (int32 *)prev;
75 prev += width;
86 void PutSKIPPED_B(uint8 *comp, uint8 *prev, in argument
[all...]
H A Dget_pred_outside.cpp113 #define PAD_CORNER { temp = *prev; \
133 #define PAD_ROW { temp = *((uint32*)prev); \
134 temp2 = *((uint32*)(prev+4)); \
152 #define PAD_EXTRA_4x8 { temp = *((uint32*)(prev+8)); \
162 #define PAD_COL { temp = *prev; \
166 temp = *(prev+=16); \
170 temp = *(prev+=16); \
174 temp = *(prev+=16); \
178 temp = *(prev+=16); \
182 temp = *(prev
255 uint8 *prev; /* pointers to adjacent pixels in the */ local
[all...]
/external/webkit/JavaScriptCore/API/tests/
H A DNode.h34 NodeLink* prev; member in struct:__NodeLink
/external/wpa_supplicant_6/wpa_supplicant/
H A Dblacklist.c94 struct wpa_blacklist *e, *prev = NULL; local
99 if (prev == NULL) {
102 prev->next = e->next;
109 prev = e;
122 struct wpa_blacklist *e, *prev; local
127 prev = e;
130 "blacklist (clear)", MAC2STR(prev->bssid));
131 os_free(prev);
/external/iptables/include/linux/netfilter_ipv4/
H A Dipt_limit.h14 u_int64_t prev; member in struct:ipt_rateinfo
18 unsigned long prev; member in struct:ipt_rateinfo
/external/iptables/include/linux/netfilter_ipv6/
H A Dip6t_limit.h14 u_int64_t prev; member in struct:ip6t_rateinfo
18 unsigned long prev; member in struct:ip6t_rateinfo
/external/qemu/hw/
H A Dgoldfish_device.h17 struct goldfish_device *prev; member in struct:goldfish_device
/external/srec/seti/sltsEngine/include/
H A Dlinklist.h26 struct LNode *prev; member in struct:LNode
/external/v8/src/
H A Dfunc-name-inferrer.cc57 Handle<String> prev) {
59 return prev;
62 return MakeNameFromStackHelper(pos + 1, Factory::NewConsString(prev, curr));
56 MakeNameFromStackHelper(int pos, Handle<String> prev) argument
/external/e2fsprogs/lib/ext2fs/
H A Dunlink.c26 struct ext2_dir_entry *prev; member in struct:link_struct
40 struct ext2_dir_entry *prev; local
42 prev = ls->prev;
43 ls->prev = dirent;
60 prev->rec_len += dirent->rec_len;
90 ls.prev = 0;
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/icu4c/i18n/
H A Dbocsu.c112 * code points. Lexical order is preserved if "prev" is always moved
115 * Additionally, "prev" is moved from anywhere in the Unihan
123 int32_t c, prev; local
126 prev=0;
130 if(prev<0x4e00 || prev>=0xa000) {
131 prev=(prev&~0x7f)-SLOPE_REACH_NEG_1;
137 prev=0x9fff-SLOPE_REACH_POS_2;
141 p=u_writeDiff(c-prev,
167 int32_t c, prev; local
[all...]
/external/qemu/elff/
H A Delf_alloc.h52 ElfAllocatorChunk* prev; member in struct:ElfAllocatorChunk
/external/skia/src/effects/
H A DSkLayerDrawLooper.cpp59 Rec* prev = NULL; local
62 rec->fNext = prev;
63 prev = rec;
66 return prev;
/external/webkit/WebCore/platform/
H A DDeprecatedPtrListImpl.h63 void *prev();
115 DeprecatedPtrListImplIterator *prev; member in class:WebCore::DeprecatedPtrListImplIterator
/external/wpa_supplicant/
H A Dasn1_test.c43 const u8 *pos, *prev, *end; local
63 prev = pos;
127 if (asn1_get_oid(prev, end - prev, &oid, &prev) < 0) {
/external/wpa_supplicant_6/wpa_supplicant/src/tls/
H A Dasn1_test.c43 const u8 *pos, *prev, *end; local
63 prev = pos;
127 if (asn1_get_oid(prev, end - prev, &oid, &prev) < 0) {
/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...]

Completed in 128 milliseconds

1234567891011>>