/external/chromium_org/tools/deep_memory_profiler/visualizer/static/ |
utility.js | 37 return left.reduce(function(previous, current) { 40 previous.push(current); 43 return previous;
|
profiler.js | 101 return model.children.reduce(function(previous, current) { 104 previous = matched; 105 return previous; 109 return this.models_.reduce(function(previous, current) { 112 previous.push(matched); 113 return previous; 128 var curSub = path.reduce(function(previous, current, index) { 129 return previous[2][current]; 211 var size = matchedUnits.reduce(function(previous, current) { 212 return previous + worldUnits[worldName][current] [all...] |
/external/guava/guava/src/com/google/common/collect/ |
RegularImmutableSortedMultiset.java | 41 CumulativeCountEntry(E element, int count, @Nullable CumulativeCountEntry<E> previous) { 44 this.cumulativeCount = count + ((previous == null) ? 0 : previous.cumulativeCount); 61 CumulativeCountEntry<E> previous = null; local 64 previous = new CumulativeCountEntry<E>(entry.getElement(), entry.getCount(), previous));
|
/external/chromium_org/third_party/WebKit/Source/core/html/ |
HTMLCollection.cpp | 337 Element* previous = ¤t; local 339 previous = ElementTraversal::previousSibling(*previous); 340 } while (previous && !isMatchingElement(nodeList, *previous)); 341 return previous; 402 Element* previous = ¤tElement; local 403 while ((previous = previousMatchingChildElement(*this, *previous))) { 405 return previous; [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
RenderSVGText.cpp | 112 static inline bool findPreviousAndNextAttributes(RenderSVGText* root, RenderSVGInlineText* locateElement, SVGTextLayoutAttributes*& previous, SVGTextLayoutAttributes*& next) 127 previous = text->layoutAttributes(); 185 SVGTextLayoutAttributes* previous = 0; local 188 findPreviousAndNextAttributes(this, attributes->context(), previous, next); 190 if (previous) 191 m_layoutAttributesBuilder.buildLayoutAttributesForTextRenderer(previous->context()); 241 SVGTextLayoutAttributes* previous = 0; local 244 findPreviousAndNextAttributes(this, text, previous, next); 246 if (previous) 247 affectedAttributes.append(previous); [all...] |
/external/chromium_org/v8/src/ |
hydrogen-escape-analysis.cc | 63 HCapturedObject* HEscapeAnalysisPhase::NewState(HInstruction* previous) { 67 state->InsertAfter(previous); 74 HInstruction* previous) { 76 HCapturedObject* state = NewState(previous); 86 HInstruction* previous, 88 HBasicBlock* block = previous->block(); 89 HCapturedObject* state = NewState(previous); 101 HInstruction* previous, 103 HCapturedObject* state = NewState(previous); 207 state = NewStateCopy(store->previous(), state) [all...] |
unicode-inl.h | 87 // Encode encodes the UTF-16 code units c and previous into the given str 93 int previous, 104 if (Utf16::IsSurrogatePair(previous, c)) { 107 Utf16::CombineSurrogatePair(previous, c), 140 unsigned Utf8::Length(uchar c, int previous) { 147 Utf16::IsLeadSurrogate(previous)) {
|
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
error_fixer.py | 124 iterator = iterator.previous 161 tokenutil.InsertSpaceTokenAfter(token.previous) 179 tokenutil.InsertBlankLineAfter(token.previous) 189 if not token.previous: 203 tokenutil.DeleteToken(token.previous) 205 tokenutil.InsertBlankLineAfter(token.previous) 233 if token.attached_object.type_end_token == start_token.previous: 238 tokenutil.InsertTokenAfter(new_token, start_token.previous) 249 last_type = end_token.previous 252 last_type = last_type.previous [all...] |
/external/chromium_org/third_party/closure_linter/closure_linter/ |
error_fixer.py | 124 iterator = iterator.previous 161 tokenutil.InsertSpaceTokenAfter(token.previous) 179 tokenutil.InsertBlankLineAfter(token.previous) 189 if not token.previous: 203 tokenutil.DeleteToken(token.previous) 205 tokenutil.InsertBlankLineAfter(token.previous) 233 if token.attached_object.type_end_token == start_token.previous: 238 tokenutil.InsertTokenAfter(new_token, start_token.previous) 249 last_type = end_token.previous 252 last_type = last_type.previous [all...] |
/external/chromium_org/third_party/WebKit/Source/wtf/ |
TreeNodeTest.cpp | 56 EXPECT_EQ(lastChild->previous(), firstChild.get()); 80 EXPECT_EQ(firstChild.get(), lastChild->previous()); 87 EXPECT_EQ(middleChild->previous(), firstChild.get()); 90 EXPECT_EQ(lastChild->previous(), middleChild.get()); 103 EXPECT_EQ(child->previous(), nullNode.get()); 140 EXPECT_EQ(trio.lastChild->previous(), trio.firstChild.get()); 166 EXPECT_EQ(trio.middleChild->previous(), nullNode.get());
|
/external/srtp/crypto/cipher/ |
aes_cbc.c | 140 /* set state and 'previous' block to iv */ 142 c->previous.v8[i] = c->state.v8[i] = input[i]; 204 v128_t state, previous; local 216 /* set 'previous' block to iv*/ 218 previous.v8[i] = c->previous.v8[i]; 222 v128_hex_string(&previous)); 245 * exor previous ciphertext block out of plaintext, and write new 247 * to the 'previous' block 251 *output++ = state.v8[i] ^ previous.v8[i] [all...] |
/frameworks/base/services/core/java/com/android/server/notification/ |
NotificationRecord.java | 83 public void copyRankingInformation(NotificationRecord previous) { 84 mContactAffinity = previous.mContactAffinity; 85 mRecentlyIntrusive = previous.mRecentlyIntrusive; 86 mPackagePriority = previous.mPackagePriority; 87 mPackageVisibility = previous.mPackageVisibility; 88 mIntercept = previous.mIntercept; 89 mRankingTimeMs = calculateRankingTimeMs(previous.getRankingTimeMs()); 267 * of the previous notification record, 0 otherwise 275 // If we've ranked a previous instance with a timestamp, inherit it. This case is
|
/external/chromium_org/third_party/icu/source/common/ |
ulist.c | 18 UListNode *previous; member in struct:UListNode 63 newItem->previous = NULL; 88 newItem->previous = list->tail; 114 newItem->previous = NULL; 116 list->head->previous = newItem;
|
/external/glide/library/src/main/java/com/bumptech/glide/load/model/ |
GenericLoaderFactory.java | 53 * Registers the given {@link ModelLoaderFactory} for the given model and resource classes and returns the previous 74 ModelLoaderFactory<T, Y> previous = resourceToFactories.put(resourceClass, factory); local 76 if (previous != null) { 80 if (currentResourceToFactories.containsValue(previous)) { 81 previous = null; 87 return previous;
|
/external/icu/icu4c/source/common/ |
ulist.c | 18 UListNode *previous; member in struct:UListNode 63 newItem->previous = NULL; 88 newItem->previous = list->tail; 114 newItem->previous = NULL; 116 list->head->previous = newItem;
|
/frameworks/base/libs/hwui/ |
PatchCache.cpp | 199 BufferBlock* previous = NULL; local 206 previous = block; 215 previous = NULL; 226 if (previous) { 227 previous->next = block->next;
|
StatefulBaseRenderer.cpp | 85 sp<Snapshot> toRestore = mSnapshot->previous; 173 if (!mSnapshot->previous->clipRegion->isEmpty()) { 174 clip.setRegion(*mSnapshot->previous->clipRegion); 176 if (mSnapshot->previous == firstSnapshot()) { 179 Rect* bounds = mSnapshot->previous->clipRect; 187 // region is the transformed input path, masked by the previous clip
|
/libcore/dex/src/main/java/com/android/dex/ |
TableOfContents.java | 117 Section previous = null; local 133 if (previous != null && previous.off > section.off) { 134 throw new DexException("Map is unsorted at " + previous + ", " + section); 137 previous = section;
|
/art/compiler/optimizing/ |
register_allocator.cc | 682 HInstruction* previous = instruction->GetPrevious(); local 684 if (previous == nullptr 685 || previous->AsParallelMove() == nullptr 686 || !IsInputMove(previous)) { 691 move = previous->AsParallelMove(); 721 HInstruction* previous = at->GetPrevious(); local 722 if (previous != nullptr && previous->AsParallelMove() != nullptr) { 725 if (previous->GetLifetimePosition() != position) { 726 previous = previous->GetPrevious() 747 HInstruction* previous = last->GetPrevious(); local [all...] |
/external/chromium_org/net/dns/ |
host_resolver_proc.cc | 61 HostResolverProc::HostResolverProc(HostResolverProc* previous) { 62 SetPreviousProc(previous); 65 if (!previous)
|
/external/chromium_org/third_party/WebKit/Source/bindings/v8/ |
V8NPUtils.cpp | 132 ExceptionHandlerInfo* previous; member in struct:WebCore::ExceptionHandlerInfo 142 info->previous = topHandler; 152 topHandler = topHandler->previous;
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
RegularContiguousSet.java | 71 protected C computeNext(C previous) { 72 return equalsOrThrow(previous, last) ? null : domain.next(previous);
|
/external/linux-tools-perf/perf-3.12.0/arch/x86/lib/ |
memcpy_64.S | 38 .previous 54 .previous 206 .previous
|
/external/valgrind/main/helgrind/tests/ |
annotate_rwlock.stderr.exp | 24 This conflicts with a previous write of size 4 by thread #x 41 This conflicts with a previous write of size 4 by thread #x 58 This conflicts with a previous read of size 4 by thread #x 75 This conflicts with a previous read of size 4 by thread #x 92 This conflicts with a previous read of size 4 by thread #x 113 This conflicts with a previous read of size 4 by thread #x
|
/external/chromium_org/third_party/mesa/src/src/glx/apple/ |
apple_glx_drawable.c | 150 if (d->previous) { 151 d->previous->next = d->next; 156 * has no previous pointer. 162 d->next->previous = d->previous; 296 d->previous = NULL; 309 drawables_list->previous = agd;
|