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
|
/* Print RTL for GCC.
Copyright (C) 1987-2022 Free Software Foundation, Inc.
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/>. */
#ifndef GCC_PRINT_RTL_H
#define GCC_PRINT_RTL_H
#ifndef GENERATOR_FILE
#include "bitmap.h"
#endif /* #ifndef GENERATOR_FILE */
class rtx_reuse_manager;
/* A class for writing rtx to a FILE *. */
class rtx_writer
{
public:
rtx_writer (FILE *outfile, int ind, bool simple, bool compact,
rtx_reuse_manager *reuse_manager);
void print_rtx (const_rtx in_rtx);
void print_rtl (const_rtx rtx_first);
int print_rtl_single_with_indent (const_rtx x, int ind);
void finish_directive ();
private:
void print_rtx_operand_code_0 (const_rtx in_rtx, int idx);
void print_rtx_operand_code_e (const_rtx in_rtx, int idx);
void print_rtx_operand_codes_E_and_V (const_rtx in_rtx, int idx);
void print_rtx_operand_code_i (const_rtx in_rtx, int idx);
void print_rtx_operand_code_r (const_rtx in_rtx);
void print_rtx_operand_code_u (const_rtx in_rtx, int idx);
void print_rtx_operand (const_rtx in_rtx, int idx);
bool operand_has_default_value_p (const_rtx in_rtx, int idx);
private:
FILE *m_outfile;
int m_sawclose;
int m_indent;
bool m_in_call_function_usage;
/* True means use simplified format without flags, modes, etc. */
bool m_simple;
/* If true, use compact dump format:
- PREV/NEXT_INSN UIDs are omitted
- INSN_CODEs are omitted,
- register numbers are omitted for hard and virtual regs, and
non-virtual pseudos are offset relative to the first such reg, and
printed with a '%' sigil e.g. "%0" for (LAST_VIRTUAL_REGISTER + 1),
- insn names are prefixed with "c" (e.g. "cinsn", "cnote", etc). */
bool m_compact;
#ifndef GENERATOR_FILE
/* An optional instance of rtx_reuse_manager. */
rtx_reuse_manager *m_rtx_reuse_manager;
#endif
};
#ifdef BUFSIZ
extern void print_rtl (FILE *, const_rtx);
#endif
extern void print_rtx_insn_vec (FILE *file, const vec<rtx_insn *> &vec);
extern void dump_value_slim (FILE *, const_rtx, int);
extern void dump_insn_slim (FILE *, const rtx_insn *);
extern void dump_rtl_slim (FILE *, const rtx_insn *, const rtx_insn *,
int, int);
extern void print_value (pretty_printer *, const_rtx, int);
extern void print_pattern (pretty_printer *, const_rtx, int);
extern void print_insn (pretty_printer *pp, const rtx_insn *x, int verbose);
extern void print_insn_with_notes (pretty_printer *, const rtx_insn *);
extern void rtl_dump_bb_for_graph (pretty_printer *, basic_block);
extern const char *str_pattern_slim (const_rtx);
extern void print_rtx_function (FILE *file, function *fn, bool compact);
#ifndef GENERATOR_FILE
/* For some rtx codes (such as SCRATCH), instances are defined to only be
equal for pointer equality: two distinct SCRATCH instances are non-equal.
copy_rtx preserves this equality by reusing the SCRATCH instance.
For example, in this x86 instruction:
(cinsn (set (mem/v:BLK (scratch:DI) [0 A8])
(unspec:BLK [
(mem/v:BLK (scratch:DI) [0 A8])
] UNSPEC_MEMORY_BLOCKAGE)) "test.c":2
(nil))
the two instances of "(scratch:DI)" are actually the same underlying
rtx pointer (and thus "equal"), and the insn will only be recognized
(as "*memory_blockage") if this pointer-equality is preserved.
To be able to preserve this pointer-equality when round-tripping
through dumping/loading the rtl, we need some syntax. The first
time a reused rtx is encountered in the dump, we prefix it with
a reuse ID:
(0|scratch:DI)
Subsequent references to the rtx in the dump can be expressed using
"reuse_rtx" e.g.:
(reuse_rtx 0)
This class is responsible for tracking a set of reuse IDs during a dump.
Dumping with reuse-support is done in two passes:
(a) a first pass in which "preprocess" is called on each top-level rtx
to be seen in the dump. This traverses the rtx and its descendents,
identifying rtx that will be seen more than once in the actual dump,
and assigning them reuse IDs.
(b) the actual dump, via print_rtx etc. print_rtx detect the presence
of a live rtx_reuse_manager and uses it if there is one. Any rtx
that were assigned reuse IDs will be printed with it the first time
that they are seen, and then printed as "(reuse_rtx ID)" subsequently.
The first phase is needed since otherwise there would be no way to tell
if an rtx will be reused when first encountering it. */
class rtx_reuse_manager
{
public:
rtx_reuse_manager ();
/* The first pass. */
void preprocess (const_rtx x);
/* The second pass (within print_rtx). */
bool has_reuse_id (const_rtx x, int *out);
bool seen_def_p (int reuse_id);
void set_seen_def (int reuse_id);
private:
hash_map<const_rtx, int> m_rtx_occurrence_count;
hash_map<const_rtx, int> m_rtx_reuse_ids;
auto_bitmap m_defs_seen;
int m_next_id;
};
#endif /* #ifndef GENERATOR_FILE */
#endif // GCC_PRINT_RTL_H
|
