| /src/external/gpl3/gcc.old/dist/gcc/ |
| value-range.cc | 740 /* Intersect the two value-ranges { *VR0TYPE, *VR0MIN, *VR0MAX } and
741 { VR1TYPE, VR0MIN, VR0MAX } and store the result
742 in { *VR0TYPE, *VR0MIN, *VR0MAX }. This may not be the smallest
747 tree *vr0min, tree *vr0max,
751 bool mineq = vrp_operand_equal_p (*vr0min, vr1min);
768 *vr0min = NULL_TREE;
775 || operand_less_p (vr1max, *vr0min) == 1)
788 *vr0min = vr1min;
795 *vr0min = NULL_TREE;
809 && TREE_CODE (*vr0min) == INTEGER_CS
1096 tree vr0min = vr0->min (); local
1417 tree vr0min = vr0->min (); local
[all...] |
| value-range.cc | 740 /* Intersect the two value-ranges { *VR0TYPE, *VR0MIN, *VR0MAX } and
741 { VR1TYPE, VR0MIN, VR0MAX } and store the result
742 in { *VR0TYPE, *VR0MIN, *VR0MAX }. This may not be the smallest
747 tree *vr0min, tree *vr0max,
751 bool mineq = vrp_operand_equal_p (*vr0min, vr1min);
768 *vr0min = NULL_TREE;
775 || operand_less_p (vr1max, *vr0min) == 1)
788 *vr0min = vr1min;
795 *vr0min = NULL_TREE;
809 && TREE_CODE (*vr0min) == INTEGER_CS
1096 tree vr0min = vr0->min (); local
1417 tree vr0min = vr0->min (); local
[all...] |
| vr-values.cc | 1078 tree vr0min = vr0.min (), vr0max = vr0.max (); local
1081 || TREE_OVERFLOW (vr0min)
1084 vr0min = vrp_val_min (TREE_TYPE (op0));
1094 *ovf = arith_overflowed_p (subcode, type, vr0min,
1101 if (arith_overflowed_p (subcode, type, vr0min, vr1max) != *ovf
1115 w[0] = wi::to_widest (vr0min);
|
| vr-values.cc | 1078 tree vr0min = vr0.min (), vr0max = vr0.max (); local
1081 || TREE_OVERFLOW (vr0min)
1084 vr0min = vrp_val_min (TREE_TYPE (op0));
1094 *ovf = arith_overflowed_p (subcode, type, vr0min,
1101 if (arith_overflowed_p (subcode, type, vr0min, vr1max) != *ovf
1115 w[0] = wi::to_widest (vr0min);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| vr-values.cc | 94 tree vr0min = wide_int_to_tree (TREE_TYPE (op0), vr0.lower_bound ()); local
99 *ovf = arith_overflowed_p (subcode, type, vr0min,
106 if (arith_overflowed_p (subcode, type, vr0min, vr1max) != *ovf
|
| vr-values.cc | 94 tree vr0min = wide_int_to_tree (TREE_TYPE (op0), vr0.lower_bound ()); local
99 *ovf = arith_overflowed_p (subcode, type, vr0min,
106 if (arith_overflowed_p (subcode, type, vr0min, vr1max) != *ovf
|
