Home
last modified time | relevance | path

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

/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp1799 return isAMCompletelyFolded(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, in isAMCompletelyFolded()
1812 if (!isAMCompletelyFolded(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, in getScalingFactorCost()
3454 assert(isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F) && in InsertFormula()
3709 if (isAlwaysFoldable(TTI, SE, LU.MinOffset, LU.MaxOffset, LU.Kind, in GenerateReassociationsImpl()
3862 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) in GenerateSymbolicOffsetsImpl()
3893 if (isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) { in GenerateConstantOffsetsImpl()
3946 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, F)) in GenerateConstantOffsetsImpl()
3966 if (LU.MaxOffset != LU.MinOffset) in GenerateConstantOffsets()
4092 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, in GenerateScales()
4367 if (!isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LU.Kind, LU.AccessTy, in GenerateCrossUseConstantOffsets()
[all …]
H A DSROA.cpp4323 for (User *LU : LI->users()) { in presplitLoadsAndStores()
4324 auto *SI = dyn_cast<StoreInst>(LU); in presplitLoadsAndStores()
4524 for (User *LU : LI->users()) { in presplitLoadsAndStores()
4525 StoreInst *SI = cast<StoreInst>(LU); in presplitLoadsAndStores()
/freebsd-14.2/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-14.2/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonBlockRanges.cpp303 auto LD = LastDef[R], LU = LastUse[R]; in computeInitialLiveRanges() local
306 if (LU == IndexType::None) in computeInitialLiveRanges()
307 LU = IndexType::Exit; in computeInitialLiveRanges()
308 LiveMap[R].add(LD, LU, false, false); in computeInitialLiveRanges()
H A DHexagonISelLowering.cpp3108 SDValue LU = LowerUnalignedLoad(SDValue(LN, 0), DAG); in LowerLoad() local
3110 SDValue TP = getInstr(Hexagon::C2_tfrrp, dl, MemTy, {LU}, DAG); in LowerLoad()
3116 SDValue Ch = cast<LoadSDNode>(LU.getNode())->getChain(); in LowerLoad()
3119 return LU; in LowerLoad()
/freebsd-14.2/contrib/llvm-project/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()
/freebsd-14.2/contrib/jemalloc/include/jemalloc/internal/
H A Dbitmap.h257 if (group_masked == 0LU) { in bitmap_ffu()
258 if (group == 0LU) { in bitmap_ffu()
/freebsd-14.2/contrib/llvm-project/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()
/freebsd-14.2/contrib/llvm-project/llvm/lib/IR/
H A DLegacyPassManager.cpp625 auto &LU = DMI->second; in collectLastUses() local
626 LastUses.append(LU.begin(), LU.end()); in collectLastUses()
1642 SmallVector<Pass *, 1> LU; in addLowerLevelRequiredPass() local
1643 LU.push_back(FoundPass); in addLowerLevelRequiredPass()
1644 FPP->setLastUser(LU, P); in addLowerLevelRequiredPass()
H A DAsmWriter.cpp197 const Use *LU = L.first; in predictValueUseListOrder() local
199 if (LU == RU) in predictValueUseListOrder()
202 auto LID = OM.lookup(LU->getUser()); in predictValueUseListOrder()
223 return LU->getOperandNo() < RU->getOperandNo(); in predictValueUseListOrder()
224 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrder()
/freebsd-14.2/secure/caroot/untrusted/
H A DLuxTrust_Global_Root_2.pem19 Issuer: C = LU, O = LuxTrust S.A., CN = LuxTrust Global Root 2
23 Subject: C = LU, O = LuxTrust S.A., CN = LuxTrust Global Root 2
/freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/
H A DTargetLoweringObjectFileImpl.cpp1899 if (const auto *LU = M.getNamedGlobal("llvm.used")) { in emitLinkerDirectives() local
1900 assert(LU->hasInitializer() && "expected llvm.used to have an initializer"); in emitLinkerDirectives()
1901 assert(isa<ArrayType>(LU->getValueType()) && in emitLinkerDirectives()
1903 if (const auto *A = cast<ConstantArray>(LU->getInitializer())) { in emitLinkerDirectives()
H A DMachineScheduler.cpp2150 for (SUnit *LU : LocalUses) { in constrainLocalCopy()
2151 LLVM_DEBUG(dbgs() << " Local use SU(" << LU->NodeNum << ") -> SU(" in constrainLocalCopy()
2153 DAG->addEdge(GlobalSU, SDep(LU, SDep::Weak)); in constrainLocalCopy()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCScheduleP8.td195 // Instructions of FX, LU or LS pipeline
/freebsd-14.2/share/misc/
H A Diso3166150 LU LUX 442 Luxembourg
/freebsd-14.2/usr.sbin/tzsetup/
H A Dbaseline349 LU:Luxembourg
/freebsd-14.2/contrib/tzdata/
H A Dzone.tab253 LU +4936+00609 Europe/Luxembourg
H A Dzone1970.tab81 BE,LU,NL +5050+00420 Europe/Brussels
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DValueTracking.cpp8101 auto *LU = dyn_cast<BinaryOperator>(L); in matchSimpleRecurrence() local
8102 if (!LU) in matchSimpleRecurrence()
8104 unsigned Opcode = LU->getOpcode(); in matchSimpleRecurrence()
8119 Value *LL = LU->getOperand(0); in matchSimpleRecurrence()
8120 Value *LR = LU->getOperand(1); in matchSimpleRecurrence()
8139 BO = LU; in matchSimpleRecurrence()
H A DScalarEvolution.cpp698 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS); in CompareSCEVComplexity() local
701 int X = CompareValueComplexity(EqCacheValue, LI, LU->getValue(), in CompareSCEVComplexity()
12067 if (const SCEVUnknown *LU = dyn_cast<SCEVUnknown>(LHS)) in isImpliedViaMerge() local
12068 if (auto *Phi = dyn_cast<PHINode>(LU->getValue())) { in isImpliedViaMerge()
/freebsd-14.2/sys/conf/
H A DNOTES2516 # the Billionton USB100, the Melco LU-ATX, the D-Link DSB-650TX
/freebsd-14.2/contrib/one-true-awk/testdir/
H A Dfunstack.ok2135 M. Hatzopoulos A note on the LU factorization of a
H A Dfunstack.in12331 …LU decomposition converges when floating-point precision. It is also proved that the computed LU d…
15731 …abstract = "A recursive algorithm for computing the inverse of a matrix from the LU factors ba…
16140 title = "A note on the {LU} factorization of a symmetric matrix",
16157 …keywords = "inversion programs; linear equations; LU factorisation; matrix; matrix algebra; sy…
/freebsd-14.2/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;;;;;