| /src/external/gpl3/gcc/dist/gcc/ |
| tree-vrp.cc | 625 if (known_eq (wi::to_poly_widest (val1),
626 wi::to_poly_widest (val2)))
628 if (known_lt (wi::to_poly_widest (val1),
629 wi::to_poly_widest (val2)))
631 if (known_gt (wi::to_poly_widest (val1),
632 wi::to_poly_widest (val2)))
|
| tree-affine.cc | 447 aff_combination_add_cst (comb, wi::to_poly_widest (mem_offset));
471 aff_combination_const (comb, type, wi::to_poly_widest (expr));
|
| tree-data-ref.cc | 1602 return compare_sizes_for_sort (wi::to_poly_widest (t1),
1603 wi::to_poly_widest (t2));
3010 && !ranges_maybe_overlap_p (wi::to_poly_widest (DR_INIT (a)),
3011 wi::to_poly_widest (tree_size_a),
3012 wi::to_poly_widest (DR_INIT (b)),
3013 wi::to_poly_widest (tree_size_b)))
|
| tree-loop-distribution.cc | 1272 if (aff_comb_cannot_overlap_p (&asrc, wi::to_poly_widest (nb_bytes),
1273 wi::to_poly_widest (nb_bytes)))
|
| tree-predcom.cc | 818 aff_combination_const (&delta, type, wi::to_poly_widest (DR_INIT (dr)));
|
| fold-const.cc | 1226 if (known_le (wi::to_poly_widest (arg1), wi::to_poly_widest (arg2)))
1231 else if (known_le (wi::to_poly_widest (arg2), wi::to_poly_widest (arg1)))
14708 return multiple_p (wi::to_poly_widest (top),
14709 wi::to_poly_widest (bottom));
|
| gimple-fold.cc | 5488 if (maybe_ne (wi::to_poly_widest (basic_len) + wi::to_widest (bias),
8249 && known_eq (wi::to_poly_widest (TYPE_SIZE (type)), size)
8250 && known_eq (wi::to_poly_widest (TYPE_SIZE (TREE_TYPE (ctor))), size))
|
| tree-ssa-loop-ivopts.cc | 2203 && constant_multiple_p (wi::to_poly_widest (top),
2204 wi::to_poly_widest (bot), mul))
|
| tree.h | 6320 tree_to_poly_widest_ref to_poly_widest (const_tree);
6534 wi::to_poly_widest (const_tree t) function in class:wi
|
| varasm.cc | 3075 * wi::to_poly_widest (TREE_OPERAND (target, 1)).force_shwi ());
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-affine.cc | 447 aff_combination_add_cst (comb, wi::to_poly_widest (mem_offset));
471 aff_combination_const (comb, type, wi::to_poly_widest (expr));
|
| tree-vrp.cc | 457 if (known_eq (wi::to_poly_widest (val1),
458 wi::to_poly_widest (val2)))
460 if (known_lt (wi::to_poly_widest (val1),
461 wi::to_poly_widest (val2)))
463 if (known_gt (wi::to_poly_widest (val1),
464 wi::to_poly_widest (val2)))
|
| tree-loop-distribution.cc | 1234 if (aff_comb_cannot_overlap_p (&asrc, wi::to_poly_widest (nb_bytes),
1235 wi::to_poly_widest (nb_bytes)))
|
| tree-predcom.cc | 818 aff_combination_const (&delta, type, wi::to_poly_widest (DR_INIT (dr)));
|
| tree-data-ref.cc | 1589 return compare_sizes_for_sort (wi::to_poly_widest (t1),
1590 wi::to_poly_widest (t2));
|
| tree.h | 6023 tree_to_poly_widest_ref to_poly_widest (const_tree);
6222 wi::to_poly_widest (const_tree t) function in class:wi
|
| tree-ssa-loop-ivopts.cc | 2198 && constant_multiple_p (wi::to_poly_widest (top),
2199 wi::to_poly_widest (bot), mul))
|
| varasm.cc | 3041 * wi::to_poly_widest (TREE_OPERAND (target, 1)).force_shwi ());
|
| fold-const.cc | 14330 return multiple_p (wi::to_poly_widest (top),
14331 wi::to_poly_widest (bottom));
|
| /src/external/gpl3/gcc/dist/gcc/config/riscv/ |
| riscv.cc | 10264 = constant_lower_bound (wi::to_poly_widest (TYPE_SIZE (type)));
|
| /src/external/gpl3/gcc.old/dist/gcc/config/aarch64/ |
| aarch64.cc | 3143 poly_widest_int wide_bytepos = exact_div (wi::to_poly_widest (bitpos),
21960 = constant_lower_bound (wi::to_poly_widest (TYPE_SIZE (type)));
|
| /src/external/gpl3/gcc/dist/gcc/config/aarch64/ |
| aarch64.cc | 1136 poly_widest_int wide_bytepos = exact_div (wi::to_poly_widest (bitpos),
23572 = constant_lower_bound (wi::to_poly_widest (TYPE_SIZE (type)));
|
