/external/llvm/lib/Analysis/ |
SparsePropagation.cpp | 122 SmallVectorImpl<bool> &Succs, 124 Succs.resize(TI.getNumSuccessors()); 129 Succs[0] = true; 142 Succs[0] = Succs[1] = true; 153 Succs[0] = Succs[1] = true; 158 Succs[C->isNullValue()] = true; 165 Succs[0] = Succs[1] = true [all...] |
/external/llvm/lib/CodeGen/ |
ScheduleDAG.cpp | 81 for (SmallVectorImpl<SDep>::iterator II = PredSU->Succs.begin(), 82 EE = PredSU->Succs.end(); II != EE; ++II) { 123 N->Succs.push_back(P); 143 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(), 144 N->Succs.end(), P); 145 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!"); 146 N->Succs.erase(Succ); 186 for (SUnit::const_succ_iterator I = SU->Succs.begin(), 187 E = SU->Succs.end(); I != E; ++I) [all...] |
LatencyPriorityQueue.cpp | 77 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 93 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
MachineSink.cpp | 544 SmallVector<MachineBasicBlock*, 4> Succs(MBB->succ_begin(), MBB->succ_end()); 547 Succs.begin(), Succs.end(), 551 for (SmallVectorImpl<MachineBasicBlock *>::iterator SI = Succs.begin(), 552 E = Succs.end(); SI != E; ++SI) {
|
TailDuplication.cpp | 104 SmallSetVector<MachineBasicBlock*, 8> &Succs); 215 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(), 233 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs); 464 SmallSetVector<MachineBasicBlock*,8> &Succs) { 465 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(), 466 SE = Succs.end(); SI != SE; ++SI) { 674 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(), 686 if (bothUsedInPHI(*PredBB, Succs)) [all...] |
ScheduleDAGInstrs.cpp | 610 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end(); 641 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(), 642 JE = (*I)->Succs.end(); J != JE; ++J) [all...] |
IfConversion.cpp | [all...] |
PostRASchedulerList.cpp | 457 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
ExplodedGraph.h | 120 /// Succs - The successors of this node. 121 NodeGroup Succs; 127 : Location(loc), State(state), Succs(IsSink) { 180 unsigned succ_size() const { return Succs.size(); } 182 bool succ_empty() const { return Succs.empty(); } 185 bool isSink() const { return Succs.getFlag(); } 219 succ_iterator succ_begin() { return Succs.begin(); } 220 succ_iterator succ_end() { return Succs.end(); } 242 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); }
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
ResourcePriorityQueue.cpp | 112 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 149 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 237 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 276 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(), 277 E = Packet[i]->Succs.end(); I != E; ++I) { 527 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end() [all...] |
ScheduleDAGVLIW.cpp | 143 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
ScheduleDAGFast.cpp | 194 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 296 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 366 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 403 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 536 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
|
ScheduleDAGRRList.cpp | 741 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 852 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); [all...] |
/external/llvm/lib/Target/Hexagon/ |
HexagonVLIWPacketizer.cpp | 827 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) { 828 if ((PacketSU->Succs[i].getSUnit() == PacketSUDep) && 829 (PacketSU->Succs[i].getKind() == SDep::Anti) && 830 (PacketSU->Succs[i].getReg() == DepReg)) { [all...] |
HexagonMachineScheduler.cpp | 66 if (Packet[i]->Succs.size() == 0) 68 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(), 69 E = Packet[i]->Succs.end(); I != E; ++I) { 246 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 446 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 507 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
/external/clang/include/clang/Analysis/ |
CFG.h | 475 AdjacentBlocks Succs; 494 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false), 543 succ_iterator succ_begin() { return Succs.begin(); } 544 succ_iterator succ_end() { return Succs.end(); } 545 const_succ_iterator succ_begin() const { return Succs.begin(); } 546 const_succ_iterator succ_end() const { return Succs.end(); } 548 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); } 549 succ_reverse_iterator succ_rend() { return Succs.rend(); } 550 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); } 551 const_succ_reverse_iterator succ_rend() const { return Succs.rend(); [all...] |
/external/llvm/lib/Transforms/IPO/ |
PruneEH.cpp | 253 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB)); 255 for (unsigned i = 0, e = Succs.size(); i != e; ++i) 256 Succs[i]->removePredecessor(BB);
|
/external/llvm/lib/MC/MCAnalysis/ |
MCObjectDisassembler.cpp | 161 BBInfoSetTy Succs; 168 Succs.insert(&Succ); 239 // Compute succs/preds. 275 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end(); 283 // Set preds/succs. 289 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end(); 309 // - if there is, split it (new one, fallthrough, move succs, etc..) 312 // - look at the last instruction in the atom, add succs to worklis [all...] |
MCModuleYAML.cpp | 111 std::vector<yaml::Hex64> Succs; 203 IO.mapRequired("Succs", BB.Succs); 351 BB.Succs.push_back((*SI)->getInsts()->getBeginAddr()); 427 for (AddrIt SI = BBI->Succs.begin(), SE = BBI->Succs.end(); SI != SE;
|
/external/clang/lib/StaticAnalyzer/Core/ |
ExplodedGraph.cpp | 221 V->Succs.addNode(this, G); 432 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end();
|
/external/llvm/include/llvm/Analysis/ |
SparsePropagation.h | 195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
|
/external/llvm/lib/Transforms/Scalar/ |
SCCP.cpp | 443 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs); 518 SmallVectorImpl<bool> &Succs) { 519 Succs.resize(TI.getNumSuccessors()); 522 Succs[0] = true; 532 Succs[0] = Succs[1] = true; 537 Succs[CI->isZero()] = true; 543 Succs[0] = Succs[1] = true; 549 Succs[0] = true [all...] |
/external/llvm/include/llvm/CodeGen/ |
ScheduleDAG.h | 268 // Preds/Succs - The SUnits before/after us in the graph. 270 SmallVector<SDep, 4> Succs; // All sunit successors. 282 unsigned NumSuccsLeft; // # of succs not scheduled. 284 unsigned WeakSuccsLeft; // # of weak succs not scheduled. 461 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i) 462 if (Succs[i].getSUnit() == N)
|
/external/llvm/lib/Target/R600/ |
R600Packetizer.cpp | 200 for (unsigned i = 0, e = SUJ->Succs.size(); i < e; ++i) { 201 const SDep &Dep = SUJ->Succs[i];
|
/external/llvm/lib/Transforms/Instrumentation/ |
GCOVProfiling.cpp | 122 const UniqueVector<BasicBlock*>&Succs); 709 const UniqueVector<BasicBlock *> &Succs) { 714 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]]. 715 size_t TableSize = Succs.size() * Preds.size(); 734 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) + [all...] |