/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/equal/ |
H A D | check_type2.cc | 42 input_iterator_wrapper<Rhs1>& rhs1) 43 { return std::equal(lhs1, lhs1, rhs1, rhs1); } 41 test1(input_iterator_wrapper<Lhs1>& lhs1, input_iterator_wrapper<Rhs1>& rhs1) argument
|
H A D | check_type.cc | 41 input_iterator_wrapper<Rhs1>& rhs1) 42 { return std::equal(lhs1, lhs1, rhs1); } 40 test1(input_iterator_wrapper<Lhs1>& lhs1, input_iterator_wrapper<Rhs1>& rhs1) argument
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/lexicographical_compare/ |
H A D | check_type.cc | 45 input_iterator_wrapper<Rhs1>& rhs1) 46 { return std::lexicographical_compare(lhs1, lhs1, rhs1, rhs1); } 44 test1(input_iterator_wrapper<Lhs1>& lhs1, input_iterator_wrapper<Rhs1>& rhs1) argument
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/mismatch/ |
H A D | check_type2.cc | 42 test1(input_iterator_wrapper<Lhs1>& lhs1, input_iterator_wrapper<Rhs1>& rhs1) argument 44 return std::mismatch(lhs1, lhs1, rhs1, rhs1);
|
H A D | check_type.cc | 41 test1(input_iterator_wrapper<Lhs1>& lhs1, input_iterator_wrapper<Rhs1>& rhs1) argument 43 return std::mismatch(lhs1, lhs1, rhs1);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/find_first_of/ |
H A D | check_type.cc | 42 forward_iterator_wrapper<Rhs1>& rhs1) 43 { return std::find_first_of(lhs1, lhs1, rhs1, rhs1); } 41 test1(forward_iterator_wrapper<Lhs1>& lhs1, forward_iterator_wrapper<Rhs1>& rhs1) argument
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/find_end/ |
H A D | check_type.cc | 42 forward_iterator_wrapper<Rhs1>& rhs1) 44 return std::find_end(lhs1, lhs1, rhs1, rhs1); 41 test1(forward_iterator_wrapper<Lhs1>& lhs1, forward_iterator_wrapper<Rhs1>& rhs1) argument
|
/haiku-buildtools/gcc/gcc/ |
H A D | tree-stdarg.c | 164 tree rhs1; local 184 rhs1 = gimple_assign_rhs1 (stmt); 187 && TREE_CODE (rhs1) == SSA_NAME) 189 lhs = rhs1; 195 && TREE_CODE (rhs1) == SSA_NAME 199 lhs = rhs1; 204 && TREE_CODE (TREE_OPERAND (rhs1, 0)) == MEM_REF 205 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (rhs1, 0), 0)) == SSA_NAME 206 && tree_fits_uhwi_p (TREE_OPERAND (TREE_OPERAND (rhs1, 0), 1))) 208 ret += tree_to_uhwi (TREE_OPERAND (TREE_OPERAND (rhs1, 238 tree rhs1; local [all...] |
H A D | gimple-match-head.c | 632 tree rhs1 = gimple_assign_rhs1 (stmt); local 633 tree op0 = TREE_OPERAND (rhs1, 0); 642 ops[1] = TREE_OPERAND (rhs1, 1); 643 ops[2] = TREE_OPERAND (rhs1, 2); 660 tree rhs1 = gimple_assign_rhs1 (stmt); local 661 if (valueize && TREE_CODE (rhs1) == SSA_NAME) 663 tree tem = valueize (rhs1); 665 rhs1 = tem; 668 ops[0] = rhs1; 673 tree rhs1 local 694 tree rhs1 = gimple_assign_rhs1 (stmt); local [all...] |
H A D | gimple-ssa-strength-reduction.c | 701 tree lhs, rhs1, rhs2; 706 rhs1 = gimple_assign_rhs1 (gs); 717 gcc_assert (TREE_CODE (rhs1) != INTEGER_CST); 729 return convert_cost (lhs_mode, TYPE_MODE (TREE_TYPE (rhs1)), speed); 1212 slsr_process_mul (gimple gs, tree rhs1, tree rhs2, bool speed) 1220 if (rhs1 == rhs2) 1227 c = create_mul_ssa_cand (gs, rhs1, rhs2, speed); 1234 c2 = create_mul_ssa_cand (gs, rhs2, rhs1, speed); 1240 c = create_mul_imm_cand (gs, rhs1, rhs2, speed); 1432 slsr_process_add (gimple gs, tree rhs1, tre 698 tree lhs, rhs1, rhs2; local 1208 slsr_process_mul(gimple gs, tree rhs1, tree rhs2, bool speed) argument 1428 slsr_process_add(gimple gs, tree rhs1, tree rhs2, bool speed) argument 1483 slsr_process_neg(gimple gs, tree rhs1, bool speed) argument 1570 slsr_process_cast(gimple gs, tree rhs1, bool speed) argument 1635 slsr_process_copy(gimple gs, tree rhs1, bool speed) argument 1715 tree rhs1 = NULL_TREE, rhs2 = NULL_TREE; local 2094 tree rhs1, rhs2; local 2552 tree rhs1 = gimple_assign_rhs1 (c->cand_stmt); local [all...] |
H A D | tree-scalar-evolution.c | 940 tree type, tree rhs0, enum tree_code code, tree rhs1, 953 if (TREE_CODE (rhs1) == SSA_NAME) 967 code, rhs1, at_stmt); 979 (loop, SSA_NAME_DEF_STMT (rhs1), halting_phi, 998 code, rhs1, at_stmt); 1009 else if (TREE_CODE (rhs1) == SSA_NAME) 1018 (loop, SSA_NAME_DEF_STMT (rhs1), halting_phi, 1034 /* This case is under the form "opnd0 = rhs0 - rhs1". */ 1043 if (TREE_CODE (rhs1) == SSA_NAME) 1048 MINUS_EXPR, rhs1, at_stm 936 follow_ssa_edge_binary(struct loop *loop, gimple at_stmt, tree type, tree rhs0, enum tree_code code, tree rhs1, gphi *halting_phi, tree *evolution_of_loop, int limit) argument 1076 tree type = TREE_TYPE (expr), rhs0, rhs1; local 1167 tree type = gimple_expr_type (stmt), rhs1, rhs2; local 1724 interpret_rhs_expr(struct loop *loop, gimple at_stmt, tree type, tree rhs1, enum tree_code code, tree rhs2) argument [all...] |
H A D | tree-vect-patterns.c | 1944 tree rhs1 = gimple_assign_rhs1 (def_stmt); variable 1945 if (TYPE_MODE (TREE_TYPE (rhs1)) == TYPE_MODE (type) 1946 && TYPE_PRECISION (TREE_TYPE (rhs1)) 1948 def = rhs1; 2147 tree rhs1 = gimple_assign_rhs1 (def_stmt); variable 2148 if (TYPE_MODE (TREE_TYPE (rhs1)) == TYPE_MODE (TREE_TYPE (oprnd0)) 2149 && TYPE_PRECISION (TREE_TYPE (rhs1)) 2151 def = rhs1; 2803 tree def, rhs1; local 2819 rhs1 2910 tree itype, cond_expr, rhs1, rhs2, irhs1, irhs2; local [all...] |
H A D | tree-if-conv.c | 397 tree rhs1, lhs1, cond_expr; local 423 rhs1 = TREE_OPERAND (cond_expr, 1); 424 STRIP_USELESS_TYPE_CONVERSION (rhs1); 425 if (constant_or_ssa_name (rhs1)) 426 return build1 (ABS_EXPR, type, rhs1); 434 rhs1 = TREE_OPERAND (cond_expr, 1); 435 STRIP_USELESS_TYPE_CONVERSION (rhs1); 436 if (constant_or_ssa_name (rhs1) 438 return build2 (TREE_CODE (cond_expr), type, lhs1, rhs1); 1575 tree rhs1 local 2493 tree rhs1, rhs2; local [all...] |
H A D | tree-ssa-math-opts.c | 1751 the byte size of rhs1. The highest order byte is set to n->size and the 1968 tree rhs1, rhs2 = NULL; local 1975 rhs1 = gimple_assign_rhs1 (stmt); 1977 if (find_bswap_or_nop_load (stmt, rhs1, n)) 1980 if (TREE_CODE (rhs1) != SSA_NAME) 1985 rhs1_stmt = SSA_NAME_DEF_STMT (rhs1); 2012 || !init_symbolic_number (n, rhs1)) 2643 tree type1, rhs1; local 2651 rhs1 = rhs; 2654 rhs1 2749 tree lhs, rhs1, rhs2, type, type1, type2; local 2854 tree lhs, rhs1, rhs2, mult_rhs1, mult_rhs2, add_rhs; local [all...] |
H A D | tree-ssa-ccp.c | 1525 bit_value_binop (enum tree_code code, tree type, tree rhs1, tree rhs2) argument 1527 ccp_prop_value_t r1val = get_value_for_expr (rhs1, true); 1548 TREE_TYPE (rhs1), value_to_wide_int (r1val), r1val.mask, 1761 tree rhs1 = gimple_assign_rhs1 (stmt); local 1765 if (INTEGRAL_TYPE_P (TREE_TYPE (rhs1)) 1766 || POINTER_TYPE_P (TREE_TYPE (rhs1))) 1767 val = get_value_for_expr (rhs1, true); 1771 if ((INTEGRAL_TYPE_P (TREE_TYPE (rhs1)) 1772 || POINTER_TYPE_P (TREE_TYPE (rhs1))) 1775 val = bit_value_unop (subcode, gimple_expr_type (stmt), rhs1); 1795 tree rhs1 = gimple_cond_lhs (stmt); local [all...] |
H A D | tree-chkp-opt.c | 387 tree rhs1; local 419 rhs1 = gimple_assign_rhs1 (def_stmt); 426 chkp_collect_value (rhs1, res); 431 chkp_collect_value (rhs1, res); 439 chkp_collect_value (rhs1, res); 447 if (TREE_CODE (rhs1) == SSA_NAME 450 chkp_collect_value (rhs1, res); 454 && TREE_CODE (rhs1) == INTEGER_CST) 457 chkp_mult_addr (res, rhs1);
|
H A D | tree-ssa-reassoc.c | 3471 on rhs1 operand if so. */ 3556 find_insert_point (gimple stmt, tree rhs1, tree rhs2) argument 3558 if (TREE_CODE (rhs1) == SSA_NAME 3559 && reassoc_stmt_dominates_stmt_p (stmt, SSA_NAME_DEF_STMT (rhs1))) 3560 stmt = SSA_NAME_DEF_STMT (rhs1); 3575 tree rhs1 = gimple_assign_rhs1 (stmt); local 3592 if (rhs1 != oe1->op || rhs2 != oe2->op) 3607 if (changed || ((rhs1 != oe2->op || rhs2 != oe1->op) && opindex)) 3630 if (rhs1 != oe1->op && rhs1 ! 3970 tree rhs1 = gimple_assign_rhs1 (negatedefstmt); local 4042 tree rhs1 = gimple_assign_rhs1 (stmt); local 4287 tree rhs1 = gimple_assign_rhs1 (user); local 4328 tree rhs1 = gimple_assign_rhs1 (user); local 4759 tree rhs1; local 4782 transform_stmt_to_multiply(gimple_stmt_iterator *gsi, gimple stmt, tree rhs1, tree rhs2) argument 4822 tree lhs, rhs1, rhs2; local [all...] |
H A D | tree-ssa-forwprop.c | 452 tree rhs0 = NULL_TREE, rhs1 = NULL_TREE; local 488 rhs1 = rhs_to_tree (TREE_TYPE (op0), def_stmt); 490 op0, rhs1, !single_use1_p); 498 && rhs1 != NULL_TREE) 500 rhs0, rhs1, 518 tree rhs1 = gimple_assign_rhs1 (stmt); local 524 type, rhs1, rhs2); 531 if (TREE_CODE (rhs1) == SSA_NAME) 532 cfg_changed |= remove_prop_source_from_use (rhs1); 554 tree rhs1 local 2372 tree rhs1 = gimple_assign_rhs1 (stmt); local [all...] |
H A D | tree-ssa-coalesce.c | 862 tree rhs1 = gimple_assign_rhs1 (stmt); local 865 && TREE_CODE (rhs1) == SSA_NAME) 866 live_track_clear_var (live, rhs1); 1013 tree rhs1 = gimple_assign_rhs1 (stmt); local 1015 && gimple_can_coalesce_p (lhs, rhs1)) 1018 v2 = SSA_NAME_VERSION (rhs1);
|
H A D | tree-chkp.c | 2538 tree rhs1 = gimple_assign_rhs1 (assign); local 2556 bounds = chkp_find_bounds_loaded (node, rhs1, &iter); 2567 bounds = chkp_find_bounds (rhs1, &iter); 2568 base = rhs1; 2573 bounds = chkp_find_bounds (TREE_OPERAND (rhs1, 0), &iter); 2577 if (BOUNDED_P (rhs1)) 2580 bounds = chkp_build_bndldx (chkp_build_addr_expr (rhs1), 2582 TREE_ADDRESSABLE (rhs1) = 1; 2595 tree bnd1 = chkp_find_bounds (rhs1, &iter); 2606 if (BOUNDED_P (rhs1) 4016 tree rhs1 = gimple_assign_rhs1 (stmt); local [all...] |
H A D | tree-cfg.c | 3497 tree rhs1 = gimple_assign_rhs1 (stmt); local 3498 tree rhs1_type = TREE_TYPE (rhs1); 3506 if (!is_gimple_val (rhs1)) 3659 tree rhs1 = gimple_assign_rhs1 (stmt); local 3660 tree rhs1_type = TREE_TYPE (rhs1); 3670 if (!is_gimple_val (rhs1) 3835 return verify_gimple_comparison (lhs_type, rhs1, rhs2); 3900 tree rhs1 = gimple_assign_rhs1 (stmt); local 3901 tree rhs1_type = TREE_TYPE (rhs1); 3914 ? !is_gimple_condexpr (rhs1) 4073 tree rhs1 = gimple_assign_rhs1 (stmt); local [all...] |
H A D | tree-vect-generic.c | 987 tree rhs1 = gimple_assign_rhs1 (assign); local 990 return expand_vector_comparison (gsi, type, rhs1, rhs2, code); 996 tree rhs1 = gimple_assign_rhs1 (assign); local 1006 ret = expand_vector_divmod (gsi, type, rhs1, rhs2, code); 1501 tree lhs, rhs1, rhs2 = NULL, type, compute_type = NULL_TREE; 1549 rhs1 = gimple_assign_rhs1 (stmt); 1566 type = TREE_TYPE (rhs1); 1583 type = TREE_TYPE (rhs1); 1500 tree lhs, rhs1, rhs2 = NULL, type, compute_type = NULL_TREE; local
|
H A D | tree-ssa-sccvn.c | 533 tree rhs1 = gimple_assign_rhs1 (stmt); local 549 && TREE_CODE (TREE_OPERAND (rhs1, 0)) == SSA_NAME) 561 return (is_gimple_min_invariant (rhs1) 1825 tree rhs1 = gimple_assign_rhs1 (def_stmt); local 1826 gimple def_stmt2 = SSA_NAME_DEF_STMT (rhs1); 1830 && types_compatible_p (vr->type, TREE_TYPE (TREE_TYPE (rhs1)))) 1845 = TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (TREE_TYPE (rhs1)))); 1861 if (TREE_CODE (TREE_TYPE (rhs1)) == VECTOR_TYPE) 3561 tree rhs1 = gimple_assign_rhs1 (stmt); local 3569 changed = visit_copy (lhs, rhs1); [all...] |
H A D | tree-ssa-phiopt.c | 564 tree rhs1 = gimple_assign_rhs1 (stmt); local 566 tree tem = get_addr_base_and_unit_offset (TREE_OPERAND (rhs1, 0), 878 tree rhs1 = gimple_assign_rhs1 (assign); local 887 && ((arg1 == rhs1 891 && operand_equal_for_phi_arg_p (rhs1, cond_lhs) 895 || operand_equal_for_phi_arg_p (rhs1, cond_lhs))
|
/haiku-buildtools/gcc/gcc/c-family/ |
H A D | c-omp.c | 187 tree v, tree lhs1, tree rhs1, bool swapped, bool seq_cst) 193 || rhs1 == error_mark_node) 273 if (rhs1 274 && TREE_CODE (rhs1) == VAR_DECL 276 && rhs1 != lhs) 299 if (rhs1 && rhs1 != lhs) 301 tree rhs1addr = build_unary_op (loc, ADDR_EXPR, rhs1, 0); 320 else if (rhs1 && rhs1 ! 185 c_finish_omp_atomic(location_t loc, enum tree_code code, enum tree_code opcode, tree lhs, tree rhs, tree v, tree lhs1, tree rhs1, bool swapped, bool seq_cst) argument [all...] |