Searched defs:top (Results 1 - 4 of 4) sorted by relevance
/art/runtime/ |
H A D | managed_stack.h | 52 // Copy this top fragment into given fragment. 54 // Clear this fragment, which has become the top. 56 // Link our top fragment onto the given fragment. 62 // Copy this given fragment back to the top. 86 void SetTopQuickFrame(ArtMethod** top) { argument 88 DCHECK_ALIGNED(top, 4u); 89 tagged_top_quick_frame_ = TaggedTopQuickFrame::CreateNotTagged(top); 92 void SetTopQuickFrameTagged(ArtMethod** top) { argument 94 DCHECK_ALIGNED(top, 4u); 95 tagged_top_quick_frame_ = TaggedTopQuickFrame::CreateTagged(top); 113 SetTopShadowFrame(ShadowFrame* top) argument [all...] |
H A D | thread.h | 496 void SetTopOfShadowStack(ShadowFrame* top) { argument 497 tlsPtr_.managed_stack.SetTopShadowFrame(top); 1588 // The top of the managed stack often manipulated directly by compiler generated code.
|
/art/runtime/gc/space/ |
H A D | region_space-inl.h | 214 uint8_t* top = r->Top(); local 217 r->LiveBytes() != static_cast<size_t>(top - pos); 221 reinterpret_cast<uintptr_t>(top), 224 while (pos < top) { 288 // We make 'top' all usable bytes, as the caller of this
|
/art/tools/dmtracedump/ |
H A D | tracedump.cc | 203 int32_t top; member in struct:CallStack 1307 void countRecursiveEntries(CallStack* pStack, int32_t top, MethodEntry* method) { argument 1309 for (int32_t ii = 0; ii < top; ++ii) { 1314 void stackDump(CallStack* pStack, int32_t top) { argument 1315 for (int32_t ii = 0; ii < top; ++ii) { 1693 * sort the methods so the most expensive appear at the top. 1903 * sort the methods so the most expensive appear at the top. 2075 pStack->top = 0; 2090 pStack->top, method->className, method->methodName, 2096 pStack->top, metho [all...] |
Completed in 123 milliseconds