Searched refs:S2 (Results 1 - 25 of 47) sorted by relevance

12

/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/
H A DSetOperations.h23 bool set_union(S1Ty &S1, const S2Ty &S2) { argument
26 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end();
37 /// elements that are not contained in S2.
40 void set_intersect(S1Ty &S1, const S2Ty &S2) { argument
44 if (!S2.count(E)) S1.erase(E); // Erase element if not in S2
51 S1Ty set_difference(const S1Ty &S1, const S2Ty &S2) { argument
55 if (!S2.count(*SI)) // if the element is not in set2
63 void set_subtract(S1Ty &S1, const S2Ty &S2) { argument
[all...]
H A DStringSwitch.h92 const char (&S2)[N2], const T& Value) {
93 return Case(S0, Value).Case(S1, Value).Case(S2, Value);
98 const char (&S2)[N2], const char (&S3)[N3],
100 return Case(S0, Value).Case(S1, Value).Case(S2, Value).Case(S3, Value);
105 const char (&S2)[N2], const char (&S3)[N3],
107 return Case(S0, Value).Case(S1, Value).Case(S2, Value).Case(S3, Value)
91 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const T& Value) argument
97 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const T& Value) argument
104 Cases(const char (&S0)[N0], const char (&S1)[N1], const char (&S2)[N2], const char (&S3)[N3], const char (&S4)[N4], const T& Value) argument
/freebsd-9.3-release/contrib/wpa/src/crypto/
H A Dsha1-tlsprf.c41 const u8 *S1, *S2; local
70 * PRF = P_MD5(S1, label + seed) XOR P_SHA-1(S2, label + seed)
75 S2 = secret + L_S1;
77 /* The last byte of S1 will be shared with S2 */
78 S2--;
83 hmac_sha1_vector(S2, L_S2, 2, &SHA1_addr[1], &SHA1_len[1], A_SHA1);
96 hmac_sha1_vector(S2, L_S2, 3, SHA1_addr, SHA1_len,
99 hmac_sha1(S2, L_S2, A_SHA1, SHA1_MAC_LEN, A_SHA1);
/freebsd-9.3-release/lib/msun/src/
H A Dk_sinf.c28 S2 = 0x111110896efbb2.0p-59, /* 0.0083333293858894631756 */ variable
45 return (x + s*(S1+z*S2)) + s*w*r;
H A Dk_sin.c35 * |----- - (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);
/freebsd-9.3-release/crypto/openssh/regress/
H A Dkeygen-change.sh7 S2="2secret"
15 ${SSHKEYGEN} -p -P ${S1} -N ${S2} -f $OBJ/$t-key > /dev/null
/freebsd-9.3-release/lib/msun/ld80/
H A Dk_sinl.c44 S2 = 0.0083333333333333332, /* 0x11111111111111.0p-59 */ variable
59 r = S2+z*(S3+z*(S4+z*(S5+z*(S6+z*(S7+z*S8)))));
/freebsd-9.3-release/lib/msun/ld128/
H A Dk_sinl.c34 S2 = 0.0083333333333333333333333333333331135404851288270047L, variable
55 r = S2+z*(S3+z*(S4+z*(S5+z*(S6+z*(S7+z*(S8+
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Utils/
H A DSimplifyInstructions.cpp51 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
H A DSimplifyLibCalls.cpp786 StringRef S1, S2;
788 bool HasS2 = getConstantStringInfo(CI->getArgOperand(1), S2);
792 if ((HasS1 && S1.empty()) || (HasS2 && S2.empty()))
797 size_t I = S1.find_first_of(S2);
805 if (TD && HasS2 && S2.size() == 1)
806 return EmitStrChr(CI->getArgOperand(0), S2[0], B, TD, TLI);
840 StringRef S1, S2;
842 bool HasS2 = getConstantStringInfo(CI->getArgOperand(1), S2);
846 if ((HasS1 && S1.empty()) || (HasS2 && S2.empty()))
851 size_t Pos = S1.find_first_not_of(S2);
[all...]
/freebsd-9.3-release/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_lex.l89 * S2 - D program outer scope (probe specifiers and declarations)
99 %s S0 S1 S2 S3 S4
177 <S2>auto { yybegin(YYS_EXPR); return (DT_KEY_AUTO); }
178 <S2>char { yybegin(YYS_EXPR); return (DT_KEY_CHAR); }
179 <S2>const { yybegin(YYS_EXPR); return (DT_KEY_CONST); }
180 <S2>counter { yybegin(YYS_DEFINE); return (DT_KEY_COUNTER); }
181 <S2>double { yybegin(YYS_EXPR); return (DT_KEY_DOUBLE); }
182 <S2>enum { yybegin(YYS_EXPR); return (DT_KEY_ENUM); }
183 <S2>extern { yybegin(YYS_EXPR); return (DT_KEY_EXTERN); }
184 <S2>floa
[all...]
/freebsd-9.3-release/contrib/llvm/lib/Target/Mips/
H A DMips16FrameLowering.cpp59 unsigned S2 = MRI->getDwarfRegNum(Mips::S2, true); local
60 MMI.addFrameInst(MCCFIInstruction::createOffset(CSLabel, S2, -8));
174 MF.getRegInfo().setPhysRegUsed(Mips::S2);
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp77 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
/freebsd-9.3-release/lib/libstand/mips/
H A D_setjmp.S67 sw s2, ((S2 + 3) * 4)(a0)
106 lw s2, ((S2 + 3) * 4)(a0)
/freebsd-9.3-release/sys/mips/include/
H A Dregnum.h86 #define S2 18 macro
/freebsd-9.3-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonPeephole.cpp270 unsigned PR = 1, S1 = 2, S2 = 3; // Operand indices. local
297 // Swap operands S1 and S2.
299 MachineOperand Op2 = MI->getOperand(S2);
301 ChangeOpInto(MI->getOperand(S2), Op1);
/freebsd-9.3-release/contrib/llvm/include/llvm/IR/
H A DInstrTypes.h142 BinaryOperator(BinaryOps iType, Value *S1, Value *S2, Type *Ty,
144 BinaryOperator(BinaryOps iType, Value *S1, Value *S2, Type *Ty,
161 static BinaryOperator *Create(BinaryOps Op, Value *S1, Value *S2,
169 static BinaryOperator *Create(BinaryOps Op, Value *S1, Value *S2,
698 Value *S2, const Twine &Name = "",
706 Value *S2, const Twine &Name, BasicBlock *InsertAtEnd);
H A DLegacyPassManagers.h342 enum PassDebuggingString S2, StringRef Msg);
/freebsd-9.3-release/contrib/llvm/utils/TableGen/
H A DSetTheory.cpp52 // (and S1, S2) Set intersection.
59 RecSet S1, S2; local
61 ST.evaluate(Expr->arg_begin()[1], S2, Loc);
63 if (S2.count(*I))
152 // (interleave S1, S2, ...) Interleave elements of the arguments.
/freebsd-9.3-release/crypto/heimdal/appl/ftp/ftp/
H A Dmain.c468 sb++; goto S2; /* slurp next character */
479 S2:
/freebsd-9.3-release/crypto/openssl/crypto/cast/asm/
H A Dcast-586.pl21 $S2="CAST_S_table1";
162 &mov( $tmp2, &DWP($S2,"",$tmp2,4));
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Instrumentation/
H A DMemorySanitizer.cpp1176 // S = (S1 & S2) | (V1 & S2) | (S1 & V2)
1178 Value *S2 = getShadow(&I, 1); local
1183 V2 = IRB.CreateIntCast(V2, S2->getType(), false);
1185 Value *S1S2 = IRB.CreateAnd(S1, S2);
1186 Value *V1S2 = IRB.CreateAnd(V1, S2);
1198 // S = (S1 & S2) | (~V1 & S2) | (S1 & ~V2)
1200 Value *S2 = getShadow(&I, 1); local
1205 V2 = IRB.CreateIntCast(V2, S2
1457 Value *S2 = IRB.CreateICmp(I.getPredicate(), local
1531 Value *S2 = getShadow(&I, 1); local
[all...]
/freebsd-9.3-release/sbin/iscontrol/
H A Dfsm.c626 S1, S2, /*S3,*/ S4, S5, S6, S7, S8 enumerator in enum:__anon5462
632 S2: XPT_WAIT
650 | | / S2 \ / |
701 case T1: state = S2; break;
706 case S2:
/freebsd-9.3-release/contrib/llvm/lib/IR/
H A DInstructions.cpp1732 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2, argument
1740 Op<1>() = S2;
1745 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2, argument
1753 Op<1>() = S2;
1834 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2, argument
1837 assert(S1->getType() == S2->getType() &&
1839 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1842 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2, argument
1845 BinaryOperator *Res = Create(Op, S1, S2, Name);
3036 Value *S1, Value *S2,
3035 Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2, const Twine &Name, Instruction *InsertBefore) argument
3056 Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2, const Twine &Name, BasicBlock *InsertAtEnd) argument
[all...]
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DProgramState.h536 bool haveEqualEnvironments(ProgramStateRef S1, ProgramStateRef S2) { argument
537 return S1->Env == S2->Env;
540 bool haveEqualStores(ProgramStateRef S1, ProgramStateRef S2) { argument
541 return S1->store == S2->store;

Completed in 224 milliseconds

12