Home
last modified time | relevance | path

Searched refs:S1 (Results 1 – 25 of 292) sorted by relevance

12345678910>>...12

/third_party/skia/third_party/externals/tint/test/struct/
Dtype_constructor.wgsl.expected.glsl4 struct S1 {
12 S1 f;
16 S1 h;
26 S1 empty = S1(0, 0, 0, 0);
27 S1 nonempty = S1(1, 2, 3, 4);
28 S1 nonempty_with_expr = S1(1, x, (x + 1), nonempty.d);
29 S3 nested_empty = S3(0, S1(0, 0, 0, 0), S2(0, S1(0, 0, 0, 0)));
30 S1 tint_symbol_1 = S1(2, 3, 4, 5);
31 S1 tint_symbol_2 = S1(7, 8, 9, 10);
34 S1 tint_symbol_4 = S1(2, x, (x + 1), nested_nonempty.i.f.d);
[all …]
Dtype_constructor.wgsl.expected.wgsl1 struct S1 {
10 f : S1;
15 h : S1;
26 let empty : S1 = S1();
27 let nonempty : S1 = S1(1, 2, 3, 4);
28 let nonempty_with_expr : S1 = S1(1, x, (x + 1), nonempty.d);
30 let nested_nonempty : S3 = S3(1, S1(2, 3, 4, 5), S2(6, S1(7, 8, 9, 10)));
31 …let nested_nonempty_with_expr : S3 = S3(1, S1(2, x, (x + 1), nested_nonempty.i.f.d), S2(6, nonempt…
32 let subexpr_empty : i32 = S1().a;
33 let subexpr_nonempty : i32 = S1(1, 2, 3, 4).b;
[all …]
Dtype_constructor.wgsl1 struct S1 {
10 f : S1;
15 h : S1;
28 let empty : S1 = S1();
29 let nonempty : S1 = S1(1, 2, 3, 4);
30 let nonempty_with_expr : S1 = S1(1, x, x + 1, nonempty.d);
34 let nested_nonempty : S3 = S3(1, S1(2, 3, 4, 5), S2(6, S1(7, 8, 9, 10)));
36 S3(1, S1(2, x, x + 1, nested_nonempty.i.f.d), S2(6, nonempty));
39 let subexpr_empty : i32 = S1().a;
40 let subexpr_nonempty : i32 = S1(1, 2, 3, 4).b;
[all …]
Dtype_constructor.wgsl.expected.spvasm11 OpName %S1 "S1"
12 OpMemberName %S1 0 "a"
13 OpMemberName %S1 1 "b"
14 OpMemberName %S1 2 "c"
15 OpMemberName %S1 3 "d"
25 OpMemberDecorate %S1 0 Offset 0
26 OpMemberDecorate %S1 1 Offset 4
27 OpMemberDecorate %S1 2 Offset 8
28 OpMemberDecorate %S1 3 Offset 12
41 %S1 = OpTypeStruct %int %int %int %int
[all …]
Dtype_constructor.wgsl.expected.hlsl1 struct S1 {
9 S1 f;
13 S1 h;
23 const S1 empty = (S1)0;
24 const S1 nonempty = {1, 2, 3, 4};
25 const S1 nonempty_with_expr = {1, x, (x + 1), nonempty.d};
27 const S1 tint_symbol = {2, 3, 4, 5};
28 const S1 tint_symbol_1 = {7, 8, 9, 10};
31 const S1 tint_symbol_3 = {2, x, (x + 1), nested_nonempty.i.f.d};
34 const S1 tint_symbol_5 = (S1)0;
[all …]
Dtype_constructor.wgsl.expected.msl4 struct S1 {
12 S1 f;
16 S1 h;
31 S1 const empty = {};
32 S1 const nonempty = {.a=1, .b=2, .c=3, .d=4};
33 …S1 const nonempty_with_expr = {.a=1, .b=x, .c=as_type<int>((as_type<uint>(x) + as_type<uint>(1))),…
35 S1 const tint_symbol_1 = {.a=2, .b=3, .c=4, .d=5};
36 S1 const tint_symbol_2 = {.a=7, .b=8, .c=9, .d=10};
39 …S1 const tint_symbol_4 = {.a=2, .b=x, .c=as_type<int>((as_type<uint>(x) + as_type<uint>(1))), .d=n…
42 S1 const tint_symbol_6 = {};
[all …]
/third_party/boost/libs/smart_ptr/test/
Dlsp_convertible_test.cpp31 #define TEST_CV_TRUE_( S1, T, S2, U ) \ argument
32 BOOST_TEST(( is_convertible< S1<T>, S2<U> >::value == true )); \
33 BOOST_TEST(( is_convertible< S1<T>, S2<const U> >::value == true )); \
34 BOOST_TEST(( is_convertible< S1<T>, S2<volatile U> >::value == true )); \
35 BOOST_TEST(( is_convertible< S1<T>, S2<const volatile U> >::value == true )); \
36 BOOST_TEST(( is_convertible< S1<const T>, S2<U> >::value == false )); \
37 BOOST_TEST(( is_convertible< S1<const T>, S2<const U> >::value == true )); \
38 BOOST_TEST(( is_convertible< S1<const T>, S2<volatile U> >::value == false )); \
39 BOOST_TEST(( is_convertible< S1<const T>, S2<const volatile U> >::value == true )); \
40 BOOST_TEST(( is_convertible< S1<volatile T>, S2<U> >::value == false )); \
[all …]
Dsp_convertible_test2.cpp30 #define TEST_CV_TRUE_( S1, T, S2, U ) \ argument
31 BOOST_TEST(( is_convertible< S1<T>, S2<U> >::value == true )); \
32 BOOST_TEST(( is_convertible< S1<T>, S2<const U> >::value == true )); \
33 BOOST_TEST(( is_convertible< S1<T>, S2<volatile U> >::value == true )); \
34 BOOST_TEST(( is_convertible< S1<T>, S2<const volatile U> >::value == true )); \
35 BOOST_TEST(( is_convertible< S1<const T>, S2<U> >::value == false )); \
36 BOOST_TEST(( is_convertible< S1<const T>, S2<const U> >::value == true )); \
37 BOOST_TEST(( is_convertible< S1<const T>, S2<volatile U> >::value == false )); \
38 BOOST_TEST(( is_convertible< S1<const T>, S2<const volatile U> >::value == true )); \
39 BOOST_TEST(( is_convertible< S1<volatile T>, S2<U> >::value == false )); \
[all …]
Dlsp_convertible_test2.cpp31 #define TEST_CV_TRUE_( S1, T, S2, U ) \ argument
32 BOOST_TEST(( is_convertible< S1<T>, S2<U> >::value == true )); \
33 BOOST_TEST(( is_convertible< S1<T>, S2<const U> >::value == true )); \
34 BOOST_TEST(( is_convertible< S1<T>, S2<volatile U> >::value == true )); \
35 BOOST_TEST(( is_convertible< S1<T>, S2<const volatile U> >::value == true )); \
36 BOOST_TEST(( is_convertible< S1<const T>, S2<U> >::value == false )); \
37 BOOST_TEST(( is_convertible< S1<const T>, S2<const U> >::value == true )); \
38 BOOST_TEST(( is_convertible< S1<const T>, S2<volatile U> >::value == false )); \
39 BOOST_TEST(( is_convertible< S1<const T>, S2<const volatile U> >::value == true )); \
40 BOOST_TEST(( is_convertible< S1<volatile T>, S2<U> >::value == false )); \
[all …]
/third_party/boost/boost/numeric/odeint/stepper/detail/
Dgeneric_rk_call_algebra.hpp35 template< class S1 , class S2 , class S3 , class S4 , class Op>
36 …void operator()( algebra_type &algebra , S1 &s1 , S2 &s2 , S3 &s3 , S4 * /* s4_array */ , Op op )… in operator ()()
41 template< class S1 , class S2 , class S4 , class Op>
42 void operator()( algebra_type &algebra , S1 &s1 , S2 &s2 , S4 * /* s4_array */ , Op op ) const in operator ()()
51 template< class S1 , class S2 , class S3 , class S4 , class Op>
52 void operator()( Algebra &algebra , S1 &s1 , S2 &s2 , S3 &s3 , S4 s4_array[1] , Op op ) const in operator ()()
57 template< class S1 , class S2 , class S4 , class Op>
58 void operator()( Algebra &algebra , S1 &s1 , S2 &s2 , S4 s4_array[1] , Op op ) const in operator ()()
68 template< class S1 , class S2 , class S3 , class S4 , class Op>
69 void operator()( Algebra &algebra , S1 &s1 , S2 &s2 , S3 &s3 , S4 s4_array[2] , Op op ) const in operator ()()
[all …]
/third_party/boost/libs/test/test/test-organization-ts/datasets-test/
Ddatasets-test.hpp59 template<typename S1, typename S2>
60 void operator()( S1 const&, S2 const& ) const in operator ()()
62 BOOST_CHECK_MESSAGE( (boost::is_same<S1,T1>::value), "S1 type does not match expected" ); in operator ()()
71 template<typename S1, typename S2, typename S3>
72 void operator()( S1 const&, S2 const&, S3 const& ) const in operator ()()
74 BOOST_CHECK_MESSAGE( (boost::is_same<S1,T1>::value), "S1 type does not match expected" ); in operator ()()
95 template<typename S1, typename S2>
96 void operator()( S1 const&, S2 const& ) const in operator ()()
98 … BOOST_CHECK_MESSAGE( (boost::is_convertible<S1,T1>::value), "S1 type does not match expected" ); in operator ()()
107 template<typename S1, typename S2, typename S3>
[all …]
/third_party/pcre2/pcre2/src/sljit/
DsljitNativeSPARC_32.c30 return push_inst(compiler, OR | D(dst) | S1(0) | IMM(imm), DR(dst)); in load_immediate()
33 …return (imm & 0x3ff) ? push_inst(compiler, OR | D(dst) | S1(dst) | IMM_ARG | (imm & 0x3ff), DR(dst… in load_immediate()
50 return push_inst(compiler, OR | D(dst) | S1(0) | S2(src2), DR(dst)); in emit_single_op()
58 return push_inst(compiler, AND | D(dst) | S1(src2) | IMM(0xff), DR(dst)); in emit_single_op()
59 FAIL_IF(push_inst(compiler, SLL | D(dst) | S1(src2) | IMM(24), DR(dst))); in emit_single_op()
60 return push_inst(compiler, SRA | D(dst) | S1(dst) | IMM(24), DR(dst)); in emit_single_op()
70 FAIL_IF(push_inst(compiler, SLL | D(dst) | S1(src2) | IMM(16), DR(dst))); in emit_single_op()
71 …return push_inst(compiler, (op == SLJIT_MOV_S16 ? SRA : SRL) | D(dst) | S1(dst) | IMM(16), DR(dst)… in emit_single_op()
79 …return push_inst(compiler, XNOR | (flags & SET_FLAGS) | D(dst) | S1(0) | S2(src2), DR(dst) | (flag… in emit_single_op()
83 FAIL_IF(push_inst(compiler, SUB | SET_FLAGS | D(0) | S1(src2) | S2(0), SET_FLAGS)); in emit_single_op()
[all …]
/third_party/boost/libs/statechart/test/
DTransitionTest.cpp266 template< class M > struct S1;
269 struct S0 : Orthogonal0< S0< M >, M, S1< M > >
271 typedef Orthogonal0< S0< M >, M, S1< M > > my_base;
300 sc::transition< C, S1< M >, S0< M >, &S0< M >::Transit >,
337 struct S1 : Orthogonal1< S1< M >, S0< M >, S11< M > > struct
339 typedef Orthogonal1< S1< M >, S0< M >, S11< M > > my_base; argument
341 sc::transition< A, S1< M >, S0< M >, &S0< M >::Transit >,
348 S1( typename my_base::my_context ctx ) : my_base( ctx ) {} in S1() function
353 S11< M >, typename S1< M >::template orthogonal< 1 > >
356 S11< M >, typename S1< M >::template orthogonal< 1 > > my_base;
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DStringSwitch.h88 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, T Value) { in Cases() argument
89 return Case(S0, Value).Case(S1, Value); in Cases()
92 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
94 return Case(S0, Value).Cases(S1, S2, Value); in Cases()
97 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
99 return Case(S0, Value).Cases(S1, S2, S3, Value); in Cases()
102 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
104 return Case(S0, Value).Cases(S1, S2, S3, S4, Value); in Cases()
107 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
110 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, Value); in Cases()
[all …]
DSetOperations.h22 bool set_union(S1Ty &S1, const S2Ty &S2) { in set_union() argument
27 if (S1.insert(*SI).second) in set_union()
39 void set_intersect(S1Ty &S1, const S2Ty &S2) { in set_intersect() argument
40 for (typename S1Ty::iterator I = S1.begin(); I != S1.end();) { in set_intersect()
43 if (!S2.count(E)) S1.erase(E); // Erase element if not in S2 in set_intersect()
50 S1Ty set_difference(const S1Ty &S1, const S2Ty &S2) { in set_difference() argument
52 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end(); in set_difference()
62 void set_subtract(S1Ty &S1, const S2Ty &S2) { in set_subtract() argument
65 S1.erase(*SI); in set_subtract()
/third_party/boost/boost/numeric/odeint/algebra/
Dfusion_algebra.hpp62 template< class S1 , class Op >
63 static void for_each1( S1 &s1 , Op op ) in for_each1()
69 template< class S1 , class S2 , class Op >
70 static void for_each2( S1 &s1 , S2 &s2 , Op op ) in for_each2()
72 typedef boost::fusion::vector< S1& , S2& > Sequences; in for_each2()
78 template< class S1 , class S2 , class S3 , class Op >
79 static void for_each3( S1 &s1 , S2 &s2 , S3 &s3 , Op op ) in for_each3()
81 typedef boost::fusion::vector< S1& , S2& , S3& > Sequences; in for_each3()
86 template< class S1 , class S2 , class S3 , class S4 , class Op >
87 static void for_each4( S1 &s1 , S2 &s2 , S3 &s3 , S4 &s4 , Op op ) in for_each4()
[all …]
Dvector_space_algebra.hpp73 template< class S1 , class Op >
74 static void for_each1( S1 &s1 , Op op ) in for_each1()
80 template< class S1 , class S2 , class Op >
81 static void for_each2( S1 &s1 , S2 &s2 , Op op ) in for_each2()
86 template< class S1 , class S2 , class S3 , class Op >
87 static void for_each3( S1 &s1 , S2 &s2 , S3 &s3 , Op op ) in for_each3()
92 template< class S1 , class S2 , class S3 , class S4 , class Op >
93 static void for_each4( S1 &s1 , S2 &s2 , S3 &s3 , S4 &s4 , Op op ) in for_each4()
98 template< class S1 , class S2 , class S3 , class S4 , class S5 , class Op >
99 static void for_each5( S1 &s1 , S2 &s2 , S3 &s3 , S4 &s4 , S5 &s5 , Op op ) in for_each5()
[all …]
Dmulti_array_algebra.hpp37 template< class S1 , class Op >
38 static void for_each1( S1 &s1 , Op op ) in for_each1()
43 template< class S1 , class S2 , class Op >
44 static void for_each2( S1 &s1 , S2 &s2 , Op op ) in for_each2()
49 template< class S1 , class S2 , class S3 , class Op >
50 static void for_each3( S1 &s1 , S2 &s2 , S3 &s3 , Op op ) in for_each3()
55 template< class S1 , class S2 , class S3 , class S4 , class Op >
56 static void for_each4( S1 &s1 , S2 &s2 , S3 &s3 , S4 &s4 , Op op ) in for_each4()
61 template< class S1 , class S2 , class S3 , class S4 , class S5 , class Op >
62 static void for_each5( S1 &s1 , S2 &s2 , S3 &s3 , S4 &s4 , S5 &s5 , Op op ) in for_each5()
[all …]
Drange_algebra.hpp36 template< class S1 , class Op >
37 static void for_each1( S1 &s1 , Op op ) in for_each1()
43 template< class S1 , class S2 , class Op >
44 static void for_each2( S1 &s1 , S2 &s2 , Op op ) in for_each2()
50 template< class S1 , class S2 , class S3 , class Op >
51 static void for_each3( S1 &s1 , S2 &s2 , S3 &s3 , Op op ) in for_each3()
56 template< class S1 , class S2 , class S3 , class S4 , class Op >
57 static void for_each4( S1 &s1 , S2 &s2 , S3 &s3 , S4 &s4 , Op op ) in for_each4()
62 template< class S1 , class S2 , class S3 , class S4 , class S5 , class Op >
63 static void for_each5( S1 &s1 , S2 &s2 , S3 &s3 , S4 &s4 , S5 &s5 , Op op ) in for_each5()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
DStringSwitch.h107 StringSwitch &Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases()
109 return Case(S0, Value).Case(S1, Value); in Cases()
114 StringSwitch &Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases()
116 return Case(S0, Value).Cases(S1, S2, Value); in Cases()
121 StringSwitch &Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases()
124 return Case(S0, Value).Cases(S1, S2, S3, Value); in Cases()
129 StringSwitch &Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases()
132 return Case(S0, Value).Cases(S1, S2, S3, S4, Value); in Cases()
138 StringSwitch &Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases()
142 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, Value); in Cases()
[all …]
/third_party/boost/libs/hana/include/boost/hana/
Dis_subset.hpp30 using S1 = typename hana::tag_of<Xs>::type; in operator ()() typedef
33 decltype(is_subset_impl<S1, S2>{}), in operator ()()
34 hana::Searchable<S1>::value && in operator ()()
36 !is_default<is_subset_impl<S1, S2>>::value in operator ()()
40 static_assert(hana::Searchable<S1>::value, in operator ()()
46 static_assert(!is_default<is_subset_impl<S1, S2>>::value, in operator ()()
55 template <typename S1, typename S2, bool condition>
56 struct is_subset_impl<S1, S2, when<condition>> : default_ {
71 template <typename S1, typename S2>
72 struct is_subset_impl<S1, S2, when<
[all …]
/third_party/boost/boost/hana/
Dis_subset.hpp30 using S1 = typename hana::tag_of<Xs>::type; in operator ()() typedef
33 decltype(is_subset_impl<S1, S2>{}), in operator ()()
34 hana::Searchable<S1>::value && in operator ()()
36 !is_default<is_subset_impl<S1, S2>>::value in operator ()()
40 static_assert(hana::Searchable<S1>::value, in operator ()()
46 static_assert(!is_default<is_subset_impl<S1, S2>>::value, in operator ()()
55 template <typename S1, typename S2, bool condition>
56 struct is_subset_impl<S1, S2, when<condition>> : default_ {
71 template <typename S1, typename S2>
72 struct is_subset_impl<S1, S2, when<
[all …]
/third_party/openssl/crypto/sha/asm/
Dsha256-c64xplus.pl37 ($E,$Ectx,$F,$Fctx,$G,$Gctx,$H,$Hctx,$T1,$S1,$s0,$t0e,$t1e,$t2e,$X1,$X15)
128 || ROTL $E,26,$S1
142 || XOR $t0e,$S1,$S1
144 || XOR $t1e,$S1,$S1 ; Sigma1(e)
147 ADD $S1,$T1,$T1 ; T1 += Sigma1(e)
165 || ROTL $E,26,$S1
181 || XOR $t0e,$S1,$S1
183 || XOR $t1e,$S1,$S1 ; Sigma1(e)
186 ADD $S1,$T1,$T1 ; T1 += Sigma1(e)
219 || ROTL $E,26,$S1
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
DMergedLoadStoreMotion.cpp119 PHINode *getPHIOperand(BasicBlock *BB, StoreInst *S0, StoreInst *S1);
122 bool canSinkStoresAndGEPs(StoreInst *S0, StoreInst *S1) const;
211 StoreInst *S1) { in getPHIOperand() argument
214 Value *Opd2 = S1->getValueOperand(); in getPHIOperand()
220 NewPN->applyMergedLocation(S0->getDebugLoc(), S1->getDebugLoc()); in getPHIOperand()
222 NewPN->addIncoming(Opd2, S1->getParent()); in getPHIOperand()
230 StoreInst *S1) const { in canSinkStoresAndGEPs()
232 auto *A1 = dyn_cast<Instruction>(S1->getPointerOperand()); in canSinkStoresAndGEPs()
235 (A1->getParent() == S1->getParent()) && isa<GetElementPtrInst>(A0); in canSinkStoresAndGEPs()
244 StoreInst *S1) { in sinkStoresAndGEPs() argument
[all …]
/third_party/boost/boost/tuple/
Dtuple_comparison.hpp110 template<class T1, class T2, class S1, class S2>
111 inline bool operator==(const cons<T1, T2>& lhs, const cons<S1, S2>& rhs) in operator ==() argument
121 template<class T1, class T2, class S1, class S2>
122 inline bool operator!=(const cons<T1, T2>& lhs, const cons<S1, S2>& rhs) in operator !=() argument
132 template<class T1, class T2, class S1, class S2>
133 inline bool operator<(const cons<T1, T2>& lhs, const cons<S1, S2>& rhs) in operator <() argument
142 template<class T1, class T2, class S1, class S2>
143 inline bool operator>(const cons<T1, T2>& lhs, const cons<S1, S2>& rhs) in operator >() argument
152 template<class T1, class T2, class S1, class S2>
153 inline bool operator<=(const cons<T1, T2>& lhs, const cons<S1, S2>& rhs) in operator <=() argument
[all …]

12345678910>>...12