Home
last modified time | relevance | path

Searched refs:CFGIntervalNode (Results 1 – 2 of 2) sorted by relevance

/src/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DIntervalPartition.h75 struct CFGIntervalNode { struct
76 CFGIntervalNode() = default;
77 CFGIntervalNode(unsigned ID) : ID(ID) {} in CFGIntervalNode() function
79 CFGIntervalNode(unsigned ID, std::vector<const CFGBlock *> Nodes) in CFGIntervalNode() function
82 const llvm::SmallDenseSet<const CFGIntervalNode *> &preds() const { in preds() argument
85 const llvm::SmallDenseSet<const CFGIntervalNode *> &succs() const { in succs() argument
98 llvm::SmallDenseSet<const CFGIntervalNode *> Predecessors; argument
103 llvm::SmallDenseSet<const CFGIntervalNode *> Successors; argument
108 using CFGIntervalGraph = std::deque<CFGIntervalNode>;
/src/contrib/llvm-project/clang/lib/Analysis/
H A DIntervalPartition.cpp35 static unsigned getID(const CFGIntervalNode &I) { return I.ID; } in getID()
106 std::vector<CFGIntervalNode *> &Index, in fillIntervalNode()
113 CFGIntervalNode &Interval = Graph.emplace_back(Graph.size()); in fillIntervalNode()
148 std::vector<CFGIntervalNode *> Index(NumBlockIDs, nullptr); in partitionIntoIntervalsImpl()
154 std::vector<std::pair<const Node *, CFGIntervalNode *>> Intervals; in partitionIntoIntervalsImpl()
183 CFGIntervalNode *Pred = Index[getID(*P)]; in partitionIntoIntervalsImpl()