blob: 2cb569c61a73dd65b05569bfd6fca36f60d404d3 [file] [log] [blame]
Nicolas Geoffray5550ca82015-08-21 18:38:30 +01001/*
2 * Copyright (C) 2015 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17#include "profiling_info.h"
18
19#include "art_method-inl.h"
David Sehr9e734c72018-01-04 17:56:19 -080020#include "dex/dex_instruction.h"
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010021#include "jit/jit.h"
22#include "jit/jit_code_cache.h"
Mathieu Chartier0795f232016-09-27 18:43:30 -070023#include "scoped_thread_state_change-inl.h"
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010024#include "thread.h"
25
26namespace art {
27
Mathieu Chartier65975772016-08-05 10:46:36 -070028ProfilingInfo::ProfilingInfo(ArtMethod* method, const std::vector<uint32_t>& entries)
Andreas Gampee40f65f2018-05-07 17:02:22 -070029 : method_(method),
30 saved_entry_point_(nullptr),
31 number_of_inline_caches_(entries.size()),
Mathieu Chartier65975772016-08-05 10:46:36 -070032 current_inline_uses_(0),
Andreas Gampee40f65f2018-05-07 17:02:22 -070033 is_method_being_compiled_(false),
34 is_osr_method_being_compiled_(false) {
Mathieu Chartier65975772016-08-05 10:46:36 -070035 memset(&cache_, 0, number_of_inline_caches_ * sizeof(InlineCache));
36 for (size_t i = 0; i < number_of_inline_caches_; ++i) {
37 cache_[i].dex_pc_ = entries[i];
38 }
Mathieu Chartier65975772016-08-05 10:46:36 -070039}
40
Nicolas Geoffray26705e22015-10-28 12:50:11 +000041bool ProfilingInfo::Create(Thread* self, ArtMethod* method, bool retry_allocation) {
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010042 // Walk over the dex instructions of the method and keep track of
43 // instructions we are interested in profiling.
Nicolas Geoffray1dad3f62015-10-23 14:59:54 +010044 DCHECK(!method->IsNative());
Mathieu Chartier65975772016-08-05 10:46:36 -070045
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010046 std::vector<uint32_t> entries;
Mathieu Chartier69147f12017-11-06 20:02:24 -080047 for (const DexInstructionPcPair& inst : method->DexInstructions()) {
Mathieu Chartier1d2d4ff2017-09-23 16:11:06 -070048 switch (inst->Opcode()) {
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010049 case Instruction::INVOKE_VIRTUAL:
50 case Instruction::INVOKE_VIRTUAL_RANGE:
51 case Instruction::INVOKE_VIRTUAL_QUICK:
52 case Instruction::INVOKE_VIRTUAL_RANGE_QUICK:
53 case Instruction::INVOKE_INTERFACE:
54 case Instruction::INVOKE_INTERFACE_RANGE:
Mathieu Chartier2b2bef22017-10-26 17:10:19 -070055 entries.push_back(inst.DexPc());
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010056 break;
57
58 default:
59 break;
60 }
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010061 }
62
Nicolas Geoffray73be1e82015-09-17 15:22:56 +010063 // We always create a `ProfilingInfo` object, even if there is no instruction we are
64 // interested in. The JIT code cache internally uses it.
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010065
66 // Allocate the `ProfilingInfo` object int the JIT's data space.
67 jit::JitCodeCache* code_cache = Runtime::Current()->GetJit()->GetCodeCache();
Nicolas Geoffray26705e22015-10-28 12:50:11 +000068 return code_cache->AddProfilingInfo(self, method, entries, retry_allocation) != nullptr;
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010069}
70
Nicolas Geoffray73be1e82015-09-17 15:22:56 +010071InlineCache* ProfilingInfo::GetInlineCache(uint32_t dex_pc) {
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010072 // TODO: binary search if array is too long.
73 for (size_t i = 0; i < number_of_inline_caches_; ++i) {
Nicolas Geoffray73be1e82015-09-17 15:22:56 +010074 if (cache_[i].dex_pc_ == dex_pc) {
Nicolas Geoffrayfdb7d632017-02-08 15:07:18 +000075 return &cache_[i];
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010076 }
77 }
Nicolas Geoffrayfdb7d632017-02-08 15:07:18 +000078 LOG(FATAL) << "No inline cache found for " << ArtMethod::PrettyMethod(method_) << "@" << dex_pc;
79 UNREACHABLE();
Nicolas Geoffray73be1e82015-09-17 15:22:56 +010080}
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010081
Nicolas Geoffray73be1e82015-09-17 15:22:56 +010082void ProfilingInfo::AddInvokeInfo(uint32_t dex_pc, mirror::Class* cls) {
83 InlineCache* cache = GetInlineCache(dex_pc);
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010084 for (size_t i = 0; i < InlineCache::kIndividualCacheSize; ++i) {
Nicolas Geoffray13056a12017-05-11 11:48:28 +000085 mirror::Class* existing = cache->classes_[i].Read<kWithoutReadBarrier>();
86 mirror::Class* marked = ReadBarrier::IsMarked(existing);
87 if (marked == cls) {
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010088 // Receiver type is already in the cache, nothing else to do.
89 return;
Nicolas Geoffray13056a12017-05-11 11:48:28 +000090 } else if (marked == nullptr) {
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010091 // Cache entry is empty, try to put `cls` in it.
Nicolas Geoffray13056a12017-05-11 11:48:28 +000092 // Note: it's ok to spin on 'existing' here: if 'existing' is not null, that means
93 // it is a stalled heap address, which will only be cleared during SweepSystemWeaks,
94 // *after* this thread hits a suspend point.
95 GcRoot<mirror::Class> expected_root(existing);
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010096 GcRoot<mirror::Class> desired_root(cls);
Orion Hodson4557b382018-01-03 11:47:54 +000097 auto atomic_root = reinterpret_cast<Atomic<GcRoot<mirror::Class>>*>(&cache->classes_[i]);
98 if (!atomic_root->CompareAndSetStrongSequentiallyConsistent(expected_root, desired_root)) {
Nicolas Geoffray5550ca82015-08-21 18:38:30 +010099 // Some other thread put a class in the cache, continue iteration starting at this
100 // entry in case the entry contains `cls`.
101 --i;
102 } else {
103 // We successfully set `cls`, just return.
104 return;
105 }
106 }
107 }
Nicolas Geoffrayb6e20ae2016-03-07 14:29:04 +0000108 // Unsuccessfull - cache is full, making it megamorphic. We do not DCHECK it though,
109 // as the garbage collector might clear the entries concurrently.
Nicolas Geoffray5550ca82015-08-21 18:38:30 +0100110}
111
112} // namespace art