1*38fd1498Szrj /* Form lists of pseudo register references for autoinc optimization
2*38fd1498Szrj for GNU compiler. This is part of flow optimization.
3*38fd1498Szrj Copyright (C) 1999-2018 Free Software Foundation, Inc.
4*38fd1498Szrj Originally contributed by Michael P. Hayes
5*38fd1498Szrj (m.hayes@elec.canterbury.ac.nz, mhayes@redhat.com)
6*38fd1498Szrj Major rewrite contributed by Danny Berlin (dberlin@dberlin.org)
7*38fd1498Szrj and Kenneth Zadeck (zadeck@naturalbridge.com).
8*38fd1498Szrj
9*38fd1498Szrj This file is part of GCC.
10*38fd1498Szrj
11*38fd1498Szrj GCC is free software; you can redistribute it and/or modify it under
12*38fd1498Szrj the terms of the GNU General Public License as published by the Free
13*38fd1498Szrj Software Foundation; either version 3, or (at your option) any later
14*38fd1498Szrj version.
15*38fd1498Szrj
16*38fd1498Szrj GCC is distributed in the hope that it will be useful, but WITHOUT ANY
17*38fd1498Szrj WARRANTY; without even the implied warranty of MERCHANTABILITY or
18*38fd1498Szrj FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19*38fd1498Szrj for more details.
20*38fd1498Szrj
21*38fd1498Szrj You should have received a copy of the GNU General Public License
22*38fd1498Szrj along with GCC; see the file COPYING3. If not see
23*38fd1498Szrj <http://www.gnu.org/licenses/>. */
24*38fd1498Szrj
25*38fd1498Szrj #ifndef GCC_DF_H
26*38fd1498Szrj #define GCC_DF_H
27*38fd1498Szrj
28*38fd1498Szrj #include "regset.h"
29*38fd1498Szrj #include "alloc-pool.h"
30*38fd1498Szrj #include "timevar.h"
31*38fd1498Szrj
32*38fd1498Szrj struct dataflow;
33*38fd1498Szrj struct df_d;
34*38fd1498Szrj struct df_problem;
35*38fd1498Szrj struct df_link;
36*38fd1498Szrj struct df_insn_info;
37*38fd1498Szrj union df_ref_d;
38*38fd1498Szrj
39*38fd1498Szrj /* Data flow problems. All problems must have a unique id here. */
40*38fd1498Szrj
41*38fd1498Szrj /* Scanning is not really a dataflow problem, but it is useful to have
42*38fd1498Szrj the basic block functions in the vector so that things get done in
43*38fd1498Szrj a uniform manner. The last four problems can be added or deleted
44*38fd1498Szrj at any time are always defined (though LIVE is always there at -O2
45*38fd1498Szrj or higher); the others are always there. */
46*38fd1498Szrj enum df_problem_id
47*38fd1498Szrj {
48*38fd1498Szrj DF_SCAN,
49*38fd1498Szrj DF_LR, /* Live Registers backward. */
50*38fd1498Szrj DF_LIVE, /* Live Registers & Uninitialized Registers */
51*38fd1498Szrj DF_RD, /* Reaching Defs. */
52*38fd1498Szrj DF_CHAIN, /* Def-Use and/or Use-Def Chains. */
53*38fd1498Szrj DF_WORD_LR, /* Subreg tracking lr. */
54*38fd1498Szrj DF_NOTE, /* REG_DEAD and REG_UNUSED notes. */
55*38fd1498Szrj DF_MD, /* Multiple Definitions. */
56*38fd1498Szrj DF_MIR, /* Must-initialized Registers. */
57*38fd1498Szrj
58*38fd1498Szrj DF_LAST_PROBLEM_PLUS1
59*38fd1498Szrj };
60*38fd1498Szrj
61*38fd1498Szrj /* Dataflow direction. */
62*38fd1498Szrj enum df_flow_dir
63*38fd1498Szrj {
64*38fd1498Szrj DF_NONE,
65*38fd1498Szrj DF_FORWARD,
66*38fd1498Szrj DF_BACKWARD
67*38fd1498Szrj };
68*38fd1498Szrj
69*38fd1498Szrj /* Descriminator for the various df_ref types. */
70*38fd1498Szrj enum df_ref_class {DF_REF_BASE, DF_REF_ARTIFICIAL, DF_REF_REGULAR};
71*38fd1498Szrj
72*38fd1498Szrj /* The first of these us a set of a registers. The remaining three
73*38fd1498Szrj are all uses of a register (the mem_load and mem_store relate to
74*38fd1498Szrj how the register as an addressing operand). */
75*38fd1498Szrj enum df_ref_type {DF_REF_REG_DEF, DF_REF_REG_USE,
76*38fd1498Szrj DF_REF_REG_MEM_LOAD, DF_REF_REG_MEM_STORE};
77*38fd1498Szrj
78*38fd1498Szrj enum df_ref_flags
79*38fd1498Szrj {
80*38fd1498Szrj /* This flag is set if this ref occurs inside of a conditional
81*38fd1498Szrj execution instruction. */
82*38fd1498Szrj DF_REF_CONDITIONAL = 1 << 0,
83*38fd1498Szrj
84*38fd1498Szrj /* If this flag is set for an artificial use or def, that ref
85*38fd1498Szrj logically happens at the top of the block. If it is not set
86*38fd1498Szrj for an artificial use or def, that ref logically happens at the
87*38fd1498Szrj bottom of the block. This is never set for regular refs. */
88*38fd1498Szrj DF_REF_AT_TOP = 1 << 1,
89*38fd1498Szrj
90*38fd1498Szrj /* This flag is set if the use is inside a REG_EQUAL or REG_EQUIV
91*38fd1498Szrj note. */
92*38fd1498Szrj DF_REF_IN_NOTE = 1 << 2,
93*38fd1498Szrj
94*38fd1498Szrj /* This bit is true if this ref can make regs_ever_live true for
95*38fd1498Szrj this regno. */
96*38fd1498Szrj DF_HARD_REG_LIVE = 1 << 3,
97*38fd1498Szrj
98*38fd1498Szrj
99*38fd1498Szrj /* This flag is set if this ref is a partial use or def of the
100*38fd1498Szrj associated register. */
101*38fd1498Szrj DF_REF_PARTIAL = 1 << 4,
102*38fd1498Szrj
103*38fd1498Szrj /* Read-modify-write refs generate both a use and a def and
104*38fd1498Szrj these are marked with this flag to show that they are not
105*38fd1498Szrj independent. */
106*38fd1498Szrj DF_REF_READ_WRITE = 1 << 5,
107*38fd1498Szrj
108*38fd1498Szrj /* This flag is set if this ref, generally a def, may clobber the
109*38fd1498Szrj referenced register. This is generally only set for hard
110*38fd1498Szrj registers that cross a call site. With better information
111*38fd1498Szrj about calls, some of these could be changed in the future to
112*38fd1498Szrj DF_REF_MUST_CLOBBER. */
113*38fd1498Szrj DF_REF_MAY_CLOBBER = 1 << 6,
114*38fd1498Szrj
115*38fd1498Szrj /* This flag is set if this ref, generally a def, is a real
116*38fd1498Szrj clobber. This is not currently set for registers live across a
117*38fd1498Szrj call because that clobbering may or may not happen.
118*38fd1498Szrj
119*38fd1498Szrj Most of the uses of this are with sets that have a
120*38fd1498Szrj GET_CODE(..)==CLOBBER. Note that this is set even if the
121*38fd1498Szrj clobber is to a subreg. So in order to tell if the clobber
122*38fd1498Szrj wipes out the entire register, it is necessary to also check
123*38fd1498Szrj the DF_REF_PARTIAL flag. */
124*38fd1498Szrj DF_REF_MUST_CLOBBER = 1 << 7,
125*38fd1498Szrj
126*38fd1498Szrj
127*38fd1498Szrj /* If the ref has one of the following two flags set, then the
128*38fd1498Szrj struct df_ref can be cast to struct df_ref_extract to access
129*38fd1498Szrj the width and offset fields. */
130*38fd1498Szrj
131*38fd1498Szrj /* This flag is set if the ref contains a SIGN_EXTRACT. */
132*38fd1498Szrj DF_REF_SIGN_EXTRACT = 1 << 8,
133*38fd1498Szrj
134*38fd1498Szrj /* This flag is set if the ref contains a ZERO_EXTRACT. */
135*38fd1498Szrj DF_REF_ZERO_EXTRACT = 1 << 9,
136*38fd1498Szrj
137*38fd1498Szrj /* This flag is set if the ref contains a STRICT_LOW_PART. */
138*38fd1498Szrj DF_REF_STRICT_LOW_PART = 1 << 10,
139*38fd1498Szrj
140*38fd1498Szrj /* This flag is set if the ref contains a SUBREG. */
141*38fd1498Szrj DF_REF_SUBREG = 1 << 11,
142*38fd1498Szrj
143*38fd1498Szrj
144*38fd1498Szrj /* This bit is true if this ref is part of a multiword hardreg. */
145*38fd1498Szrj DF_REF_MW_HARDREG = 1 << 12,
146*38fd1498Szrj
147*38fd1498Szrj /* This flag is set if this ref is a usage of the stack pointer by
148*38fd1498Szrj a function call. */
149*38fd1498Szrj DF_REF_CALL_STACK_USAGE = 1 << 13,
150*38fd1498Szrj
151*38fd1498Szrj /* This flag is used for verification of existing refs. */
152*38fd1498Szrj DF_REF_REG_MARKER = 1 << 14,
153*38fd1498Szrj
154*38fd1498Szrj /* This flag is set if this ref is inside a pre/post modify. */
155*38fd1498Szrj DF_REF_PRE_POST_MODIFY = 1 << 15
156*38fd1498Szrj
157*38fd1498Szrj };
158*38fd1498Szrj
159*38fd1498Szrj /* The possible ordering of refs within the df_ref_info. */
160*38fd1498Szrj enum df_ref_order
161*38fd1498Szrj {
162*38fd1498Szrj /* There is not table. */
163*38fd1498Szrj DF_REF_ORDER_NO_TABLE,
164*38fd1498Szrj
165*38fd1498Szrj /* There is a table of refs but it is not (or no longer) organized
166*38fd1498Szrj by one of the following methods. */
167*38fd1498Szrj DF_REF_ORDER_UNORDERED,
168*38fd1498Szrj DF_REF_ORDER_UNORDERED_WITH_NOTES,
169*38fd1498Szrj
170*38fd1498Szrj /* Organize the table by reg order, all of the refs with regno 0
171*38fd1498Szrj followed by all of the refs with regno 1 ... . Within all of
172*38fd1498Szrj the regs for a particular regno, the refs are unordered. */
173*38fd1498Szrj DF_REF_ORDER_BY_REG,
174*38fd1498Szrj
175*38fd1498Szrj /* For uses, the refs within eq notes may be added for
176*38fd1498Szrj DF_REF_ORDER_BY_REG. */
177*38fd1498Szrj DF_REF_ORDER_BY_REG_WITH_NOTES,
178*38fd1498Szrj
179*38fd1498Szrj /* Organize the refs in insn order. The insns are ordered within a
180*38fd1498Szrj block, and the blocks are ordered by FOR_ALL_BB_FN. */
181*38fd1498Szrj DF_REF_ORDER_BY_INSN,
182*38fd1498Szrj
183*38fd1498Szrj /* For uses, the refs within eq notes may be added for
184*38fd1498Szrj DF_REF_ORDER_BY_INSN. */
185*38fd1498Szrj DF_REF_ORDER_BY_INSN_WITH_NOTES
186*38fd1498Szrj };
187*38fd1498Szrj
188*38fd1498Szrj /* Function prototypes added to df_problem instance. */
189*38fd1498Szrj
190*38fd1498Szrj /* Allocate the problem specific data. */
191*38fd1498Szrj typedef void (*df_alloc_function) (bitmap);
192*38fd1498Szrj
193*38fd1498Szrj /* This function is called if the problem has global data that needs
194*38fd1498Szrj to be cleared when ever the set of blocks changes. The bitmap
195*38fd1498Szrj contains the set of blocks that may require special attention.
196*38fd1498Szrj This call is only made if some of the blocks are going to change.
197*38fd1498Szrj If everything is to be deleted, the wholesale deletion mechanisms
198*38fd1498Szrj apply. */
199*38fd1498Szrj typedef void (*df_reset_function) (bitmap);
200*38fd1498Szrj
201*38fd1498Szrj /* Free the basic block info. Called from the block reordering code
202*38fd1498Szrj to get rid of the blocks that have been squished down. */
203*38fd1498Szrj typedef void (*df_free_bb_function) (basic_block, void *);
204*38fd1498Szrj
205*38fd1498Szrj /* Local compute function. */
206*38fd1498Szrj typedef void (*df_local_compute_function) (bitmap);
207*38fd1498Szrj
208*38fd1498Szrj /* Init the solution specific data. */
209*38fd1498Szrj typedef void (*df_init_function) (bitmap);
210*38fd1498Szrj
211*38fd1498Szrj /* Iterative dataflow function. */
212*38fd1498Szrj typedef void (*df_dataflow_function) (struct dataflow *, bitmap, int *, int);
213*38fd1498Szrj
214*38fd1498Szrj /* Confluence operator for blocks with 0 out (or in) edges. */
215*38fd1498Szrj typedef void (*df_confluence_function_0) (basic_block);
216*38fd1498Szrj
217*38fd1498Szrj /* Confluence operator for blocks with 1 or more out (or in) edges.
218*38fd1498Szrj Return true if BB input data has changed. */
219*38fd1498Szrj typedef bool (*df_confluence_function_n) (edge);
220*38fd1498Szrj
221*38fd1498Szrj /* Transfer function for blocks.
222*38fd1498Szrj Return true if BB output data has changed. */
223*38fd1498Szrj typedef bool (*df_transfer_function) (int);
224*38fd1498Szrj
225*38fd1498Szrj /* Function to massage the information after the problem solving. */
226*38fd1498Szrj typedef void (*df_finalizer_function) (bitmap);
227*38fd1498Szrj
228*38fd1498Szrj /* Function to free all of the problem specific datastructures. */
229*38fd1498Szrj typedef void (*df_free_function) (void);
230*38fd1498Szrj
231*38fd1498Szrj /* Function to remove this problem from the stack of dataflow problems
232*38fd1498Szrj without effecting the other problems in the stack except for those
233*38fd1498Szrj that depend on this problem. */
234*38fd1498Szrj typedef void (*df_remove_problem_function) (void);
235*38fd1498Szrj
236*38fd1498Szrj /* Function to dump basic block independent results to FILE. */
237*38fd1498Szrj typedef void (*df_dump_problem_function) (FILE *);
238*38fd1498Szrj
239*38fd1498Szrj /* Function to dump top or bottom of basic block results to FILE. */
240*38fd1498Szrj typedef void (*df_dump_bb_problem_function) (basic_block, FILE *);
241*38fd1498Szrj
242*38fd1498Szrj /* Function to dump before or after an insn to FILE. */
243*38fd1498Szrj typedef void (*df_dump_insn_problem_function) (const rtx_insn *, FILE *);
244*38fd1498Szrj
245*38fd1498Szrj /* Function to dump top or bottom of basic block results to FILE. */
246*38fd1498Szrj typedef void (*df_verify_solution_start) (void);
247*38fd1498Szrj
248*38fd1498Szrj /* Function to dump top or bottom of basic block results to FILE. */
249*38fd1498Szrj typedef void (*df_verify_solution_end) (void);
250*38fd1498Szrj
251*38fd1498Szrj /* The static description of a dataflow problem to solve. See above
252*38fd1498Szrj typedefs for doc for the function fields. */
253*38fd1498Szrj
254*38fd1498Szrj struct df_problem {
255*38fd1498Szrj /* The unique id of the problem. This is used it index into
256*38fd1498Szrj df->defined_problems to make accessing the problem data easy. */
257*38fd1498Szrj enum df_problem_id id;
258*38fd1498Szrj enum df_flow_dir dir; /* Dataflow direction. */
259*38fd1498Szrj df_alloc_function alloc_fun;
260*38fd1498Szrj df_reset_function reset_fun;
261*38fd1498Szrj df_free_bb_function free_bb_fun;
262*38fd1498Szrj df_local_compute_function local_compute_fun;
263*38fd1498Szrj df_init_function init_fun;
264*38fd1498Szrj df_dataflow_function dataflow_fun;
265*38fd1498Szrj df_confluence_function_0 con_fun_0;
266*38fd1498Szrj df_confluence_function_n con_fun_n;
267*38fd1498Szrj df_transfer_function trans_fun;
268*38fd1498Szrj df_finalizer_function finalize_fun;
269*38fd1498Szrj df_free_function free_fun;
270*38fd1498Szrj df_remove_problem_function remove_problem_fun;
271*38fd1498Szrj df_dump_problem_function dump_start_fun;
272*38fd1498Szrj df_dump_bb_problem_function dump_top_fun;
273*38fd1498Szrj df_dump_bb_problem_function dump_bottom_fun;
274*38fd1498Szrj df_dump_insn_problem_function dump_insn_top_fun;
275*38fd1498Szrj df_dump_insn_problem_function dump_insn_bottom_fun;
276*38fd1498Szrj df_verify_solution_start verify_start_fun;
277*38fd1498Szrj df_verify_solution_end verify_end_fun;
278*38fd1498Szrj const struct df_problem *dependent_problem;
279*38fd1498Szrj unsigned int block_info_elt_size;
280*38fd1498Szrj
281*38fd1498Szrj /* The timevar id associated with this pass. */
282*38fd1498Szrj timevar_id_t tv_id;
283*38fd1498Szrj
284*38fd1498Szrj /* True if the df_set_blocks should null out the basic block info if
285*38fd1498Szrj this block drops out of df->blocks_to_analyze. */
286*38fd1498Szrj bool free_blocks_on_set_blocks;
287*38fd1498Szrj };
288*38fd1498Szrj
289*38fd1498Szrj
290*38fd1498Szrj /* The specific instance of the problem to solve. */
291*38fd1498Szrj struct dataflow
292*38fd1498Szrj {
293*38fd1498Szrj const struct df_problem *problem; /* The problem to be solved. */
294*38fd1498Szrj
295*38fd1498Szrj /* Array indexed by bb->index, that contains basic block problem and
296*38fd1498Szrj solution specific information. */
297*38fd1498Szrj void *block_info;
298*38fd1498Szrj unsigned int block_info_size;
299*38fd1498Szrj
300*38fd1498Szrj /* The pool to allocate the block_info from. */
301*38fd1498Szrj object_allocator<df_link> *block_pool;
302*38fd1498Szrj
303*38fd1498Szrj /* The lr and live problems have their transfer functions recomputed
304*38fd1498Szrj only if necessary. This is possible for them because, the
305*38fd1498Szrj problems are kept active for the entire backend and their
306*38fd1498Szrj transfer functions are indexed by the REGNO. These are not
307*38fd1498Szrj defined for any other problem. */
308*38fd1498Szrj bitmap out_of_date_transfer_functions;
309*38fd1498Szrj
310*38fd1498Szrj /* Other problem specific data that is not on a per basic block
311*38fd1498Szrj basis. The structure is generally defined privately for the
312*38fd1498Szrj problem. The exception being the scanning problem where it is
313*38fd1498Szrj fully public. */
314*38fd1498Szrj void *problem_data;
315*38fd1498Szrj
316*38fd1498Szrj /* Local flags for some of the problems. */
317*38fd1498Szrj unsigned int local_flags;
318*38fd1498Szrj
319*38fd1498Szrj /* True if this problem of this instance has been initialized. This
320*38fd1498Szrj is used by the dumpers to keep garbage out of the dumps if, for
321*38fd1498Szrj debugging a dump is produced before the first call to
322*38fd1498Szrj df_analyze after a new problem is added. */
323*38fd1498Szrj bool computed;
324*38fd1498Szrj
325*38fd1498Szrj /* True if the something has changed which invalidates the dataflow
326*38fd1498Szrj solutions. Note that this bit is always true for all problems except
327*38fd1498Szrj lr and live. */
328*38fd1498Szrj bool solutions_dirty;
329*38fd1498Szrj
330*38fd1498Szrj /* If true, this pass is deleted by df_finish_pass. This is never
331*38fd1498Szrj true for DF_SCAN and DF_LR. It is true for DF_LIVE if optimize >
332*38fd1498Szrj 1. It is always true for the other problems. */
333*38fd1498Szrj bool optional_p;
334*38fd1498Szrj };
335*38fd1498Szrj
336*38fd1498Szrj
337*38fd1498Szrj /* The set of multiword hardregs used as operands to this
338*38fd1498Szrj instruction. These are factored into individual uses and defs but
339*38fd1498Szrj the aggregate is still needed to service the REG_DEAD and
340*38fd1498Szrj REG_UNUSED notes. */
341*38fd1498Szrj struct df_mw_hardreg
342*38fd1498Szrj {
343*38fd1498Szrj df_mw_hardreg *next; /* Next entry for this instruction. */
344*38fd1498Szrj rtx mw_reg; /* The multiword hardreg. */
345*38fd1498Szrj /* These two bitfields are intentionally oversized, in the hope that
346*38fd1498Szrj accesses to 16-bit fields will usually be quicker. */
347*38fd1498Szrj ENUM_BITFIELD(df_ref_type) type : 16;
348*38fd1498Szrj /* Used to see if the ref is read or write. */
349*38fd1498Szrj int flags : 16; /* Various df_ref_flags. */
350*38fd1498Szrj unsigned int start_regno; /* First word of the multi word subreg. */
351*38fd1498Szrj unsigned int end_regno; /* Last word of the multi word subreg. */
352*38fd1498Szrj unsigned int mw_order; /* Same as df_ref.ref_order. */
353*38fd1498Szrj };
354*38fd1498Szrj
355*38fd1498Szrj
356*38fd1498Szrj /* Define a register reference structure. One of these is allocated
357*38fd1498Szrj for every register reference (use or def). Note some register
358*38fd1498Szrj references (e.g., post_inc, subreg) generate both a def and a use. */
359*38fd1498Szrj struct df_base_ref
360*38fd1498Szrj {
361*38fd1498Szrj /* These three bitfields are intentionally oversized, in the hope that
362*38fd1498Szrj accesses to 8 and 16-bit fields will usually be quicker. */
363*38fd1498Szrj ENUM_BITFIELD(df_ref_class) cl : 8;
364*38fd1498Szrj
365*38fd1498Szrj ENUM_BITFIELD(df_ref_type) type : 8;
366*38fd1498Szrj /* Type of ref. */
367*38fd1498Szrj int flags : 16; /* Various df_ref_flags. */
368*38fd1498Szrj unsigned int regno; /* The register number referenced. */
369*38fd1498Szrj rtx reg; /* The register referenced. */
370*38fd1498Szrj union df_ref_d *next_loc; /* Next ref for same insn or bb. */
371*38fd1498Szrj struct df_link *chain; /* Head of def-use, use-def. */
372*38fd1498Szrj /* Pointer to the insn info of the containing instruction. FIXME!
373*38fd1498Szrj Currently this is NULL for artificial refs but this will be used
374*38fd1498Szrj when FUDs are added. */
375*38fd1498Szrj struct df_insn_info *insn_info;
376*38fd1498Szrj /* For each regno, there are three chains of refs, one for the uses,
377*38fd1498Szrj the eq_uses and the defs. These chains go through the refs
378*38fd1498Szrj themselves rather than using an external structure. */
379*38fd1498Szrj union df_ref_d *next_reg; /* Next ref with same regno and type. */
380*38fd1498Szrj union df_ref_d *prev_reg; /* Prev ref with same regno and type. */
381*38fd1498Szrj /* Location in the ref table. This is only valid after a call to
382*38fd1498Szrj df_maybe_reorganize_[use,def]_refs which is an expensive operation. */
383*38fd1498Szrj int id;
384*38fd1498Szrj /* The index at which the operand was scanned in the insn. This is
385*38fd1498Szrj used to totally order the refs in an insn. */
386*38fd1498Szrj unsigned int ref_order;
387*38fd1498Szrj };
388*38fd1498Szrj
389*38fd1498Szrj
390*38fd1498Szrj /* The three types of df_refs. Note that the df_ref_extract is an
391*38fd1498Szrj extension of the df_regular_ref, not the df_base_ref. */
392*38fd1498Szrj struct df_artificial_ref
393*38fd1498Szrj {
394*38fd1498Szrj struct df_base_ref base;
395*38fd1498Szrj
396*38fd1498Szrj /* Artificial refs do not have an insn, so to get the basic block,
397*38fd1498Szrj it must be explicitly here. */
398*38fd1498Szrj basic_block bb;
399*38fd1498Szrj };
400*38fd1498Szrj
401*38fd1498Szrj
402*38fd1498Szrj struct df_regular_ref
403*38fd1498Szrj {
404*38fd1498Szrj struct df_base_ref base;
405*38fd1498Szrj /* The loc is the address in the insn of the reg. This is not
406*38fd1498Szrj defined for special registers, such as clobbers and stack
407*38fd1498Szrj pointers that are also associated with call insns and so those
408*38fd1498Szrj just use the base. */
409*38fd1498Szrj rtx *loc;
410*38fd1498Szrj };
411*38fd1498Szrj
412*38fd1498Szrj /* Union of the different kinds of defs/uses placeholders. */
413*38fd1498Szrj union df_ref_d
414*38fd1498Szrj {
415*38fd1498Szrj struct df_base_ref base;
416*38fd1498Szrj struct df_regular_ref regular_ref;
417*38fd1498Szrj struct df_artificial_ref artificial_ref;
418*38fd1498Szrj };
419*38fd1498Szrj typedef union df_ref_d *df_ref;
420*38fd1498Szrj
421*38fd1498Szrj
422*38fd1498Szrj /* One of these structures is allocated for every insn. */
423*38fd1498Szrj struct df_insn_info
424*38fd1498Szrj {
425*38fd1498Szrj rtx_insn *insn; /* The insn this info comes from. */
426*38fd1498Szrj df_ref defs; /* Head of insn-def chain. */
427*38fd1498Szrj df_ref uses; /* Head of insn-use chain. */
428*38fd1498Szrj /* Head of insn-use chain for uses in REG_EQUAL/EQUIV notes. */
429*38fd1498Szrj df_ref eq_uses;
430*38fd1498Szrj struct df_mw_hardreg *mw_hardregs;
431*38fd1498Szrj /* The logical uid of the insn in the basic block. This is valid
432*38fd1498Szrj after any call to df_analyze but may rot after insns are added,
433*38fd1498Szrj deleted or moved. */
434*38fd1498Szrj int luid;
435*38fd1498Szrj };
436*38fd1498Szrj
437*38fd1498Szrj /* These links are used for ref-ref chains. Currently only DEF-USE and
438*38fd1498Szrj USE-DEF chains can be built by DF. */
439*38fd1498Szrj struct df_link
440*38fd1498Szrj {
441*38fd1498Szrj df_ref ref;
442*38fd1498Szrj struct df_link *next;
443*38fd1498Szrj };
444*38fd1498Szrj
445*38fd1498Szrj
446*38fd1498Szrj enum df_chain_flags
447*38fd1498Szrj {
448*38fd1498Szrj /* Flags that control the building of chains. */
449*38fd1498Szrj DF_DU_CHAIN = 1, /* Build DU chains. */
450*38fd1498Szrj DF_UD_CHAIN = 2 /* Build UD chains. */
451*38fd1498Szrj };
452*38fd1498Szrj
453*38fd1498Szrj enum df_scan_flags
454*38fd1498Szrj {
455*38fd1498Szrj /* Flags for the SCAN problem. */
456*38fd1498Szrj DF_SCAN_EMPTY_ENTRY_EXIT = 1 /* Don't define any registers in the entry
457*38fd1498Szrj block; don't use any in the exit block. */
458*38fd1498Szrj };
459*38fd1498Szrj
460*38fd1498Szrj enum df_changeable_flags
461*38fd1498Szrj {
462*38fd1498Szrj /* Scanning flags. */
463*38fd1498Szrj /* Flag to control the running of dce as a side effect of building LR. */
464*38fd1498Szrj DF_LR_RUN_DCE = 1 << 0, /* Run DCE. */
465*38fd1498Szrj DF_NO_HARD_REGS = 1 << 1, /* Skip hard registers in RD and CHAIN Building. */
466*38fd1498Szrj
467*38fd1498Szrj DF_EQ_NOTES = 1 << 2, /* Build chains with uses present in EQUIV/EQUAL notes. */
468*38fd1498Szrj DF_NO_REGS_EVER_LIVE = 1 << 3, /* Do not compute the regs_ever_live. */
469*38fd1498Szrj
470*38fd1498Szrj /* Cause df_insn_rescan df_notes_rescan and df_insn_delete, to
471*38fd1498Szrj return immediately. This is used by passes that know how to update
472*38fd1498Szrj the scanning them selves. */
473*38fd1498Szrj DF_NO_INSN_RESCAN = 1 << 4,
474*38fd1498Szrj
475*38fd1498Szrj /* Cause df_insn_rescan df_notes_rescan and df_insn_delete, to
476*38fd1498Szrj return after marking the insn for later processing. This allows all
477*38fd1498Szrj rescans to be batched. */
478*38fd1498Szrj DF_DEFER_INSN_RESCAN = 1 << 5,
479*38fd1498Szrj
480*38fd1498Szrj /* Compute the reaching defs problem as "live and reaching defs" (LR&RD).
481*38fd1498Szrj A DEF is reaching and live at insn I if DEF reaches I and REGNO(DEF)
482*38fd1498Szrj is in LR_IN of the basic block containing I. */
483*38fd1498Szrj DF_RD_PRUNE_DEAD_DEFS = 1 << 6,
484*38fd1498Szrj
485*38fd1498Szrj DF_VERIFY_SCHEDULED = 1 << 7
486*38fd1498Szrj };
487*38fd1498Szrj
488*38fd1498Szrj /* Two of these structures are inline in df, one for the uses and one
489*38fd1498Szrj for the defs. This structure is only contains the refs within the
490*38fd1498Szrj boundary of the df_set_blocks if that has been defined. */
491*38fd1498Szrj struct df_ref_info
492*38fd1498Szrj {
493*38fd1498Szrj df_ref *refs; /* Ref table, indexed by id. */
494*38fd1498Szrj unsigned int *begin; /* First ref_index for this pseudo. */
495*38fd1498Szrj unsigned int *count; /* Count of refs for this pseudo. */
496*38fd1498Szrj unsigned int refs_size; /* Size of currently allocated refs table. */
497*38fd1498Szrj
498*38fd1498Szrj /* Table_size is the number of elements in the refs table. This
499*38fd1498Szrj will also be the width of the bitvectors in the rd and ru
500*38fd1498Szrj problems. Total_size is the number of refs. These will be the
501*38fd1498Szrj same if the focus has not been reduced by df_set_blocks. If the
502*38fd1498Szrj focus has been reduced, table_size will be smaller since it only
503*38fd1498Szrj contains the refs in the set blocks. */
504*38fd1498Szrj unsigned int table_size;
505*38fd1498Szrj unsigned int total_size;
506*38fd1498Szrj
507*38fd1498Szrj enum df_ref_order ref_order;
508*38fd1498Szrj };
509*38fd1498Szrj
510*38fd1498Szrj /* Three of these structures are allocated for every pseudo reg. One
511*38fd1498Szrj for the uses, one for the eq_uses and one for the defs. */
512*38fd1498Szrj struct df_reg_info
513*38fd1498Szrj {
514*38fd1498Szrj /* Head of chain for refs of that type and regno. */
515*38fd1498Szrj df_ref reg_chain;
516*38fd1498Szrj /* Number of refs in the chain. */
517*38fd1498Szrj unsigned int n_refs;
518*38fd1498Szrj };
519*38fd1498Szrj
520*38fd1498Szrj
521*38fd1498Szrj /*----------------------------------------------------------------------------
522*38fd1498Szrj Problem data for the scanning dataflow problem. Unlike the other
523*38fd1498Szrj dataflow problems, the problem data for scanning is fully exposed and
524*38fd1498Szrj used by owners of the problem.
525*38fd1498Szrj ----------------------------------------------------------------------------*/
526*38fd1498Szrj
527*38fd1498Szrj struct df_d
528*38fd1498Szrj {
529*38fd1498Szrj
530*38fd1498Szrj /* The set of problems to be solved is stored in two arrays. In
531*38fd1498Szrj PROBLEMS_IN_ORDER, the problems are stored in the order that they
532*38fd1498Szrj are solved. This is an internally dense array that may have
533*38fd1498Szrj nulls at the end of it. In PROBLEMS_BY_INDEX, the problem is
534*38fd1498Szrj stored by the value in df_problem.id. These are used to access
535*38fd1498Szrj the problem local data without having to search the first
536*38fd1498Szrj array. */
537*38fd1498Szrj
538*38fd1498Szrj struct dataflow *problems_in_order[DF_LAST_PROBLEM_PLUS1];
539*38fd1498Szrj struct dataflow *problems_by_index[DF_LAST_PROBLEM_PLUS1];
540*38fd1498Szrj
541*38fd1498Szrj /* If not NULL, this subset of blocks of the program to be
542*38fd1498Szrj considered for analysis. At certain times, this will contain all
543*38fd1498Szrj the blocks in the function so it cannot be used as an indicator
544*38fd1498Szrj of if we are analyzing a subset. See analyze_subset. */
545*38fd1498Szrj bitmap blocks_to_analyze;
546*38fd1498Szrj
547*38fd1498Szrj /* The following information is really the problem data for the
548*38fd1498Szrj scanning instance but it is used too often by the other problems
549*38fd1498Szrj to keep getting it from there. */
550*38fd1498Szrj struct df_ref_info def_info; /* Def info. */
551*38fd1498Szrj struct df_ref_info use_info; /* Use info. */
552*38fd1498Szrj
553*38fd1498Szrj /* The following three arrays are allocated in parallel. They contain
554*38fd1498Szrj the sets of refs of each type for each reg. */
555*38fd1498Szrj struct df_reg_info **def_regs; /* Def reg info. */
556*38fd1498Szrj struct df_reg_info **use_regs; /* Eq_use reg info. */
557*38fd1498Szrj struct df_reg_info **eq_use_regs; /* Eq_use info. */
558*38fd1498Szrj unsigned int regs_size; /* Size of currently allocated regs table. */
559*38fd1498Szrj unsigned int regs_inited; /* Number of regs with reg_infos allocated. */
560*38fd1498Szrj
561*38fd1498Szrj
562*38fd1498Szrj struct df_insn_info **insns; /* Insn table, indexed by insn UID. */
563*38fd1498Szrj unsigned int insns_size; /* Size of insn table. */
564*38fd1498Szrj
565*38fd1498Szrj int num_problems_defined;
566*38fd1498Szrj
567*38fd1498Szrj bitmap_head hardware_regs_used; /* The set of hardware registers used. */
568*38fd1498Szrj /* The set of hard regs that are in the artificial uses at the end
569*38fd1498Szrj of a regular basic block. */
570*38fd1498Szrj bitmap_head regular_block_artificial_uses;
571*38fd1498Szrj /* The set of hard regs that are in the artificial uses at the end
572*38fd1498Szrj of a basic block that has an EH pred. */
573*38fd1498Szrj bitmap_head eh_block_artificial_uses;
574*38fd1498Szrj /* The set of hardware registers live on entry to the function. */
575*38fd1498Szrj bitmap entry_block_defs;
576*38fd1498Szrj bitmap exit_block_uses; /* The set of hardware registers used in exit block. */
577*38fd1498Szrj
578*38fd1498Szrj /* Insns to delete, rescan or reprocess the notes at next
579*38fd1498Szrj df_rescan_all or df_process_deferred_rescans. */
580*38fd1498Szrj bitmap_head insns_to_delete;
581*38fd1498Szrj bitmap_head insns_to_rescan;
582*38fd1498Szrj bitmap_head insns_to_notes_rescan;
583*38fd1498Szrj int *postorder; /* The current set of basic blocks
584*38fd1498Szrj in reverse postorder. */
585*38fd1498Szrj vec<int> postorder_inverted; /* The current set of basic blocks
586*38fd1498Szrj in reverse postorder of inverted CFG. */
587*38fd1498Szrj int n_blocks; /* The number of blocks in reverse postorder. */
588*38fd1498Szrj
589*38fd1498Szrj /* An array [FIRST_PSEUDO_REGISTER], indexed by regno, of the number
590*38fd1498Szrj of refs that qualify as being real hard regs uses. Artificial
591*38fd1498Szrj uses and defs as well as refs in eq notes are ignored. If the
592*38fd1498Szrj ref is a def, it cannot be a MAY_CLOBBER def. If the ref is a
593*38fd1498Szrj use, it cannot be the emim_reg_set or be the frame or arg pointer
594*38fd1498Szrj register. Uses in debug insns are ignored.
595*38fd1498Szrj
596*38fd1498Szrj IT IS NOT ACCEPTABLE TO MANUALLY CHANGE THIS ARRAY. This array
597*38fd1498Szrj always reflects the actual number of refs in the insn stream that
598*38fd1498Szrj satisfy the above criteria. */
599*38fd1498Szrj unsigned int *hard_regs_live_count;
600*38fd1498Szrj
601*38fd1498Szrj /* This counter provides a way to totally order refs without using
602*38fd1498Szrj addresses. It is incremented whenever a ref is created. */
603*38fd1498Szrj unsigned int ref_order;
604*38fd1498Szrj
605*38fd1498Szrj /* Problem specific control information. This is a combination of
606*38fd1498Szrj enum df_changeable_flags values. */
607*38fd1498Szrj int changeable_flags : 8;
608*38fd1498Szrj
609*38fd1498Szrj /* If this is true, then only a subset of the blocks of the program
610*38fd1498Szrj is considered to compute the solutions of dataflow problems. */
611*38fd1498Szrj bool analyze_subset;
612*38fd1498Szrj
613*38fd1498Szrj /* True if someone added or deleted something from regs_ever_live so
614*38fd1498Szrj that the entry and exit blocks need be reprocessed. */
615*38fd1498Szrj bool redo_entry_and_exit;
616*38fd1498Szrj };
617*38fd1498Szrj
618*38fd1498Szrj #define DF_SCAN_BB_INFO(BB) (df_scan_get_bb_info ((BB)->index))
619*38fd1498Szrj #define DF_RD_BB_INFO(BB) (df_rd_get_bb_info ((BB)->index))
620*38fd1498Szrj #define DF_LR_BB_INFO(BB) (df_lr_get_bb_info ((BB)->index))
621*38fd1498Szrj #define DF_LIVE_BB_INFO(BB) (df_live_get_bb_info ((BB)->index))
622*38fd1498Szrj #define DF_WORD_LR_BB_INFO(BB) (df_word_lr_get_bb_info ((BB)->index))
623*38fd1498Szrj #define DF_MD_BB_INFO(BB) (df_md_get_bb_info ((BB)->index))
624*38fd1498Szrj #define DF_MIR_BB_INFO(BB) (df_mir_get_bb_info ((BB)->index))
625*38fd1498Szrj
626*38fd1498Szrj /* Most transformations that wish to use live register analysis will
627*38fd1498Szrj use these macros. This info is the and of the lr and live sets. */
628*38fd1498Szrj #define DF_LIVE_IN(BB) (&DF_LIVE_BB_INFO (BB)->in)
629*38fd1498Szrj #define DF_LIVE_OUT(BB) (&DF_LIVE_BB_INFO (BB)->out)
630*38fd1498Szrj
631*38fd1498Szrj #define DF_MIR_IN(BB) (&DF_MIR_BB_INFO (BB)->in)
632*38fd1498Szrj #define DF_MIR_OUT(BB) (&DF_MIR_BB_INFO (BB)->out)
633*38fd1498Szrj
634*38fd1498Szrj /* These macros are used by passes that are not tolerant of
635*38fd1498Szrj uninitialized variables. This intolerance should eventually
636*38fd1498Szrj be fixed. */
637*38fd1498Szrj #define DF_LR_IN(BB) (&DF_LR_BB_INFO (BB)->in)
638*38fd1498Szrj #define DF_LR_OUT(BB) (&DF_LR_BB_INFO (BB)->out)
639*38fd1498Szrj
640*38fd1498Szrj /* These macros are used by passes that are not tolerant of
641*38fd1498Szrj uninitialized variables. This intolerance should eventually
642*38fd1498Szrj be fixed. */
643*38fd1498Szrj #define DF_WORD_LR_IN(BB) (&DF_WORD_LR_BB_INFO (BB)->in)
644*38fd1498Szrj #define DF_WORD_LR_OUT(BB) (&DF_WORD_LR_BB_INFO (BB)->out)
645*38fd1498Szrj
646*38fd1498Szrj /* Macros to access the elements within the ref structure. */
647*38fd1498Szrj
648*38fd1498Szrj
649*38fd1498Szrj #define DF_REF_REAL_REG(REF) (GET_CODE ((REF)->base.reg) == SUBREG \
650*38fd1498Szrj ? SUBREG_REG ((REF)->base.reg) : ((REF)->base.reg))
651*38fd1498Szrj #define DF_REF_REGNO(REF) ((REF)->base.regno)
652*38fd1498Szrj #define DF_REF_REAL_LOC(REF) (GET_CODE (*((REF)->regular_ref.loc)) == SUBREG \
653*38fd1498Szrj ? &SUBREG_REG (*((REF)->regular_ref.loc)) : ((REF)->regular_ref.loc))
654*38fd1498Szrj #define DF_REF_REG(REF) ((REF)->base.reg)
655*38fd1498Szrj #define DF_REF_LOC(REF) (DF_REF_CLASS (REF) == DF_REF_REGULAR ? \
656*38fd1498Szrj (REF)->regular_ref.loc : NULL)
657*38fd1498Szrj #define DF_REF_BB(REF) (DF_REF_IS_ARTIFICIAL (REF) \
658*38fd1498Szrj ? (REF)->artificial_ref.bb \
659*38fd1498Szrj : BLOCK_FOR_INSN (DF_REF_INSN (REF)))
660*38fd1498Szrj #define DF_REF_BBNO(REF) (DF_REF_BB (REF)->index)
661*38fd1498Szrj #define DF_REF_INSN_INFO(REF) ((REF)->base.insn_info)
662*38fd1498Szrj #define DF_REF_INSN(REF) ((REF)->base.insn_info->insn)
663*38fd1498Szrj #define DF_REF_INSN_UID(REF) (INSN_UID (DF_REF_INSN(REF)))
664*38fd1498Szrj #define DF_REF_CLASS(REF) ((REF)->base.cl)
665*38fd1498Szrj #define DF_REF_TYPE(REF) ((REF)->base.type)
666*38fd1498Szrj #define DF_REF_CHAIN(REF) ((REF)->base.chain)
667*38fd1498Szrj #define DF_REF_ID(REF) ((REF)->base.id)
668*38fd1498Szrj #define DF_REF_FLAGS(REF) ((REF)->base.flags)
669*38fd1498Szrj #define DF_REF_FLAGS_IS_SET(REF, v) ((DF_REF_FLAGS (REF) & (v)) != 0)
670*38fd1498Szrj #define DF_REF_FLAGS_SET(REF, v) (DF_REF_FLAGS (REF) |= (v))
671*38fd1498Szrj #define DF_REF_FLAGS_CLEAR(REF, v) (DF_REF_FLAGS (REF) &= ~(v))
672*38fd1498Szrj #define DF_REF_ORDER(REF) ((REF)->base.ref_order)
673*38fd1498Szrj /* If DF_REF_IS_ARTIFICIAL () is true, this is not a real
674*38fd1498Szrj definition/use, but an artificial one created to model always live
675*38fd1498Szrj registers, eh uses, etc. */
676*38fd1498Szrj #define DF_REF_IS_ARTIFICIAL(REF) (DF_REF_CLASS (REF) == DF_REF_ARTIFICIAL)
677*38fd1498Szrj #define DF_REF_REG_MARK(REF) (DF_REF_FLAGS_SET ((REF),DF_REF_REG_MARKER))
678*38fd1498Szrj #define DF_REF_REG_UNMARK(REF) (DF_REF_FLAGS_CLEAR ((REF),DF_REF_REG_MARKER))
679*38fd1498Szrj #define DF_REF_IS_REG_MARKED(REF) (DF_REF_FLAGS_IS_SET ((REF),DF_REF_REG_MARKER))
680*38fd1498Szrj #define DF_REF_NEXT_LOC(REF) ((REF)->base.next_loc)
681*38fd1498Szrj #define DF_REF_NEXT_REG(REF) ((REF)->base.next_reg)
682*38fd1498Szrj #define DF_REF_PREV_REG(REF) ((REF)->base.prev_reg)
683*38fd1498Szrj /* The following two macros may only be applied if one of
684*38fd1498Szrj DF_REF_SIGN_EXTRACT | DF_REF_ZERO_EXTRACT is true. */
685*38fd1498Szrj #define DF_REF_EXTRACT_WIDTH(REF) ((REF)->extract_ref.width)
686*38fd1498Szrj #define DF_REF_EXTRACT_OFFSET(REF) ((REF)->extract_ref.offset)
687*38fd1498Szrj #define DF_REF_EXTRACT_MODE(REF) ((REF)->extract_ref.mode)
688*38fd1498Szrj
689*38fd1498Szrj /* Macros to determine the reference type. */
690*38fd1498Szrj #define DF_REF_REG_DEF_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_DEF)
691*38fd1498Szrj #define DF_REF_REG_USE_P(REF) (!DF_REF_REG_DEF_P (REF))
692*38fd1498Szrj #define DF_REF_REG_MEM_STORE_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_MEM_STORE)
693*38fd1498Szrj #define DF_REF_REG_MEM_LOAD_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_MEM_LOAD)
694*38fd1498Szrj #define DF_REF_REG_MEM_P(REF) (DF_REF_REG_MEM_STORE_P (REF) \
695*38fd1498Szrj || DF_REF_REG_MEM_LOAD_P (REF))
696*38fd1498Szrj
697*38fd1498Szrj #define DF_MWS_REG_DEF_P(MREF) (DF_MWS_TYPE (MREF) == DF_REF_REG_DEF)
698*38fd1498Szrj #define DF_MWS_REG_USE_P(MREF) (!DF_MWS_REG_DEF_P (MREF))
699*38fd1498Szrj #define DF_MWS_NEXT(MREF) ((MREF)->next)
700*38fd1498Szrj #define DF_MWS_TYPE(MREF) ((MREF)->type)
701*38fd1498Szrj
702*38fd1498Szrj /* Macros to get the refs out of def_info or use_info refs table. If
703*38fd1498Szrj the focus of the dataflow has been set to some subset of blocks
704*38fd1498Szrj with df_set_blocks, these macros will only find the uses and defs
705*38fd1498Szrj in that subset of blocks.
706*38fd1498Szrj
707*38fd1498Szrj These macros should be used with care. The def macros are only
708*38fd1498Szrj usable after a call to df_maybe_reorganize_def_refs and the use
709*38fd1498Szrj macros are only usable after a call to
710*38fd1498Szrj df_maybe_reorganize_use_refs. HOWEVER, BUILDING AND USING THESE
711*38fd1498Szrj ARRAYS ARE A CACHE LOCALITY KILLER. */
712*38fd1498Szrj
713*38fd1498Szrj #define DF_DEFS_TABLE_SIZE() (df->def_info.table_size)
714*38fd1498Szrj #define DF_DEFS_GET(ID) (df->def_info.refs[(ID)])
715*38fd1498Szrj #define DF_DEFS_SET(ID,VAL) (df->def_info.refs[(ID)]=(VAL))
716*38fd1498Szrj #define DF_DEFS_COUNT(ID) (df->def_info.count[(ID)])
717*38fd1498Szrj #define DF_DEFS_BEGIN(ID) (df->def_info.begin[(ID)])
718*38fd1498Szrj #define DF_USES_TABLE_SIZE() (df->use_info.table_size)
719*38fd1498Szrj #define DF_USES_GET(ID) (df->use_info.refs[(ID)])
720*38fd1498Szrj #define DF_USES_SET(ID,VAL) (df->use_info.refs[(ID)]=(VAL))
721*38fd1498Szrj #define DF_USES_COUNT(ID) (df->use_info.count[(ID)])
722*38fd1498Szrj #define DF_USES_BEGIN(ID) (df->use_info.begin[(ID)])
723*38fd1498Szrj
724*38fd1498Szrj /* Macros to access the register information from scan dataflow record. */
725*38fd1498Szrj
726*38fd1498Szrj #define DF_REG_SIZE(DF) (df->regs_inited)
727*38fd1498Szrj #define DF_REG_DEF_GET(REG) (df->def_regs[(REG)])
728*38fd1498Szrj #define DF_REG_DEF_CHAIN(REG) (df->def_regs[(REG)]->reg_chain)
729*38fd1498Szrj #define DF_REG_DEF_COUNT(REG) (df->def_regs[(REG)]->n_refs)
730*38fd1498Szrj #define DF_REG_USE_GET(REG) (df->use_regs[(REG)])
731*38fd1498Szrj #define DF_REG_USE_CHAIN(REG) (df->use_regs[(REG)]->reg_chain)
732*38fd1498Szrj #define DF_REG_USE_COUNT(REG) (df->use_regs[(REG)]->n_refs)
733*38fd1498Szrj #define DF_REG_EQ_USE_GET(REG) (df->eq_use_regs[(REG)])
734*38fd1498Szrj #define DF_REG_EQ_USE_CHAIN(REG) (df->eq_use_regs[(REG)]->reg_chain)
735*38fd1498Szrj #define DF_REG_EQ_USE_COUNT(REG) (df->eq_use_regs[(REG)]->n_refs)
736*38fd1498Szrj
737*38fd1498Szrj /* Macros to access the elements within the reg_info structure table. */
738*38fd1498Szrj
739*38fd1498Szrj #define DF_REGNO_FIRST_DEF(REGNUM) \
740*38fd1498Szrj (DF_REG_DEF_GET(REGNUM) ? DF_REG_DEF_GET (REGNUM) : 0)
741*38fd1498Szrj #define DF_REGNO_LAST_USE(REGNUM) \
742*38fd1498Szrj (DF_REG_USE_GET(REGNUM) ? DF_REG_USE_GET (REGNUM) : 0)
743*38fd1498Szrj
744*38fd1498Szrj /* Macros to access the elements within the insn_info structure table. */
745*38fd1498Szrj
746*38fd1498Szrj #define DF_INSN_SIZE() ((df)->insns_size)
747*38fd1498Szrj #define DF_INSN_INFO_GET(INSN) (df->insns[(INSN_UID (INSN))])
748*38fd1498Szrj #define DF_INSN_INFO_SET(INSN,VAL) (df->insns[(INSN_UID (INSN))]=(VAL))
749*38fd1498Szrj #define DF_INSN_INFO_LUID(II) ((II)->luid)
750*38fd1498Szrj #define DF_INSN_INFO_DEFS(II) ((II)->defs)
751*38fd1498Szrj #define DF_INSN_INFO_USES(II) ((II)->uses)
752*38fd1498Szrj #define DF_INSN_INFO_EQ_USES(II) ((II)->eq_uses)
753*38fd1498Szrj #define DF_INSN_INFO_MWS(II) ((II)->mw_hardregs)
754*38fd1498Szrj
755*38fd1498Szrj #define DF_INSN_LUID(INSN) (DF_INSN_INFO_LUID (DF_INSN_INFO_GET (INSN)))
756*38fd1498Szrj #define DF_INSN_DEFS(INSN) (DF_INSN_INFO_DEFS (DF_INSN_INFO_GET (INSN)))
757*38fd1498Szrj #define DF_INSN_USES(INSN) (DF_INSN_INFO_USES (DF_INSN_INFO_GET (INSN)))
758*38fd1498Szrj #define DF_INSN_EQ_USES(INSN) (DF_INSN_INFO_EQ_USES (DF_INSN_INFO_GET (INSN)))
759*38fd1498Szrj
760*38fd1498Szrj #define DF_INSN_UID_GET(UID) (df->insns[(UID)])
761*38fd1498Szrj #define DF_INSN_UID_SET(UID,VAL) (df->insns[(UID)]=(VAL))
762*38fd1498Szrj #define DF_INSN_UID_SAFE_GET(UID) (((unsigned)(UID) < DF_INSN_SIZE ()) \
763*38fd1498Szrj ? DF_INSN_UID_GET (UID) \
764*38fd1498Szrj : NULL)
765*38fd1498Szrj #define DF_INSN_UID_LUID(INSN) (DF_INSN_UID_GET (INSN)->luid)
766*38fd1498Szrj #define DF_INSN_UID_DEFS(INSN) (DF_INSN_UID_GET (INSN)->defs)
767*38fd1498Szrj #define DF_INSN_UID_USES(INSN) (DF_INSN_UID_GET (INSN)->uses)
768*38fd1498Szrj #define DF_INSN_UID_EQ_USES(INSN) (DF_INSN_UID_GET (INSN)->eq_uses)
769*38fd1498Szrj #define DF_INSN_UID_MWS(INSN) (DF_INSN_UID_GET (INSN)->mw_hardregs)
770*38fd1498Szrj
771*38fd1498Szrj #define FOR_EACH_INSN_INFO_DEF(ITER, INSN) \
772*38fd1498Szrj for (ITER = DF_INSN_INFO_DEFS (INSN); ITER; ITER = DF_REF_NEXT_LOC (ITER))
773*38fd1498Szrj
774*38fd1498Szrj #define FOR_EACH_INSN_INFO_USE(ITER, INSN) \
775*38fd1498Szrj for (ITER = DF_INSN_INFO_USES (INSN); ITER; ITER = DF_REF_NEXT_LOC (ITER))
776*38fd1498Szrj
777*38fd1498Szrj #define FOR_EACH_INSN_INFO_EQ_USE(ITER, INSN) \
778*38fd1498Szrj for (ITER = DF_INSN_INFO_EQ_USES (INSN); ITER; ITER = DF_REF_NEXT_LOC (ITER))
779*38fd1498Szrj
780*38fd1498Szrj #define FOR_EACH_INSN_INFO_MW(ITER, INSN) \
781*38fd1498Szrj for (ITER = DF_INSN_INFO_MWS (INSN); ITER; ITER = DF_MWS_NEXT (ITER))
782*38fd1498Szrj
783*38fd1498Szrj #define FOR_EACH_INSN_DEF(ITER, INSN) \
784*38fd1498Szrj FOR_EACH_INSN_INFO_DEF(ITER, DF_INSN_INFO_GET (INSN))
785*38fd1498Szrj
786*38fd1498Szrj #define FOR_EACH_INSN_USE(ITER, INSN) \
787*38fd1498Szrj FOR_EACH_INSN_INFO_USE(ITER, DF_INSN_INFO_GET (INSN))
788*38fd1498Szrj
789*38fd1498Szrj #define FOR_EACH_INSN_EQ_USE(ITER, INSN) \
790*38fd1498Szrj FOR_EACH_INSN_INFO_EQ_USE(ITER, DF_INSN_INFO_GET (INSN))
791*38fd1498Szrj
792*38fd1498Szrj #define FOR_EACH_ARTIFICIAL_USE(ITER, BB_INDEX) \
793*38fd1498Szrj for (ITER = df_get_artificial_uses (BB_INDEX); ITER; \
794*38fd1498Szrj ITER = DF_REF_NEXT_LOC (ITER))
795*38fd1498Szrj
796*38fd1498Szrj #define FOR_EACH_ARTIFICIAL_DEF(ITER, BB_INDEX) \
797*38fd1498Szrj for (ITER = df_get_artificial_defs (BB_INDEX); ITER; \
798*38fd1498Szrj ITER = DF_REF_NEXT_LOC (ITER))
799*38fd1498Szrj
800*38fd1498Szrj /* An obstack for bitmap not related to specific dataflow problems.
801*38fd1498Szrj This obstack should e.g. be used for bitmaps with a short life time
802*38fd1498Szrj such as temporary bitmaps. This obstack is declared in df-core.c. */
803*38fd1498Szrj
804*38fd1498Szrj extern bitmap_obstack df_bitmap_obstack;
805*38fd1498Szrj
806*38fd1498Szrj
807*38fd1498Szrj /* One of these structures is allocated for every basic block. */
808*38fd1498Szrj struct df_scan_bb_info
809*38fd1498Szrj {
810*38fd1498Szrj /* The entry block has many artificial defs and these are at the
811*38fd1498Szrj bottom of the block.
812*38fd1498Szrj
813*38fd1498Szrj Blocks that are targets of exception edges may have some
814*38fd1498Szrj artificial defs. These are logically located at the top of the
815*38fd1498Szrj block.
816*38fd1498Szrj
817*38fd1498Szrj Blocks that are the targets of non-local goto's have the hard
818*38fd1498Szrj frame pointer defined at the top of the block. */
819*38fd1498Szrj df_ref artificial_defs;
820*38fd1498Szrj
821*38fd1498Szrj /* Blocks that are targets of exception edges may have some
822*38fd1498Szrj artificial uses. These are logically at the top of the block.
823*38fd1498Szrj
824*38fd1498Szrj Most blocks have artificial uses at the bottom of the block. */
825*38fd1498Szrj df_ref artificial_uses;
826*38fd1498Szrj };
827*38fd1498Szrj
828*38fd1498Szrj
829*38fd1498Szrj /* Reaching definitions. All bitmaps are indexed by the id field of
830*38fd1498Szrj the ref except sparse_kill which is indexed by regno. For the
831*38fd1498Szrj LR&RD problem, the kill set is not complete: It does not contain
832*38fd1498Szrj DEFs killed because the set register has died in the LR set. */
833*38fd1498Szrj struct df_rd_bb_info
834*38fd1498Szrj {
835*38fd1498Szrj /* Local sets to describe the basic blocks. */
836*38fd1498Szrj bitmap_head kill;
837*38fd1498Szrj bitmap_head sparse_kill;
838*38fd1498Szrj bitmap_head gen; /* The set of defs generated in this block. */
839*38fd1498Szrj
840*38fd1498Szrj /* The results of the dataflow problem. */
841*38fd1498Szrj bitmap_head in; /* At the top of the block. */
842*38fd1498Szrj bitmap_head out; /* At the bottom of the block. */
843*38fd1498Szrj };
844*38fd1498Szrj
845*38fd1498Szrj
846*38fd1498Szrj /* Multiple reaching definitions. All bitmaps are referenced by the
847*38fd1498Szrj register number. */
848*38fd1498Szrj
849*38fd1498Szrj struct df_md_bb_info
850*38fd1498Szrj {
851*38fd1498Szrj /* Local sets to describe the basic blocks. */
852*38fd1498Szrj bitmap_head gen; /* Partial/conditional definitions live at BB out. */
853*38fd1498Szrj bitmap_head kill; /* Other definitions that are live at BB out. */
854*38fd1498Szrj bitmap_head init; /* Definitions coming from dominance frontier edges. */
855*38fd1498Szrj
856*38fd1498Szrj /* The results of the dataflow problem. */
857*38fd1498Szrj bitmap_head in; /* Just before the block itself. */
858*38fd1498Szrj bitmap_head out; /* At the bottom of the block. */
859*38fd1498Szrj };
860*38fd1498Szrj
861*38fd1498Szrj
862*38fd1498Szrj /* Live registers, a backwards dataflow problem. All bitmaps are
863*38fd1498Szrj referenced by the register number. */
864*38fd1498Szrj
865*38fd1498Szrj struct df_lr_bb_info
866*38fd1498Szrj {
867*38fd1498Szrj /* Local sets to describe the basic blocks. */
868*38fd1498Szrj bitmap_head def; /* The set of registers set in this block
869*38fd1498Szrj - except artificial defs at the top. */
870*38fd1498Szrj bitmap_head use; /* The set of registers used in this block. */
871*38fd1498Szrj
872*38fd1498Szrj /* The results of the dataflow problem. */
873*38fd1498Szrj bitmap_head in; /* Just before the block itself. */
874*38fd1498Szrj bitmap_head out; /* At the bottom of the block. */
875*38fd1498Szrj };
876*38fd1498Szrj
877*38fd1498Szrj
878*38fd1498Szrj /* Uninitialized registers. All bitmaps are referenced by the
879*38fd1498Szrj register number. Anded results of the forwards and backward live
880*38fd1498Szrj info. Note that the forwards live information is not available
881*38fd1498Szrj separately. */
882*38fd1498Szrj struct df_live_bb_info
883*38fd1498Szrj {
884*38fd1498Szrj /* Local sets to describe the basic blocks. */
885*38fd1498Szrj bitmap_head kill; /* The set of registers unset in this block. Calls,
886*38fd1498Szrj for instance, unset registers. */
887*38fd1498Szrj bitmap_head gen; /* The set of registers set in this block. */
888*38fd1498Szrj
889*38fd1498Szrj /* The results of the dataflow problem. */
890*38fd1498Szrj bitmap_head in; /* At the top of the block. */
891*38fd1498Szrj bitmap_head out; /* At the bottom of the block. */
892*38fd1498Szrj };
893*38fd1498Szrj
894*38fd1498Szrj
895*38fd1498Szrj /* Live registers, a backwards dataflow problem. These bitmaps are
896*38fd1498Szrj indexed by 2 * regno for each pseudo and have two entries for each
897*38fd1498Szrj pseudo. Only pseudos that have a size of 2 * UNITS_PER_WORD are
898*38fd1498Szrj meaningfully tracked. */
899*38fd1498Szrj
900*38fd1498Szrj struct df_word_lr_bb_info
901*38fd1498Szrj {
902*38fd1498Szrj /* Local sets to describe the basic blocks. */
903*38fd1498Szrj bitmap_head def; /* The set of registers set in this block
904*38fd1498Szrj - except artificial defs at the top. */
905*38fd1498Szrj bitmap_head use; /* The set of registers used in this block. */
906*38fd1498Szrj
907*38fd1498Szrj /* The results of the dataflow problem. */
908*38fd1498Szrj bitmap_head in; /* Just before the block itself. */
909*38fd1498Szrj bitmap_head out; /* At the bottom of the block. */
910*38fd1498Szrj };
911*38fd1498Szrj
912*38fd1498Szrj /* Must-initialized registers. All bitmaps are referenced by the
913*38fd1498Szrj register number. */
914*38fd1498Szrj struct df_mir_bb_info
915*38fd1498Szrj {
916*38fd1498Szrj /* Local sets to describe the basic blocks. */
917*38fd1498Szrj bitmap_head kill; /* The set of registers unset in this block. Calls,
918*38fd1498Szrj for instance, unset registers. */
919*38fd1498Szrj bitmap_head gen; /* The set of registers set in this block, excluding the
920*38fd1498Szrj ones killed later on in this block. */
921*38fd1498Szrj
922*38fd1498Szrj /* The results of the dataflow problem. */
923*38fd1498Szrj bitmap_head in; /* At the top of the block. */
924*38fd1498Szrj bitmap_head out; /* At the bottom of the block. */
925*38fd1498Szrj };
926*38fd1498Szrj
927*38fd1498Szrj
928*38fd1498Szrj /* This is used for debugging and for the dumpers to find the latest
929*38fd1498Szrj instance so that the df info can be added to the dumps. This
930*38fd1498Szrj should not be used by regular code. */
931*38fd1498Szrj extern struct df_d *df;
932*38fd1498Szrj #define df_scan (df->problems_by_index[DF_SCAN])
933*38fd1498Szrj #define df_rd (df->problems_by_index[DF_RD])
934*38fd1498Szrj #define df_lr (df->problems_by_index[DF_LR])
935*38fd1498Szrj #define df_live (df->problems_by_index[DF_LIVE])
936*38fd1498Szrj #define df_chain (df->problems_by_index[DF_CHAIN])
937*38fd1498Szrj #define df_word_lr (df->problems_by_index[DF_WORD_LR])
938*38fd1498Szrj #define df_note (df->problems_by_index[DF_NOTE])
939*38fd1498Szrj #define df_md (df->problems_by_index[DF_MD])
940*38fd1498Szrj #define df_mir (df->problems_by_index[DF_MIR])
941*38fd1498Szrj
942*38fd1498Szrj /* This symbol turns on checking that each modification of the cfg has
943*38fd1498Szrj been identified to the appropriate df routines. It is not part of
944*38fd1498Szrj verification per se because the check that the final solution has
945*38fd1498Szrj not changed covers this. However, if the solution is not being
946*38fd1498Szrj properly recomputed because the cfg is being modified, adding in
947*38fd1498Szrj calls to df_check_cfg_clean can be used to find the source of that
948*38fd1498Szrj kind of problem. */
949*38fd1498Szrj #if 0
950*38fd1498Szrj #define DF_DEBUG_CFG
951*38fd1498Szrj #endif
952*38fd1498Szrj
953*38fd1498Szrj
954*38fd1498Szrj /* Functions defined in df-core.c. */
955*38fd1498Szrj
956*38fd1498Szrj extern void df_add_problem (const struct df_problem *);
957*38fd1498Szrj extern int df_set_flags (int);
958*38fd1498Szrj extern int df_clear_flags (int);
959*38fd1498Szrj extern void df_set_blocks (bitmap);
960*38fd1498Szrj extern void df_remove_problem (struct dataflow *);
961*38fd1498Szrj extern void df_finish_pass (bool);
962*38fd1498Szrj extern void df_analyze_problem (struct dataflow *, bitmap, int *, int);
963*38fd1498Szrj extern void df_analyze ();
964*38fd1498Szrj extern void df_analyze_loop (struct loop *);
965*38fd1498Szrj extern int df_get_n_blocks (enum df_flow_dir);
966*38fd1498Szrj extern int *df_get_postorder (enum df_flow_dir);
967*38fd1498Szrj extern void df_simple_dataflow (enum df_flow_dir, df_init_function,
968*38fd1498Szrj df_confluence_function_0, df_confluence_function_n,
969*38fd1498Szrj df_transfer_function, bitmap, int *, int);
970*38fd1498Szrj extern void df_mark_solutions_dirty (void);
971*38fd1498Szrj extern bool df_get_bb_dirty (basic_block);
972*38fd1498Szrj extern void df_set_bb_dirty (basic_block);
973*38fd1498Szrj extern void df_compact_blocks (void);
974*38fd1498Szrj extern void df_bb_replace (int, basic_block);
975*38fd1498Szrj extern void df_bb_delete (int);
976*38fd1498Szrj extern void df_verify (void);
977*38fd1498Szrj #ifdef DF_DEBUG_CFG
978*38fd1498Szrj extern void df_check_cfg_clean (void);
979*38fd1498Szrj #endif
980*38fd1498Szrj extern df_ref df_bb_regno_first_def_find (basic_block, unsigned int);
981*38fd1498Szrj extern df_ref df_bb_regno_last_def_find (basic_block, unsigned int);
982*38fd1498Szrj extern df_ref df_find_def (rtx_insn *, rtx);
983*38fd1498Szrj extern bool df_reg_defined (rtx_insn *, rtx);
984*38fd1498Szrj extern df_ref df_find_use (rtx_insn *, rtx);
985*38fd1498Szrj extern bool df_reg_used (rtx_insn *, rtx);
986*38fd1498Szrj extern void df_worklist_dataflow (struct dataflow *,bitmap, int *, int);
987*38fd1498Szrj extern void df_print_regset (FILE *file, bitmap r);
988*38fd1498Szrj extern void df_print_word_regset (FILE *file, bitmap r);
989*38fd1498Szrj extern void df_dump (FILE *);
990*38fd1498Szrj extern void df_dump_region (FILE *);
991*38fd1498Szrj extern void df_dump_start (FILE *);
992*38fd1498Szrj extern void df_dump_top (basic_block, FILE *);
993*38fd1498Szrj extern void df_dump_bottom (basic_block, FILE *);
994*38fd1498Szrj extern void df_dump_insn_top (const rtx_insn *, FILE *);
995*38fd1498Szrj extern void df_dump_insn_bottom (const rtx_insn *, FILE *);
996*38fd1498Szrj extern void df_refs_chain_dump (df_ref, bool, FILE *);
997*38fd1498Szrj extern void df_regs_chain_dump (df_ref, FILE *);
998*38fd1498Szrj extern void df_insn_debug (rtx_insn *, bool, FILE *);
999*38fd1498Szrj extern void df_insn_debug_regno (rtx_insn *, FILE *);
1000*38fd1498Szrj extern void df_regno_debug (unsigned int, FILE *);
1001*38fd1498Szrj extern void df_ref_debug (df_ref, FILE *);
1002*38fd1498Szrj extern void debug_df_insn (rtx_insn *);
1003*38fd1498Szrj extern void debug_df_regno (unsigned int);
1004*38fd1498Szrj extern void debug_df_reg (rtx);
1005*38fd1498Szrj extern void debug_df_defno (unsigned int);
1006*38fd1498Szrj extern void debug_df_useno (unsigned int);
1007*38fd1498Szrj extern void debug_df_ref (df_ref);
1008*38fd1498Szrj extern void debug_df_chain (struct df_link *);
1009*38fd1498Szrj
1010*38fd1498Szrj /* Functions defined in df-problems.c. */
1011*38fd1498Szrj
1012*38fd1498Szrj extern struct df_link *df_chain_create (df_ref, df_ref);
1013*38fd1498Szrj extern void df_chain_unlink (df_ref);
1014*38fd1498Szrj extern void df_chain_copy (df_ref, struct df_link *);
1015*38fd1498Szrj extern void df_grow_bb_info (struct dataflow *);
1016*38fd1498Szrj extern void df_chain_dump (struct df_link *, FILE *);
1017*38fd1498Szrj extern void df_print_bb_index (basic_block bb, FILE *file);
1018*38fd1498Szrj extern void df_rd_add_problem (void);
1019*38fd1498Szrj extern void df_rd_simulate_artificial_defs_at_top (basic_block, bitmap);
1020*38fd1498Szrj extern void df_rd_simulate_one_insn (basic_block, rtx_insn *, bitmap);
1021*38fd1498Szrj extern void df_lr_add_problem (void);
1022*38fd1498Szrj extern void df_lr_verify_transfer_functions (void);
1023*38fd1498Szrj extern void df_live_verify_transfer_functions (void);
1024*38fd1498Szrj extern void df_live_add_problem (void);
1025*38fd1498Szrj extern void df_live_set_all_dirty (void);
1026*38fd1498Szrj extern void df_chain_add_problem (unsigned int);
1027*38fd1498Szrj extern void df_word_lr_add_problem (void);
1028*38fd1498Szrj extern bool df_word_lr_mark_ref (df_ref, bool, bitmap);
1029*38fd1498Szrj extern bool df_word_lr_simulate_defs (rtx_insn *, bitmap);
1030*38fd1498Szrj extern void df_word_lr_simulate_uses (rtx_insn *, bitmap);
1031*38fd1498Szrj extern void df_word_lr_simulate_artificial_refs_at_top (basic_block, bitmap);
1032*38fd1498Szrj extern void df_word_lr_simulate_artificial_refs_at_end (basic_block, bitmap);
1033*38fd1498Szrj extern void df_note_add_problem (void);
1034*38fd1498Szrj extern void df_md_add_problem (void);
1035*38fd1498Szrj extern void df_md_simulate_artificial_defs_at_top (basic_block, bitmap);
1036*38fd1498Szrj extern void df_md_simulate_one_insn (basic_block, rtx_insn *, bitmap);
1037*38fd1498Szrj extern void df_mir_add_problem (void);
1038*38fd1498Szrj extern void df_mir_simulate_one_insn (basic_block, rtx_insn *, bitmap, bitmap);
1039*38fd1498Szrj extern void df_simulate_find_noclobber_defs (rtx_insn *, bitmap);
1040*38fd1498Szrj extern void df_simulate_find_defs (rtx_insn *, bitmap);
1041*38fd1498Szrj extern void df_simulate_defs (rtx_insn *, bitmap);
1042*38fd1498Szrj extern void df_simulate_uses (rtx_insn *, bitmap);
1043*38fd1498Szrj extern void df_simulate_initialize_backwards (basic_block, bitmap);
1044*38fd1498Szrj extern void df_simulate_one_insn_backwards (basic_block, rtx_insn *, bitmap);
1045*38fd1498Szrj extern void df_simulate_finalize_backwards (basic_block, bitmap);
1046*38fd1498Szrj extern void df_simulate_initialize_forwards (basic_block, bitmap);
1047*38fd1498Szrj extern void df_simulate_one_insn_forwards (basic_block, rtx_insn *, bitmap);
1048*38fd1498Szrj extern void simulate_backwards_to_point (basic_block, regset, rtx);
1049*38fd1498Szrj extern bool can_move_insns_across (rtx_insn *, rtx_insn *,
1050*38fd1498Szrj rtx_insn *, rtx_insn *,
1051*38fd1498Szrj basic_block, regset,
1052*38fd1498Szrj regset, rtx_insn **);
1053*38fd1498Szrj /* Functions defined in df-scan.c. */
1054*38fd1498Szrj
1055*38fd1498Szrj extern void df_scan_alloc (bitmap);
1056*38fd1498Szrj extern void df_scan_add_problem (void);
1057*38fd1498Szrj extern void df_grow_reg_info (void);
1058*38fd1498Szrj extern void df_grow_insn_info (void);
1059*38fd1498Szrj extern void df_scan_blocks (void);
1060*38fd1498Szrj extern void df_uses_create (rtx *, rtx_insn *, int);
1061*38fd1498Szrj extern struct df_insn_info * df_insn_create_insn_record (rtx_insn *);
1062*38fd1498Szrj extern void df_insn_delete (rtx_insn *);
1063*38fd1498Szrj extern void df_bb_refs_record (int, bool);
1064*38fd1498Szrj extern bool df_insn_rescan (rtx_insn *);
1065*38fd1498Szrj extern bool df_insn_rescan_debug_internal (rtx_insn *);
1066*38fd1498Szrj extern void df_insn_rescan_all (void);
1067*38fd1498Szrj extern void df_process_deferred_rescans (void);
1068*38fd1498Szrj extern void df_recompute_luids (basic_block);
1069*38fd1498Szrj extern void df_insn_change_bb (rtx_insn *, basic_block);
1070*38fd1498Szrj extern void df_maybe_reorganize_use_refs (enum df_ref_order);
1071*38fd1498Szrj extern void df_maybe_reorganize_def_refs (enum df_ref_order);
1072*38fd1498Szrj extern void df_ref_change_reg_with_loc (rtx, unsigned int);
1073*38fd1498Szrj extern void df_notes_rescan (rtx_insn *);
1074*38fd1498Szrj extern void df_hard_reg_init (void);
1075*38fd1498Szrj extern void df_update_entry_block_defs (void);
1076*38fd1498Szrj extern void df_update_exit_block_uses (void);
1077*38fd1498Szrj extern void df_update_entry_exit_and_calls (void);
1078*38fd1498Szrj extern bool df_hard_reg_used_p (unsigned int);
1079*38fd1498Szrj extern unsigned int df_hard_reg_used_count (unsigned int);
1080*38fd1498Szrj extern bool df_regs_ever_live_p (unsigned int);
1081*38fd1498Szrj extern void df_set_regs_ever_live (unsigned int, bool);
1082*38fd1498Szrj extern void df_compute_regs_ever_live (bool);
1083*38fd1498Szrj extern void df_scan_verify (void);
1084*38fd1498Szrj
1085*38fd1498Szrj
1086*38fd1498Szrj /*----------------------------------------------------------------------------
1087*38fd1498Szrj Public functions access functions for the dataflow problems.
1088*38fd1498Szrj ----------------------------------------------------------------------------*/
1089*38fd1498Szrj
1090*38fd1498Szrj static inline struct df_scan_bb_info *
df_scan_get_bb_info(unsigned int index)1091*38fd1498Szrj df_scan_get_bb_info (unsigned int index)
1092*38fd1498Szrj {
1093*38fd1498Szrj if (index < df_scan->block_info_size)
1094*38fd1498Szrj return &((struct df_scan_bb_info *) df_scan->block_info)[index];
1095*38fd1498Szrj else
1096*38fd1498Szrj return NULL;
1097*38fd1498Szrj }
1098*38fd1498Szrj
1099*38fd1498Szrj static inline struct df_rd_bb_info *
df_rd_get_bb_info(unsigned int index)1100*38fd1498Szrj df_rd_get_bb_info (unsigned int index)
1101*38fd1498Szrj {
1102*38fd1498Szrj if (index < df_rd->block_info_size)
1103*38fd1498Szrj return &((struct df_rd_bb_info *) df_rd->block_info)[index];
1104*38fd1498Szrj else
1105*38fd1498Szrj return NULL;
1106*38fd1498Szrj }
1107*38fd1498Szrj
1108*38fd1498Szrj static inline struct df_lr_bb_info *
df_lr_get_bb_info(unsigned int index)1109*38fd1498Szrj df_lr_get_bb_info (unsigned int index)
1110*38fd1498Szrj {
1111*38fd1498Szrj if (index < df_lr->block_info_size)
1112*38fd1498Szrj return &((struct df_lr_bb_info *) df_lr->block_info)[index];
1113*38fd1498Szrj else
1114*38fd1498Szrj return NULL;
1115*38fd1498Szrj }
1116*38fd1498Szrj
1117*38fd1498Szrj static inline struct df_md_bb_info *
df_md_get_bb_info(unsigned int index)1118*38fd1498Szrj df_md_get_bb_info (unsigned int index)
1119*38fd1498Szrj {
1120*38fd1498Szrj if (index < df_md->block_info_size)
1121*38fd1498Szrj return &((struct df_md_bb_info *) df_md->block_info)[index];
1122*38fd1498Szrj else
1123*38fd1498Szrj return NULL;
1124*38fd1498Szrj }
1125*38fd1498Szrj
1126*38fd1498Szrj static inline struct df_live_bb_info *
df_live_get_bb_info(unsigned int index)1127*38fd1498Szrj df_live_get_bb_info (unsigned int index)
1128*38fd1498Szrj {
1129*38fd1498Szrj if (index < df_live->block_info_size)
1130*38fd1498Szrj return &((struct df_live_bb_info *) df_live->block_info)[index];
1131*38fd1498Szrj else
1132*38fd1498Szrj return NULL;
1133*38fd1498Szrj }
1134*38fd1498Szrj
1135*38fd1498Szrj static inline struct df_word_lr_bb_info *
df_word_lr_get_bb_info(unsigned int index)1136*38fd1498Szrj df_word_lr_get_bb_info (unsigned int index)
1137*38fd1498Szrj {
1138*38fd1498Szrj if (index < df_word_lr->block_info_size)
1139*38fd1498Szrj return &((struct df_word_lr_bb_info *) df_word_lr->block_info)[index];
1140*38fd1498Szrj else
1141*38fd1498Szrj return NULL;
1142*38fd1498Szrj }
1143*38fd1498Szrj
1144*38fd1498Szrj static inline struct df_mir_bb_info *
df_mir_get_bb_info(unsigned int index)1145*38fd1498Szrj df_mir_get_bb_info (unsigned int index)
1146*38fd1498Szrj {
1147*38fd1498Szrj if (index < df_mir->block_info_size)
1148*38fd1498Szrj return &((struct df_mir_bb_info *) df_mir->block_info)[index];
1149*38fd1498Szrj else
1150*38fd1498Szrj return NULL;
1151*38fd1498Szrj }
1152*38fd1498Szrj
1153*38fd1498Szrj /* Get the live at out set for BB no matter what problem happens to be
1154*38fd1498Szrj defined. This function is used by the register allocators who
1155*38fd1498Szrj choose different dataflow problems depending on the optimization
1156*38fd1498Szrj level. */
1157*38fd1498Szrj
1158*38fd1498Szrj static inline bitmap
df_get_live_out(basic_block bb)1159*38fd1498Szrj df_get_live_out (basic_block bb)
1160*38fd1498Szrj {
1161*38fd1498Szrj gcc_checking_assert (df_lr);
1162*38fd1498Szrj
1163*38fd1498Szrj if (df_live)
1164*38fd1498Szrj return DF_LIVE_OUT (bb);
1165*38fd1498Szrj else
1166*38fd1498Szrj return DF_LR_OUT (bb);
1167*38fd1498Szrj }
1168*38fd1498Szrj
1169*38fd1498Szrj /* Get the live at in set for BB no matter what problem happens to be
1170*38fd1498Szrj defined. This function is used by the register allocators who
1171*38fd1498Szrj choose different dataflow problems depending on the optimization
1172*38fd1498Szrj level. */
1173*38fd1498Szrj
1174*38fd1498Szrj static inline bitmap
df_get_live_in(basic_block bb)1175*38fd1498Szrj df_get_live_in (basic_block bb)
1176*38fd1498Szrj {
1177*38fd1498Szrj gcc_checking_assert (df_lr);
1178*38fd1498Szrj
1179*38fd1498Szrj if (df_live)
1180*38fd1498Szrj return DF_LIVE_IN (bb);
1181*38fd1498Szrj else
1182*38fd1498Szrj return DF_LR_IN (bb);
1183*38fd1498Szrj }
1184*38fd1498Szrj
1185*38fd1498Szrj /* Get basic block info. */
1186*38fd1498Szrj /* Get the artificial defs for a basic block. */
1187*38fd1498Szrj
1188*38fd1498Szrj static inline df_ref
df_get_artificial_defs(unsigned int bb_index)1189*38fd1498Szrj df_get_artificial_defs (unsigned int bb_index)
1190*38fd1498Szrj {
1191*38fd1498Szrj return df_scan_get_bb_info (bb_index)->artificial_defs;
1192*38fd1498Szrj }
1193*38fd1498Szrj
1194*38fd1498Szrj
1195*38fd1498Szrj /* Get the artificial uses for a basic block. */
1196*38fd1498Szrj
1197*38fd1498Szrj static inline df_ref
df_get_artificial_uses(unsigned int bb_index)1198*38fd1498Szrj df_get_artificial_uses (unsigned int bb_index)
1199*38fd1498Szrj {
1200*38fd1498Szrj return df_scan_get_bb_info (bb_index)->artificial_uses;
1201*38fd1498Szrj }
1202*38fd1498Szrj
1203*38fd1498Szrj /* If INSN defines exactly one register, return the associated reference,
1204*38fd1498Szrj otherwise return null. */
1205*38fd1498Szrj
1206*38fd1498Szrj static inline df_ref
df_single_def(const df_insn_info * info)1207*38fd1498Szrj df_single_def (const df_insn_info *info)
1208*38fd1498Szrj {
1209*38fd1498Szrj df_ref defs = DF_INSN_INFO_DEFS (info);
1210*38fd1498Szrj return defs && !DF_REF_NEXT_LOC (defs) ? defs : NULL;
1211*38fd1498Szrj }
1212*38fd1498Szrj
1213*38fd1498Szrj /* If INSN uses exactly one register, return the associated reference,
1214*38fd1498Szrj otherwise return null. */
1215*38fd1498Szrj
1216*38fd1498Szrj static inline df_ref
df_single_use(const df_insn_info * info)1217*38fd1498Szrj df_single_use (const df_insn_info *info)
1218*38fd1498Szrj {
1219*38fd1498Szrj df_ref uses = DF_INSN_INFO_USES (info);
1220*38fd1498Szrj return uses && !DF_REF_NEXT_LOC (uses) ? uses : NULL;
1221*38fd1498Szrj }
1222*38fd1498Szrj
1223*38fd1498Szrj /* web */
1224*38fd1498Szrj
1225*38fd1498Szrj class web_entry_base
1226*38fd1498Szrj {
1227*38fd1498Szrj private:
1228*38fd1498Szrj /* Reference to the parent in the union/find tree. */
1229*38fd1498Szrj web_entry_base *pred_pvt;
1230*38fd1498Szrj
1231*38fd1498Szrj public:
1232*38fd1498Szrj /* Accessors. */
pred()1233*38fd1498Szrj web_entry_base *pred () { return pred_pvt; }
set_pred(web_entry_base * p)1234*38fd1498Szrj void set_pred (web_entry_base *p) { pred_pvt = p; }
1235*38fd1498Szrj
1236*38fd1498Szrj /* Find representative in union-find tree. */
1237*38fd1498Szrj web_entry_base *unionfind_root ();
1238*38fd1498Szrj
1239*38fd1498Szrj /* Union with another set, returning TRUE if they are already unioned. */
1240*38fd1498Szrj friend bool unionfind_union (web_entry_base *first, web_entry_base *second);
1241*38fd1498Szrj };
1242*38fd1498Szrj
1243*38fd1498Szrj #endif /* GCC_DF_H */
1244