gcc/value-range-pretty-print.cc

   1 /* Pretty print support for value ranges.
   2    Copyright (C) 2019-2022 Free Software Foundation, Inc.
   3    Contributed by Aldy Hernandez <aldyh@redhat.com>.
   4
   5 This file is part of GCC.
   6
   7 GCC is free software; you can redistribute it and/or modify
   8 it under the terms of the GNU General Public License as published by
   9 the Free Software Foundation; either version 3, or (at your option)
  10 any later version.
  11
  12 GCC is distributed in the hope that it will be useful,
  13 but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 GNU General Public License for more details.
  16
  17 You should have received a copy of the GNU General Public License
  18 along with GCC; see the file COPYING3.  If not see
  19 <http://www.gnu.org/licenses/>.  */
  20
  21 #include "config.h"
  22 #include "system.h"
  23 #include "coretypes.h"
  24 #include "backend.h"
  25 #include "tree.h"
  26 #include "gimple.h"
  27 #include "ssa.h"
  28 #include "tree-pretty-print.h"
  29 #include "fold-const.h"
  30 #include "gimple-range.h"
  31 #include "value-range-pretty-print.h"
  32
  33 void
  34 vrange_printer::visit (const unsupported_range &r) const
  35 {
  36   pp_string (pp, "[unsupported_range] ");
  37   if (r.undefined_p ())
  38     {
  39       pp_string (pp, "UNDEFINED");
  40       return;
  41     }
  42   if (r.varying_p ())
  43     {
  44       pp_string (pp, "VARYING");
  45       return;
  46     }
  47   gcc_unreachable ();
  48 }
  49
  50 void
  51 vrange_printer::visit (const irange &r) const
  52 {
  53   pp_string (pp, "[irange] ");
  54   if (r.undefined_p ())
  55     {
  56       pp_string (pp, "UNDEFINED");
  57       return;
  58     }
  59   dump_generic_node (pp, r.type (), 0, TDF_NONE, false);
  60   pp_character (pp, ' ');
  61   if (r.varying_p ())
  62     {
  63       pp_string (pp, "VARYING");
  64       return;
  65     }
  66   // Handle legacy symbolics.
  67   if (!r.constant_p ())
  68     {
  69       if (r.kind () == VR_ANTI_RANGE)
  70         pp_character (pp, '~');
  71       pp_character (pp, '[');
  72       dump_generic_node (pp, r.min (), 0, TDF_NONE, false);
  73       pp_string (pp, ", ");
  74       dump_generic_node (pp, r.max (), 0, TDF_NONE, false);
  75       pp_character (pp, ']');
  76       print_irange_bitmasks (r);
  77       return;
  78     }
  79   for (unsigned i = 0; i < r.num_pairs (); ++i)
  80     {
  81       pp_character (pp, '[');
  82       print_irange_bound (r.lower_bound (i), r.type ());
  83       pp_string (pp, ", ");
  84       print_irange_bound (r.upper_bound (i), r.type ());
  85       pp_character (pp, ']');
  86     }
  87  print_irange_bitmasks (r);
  88 }
  89
  90 void
  91 vrange_printer::print_irange_bound (const wide_int &bound, tree type) const
  92 {
  93   wide_int type_min = wi::min_value (TYPE_PRECISION (type), TYPE_SIGN (type));
  94   wide_int type_max = wi::max_value (TYPE_PRECISION (type), TYPE_SIGN (type));
  95
  96   if (INTEGRAL_TYPE_P (type)
  97       && !TYPE_UNSIGNED (type)
  98       && bound == type_min
  99       && TYPE_PRECISION (type) != 1)
 100     pp_string (pp, "-INF");
 101   else if (bound == type_max && TYPE_PRECISION (type) != 1)
 102     pp_string (pp, "+INF");
 103   else
 104     pp_wide_int (pp, bound, TYPE_SIGN (type));
 105 }
 106
 107 void
 108 vrange_printer::print_irange_bitmasks (const irange &r) const
 109 {
 110   wide_int nz = r.get_nonzero_bits ();
 111   if (nz == -1)
 112     return;
 113
 114   pp_string (pp, " NONZERO ");
 115   char buf[WIDE_INT_PRINT_BUFFER_SIZE];
 116   print_hex (nz, buf);
 117   pp_string (pp, buf);
 118 }
 119
 120 void
 121 vrange_printer::print_real_value (tree type, const REAL_VALUE_TYPE &r) const
 122 {
 123   char s[100];
 124   real_to_decimal_for_mode (s, &r, sizeof (s), 0, 1, TYPE_MODE (type));
 125   pp_string (pp, s);
 126   if (!DECIMAL_FLOAT_TYPE_P (type)
 127       // real_to_hexadecimal prints infinities and NAN as text.  No
 128       // need to print them twice.
 129       && !real_isinf (&r)
 130       && !real_isnan (&r))
 131     {
 132       real_to_hexadecimal (s, &r, sizeof (s), 0, 1);
 133       pp_printf (pp, " (%s)", s);
 134     }
 135 }
 136
 137 // Print an frange.
 138
 139 void
 140 vrange_printer::visit (const frange &r) const
 141 {
 142   pp_string (pp, "[frange] ");
 143   if (r.undefined_p ())
 144     {
 145       pp_string (pp, "UNDEFINED");
 146       return;
 147     }
 148   tree type = r.type ();
 149   dump_generic_node (pp, type, 0, TDF_NONE, false);
 150   pp_string (pp, " ");
 151   if (r.varying_p ())
 152     {
 153       pp_string (pp, "VARYING");
 154       print_frange_nan (r);
 155       return;
 156     }
 157   pp_character (pp, '[');
 158   bool has_endpoints = !r.known_isnan ();
 159   if (has_endpoints)
 160     {
 161       print_real_value (type, r.lower_bound ());
 162       pp_string (pp, ", ");
 163       print_real_value (type, r.upper_bound ());
 164     }
 165   pp_character (pp, ']');
 166   print_frange_nan (r);
 167 }
 168
 169 // Print the NAN info for an frange.
 170
 171 void
 172 vrange_printer::print_frange_nan (const frange &r) const
 173 {
 174   if (r.maybe_isnan ())
 175     {
 176       if (r.m_pos_nan && r.m_neg_nan)
 177         {
 178           pp_string (pp, " +-NAN");
 179           return;
 180         }
 181       bool nan_sign = r.m_neg_nan;
 182       if (nan_sign)
 183         pp_string (pp, " -NAN");
 184       else
 185         pp_string (pp, " +NAN");
 186     }
 187 }