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

1234

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSetOperations.h22 bool set_union(S1Ty &S1, const S2Ty &S2) { argument
27 if (S1.insert(*SI).second)
35 /// is nicer to use. Functionally, this iterates through S1, removing
39 void set_intersect(S1Ty &S1, const S2Ty &S2) { argument
40 for (typename S1Ty::iterator I = S1.begin(); I != S1.end();) {
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
52 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1
62 set_subtract(S1Ty &S1, const S2Ty &S2) argument
[all...]
H A DStringSwitch.h88 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, T Value) { argument
89 return Case(S0, Value).Case(S1, Value);
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, S
113 Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, StringLiteral S3, StringLiteral S4, StringLiteral S5, StringLiteral S6, T Value) argument
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
161 CasesLower(StringLiteral S0, StringLiteral S1, 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-11-stable/lib/msun/ld80/
H A Dk_sinl.c37 #define S1 ((long double)S1hi + S1lo) macro
40 S1 = -0.166666666666666666671L; /* -0xaaaaaaaaaaaaaaab.0p-66 */ variable
60 if(iy==0) return x+v*(S1+z*r);
61 else return x-((z*(half*y-v*r)-y)-v*S1);
/freebsd-11-stable/crypto/openssh/regress/
H A Dkeygen-change.sh6 S1="secret1"
18 ${SSHKEYGEN} -q -N ${S1} -t $t -f $OBJ/$t-key
20 ${SSHKEYGEN} -p -P ${S1} -N ${S2} -f $OBJ/$t-key > /dev/null
/freebsd-11-stable/lib/msun/src/
H A Dk_sin.c31 * sin(x) ~ x + S1*x + ... + S6*x
35 * |----- - (1+S1*x +S2*x +S3*x +S4*x +S5*x +S6*x )| <= 2
44 * sin(x) = x + (S1*x + (x *(r-y/2)+y))
52 S1 = -1.66666666666666324348e-01, /* 0xBFC55555, 0x55555549 */ variable
68 if(iy==0) return x+v*(S1+z*r);
69 else return x-((z*(half*y-v*r)-y)-v*S1);
H A Dk_sinf.c27 S1 = -0x15555554cbac77.0p-55, /* -0.166666666416265235595 */ variable
45 return (x + s*(S1+z*S2)) + s*w*r;
H A Dk_sincosf.h19 S1 = -0x15555554cbac77.0p-55, /* -0.166666666416265235595 */ variable
40 *sn = (x + s * (S1 + z * S2)) + s * w * r;
H A Dk_sincos.h18 S1 = -1.66666666666666324348e-01, /* 0xBFC55555, 0x55555549 */ variable
44 *sn = x + v * (S1 + z * r);
46 *sn = x - ((z * (y / 2 - v * r) - y) - v * S1);
H A Dk_sincosl.h27 #define S1 ((long double)S1hi + S1lo) macro
32 S1 = -0.166666666666666666671L; /* -0xaaaaaaaaaaaaaaab.0p-66 */ variable
65 *sn = x + v * (S1 + z * r);
67 *sn = x - ((z * (y / 2 - v * r) - y) - v * S1);
86 S1 = -0.16666666666666666666666666666666666606732416116558L, variable
121 *sn = x + v * (S1 + z * r);
123 *cs = x - ((z * (y / 2 - v * r) - y) - v * S1);
/freebsd-11-stable/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-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DMergedLoadStoreMotion.cpp119 PHINode *getPHIOperand(BasicBlock *BB, StoreInst *S0, StoreInst *S1);
122 bool canSinkStoresAndGEPs(StoreInst *S0, StoreInst *S1) const;
208 /// Create a PHI node in BB for the operands of S0 and S1
211 StoreInst *S1) {
214 Value *Opd2 = S1->getValueOperand();
220 NewPN->applyMergedLocation(S0->getDebugLoc(), S1->getDebugLoc());
222 NewPN->addIncoming(Opd2, S1->getParent());
230 StoreInst *S1) const {
232 auto *A1 = dyn_cast<Instruction>(S1->getPointerOperand());
235 (A1->getParent() == S1
210 getPHIOperand(BasicBlock *BB, StoreInst *S0, StoreInst *S1) argument
243 sinkStoresAndGEPs(BasicBlock *BB, StoreInst *S0, StoreInst *S1) argument
[all...]
H A DInstSimplifyPass.cpp33 SmallPtrSet<const Instruction *, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
/freebsd-11-stable/lib/msun/ld128/
H A Dk_sinl.c33 S1 = -0.16666666666666666666666666666666666606732416116558L, variable
57 if(iy==0) return x+v*(S1+z*r);
58 else return x-((z*(half*y-v*r)-y)-v*S1);
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-pdbutil/
H A DPrettyTypeDumper.cpp37 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
52 double Pct1 = (double)S1->deepPaddingSize() / (double)S1
57 ComparePaddingImmediate(const LayoutPtr &S1, const LayoutPtr &S2) argument
61 ComparePaddingPctImmediate(const LayoutPtr &S1, const LayoutPtr &S2) argument
[all...]
/freebsd-11-stable/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-11-stable/crypto/heimdal/appl/ftp/ftp/
H A Dmain.c456 goto S1;
459 S1:
476 goto S1;
488 goto S1;
498 sb++; goto S1;
/freebsd-11-stable/sbin/iscontrol/
H A Dfsm.c629 S1, S2, /*S3,*/ S4, S5, S6, S7, S8 enumerator in enum:__anon4804
634 S1: FREE
643 +--------->/ S1 \<----+ |
689 state = S1;
702 case S1:
711 case T2: state = S1; break;
719 case T7: state = S1; break;
727 case T8: state = S1; break;
737 case T13: state = S1; break;
746 case T18: state = S1; brea
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsCCState.cpp32 auto Comp = [](const char *S1, const char *S2) { return strcmp(S1, S2) < 0; };
/freebsd-11-stable/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-11-stable/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...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/
H A DGSIStreamBuilder.cpp118 static bool gsiRecordLess(StringRef S1, StringRef S2) {
119 size_t LS = S1.size();
126 if (LLVM_UNLIKELY(!isAsciiString(S1) || !isAsciiString(S2)))
127 return memcmp(S1.data(), S2.data(), LS) < 0;
130 return S1.compare_lower(S2.data()) < 0;
/freebsd-11-stable/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_lex.l92 * S1 - D comments (i.e. skip everything until end of comment)
104 %s S0 S1 S2 S3 S4
468 BEGIN(S1);
597 <S1>"/*" yyerror("/* encountered inside a comment\n");
598 <S1>"*/" BEGIN(yypcb->pcb_cstate);
599 <S1>.|\n ; /* discard */
863 if ((YYSTATE) == S1)
/freebsd-11-stable/sys/dev/patm/
H A Didt77252reg.h107 #define IDT_MKCMD_RUTIL(S0, S1, A) \
108 (IDT_CMD_RUTIL | ((S1) << 9) | ((S0) << 8) | (A))
109 #define IDT_MKCMD_WUTIL(S0, S1, A) \
110 (IDT_CMD_WUTIL | ((S1) << 9) | ((S0) << 8) | (A))
/freebsd-11-stable/sys/mips/include/
H A Dregnum.h82 #define S1 17 macro
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DConstraintManager.h82 virtual bool haveEqualConstraints(ProgramStateRef S1,

Completed in 286 milliseconds

1234