20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "cds/cdsConfig.hpp"
26 #include "ci/ciEnv.hpp"
27 #include "ci/ciMetadata.hpp"
28 #include "classfile/compactHashtable.hpp"
29 #include "classfile/javaClasses.hpp"
30 #include "classfile/symbolTable.hpp"
31 #include "classfile/systemDictionaryShared.hpp"
32 #include "compiler/compileTask.hpp"
33 #include "memory/metadataFactory.hpp"
34 #include "memory/metaspaceClosure.hpp"
35 #include "memory/resourceArea.hpp"
36 #include "memory/universe.hpp"
37 #include "oops/method.hpp"
38 #include "oops/method.inline.hpp"
39 #include "oops/methodCounters.hpp"
40 #include "oops/trainingData.hpp"
41 #include "runtime/arguments.hpp"
42 #include "runtime/javaThread.inline.hpp"
43 #include "runtime/jniHandles.inline.hpp"
44 #include "utilities/growableArray.hpp"
45
46 TrainingData::TrainingDataSet TrainingData::_training_data_set(1024, 0x3fffffff);
47 TrainingData::TrainingDataDictionary TrainingData::_archived_training_data_dictionary;
48 TrainingData::TrainingDataDictionary TrainingData::_archived_training_data_dictionary_for_dumping;
49 TrainingData::DumptimeTrainingDataDictionary* TrainingData::_dumptime_training_data_dictionary = nullptr;
50 int TrainingData::TrainingDataLocker::_lock_mode;
51 volatile bool TrainingData::TrainingDataLocker::_snapshot = false;
52
53 MethodTrainingData::MethodTrainingData() {
54 // Used by cppVtables.cpp only
55 assert(CDSConfig::is_dumping_static_archive() || UseSharedSpaces, "only for CDS");
56 }
57
58 KlassTrainingData::KlassTrainingData() {
59 // Used by cppVtables.cpp only
60 assert(CDSConfig::is_dumping_static_archive() || UseSharedSpaces, "only for CDS");
61 }
62
63 CompileTrainingData::CompileTrainingData() : _level(-1), _compile_id(-1) {
64 // Used by cppVtables.cpp only
65 assert(CDSConfig::is_dumping_static_archive() || UseSharedSpaces, "only for CDS");
66 }
67
68 void TrainingData::initialize() {
69 // this is a nop if training modes are not enabled
70 if (have_data() || need_data()) {
71 // Data structures that we have do not currently support iterative training. So you cannot replay
72 // and train at the same time. Going forward we may want to adjust iteration/search to enable that.
73 guarantee(have_data() != need_data(), "Iterative training is not supported");
74 TrainingDataLocker::initialize();
75 }
76 }
77
78 static void verify_archived_entry(TrainingData* td, const TrainingData::Key* k) {
79 guarantee(TrainingData::Key::can_compute_cds_hash(k), "");
80 TrainingData* td1 = TrainingData::lookup_archived_training_data(k);
81 guarantee(td == td1, "");
82 }
83
84 void TrainingData::verify() {
85 if (TrainingData::have_data() && !TrainingData::assembling_data()) {
86 archived_training_data_dictionary()->iterate_all([&](TrainingData* td) {
87 if (td->is_KlassTrainingData()) {
88 KlassTrainingData* ktd = td->as_KlassTrainingData();
89 if (ktd->has_holder() && ktd->holder()->is_loaded()) {
90 Key k(ktd->holder());
91 verify_archived_entry(td, &k);
92 }
93 ktd->verify();
94 } else if (td->is_MethodTrainingData()) {
95 MethodTrainingData* mtd = td->as_MethodTrainingData();
96 if (mtd->has_holder() && mtd->holder()->method_holder()->is_loaded()) {
97 Key k(mtd->holder());
98 verify_archived_entry(td, &k);
99 }
100 mtd->verify(/*verify_dep_counter*/true);
101 }
102 });
103 }
104 if (TrainingData::need_data()) {
105 TrainingDataLocker l;
106 training_data_set()->iterate([&](TrainingData* td) {
107 if (td->is_KlassTrainingData()) {
108 KlassTrainingData* ktd = td->as_KlassTrainingData();
109 ktd->verify();
110 } else if (td->is_MethodTrainingData()) {
111 MethodTrainingData* mtd = td->as_MethodTrainingData();
112 // During the training run init deps tracking is not setup yet,
113 // don't verify it.
114 mtd->verify(/*verify_dep_counter*/false);
115 }
116 });
117 }
118 }
119
120 MethodTrainingData* MethodTrainingData::make(const methodHandle& method, bool null_if_not_found, bool use_cache) {
121 MethodTrainingData* mtd = nullptr;
122 if (!have_data() && !need_data()) {
123 return mtd;
124 }
132 // i.e. null_if_no_found == true, then just return a null.
133 // 3. Cache value is not null.
134 // Return it, the value of training_data_lookup_failed doesn't matter.
135 MethodCounters* mcs = method->method_counters();
136 if (mcs != nullptr) {
137 mtd = mcs->method_training_data();
138 if (mtd != nullptr && mtd != mcs->method_training_data_sentinel()) {
139 return mtd;
140 }
141 if (null_if_not_found && mtd == nullptr) {
142 assert(mtd == nullptr, "No training data found");
143 return nullptr;
144 }
145 } else if (use_cache) {
146 mcs = Method::build_method_counters(Thread::current(), method());
147 }
148
149 TrainingData* td = nullptr;
150
151 Key key(method());
152 if (have_data()) {
153 td = lookup_archived_training_data(&key);
154 if (td != nullptr) {
155 mtd = td->as_MethodTrainingData();
156 } else {
157 mtd = nullptr;
158 }
159 // Cache the pointer to MTD in MethodCounters for faster lookup (could be null if not found)
160 method->init_training_data(mtd);
161 }
162
163 if (need_data()) {
164 TrainingDataLocker l;
165 td = training_data_set()->find(&key);
166 if (td == nullptr) {
167 if (!null_if_not_found) {
168 KlassTrainingData* ktd = KlassTrainingData::make(method->method_holder());
169 if (ktd == nullptr) {
170 return nullptr; // allocation failure
171 }
172 mtd = MethodTrainingData::allocate(method(), ktd);
292 for (int i = 0, len = _init_deps.length(); i < len; i++) {
293 st->print(" dep:");
294 _init_deps.at(i)->print_on(st, true);
295 }
296 }
297 }
298
299 void CompileTrainingData::notice_inlined_method(CompileTask* task,
300 const methodHandle& method) {
301 MethodTrainingData* mtd = MethodTrainingData::make(method);
302 if (mtd != nullptr) {
303 mtd->notice_compilation(task->comp_level(), true);
304 }
305 }
306
307 void CompileTrainingData::notice_jit_observation(ciEnv* env, ciBaseObject* what) {
308 // A JIT is starting to look at class k.
309 // We could follow the queries that it is making, but it is
310 // simpler to assume, conservatively, that the JIT will
311 // eventually depend on the initialization state of k.
312 CompileTask* task = env->task();
313 assert(task != nullptr, "");
314 Method* method = task->method();
315 if (what->is_metadata()) {
316 ciMetadata* md = what->as_metadata();
317 if (md->is_loaded() && md->is_instance_klass()) {
318 ciInstanceKlass* cik = md->as_instance_klass();
319
320 if (cik->is_initialized()) {
321 InstanceKlass* ik = md->as_instance_klass()->get_instanceKlass();
322 KlassTrainingData* ktd = KlassTrainingData::make(ik);
323 if (ktd == nullptr) {
324 // Allocation failure or snapshot in progress
325 return;
326 }
327 // This JIT task is (probably) requesting that ik be initialized,
328 // so add him to my _init_deps list.
329 TrainingDataLocker l;
330 if (l.can_add()) {
331 add_init_dep(ktd);
332 }
333 }
334 }
335 }
336 }
337
338 void KlassTrainingData::prepare(Visitor& visitor) {
339 if (visitor.is_visited(this)) {
340 return;
341 }
342 visitor.visit(this);
343 _comp_deps.prepare();
344 }
345
346 void MethodTrainingData::prepare(Visitor& visitor) {
347 if (visitor.is_visited(this)) {
348 return;
349 }
350 visitor.visit(this);
351 klass()->prepare(visitor);
352 if (has_holder()) {
353 _final_counters = holder()->method_counters();
359 for (int i = 0; i < CompLevel_count - 1; i++) {
360 CompileTrainingData* ctd = _last_toplevel_compiles[i];
361 if (ctd != nullptr) {
362 ctd->prepare(visitor);
363 }
364 }
365 }
366
367 void CompileTrainingData::prepare(Visitor& visitor) {
368 if (visitor.is_visited(this)) {
369 return;
370 }
371 visitor.visit(this);
372 method()->prepare(visitor);
373 _init_deps.prepare();
374 _ci_records.prepare();
375 }
376
377 KlassTrainingData* KlassTrainingData::make(InstanceKlass* holder, bool null_if_not_found) {
378 Key key(holder);
379 TrainingData* td = CDS_ONLY(have_data() ? lookup_archived_training_data(&key) :) nullptr;
380 KlassTrainingData* ktd = nullptr;
381 if (td != nullptr) {
382 ktd = td->as_KlassTrainingData();
383 guarantee(!ktd->has_holder() || ktd->holder() == holder, "");
384 if (ktd->has_holder()) {
385 return ktd;
386 } else {
387 ktd = nullptr;
388 }
389 }
390 if (need_data()) {
391 TrainingDataLocker l;
392 td = training_data_set()->find(&key);
393 if (td == nullptr) {
394 if (null_if_not_found) {
395 return nullptr;
396 }
397 ktd = KlassTrainingData::allocate(holder);
398 if (ktd == nullptr) {
399 return nullptr; // allocation failure
446 OopHandle handle(Universe::vm_global(), klass->java_mirror());
447 _holder = klass;
448 assert(holder() == klass, "");
449 }
450
451 void KlassTrainingData::notice_fully_initialized() {
452 ResourceMark rm;
453 assert(has_holder(), "");
454 assert(holder()->is_initialized(), "wrong state: %s %s",
455 holder()->name()->as_C_string(), holder()->init_state_name());
456
457 TrainingDataLocker l; // Not a real lock if we don't collect the data,
458 // that's why we need the atomic decrement below.
459 for (int i = 0; i < comp_dep_count(); i++) {
460 comp_dep(i)->dec_init_deps_left_release(this);
461 }
462 holder()->set_has_init_deps_processed();
463 }
464
465 void TrainingData::init_dumptime_table(TRAPS) {
466 precond((!assembling_data() && !need_data()) || need_data() != assembling_data());
467 if (assembling_data()) {
468 _dumptime_training_data_dictionary = new DumptimeTrainingDataDictionary();
469 _archived_training_data_dictionary.iterate_all([&](TrainingData* record) {
470 _dumptime_training_data_dictionary->append(record);
471 });
472 }
473 if (need_data()) {
474 _dumptime_training_data_dictionary = new DumptimeTrainingDataDictionary();
475 TrainingDataLocker l;
476 TrainingDataLocker::snapshot();
477 ResourceMark rm;
478 Visitor visitor(training_data_set()->size());
479 training_data_set()->iterate([&](TrainingData* td) {
480 td->prepare(visitor);
481 if (!td->is_CompileTrainingData()) {
482 _dumptime_training_data_dictionary->append(td);
483 }
484 });
485 }
486
487 if (AOTVerifyTrainingData) {
488 TrainingData::verify();
489 }
490 }
491
492 void TrainingData::iterate_roots(MetaspaceClosure* it) {
493 if (_dumptime_training_data_dictionary != nullptr) {
494 for (int i = 0; i < _dumptime_training_data_dictionary->length(); i++) {
495 _dumptime_training_data_dictionary->at(i).metaspace_pointers_do(it);
496 }
497 }
498 }
499
500 void TrainingData::dump_training_data() {
501 if (_dumptime_training_data_dictionary != nullptr) {
502 CompactHashtableStats stats;
503 _archived_training_data_dictionary_for_dumping.reset();
504 CompactHashtableWriter writer(_dumptime_training_data_dictionary->length(), &stats);
505 for (int i = 0; i < _dumptime_training_data_dictionary->length(); i++) {
506 TrainingData* td = _dumptime_training_data_dictionary->at(i).training_data();
507 #ifdef ASSERT
508 for (int j = i+1; j < _dumptime_training_data_dictionary->length(); j++) {
509 TrainingData* td1 = _dumptime_training_data_dictionary->at(j).training_data();
510 assert(!TrainingData::Key::equals(td1, td->key(), -1), "conflict");
511 }
512 #endif // ASSERT
513 td = ArchiveBuilder::current()->get_buffered_addr(td);
514 uint hash = TrainingData::Key::cds_hash(td->key());
515 u4 delta = ArchiveBuilder::current()->buffer_to_offset_u4((address)td);
516 writer.add(hash, delta);
517 }
524 ResourceMark rm;
525 Visitor visitor(_dumptime_training_data_dictionary->length());
526 for (int i = 0; i < _dumptime_training_data_dictionary->length(); i++) {
527 TrainingData* td = _dumptime_training_data_dictionary->at(i).training_data();
528 td->cleanup(visitor);
529 }
530 // Throw away all elements with empty keys
531 int j = 0;
532 for (int i = 0; i < _dumptime_training_data_dictionary->length(); i++) {
533 TrainingData* td = _dumptime_training_data_dictionary->at(i).training_data();
534 if (td->key()->is_empty()) {
535 continue;
536 }
537 if (i != j) { // no need to copy if it's the same
538 _dumptime_training_data_dictionary->at_put(j, td);
539 }
540 j++;
541 }
542 _dumptime_training_data_dictionary->trunc_to(j);
543 }
544 }
545
546 void KlassTrainingData::cleanup(Visitor& visitor) {
547 if (visitor.is_visited(this)) {
548 return;
549 }
550 visitor.visit(this);
551 if (has_holder()) {
552 bool is_excluded = !holder()->is_loaded();
553 if (CDSConfig::is_at_aot_safepoint()) {
554 // Check for AOT exclusion only at AOT safe point.
555 is_excluded |= SystemDictionaryShared::should_be_excluded(holder());
556 }
557 if (is_excluded) {
558 ResourceMark rm;
559 log_debug(aot, training)("Cleanup KTD %s", name()->as_klass_external_name());
560 _holder = nullptr;
561 key()->make_empty();
562 }
563 }
637 tty->cr();
638 }
639 guarantee(invariant, "init deps invariant violation: %d >= %d", init_deps_left1, init_deps_left2);
640 }
641 }
642
643 void CompileTrainingData::cleanup(Visitor& visitor) {
644 if (visitor.is_visited(this)) {
645 return;
646 }
647 visitor.visit(this);
648 method()->cleanup(visitor);
649 }
650
651 void TrainingData::serialize(SerializeClosure* soc) {
652 if (soc->writing()) {
653 _archived_training_data_dictionary_for_dumping.serialize_header(soc);
654 } else {
655 _archived_training_data_dictionary.serialize_header(soc);
656 }
657 }
658
659 class TrainingDataPrinter : StackObj {
660 outputStream* _st;
661 int _index;
662 public:
663 TrainingDataPrinter(outputStream* st) : _st(st), _index(0) {}
664 void do_value(TrainingData* td) {
665 const char* type = (td->is_KlassTrainingData() ? "K" :
666 td->is_MethodTrainingData() ? "M" :
667 td->is_CompileTrainingData() ? "C" : "?");
668 _st->print("%4d: %p %s ", _index++, td, type);
669 td->print_on(_st);
670 _st->cr();
671 if (td->is_KlassTrainingData()) {
672 td->as_KlassTrainingData()->iterate_comp_deps([&](CompileTrainingData* ctd) {
673 ResourceMark rm;
674 _st->print_raw(" C ");
675 ctd->print_on(_st);
676 _st->cr();
677 });
678 } else if (td->is_MethodTrainingData()) {
679 td->as_MethodTrainingData()->iterate_compiles([&](CompileTrainingData* ctd) {
680 ResourceMark rm;
681 _st->print_raw(" C ");
682 ctd->print_on(_st);
683 _st->cr();
684 });
685 } else if (td->is_CompileTrainingData()) {
686 // ?
687 }
688 }
689 };
690
691 void TrainingData::print_archived_training_data_on(outputStream* st) {
692 st->print_cr("Archived TrainingData Dictionary");
693 TrainingDataPrinter tdp(st);
694 TrainingDataLocker::initialize();
695 _archived_training_data_dictionary.iterate_all(&tdp);
696 }
697
698 void TrainingData::Key::metaspace_pointers_do(MetaspaceClosure *iter) {
699 iter->push(const_cast<Metadata**>(&_meta));
700 }
701
702 void TrainingData::metaspace_pointers_do(MetaspaceClosure* iter) {
703 _key.metaspace_pointers_do(iter);
704 }
705
706 bool TrainingData::Key::can_compute_cds_hash(const Key* const& k) {
707 return k->meta() == nullptr || MetaspaceObj::in_aot_cache(k->meta());
708 }
709
710 uint TrainingData::Key::cds_hash(const Key* const& k) {
711 return SystemDictionaryShared::hash_for_shared_dictionary((address)k->meta());
712 }
713
714 TrainingData* TrainingData::lookup_archived_training_data(const Key* k) {
715 // For this to work, all components of the key must be in shared metaspace.
716 if (!TrainingData::Key::can_compute_cds_hash(k) || _archived_training_data_dictionary.empty()) {
717 return nullptr;
718 }
719 uint hash = TrainingData::Key::cds_hash(k);
720 TrainingData* td = _archived_training_data_dictionary.lookup(k, hash, -1 /*unused*/);
721 if (td != nullptr) {
722 if ((td->is_KlassTrainingData() && td->as_KlassTrainingData()->has_holder()) ||
723 (td->is_MethodTrainingData() && td->as_MethodTrainingData()->has_holder())) {
724 return td;
725 } else {
726 ShouldNotReachHere();
727 }
728 }
729 return nullptr;
730 }
731
732 template <typename T>
733 void TrainingData::DepList<T>::metaspace_pointers_do(MetaspaceClosure* iter) {
734 iter->push(&_deps);
752 iter->push(&_final_profile);
753 iter->push(&_final_counters);
754 }
755
756 void CompileTrainingData::metaspace_pointers_do(MetaspaceClosure* iter) {
757 log_trace(aot, training)("Iter(CompileTrainingData): %p", this);
758 TrainingData::metaspace_pointers_do(iter);
759 _init_deps.metaspace_pointers_do(iter);
760 _ci_records.metaspace_pointers_do(iter);
761 iter->push(&_method);
762 }
763
764 template <typename T>
765 void TrainingData::DepList<T>::prepare() {
766 if (_deps == nullptr && _deps_dyn != nullptr) {
767 int len = _deps_dyn->length();
768 _deps = MetadataFactory::new_array_from_c_heap<T>(len, mtClassShared);
769 for (int i = 0; i < len; i++) {
770 _deps->at_put(i, _deps_dyn->at(i)); // copy
771 }
772 }
773 }
774
775 void KlassTrainingData::remove_unshareable_info() {
776 TrainingData::remove_unshareable_info();
777 _comp_deps.remove_unshareable_info();
778 }
779
780 void MethodTrainingData::remove_unshareable_info() {
781 TrainingData::remove_unshareable_info();
782 if (_final_counters != nullptr) {
783 _final_counters->remove_unshareable_info();
784 }
785 if (_final_profile != nullptr) {
786 _final_profile->remove_unshareable_info();
787 }
788 }
789
790 void CompileTrainingData::remove_unshareable_info() {
791 TrainingData::remove_unshareable_info();
|
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "cds/cdsConfig.hpp"
26 #include "ci/ciEnv.hpp"
27 #include "ci/ciMetadata.hpp"
28 #include "classfile/compactHashtable.hpp"
29 #include "classfile/javaClasses.hpp"
30 #include "classfile/symbolTable.hpp"
31 #include "classfile/systemDictionaryShared.hpp"
32 #include "compiler/compileTask.hpp"
33 #include "memory/metadataFactory.hpp"
34 #include "memory/metaspaceClosure.hpp"
35 #include "memory/resourceArea.hpp"
36 #include "memory/universe.hpp"
37 #include "oops/method.hpp"
38 #include "oops/method.inline.hpp"
39 #include "oops/methodCounters.hpp"
40 #include "oops/recompilationSchedule.hpp"
41 #include "oops/trainingData.hpp"
42 #include "runtime/arguments.hpp"
43 #include "runtime/javaThread.inline.hpp"
44 #include "runtime/jniHandles.inline.hpp"
45 #include "utilities/growableArray.hpp"
46
47 TrainingData::TrainingDataSet TrainingData::_training_data_set(1024, 0x3fffffff);
48 TrainingData::TrainingDataDictionary TrainingData::_archived_training_data_dictionary;
49 TrainingData::TrainingDataDictionary TrainingData::_archived_training_data_dictionary_for_dumping;
50 TrainingData::DumptimeTrainingDataDictionary* TrainingData::_dumptime_training_data_dictionary = nullptr;
51 int TrainingData::TrainingDataLocker::_lock_mode;
52 volatile bool TrainingData::TrainingDataLocker::_snapshot = false;
53
54 MethodTrainingData::MethodTrainingData() {
55 // Used by cppVtables.cpp only
56 assert(CDSConfig::is_dumping_static_archive() || UseSharedSpaces, "only for CDS");
57 }
58
59 KlassTrainingData::KlassTrainingData() {
60 // Used by cppVtables.cpp only
61 assert(CDSConfig::is_dumping_static_archive() || UseSharedSpaces, "only for CDS");
62 }
63
64 CompileTrainingData::CompileTrainingData() : _level(-1), _compile_id(-1) {
65 // Used by cppVtables.cpp only
66 assert(CDSConfig::is_dumping_static_archive() || UseSharedSpaces, "only for CDS");
67 }
68
69 void TrainingData::initialize() {
70 // this is a nop if training modes are not enabled
71 if (have_data() || need_data()) {
72 TrainingDataLocker::initialize();
73 }
74 RecompilationSchedule::initialize();
75 if (have_data() && need_data()) {
76 TrainingDataLocker l;
77 archived_training_data_dictionary()->iterate_all([&](TrainingData* td) {
78 training_data_set()->install(td);
79 });
80 }
81 }
82
83 static void verify_archived_entry(TrainingData* td, const TrainingData::Key* k) {
84 guarantee(TrainingData::Key::can_compute_cds_hash(k), "");
85 TrainingData* td1 = TrainingData::lookup_archived_training_data(k);
86 guarantee(td == td1, "");
87 }
88
89 void TrainingData::verify() {
90 if (have_data() && !need_data() && !assembling_data()) {
91 archived_training_data_dictionary()->iterate_all([&](TrainingData* td) {
92 if (td->is_KlassTrainingData()) {
93 KlassTrainingData* ktd = td->as_KlassTrainingData();
94 if (ktd->has_holder() && ktd->holder()->is_loaded()) {
95 Key k(ktd->holder());
96 verify_archived_entry(td, &k);
97 }
98 ktd->verify();
99 } else if (td->is_MethodTrainingData()) {
100 MethodTrainingData* mtd = td->as_MethodTrainingData();
101 if (mtd->has_holder() && mtd->holder()->method_holder()->is_loaded()) {
102 Key k(mtd->holder());
103 verify_archived_entry(td, &k);
104 }
105 mtd->verify(/*verify_dep_counter*/true);
106 }
107 });
108 }
109 if (need_data()) {
110 TrainingDataLocker l;
111 training_data_set()->iterate([&](TrainingData* td) {
112 if (td->is_KlassTrainingData()) {
113 KlassTrainingData* ktd = td->as_KlassTrainingData();
114 ktd->verify();
115 } else if (td->is_MethodTrainingData()) {
116 MethodTrainingData* mtd = td->as_MethodTrainingData();
117 // During the training run init deps tracking is not setup yet,
118 // don't verify it.
119 mtd->verify(/*verify_dep_counter*/false);
120 }
121 });
122 }
123 }
124
125 MethodTrainingData* MethodTrainingData::make(const methodHandle& method, bool null_if_not_found, bool use_cache) {
126 MethodTrainingData* mtd = nullptr;
127 if (!have_data() && !need_data()) {
128 return mtd;
129 }
137 // i.e. null_if_no_found == true, then just return a null.
138 // 3. Cache value is not null.
139 // Return it, the value of training_data_lookup_failed doesn't matter.
140 MethodCounters* mcs = method->method_counters();
141 if (mcs != nullptr) {
142 mtd = mcs->method_training_data();
143 if (mtd != nullptr && mtd != mcs->method_training_data_sentinel()) {
144 return mtd;
145 }
146 if (null_if_not_found && mtd == nullptr) {
147 assert(mtd == nullptr, "No training data found");
148 return nullptr;
149 }
150 } else if (use_cache) {
151 mcs = Method::build_method_counters(Thread::current(), method());
152 }
153
154 TrainingData* td = nullptr;
155
156 Key key(method());
157 if (have_data() && !need_data()) {
158 td = lookup_archived_training_data(&key);
159 if (td != nullptr) {
160 mtd = td->as_MethodTrainingData();
161 } else {
162 mtd = nullptr;
163 }
164 // Cache the pointer to MTD in MethodCounters for faster lookup (could be null if not found)
165 method->init_training_data(mtd);
166 }
167
168 if (need_data()) {
169 TrainingDataLocker l;
170 td = training_data_set()->find(&key);
171 if (td == nullptr) {
172 if (!null_if_not_found) {
173 KlassTrainingData* ktd = KlassTrainingData::make(method->method_holder());
174 if (ktd == nullptr) {
175 return nullptr; // allocation failure
176 }
177 mtd = MethodTrainingData::allocate(method(), ktd);
297 for (int i = 0, len = _init_deps.length(); i < len; i++) {
298 st->print(" dep:");
299 _init_deps.at(i)->print_on(st, true);
300 }
301 }
302 }
303
304 void CompileTrainingData::notice_inlined_method(CompileTask* task,
305 const methodHandle& method) {
306 MethodTrainingData* mtd = MethodTrainingData::make(method);
307 if (mtd != nullptr) {
308 mtd->notice_compilation(task->comp_level(), true);
309 }
310 }
311
312 void CompileTrainingData::notice_jit_observation(ciEnv* env, ciBaseObject* what) {
313 // A JIT is starting to look at class k.
314 // We could follow the queries that it is making, but it is
315 // simpler to assume, conservatively, that the JIT will
316 // eventually depend on the initialization state of k.
317 ciMetadata* md = nullptr;
318 if (what->is_object()) {
319 md = what->as_object()->klass();
320 } else if (what->is_metadata()) {
321 md = what->as_metadata();
322 }
323 if (md != nullptr && md->is_loaded() && md->is_instance_klass()) {
324 ciInstanceKlass* cik = md->as_instance_klass();
325 if (!cik->is_initialized()) {
326 return;
327 }
328 KlassTrainingData* ktd = KlassTrainingData::make(cik->get_instanceKlass());
329 if (ktd == nullptr) {
330 // Allocation failure or snapshot in progress
331 return;
332 }
333 // This JIT task is (probably) requesting that ik be initialized,
334 // so add it to my _init_deps list.
335 TrainingDataLocker l;
336 if (l.can_add()) {
337 add_init_dep(ktd);
338 }
339 }
340 }
341
342 void KlassTrainingData::prepare(Visitor& visitor) {
343 if (visitor.is_visited(this)) {
344 return;
345 }
346 visitor.visit(this);
347 _comp_deps.prepare();
348 }
349
350 void MethodTrainingData::prepare(Visitor& visitor) {
351 if (visitor.is_visited(this)) {
352 return;
353 }
354 visitor.visit(this);
355 klass()->prepare(visitor);
356 if (has_holder()) {
357 _final_counters = holder()->method_counters();
363 for (int i = 0; i < CompLevel_count - 1; i++) {
364 CompileTrainingData* ctd = _last_toplevel_compiles[i];
365 if (ctd != nullptr) {
366 ctd->prepare(visitor);
367 }
368 }
369 }
370
371 void CompileTrainingData::prepare(Visitor& visitor) {
372 if (visitor.is_visited(this)) {
373 return;
374 }
375 visitor.visit(this);
376 method()->prepare(visitor);
377 _init_deps.prepare();
378 _ci_records.prepare();
379 }
380
381 KlassTrainingData* KlassTrainingData::make(InstanceKlass* holder, bool null_if_not_found) {
382 Key key(holder);
383 TrainingData* td = CDS_ONLY((have_data() && !need_data()) ? lookup_archived_training_data(&key) :) nullptr;
384 KlassTrainingData* ktd = nullptr;
385 if (td != nullptr) {
386 ktd = td->as_KlassTrainingData();
387 guarantee(!ktd->has_holder() || ktd->holder() == holder, "");
388 if (ktd->has_holder()) {
389 return ktd;
390 } else {
391 ktd = nullptr;
392 }
393 }
394 if (need_data()) {
395 TrainingDataLocker l;
396 td = training_data_set()->find(&key);
397 if (td == nullptr) {
398 if (null_if_not_found) {
399 return nullptr;
400 }
401 ktd = KlassTrainingData::allocate(holder);
402 if (ktd == nullptr) {
403 return nullptr; // allocation failure
450 OopHandle handle(Universe::vm_global(), klass->java_mirror());
451 _holder = klass;
452 assert(holder() == klass, "");
453 }
454
455 void KlassTrainingData::notice_fully_initialized() {
456 ResourceMark rm;
457 assert(has_holder(), "");
458 assert(holder()->is_initialized(), "wrong state: %s %s",
459 holder()->name()->as_C_string(), holder()->init_state_name());
460
461 TrainingDataLocker l; // Not a real lock if we don't collect the data,
462 // that's why we need the atomic decrement below.
463 for (int i = 0; i < comp_dep_count(); i++) {
464 comp_dep(i)->dec_init_deps_left_release(this);
465 }
466 holder()->set_has_init_deps_processed();
467 }
468
469 void TrainingData::init_dumptime_table(TRAPS) {
470 if (assembling_data() && !need_data()) {
471 _dumptime_training_data_dictionary = new DumptimeTrainingDataDictionary();
472 _archived_training_data_dictionary.iterate_all([&](TrainingData* record) {
473 _dumptime_training_data_dictionary->append(record);
474 });
475 }
476 if (need_data()) {
477 _dumptime_training_data_dictionary = new DumptimeTrainingDataDictionary();
478 TrainingDataLocker l;
479 TrainingDataLocker::snapshot();
480 ResourceMark rm;
481 Visitor visitor(training_data_set()->size());
482 training_data_set()->iterate([&](TrainingData* td) {
483 td->prepare(visitor);
484 if (!td->is_CompileTrainingData()) {
485 _dumptime_training_data_dictionary->append(td);
486 }
487 });
488 }
489
490 RecompilationSchedule::prepare(CHECK);
491
492 if (AOTVerifyTrainingData) {
493 TrainingData::verify();
494 }
495 }
496
497 void TrainingData::iterate_roots(MetaspaceClosure* it) {
498 if (_dumptime_training_data_dictionary != nullptr) {
499 for (int i = 0; i < _dumptime_training_data_dictionary->length(); i++) {
500 _dumptime_training_data_dictionary->at(i).metaspace_pointers_do(it);
501 }
502 }
503 RecompilationSchedule::iterate_roots(it);
504 }
505
506 void TrainingData::dump_training_data() {
507 if (_dumptime_training_data_dictionary != nullptr) {
508 CompactHashtableStats stats;
509 _archived_training_data_dictionary_for_dumping.reset();
510 CompactHashtableWriter writer(_dumptime_training_data_dictionary->length(), &stats);
511 for (int i = 0; i < _dumptime_training_data_dictionary->length(); i++) {
512 TrainingData* td = _dumptime_training_data_dictionary->at(i).training_data();
513 #ifdef ASSERT
514 for (int j = i+1; j < _dumptime_training_data_dictionary->length(); j++) {
515 TrainingData* td1 = _dumptime_training_data_dictionary->at(j).training_data();
516 assert(!TrainingData::Key::equals(td1, td->key(), -1), "conflict");
517 }
518 #endif // ASSERT
519 td = ArchiveBuilder::current()->get_buffered_addr(td);
520 uint hash = TrainingData::Key::cds_hash(td->key());
521 u4 delta = ArchiveBuilder::current()->buffer_to_offset_u4((address)td);
522 writer.add(hash, delta);
523 }
530 ResourceMark rm;
531 Visitor visitor(_dumptime_training_data_dictionary->length());
532 for (int i = 0; i < _dumptime_training_data_dictionary->length(); i++) {
533 TrainingData* td = _dumptime_training_data_dictionary->at(i).training_data();
534 td->cleanup(visitor);
535 }
536 // Throw away all elements with empty keys
537 int j = 0;
538 for (int i = 0; i < _dumptime_training_data_dictionary->length(); i++) {
539 TrainingData* td = _dumptime_training_data_dictionary->at(i).training_data();
540 if (td->key()->is_empty()) {
541 continue;
542 }
543 if (i != j) { // no need to copy if it's the same
544 _dumptime_training_data_dictionary->at_put(j, td);
545 }
546 j++;
547 }
548 _dumptime_training_data_dictionary->trunc_to(j);
549 }
550 RecompilationSchedule::cleanup();
551 }
552
553 void KlassTrainingData::cleanup(Visitor& visitor) {
554 if (visitor.is_visited(this)) {
555 return;
556 }
557 visitor.visit(this);
558 if (has_holder()) {
559 bool is_excluded = !holder()->is_loaded();
560 if (CDSConfig::is_at_aot_safepoint()) {
561 // Check for AOT exclusion only at AOT safe point.
562 is_excluded |= SystemDictionaryShared::should_be_excluded(holder());
563 }
564 if (is_excluded) {
565 ResourceMark rm;
566 log_debug(aot, training)("Cleanup KTD %s", name()->as_klass_external_name());
567 _holder = nullptr;
568 key()->make_empty();
569 }
570 }
644 tty->cr();
645 }
646 guarantee(invariant, "init deps invariant violation: %d >= %d", init_deps_left1, init_deps_left2);
647 }
648 }
649
650 void CompileTrainingData::cleanup(Visitor& visitor) {
651 if (visitor.is_visited(this)) {
652 return;
653 }
654 visitor.visit(this);
655 method()->cleanup(visitor);
656 }
657
658 void TrainingData::serialize(SerializeClosure* soc) {
659 if (soc->writing()) {
660 _archived_training_data_dictionary_for_dumping.serialize_header(soc);
661 } else {
662 _archived_training_data_dictionary.serialize_header(soc);
663 }
664 RecompilationSchedule::serialize(soc);
665 }
666
667 class TrainingDataPrinter : StackObj {
668 outputStream* _st;
669 int _index;
670 public:
671 TrainingDataPrinter(outputStream* st) : _st(st), _index(0) {}
672 void do_value(TrainingData* td) {
673 const char* type = (td->is_KlassTrainingData() ? "K" :
674 td->is_MethodTrainingData() ? "M" :
675 td->is_CompileTrainingData() ? "C" : "?");
676 _st->print("%4d: %p %s ", _index++, td, type);
677 td->print_on(_st);
678 _st->cr();
679 if (td->is_KlassTrainingData()) {
680 td->as_KlassTrainingData()->iterate_comp_deps([&](CompileTrainingData* ctd) {
681 ResourceMark rm;
682 _st->print_raw(" C ");
683 ctd->print_on(_st);
684 _st->cr();
685 });
686 } else if (td->is_MethodTrainingData()) {
687 td->as_MethodTrainingData()->iterate_compiles([&](CompileTrainingData* ctd) {
688 ResourceMark rm;
689 _st->print_raw(" C ");
690 ctd->print_on(_st);
691 _st->cr();
692 });
693 } else if (td->is_CompileTrainingData()) {
694 // ?
695 }
696 }
697 };
698
699 void TrainingData::print_archived_training_data_on(outputStream* st) {
700 st->print_cr("Archived TrainingData Dictionary");
701 TrainingDataPrinter tdp(st);
702 TrainingDataLocker::initialize();
703 _archived_training_data_dictionary.iterate_all(&tdp);
704 RecompilationSchedule::print_archived_training_data_on(st);
705 }
706
707 void TrainingData::Key::metaspace_pointers_do(MetaspaceClosure *iter) {
708 iter->push(const_cast<Metadata**>(&_meta));
709 }
710
711 void TrainingData::metaspace_pointers_do(MetaspaceClosure* iter) {
712 _key.metaspace_pointers_do(iter);
713 }
714
715 bool TrainingData::Key::can_compute_cds_hash(const Key* const& k) {
716 return k->meta() == nullptr || MetaspaceObj::in_aot_cache(k->meta());
717 }
718
719 uint TrainingData::Key::cds_hash(const Key* const& k) {
720 return SystemDictionaryShared::hash_for_shared_dictionary((address)k->meta());
721 }
722
723 TrainingData* TrainingData::lookup_archived_training_data(const Key* k) {
724 assert(!need_data(), "Should be used only in read-only mode");
725 // For this to work, all components of the key must be in shared metaspace.
726 if (!TrainingData::Key::can_compute_cds_hash(k) || _archived_training_data_dictionary.empty()) {
727 return nullptr;
728 }
729 uint hash = TrainingData::Key::cds_hash(k);
730 TrainingData* td = _archived_training_data_dictionary.lookup(k, hash, -1 /*unused*/);
731 if (td != nullptr) {
732 if ((td->is_KlassTrainingData() && td->as_KlassTrainingData()->has_holder()) ||
733 (td->is_MethodTrainingData() && td->as_MethodTrainingData()->has_holder())) {
734 return td;
735 } else {
736 ShouldNotReachHere();
737 }
738 }
739 return nullptr;
740 }
741
742 template <typename T>
743 void TrainingData::DepList<T>::metaspace_pointers_do(MetaspaceClosure* iter) {
744 iter->push(&_deps);
762 iter->push(&_final_profile);
763 iter->push(&_final_counters);
764 }
765
766 void CompileTrainingData::metaspace_pointers_do(MetaspaceClosure* iter) {
767 log_trace(aot, training)("Iter(CompileTrainingData): %p", this);
768 TrainingData::metaspace_pointers_do(iter);
769 _init_deps.metaspace_pointers_do(iter);
770 _ci_records.metaspace_pointers_do(iter);
771 iter->push(&_method);
772 }
773
774 template <typename T>
775 void TrainingData::DepList<T>::prepare() {
776 if (_deps == nullptr && _deps_dyn != nullptr) {
777 int len = _deps_dyn->length();
778 _deps = MetadataFactory::new_array_from_c_heap<T>(len, mtClassShared);
779 for (int i = 0; i < len; i++) {
780 _deps->at_put(i, _deps_dyn->at(i)); // copy
781 }
782 _deps_dyn = nullptr;
783 }
784 }
785
786 void KlassTrainingData::remove_unshareable_info() {
787 TrainingData::remove_unshareable_info();
788 _comp_deps.remove_unshareable_info();
789 }
790
791 void MethodTrainingData::remove_unshareable_info() {
792 TrainingData::remove_unshareable_info();
793 if (_final_counters != nullptr) {
794 _final_counters->remove_unshareable_info();
795 }
796 if (_final_profile != nullptr) {
797 _final_profile->remove_unshareable_info();
798 }
799 }
800
801 void CompileTrainingData::remove_unshareable_info() {
802 TrainingData::remove_unshareable_info();
|