runtime-profiler.cc 9.34 KB
Newer Older
1
// Copyright 2012 the V8 project authors. All rights reserved.
2 3
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
4

5
#include "src/runtime-profiler.h"
6

7
#include "src/assembler.h"
8
#include "src/base/platform/platform.h"
9 10 11
#include "src/bootstrapper.h"
#include "src/code-stubs.h"
#include "src/compilation-cache.h"
12
#include "src/compiler.h"
13
#include "src/execution.h"
14
#include "src/frames-inl.h"
15
#include "src/global-handles.h"
16
#include "src/interpreter/interpreter.h"
17 18 19 20

namespace v8 {
namespace internal {

21 22 23 24
// Number of times a function has to be seen on the stack before it is
// optimized.
static const int kProfilerTicksBeforeOptimization = 2;

25 26 27
// The number of ticks required for optimizing a function increases with
// the size of the bytecode. This is in addition to the
// kProfilerTicksBeforeOptimization required for any function.
28
static const int kBytecodeSizeAllowancePerTick = 1200;
29

30
// Maximum size in bytes of generate code for a function to allow OSR.
31
static const int kOSRBytecodeSizeAllowanceBase = 180;
32

33
static const int kOSRBytecodeSizeAllowancePerTick = 48;
34

35 36
// Maximum size in bytes of generated code for a function to be optimized
// the very first time it is seen on the stack.
37
static const int kMaxBytecodeSizeForEarlyOpt = 90;
38

39
// Certain functions are simply too big to be worth optimizing.
40
static const int kMaxBytecodeSizeForOpt = 60 * KB;
41

42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
#define OPTIMIZATION_REASON_LIST(V)                            \
  V(DoNotOptimize, "do not optimize")                          \
  V(HotAndStable, "hot and stable")                            \
  V(SmallFunction, "small function")

enum class OptimizationReason : uint8_t {
#define OPTIMIZATION_REASON_CONSTANTS(Constant, message) k##Constant,
  OPTIMIZATION_REASON_LIST(OPTIMIZATION_REASON_CONSTANTS)
#undef OPTIMIZATION_REASON_CONSTANTS
};

char const* OptimizationReasonToString(OptimizationReason reason) {
  static char const* reasons[] = {
#define OPTIMIZATION_REASON_TEXTS(Constant, message) message,
      OPTIMIZATION_REASON_LIST(OPTIMIZATION_REASON_TEXTS)
#undef OPTIMIZATION_REASON_TEXTS
  };
  size_t const index = static_cast<size_t>(reason);
  DCHECK_LT(index, arraysize(reasons));
  return reasons[index];
}

std::ostream& operator<<(std::ostream& os, OptimizationReason reason) {
  return os << OptimizationReasonToString(reason);
}
67

68 69
RuntimeProfiler::RuntimeProfiler(Isolate* isolate)
    : isolate_(isolate),
70
      any_ic_changed_(false) {
71 72
}

73 74 75
static void GetICCounts(JSFunction* function, int* ic_with_type_info_count,
                        int* ic_generic_count, int* ic_total_count,
                        int* type_info_percentage, int* generic_percentage) {
76
  // Harvest vector-ics.
77
  FeedbackVector* vector = function->feedback_vector();
78 79
  vector->ComputeCounts(ic_with_type_info_count, ic_generic_count,
                        ic_total_count);
80

81 82 83 84 85 86 87
  if (*ic_total_count > 0) {
    *type_info_percentage = 100 * *ic_with_type_info_count / *ic_total_count;
    *generic_percentage = 100 * *ic_generic_count / *ic_total_count;
  } else {
    *type_info_percentage = 100;  // Compared against lower bound.
    *generic_percentage = 0;      // Compared against upper bound.
  }
88 89
}

90 91
static void TraceRecompile(JSFunction* function, const char* reason,
                           const char* type) {
92
  if (FLAG_trace_opt) {
93
    PrintF("[marking ");
94
    function->ShortPrint();
95
    PrintF(" for %s recompilation, reason: %s", type, reason);
96
    if (FLAG_type_info_threshold > 0) {
97
      int typeinfo, generic, total, type_percentage, generic_percentage;
98 99
      GetICCounts(function, &typeinfo, &generic, &total, &type_percentage,
                  &generic_percentage);
100 101 102
      PrintF(", ICs with typeinfo: %d/%d (%d%%)", typeinfo, total,
             type_percentage);
      PrintF(", generic ICs: %d/%d (%d%%)", generic, total, generic_percentage);
103
    }
104 105
    PrintF("]\n");
  }
106
}
107

108 109 110 111
void RuntimeProfiler::Optimize(JSFunction* function,
                               OptimizationReason reason) {
  DCHECK_NE(reason, OptimizationReason::kDoNotOptimize);
  TraceRecompile(function, OptimizationReasonToString(reason), "optimized");
112
  function->MarkForOptimization(ConcurrencyMode::kConcurrent);
113 114
}

115
void RuntimeProfiler::AttemptOnStackReplacement(JavaScriptFrame* frame,
116
                                                int loop_nesting_levels) {
117
  JSFunction* function = frame->function();
118
  SharedFunctionInfo* shared = function->shared();
119
  if (!FLAG_use_osr || !function->shared()->IsUserJavaScript()) {
120 121 122
    return;
  }

123
  // If the code is not optimizable, don't try OSR.
124
  if (shared->optimization_disabled()) return;
125

126 127 128
  // We're using on-stack replacement: Store new loop nesting level in
  // BytecodeArray header so that certain back edges in any interpreter frame
  // for this bytecode will trigger on-stack replacement for that frame.
129
  if (FLAG_trace_osr) {
130
    PrintF("[OSR - arming back edges in ");
131
    function->PrintName();
132
    PrintF("]\n");
133 134
  }

135 136 137 138 139
  DCHECK_EQ(StackFrame::INTERPRETED, frame->type());
  DCHECK(shared->HasBytecodeArray());
  int level = shared->bytecode_array()->osr_loop_nesting_level();
  shared->bytecode_array()->set_osr_loop_nesting_level(
      Min(level + loop_nesting_levels, AbstractCode::kMaxLoopNestingMarker));
140 141
}

142 143
void RuntimeProfiler::MaybeOptimize(JSFunction* function,
                                    JavaScriptFrame* frame) {
144 145 146 147 148 149 150 151
  if (function->IsInOptimizationQueue()) {
    if (FLAG_trace_opt_verbose) {
      PrintF("[function ");
      function->PrintName();
      PrintF(" is already in optimization queue]\n");
    }
    return;
  }
152 153

  if (FLAG_always_osr) {
154
    AttemptOnStackReplacement(frame, AbstractCode::kMaxLoopNestingMarker);
155
    // Fall through and do a normal optimized compile as well.
156
  } else if (MaybeOSR(function, frame)) {
157 158 159
    return;
  }

160
  if (function->shared()->optimization_disabled()) return;
161

162
  if (frame->is_optimized()) return;
163

164
  OptimizationReason reason = ShouldOptimize(function, frame);
165 166 167 168 169 170

  if (reason != OptimizationReason::kDoNotOptimize) {
    Optimize(function, reason);
  }
}

171
bool RuntimeProfiler::MaybeOSR(JSFunction* function, JavaScriptFrame* frame) {
172
  SharedFunctionInfo* shared = function->shared();
173
  int ticks = function->feedback_vector()->profiler_ticks();
174 175 176 177 178

  // TODO(rmcilroy): Also ensure we only OSR top-level code if it is smaller
  // than kMaxToplevelSourceSize.

  if (!frame->is_optimized() &&
179
      (function->IsMarkedForOptimization() ||
180
       function->IsMarkedForConcurrentOptimization() ||
181
       function->HasOptimizedCode())) {
182 183 184
    // Attempt OSR if we are still running interpreted code even though the
    // the function has long been marked or even already been optimized.
    int64_t allowance =
185 186
        kOSRBytecodeSizeAllowanceBase +
        static_cast<int64_t>(ticks) * kOSRBytecodeSizeAllowancePerTick;
187
    if (shared->bytecode_array()->length() <= allowance) {
188 189 190 191 192 193 194
      AttemptOnStackReplacement(frame);
    }
    return true;
  }
  return false;
}

195 196
OptimizationReason RuntimeProfiler::ShouldOptimize(JSFunction* function,
                                                   JavaScriptFrame* frame) {
197
  SharedFunctionInfo* shared = function->shared();
198
  int ticks = function->feedback_vector()->profiler_ticks();
199

200
  if (shared->bytecode_array()->length() > kMaxBytecodeSizeForOpt) {
201 202 203
    return OptimizationReason::kDoNotOptimize;
  }

204 205
  int ticks_for_optimization =
      kProfilerTicksBeforeOptimization +
206
      (shared->bytecode_array()->length() / kBytecodeSizeAllowancePerTick);
207
  if (ticks >= ticks_for_optimization) {
208
    return OptimizationReason::kHotAndStable;
209
  } else if (!any_ic_changed_ &&
210
             shared->bytecode_array()->length() < kMaxBytecodeSizeForEarlyOpt) {
211 212
    // If no IC was patched since the last tick and this function is very
    // small, optimistically optimize it now.
213 214 215 216 217 218 219 220 221 222
    return OptimizationReason::kSmallFunction;
  } else if (FLAG_trace_opt_verbose) {
    PrintF("[not yet optimizing ");
    function->PrintName();
    PrintF(", not enough ticks: %d/%d and ", ticks,
           kProfilerTicksBeforeOptimization);
    if (any_ic_changed_) {
      PrintF("ICs changed]\n");
    } else {
      PrintF(" too large for small function optimization: %d/%d]\n",
223
             shared->bytecode_array()->length(), kMaxBytecodeSizeForEarlyOpt);
224
    }
225
  }
226
  return OptimizationReason::kDoNotOptimize;
227 228
}

229
void RuntimeProfiler::MarkCandidatesForOptimization() {
230
  HandleScope scope(isolate_);
231

Mythri's avatar
Mythri committed
232
  if (!isolate_->use_optimizer()) return;
233

234 235
  DisallowHeapAllocation no_gc;

236 237 238
  // Run through the JavaScript frames and collect them. If we already
  // have a sample of the function, we mark it for optimizations
  // (eagerly or lazily).
239
  int frame_count = 0;
240
  int frame_count_limit = FLAG_frame_count;
241
  for (JavaScriptFrameIterator it(isolate_);
242
       frame_count++ < frame_count_limit && !it.done();
243 244
       it.Advance()) {
    JavaScriptFrame* frame = it.frame();
245
    if (frame->is_optimized()) continue;
246

247 248
    JSFunction* function = frame->function();
    DCHECK(function->shared()->is_compiled());
249 250 251
    if (!function->shared()->IsInterpreted()) continue;

    MaybeOptimize(function, frame);
252

253 254
    // TODO(leszeks): Move this increment to before the maybe optimize checks,
    // and update the tests to assume the increment has already happened.
255
    int ticks = function->feedback_vector()->profiler_ticks();
256
    if (ticks < Smi::kMaxValue) {
257
      function->feedback_vector()->set_profiler_ticks(ticks + 1);
258
    }
259
  }
260
  any_ic_changed_ = false;
261 262
}

263 264
}  // namespace internal
}  // namespace v8