| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopStrengthReduce.cpp | 1191 const LSRUse &LU, const Formula &F);
1195 const LSRUse &LU, const Formula &F,
1243 const DenseSet<const SCEV *> &VisitedRegs, const LSRUse &LU,
1252 SmallPtrSetImpl<const SCEV *> &Regs, const LSRUse &LU,
1256 const LSRUse &LU, bool HardwareLoopProfitable,
1399 SmallPtrSetImpl<const SCEV *> &Regs, const LSRUse &LU, in RateRegister() argument
1438 if (LU.Kind == LSRUse::ICmpZero && F.countsDownToZero() && in RateRegister()
1447 RateRegister(F, AR->getOperand(1), Regs, LU, HardwareLoopProfitable); in RateRegister()
1470 const LSRUse &LU, bool HardwareLoopProfitable, in RatePrimaryRegister() argument
1477 RateRegister(F, Reg, Regs, LU, HardwareLoopProfitable); in RatePrimaryRegister()
[all …]
|
| H A D | SROA.cpp | 4503 for (User *LU : LI->users()) { in presplitLoadsAndStores()
4504 auto *SI = dyn_cast<StoreInst>(LU); in presplitLoadsAndStores()
4704 for (User *LU : LI->users()) { in presplitLoadsAndStores()
4705 StoreInst *SI = cast<StoreInst>(LU); in presplitLoadsAndStores()
|
| /freebsd/sys/contrib/ck/include/ |
| H A D | ck_cohort.h | 56 #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/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonBlockRanges.cpp | 302 auto LD = LastDef[R], LU = LastUse[R]; in computeInitialLiveRanges() local
305 if (LU == IndexType::None) in computeInitialLiveRanges()
306 LU = IndexType::Exit; in computeInitialLiveRanges()
307 LiveMap[R].add(LD, LU, false, false); in computeInitialLiveRanges()
|
| H A D | HexagonISelLowering.cpp | 3147 SDValue LU = LowerUnalignedLoad(SDValue(LN, 0), DAG); in LowerLoad() local
3149 SDValue TP = getInstr(Hexagon::C2_tfrrp, dl, MemTy, {LU}, DAG); in LowerLoad()
3155 SDValue Ch = cast<LoadSDNode>(LU.getNode())->getChain(); in LowerLoad()
3158 return LU; in LowerLoad()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/DXILWriter/ |
| H A D | DXILValueEnumerator.cpp | 221 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/contrib/jemalloc/include/jemalloc/internal/ |
| H A D | bitmap.h | 254 bitmap_t group_mask = ~((1LU << group_nmask) - 1); in bitmap_ffu()
256 if (group_masked == 0LU) { in bitmap_ffu()
257 if (group == 0LU) { in bitmap_ffu()
283 bitmap_t g = bitmap[i] & ~((1LU << (min_bit & BITMAP_GROUP_NBITS_MASK)) in bitmap_ffu()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | LegacyPassManager.cpp | 613 auto &LU = DMI->second; in collectLastUses() local
614 LastUses.append(LU.begin(), LU.end()); in collectLastUses()
1597 SmallVector<Pass *, 1> LU; in addLowerLevelRequiredPass() local
1598 LU.push_back(FoundPass); in addLowerLevelRequiredPass()
1599 FPP->setLastUser(LU, P); in addLowerLevelRequiredPass()
|
| H A D | AsmWriter.cpp | 236 const Use *LU = L.first; in predictValueUseListOrder() local
238 if (LU == RU) in predictValueUseListOrder()
241 auto LID = OM.lookup(LU->getUser()); in predictValueUseListOrder()
262 return LU->getOperandNo() < RU->getOperandNo(); in predictValueUseListOrder()
263 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrder()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanAnalysis.cpp | 409 return any_of(MaxLocalUsers, [&TTI](auto &LU) { in exceedsMaxNumRegs() argument
410 return LU.second > TTI.getNumberOfRegisters(LU.first); in exceedsMaxNumRegs()
|
| /freebsd/contrib/llvm-project/llvm/lib/Bitcode/Writer/ |
| H A D | ValueEnumerator.cpp | 190 const Use *LU = L.first; in predictValueUseListOrderImpl() local
192 if (LU == RU) in predictValueUseListOrderImpl()
195 auto LID = OM.lookup(LU->getUser()).first; in predictValueUseListOrderImpl()
216 return LU->getOperandNo() < RU->getOperandNo(); in predictValueUseListOrderImpl()
217 return LU->getOperandNo() > RU->getOperandNo(); in predictValueUseListOrderImpl()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCScheduleP8.td | 195 // Instructions of FX, LU or LS pipeline
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/ |
| H A D | DXILLegalizePass.cpp | 264 for (User *LU : Load->users()) { in upcastI8AllocasAndUses()
266 if (CastInst *Cast = dyn_cast<CastInst>(LU)) in upcastI8AllocasAndUses()
268 else if (CallInst *CI = dyn_cast<CallInst>(LU)) { in upcastI8AllocasAndUses()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | TargetLoweringObjectFileImpl.cpp | 1955 if (const auto *LU = M.getNamedGlobal("llvm.used")) { in emitLinkerDirectives() local
1956 assert(LU->hasInitializer() && "expected llvm.used to have an initializer"); in emitLinkerDirectives()
1957 assert(isa<ArrayType>(LU->getValueType()) && in emitLinkerDirectives()
1959 if (const auto *A = cast<ConstantArray>(LU->getInitializer())) { in emitLinkerDirectives()
|
| H A D | MachineScheduler.cpp | 2464 for (SUnit *LU : LocalUses) { in constrainLocalCopy()
2465 LLVM_DEBUG(dbgs() << " Local use SU(" << LU->NodeNum << ") -> SU(" in constrainLocalCopy()
2467 DAG->addEdge(GlobalSU, SDep(LU, SDep::Weak)); in constrainLocalCopy()
|
| /freebsd/share/misc/ |
| H A D | iso3166 | 150 LU LUX 442 Luxembourg
|
| /freebsd/usr.sbin/tzsetup/ |
| H A D | baseline | 349 LU:Luxembourg
|
| /freebsd/contrib/tzdata/ |
| H A D | zone.tab | 253 LU +4936+00609 Europe/Luxembourg
|
| H A D | zone1970.tab | 81 BE,LU,NL +5050+00420 Europe/Brussels
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 676 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS); in CompareSCEVComplexity() local
680 CompareValueComplexity(LI, LU->getValue(), RU->getValue(), Depth + 1); in CompareSCEVComplexity()
12340 if (const SCEVUnknown *LU = dyn_cast<SCEVUnknown>(LHS)) in isImpliedViaMerge() local
12341 if (auto *Phi = dyn_cast<PHINode>(LU->getValue())) { in isImpliedViaMerge()
|
| /freebsd/sys/conf/ |
| H A D | NOTES | 2517 # the Billionton USB100, the Melco LU-ATX, the D-Link DSB-650TX
|
| /freebsd/contrib/one-true-awk/testdir/ |
| H A D | funstack.ok | 2135 M. Hatzopoulos A note on the LU factorization of a
|
| H A D | funstack.in | 12331 …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/crypto/heimdal/lib/wind/ |
| H A D | UnicodeData.txt | 2617 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;;;;;
|
| /freebsd/crypto/krb5/src/lib/krb5/unicode/ |
| H A D | UnicodeData.txt | 2532 0E26;THAI CHARACTER LU;Lo;0;L;;;;;N;THAI LETTER LU;;;;
3246 1209;ETHIOPIC SYLLABLE LU;Lo;0;L;;;;;N;;;;;
3606 13B7;CHEROKEE LETTER LU;Lo;0;L;;;;;N;;;;;
4213 1622;CANADIAN SYLLABICS CARRIER LU;Lo;0;L;;;;;N;;;;;
9410 A1D0;YI SYLLABLE LU;Lo;0;L;;;;;N;;;;;
|