Home
last modified time | relevance | path

Searched refs:P2 (Results 1 – 25 of 108) sorted by relevance

12345

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/MC/MCDisassembler/
H A DMCDisassembler.h53 friend bool operator<(const SymbolInfoTy &P1, const SymbolInfoTy &P2) {
54 assert((P1.IsXCOFF == P2.IsXCOFF && P1.HasType == P2.HasType) &&
60 std::tie(P2.Addr, P2.Type, P2.Name);
64 std::tie(P2.Addr, P2.XCOFFSymInfo, P2.Name);
67 bool MS1 = !P1.IsMappingSymbol, MS2 = !P2.IsMappingSymbol;
69 std::tie(P2.Addr, MS2, P2.Name, P2.Type);
/freebsd-14.2/sys/contrib/device-tree/src/arm/
H A Dam335x-pocketbeagle.dts87 "P2.03",
91 "P2.19",
112 "P2.24",
113 "P2.33",
114 "P2.22",
115 "P2.18",
120 "P2.10",
125 "P2.06",
126 "P2.04",
127 "P2.02",
[all …]
H A Dlpc3250-ea3250.dts57 gpios = <&gpio 2 0 0>; /* P2.0 */
63 gpios = <&gpio 2 1 0>; /* P2.1 */
69 gpios = <&gpio 2 2 0>; /* P2.2 */
75 gpios = <&gpio 2 3 0>; /* P2.3 */
81 gpios = <&gpio 2 4 0>; /* P2.4 */
97 gpios = <&gpio 2 10 1>; /* P2.10, active low */
102 gpios = <&gpio 2 11 1>; /* P2.11, active low */
107 gpios = <&gpio 2 12 1>; /* P2.12, active low */
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DInlineOrder.cpp84 return P1.Size < P2.Size; in isMoreDesirable()
104 return P1.Cost < P2.Cost; in isMoreDesirable()
123 const CostBenefitPriority &P2) { in isMoreDesirable() argument
142 P2.Cost + P2.StaticBonusApplied < ModuleInlinerTopPriorityThreshold; in isMoreDesirable()
151 return P1.Cost < P2.Cost; in isMoreDesirable()
155 bool P2HasCB = P2.CostBenefit.has_value(); in isMoreDesirable()
164 APInt LHS = P1.CostBenefit->getBenefit() * P2.CostBenefit->getCost(); in isMoreDesirable()
165 APInt RHS = P2.CostBenefit->getBenefit() * P1.CostBenefit->getCost(); in isMoreDesirable()
170 return P1.Cost < P2.Cost; in isMoreDesirable()
191 static bool isMoreDesirable(const MLPriority &P1, const MLPriority &P2) { in isMoreDesirable() argument
[all …]
H A DCmpInstAnalysis.cpp58 bool llvm::predicatesFoldable(ICmpInst::Predicate P1, ICmpInst::Predicate P2) { in predicatesFoldable() argument
59 return (CmpInst::isSigned(P1) == CmpInst::isSigned(P2)) || in predicatesFoldable()
60 (CmpInst::isSigned(P1) && ICmpInst::isEquality(P2)) || in predicatesFoldable()
61 (CmpInst::isSigned(P2) && ICmpInst::isEquality(P1)); in predicatesFoldable()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNRegPressure.h108 const GCNRegPressure &P2);
113 inline GCNRegPressure max(const GCNRegPressure &P1, const GCNRegPressure &P2) { in max() argument
116 Res.Value[I] = std::max(P1.Value[I], P2.Value[I]); in max()
121 const GCNRegPressure &P2) {
123 Sum += P2;
128 const GCNRegPressure &P2) {
130 Diff -= P2;
/freebsd-14.2/contrib/bearssl/src/ec/
H A Dec_p256_m62.c885 f256_montysquare(t3, P2->z); in p256_add()
887 f256_montymul(t4, P2->z, t3); in p256_add()
894 f256_montymul(t2, P2->x, t4); in p256_add()
896 f256_montymul(t4, P2->y, t5); in p256_add()
1004 f256_montymul(t2, P2->x, t4); in p256_add_mixed()
1006 f256_montymul(t4, P2->y, t5); in p256_add_mixed()
1127 f256_montymul(t2, P2->x, t4);
1129 f256_montymul(t4, P2->y, t5);
1183 f256_add(t1, P2->y, P2->y);
1189 f256_montysquare(t2, P2->y);
[all …]
H A Dec_prime_i15.c453 run_code(jacobian *P1, const jacobian *P2, in run_code() argument
466 memcpy(t[P2x], P2->c, 3 * I15_LEN * sizeof(uint16_t)); in run_code()
546 point_add(jacobian *P1, const jacobian *P2, const curve_params *cc) in point_add() argument
548 return run_code(P1, P2, cc, code_add); in point_add()
570 jacobian P2, P3, Q, T, U; in point_mul() local
572 memcpy(&P2, P, sizeof P2); in point_mul()
573 point_double(&P2, cc); in point_mul()
575 point_add(&P3, &P2, cc); in point_mul()
592 CCOPY(EQ(bits, 2), &T, &P2, sizeof T); in point_mul()
H A Dec_prime_i31.c452 run_code(jacobian *P1, const jacobian *P2, in run_code() argument
465 memcpy(t[P2x], P2->c, 3 * I31_LEN * sizeof(uint32_t)); in run_code()
545 point_add(jacobian *P1, const jacobian *P2, const curve_params *cc) in point_add() argument
547 return run_code(P1, P2, cc, code_add); in point_add()
569 jacobian P2, P3, Q, T, U; in point_mul() local
571 memcpy(&P2, P, sizeof P2); in point_mul()
572 point_double(&P2, cc); in point_mul()
574 point_add(&P3, &P2, cc); in point_mul()
591 CCOPY(EQ(bits, 2), &T, &P2, sizeof T); in point_mul()
H A Dec_p256_m64.c905 f256_montysquare(t3, P2->z); in p256_add()
907 f256_montymul(t4, P2->z, t3); in p256_add()
914 f256_montymul(t2, P2->x, t4); in p256_add()
916 f256_montymul(t4, P2->y, t5); in p256_add()
1024 f256_montymul(t2, P2->x, t4); in p256_add_mixed()
1026 f256_montymul(t4, P2->y, t5); in p256_add_mixed()
1147 f256_montymul(t2, P2->x, t4);
1149 f256_montymul(t4, P2->y, t5);
1202 f256_add(t1, P2->y, P2->y);
1207 f256_montysquare(t2, P2->y);
[all …]
H A Dec_p256_m31.c868 square_f256(t3, P2->z); in p256_add()
870 mul_f256(t4, P2->z, t3); in p256_add()
877 mul_f256(t2, P2->x, t4); in p256_add()
879 mul_f256(t4, P2->y, t5); in p256_add()
921 mul_f256(t1, P1->z, P2->z); in p256_add()
986 mul_f256(t2, P2->x, t4); in p256_add_mixed()
988 mul_f256(t4, P2->y, t5); in p256_add_mixed()
1126 p256_jacobian P2, P3, Q, T, U; in p256_mul() local
1131 P2 = *P; in p256_mul()
1132 p256_double(&P2); in p256_mul()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DCostAllocator.h81 static bool isEqual(PoolEntry *P1, PoolEntry *P2) { in isEqual() argument
83 return P1 == P2; in isEqual()
84 return isEqual(P1->getValue(), P2); in isEqual()
/freebsd-14.2/contrib/llvm-project/compiler-rt/lib/orc/tests/unit/
H A Dstring_pool_test.cpp22 auto P2 = SP.intern(S); in TEST() local
26 EXPECT_EQ(P1, P2) << "Failed to unique entries"; in TEST()
/freebsd-14.2/lib/msun/src/
H A Ds_exp2f.c40 P2 = 0x1.ebfbe0p-3f, variable
132 tv = tv + u * (P1 + z * P2) + u * (z * z) * (P3 + z * P4); in exp2f()
H A Ds_cbrt.c30 P2 = 1.621429720105354466140, /* 0x3ff9f160, 0x4a49d6c2 */ variable
87 t=t*((P0+r*(P1+r*P2))+((r*r)*r)*(P3+r*P4)); in cbrt()
H A Ds_exp2.c40 P2 = 0x1.ebfbdff82c575p-3, variable
382 r = t + t * z * (P1 + z * (P2 + z * (P3 + z * (P4 + z * P5)))); in exp2()
H A De_expf.c36 P2 = -2.7667332906e-3; /* -0xb55215.0p-32 */ variable
86 c = x - t*(P1+t*P2); in expf()
H A De_exp.c92 P2 = -2.77777777770155933842e-03, /* 0xBF66C16C, 0x16BEBD93 */ variable
148 c = x - t*(P1+t*(P2+t*(P3+t*(P4+t*P5)))); in exp()
/freebsd-14.2/contrib/netbsd-tests/bin/sh/
H A Dt_wait.sh60 sleep 1 & P2=$!
69 wait ${P2}
/freebsd-14.2/lib/msun/ld80/
H A Ds_exp2l.c58 P2 = 2.4022650695910072e-1, /* 0x1ebfbdff82c58f.0p-55 */ variable
276 r = t_lo + (t_hi + t_lo) * z * (P1.e + z * (P2 + z * (P3 + z * (P4 in exp2l()
H A Ds_logl.c102 P2 = -0.5, variable
540 (F_lo(i) + dk * ln2_lo + z * d * (d * P4 + P3)) + z * P2; in k_logl()
649 (F_lo(i) + dk * ln2_lo + d_lo + z * d * (d * P4 + P3)) + z * P2; in log1pl()
/freebsd-14.2/lib/msun/ld128/
H A Ds_exp2l.c47 P2 = 0x1.ebfbdff82c58ea86f16b06ec9736p-3L, variable
415 r = t + t * z * (P1 + z * (P2 + z * (P3 + z * (P4 + z * (P5 + z * (P6 in exp2l()
H A Ds_logl.c97 P2 = -0.5L, variable
552 dd * P14))))))))))) + (F_lo(i) + dk * ln2_lo) + d * d * P2; in k_logl()
660 dd * P14))))))))))) + (F_lo(i) + dk * ln2_lo + d_lo) + d * d * P2; in log1pl()
/freebsd-14.2/crypto/openssl/VMS/
H A Dopenssl_shutdown.com.in9 $ ! P2 If the value is "NOALIASES", no alias logical names are
48 $ IF P2 .NES. "NOALIASES"
/freebsd-14.2/contrib/file/tests/
H A Dpnm1.testfile1 P2

12345