/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | SetOperations.h | 22 bool set_union(S1Ty &S1, const S2Ty &S2) { argument 25 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); 36 /// elements that are not contained in S2. 39 void set_intersect(S1Ty &S1, const S2Ty &S2) { argument 43 if (!S2.count(E)) S1.erase(E); // Erase element if not in S2 50 S1Ty set_difference(const S1Ty &S1, const S2Ty &S2) { argument 54 if (!S2.count(*SI)) // if the element is not in set2 62 void set_subtract(S1Ty &S1, const S2Ty &S2) { argument 71 set_is_subset(const S1Ty &S1, const S2Ty &S2) argument 83 set_is_strict_subset(const S1Ty &S1, const S2Ty &S2) argument [all...] |
H A D | StringSwitch.h | 92 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, argument 94 return Case(S0, Value).Cases(S1, S2, Value); 97 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, argument 99 return Case(S0, Value).Cases(S1, S2, S3, Value); 102 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, argument 104 return Case(S0, Value).Cases(S1, S2, S3, S4, Value); 107 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, argument 110 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, Value); 113 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, argument 116 return Case(S0, Value).Cases(S1, S2, S 119 Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, StringLiteral S5, StringLiteral S6, StringLiteral S7, T Value) argument 125 Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, StringLiteral S5, StringLiteral S6, StringLiteral S7, StringLiteral S8, T Value) argument 132 Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, StringLiteral S5, StringLiteral S6, StringLiteral S7, StringLiteral S8, StringLiteral S9, T Value) argument 165 CasesLower(StringLiteral S0, StringLiteral S1, StringLiteral S2, T Value) argument 170 CasesLower(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, T Value) argument 175 CasesLower(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, T Value) argument [all...] |
/freebsd-13-stable/contrib/wpa/src/crypto/ |
H A D | sha1-tlsprf.c | 34 const u8 *S1, *S2; local 60 * PRF = P_MD5(S1, label + seed) XOR P_SHA-1(S2, label + seed) 65 S2 = secret + L_S1; 67 /* The last byte of S1 will be shared with S2 */ 68 S2--; 72 hmac_sha1_vector(S2, L_S2, 2, &SHA1_addr[1], &SHA1_len[1], A_SHA1); 83 hmac_sha1_vector(S2, L_S2, 3, SHA1_addr, SHA1_len, 86 hmac_sha1(S2, L_S2, A_SHA1, SHA1_MAC_LEN, A_SHA1);
|
/freebsd-13-stable/lib/msun/src/ |
H A D | k_sinf.c | 28 S2 = 0x111110896efbb2.0p-59, /* 0.0083333293858894631756 */ variable 45 return (x + s*(S1+z*S2)) + s*w*r;
|
H A D | k_sin.c | 35 * |----- - (1+S1*x +S2*x +S3*x +S4*x +S5*x +S6*x )| <= 2 42 * r = x *(S2+x *(S3+x *(S4+x *(S5+x *S6)))) 53 S2 = 8.33333333332248946124e-03, /* 0x3F811111, 0x1110F8A6 */ variable 66 r = S2+z*(S3+z*S4) + z*w*(S5+z*S6);
|
H A D | k_sincosf.h | 20 S2 = 0x111110896efbb2.0p-59, /* 0.0083333293858894631756 */ variable 40 *sn = (x + s * (S1 + z * S2)) + s * w * r;
|
H A D | k_sincos.h | 19 S2 = 8.33333333332248946124e-03, /* 0x3F811111, 0x1110F8A6 */ variable 40 r = S2 + z * (S3 + z * S4) + z * w * (S5 + z * S6);
|
H A D | k_sincosl.h | 42 S2 = 0.0083333333333333332, /* 0x11111111111111.0p-59 */ variable 62 r = S2 + z * (S3 + z * (S4 + z * (S5 + z * (S6 + z * (S7 + z * S8))))); 87 S2 = 0.0083333333333333333333333333333331135404851288270047L, variable 117 r = S2 + z * (S3 + z * (S4 + z * (S5 + z * (S6 + z * (S7 + z * (S8 +
|
/freebsd-13-stable/crypto/openssh/regress/ |
H A D | keygen-change.sh | 7 S2="2secret" 17 ${SSHKEYGEN} -p -P ${S1} -N ${S2} -f $OBJ/$t-key > /dev/null
|
/freebsd-13-stable/lib/msun/ld80/ |
H A D | k_sinl.c | 44 S2 = 0.0083333333333333332, /* 0x11111111111111.0p-59 */ variable 59 r = S2+z*(S3+z*(S4+z*(S5+z*(S6+z*(S7+z*S8)))));
|
/freebsd-13-stable/contrib/llvm-project/llvm/tools/llvm-pdbutil/ |
H A D | PrettyTypeDumper.cpp | 37 typedef bool (*CompareFunc)(const LayoutPtr &S1, const LayoutPtr &S2); 39 static bool CompareNames(const LayoutPtr &S1, const LayoutPtr &S2) { argument 40 return S1->getName() < S2->getName(); 43 static bool CompareSizes(const LayoutPtr &S1, const LayoutPtr &S2) { argument 44 return S1->getSize() < S2->getSize(); 47 static bool ComparePadding(const LayoutPtr &S1, const LayoutPtr &S2) { argument 48 return S1->deepPaddingSize() < S2->deepPaddingSize(); 51 static bool ComparePaddingPct(const LayoutPtr &S1, const LayoutPtr &S2) { argument 53 double Pct2 = (double)S2->deepPaddingSize() / (double)S2 57 ComparePaddingImmediate(const LayoutPtr &S1, const LayoutPtr &S2) argument 61 ComparePaddingPctImmediate(const LayoutPtr &S1, const LayoutPtr &S2) argument [all...] |
/freebsd-13-stable/lib/msun/ld128/ |
H A D | k_sinl.c | 34 S2 = 0.0083333333333333333333333333333331135404851288270047L, variable 55 r = S2+z*(S3+z*(S4+z*(S5+z*(S6+z*(S7+z*(S8+
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonStoreWidening.cpp | 108 bool storesAreAdjacent(const MachineInstr *S1, const MachineInstr *S2); 282 // Check if store instructions S1 and S2 are adjacent. More precisely, 283 // S2 has to access memory immediately following that accessed by S1. 285 const MachineInstr *S2) { 286 if (!handledStoreType(S1) || !handledStoreType(S2)) 293 int Off2 = S2->getOperand(1).getImm(); 354 MachineInstr *S2 = *I; local 355 // Stores are sorted, so if S1 and S2 are not adjacent, there won't be 357 if (!storesAreAdjacent(S1, S2)) 360 unsigned S2Size = getStoreTarget(S2) 284 storesAreAdjacent(const MachineInstr *S1, const MachineInstr *S2) argument [all...] |
/freebsd-13-stable/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_lex.l | 94 * S2 - D program outer scope (probe specifiers and declarations) 105 %s S0 S1 S2 S3 S4 187 <S2>auto { yybegin(YYS_EXPR); return (DT_KEY_AUTO); } 188 <S2>char { yybegin(YYS_EXPR); return (DT_KEY_CHAR); } 189 <S2>const { yybegin(YYS_EXPR); return (DT_KEY_CONST); } 190 <S2>counter { yybegin(YYS_DEFINE); return (DT_KEY_COUNTER); } 191 <S2>double { yybegin(YYS_EXPR); return (DT_KEY_DOUBLE); } 192 <S2>enum { yybegin(YYS_EXPR); return (DT_KEY_ENUM); } 193 <S2>extern { yybegin(YYS_EXPR); return (DT_KEY_EXTERN); } 194 <S2>floa [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | InstSimplifyPass.cpp | 33 SmallPtrSet<const Instruction *, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
|
H A D | LoopInstSimplify.cpp | 63 SmallPtrSet<const Instruction *, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | Mips16FrameLowering.cpp | 167 bool SaveS2 = Reserved[Mips::S2]; 169 SavedRegs.set(Mips::S2);
|
H A D | MipsCCState.cpp | 32 auto Comp = [](const char *S1, const char *S2) { return strcmp(S1, S2) < 0; };
|
/freebsd-13-stable/crypto/openssl/crypto/ec/asm/ |
H A D | ecp_nistz256-x86.pl | 1384 $U1,$U2,$S1,$S2)=map(32*$_,(0..17)); 1467 &lea ("edi",&DWP($S2,"esp")); 1468 &call ("_ecp_nistz256_mul_mont"); # p256_mul_mont(S2, Z1sqr, in1_z); 1478 &lea ("ebp",&DWP($S2,"esp")); 1479 &lea ("edi",&DWP($S2,"esp")); 1480 &call ("_ecp_nistz256_mul_mont"); # p256_mul_mont(S2, S2, in2_y); 1482 &lea ("esi",&DWP($S2,"esp")); 1485 &call ("_ecp_nistz256_sub"); # p256_sub(R, S2, S1); 1527 &or ("eax",&DWP(32*18+8,"esp")); # ~is_equal(S1,S2) [all...] |
H A D | ecp_nistz256-sparcv9.pl | 876 $U1,$U2,$S1,$S2)=map(32*$_,(0..11)); 955 call __ecp_nistz256_mul_mont ! p256_mul_mont(S2, Z1sqr, in1_z); 956 add %sp,LOCALS+$S2,$rp 964 add %sp,LOCALS+$S2,$ap 965 call __ecp_nistz256_mul_mont ! p256_mul_mont(S2, S2, in2_y); 966 add %sp,LOCALS+$S2,$rp 969 call __ecp_nistz256_sub_from ! p256_sub(R, S2, S1); 1013 be,pt %icc,.Ladd_double ! is_equal(S1,S2)? 1100 call __ecp_nistz256_mul_mont ! p256_mul_mont(S2, S [all...] |
/freebsd-13-stable/crypto/openssl/crypto/poly1305/asm/ |
H A D | poly1305-x86_64.pl | 2131 my ($R0,$R1,$R2,$R3,$R4, $S1,$S2,$S3,$S4) = map("%zmm$_",(16..24)); 2181 vmovdqu `16*4-64`($ctx),%x#$T1 # ... ${S2} 2193 vpermd $T1,$T2,$S2 2202 vmovdqa64 $S2,0x80(%rsp){%k2} 2248 vpmuludq $T3,$S2,$M0 2262 vpmuludq $T4,$S2,$M1 2339 vpslld \$2,$R2,$S2 2343 vpaddd $R2,$S2,$S2 2444 vpmuludq $H3,$S2, [all...] |
/freebsd-13-stable/contrib/llvm-project/clang/lib/Tooling/ASTDiff/ |
H A D | ASTDiff.cpp | 562 Subtree S2; member in class:clang::diff::ZhangShashaMatcher 568 : DiffImpl(DiffImpl), S1(T1, Id1), S2(T2, Id2) { 574 TreeDist[I] = std::make_unique<double[]>(size_t(S2.getSize()) + 1); 575 ForestDist[I] = std::make_unique<double[]>(size_t(S2.getSize()) + 1); 587 TreePairs.emplace_back(SNodeId(S1.getSize()), SNodeId(S2.getSize())); 601 FirstCol = S2.getLeftMostDescendant(LastCol); 615 SNodeId LMD2 = S2.getLeftMostDescendant(Col); 617 LMD2 == S2.getLeftMostDescendant(LastCol)) { 619 NodeId Id2 = S2.getIdInRoot(Col); 646 if (!DiffImpl.isMatchingPossible(S1.getIdInRoot(Id1), S2 [all...] |
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ConstraintManager.h | 83 ProgramStateRef S2) const = 0;
|
/freebsd-13-stable/sys/mips/include/ |
H A D | regnum.h | 85 #define S2 18 macro
|
/freebsd-13-stable/crypto/openssl/crypto/ec/ |
H A D | ecp_nistz256.c | 309 BN_ULONG U2[P256_LIMBS], S2[P256_LIMBS]; local 350 ecp_nistz256_mul_mont(S2, Z1sqr, in1_z); /* S2 = Z1^3 */ 353 ecp_nistz256_mul_mont(S2, S2, in2_y); /* S2 = Y2*Z1^3 */ 354 ecp_nistz256_sub(R, S2, S1); /* R = S2 - S1 */ 371 * intermediate variables U1, U2 and S1, S2 that are derived from 374 * - S1 = Y1 * (Z2)^3 ; S2 440 BN_ULONG U2[P256_LIMBS], S2[P256_LIMBS]; local [all...] |