Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp1730 return isAMCompletelyFolded(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, in isAMCompletelyFolded()
1743 if (!isAMCompletelyFolded(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, in getScalingFactorCost()
3337 assert(isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F) && in InsertFormula()
3562 if (isAlwaysFoldable(TTI, SE, LU.MinOffset, LU.MaxOffset, LU.Kind, in GenerateReassociationsImpl()
3575 isAlwaysFoldable(TTI, SE, LU.MinOffset, LU.MaxOffset, LU.Kind, in GenerateReassociationsImpl()
3715 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) in GenerateSymbolicOffsetsImpl()
3771 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) in GenerateConstantOffsetsImpl()
3787 if (LU.MaxOffset != LU.MinOffset) in GenerateConstantOffsets()
3909 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, in GenerateScales()
4122 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, in GenerateCrossUseConstantOffsets()
[all …]
H A DSROA.cpp3623 for (User *LU : LI->users()) { in presplitLoadsAndStores()
3624 auto *SI = dyn_cast<StoreInst>(LU); in presplitLoadsAndStores()
3833 for (User *LU : LI->users()) { in presplitLoadsAndStores()
3834 StoreInst *SI = cast<StoreInst>(LU); in presplitLoadsAndStores()
/freebsd-12.1/sys/contrib/ck/include/
H A Dck_cohort.h56 #define CK_COHORT_PROTOTYPE(N, GL, GU, GI, LL, LU, LI) \ argument
112 LU(cohort->local_lock, local_context); \
125 #define CK_COHORT_TRYLOCK_PROTOTYPE(N, GL, GU, GI, GTL, LL, LU, LI, LTL) \ argument
126 CK_COHORT_PROTOTYPE(N, GL, GU, GI, LL, LU, LI) \
144 LU(cohort->local_lock, local_unlock_context); \
/freebsd-12.1/contrib/llvm/lib/IR/
H A DLegacyPassManager.cpp642 for (auto LU : LastUser) { in setLastUser() local
643 if (LU.second == AP) in setLastUser()
646 LastUser[LU.first] = P; in setLastUser()
659 SmallPtrSet<Pass *, 8> &LU = DMI->second; in collectLastUses() local
660 for (Pass *LUP : LU) { in collectLastUses()
898 for (auto LU : LastUser) { in initializeAllAnalysisInfo() local
899 SmallPtrSet<Pass *, 8> &L = InversedLastUser[LU.second]; in initializeAllAnalysisInfo()
900 L.insert(LU.first); in initializeAllAnalysisInfo()
1822 SmallVector<Pass *, 1> LU; in addLowerLevelRequiredPass() local
1823 LU.push_back(FoundPass); in addLowerLevelRequiredPass()
[all …]
H A DAsmWriter.cpp202 const Use *LU = L.first; in predictValueUseListOrderImpl() local
204 if (LU == RU) in predictValueUseListOrderImpl()
207 auto LID = OM.lookup(LU->getUser()).first; in predictValueUseListOrderImpl()
228 return LU->getOperandNo() < RU->getOperandNo(); in predictValueUseListOrderImpl()
229 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrderImpl()
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonBlockRanges.cpp305 auto LD = LastDef[R], LU = LastUse[R]; in computeInitialLiveRanges() local
308 if (LU == IndexType::None) in computeInitialLiveRanges()
309 LU = IndexType::Exit; in computeInitialLiveRanges()
310 LiveMap[R].add(LD, LU, false, false); in computeInitialLiveRanges()
/freebsd-12.1/contrib/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp188 const Use *LU = L.first; in predictValueUseListOrderImpl() local
190 if (LU == RU) in predictValueUseListOrderImpl()
193 auto LID = OM.lookup(LU->getUser()).first; in predictValueUseListOrderImpl()
223 return LU->getOperandNo() < RU->getOperandNo(); in predictValueUseListOrderImpl()
224 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrderImpl()
/freebsd-12.1/contrib/jemalloc/include/jemalloc/internal/
H A Dbitmap.h257 if (group_masked == 0LU) { in bitmap_ffu()
258 if (group == 0LU) { in bitmap_ffu()
/freebsd-12.1/contrib/llvm/lib/Target/PowerPC/
H A DPPCScheduleP8.td28 // 10 insns per cycle (2-LU, 2-LSU, 2-FXU, 2-FPU, 1-CRU, 1-BRU).
259 // to either the LU (GPR store) or the VSU (FPR store).
395 // to 10 insns per cycle (2-LU, 2-LSU, 2-FXU, 2-FPU, 1-CRU, 1-BRU).
/freebsd-12.1/contrib/llvm/lib/CodeGen/AsmPrinter/
H A DAsmPrinter.cpp1556 if (const auto *LU = M.getNamedGlobal("llvm.used")) { in doFinalization() local
1557 assert(LU->hasInitializer() && in doFinalization()
1559 assert(isa<ArrayType>(LU->getValueType()) && in doFinalization()
1561 if (const auto *A = cast<ConstantArray>(LU->getInitializer())) { in doFinalization()
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DValueTracking.cpp1349 Operator *LU = dyn_cast<Operator>(L); in computeKnownBitsFromOperator() local
1350 if (!LU) in computeKnownBitsFromOperator()
1352 unsigned Opcode = LU->getOpcode(); in computeKnownBitsFromOperator()
1361 Value *LL = LU->getOperand(0); in computeKnownBitsFromOperator()
1362 Value *LR = LU->getOperand(1); in computeKnownBitsFromOperator()
1381 auto *OverflowOp = dyn_cast<OverflowingBinaryOperator>(LU); in computeKnownBitsFromOperator()
H A DScalarEvolution.cpp654 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS); in CompareSCEVComplexity() local
657 int X = CompareValueComplexity(EqCacheValue, LI, LU->getValue(), in CompareSCEVComplexity()
9940 if (const SCEVUnknown *LU = dyn_cast<SCEVUnknown>(LHS)) in isImpliedViaMerge() local
9941 if (auto *Phi = dyn_cast<PHINode>(LU->getValue())) { in isImpliedViaMerge()
/freebsd-12.1/share/misc/
H A Diso3166151 LU LUX 442 Luxembourg
/freebsd-12.1/contrib/tzdata/
H A Dzone1970.tab223 LU +4936+00609 Europe/Luxembourg
H A Dzone.tab254 LU +4936+00609 Europe/Luxembourg
/freebsd-12.1/contrib/sendmail/
H A DPGPKEYS84 iqYAoI7/PnKgJT+LU/WjXwOZHGsoMXOUiQCVAwUQO1jKrwZ+Xti/tWVpAQEYaAQA
/freebsd-12.1/sys/conf/
H A DNOTES2743 # the Billionton USB100, the Melco LU-ATX, the D-Link DSB-650TX
/freebsd-12.1/crypto/heimdal/lib/wind/
H A DUnicodeData.txt2617 0E26;THAI CHARACTER LU;Lo;0;L;;;;;N;THAI LETTER LU;;;;
3331 1209;ETHIOPIC SYLLABLE LU;Lo;0;L;;;;;N;;;;;
3691 13B7;CHEROKEE LETTER LU;Lo;0;L;;;;;N;;;;;
4298 1622;CANADIAN SYLLABICS CARRIER LU;Lo;0;L;;;;;N;;;;;
9859 A1D0;YI SYLLABLE LU;Lo;0;L;;;;;N;;;;;
12633 10813;CYPRIOT SYLLABLE LU;Lo;0;R;;;;;N;;;;;