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

Public Member Functions

 IsBranchMatcher (const Matcher< Node * > &value_matcher, const Matcher< Node * > &control_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsMergeMatcher (const Matcher< Node * > &control0_matcher, const Matcher< Node * > &control1_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsControl1Matcher (IrOpcode::Value opcode, const Matcher< Node * > &control_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsFinishMatcher (const Matcher< Node * > &value_matcher, const Matcher< Node * > &effect_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsConstantMatcher (IrOpcode::Value opcode, const Matcher< T > &value_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsPhiMatcher (const Matcher< MachineType > &type_matcher, const Matcher< Node * > &value0_matcher, const Matcher< Node * > &value1_matcher, const Matcher< Node * > &control_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsProjectionMatcher (const Matcher< size_t > &index_matcher, const Matcher< Node * > &base_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsCallMatcher (const Matcher< CallDescriptor * > &descriptor_matcher, const Matcher< Node * > &value0_matcher, const Matcher< Node * > &value1_matcher, const Matcher< Node * > &value2_matcher, const Matcher< Node * > &value3_matcher, const Matcher< Node * > &effect_matcher, const Matcher< Node * > &control_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsLoadMatcher (const Matcher< LoadRepresentation > &rep_matcher, const Matcher< Node * > &base_matcher, const Matcher< Node * > &index_matcher, const Matcher< Node * > &effect_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsStoreMatcher (const Matcher< MachineType > &type_matcher, const Matcher< WriteBarrierKind > write_barrier_matcher, const Matcher< Node * > &base_matcher, const Matcher< Node * > &index_matcher, const Matcher< Node * > &value_matcher, const Matcher< Node * > &effect_matcher, const Matcher< Node * > &control_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsBinopMatcher (IrOpcode::Value opcode, const Matcher< Node * > &lhs_matcher, const Matcher< Node * > &rhs_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
 IsUnopMatcher (IrOpcode::Value opcode, const Matcher< Node * > &input_matcher)
 
virtual void DescribeTo (std::ostream *os) const OVERRIDE
 
virtual bool MatchAndExplain (Node *node, MatchResultListener *listener) const OVERRIDE
 
- Public Member Functions inherited from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher
 NodeMatcher (IrOpcode::Value opcode)
 

Private Attributes

const Matcher< Node * > value_matcher_
 
const Matcher< Node * > control_matcher_
 
const Matcher< Node * > control0_matcher_
 
const Matcher< Node * > control1_matcher_
 
const Matcher< Node * > effect_matcher_
 
const Matcher< T > value_matcher_
 
const Matcher< MachineType > type_matcher_
 
const Matcher< Node * > value0_matcher_
 
const Matcher< Node * > value1_matcher_
 
const Matcher< size_t > index_matcher_
 
const Matcher< Node * > base_matcher_
 
const Matcher< CallDescriptor * > descriptor_matcher_
 
const Matcher< Node * > value2_matcher_
 
const Matcher< Node * > value3_matcher_
 
const Matcher< LoadRepresentation > rep_matcher_
 
const Matcher< Node * > index_matcher_
 
const Matcher< WriteBarrierKind > write_barrier_matcher_
 
const Matcher< Node * > lhs_matcher_
 
const Matcher< Node * > rhs_matcher_
 
const Matcher< Node * > input_matcher_
 

Detailed Description

template<typename T>
class v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >

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

Member Function Documentation

◆ DescribeTo() [1/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

153  {
154  NodeMatcher::DescribeTo(os);
155  *os << " whose value (";
156  value_matcher_.DescribeTo(os);
157  *os << ") and control (";
158  control_matcher_.DescribeTo(os);
159  *os << ")";
160  }
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::value_matcher_
const Matcher< Node * > value_matcher_
Definition: graph-unittest.cc:172
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::control_matcher_
const Matcher< Node * > control_matcher_
Definition: graph-unittest.cc:173
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher::DescribeTo
virtual void DescribeTo(std::ostream *os) const OVERRIDE
Definition: graph-unittest.cc:122

◆ DescribeTo() [2/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

185  {
186  NodeMatcher::DescribeTo(os);
187  *os << " whose control0 (";
188  control0_matcher_.DescribeTo(os);
189  *os << ") and control1 (";
190  control1_matcher_.DescribeTo(os);
191  *os << ")";
192  }
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::control0_matcher_
const Matcher< Node * > control0_matcher_
Definition: graph-unittest.cc:204
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::control1_matcher_
const Matcher< Node * > control1_matcher_
Definition: graph-unittest.cc:205

◆ DescribeTo() [3/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

215  {
216  NodeMatcher::DescribeTo(os);
217  *os << " whose control (";
218  control_matcher_.DescribeTo(os);
219  *os << ")";
220  }

◆ DescribeTo() [4/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

242  {
243  NodeMatcher::DescribeTo(os);
244  *os << " whose value (";
245  value_matcher_.DescribeTo(os);
246  *os << ") and effect (";
247  effect_matcher_.DescribeTo(os);
248  *os << ")";
249  }
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::effect_matcher_
const Matcher< Node * > effect_matcher_
Definition: graph-unittest.cc:262

◆ DescribeTo() [5/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

272  {
273  NodeMatcher::DescribeTo(os);
274  *os << " whose value (";
275  value_matcher_.DescribeTo(os);
276  *os << ")";
277  }

◆ DescribeTo() [6/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

303  {
304  NodeMatcher::DescribeTo(os);
305  *os << " whose type (";
306  type_matcher_.DescribeTo(os);
307  *os << "), value0 (";
308  value0_matcher_.DescribeTo(os);
309  *os << "), value1 (";
310  value1_matcher_.DescribeTo(os);
311  *os << ") and control (";
312  control_matcher_.DescribeTo(os);
313  *os << ")";
314  }
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::type_matcher_
const Matcher< MachineType > type_matcher_
Definition: graph-unittest.cc:330
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::value0_matcher_
const Matcher< Node * > value0_matcher_
Definition: graph-unittest.cc:331
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::value1_matcher_
const Matcher< Node * > value1_matcher_
Definition: graph-unittest.cc:332

◆ DescribeTo() [7/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

345  {
346  NodeMatcher::DescribeTo(os);
347  *os << " whose index (";
348  index_matcher_.DescribeTo(os);
349  *os << ") and base (";
350  base_matcher_.DescribeTo(os);
351  *os << ")";
352  }
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::base_matcher_
const Matcher< Node * > base_matcher_
Definition: graph-unittest.cc:365
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::index_matcher_
const Matcher< size_t > index_matcher_
Definition: graph-unittest.cc:364

◆ DescribeTo() [8/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

387  {
388  NodeMatcher::DescribeTo(os);
389  *os << " whose value0 (";
390  value0_matcher_.DescribeTo(os);
391  *os << ") and value1 (";
392  value1_matcher_.DescribeTo(os);
393  *os << ") and value2 (";
394  value2_matcher_.DescribeTo(os);
395  *os << ") and value3 (";
396  value3_matcher_.DescribeTo(os);
397  *os << ") and effect (";
398  effect_matcher_.DescribeTo(os);
399  *os << ") and control (";
400  control_matcher_.DescribeTo(os);
401  *os << ")";
402  }
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::value3_matcher_
const Matcher< Node * > value3_matcher_
Definition: graph-unittest.cc:428
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::value2_matcher_
const Matcher< Node * > value2_matcher_
Definition: graph-unittest.cc:427

◆ DescribeTo() [9/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

446  {
447  NodeMatcher::DescribeTo(os);
448  *os << " whose rep (";
449  rep_matcher_.DescribeTo(os);
450  *os << "), base (";
451  base_matcher_.DescribeTo(os);
452  *os << "), index (";
453  index_matcher_.DescribeTo(os);
454  *os << ") and effect (";
455  effect_matcher_.DescribeTo(os);
456  *os << ")";
457  }
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::rep_matcher_
const Matcher< LoadRepresentation > rep_matcher_
Definition: graph-unittest.cc:473

◆ DescribeTo() [10/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

498  {
499  NodeMatcher::DescribeTo(os);
500  *os << " whose type (";
501  type_matcher_.DescribeTo(os);
502  *os << "), write barrier (";
503  write_barrier_matcher_.DescribeTo(os);
504  *os << "), base (";
505  base_matcher_.DescribeTo(os);
506  *os << "), index (";
507  index_matcher_.DescribeTo(os);
508  *os << "), value (";
509  value_matcher_.DescribeTo(os);
510  *os << "), effect (";
511  effect_matcher_.DescribeTo(os);
512  *os << ") and control (";
513  control_matcher_.DescribeTo(os);
514  *os << ")";
515  }
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::write_barrier_matcher_
const Matcher< WriteBarrierKind > write_barrier_matcher_
Definition: graph-unittest.cc:540

◆ DescribeTo() [11/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

557  {
558  NodeMatcher::DescribeTo(os);
559  *os << " whose lhs (";
560  lhs_matcher_.DescribeTo(os);
561  *os << ") and rhs (";
562  rhs_matcher_.DescribeTo(os);
563  *os << ")";
564  }
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::lhs_matcher_
const Matcher< Node * > lhs_matcher_
Definition: graph-unittest.cc:576
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::rhs_matcher_
const Matcher< Node * > rhs_matcher_
Definition: graph-unittest.cc:577

◆ DescribeTo() [12/12]

template<typename T >
virtual void v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::DescribeTo ( std::ostream *  os) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

586  {
587  NodeMatcher::DescribeTo(os);
588  *os << " whose input (";
589  input_matcher_.DescribeTo(os);
590  *os << ")";
591  }
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::input_matcher_
const Matcher< Node * > input_matcher_
Definition: graph-unittest.cc:601

◆ IsBinopMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsBinopMatcher ( IrOpcode::Value  opcode,
const Matcher< Node * > &  lhs_matcher,
const Matcher< Node * > &  rhs_matcher 
)
inline

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

553  : NodeMatcher(opcode),
554  lhs_matcher_(lhs_matcher),
555  rhs_matcher_(rhs_matcher) {}
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher::NodeMatcher
NodeMatcher(IrOpcode::Value opcode)
Definition: graph-unittest.cc:120

◆ IsBranchMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsBranchMatcher ( const Matcher< Node * > &  value_matcher,
const Matcher< Node * > &  control_matcher 
)
inline

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

149  : NodeMatcher(IrOpcode::kBranch),
150  value_matcher_(value_matcher),
151  control_matcher_(control_matcher) {}

◆ IsCallMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsCallMatcher ( const Matcher< CallDescriptor * > &  descriptor_matcher,
const Matcher< Node * > &  value0_matcher,
const Matcher< Node * > &  value1_matcher,
const Matcher< Node * > &  value2_matcher,
const Matcher< Node * > &  value3_matcher,
const Matcher< Node * > &  effect_matcher,
const Matcher< Node * > &  control_matcher 
)
inline

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

378  : NodeMatcher(IrOpcode::kCall),
379  descriptor_matcher_(descriptor_matcher),
380  value0_matcher_(value0_matcher),
381  value1_matcher_(value1_matcher),
382  value2_matcher_(value2_matcher),
383  value3_matcher_(value3_matcher),
384  effect_matcher_(effect_matcher),
385  control_matcher_(control_matcher) {}
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL::descriptor_matcher_
const Matcher< CallDescriptor * > descriptor_matcher_
Definition: graph-unittest.cc:424

◆ IsConstantMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsConstantMatcher ( IrOpcode::Value  opcode,
const Matcher< T > &  value_matcher 
)
inline

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

270  : NodeMatcher(opcode), value_matcher_(value_matcher) {}

◆ IsControl1Matcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsControl1Matcher ( IrOpcode::Value  opcode,
const Matcher< Node * > &  control_matcher 
)
inline

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

213  : NodeMatcher(opcode), control_matcher_(control_matcher) {}

◆ IsFinishMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsFinishMatcher ( const Matcher< Node * > &  value_matcher,
const Matcher< Node * > &  effect_matcher 
)
inline

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

238  : NodeMatcher(IrOpcode::kFinish),
239  value_matcher_(value_matcher),
240  effect_matcher_(effect_matcher) {}

◆ IsLoadMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsLoadMatcher ( const Matcher< LoadRepresentation > &  rep_matcher,
const Matcher< Node * > &  base_matcher,
const Matcher< Node * > &  index_matcher,
const Matcher< Node * > &  effect_matcher 
)
inline

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

440  : NodeMatcher(IrOpcode::kLoad),
441  rep_matcher_(rep_matcher),
442  base_matcher_(base_matcher),
443  index_matcher_(index_matcher),
444  effect_matcher_(effect_matcher) {}

◆ IsMergeMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsMergeMatcher ( const Matcher< Node * > &  control0_matcher,
const Matcher< Node * > &  control1_matcher 
)
inline

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

181  : NodeMatcher(IrOpcode::kMerge),
182  control0_matcher_(control0_matcher),
183  control1_matcher_(control1_matcher) {}

◆ IsPhiMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsPhiMatcher ( const Matcher< MachineType > &  type_matcher,
const Matcher< Node * > &  value0_matcher,
const Matcher< Node * > &  value1_matcher,
const Matcher< Node * > &  control_matcher 
)
inline

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

297  : NodeMatcher(IrOpcode::kPhi),
298  type_matcher_(type_matcher),
299  value0_matcher_(value0_matcher),
300  value1_matcher_(value1_matcher),
301  control_matcher_(control_matcher) {}

◆ IsProjectionMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsProjectionMatcher ( const Matcher< size_t > &  index_matcher,
const Matcher< Node * > &  base_matcher 
)
inline

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

341  : NodeMatcher(IrOpcode::kProjection),
342  index_matcher_(index_matcher),
343  base_matcher_(base_matcher) {}

◆ IsStoreMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsStoreMatcher ( const Matcher< MachineType > &  type_matcher,
const Matcher< WriteBarrierKind >  write_barrier_matcher,
const Matcher< Node * > &  base_matcher,
const Matcher< Node * > &  index_matcher,
const Matcher< Node * > &  value_matcher,
const Matcher< Node * > &  effect_matcher,
const Matcher< Node * > &  control_matcher 
)
inline

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

489  : NodeMatcher(IrOpcode::kStore),
490  type_matcher_(type_matcher),
491  write_barrier_matcher_(write_barrier_matcher),
492  base_matcher_(base_matcher),
493  index_matcher_(index_matcher),
494  value_matcher_(value_matcher),
495  effect_matcher_(effect_matcher),
496  control_matcher_(control_matcher) {}

◆ IsUnopMatcher()

template<typename T >
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::IsUnopMatcher ( IrOpcode::Value  opcode,
const Matcher< Node * > &  input_matcher 
)
inline

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

584  : NodeMatcher(opcode), input_matcher_(input_matcher) {}

◆ MatchAndExplain() [1/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

163  {
164  return (NodeMatcher::MatchAndExplain(node, listener) &&
165  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0),
166  "value", value_matcher_, listener) &&
167  PrintMatchAndExplain(NodeProperties::GetControlInput(node),
168  "control", control_matcher_, listener));
169  }
v8::internal::compiler::NodeProperties::GetValueInput
static Node * GetValueInput(Node *node, int index)
Definition: node-properties-inl.h:75
v8::internal::compiler::NodeProperties::GetControlInput
static Node * GetControlInput(Node *node, int index=0)
Definition: node-properties-inl.h:97
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher::MatchAndExplain
virtual bool MatchAndExplain(Node *node, MatchResultListener *listener) const OVERRIDE
Definition: graph-unittest.cc:126
v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain
bool PrintMatchAndExplain(const T &value, const char *value_name, const Matcher< T > &value_matcher, MatchResultListener *listener)
Definition: graph-unittest.cc:103

References v8::internal::compiler::NodeProperties::GetControlInput(), v8::internal::compiler::NodeProperties::GetValueInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [2/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

195  {
196  return (NodeMatcher::MatchAndExplain(node, listener) &&
197  PrintMatchAndExplain(NodeProperties::GetControlInput(node, 0),
198  "control0", control0_matcher_, listener) &&
199  PrintMatchAndExplain(NodeProperties::GetControlInput(node, 1),
200  "control1", control1_matcher_, listener));
201  }

References v8::internal::compiler::NodeProperties::GetControlInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [3/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

223  {
224  return (NodeMatcher::MatchAndExplain(node, listener) &&
225  PrintMatchAndExplain(NodeProperties::GetControlInput(node),
226  "control", control_matcher_, listener));
227  }

References v8::internal::compiler::NodeProperties::GetControlInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [4/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

252  {
253  return (NodeMatcher::MatchAndExplain(node, listener) &&
254  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0),
255  "value", value_matcher_, listener) &&
256  PrintMatchAndExplain(NodeProperties::GetEffectInput(node), "effect",
257  effect_matcher_, listener));
258  }
v8::internal::compiler::NodeProperties::GetEffectInput
static Node * GetEffectInput(Node *node, int index=0)
Definition: node-properties-inl.h:91

References v8::internal::compiler::NodeProperties::GetEffectInput(), v8::internal::compiler::NodeProperties::GetValueInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [5/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

280  {
281  return (NodeMatcher::MatchAndExplain(node, listener) &&
282  PrintMatchAndExplain(OpParameter<T>(node), "value", value_matcher_,
283  listener));
284  }

References v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [6/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

317  {
318  return (NodeMatcher::MatchAndExplain(node, listener) &&
319  PrintMatchAndExplain(OpParameter<MachineType>(node), "type",
320  type_matcher_, listener) &&
321  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0),
322  "value0", value0_matcher_, listener) &&
323  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 1),
324  "value1", value1_matcher_, listener) &&
325  PrintMatchAndExplain(NodeProperties::GetControlInput(node),
326  "control", control_matcher_, listener));
327  }

References v8::internal::compiler::NodeProperties::GetControlInput(), v8::internal::compiler::NodeProperties::GetValueInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [7/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

355  {
356  return (NodeMatcher::MatchAndExplain(node, listener) &&
357  PrintMatchAndExplain(OpParameter<size_t>(node), "index",
358  index_matcher_, listener) &&
359  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0), "base",
360  base_matcher_, listener));
361  }

References v8::internal::compiler::NodeProperties::GetValueInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [8/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

405  {
406  return (NodeMatcher::MatchAndExplain(node, listener) &&
407  PrintMatchAndExplain(OpParameter<CallDescriptor*>(node),
408  "descriptor", descriptor_matcher_, listener) &&
409  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0),
410  "value0", value0_matcher_, listener) &&
411  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 1),
412  "value1", value1_matcher_, listener) &&
413  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 2),
414  "value2", value2_matcher_, listener) &&
415  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 3),
416  "value3", value3_matcher_, listener) &&
417  PrintMatchAndExplain(NodeProperties::GetEffectInput(node), "effect",
418  effect_matcher_, listener) &&
419  PrintMatchAndExplain(NodeProperties::GetControlInput(node),
420  "control", control_matcher_, listener));
421  }

References v8::internal::compiler::NodeProperties::GetControlInput(), v8::internal::compiler::NodeProperties::GetEffectInput(), v8::internal::compiler::NodeProperties::GetValueInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [9/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

460  {
461  return (NodeMatcher::MatchAndExplain(node, listener) &&
462  PrintMatchAndExplain(OpParameter<LoadRepresentation>(node), "rep",
463  rep_matcher_, listener) &&
464  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0), "base",
465  base_matcher_, listener) &&
466  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 1),
467  "index", index_matcher_, listener) &&
468  PrintMatchAndExplain(NodeProperties::GetEffectInput(node), "effect",
469  effect_matcher_, listener));
470  }

References v8::internal::compiler::NodeProperties::GetEffectInput(), v8::internal::compiler::NodeProperties::GetValueInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [10/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

518  {
519  return (NodeMatcher::MatchAndExplain(node, listener) &&
520  PrintMatchAndExplain(
521  OpParameter<StoreRepresentation>(node).machine_type(), "type",
522  type_matcher_, listener) &&
523  PrintMatchAndExplain(
524  OpParameter<StoreRepresentation>(node).write_barrier_kind(),
525  "write barrier", write_barrier_matcher_, listener) &&
526  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0), "base",
527  base_matcher_, listener) &&
528  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 1),
529  "index", index_matcher_, listener) &&
530  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 2),
531  "value", value_matcher_, listener) &&
532  PrintMatchAndExplain(NodeProperties::GetEffectInput(node), "effect",
533  effect_matcher_, listener) &&
534  PrintMatchAndExplain(NodeProperties::GetControlInput(node),
535  "control", control_matcher_, listener));
536  }

References v8::internal::compiler::NodeProperties::GetControlInput(), v8::internal::compiler::NodeProperties::GetEffectInput(), v8::internal::compiler::NodeProperties::GetValueInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [11/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

567  {
568  return (NodeMatcher::MatchAndExplain(node, listener) &&
569  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0), "lhs",
570  lhs_matcher_, listener) &&
571  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 1), "rhs",
572  rhs_matcher_, listener));
573  }

References v8::internal::compiler::NodeProperties::GetValueInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

◆ MatchAndExplain() [12/12]

template<typename T >
virtual bool v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::MatchAndExplain ( Node *  node,
MatchResultListener *  listener 
) const
inlinevirtual

Reimplemented from v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::NodeMatcher.

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

594  {
595  return (NodeMatcher::MatchAndExplain(node, listener) &&
596  PrintMatchAndExplain(NodeProperties::GetValueInput(node, 0),
597  "input", input_matcher_, listener));
598  }

References v8::internal::compiler::NodeProperties::GetValueInput(), and v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::PrintMatchAndExplain().

+ Here is the call graph for this function:

Member Data Documentation

◆ base_matcher_

template<typename T >
const Matcher< Node * > v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::base_matcher_
private

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

◆ control0_matcher_

template<typename T >
const Matcher<Node*> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::control0_matcher_
private

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

◆ control1_matcher_

template<typename T >
const Matcher<Node*> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::control1_matcher_
private

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

◆ control_matcher_

template<typename T >
const Matcher< Node * > v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::control_matcher_
private

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

◆ descriptor_matcher_

template<typename T >
const Matcher<CallDescriptor*> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::descriptor_matcher_
private

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

◆ effect_matcher_

template<typename T >
const Matcher< Node * > v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::effect_matcher_
private

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

◆ index_matcher_ [1/2]

template<typename T >
const Matcher< Node * > v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::index_matcher_
private

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

◆ index_matcher_ [2/2]

template<typename T >
const Matcher<Node*> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::index_matcher_
private

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

◆ input_matcher_

template<typename T >
const Matcher<Node*> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::input_matcher_
private

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

◆ lhs_matcher_

template<typename T >
const Matcher<Node*> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::lhs_matcher_
private

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

◆ rep_matcher_

template<typename T >
const Matcher<LoadRepresentation> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::rep_matcher_
private

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

◆ rhs_matcher_

template<typename T >
const Matcher<Node*> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::rhs_matcher_
private

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

◆ type_matcher_

template<typename T >
const Matcher< MachineType > v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::type_matcher_
private

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

◆ value0_matcher_

template<typename T >
const Matcher< Node * > v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::value0_matcher_
private

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

◆ value1_matcher_

template<typename T >
const Matcher< Node * > v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::value1_matcher_
private

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

◆ value2_matcher_

template<typename T >
const Matcher<Node*> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::value2_matcher_
private

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

◆ value3_matcher_

template<typename T >
const Matcher<Node*> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::value3_matcher_
private

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

◆ value_matcher_ [1/2]

template<typename T >
const Matcher< Node * > v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::value_matcher_
private

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

◆ value_matcher_ [2/2]

template<typename T >
const Matcher<T> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::value_matcher_
private

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

◆ write_barrier_matcher_

template<typename T >
const Matcher<WriteBarrierKind> v8::internal::compiler::anonymous_namespace{graph-unittest.cc}::FINAL< T >::write_barrier_matcher_
private

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

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