Home
last modified time | relevance | path

Searched refs:rhs2 (Results 1 – 25 of 1252) sorted by relevance

12345678910>>...51

/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/moab/
H A DHomXform.hpp357 homCoord[0]*rhs2.xForm[0] + homCoord[1]*rhs2.xForm[4] + in operator *()
358 homCoord[2]*rhs2.xForm[8] + homCoord[3]*rhs2.xForm[12], in operator *()
362 homCoord[0]*rhs2.xForm[1] + homCoord[1]*rhs2.xForm[5] + in operator *()
363 homCoord[2]*rhs2.xForm[9] + homCoord[3]*rhs2.xForm[13], in operator *()
367 homCoord[0]*rhs2.xForm[2] + homCoord[1]*rhs2.xForm[6] + in operator *()
368 homCoord[2]*rhs2.xForm[10] + homCoord[3]*rhs2.xForm[14], in operator *()
372 homCoord[0]*rhs2.xForm[3] + homCoord[1]*rhs2.xForm[7] + in operator *()
373 homCoord[2]*rhs2.xForm[11] + homCoord[3]*rhs2.xForm[15] in operator *()
383 homCoord[2]*rhs2.xForm[8] + homCoord[3]*rhs2.xForm[12], in operator *=()
388 homCoord[2]*rhs2.xForm[9] + homCoord[3]*rhs2.xForm[13], in operator *=()
[all …]
/dports/devel/libe/e-releases-0.11.0/e/
H A Dtuple_compare.h55 const T1& rhs1, const T2& rhs2) in tuple_compare() argument
61 return tuple_compare(lhs2, rhs2); in tuple_compare()
72 const T1& rhs1, const T2& rhs2, const T3& rhs3) in tuple_compare() argument
74 int prefix = tuple_compare(lhs1, lhs2, rhs1, rhs2); in tuple_compare()
89 const T1& rhs1, const T2& rhs2, const T3& rhs3, const T4& rhs4) in tuple_compare() argument
91 int prefix = tuple_compare(lhs1, lhs2, lhs3, rhs1, rhs2, rhs3); in tuple_compare()
106 const T1& rhs1, const T2& rhs2, const T3& rhs3, const T4& rhs4, const T5& rhs5) in tuple_compare() argument
108 int prefix = tuple_compare(lhs1, lhs2, lhs3, lhs4, rhs1, rhs2, rhs3, rhs4); in tuple_compare()
123 … const T1& rhs1, const T2& rhs2, const T3& rhs3, const T4& rhs4, const T5& rhs5, const T6& rhs6) in tuple_compare() argument
126 rhs1, rhs2, rhs3, rhs4, rhs5); in tuple_compare()
/dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/test/
H A Dproduct_symm.cpp30 Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows); in symm() local
49 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
50 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
53 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), in symm()
54 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
57 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
58 rhs13 = (s1*m1.adjoint()) * (s2*rhs2.adjoint())); in symm()
75 VERIFY_IS_APPROX(rhs22 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); in symm()
76 …VERIFY_IS_APPROX(rhs22 = (s2*rhs2) * (s1*m2).template selfadjointView<Lower>(), rhs23 = (s2*rhs2) … in symm()
H A Dproduct_syrk.cpp30 …Rhs2 rhs2 = Rhs2::Random(rows, internal::random<int>(1,320)); Rhs2 rhs22 = Rhs2::Random(rows, rhs2… in syrk() local
38 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
39 … ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
41 …VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpr… in syrk()
42 … ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), in syrk()
47 … (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
49 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpres… in syrk()
50 … (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
/dports/math/eigen3/eigen-3.3.9/test/
H A Dproduct_symm.cpp29 Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows); in symm() local
66 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
67 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
70 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), in symm()
71 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
74 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
75 rhs13 = (s1*m1.adjoint()) * (s2*rhs2.adjoint())); in symm()
92 VERIFY_IS_APPROX(rhs22 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); in symm()
93 …VERIFY_IS_APPROX(rhs22 = (s2*rhs2) * (s1*m2).template selfadjointView<Lower>(), rhs23 = (s2*rhs2) … in symm()
107 VERIFY_IS_APPROX(map2 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); in symm()
H A Dproduct_syrk.cpp29 …Rhs2 rhs2 = Rhs2::Random(rows, internal::random<int>(1,320)); Rhs2 rhs22 = Rhs2::Random(rows, rhs2… in syrk() local
37 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
38 … ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
40 …VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpr… in syrk()
41 … ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
45 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), in syrk()
46 … (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
48 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpres… in syrk()
49 … (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
126 VERIFY_IS_APPROX((map1.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
[all …]
/dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/test/
H A Dproduct_symm.cpp29 Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows); in symm() local
66 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
67 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
70 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), in symm()
71 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
74 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
75 rhs13 = (s1*m1.adjoint()) * (s2*rhs2.adjoint())); in symm()
92 VERIFY_IS_APPROX(rhs22 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); in symm()
93 …VERIFY_IS_APPROX(rhs22 = (s2*rhs2) * (s1*m2).template selfadjointView<Lower>(), rhs23 = (s2*rhs2) … in symm()
107 VERIFY_IS_APPROX(map2 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); in symm()
H A Dproduct_syrk.cpp29 …Rhs2 rhs2 = Rhs2::Random(rows, internal::random<int>(1,320)); Rhs2 rhs22 = Rhs2::Random(rows, rhs2… in syrk() local
37 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
38 … ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
40 …VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpr… in syrk()
41 … ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
45 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), in syrk()
46 … (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
48 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpres… in syrk()
49 … (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
126 VERIFY_IS_APPROX((map1.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
[all …]
/dports/misc/opennn/opennn-5.0.5/eigen/test/
H A Dproduct_symm.cpp29 Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows); in symm() local
66 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
67 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
70 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), in symm()
71 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
74 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
75 rhs13 = (s1*m1.adjoint()) * (s2*rhs2.adjoint())); in symm()
92 VERIFY_IS_APPROX(rhs22 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); in symm()
93 …VERIFY_IS_APPROX(rhs22 = (s2*rhs2) * (s1*m2).template selfadjointView<Lower>(), rhs23 = (s2*rhs2) … in symm()
107 VERIFY_IS_APPROX(map2 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); in symm()
H A Dproduct_syrk.cpp29 …Rhs2 rhs2 = Rhs2::Random(rows, internal::random<int>(1,320)); Rhs2 rhs22 = Rhs2::Random(rows, rhs2… in syrk() local
37 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
38 … ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
40 …VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpr… in syrk()
41 … ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
45 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), in syrk()
46 … (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
48 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpres… in syrk()
49 … (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
126 VERIFY_IS_APPROX((map1.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
[all …]
/dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/test/
H A Dproduct_symm.cpp29 Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows); in symm() local
66 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
67 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
70 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), in symm()
71 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
74 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
75 rhs13 = (s1*m1.adjoint()) * (s2*rhs2.adjoint())); in symm()
92 VERIFY_IS_APPROX(rhs22 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); in symm()
93 …VERIFY_IS_APPROX(rhs22 = (s2*rhs2) * (s1*m2).template selfadjointView<Lower>(), rhs23 = (s2*rhs2) … in symm()
H A Dproduct_syrk.cpp29 …Rhs2 rhs2 = Rhs2::Random(rows, internal::random<int>(1,320)); Rhs2 rhs22 = Rhs2::Random(rows, rhs2… in syrk() local
37 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
38 … ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
40 …VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpr… in syrk()
41 … ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
45 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), in syrk()
46 … (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
48 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpres… in syrk()
49 … (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/eigen-3.3.7/test/
H A Dproduct_symm.cpp29 Rhs2 rhs2 = Rhs2::Random(othersize, rows), rhs22(othersize, rows), rhs23(othersize, rows); in symm() local
66 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
67 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
70 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()), in symm()
71 rhs13 = (s1*m1) * (s2*rhs2.adjoint())); in symm()
74 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
75 rhs13 = (s1*m1.adjoint()) * (s2*rhs2.adjoint())); in symm()
92 VERIFY_IS_APPROX(rhs22 = (rhs2) * (m2).template selfadjointView<Lower>(), rhs23 = (rhs2) * (m1)); in symm()
93 …VERIFY_IS_APPROX(rhs22 = (s2*rhs2) * (s1*m2).template selfadjointView<Lower>(), rhs23 = (s2*rhs2) … in symm()
H A Dproduct_syrk.cpp29 …Rhs2 rhs2 = Rhs2::Random(rows, internal::random<int>(1,320)); Rhs2 rhs22 = Rhs2::Random(rows, rhs2… in syrk() local
37 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
38 … ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
40 …VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpr… in syrk()
41 … ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
45 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), in syrk()
46 … (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
48 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpres… in syrk()
49 … (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
/dports/lang/ruby26/ruby-2.6.9/test/ruby/
H A Dsentence.rb504 expand_emptyable_syms(rest, emptyable_syms) {|rhs2|
505 yield [first] + rhs2
506 yield rhs2
510 yield [first] + rhs2
536 expand_emptyable_syms(rhs, emptyable_syms) {|rhs2|
537 next if rhs2.empty?
538 rules2 << rhs2
594 rhs2 = []
597 rhs2.concat syntax[e][0]
599 rhs2 << e
[all …]
/dports/www/firefox-esr/firefox-91.8.0/mfbt/tests/
H A DTestTuple.cpp242 Tuple<ConvertibleToInt, double, unsigned char> rhs2(ConvertibleToInt(), 0.7f, in TestTieMozPair() local
244 Tie(i, f, c) = rhs2; in TestTieMozPair()
245 CHECK(i == Get<0>(rhs2)); in TestTieMozPair()
246 CHECK(f == Get<1>(rhs2)); in TestTieMozPair()
247 CHECK(c == Get<2>(rhs2)); in TestTieMozPair()
268 Tuple<ConvertibleToInt, double, unsigned char> rhs2(ConvertibleToInt(), 0.7f, in TestTie() local
270 Tie(i, f, c) = rhs2; in TestTie()
271 CHECK(i == Get<0>(rhs2)); in TestTie()
272 CHECK(f == Get<1>(rhs2)); in TestTie()
273 CHECK(c == Get<2>(rhs2)); in TestTie()
/dports/www/firefox/firefox-99.0/mfbt/tests/
H A DTestTuple.cpp242 Tuple<ConvertibleToInt, double, unsigned char> rhs2(ConvertibleToInt(), 0.7f, in TestTieMozPair() local
244 Tie(i, f, c) = rhs2; in TestTieMozPair()
245 CHECK(i == Get<0>(rhs2)); in TestTieMozPair()
246 CHECK(f == Get<1>(rhs2)); in TestTieMozPair()
247 CHECK(c == Get<2>(rhs2)); in TestTieMozPair()
268 Tuple<ConvertibleToInt, double, unsigned char> rhs2(ConvertibleToInt(), 0.7f, in TestTie() local
270 Tie(i, f, c) = rhs2; in TestTie()
271 CHECK(i == Get<0>(rhs2)); in TestTie()
272 CHECK(f == Get<1>(rhs2)); in TestTie()
273 CHECK(c == Get<2>(rhs2)); in TestTie()
/dports/mail/thunderbird/thunderbird-91.8.0/mfbt/tests/
H A DTestTuple.cpp242 Tuple<ConvertibleToInt, double, unsigned char> rhs2(ConvertibleToInt(), 0.7f, in TestTieMozPair() local
244 Tie(i, f, c) = rhs2; in TestTieMozPair()
245 CHECK(i == Get<0>(rhs2)); in TestTieMozPair()
246 CHECK(f == Get<1>(rhs2)); in TestTieMozPair()
247 CHECK(c == Get<2>(rhs2)); in TestTieMozPair()
268 Tuple<ConvertibleToInt, double, unsigned char> rhs2(ConvertibleToInt(), 0.7f, in TestTie() local
270 Tie(i, f, c) = rhs2; in TestTie()
271 CHECK(i == Get<0>(rhs2)); in TestTie()
272 CHECK(f == Get<1>(rhs2)); in TestTie()
273 CHECK(c == Get<2>(rhs2)); in TestTie()
/dports/lang/spidermonkey78/firefox-78.9.0/mfbt/tests/
H A DTestTuple.cpp242 Tuple<ConvertibleToInt, double, unsigned char> rhs2(ConvertibleToInt(), 0.7f, in TestTieMozPair() local
244 Tie(i, f, c) = rhs2; in TestTieMozPair()
245 CHECK(i == Get<0>(rhs2)); in TestTieMozPair()
246 CHECK(f == Get<1>(rhs2)); in TestTieMozPair()
247 CHECK(c == Get<2>(rhs2)); in TestTieMozPair()
268 Tuple<ConvertibleToInt, double, unsigned char> rhs2(ConvertibleToInt(), 0.7f, in TestTie() local
270 Tie(i, f, c) = rhs2; in TestTie()
271 CHECK(i == Get<0>(rhs2)); in TestTie()
272 CHECK(f == Get<1>(rhs2)); in TestTie()
273 CHECK(c == Get<2>(rhs2)); in TestTie()
/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dgimple-ssa-strength-reduction.c450 tree lhs, rhs1, rhs2; in stmt_cost() local
461 rhs2 = gimple_assign_rhs2 (gs); in stmt_cost()
463 if (host_integerp (rhs2, 0)) in stmt_cost()
819 if (rhs1 == rhs2) in slsr_process_mul()
822 if (TREE_CODE (rhs2) == SSA_NAME) in slsr_process_mul()
1035 if (TREE_CODE (rhs2) == SSA_NAME) in slsr_process_add()
1855 t0 = rhs2; in record_increment()
2388 tree rhs2; in replace_one_candidate() local
2417 rhs2 = incr_vec[i].initializer; in replace_one_candidate()
2445 rhs2 = c->stride; in replace_one_candidate()
[all …]
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/
H A Dgimple-ssa-strength-reduction.c450 tree lhs, rhs1, rhs2; in stmt_cost() local
461 rhs2 = gimple_assign_rhs2 (gs); in stmt_cost()
463 if (host_integerp (rhs2, 0)) in stmt_cost()
816 if (rhs1 == rhs2) in slsr_process_mul()
819 if (TREE_CODE (rhs2) == SSA_NAME) in slsr_process_mul()
1032 if (TREE_CODE (rhs2) == SSA_NAME) in slsr_process_add()
1840 t0 = rhs2; in record_increment()
2373 tree rhs2; in replace_one_candidate() local
2402 rhs2 = incr_vec[i].initializer; in replace_one_candidate()
2430 rhs2 = c->stride; in replace_one_candidate()
[all …]
/dports/math/blocksolve95/BlockSolve95/src/
H A DBSpar_symmlq.c40 FLOAT *gbar, FLOAT *dbar, FLOAT *rhs1, FLOAT *rhs2, FLOAT *bstep, in BSpar_symmlq() argument
115 (*rhs2) = 0.0; in BSpar_symmlq()
130 elqnrm = sqrt((*rhs1)*(*rhs1)+(*rhs2)*(*rhs2)); in BSpar_symmlq()
171 (*rhs1) = (*rhs2) - delta*s; in BSpar_symmlq()
172 (*rhs2) = -epsln*s; in BSpar_symmlq()
185 elqnrm = sqrt((*rhs1)*(*rhs1)+(*rhs2)*(*rhs2)); in BSpar_symmlq()
/dports/lang/gcc8/gcc-8.5.0/libstdc++-v3/testsuite/25_algorithms/equal/
H A Dcheck_type2.cc46 input_iterator_wrapper<Rhs2>& rhs2) in test2() argument
47 { return std::equal(lhs2, lhs2, rhs2, rhs2, predicate); } in test2()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/testsuite/25_algorithms/equal/
H A Dcheck_type2.cc46 input_iterator_wrapper<Rhs2>& rhs2) in test2() argument
47 { return std::equal(lhs2, lhs2, rhs2, rhs2, predicate); } in test2()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libstdc++-v3/testsuite/25_algorithms/equal/
H A Dcheck_type2.cc46 input_iterator_wrapper<Rhs2>& rhs2) in test2() argument
47 { return std::equal(lhs2, lhs2, rhs2, rhs2, predicate); } in test2()

12345678910>>...51