1 /*
   2  * Copyright (c) 2010, 2015, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "compiler/compileBroker.hpp"
  27 #include "memory/resourceArea.hpp"
  28 #include "runtime/arguments.hpp"
  29 #include "runtime/simpleThresholdPolicy.hpp"
  30 #include "runtime/simpleThresholdPolicy.inline.hpp"
  31 #include "code/scopeDesc.hpp"
  32 
  33 
  34 void SimpleThresholdPolicy::print_counters(const char* prefix, methodHandle mh) {
  35   int invocation_count = mh->invocation_count();
  36   int backedge_count = mh->backedge_count();
  37   MethodData* mdh = mh->method_data();
  38   int mdo_invocations = 0, mdo_backedges = 0;
  39   int mdo_invocations_start = 0, mdo_backedges_start = 0;
  40   if (mdh != NULL) {
  41     mdo_invocations = mdh->invocation_count();
  42     mdo_backedges = mdh->backedge_count();
  43     mdo_invocations_start = mdh->invocation_count_start();
  44     mdo_backedges_start = mdh->backedge_count_start();
  45   }
  46   tty->print(" %stotal=%d,%d %smdo=%d(%d),%d(%d)", prefix,
  47       invocation_count, backedge_count, prefix,
  48       mdo_invocations, mdo_invocations_start,
  49       mdo_backedges, mdo_backedges_start);
  50   tty->print(" %smax levels=%d,%d", prefix,
  51       mh->highest_comp_level(), mh->highest_osr_comp_level());
  52 }
  53 
  54 // Print an event.
  55 void SimpleThresholdPolicy::print_event(EventType type, methodHandle mh, methodHandle imh,
  56                                         int bci, CompLevel level) {
  57   bool inlinee_event = mh() != imh();
  58 
  59   ttyLocker tty_lock;
  60   tty->print("%lf: [", os::elapsedTime());
  61 
  62   switch(type) {
  63   case CALL:
  64     tty->print("call");
  65     break;
  66   case LOOP:
  67     tty->print("loop");
  68     break;
  69   case COMPILE:
  70     tty->print("compile");
  71     break;
  72   case REMOVE_FROM_QUEUE:
  73     tty->print("remove-from-queue");
  74     break;
  75   case UPDATE_IN_QUEUE:
  76     tty->print("update-in-queue");
  77     break;
  78   case REPROFILE:
  79     tty->print("reprofile");
  80     break;
  81   case MAKE_NOT_ENTRANT:
  82     tty->print("make-not-entrant");
  83     break;
  84   default:
  85     tty->print("unknown");
  86   }
  87 
  88   tty->print(" level=%d ", level);
  89 
  90   ResourceMark rm;
  91   char *method_name = mh->name_and_sig_as_C_string();
  92   tty->print("[%s", method_name);
  93   if (inlinee_event) {
  94     char *inlinee_name = imh->name_and_sig_as_C_string();
  95     tty->print(" [%s]] ", inlinee_name);
  96   }
  97   else tty->print("] ");
  98   tty->print("@%d queues=%d,%d", bci, CompileBroker::queue_size(CompLevel_full_profile),
  99                                       CompileBroker::queue_size(CompLevel_full_optimization));
 100 
 101   print_specific(type, mh, imh, bci, level);
 102 
 103   if (type != COMPILE) {
 104     print_counters("", mh);
 105     if (inlinee_event) {
 106       print_counters("inlinee ", imh);
 107     }
 108     tty->print(" compilable=");
 109     bool need_comma = false;
 110     if (!mh->is_not_compilable(CompLevel_full_profile)) {
 111       tty->print("c1");
 112       need_comma = true;
 113     }
 114     if (!mh->is_not_osr_compilable(CompLevel_full_profile)) {
 115       if (need_comma) tty->print(",");
 116       tty->print("c1-osr");
 117       need_comma = true;
 118     }
 119     if (!mh->is_not_compilable(CompLevel_full_optimization)) {
 120       if (need_comma) tty->print(",");
 121       tty->print("c2");
 122       need_comma = true;
 123     }
 124     if (!mh->is_not_osr_compilable(CompLevel_full_optimization)) {
 125       if (need_comma) tty->print(",");
 126       tty->print("c2-osr");
 127     }
 128     tty->print(" status=");
 129     if (mh->queued_for_compilation()) {
 130       tty->print("in-queue");
 131     } else tty->print("idle");
 132   }
 133   tty->print_cr("]");
 134 }
 135 
 136 void SimpleThresholdPolicy::initialize() {
 137   if (FLAG_IS_DEFAULT(CICompilerCount)) {
 138     FLAG_SET_DEFAULT(CICompilerCount, 3);
 139   }
 140   int count = CICompilerCount;
 141 #ifdef _LP64
 142   // On 64-bit systems, scale the number of compiler threads with
 143   // the number of cores available on the system. Scaling is not
 144   // performed on 32-bit systems because it can lead to exhaustion
 145   // of the virtual memory address space available to the JVM.
 146   if (CICompilerCountPerCPU) {
 147     count = MAX2(log2_intptr(os::active_processor_count()), 1) * 3 / 2;
 148   }
 149 #endif
 150   set_c1_count(MAX2(count / 3, 1));
 151   set_c2_count(MAX2(count - c1_count(), 1));
 152   FLAG_SET_ERGO(intx, CICompilerCount, c1_count() + c2_count());
 153 }
 154 
 155 void SimpleThresholdPolicy::set_carry_if_necessary(InvocationCounter *counter) {
 156   if (!counter->carry() && counter->count() > InvocationCounter::count_limit / 2) {
 157     counter->set_carry_flag();
 158   }
 159 }
 160 
 161 // Set carry flags on the counters if necessary
 162 void SimpleThresholdPolicy::handle_counter_overflow(Method* method) {
 163   MethodCounters *mcs = method->method_counters();
 164   if (mcs != NULL) {
 165     set_carry_if_necessary(mcs->invocation_counter());
 166     set_carry_if_necessary(mcs->backedge_counter());
 167   }
 168   MethodData* mdo = method->method_data();
 169   if (mdo != NULL) {
 170     set_carry_if_necessary(mdo->invocation_counter());
 171     set_carry_if_necessary(mdo->backedge_counter());
 172   }
 173 }
 174 
 175 // Called with the queue locked and with at least one element
 176 CompileTask* SimpleThresholdPolicy::select_task(CompileQueue* compile_queue) {
 177   return select_task_helper(compile_queue);
 178 }
 179 
 180 void SimpleThresholdPolicy::reprofile(ScopeDesc* trap_scope, bool is_osr) {
 181   for (ScopeDesc* sd = trap_scope;; sd = sd->sender()) {
 182     if (PrintTieredEvents) {
 183       methodHandle mh(sd->method());
 184       print_event(REPROFILE, mh, mh, InvocationEntryBci, CompLevel_none);
 185     }
 186     MethodData* mdo = sd->method()->method_data();
 187     if (mdo != NULL) {
 188       mdo->reset_start_counters();
 189     }
 190     if (sd->is_top()) break;
 191   }
 192 }
 193 
 194 nmethod* SimpleThresholdPolicy::event(const methodHandle& method, const methodHandle& inlinee,
 195                                       int branch_bci, int bci, CompLevel comp_level, nmethod* nm, JavaThread* thread) {
 196   if (comp_level == CompLevel_none &&
 197       JvmtiExport::can_post_interpreter_events() &&
 198       thread->is_interp_only_mode()) {
 199     return NULL;
 200   }
 201   if (CompileTheWorld || ReplayCompiles) {
 202     // Don't trigger other compiles in testing mode
 203     return NULL;
 204   }
 205 
 206   handle_counter_overflow(method());
 207   if (method() != inlinee()) {
 208     handle_counter_overflow(inlinee());
 209   }
 210 
 211   if (PrintTieredEvents) {
 212     print_event(bci == InvocationEntryBci ? CALL : LOOP, method, inlinee, bci, comp_level);
 213   }
 214 
 215   if (bci == InvocationEntryBci) {
 216     method_invocation_event(method, inlinee, comp_level, nm, thread);
 217   } else {
 218     // method == inlinee if the event originated in the main method
 219     method_back_branch_event(method, inlinee, bci, comp_level, nm, thread);
 220     // Check if event led to a higher level OSR compilation
 221     nmethod* osr_nm = inlinee->lookup_osr_nmethod_for(bci, comp_level, false);
 222     if (osr_nm != NULL && osr_nm->comp_level() > comp_level) {
 223       // Perform OSR with new nmethod
 224       return osr_nm;
 225     }
 226   }
 227   return NULL;
 228 }
 229 
 230 // Check if the method can be compiled, change level if necessary
 231 void SimpleThresholdPolicy::compile(const methodHandle& mh, int bci, CompLevel level, JavaThread* thread) {
 232   assert(level <= TieredStopAtLevel, "Invalid compilation level");
 233   if (level == CompLevel_none) {
 234     return;
 235   }
 236 
 237 #if INCLUDE_JVMCI
 238   // We can't compile with a JVMCI compiler until the module system is initialized.
 239   if (level == CompLevel_full_optimization && UseJVMCICompiler && !Universe::is_module_initialized()) {
 240     return;
 241   }
 242 #endif
 243 
 244   // Check if the method can be compiled. If it cannot be compiled with C1, continue profiling
 245   // in the interpreter and then compile with C2 (the transition function will request that,
 246   // see common() ). If the method cannot be compiled with C2 but still can with C1, compile it with
 247   // pure C1.
 248   if (!can_be_compiled(mh, level)) {
 249     if (level == CompLevel_full_optimization && can_be_compiled(mh, CompLevel_simple)) {
 250         compile(mh, bci, CompLevel_simple, thread);
 251     }
 252     return;
 253   }
 254   if (bci != InvocationEntryBci && mh->is_not_osr_compilable(level)) {
 255     return;
 256   }
 257   if (!CompileBroker::compilation_is_in_queue(mh)) {
 258     if (PrintTieredEvents) {
 259       print_event(COMPILE, mh, mh, bci, level);
 260     }
 261     submit_compile(mh, bci, level, thread);
 262   }
 263 }
 264 
 265 // Tell the broker to compile the method
 266 void SimpleThresholdPolicy::submit_compile(const methodHandle& mh, int bci, CompLevel level, JavaThread* thread) {
 267   int hot_count = (bci == InvocationEntryBci) ? mh->invocation_count() : mh->backedge_count();
 268   CompileBroker::compile_method(mh, bci, level, mh, hot_count, "tiered", thread);
 269 }
 270 
 271 // Call and loop predicates determine whether a transition to a higher
 272 // compilation level should be performed (pointers to predicate functions
 273 // are passed to common() transition function).
 274 bool SimpleThresholdPolicy::loop_predicate(int i, int b, CompLevel cur_level, Method* method) {
 275   switch(cur_level) {
 276   case CompLevel_none:
 277   case CompLevel_limited_profile: {
 278     return loop_predicate_helper<CompLevel_none>(i, b, 1.0, method);
 279   }
 280   case CompLevel_full_profile: {
 281     return loop_predicate_helper<CompLevel_full_profile>(i, b, 1.0, method);
 282   }
 283   default:
 284     return true;
 285   }
 286 }
 287 
 288 bool SimpleThresholdPolicy::call_predicate(int i, int b, CompLevel cur_level, Method* method) {
 289   switch(cur_level) {
 290   case CompLevel_none:
 291   case CompLevel_limited_profile: {
 292     return call_predicate_helper<CompLevel_none>(i, b, 1.0, method);
 293   }
 294   case CompLevel_full_profile: {
 295     return call_predicate_helper<CompLevel_full_profile>(i, b, 1.0, method);
 296   }
 297   default:
 298     return true;
 299   }
 300 }
 301 
 302 // Determine is a method is mature.
 303 bool SimpleThresholdPolicy::is_mature(Method* method) {
 304   if (is_trivial(method)) return true;
 305   MethodData* mdo = method->method_data();
 306   if (mdo != NULL) {
 307     int i = mdo->invocation_count();
 308     int b = mdo->backedge_count();
 309     double k = ProfileMaturityPercentage / 100.0;
 310     return call_predicate_helper<CompLevel_full_profile>(i, b, k, method) ||
 311            loop_predicate_helper<CompLevel_full_profile>(i, b, k, method);
 312   }
 313   return false;
 314 }
 315 
 316 // Common transition function. Given a predicate determines if a method should transition to another level.
 317 CompLevel SimpleThresholdPolicy::common(Predicate p, Method* method, CompLevel cur_level) {
 318   CompLevel next_level = cur_level;
 319   int i = method->invocation_count();
 320   int b = method->backedge_count();
 321 
 322   if (is_trivial(method)) {
 323     next_level = CompLevel_simple;
 324   } else {
 325     switch(cur_level) {
 326     case CompLevel_none:
 327       // If we were at full profile level, would we switch to full opt?
 328       if (common(p, method, CompLevel_full_profile) == CompLevel_full_optimization) {
 329         next_level = CompLevel_full_optimization;
 330       } else if ((this->*p)(i, b, cur_level, method)) {
 331         next_level = CompLevel_full_profile;
 332       }
 333       break;
 334     case CompLevel_limited_profile:
 335     case CompLevel_full_profile:
 336       {
 337         MethodData* mdo = method->method_data();
 338         if (mdo != NULL) {
 339           if (mdo->would_profile()) {
 340             int mdo_i = mdo->invocation_count_delta();
 341             int mdo_b = mdo->backedge_count_delta();
 342             if ((this->*p)(mdo_i, mdo_b, cur_level, method)) {
 343               next_level = CompLevel_full_optimization;
 344             }
 345           } else {
 346             next_level = CompLevel_full_optimization;
 347           }
 348         }
 349       }
 350       break;
 351     }
 352   }
 353   return MIN2(next_level, (CompLevel)TieredStopAtLevel);
 354 }
 355 
 356 // Determine if a method should be compiled with a normal entry point at a different level.
 357 CompLevel SimpleThresholdPolicy::call_event(Method* method,  CompLevel cur_level) {
 358   CompLevel osr_level = MIN2((CompLevel) method->highest_osr_comp_level(),
 359                              common(&SimpleThresholdPolicy::loop_predicate, method, cur_level));
 360   CompLevel next_level = common(&SimpleThresholdPolicy::call_predicate, method, cur_level);
 361 
 362   // If OSR method level is greater than the regular method level, the levels should be
 363   // equalized by raising the regular method level in order to avoid OSRs during each
 364   // invocation of the method.
 365   if (osr_level == CompLevel_full_optimization && cur_level == CompLevel_full_profile) {
 366     MethodData* mdo = method->method_data();
 367     guarantee(mdo != NULL, "MDO should not be NULL");
 368     if (mdo->invocation_count() >= 1) {
 369       next_level = CompLevel_full_optimization;
 370     }
 371   } else {
 372     next_level = MAX2(osr_level, next_level);
 373   }
 374 
 375   return next_level;
 376 }
 377 
 378 // Determine if we should do an OSR compilation of a given method.
 379 CompLevel SimpleThresholdPolicy::loop_event(Method* method, CompLevel cur_level) {
 380   CompLevel next_level = common(&SimpleThresholdPolicy::loop_predicate, method, cur_level);
 381   if (cur_level == CompLevel_none) {
 382     // If there is a live OSR method that means that we deopted to the interpreter
 383     // for the transition.
 384     CompLevel osr_level = MIN2((CompLevel)method->highest_osr_comp_level(), next_level);
 385     if (osr_level > CompLevel_none) {
 386       return osr_level;
 387     }
 388   }
 389   return next_level;
 390 }
 391 
 392 
 393 // Handle the invocation event.
 394 void SimpleThresholdPolicy::method_invocation_event(const methodHandle& mh, const methodHandle& imh,
 395                                               CompLevel level, nmethod* nm, JavaThread* thread) {
 396   if (is_compilation_enabled() && !CompileBroker::compilation_is_in_queue(mh)) {
 397     CompLevel next_level = call_event(mh(), level);
 398     if (next_level != level) {
 399       compile(mh, InvocationEntryBci, next_level, thread);
 400     }
 401   }
 402 }
 403 
 404 // Handle the back branch event. Notice that we can compile the method
 405 // with a regular entry from here.
 406 void SimpleThresholdPolicy::method_back_branch_event(const methodHandle& mh, const methodHandle& imh,
 407                                                      int bci, CompLevel level, nmethod* nm, JavaThread* thread) {
 408   // If the method is already compiling, quickly bail out.
 409   if (is_compilation_enabled() && !CompileBroker::compilation_is_in_queue(mh)) {
 410     // Use loop event as an opportunity to also check there's been
 411     // enough calls.
 412     CompLevel cur_level = comp_level(mh());
 413     CompLevel next_level = call_event(mh(), cur_level);
 414     CompLevel next_osr_level = loop_event(mh(), level);
 415 
 416     next_level = MAX2(next_level,
 417                       next_osr_level < CompLevel_full_optimization ? next_osr_level : cur_level);
 418     bool is_compiling = false;
 419     if (next_level != cur_level) {
 420       compile(mh, InvocationEntryBci, next_level, thread);
 421       is_compiling = true;
 422     }
 423 
 424     // Do the OSR version
 425     if (!is_compiling && next_osr_level != level) {
 426       compile(mh, bci, next_osr_level, thread);
 427     }
 428   }
 429 }