HomeSort by relevance Sort by last modified time
    Searched full:predecessors (Results 76 - 100 of 294) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/llvm/lib/Transforms/Utils/
BreakCriticalEdges.cpp 184 // have multiple phi nodes with *lots* of predecessors, this is a speed
225 // predecessors of DestBB are already dominated by DestBB (e.g. DestBB is a
229 // If there is a PHI in the block, loop over predecessors with it, which is
304 // other exit blocks of the loop that also have predecessors outside
362 // available, which means that all predecessors of loop exit blocks
LoopSimplify.cpp 19 // (blocks which are outside of the loop that have predecessors inside of the
20 // loop) only have predecessors from inside of the loop (and are thus dominated
150 // predecessors that are not in the loop. This is not valid for natural
220 // predecessors that are inside of the loop. This check guarantees that the
222 // predecessors from outside of the loop, split the edge now.
244 // If the header has more than two predecessors at this point (from the
374 // Compute the set of predecessors of the loop that are not in the loop.
415 /// blocks. This method is used to split exit blocks that have predecessors
449 /// predecessors, to the specified set, if it's not already in there. Stop
560 // Pull out all predecessors that have varying values in the loop. Thi
    [all...]
Local.cpp 549 // Make a list of the predecessors of BB
668 /// block's predecessors to the phi.
671 /// \param BBPreds The predecessors of BB.
682 // as a result we need to redirect edges from the predecessors of BB
685 // predecessor and successor blocks both share some predecessors,
686 // and where some of those common predecessors might have undef
698 // have common predecessors, we could end up with a phi node with
731 /// eliminate BB by rewriting all the predecessors to branch to the successor
745 // Check for cases where Succ has multiple predecessors and a PHI node in BB
749 // Succ has multiple predecessors. Also, it requires checking whethe
    [all...]
  /dalvik/vm/compiler/
Loop.cpp 98 int numPred = dvmCountSetBits(bb->predecessors);
100 dvmBitVectorIteratorInit(bb->predecessors, &bvIterator);
108 dvmIsBitSet(bb->predecessors, cUnit->entryBlock->id)) {
524 dvmClearAllBits(bb->predecessors);
532 int numPred = dvmCountSetBits(firstBB->predecessors);
647 dvmCompilerSetBit(bb->taken->predecessors, bb->id);
661 dvmCompilerSetBit(bb->fallThrough->predecessors, bb->id);
IntermediateRep.cpp 26 bb->predecessors = dvmCompilerAllocBitVector(blockId > 32 ? blockId : 32,
SSATransformation.cpp 246 /* Iterate through the predecessors */
247 dvmBitVectorIteratorInit(bb->predecessors, &bvIterator);
519 /* Iterate through the predecessors */
520 dvmBitVectorIteratorInit(bb->predecessors, &bvIterator);
  /dalvik/dx/src/com/android/dx/ssa/
SsaConverter.java 140 * Inserts Z nodes as new predecessors for every node that has multiple
141 * successors and multiple predecessors.
168 * predecessors needs a new predecessor node.
  /external/dexmaker/src/dx/java/com/android/dx/ssa/
SsaConverter.java 141 * Inserts Z nodes as new predecessors for every node that has multiple
142 * successors and multiple predecessors.
169 * predecessors needs a new predecessor node.
  /external/chromium/chrome/browser/sync/engine/
get_commit_ids_command.h 115 // OrderedCommitSet helpers for adding predecessors in order.
get_commit_ids_command.cc 96 return true; // Deleted items have no predecessors.
101 CHECK(prev.good()) << "Bad id when walking predecessors.";
  /external/libvpx/libvpx/vp8/common/
entropymode.c 102 explicitly-programmed predecessors. */
  /external/llvm/include/llvm/Analysis/
CFG.h 47 /// predecessors.
LoopInfoImpl.h 147 // Loop over the predecessors of the header node...
156 return 0; // Multiple predecessors outside the loop
162 assert(Out && "Header of loop has no predecessors from outside loop?");
297 assert(HasInsideLoopPreds && "Loop block has no in-loop predecessors!");
389 // Push all block predecessors on the worklist.
408 // Continue traversal along predecessors that are not loop-back edges from
IntervalIterator.h 185 // its predecessors are already in the graph. This also takes care of keeping
214 // If we get here, then all of the predecessors of BB are in the interval
  /external/bison/src/
AnnotationList.h 81 * - \c follow_kernel_items, \c always_follows, and \c predecessors were
111 state ***predecessors, bitset **item_lookahead_sets,
  /external/llvm/lib/CodeGen/
MachineBasicBlock.cpp 302 OS << " Predecessors according to CFG:";
396 assert(!B && "UpdateTerminators requires analyzable predecessors!");
565 Predecessors.push_back(pred);
569 pred_iterator I = std::find(Predecessors.begin(), Predecessors.end(), pred);
570 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!");
571 Predecessors.erase(I);
863 assert(VNI && "PHI sources should be live out of their predecessors.");
914 // If all the other predecessors of "Succ" are dominated by "Succ" itself
    [all...]
MachineSink.cpp 173 // Predecessors according to CFG: BB#0
181 // Predecessors according to CFG: BB#0 BB#1
371 // new block if all the predecessors of "To", except for "From", are
373 // predecessors are dominated by "To".
618 // If the block has multiple predecessors, this would introduce computation on
MachineSSAUpdater.cpp 146 // If there are no predecessors, just return undef.
189 // Fill in all the predecessors of the PHI.
282 /// FindPredecessorBlocks - Put the predecessors of BB into the Preds
  /art/compiler/dex/
ssa_transformation.cc 313 /* Iterate through the predecessors */
314 GrowableArray<BasicBlock*>::Iterator iter(bb->predecessors);
327 /* Scan the rest of the predecessors */
597 /* Iterate through the predecessors */
598 GrowableArray<BasicBlock*>::Iterator iter(bb->predecessors);
  /external/chromium_org/sync/engine/
get_commit_ids.cc 303 // Adds the given item, and all its unsynced predecessors. The traversal will
315 // already added the predecessors as well.
320 return; // Deleted items have no predecessors.
325 CHECK(prev.good()) << "Bad id when walking predecessors.";
334 // already added the predecessors as well.
  /external/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 161 // (a) changing the predecessors successor to the successor of this node
376 // Visit our predecessors and enqueue them.
410 // In the case that some of the intended predecessors of NewN have already
411 // been created, we should hook them up as predecessors.
413 // Walk through the predecessors of 'N' and hook up their corresponding
  /external/chromium_org/sync/internal_api/public/
sync_manager.h 100 // 2. Updates to existing items with synced parents & predecessors.
101 // 3. New items with synced parents & predecessors.
102 // 4. Items with parents & predecessors in |changes|.
  /external/llvm/lib/Analysis/
ProfileVerifierPass.cpp 246 // Read predecessors.
325 // If this is a block with no predecessors.
330 // If this block has successors and predecessors.
  /external/llvm/lib/IR/
BasicBlock.cpp 226 // If there are exactly two predecessors, then we want to nuke the PHI nodes
239 assert(max_idx != 0 && "PHI Node in block with 0 predecessors!?!?!");
247 // <= Two predecessors BEFORE I remove one?
  /external/chromium_org/v8/src/
hydrogen-escape-analysis.cc 142 for (int i = 0; i < block->predecessors()->length(); i++) {
259 if (succ->predecessors()->length() == 1) {

Completed in 1504 milliseconds

1 2 34 5 6 7 8 91011>>