Searched refs:S1 (Results 1 - 25 of 119) sorted by relevance

12345

/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSetOperations.h23 bool set_union(S1Ty &S1, const S2Ty &S2) { argument
28 if (S1.insert(*SI).second)
36 /// is nicer to use. Functionally, this iterates through S1, removing
40 void set_intersect(S1Ty &S1, const S2Ty &S2) { argument
41 for (typename S1Ty::iterator I = S1.begin(); I != S1.end();) {
44 if (!S2.count(E)) S1.erase(E); // Erase element if not in S2
49 S1Ty set_intersection_impl(const S1Ty &S1, const S2Ty &S2) { argument
51 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1
60 set_intersection(const S1Ty &S1, const S2Ty &S2) argument
70 set_difference(const S1Ty &S1, const S2Ty &S2) argument
82 set_subtract(S1Ty &S1, const S2Ty &S2) argument
92 set_subtract(S1Ty &S1, const S2Ty &S2, S1Ty &Removed, S1Ty &Remaining) argument
104 set_is_subset(const S1Ty &S1, const S2Ty &S2) argument
[all...]
H A DStringSwitch.h90 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, T Value) { argument
91 return Case(S0, Value).Case(S1, Value);
94 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, argument
96 return Case(S0, Value).Cases(S1, S2, Value);
99 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, argument
101 return Case(S0, Value).Cases(S1, S2, S3, Value);
104 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, argument
106 return Case(S0, Value).Cases(S1, S2, S3, S4, Value);
109 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, argument
112 return Case(S0, Value).Cases(S1, S
115 Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, StringLiteral S5, StringLiteral S6, T Value) argument
121 Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, StringLiteral S5, StringLiteral S6, StringLiteral S7, T Value) argument
127 Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, StringLiteral S5, StringLiteral S6, StringLiteral S7, StringLiteral S8, T Value) argument
134 Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, StringLiteral S5, StringLiteral S6, StringLiteral S7, StringLiteral S8, StringLiteral S9, T Value) argument
163 CasesLower(StringLiteral S0, StringLiteral S1, T Value) argument
167 CasesLower(StringLiteral S0, StringLiteral S1, StringLiteral S2, T Value) argument
172 CasesLower(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, T Value) argument
177 CasesLower(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, T Value) argument
[all...]
/freebsd-current/lib/msun/ld80/
H A Dk_sinl.c33 #define S1 ((long double)S1hi + S1lo) macro
36 S1 = -0.166666666666666666671L; /* -0xaaaaaaaaaaaaaaab.0p-66 */ variable
56 if(iy==0) return x+v*(S1+z*r);
57 else return x-((z*(half*y-v*r)-y)-v*S1);
/freebsd-current/lib/msun/src/
H A Dk_sinf.c22 S1 = -0x15555554cbac77.0p-55, /* -0.166666666416265235595 */ variable
40 return (x + s*(S1+z*S2)) + s*w*r;
H A Dk_sin.c27 * sin(x) ~ x + S1*x + ... + S6*x
31 * |----- - (1+S1*x +S2*x +S3*x +S4*x +S5*x +S6*x )| <= 2
40 * sin(x) = x + (S1*x + (x *(r-y/2)+y))
48 S1 = -1.66666666666666324348e-01, /* 0xBFC55555, 0x55555549 */ variable
64 if(iy==0) return x+v*(S1+z*r);
65 else return x-((z*(half*y-v*r)-y)-v*S1);
H A Dk_sincosf.h16 S1 = -0x15555554cbac77.0p-55, /* -0.166666666416265235595 */ variable
37 *sn = (x + s * (S1 + z * S2)) + s * w * r;
H A Dk_sincos.h15 S1 = -1.66666666666666324348e-01, /* 0xBFC55555, 0x55555549 */ variable
41 *sn = x + v * (S1 + z * r);
43 *sn = x - ((z * (y / 2 - v * r) - y) - v * S1);
H A Dk_sincosl.h24 #define S1 ((long double)S1hi + S1lo) macro
29 S1 = -0.166666666666666666671L; /* -0xaaaaaaaaaaaaaaab.0p-66 */ variable
62 *sn = x + v * (S1 + z * r);
64 *sn = x - ((z * (y / 2 - v * r) - y) - v * S1);
76 S1 = -0.16666666666666666666666666666666666606732416116558L, variable
121 *sn = x + v * (S1 + z * r);
123 *sn = x - ((z * (y / 2 - v * r) - y) - v * S1);
/freebsd-current/crypto/openssh/regress/
H A Dkeygen-change.sh6 S1="secret1"
12 ${SSHKEYGEN} -q -N ${S1} -t $t -f $OBJ/$t-key
14 ${SSHKEYGEN} -p -P ${S1} -N ${S2} -f $OBJ/$t-key > /dev/null
H A Dkeygen-comment.sh5 S1="secret1"
/freebsd-current/lib/msun/ld128/
H A Dk_sinl.c29 S1 = -0.16666666666666666666666666666666666606732416116558L, variable
53 if(iy==0) return x+v*(S1+z*r);
54 else return x-((z*(half*y-v*r)-y)-v*S1);
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DMergedLoadStoreMotion.cpp115 PHINode *getPHIOperand(BasicBlock *BB, StoreInst *S0, StoreInst *S1);
118 bool canSinkStoresAndGEPs(StoreInst *S0, StoreInst *S1) const;
209 /// Create a PHI node in BB for the operands of S0 and S1
212 StoreInst *S1) {
215 Value *Opd2 = S1->getValueOperand();
221 NewPN->applyMergedLocation(S0->getDebugLoc(), S1->getDebugLoc());
223 NewPN->addIncoming(Opd2, S1->getParent());
231 StoreInst *S1) const {
232 if (S0->getPointerOperand() == S1->getPointerOperand())
235 auto *GEP1 = dyn_cast<GetElementPtrInst>(S1
211 getPHIOperand(BasicBlock *BB, StoreInst *S0, StoreInst *S1) argument
246 sinkStoresAndGEPs(BasicBlock *BB, StoreInst *S0, StoreInst *S1) argument
[all...]
H A DInstSimplifyPass.cpp29 SmallPtrSet<const Instruction *, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
H A DLoopInstSimplify.cpp57 SmallPtrSet<const Instruction *, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
/freebsd-current/contrib/wpa/src/crypto/
H A Dsha1-tlsprf.c34 const u8 *S1, *S2; local
60 * PRF = P_MD5(S1, label + seed) XOR P_SHA-1(S2, label + seed)
64 S1 = secret;
67 /* The last byte of S1 will be shared with S2 */
71 hmac_md5_vector(S1, L_S1, 2, &MD5_addr[1], &MD5_len[1], A_MD5);
78 hmac_md5_vector(S1, L_S1, 3, MD5_addr, MD5_len, P_MD5);
80 hmac_md5(S1, L_S1, A_MD5, MD5_MAC_LEN, A_MD5);
/freebsd-current/contrib/file/src/
H A Dencoding.c302 #define S1 0x02 // accept 0, size 2 macro
329 XX, XX, S1, S1, S1, S1, S1, S1, S1, S1, S1, S
[all...]
/freebsd-current/contrib/llvm-project/llvm/tools/llvm-pdbutil/
H A DPrettyTypeDumper.cpp39 typedef bool (*CompareFunc)(const LayoutPtr &S1, const LayoutPtr &S2);
41 static bool CompareNames(const LayoutPtr &S1, const LayoutPtr &S2) { argument
42 return S1->getName() < S2->getName();
45 static bool CompareSizes(const LayoutPtr &S1, const LayoutPtr &S2) { argument
46 return S1->getSize() < S2->getSize();
49 static bool ComparePadding(const LayoutPtr &S1, const LayoutPtr &S2) { argument
50 return S1->deepPaddingSize() < S2->deepPaddingSize();
53 static bool ComparePaddingPct(const LayoutPtr &S1, const LayoutPtr &S2) { argument
54 double Pct1 = (double)S1->deepPaddingSize() / (double)S1
59 ComparePaddingImmediate(const LayoutPtr &S1, const LayoutPtr &S2) argument
63 ComparePaddingPctImmediate(const LayoutPtr &S1, const LayoutPtr &S2) argument
[all...]
/freebsd-current/crypto/openssl/crypto/sha/asm/
H A Dsha256-c64xplus.pl36 ($E,$Ectx,$F,$Fctx,$G,$Gctx,$H,$Hctx,$T1,$S1,$s0,$t0e,$t1e,$t2e,$X1,$X15)
127 || ROTL $E,26,$S1
141 || XOR $t0e,$S1,$S1
143 || XOR $t1e,$S1,$S1 ; Sigma1(e)
146 ADD $S1,$T1,$T1 ; T1 += Sigma1(e)
164 || ROTL $E,26,$S1
180 || XOR $t0e,$S1,$S1
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Target/PowerPC/GISel/
H A DPPCLegalizerInfo.cpp44 const LLT S1 = LLT::scalar(1);
58 .legalForCartesianProduct({S64}, {S1, S8, S16, S32})
74 getActionDefinitionsBuilder(G_FCMP).legalForCartesianProduct({S1},
/freebsd-current/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonStoreWidening.cpp108 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.
284 bool HexagonStoreWidening::storesAreAdjacent(const MachineInstr *S1, argument
286 if (!handledStoreType(S1) || !handledStoreType(S2))
289 const MachineMemOperand &S1MO = getStoreTarget(S1);
292 int Off1 = S1->getOperand(1).getImm();
341 MachineInstr *S1 = FirstMI; local
355 // Stores are sorted, so if S1 and S2 are not adjacent, there won't be
357 if (!storesAreAdjacent(S1, S
[all...]
/freebsd-current/crypto/heimdal/appl/ftp/ftp/
H A Dmain.c456 goto S1;
459 S1:
476 goto S1;
488 goto S1;
498 sb++; goto S1;
/freebsd-current/crypto/openssl/crypto/poly1305/asm/
H A Dpoly1305-s390x.pl227 my ($R0, $R1, $S1, $R2, $S2) = map("%v$_",(10..14));
313 vmalof ($ACC0,$H4,$S1,$ACC0);
398 veslg ($S1,$R1,2);
407 vag ($S1,$S1,$R1); # * 5
424 veslg ($S1,$R1,2);
428 vag ($S1,$S1,$R1); # * 5
441 veslf ($S1,$R1,2);
445 vaf ($S1,
[all...]
/freebsd-current/contrib/llvm-project/clang/include/clang/AST/
H A DASTStructuralEquivalence.h109 bool IsEquivalent(Stmt *S1, Stmt *S2);
/freebsd-current/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/
H A DMipsMCExpr.cpp293 if (const MipsMCExpr *S1 = dyn_cast<const MipsMCExpr>(getSubExpr())) {
294 if (const MipsMCExpr *S2 = dyn_cast<const MipsMCExpr>(S1->getSubExpr())) {
295 if (S1->getKind() == MEK_NEG && S2->getKind() == MEK_GPREL) {
/freebsd-current/contrib/llvm-project/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp560 Subtree S1; member in class:clang::diff::ZhangShashaMatcher
567 : DiffImpl(DiffImpl), S1(T1, Id1), S2(T2, Id2) {
569 size_t(S1.getSize()) + 1);
571 size_t(S1.getSize()) + 1);
572 for (int I = 0, E = S1.getSize() + 1; I < E; ++I) {
586 TreePairs.emplace_back(SNodeId(S1.getSize()), SNodeId(S2.getSize()));
599 FirstRow = S1.getLeftMostDescendant(LastRow);
613 SNodeId LMD1 = S1.getLeftMostDescendant(Row);
615 if (LMD1 == S1.getLeftMostDescendant(LastRow) &&
617 NodeId Id1 = S1
[all...]

Completed in 383 milliseconds

12345