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

12

/macosx-10.10/llvmCore-3425.0.34/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
/macosx-10.10/llvmCore-3425.0.34/unittests/ADT/
H A DImmutableSetTest.cpp55 ImmutableSet<int> S2 = f.add(S, 3); local
57 EXPECT_FALSE(S2.isEmpty());
58 EXPECT_FALSE(S == S2);
59 EXPECT_TRUE(S != S2);
61 EXPECT_TRUE(S2.contains(3));
62 EXPECT_FALSE(S2.begin() == S2.end());
63 EXPECT_TRUE(S2.begin() != S2.end());
73 EXPECT_FALSE(S2
83 ImmutableSet<int> S2 = f.add(f.add(f.add(S, 3), 4), 5); local
121 ImmutableSet<int> S2 = f.add(f.add(S, 4), 5); local
144 ImmutableSet<char> S2 = f.add(f.add(f.add(S, 'a'), 'e'), 'i'); local
156 ImmutableSet<char> S2 = f.add(f.add(f.add(S, 'b'), 'c'), 'd'); local
179 ImmutableSet<long> S2 = f.add(f.add(f.add(S, 0), 1), 2); local
[all...]
H A DIntrusiveRefCntPtrTest.cpp33 SimpleRefCounted *S2 = new SimpleRefCounted(*S1); local
34 IntrusiveRefCntPtr<SimpleRefCounted> R2 = S2;
/macosx-10.10/OpenSSH-189/openssh/regress/
H A Dkeygen-change.sh7 S2="2secret"
15 ${SSHKEYGEN} -p -P ${S1} -N ${S2} -f $OBJ/$t-key > /dev/null
/macosx-10.10/dtrace-147/libdtrace/
H A Ddt_lex.l70 * S2 - D program outer scope (probe specifiers and declarations)
80 %s S0 S1 S2 S3 S4
160 <S2>auto { yybegin(YYS_EXPR); return (DT_KEY_AUTO); }
161 <S2>char { yybegin(YYS_EXPR); return (DT_KEY_CHAR); }
162 <S2>const { yybegin(YYS_EXPR); return (DT_KEY_CONST); }
163 <S2>counter { yybegin(YYS_DEFINE); return (DT_KEY_COUNTER); }
164 <S2>double { yybegin(YYS_EXPR); return (DT_KEY_DOUBLE); }
165 <S2>enum { yybegin(YYS_EXPR); return (DT_KEY_ENUM); }
166 <S2>extern { yybegin(YYS_EXPR); return (DT_KEY_EXTERN); }
167 <S2>floa
[all...]
/macosx-10.10/Heimdal-398.1.2/lib/hcrypto/
H A Dgen-des.pl94 my @S2 = (
138 my @SBox = ( \@S1, \@S2, \@S3, \@S4, \@S5, \@S6, \@S7, \@S8 );
/macosx-10.10/bash-94.1.2/bash-3.2/lib/glob/
H A Dsmatch.c221 #define STRCOLL(S1, S2) strcoll((S1), (S2))
223 #define STRCMP(S1, S2) strcmp((S1), (S2))
347 #define STRCOLL(S1, S2) wcscoll((S1), (S2))
349 #define STRCMP(S1, S2) wcscmp((S1), (S2))
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Utils/
H A DSimplifyInstructions.cpp51 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
/macosx-10.10/llvmCore-3425.0.34/unittests/Support/
H A DAlignOfTest.cpp46 struct S2 { char a; }; struct in namespace:__anon10824
53 struct D3 : S2 {};
54 struct D4 : S2 { int x; };
56 struct D6 : S2, S3 {};
90 [AlignOf<S2>::Alignment > 0]
132 EXPECT_LE(alignOf<S1>(), alignOf<S2>());
210 EXPECT_EQ(alignOf<S2>(), alignOf<AlignedCharArrayUnion<S2> >());
265 EXPECT_EQ(sizeof(S2), sizeof(AlignedCharArrayUnion<S2>));
[all...]
/macosx-10.10/gnutar-453/gnutar/lib/
H A Dfnmatch.c172 # define STRCOLL(S1, S2) strcoll (S1, S2)
200 # define STRCOLL(S1, S2) wcscoll (S1, S2)
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp76 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
H A DSimplifyLibCalls.cpp598 StringRef S1, S2;
600 bool HasS2 = getConstantStringInfo(CI->getArgOperand(1), S2);
604 if ((HasS1 && S1.empty()) || (HasS2 && S2.empty()))
609 size_t I = S1.find_first_of(S2);
617 if (TD && HasS2 && S2.size() == 1)
618 return EmitStrChr(CI->getArgOperand(0), S2[0], B, TD, TLI);
658 StringRef S1, S2;
660 bool HasS2 = getConstantStringInfo(CI->getArgOperand(1), S2);
664 if ((HasS1 && S1.empty()) || (HasS2 && S2.empty()))
669 size_t Pos = S1.find_first_not_of(S2);
[all...]
/macosx-10.10/llvmCore-3425.0.34/lib/Target/ARM/
H A DARMConstantPoolValue.cpp221 static bool CPV_streq(const char *S1, const char *S2) { argument
222 if (S1 == S2)
224 if (S1 && S2 && strcmp(S1, S2) == 0)
/macosx-10.10/llvmCore-3425.0.34/lib/Target/Hexagon/
H A DHexagonPeephole.cpp247 unsigned PR = 1, S1 = 2, S2 = 3; // Operand indices. local
274 // Swap operands S1 and S2.
276 MachineOperand Op2 = MI->getOperand(S2);
278 ChangeOpInto(MI->getOperand(S2), Op1);
/macosx-10.10/llvmCore-3425.0.34/include/llvm/
H A DInstrTypes.h144 BinaryOperator(BinaryOps iType, Value *S1, Value *S2, Type *Ty,
146 BinaryOperator(BinaryOps iType, Value *S1, Value *S2, Type *Ty,
163 static BinaryOperator *Create(BinaryOps Op, Value *S1, Value *S2,
171 static BinaryOperator *Create(BinaryOps Op, Value *S1, Value *S2,
694 Value *S2, const Twine &Name = "",
702 Value *S2, const Twine &Name, BasicBlock *InsertAtEnd);
H A DPassManagers.h342 enum PassDebuggingString S2, StringRef Msg);
/macosx-10.10/llvmCore-3425.0.34/unittests/Analysis/
H A DScalarEvolutionTest.cpp58 const SCEV *S2 = SE.getSCEV(V2); local
62 const SCEV *P2 = SE.getAddExpr(S2, S2);
/macosx-10.10/llvmCore-3425.0.34/utils/TableGen/
H A DSetTheory.cpp50 // (and S1, S2) Set intersection.
55 RecSet S1, S2; local
57 ST.evaluate(Expr->arg_begin()[1], S2);
59 if (S2.count(*I))
142 // (interleave S1, S2, ...) Interleave elements of the arguments.
/macosx-10.10/BerkeleyDB-21/db/test/
H A Dsdb019.tcl70 foreach s2 { S2 "" } {
/macosx-10.10/Heimdal-398.1.2/appl/ftp/ftp/
H A Dmain.c468 sb++; goto S2; /* slurp next character */
479 S2:
/macosx-10.10/OpenSSL098-52/src/crypto/cast/asm/
H A Dcast-586.pl21 $S2="CAST_S_table1";
162 &mov( $tmp2, &DWP($S2,"",$tmp2,4));
/macosx-10.10/llvmCore-3425.0.34/unittests/VMCore/
H A DInstructionsTest.cpp177 Value *S2 = BTC2->stripPointerCasts(); local
182 EXPECT_NE(S2, Gep2);
/macosx-10.10/vim-55/src/
H A Dos_vms.c68 #define EQN(S1,S2,LN) (strncmp(S1,S2,LN) == 0)
/macosx-10.10/llvmCore-3425.0.34/lib/VMCore/
H A DInstructions.cpp1725 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2, argument
1733 Op<1>() = S2;
1738 BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2, argument
1746 Op<1>() = S2;
1827 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2, argument
1830 assert(S1->getType() == S2->getType() &&
1832 return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
1835 BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2, argument
1838 BinaryOperator *Res = Create(Op, S1, S2, Name);
2869 Value *S1, Value *S2,
2868 Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2, const Twine &Name, Instruction *InsertBefore) argument
2889 Create(OtherOps Op, unsigned short predicate, Value *S1, Value *S2, const Twine &Name, BasicBlock *InsertAtEnd) argument
[all...]

Completed in 316 milliseconds

12