V8 Project
Public Member Functions | Private Attributes | List of all members
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher Class Reference
+ Inheritance diagram for v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher:
+ Collaboration diagram for v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher:

Public Member Functions

 NodeMatcher (IrOpcode::Value opcode)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 

Private Attributes

const IrOpcode::Value opcode_
 

Detailed Description

Definition at line 118 of file graph-unittest.cc.

Constructor & Destructor Documentation

◆ NodeMatcher()

v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher::NodeMatcher ( IrOpcode::Value  opcode)
inlineexplicit

Definition at line 120 of file graph-unittest.cc.

120 : opcode_(opcode) {}
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher::opcode_
const IrOpcode::Value opcode_
Definition: graph-unittest.cc:141

Member Function Documentation

◆ DescribeTo()

virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented in v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >.

Definition at line 122 of file graph-unittest.cc.

122  {
123  *os << "is a " << IrOpcode::Mnemonic(opcode_) << " node";
124  }
v8::internal::compiler::IrOpcode::Mnemonic
static const char * Mnemonic(Value val)
Definition: opcodes.h:256

References v8::internal::compiler::IrOpcode::Mnemonic().

+ Here is the call graph for this function:

◆ MatchAndExplain()

virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented in v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >, and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >.

Definition at line 126 of file graph-unittest.cc.

127  {
128  if (node == NULL) {
129  *listener << "which is NULL";
130  return false;
131  }
132  if (node->opcode() != opcode_) {
133  *listener << "whose opcode is " << IrOpcode::Mnemonic(node->opcode())
134  << " but should have been " << IrOpcode::Mnemonic(opcode_);
135  return false;
136  }
137  return true;
138  }
NULL
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 NULL
Definition: flag-definitions.h:407

References v8::internal::compiler::IrOpcode::Mnemonic(), v8::internal::compiler::NodeMatcher::node(), and NULL.

+ Here is the call graph for this function:

Member Data Documentation

◆ opcode_

const IrOpcode::Value v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher::opcode_
private

Definition at line 141 of file graph-unittest.cc.

The documentation for this class was generated from the following file: