Home
last modified time | relevance | path

Searched refs:iv1 (Results 1 – 7 of 7) sorted by relevance

/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dloop-iv.c500 iv_add (struct rtx_iv *iv0, struct rtx_iv *iv1, enum rtx_code op) in iv_add() argument
509 && GET_MODE_SIZE (iv0->extend_mode) < GET_MODE_SIZE (iv1->extend_mode)) in iv_add()
511 iv0->extend_mode = iv1->extend_mode; in iv_add()
515 if (iv1->extend == UNKNOWN in iv_add()
516 && iv1->mode == iv1->extend_mode in iv_add()
517 && iv1->step == const0_rtx in iv_add()
518 && GET_MODE_SIZE (iv1->extend_mode) < GET_MODE_SIZE (iv0->extend_mode)) in iv_add()
520 iv1->extend_mode = iv0->extend_mode; in iv_add()
521 iv1->base = simplify_gen_unary (ZERO_EXTEND, iv1->extend_mode, in iv_add()
522 iv1->base, iv1->mode); in iv_add()
[all …]
H A Dtree-ssa-loop-niter.c705 number_of_iterations_lt_to_ne (tree type, affine_iv *iv0, affine_iv *iv1, in number_of_iterations_lt_to_ne() argument
744 || (iv1->no_overflow && integer_nonzerop (iv1->step)); in number_of_iterations_lt_to_ne()
756 iv1->base, bound); in number_of_iterations_lt_to_ne()
765 fold_build_pointer_plus (iv1->base, tmod)); in number_of_iterations_lt_to_ne()
770 iv1->base, tmod)); in number_of_iterations_lt_to_ne()
793 iv1->base); in number_of_iterations_lt_to_ne()
798 iv1->base); in number_of_iterations_lt_to_ne()
824 assert_no_overflow_lt (tree type, affine_iv *iv0, affine_iv *iv1, in assert_no_overflow_lt() argument
853 iv1->base, bound); in assert_no_overflow_lt()
858 if (iv1->no_overflow) in assert_no_overflow_lt()
[all …]
H A Dtree-ssa-loop-ivopts.c1315 struct iv *iv0 = &const_iv, *iv1 = &const_iv, *tmp_iv; in extract_cond_operands() local
1335 iv1 = get_iv (data, *op1); in extract_cond_operands()
1339 if (!iv0 || !iv1) in extract_cond_operands()
1346 tmp_iv = iv0; iv0 = iv1; iv1 = tmp_iv; in extract_cond_operands()
1348 ret = !integer_zerop (iv0->step) && integer_zerop (iv1->step); in extract_cond_operands()
1358 *iv_bound = iv1; in extract_cond_operands()
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dloop-iv.c507 iv_add (struct rtx_iv *iv0, struct rtx_iv *iv1, enum rtx_code op) in iv_add() argument
516 && GET_MODE_SIZE (iv0->extend_mode) < GET_MODE_SIZE (iv1->extend_mode)) in iv_add()
518 iv0->extend_mode = iv1->extend_mode; in iv_add()
522 if (iv1->extend == IV_UNKNOWN_EXTEND in iv_add()
523 && iv1->mode == iv1->extend_mode in iv_add()
524 && iv1->step == const0_rtx in iv_add()
525 && GET_MODE_SIZE (iv1->extend_mode) < GET_MODE_SIZE (iv0->extend_mode)) in iv_add()
527 iv1->extend_mode = iv0->extend_mode; in iv_add()
528 iv1->base = simplify_gen_unary (ZERO_EXTEND, iv1->extend_mode, in iv_add()
529 iv1->base, iv1->mode); in iv_add()
[all …]
H A Dtree-ssa-loop-niter.c1140 number_of_iterations_lt_to_ne (tree type, affine_iv *iv0, affine_iv *iv1, in number_of_iterations_lt_to_ne() argument
1179 || (iv1->no_overflow && integer_nonzerop (iv1->step)); in number_of_iterations_lt_to_ne()
1191 iv1->base, bound); in number_of_iterations_lt_to_ne()
1200 fold_build_pointer_plus (iv1->base, tmod)); in number_of_iterations_lt_to_ne()
1205 iv1->base, tmod)); in number_of_iterations_lt_to_ne()
1228 iv1->base); in number_of_iterations_lt_to_ne()
1233 iv1->base); in number_of_iterations_lt_to_ne()
1259 assert_no_overflow_lt (tree type, affine_iv *iv0, affine_iv *iv1, in assert_no_overflow_lt() argument
1288 iv1->base, bound); in assert_no_overflow_lt()
1293 if (iv1->no_overflow) in assert_no_overflow_lt()
[all …]
H A Dpredict.c1419 affine_iv iv0, iv1; in is_comparison_with_loop_invariant_p() local
1448 if (!simple_iv (loop, loop_containing_stmt (stmt), op1, &iv1, true)) in is_comparison_with_loop_invariant_p()
1451 || TREE_CODE (iv1.step) != INTEGER_CST) in is_comparison_with_loop_invariant_p()
1453 if ((integer_zerop (iv0.step) && integer_zerop (iv1.step)) in is_comparison_with_loop_invariant_p()
1454 || (!integer_zerop (iv0.step) && !integer_zerop (iv1.step))) in is_comparison_with_loop_invariant_p()
1462 base = iv1.base; in is_comparison_with_loop_invariant_p()
1463 if (tree_fits_shwi_p (iv1.step)) in is_comparison_with_loop_invariant_p()
1464 step = iv1.step; in is_comparison_with_loop_invariant_p()
1470 bound = iv1.base; in is_comparison_with_loop_invariant_p()
H A Dtree-ssa-loop-ivopts.c1703 struct iv *iv0 = &const_iv, *iv1 = &const_iv; in extract_cond_operands() local
1724 iv1 = get_iv (data, *op1); in extract_cond_operands()
1727 if (iv0 && iv1 && !integer_zerop (iv0->step) && !integer_zerop (iv1->step)) in extract_cond_operands()
1735 && (!iv1 || integer_zerop (iv1->step))) in extract_cond_operands()
1742 std::swap (iv0, iv1); in extract_cond_operands()
1745 if (!iv1) in extract_cond_operands()
1748 else if (!integer_zerop (iv0->step) && integer_zerop (iv1->step)) in extract_cond_operands()
1759 *iv_bound = iv1; in extract_cond_operands()