Searched refs:NodeHeader (Results 1 - 1 of 1) sorted by relevance

/external/llvm/include/llvm/Analysis/
H A DIntervalIterator.h195 BasicBlock *NodeHeader = getNodeHeader(Node); local
197 if (Visited.count(NodeHeader)) { // Node already been visited?
198 if (Int->contains(NodeHeader)) { // Already in this interval...
201 if (!Int->isSuccessor(NodeHeader)) // Add only if not already in set
202 Int->Successors.push_back(NodeHeader);
208 if (!Int->isSuccessor(NodeHeader)) // Add only if not already in set
209 Int->Successors.push_back(NodeHeader);
217 Visited.insert(NodeHeader); // The node has now been visited!
219 if (Int->isSuccessor(NodeHeader)) {
222 Int->Successors.end(), NodeHeader),
[all...]

Completed in 61 milliseconds