HomeSort by relevance Sort by last modified time
    Searched full:successor (Results 126 - 150 of 320) sorted by null

1 2 3 4 56 7 8 91011>>

  /dalvik/dx/src/com/android/dx/ssa/
SCCP.java 237 * Simulates branch insns, if possible. Adds reachable successor blocks
657 // Find if a successor block is never executed
  /external/bluetooth/bluez/tools/
ubcsp.c 893 /* If we have no successor block
935 /* If we have no successor block
    [all...]
  /external/libvpx/vp8/encoder/
encodemb.c 344 /* Consider both possible successor states. */
388 /* Consider both possible successor states. */
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp 355 // Only copy scheduled successors. Cut them from old node's successor
392 // Only copy scheduled successors. Cut them from old node's successor
ScheduleDAGRRList.cpp 943 // Only copy scheduled successors. Cut them from old node's successor
    [all...]
FastISel.cpp 754 // feed PHI nodes in successor blocks.
778 /// unless it is the immediate (fall-through) successor, and update
    [all...]
  /external/llvm/lib/Transforms/Utils/
BreakCriticalEdges.cpp 124 /// successor of SplitBB.
158 /// specified successor will be merged into the same critical edge block.
  /external/stlport/stlport/stl/
_tree.c 157 __y = _Rb_tree_node_base::_S_minimum(__y->_M_right); // __z's successor. __x might be null.
162 if (__y != __z) { // relink y in place of z. y is z's successor
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_tree.c 157 __y = _Rb_tree_node_base::_S_minimum(__y->_M_right); // __z's successor. __x might be null.
162 if (__y != __z) { // relink y in place of z. y is z's successor
  /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/
_tree.c 157 __y = _Rb_tree_node_base::_S_minimum(__y->_M_right); // __z's successor. __x might be null.
162 if (__y != __z) { // relink y in place of z. y is z's successor
  /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/
_tree.c 157 __y = _Rb_tree_node_base::_S_minimum(__y->_M_right); // __z's successor. __x might be null.
162 if (__y != __z) { // relink y in place of z. y is z's successor
  /external/v8/src/
jsregexp.cc 3482 RegExpNode* successor = that->on_success(); local
3526 RegExpNode* successor = that->on_success(); local
4728 OutSet* successor = successors()->at(i); local
5069 GuardedAlternative successor = this->alternatives()->at(1); local
    [all...]
  /dalvik/vm/compiler/
Frontend.cpp 579 /* Handle the successor list */
805 /* Verify if all the successor is connected with all the claimed predecessors */
842 LOGE("Successor %s not found from %s",
    [all...]
SSATransformation.cpp 380 * Iterate through all successor blocks and propagate up the live-in sets.
  /external/clang/lib/StaticAnalyzer/Core/
BugReporter.cpp     [all...]
  /external/llvm/lib/CodeGen/
ShrinkWrapping.cpp 607 << "successor " << getBasicBlockName(SUCC) << "\n");
720 // Remember this block for adding restores to successor
    [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstCombinePHI.cpp 278 // do a shared load from register in the successor.
312 // the path through the other successor.
340 // the path through the other successor.
    [all...]
  /dalvik/dx/src/com/android/dx/cf/code/
Frame.java 285 * context, likely via a throw. Our successor will only need
  /external/chromium/chrome/browser/sync/syncable/
syncable.cc     [all...]
  /external/llvm/include/llvm/CodeGen/
LiveIntervalAnalysis.h 315 /// instruction if li is live into a landing pad successor.
  /external/llvm/include/llvm/Transforms/Utils/
SSAUpdaterImpl.h 258 /// the successor of Pred is in the dominance frontier for the definition,
  /external/llvm/lib/Analysis/
BranchProbabilityInfo.cpp 179 // Calculate Edge Weights using "Return Heuristics". Predict a successor which
  /external/llvm/lib/Target/PTX/
PTXInstrInfo.cpp 219 // it falls through to a successor block
  /external/llvm/lib/Target/XCore/
XCoreInstrInfo.cpp 173 /// an successor block, it sets TBB to be the branch destination block and a
  /external/llvm/lib/Transforms/Scalar/
SimplifyCFGPass.cpp 15 // predecessor only has one successor.

Completed in 2671 milliseconds

1 2 3 4 56 7 8 91011>>