Home
last modified time | relevance | path

Searched defs:LU (Results 1 – 12 of 12) sorted by relevance

/llvm-project/lldb/test/Shell/SymbolFile/DWARF/x86/
H A Ddebug_static-member-anonymous-namespace.s45 .LU: label
/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp1503 RateFormula(const Formula & F,SmallPtrSetImpl<const SCEV * > & Regs,const DenseSet<const SCEV * > & VisitedRegs,const LSRUse & LU,SmallPtrSetImpl<const SCEV * > * LoserRegs) RateFormula() argument
1950 isAMCompletelyFolded(const TargetTransformInfo & TTI,const LSRUse & LU,const Formula & F) isAMCompletelyFolded() argument
1967 getScalingFactorCost(const TargetTransformInfo & TTI,const LSRUse & LU,const Formula & F,const Loop & L) getScalingFactorCost() argument
2751 reconcileNewOffset(LSRUse & LU,Immediate NewOffset,bool HasBaseReg,LSRUse::KindType Kind,MemAccessTy AccessTy) reconcileNewOffset() argument
2822 LSRUse &LU = Uses[LUIdx]; getUse() local
2832 LSRUse &LU = Uses[LUIdx]; getUse() local
2840 DeleteUse(LSRUse & LU,size_t LUIdx) DeleteUse() argument
3614 LSRUse &LU = Uses[LUIdx]; CollectFixupsAndInitialFormulae() local
3649 InsertInitialFormula(const SCEV * S,LSRUse & LU,size_t LUIdx) InsertInitialFormula() argument
3665 InsertSupplementalFormula(const SCEV * S,LSRUse & LU,size_t LUIdx) InsertSupplementalFormula() argument
3683 InsertFormula(LSRUse & LU,unsigned LUIdx,const Formula & F) InsertFormula() argument
3807 LSRUse &LU = Uses[LUIdx]; CollectLoopInvariantFixupsAndFormulae() local
3889 mayUsePostIncMode(const TargetTransformInfo & TTI,LSRUse & LU,const SCEV * S,const Loop * L,ScalarEvolution & SE) mayUsePostIncMode() argument
3911 GenerateReassociationsImpl(LSRUse & LU,unsigned LUIdx,const Formula & Base,unsigned Depth,size_t Idx,bool IsScaledReg) GenerateReassociationsImpl() argument
4009 GenerateReassociations(LSRUse & LU,unsigned LUIdx,Formula Base,unsigned Depth) GenerateReassociations() argument
4026 GenerateCombinations(LSRUse & LU,unsigned LUIdx,Formula Base) GenerateCombinations() argument
4090 GenerateSymbolicOffsetsImpl(LSRUse & LU,unsigned LUIdx,const Formula & Base,size_t Idx,bool IsScaledReg) GenerateSymbolicOffsetsImpl() argument
4109 GenerateSymbolicOffsets(LSRUse & LU,unsigned LUIdx,Formula Base) GenerateSymbolicOffsets() argument
4123 GenerateConstantOffsetsImpl(LSRUse & LU,unsigned LUIdx,const Formula & Base,const SmallVectorImpl<Immediate> & Worklist,size_t Idx,bool IsScaledReg) GenerateConstantOffsetsImpl() argument
4203 GenerateConstantOffsets(LSRUse & LU,unsigned LUIdx,Formula Base) GenerateConstantOffsets() argument
4221 GenerateICmpZeroScales(LSRUse & LU,unsigned LUIdx,Formula Base) GenerateICmpZeroScales() argument
4322 GenerateScales(LSRUse & LU,unsigned LUIdx,Formula Base) GenerateScales() argument
4412 GenerateTruncates(LSRUse & LU,unsigned LUIdx,Formula Base) GenerateTruncates() argument
4602 LSRUse &LU = Uses[LUIdx]; GenerateCrossUseConstantOffsets() local
4712 LSRUse &LU = Uses[LUIdx]; GenerateAllReuseFormulae() local
4719 LSRUse &LU = Uses[LUIdx]; GenerateAllReuseFormulae() local
4730 LSRUse &LU = Uses[LUIdx]; GenerateAllReuseFormulae() local
4760 LSRUse &LU = Uses[LUIdx]; FilterOutUndesirableDedicatedRegisters() local
4848 for (const LSRUse &LU : Uses) { EstimateSearchSpaceComplexity() local
4873 LSRUse &LU = Uses[LUIdx]; NarrowSearchSpaceByDetectingSupersets() local
4944 LSRUse &LU = Uses[LUIdx]; NarrowSearchSpaceByCollapsingUnrolledCode() local
5041 LSRUse &LU = Uses[LUIdx]; NarrowSearchSpaceByFilterFormulaWithSameScaledReg() local
5127 LSRUse &LU = Uses[LUIdx]; NarrowSearchSpaceByFilterPostInc() local
5222 for (const LSRUse &LU : Uses) { NarrowSearchSpaceByDeletingCostlyFormulas() local
5239 LSRUse &LU = Uses[LUIdx]; NarrowSearchSpaceByDeletingCostlyFormulas() local
5376 LSRUse &LU = Uses[LUIdx]; NarrowSearchSpaceByPickingWinnerRegs() local
5435 const LSRUse &LU = Uses[Workspace.size()]; SolveRecurse() local
5680 Expand(const LSRUse & LU,const LSRFixup & LF,const Formula & F,BasicBlock::iterator IP,SmallVectorImpl<WeakTrackingVH> & DeadInsts) const Expand() argument
5865 RewriteForPHI(PHINode * PN,const LSRUse & LU,const LSRFixup & LF,const Formula & F,SmallVectorImpl<WeakTrackingVH> & DeadInsts) const RewriteForPHI() argument
5996 Rewrite(const LSRUse & LU,const LSRFixup & LF,const Formula & F,SmallVectorImpl<WeakTrackingVH> & DeadInsts) const Rewrite() argument
6034 canHoistIVInc(const TargetTransformInfo & TTI,const LSRFixup & Fixup,const LSRUse & LU,Instruction * IVIncInsertPos,Loop * L) canHoistIVInc() argument
6252 for (const LSRUse &LU : Uses) { LSRInstance() local
6286 for (const LSRUse &LU : Uses) print_fixups() local
6296 for (const LSRUse &LU : Uses) { print_uses() local
[all...]
/llvm-project/llvm/tools/verify-uselistorder/
H A Dverify-uselistorder.cpp327 auto LU = L->use_begin(), LE = L->use_end(); in matches() local
/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonBlockRanges.cpp303 auto LD = LastDef[R], LU = LastUse[R]; computeInitialLiveRanges() local
H A DHexagonISelLowering.cpp3130 SDValue LU = LowerUnalignedLoad(SDValue(LN, 0), DAG); LowerLoad() local
/llvm-project/llvm/lib/IR/
H A DLegacyPassManager.cpp623 auto &LU = DMI->second; collectLastUses() local
1639 SmallVector<Pass *, 1> LU; addLowerLevelRequiredPass() local
H A DAsmWriter.cpp197 const Use *LU = L.first; predictValueUseListOrder() local
/llvm-project/llvm/lib/Target/DirectX/DXILWriter/
H A DDXILValueEnumerator.cpp221 const Use *LU = L.first; in predictValueUseListOrderImpl() local
/llvm-project/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp190 const Use *LU = L.first; in predictValueUseListOrderImpl() local
/llvm-project/llvm/lib/CodeGen/
H A DTargetLoweringObjectFileImpl.cpp1895 if (const auto *LU = M.getNamedGlobal("llvm.used")) { emitLinkerDirectives() local
/llvm-project/llvm/lib/Analysis/
H A DScalarEvolution.cpp705 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS); CompareSCEVComplexity() local
12143 if (const SCEVUnknown *LU = dyn_cast<SCEVUnknown>(LHS)) isImpliedViaMerge() local
H A DValueTracking.cpp8687 auto *LU = dyn_cast<BinaryOperator>(L); matchSimpleRecurrence() local