Searched refs:top (Results 1 - 11 of 11) sorted by relevance

/art/runtime/
H A Doat_file_manager.cc398 DexFileAndClassPair pair(temp.top());
427 // against the following top element. If the descriptor is the same, it is now checked whether
510 // Modifying the top element is only safe if we pop right after.
511 DexFileAndClassPair compare_pop(queue.top());
516 DexFileAndClassPair top(queue.top());
518 if (strcmp(compare_pop.GetCachedDescriptor(), top.GetCachedDescriptor()) == 0) {
520 if (compare_pop.FromLoadedOat() != top.FromLoadedOat()) {
525 top.GetDexFile()->GetLocation().c_str());
529 AddNext(&top,
[all...]
H A Dhandle_scope.h187 // Calls to NewHandle will create a new handle inside the top StackHandleScope.
188 // When the handle scope becomes full a new one is created and push on top of the
205 delete scopes_.top();
219 return scopes_.top()->NewHandle(object);
H A Dstack.h495 // Copy this top fragment into given fragment.
497 // Clear this fragment, which has become the top.
499 // Link our top fragment onto the given fragment.
505 // Copy this given fragment back to the top.
517 void SetTopQuickFrame(ArtMethod** top) { argument
519 top_quick_frame_ = top;
546 void SetTopShadowFrame(ShadowFrame* top) { argument
548 top_shadow_frame_ = top;
H A Dthread.h406 void SetTopOfShadowStack(ShadowFrame* top) { argument
407 tlsPtr_.managed_stack.SetTopShadowFrame(top);
1375 // The top of the managed stack often manipulated directly by compiler generated code.
H A Dclass_linker.cc194 // the top-level exception must be a NoClassDefFoundError. The potentially already pending
294 if (!gaps->empty() && gaps->top().size >= n) {
295 FieldGap gap = gaps->top();
/art/tools/dmtracedump/
H A Dtracedump.cc203 int32_t top; member in struct:CallStack
1303 void countRecursiveEntries(CallStack* pStack, int32_t top, MethodEntry* method) { argument
1305 for (int32_t ii = 0; ii < top; ++ii) {
1310 void stackDump(CallStack* pStack, int32_t top) { argument
1311 for (int32_t ii = 0; ii < top; ++ii) {
1689 * sort the methods so the most expensive appear at the top.
1899 * sort the methods so the most expensive appear at the top.
2071 pStack->top = 0;
2086 pStack->top, method->className, method->methodName,
2092 pStack->top, metho
[all...]
/art/runtime/gc/space/
H A Dregion_space-inl.h245 uint8_t* top = r->Top(); local
246 while (pos < top) {
/art/runtime/arch/arm/
H A Dquick_entrypoints_arm.S552 cbnz r3, .Lslow_lock @ if either of the top two bits are set, go slow path
554 uxth r2, r2 @ zero top 16 bits
600 cbnz r2, .Lslow_unlock @ if either of the top two bits are set, go slow path
605 uxth r3, r3 @ zero top 16 bits
1079 // allocation stack top.
/art/runtime/arch/mips64/
H A Dquick_entrypoints_mips64.S188 // This assumes the top part of these stack frame types are identical.
1532 # t3: thread stack top offset
1597 # allocation stack top.
/art/test/
H A DAndroid.run-test.mk934 echo "run-test run as top-level target, removing test directory $(ART_HOST_TEST_DIR)" && \
/art/compiler/
H A Dimage_writer.cc1374 std::pair<mirror::Object*, size_t> pair(work_stack->top());
2110 // 64-bit values here, clearing the top 32 bits for 32-bit targets. The zero-extension is

Completed in 408 milliseconds