Searched refs:prev (Results 276 - 300 of 1447) sorted by relevance

<<11121314151617181920>>

/external/chromium_org/third_party/leveldatabase/src/db/
H A Dskiplist.h19 // (2) The contents of a Node except for the next/prev pointers are
25 // ... prev vs. next pointer ordering ...
125 // If prev is non-NULL, fills prev[level] with pointer to previous
127 Node* FindGreaterOrEqual(const Key& key, Node** prev) const;
212 // Instead of using explicit "prev" links, we just search for the
259 typename SkipList<Key,Comparator>::Node* SkipList<Key,Comparator>::FindGreaterOrEqual(const Key& key, Node** prev)
269 if (prev != NULL) prev[level] = x;
337 Node* prev[kMaxHeigh local
[all...]
/external/chromium_org/third_party/leveldatabase/src/util/
H A Dcache.cc30 LRUHandle* prev; member in struct:leveldb::__anon12466::LRUHandle
164 // lru.prev is newest entry, lru.next is oldest entry.
174 lru_.prev = &lru_;
197 e->next->prev = e->prev;
198 e->prev->next = e->next;
204 e->prev = lru_.prev;
205 e->prev->next = e;
206 e->next->prev
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/examples/
H A Dvp8_multi_resolution_encoder.c221 vpx_image_t *const prev = &raw[i - 1]; local
225 I420Scale(prev->planes[VPX_PLANE_Y], prev->stride[VPX_PLANE_Y],
226 prev->planes[VPX_PLANE_U], prev->stride[VPX_PLANE_U],
227 prev->planes[VPX_PLANE_V], prev->stride[VPX_PLANE_V],
228 prev->d_w, prev->d_h,
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
H A Dftutil.c383 node->prev = before;
404 node->prev = 0;
409 after->prev = node;
424 before = node->prev;
433 after->prev = before;
448 before = node->prev;
458 after->prev = before;
462 node->prev = 0;
464 list->head->prev = node;
/external/skia/src/core/
H A DSkMatrixClipStateMgr.h184 MatrixClipState(MatrixClipState* prev, int flags) argument
185 : fPrev(prev)
189 if (NULL == prev) {
203 fLayerID = prev->fLayerID;
206 fMatrixInfoStorage = *prev->fMatrixInfo;
209 fMatrixInfo = prev->fMatrixInfo;
216 fClipInfo = prev->fClipInfo;
221 fMCStateID = prev->fMCStateID;
223 fExpectedDepth = prev->fExpectedDepth;
H A DSkLazyPtr.h76 P prev = (P)sk_atomic_cas(dst, NULL, ptr); local
78 if (prev) {
79 // We need an acquire barrier before returning prev, which sk_atomic_cas provided.
81 return prev;
H A DSkRegion_path.cpp448 Edge* prev = edge;
453 path->moveTo(SkIntToScalar(prev->fX), SkIntToScalar(prev->fY0));
454 prev->fFlags = 0;
456 if (prev->fX != edge->fX || prev->fY1 != edge->fY0) { // skip collinear
457 path->lineTo(SkIntToScalar(prev->fX), SkIntToScalar(prev->fY1)); // V
460 prev = edge;
463 prev
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/graphics/
H A DCanvas2DLayerManager.cpp133 layer = layer->prev();
142 layer = layer->prev();
152 return layer->prev() || m_layerList.head() == layer;
/external/chromium_org/third_party/libusb/src/libusb/
H A Dlibusbi.h74 struct list_head *prev, *next; member in struct:list_head
106 entry->prev = entry->next = entry;
112 entry->prev = head;
114 head->next->prev = entry;
122 entry->prev = head->prev;
124 head->prev->next = entry;
125 head->prev = entry;
130 entry->next->prev = entry->prev;
[all...]
/external/chromium_org/third_party/opus/src/src/
H A Dopus_private.h52 int get_left_channel(const ChannelLayout *layout, int stream_id, int prev);
53 int get_right_channel(const ChannelLayout *layout, int stream_id, int prev);
54 int get_mono_channel(const ChannelLayout *layout, int stream_id, int prev);
/external/chromium_org/third_party/skia/src/core/
H A DSkLazyPtr.h76 P prev = (P)sk_atomic_cas(dst, NULL, ptr); local
78 if (prev) {
79 // We need an acquire barrier before returning prev, which sk_atomic_cas provided.
81 return prev;
H A DSkRegion_path.cpp448 Edge* prev = edge;
453 path->moveTo(SkIntToScalar(prev->fX), SkIntToScalar(prev->fY0));
454 prev->fFlags = 0;
456 if (prev->fX != edge->fX || prev->fY1 != edge->fY0) { // skip collinear
457 path->lineTo(SkIntToScalar(prev->fX), SkIntToScalar(prev->fY1)); // V
460 prev = edge;
463 prev
[all...]
/external/chromium_org/v8/src/
H A Dhydrogen-load-elimination.cc169 HFieldApproximation* prev = NULL; local
175 if (prev != NULL) {
176 prev->next_ = approx->next_;
183 prev = approx;
353 HFieldApproximation* prev = NULL; local
358 if (prev != NULL) {
359 prev->next_ = approx->next_;
367 prev = approx;
387 HFieldApproximation* prev = NULL; local
389 prev
[all...]
/external/libopus/src/
H A Dopus_private.h52 int get_left_channel(const ChannelLayout *layout, int stream_id, int prev);
53 int get_right_channel(const ChannelLayout *layout, int stream_id, int prev);
54 int get_mono_channel(const ChannelLayout *layout, int stream_id, int prev);
/external/qemu/distrib/sdl-1.2.15/src/joystick/linux/
H A DSDL_sysjoystick.c246 for(i = start; SDL_joylist[i].fname == NULL;) i = SDL_joylist[i].prev;
267 int prev; member in struct:__anon29415
303 register int i, j, k, ret, prev; local
329 prev = i;
330 SDL_joylist[prev].map = &(joystick_logicalmap[j]);
333 SDL_joylist[prev].next = max + ret;
334 SDL_joylist[max+ret].prev = prev;
336 prev = max + ret;
337 SDL_joylist[prev]
[all...]
/external/valgrind/main/perf/
H A Dmany-loss-records.c93 struct Chunk *prev = NULL; local
99 new->child = prev;
100 prev = new;
/external/chromium_org/third_party/icu/source/common/
H A Dutrie2.cpp523 UChar32 c, prev, highStart; local
559 prev=start;
595 if(i2Block==prevI2Block && (c-prev)>=UTRIE2_CP_PER_INDEX_1_ENTRY) {
609 if(prev<c && !enumRange(context, prev, c-1, prevValue)) {
613 prev=c;
632 if(block==prevBlock && (c-prev)>=UTRIE2_DATA_BLOCK_LENGTH) {
641 if(prev<c && !enumRange(context, prev, c-1, prevValue)) {
644 prev
[all...]
/external/icu/icu4c/source/common/
H A Dutrie2.cpp552 UChar32 c, prev, highStart; local
588 prev=start;
624 if(i2Block==prevI2Block && (c-prev)>=UTRIE2_CP_PER_INDEX_1_ENTRY) {
638 if(prev<c && !enumRange(context, prev, c-1, prevValue)) {
642 prev=c;
661 if(block==prevBlock && (c-prev)>=UTRIE2_DATA_BLOCK_LENGTH) {
670 if(prev<c && !enumRange(context, prev, c-1, prevValue)) {
673 prev
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
H A Dstroker.c280 /* skip the first one, it's the same as the prev point */
876 VGfloat start[2], prev[2]; local
883 prev[0] = 0.f;
884 prev[1] = 0.f;
893 prev[0] = start[0];
894 prev[1] = start[1];
913 VGfloat line[4] = {prev[0], prev[1], coords[0], coords[1]};
926 create_joins(stroker, prev[0], prev[
1137 VGfloat prev[2]; local
[all...]
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dstroker.c280 /* skip the first one, it's the same as the prev point */
876 VGfloat start[2], prev[2]; local
883 prev[0] = 0.f;
884 prev[1] = 0.f;
893 prev[0] = start[0];
894 prev[1] = start[1];
913 VGfloat line[4] = {prev[0], prev[1], coords[0], coords[1]};
926 create_joins(stroker, prev[0], prev[
1137 VGfloat prev[2]; local
[all...]
/external/chromium_org/third_party/boringssl/src/ssl/
H A Dssl_ciph.c175 struct cipher_order_st *next,*prev; member in struct:cipher_order_st
395 if (curr->prev != NULL)
396 curr->prev->next=curr->next;
398 curr->next->prev=curr->prev;
400 curr->prev= *tail;
410 *tail=curr->prev;
412 curr->next->prev=curr->prev;
413 if (curr->prev !
[all...]
/external/bison/build-aux/
H A Dgnu-web-doc-update6 # and requires a .prev-version file as well as a Makefile,
132 prev=.prev-version
133 version=$(cat $prev) || die "no $prev file?"
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
H A DIntArray.java258 int prev = 0;
262 x[i] = (next << 1) | prev;
263 prev = next >>> 31;
265 return prev;
301 int shiftInv = 32 - shift, prev = 0;
305 m_ints[i + words] ^= (next << shift) | prev;
306 prev = next >>> shiftInv;
308 m_ints[otherUsedLen + words] ^= prev;
313 int shiftInv = 32 - shift, prev = 0;
317 x[i] ^= (next << shift) | prev;
[all...]
/external/chromium_org/base/i18n/
H A Dbreak_iterator.h50 // // Region [iter.prev(), iter.pos()) contains a word.
113 // Returns the string between prev() and pos().
119 size_t prev() const { return prev_; } function in class:base::i18n::BreakIterator
/external/chromium_org/third_party/WebKit/Source/core/editing/
H A DVisiblePosition.cpp96 VisiblePosition prev = VisiblePosition(pos, DOWNSTREAM);
97 ASSERT(prev != *this);
102 if (prev.isNotNull() && m_affinity == UPSTREAM) {
103 VisiblePosition temp = prev;
105 ASSERT(inSameLine(temp, prev));
111 return prev;
113 return honorEditingBoundaryAtOrBefore(prev);
115 return skipToStartOfEditingBoundary(prev);
119 return honorEditingBoundaryAtOrBefore(prev);
588 Position prev local
[all...]

Completed in 845 milliseconds

<<11121314151617181920>>