/prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
basic-block.h | 133 VEC(edge,gc) *succs; 530 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \ 536 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i)) 543 return EDGE_COUNT (bb->succs) == 1; 706 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
|
sbitmap.h | 254 /* Intersection and Union of preds/succs using the new flow graph
|
/prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
basic-block.h | 133 VEC(edge,gc) *succs; 530 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \ 536 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i)) 543 return EDGE_COUNT (bb->succs) == 1; 706 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
|
sbitmap.h | 254 /* Intersection and Union of preds/succs using the new flow graph
|
/prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
basic-block.h | 133 VEC(edge,gc) *succs; 530 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \ 536 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i)) 543 return EDGE_COUNT (bb->succs) == 1; 706 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
|
sbitmap.h | 254 /* Intersection and Union of preds/succs using the new flow graph
|
/external/llvm/lib/Transforms/Scalar/ |
SCCP.cpp | 449 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs); 523 SmallVector<bool, 16> &Succs) { 524 Succs.resize(TI.getNumSuccessors()); 527 Succs[0] = true; 537 Succs[0] = Succs[1] = true; 542 Succs[CI->isZero()] = true; 548 Succs[0] = Succs[1] = true; 554 Succs[0] = true [all...] |
ObjCARC.cpp | [all...] |
/external/llvm/include/llvm/Analysis/ |
SparsePropagation.h | 195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
|
IntervalIterator.h | 138 while (SuccIt != EndIt) { // Loop over all interval succs
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
ScheduleDAGSDNodes.cpp | 362 // Scan down to find any glued succs. 427 // Pass 2: add the preds, succs, etc. 769 for (SUnit::const_succ_iterator II = SU->Succs.begin(), 770 EE = SU->Succs.end(); II != EE; ++II) { [all...] |
SelectionDAGBuilder.cpp | 2584 SmallVector<BasicBlock*, 32> succs; local [all...] |
SelectionDAGISel.cpp | [all...] |
/prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
sbitmap.h | 254 /* Intersection and Union of preds/succs using the new flow graph
|
/external/clang/lib/StaticAnalyzer/Core/ |
ExplodedGraph.cpp | 184 V->Succs.addNode(this, G); 410 for (ExplodedNode::succ_iterator I = N->Succs.begin(), E = N->Succs.end();
|
/external/llvm/lib/Target/Hexagon/ |
HexagonVLIWPacketizer.cpp | [all...] |
/external/llvm/lib/CodeGen/ |
IfConversion.cpp | [all...] |
ScheduleDAGInstrs.cpp | 645 for (SUnit::const_succ_iterator I = SUb->Succs.begin(), E = SUb->Succs.end(); 676 for (SUnit::const_succ_iterator J = (*I)->Succs.begin(), 677 JE = (*I)->Succs.end(); J != JE; ++J) [all...] |
MachineScheduler.cpp | 457 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); 600 if (I->Succs.empty()) 926 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); [all...] |
MachineVerifier.cpp | 124 BlockSet Preds, Succs; 457 MInfo.Succs.insert(I->succ_begin(), I->succ_end()); 458 if (MInfo.Succs.size() != I->succ_size()) 511 if (!MBBInfoMap[*I].Succs.count(MBB)) { [all...] |
PostRASchedulerList.cpp | 617 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
/external/llvm/lib/Transforms/Utils/ |
CodeExtractor.cpp | 751 std::vector<BasicBlock*> Succs(succ_begin(codeReplacer), 753 for (unsigned i = 0, e = Succs.size(); i != e; ++i) 754 for (BasicBlock::iterator I = Succs[i]->begin(); isa<PHINode>(I); ++I) {
|
SimplifyCFG.cpp | [all...] |
/external/valgrind/main/helgrind/ |
hg_main.c | 3595 WordSetID succs; local 3741 WordSetID preds, succs; local [all...] |
/external/llvm/lib/Target/ARM/ |
ARMConstantIslandPass.cpp | [all...] |