| /external/llvm/lib/Analysis/ |
| SparsePropagation.cpp | 121 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[1] = true
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 114 N->Succs.push_back(P);
135 for (SmallVector<SDep, 4>::iterator II = N->Succs.begin(),
136 EE = N->Succs.end(); II != EE; ++II)
139 N->Succs.erase(II);
142 assert(FoundSucc && "Mismatching preds / succs lists!");
174 for (SUnit::const_succ_iterator I = SU->Succs.begin(),
175 E = SU->Succs.end(); I != E; ++I) {
264 for (SUnit::const_succ_iterator I = Cur->Succs.begin(),
265 E = Cur->Succs.end(); I != E; ++I) {
298 dbgs() << " # succs left : " << NumSuccsLeft << "\n"
[all...] |
| ScheduleDAGEmit.cpp | 46 for (SUnit::const_succ_iterator II = SU->Succs.begin(),
47 EE = SU->Succs.end(); II != EE; ++II) {
|
| LatencyPriorityQueue.cpp | 76 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();
|
| TailDuplication.cpp | 95 SmallSetVector<MachineBasicBlock*, 8> &Succs);
190 SmallSetVector<MachineBasicBlock*, 8> Succs(MBB->succ_begin(),
208 UpdateSuccessorsPHIs(MBB, isDead, TDBBs, Succs);
443 SmallSetVector<MachineBasicBlock*,8> &Succs) {
444 for (SmallSetVector<MachineBasicBlock*, 8>::iterator SI = Succs.begin(),
445 SE = Succs.end(); SI != SE; ++SI) {
631 SmallPtrSet<MachineBasicBlock*, 8> Succs(BB.succ_begin(), BB.succ_end());
656 SmallPtrSet<MachineBasicBlock*, 8> Succs(TailBB->succ_begin(),
668 if (bothUsedInPHI(*PredBB, Succs))
[all...] |
| IfConversion.cpp | [all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 114 /// Succs - The successors of this node.
115 NodeGroup Succs;
164 unsigned succ_size() const { return Succs.size(); }
166 bool succ_empty() const { return Succs.empty(); }
169 bool isSink() const { return Succs.getFlag(); }
170 void markAsSink() { Succs.setFlag(); }
196 succ_iterator succ_begin() { return Succs.begin(); }
197 succ_iterator succ_end() { return Succs.end(); }
219 void replaceSuccessor(ExplodedNode *node) { Succs.replaceNode(node); }
|
| /external/clang/include/clang/Analysis/ |
| CFG.h | 336 AdjacentBlocks Succs;
341 BlockID(blockid), Preds(C, 1), Succs(C, 1) {}
389 succ_iterator succ_begin() { return Succs.begin(); }
390 succ_iterator succ_end() { return Succs.end(); }
391 const_succ_iterator succ_begin() const { return Succs.begin(); }
392 const_succ_iterator succ_end() const { return Succs.end(); }
394 succ_reverse_iterator succ_rbegin() { return Succs.rbegin(); }
395 succ_reverse_iterator succ_rend() { return Succs.rend(); }
396 const_succ_reverse_iterator succ_rbegin() const { return Succs.rbegin(); }
397 const_succ_reverse_iterator succ_rend() const { return Succs.rend();
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGFast.cpp | 188 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
290 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
358 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
395 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
530 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
|
| ScheduleDAGRRList.cpp | 623 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
689 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
868 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
946 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
[all...] |
| ScheduleDAGList.cpp | 131 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | [all...] |
| SCCP.cpp | 454 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs);
550 SmallVector<bool, 16> &Succs) {
551 Succs.resize(TI.getNumSuccessors());
554 Succs[0] = true;
564 Succs[0] = Succs[1] = true;
569 Succs[CI->isZero()] = true;
575 Succs[0] = Succs[1] = true;
586 Succs.assign(TI.getNumSuccessors(), true)
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 85 const UniqueVector<BasicBlock *> &Succs);
532 const UniqueVector<BasicBlock *> &Succs) {
537 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
540 Int64PtrTy, Succs.size() * Preds.size());
542 Constant **EdgeTable = new Constant*[Succs.size() * Preds.size()];
544 for (int i = 0, ie = Succs.size() * Preds.size(); i != ie; ++i)
557 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
564 ArrayRef<Constant*> V(&EdgeTable[0], Succs.size() * Preds.size());
|
| /external/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 250 std::vector<BasicBlock*> Succs(succ_begin(BB), succ_end(BB));
252 for (unsigned i = 0, e = Succs.size(); i != e; ++i)
253 Succs[i]->removePredecessor(BB);
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaMethod.java | 379 BitSet succs = block.getSuccessors(); local
380 for (int i = succs.nextSetBit(0); i >= 0;
381 i = succs.nextSetBit(i + 1)) {
852 BitSet succs = block.getSuccessors(); local
853 for (int i = succs.nextSetBit(0); i >= 0;
854 i = succs.nextSetBit(i + 1)) {
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 236 // Preds/Succs - The SUnits before/after us in the graph.
238 SmallVector<SDep, 4> Succs; // All sunit successors.
250 unsigned NumSuccsLeft; // # of succs not scheduled.
406 for (unsigned i = 0, e = (unsigned)Succs.size(); i != e; ++i)
407 if (Succs[i].getSUnit() == N)
550 /// BuildSchedGraph - Build SUnits and set up their Preds and Succs
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 144 V->Succs.addNode(this, G);
365 for (ExplodedNode **I=N->Succs.begin(), **E=N->Succs.end(); I!=E; ++I) {
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| basic-block.h | 231 VEC(edge,gc) *succs;
630 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
636 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i))
643 return EDGE_COUNT (bb->succs) == 1;
806 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
[all...] |
| sbitmap.h | 260 /* Intersection and Union of preds/succs using the new flow graph
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| basic-block.h | 231 VEC(edge,gc) *succs;
630 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
636 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i))
643 return EDGE_COUNT (bb->succs) == 1;
806 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
[all...] |
| sbitmap.h | 260 /* Intersection and Union of preds/succs using the new flow graph
|
| /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/ |
| basic-block.h | 231 VEC(edge,gc) *succs;
630 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
636 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i))
643 return EDGE_COUNT (bb->succs) == 1;
806 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
[all...] |
| sbitmap.h | 260 /* Intersection and Union of preds/succs using the new flow graph
|
| /external/llvm/include/llvm/Analysis/ |
| SparsePropagation.h | 195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
|
