/external/mesa3d/src/mesa/drivers/dri/i915/ |
H A D | intel_batchbuffer.c | 327 struct cached_batch_item **prev = &intel->batch.cached_items, *item; local 332 while (*prev) { 335 item = *prev; 339 if (prev != &intel->batch.cached_items) { 340 *prev = item->next; 350 prev = &item->next;
|
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_fs_schedule_instructions.cpp | 218 schedule_node *prev = (schedule_node *)n->prev; local 221 if (prev) { 222 while (!prev->is_head_sentinel()) { 223 add_dep(prev, n, 0); 224 prev = (schedule_node *)prev->prev; 354 exec_node *prev; local 355 for (node = instructions.get_tail(), prev [all...] |
H A D | intel_batchbuffer.c | 327 struct cached_batch_item **prev = &intel->batch.cached_items, *item; local 332 while (*prev) { 335 item = *prev; 339 if (prev != &intel->batch.cached_items) { 340 *prev = item->next; 350 prev = &item->next;
|
/external/mesa3d/src/mesa/drivers/dri/intel/ |
H A D | intel_batchbuffer.c | 327 struct cached_batch_item **prev = &intel->batch.cached_items, *item; local 332 while (*prev) { 335 item = *prev; 339 if (prev != &intel->batch.cached_items) { 340 *prev = item->next; 350 prev = &item->next;
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | InsnList.java | 228 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/opencv/cvaux/src/ |
H A D | cvbgfg_codebook.cpp | 331 CvBGCodeBookElem *e, first, *prev = &first; local 336 for( first.next = e = *cb; e != 0; e = prev->next ) 340 prev->next = e->next; 348 prev = e;
|
H A D | cvcalibfilter.cpp | 462 CvPoint2D32f* prev = points[i]; local 464 points[i] = (CvPoint2D32f*)cvAlloc( newMaxPoints * sizeof(prev[0])); 465 memcpy( points[i], prev, maxPoints * sizeof(prev[0]));
|
H A D | cvcorrespond.cpp | 62 int prev; local 115 prev = first[0]; 123 costTable[n + 1] = costTable[n] + Occlusion * (l_end - prev); 124 prev = l_end; 130 prev = second[0]; 139 costTable[baseIndex + row_size] = costTable[baseIndex] + Occlusion * (l_end - prev); 141 prev = l_end;
|
H A D | cvdpstereo.cpp | 96 uchar val, prevval, prev, curr; local 119 prevval = prev = srcdata2[0]; 123 val = (uchar)((curr + prev)>>1); 124 rData[j-1].max_val = (uchar)CV_IMAX3( val, prevval, prev ); 125 rData[j-1].min_val = (uchar)CV_IMIN3( val, prevval, prev ); 127 prev = curr; 339 prev = edges[y*imgW]; 344 ( !( prev & 4 ) || 349 prev = curr;
|
/external/openfst/src/include/fst/ |
H A D | partition.h | 46 Element() : value(0), next(0), prev(0) {} 47 Element(T v) : value(v), next(0), prev(0) {} 51 Element* prev; member in struct:fst::Partition::Element 111 classes_[class_id]->prev = element; 113 element->prev = 0; 126 if (element->next) element->next->prev = element->prev; 127 if (element->prev) element->prev->next = element->next; 174 split_el->prev [all...] |
/external/openssl/crypto/bn/ |
H A D | bn_ctx.c | 96 struct bignum_pool_item *prev, *next; member in struct:bignum_pool_item 415 item->prev = p->tail; 448 p->current = p->current->prev;
|
/external/pdfium/core/include/thirdparties/freetype/freetype/ |
H A D | fttypes.h | 534 /* prev :: The previous element in the list. NULL if first. */ 542 FT_ListNode prev; member in struct:FT_ListNodeRec_
|
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/include/freetype/ |
H A D | fttypes.h | 534 /* prev :: The previous element in the list. NULL if first. */ 542 FT_ListNode prev; member in struct:FT_ListNodeRec_
|
/external/qemu/android/ |
H A D | cmdline-option.c | 216 ParamList* prev = NULL; local 221 cur->next = prev; 222 prev = cur; 225 *head = prev;
|
/external/qemu/distrib/sdl-1.2.15/src/video/fbcon/ |
H A D | SDL_fbvideo.h | 52 struct vidmem_bucket *prev; member in struct:vidmem_bucket
|
/external/qemu/slirp/ |
H A D | ip_input.c | 55 register struct ipasfrag *prev); 65 ipq.ip_link.next = ipq.ip_link.prev = &ipq.ip_link; 299 fp->frag_link.next = fp->frag_link.prev = &fp->frag_link; 442 ip_enq(register struct ipasfrag *p, register struct ipasfrag *prev) argument 445 DEBUG_ARG("prev = %lx", (long)prev); 446 p->ipf_prev = prev; 447 p->ipf_next = prev->ipf_next; 448 ((struct ipasfrag *)(prev->ipf_next))->ipf_prev = p; 449 prev [all...] |
/external/qemu/slirp-android/ |
H A D | ip_input.c | 55 register struct ipasfrag *prev); 65 ipq.ip_link.next = ipq.ip_link.prev = &ipq.ip_link; 299 fp->frag_link.next = fp->frag_link.prev = &fp->frag_link; 442 ip_enq(register struct ipasfrag *p, register struct ipasfrag *prev) argument 445 DEBUG_ARG("prev = %lx", (long)prev); 446 p->ipf_prev = prev; 447 p->ipf_next = prev->ipf_next; 448 ((struct ipasfrag *)(prev->ipf_next))->ipf_prev = p; 449 prev [all...] |
/external/skia/include/core/ |
H A D | SkTInternalLList.h | 52 T* prev = entry->fPrev; local 55 if (NULL != prev) { 56 prev->fNext = next; 61 next->fPrev = prev; 63 fTail = prev; 127 T* prev = existingEntry->fPrev; local 129 newEntry->fPrev = prev; 130 if (NULL == prev) { 134 prev->fNext = newEntry; 213 T* prev() { function in class:SkTInternalLList::Iter [all...] |
/external/skia/samplecode/ |
H A D | TransitionView.cpp | 31 TransitionView(SkView* prev, SkView* next, int direction) : fInterp(4, 2){ argument 34 fPrev = prev; 80 SkView* prev = fPrev; local 81 prev->ref(); 90 SkASSERT(1 == prev->getRefCnt()); 91 prev->unref(); 197 SkView* create_transition(SkView* prev, SkView* next, int direction) { argument 202 return SkNEW_ARGS(TransitionView, (prev, next, direction));
|
/external/skia/src/core/ |
H A D | SkDeque.cpp | 266 // Like next, prev actually returns the current element pointed to by fPos and 268 void* SkDeque::Iter::prev() { function in class:SkDeque::Iter 272 char* prev = pos - fElemSize; local 273 SkASSERT(prev >= fCurBlock->fBegin - fElemSize); 274 if (prev < fCurBlock->fBegin) { // exhausted this chunk, move to prior 278 prev = fCurBlock ? fCurBlock->fEnd - fElemSize : NULL; 280 fPos = prev;
|
H A D | SkMetaData.cpp | 247 Rec* prev = NULL; local 251 if (prev) { 252 prev->fNext = next; 266 prev = rec;
|
/external/skia/src/gpu/ |
H A D | GrBufferAllocPool.cpp | 288 BufferBlock& prev = fBlocks.fromBack(1); local 289 if (prev.fBuffer->isMapped()) { 290 prev.fBuffer->unmap(); 292 flushCpuData(prev.fBuffer, 293 prev.fBuffer->gpuMemorySize() - prev.fBytesFree);
|
H A D | GrResourceCache.cpp | 414 GrResourceCacheEntry* prev = iter.prev(); local 419 entry = prev; 465 for ( ; NULL != entry; entry = iter.prev()) { 526 for ( ; NULL != entry; entry = iter.prev()) {
|
/external/skia/src/utils/ |
H A D | SkNinePatch.cpp | 82 SkScalar prev = 0; local 86 vx += computeVertexDelta(x & 1, tx, prev, stretchX); 87 prev = tx;
|
/external/skia/src/views/ |
H A D | SkEventSink.cpp | 56 SkEventSink* prev = NULL; local 61 if (prev) { 62 prev->fNextSink = next; 68 prev = sink; 143 SkListenersTagList* prev = (SkListenersTagList*)this->findTagList(kListeners_SkTagList); 146 if (prev) 148 if (prev->find(id) >= 0) 150 count = prev->countListners(); 155 if (prev) 157 memcpy(next->fIDs, prev [all...] |