V8 Project
graph-replay.h
Go to the documentation of this file.
1 // Copyright 2014 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file.
4 
5 #ifndef V8_COMPILER_GRAPH_REPLAY_H_
6 #define V8_COMPILER_GRAPH_REPLAY_H_
7 
8 #include "src/compiler/node.h"
9 
10 namespace v8 {
11 namespace internal {
12 namespace compiler {
13 
14 // Forward declarations.
15 class Graph;
16 
17 // Helper class to print a full replay of a graph. This replay can be used to
18 // materialize the same graph within a C++ unit test and hence test subsequent
19 // optimization passes on a graph without going through the construction steps.
20 class GraphReplayPrinter FINAL : public NullNodeVisitor {
21  public:
22 #ifdef DEBUG
23  static void PrintReplay(Graph* graph);
24 #else
25  static void PrintReplay(Graph* graph) {}
26 #endif
27 
29  void PostEdge(Node* from, int index, Node* to);
30 
31  private:
33 
34  static void PrintReplayOpCreator(const Operator* op);
35 
36  DISALLOW_COPY_AND_ASSIGN(GraphReplayPrinter);
37 };
38 
39 } // namespace compiler
40 } // namespace internal
41 } // namespace v8
42 
43 #endif // V8_COMPILER_GRAPH_REPLAY_H_
DISALLOW_COPY_AND_ASSIGN(GraphReplayPrinter)
static void PrintReplay(Graph *graph)
Definition: graph-replay.h:25
void PostEdge(Node *from, int index, Node *to)
GenericGraphVisit::Control Pre(Node *node)
static void PrintReplayOpCreator(const Operator *op)
#define FINAL
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes enable context specialization in TurboFan execution budget before interrupt is triggered max percentage of megamorphic generic ICs to allow optimization enable use of SAHF instruction if enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable use of MLS 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 enable alignment of csp to bytes on platforms which prefer the register to always be expose gc extension under the specified name show built in functions in stack traces use random jit cookie to mask large constants minimum length for automatic enable preparsing CPU profiler sampling interval in microseconds trace out of bounds accesses to external arrays default size of stack region v8 is allowed to maximum length of function source code printed in a stack trace min size of a semi the new space consists of two semi spaces print one trace line following each garbage collection do not print trace line after scavenger collection print cumulative GC statistics in only print modified registers Trace simulator debug messages Implied by trace sim abort randomize hashes to avoid predictable hash Fixed seed to use to hash property Print the time it takes to deserialize the snapshot A filename with extra code to be included in the A file to write the raw snapshot bytes to(mksnapshot only)") DEFINE_STRING(raw_context_file
GenericGraphVisit::NullNodeVisitor< NodeData, Node > NullNodeVisitor
Definition: node.h:66
Debugger support for the V8 JavaScript engine.
Definition: accessors.cc:20