| /external/llvm/test/CodeGen/X86/ |
| 2010-01-11-ExtraPHIArg.ll | 83 bb2060.i: ; No predecessors!
92 cond_next3473: ; No predecessors!
95 cond_next3521: ; No predecessors!
|
| unaligned-load.ll | 18 return: ; No predecessors!
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| EqualPHIEdgeBlockMerge.ll | 48 ; R's incoming value is undef and both of those predecessors are simple
78 ; V's incoming value is undef and both of those predecessors are simple
79 ; unconditional branches. Note that X has predecessors beyond
80 ; the direct predecessors of U.
106 ; After merging X into Y, we should have 5 predecessors
|
| /dalvik/vm/analysis/ |
| VfyBasicBlock.cpp | 86 newBlock->predecessors = dvmPointerSetAlloc(32);
87 if (newBlock->predecessors == NULL) {
96 dvmPointerSetFree(newBlock->predecessors);
127 PointerSet* preds = targetBlock->predecessors;
230 if (dvmPointerSetGetCount(curBlock->predecessors) > 256) {
259 PointerSet* preds = block->predecessors;
546 dvmPointerSetFree(block->predecessors);
|
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 76 std::map<change_ty, std::vector<change_ty> > Predecessors;
84 assert(Predecessors.count(Node) && "Invalid node!");
85 return Predecessors[Node].begin();
88 assert(Predecessors.count(Node) && "Invalid node!");
89 return Predecessors[Node].end();
192 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()));
197 Predecessors[it->second].push_back(it->first);
|
| /art/compiler/dex/ |
| mir_graph.cc | 159 bottom_block->taken->predecessors->Delete(orig_block);
160 bottom_block->taken->predecessors->Insert(bottom_block);
166 bottom_block->predecessors->Insert(orig_block);
168 bottom_block->fall_through->predecessors->Delete(orig_block);
169 bottom_block->fall_through->predecessors->Insert(bottom_block);
181 bb->predecessors->Delete(orig_block);
182 bb->predecessors->Insert(bottom_block);
312 taken_block->predecessors->Insert(cur_block);
335 fallthrough_block->predecessors->Insert(cur_block);
409 case_block->predecessors->Insert(cur_block)
[all...] |
| mir_optimization.cc | 23 static unsigned int Predecessors(BasicBlock* bb) {
24 return bb->predecessors->Size();
112 if ((bb == NULL) || Predecessors(bb) != 1) {
164 if (bb == NULL || (Predecessors(bb) != 1)) {
347 (Predecessors(tk) == 1) && (Predecessors(ft) == 1)) {
511 if ((walker->block_type == kEntryBlock) || (Predecessors(walker) != 1)) {
514 BasicBlock* prev = walker->predecessors->Get(0);
583 DCHECK_EQ(Predecessors(bb_next), 1U);
633 } else if (bb->predecessors->Size() == 1)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 63 /// multiple predecessors and multiple successors. If one or more of the
64 /// predecessors of the block can be proven to always jump to one of the
321 /// in any of our predecessors. If so, return the known list of value and pred
340 // If V is a constant, then it is known in all predecessors.
354 // of any of our predecessors.
515 // live-in value on any predecessors.
608 /// fewest predecessors. This should reduce the in-degree of the others.
614 // Compute the successor with the minimum number of predecessors.
638 /// ProcessBlock - If there are any predecessors whose control can be threaded
650 // predecessors of our predecessor block
[all...] |
| /dalvik/vm/compiler/ |
| Frontend.cpp | 538 dvmCompilerClearBit(bottomBlock->taken->predecessors, origBlock->id);
539 dvmCompilerSetBit(bottomBlock->taken->predecessors, bottomBlock->id);
547 dvmCompilerSetBit(bottomBlock->predecessors, origBlock->id);
549 dvmCompilerClearBit(bottomBlock->fallThrough->predecessors,
551 dvmCompilerSetBit(bottomBlock->fallThrough->predecessors,
568 dvmCompilerClearBit(bb->predecessors, origBlock->id);
569 dvmCompilerSetBit(bb->predecessors, bottomBlock->id);
796 /* Verify if all the successor is connected with all the claimed predecessors */
801 dvmBitVectorIteratorInit(bb->predecessors, &bvIterator);
942 dvmCompilerSetBit(takenBlock->predecessors, curBlock->id)
[all...] |
| /external/llvm/lib/CodeGen/ |
| ShrinkWrapping.cpp | 236 /// predecessors.
241 // AvailIn[MBB] = INTERSECT(AvailOut[P] for P in PREDECESSORS(MBB))
242 SmallVector<MachineBasicBlock*, 4> predecessors; local
247 predecessors.push_back(PRED);
250 unsigned i = 0, e = predecessors.size();
253 MachineBasicBlock* PRED = predecessors[i];
257 PRED = predecessors[i];
295 // available at predecessors of MBB.
448 assert(HDR->pred_size() > 0 && "Loop header has no predecessors?");
592 // Propagate selected bits to successors, predecessors of MBB
682 SmallVector<MachineBasicBlock*, 4> predecessors; local
[all...] |
| TailDuplication.cpp | 1 //===-- TailDuplication.cpp - Duplicate blocks into predecessors' tails ---===//
11 // the tails of their predecessors.
214 // TailBB's immediate successors are now successors of those predecessors
215 // which duplicated TailBB. Add the predecessors as sources to the PHI
300 /// into their predecessors to eliminate (dynamic) branches.
449 /// blocks, the successors have gained new predecessors. Update the PHI
514 // Live in tail block, must also be live in predecessors.
562 // that rearrange the predecessors of the indirect branch.
738 /// of its predecessors.
753 // Iterate through all the unique predecessors and tail-duplicate thi
[all...] |
| /external/bison/src/ |
| AnnotationList.c | 196 state ***predecessors,
211 predecessors, item_lookahead_sets))
221 state ***predecessors,
231 for (predecessor = predecessors[s->number]; *predecessor; ++predecessor)
287 follow_kernel_items, always_follows, predecessors,
320 predecessors,
396 follow_kernel_items, always_follows, predecessors,
412 state ***predecessors, bitset **item_lookahead_sets,
496 always_follows, predecessors, item_lookahead_sets,
558 follow_kernel_items, always_follows, predecessors,
[all...] |
| ielr.c | 379 symbol_number lookahead, state ***predecessors,
423 check all predecessors' goto follows for the LHS. */
428 for (predecessor = predecessors[s->number];
441 for (predecessor = predecessors[s->number];
455 predecessors, item_lookahead_sets);
469 * - \c follow_kernel_items, \c always_follows, and \c predecessors
484 bitsetv always_follows, state ***predecessors,
511 states[i], follow_kernel_items, always_follows, predecessors,
1133 state ***predecessors; local
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| FlattenCFG.cpp | 66 /// if.then: // has two predecessors, both of them contains conditional branch.
121 /// as its predecessors.
134 // Check predecessors of \param BB.
141 // All predecessors should terminate with a branch.
152 // branch among the predecessors.
192 // for all of its predecessors.
|
| /external/chromium_org/v8/src/ |
| hydrogen-environment-liveness.cc | 210 // store computed information for this block and add predecessors
216 for (int i = 0; i < block->predecessors()->length(); ++i) {
217 worklist.Add(block->predecessors()->at(i)->block_id());
|
| hydrogen-range-analysis.cc | 65 if (block->predecessors()->length() == 1) {
66 HBasicBlock* pred = block->predecessors()->first();
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLImport.h | 83 bool m_blocked; // If any of decendants or predecessors is in processing, it is blocked.
|
| /external/llvm/lib/Target/X86/ |
| X86VZeroUpper.cpp | 60 // the state to dirty, or one of the incoming predecessors is unknown
180 // Each BB state depends on all predecessors, loop over until everything
211 // Check the state of all predecessors
229 // The current state is initialized according to the predecessors
|
| /external/llvm/test/CodeGen/ARM/ |
| 2010-08-04-EHCrash.ll | 14 bb: ; No predecessors!
|
| tail-dup.ll | 4 ; into all of its predecessors.
|
| /external/llvm/test/Transforms/LoopSimplify/ |
| 2003-12-10-ExitBlocksProblem.ll | 3 ; have predecessors from outside of the loop!
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| IdenticalBlockCombiner.java | 28 * but different predecessors. These blocks are then combined into a single
71 // ...look at all of it's predecessors that have only one succ...
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/back/ |
| IdenticalBlockCombiner.java | 33 * but different predecessors. These blocks are then combined into a single
76 // ...look at all of it's predecessors that have only one succ...
|
| /external/llvm/include/llvm/Analysis/ |
| PHITransAddr.h | 26 /// As we walk "up" the CFG through predecessors, we need to ensure that the
57 /// BasicBlock to its predecessors requires PHI translation.
|
| /external/chromium_org/sync/engine/ |
| get_commit_ids_command.cc | 233 // Adds the given item, and all its unsynced predecessors. The traversal will
246 // already added the predecessors as well.
251 return; // Deleted items have no predecessors.
256 CHECK(prev.good()) << "Bad id when walking predecessors.";
265 // already added the predecessors as well.
|
