Revision: 11425
Author: [email protected]
Date: Tue Apr 24 07:05:07 2012
Log: Re-enable optimization for hot functions that have optimization
disabled due to many deopts.
Use exponential backoff in order to avoid getting into
optimization-deoptimization cycle.
BUG=v8:2040,121196
Review URL: https://chromiumcodereview.appspot.com/10202007
http://code.google.com/p/v8/source/detail?r=11425
Modified:
/branches/bleeding_edge/src/heap.cc
/branches/bleeding_edge/src/objects-inl.h
/branches/bleeding_edge/src/objects.cc
/branches/bleeding_edge/src/objects.h
/branches/bleeding_edge/src/runtime-profiler.cc
=======================================
--- /branches/bleeding_edge/src/heap.cc Tue Apr 17 03:37:41 2012
+++ /branches/bleeding_edge/src/heap.cc Tue Apr 24 07:05:07 2012
@@ -3010,7 +3010,6 @@
share->set_this_property_assignments(undefined_value(),
SKIP_WRITE_BARRIER);
share->set_ast_node_count(0);
share->set_deopt_counter(FLAG_deopt_every_n_times);
- share->set_ic_age(0);
// Set integer fields (smi or int, depending on the architecture).
share->set_length(0);
@@ -3024,6 +3023,8 @@
share->set_compiler_hints(0);
share->set_this_property_assignments_count(0);
share->set_opt_count(0);
+ share->set_ic_age(0);
+ share->set_opt_reenable_tries(0);
return share;
}
=======================================
--- /branches/bleeding_edge/src/objects-inl.h Tue Apr 17 00:16:19 2012
+++ /branches/bleeding_edge/src/objects-inl.h Tue Apr 24 07:05:07 2012
@@ -3511,7 +3511,6 @@
ACCESSORS(SharedFunctionInfo, inferred_name, String, kInferredNameOffset)
ACCESSORS(SharedFunctionInfo, this_property_assignments, Object,
kThisPropertyAssignmentsOffset)
-SMI_ACCESSORS(SharedFunctionInfo, ic_age, kICAgeOffset)
BOOL_ACCESSORS(FunctionTemplateInfo, flag, hidden_prototype,
@@ -3562,6 +3561,8 @@
SMI_ACCESSORS(SharedFunctionInfo, opt_count, kOptCountOffset)
SMI_ACCESSORS(SharedFunctionInfo, ast_node_count, kAstNodeCountOffset)
SMI_ACCESSORS(SharedFunctionInfo, deopt_counter, kDeoptCounterOffset)
+SMI_ACCESSORS(SharedFunctionInfo, ic_age, kICAgeOffset)
+SMI_ACCESSORS(SharedFunctionInfo, opt_reenable_tries,
kOptReenableTriesOffset)
#else
#define PSEUDO_SMI_ACCESSORS_LO(holder, name, offset) \
@@ -3615,6 +3616,11 @@
PSEUDO_SMI_ACCESSORS_LO(SharedFunctionInfo, ast_node_count,
kAstNodeCountOffset)
PSEUDO_SMI_ACCESSORS_HI(SharedFunctionInfo, deopt_counter,
kDeoptCounterOffset)
+
+PSEUDO_SMI_ACCESSORS_LO(SharedFunctionInfo, ic_age, kICAgeOffset)
+PSEUDO_SMI_ACCESSORS_HI(SharedFunctionInfo,
+ opt_reenable_tries,
+ kOptReenableTriesOffset)
#endif
@@ -3654,6 +3660,7 @@
// it will not be counted as optimizable code.
if ((code()->kind() == Code::FUNCTION) && disable) {
code()->set_optimizable(false);
+ code()->set_profiler_ticks(0);
}
}
@@ -3688,6 +3695,23 @@
bool SharedFunctionInfo::is_classic_mode() {
return !BooleanBit::get(compiler_hints(), kStrictModeFunction);
}
+
+
+void SharedFunctionInfo::TryReenableOptimization() {
+ int tries = opt_reenable_tries();
+ if (tries == Smi::kMaxValue) {
+ tries = 0;
+ }
+ set_opt_reenable_tries(tries + 1);
+ // We reenable optimization whenever the number of tries is a large
+ // enough power of 2.
+ if (tries >= 4 && (((tries - 1) & tries) == 0)) {
+ set_optimization_disabled(false);
+ set_opt_count(0);
+ code()->set_optimizable(true);
+ }
+}
+
BOOL_GETTER(SharedFunctionInfo, compiler_hints, is_extended_mode,
kExtendedModeFunction)
=======================================
--- /branches/bleeding_edge/src/objects.cc Tue Apr 17 00:16:19 2012
+++ /branches/bleeding_edge/src/objects.cc Tue Apr 24 07:05:07 2012
@@ -7871,6 +7871,7 @@
code()->set_optimizable(true);
}
set_opt_count(0);
+ set_opt_reenable_tries(0);
}
}
=======================================
--- /branches/bleeding_edge/src/objects.h Wed Apr 18 08:51:34 2012
+++ /branches/bleeding_edge/src/objects.h Tue Apr 24 07:05:07 2012
@@ -5461,6 +5461,13 @@
inline int opt_count();
inline void set_opt_count(int opt_count);
+ // Number of times we tried to reenable optimization.
+ inline int opt_reenable_tries();
+ inline void set_opt_reenable_tries(int opt_reenable_tries);
+
+ inline void TryReenableOptimization();
+
+
// Source size of this function.
int SourceSize();
@@ -5517,13 +5524,10 @@
kInferredNameOffset + kPointerSize;
static const int kThisPropertyAssignmentsOffset =
kInitialMapOffset + kPointerSize;
- // ic_age is a Smi field. It could be grouped with another Smi field
into a
- // PSEUDO_SMI_ACCESSORS pair (on x64), if one becomes available.
- static const int kICAgeOffset = kThisPropertyAssignmentsOffset +
kPointerSize;
#if V8_HOST_ARCH_32_BIT
// Smi fields.
static const int kLengthOffset =
- kICAgeOffset + kPointerSize;
+ kThisPropertyAssignmentsOffset + kPointerSize;
static const int kFormalParameterCountOffset = kLengthOffset +
kPointerSize;
static const int kExpectedNofPropertiesOffset =
kFormalParameterCountOffset + kPointerSize;
@@ -5543,10 +5547,10 @@
kThisPropertyAssignmentsCountOffset + kPointerSize;
static const int kAstNodeCountOffset = kOptCountOffset + kPointerSize;
static const int kDeoptCounterOffset = kAstNodeCountOffset +
kPointerSize;
-
-
+ static const int kICAgeOffset = kDeoptCounterOffset + kPointerSize;
+ static const int kOptReenableTriesOffset = kICAgeOffset + kPointerSize;
// Total size.
- static const int kSize = kDeoptCounterOffset + kPointerSize;
+ static const int kSize = kOptReenableTriesOffset + kPointerSize;
#else
// The only reason to use smi fields instead of int fields
// is to allow iteration without maps decoding during
@@ -5558,7 +5562,7 @@
// word is not set and thus this word cannot be treated as pointer
// to HeapObject during old space traversal.
static const int kLengthOffset =
- kICAgeOffset + kPointerSize;
+ kThisPropertyAssignmentsOffset + kPointerSize;
static const int kFormalParameterCountOffset =
kLengthOffset + kIntSize;
@@ -5585,8 +5589,11 @@
static const int kAstNodeCountOffset = kOptCountOffset + kIntSize;
static const int kDeoptCounterOffset = kAstNodeCountOffset + kIntSize;
+ static const int kICAgeOffset = kDeoptCounterOffset + kIntSize;
+ static const int kOptReenableTriesOffset = kICAgeOffset + kIntSize;
+
// Total size.
- static const int kSize = kDeoptCounterOffset + kIntSize;
+ static const int kSize = kOptReenableTriesOffset + kIntSize;
#endif
=======================================
--- /branches/bleeding_edge/src/runtime-profiler.cc Thu Apr 5 07:10:39 2012
+++ /branches/bleeding_edge/src/runtime-profiler.cc Tue Apr 24 07:05:07 2012
@@ -65,11 +65,17 @@
// Number of times a function has to be seen on the stack before it is
// optimized.
static const int kProfilerTicksBeforeOptimization = 2;
+// If the function optimization was disabled due to high deoptimization
count,
+// but the function is hot and has been seen on the stack this number of
times,
+// then we try to reenable optimization for this function.
+static const int kProfilerTicksBeforeReenablingOptimization = 250;
// If a function does not have enough type info (according to
// FLAG_type_info_threshold), but has seen a huge number of ticks,
// optimize it as it is.
static const int kTicksWhenNotEnoughTypeInfo = 100;
// We only have one byte to store the number of ticks.
+STATIC_ASSERT(kProfilerTicksBeforeOptimization < 256);
+STATIC_ASSERT(kProfilerTicksBeforeReenablingOptimization < 256);
STATIC_ASSERT(kTicksWhenNotEnoughTypeInfo < 256);
// Maximum size in bytes of generated code for a function to be optimized
@@ -263,7 +269,8 @@
}
}
- Code* shared_code = function->shared()->code();
+ SharedFunctionInfo* shared = function->shared();
+ Code* shared_code = shared->code();
if (shared_code->kind() != Code::FUNCTION) continue;
if (function->IsMarkedForLazyRecompilation()) {
@@ -272,20 +279,32 @@
int new_nesting = Min(nesting + 1, Code::kMaxLoopNestingMarker);
shared_code->set_allow_osr_at_loop_nesting_level(new_nesting);
}
-
- // Do not record non-optimizable functions.
- if (!function->IsOptimizable()) continue;
- if (function->shared()->optimization_disabled()) continue;
// Only record top-level code on top of the execution stack and
// avoid optimizing excessively large scripts since top-level code
// will be executed only once.
const int kMaxToplevelSourceSize = 10 * 1024;
- if (function->shared()->is_toplevel()
- && (frame_count > 1
- || function->shared()->SourceSize() > kMaxToplevelSourceSize))
{
+ if (shared->is_toplevel() &&
+ (frame_count > 1 || shared->SourceSize() >
kMaxToplevelSourceSize)) {
continue;
}
+
+ // Do not record non-optimizable functions.
+ if (shared->optimization_disabled()) {
+ if (shared->opt_count() >= Compiler::kDefaultMaxOptCount) {
+ // If optimization was disabled due to many deoptimizations,
+ // then check if the function is hot and try to reenable
optimization.
+ int ticks = shared_code->profiler_ticks();
+ if (ticks >= kProfilerTicksBeforeReenablingOptimization) {
+ shared_code->set_profiler_ticks(0);
+ shared->TryReenableOptimization();
+ } else {
+ shared_code->set_profiler_ticks(ticks + 1);
+ }
+ }
+ continue;
+ }
+ if (!function->IsOptimizable()) continue;
if (FLAG_watch_ic_patching) {
int ticks = shared_code->profiler_ticks();
@@ -309,7 +328,7 @@
}
}
} else if (!any_ic_changed_ &&
- shared_code->instruction_size() < kMaxSizeEarlyOpt) {
+ shared_code->instruction_size() < kMaxSizeEarlyOpt) {
// If no IC was patched since the last tick and this function is
very
// small, optimistically optimize it now.
Optimize(function, "small function");
@@ -319,7 +338,7 @@
} else { // !FLAG_watch_ic_patching
samples[sample_count++] = function;
- int function_size = function->shared()->SourceSize();
+ int function_size = shared->SourceSize();
int threshold_size_factor = (function_size > kSizeLimit)
? sampler_threshold_size_factor_
: 1;
--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev
