Home
last modified time | relevance | path

Searched refs:widest_int (Results 1 – 25 of 52) sorted by relevance

123

/dragonfly/contrib/gcc-8.0/gcc/
H A Dtree-ssa-ccp.h22 void bit_value_binop (enum tree_code, signop, int, widest_int *, widest_int *,
23 signop, int, const widest_int &, const widest_int &,
24 signop, int, const widest_int &, const widest_int &);
26 void bit_value_unop (enum tree_code, signop, int, widest_int *, widest_int *,
27 signop, int, const widest_int &, const widest_int &);
H A Dtree-ssa-loop-niter.h36 extern bool estimated_loop_iterations (struct loop *, widest_int *);
38 extern bool max_loop_iterations (struct loop *, widest_int *);
40 extern bool likely_max_loop_iterations (struct loop *, widest_int *);
45 extern bool max_stmt_executions (struct loop *, widest_int *);
46 extern bool likely_max_stmt_executions (struct loop *, widest_int *);
47 extern bool estimated_stmt_executions (struct loop *, widest_int *);
H A Dcfgloop.h60 widest_int bound;
162 widest_int nb_iterations_upper_bound;
164 widest_int nb_iterations_likely_upper_bound;
169 widest_int nb_iterations_estimate;
848 extern void record_niter_bound (struct loop *, const widest_int &, bool, bool);
852 extern bool get_estimated_loop_iterations (struct loop *loop, widest_int *nit);
853 extern bool get_max_loop_iterations (const struct loop *loop, widest_int *nit);
854 extern bool get_likely_max_loop_iterations (struct loop *loop, widest_int *nit);
859 static inline widest_int
871 return widest_int::from_array (a, 2); in gcov_type_to_wide_int()
H A Dgimple-ssa-strength-reduction.c241 widest_int index;
335 widest_int incr;
896 static widest_int
1085 widest_int index; in create_mul_ssa_cand()
1293 widest_int index; in create_add_ssa_cand()
2081 static widest_int
2104 static inline widest_int
2788 widest_int diff; in record_phi_increments_1()
2885 widest_int diff; in phi_incr_cost_1()
3257 widest_int diff; in ncd_with_phi()
[all …]
H A Dtree-ssa-ccp.c172 widest_int mask;
247 static widest_int
551 void bit_value_binop (enum tree_code, signop, int, widest_int *, widest_int *,
552 signop, int, const widest_int &, const widest_int &,
553 signop, int, const widest_int &, const widest_int &);
558 static widest_int
1272 widest_int *val, widest_int *mask, in bit_value_unop()
1274 const widest_int &rval, const widest_int &rmask) in bit_value_unop()
1319 widest_int *val, widest_int *mask, in bit_value_binop()
1321 const widest_int &r1val, const widest_int &r1mask, in bit_value_binop()
[all …]
H A Dtree-affine.h37 widest_int coef;
69 void aff_combination_scale (aff_tree *, const widest_int &);
72 void aff_combination_add_elt (aff_tree *, tree, const widest_int &);
H A Dtree-ssa-loop-niter.c897 widest_int max; in number_of_iterations_ne_max()
2527 widest_int nit; in finite_loop_p()
2854 static widest_int
2869 static widest_int
2883 static widest_int
3576 const widest_int *d1 = (const widest_int *) p1; in wide_int_cmp()
3577 const widest_int *d2 = (const widest_int *) p2; in wide_int_cmp()
3585 bound_index (vec<widest_int> bounds, const widest_int &bound) in bound_index()
3983 widest_int nit; in estimated_loop_iterations_int()
4019 widest_int nit; in max_loop_iterations_int()
[all …]
H A Dtree-affine.c37 static widest_int
38 wide_int_ext_for_comb (const widest_int &cst, tree type) in wide_int_ext_for_comb()
89 aff_combination_scale (aff_tree *comb, const widest_int &scale_in) in aff_combination_scale()
93 widest_int scale = wide_int_ext_for_comb (scale_in, comb->type); in aff_combination_scale()
106 widest_int new_coef in aff_combination_scale()
139 aff_combination_add_elt (aff_tree *comb, tree elt, const widest_int &scale_in) in aff_combination_add_elt()
144 widest_int scale = wide_int_ext_for_comb (scale_in, comb->type); in aff_combination_add_elt()
151 widest_int new_coef in aff_combination_add_elt()
452 widest_int scale = wide_int_ext_for_comb (scale_in, type); in add_elt_to_tree()
571 aff_combination_add_product (aff_tree *c, const widest_int &coef, tree val, in aff_combination_add_product()
[all …]
H A Dpoly-int-types.h29 typedef poly_int_pod<NUM_POLY_INT_COEFFS, widest_int> poly_widest_int_pod;
37 typedef poly_int<NUM_POLY_INT_COEFFS, widest_int> poly_widest_int;
H A Dhooks.h73 extern bool hook_bool_wint_wint_uint_bool_true (const widest_int &,
74 const widest_int &,
H A Dhooks.c367 hook_bool_wint_wint_uint_bool_true (const widest_int &, const widest_int &, in hook_bool_wint_wint_uint_bool_true() argument
H A Dipa-prop.h150 widest_int value;
154 widest_int mask;
729 ipa_bits *ipa_get_ipa_bits_for_value (const widest_int &value,
730 const widest_int &mask);
H A Ddata-streamer-in.c205 widest_int
214 return widest_int::from_array (a, len); in streamer_read_widest_int()
H A Dloop-doloop.c420 widest_int iterations; in doloop_modify()
470 wi::set_bit_in_zero <widest_int> in doloop_modify()
611 widest_int iterations, iterations_max; in doloop_optimize()
665 iterations = widest_int::from (rtx_mode_t (desc->niter_expr, mode), in doloop_optimize()
H A Dipa-cp.c281 bool set_to_constant (widest_int, widest_int);
289 bool meet_with (widest_int, widest_int, unsigned);
299 widest_int m_value, m_mask;
301 bool meet_with_1 (widest_int, widest_int, unsigned);
302 void get_value_and_mask (tree, widest_int *, widest_int *);
998 ipcp_bits_lattice::set_to_constant (widest_int value, widest_int mask) in set_to_constant()
1010 ipcp_bits_lattice::get_value_and_mask (tree operand, widest_int *valuep, widest_int *maskp) in get_value_and_mask()
1032 ipcp_bits_lattice::meet_with_1 (widest_int value, widest_int mask, in meet_with_1()
1037 widest_int old_mask = m_mask; in meet_with_1()
1050 ipcp_bits_lattice::meet_with (widest_int value, widest_int mask, in meet_with()
[all …]
H A Dtree-ssa-loop.h53 widest_int max; /* The upper bound on the number of iterations of
H A Ddata-streamer.h73 void streamer_write_widest_int (struct output_block *, const widest_int &);
87 widest_int streamer_read_widest_int (struct lto_input_block *);
H A Dwide-int.cc2203 void gt_ggc_mx (widest_int *) { } in gt_ggc_mx() argument
2204 void gt_pch_nx (widest_int *, void (*) (void *, void *), void *) { } in gt_pch_nx() argument
2205 void gt_pch_nx (widest_int *) { } in gt_pch_nx() argument
2211 template void widest_int::dump () const;
2233 debug (const widest_int &ref) in debug()
2239 debug (const widest_int *ptr) in debug()
2282 widest_int
2285 return widest_int (i); in from_int()
2322 assert_hexeq ("0xffffffffffffffff", wi::mask <widest_int> (64, false)); in test_printing()
2505 run_all_wide_int_tests <widest_int> (); in wide_int_cc_tests()
H A Dtarghooks.h260 extern bool can_use_doloop_if_innermost (const widest_int &,
261 const widest_int &,
H A Dcfgloop.c1858 record_niter_bound (struct loop *loop, const widest_int &i_bound, in record_niter_bound()
1911 widest_int nit; in get_estimated_loop_iterations_int()
1967 get_estimated_loop_iterations (struct loop *loop, widest_int *nit) in get_estimated_loop_iterations()
1991 get_max_loop_iterations (const struct loop *loop, widest_int *nit) in get_max_loop_iterations()
2007 widest_int nit; in get_max_loop_iterations_int()
2025 get_likely_max_loop_iterations (struct loop *loop, widest_int *nit) in get_likely_max_loop_iterations()
2041 widest_int nit; in get_likely_max_loop_iterations_int()
H A Dvr-values.c1008 widest_int wmin, wmax; in check_for_binary_op_overflow()
1009 widest_int w[4]; in check_for_binary_op_overflow()
1017 widest_int wt; in check_for_binary_op_overflow()
1045 widest_int wtmin = wi::to_widest (vrp_val_min (type)); in check_for_binary_op_overflow()
1046 widest_int wtmax = wi::to_widest (vrp_val_max (type)); in check_for_binary_op_overflow()
1772 widest_int nit; in adjust_range_with_scev()
1782 widest_int wtmp = wi::mul (wi::to_widest (step), nit, sgn, in adjust_range_with_scev()
3422 widest_int tem; in range_fits_type_p()
3822 innermin = widest_int::from (imin, TYPE_SIGN (TREE_TYPE (innerop))); in simplify_conversion_using_ranges()
3823 innermax = widest_int::from (imax, TYPE_SIGN (TREE_TYPE (innerop))); in simplify_conversion_using_ranges()
[all …]
H A Ddata-streamer-out.c394 const widest_int &w) in streamer_write_widest_int()
H A Dtree-chrec.c540 widest_int num = wi::to_widest (n); in tree_fold_binomial()
547 widest_int denom = 2; in tree_fold_binomial()
550 widest_int idx = num - 1; in tree_fold_binomial()
H A Dipa-prop.c1742 ipa_get_ipa_bits_for_value (const widest_int &value, const widest_int &mask) in ipa_get_ipa_bits_for_value()
1764 ipa_set_jfunc_bits (ipa_jump_func *jf, const widest_int &value, in ipa_set_jfunc_bits()
1765 const widest_int &mask) in ipa_set_jfunc_bits()
1916 widest_int::from (get_nonzero_bits (arg), in ipa_compute_jump_functions_for_edge()
1927 widest_int mask = wi::bit_and_not in ipa_compute_jump_functions_for_edge()
1928 (wi::mask<widest_int> (TYPE_PRECISION (TREE_TYPE (arg)), false), in ipa_compute_jump_functions_for_edge()
1930 widest_int value = bitpos / BITS_PER_UNIT; in ipa_compute_jump_functions_for_edge()
4224 widest_int value = streamer_read_widest_int (ib); in ipa_read_jump_function()
4225 widest_int mask = streamer_read_widest_int (ib); in ipa_read_jump_function()
/dragonfly/contrib/gcc-8.0/gcc/c-family/
H A Dc-lex.c47 (const widest_int &, unsigned int);
49 (const widest_int &, unsigned int);
645 narrowest_unsigned_type (const widest_int &val, unsigned int flags) in narrowest_unsigned_type()
673 narrowest_signed_type (const widest_int &val, unsigned int flags) in narrowest_signed_type()
718 widest_int wval = widest_int::from_array (ival, 3); in interpret_integer()

123