| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | SIAnnotateControlFlow.cpp | 64 bool isUniform(BranchInst *T);
148 bool SIAnnotateControlFlow::isUniform(BranchInst *T) { in isUniform() function in SIAnnotateControlFlow
149 return DA->isUniform(T) || in isUniform()
206 if (isUniform(Term)) in openIf()
217 if (isUniform(Term)) { in insertElse()
262 if (isUniform(Term)) in handleLoop()
|
| H A D | AMDGPUAnnotateUniformValues.cpp | 81 if (DA->isUniform(&I)) in visitBranchInst()
87 if (!DA->isUniform(Ptr)) in visitLoadInst()
|
| H A D | AMDGPULateCodeGenPrepare.cpp | 125 return DA->isUniform(&LI); in canWidenScalarExtLoad()
|
| H A D | AMDGPUCodeGenPrepare.cpp | 316 return I.isSimple() && TySize < 32 && Alignment >= 4 && DA->isUniform(&I); in canWidenScalarExtLoad()
519 if (DA->isUniform(&I)) in replaceMulWithMul24()
1237 DA->isUniform(&I) && promoteUniformOpToI32(I)) in visitBinaryOperator()
1367 DA->isUniform(&I)) in visitICmpInst()
1377 DA->isUniform(&I)) in visitSelectInst()
1396 DA->isUniform(&I)) in visitBitreverseIntrinsicInst()
|
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 124 if (!DA.isUniform(Top->getTerminator())) in isUniformlyReached()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | LegacyDivergenceAnalysis.h | 51 bool isUniform(const Value *V) const { return !isDivergent(V); } in isUniform() function
|
| H A D | DivergenceAnalysis.h | 177 bool isUniform(const Value &V) const { return !isDivergent(V); } in isUniform() function
|
| H A D | LoopAccessAnalysis.h | 591 bool isUniform(Value *V) const;
|
| /llvm-project-15.0.7/llvm/include/llvm/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.h | 355 bool isUniform(Value *V);
367 return isUniform(Ptr) && !blockNeedsPredication(I.getParent()); in isUniformMemOp()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.cpp | 465 bool LoopVectorizationLegality::isUniform(Value *V) { in isUniform() function in llvm::LoopVectorizationLegality
466 return LAI->isUniform(V); in isUniform()
|
| H A D | VPlanTransforms.cpp | 127 if (!SinkCandidate || SinkCandidate->isUniform() || in sinkScalarOperands()
|
| H A D | VPlan.h | 1599 bool isUniform() const { return IsUniform; } in isUniform() function
1609 return isUniform(); in onlyFirstLaneUsed()
2690 return !VPV->getDef() || (RepR && RepR->isUniform());
|
| H A D | LoopVectorize.cpp | 2779 if (OperandR && OperandR->isUniform()) in scalarizeInstruction()
6405 bool isLoopInvariantStoreValue = Legal->isUniform(SI->getValueOperand()); in getUniformMemOpCost()
7079 if (Op2VK == TargetTransformInfo::OK_AnyValue && Legal->isUniform(Op2)) in getInstructionCost()
9780 bool IsUniform = RepR && RepR->isUniform(); in get()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | StructurizeCFG.cpp | 983 if (!DA.isUniform(Br)) in hasOnlyUniformBranches()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | LoopAccessAnalysis.cpp | 2249 if (isUniform(Ptr)) { in analyzeLoop()
2492 bool LoopAccessInfo::isUniform(Value *V) const { in isUniform() function in LoopAccessInfo
|