Searched refs:getPredecessors (Results 1 – 9 of 9) sorted by relevance
36 public Set<T> getPredecessors(T node) { in getPredecessors() method in Graph37 return findNode(node).getPredecessors().keySet(); in getPredecessors()231 for (T obj : getPredecessors(queue.removeFirst())) { in findPredecessors()288 public Map<T, T> getPredecessors() { in getPredecessors() method in Graph.Node
33 for (T vprime : graph.getPredecessors(v)) { in run()
66 const auto &SuccPreds = Succ->getPredecessors(); in verifyBlocksInRegion()74 const auto &Predecessors = VPB->getPredecessors(); in verifyBlocksInRegion()
416 const VPBlocksTy &getPredecessors() const { return Predecessors; } in getPredecessors() function417 VPBlocksTy &getPredecessors() { return Predecessors; } in getPredecessors() function468 return getEnclosingBlockWithPredecessors()->getPredecessors(); in getHierarchicalPredecessors()1027 assert(Entry->getPredecessors().empty() && "Entry block has predecessors."); in VPBlockBase()1052 assert(EntryBlock->getPredecessors().empty() && in setEntry()1293 return N->getPredecessors().begin();1297 return N->getPredecessors().end();
166 !(Replica && getPredecessors().empty())) { /* C */ in execute()
158 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) { in addMergeRegs()182 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) { in writeFullMerge()
206 const std::vector<Block*>& getPredecessors() const { return predecessors; } in getPredecessors() function
126 public SortedSet<AnalyzedInstruction> getPredecessors() { in getPredecessors() method in AnalyzedInstruction
1249 … AnalyzedInstruction prevAnalyzedInstruction = analyzedInstruction.getPredecessors().first();