Home
last modified time | relevance | path

Searched refs:LU (Results 1 – 17 of 17) sorted by relevance

/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp1786 return isAMCompletelyFolded(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, in isAMCompletelyFolded()
1799 if (!isAMCompletelyFolded(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, in getScalingFactorCost()
3437 assert(isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F) && in InsertFormula()
3687 if (isAlwaysFoldable(TTI, SE, LU.MinOffset, LU.MaxOffset, LU.Kind, in GenerateReassociationsImpl()
3840 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) in GenerateSymbolicOffsetsImpl()
3871 if (isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) { in GenerateConstantOffsetsImpl()
3924 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) in GenerateConstantOffsetsImpl()
3944 if (LU.MaxOffset != LU.MinOffset) in GenerateConstantOffsets()
4070 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, in GenerateScales()
4317 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, in GenerateCrossUseConstantOffsets()
[all …]
H A DSROA.cpp3828 for (User *LU : LI->users()) { in presplitLoadsAndStores()
3829 auto *SI = dyn_cast<StoreInst>(LU); in presplitLoadsAndStores()
4029 for (User *LU : LI->users()) { in presplitLoadsAndStores()
4030 StoreInst *SI = cast<StoreInst>(LU); in presplitLoadsAndStores()
/llvm-project-15.0.7/llvm/tools/verify-uselistorder/
H A Dverify-uselistorder.cpp315 auto LU = L->use_begin(), LE = L->use_end(); in matches() local
317 skipUnmappedUsers(LU, LE, LM); in matches()
320 while (LU != LE) { in matches()
325 if (LM.lookup(LU->getUser()) != RM.lookup(RU->getUser())) { in matches()
329 if (LU->getOperandNo() != RU->getOperandNo()) { in matches()
333 skipUnmappedUsers(++LU, LE, LM); in matches()
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/
H A Dmemrchr-2.ll14 ; Do not fold memrchr(a12345, C, UINT32_MAX + 1LU) to null or to a12345
29 ; Do not fold memrchr(ax1, C, UINT32_MAX + 2LU) to null or to *ax1 == 1.
43 ; Do not fold memrchr(ax, C, UINT32_MAX + 2LU) to *ax == 1.
/llvm-project-15.0.7/lldb/test/Shell/SymbolFile/DWARF/x86/
H A Ddebug_static-member-anonymous-namespace.s45 .LU: label
68 .long .LU-.Ldebug_info0
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonBlockRanges.cpp304 auto LD = LastDef[R], LU = LastUse[R]; in computeInitialLiveRanges() local
307 if (LU == IndexType::None) in computeInitialLiveRanges()
308 LU = IndexType::Exit; in computeInitialLiveRanges()
309 LiveMap[R].add(LD, LU, false, false); in computeInitialLiveRanges()
H A DHexagonISelLowering.cpp2968 SDValue LU = LowerUnalignedLoad(SDValue(LN, 0), DAG); in LowerLoad() local
2970 SDValue TC = DAG.getNode(HexagonISD::TYPECAST, dl, Ty, LU); in LowerLoad()
2971 SDValue Ch = cast<LoadSDNode>(LU.getNode())->getChain(); in LowerLoad()
2974 return LU; in LowerLoad()
/llvm-project-15.0.7/llvm/lib/Target/DirectX/DXILWriter/
H A DDXILValueEnumerator.cpp221 const Use *LU = L.first; in predictValueUseListOrderImpl() local
223 if (LU == RU) in predictValueUseListOrderImpl()
226 auto LID = OM.lookup(LU->getUser()).first; in predictValueUseListOrderImpl()
237 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrderImpl()
259 return LU->getOperandNo() < RU->getOperandNo(); in predictValueUseListOrderImpl()
260 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrderImpl()
/llvm-project-15.0.7/llvm/lib/IR/
H A DLegacyPassManager.cpp617 auto &LU = DMI->second; in collectLastUses() local
618 LastUses.append(LU.begin(), LU.end()); in collectLastUses()
1629 SmallVector<Pass *, 1> LU; in addLowerLevelRequiredPass() local
1630 LU.push_back(FoundPass); in addLowerLevelRequiredPass()
1631 FPP->setLastUser(LU, P); in addLowerLevelRequiredPass()
H A DAsmWriter.cpp196 const Use *LU = L.first; in predictValueUseListOrder() local
198 if (LU == RU) in predictValueUseListOrder()
201 auto LID = OM.lookup(LU->getUser()); in predictValueUseListOrder()
222 return LU->getOperandNo() < RU->getOperandNo(); in predictValueUseListOrder()
223 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrder()
/llvm-project-15.0.7/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp182 const Use *LU = L.first; in predictValueUseListOrderImpl() local
184 if (LU == RU) in predictValueUseListOrderImpl()
187 auto LID = OM.lookup(LU->getUser()).first; in predictValueUseListOrderImpl()
208 return LU->getOperandNo() < RU->getOperandNo(); in predictValueUseListOrderImpl()
209 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrderImpl()
/llvm-project-15.0.7/llvm/lib/Target/PowerPC/
H A DPPCScheduleP8.td27 // 10 insns per cycle (2-LU, 2-LSU, 2-FXU, 2-FPU, 1-CRU, 1-BRU).
258 // to either the LU (GPR store) or the VSU (FPR store).
394 // to 10 insns per cycle (2-LU, 2-LSU, 2-FXU, 2-FPU, 1-CRU, 1-BRU).
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DTargetLoweringObjectFileImpl.cpp1823 if (const auto *LU = M.getNamedGlobal("llvm.used")) { in emitLinkerDirectives() local
1824 assert(LU->hasInitializer() && "expected llvm.used to have an initializer"); in emitLinkerDirectives()
1825 assert(isa<ArrayType>(LU->getValueType()) && in emitLinkerDirectives()
1827 if (const auto *A = cast<ConstantArray>(LU->getInitializer())) { in emitLinkerDirectives()
H A DMachineScheduler.cpp1929 for (SUnit *LU : LocalUses) { in constrainLocalCopy()
1930 LLVM_DEBUG(dbgs() << " Local use SU(" << LU->NodeNum << ") -> SU(" in constrainLocalCopy()
1932 DAG->addEdge(GlobalSU, SDep(LU, SDep::Weak)); in constrainLocalCopy()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DValueTracking.cpp6498 Operator *LU = dyn_cast<Operator>(L); in matchSimpleRecurrence() local
6499 if (!LU) in matchSimpleRecurrence()
6501 unsigned Opcode = LU->getOpcode(); in matchSimpleRecurrence()
6515 Value *LL = LU->getOperand(0); in matchSimpleRecurrence()
6516 Value *LR = LU->getOperand(1); in matchSimpleRecurrence()
6535 BO = cast<BinaryOperator>(LU); in matchSimpleRecurrence()
H A DScalarEvolution.cpp731 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS); in CompareSCEVComplexity() local
734 int X = CompareValueComplexity(EqCacheValue, LI, LU->getValue(), in CompareSCEVComplexity()
11756 if (const SCEVUnknown *LU = dyn_cast<SCEVUnknown>(LHS)) in isImpliedViaMerge() local
11757 if (auto *Phi = dyn_cast<PHINode>(LU->getValue())) { in isImpliedViaMerge()
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/misc/ConfusableTable/
H A Dconfusables.txt2808 13B7 ; 004D ; MA # ( Ꮇ → M ) CHEROKEE LETTER LU → LATIN CAPITAL LETTER M #
3791 AB87 ; 028D ; MA # ( ꮇ → ʍ ) CHEROKEE SMALL LETTER LU → LATIN SMALL LETTER TURNED W # →ᴍ→→м→
4024 A6CD ; 02A1 ; MA # ( ꛍ → ʡ ) BAMUM LETTER LU → LATIN LETTER GLOTTAL STOP WITH STROKE #
5905 0E26 ; 0E20 ; MA # ( ฦ → ภ ) THAI CHARACTER LU → THAI CHARACTER PHO SAMPHAO #
6166 1622 ; 1543 ; MA # ( ᘢ → ᕃ ) CANADIAN SYLLABICS CARRIER LU → CANADIAN SYLLABICS R-CREE RE #