Searched refs:vr0min (Results 1 - 4 of 4) sorted by relevance
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | value-range.cc | 606 tree *vr0min, tree *vr0max, 610 bool mineq = vrp_operand_equal_p (*vr0min, vr1min); 627 *vr0min = NULL_TREE; 634 || operand_less_p (vr1max, *vr0min) == 1) 647 *vr0min = vr1min; 654 *vr0min = NULL_TREE; 668 && TREE_CODE (*vr0min) == INTEGER_CST 669 && operand_less_p (vr1max, *vr0min) == 1 671 *vr0min, vr1max))) 672 *vr0min 605 intersect_ranges(enum value_range_kind *vr0type, tree *vr0min, tree *vr0max, enum value_range_kind vr1type, tree vr1min, tree vr1max) argument 947 tree vr0min = vr0->min (); local 974 union_ranges(enum value_range_kind *vr0type, tree *vr0min, tree *vr0max, enum value_range_kind vr1type, tree vr1min, tree vr1max) argument 1259 tree vr0min = vr0->min (); local [all...] |
H A D | vr-values.c | 1024 tree vr0min = vr0.min (), vr0max = vr0.max (); local 1027 || TREE_OVERFLOW (vr0min) 1030 vr0min = vrp_val_min (TREE_TYPE (op0)); 1040 *ovf = arith_overflowed_p (subcode, type, vr0min, 1047 if (arith_overflowed_p (subcode, type, vr0min, vr1max) != *ovf 1061 w[0] = wi::to_widest (vr0min);
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | value-range.cc | 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_CST 810 && operand_less_p (vr1max, *vr0min) == 1 812 *vr0min, vr1max))) 813 *vr0min 746 intersect_ranges(enum value_range_kind *vr0type, tree *vr0min, tree *vr0max, enum value_range_kind vr1type, tree vr1min, tree vr1max) argument 1096 tree vr0min = vr0->min (); local 1121 union_ranges(enum value_range_kind *vr0type, tree *vr0min, tree *vr0max, enum value_range_kind vr1type, tree vr1min, tree vr1max) argument 1417 tree vr0min = vr0->min (); local [all...] |
H A D | 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);
|
Completed in 189 milliseconds