Searched refs:Succs (Results 1 - 25 of 32) sorted by relevance

12

/freebsd-10.0-release/contrib/llvm/tools/llvm-objdump/
H A DMCFunction.h51 SetTy Succs; member in class:llvm::MCBasicBlock
56 succ_iterator succ_begin() const { return Succs.begin(); }
57 succ_iterator succ_end() const { return Succs.end(); }
59 bool contains(uint64_t Addr) const { return Succs.count(Addr); }
62 void addSucc(uint64_t Addr) { Succs.insert(Addr); }
/freebsd-10.0-release/contrib/llvm/lib/Analysis/
H A DSparsePropagation.cpp121 SmallVectorImpl<bool> &Succs,
123 Succs.resize(TI.getNumSuccessors());
128 Succs[0] = true;
141 Succs[0] = Succs[1] = true;
152 Succs[0] = Succs[1] = true;
157 Succs[C->isNullValue()] = true;
164 Succs[0] = Succs[
120 getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs, bool AggressiveUndef) argument
[all...]
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp80 for (SmallVector<SDep, 4>::iterator II = PredSU->Succs.begin(),
81 EE = PredSU->Succs.end(); II != EE; ++II) {
122 N->Succs.push_back(P);
142 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(),
143 N->Succs.end(), P);
144 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
145 N->Succs.erase(Succ);
185 for (SUnit::const_succ_iterator I = SU->Succs.begin(),
186 E = SU->Succs.end(); I != E; ++I) {
275 for (SUnit::const_succ_iterator I = Cur->Succs
[all...]
H A DLatencyPriorityQueue.cpp76 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
92 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
H A DMachineSink.cpp538 SmallVector<MachineBasicBlock*, 4> Succs(MBB->succ_begin(), MBB->succ_end());
539 std::stable_sort(Succs.begin(), Succs.end(), SuccessorSorter(LI));
540 for (SmallVector<MachineBasicBlock*, 4>::iterator SI = Succs.begin(),
541 E = Succs.end(); SI != E; ++SI) {
H A DTailDuplication.cpp100 SmallSetVector<MachineBasicBlock*, 8> &Succs);
201 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(),
219 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs);
456 SmallSetVector<MachineBasicBlock*,8> &Succs) {
457 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(),
458 SE = Succs.end(); SI != SE; ++SI) {
643 SmallPtrSet<MachineBasicBlock*, 8> Succs(BB.succ_begin(), BB.succ_end());
668 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(),
680 if (bothUsedInPHI(*PredBB, Succs))
454 UpdateSuccessorsPHIs(MachineBasicBlock *FromBB, bool isDead, SmallVector<MachineBasicBlock*, 8> &TDBBs, SmallSetVector<MachineBasicBlock*,8> &Succs) argument
H A DScheduleDAGInstrs.cpp596 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end();
627 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(),
628 JE = (*I)->Succs.end(); J != JE; ++J)
1172 for (SUnit::const_succ_iterator SI = PredSU->Succs.begin(),
1173 SE = PredSU->Succs.end(); SI != SE; ++SI) {
1237 SI = SU->Succs.begin(), SE = SU->Succs.end(); SI != SE; ++SI) {
H A DMachineScheduler.cpp375 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
836 SI = SUa->Succs.begin(), SE = SUa->Succs.end(); SI != SE; ++SI) {
1042 I = LastLocalSU->Succs.begin(), E = LastLocalSU->Succs.end();
1480 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
2323 SmallVectorImpl<SDep> &Deps = isTop ? SU->Preds : SU->Succs;
2332 if (isTop ? DepSU->Succs
[all...]
H A DIfConversion.cpp1538 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(),
1543 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
1544 MachineBasicBlock *Succ = Succs[i];
1574 std::vector<MachineBasicBlock *> Succs(FromBBI.BB->succ_begin(),
1579 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
1580 MachineBasicBlock *Succ = Succs[i];
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h120 /// Succs - The successors of this node.
121 NodeGroup Succs; member in class:clang::ento::ExplodedNode
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); }
/freebsd-10.0-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp111 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
148 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
236 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
275 for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(),
276 E = Packet[i]->Succs.end(); I != E; ++I) {
527 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs
[all...]
H A DScheduleDAGVLIW.cpp141 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
H A DScheduleDAGFast.cpp193 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
295 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
365 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
402 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
535 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
H A DScheduleDAGRRList.cpp739 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
850 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1030 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1110 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1150 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp66 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) {
242 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
442 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
505 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
H A DHexagonVLIWPacketizer.cpp2541 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) {
2542 if ((PacketSU->Succs[i].getSUnit() == PacketSUDep) &&
2543 (PacketSU->Succs[i].getKind() == SDep::Anti) &&
2544 (PacketSU->Succs[i].getReg() == DepReg)) {
2596 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) {
2602 if (PacketSU->Succs[i].getSUnit() == SU &&
2604 PacketSU->Succs[i].getReg()) &&
2605 PacketSU->Succs[i].getKind() == SDep::Data &&
2612 RestrictingDepExistInPacket(*VIN,PacketSU->Succs[i].getReg(),
2834 (i < SUJ->Succs
[all...]
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Analysis/
H A DCFG.h367 AdjacentBlocks Succs;
386 BlockID(blockid), Preds(C, 1), Succs(C, 1), HasNoReturnElement(false),
435 succ_iterator succ_begin() { return Succs.begin(); }
436 succ_iterator succ_end() { return Succs.end(); }
437 const_succ_iterator succ_begin() const { return Succs.begin(); }
438 const_succ_iterator succ_end() const { return Succs.end(); }
440 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); }
441 succ_reverse_iterator succ_rend() { return Succs.rend(); }
442 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); }
443 const_succ_reverse_iterator succ_rend() const { return Succs
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopUnswitch.cpp1026 SmallVector<BasicBlock*, 4> Succs; local
1028 Succs.push_back(TI->getSuccessor(i));
1033 array_pod_sort(Succs.begin(), Succs.end());
1034 Succs.erase(std::unique(Succs.begin(), Succs.end()), Succs.end());
1043 for (unsigned i = 0; i != Succs.size(); ++i)
1044 if (pred_begin(Succs[
[all...]
H A DSCCP.cpp442 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs);
516 SmallVector<bool, 16> &Succs) {
517 Succs.resize(TI.getNumSuccessors());
520 Succs[0] = true;
530 Succs[0] = Succs[1] = true;
535 Succs[CI->isZero()] = true;
541 Succs[0] = Succs[1] = true;
547 Succs[
515 getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs) argument
[all...]
/freebsd-10.0-release/contrib/llvm/lib/Transforms/IPO/
H A DPruneEH.cpp254 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));
256 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
257 Succs[i]->removePredecessor(BB);
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp216 V->Succs.addNode(this, G);
428 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end();
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/
H A DSparsePropagation.h195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h281 // Preds/Succs - The SUnits before/after us in the graph.
283 SmallVector<SDep, 4> Succs; // All sunit successors. member in class:llvm::SUnit
466 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
467 if (Succs[i].getSUnit() == N)
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/
H A DR600Packetizer.cpp185 for (unsigned i = 0, e = SUJ->Succs.size(); i < e; ++i) {
186 const SDep &Dep = SUJ->Succs[i];
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Instrumentation/
H A DGCOVProfiling.cpp118 const UniqueVector<BasicBlock*>&Succs);
601 const UniqueVector<BasicBlock *> &Succs) {
607 size_t TableSize = Succs.size() * Preds.size();
626 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
597 buildEdgeLookupTable( Function *F, GlobalVariable *Counters, const UniqueVector<BasicBlock *> &Preds, const UniqueVector<BasicBlock *> &Succs) argument

Completed in 232 milliseconds

12