HomeSort by relevance Sort by last modified time
    Searched full:prev (Results 1551 - 1575 of 3406) sorted by null

<<61626364656667686970>>

  /external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/
ClassPath.java 97 ClassDef prev = availableClasses.get(classDef.getType()); local
98 if (prev == null) {
  /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/
mb_motion_comp.cpp 129 Vop *prev = video->prevVop; local
238 c_prev = prev->yChan;
448 cu_prev = prev->uChan;
451 cv_prev = prev->vChan;
552 Vop *prev = video->prevVop; local
577 c_prev = prev->yChan + offset;
579 cu_prev = prev->uChan + (offset >> 2) + (xpos >> 2);
581 cv_prev = prev->vChan + (offset >> 2) + (xpos >> 2);
  /libcore/luni/src/main/java/java/util/
HashMap.java 619 for (HashMapEntry<K, V> e = tab[index], prev = null;
620 e != null; prev = e, e = e.next) {
622 if (prev == null) {
625 prev.next = e.next;
867 for (HashMapEntry<K, V> e = tab[index], prev = null;
868 e != null; prev = e, e = e.next) {
873 if (prev == null) {
876 prev.next = e.next;
    [all...]
Hashtable.java 556 for (HashtableEntry<K, V> e = tab[index], prev = null;
557 e != null; prev = e, e = e.next) {
559 if (prev == null) {
562 prev.next = e.next;
816 for (HashtableEntry<K, V> e = tab[index], prev = null;
817 e != null; prev = e, e = e.next) {
822 if (prev == null) {
825 prev.next = e.next;
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/share/info/
gmp.info-2 25 File: gmp.info, Node: Subquadratic GCD, Next: Extended GCD, Prev: Lehmer's Algorithm, Up: Greatest Common Divisor Algorithms
77 File: gmp.info, Node: Extended GCD, Next: Jacobi Symbol, Prev: Subquadratic GCD, Up: Greatest Common Divisor Algorithms
102 File: gmp.info, Node: Jacobi Symbol, Prev: Extended GCD, Up: Greatest Common Divisor Algorithms
123 File: gmp.info, Node: Powering Algorithms, Next: Root Extraction Algorithms, Prev: Greatest Common Divisor Algorithms, Up: Algorithms
134 File: gmp.info, Node: Normal Powering Algorithm, Next: Modular Powering Algorithm, Prev: Powering Algorithms, Up: Powering Algorithms
146 File: gmp.info, Node: Modular Powering Algorithm, Prev: Normal Powering Algorithm, Up: Powering Algorithms
164 File: gmp.info, Node: Root Extraction Algorithms, Next: Radix Conversion Algorithms, Prev: Powering Algorithms, Up: Algorithms
177 File: gmp.info, Node: Square Root Algorithm, Next: Nth Root Algorithm, Prev: Root Extraction Algorithms, Up: Root Extraction Algorithms
231 File: gmp.info, Node: Nth Root Algorithm, Next: Perfect Square Algorithm, Prev: Square Root Algorithm, Up: Root Extraction Algorithms
251 File: gmp.info, Node: Perfect Square Algorithm, Next: Perfect Power Algorithm, Prev: Nth Root Algorithm, Up: Root Extraction Algorithm
    [all...]
standards.info 23 File: standards.info, Node: Top, Next: Preface, Prev: (dir), Up: (dir)
55 File: standards.info, Node: Preface, Next: Legal Issues, Prev: Top, Up: Top
113 File: standards.info, Node: Legal Issues, Next: Design Advice, Prev: Preface, Up: Top
165 File: standards.info, Node: Contributions, Next: Trademarks, Prev: Reading Non-Free Code, Up: Legal Issues
213 File: standards.info, Node: Trademarks, Prev: Contributions, Up: Legal Issues
246 File: standards.info, Node: Design Advice, Next: Program Behavior, Prev: Legal Issues, Up: Top
309 File: standards.info, Node: Compatibility, Next: Using Extensions, Prev: Source Language, Up: Design Advice
344 File: standards.info, Node: Using Extensions, Next: Standard C, Prev: Compatibility, Up: Design Advice
380 File: standards.info, Node: Standard C, Next: Conditional Compilation, Prev: Using Extensions, Up: Design Advice
444 File: standards.info, Node: Conditional Compilation, Prev: Standard C, Up: Design Advic
    [all...]
  /external/chromium_org/courgette/
encoded_program.cc 80 uint32 prev = 0; local
83 uint32 delta = current - prev;
85 prev = current;
99 uint32 prev = 0; local
105 uint32 current = prev + delta;
107 prev = current;
  /external/chromium_org/sync/engine/
get_commit_ids.cc 349 syncable::Entry prev(trans_, syncable::GET_BY_ID, prev_id);
350 CHECK(prev.good()) << "Bad id when walking predecessors.";
351 if (!prev.GetIsUnsynced()) {
356 int64 handle = prev.GetMetahandle();
362 TryAddItem(ready_unsynced_set, prev, result);
363 prev_id = prev.GetPredecessorId();
  /external/chromium_org/third_party/libvpx/source/libvpx/vpx_mem/
vpx_mem_tracker.c 539 p->prev = memtrack.tail;
540 p->prev->next = p;
585 p->prev->next = p->next;
588 p->next->prev = p->prev;
590 memtrack.tail = p->prev;
  /external/chromium_org/third_party/libxml/src/include/libxml/
tree.h 222 struct _xmlNode *prev; /* previous sibling link */ member in struct:_xmlAttribute
315 struct _xmlNode *prev; /* previous sibling link */ member in struct:_xmlElement
376 struct _xmlNode *prev; /* previous sibling link */ member in struct:_xmlDtd
404 struct _xmlAttr *prev; /* previous sibling link */ member in struct:_xmlAttr
459 struct _xmlNode *prev; /* previous sibling link */ member in struct:_xmlNode
521 struct _xmlNode *prev; /* previous sibling link */ member in struct:_xmlDoc
    [all...]
  /external/chromium_org/third_party/libxml/src/
threads.c 619 struct _xmlGlobalStateCleanupHelperParams *prev; member in struct:_xmlGlobalStateCleanupHelperParams
717 cleanup_helpers_head->prev = p;
720 p->prev = NULL;
1019 p->prev->next = p->next;
1021 p->next->prev = p->prev;
  /external/chromium_org/third_party/usrsctp/usrsctplib/
user_queue.h 368 panic("Bad list head %p first->prev != head", (void *)(head)); \
375 panic("Bad link elm %p next->prev != elm", (void *)(elm)); \
380 panic("Bad link elm %p prev->next != elm", (void *)(elm)); \
484 panic("Bad tailq head %p first->prev != head", (void *)(head)); \
496 panic("Bad link elm %p next->prev != elm", (void *)(elm)); \
501 panic("Bad link elm %p prev->next != elm", (void *)(elm)); \
  /external/f2fs-tools/fsck/
fsck.c 19 struct hard_link_node *node = NULL, *tmp = NULL, *prev = NULL; local
38 prev = tmp;
46 prev->next = node;
58 struct hard_link_node *node = NULL, *prev = NULL; local
68 prev = node;
85 prev->next = node->next;
  /external/ipsec-tools/src/racoon/
oakley.c 570 vchar_t *prev = res; /* K(n-1) */ local
588 seed = vmalloc(prev->l + buf->l);
592 if (prev && prev != res)
593 vfree(prev);
601 memcpy(seed->v, prev->v, prev->l);
602 memcpy(seed->v + prev->l, buf->v, buf->l);
608 if (prev && prev != res
    [all...]
  /external/libvpx/libvpx/vpx_mem/
vpx_mem_tracker.c 539 p->prev = memtrack.tail;
540 p->prev->next = p;
585 p->prev->next = p->next;
588 p->next->prev = p->prev;
590 memtrack.tail = p->prev;
  /external/libxml2/include/libxml/
tree.h 260 struct _xmlNode *prev; /* previous sibling link */ member in struct:_xmlAttribute
353 struct _xmlNode *prev; /* previous sibling link */ member in struct:_xmlElement
413 struct _xmlNode *prev; /* previous sibling link */ member in struct:_xmlDtd
441 struct _xmlAttr *prev; /* previous sibling link */ member in struct:_xmlAttr
496 struct _xmlNode *prev; /* previous sibling link */ member in struct:_xmlNode
558 struct _xmlNode *prev; /* previous sibling link */ member in struct:_xmlDoc
    [all...]
  /external/libxml2/
threads.c 620 struct _xmlGlobalStateCleanupHelperParams *prev; member in struct:_xmlGlobalStateCleanupHelperParams
718 cleanup_helpers_head->prev = p;
721 p->prev = NULL;
1024 p->prev->next = p->next;
1026 p->next->prev = p->prev;
  /external/llvm/include/llvm/ADT/
BitVector.h 171 /// "Prev" bit. Returns -1 if the next set bit is not found.
172 int find_next(unsigned Prev) const {
173 ++Prev;
174 if (Prev >= Size)
177 unsigned WordPos = Prev / BITWORD_SIZE;
178 unsigned BitPos = Prev % BITWORD_SIZE;
  /external/lzma/C/
Ppmd7.c 49 CPpmd7_Node_Ref Prev;
167 n = NODE(n)->Prev = next;
175 NODE(n)->Prev = head;
190 NODE(node2->Prev)->Next = node2->Next;
191 NODE(node2->Next)->Prev = node2->Prev;
  /external/okhttp/okio/src/main/java/okio/
OkBuffer.java 130 Segment tail = head.prev;
506 return head.next = head.prev = head;
509 Segment tail = head.prev;
575 Segment tail = head != null ? head.prev : null;
595 head.next = head.prev = head;
597 Segment tail = head.prev;
  /external/pixman/pixman/
pixman-private.h 815 pixman_link_t *prev; member in struct:pixman_link_t
836 link->prev = (pixman_link_t *)list;
837 list->head->prev = link;
844 link->prev->next = link->next;
845 link->next->prev = link->prev;
    [all...]
  /external/valgrind/main/docs/lib/
vg-html-common.xsl 107 <xsl:param name="prev" select="/foo"/>
114 <xsl:variable name="row1" select="count($prev) &gt; 0
118 <xsl:variable name="row2" select="($prev != 0)
129 <xsl:if test="count($prev)>0">
133 <xsl:with-param name="object" select="$prev"/>
137 <xsl:apply-templates select="$prev" mode="object.title.markup"/>
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vpx_mem/
vpx_mem_tracker.c 539 p->prev = memtrack.tail;
540 p->prev->next = p;
585 p->prev->next = p->next;
588 p->next->prev = p->prev;
590 memtrack.tail = p->prev;
  /external/icu/icu4c/source/common/
normalizer2impl.cpp 945 UChar prev=(UChar)(*starter-Hangul::JAMO_L_BASE); local
946 if(prev<Hangul::JAMO_L_COUNT) {
950 (prev*Hangul::JAMO_V_COUNT+(c-Hangul::JAMO_V_BASE))*
1229 UChar prev=*(prevSrc-1); local
1743 UChar32 prev=~prevFCD16; local
    [all...]
  /external/chromium_org/third_party/libevent/
evdns.c 178 struct request *next, *prev; member in struct:request
219 struct nameserver *next, *prev; member in struct:nameserver
560 req->next->prev = req->prev;
561 req->prev->next = req->next;
628 req->next->prev = req->prev;
629 req->prev->next = req->next;
2454 struct search_domain *cur, *prev = NULL, *next; local
    [all...]

Completed in 2329 milliseconds

<<61626364656667686970>>