| /external/llvm/lib/Analysis/ |
| CFG.cpp | 87 /// with multiple predecessors.
150 // have predecessors.
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGVLIW.cpp | 132 // If all the node's predecessors are scheduled, this node is ready
176 // It is available if it has no predecessors.
|
| ScheduleDAGSDNodes.h | 78 /// predecessors / successors info nor the temporary scheduling states.
|
| /external/llvm/lib/Target/X86/ |
| README-X86-64.txt | 111 Predecessors according to CFG: 0x203aec0 (#0)
116 Predecessors according to CFG: 0x203af10 (#1) 0x203af60 (#2)
|
| /external/llvm/lib/Transforms/Scalar/ |
| CorrelatedValuePropagation.cpp | 159 /// the predecessors and statically evaluate the comparison based on information
201 /// predecessors and statically evaluate cases based on information available
|
| Reg2Mem.cpp | 77 "Entry block to function must not have predecessors!");
|
| GVN.cpp | 760 // Otherwise, see if it is fully available in all predecessors.
763 // If this block has no predecessors, it isn't live-in here.
768 // If the value isn't fully available in one of our predecessors, then it
[all...] |
| /external/llvm/test/Transforms/LICM/ |
| 2006-09-12-DeadUserOfSunkInstr.ll | 86 cond_true199.i.us: ; No predecessors!
102 cond_true230.i: ; No predecessors!
|
| /external/chromium_org/v8/src/ |
| hydrogen-representation-changes.cc | 39 next = use_value->block()->predecessors()->at(use_index)->end();
|
| /external/clang/test/CodeGen/ |
| switch.c | 204 // case range so that the case block has no predecessors
|
| /external/clang/test/CodeGenObjC/ |
| exceptions.m | 149 // finally.call-exit: Predecessors are the @try and @catch fallthroughs
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 221 /// setHeightToAtLeast - Update this node's predecessors to reflect the
336 dbgs() << " Predecessors:\n";
421 dbgs() << "has predecessors left!\n";
536 /// an edge to be removed from the specified node N from the predecessors
|
| MachineBlockPlacement.cpp | 154 /// \brief Count of predecessors within the loop currently being processed.
157 /// in-loop predecessors of this chain.
596 // Walk backwards through any straight line of predecessors.
619 // header has be pre-merged into a chain due to predecessors not having
[all...] |
| BranchFolding.cpp | 49 // Throttle for huge numbers of predecessors (compile speed problems)
52 cl::desc("Max number of predecessors to consider tail merging"),
848 // Look at blocks (IBB) with multiple predecessors (PBB).
860 // With those changes, we see whether the predecessors' tails match,
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| 2009-11-17-UpdateTerminator.ll | 3 ; Assertion failed: (!B && "UpdateTerminators requires analyzable predecessors!"), function updateTerminator, MachineBasicBlock.cpp, line 255.
|
| 2013-01-09-DAGCombineBug.ll | 50 bb1: ; No predecessors!
|
| /external/llvm/test/Transforms/ADCE/ |
| basictest2.ll | 37 bb4: ; No predecessors!
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| 2012-07-13-ExpandUDiv.ll | 84 func_4.exit: ; No predecessors!
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| iterative-simplify.ll | 87 cond_next34: ; No predecessors!
|
| /external/valgrind/main/ |
| glibc-2.X-drd.supp | 38 # and their predecessors) contain an implementation of the std::string class
|
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 322 /// Lazily compute the number of predecessors a block has.
773 // have incoming values for all predecessors. Loop over all PHI nodes we have
797 // basic blocks. Start by sorting the incoming predecessors for efficient
841 // To determine liveness, we must iterate through the predecessors of blocks
843 // check their predecessors. Start with all the using blocks.
882 // their predecessors until we find the full region the value is live.
[all...] |
| /external/clang/include/clang/Analysis/FlowSensitive/ |
| DataflowSolver.h | 60 // over successors/predecessors of a block depending on the direction
229 // Merge dataflow values from all predecessors of this block.
|
| /external/llvm/lib/IR/ |
| Dominators.cpp | 197 // dominates all of NormalDest's predecessors (X, B, C in the example). X
199 // other predecessors. Since the only way out of X is via NormalDest, X can
|
| /external/v8/src/ |
| hydrogen.cc | 241 if (predecessors()->length() == 1) {
249 for (int i = 1; i < predecessors()->length(); ++i) {
250 loop_information()->RegisterBackEdge(predecessors()->at(i));
344 // If more successors than predecessors have been seen in the loop up to
428 for (int i = 0; i < block->predecessors()->length(); ++i) {
429 AddBlock(block->predecessors()->at(i));
508 ASSERT(first->predecessors()->Contains(block));
510 ASSERT(second->predecessors()->Contains(block));
520 // Check that all join blocks have predecessors that end with an
522 if (block->predecessors()->length() >= 2)
[all...] |
| /dalvik/vm/compiler/ |
| CompilerIR.h | 170 BitVector *predecessors; member in struct:BasicBlock
|
