Home
last modified time | relevance | path

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

12345678910>>...14

/external/opencore/codecs_v2/video/m4v_h263/dec/src/
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+=16); \
[all …]
Dget_pred_adv_b_add.cpp84 uint8 *prev, /* i */ in GetPredAdvancedBy0x0() argument
100 tmp = (uint32)prev & 0x3; in GetPredAdvancedBy0x0()
107 *((uint32*)(pred_block += offset2)) = *((uint32*)prev); in GetPredAdvancedBy0x0()
108 *((uint32*)(pred_block += 4)) = *((uint32*)(prev + 4)); in GetPredAdvancedBy0x0()
109 prev += width; in GetPredAdvancedBy0x0()
115 prev--; /* word-aligned */ in GetPredAdvancedBy0x0()
119 word1 = *((uint32*)prev); /* read 4 bytes, b4 b3 b2 b1 */ in GetPredAdvancedBy0x0()
120 word2 = *((uint32*)(prev += 4)); /* read 4 bytes, b8 b7 b6 b5 */ in GetPredAdvancedBy0x0()
125 word1 = *((uint32*)(prev += 4)); /* b12 b11 b10 b9 */ in GetPredAdvancedBy0x0()
130 prev += offset; in GetPredAdvancedBy0x0()
[all …]
Dmb_utils.cpp25 void PutSKIPPED_MB(uint8 *comp, uint8 *prev, int width) in PutSKIPPED_MB() argument
34 temp0 = (int32 *)prev; in PutSKIPPED_MB()
43 prev += width; in PutSKIPPED_MB()
45 temp0 = (int32 *)prev; in PutSKIPPED_MB()
54 prev += width; in PutSKIPPED_MB()
56 temp0 = (int32 *)prev; in PutSKIPPED_MB()
65 prev += width; in PutSKIPPED_MB()
67 temp0 = (int32 *)prev; in PutSKIPPED_MB()
75 prev += width; in PutSKIPPED_MB()
86 void PutSKIPPED_B(uint8 *comp, uint8 *prev, int width) in PutSKIPPED_B() argument
[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/opencore/codecs_v2/video/m4v_h263/enc/src/
Dmotion_comp.cpp352 UChar *prev, /* i */ in GetPredAdvBy0x0() argument
367 tmp = (ULong)prev & 0x3; in GetPredAdvBy0x0()
372 prev -= lx; in GetPredAdvBy0x0()
376 *((ULong*)(rec += 16)) = *((ULong*)(prev += lx)); in GetPredAdvBy0x0()
377 *((ULong*)(rec + 4)) = *((ULong*)(prev + 4)); in GetPredAdvBy0x0()
383 prev--; /* word-aligned */ in GetPredAdvBy0x0()
385 prev -= lx; in GetPredAdvBy0x0()
389 word1 = *((ULong*)(prev += lx)); /* read 4 bytes, b4 b3 b2 b1 */ in GetPredAdvBy0x0()
390 word2 = *((ULong*)(prev + 4)); /* read 4 bytes, b8 b7 b6 b5 */ in GetPredAdvBy0x0()
395 word1 = *((ULong*)(prev + 8)); /* b12 b11 b10 b9 */ in GetPredAdvBy0x0()
[all …]
/external/oprofile/libutil/
Dop_list.h25 struct list_head * next, * prev; member
37 ptr->prev = ptr; in list_init()
47 struct list_head * prev, in __list_add() argument
50 next->prev = new_entry; in __list_add()
52 new_entry->prev = prev; in __list_add()
53 prev->next = new_entry; in __list_add()
79 __list_add(new_entry, head->prev, head); in list_add_tail()
89 static __inline__ void __list_del(struct list_head * prev, in __list_del() argument
92 next->prev = prev; in __list_del()
93 prev->next = next; in __list_del()
[all …]
/external/e2fsprogs/lib/blkid/
Dlist.h25 struct list_head *next, *prev; member
34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
44 struct list_head * prev, in __list_add() argument
47 next->prev = add; in __list_add()
49 add->prev = prev; in __list_add()
50 prev->next = add; in __list_add()
76 __list_add(add, head->prev, head); in list_add_tail()
86 _INLINE_ void __list_del(struct list_head * prev, in __list_del() argument
89 next->prev = prev; in __list_del()
90 prev->next = next; in __list_del()
[all …]
/external/e2fsprogs/lib/ext2fs/
Dkernel-list.h15 struct list_head *next, *prev; member
24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
38 struct list_head * prev, in __list_add() argument
41 next->prev = new; in __list_add()
43 new->prev = prev; in __list_add()
44 prev->next = new; in __list_add()
60 __list_add(new, head->prev, head); in list_add_tail()
70 static __inline__ void __list_del(struct list_head * prev, in __list_del() argument
73 next->prev = prev; in __list_del()
74 prev->next = next; in __list_del()
[all …]
/external/opencore/oscl/oscl/osclbase/src/
Doscl_linked_list.cpp187 OsclAny *prev; in remove_element() local
190 for (tmp = head, prev = NULL; tmp; prev = tmp, tmp = pOpaqueType->get_next(tmp)) in remove_element()
196 if (prev) in remove_element()
198 pOpaqueType->set_next(prev, pOpaqueType->get_next(tmp)); in remove_element()
199 if (iterator == tmp) iterator = prev; in remove_element()
208 tail = prev; in remove_element()
255 OsclAny *prev; in remove_element() local
264 for (tmp = head, prev = NULL, ii = 0; tmp && ii < index_to_remove; in remove_element()
265 ++ii, prev = tmp, tmp = pOpaqueType->get_next(tmp)) in remove_element()
274 if (prev) in remove_element()
[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/yaffs2/yaffs2/
Ddevextras.h57 struct list_head *next, *prev; member
66 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
76 struct list_head *prev, in __list_add() argument
79 next->prev = new; in __list_add()
81 new->prev = prev; in __list_add()
82 prev->next = new; in __list_add()
109 __list_add(new, head->prev, head); in list_add_tail()
119 static __inline__ void __list_del(struct list_head *prev, in __list_del() argument
122 next->prev = prev; in __list_del()
123 prev->next = next; in __list_del()
[all …]
/external/icu4c/i18n/
Dbocsu.c123 int32_t c, prev; in u_writeIdenticalLevelRun() local
126 prev=0; in u_writeIdenticalLevelRun()
130 if(prev<0x4e00 || prev>=0xa000) { in u_writeIdenticalLevelRun()
131 prev=(prev&~0x7f)-SLOPE_REACH_NEG_1; in u_writeIdenticalLevelRun()
137 prev=0x9fff-SLOPE_REACH_POS_2; in u_writeIdenticalLevelRun()
141 p=u_writeDiff(c-prev, p); in u_writeIdenticalLevelRun()
142 prev=c; in u_writeIdenticalLevelRun()
167 int32_t c, prev; in u_lengthOfIdenticalLevelRun() local
170 prev=0; in u_lengthOfIdenticalLevelRun()
174 if(prev<0x4e00 || prev>=0xa000) { in u_lengthOfIdenticalLevelRun()
[all …]
/external/iptables/libiptc/
Dlinux_list.h54 struct list_head *next, *prev; member
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
73 struct list_head *prev, in __list_add() argument
76 next->prev = new; in __list_add()
78 new->prev = prev; in __list_add()
79 prev->next = new; in __list_add()
105 __list_add(new, head->prev, head); in list_add_tail()
115 struct list_head * prev, struct list_head * next) in __list_add_rcu() argument
118 new->prev = prev; in __list_add_rcu()
120 next->prev = new; in __list_add_rcu()
[all …]
/external/webkit/WebCore/platform/
DDeprecatedPtrListImpl.cpp38 DeprecatedListNode(void *d) : data(d), next(0), prev(0) { } in DeprecatedListNode()
42 DeprecatedListNode *prev; member in WebCore::DeprecatedListNode
60 copy->prev = last; in copyList()
100 it->prev = 0; in ~DeprecatedPtrListImpl()
152 head->prev = node; in insert()
160 node->prev = tail; in insert()
175 node->prev = prevNode; in insert()
178 node->next->prev = node; in insert()
195 if (node->prev == 0) { in remove()
198 node->prev->next = node->next; in remove()
[all …]
/external/icu4c/common/
Ducnvbocu.c393 int32_t prev, c, diff; in _Bocu1FromUnicodeWithOffsets() local
409 prev=(int32_t)cnv->fromUnicodeStatus; in _Bocu1FromUnicodeWithOffsets()
410 if(prev==0) { in _Bocu1FromUnicodeWithOffsets()
411 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets()
433 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets()
440 diff=c-prev; in _Bocu1FromUnicodeWithOffsets()
442 prev=BOCU1_SIMPLE_PREV(c); in _Bocu1FromUnicodeWithOffsets()
469 prev=BOCU1_ASCII_PREV; in _Bocu1FromUnicodeWithOffsets()
505 diff=c-prev; in _Bocu1FromUnicodeWithOffsets()
506 prev=BOCU1_PREV(c); in _Bocu1FromUnicodeWithOffsets()
[all …]
/external/opencore/baselibs/gen_data_structures/src/
Dlinked_list.h204 LinkedListElement<LLClass> *prev; in remove_element() local
207 for (tmp = head, prev = NULL; tmp; prev = tmp, tmp = tmp->next) in remove_element()
213 if (prev) in remove_element()
215 prev->next = tmp->next; in remove_element()
216 if (iterator == tmp) iterator = prev; in remove_element()
226 tail = prev; in remove_element()
265 LinkedListElement<LLClass> *prev; in remove_element() local
274 for (tmp = head, prev = NULL, ii = 0; tmp && ii < index_to_remove; in remove_element()
275 ++ii, prev = tmp, tmp = tmp->next); in remove_element()
282 if (prev) in remove_element()
[all …]
Dsorted_list.h173 SortedListElement<LLClass> *prev; in add_element() local
176 for (prev = NULL, cur = head, ii = 0; ii < num_elements && cur; in add_element()
177 prev = cur, cur = cur->next, ++ii) in add_element()
182 if (prev) in add_element()
184 prev->next = OSCL_NEW(SortedListElement<LLClass>, (new_element)); in add_element()
185 prev->next->next = cur; in add_element()
190 prev = OSCL_NEW(SortedListElement<LLClass>, (new_element)); in add_element()
191 prev->next = head; in add_element()
192 head = prev; in add_element()
250 SortedListElement<LLClass> *prev; in remove_element() local
[all …]
/external/libxml2/
Dlist.c34 struct _xmlLink *prev; member
61 (lk->prev)->next = lk->next; in xmlLinkDeallocator()
62 (lk->next)->prev = lk->prev; in xmlLinkDeallocator()
124 … for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); in xmlListHigherSearch()
207 l->sentinel->prev = l->sentinel; in xmlListCreate()
288 lkPlace = lkPlace->prev; in xmlListInsert()
290 (lkPlace->next)->prev = lkNew; in xmlListInsert()
292 lkNew->prev = lkPlace; in xmlListInsert()
321 (lkPlace->next)->prev = lkNew; in xmlListAppend()
323 lkNew->prev = lkPlace; in xmlListAppend()
[all …]
/external/icu4c/layout/
DIndicReordering.cpp397 …lable(const IndicClassTable *classTable, const LEUnicode *chars, le_int32 prev, le_int32 charCount) in findSyllable() argument
399 le_int32 cursor = prev; in findSyllable()
429 le_int32 i, prev = 0; in reorder() local
432 while (prev < charCount) { in reorder()
433 le_int32 syllable = findSyllable(classTable, chars, prev, charCount); in reorder()
443 if (markStart != prev && classTable->isVowelModifier(chars[markStart - 1])) { in reorder()
450 …hile (output.noteMatra(classTable, chars[matra], matra, tagArray1, !lastInWord) && matra != prev) { in reorder()
456 switch (classTable->getCharClass(chars[prev]) & CF_CLASS_MASK) { in reorder()
463 for (i = prev; i < syllable; i += 1) { in reorder()
471 output.writeChar(C_DOTTED_CIRCLE, prev, tagArray1); in reorder()
[all …]
/external/srec/seti/sltsEngine/src/
Dlinklist_impl.c58 n->next = n->prev = 0; in ClearLNodeArray()
73 (g_LNodeAllocArray[i].node).prev = NULL; in AllocNode()
135 (list->head)->prev = NULL; in Insert()
151 newnode->prev = list->curr; in Insert()
163 newnode->prev = NULL; in Insert()
164 (list->head)->prev = newnode; in Insert()
174 newnode->prev = list->curr; in Insert()
177 (newnode->next)->prev = newnode; in Insert()
212 (list->head)->prev = NULL; in Delete()
221 list->tail = curr->prev; in Delete()
[all …]
/external/icu4c/test/cintltst/
Dbocu1tst.c225 int32_t prev, count, diff; member
366 int32_t prev; in encodeBocu1() local
373 prev=*pPrev; in encodeBocu1()
374 if(prev==0) { in encodeBocu1()
376 prev=*pPrev=BOCU1_ASCII_PREV; in encodeBocu1()
401 return packDiff(c-prev); in encodeBocu1()
474 pRx->prev=BOCU1_ASCII_PREV; in decodeBocu1TrailByte()
492 c=pRx->prev+c+t; in decodeBocu1TrailByte()
495 pRx->prev=bocu1Prev(c); in decodeBocu1TrailByte()
500 pRx->prev=BOCU1_ASCII_PREV; in decodeBocu1TrailByte()
[all …]
/external/webkit/WebCore/dom/
DContainerNode.cpp101 RefPtr<Node> prev = refChild->previousSibling(); in insertBefore() local
135 Node* prev = next->previousSibling(); in insertBefore() local
136 ASSERT(m_lastChild != prev); in insertBefore()
138 if (prev) { in insertBefore()
140 ASSERT(prev->nextSibling() == next); in insertBefore()
141 prev->setNextSibling(child.get()); in insertBefore()
147 child->setPreviousSibling(prev); in insertBefore()
167 childrenChanged(false, prev.get(), next.get(), childCountDelta); in insertBefore()
194 RefPtr<Node> prev = oldChild->previousSibling(); in replaceChild() local
215 if (prev && (prev == child || prev == child->previousSibling())) in replaceChild()
[all …]
/external/icu4c/tools/genbidi/
Dstore.c296 UChar32 start, limit, prev, jgStart; in generateData() local
313 prev=jgStart=0; in generateData()
329 if(prev==0) { in generateData()
331 prev=jgStart=start; in generateData()
334 while(prev<start) { in generateData()
335 jgArray[prev++ -jgStart]=0; in generateData()
340 while(prev<limit) { in generateData()
341 jgArray[prev++ -jgStart]=(uint8_t)row[1]; in generateData()
347 while((prev-jgStart)&3) { in generateData()
348 jgArray[prev++ -jgStart]=0; in generateData()
[all …]
/external/bison/lib/
Dlbitset.c63 struct lbitset_elt_struct *prev; /* Previous element. */ member
168 lbitset_elt *prev = elt->prev; in lbitset_elt_unlink() local
170 if (prev) in lbitset_elt_unlink()
171 prev->next = next; in lbitset_elt_unlink()
174 next->prev = prev; in lbitset_elt_unlink()
179 LBITSET_TAIL (bset) = prev; in lbitset_elt_unlink()
191 else if (prev) in lbitset_elt_unlink()
193 bset->b.cdata = prev->words; in lbitset_elt_unlink()
194 bset->b.cindex = prev->index; in lbitset_elt_unlink()
217 if (elt->prev) in lbitset_prune()
[all …]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dpartition.h41 Element() : value(0), next(0), prev(0) {} in Element()
42 Element(T v) : value(v), next(0), prev(0) {} in Element()
46 Element* prev; member
106 classes_[class_id]->prev = element; in Add()
108 element->prev = 0; in Add()
121 if (element->next) element->next->prev = element->prev; in Move()
122 if (element->prev) element->prev->next = element->next; in Move()
169 split_el->prev->next = 0; in SplitRefine()
170 split_el->prev = 0; in SplitRefine()
176 split_el->prev->next = 0; in SplitRefine()
[all …]

12345678910>>...14