Branch data Line data Source code
1 : : /* Allocation for dataflow support routines.
2 : : Copyright (C) 1999-2024 Free Software Foundation, Inc.
3 : : Originally contributed by Michael P. Hayes
4 : : (m.hayes@elec.canterbury.ac.nz, mhayes@redhat.com)
5 : : Major rewrite contributed by Danny Berlin (dberlin@dberlin.org)
6 : : and Kenneth Zadeck (zadeck@naturalbridge.com).
7 : :
8 : : This file is part of GCC.
9 : :
10 : : GCC is free software; you can redistribute it and/or modify it under
11 : : the terms of the GNU General Public License as published by the Free
12 : : Software Foundation; either version 3, or (at your option) any later
13 : : version.
14 : :
15 : : GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 : : WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 : : FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 : : for more details.
19 : :
20 : : You should have received a copy of the GNU General Public License
21 : : along with GCC; see the file COPYING3. If not see
22 : : <http://www.gnu.org/licenses/>. */
23 : :
24 : : /*
25 : : OVERVIEW:
26 : :
27 : : The files in this collection (df*.c,df.h) provide a general framework
28 : : for solving dataflow problems. The global dataflow is performed using
29 : : a good implementation of iterative dataflow analysis.
30 : :
31 : : The file df-problems.cc provides problem instance for the most common
32 : : dataflow problems: reaching defs, upward exposed uses, live variables,
33 : : uninitialized variables, def-use chains, and use-def chains. However,
34 : : the interface allows other dataflow problems to be defined as well.
35 : :
36 : : Dataflow analysis is available in most of the rtl backend (the parts
37 : : between pass_df_initialize and pass_df_finish). It is quite likely
38 : : that these boundaries will be expanded in the future. The only
39 : : requirement is that there be a correct control flow graph.
40 : :
41 : : There are three variations of the live variable problem that are
42 : : available whenever dataflow is available. The LR problem finds the
43 : : areas that can reach a use of a variable, the UR problems finds the
44 : : areas that can be reached from a definition of a variable. The LIVE
45 : : problem finds the intersection of these two areas.
46 : :
47 : : There are several optional problems. These can be enabled when they
48 : : are needed and disabled when they are not needed.
49 : :
50 : : Dataflow problems are generally solved in three layers. The bottom
51 : : layer is called scanning where a data structure is built for each rtl
52 : : insn that describes the set of defs and uses of that insn. Scanning
53 : : is generally kept up to date, i.e. as the insns changes, the scanned
54 : : version of that insn changes also. There are various mechanisms for
55 : : making this happen and are described in the INCREMENTAL SCANNING
56 : : section.
57 : :
58 : : In the middle layer, basic blocks are scanned to produce transfer
59 : : functions which describe the effects of that block on the global
60 : : dataflow solution. The transfer functions are only rebuilt if the
61 : : some instruction within the block has changed.
62 : :
63 : : The top layer is the dataflow solution itself. The dataflow solution
64 : : is computed by using an efficient iterative solver and the transfer
65 : : functions. The dataflow solution must be recomputed whenever the
66 : : control changes or if one of the transfer function changes.
67 : :
68 : :
69 : : USAGE:
70 : :
71 : : Here is an example of using the dataflow routines.
72 : :
73 : : df_[chain,live,note,rd]_add_problem (flags);
74 : :
75 : : df_set_blocks (blocks);
76 : :
77 : : df_analyze ();
78 : :
79 : : df_dump (stderr);
80 : :
81 : : df_finish_pass (false);
82 : :
83 : : DF_[chain,live,note,rd]_ADD_PROBLEM adds a problem, defined by an
84 : : instance to struct df_problem, to the set of problems solved in this
85 : : instance of df. All calls to add a problem for a given instance of df
86 : : must occur before the first call to DF_ANALYZE.
87 : :
88 : : Problems can be dependent on other problems. For instance, solving
89 : : def-use or use-def chains is dependent on solving reaching
90 : : definitions. As long as these dependencies are listed in the problem
91 : : definition, the order of adding the problems is not material.
92 : : Otherwise, the problems will be solved in the order of calls to
93 : : df_add_problem. Note that it is not necessary to have a problem. In
94 : : that case, df will just be used to do the scanning.
95 : :
96 : :
97 : :
98 : : DF_SET_BLOCKS is an optional call used to define a region of the
99 : : function on which the analysis will be performed. The normal case is
100 : : to analyze the entire function and no call to df_set_blocks is made.
101 : : DF_SET_BLOCKS only effects the blocks that are effected when computing
102 : : the transfer functions and final solution. The insn level information
103 : : is always kept up to date.
104 : :
105 : : When a subset is given, the analysis behaves as if the function only
106 : : contains those blocks and any edges that occur directly between the
107 : : blocks in the set. Care should be taken to call df_set_blocks right
108 : : before the call to analyze in order to eliminate the possibility that
109 : : optimizations that reorder blocks invalidate the bitvector.
110 : :
111 : : DF_ANALYZE causes all of the defined problems to be (re)solved. When
112 : : DF_ANALYZE is completes, the IN and OUT sets for each basic block
113 : : contain the computer information. The DF_*_BB_INFO macros can be used
114 : : to access these bitvectors. All deferred rescannings are down before
115 : : the transfer functions are recomputed.
116 : :
117 : : DF_DUMP can then be called to dump the information produce to some
118 : : file. This calls DF_DUMP_START, to print the information that is not
119 : : basic block specific, and then calls DF_DUMP_TOP and DF_DUMP_BOTTOM
120 : : for each block to print the basic specific information. These parts
121 : : can all be called separately as part of a larger dump function.
122 : :
123 : :
124 : : DF_FINISH_PASS causes df_remove_problem to be called on all of the
125 : : optional problems. It also causes any insns whose scanning has been
126 : : deferred to be rescanned as well as clears all of the changeable flags.
127 : : Setting the pass manager TODO_df_finish flag causes this function to
128 : : be run. However, the pass manager will call df_finish_pass AFTER the
129 : : pass dumping has been done, so if you want to see the results of the
130 : : optional problems in the pass dumps, use the TODO flag rather than
131 : : calling the function yourself.
132 : :
133 : : INCREMENTAL SCANNING
134 : :
135 : : There are four ways of doing the incremental scanning:
136 : :
137 : : 1) Immediate rescanning - Calls to df_insn_rescan, df_notes_rescan,
138 : : df_bb_delete, df_insn_change_bb have been added to most of
139 : : the low level service functions that maintain the cfg and change
140 : : rtl. Calling and of these routines many cause some number of insns
141 : : to be rescanned.
142 : :
143 : : For most modern rtl passes, this is certainly the easiest way to
144 : : manage rescanning the insns. This technique also has the advantage
145 : : that the scanning information is always correct and can be relied
146 : : upon even after changes have been made to the instructions. This
147 : : technique is contra indicated in several cases:
148 : :
149 : : a) If def-use chains OR use-def chains (but not both) are built,
150 : : using this is SIMPLY WRONG. The problem is that when a ref is
151 : : deleted that is the target of an edge, there is not enough
152 : : information to efficiently find the source of the edge and
153 : : delete the edge. This leaves a dangling reference that may
154 : : cause problems.
155 : :
156 : : b) If def-use chains AND use-def chains are built, this may
157 : : produce unexpected results. The problem is that the incremental
158 : : scanning of an insn does not know how to repair the chains that
159 : : point into an insn when the insn changes. So the incremental
160 : : scanning just deletes the chains that enter and exit the insn
161 : : being changed. The dangling reference issue in (a) is not a
162 : : problem here, but if the pass is depending on the chains being
163 : : maintained after insns have been modified, this technique will
164 : : not do the correct thing.
165 : :
166 : : c) If the pass modifies insns several times, this incremental
167 : : updating may be expensive.
168 : :
169 : : d) If the pass modifies all of the insns, as does register
170 : : allocation, it is simply better to rescan the entire function.
171 : :
172 : : 2) Deferred rescanning - Calls to df_insn_rescan, df_notes_rescan, and
173 : : df_insn_delete do not immediately change the insn but instead make
174 : : a note that the insn needs to be rescanned. The next call to
175 : : df_analyze, df_finish_pass, or df_process_deferred_rescans will
176 : : cause all of the pending rescans to be processed.
177 : :
178 : : This is the technique of choice if either 1a, 1b, or 1c are issues
179 : : in the pass. In the case of 1a or 1b, a call to df_finish_pass
180 : : (either manually or via TODO_df_finish) should be made before the
181 : : next call to df_analyze or df_process_deferred_rescans.
182 : :
183 : : This mode is also used by a few passes that still rely on note_uses,
184 : : note_stores and rtx iterators instead of using the DF data. This
185 : : can be said to fall under case 1c.
186 : :
187 : : To enable this mode, call df_set_flags (DF_DEFER_INSN_RESCAN).
188 : : (This mode can be cleared by calling df_clear_flags
189 : : (DF_DEFER_INSN_RESCAN) but this does not cause the deferred insns to
190 : : be rescanned.
191 : :
192 : : 3) Total rescanning - In this mode the rescanning is disabled.
193 : : Only when insns are deleted is the df information associated with
194 : : it also deleted. At the end of the pass, a call must be made to
195 : : df_insn_rescan_all. This method is used by the register allocator
196 : : since it generally changes each insn multiple times (once for each ref)
197 : : and does not need to make use of the updated scanning information.
198 : :
199 : : 4) Do it yourself - In this mechanism, the pass updates the insns
200 : : itself using the low level df primitives. Currently no pass does
201 : : this, but it has the advantage that it is quite efficient given
202 : : that the pass generally has exact knowledge of what it is changing.
203 : :
204 : : DATA STRUCTURES
205 : :
206 : : Scanning produces a `struct df_ref' data structure (ref) is allocated
207 : : for every register reference (def or use) and this records the insn
208 : : and bb the ref is found within. The refs are linked together in
209 : : chains of uses and defs for each insn and for each register. Each ref
210 : : also has a chain field that links all the use refs for a def or all
211 : : the def refs for a use. This is used to create use-def or def-use
212 : : chains.
213 : :
214 : : Different optimizations have different needs. Ultimately, only
215 : : register allocation and schedulers should be using the bitmaps
216 : : produced for the live register and uninitialized register problems.
217 : : The rest of the backend should be upgraded to using and maintaining
218 : : the linked information such as def use or use def chains.
219 : :
220 : :
221 : : PHILOSOPHY:
222 : :
223 : : While incremental bitmaps are not worthwhile to maintain, incremental
224 : : chains may be perfectly reasonable. The fastest way to build chains
225 : : from scratch or after significant modifications is to build reaching
226 : : definitions (RD) and build the chains from this.
227 : :
228 : : However, general algorithms for maintaining use-def or def-use chains
229 : : are not practical. The amount of work to recompute the chain any
230 : : chain after an arbitrary change is large. However, with a modest
231 : : amount of work it is generally possible to have the application that
232 : : uses the chains keep them up to date. The high level knowledge of
233 : : what is really happening is essential to crafting efficient
234 : : incremental algorithms.
235 : :
236 : : As for the bit vector problems, there is no interface to give a set of
237 : : blocks over with to resolve the iteration. In general, restarting a
238 : : dataflow iteration is difficult and expensive. Again, the best way to
239 : : keep the dataflow information up to data (if this is really what is
240 : : needed) it to formulate a problem specific solution.
241 : :
242 : : There are fine grained calls for creating and deleting references from
243 : : instructions in df-scan.cc. However, these are not currently connected
244 : : to the engine that resolves the dataflow equations.
245 : :
246 : :
247 : : DATA STRUCTURES:
248 : :
249 : : The basic object is a DF_REF (reference) and this may either be a
250 : : DEF (definition) or a USE of a register.
251 : :
252 : : These are linked into a variety of lists; namely reg-def, reg-use,
253 : : insn-def, insn-use, def-use, and use-def lists. For example, the
254 : : reg-def lists contain all the locations that define a given register
255 : : while the insn-use lists contain all the locations that use a
256 : : register.
257 : :
258 : : Note that the reg-def and reg-use chains are generally short for
259 : : pseudos and long for the hard registers.
260 : :
261 : : ACCESSING INSNS:
262 : :
263 : : 1) The df insn information is kept in an array of DF_INSN_INFO objects.
264 : : The array is indexed by insn uid, and every DF_REF points to the
265 : : DF_INSN_INFO object of the insn that contains the reference.
266 : :
267 : : 2) Each insn has three sets of refs, which are linked into one of three
268 : : lists: The insn's defs list (accessed by the DF_INSN_INFO_DEFS,
269 : : DF_INSN_DEFS, or DF_INSN_UID_DEFS macros), the insn's uses list
270 : : (accessed by the DF_INSN_INFO_USES, DF_INSN_USES, or
271 : : DF_INSN_UID_USES macros) or the insn's eq_uses list (accessed by the
272 : : DF_INSN_INFO_EQ_USES, DF_INSN_EQ_USES or DF_INSN_UID_EQ_USES macros).
273 : : The latter list are the list of references in REG_EQUAL or REG_EQUIV
274 : : notes. These macros produce a ref (or NULL), the rest of the list
275 : : can be obtained by traversal of the NEXT_REF field (accessed by the
276 : : DF_REF_NEXT_REF macro.) There is no significance to the ordering of
277 : : the uses or refs in an instruction.
278 : :
279 : : 3) Each insn has a logical uid field (LUID) which is stored in the
280 : : DF_INSN_INFO object for the insn. The LUID field is accessed by
281 : : the DF_INSN_INFO_LUID, DF_INSN_LUID, and DF_INSN_UID_LUID macros.
282 : : When properly set, the LUID is an integer that numbers each insn in
283 : : the basic block, in order from the start of the block.
284 : : The numbers are only correct after a call to df_analyze. They will
285 : : rot after insns are added deleted or moved round.
286 : :
287 : : ACCESSING REFS:
288 : :
289 : : There are 4 ways to obtain access to refs:
290 : :
291 : : 1) References are divided into two categories, REAL and ARTIFICIAL.
292 : :
293 : : REAL refs are associated with instructions.
294 : :
295 : : ARTIFICIAL refs are associated with basic blocks. The heads of
296 : : these lists can be accessed by calling df_get_artificial_defs or
297 : : df_get_artificial_uses for the particular basic block.
298 : :
299 : : Artificial defs and uses occur both at the beginning and ends of blocks.
300 : :
301 : : For blocks that are at the destination of eh edges, the
302 : : artificial uses and defs occur at the beginning. The defs relate
303 : : to the registers specified in EH_RETURN_DATA_REGNO and the uses
304 : : relate to the registers specified in EH_USES. Logically these
305 : : defs and uses should really occur along the eh edge, but there is
306 : : no convenient way to do this. Artificial defs that occur at the
307 : : beginning of the block have the DF_REF_AT_TOP flag set.
308 : :
309 : : Artificial uses occur at the end of all blocks. These arise from
310 : : the hard registers that are always live, such as the stack
311 : : register and are put there to keep the code from forgetting about
312 : : them.
313 : :
314 : : Artificial defs occur at the end of the entry block. These arise
315 : : from registers that are live at entry to the function.
316 : :
317 : : 2) There are three types of refs: defs, uses and eq_uses. (Eq_uses are
318 : : uses that appear inside a REG_EQUAL or REG_EQUIV note.)
319 : :
320 : : All of the eq_uses, uses and defs associated with each pseudo or
321 : : hard register may be linked in a bidirectional chain. These are
322 : : called reg-use or reg_def chains. If the changeable flag
323 : : DF_EQ_NOTES is set when the chains are built, the eq_uses will be
324 : : treated like uses. If it is not set they are ignored.
325 : :
326 : : The first use, eq_use or def for a register can be obtained using
327 : : the DF_REG_USE_CHAIN, DF_REG_EQ_USE_CHAIN or DF_REG_DEF_CHAIN
328 : : macros. Subsequent uses for the same regno can be obtained by
329 : : following the next_reg field of the ref. The number of elements in
330 : : each of the chains can be found by using the DF_REG_USE_COUNT,
331 : : DF_REG_EQ_USE_COUNT or DF_REG_DEF_COUNT macros.
332 : :
333 : : In previous versions of this code, these chains were ordered. It
334 : : has not been practical to continue this practice.
335 : :
336 : : 3) If def-use or use-def chains are built, these can be traversed to
337 : : get to other refs. If the flag DF_EQ_NOTES has been set, the chains
338 : : include the eq_uses. Otherwise these are ignored when building the
339 : : chains.
340 : :
341 : : 4) An array of all of the uses (and an array of all of the defs) can
342 : : be built. These arrays are indexed by the value in the id
343 : : structure. These arrays are only lazily kept up to date, and that
344 : : process can be expensive. To have these arrays built, call
345 : : df_reorganize_defs or df_reorganize_uses. If the flag DF_EQ_NOTES
346 : : has been set the array will contain the eq_uses. Otherwise these
347 : : are ignored when building the array and assigning the ids. Note
348 : : that the values in the id field of a ref may change across calls to
349 : : df_analyze or df_reorganize_defs or df_reorganize_uses.
350 : :
351 : : If the only use of this array is to find all of the refs, it is
352 : : better to traverse all of the registers and then traverse all of
353 : : reg-use or reg-def chains.
354 : :
355 : : NOTES:
356 : :
357 : : Embedded addressing side-effects, such as POST_INC or PRE_INC, generate
358 : : both a use and a def. These are both marked read/write to show that they
359 : : are dependent. For example, (set (reg 40) (mem (post_inc (reg 42))))
360 : : will generate a use of reg 42 followed by a def of reg 42 (both marked
361 : : read/write). Similarly, (set (reg 40) (mem (pre_dec (reg 41))))
362 : : generates a use of reg 41 then a def of reg 41 (both marked read/write),
363 : : even though reg 41 is decremented before it is used for the memory
364 : : address in this second example.
365 : :
366 : : A set to a REG inside a ZERO_EXTRACT, or a set to a non-paradoxical SUBREG
367 : : for which the number of word_mode units covered by the outer mode is
368 : : smaller than that covered by the inner mode, invokes a read-modify-write
369 : : operation. We generate both a use and a def and again mark them
370 : : read/write.
371 : :
372 : : Paradoxical subreg writes do not leave a trace of the old content, so they
373 : : are write-only operations.
374 : : */
375 : :
376 : :
377 : : #include "config.h"
378 : : #include "system.h"
379 : : #include "coretypes.h"
380 : : #include "backend.h"
381 : : #include "rtl.h"
382 : : #include "df.h"
383 : : #include "memmodel.h"
384 : : #include "emit-rtl.h"
385 : : #include "cfganal.h"
386 : : #include "tree-pass.h"
387 : : #include "cfgloop.h"
388 : :
389 : : static void *df_get_bb_info (struct dataflow *, unsigned int);
390 : : static void df_set_bb_info (struct dataflow *, unsigned int, void *);
391 : : static void df_clear_bb_info (struct dataflow *, unsigned int);
392 : : #ifdef DF_DEBUG_CFG
393 : : static void df_set_clean_cfg (void);
394 : : #endif
395 : :
396 : : /* The obstack on which regsets are allocated. */
397 : : struct bitmap_obstack reg_obstack;
398 : :
399 : : /* An obstack for bitmap not related to specific dataflow problems.
400 : : This obstack should e.g. be used for bitmaps with a short life time
401 : : such as temporary bitmaps. */
402 : :
403 : : bitmap_obstack df_bitmap_obstack;
404 : :
405 : :
406 : : /*----------------------------------------------------------------------------
407 : : Functions to create, destroy and manipulate an instance of df.
408 : : ----------------------------------------------------------------------------*/
409 : :
410 : : class df_d *df;
411 : :
412 : : /* Add PROBLEM (and any dependent problems) to the DF instance. */
413 : :
414 : : void
415 : 40763395 : df_add_problem (const struct df_problem *problem)
416 : : {
417 : 40763395 : struct dataflow *dflow;
418 : 40763395 : int i;
419 : :
420 : : /* First try to add the dependent problem. */
421 : 40763395 : if (problem->dependent_problem)
422 : 18465212 : df_add_problem (problem->dependent_problem);
423 : :
424 : : /* Check to see if this problem has already been defined. If it
425 : : has, just return that instance, if not, add it to the end of the
426 : : vector. */
427 : 40763395 : dflow = df->problems_by_index[problem->id];
428 : 40763395 : if (dflow)
429 : : return;
430 : :
431 : : /* Make a new one and add it to the end. */
432 : 26661641 : dflow = XCNEW (struct dataflow);
433 : 26661641 : dflow->problem = problem;
434 : 26661641 : dflow->computed = false;
435 : 26661641 : dflow->solutions_dirty = true;
436 : 26661641 : df->problems_by_index[dflow->problem->id] = dflow;
437 : :
438 : : /* Keep the defined problems ordered by index. This solves the
439 : : problem that RI will use the information from UREC if UREC has
440 : : been defined, or from LIVE if LIVE is defined and otherwise LR.
441 : : However for this to work, the computation of RI must be pushed
442 : : after which ever of those problems is defined, but we do not
443 : : require any of those except for LR to have actually been
444 : : defined. */
445 : 26661641 : df->num_problems_defined++;
446 : 27040129 : for (i = df->num_problems_defined - 2; i >= 0; i--)
447 : : {
448 : 25647767 : if (problem->id < df->problems_in_order[i]->problem->id)
449 : 378488 : df->problems_in_order[i+1] = df->problems_in_order[i];
450 : : else
451 : : {
452 : 25269279 : df->problems_in_order[i+1] = dflow;
453 : 25269279 : return;
454 : : }
455 : : }
456 : 1392362 : df->problems_in_order[0] = dflow;
457 : : }
458 : :
459 : :
460 : : /* Set the MASK flags in the DFLOW problem. The old flags are
461 : : returned. If a flag is not allowed to be changed this will fail if
462 : : checking is enabled. */
463 : : int
464 : 42357674 : df_set_flags (int changeable_flags)
465 : : {
466 : 42357674 : int old_flags = df->changeable_flags;
467 : 42357674 : df->changeable_flags |= changeable_flags;
468 : 42357674 : return old_flags;
469 : : }
470 : :
471 : :
472 : : /* Clear the MASK flags in the DFLOW problem. The old flags are
473 : : returned. If a flag is not allowed to be changed this will fail if
474 : : checking is enabled. */
475 : : int
476 : 22174993 : df_clear_flags (int changeable_flags)
477 : : {
478 : 22174993 : int old_flags = df->changeable_flags;
479 : 22174993 : df->changeable_flags &= ~changeable_flags;
480 : 22174993 : return old_flags;
481 : : }
482 : :
483 : :
484 : : /* Set the blocks that are to be considered for analysis. If this is
485 : : not called or is called with null, the entire function in
486 : : analyzed. */
487 : :
488 : : void
489 : 1101677 : df_set_blocks (bitmap blocks)
490 : : {
491 : 1101677 : if (blocks)
492 : : {
493 : 1101677 : if (dump_file)
494 : 214 : bitmap_print (dump_file, blocks, "setting blocks to analyze ", "\n");
495 : 1101677 : if (df->blocks_to_analyze)
496 : : {
497 : : /* This block is called to change the focus from one subset
498 : : to another. */
499 : 749821 : int p;
500 : 749821 : auto_bitmap diff (&df_bitmap_obstack);
501 : 749821 : bitmap_and_compl (diff, df->blocks_to_analyze, blocks);
502 : 4876950 : for (p = 0; p < df->num_problems_defined; p++)
503 : : {
504 : 4127129 : struct dataflow *dflow = df->problems_in_order[p];
505 : 4127129 : if (dflow->optional_p && dflow->problem->reset_fun)
506 : 23262 : dflow->problem->reset_fun (df->blocks_to_analyze);
507 : 4103867 : else if (dflow->problem->free_blocks_on_set_blocks)
508 : : {
509 : 749821 : bitmap_iterator bi;
510 : 749821 : unsigned int bb_index;
511 : :
512 : 3527441 : EXECUTE_IF_SET_IN_BITMAP (diff, 0, bb_index, bi)
513 : : {
514 : 2777620 : basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bb_index);
515 : 2777620 : if (bb)
516 : : {
517 : 5555240 : void *bb_info = df_get_bb_info (dflow, bb_index);
518 : 2777620 : dflow->problem->free_bb_fun (bb, bb_info);
519 : 2777620 : df_clear_bb_info (dflow, bb_index);
520 : : }
521 : : }
522 : : }
523 : : }
524 : 749821 : }
525 : : else
526 : : {
527 : : /* This block of code is executed to change the focus from
528 : : the entire function to a subset. */
529 : 351856 : bitmap_head blocks_to_reset;
530 : 351856 : bool initialized = false;
531 : 351856 : int p;
532 : 2277340 : for (p = 0; p < df->num_problems_defined; p++)
533 : : {
534 : 1925484 : struct dataflow *dflow = df->problems_in_order[p];
535 : 1925484 : if (dflow->optional_p && dflow->problem->reset_fun)
536 : : {
537 : 0 : if (!initialized)
538 : : {
539 : 0 : basic_block bb;
540 : 0 : bitmap_initialize (&blocks_to_reset, &df_bitmap_obstack);
541 : 0 : FOR_ALL_BB_FN (bb, cfun)
542 : : {
543 : 0 : bitmap_set_bit (&blocks_to_reset, bb->index);
544 : : }
545 : : }
546 : 0 : dflow->problem->reset_fun (&blocks_to_reset);
547 : : }
548 : : }
549 : 351856 : if (initialized)
550 : : bitmap_clear (&blocks_to_reset);
551 : :
552 : 351856 : df->blocks_to_analyze = BITMAP_ALLOC (&df_bitmap_obstack);
553 : : }
554 : 1101677 : bitmap_copy (df->blocks_to_analyze, blocks);
555 : 1101677 : df->analyze_subset = true;
556 : : }
557 : : else
558 : : {
559 : : /* This block is executed to reset the focus to the entire
560 : : function. */
561 : 0 : if (dump_file)
562 : 0 : fprintf (dump_file, "clearing blocks_to_analyze\n");
563 : 0 : if (df->blocks_to_analyze)
564 : : {
565 : 0 : BITMAP_FREE (df->blocks_to_analyze);
566 : 0 : df->blocks_to_analyze = NULL;
567 : : }
568 : 0 : df->analyze_subset = false;
569 : : }
570 : :
571 : : /* Setting the blocks causes the refs to be unorganized since only
572 : : the refs in the blocks are seen. */
573 : 1101677 : df_maybe_reorganize_def_refs (DF_REF_ORDER_NO_TABLE);
574 : 1101677 : df_maybe_reorganize_use_refs (DF_REF_ORDER_NO_TABLE);
575 : 1101677 : df_mark_solutions_dirty ();
576 : 1101677 : }
577 : :
578 : :
579 : : /* Delete a DFLOW problem (and any problems that depend on this
580 : : problem). */
581 : :
582 : : void
583 : 23142153 : df_remove_problem (struct dataflow *dflow)
584 : : {
585 : 23142153 : const struct df_problem *problem;
586 : 23142153 : int i;
587 : :
588 : 23142153 : if (!dflow)
589 : : return;
590 : :
591 : 22975857 : problem = dflow->problem;
592 : 22975857 : gcc_assert (problem->remove_problem_fun);
593 : :
594 : : /* Delete any problems that depended on this problem first. */
595 : 123314596 : for (i = 0; i < df->num_problems_defined; i++)
596 : 100338739 : if (df->problems_in_order[i]->problem->dependent_problem == problem)
597 : 3655289 : df_remove_problem (df->problems_in_order[i]);
598 : :
599 : : /* Now remove this problem. */
600 : 94324567 : for (i = 0; i < df->num_problems_defined; i++)
601 : 94324567 : if (df->problems_in_order[i] == dflow)
602 : : {
603 : 22975857 : int j;
604 : 26402209 : for (j = i + 1; j < df->num_problems_defined; j++)
605 : 3426352 : df->problems_in_order[j-1] = df->problems_in_order[j];
606 : 22975857 : df->problems_in_order[j-1] = NULL;
607 : 22975857 : df->num_problems_defined--;
608 : 22975857 : break;
609 : : }
610 : :
611 : 22975857 : (problem->remove_problem_fun) ();
612 : 22975857 : df->problems_by_index[problem->id] = NULL;
613 : : }
614 : :
615 : :
616 : : /* Remove all of the problems that are not permanent. Scanning, LR
617 : : and (at -O2 or higher) LIVE are permanent, the rest are removable.
618 : : Also clear all of the changeable_flags. */
619 : :
620 : : void
621 : 33711115 : df_finish_pass (bool verify ATTRIBUTE_UNUSED)
622 : : {
623 : 33711115 : int i;
624 : :
625 : : #ifdef ENABLE_DF_CHECKING
626 : : int saved_flags;
627 : : #endif
628 : :
629 : 33711115 : if (!df)
630 : : return;
631 : :
632 : 33711114 : df_maybe_reorganize_def_refs (DF_REF_ORDER_NO_TABLE);
633 : 33711114 : df_maybe_reorganize_use_refs (DF_REF_ORDER_NO_TABLE);
634 : :
635 : : #ifdef ENABLE_DF_CHECKING
636 : : saved_flags = df->changeable_flags;
637 : : #endif
638 : :
639 : : /* We iterate over problems by index as each problem removed will
640 : : lead to problems_in_order to be reordered. */
641 : 337111140 : for (i = 0; i < DF_LAST_PROBLEM_PLUS1; i++)
642 : : {
643 : 303400026 : struct dataflow *dflow = df->problems_by_index[i];
644 : :
645 : 303400026 : if (dflow && dflow->optional_p)
646 : 16217562 : df_remove_problem (dflow);
647 : : }
648 : :
649 : : /* Clear all of the flags. */
650 : 33711114 : df->changeable_flags = 0;
651 : 33711114 : df_process_deferred_rescans ();
652 : :
653 : : /* Set the focus back to the whole function. */
654 : 33711114 : if (df->blocks_to_analyze)
655 : : {
656 : 351856 : BITMAP_FREE (df->blocks_to_analyze);
657 : 351856 : df->blocks_to_analyze = NULL;
658 : 351856 : df_mark_solutions_dirty ();
659 : 351856 : df->analyze_subset = false;
660 : : }
661 : :
662 : : #ifdef ENABLE_DF_CHECKING
663 : : /* Verification will fail in DF_NO_INSN_RESCAN. */
664 : : if (!(saved_flags & DF_NO_INSN_RESCAN))
665 : : {
666 : : df_lr_verify_transfer_functions ();
667 : : if (df_live)
668 : : df_live_verify_transfer_functions ();
669 : : }
670 : :
671 : : #ifdef DF_DEBUG_CFG
672 : : df_set_clean_cfg ();
673 : : #endif
674 : : #endif
675 : :
676 : 33711114 : if (flag_checking && verify)
677 : 4984997 : df->changeable_flags |= DF_VERIFY_SCHEDULED;
678 : : }
679 : :
680 : :
681 : : /* Set up the dataflow instance for the entire back end. */
682 : :
683 : : static unsigned int
684 : 1392362 : rest_of_handle_df_initialize (void)
685 : : {
686 : 1392362 : gcc_assert (!df);
687 : 1392362 : df = XCNEW (class df_d);
688 : 1392362 : df->changeable_flags = 0;
689 : :
690 : 1392362 : bitmap_obstack_initialize (&df_bitmap_obstack);
691 : :
692 : : /* Set this to a conservative value. Stack_ptr_mod will compute it
693 : : correctly later. */
694 : 1392362 : crtl->sp_is_unchanging = 0;
695 : :
696 : 1392362 : df_scan_add_problem ();
697 : 1392362 : df_scan_alloc (NULL);
698 : :
699 : : /* These three problems are permanent. */
700 : 1392362 : df_lr_add_problem ();
701 : 1392362 : if (optimize > 1)
702 : 901060 : df_live_add_problem ();
703 : :
704 : 1392362 : df->hard_regs_live_count = XCNEWVEC (unsigned int, FIRST_PSEUDO_REGISTER);
705 : :
706 : 1392362 : df_hard_reg_init ();
707 : : /* After reload, some ports add certain bits to regs_ever_live so
708 : : this cannot be reset. */
709 : 1392362 : df_compute_regs_ever_live (true);
710 : 1392362 : df_scan_blocks ();
711 : 1392362 : df_compute_regs_ever_live (false);
712 : 1392362 : return 0;
713 : : }
714 : :
715 : :
716 : : namespace {
717 : :
718 : : const pass_data pass_data_df_initialize_opt =
719 : : {
720 : : RTL_PASS, /* type */
721 : : "dfinit", /* name */
722 : : OPTGROUP_NONE, /* optinfo_flags */
723 : : TV_DF_SCAN, /* tv_id */
724 : : 0, /* properties_required */
725 : : 0, /* properties_provided */
726 : : 0, /* properties_destroyed */
727 : : 0, /* todo_flags_start */
728 : : 0, /* todo_flags_finish */
729 : : };
730 : :
731 : : class pass_df_initialize_opt : public rtl_opt_pass
732 : : {
733 : : public:
734 : 280455 : pass_df_initialize_opt (gcc::context *ctxt)
735 : 560910 : : rtl_opt_pass (pass_data_df_initialize_opt, ctxt)
736 : : {}
737 : :
738 : : /* opt_pass methods: */
739 : 1392368 : bool gate (function *) final override { return optimize > 0; }
740 : 974389 : unsigned int execute (function *) final override
741 : : {
742 : 974389 : return rest_of_handle_df_initialize ();
743 : : }
744 : :
745 : : }; // class pass_df_initialize_opt
746 : :
747 : : } // anon namespace
748 : :
749 : : rtl_opt_pass *
750 : 280455 : make_pass_df_initialize_opt (gcc::context *ctxt)
751 : : {
752 : 280455 : return new pass_df_initialize_opt (ctxt);
753 : : }
754 : :
755 : :
756 : : namespace {
757 : :
758 : : const pass_data pass_data_df_initialize_no_opt =
759 : : {
760 : : RTL_PASS, /* type */
761 : : "no-opt dfinit", /* name */
762 : : OPTGROUP_NONE, /* optinfo_flags */
763 : : TV_DF_SCAN, /* tv_id */
764 : : 0, /* properties_required */
765 : : 0, /* properties_provided */
766 : : 0, /* properties_destroyed */
767 : : 0, /* todo_flags_start */
768 : : 0, /* todo_flags_finish */
769 : : };
770 : :
771 : : class pass_df_initialize_no_opt : public rtl_opt_pass
772 : : {
773 : : public:
774 : 280455 : pass_df_initialize_no_opt (gcc::context *ctxt)
775 : 560910 : : rtl_opt_pass (pass_data_df_initialize_no_opt, ctxt)
776 : : {}
777 : :
778 : : /* opt_pass methods: */
779 : 1392368 : bool gate (function *) final override { return optimize == 0; }
780 : 417973 : unsigned int execute (function *) final override
781 : : {
782 : 417973 : return rest_of_handle_df_initialize ();
783 : : }
784 : :
785 : : }; // class pass_df_initialize_no_opt
786 : :
787 : : } // anon namespace
788 : :
789 : : rtl_opt_pass *
790 : 280455 : make_pass_df_initialize_no_opt (gcc::context *ctxt)
791 : : {
792 : 280455 : return new pass_df_initialize_no_opt (ctxt);
793 : : }
794 : :
795 : :
796 : : /* Free all the dataflow info and the DF structure. This should be
797 : : called from the df_finish macro which also NULLs the parm. */
798 : :
799 : : static unsigned int
800 : 1392362 : rest_of_handle_df_finish (void)
801 : : {
802 : 1392362 : int i;
803 : :
804 : 1392362 : gcc_assert (df);
805 : :
806 : 5078146 : for (i = 0; i < df->num_problems_defined; i++)
807 : : {
808 : 3685784 : struct dataflow *dflow = df->problems_in_order[i];
809 : 3685784 : dflow->problem->free_fun ();
810 : : }
811 : :
812 : 1392362 : free (df->postorder);
813 : 1392362 : free (df->postorder_inverted);
814 : 1392362 : free (df->hard_regs_live_count);
815 : 1392362 : free (df);
816 : 1392362 : df = NULL;
817 : :
818 : 1392362 : bitmap_obstack_release (&df_bitmap_obstack);
819 : 1392362 : return 0;
820 : : }
821 : :
822 : :
823 : : namespace {
824 : :
825 : : const pass_data pass_data_df_finish =
826 : : {
827 : : RTL_PASS, /* type */
828 : : "dfinish", /* name */
829 : : OPTGROUP_NONE, /* optinfo_flags */
830 : : TV_NONE, /* tv_id */
831 : : 0, /* properties_required */
832 : : 0, /* properties_provided */
833 : : 0, /* properties_destroyed */
834 : : 0, /* todo_flags_start */
835 : : 0, /* todo_flags_finish */
836 : : };
837 : :
838 : : class pass_df_finish : public rtl_opt_pass
839 : : {
840 : : public:
841 : 280455 : pass_df_finish (gcc::context *ctxt)
842 : 560910 : : rtl_opt_pass (pass_data_df_finish, ctxt)
843 : : {}
844 : :
845 : : /* opt_pass methods: */
846 : 1392362 : unsigned int execute (function *) final override
847 : : {
848 : 1392362 : return rest_of_handle_df_finish ();
849 : : }
850 : :
851 : : }; // class pass_df_finish
852 : :
853 : : } // anon namespace
854 : :
855 : : rtl_opt_pass *
856 : 280455 : make_pass_df_finish (gcc::context *ctxt)
857 : : {
858 : 280455 : return new pass_df_finish (ctxt);
859 : : }
860 : :
861 : :
862 : :
863 : :
864 : :
865 : : /*----------------------------------------------------------------------------
866 : : The general data flow analysis engine.
867 : : ----------------------------------------------------------------------------*/
868 : :
869 : : /* Helper function for df_worklist_dataflow.
870 : : Propagate the dataflow forward.
871 : : Given a BB_INDEX, do the dataflow propagation
872 : : and set bits on for successors in PENDING for earlier
873 : : and WORKLIST for later in bbindex_to_postorder
874 : : if the out set of the dataflow has changed.
875 : :
876 : : AGE specify time when BB was visited last time.
877 : : AGE of 0 means we are visiting for first time and need to
878 : : compute transfer function to initialize datastructures.
879 : : Otherwise we re-do transfer function only if something change
880 : : while computing confluence functions.
881 : : We need to compute confluence only of basic block that are younger
882 : : then last visit of the BB.
883 : :
884 : : Return true if BB info has changed. This is always the case
885 : : in the first visit. */
886 : :
887 : : static bool
888 : 339693753 : df_worklist_propagate_forward (struct dataflow *dataflow,
889 : : unsigned bb_index,
890 : : unsigned *bbindex_to_postorder,
891 : : bitmap worklist,
892 : : bitmap pending,
893 : : sbitmap considered,
894 : : vec<int> &last_change_age,
895 : : int age)
896 : : {
897 : 339693753 : edge e;
898 : 339693753 : edge_iterator ei;
899 : 339693753 : basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bb_index);
900 : 339693753 : bool changed = !age;
901 : :
902 : : /* Calculate <conf_op> of incoming edges. */
903 : 339693753 : if (EDGE_COUNT (bb->preds) > 0)
904 : 808107705 : FOR_EACH_EDGE (e, ei, bb->preds)
905 : : {
906 : 968971324 : if (bbindex_to_postorder[e->src->index] < last_change_age.length ()
907 : 480255782 : && age <= last_change_age[bbindex_to_postorder[e->src->index]]
908 : 945495971 : && bitmap_bit_p (considered, e->src->index))
909 : 461010309 : changed |= dataflow->problem->con_fun_n (e);
910 : : }
911 : 16071710 : else if (dataflow->problem->con_fun_0)
912 : 1183507 : dataflow->problem->con_fun_0 (bb);
913 : :
914 : 339693753 : if (changed
915 : 339693753 : && dataflow->problem->trans_fun (bb_index))
916 : : {
917 : : /* The out set of this block has changed.
918 : : Propagate to the outgoing blocks. */
919 : 716290393 : FOR_EACH_EDGE (e, ei, bb->succs)
920 : : {
921 : 420207525 : unsigned ob_index = e->dest->index;
922 : :
923 : 420207525 : if (bitmap_bit_p (considered, ob_index))
924 : : {
925 : 414406554 : if (bbindex_to_postorder[bb_index]
926 : 414406554 : < bbindex_to_postorder[ob_index])
927 : 395712617 : bitmap_set_bit (worklist, bbindex_to_postorder[ob_index]);
928 : : else
929 : 18693937 : bitmap_set_bit (pending, bbindex_to_postorder[ob_index]);
930 : : }
931 : : }
932 : : return true;
933 : : }
934 : : return false;
935 : : }
936 : :
937 : :
938 : : /* Helper function for df_worklist_dataflow.
939 : : Propagate the dataflow backward. */
940 : :
941 : : static bool
942 : 344906156 : df_worklist_propagate_backward (struct dataflow *dataflow,
943 : : unsigned bb_index,
944 : : unsigned *bbindex_to_postorder,
945 : : bitmap worklist,
946 : : bitmap pending,
947 : : sbitmap considered,
948 : : vec<int> &last_change_age,
949 : : int age)
950 : : {
951 : 344906156 : edge e;
952 : 344906156 : edge_iterator ei;
953 : 344906156 : basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bb_index);
954 : 344906156 : bool changed = !age;
955 : :
956 : : /* Calculate <conf_op> of incoming edges. */
957 : 344906156 : if (EDGE_COUNT (bb->succs) > 0)
958 : 822342836 : FOR_EACH_EDGE (e, ei, bb->succs)
959 : : {
960 : 1002802356 : if (bbindex_to_postorder[e->dest->index] < last_change_age.length ()
961 : 497861859 : && age <= last_change_age[bbindex_to_postorder[e->dest->index]]
962 : 977005248 : && bitmap_bit_p (considered, e->dest->index))
963 : 475604070 : changed |= dataflow->problem->con_fun_n (e);
964 : : }
965 : 23964498 : else if (dataflow->problem->con_fun_0)
966 : 23672227 : dataflow->problem->con_fun_0 (bb);
967 : :
968 : 344906156 : if (changed
969 : 344906156 : && dataflow->problem->trans_fun (bb_index))
970 : : {
971 : : /* The out set of this block has changed.
972 : : Propagate to the outgoing blocks. */
973 : 555767175 : FOR_EACH_EDGE (e, ei, bb->preds)
974 : : {
975 : 322468463 : unsigned ob_index = e->src->index;
976 : :
977 : 322468463 : if (bitmap_bit_p (considered, ob_index))
978 : : {
979 : 321830858 : if (bbindex_to_postorder[bb_index]
980 : 321830858 : < bbindex_to_postorder[ob_index])
981 : 305269224 : bitmap_set_bit (worklist, bbindex_to_postorder[ob_index]);
982 : : else
983 : 16561634 : bitmap_set_bit (pending, bbindex_to_postorder[ob_index]);
984 : : }
985 : : }
986 : : return true;
987 : : }
988 : : return false;
989 : : }
990 : :
991 : : /* Main dataflow solver loop.
992 : :
993 : : DATAFLOW is problem we are solving, PENDING is worklist of basic blocks we
994 : : need to visit.
995 : : BLOCK_IN_POSTORDER is array of size N_BLOCKS specifying postorder in BBs and
996 : : BBINDEX_TO_POSTORDER is array mapping back BB->index to postorder position.
997 : : PENDING will be freed.
998 : :
999 : : The worklists are bitmaps indexed by postorder positions.
1000 : :
1001 : : The function implements standard algorithm for dataflow solving with two
1002 : : worklists (we are processing WORKLIST and storing new BBs to visit in
1003 : : PENDING).
1004 : :
1005 : : As an optimization we maintain ages when BB was changed (stored in
1006 : : last_change_age) and when it was last visited (stored in last_visit_age).
1007 : : This avoids need to re-do confluence function for edges to basic blocks
1008 : : whose source did not change since destination was visited last time. */
1009 : :
1010 : : static void
1011 : 31862689 : df_worklist_dataflow_doublequeue (struct dataflow *dataflow,
1012 : : bitmap pending,
1013 : : sbitmap considered,
1014 : : int *blocks_in_postorder,
1015 : : unsigned *bbindex_to_postorder,
1016 : : int n_blocks)
1017 : : {
1018 : 31862689 : enum df_flow_dir dir = dataflow->problem->dir;
1019 : 31862689 : int dcount = 0;
1020 : 31862689 : bitmap worklist = BITMAP_ALLOC (&df_bitmap_obstack);
1021 : 31862689 : int age = 0;
1022 : 31862689 : bool changed;
1023 : 31862689 : vec<int> last_visit_age = vNULL;
1024 : 31862689 : vec<int> last_change_age = vNULL;
1025 : 31862689 : int prev_age;
1026 : :
1027 : 31862689 : last_visit_age.safe_grow_cleared (n_blocks, true);
1028 : 31862689 : last_change_age.safe_grow_cleared (n_blocks, true);
1029 : :
1030 : : /* Double-queueing. Worklist is for the current iteration,
1031 : : and pending is for the next. */
1032 : 107373405 : while (!bitmap_empty_p (pending))
1033 : : {
1034 : : std::swap (pending, worklist);
1035 : :
1036 : 684599909 : do
1037 : : {
1038 : 684599909 : unsigned index = bitmap_clear_first_set_bit (worklist);
1039 : :
1040 : 684599909 : unsigned bb_index;
1041 : 684599909 : dcount++;
1042 : :
1043 : 684599909 : bb_index = blocks_in_postorder[index];
1044 : 684599909 : prev_age = last_visit_age[index];
1045 : 684599909 : if (dir == DF_FORWARD)
1046 : 339693753 : changed = df_worklist_propagate_forward (dataflow, bb_index,
1047 : : bbindex_to_postorder,
1048 : : worklist, pending,
1049 : : considered,
1050 : : last_change_age,
1051 : : prev_age);
1052 : : else
1053 : 344906156 : changed = df_worklist_propagate_backward (dataflow, bb_index,
1054 : : bbindex_to_postorder,
1055 : : worklist, pending,
1056 : : considered,
1057 : : last_change_age,
1058 : : prev_age);
1059 : 684599909 : last_visit_age[index] = ++age;
1060 : 684599909 : if (changed)
1061 : 529381580 : last_change_age[index] = age;
1062 : : }
1063 : 684599909 : while (!bitmap_empty_p (worklist));
1064 : : }
1065 : :
1066 : 31862689 : BITMAP_FREE (worklist);
1067 : 31862689 : BITMAP_FREE (pending);
1068 : 31862689 : last_visit_age.release ();
1069 : 31862689 : last_change_age.release ();
1070 : :
1071 : : /* Dump statistics. */
1072 : 31862689 : if (dump_file)
1073 : 1649 : fprintf (dump_file, "df_worklist_dataflow_doublequeue:"
1074 : : " n_basic_blocks %d n_edges %d"
1075 : : " count %d (%5.2g)\n",
1076 : : n_basic_blocks_for_fn (cfun), n_edges_for_fn (cfun),
1077 : 1649 : dcount, dcount / (double)n_basic_blocks_for_fn (cfun));
1078 : 31862689 : }
1079 : :
1080 : : /* Worklist-based dataflow solver. It uses sbitmap as a worklist,
1081 : : with "n"-th bit representing the n-th block in the reverse-postorder order.
1082 : : The solver is a double-queue algorithm similar to the "double stack" solver
1083 : : from Cooper, Harvey and Kennedy, "Iterative data-flow analysis, Revisited".
1084 : : The only significant difference is that the worklist in this implementation
1085 : : is always sorted in RPO of the CFG visiting direction. */
1086 : :
1087 : : void
1088 : 31862689 : df_worklist_dataflow (struct dataflow *dataflow,
1089 : : bitmap blocks_to_consider,
1090 : : int *blocks_in_postorder,
1091 : : int n_blocks)
1092 : : {
1093 : 31862689 : bitmap pending = BITMAP_ALLOC (&df_bitmap_obstack);
1094 : 31862689 : bitmap_iterator bi;
1095 : 31862689 : unsigned int *bbindex_to_postorder;
1096 : 31862689 : int i;
1097 : 31862689 : unsigned int index;
1098 : 31862689 : enum df_flow_dir dir = dataflow->problem->dir;
1099 : :
1100 : 31862689 : gcc_assert (dir != DF_NONE);
1101 : :
1102 : : /* BBINDEX_TO_POSTORDER maps the bb->index to the reverse postorder. */
1103 : 31862689 : bbindex_to_postorder = XNEWVEC (unsigned int,
1104 : : last_basic_block_for_fn (cfun));
1105 : :
1106 : : /* Initialize the array to an out-of-bound value. */
1107 : 1251387455 : for (i = 0; i < last_basic_block_for_fn (cfun); i++)
1108 : 1187662077 : bbindex_to_postorder[i] = last_basic_block_for_fn (cfun);
1109 : :
1110 : : /* Initialize the considered map. */
1111 : 31862689 : auto_sbitmap considered (last_basic_block_for_fn (cfun));
1112 : 31862689 : bitmap_clear (considered);
1113 : 630398471 : EXECUTE_IF_SET_IN_BITMAP (blocks_to_consider, 0, index, bi)
1114 : : {
1115 : 598535782 : bitmap_set_bit (considered, index);
1116 : : }
1117 : :
1118 : : /* Initialize the mapping of block index to postorder. */
1119 : 630398471 : for (i = 0; i < n_blocks; i++)
1120 : : {
1121 : 598535782 : bbindex_to_postorder[blocks_in_postorder[i]] = i;
1122 : : /* Add all blocks to the worklist. */
1123 : 598535782 : bitmap_set_bit (pending, i);
1124 : : }
1125 : :
1126 : : /* Initialize the problem. */
1127 : 31862689 : if (dataflow->problem->init_fun)
1128 : 31295248 : dataflow->problem->init_fun (blocks_to_consider);
1129 : :
1130 : : /* Solve it. */
1131 : 31862689 : df_worklist_dataflow_doublequeue (dataflow, pending, considered,
1132 : : blocks_in_postorder,
1133 : : bbindex_to_postorder,
1134 : : n_blocks);
1135 : 31862689 : free (bbindex_to_postorder);
1136 : 31862689 : }
1137 : :
1138 : :
1139 : : /* Remove the entries not in BLOCKS from the LIST of length LEN, preserving
1140 : : the order of the remaining entries. Returns the length of the resulting
1141 : : list. */
1142 : :
1143 : : static unsigned
1144 : 0 : df_prune_to_subcfg (int list[], unsigned len, bitmap blocks)
1145 : : {
1146 : 0 : unsigned act, last;
1147 : :
1148 : 0 : for (act = 0, last = 0; act < len; act++)
1149 : 0 : if (bitmap_bit_p (blocks, list[act]))
1150 : 0 : list[last++] = list[act];
1151 : :
1152 : 0 : return last;
1153 : : }
1154 : :
1155 : :
1156 : : /* Execute dataflow analysis on a single dataflow problem.
1157 : :
1158 : : BLOCKS_TO_CONSIDER are the blocks whose solution can either be
1159 : : examined or will be computed. For calls from DF_ANALYZE, this is
1160 : : the set of blocks that has been passed to DF_SET_BLOCKS.
1161 : : */
1162 : :
1163 : : void
1164 : 50926919 : df_analyze_problem (struct dataflow *dflow,
1165 : : bitmap blocks_to_consider,
1166 : : int *postorder, int n_blocks)
1167 : : {
1168 : 50926919 : timevar_push (dflow->problem->tv_id);
1169 : :
1170 : : /* (Re)Allocate the datastructures necessary to solve the problem. */
1171 : 50926919 : if (dflow->problem->alloc_fun)
1172 : 50926919 : dflow->problem->alloc_fun (blocks_to_consider);
1173 : :
1174 : : #ifdef ENABLE_DF_CHECKING
1175 : : if (dflow->problem->verify_start_fun)
1176 : : dflow->problem->verify_start_fun ();
1177 : : #endif
1178 : :
1179 : : /* Set up the problem and compute the local information. */
1180 : 50926919 : if (dflow->problem->local_compute_fun)
1181 : 45435256 : dflow->problem->local_compute_fun (blocks_to_consider);
1182 : :
1183 : : /* Solve the equations. */
1184 : 50926919 : if (dflow->problem->dataflow_fun)
1185 : 30730218 : dflow->problem->dataflow_fun (dflow, blocks_to_consider,
1186 : : postorder, n_blocks);
1187 : :
1188 : : /* Massage the solution. */
1189 : 50926919 : if (dflow->problem->finalize_fun)
1190 : 29682074 : dflow->problem->finalize_fun (blocks_to_consider);
1191 : :
1192 : : #ifdef ENABLE_DF_CHECKING
1193 : : if (dflow->problem->verify_end_fun)
1194 : : dflow->problem->verify_end_fun ();
1195 : : #endif
1196 : :
1197 : 50926919 : timevar_pop (dflow->problem->tv_id);
1198 : :
1199 : 50926919 : dflow->computed = true;
1200 : 50926919 : }
1201 : :
1202 : :
1203 : : /* Analyze dataflow info. */
1204 : :
1205 : : static void
1206 : 34919853 : df_analyze_1 (void)
1207 : : {
1208 : 34919853 : int i;
1209 : :
1210 : : /* We need to do this before the df_verify_all because this is
1211 : : not kept incrementally up to date. */
1212 : 34919853 : df_compute_regs_ever_live (false);
1213 : 34919853 : df_process_deferred_rescans ();
1214 : :
1215 : 34919853 : if (dump_file)
1216 : 1496 : fprintf (dump_file, "df_analyze called\n");
1217 : :
1218 : : #ifndef ENABLE_DF_CHECKING
1219 : 34919853 : if (df->changeable_flags & DF_VERIFY_SCHEDULED)
1220 : : #endif
1221 : 5982621 : df_verify ();
1222 : :
1223 : : /* Skip over the DF_SCAN problem. */
1224 : 126269827 : for (i = 1; i < df->num_problems_defined; i++)
1225 : : {
1226 : 91349974 : struct dataflow *dflow = df->problems_in_order[i];
1227 : 91349974 : if (dflow->solutions_dirty)
1228 : : {
1229 : 50926731 : if (dflow->problem->dir == DF_FORWARD)
1230 : 17694331 : df_analyze_problem (dflow,
1231 : : df->blocks_to_analyze,
1232 : : df->postorder_inverted,
1233 : : df->n_blocks);
1234 : : else
1235 : 33232400 : df_analyze_problem (dflow,
1236 : : df->blocks_to_analyze,
1237 : : df->postorder,
1238 : : df->n_blocks);
1239 : : }
1240 : : }
1241 : :
1242 : 34919853 : if (!df->analyze_subset)
1243 : : {
1244 : 33818176 : BITMAP_FREE (df->blocks_to_analyze);
1245 : 33818176 : df->blocks_to_analyze = NULL;
1246 : : }
1247 : :
1248 : : #ifdef DF_DEBUG_CFG
1249 : : df_set_clean_cfg ();
1250 : : #endif
1251 : 34919853 : }
1252 : :
1253 : : /* Analyze dataflow info. */
1254 : :
1255 : : void
1256 : 33818176 : df_analyze (void)
1257 : : {
1258 : 33818176 : bitmap current_all_blocks = BITMAP_ALLOC (&df_bitmap_obstack);
1259 : :
1260 : 33818176 : free (df->postorder);
1261 : 33818176 : free (df->postorder_inverted);
1262 : : /* For DF_FORWARD use a RPO on the forward graph. Since we want to
1263 : : have unreachable blocks deleted use post_order_compute and reverse
1264 : : the order. */
1265 : 33818176 : df->postorder_inverted = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
1266 : 33818176 : df->n_blocks = post_order_compute (df->postorder_inverted, true, true);
1267 : 248423921 : for (int i = 0; i < df->n_blocks / 2; ++i)
1268 : 214605745 : std::swap (df->postorder_inverted[i],
1269 : 214605745 : df->postorder_inverted[df->n_blocks - 1 - i]);
1270 : : /* For DF_BACKWARD use a RPO on the reverse graph. */
1271 : 33818176 : df->postorder = XNEWVEC (int, n_basic_blocks_for_fn (cfun));
1272 : 33818176 : int n = inverted_rev_post_order_compute (cfun, df->postorder);
1273 : 33818176 : gcc_assert (n == df->n_blocks);
1274 : :
1275 : 489010630 : for (int i = 0; i < df->n_blocks; i++)
1276 : 455192454 : bitmap_set_bit (current_all_blocks, df->postorder[i]);
1277 : :
1278 : 33818176 : if (flag_checking)
1279 : : {
1280 : : /* Verify that POSTORDER_INVERTED only contains blocks reachable from
1281 : : the ENTRY block. */
1282 : 489006121 : for (int i = 0; i < df->n_blocks; i++)
1283 : 455188627 : gcc_assert (bitmap_bit_p (current_all_blocks,
1284 : : df->postorder_inverted[i]));
1285 : : }
1286 : :
1287 : : /* Make sure that we have pruned any unreachable blocks from these
1288 : : sets. */
1289 : 33818176 : if (df->analyze_subset)
1290 : : {
1291 : 0 : bitmap_and_into (df->blocks_to_analyze, current_all_blocks);
1292 : 0 : unsigned int newlen = df_prune_to_subcfg (df->postorder, df->n_blocks,
1293 : : df->blocks_to_analyze);
1294 : 0 : df_prune_to_subcfg (df->postorder_inverted, df->n_blocks,
1295 : : df->blocks_to_analyze);
1296 : 0 : df->n_blocks = newlen;
1297 : 0 : BITMAP_FREE (current_all_blocks);
1298 : : }
1299 : : else
1300 : : {
1301 : 33818176 : df->blocks_to_analyze = current_all_blocks;
1302 : 33818176 : current_all_blocks = NULL;
1303 : : }
1304 : :
1305 : 33818176 : df_analyze_1 ();
1306 : 33818176 : }
1307 : :
1308 : : /* Compute the reverse top sort order of the sub-CFG specified by LOOP.
1309 : : Returns the number of blocks which is always loop->num_nodes. */
1310 : :
1311 : : static int
1312 : 1101677 : loop_rev_post_order_compute (int *post_order, class loop *loop)
1313 : : {
1314 : 1101677 : edge_iterator *stack;
1315 : 1101677 : int sp;
1316 : 1101677 : int post_order_num = loop->num_nodes - 1;
1317 : :
1318 : : /* Allocate stack for back-tracking up CFG. */
1319 : 1101677 : stack = XNEWVEC (edge_iterator, loop->num_nodes + 1);
1320 : 1101677 : sp = 0;
1321 : :
1322 : : /* Allocate bitmap to track nodes that have been visited. */
1323 : 1101677 : auto_bitmap visited;
1324 : :
1325 : : /* Push the first edge on to the stack. */
1326 : 1101677 : stack[sp++] = ei_start (loop_preheader_edge (loop)->src->succs);
1327 : :
1328 : 19510391 : while (sp)
1329 : : {
1330 : 18408714 : edge_iterator ei;
1331 : 18408714 : basic_block src;
1332 : 18408714 : basic_block dest;
1333 : :
1334 : : /* Look at the edge on the top of the stack. */
1335 : 18408714 : ei = stack[sp - 1];
1336 : 18408714 : src = ei_edge (ei)->src;
1337 : 18408714 : dest = ei_edge (ei)->dest;
1338 : :
1339 : : /* Check if the edge destination has been visited yet and mark it
1340 : : if not so. */
1341 : 18408714 : if (flow_bb_inside_loop_p (loop, dest)
1342 : 18408714 : && bitmap_set_bit (visited, dest->index))
1343 : : {
1344 : 6743126 : if (EDGE_COUNT (dest->succs) > 0)
1345 : : /* Since the DEST node has been visited for the first
1346 : : time, check its successors. */
1347 : 6743126 : stack[sp++] = ei_start (dest->succs);
1348 : : else
1349 : 0 : post_order[post_order_num--] = dest->index;
1350 : : }
1351 : : else
1352 : : {
1353 : 11665588 : if (ei_one_before_end_p (ei)
1354 : 11665588 : && src != loop_preheader_edge (loop)->src)
1355 : 6743126 : post_order[post_order_num--] = src->index;
1356 : :
1357 : 11665588 : if (!ei_one_before_end_p (ei))
1358 : 3820785 : ei_next (&stack[sp - 1]);
1359 : : else
1360 : 7844803 : sp--;
1361 : : }
1362 : : }
1363 : :
1364 : 1101677 : free (stack);
1365 : :
1366 : 1101677 : return loop->num_nodes;
1367 : 1101677 : }
1368 : :
1369 : : /* Compute the reverse top sort order of the inverted sub-CFG specified
1370 : : by LOOP. Returns the number of blocks which is always loop->num_nodes. */
1371 : :
1372 : : static int
1373 : 1101677 : loop_inverted_rev_post_order_compute (int *post_order, class loop *loop)
1374 : : {
1375 : 1101677 : basic_block bb;
1376 : 1101677 : edge_iterator *stack;
1377 : 1101677 : int sp;
1378 : 1101677 : int post_order_num = loop->num_nodes - 1;
1379 : :
1380 : : /* Allocate stack for back-tracking up CFG. */
1381 : 1101677 : stack = XNEWVEC (edge_iterator, loop->num_nodes + 1);
1382 : 1101677 : sp = 0;
1383 : :
1384 : : /* Allocate bitmap to track nodes that have been visited. */
1385 : 1101677 : auto_bitmap visited;
1386 : :
1387 : : /* Put all latches into the initial work list. In theory we'd want
1388 : : to start from loop exits but then we'd have the special case of
1389 : : endless loops. It doesn't really matter for DF iteration order and
1390 : : handling latches last is probably even better. */
1391 : 1101677 : stack[sp++] = ei_start (loop->header->preds);
1392 : 1101677 : bitmap_set_bit (visited, loop->header->index);
1393 : :
1394 : : /* The inverted traversal loop. */
1395 : 17404156 : while (sp)
1396 : : {
1397 : 15200802 : edge_iterator ei;
1398 : 15200802 : basic_block pred;
1399 : :
1400 : : /* Look at the edge on the top of the stack. */
1401 : 15200802 : ei = stack[sp - 1];
1402 : 15200802 : bb = ei_edge (ei)->dest;
1403 : 15200802 : pred = ei_edge (ei)->src;
1404 : :
1405 : : /* Check if the predecessor has been visited yet and mark it
1406 : : if not so. */
1407 : 15200802 : if (flow_bb_inside_loop_p (loop, pred)
1408 : 15200802 : && bitmap_set_bit (visited, pred->index))
1409 : : {
1410 : 5641449 : if (EDGE_COUNT (pred->preds) > 0)
1411 : : /* Since the predecessor node has been visited for the first
1412 : : time, check its predecessors. */
1413 : 5641449 : stack[sp++] = ei_start (pred->preds);
1414 : : else
1415 : 0 : post_order[post_order_num--] = pred->index;
1416 : : }
1417 : : else
1418 : : {
1419 : 9559353 : if (flow_bb_inside_loop_p (loop, bb)
1420 : 9559353 : && ei_one_before_end_p (ei))
1421 : 6743126 : post_order[post_order_num--] = bb->index;
1422 : :
1423 : 9559353 : if (!ei_one_before_end_p (ei))
1424 : 2816227 : ei_next (&stack[sp - 1]);
1425 : : else
1426 : 6743126 : sp--;
1427 : : }
1428 : : }
1429 : :
1430 : 1101677 : free (stack);
1431 : 1101677 : return loop->num_nodes;
1432 : 1101677 : }
1433 : :
1434 : :
1435 : : /* Analyze dataflow info for the basic blocks contained in LOOP. */
1436 : :
1437 : : void
1438 : 1101677 : df_analyze_loop (class loop *loop)
1439 : : {
1440 : 1101677 : free (df->postorder);
1441 : 1101677 : free (df->postorder_inverted);
1442 : :
1443 : 1101677 : df->postorder = XNEWVEC (int, loop->num_nodes);
1444 : 1101677 : df->postorder_inverted = XNEWVEC (int, loop->num_nodes);
1445 : 1101677 : df->n_blocks = loop_rev_post_order_compute (df->postorder_inverted, loop);
1446 : 1101677 : int n = loop_inverted_rev_post_order_compute (df->postorder, loop);
1447 : 1101677 : gcc_assert ((unsigned) df->n_blocks == loop->num_nodes);
1448 : 1101677 : gcc_assert ((unsigned) n == loop->num_nodes);
1449 : :
1450 : 1101677 : bitmap blocks = BITMAP_ALLOC (&df_bitmap_obstack);
1451 : 7844803 : for (int i = 0; i < df->n_blocks; ++i)
1452 : 6743126 : bitmap_set_bit (blocks, df->postorder[i]);
1453 : 1101677 : df_set_blocks (blocks);
1454 : 1101677 : BITMAP_FREE (blocks);
1455 : :
1456 : 1101677 : df_analyze_1 ();
1457 : 1101677 : }
1458 : :
1459 : :
1460 : : /* Return the number of basic blocks from the last call to df_analyze. */
1461 : :
1462 : : int
1463 : 7119239 : df_get_n_blocks (enum df_flow_dir dir)
1464 : : {
1465 : 7119239 : gcc_assert (dir != DF_NONE);
1466 : :
1467 : 7119239 : if (dir == DF_FORWARD)
1468 : : {
1469 : 257696 : gcc_assert (df->postorder_inverted);
1470 : 257696 : return df->n_blocks;
1471 : : }
1472 : :
1473 : 6861543 : gcc_assert (df->postorder);
1474 : 6861543 : return df->n_blocks;
1475 : : }
1476 : :
1477 : :
1478 : : /* Return a pointer to the array of basic blocks in the reverse postorder.
1479 : : Depending on the direction of the dataflow problem,
1480 : : it returns either the usual reverse postorder array
1481 : : or the reverse postorder of inverted traversal. */
1482 : : int *
1483 : 7119239 : df_get_postorder (enum df_flow_dir dir)
1484 : : {
1485 : 7119239 : gcc_assert (dir != DF_NONE);
1486 : :
1487 : 7119239 : if (dir == DF_FORWARD)
1488 : : {
1489 : 257696 : gcc_assert (df->postorder_inverted);
1490 : : return df->postorder_inverted;
1491 : : }
1492 : 6861543 : gcc_assert (df->postorder);
1493 : : return df->postorder;
1494 : : }
1495 : :
1496 : : static struct df_problem user_problem;
1497 : : static struct dataflow user_dflow;
1498 : :
1499 : : /* Interface for calling iterative dataflow with user defined
1500 : : confluence and transfer functions. All that is necessary is to
1501 : : supply DIR, a direction, CONF_FUN_0, a confluence function for
1502 : : blocks with no logical preds (or NULL), CONF_FUN_N, the normal
1503 : : confluence function, TRANS_FUN, the basic block transfer function,
1504 : : and BLOCKS, the set of blocks to examine, POSTORDER the blocks in
1505 : : postorder, and N_BLOCKS, the number of blocks in POSTORDER. */
1506 : :
1507 : : void
1508 : 567441 : df_simple_dataflow (enum df_flow_dir dir,
1509 : : df_init_function init_fun,
1510 : : df_confluence_function_0 con_fun_0,
1511 : : df_confluence_function_n con_fun_n,
1512 : : df_transfer_function trans_fun,
1513 : : bitmap blocks, int * postorder, int n_blocks)
1514 : : {
1515 : 567441 : memset (&user_problem, 0, sizeof (struct df_problem));
1516 : 567441 : user_problem.dir = dir;
1517 : 567441 : user_problem.init_fun = init_fun;
1518 : 567441 : user_problem.con_fun_0 = con_fun_0;
1519 : 567441 : user_problem.con_fun_n = con_fun_n;
1520 : 567441 : user_problem.trans_fun = trans_fun;
1521 : 567441 : user_dflow.problem = &user_problem;
1522 : 567441 : df_worklist_dataflow (&user_dflow, blocks, postorder, n_blocks);
1523 : 567441 : }
1524 : :
1525 : :
1526 : :
1527 : : /*----------------------------------------------------------------------------
1528 : : Functions to support limited incremental change.
1529 : : ----------------------------------------------------------------------------*/
1530 : :
1531 : :
1532 : : /* Get basic block info. */
1533 : :
1534 : : static void *
1535 : 20115555 : df_get_bb_info (struct dataflow *dflow, unsigned int index)
1536 : : {
1537 : 2777620 : if (dflow->block_info == NULL)
1538 : : return NULL;
1539 : 20115555 : if (index >= dflow->block_info_size)
1540 : : return NULL;
1541 : 19900237 : return (void *)((char *)dflow->block_info
1542 : 2799706 : + index * dflow->problem->block_info_elt_size);
1543 : : }
1544 : :
1545 : :
1546 : : /* Set basic block info. */
1547 : :
1548 : : static void
1549 : 545800288 : df_set_bb_info (struct dataflow *dflow, unsigned int index,
1550 : : void *bb_info)
1551 : : {
1552 : 545800288 : gcc_assert (dflow->block_info);
1553 : 545800288 : memcpy ((char *)dflow->block_info
1554 : 545800288 : + index * dflow->problem->block_info_elt_size,
1555 : 545800288 : bb_info, dflow->problem->block_info_elt_size);
1556 : 545800288 : }
1557 : :
1558 : :
1559 : : /* Clear basic block info. */
1560 : :
1561 : : static void
1562 : 19878151 : df_clear_bb_info (struct dataflow *dflow, unsigned int index)
1563 : : {
1564 : 19878151 : gcc_assert (dflow->block_info);
1565 : 19878151 : gcc_assert (dflow->block_info_size > index);
1566 : 19878151 : memset ((char *)dflow->block_info
1567 : 19878151 : + index * dflow->problem->block_info_elt_size,
1568 : 19878151 : 0, dflow->problem->block_info_elt_size);
1569 : 19878151 : }
1570 : :
1571 : :
1572 : : /* Mark the solutions as being out of date. */
1573 : :
1574 : : void
1575 : 803076952 : df_mark_solutions_dirty (void)
1576 : : {
1577 : 803076952 : if (df)
1578 : : {
1579 : : int p;
1580 : 1107534751 : for (p = 1; p < df->num_problems_defined; p++)
1581 : 738948842 : df->problems_in_order[p]->solutions_dirty = true;
1582 : : }
1583 : 803076952 : }
1584 : :
1585 : :
1586 : : /* Return true if BB needs it's transfer functions recomputed. */
1587 : :
1588 : : bool
1589 : 90468891 : df_get_bb_dirty (basic_block bb)
1590 : : {
1591 : 180937782 : return bitmap_bit_p ((df_live
1592 : 90468891 : ? df_live : df_lr)->out_of_date_transfer_functions,
1593 : 90468891 : bb->index);
1594 : : }
1595 : :
1596 : :
1597 : : /* Mark BB as needing it's transfer functions as being out of
1598 : : date. */
1599 : :
1600 : : void
1601 : 306348680 : df_set_bb_dirty (basic_block bb)
1602 : : {
1603 : 306348680 : bb->flags |= BB_MODIFIED;
1604 : 306348680 : if (df)
1605 : : {
1606 : : int p;
1607 : 885916690 : for (p = 1; p < df->num_problems_defined; p++)
1608 : : {
1609 : 586171980 : struct dataflow *dflow = df->problems_in_order[p];
1610 : 586171980 : if (dflow->out_of_date_transfer_functions)
1611 : 457127629 : bitmap_set_bit (dflow->out_of_date_transfer_functions, bb->index);
1612 : : }
1613 : 299744710 : df_mark_solutions_dirty ();
1614 : : }
1615 : 306348680 : }
1616 : :
1617 : :
1618 : : /* Grow the bb_info array. */
1619 : :
1620 : : void
1621 : 407673807 : df_grow_bb_info (struct dataflow *dflow)
1622 : : {
1623 : 407673807 : unsigned int new_size = last_basic_block_for_fn (cfun) + 1;
1624 : 407673807 : if (dflow->block_info_size < new_size)
1625 : : {
1626 : 13203820 : new_size += new_size / 4;
1627 : 13203820 : dflow->block_info
1628 : 13203820 : = (void *)XRESIZEVEC (char, (char *)dflow->block_info,
1629 : : new_size
1630 : : * dflow->problem->block_info_elt_size);
1631 : 13203820 : memset ((char *)dflow->block_info
1632 : : + dflow->block_info_size
1633 : 13203820 : * dflow->problem->block_info_elt_size,
1634 : : 0,
1635 : 13203820 : (new_size - dflow->block_info_size)
1636 : 13203820 : * dflow->problem->block_info_elt_size);
1637 : 13203820 : dflow->block_info_size = new_size;
1638 : : }
1639 : 407673807 : }
1640 : :
1641 : :
1642 : : /* Clear the dirty bits. This is called from places that delete
1643 : : blocks. */
1644 : : static void
1645 : 5863982 : df_clear_bb_dirty (basic_block bb)
1646 : : {
1647 : 5863982 : int p;
1648 : 17952032 : for (p = 1; p < df->num_problems_defined; p++)
1649 : : {
1650 : 12088050 : struct dataflow *dflow = df->problems_in_order[p];
1651 : 12088050 : if (dflow->out_of_date_transfer_functions)
1652 : 11473951 : bitmap_clear_bit (dflow->out_of_date_transfer_functions, bb->index);
1653 : : }
1654 : 5863982 : }
1655 : :
1656 : : /* Called from the rtl_compact_blocks to reorganize the problems basic
1657 : : block info. */
1658 : :
1659 : : void
1660 : 16757285 : df_compact_blocks (void)
1661 : : {
1662 : 16757285 : int i, p;
1663 : 16757285 : basic_block bb;
1664 : 16757285 : void *problem_temps;
1665 : :
1666 : 16757285 : auto_bitmap tmp (&df_bitmap_obstack);
1667 : 66263689 : for (p = 0; p < df->num_problems_defined; p++)
1668 : : {
1669 : 49506404 : struct dataflow *dflow = df->problems_in_order[p];
1670 : :
1671 : : /* Need to reorganize the out_of_date_transfer_functions for the
1672 : : dflow problem. */
1673 : 49506404 : if (dflow->out_of_date_transfer_functions)
1674 : : {
1675 : 30796202 : bitmap_copy (tmp, dflow->out_of_date_transfer_functions);
1676 : 30796202 : bitmap_clear (dflow->out_of_date_transfer_functions);
1677 : 30796202 : if (bitmap_bit_p (tmp, ENTRY_BLOCK))
1678 : 921955 : bitmap_set_bit (dflow->out_of_date_transfer_functions, ENTRY_BLOCK);
1679 : 30796202 : if (bitmap_bit_p (tmp, EXIT_BLOCK))
1680 : 922156 : bitmap_set_bit (dflow->out_of_date_transfer_functions, EXIT_BLOCK);
1681 : :
1682 : 30796202 : i = NUM_FIXED_BLOCKS;
1683 : 387047426 : FOR_EACH_BB_FN (bb, cfun)
1684 : : {
1685 : 356251224 : if (bitmap_bit_p (tmp, bb->index))
1686 : 63067328 : bitmap_set_bit (dflow->out_of_date_transfer_functions, i);
1687 : 356251224 : i++;
1688 : : }
1689 : : }
1690 : :
1691 : : /* Now shuffle the block info for the problem. */
1692 : 49506404 : if (dflow->problem->free_bb_fun)
1693 : : {
1694 : 47553487 : int size = (last_basic_block_for_fn (cfun)
1695 : 47553487 : * dflow->problem->block_info_elt_size);
1696 : 47553487 : problem_temps = XNEWVAR (char, size);
1697 : 47553487 : df_grow_bb_info (dflow);
1698 : 47553487 : memcpy (problem_temps, dflow->block_info, size);
1699 : :
1700 : : /* Copy the bb info from the problem tmps to the proper
1701 : : place in the block_info vector. Null out the copied
1702 : : item. The entry and exit blocks never move. */
1703 : 47553487 : i = NUM_FIXED_BLOCKS;
1704 : 593331689 : FOR_EACH_BB_FN (bb, cfun)
1705 : : {
1706 : 545778202 : df_set_bb_info (dflow, i,
1707 : : (char *)problem_temps
1708 : 545778202 : + bb->index * dflow->problem->block_info_elt_size);
1709 : 545778202 : i++;
1710 : : }
1711 : 47553487 : memset ((char *)dflow->block_info
1712 : 47553487 : + i * dflow->problem->block_info_elt_size, 0,
1713 : 47553487 : (last_basic_block_for_fn (cfun) - i)
1714 : 47553487 : * dflow->problem->block_info_elt_size);
1715 : 47553487 : free (problem_temps);
1716 : : }
1717 : : }
1718 : :
1719 : : /* Shuffle the bits in the basic_block indexed arrays. */
1720 : :
1721 : 16757285 : if (df->blocks_to_analyze)
1722 : : {
1723 : 0 : if (bitmap_bit_p (tmp, ENTRY_BLOCK))
1724 : 0 : bitmap_set_bit (df->blocks_to_analyze, ENTRY_BLOCK);
1725 : 0 : if (bitmap_bit_p (tmp, EXIT_BLOCK))
1726 : 0 : bitmap_set_bit (df->blocks_to_analyze, EXIT_BLOCK);
1727 : 0 : bitmap_copy (tmp, df->blocks_to_analyze);
1728 : 0 : bitmap_clear (df->blocks_to_analyze);
1729 : 0 : i = NUM_FIXED_BLOCKS;
1730 : 0 : FOR_EACH_BB_FN (bb, cfun)
1731 : : {
1732 : 0 : if (bitmap_bit_p (tmp, bb->index))
1733 : 0 : bitmap_set_bit (df->blocks_to_analyze, i);
1734 : 0 : i++;
1735 : : }
1736 : : }
1737 : :
1738 : 16757285 : i = NUM_FIXED_BLOCKS;
1739 : 206284263 : FOR_EACH_BB_FN (bb, cfun)
1740 : : {
1741 : 189526978 : SET_BASIC_BLOCK_FOR_FN (cfun, i, bb);
1742 : 189526978 : bb->index = i;
1743 : 189526978 : i++;
1744 : : }
1745 : :
1746 : 16757285 : gcc_assert (i == n_basic_blocks_for_fn (cfun));
1747 : :
1748 : 22620427 : for (; i < last_basic_block_for_fn (cfun); i++)
1749 : 5863142 : SET_BASIC_BLOCK_FOR_FN (cfun, i, NULL);
1750 : :
1751 : : #ifdef DF_DEBUG_CFG
1752 : : if (!df_lr->solutions_dirty)
1753 : : df_set_clean_cfg ();
1754 : : #endif
1755 : 16757285 : }
1756 : :
1757 : :
1758 : : /* Shove NEW_BLOCK in at OLD_INDEX. Called from ifcvt to hack a
1759 : : block. There is no excuse for people to do this kind of thing. */
1760 : :
1761 : : void
1762 : 7362 : df_bb_replace (int old_index, basic_block new_block)
1763 : : {
1764 : 7362 : int new_block_index = new_block->index;
1765 : 7362 : int p;
1766 : :
1767 : 7362 : if (dump_file)
1768 : 0 : fprintf (dump_file, "shoving block %d into %d\n", new_block_index, old_index);
1769 : :
1770 : 7362 : gcc_assert (df);
1771 : 7362 : gcc_assert (BASIC_BLOCK_FOR_FN (cfun, old_index) == NULL);
1772 : :
1773 : 29448 : for (p = 0; p < df->num_problems_defined; p++)
1774 : : {
1775 : 22086 : struct dataflow *dflow = df->problems_in_order[p];
1776 : 22086 : if (dflow->block_info)
1777 : : {
1778 : 22086 : df_grow_bb_info (dflow);
1779 : 44172 : df_set_bb_info (dflow, old_index,
1780 : : df_get_bb_info (dflow, new_block_index));
1781 : : }
1782 : : }
1783 : :
1784 : 7362 : df_clear_bb_dirty (new_block);
1785 : 7362 : SET_BASIC_BLOCK_FOR_FN (cfun, old_index, new_block);
1786 : 7362 : new_block->index = old_index;
1787 : 7362 : df_set_bb_dirty (BASIC_BLOCK_FOR_FN (cfun, old_index));
1788 : 7362 : SET_BASIC_BLOCK_FOR_FN (cfun, new_block_index, NULL);
1789 : 7362 : }
1790 : :
1791 : :
1792 : : /* Free all of the per basic block dataflow from all of the problems.
1793 : : This is typically called before a basic block is deleted and the
1794 : : problem will be reanalyzed. */
1795 : :
1796 : : void
1797 : 10290098 : df_bb_delete (int bb_index)
1798 : : {
1799 : 10290098 : basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bb_index);
1800 : 10290098 : int i;
1801 : :
1802 : 10290098 : if (!df)
1803 : : return;
1804 : :
1805 : 23786566 : for (i = 0; i < df->num_problems_defined; i++)
1806 : : {
1807 : 17929946 : struct dataflow *dflow = df->problems_in_order[i];
1808 : 17929946 : if (dflow->problem->free_bb_fun)
1809 : : {
1810 : 35245795 : void *bb_info = df_get_bb_info (dflow, bb_index);
1811 : 17100531 : if (bb_info)
1812 : : {
1813 : 17100531 : dflow->problem->free_bb_fun (bb, bb_info);
1814 : 17100531 : df_clear_bb_info (dflow, bb_index);
1815 : : }
1816 : : }
1817 : : }
1818 : 5856620 : df_clear_bb_dirty (bb);
1819 : 5856620 : df_mark_solutions_dirty ();
1820 : : }
1821 : :
1822 : :
1823 : : /* Verify that there is a place for everything and everything is in
1824 : : its place. This is too expensive to run after every pass in the
1825 : : mainline. However this is an excellent debugging tool if the
1826 : : dataflow information is not being updated properly. You can just
1827 : : sprinkle calls in until you find the place that is changing an
1828 : : underlying structure without calling the proper updating
1829 : : routine. */
1830 : :
1831 : : void
1832 : 5982621 : df_verify (void)
1833 : : {
1834 : 5982621 : df_scan_verify ();
1835 : : #ifdef ENABLE_DF_CHECKING
1836 : : df_lr_verify_transfer_functions ();
1837 : : if (df_live)
1838 : : df_live_verify_transfer_functions ();
1839 : : #endif
1840 : 5982621 : df->changeable_flags &= ~DF_VERIFY_SCHEDULED;
1841 : 5982621 : }
1842 : :
1843 : : #ifdef DF_DEBUG_CFG
1844 : :
1845 : : /* Compute an array of ints that describes the cfg. This can be used
1846 : : to discover places where the cfg is modified by the appropriate
1847 : : calls have not been made to the keep df informed. The internals of
1848 : : this are unexciting, the key is that two instances of this can be
1849 : : compared to see if any changes have been made to the cfg. */
1850 : :
1851 : : static int *
1852 : : df_compute_cfg_image (void)
1853 : : {
1854 : : basic_block bb;
1855 : : int size = 2 + (2 * n_basic_blocks_for_fn (cfun));
1856 : : int i;
1857 : : int * map;
1858 : :
1859 : : FOR_ALL_BB_FN (bb, cfun)
1860 : : {
1861 : : size += EDGE_COUNT (bb->succs);
1862 : : }
1863 : :
1864 : : map = XNEWVEC (int, size);
1865 : : map[0] = size;
1866 : : i = 1;
1867 : : FOR_ALL_BB_FN (bb, cfun)
1868 : : {
1869 : : edge_iterator ei;
1870 : : edge e;
1871 : :
1872 : : map[i++] = bb->index;
1873 : : FOR_EACH_EDGE (e, ei, bb->succs)
1874 : : map[i++] = e->dest->index;
1875 : : map[i++] = -1;
1876 : : }
1877 : : map[i] = -1;
1878 : : return map;
1879 : : }
1880 : :
1881 : : static int *saved_cfg = NULL;
1882 : :
1883 : :
1884 : : /* This function compares the saved version of the cfg with the
1885 : : current cfg and aborts if the two are identical. The function
1886 : : silently returns if the cfg has been marked as dirty or the two are
1887 : : the same. */
1888 : :
1889 : : void
1890 : : df_check_cfg_clean (void)
1891 : : {
1892 : : int *new_map;
1893 : :
1894 : : if (!df)
1895 : : return;
1896 : :
1897 : : if (df_lr->solutions_dirty)
1898 : : return;
1899 : :
1900 : : if (saved_cfg == NULL)
1901 : : return;
1902 : :
1903 : : new_map = df_compute_cfg_image ();
1904 : : gcc_assert (memcmp (saved_cfg, new_map, saved_cfg[0] * sizeof (int)) == 0);
1905 : : free (new_map);
1906 : : }
1907 : :
1908 : :
1909 : : /* This function builds a cfg fingerprint and squirrels it away in
1910 : : saved_cfg. */
1911 : :
1912 : : static void
1913 : : df_set_clean_cfg (void)
1914 : : {
1915 : : free (saved_cfg);
1916 : : saved_cfg = df_compute_cfg_image ();
1917 : : }
1918 : :
1919 : : #endif /* DF_DEBUG_CFG */
1920 : : /*----------------------------------------------------------------------------
1921 : : PUBLIC INTERFACES TO QUERY INFORMATION.
1922 : : ----------------------------------------------------------------------------*/
1923 : :
1924 : :
1925 : : /* Return first def of REGNO within BB. */
1926 : :
1927 : : df_ref
1928 : 0 : df_bb_regno_first_def_find (basic_block bb, unsigned int regno)
1929 : : {
1930 : 0 : rtx_insn *insn;
1931 : 0 : df_ref def;
1932 : :
1933 : 0 : FOR_BB_INSNS (bb, insn)
1934 : : {
1935 : 0 : if (!INSN_P (insn))
1936 : 0 : continue;
1937 : :
1938 : 0 : FOR_EACH_INSN_DEF (def, insn)
1939 : 0 : if (DF_REF_REGNO (def) == regno)
1940 : 0 : return def;
1941 : : }
1942 : : return NULL;
1943 : : }
1944 : :
1945 : :
1946 : : /* Return last def of REGNO within BB. */
1947 : :
1948 : : df_ref
1949 : 0 : df_bb_regno_last_def_find (basic_block bb, unsigned int regno)
1950 : : {
1951 : 0 : rtx_insn *insn;
1952 : 0 : df_ref def;
1953 : :
1954 : 0 : FOR_BB_INSNS_REVERSE (bb, insn)
1955 : : {
1956 : 0 : if (!INSN_P (insn))
1957 : 0 : continue;
1958 : :
1959 : 0 : FOR_EACH_INSN_DEF (def, insn)
1960 : 0 : if (DF_REF_REGNO (def) == regno)
1961 : 0 : return def;
1962 : : }
1963 : :
1964 : : return NULL;
1965 : : }
1966 : :
1967 : : /* Finds the reference corresponding to the definition of REG in INSN.
1968 : : DF is the dataflow object. */
1969 : :
1970 : : df_ref
1971 : 715846 : df_find_def (rtx_insn *insn, rtx reg)
1972 : : {
1973 : 715846 : df_ref def;
1974 : :
1975 : 715846 : if (GET_CODE (reg) == SUBREG)
1976 : 0 : reg = SUBREG_REG (reg);
1977 : 715846 : gcc_assert (REG_P (reg));
1978 : :
1979 : 1013577 : FOR_EACH_INSN_DEF (def, insn)
1980 : 1013577 : if (DF_REF_REGNO (def) == REGNO (reg))
1981 : 715846 : return def;
1982 : :
1983 : : return NULL;
1984 : : }
1985 : :
1986 : :
1987 : : /* Return true if REG is defined in INSN, zero otherwise. */
1988 : :
1989 : : bool
1990 : 0 : df_reg_defined (rtx_insn *insn, rtx reg)
1991 : : {
1992 : 0 : return df_find_def (insn, reg) != NULL;
1993 : : }
1994 : :
1995 : :
1996 : : /* Finds the reference corresponding to the use of REG in INSN.
1997 : : DF is the dataflow object. */
1998 : :
1999 : : df_ref
2000 : 4273525 : df_find_use (rtx_insn *insn, rtx reg)
2001 : : {
2002 : 4273525 : df_ref use;
2003 : :
2004 : 4273525 : if (GET_CODE (reg) == SUBREG)
2005 : 0 : reg = SUBREG_REG (reg);
2006 : 4273525 : gcc_assert (REG_P (reg));
2007 : :
2008 : 4273525 : df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
2009 : 5025982 : FOR_EACH_INSN_INFO_USE (use, insn_info)
2010 : 5025982 : if (DF_REF_REGNO (use) == REGNO (reg))
2011 : 4273525 : return use;
2012 : 0 : if (df->changeable_flags & DF_EQ_NOTES)
2013 : 0 : FOR_EACH_INSN_INFO_EQ_USE (use, insn_info)
2014 : 0 : if (DF_REF_REGNO (use) == REGNO (reg))
2015 : 0 : return use;
2016 : : return NULL;
2017 : : }
2018 : :
2019 : :
2020 : : /* Return true if REG is referenced in INSN, zero otherwise. */
2021 : :
2022 : : bool
2023 : 0 : df_reg_used (rtx_insn *insn, rtx reg)
2024 : : {
2025 : 0 : return df_find_use (insn, reg) != NULL;
2026 : : }
2027 : :
2028 : : /* If REG has a single definition, return its known value, otherwise return
2029 : : null. */
2030 : :
2031 : : rtx
2032 : 7721376 : df_find_single_def_src (rtx reg)
2033 : : {
2034 : 7721376 : rtx src = NULL_RTX;
2035 : :
2036 : : /* Don't look through unbounded number of single definition REG copies,
2037 : : there might be loops for sources with uninitialized variables. */
2038 : 8458877 : for (int cnt = 0; cnt < 128; cnt++)
2039 : : {
2040 : 8458869 : df_ref adef = DF_REG_DEF_CHAIN (REGNO (reg));
2041 : 8458869 : if (adef == NULL || DF_REF_NEXT_REG (adef) != NULL
2042 : 5677459 : || DF_REF_IS_ARTIFICIAL (adef)
2043 : 5541523 : || (DF_REF_FLAGS (adef)
2044 : : & (DF_REF_PARTIAL | DF_REF_CONDITIONAL)))
2045 : : return NULL_RTX;
2046 : :
2047 : 5541507 : rtx set = single_set (DF_REF_INSN (adef));
2048 : 5541507 : if (set == NULL || !rtx_equal_p (SET_DEST (set), reg))
2049 : 13726 : return NULL_RTX;
2050 : :
2051 : 5527781 : rtx note = find_reg_equal_equiv_note (DF_REF_INSN (adef));
2052 : 5527781 : if (note && function_invariant_p (XEXP (note, 0)))
2053 : 153192 : return XEXP (note, 0);
2054 : 5374589 : src = SET_SRC (set);
2055 : :
2056 : 5374589 : if (REG_P (src))
2057 : : {
2058 : 737501 : reg = src;
2059 : 737501 : continue;
2060 : : }
2061 : : break;
2062 : : }
2063 : 4637096 : if (!function_invariant_p (src))
2064 : : return NULL_RTX;
2065 : :
2066 : : return src;
2067 : : }
2068 : :
2069 : :
2070 : : /*----------------------------------------------------------------------------
2071 : : Debugging and printing functions.
2072 : : ----------------------------------------------------------------------------*/
2073 : :
2074 : : /* Write information about registers and basic blocks into FILE.
2075 : : This is part of making a debugging dump. */
2076 : :
2077 : : void
2078 : 169 : dump_regset (regset r, FILE *outf)
2079 : : {
2080 : 169 : unsigned i;
2081 : 169 : reg_set_iterator rsi;
2082 : :
2083 : 169 : if (r == NULL)
2084 : : {
2085 : 0 : fputs (" (nil)", outf);
2086 : 0 : return;
2087 : : }
2088 : :
2089 : 2155 : EXECUTE_IF_SET_IN_REG_SET (r, 0, i, rsi)
2090 : : {
2091 : 1986 : fprintf (outf, " %d", i);
2092 : 1986 : if (i < FIRST_PSEUDO_REGISTER)
2093 : 1285 : fprintf (outf, " [%s]",
2094 : : reg_names[i]);
2095 : : }
2096 : : }
2097 : :
2098 : : /* Print a human-readable representation of R on the standard error
2099 : : stream. This function is designed to be used from within the
2100 : : debugger. */
2101 : : extern void debug_regset (regset);
2102 : : DEBUG_FUNCTION void
2103 : 0 : debug_regset (regset r)
2104 : : {
2105 : 0 : dump_regset (r, stderr);
2106 : 0 : putc ('\n', stderr);
2107 : 0 : }
2108 : :
2109 : : /* Write information about registers and basic blocks into FILE.
2110 : : This is part of making a debugging dump. */
2111 : :
2112 : : void
2113 : 58201 : df_print_regset (FILE *file, const_bitmap r)
2114 : : {
2115 : 58201 : unsigned int i;
2116 : 58201 : bitmap_iterator bi;
2117 : :
2118 : 58201 : if (r == NULL)
2119 : 0 : fputs (" (nil)", file);
2120 : : else
2121 : : {
2122 : 714582 : EXECUTE_IF_SET_IN_BITMAP (r, 0, i, bi)
2123 : : {
2124 : 656381 : fprintf (file, " %d", i);
2125 : 656381 : if (i < FIRST_PSEUDO_REGISTER)
2126 : 605200 : fprintf (file, " [%s]", reg_names[i]);
2127 : : }
2128 : : }
2129 : 58201 : fprintf (file, "\n");
2130 : 58201 : }
2131 : :
2132 : :
2133 : : /* Write information about registers and basic blocks into FILE. The
2134 : : bitmap is in the form used by df_byte_lr. This is part of making a
2135 : : debugging dump. */
2136 : :
2137 : : void
2138 : 0 : df_print_word_regset (FILE *file, const_bitmap r)
2139 : : {
2140 : 0 : unsigned int max_reg = max_reg_num ();
2141 : :
2142 : 0 : if (r == NULL)
2143 : 0 : fputs (" (nil)", file);
2144 : : else
2145 : : {
2146 : : unsigned int i;
2147 : 0 : for (i = FIRST_PSEUDO_REGISTER; i < max_reg; i++)
2148 : : {
2149 : 0 : bool found = (bitmap_bit_p (r, 2 * i)
2150 : 0 : || bitmap_bit_p (r, 2 * i + 1));
2151 : 0 : if (found)
2152 : : {
2153 : 0 : int word;
2154 : 0 : const char * sep = "";
2155 : 0 : fprintf (file, " %d", i);
2156 : 0 : fprintf (file, "(");
2157 : 0 : for (word = 0; word < 2; word++)
2158 : 0 : if (bitmap_bit_p (r, 2 * i + word))
2159 : : {
2160 : 0 : fprintf (file, "%s%d", sep, word);
2161 : 0 : sep = ", ";
2162 : : }
2163 : 0 : fprintf (file, ")");
2164 : : }
2165 : : }
2166 : : }
2167 : 0 : fprintf (file, "\n");
2168 : 0 : }
2169 : :
2170 : :
2171 : : /* Dump dataflow info. */
2172 : :
2173 : : void
2174 : 372 : df_dump (FILE *file)
2175 : : {
2176 : 372 : basic_block bb;
2177 : 372 : df_dump_start (file);
2178 : :
2179 : 4113 : FOR_ALL_BB_FN (bb, cfun)
2180 : : {
2181 : 3741 : df_print_bb_index (bb, file);
2182 : 3741 : df_dump_top (bb, file);
2183 : 3741 : df_dump_bottom (bb, file);
2184 : : }
2185 : :
2186 : 372 : fprintf (file, "\n");
2187 : 372 : }
2188 : :
2189 : :
2190 : : /* Dump dataflow info for df->blocks_to_analyze. */
2191 : :
2192 : : void
2193 : 214 : df_dump_region (FILE *file)
2194 : : {
2195 : 214 : if (df->blocks_to_analyze)
2196 : : {
2197 : 214 : bitmap_iterator bi;
2198 : 214 : unsigned int bb_index;
2199 : :
2200 : 214 : fprintf (file, "\n\nstarting region dump\n");
2201 : 214 : df_dump_start (file);
2202 : :
2203 : 657 : EXECUTE_IF_SET_IN_BITMAP (df->blocks_to_analyze, 0, bb_index, bi)
2204 : : {
2205 : 443 : basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bb_index);
2206 : 443 : dump_bb (file, bb, 0, TDF_DETAILS);
2207 : : }
2208 : 214 : fprintf (file, "\n");
2209 : : }
2210 : : else
2211 : 0 : df_dump (file);
2212 : 214 : }
2213 : :
2214 : :
2215 : : /* Dump the introductory information for each problem defined. */
2216 : :
2217 : : void
2218 : 3829 : df_dump_start (FILE *file)
2219 : : {
2220 : 3829 : int i;
2221 : :
2222 : 3829 : if (!df || !file)
2223 : : return;
2224 : :
2225 : 3829 : fprintf (file, "\n\n%s\n", current_function_name ());
2226 : 3829 : fprintf (file, "\nDataflow summary:\n");
2227 : 3829 : if (df->blocks_to_analyze)
2228 : 452 : fprintf (file, "def_info->table_size = %d, use_info->table_size = %d\n",
2229 : : DF_DEFS_TABLE_SIZE (), DF_USES_TABLE_SIZE ());
2230 : :
2231 : 14407 : for (i = 0; i < df->num_problems_defined; i++)
2232 : : {
2233 : 10578 : struct dataflow *dflow = df->problems_in_order[i];
2234 : 10578 : if (dflow->computed)
2235 : : {
2236 : 10111 : df_dump_problem_function fun = dflow->problem->dump_start_fun;
2237 : 10111 : if (fun)
2238 : 4065 : fun (file);
2239 : : }
2240 : : }
2241 : : }
2242 : :
2243 : :
2244 : : /* Dump the top or bottom of the block information for BB. */
2245 : : static void
2246 : 10400 : df_dump_bb_problem_data (basic_block bb, FILE *file, bool top)
2247 : : {
2248 : 10400 : int i;
2249 : :
2250 : 10400 : if (!df || !file)
2251 : : return;
2252 : :
2253 : 45208 : for (i = 0; i < df->num_problems_defined; i++)
2254 : : {
2255 : 34808 : struct dataflow *dflow = df->problems_in_order[i];
2256 : 34808 : if (dflow->computed)
2257 : : {
2258 : 30886 : df_dump_bb_problem_function bbfun;
2259 : :
2260 : 30886 : if (top)
2261 : 15443 : bbfun = dflow->problem->dump_top_fun;
2262 : : else
2263 : 15443 : bbfun = dflow->problem->dump_bottom_fun;
2264 : :
2265 : 30886 : if (bbfun)
2266 : 24762 : bbfun (bb, file);
2267 : : }
2268 : : }
2269 : : }
2270 : :
2271 : : /* Dump the top of the block information for BB. */
2272 : :
2273 : : void
2274 : 5200 : df_dump_top (basic_block bb, FILE *file)
2275 : : {
2276 : 5200 : df_dump_bb_problem_data (bb, file, /*top=*/true);
2277 : 5200 : }
2278 : :
2279 : : /* Dump the bottom of the block information for BB. */
2280 : :
2281 : : void
2282 : 5200 : df_dump_bottom (basic_block bb, FILE *file)
2283 : : {
2284 : 5200 : df_dump_bb_problem_data (bb, file, /*top=*/false);
2285 : 5200 : }
2286 : :
2287 : :
2288 : : /* Dump information about INSN just before or after dumping INSN itself. */
2289 : : static void
2290 : 46166 : df_dump_insn_problem_data (const rtx_insn *insn, FILE *file, bool top)
2291 : : {
2292 : 46166 : int i;
2293 : :
2294 : 46166 : if (!df || !file)
2295 : : return;
2296 : :
2297 : 148608 : for (i = 0; i < df->num_problems_defined; i++)
2298 : : {
2299 : 108116 : struct dataflow *dflow = df->problems_in_order[i];
2300 : 108116 : if (dflow->computed)
2301 : : {
2302 : 106346 : df_dump_insn_problem_function insnfun;
2303 : :
2304 : 106346 : if (top)
2305 : 53173 : insnfun = dflow->problem->dump_insn_top_fun;
2306 : : else
2307 : 53173 : insnfun = dflow->problem->dump_insn_bottom_fun;
2308 : :
2309 : 106346 : if (insnfun)
2310 : 4776 : insnfun (insn, file);
2311 : : }
2312 : : }
2313 : : }
2314 : :
2315 : : /* Dump information about INSN before dumping INSN itself. */
2316 : :
2317 : : void
2318 : 23083 : df_dump_insn_top (const rtx_insn *insn, FILE *file)
2319 : : {
2320 : 23083 : df_dump_insn_problem_data (insn, file, /*top=*/true);
2321 : 23083 : }
2322 : :
2323 : : /* Dump information about INSN after dumping INSN itself. */
2324 : :
2325 : : void
2326 : 23083 : df_dump_insn_bottom (const rtx_insn *insn, FILE *file)
2327 : : {
2328 : 23083 : df_dump_insn_problem_data (insn, file, /*top=*/false);
2329 : 23083 : }
2330 : :
2331 : :
2332 : : static void
2333 : 22338 : df_ref_dump (df_ref ref, FILE *file)
2334 : : {
2335 : 22338 : fprintf (file, "%c%d(%d)",
2336 : 22338 : DF_REF_REG_DEF_P (ref)
2337 : 14928 : ? 'd'
2338 : 14928 : : (DF_REF_FLAGS (ref) & DF_REF_IN_NOTE) ? 'e' : 'u',
2339 : : DF_REF_ID (ref),
2340 : : DF_REF_REGNO (ref));
2341 : 22338 : }
2342 : :
2343 : : void
2344 : 10400 : df_refs_chain_dump (df_ref ref, bool follow_chain, FILE *file)
2345 : : {
2346 : 10400 : fprintf (file, "{ ");
2347 : 43138 : for (; ref; ref = DF_REF_NEXT_LOC (ref))
2348 : : {
2349 : 22338 : df_ref_dump (ref, file);
2350 : 22338 : if (follow_chain)
2351 : 22338 : df_chain_dump (DF_REF_CHAIN (ref), file);
2352 : : }
2353 : 10400 : fprintf (file, "}");
2354 : 10400 : }
2355 : :
2356 : :
2357 : : /* Dump either a ref-def or reg-use chain. */
2358 : :
2359 : : void
2360 : 0 : df_regs_chain_dump (df_ref ref, FILE *file)
2361 : : {
2362 : 0 : fprintf (file, "{ ");
2363 : 0 : while (ref)
2364 : : {
2365 : 0 : df_ref_dump (ref, file);
2366 : 0 : ref = DF_REF_NEXT_REG (ref);
2367 : : }
2368 : 0 : fprintf (file, "}");
2369 : 0 : }
2370 : :
2371 : :
2372 : : static void
2373 : 0 : df_mws_dump (struct df_mw_hardreg *mws, FILE *file)
2374 : : {
2375 : 0 : for (; mws; mws = DF_MWS_NEXT (mws))
2376 : 0 : fprintf (file, "mw %c r[%d..%d]\n",
2377 : 0 : DF_MWS_REG_DEF_P (mws) ? 'd' : 'u',
2378 : : mws->start_regno, mws->end_regno);
2379 : 0 : }
2380 : :
2381 : :
2382 : : static void
2383 : 0 : df_insn_uid_debug (unsigned int uid,
2384 : : bool follow_chain, FILE *file)
2385 : : {
2386 : 0 : fprintf (file, "insn %d luid %d",
2387 : 0 : uid, DF_INSN_UID_LUID (uid));
2388 : :
2389 : 0 : if (DF_INSN_UID_DEFS (uid))
2390 : : {
2391 : 0 : fprintf (file, " defs ");
2392 : 0 : df_refs_chain_dump (DF_INSN_UID_DEFS (uid), follow_chain, file);
2393 : : }
2394 : :
2395 : 0 : if (DF_INSN_UID_USES (uid))
2396 : : {
2397 : 0 : fprintf (file, " uses ");
2398 : 0 : df_refs_chain_dump (DF_INSN_UID_USES (uid), follow_chain, file);
2399 : : }
2400 : :
2401 : 0 : if (DF_INSN_UID_EQ_USES (uid))
2402 : : {
2403 : 0 : fprintf (file, " eq uses ");
2404 : 0 : df_refs_chain_dump (DF_INSN_UID_EQ_USES (uid), follow_chain, file);
2405 : : }
2406 : :
2407 : 0 : if (DF_INSN_UID_MWS (uid))
2408 : : {
2409 : 0 : fprintf (file, " mws ");
2410 : 0 : df_mws_dump (DF_INSN_UID_MWS (uid), file);
2411 : : }
2412 : 0 : fprintf (file, "\n");
2413 : 0 : }
2414 : :
2415 : :
2416 : : DEBUG_FUNCTION void
2417 : 0 : df_insn_debug (rtx_insn *insn, bool follow_chain, FILE *file)
2418 : : {
2419 : 0 : df_insn_uid_debug (INSN_UID (insn), follow_chain, file);
2420 : 0 : }
2421 : :
2422 : : DEBUG_FUNCTION void
2423 : 0 : df_insn_debug_regno (rtx_insn *insn, FILE *file)
2424 : : {
2425 : 0 : struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
2426 : :
2427 : 0 : fprintf (file, "insn %d bb %d luid %d defs ",
2428 : 0 : INSN_UID (insn), BLOCK_FOR_INSN (insn)->index,
2429 : : DF_INSN_INFO_LUID (insn_info));
2430 : 0 : df_refs_chain_dump (DF_INSN_INFO_DEFS (insn_info), false, file);
2431 : :
2432 : 0 : fprintf (file, " uses ");
2433 : 0 : df_refs_chain_dump (DF_INSN_INFO_USES (insn_info), false, file);
2434 : :
2435 : 0 : fprintf (file, " eq_uses ");
2436 : 0 : df_refs_chain_dump (DF_INSN_INFO_EQ_USES (insn_info), false, file);
2437 : 0 : fprintf (file, "\n");
2438 : 0 : }
2439 : :
2440 : : DEBUG_FUNCTION void
2441 : 0 : df_regno_debug (unsigned int regno, FILE *file)
2442 : : {
2443 : 0 : fprintf (file, "reg %d defs ", regno);
2444 : 0 : df_regs_chain_dump (DF_REG_DEF_CHAIN (regno), file);
2445 : 0 : fprintf (file, " uses ");
2446 : 0 : df_regs_chain_dump (DF_REG_USE_CHAIN (regno), file);
2447 : 0 : fprintf (file, " eq_uses ");
2448 : 0 : df_regs_chain_dump (DF_REG_EQ_USE_CHAIN (regno), file);
2449 : 0 : fprintf (file, "\n");
2450 : 0 : }
2451 : :
2452 : :
2453 : : DEBUG_FUNCTION void
2454 : 0 : df_ref_debug (df_ref ref, FILE *file)
2455 : : {
2456 : 0 : fprintf (file, "%c%d ",
2457 : 0 : DF_REF_REG_DEF_P (ref) ? 'd' : 'u',
2458 : : DF_REF_ID (ref));
2459 : 0 : fprintf (file, "reg %d bb %d insn %d flag %#x type %#x ",
2460 : : DF_REF_REGNO (ref),
2461 : 0 : DF_REF_BBNO (ref),
2462 : 0 : DF_REF_IS_ARTIFICIAL (ref) ? -1 : DF_REF_INSN_UID (ref),
2463 : 0 : DF_REF_FLAGS (ref),
2464 : 0 : DF_REF_TYPE (ref));
2465 : 0 : if (DF_REF_LOC (ref))
2466 : : {
2467 : 0 : if (flag_dump_noaddr)
2468 : 0 : fprintf (file, "loc #(#) chain ");
2469 : : else
2470 : 0 : fprintf (file, "loc %p(%p) chain ", (void *)DF_REF_LOC (ref),
2471 : : (void *)*DF_REF_LOC (ref));
2472 : : }
2473 : : else
2474 : 0 : fprintf (file, "chain ");
2475 : 0 : df_chain_dump (DF_REF_CHAIN (ref), file);
2476 : 0 : fprintf (file, "\n");
2477 : 0 : }
2478 : :
2479 : : /* Functions for debugging from GDB. */
2480 : :
2481 : : DEBUG_FUNCTION void
2482 : 0 : debug_df_insn (rtx_insn *insn)
2483 : : {
2484 : 0 : df_insn_debug (insn, true, stderr);
2485 : 0 : debug_rtx (insn);
2486 : 0 : }
2487 : :
2488 : :
2489 : : DEBUG_FUNCTION void
2490 : 0 : debug_df_reg (rtx reg)
2491 : : {
2492 : 0 : df_regno_debug (REGNO (reg), stderr);
2493 : 0 : }
2494 : :
2495 : :
2496 : : DEBUG_FUNCTION void
2497 : 0 : debug_df_regno (unsigned int regno)
2498 : : {
2499 : 0 : df_regno_debug (regno, stderr);
2500 : 0 : }
2501 : :
2502 : :
2503 : : DEBUG_FUNCTION void
2504 : 0 : debug_df_ref (df_ref ref)
2505 : : {
2506 : 0 : df_ref_debug (ref, stderr);
2507 : 0 : }
2508 : :
2509 : :
2510 : : DEBUG_FUNCTION void
2511 : 0 : debug_df_defno (unsigned int defno)
2512 : : {
2513 : 0 : df_ref_debug (DF_DEFS_GET (defno), stderr);
2514 : 0 : }
2515 : :
2516 : :
2517 : : DEBUG_FUNCTION void
2518 : 0 : debug_df_useno (unsigned int defno)
2519 : : {
2520 : 0 : df_ref_debug (DF_USES_GET (defno), stderr);
2521 : 0 : }
2522 : :
2523 : :
2524 : : DEBUG_FUNCTION void
2525 : 0 : debug_df_chain (struct df_link *link)
2526 : : {
2527 : 0 : df_chain_dump (link, stderr);
2528 : 0 : fputc ('\n', stderr);
2529 : 0 : }
|
