Searched refs:prev (Results 1 - 25 of 452) 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/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...]
H A Dget_pred_adv_b_add.cpp84 uint8 *prev, /* i */
97 offset = width - B_SIZE; /* offset for prev */
100 tmp = (uint32)prev & 0x3;
107 *((uint32*)(pred_block += offset2)) = *((uint32*)prev);
108 *((uint32*)(pred_block += 4)) = *((uint32*)(prev + 4));
109 prev += width;
115 prev--; /* word-aligned */
119 word1 = *((uint32*)prev); /* read 4 bytes, b4 b3 b2 b1 */
120 word2 = *((uint32*)(prev += 4)); /* read 4 bytes, b8 b7 b6 b5 */
125 word1 = *((uint32*)(prev
83 GetPredAdvancedBy0x0( uint8 *prev, uint8 *pred_block, int width, int pred_width_rnd ) argument
183 GetPredAdvancedBy0x1( uint8 *prev, uint8 *pred_block, int width, int pred_width_rnd ) argument
512 GetPredAdvancedBy1x0( uint8 *prev, uint8 *pred_block, int width, int pred_width_rnd ) argument
859 GetPredAdvancedBy1x1( uint8 *prev, uint8 *pred_block, int width, int pred_width_rnd ) argument
[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
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...]
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;
/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/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.h23 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16)
24 #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/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/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/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/bluetooth/glib/glib/
H A Dglist.c131 new_list->prev = last;
137 new_list->prev = NULL;
175 new_list->prev = list->prev;
176 if (list->prev)
177 list->prev->next = new_list;
178 list->prev = new_list;
181 new_list->prev = NULL;
217 new_list->prev = tmp_list->prev;
[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/opencore/oscl/oscl/osclbase/src/
H A Doscl_linked_list.cpp187 OsclAny *prev; local
190 for (tmp = head, prev = NULL; tmp; prev = tmp, tmp = pOpaqueType->get_next(tmp))
196 if (prev)
198 pOpaqueType->set_next(prev, pOpaqueType->get_next(tmp));
199 if (iterator == tmp) iterator = prev;
208 tail = prev;
255 OsclAny *prev; local
264 for (tmp = head, prev = NULL, ii = 0; tmp && ii < index_to_remove;
265 ++ii, prev
304 OsclAny *prev; local
346 OsclAny *prev; local
[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/yaffs2/yaffs2/
H A Ddevextras.h49 * sometimes we already know the next/prev entries and we can
57 struct list_head *next, *prev; member in struct:list_head
66 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
73 * the prev/next entries already!
76 struct list_head *prev,
79 next->prev = new;
81 new->prev = prev;
82 prev->next = new;
109 __list_add(new, head->prev, hea
75 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
119 __list_del(struct list_head *prev, struct list_head *next) argument
[all...]
/external/kernel-headers/original/linux/netfilter/
H A Dxt_limit.h14 unsigned long prev; member in struct:xt_rateinfo
/external/skia/src/views/
H A DSkTagList.cpp42 SkTagList* prev = NULL;
50 if (prev)
51 prev->fNext = next;
57 prev = rec;
/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/srec/seti/sltsEngine/src/
H A Dlinklist_impl.c58 n->next = n->prev = 0;
73 (g_LNodeAllocArray[i].node).prev = NULL;
135 (list->head)->prev = NULL;
151 newnode->prev = list->curr;
163 newnode->prev = NULL;
164 (list->head)->prev = newnode;
174 newnode->prev = list->curr;
177 (newnode->next)->prev = newnode;
212 (list->head)->prev = NULL;
221 list->tail = curr->prev;
[all...]

Completed in 316 milliseconds

1234567891011>>