HomeSort by relevance Sort by last modified time
    Searched full:succ (Results 51 - 75 of 121) sorted by null

1 23 4 5

  /dalvik/dx/src/com/android/dx/cf/code/
Ropper.java 755 int succ = successors.get(i); local
757 mergeAndWorkAsNecessary(succ, block.getLabel(),
760 ex.addContext("...while merging to block " + Hex.u2(succ));
1654 int succ = successors.get(i); local
    [all...]
  /external/clang/lib/StaticAnalyzer/Checkers/
DeadStoresChecker.cpp 65 if (const CFGBlock *succ = *i)
66 worklist.push_back(succ);
  /external/llvm/lib/Transforms/Scalar/
TailDuplication.cpp 335 BasicBlock *Succ = *SI;
336 for (BasicBlock::iterator PNI = Succ->begin(); isa<PHINode>(PNI); ++PNI) {
  /external/llvm/lib/VMCore/
BasicBlock.cpp 338 BasicBlock *Succ = TI->getSuccessor(i);
339 for (iterator II = Succ->begin(); PHINode *PN = dyn_cast<PHINode>(II);
  /packages/apps/Bluetooth/src/com/android/bluetooth/opp/
BluetoothOppNotification.java 355 if (V) Log.v(TAG, "outbound: succ-" + outboundSuccNumber + " fail-" + outboundFailNumber);
402 if (V) Log.v(TAG, "inbound: succ-" + inboundSuccNumber + " fail-" + inboundFailNumber);
  /external/libvpx/examples/includes/geshi/geshi/
delphi.php 97 'StringOfChar', 'StringToOleStr', 'StringToWideChar', 'Succ', 'Swap',
inno.php 99 'StrToFloat', 'StrToInt', 'StrToInt64', 'StrToInt64Def', 'StrToIntDef', 'StrToTime', 'StuffString', 'Succ', 'Sum', 'Tan',
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/
sbitmap.h 261 structure instead of the pred/succ arrays. */
basic-block.h 602 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
605 block which is either the pred or succ end of the indexed edge. */
    [all...]
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/
sbitmap.h 261 structure instead of the pred/succ arrays. */
basic-block.h 602 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
605 block which is either the pred or succ end of the indexed edge. */
    [all...]
  /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/
sbitmap.h 261 structure instead of the pred/succ arrays. */
basic-block.h 602 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
605 block which is either the pred or succ end of the indexed edge. */
    [all...]
  /external/llvm/lib/CodeGen/
IfConversion.cpp     [all...]
BranchFolding.cpp 691 // are not immediately before Succ must have an unconditional branch to
692 // Succ added (but the predecessor/successor lists need no adjustment).
693 // The lone predecessor of Succ that falls through into Succ,
    [all...]
  /external/v8/test/cctest/
test-regexp.cc 1068 Label fail, succ; local
1481 unibrow::uchar succ[unibrow::Ecma262UnCanonicalize::kMaxWidth]; local
    [all...]
  /dalvik/dx/src/com/android/dx/ssa/
SsaBasicBlock.java 604 SsaBasicBlock succ; local
606 succ = parent.getBlocks().get(i);
607 succ.addMoveToBeginning(result, source);
    [all...]
SCCP.java 483 SsaBasicBlock succ = insn.getBlock().getPrimarySuccessor(); local
484 result = succ.getInsns().get(0).getResult();
  /external/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp 106 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
109 /// ExistPred, an existing predecessor of Succ.
110 static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred,
112 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do
115 for (BasicBlock::iterator I = Succ->begin();
625 assert(TIV && "No edge from pred to succ?");
    [all...]
  /external/llvm/include/llvm/Analysis/
IntervalIterator.h 220 // If we were in the successor list from before... remove from succ list
  /external/v8/src/
log.cc 95 if (Succ(head_) == tail_) {
99 head_ = Succ(head_);
109 tail_ = Succ(tail_);
123 int Succ(int index) { return (index + 1) % kBufferSize; }
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentSkipListMap.java 532 * @param succ the expected current successor
536 final boolean link(Index<K,V> succ, Index<K,V> newSucc) {
538 newSucc.right = succ;
539 return n.value != null && casRight(succ, newSucc);
544 * succ. Fails (forcing a retraversal by caller) if this node
546 * @param succ the expected current successor
549 final boolean unlink(Index<K,V> succ) {
550 return !indexesDeletedNode() && casRight(succ, succ.right);
    [all...]
  /external/clang/lib/Analysis/
UninitializedValues.cpp 667 if (const CFGBlock *succ = *i) {
668 ValueVector &vec = vals.getValueVector(&entry, succ);
  /external/clang/lib/StaticAnalyzer/Core/
BugReporter.cpp     [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
FastISel.cpp     [all...]

Completed in 391 milliseconds

1 23 4 5