Home
last modified time | relevance | path

Searched refs:phis (Results 1 – 25 of 174) sorted by relevance

1234567

/llvm-project-15.0.7/mlir/lib/Target/LLVMIR/Dialect/OpenMP/
H A DOpenMPToLLVMIRTranslation.cpp446 SmallVector<llvm::PHINode *> phis; in inlineConvertOmpRegions() local
452 llvm::append_range(*continuationBlockArgs, phis); in inlineConvertOmpRegions()
487 SmallVector<llvm::Value *> phis; in makeReductionGen() local
492 assert(phis.size() == 1); in makeReductionGen()
493 result = phis[0]; in makeReductionGen()
520 SmallVector<llvm::Value *> phis; in makeAtomicReductionGen() local
525 assert(phis.empty()); in makeAtomicReductionGen()
759 SmallVector<llvm::Value *> phis; in convertOmpWsLoop() local
766 builder.CreateStore(phis[0], privateReductionVariables[i]); in convertOmpWsLoop()
1262 SmallVector<llvm::Value *> phis; in convertOmpReductionOp() local
[all …]
/llvm-project-15.0.7/llvm/unittests/IR/
H A DBasicBlockTest.cpp41 for (auto &PN : BB->phis()) { in TEST()
66 for (auto &PN : BB->phis()) { in TEST()
74 CI = BB->phis().begin(); in TEST()
75 EXPECT_NE(CI, BB->phis().end()); in TEST()
87 for (const auto &PN : const_cast<const BasicBlock *>(BB.get())->phis()) { in TEST()
/llvm-project-15.0.7/llvm/test/CodeGen/WebAssembly/
H A Dphi.ll3 ; Test that phis are lowered.
24 ; Swap phis.
/llvm-project-15.0.7/llvm/test/Transforms/HotColdSplit/
H A Dapply-successor-penalty.ll14 ; CHECK-NEXT: Applying penalty for: 0 outputs/split phis
40 ; CHECK-NEXT: Applying penalty for: 0 outputs/split phis
H A Dapply-penalty-for-outputs.ll15 ; CHECK-NEXT: Applying penalty for: 1 outputs/split phis
H A Dapply-penalty-for-inputs.ll15 ; CHECK-NEXT: Applying penalty for: 0 outputs/split phis
/llvm-project-15.0.7/llvm/test/Analysis/MemorySSA/
H A Dupdate_unroll.ll7 ; Check verification passes after loop rotate, when adding phis in blocks
8 ; receiving incoming edges and adding phis in IDF blocks.
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/
H A Dswp-kernel-phi1.ll3 ; Test that we generate the correct names for the phis in the kernel for the
5 ; as its loop definition, and the two phis are scheduled in different stages.
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp785 for (PHINode &PHI : L->getHeader()->phis()) { in findInductionAndReductions()
892 for (PHINode &PHI : L->getHeader()->phis()) { in findInductions()
907 for (PHINode &PHI : InnerExit->phis()) { in areInnerLoopExitPHIsSupported()
931 for (PHINode &PHI : LoopNestExit->phis()) { in areOuterLoopExitPHIsSupported()
978 for (PHINode &PHI : InnerLoopLatch->phis()) { in areInnerLoopLatchPHIsSupported()
1462 for (PHINode &P : make_early_inc_range(InnerExit->phis())) { in moveLCSSAPhis()
1491 for (PHINode &P : InnerExit->phis()) in moveLCSSAPhis()
1495 for (PHINode &P : InnerLatch->phis()) in moveLCSSAPhis()
1516 for (PHINode &P : OuterExit->phis()) { in moveLCSSAPhis()
1662 for (PHINode &PHI : InnerLoopHeader->phis()) in adjustLoopBranches()
[all …]
H A DLoopDeletion.cpp77 for (PHINode &P : ExitBlock->phis()) { in isLoopDead()
321 for (auto &PN : BB->phis()) { in canProveExitOnFirstIteration()
465 for (PHINode &P : ExitBlock->phis()) { in deleteLoopIfDead()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DDivergenceAnalysis.cpp194 for (const auto &Phi : DivExit.phis()) { in analyzeLoopExitDivergence()
223 for (const auto &Phi : UserBlock->phis()) { in analyzeLoopExitDivergence()
277 for (const auto &Phi : JoinBlock.phis()) { in taintAndPushPhiNodes()
H A DPhiValues.cpp167 for (const PHINode &PN : BB.phis()) { in print()
200 for (const PHINode &PN : BB.phis()) in run()
/llvm-project-15.0.7/llvm/test/Transforms/ObjCARC/
H A Dinlined-autorelease-return-value.ll38 ; CHECK: phis:
43 br label %phis
45 phis:
178 ; CHECK: phis:
184 br label %phis
186 phis:
/llvm-project-15.0.7/llvm/include/llvm/IR/
H A DBasicBlock.h355 iterator_range<const_phi_iterator> phis() const { in phis() function
356 return const_cast<BasicBlock *>(this)->phis(); in phis()
358 iterator_range<phi_iterator> phis();
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dopt_phis.mir1 # RUN: llc -run-pass opt-phis -mtriple=x86_64-- -o - %s | FileCheck %s
H A Dbss_pagealigned.ll7 define void @unxlate_dev_mem_ptr(i64 %phis, ptr %addr) nounwind {
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dbranch-folder-requires-no-phis.mir4 # BranchFolding breaks this function due to phis
H A Dearly-tailduplicator-nophis.mir4 # There are no phis in this testcase. Early tail duplication introduces them,
/llvm-project-15.0.7/llvm/test/Transforms/GVN/PRE/
H A Dpre-no-cost-phi.ll2 ; This testcase tests insertion of no-cost phis. That is,
/llvm-project-15.0.7/llvm/test/CodeGen/Thumb/
H A Dopt-phis.mir1 # RUN: llc -mtriple thumbv6m-none-eabi -run-pass=opt-phis -verify-machineinstrs -o - %s | FileCheck…
/llvm-project-15.0.7/llvm/test/Transforms/IndVarSimplify/
H A Dcycled_phis.ll321 ; Slightly more complex version of previous one (cycled phis).
323 define i32 @start.from.sibling.iv.wide.cycled.phis(i32* %len.ptr, i32* %sibling.len.ptr) {
324 ; CHECK-LABEL: @start.from.sibling.iv.wide.cycled.phis(
439 ; Even more complex version of previous one (more sophisticated cycled phis).
441 define i32 @start.from.sibling.iv.wide.cycled.phis.complex.phis(i32* %len.ptr, i32* %sibling.len.pt…
442 ; CHECK-LABEL: @start.from.sibling.iv.wide.cycled.phis.complex.phis(
H A D2011-11-17-selfphi.ll2 ; PR11350: Check that SimplifyIndvar handles a cycle of useless self-phis.
/llvm-project-15.0.7/llvm/test/Transforms/CodeGenPrepare/X86/
H A Dpr35658.ll1 ; RUN: opt -S -codegenprepare -disable-complex-addr-modes=false -addr-sink-new-phis=true -addr-sink…
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DVPlanTransforms.cpp300 for (auto &Phi : Plan.getVectorLoopRegion()->getEntryBasicBlock()->phis()) { in removeRedundantInductionCasts()
344 for (VPRecipeBase &Phi : HeaderVPBB->phis()) { in removeRedundantCanonicalIVs()
385 for (VPRecipeBase &Phi : HeaderVPBB->phis()) { in optimizeInductions()
/llvm-project-15.0.7/llvm/examples/IRTransforms/
H A DSimplifyCFG.cpp284 for (PHINode &PN : make_early_inc_range(BB.phis())) { in mergeIntoSinglePredecessor_v1()
335 for (PHINode &PN : make_early_inc_range(BB.phis())) { in mergeIntoSinglePredecessor_v2()

1234567