HomeSort by relevance Sort by last modified time
    Searched full:successors (Results 301 - 325 of 527) sorted by null

<<11121314151617181920>>

  /external/clang/docs/
InternalsManual.rst     [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstructionCombining.cpp     [all...]
InstCombinePHI.cpp 310 // successors, sinking it would remove a load of the volatile value from
338 // successors, sinking it would remove a load of the volatile value from
    [all...]
  /art/compiler/optimizing/
code_generator_mips.cc 5149 const ArenaVector<HBasicBlock*>& successors = switch_instr->GetBlock()->GetSuccessors(); local
    [all...]
  /external/llvm/lib/CodeGen/
PrologEpilogInserter.cpp 407 // Enqueue all the successors not already visited.
409 for (MachineBasicBlock *SuccBB : CurBB->successors())
    [all...]
WinEHPrepare.cpp 700 for (BasicBlock *SuccBB : successors(NewBlock)) {
    [all...]
LiveDebugValues.cpp 402 for (auto s : MBB->successors())
PHIElimination.cpp 646 for (const MachineBasicBlock *SI : MBB->successors())
  /external/llvm/lib/Target/Hexagon/
BitTracker.cpp 930 dbgs() << " failed to evaluate: will add all CFG successors\n";
949 // Need to add all CFG successors that lead to EH landing pads.
    [all...]
HexagonMachineScheduler.cpp 509 // Look at all of the successors of this node.
HexagonNewValueJump.cpp 472 // Get all the successors of this block - which will always
  /external/llvm/lib/Target/WebAssembly/
WebAssemblyPEI.cpp 423 // Enqueue all the successors not already visited.
425 for (MachineBasicBlock *SuccBB : CurBB->successors())
    [all...]
  /external/llvm/lib/Transforms/Scalar/
PlaceSafepoints.cpp 298 for (BasicBlock *Succ : successors(BB)) {
615 // Since this is a latch, at least one of the successors must dominate
    [all...]
JumpThreading.cpp 81 /// multiple predecessors and multiple successors. If one or more of the
83 /// successors, we forward the edge from the predecessor to the successor by
747 // Can't thread indirect branch with no successors.
768 // successors to branch to. Let GetBestDestForJumpOnUndef decide.
    [all...]
  /external/llvm/lib/Transforms/Utils/
PromoteMemoryToRegister.cpp     [all...]
  /external/llvm/test/CodeGen/WebAssembly/
cfg-stackify.ll 567 ; aren't to layout successors of the loop, and one of which is to a successors
  /external/llvm/include/llvm/Analysis/
ValueTracking.h 341 /// always transfer execution to one of its successors (including the next
  /external/llvm/lib/CodeGen/MIRParser/
MILexer.cpp 228 .Case("successors", MIToken::kw_successors)
  /external/llvm/lib/Target/AArch64/
AArch64BranchRelaxation.cpp 151 for (MachineBasicBlock *S : MBB->successors())
  /external/llvm/lib/Target/Sparc/
SparcInstrInfo.cpp 239 assert(!FBB && "Unconditional branch with multiple successors!");
  /external/llvm/test/Analysis/BlockFrequencyInfo/
irreducible.ll 54 ; this block. Its successors are the headers, which split the frequency
  /external/v8/test/mjsunit/
regexp.js 316 // Check that the back reference has two successors. See
  /prebuilts/gdb/darwin-x86/lib/python2.7/compiler/
pyassem.py 79 i.e. each node appears before all of its successors
  /prebuilts/gdb/linux-x86/lib/python2.7/compiler/
pyassem.py 79 i.e. each node appears before all of its successors
  /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/
go.go 698 S1 *Flow // successors of this instruction (at most two: s1 and s2).

Completed in 795 milliseconds

<<11121314151617181920>>