HomeSort by relevance Sort by last modified time
    Searched refs:IrreducibleGraph (Results 1 - 2 of 2) sorted by null

  /external/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp 543 void IrreducibleGraph::addNodesInLoop(const BFIBase::LoopData &OuterLoop) {
550 void IrreducibleGraph::addNodesInFunction() {
557 void IrreducibleGraph::indexNodes() {
561 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ,
575 template <> struct GraphTraits<IrreducibleGraph> {
576 typedef bfi_detail::IrreducibleGraph GraphT;
595 const IrreducibleGraph &G,
596 const std::vector<const IrreducibleGraph::IrrNode *> &SCC,
599 SmallDenseMap<const IrreducibleGraph::IrrNode *, bool, 8> InSCC;
660 BlockFrequencyInfoImplBase &BFI, const IrreducibleGraph &G
    [all...]
  /external/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 155 struct IrreducibleGraph;
421 analyzeIrreducible(const bfi_detail::IrreducibleGraph &G, LoopData *OuterLoop,
531 /// \a IrreducibleGraph makes this graph explicit. It's in a form that can use
535 struct IrreducibleGraph {
568 IrreducibleGraph(BFIBase &BFI, const BFIBase::LoopData *OuterLoop,
591 void IrreducibleGraph::initialize(const BFIBase::LoopData *OuterLoop,
605 void IrreducibleGraph::addEdges(const BlockNode &Node,
    [all...]

Completed in 44 milliseconds