/dports/devel/libe/e-releases-0.11.0/e/ |
H A D | tuple_compare.h | 36 tuple_compare(const T1& lhs1, const T1& rhs1) in tuple_compare() argument 38 if (lhs1 < rhs1) in tuple_compare() 42 else if (lhs1 > rhs1) in tuple_compare() 55 const T1& rhs1, const T2& rhs2) in tuple_compare() argument 57 int prefix = tuple_compare(lhs1, rhs1); 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() 108 int prefix = tuple_compare(lhs1, lhs2, lhs3, lhs4, rhs1, rhs2, rhs3, rhs4); in tuple_compare() [all …]
|
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/moab/ |
H A D | HomXform.hpp | 119 bool operator>(const HomCoord &rhs1) const; 249 homCoord[0] = rhs1.homCoord[0]; in operator =() 250 homCoord[1] = rhs1.homCoord[1]; in operator =() 251 homCoord[2] = rhs1.homCoord[2]; in operator =() 252 homCoord[3] = rhs1.homCoord[3]; in operator =() 309 homCoord[3] == rhs1.homCoord[3]); in operator ==() 317 homCoord[3] != rhs1.homCoord[3]); in operator !=() 325 homCoord[3] == rhs1.homCoord[3]); in operator >=() 333 homCoord[3] == rhs1.homCoord[3]); in operator <=() 338 return (homCoord[0] < rhs1.homCoord[0] && in operator <() [all …]
|
/dports/math/eigen3/eigen-3.3.9/test/ |
H A D | product_symm.cpp | 38 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), in symm() 39 rhs13 = (s1*m1) * (s2*rhs1)); in symm() 42 rhs13 = (s1*m1.transpose()) * (s2*rhs1)); in symm() 45 rhs13 = (s1*m1.transpose()) * (s2*rhs1)); in symm() 48 rhs13 = (s1*m1).conjugate() * (s2*rhs1)); in symm() 51 rhs13 = (s1*m1).conjugate() * (s2*rhs1)); in symm() 54 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm() 57 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm() 62 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1), in symm() 63 rhs13 += (s1*m1) * (s2*rhs1)); in symm() [all …]
|
/dports/math/stanmath/math-4.2.0/lib/eigen_3.3.9/test/ |
H A D | product_symm.cpp | 38 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), in symm() 39 rhs13 = (s1*m1) * (s2*rhs1)); in symm() 42 rhs13 = (s1*m1.transpose()) * (s2*rhs1)); in symm() 45 rhs13 = (s1*m1.transpose()) * (s2*rhs1)); in symm() 48 rhs13 = (s1*m1).conjugate() * (s2*rhs1)); in symm() 51 rhs13 = (s1*m1).conjugate() * (s2*rhs1)); in symm() 54 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm() 57 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm() 62 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1), in symm() 63 rhs13 += (s1*m1) * (s2*rhs1)); in symm() [all …]
|
/dports/misc/opennn/opennn-5.0.5/eigen/test/ |
H A D | product_symm.cpp | 38 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), in symm() 39 rhs13 = (s1*m1) * (s2*rhs1)); in symm() 42 rhs13 = (s1*m1.transpose()) * (s2*rhs1)); in symm() 45 rhs13 = (s1*m1.transpose()) * (s2*rhs1)); in symm() 48 rhs13 = (s1*m1).conjugate() * (s2*rhs1)); in symm() 51 rhs13 = (s1*m1).conjugate() * (s2*rhs1)); in symm() 54 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm() 57 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm() 62 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1), in symm() 63 rhs13 += (s1*m1) * (s2*rhs1)); in symm() [all …]
|
/dports/math/libsemigroups/libsemigroups-1.3.7/extern/eigen-3.3.7/test/ |
H A D | product_symm.cpp | 28 Rhs1 rhs1 = Rhs1::Random(cols, othersize), rhs12(cols, othersize), rhs13(cols, othersize); in symm() local 38 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), in symm() 39 rhs13 = (s1*m1) * (s2*rhs1)); in symm() 42 rhs13 = (s1*m1.transpose()) * (s2*rhs1)); in symm() 45 rhs13 = (s1*m1.transpose()) * (s2*rhs1)); in symm() 48 rhs13 = (s1*m1).conjugate() * (s2*rhs1)); in symm() 51 rhs13 = (s1*m1).conjugate() * (s2*rhs1)); in symm() 54 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm() 57 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm() 62 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1), in symm() [all …]
|
H A D | product_syrk.cpp | 28 …Rhs1 rhs1 = Rhs1::Random(internal::random<int>(1,320), cols); Rhs1 rhs11 = Rhs1::Random(rhs1.rows(… in syrk() local 53 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk() 54 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk() 56 …VERIFY_IS_APPROX((m2.template triangularView<Lower>() += s1 * rhs11.adjoint() * rhs1).nestedExpres… in syrk() 57 … (s1 * rhs11.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk() 61 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk() 62 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Upper>().toDenseMatrix()); in syrk() 63 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() = s1 * rhs1.adjoint() * rhs11).nestedExpress… in syrk() 64 … (s1 * rhs1.adjoint() * rhs11).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/eigen-3.3.7/test/ |
H A D | product_symm.cpp | 28 Rhs1 rhs1 = Rhs1::Random(cols, othersize), rhs12(cols, othersize), rhs13(cols, othersize); in symm() local 38 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), in symm() 39 rhs13 = (s1*m1) * (s2*rhs1)); in symm() 42 rhs13 = (s1*m1.transpose()) * (s2*rhs1)); in symm() 45 rhs13 = (s1*m1.transpose()) * (s2*rhs1)); in symm() 48 rhs13 = (s1*m1).conjugate() * (s2*rhs1)); in symm() 51 rhs13 = (s1*m1).conjugate() * (s2*rhs1)); in symm() 54 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm() 57 rhs13 = (s1*m1).adjoint() * (s2*rhs1)); in symm() 62 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1), in symm() [all …]
|
H A D | product_syrk.cpp | 28 …Rhs1 rhs1 = Rhs1::Random(internal::random<int>(1,320), cols); Rhs1 rhs11 = Rhs1::Random(rhs1.rows(… in syrk() local 53 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk() 54 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk() 56 …VERIFY_IS_APPROX((m2.template triangularView<Lower>() += s1 * rhs11.adjoint() * rhs1).nestedExpres… in syrk() 57 … (s1 * rhs11.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk() 61 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk() 62 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Upper>().toDenseMatrix()); in syrk() 63 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() = s1 * rhs1.adjoint() * rhs11).nestedExpress… in syrk() 64 … (s1 * rhs1.adjoint() * rhs11).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
|
/dports/www/firefox-esr/firefox-91.8.0/mfbt/tests/ |
H A D | TestTuple.cpp | 237 Tie(i, f, c) = rhs1; in TestTieMozPair() 238 CHECK(i == Get<0>(rhs1)); in TestTieMozPair() 239 CHECK(f == Get<1>(rhs1)); in TestTieMozPair() 240 CHECK(c == Get<2>(rhs1)); in TestTieMozPair() 263 Tie(i, f, c) = rhs1; in TestTie() 264 CHECK(i == Get<0>(rhs1)); in TestTie() 265 CHECK(f == Get<1>(rhs1)); in TestTie() 266 CHECK(c == Get<2>(rhs1)); in TestTie() 289 Tie(i, mozilla::Ignore, c) = rhs1; in TestTieIgnore() 291 CHECK(i == Get<0>(rhs1)); in TestTieIgnore() [all …]
|
/dports/www/firefox/firefox-99.0/mfbt/tests/ |
H A D | TestTuple.cpp | 237 Tie(i, f, c) = rhs1; in TestTieMozPair() 238 CHECK(i == Get<0>(rhs1)); in TestTieMozPair() 239 CHECK(f == Get<1>(rhs1)); in TestTieMozPair() 240 CHECK(c == Get<2>(rhs1)); in TestTieMozPair() 263 Tie(i, f, c) = rhs1; in TestTie() 264 CHECK(i == Get<0>(rhs1)); in TestTie() 265 CHECK(f == Get<1>(rhs1)); in TestTie() 266 CHECK(c == Get<2>(rhs1)); in TestTie() 289 Tie(i, mozilla::Ignore, c) = rhs1; in TestTieIgnore() 291 CHECK(i == Get<0>(rhs1)); in TestTieIgnore() [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/mfbt/tests/ |
H A D | TestTuple.cpp | 237 Tie(i, f, c) = rhs1; in TestTieMozPair() 238 CHECK(i == Get<0>(rhs1)); in TestTieMozPair() 239 CHECK(f == Get<1>(rhs1)); in TestTieMozPair() 240 CHECK(c == Get<2>(rhs1)); in TestTieMozPair() 263 Tie(i, f, c) = rhs1; in TestTie() 264 CHECK(i == Get<0>(rhs1)); in TestTie() 265 CHECK(f == Get<1>(rhs1)); in TestTie() 266 CHECK(c == Get<2>(rhs1)); in TestTie() 289 Tie(i, mozilla::Ignore, c) = rhs1; in TestTieIgnore() 291 CHECK(i == Get<0>(rhs1)); in TestTieIgnore() [all …]
|
/dports/lang/spidermonkey78/firefox-78.9.0/mfbt/tests/ |
H A D | TestTuple.cpp | 237 Tie(i, f, c) = rhs1; in TestTieMozPair() 238 CHECK(i == Get<0>(rhs1)); in TestTieMozPair() 239 CHECK(f == Get<1>(rhs1)); in TestTieMozPair() 240 CHECK(c == Get<2>(rhs1)); in TestTieMozPair() 263 Tie(i, f, c) = rhs1; in TestTie() 264 CHECK(i == Get<0>(rhs1)); in TestTie() 265 CHECK(f == Get<1>(rhs1)); in TestTie() 266 CHECK(c == Get<2>(rhs1)); in TestTie() 289 Tie(i, mozilla::Ignore, c) = rhs1; in TestTieIgnore() 291 CHECK(i == Get<0>(rhs1)); in TestTieIgnore() [all …]
|
/dports/lang/gnat_util/gcc-6-20180516/gcc/ |
H A D | gimple-match-head.c | 599 ops[1] = TREE_OPERAND (rhs1, 1); in gimple_simplify() 600 ops[2] = TREE_OPERAND (rhs1, 2); in gimple_simplify() 620 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 622 ops[0] = rhs1; in gimple_simplify() 631 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 634 ops[0] = rhs1; in gimple_simplify() 648 if (COMPARISON_CLASS_P (rhs1)) in gimple_simplify() 666 rhs1 = build2 (rcode2, TREE_TYPE (rhs1), in gimple_simplify() 671 rhs1 = ops2[0]; in gimple_simplify() 679 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() [all …]
|
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
H A D | gimple-match-head.c | 599 ops[1] = TREE_OPERAND (rhs1, 1); in gimple_simplify() 600 ops[2] = TREE_OPERAND (rhs1, 2); in gimple_simplify() 620 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 622 ops[0] = rhs1; in gimple_simplify() 631 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 634 ops[0] = rhs1; in gimple_simplify() 648 if (COMPARISON_CLASS_P (rhs1)) in gimple_simplify() 666 rhs1 = build2 (rcode2, TREE_TYPE (rhs1), in gimple_simplify() 671 rhs1 = ops2[0]; in gimple_simplify() 679 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() [all …]
|
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
H A D | tree-stdarg.c | 135 tree rhs1; in va_list_counter_bump() local 155 rhs1 = gimple_assign_rhs1 (stmt); in va_list_counter_bump() 158 && TREE_CODE (rhs1) == SSA_NAME) in va_list_counter_bump() 160 lhs = rhs1; in va_list_counter_bump() 166 && TREE_CODE (rhs1) == SSA_NAME in va_list_counter_bump() 170 lhs = rhs1; in va_list_counter_bump() 209 tree rhs1; in va_list_counter_bump() local 225 && TREE_CODE (rhs1) == SSA_NAME) in va_list_counter_bump() 227 lhs = rhs1; in va_list_counter_bump() 233 && TREE_CODE (rhs1) == SSA_NAME in va_list_counter_bump() [all …]
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | gimple-match-head.c | 649 ops[1] = TREE_OPERAND (rhs1, 1); in gimple_simplify() 650 ops[2] = TREE_OPERAND (rhs1, 2); in gimple_simplify() 670 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 672 ops[0] = rhs1; in gimple_simplify() 681 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 684 ops[0] = rhs1; in gimple_simplify() 698 if (COMPARISON_CLASS_P (rhs1)) in gimple_simplify() 716 rhs1 = build2 (rcode2, TREE_TYPE (rhs1), in gimple_simplify() 721 rhs1 = ops2[0]; in gimple_simplify() 729 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() [all …]
|
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
H A D | gimple-match-head.c | 649 ops[1] = TREE_OPERAND (rhs1, 1); in gimple_simplify() 650 ops[2] = TREE_OPERAND (rhs1, 2); in gimple_simplify() 670 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 672 ops[0] = rhs1; in gimple_simplify() 681 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 684 ops[0] = rhs1; in gimple_simplify() 698 if (COMPARISON_CLASS_P (rhs1)) in gimple_simplify() 716 rhs1 = build2 (rcode2, TREE_TYPE (rhs1), in gimple_simplify() 721 rhs1 = ops2[0]; in gimple_simplify() 729 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() [all …]
|
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
H A D | gimple-match-head.c | 649 ops[1] = TREE_OPERAND (rhs1, 1); in gimple_simplify() 650 ops[2] = TREE_OPERAND (rhs1, 2); in gimple_simplify() 670 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 672 ops[0] = rhs1; in gimple_simplify() 681 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 684 ops[0] = rhs1; in gimple_simplify() 698 if (COMPARISON_CLASS_P (rhs1)) in gimple_simplify() 716 rhs1 = build2 (rcode2, TREE_TYPE (rhs1), in gimple_simplify() 721 rhs1 = ops2[0]; in gimple_simplify() 729 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() [all …]
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
H A D | gimple-match-head.c | 649 ops[1] = TREE_OPERAND (rhs1, 1); in gimple_simplify() 650 ops[2] = TREE_OPERAND (rhs1, 2); in gimple_simplify() 670 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 672 ops[0] = rhs1; in gimple_simplify() 681 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 684 ops[0] = rhs1; in gimple_simplify() 698 if (COMPARISON_CLASS_P (rhs1)) in gimple_simplify() 716 rhs1 = build2 (rcode2, TREE_TYPE (rhs1), in gimple_simplify() 721 rhs1 = ops2[0]; in gimple_simplify() 729 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() [all …]
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | gimple-match-head.c | 649 ops[1] = TREE_OPERAND (rhs1, 1); in gimple_simplify() 650 ops[2] = TREE_OPERAND (rhs1, 2); in gimple_simplify() 670 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 672 ops[0] = rhs1; in gimple_simplify() 681 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 684 ops[0] = rhs1; in gimple_simplify() 698 if (COMPARISON_CLASS_P (rhs1)) in gimple_simplify() 716 rhs1 = build2 (rcode2, TREE_TYPE (rhs1), in gimple_simplify() 721 rhs1 = ops2[0]; in gimple_simplify() 729 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() [all …]
|
/dports/lang/gcc8/gcc-8.5.0/gcc/ |
H A D | gimple-match-head.c | 649 ops[1] = TREE_OPERAND (rhs1, 1); in gimple_simplify() 650 ops[2] = TREE_OPERAND (rhs1, 2); in gimple_simplify() 670 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 672 ops[0] = rhs1; in gimple_simplify() 681 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() 684 ops[0] = rhs1; in gimple_simplify() 698 if (COMPARISON_CLASS_P (rhs1)) in gimple_simplify() 716 rhs1 = build2 (rcode2, TREE_TYPE (rhs1), in gimple_simplify() 721 rhs1 = ops2[0]; in gimple_simplify() 729 rhs1 = do_valueize (rhs1, top_valueize, valueized); in gimple_simplify() [all …]
|
/dports/math/libmesh/libmesh-1.6.2/contrib/eigen/3.2.9/test/ |
H A D | product_syrk.cpp | 29 …Rhs1 rhs1 = Rhs1::Random(internal::random<int>(1,320), cols); Rhs1 rhs11 = Rhs1::Random(rhs1.rows(… in syrk() local 54 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk() 55 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk() 57 …VERIFY_IS_APPROX((m2.template triangularView<Lower>() += s1 * rhs11.adjoint() * rhs1).nestedExpres… in syrk() 58 … (s1 * rhs11.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk() 62 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk() 63 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Upper>().toDenseMatrix()); in syrk() 64 …VERIFY_IS_APPROX((m2.template triangularView<Upper>() = s1 * rhs1.adjoint() * rhs11).nestedExpress… in syrk() 65 … (s1 * rhs1.adjoint() * rhs11).eval().template triangularView<Upper>().toDenseMatrix()); in syrk()
|
/dports/lang/gcc48/gcc-4.8.5/gcc/ |
H A D | tree-stdarg.c | 135 tree rhs1; in va_list_counter_bump() local 155 rhs1 = gimple_assign_rhs1 (stmt); in va_list_counter_bump() 158 && TREE_CODE (rhs1) == SSA_NAME) in va_list_counter_bump() 160 lhs = rhs1; in va_list_counter_bump() 166 && TREE_CODE (rhs1) == SSA_NAME in va_list_counter_bump() 170 lhs = rhs1; in va_list_counter_bump() 209 tree rhs1; in va_list_counter_bump() local 225 && TREE_CODE (rhs1) == SSA_NAME) in va_list_counter_bump() 227 lhs = rhs1; in va_list_counter_bump() 233 && TREE_CODE (rhs1) == SSA_NAME in va_list_counter_bump() [all …]
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
H A D | tree-stdarg.c | 149 tree rhs1; in va_list_counter_bump() local 169 rhs1 = gimple_assign_rhs1 (stmt); in va_list_counter_bump() 172 && TREE_CODE (rhs1) == SSA_NAME) in va_list_counter_bump() 174 lhs = rhs1; in va_list_counter_bump() 180 && TREE_CODE (rhs1) == SSA_NAME in va_list_counter_bump() 184 lhs = rhs1; in va_list_counter_bump() 223 tree rhs1; in va_list_counter_bump() local 239 && TREE_CODE (rhs1) == SSA_NAME) in va_list_counter_bump() 241 lhs = rhs1; in va_list_counter_bump() 247 && TREE_CODE (rhs1) == SSA_NAME in va_list_counter_bump() [all …]
|