Home
last modified time | relevance | path

Searched refs:wide_int_to_tree (Results 1 – 25 of 154) sorted by relevance

1234567

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dvalue-range.cc241 m_base[1] = wide_int_to_tree (type, lim1); in irange_set_anti_range()
249 m_base[m_num_ranges * 2] = wide_int_to_tree (type, lim2); in irange_set_anti_range()
424 t = wide_int_to_tree (typ, wi::to_wide (max ()) + 1); in legacy_lower_bound()
453 t = wide_int_to_tree (typ, wi::to_wide (min ()) - 1); in legacy_upper_bound()
723 tree n = wide_int_to_tree (ttype, wi::to_wide (max ()) + 1); in normalize_symbolics()
733 tree n = wide_int_to_tree (ttype, wi::to_wide (min ()) - 1); in normalize_symbolics()
1774 m_base[bld_index * 2] = wide_int_to_tree (range_type, lb); in intersect()
1782 m_base[bld_index++ * 2 + 1] = wide_int_to_tree (range_type, ub); in intersect()
1863 m_base[1] = wide_int_to_tree (ttype, type_max); in invert()
1885 m_base[nitems++] = wide_int_to_tree (ttype, type_min); in invert()
[all …]
H A Dvalue-range.h440 tree min = wide_int_to_tree (type, wmin); in int_range()
441 tree max = wide_int_to_tree (type, wmax); in int_range()
493 m_base[0] = wide_int_to_tree (type, min); in set_varying()
494 m_base[1] = wide_int_to_tree (type, max); in set_varying()
628 return wide_int_to_tree (const_cast<tree> (type), max); in vrp_val_max()
H A Dtree-affine.cc133 wide_int_to_tree (type, scale)); in aff_combination_scale()
190 wide_int_to_tree (type, scale)); in aff_combination_add_elt()
509 return fold_build2 (MULT_EXPR, type, elt, wide_int_to_tree (type, scale)); in add_elt_to_tree()
519 elt = fold_build2 (MULT_EXPR, type, elt, wide_int_to_tree (type, scale)); in add_elt_to_tree()
565 expr = add_elt_to_tree (expr, type, wide_int_to_tree (type, off), sgn); in aff_combination_to_tree()
649 tree offset = wide_int_to_tree (TREE_TYPE (val), c->offset); in aff_combination_add_product()
678 tree offset = wide_int_to_tree (c2->type, c2->offset); in aff_combination_mult()
H A Dtree-vrp.cc645 min = wide_int_to_tree (type, tmin); in set_value_range_with_overflow()
646 max = wide_int_to_tree (type, tmax); in set_value_range_with_overflow()
672 min = wide_int_to_tree (type, tmin); in set_value_range_with_overflow()
673 max = wide_int_to_tree (type, tmax); in set_value_range_with_overflow()
691 min = wide_int_to_tree (type, type_min); in set_value_range_with_overflow()
693 min = wide_int_to_tree (type, type_max); in set_value_range_with_overflow()
695 min = wide_int_to_tree (type, wmin); in set_value_range_with_overflow()
698 max = wide_int_to_tree (type, type_min); in set_value_range_with_overflow()
700 max = wide_int_to_tree (type, type_max); in set_value_range_with_overflow()
702 max = wide_int_to_tree (type, wmax); in set_value_range_with_overflow()
[all …]
H A Dtree-vector-builder.cc33 return wide_int_to_tree (TREE_TYPE (base), in apply_step()
H A Dtree-ssa-address.cc529 parts->step = wide_int_to_tree (sizetype, addr->elts[i].coef); in move_variant_to_index()
683 parts->step = wide_int_to_tree (sizetype, best_mult); in most_expensive_mult_to_index()
712 parts->offset = wide_int_to_tree (sizetype, addr->offset); in addr_to_parts()
742 wide_int_to_tree (sizetype, addr->elts[i].coef)); in addr_to_parts()
1164 parts.step = wide_int_to_tree (sizetype, fact); in preferred_mem_scale_factor()
H A Dvalue-query.cc283 r.set (wide_int_to_tree (type, ri->get_min ()), in get_ssa_name_range_info()
284 wide_int_to_tree (type, ri->get_max ()), in get_ssa_name_range_info()
H A Dtree-ssa-phiopt.cc803 tree arg = wide_int_to_tree (type, a); in two_value_replacement()
1783 rhs = wide_int_to_tree (TREE_TYPE (rhs), in minmax_replacement()
1789 rhs = wide_int_to_tree (TREE_TYPE (rhs), in minmax_replacement()
1814 alt_larger = wide_int_to_tree (TREE_TYPE (larger), alt); in minmax_replacement()
1823 alt_larger = wide_int_to_tree (TREE_TYPE (larger), alt); in minmax_replacement()
1843 alt_smaller = wide_int_to_tree (TREE_TYPE (smaller), alt); in minmax_replacement()
1851 alt_smaller = wide_int_to_tree (TREE_TYPE (smaller), alt); in minmax_replacement()
1886 smaller = wide_int_to_tree (TREE_TYPE (op1), w1); in minmax_replacement()
1887 alt_smaller = wide_int_to_tree (TREE_TYPE (op1), w2); in minmax_replacement()
1893 larger = wide_int_to_tree (TREE_TYPE (op1), w1); in minmax_replacement()
[all …]
H A Dmatch.pd481 (div @0 { wide_int_to_tree (type, mul); })
498 (mult @0 { wide_int_to_tree (type, mul); }))))
738 (bit_and @0 { wide_int_to_tree
941 { wide_int_to_tree (type,
2194 (outer_op @2 { wide_int_to_tree (type, cst_emit); })
2196 (inner_op @2 { wide_int_to_tree (type, cst_emit); }))))))
2237 (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), ~wi::to_wide (@1)); }
2289 wide_int_to_tree (ptr_type_node, wi::neg (wi::to_wide (@1)))),
2306 { wide_int_to_tree (type, (wi::to_wide (@1)
2671 (neg_inner_op @0 { wide_int_to_tree (type, wi::to_wide (cst)); })
[all …]
H A Dtree-ssa-loop-niter.cc1496 tree last = wide_int_to_tree (type, min + wi::to_wide (step) - 1); in number_of_iterations_until_wrap()
1502 wide_int_to_tree (niter_type, max), in number_of_iterations_until_wrap()
1534 tree last = wide_int_to_tree (type, max - wi::to_wide (step) + 1); in number_of_iterations_until_wrap()
1541 wide_int_to_tree (niter_type, min)); in number_of_iterations_until_wrap()
2202 wide_int_to_tree (sizetype, in expand_simple_operations()
3410 wide_int_to_tree (type, cst)); in derive_constant_upper_bound_ops()
3665 base = wide_int_to_tree (unsigned_type, max); in record_nonwrapping_iv()
3687 base = wide_int_to_tree (unsigned_type, min); in record_nonwrapping_iv()
3955 low = wide_int_to_tree (type, r.lower_bound ()); in infer_loop_bounds_from_signedness()
3956 high = wide_int_to_tree (type, r.upper_bound ()); in infer_loop_bounds_from_signedness()
[all …]
H A Drange-op.cc331 tree tree_min = wide_int_to_tree (type, tmin); in value_range_from_overflowed_bounds()
332 tree tree_max = wide_int_to_tree (type, tmax); in value_range_from_overflowed_bounds()
374 r.set (wide_int_to_tree (type, tmin), in value_range_with_overflow()
375 wide_int_to_tree (type, tmax)); in value_range_with_overflow()
413 r.set (wide_int_to_tree (type, new_lb), in value_range_with_overflow()
414 wide_int_to_tree (type, new_ub)); in value_range_with_overflow()
432 r.set (wide_int_to_tree (type, new_lb), wide_int_to_tree (type, new_ub)); in create_possibly_reversed_range()
3862 tree val = wide_int_to_tree (type, rh_lb); in wi_fold()
4165 tree maxint = wide_int_to_tree (integer_type_node, r0.upper_bound ()); in range_op_cast_tests()
4170 tree minshort = wide_int_to_tree (short_integer_type_node, r0.lower_bound ()); in range_op_cast_tests()
[all …]
H A Dtree-ssa-dse.cc583 *countp = wide_int_to_tree (TREE_TYPE (*countp), (TREE_INT_CST_LOW (*countp) in decrement_count()
691 tree arg = wide_int_to_tree (TREE_TYPE (size), in maybe_trim_memstar_call()
726 tree arg = wide_int_to_tree (TREE_TYPE (size), in maybe_trim_memstar_call()
H A Dpointer-query.cc427 range[0] = wide_int_to_tree (exptype, min); in get_size_range()
428 range[1] = wide_int_to_tree (exptype, max); in get_size_range()
540 return wide_int_to_tree (sizetype, rng1[1]); in gimple_call_alloc_size()
2361 return wide_int_to_tree (sizetype, maxsize); in compute_objsize()
2394 *poff = wide_int_to_tree (ptrdiff_type_node, ref.offrng[ref.offrng[0] < 0]); in compute_objsize()
H A Dtree-switch-conversion.cc617 wide_int_to_tree (type, coeff_a), tmp); in build_one_array()
619 wide_int_to_tree (type, coeff_b)); in build_one_array()
1575 minval = wide_int_to_tree (index_type, min); in emit()
1581 minval = wide_int_to_tree (index_type, min); in emit()
1585 maxval = wide_int_to_tree (index_type, max); in emit()
1674 tmp = wide_int_to_tree (word_type_node, test[k].mask); in emit()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-affine.c132 wide_int_to_tree (type, scale)); in aff_combination_scale()
189 wide_int_to_tree (type, scale)); in aff_combination_add_elt()
357 op1 = wide_int_to_tree (itype, -wi::to_wide (op1));
500 return fold_build2 (MULT_EXPR, type, elt, wide_int_to_tree (type, scale)); in add_elt_to_tree()
510 elt = fold_build2 (MULT_EXPR, type, elt, wide_int_to_tree (type, scale)); in add_elt_to_tree()
556 expr = add_elt_to_tree (expr, type, wide_int_to_tree (type, off), sgn); in aff_combination_to_tree()
640 tree offset = wide_int_to_tree (TREE_TYPE (val), c->offset); in aff_combination_add_product()
669 tree offset = wide_int_to_tree (c2->type, c2->offset); in aff_combination_mult()
H A Dvalue-range.cc44 tree min = wide_int_to_tree (type, wmin); in value_range()
45 tree max = wide_int_to_tree (type, wmax); in value_range()
336 t = wide_int_to_tree (typ, wi::to_wide (m_max) + 1); in lower_bound()
367 t = wide_int_to_tree (typ, wi::to_wide (m_min) - 1); in upper_bound()
582 tree n = wide_int_to_tree (ttype, wi::to_wide (max ()) + 1); in normalize_symbolics()
592 tree n = wide_int_to_tree (ttype, wi::to_wide (min ()) - 1); in normalize_symbolics()
1475 wide_int_to_tree (type, wi::to_wide (ar->min ()) - 1)); in ranges_from_anti_range()
1477 vr1->set (wide_int_to_tree (type, wi::to_wide (ar->max ()) + 1), in ranges_from_anti_range()
1506 return wide_int_to_tree (const_cast<tree> (type), max); in vrp_val_max()
H A Dtree-vector-builder.c33 return wide_int_to_tree (TREE_TYPE (base), in apply_step()
H A Dtree-vrp.c826 min = wide_int_to_tree (type, tmin); in set_value_range_with_overflow()
827 max = wide_int_to_tree (type, tmax); in set_value_range_with_overflow()
853 min = wide_int_to_tree (type, tmin); in set_value_range_with_overflow()
854 max = wide_int_to_tree (type, tmax); in set_value_range_with_overflow()
872 min = wide_int_to_tree (type, type_min); in set_value_range_with_overflow()
874 min = wide_int_to_tree (type, type_max); in set_value_range_with_overflow()
876 min = wide_int_to_tree (type, wmin); in set_value_range_with_overflow()
879 max = wide_int_to_tree (type, type_min); in set_value_range_with_overflow()
881 max = wide_int_to_tree (type, type_max); in set_value_range_with_overflow()
883 max = wide_int_to_tree (type, wmax); in set_value_range_with_overflow()
[all …]
H A Dtree-ssa-address.c529 parts->step = wide_int_to_tree (sizetype, addr->elts[i].coef); in move_variant_to_index()
683 parts->step = wide_int_to_tree (sizetype, best_mult); in most_expensive_mult_to_index()
712 parts->offset = wide_int_to_tree (sizetype, addr->offset); in addr_to_parts()
742 wide_int_to_tree (sizetype, addr->elts[i].coef)); in addr_to_parts()
1154 parts.step = wide_int_to_tree (sizetype, fact); in preferred_mem_scale_factor()
H A Dtree-ssa-dse.c424 *countp = wide_int_to_tree (TREE_TYPE (*countp), (TREE_INT_CST_LOW (*countp) in decrement_count()
532 tree arg = wide_int_to_tree (TREE_TYPE (size), in maybe_trim_memstar_call()
567 tree arg = wide_int_to_tree (TREE_TYPE (size), in maybe_trim_memstar_call()
H A Dtree-ssa-phiopt.c721 tree arg = wide_int_to_tree (type, a); in two_value_replacement()
1400 rhs = wide_int_to_tree (TREE_TYPE (rhs), in minmax_replacement()
1406 rhs = wide_int_to_tree (TREE_TYPE (rhs), in minmax_replacement()
1431 alt_larger = wide_int_to_tree (TREE_TYPE (larger), alt); in minmax_replacement()
1440 alt_larger = wide_int_to_tree (TREE_TYPE (larger), alt); in minmax_replacement()
1460 alt_smaller = wide_int_to_tree (TREE_TYPE (smaller), alt); in minmax_replacement()
1468 alt_smaller = wide_int_to_tree (TREE_TYPE (smaller), alt); in minmax_replacement()
H A Dmatch.pd378 (div @0 { wide_int_to_tree (type, mul); })
395 (mult @0 { wide_int_to_tree (type, mul); }))))
619 (bit_and @0 { wide_int_to_tree
1798 (outer_op @2 { wide_int_to_tree (type, cst_emit); })
1800 (inner_op @2 { wide_int_to_tree (type, cst_emit); }))))))
1836 (with { tree algn = wide_int_to_tree (TREE_TYPE (@0), ~wi::to_wide (@1)); }
1873 wide_int_to_tree (ptr_type_node, wi::neg (wi::to_wide (@1)))),
1890 { wide_int_to_tree (type, (wi::to_wide (@1)
2241 (neg_inner_op @0 { wide_int_to_tree (type, wi::to_wide (cst)); })
2315 (convert (plus @0 { wide_int_to_tree (TREE_TYPE (@0), w1); } )))
[all …]
H A Dtree-ssanames.c456 min = wide_int_to_tree (TREE_TYPE (name), wmin); in get_range_info()
457 max = wide_int_to_tree (TREE_TYPE (name), wmax); in get_range_info()
/netbsd-src/external/gpl3/gcc/dist/gcc/fortran/
H A Dtrans-const.cc206 return wide_int_to_tree (gfc_get_int_type (kind), val); in gfc_conv_mpz_to_tree()
217 return wide_int_to_tree (type, val); in gfc_conv_mpz_to_tree_type()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/fortran/
H A Dtrans-const.c206 return wide_int_to_tree (gfc_get_int_type (kind), val); in gfc_conv_mpz_to_tree()
217 return wide_int_to_tree (type, val); in gfc_conv_mpz_to_tree_type()

1234567