Home
last modified time | relevance | path

Searched refs:N1 (Results 1 – 25 of 449) sorted by relevance

12345678910>>...18

/external/libcxx/test/std/numerics/numarray/template.valarray/valarray.members/
Dshift.pass.cpp25 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
26 std::valarray<T> v1(a1, N1); in main()
28 assert(v2.size() == N1); in main()
29 for (unsigned i = 0; i < N1; ++i) in main()
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
37 std::valarray<T> v1(a1, N1); in main()
39 assert(v2.size() == N1); in main()
40 for (unsigned i = 0; i < N1; ++i) in main()
47 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
48 std::valarray<T> v1(a1, N1); in main()
[all …]
Dcshift.pass.cpp25 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
26 std::valarray<T> v1(a1, N1); in main()
28 assert(v2.size() == N1); in main()
29 for (unsigned i = 0; i < N1; ++i) in main()
36 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
37 std::valarray<T> v1(a1, N1); in main()
39 assert(v2.size() == N1); in main()
40 for (unsigned i = 0; i < N1; ++i) in main()
47 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
48 std::valarray<T> v1(a1, N1); in main()
[all …]
Dapply_cref.pass.cpp28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
29 std::valarray<T> v1(a1, N1); in main()
31 assert(v2.size() == N1); in main()
32 for (unsigned i = 0; i < N1; ++i) in main()
36 const unsigned N1 = 0; in main() local
39 assert(v2.size() == N1); in main()
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
45 std::valarray<T> v1(a1, N1); in main()
47 assert(v2.size() == N1); in main()
48 for (unsigned i = 0; i < N1; ++i) in main()
Dapply_value.pass.cpp28 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
29 std::valarray<T> v1(a1, N1); in main()
31 assert(v2.size() == N1); in main()
32 for (unsigned i = 0; i < N1; ++i) in main()
36 const unsigned N1 = 0; in main() local
39 assert(v2.size() == N1); in main()
44 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
45 std::valarray<T> v1(a1, N1); in main()
47 assert(v2.size() == N1); in main()
48 for (unsigned i = 0; i < N1; ++i) in main()
Dsize.pass.cpp24 const unsigned N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 std::valarray<T> v1(a1, N1); in main()
26 assert(v1.size() == N1); in main()
31 const unsigned N1 = 0; in main() local
32 std::valarray<T> v1(a1, N1); in main()
33 assert(v1.size() == N1); in main()
37 const unsigned N1 = 0; in main() local
39 assert(v1.size() == N1); in main()
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
DStringSwitch.h105 template<unsigned N0, unsigned N1>
107 StringSwitch &Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
112 template<unsigned N0, unsigned N1, unsigned N2>
114 StringSwitch &Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
119 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
121 StringSwitch &Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
127 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
129 StringSwitch &Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
135 template <unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4,
138 StringSwitch &Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
[all …]
/external/eigen/test/
Ddiagonal.cpp33 N1 = MatrixType::RowsAtCompileTime>2 ? 2 : 0, in diagonal() enumerator
40 VERIFY(m1.template diagonal<N1>().RowsAtCompileTime == m1.diagonal(N1).size()); in diagonal()
44 m2.template diagonal<N1>() = 2 * m1.template diagonal<N1>(); in diagonal()
45 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1)); in diagonal()
46 m2.template diagonal<N1>()[0] *= 3; in diagonal()
47 …VERIFY_IS_APPROX(m2.template diagonal<N1>()[0], static_cast<Scalar>(6) * m1.template diagonal<N1>(… in diagonal()
54 m2.diagonal(N1) = 2 * m1.diagonal(N1); in diagonal()
55 VERIFY_IS_APPROX(m2.template diagonal<N1>(), static_cast<Scalar>(2) * m1.diagonal(N1)); in diagonal()
56 m2.diagonal(N1)[0] *= 3; in diagonal() local
57 VERIFY_IS_APPROX(m2.diagonal(N1)[0], static_cast<Scalar>(6) * m1.diagonal(N1)[0]); in diagonal()
Dcommainitializer.cpp13 template<int M1, int M2, int N1, int N2>
16 Matrix<int, M1+M2, N1+N2> m_fixed; in test_blocks()
17 MatrixXi m_dynamic(M1+M2, N1+N2); in test_blocks()
19 Matrix<int, M1, N1> mat11; mat11.setRandom(); in test_blocks()
21 Matrix<int, M2, N1> mat21; mat21.setRandom(); in test_blocks()
28 VERIFY_IS_EQUAL((m_fixed.template topLeftCorner<M1,N1>()), mat11); in test_blocks()
30 VERIFY_IS_EQUAL((m_fixed.template bottomLeftCorner<M2,N1>()), mat21); in test_blocks()
35 if(N1 > 0) in test_blocks()
/external/llvm/include/llvm/ADT/
DStringSwitch.h89 template<unsigned N0, unsigned N1>
91 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
95 (N1-1 == Str.size() && std::memcmp(S1, Str.data(), N1-1) == 0))) { in Cases()
102 template<unsigned N0, unsigned N1, unsigned N2>
104 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
108 (N1-1 == Str.size() && std::memcmp(S1, Str.data(), N1-1) == 0) || in Cases()
116 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
118 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
123 (N1-1 == Str.size() && std::memcmp(S1, Str.data(), N1-1) == 0) || in Cases()
132 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp286 SDValue visitADDLike(SDValue N0, SDValue N1, SDNode *LocReference);
290 SDValue visitUADDOLike(SDValue N0, SDValue N1, SDNode *N);
295 SDValue visitADDCARRYLike(SDValue N0, SDValue N1, SDValue CarryIn, SDNode *N);
301 SDValue visitSDIVLike(SDValue N0, SDValue N1, SDNode *N);
303 SDValue visitUDIVLike(SDValue N0, SDValue N1, SDNode *N);
313 SDValue visitANDLike(SDValue N0, SDValue N1, SDNode *N);
315 SDValue visitORLike(SDValue N0, SDValue N1, SDNode *N);
396 SDValue N1);
405 SDValue SimplifySelect(const SDLoc &DL, SDValue N0, SDValue N1, SDValue N2);
406 SDValue SimplifySelectCC(const SDLoc &DL, SDValue N0, SDValue N1,
[all …]
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp230 SDValue SimplifySelect(DebugLoc DL, SDValue N0, SDValue N1, SDValue N2);
231 SDValue SimplifySelectCC(DebugLoc DL, SDValue N0, SDValue N1, SDValue N2,
234 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond,
242 SDValue MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
244 SDValue MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1);
525 SDValue N0, N1, N2; in isOneUseSetCC() local
526 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) in isOneUseSetCC()
532 SDValue N0, SDValue N1) { in ReassociateOps() argument
535 if (isa<ConstantSDNode>(N1)) { in ReassociateOps()
540 cast<ConstantSDNode>(N1)); in ReassociateOps()
[all …]
/external/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp252 SDValue visitANDLike(SDValue N0, SDValue N1, SDNode *LocReference);
254 SDValue visitORLike(SDValue N0, SDValue N1, SDNode *LocReference);
339 SDValue SimplifySelect(const SDLoc &DL, SDValue N0, SDValue N1, SDValue N2);
340 SDValue SimplifySelectCC(const SDLoc &DL, SDValue N0, SDValue N1,
343 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond,
367 SDValue MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
369 SDValue MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1);
762 SDValue N0, N1, N2; in isOneUseSetCC() local
763 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) in isOneUseSetCC()
817 SDValue N1) { in ReassociateOps() argument
[all …]
/external/clang/test/SemaCXX/
Dnested-name-spec.cpp326 struct C2 { static const unsigned N1 = 1; }; member
331 const int N1 = 2; variable
345 int f(C1::C2), C2 : N1;
354 int f[C2::N1];
357 int f[C2:N1]; // expected-error{{unexpected ':' in nested name specifier; did you mean '::'?}}
361 int f(int xx[B1::B3 ? C2::N1 : B1::B2]);
364 …int f(int xx[B1::B3 ? C2::N1 : B1:B2]); // expected-error{{unexpected ':' in nested name specifie…
367 …int f(int xx[B1:B3 ? C2::N1 : B1::B2]); // expected-error{{unexpected ':' in nested name specifie…
378 int C2:N1;
392 static const unsigned N1 = N; member
[all …]
Dout-of-line-def-mismatch.cpp6 namespace N1 { namespace
20 void N2::N1::S2::func(S1*) {} // expected-error {{out-of-line definition of 'func' does not match a… in func()
21 void N2::N1::S2::func(C1&, unsigned, const S1*) {} // expected-error {{out-of-line definition of 'f… in func()
22 void N2::N1::S2::func(S1*, double) {} // expected-error {{out-of-line definition of 'func' does not… in func()
23 void N2::N1::S2::func(S1, unsigned) {} // expected-error {{out-of-line definition of 'func' does no… in func()
24 void N2::N1::S2::func(unsigned*, S1*) {} // expected-error {{out-of-line definition of 'func' does … in func()
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DStringSwitch.h84 template<unsigned N0, unsigned N1>
85 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
90 template<unsigned N0, unsigned N1, unsigned N2>
91 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
96 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
97 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
103 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
104 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/Transforms/Utils/
DValueMapperTest.cpp77 MDNode *N1; // !1 = !{!0, i8* @G0} in TEST() local
81 N1 = MDTuple::get(Context, Ops1); in TEST()
82 T0->replaceOperandWith(0, N1); in TEST()
88 ASSERT_FALSE(N1->isResolved()); in TEST()
91 ASSERT_TRUE(N1->isResolved()); in TEST()
98 MDNode *MappedN1 = ValueMapper(VM).mapMDNode(*N1); in TEST()
100 EXPECT_NE(N1, MappedN1); in TEST()
203 auto *N1 = MDTuple::get(C, N0); in TEST() local
209 EXPECT_EQ(N1, ValueMapper(VM).mapMetadata(*N1)); in TEST()
212 ASSERT_NE(None, VM.getMappedMD(N1)); in TEST()
[all …]
/external/llvm/unittests/Transforms/Utils/
DValueMapperTest.cpp77 MDNode *N1; // !1 = !{!0, i8* @G0} in TEST() local
81 N1 = MDTuple::get(Context, Ops1); in TEST()
82 T0->replaceOperandWith(0, N1); in TEST()
88 ASSERT_FALSE(N1->isResolved()); in TEST()
91 ASSERT_TRUE(N1->isResolved()); in TEST()
98 MDNode *MappedN1 = ValueMapper(VM).mapMDNode(*N1); in TEST()
100 EXPECT_NE(N1, MappedN1); in TEST()
203 auto *N1 = MDTuple::get(C, N0); in TEST() local
209 EXPECT_EQ(N1, ValueMapper(VM).mapMetadata(*N1)); in TEST()
212 ASSERT_NE(None, VM.getMappedMD(N1)); in TEST()
[all …]
/external/google-fruit/include/fruit/impl/meta/
Dnumeric_operations.h42 template <typename N1, typename... Ints>
43 struct apply<N1, Ints...> {
44 using type = Int<N1::value + apply<Ints...>::type::value>;
48 template <typename N0, typename N1, typename N2, typename N3, typename N4, typename... Ints>
49 struct apply<N0, N1, N2, N3, N4, Ints...> {
50 …using type = Int<N0::value + N1::value + N2::value + N3::value + N4::value + apply<Ints...>::type:…
/external/libcxx/test/std/numerics/numarray/template.mask.array/mask.array.comp.assign/
Dor.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Dshift_right.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Dmultiply.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Dmodulo.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Ddivide.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
Dsubtraction.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()
/external/libcxx/test/std/numerics/numarray/template.mask.array/mask.array.assign/
Dvalarray.pass.cpp22 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]); in main() local
25 bool b[N1] = {true, false, false, true, true, false, in main()
27 std::valarray<int> v1(a1, N1); in main()
29 assert(N2 == std::count(b, b+N1, true)); in main()
30 std::valarray<bool> vb(b, N1); in main()

12345678910>>...18