Home
last modified time | relevance | path

Searched refs:HasInlineInfo (Results 1 – 6 of 6) sorted by relevance

/art/test/566-polymorphic-inlining/
Dpolymorphic_inline.cc54 return info.HasInlineInfo(); in do_checks()
/art/compiler/optimizing/
Dstack_map_test.cc107 ASSERT_FALSE(stack_map.HasInlineInfo()); in TEST()
200 ASSERT_TRUE(stack_map.HasInlineInfo()); in TEST()
239 ASSERT_FALSE(stack_map.HasInlineInfo()); in TEST()
272 ASSERT_FALSE(stack_map.HasInlineInfo()); in TEST()
305 ASSERT_FALSE(stack_map.HasInlineInfo()); in TEST()
427 ASSERT_FALSE(stack_map.HasInlineInfo()); in TEST()
528 ASSERT_FALSE(stack_map.HasInlineInfo()); in TEST()
538 ASSERT_FALSE(stack_map.HasInlineInfo()); in TEST()
684 ASSERT_FALSE(sm2.HasInlineInfo()); in TEST()
Dstack_map_stream.cc204 CHECK_EQ(stack_map.HasInlineInfo(), (inlining_depth != 0)); in EndStackMapEntry()
410 CHECK_EQ(CodeInfo::HasInlineInfo(buffer.data()), inline_infos_.size() > 0); in Encode()
/art/runtime/
Dstack_map.h150 ALWAYS_INLINE bool HasInlineInfo() const { in HasInlineInfo() function
350 bool HasInlineInfo() const { in HasInlineInfo() function
482 ALWAYS_INLINE static bool HasInlineInfo(const uint8_t* code_info_data) { in HasInlineInfo() function
Dstack.cc888 && CodeInfo::HasInlineInfo(cur_oat_quick_method_header_->GetOptimizedCodeInfoPtr())) { in WalkStack()
892 if (stack_map->IsValid() && stack_map->HasInlineInfo()) { in WalkStack()
/art/runtime/entrypoints/
Dentrypoint_utils.cc223 CodeInfo::HasInlineInfo(current_code->GetOptimizedCodeInfoPtr())) { in DoGetCalleeSaveMethodCallerAndDexPc()