Searched refs:Predecessors (Results 1 – 13 of 13) sorted by relevance
49 Predecessors.push_back(MCBB); in addPredecessor()53 return std::find(Predecessors.begin(), Predecessors.end(), in isPredecessor()54 MCBB) != Predecessors.end(); in isPredecessor()
71 std::vector<MachineBasicBlock *> Predecessors;260 pred_iterator pred_begin() { return Predecessors.begin(); }261 const_pred_iterator pred_begin() const { return Predecessors.begin(); }262 pred_iterator pred_end() { return Predecessors.end(); }263 const_pred_iterator pred_end() const { return Predecessors.end(); }265 { return Predecessors.rbegin();}267 { return Predecessors.rbegin();}269 { return Predecessors.rend(); }271 { return Predecessors.rend(); }273 return (unsigned)Predecessors.size();[all …]
45 BasicBlockListTy Predecessors; variable65 pred_const_iterator pred_begin() const { return Predecessors.begin(); } in pred_begin()66 pred_const_iterator pred_end() const { return Predecessors.end(); } in pred_end()
69 std::vector<BasicBlock*> Predecessors; variable118 return I->Predecessors.begin(); in pred_begin()121 return I->Predecessors.end(); in pred_end()
76 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anone45063c50111::DAGDeltaAlgorithmImpl84 assert(Predecessors.count(Node) && "Invalid node!"); in pred_begin()85 return Predecessors[Node].begin(); in pred_begin()88 assert(Predecessors.count(Node) && "Invalid node!"); in pred_end()89 return Predecessors[Node].end(); in pred_end()192 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()197 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
50 for (std::vector<BasicBlock*>::const_iterator I = Predecessors.begin(), in print()51 E = Predecessors.end(); I != E; ++I) in print()
62 getBlockInterval(*I)->Predecessors.push_back(Header); in updatePredecessors()
7 ; Predecessors according to CFG: BB#4 BB#517 ; Predecessors according to CFG: BB#4 BB#5
565 Predecessors.push_back(pred); in addPredecessor()569 pred_iterator I = std::find(Predecessors.begin(), Predecessors.end(), pred); in removePredecessor()570 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); in removePredecessor()571 Predecessors.erase(I); in removePredecessor()
40 Predecessors according to CFG: 0x8b0c5f0 (#3) 0x8b0a7c0 (#4)
111 Predecessors according to CFG: 0x203aec0 (#0)116 Predecessors according to CFG: 0x203af10 (#1) 0x203af60 (#2)
149 // finally.call-exit: Predecessors are the @try and @catch fallthroughs
1400 Predecessors (0):1407 Predecessors (1): B51412 Predecessors (1): B41418 Predecessors (1): B41423 Predecessors (2): B2 B31427 Predecessors (1): B1