HomeSort by: relevance | last modified time | path
    Searched defs:vr0max (Results 1 - 3 of 3) sorted by relevancy

  /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,
752 bool maxeq = vrp_operand_equal_p (*vr0max, vr1max);
769 *vr0max = NULL_TREE;
774 else if (operand_less_p (*vr0max, vr1min) == 1
789 *vr0max = vr1max;
796 *vr0max = NULL_TREE;
802 if (TREE_CODE (*vr0max) == INTEGER_CS
1097 tree vr0max = vr0->max (); local
1418 tree vr0max = vr0->max (); local
    [all...]
vr-values.cc 1078 tree vr0min = vr0.min (), vr0max = vr0.max (); local
1082 || TREE_OVERFLOW (vr0max))
1085 vr0max = vrp_val_max (TREE_TYPE (op0));
1096 if (arith_overflowed_p (subcode, type, vr0max,
1102 || arith_overflowed_p (subcode, type, vr0max, vr1min) != *ovf)
1116 w[1] = wi::to_widest (vr0max);
  /src/external/gpl3/gcc/dist/gcc/
vr-values.cc 95 tree vr0max = wide_int_to_tree (TREE_TYPE (op0), vr0.upper_bound ()); local
101 if (arith_overflowed_p (subcode, type, vr0max,
107 || arith_overflowed_p (subcode, type, vr0max, vr1min) != *ovf)

Completed in 18 milliseconds