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