HomeSort by relevance Sort by last modified time
    Searched full:succ (Results 326 - 350 of 715) sorted by null

<<11121314151617181920>>

  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 440 /// Adds an edge to Succ to Dist. If \c LoopHead.isValid(), then whether the
446 const BlockNode &Pred, const BlockNode &Succ, uint64_t Weight);
643 void addEdge(IrrNode &Irr, const BlockNode &Succ,
    [all...]
  /external/clang/lib/Analysis/
ThreadSafetyCommon.cpp 902 void SExprBuilder::handleSuccessor(const CFGBlock *Succ) {
906 void SExprBuilder::handleSuccessorBackEdge(const CFGBlock *Succ) {
907 mergePhiNodesBackEdge(Succ);
908 ++BBInfo[Succ->getBlockID()].ProcessedPredecessors;
    [all...]
  /external/llvm/include/llvm/Transforms/Scalar/
GVN.h 218 BasicBlock *splitCriticalEdges(BasicBlock *Pred, BasicBlock *Succ);
  /external/llvm/lib/Target/Mips/
MipsDelaySlotFiller.cpp 267 bool examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ,
845 bool Filler::examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ,
849 getBranch(Pred, Succ);
859 RegDU.addLiveOut(Pred, Succ);
  /external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp 728 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
744 BasicBlock *Succ = TI->getSuccessor(i);
745 IRBuilder<> Builder(Succ);
748 EdgeTable[((Succs.idFor(Succ) - 1) * Preds.size()) +
    [all...]
  /external/toolchain-utils/fdo_scripts/
summarize_hot_blocks.py 28 # SUCC: 8 [100.0%] count:60342 (fallthru,exec)
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Scalar/
GVN.h 222 BasicBlock *splitCriticalEdges(BasicBlock *Pred, BasicBlock *Succ);
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Scalar/
GVN.h 222 BasicBlock *splitCriticalEdges(BasicBlock *Pred, BasicBlock *Succ);
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Scalar/
GVN.h 222 BasicBlock *splitCriticalEdges(BasicBlock *Pred, BasicBlock *Succ);
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Scalar/
GVN.h 222 BasicBlock *splitCriticalEdges(BasicBlock *Pred, BasicBlock *Succ);
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Transforms/Scalar/
GVN.h 222 BasicBlock *splitCriticalEdges(BasicBlock *Pred, BasicBlock *Succ);
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Transforms/Scalar/
GVN.h 222 BasicBlock *splitCriticalEdges(BasicBlock *Pred, BasicBlock *Succ);
  /art/compiler/optimizing/
superblock_cloner.cc 404 for (HBasicBlock* succ : block->GetSuccessors()) {
405 if (!IsInOrigBBSet(succ)) {
406 exits->push_back(succ);
  /external/llvm/lib/Analysis/
BranchProbabilityInfo.cpp 565 const BasicBlock *Succ = *I;
566 auto Prob = getEdgeProbability(BB, Succ);
569 MaxSucc = Succ;
  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 332 BasicBlock* Succ = Leaf.BB;
333 BranchInst::Create(Succ, Default, Comp, NewLeaf);
337 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/
prove.go 542 succ := simplifyBlock(ft, node.block)
543 if succ != unknown {
547 if succ == negative {
  /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/
prove.go 542 succ := simplifyBlock(ft, node.block)
543 if succ != unknown {
547 if succ == negative {
  /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/opt/
local_ssa_elim_pass.cpp 460 bp->ForEachSuccessorLabel([&header,this](uint32_t succ) {
461 if (visitedBlocks_.find(succ) == visitedBlocks_.end()) return;
463 header = succ;
  /external/clang/lib/StaticAnalyzer/Checkers/
LocalizationChecker.cpp 127 PathDiagnosticPiece *VisitNode(const ExplodedNode *Succ,
    [all...]
  /external/llvm/lib/Transforms/IPO/
SampleProfile.cpp 833 for (auto *Succ : Successors[BB]) {
834 Edge E = std::make_pair(BB, Succ);
    [all...]
  /external/llvm/include/llvm/IR/
PatternMatch.h 909 BasicBlock *&Succ;
910 br_match(BasicBlock *&Succ) : Succ(Succ) {}
915 Succ = BI->getSuccessor(0);
922 inline br_match m_UnconditionalBr(BasicBlock *&Succ) { return br_match(Succ); }
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
IfConversion.cpp     [all...]
  /external/swiftshader/third_party/subzero/src/
IceCfg.cpp 311 for (CfgNode *Succ : Node->getOutEdges()) {
312 SizeT SuccIndex = Succ->getIndex();
454 CfgNode *Succ = Node->getOutEdges().front();
455 if (Succ->getInEdges().size() == 1 &&
456 PlaceIndex[Succ->getIndex()] != NoPlace) {
457 Placed.insert(PlaceIndex[Succ->getIndex()], Node);
458 PlaceIndex[Node->getIndex()] = PlaceIndex[Succ->getIndex()];
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/IR/
PatternMatch.h 941 BasicBlock *&Succ;
942 br_match(BasicBlock *&Succ) : Succ(Succ) {}
947 Succ = BI->getSuccessor(0);
954 inline br_match m_UnconditionalBr(BasicBlock *&Succ) { return br_match(Succ); }
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/IR/
PatternMatch.h 962 BasicBlock *&Succ;
964 br_match(BasicBlock *&Succ) : Succ(Succ) {}
969 Succ = BI->getSuccessor(0);
976 inline br_match m_UnconditionalBr(BasicBlock *&Succ) { return br_match(Succ); }
    [all...]

Completed in 1422 milliseconds

<<11121314151617181920>>