Inheritance diagram for dart::InductionVarAnalysis:

Public Member Functions
	InductionVarAnalysis (const GrowableArray< BlockEntryInstr * > &preorder)

void	VisitHierarchy (LoopInfo *loop)

void	VisitLoop (LoopInfo *loop)

Public Member Functions inherited from dart::ValueObject
	ValueObject ()

	~ValueObject ()

Detailed Description

Definition at line 25 of file loops.cc.

Constructor & Destructor Documentation

◆ InductionVarAnalysis()

dart::InductionVarAnalysis::InductionVarAnalysis ( const GrowableArray< BlockEntryInstr * > & preorder )

inlineexplicit

Definition at line 28 of file loops.cc.

      : preorder_(preorder),
        stack_(),
        scc_(),
        cycle_(),
        map_(),
        current_index_(0),
        zone_(Thread::Current()->zone()) {}

Member Function Documentation

◆ VisitHierarchy()

void dart::InductionVarAnalysis::VisitHierarchy ( LoopInfo * loop )

Definition at line 209 of file loops.cc.

                                                        {
  for (; loop != nullptr; loop = loop->next_) {
    VisitLoop(loop);
    VisitHierarchy(loop->inner_);
  }
}

◆ VisitLoop()

void dart::InductionVarAnalysis::VisitLoop ( LoopInfo * loop )

Definition at line 216 of file loops.cc.

                                                   {
  loop->ResetInduction();
  // Find strongly connected components (SSCs) in the SSA graph of this
  // loop using Tarjan's algorithm. Due to the descendant-first nature,
  // classification happens "on-demand".
  current_index_ = 0;
  ASSERT(stack_.is_empty());
  ASSERT(map_.IsEmpty());
  ASSERT(branches_.is_empty());
  for (BitVector::Iterator it(loop->blocks_); !it.Done(); it.Advance()) {
    BlockEntryInstr* block = preorder_[it.Current()];
    ASSERT(block->loop_info() != nullptr);
    if (block->loop_info() != loop) {
      continue;  // inner loop
    }
    // Visit phi-operations.
    if (block->IsJoinEntry()) {
      for (PhiIterator it(block->AsJoinEntry()); !it.Done(); it.Advance()) {
        Visit(loop, it.Current());
      }
    }
    // Visit instructions and collect branches.
    for (ForwardInstructionIterator it(block); !it.Done(); it.Advance()) {
      Instruction* instruction = it.Current();
      Visit(loop, instruction->AsDefinition());
      if (instruction->IsBranch()) {
        branches_.Add(instruction->AsBranch());
      }
    }
  }
  ASSERT(stack_.is_empty());
  map_.Clear();
  // Classify loop control.
  ClassifyControl(loop);
  branches_.Clear();
}

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