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

1 2 34 5 6 7 8

  /dalvik/dx/src/com/android/dx/ssa/back/
IdenticalBlockCombiner.java 71 // ...look at all of it's predecessors that have only one succ...
  /external/chromium_org/third_party/libusb/src/libusb/
strerror.c 93 "Succès",
  /external/dexmaker/src/dx/java/com/android/dx/ssa/back/
IdenticalBlockCombiner.java 76 // ...look at all of it's predecessors that have only one succ...
  /external/libvpx/libvpx/examples/includes/geshi/geshi/
haskell.php 67 'max', 'min', 'succ', 'pred', 'toEnum', 'fromEnum',
ocaml.php 92 'string_of_int', 'succ', 'tan', 'tanh', 'truncate'
pascal.php 78 'pred','read','readln','sin','sqrt','succ','write','writeln'
delphi.php 97 'StringOfChar', 'StringToOleStr', 'StringToWideChar', 'Succ', 'Swap',
inno.php 99 'StrToFloat', 'StrToInt', 'StrToInt64', 'StrToInt64Def', 'StrToIntDef', 'StrToTime', 'StuffString', 'Succ', 'Sum', 'Tan',
  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 92 // Now add a corresponding succ to N.
142 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(),
144 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
145 N->Succs.erase(Succ);
IfConversion.cpp     [all...]
MachineInstr.cpp 880 MachineBasicBlock::instr_iterator Succ = this;
881 ++Succ;
882 assert(!Succ->isBundledWithPred() && "Inconsistent bundle flags");
883 Succ->setFlag(BundledPred);
    [all...]
ScheduleDAGInstrs.cpp     [all...]
  /external/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.cpp 445 SUnit &Succ = *I->getSUnit();
446 if (!Succ.isScheduled) {
449 if (OnlyAvailableSucc && OnlyAvailableSucc != &Succ)
451 OnlyAvailableSucc = &Succ;
  /external/llvm/lib/Target/Mips/
MipsDelaySlotFiller.cpp 239 bool examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ,
687 bool Filler::examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ,
691 getBranch(Pred, Succ);
701 RegDU.addLiveOut(Pred, Succ);
  /external/llvm/include/llvm/Support/
PatternMatch.h 798 BasicBlock *&Succ;
799 br_match(BasicBlock *&Succ)
800 : Succ(Succ) {
807 Succ = BI->getSuccessor(0);
814 inline br_match m_UnconditionalBr(BasicBlock *&Succ) { return br_match(Succ); }
    [all...]
  /dalvik/dx/src/com/android/dx/cf/code/
Ropper.java 769 int succ = successors.get(i); local
771 mergeAndWorkAsNecessary(succ, block.getLabel(),
774 ex.addContext("...while merging to block " + Hex.u2(succ));
1668 int succ = successors.get(i); local
    [all...]
  /external/clang/lib/StaticAnalyzer/Checkers/
DeadStoresChecker.cpp 98 if (const CFGBlock *succ = *i)
99 worklist.push_back(succ);
  /external/llvm/include/llvm/CodeGen/
MachineTraceMetrics.h 140 const MachineBasicBlock *Succ;
157 Pred(0), Succ(0),
  /packages/apps/Bluetooth/src/com/android/bluetooth/opp/
BluetoothOppNotification.java 393 if (V) Log.v(TAG, "outbound: succ-" + outboundSuccNumber + " fail-" + outboundFailNumber);
440 if (V) Log.v(TAG, "inbound: succ-" + inboundSuccNumber + " fail-" + inboundFailNumber);
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 628 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
644 BasicBlock *Succ = TI->getSuccessor(i);
645 IRBuilder<> Builder(Succ);
648 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
sbitmap.h 255 structure instead of the pred/succ arrays. */
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
sbitmap.h 255 structure instead of the pred/succ arrays. */
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
sbitmap.h 255 structure instead of the pred/succ arrays. */
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
sbitmap.h 255 structure instead of the pred/succ arrays. */
  /external/llvm/lib/Analysis/
BranchProbabilityInfo.cpp 546 BasicBlock *Succ = *I;
547 uint32_t Weight = getEdgeWeight(BB, Succ);
555 MaxSucc = Succ;

Completed in 2009 milliseconds

1 2 34 5 6 7 8