| /src/external/gpl3/gcc/dist/gcc/ |
| value-range-pretty-print.cc | 81 wide_int type_max = wi::max_value (TYPE_PRECISION (type), TYPE_SIGN (type)); local
88 else if (bound == type_max && TYPE_PRECISION (type) != 1)
|
| value-range-pretty-print.cc | 81 wide_int type_max = wi::max_value (TYPE_PRECISION (type), TYPE_SIGN (type)); local
88 else if (bound == type_max && TYPE_PRECISION (type) != 1)
|
| tree-scalar-evolution.cc | 3065 wide_int base_min, base_max, step_min, step_max, type_min, type_max;
3094 type_max = wi::max_value (type);
3099 && wi::le_p (base_max, type_max, sgn));
3113 /* If step can be positive, check that nit*step <= type_max-base.
3121 type_max - base_max)
3058 wide_int base_min, base_max, step_min, step_max, type_min, type_max; local
|
| tree-scalar-evolution.cc | 3065 wide_int base_min, base_max, step_min, step_max, type_min, type_max;
3094 type_max = wi::max_value (type);
3099 && wi::le_p (base_max, type_max, sgn));
3113 /* If step can be positive, check that nit*step <= type_max-base.
3121 type_max - base_max)
3058 wide_int base_min, base_max, step_min, step_max, type_min, type_max; local
|
| value-range.cc | 1012 wrapping range with MAX < MIN covering [MIN, type_max] U [type_min, MAX]
1763 wide_int type_max = wi::max_value (prec, sign); local
1817 if (type_max != orig_range.m_base[i])
1821 m_base[nitems++] = type_max;
|
| value-range.cc | 1012 wrapping range with MAX < MIN covering [MIN, type_max] U [type_min, MAX]
1763 wide_int type_max = wi::max_value (prec, sign); local
1817 if (type_max != orig_range.m_base[i])
1821 m_base[nitems++] = type_max;
|
| gimple-ssa-sprintf.cc | 1092 HOST_WIDE_INT type_max = tree_to_uhwi (TYPE_MAX_VALUE (argtype));
1105 and its upper bound is in excess of TYPE_MAX. In
1108 knownrange = type_min < *pmin || *pmax < type_max;
1758 /* Compute the upper bound for -TYPE_MAX. */
|
| tree-parloops.cc | 2582 widest_int type_max = wi::to_widest (TYPE_MAX_VALUE (nit_type));
2583 if (nit_max >= type_max)
|
| gimple-ssa-sprintf.cc | 1092 HOST_WIDE_INT type_max = tree_to_uhwi (TYPE_MAX_VALUE (argtype));
1105 and its upper bound is in excess of TYPE_MAX. In
1108 knownrange = type_min < *pmin || *pmax < type_max;
1758 /* Compute the upper bound for -TYPE_MAX. */
|
| tree-parloops.cc | 2582 widest_int type_max = wi::to_widest (TYPE_MAX_VALUE (nit_type));
2583 if (nit_max >= type_max)
|
| tree-vect-loop.cc | 11166 widest_int type_max = widest_int::from (wi::max_value (type), sgn); local
11167 if (max < type_max)
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| value-range.cc | 263 wrapping range with MAX < MIN covering [MIN, type_max] U [type_min, MAX]
1858 wide_int type_max = wi::max_value (prec, sign); local
1907 if (type_max != wi::to_wide (orig_range.m_base[i]))
1911 m_base[nitems++] = wide_int_to_tree (ttype, type_max);
1930 wide_int type_max = wi::max_value (TYPE_PRECISION (type), TYPE_SIGN (type)); local
1939 && wi::to_wide (bound) == type_max
2077 tree type_max = vrp_val_max (TREE_TYPE (val)); local
2078 return (val == type_max
2079 || (type_max != NULL_TREE
2080 && operand_equal_p (val, type_max, 0)))
[all...] |
| value-range.cc | 263 wrapping range with MAX < MIN covering [MIN, type_max] U [type_min, MAX]
1858 wide_int type_max = wi::max_value (prec, sign); local
1907 if (type_max != wi::to_wide (orig_range.m_base[i]))
1911 m_base[nitems++] = wide_int_to_tree (ttype, type_max);
1930 wide_int type_max = wi::max_value (TYPE_PRECISION (type), TYPE_SIGN (type)); local
1939 && wi::to_wide (bound) == type_max
2077 tree type_max = vrp_val_max (TREE_TYPE (val)); local
2078 return (val == type_max
2079 || (type_max != NULL_TREE
2080 && operand_equal_p (val, type_max, 0)))
[all...] |
| tree-scalar-evolution.cc | 3039 wide_int base_min, base_max, step_min, step_max, type_min, type_max;
3066 type_max = wi::max_value (type);
3071 && wi::le_p (base_max, type_max, sgn));
3085 /* If step can be positive, check that nit*step <= type_max-base.
3093 type_max - base_max)
3032 wide_int base_min, base_max, step_min, step_max, type_min, type_max; local
|
| tree-scalar-evolution.cc | 3039 wide_int base_min, base_max, step_min, step_max, type_min, type_max;
3066 type_max = wi::max_value (type);
3071 && wi::le_p (base_max, type_max, sgn));
3085 /* If step can be positive, check that nit*step <= type_max-base.
3093 type_max - base_max)
3032 wide_int base_min, base_max, step_min, step_max, type_min, type_max; local
|
| tree-vrp.cc | 688 wide_int type_max = wi::max_value (prec, sgn); local
693 min = wide_int_to_tree (type, type_max);
700 max = wide_int_to_tree (type, type_max);
|
| tree-vrp.cc | 688 wide_int type_max = wi::max_value (prec, sgn); local
693 min = wide_int_to_tree (type, type_max);
700 max = wide_int_to_tree (type, type_max);
|
| gimple-ssa-sprintf.cc | 1090 HOST_WIDE_INT type_max = tree_to_uhwi (TYPE_MAX_VALUE (argtype));
1103 and its upper bound is in excess of TYPE_MAX. In
1106 knownrange = type_min < *pmin || *pmax < type_max;
1747 /* Compute the upper bound for -TYPE_MAX. */
|
| tree-parloops.cc | 2581 widest_int type_max = wi::to_widest (TYPE_MAX_VALUE (nit_type));
2582 if (nit_max >= type_max)
|
| gimple-ssa-sprintf.cc | 1090 HOST_WIDE_INT type_max = tree_to_uhwi (TYPE_MAX_VALUE (argtype));
1103 and its upper bound is in excess of TYPE_MAX. In
1106 knownrange = type_min < *pmin || *pmax < type_max;
1747 /* Compute the upper bound for -TYPE_MAX. */
|
| tree-parloops.cc | 2581 widest_int type_max = wi::to_widest (TYPE_MAX_VALUE (nit_type));
2582 if (nit_max >= type_max)
|
| tree-vect-loop.cc | 9169 widest_int type_max = widest_int::from (wi::max_value (type), sgn); local
9170 if (max < type_max)
|
| tree-vect-loop.cc | 9169 widest_int type_max = widest_int::from (wi::max_value (type), sgn); local
9170 if (max < type_max)
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/sys/linux/ |
| perf_event.d | 2484 assert(v <= type_max, "Value is greater than the maximum value of bitfield 'type'");
2491 enum ulong type_max = cast(ulong) 15U;
|
| perf_event.d | 2484 assert(v <= type_max, "Value is greater than the maximum value of bitfield 'type'");
2491 enum ulong type_max = cast(ulong) 15U;
|
