From: Aldy Hernandez Date: Tue, 5 Nov 2019 16:37:28 +0000 (+0000) Subject: Fix indentation inconsistencies introduced by previous patch. X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=b00460cb14ef64b3bc5348eef94aa177c642d4b4;p=gcc.git Fix indentation inconsistencies introduced by previous patch. From-SVN: r277852 --- diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 18247e7e87e..436939fd990 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,12 @@ +2019-11-05 Aldy Hernandez + + * tree-vrp.c (value_range::value_range): Fix whitespace. + (defined_ranges_p): Same. + (range_fold_binary_symbolics_p): Same. + (value_range::intersect_helper): Same. + (value_range::union_helper): Same. + * tree-vrp.h (range_fold_binary_expr): Same. + 2019-11-04 Martin Sebor PR middle-end/92341 diff --git a/gcc/tree-vrp.c b/gcc/tree-vrp.c index 940ed9cb7dc..64fb76bda62 100644 --- a/gcc/tree-vrp.c +++ b/gcc/tree-vrp.c @@ -135,10 +135,8 @@ value_range::value_range (tree type) set_varying (type); } -value_range::value_range (enum value_range_kind kind, - tree type, - const wide_int &wmin, - const wide_int &wmax) +value_range::value_range (enum value_range_kind kind, tree type, + const wide_int &wmin, const wide_int &wmax) { tree min = wide_int_to_tree (type, wmin); tree max = wide_int_to_tree (type, wmax); @@ -147,8 +145,7 @@ value_range::value_range (enum value_range_kind kind, } value_range::value_range (tree type, - const wide_int &wmin, - const wide_int &wmax) + const wide_int &wmin, const wide_int &wmax) { tree min = wide_int_to_tree (type, wmin); tree max = wide_int_to_tree (type, wmax); @@ -1743,8 +1740,7 @@ supported_types_p (value_range *vr, static bool defined_ranges_p (value_range *vr, - const value_range *vr0, - const value_range *vr1 = NULL) + const value_range *vr0, const value_range *vr1 = NULL) { if (vr0->undefined_p () && (!vr1 || vr1->undefined_p ())) { @@ -1770,8 +1766,7 @@ static bool range_fold_binary_symbolics_p (value_range *vr, tree_code code, tree expr_type, - const value_range *vr0, - const value_range *vr1) + const value_range *vr0, const value_range *vr1) { if (vr0->symbolic_p () || vr1->symbolic_p ()) { @@ -5830,8 +5825,7 @@ intersect_ranges (enum value_range_kind *vr0type, ranges. This may not be the smallest possible such range. */ value_range -value_range::intersect_helper (const value_range *vr0, - const value_range *vr1) +value_range::intersect_helper (const value_range *vr0, const value_range *vr1) { /* If either range is VR_VARYING the other one wins. */ if (vr1->varying_p ()) @@ -5944,8 +5938,7 @@ value_range_equiv::intersect (const value_range_equiv *other) smallest possible such range. */ value_range -value_range::union_helper (const value_range *vr0, - const value_range *vr1) +value_range::union_helper (const value_range *vr0, const value_range *vr1) { /* VR0 has the resulting range if VR1 is undefined or VR0 is varying. */ if (vr1->undefined_p () diff --git a/gcc/tree-vrp.h b/gcc/tree-vrp.h index ff01c2abd50..766fb635ab8 100644 --- a/gcc/tree-vrp.h +++ b/gcc/tree-vrp.h @@ -293,8 +293,7 @@ extern tree vrp_val_max (const_tree); void range_fold_unary_expr (value_range *, enum tree_code, tree type, const value_range *, tree op0_type); void range_fold_binary_expr (value_range *, enum tree_code, tree type, - const value_range *, - const value_range *); + const value_range *, const value_range *); extern bool vrp_operand_equal_p (const_tree, const_tree); extern enum value_range_kind intersect_range_with_nonzero_bits