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

<<1112

  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/
AMDILCFGStructurizer.cpp     [all...]
  /external/clang/lib/Analysis/
ThreadSafety.cpp     [all...]
  /external/llvm/lib/CodeGen/
MachineScheduler.cpp 404 /// releasePredecessors - Call releasePred on each of SU's predecessors.
627 // Order predecessors so DFSResult follows the critical path.
630 // A SUnit is ready to top schedule if it has no predecessors.
    [all...]
RegisterCoalescer.cpp     [all...]
LiveInterval.cpp 878 // Connect to values live out of predecessors.
MachineLICM.cpp     [all...]
RegAllocGreedy.cpp     [all...]
  /external/llvm/lib/Transforms/Scalar/
CodeGenPrepare.cpp 341 // If BB and DestBB contain any common predecessors, then the phi nodes in BB
406 // Otherwise, we have multiple predecessors of BB. Update the PHIs in DestBB
814 // If we eliminated all predecessors of the block, delete the block now.
    [all...]
ScalarReplAggregates.cpp     [all...]
  /external/mesa3d/src/gallium/drivers/radeon/
AMDILCFGStructurizer.cpp     [all...]
  /external/chromium_org/third_party/libwebp/enc/
quant.c 570 // Inspect all possible non-dead predecessors. Retain only the best one.
    [all...]
  /external/llvm/docs/
ProgrammersManual.rst 621 predecessors/successors of a block is usually less than 8). On the other hand,
    [all...]
  /external/llvm/include/llvm/CodeGen/
MachineInstr.h 66 BundledPred = 1 << 1, // Instruction has bundled predecessors.
    [all...]
  /external/webp/src/enc/
quant.c 570 // Inspect all possible non-dead predecessors. Retain only the best one.
    [all...]
  /external/llvm/lib/IR/
AsmWriter.cpp     [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstructionCombining.cpp 686 // predecessors terminator.
    [all...]
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 669 /// Effective predecessors of the current block ignoring ignorable edges and
781 /// The top-down traversal uses this to merge information about predecessors to
    [all...]
  /external/chromium_org/v8/src/ia32/
lithium-ia32.h 423 bool jumps_to_join() const { return block_->predecessors()->length() > 1; }
    [all...]
  /external/clang/lib/Sema/
AnalysisBasedWarnings.cpp 795 // Traverse its predecessors.
    [all...]
  /external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Analysis/
MethodAnalyzer.java 537 //finally, populate the successors and predecessors for each instruction. We start at the fake "StartOfMethod"
538 //instruction and follow the execution path. Any unreachable code won't have any predecessors or successors,
    [all...]
  /frameworks/base/core/java/android/view/
View.java     [all...]
  /external/bison/src/
parse-gram.c     [all...]
  /external/chromium/chrome/browser/sync/engine/
syncapi.cc     [all...]
  /external/clang/lib/CodeGen/
CGCall.cpp     [all...]
  /external/clang/lib/StaticAnalyzer/Core/
ExprEngine.cpp 381 // user-supplied states as the predecessors.
    [all...]

Completed in 3336 milliseconds

<<1112