/build/tools/droiddoc/templates-ds/ |
trailer.cs | 31 btnPrev: '.slideshow-prev',
|
/development/ndk/platforms/android-L/include/linux/netfilter/ |
xt_limit.h | 29 unsigned long prev; member in struct:xt_rateinfo
|
/development/ndk/platforms/android-L/include/linux/netfilter_bridge/ |
ebt_limit.h | 29 unsigned long prev; member in struct:ebt_limit_info
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
IntArray.java | 258 int prev = 0; local 262 x[i] = (next << 1) | prev; 263 prev = next >>> 31; 265 return prev; 301 int shiftInv = 32 - shift, prev = 0; local 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; local 317 x[i] ^= (next << shift) | prev; 325 int shiftInv = 32 - shift, prev = 0; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/editing/ |
RenderedPosition.cpp | 138 InlineBox* prev = box->prevLeafChildIgnoringLineBreak(); local 139 if (!prev || prev->bidiLevel() < bidiLevelOfRun) 141 box = prev;
|
VisiblePosition.cpp | 96 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 = canonicalizeCandidate(previousCandidate(position)) local [all...] |
/external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
builders.js | 219 var groupNames = groupNames.reduce(function(prev, curr) { 220 if (prev.indexOf(curr) == -1) { 221 prev.push(curr); 223 return prev;
|
/external/chromium_org/third_party/icu/source/i18n/ |
nortrans.cpp | 138 int32_t prev = start; local 150 start=prev; 159 text.handleReplaceBetween(prev, start, normalized); 162 int32_t delta = normalized.length() - (start - prev);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
lp_state_setup.h | 13 struct lp_setup_variant_list_item *next, *prev; member in struct:lp_setup_variant_list_item
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
nouveau_heap.h | 27 struct nouveau_heap *prev; member in struct:nouveau_heap
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
radeon_list.h | 35 struct rc_list * Prev;
|
/external/chromium_org/third_party/skia/src/core/ |
SkLazyPtr.h | 76 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;
|
SkScan_Path.cpp | 48 static inline void swap_edges(SkEdge* prev, SkEdge* next) { 49 SkASSERT(prev->fNext == next && next->fPrev == prev); 51 // remove prev from the list 52 prev->fPrev->fNext = next; 53 next->fPrev = prev->fPrev; 55 // insert prev after next 56 prev->fNext = next->fNext; 57 next->fNext->fPrev = prev; 58 next->fNext = prev; 66 SkEdge* prev = edge->fPrev; local [all...] |
/external/chromium_org/v8/test/cctest/ |
test-threads.cc | 163 ThreadIdValidationThread* prev = NULL; local 166 new ThreadIdValidationThread(prev, &refs, i, &semaphore); 168 prev = newThread; 171 prev->Start();
|
/external/clang/test/Modules/ |
cxx-decls.cpp | 36 // CHECK: VarDecl {{0x[0-9a-f]*}} prev [[mergeUsedFlag]] {{.*}} in cxx_decls_merged used mergeUsedFlag
|
/external/e2fsprogs/debugfs/ |
extent_cmds.ct | 38 previous, prev, p;
|
/external/icu/icu4c/source/i18n/ |
nortrans.cpp | 139 int32_t prev = start; local 151 start=prev; 160 text.handleReplaceBetween(prev, start, normalized); 163 int32_t delta = normalized.length() - (start - prev);
|
/external/icu/icu4c/source/layout/ |
LigatureSubstSubtables.cpp | 50 tempIterator.prev();
|
SubstitutionLookups.cpp | 22 or prev() of the delta between that and the current
|
/external/libcxx/test/containers/associative/map/map.modifiers/ |
insert_cv.pass.cpp | 43 assert(r.first == prev(m.end())); 50 assert(r.first == prev(m.end())); 76 assert(r.first == prev(m.end())); 83 assert(r.first == prev(m.end()));
|
insert_rv.pass.cpp | 46 assert(r.first == prev(m.end())); 53 assert(r.first == prev(m.end())); 79 assert(r.first == prev(m.end())); 86 assert(r.first == prev(m.end()));
|
/external/llvm/include/llvm/Support/ |
Recycler.h | 33 /// next/prev pointers. 35 RecyclerStruct *Prev, *Next; 41 static RecyclerStruct *getPrev(const RecyclerStruct *t) { return t->Prev; } 43 static void setPrev(RecyclerStruct *t, RecyclerStruct *p) { t->Prev = p; }
|
/external/mesa3d/src/gallium/drivers/llvmpipe/ |
lp_state_setup.h | 13 struct lp_setup_variant_list_item *next, *prev; member in struct:lp_setup_variant_list_item
|
/external/mesa3d/src/gallium/drivers/nouveau/ |
nouveau_heap.h | 27 struct nouveau_heap *prev; member in struct:nouveau_heap
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
radeon_list.h | 35 struct rc_list * Prev;
|