28 #ifndef V8_COUNTERS_H_
29 #define V8_COUNTERS_H_
31 #include "../include/v8.h"
52 create_histogram_function_ = f;
58 add_histogram_sample_function_ = f;
62 return lookup_function_ !=
NULL;
72 if (!lookup_function_)
return NULL;
73 return lookup_function_(name);
85 if (!create_histogram_function_)
return NULL;
86 return create_histogram_function_(name, min, max, buckets);
92 if (!add_histogram_sample_function_)
return;
93 return add_histogram_sample_function_(histogram, sample);
120 : isolate_(isolate), name_(name), ptr_(
NULL), lookup_done_(
false) { }
125 if (loc) *loc = value;
148 if (loc) (*loc) -= value;
169 if (lookup_done_)
return ptr_;
171 ptr_ = FindLocationInStatsTable();
176 int* FindLocationInStatsTable()
const;
197 num_buckets_(num_buckets),
200 isolate_(isolate) { }
212 lookup_done_ =
false;
220 histogram_ = CreateHistogram();
225 const char*
name() {
return name_; }
229 void* CreateHistogram()
const;
249 :
Histogram(name, min, max, num_buckets, isolate) {}
259 return Enabled() && timer_.IsStarted();
264 ElapsedTimer* timer() {
return &timer_; }
279 bool allow_nesting =
false)
282 skipped_timer_start_(
false) {
283 if (timer_->timer()->IsStarted() && allow_nesting) {
284 skipped_timer_start_ =
true;
295 if (!skipped_timer_start_) {
305 bool skipped_timer_start_;
312 #endif // V8_COUNTERS_H_
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter NULL
Histogram(const char *name, int min, int max, int num_buckets, Isolate *isolate)
int *(* CounterLookupCallback)(const char *name)
HistogramTimerScope(HistogramTimer *timer, bool allow_nesting=false)
#define ASSERT(condition)
void Decrement(int value)
void SetCounterFunction(CounterLookupCallback f)
void *(* CreateHistogramCallback)(const char *name, int min, int max, size_t buckets)
void SetAddHistogramSampleFunction(AddHistogramSampleCallback f)
#define DISALLOW_COPY_AND_ASSIGN(TypeName)
void(* AddHistogramSampleCallback)(void *histogram, int sample)
int * GetInternalPointer()
void Increment(int value)
Isolate * isolate() const
bool HasCounterFunction() const
void SetCreateHistogramFunction(CreateHistogramCallback f)
StatsCounter(Isolate *isolate, const char *name)
void AddSample(int sample)
HistogramTimer(const char *name, int min, int max, int num_buckets, Isolate *isolate)
void * CreateHistogram(const char *name, int min, int max, size_t buckets)
int * FindLocation(const char *name)
void AddHistogramSample(void *histogram, int sample)
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter trace hydrogen to given file name trace inlining decisions trace store elimination trace all use positions trace global value numbering trace hydrogen escape analysis trace the tracking of allocation sites trace map generalization environment for every instruction deoptimize every n garbage collections put a break point before deoptimizing deoptimize uncommon cases use on stack replacement trace array bounds check elimination perform array index dehoisting use load elimination use store elimination use constant folding eliminate unreachable code number of stress runs when picking a function to watch for shared function not JSFunction itself flushes the cache of optimized code for closures on every GC functions with arguments object maximum number of escape analysis fix point iterations allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms concurrent on stack replacement do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes number of stack frames inspected by the profiler percentage of ICs that must have type info to allow optimization extra verbose compilation tracing generate extra emit comments in code disassembly enable use of SSE3 instructions if available enable use of CMOV instruction if available enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long expose natives in global object expose freeBuffer extension expose gc extension under the specified name expose externalize string extension number of stack frames to capture disable builtin natives files print name of functions for which code is generated use random jit cookie to mask large constants trace lazy optimization use adaptive optimizations always try to OSR functions trace optimize function deoptimization minimum length for automatic enable preparsing maximum number of optimization attempts before giving up cache prototype transitions trace debugging JSON request response trace out of bounds accesses to external arrays trace_js_array_abuse automatically set the debug break flag when debugger commands are in the queue abort by crashing maximum length of function source code printed in a stack trace max size of the new max size of the old max size of executable always perform global GCs print one trace line following each garbage collection do not print trace line after scavenger collection print statistics of the maximum memory committed for the heap in name