1 /* Allocation for dataflow support routines.
2 Copyright (C) 1999-2023 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).
8 This file is part of GCC.
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
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
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/>. */
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.
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.
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.
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.
47 There are several optional problems. These can be enabled when they
48 are needed and disabled when they are not needed.
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
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.
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.
71 Here is an example of using the dataflow routines.
73 df_[chain,live,note,rd]_add_problem (flags);
75 df_set_blocks (blocks);
81 df_finish_pass (false);
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.
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.
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.
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.
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.
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.
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.
135 There are four ways of doing the incremental scanning:
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
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:
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
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.
166 c) If the pass modifies insns several times, this incremental
167 updating may be expensive.
169 d) If the pass modifies all of the insns, as does register
170 allocation, it is simply better to rescan the entire function.
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.
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.
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.
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
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.
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.
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
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.
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.
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.
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.
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.
249 The basic object is a DF_REF (reference) and this may either be a
250 DEF (definition) or a USE of a register.
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
258 Note that the reg-def and reg-use chains are generally short for
259 pseudos and long for the hard registers.
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.
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.
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.
289 There are 4 ways to obtain access to refs:
291 1) References are divided into two categories, REAL and ARTIFICIAL.
293 REAL refs are associated with instructions.
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.
299 Artificial defs and uses occur both at the beginning and ends of blocks.
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.
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
314 Artificial defs occur at the end of the entry block. These arise
315 from registers that are live at entry to the function.
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.)
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.
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.
333 In previous versions of this code, these chains were ordered. It
334 has not been practical to continue this practice.
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
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.
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.
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.
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
372 Paradoxical subreg writes do not leave a trace of the old content, so they
373 are write-only operations.
379 #include "coretypes.h"
383 #include "memmodel.h"
384 #include "emit-rtl.h"
386 #include "tree-pass.h"
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);
393 static void df_set_clean_cfg (void);
396 /* The obstack on which regsets are allocated. */
397 struct bitmap_obstack reg_obstack
;
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. */
403 bitmap_obstack df_bitmap_obstack
;
406 /*----------------------------------------------------------------------------
407 Functions to create, destroy and manipulate an instance of df.
408 ----------------------------------------------------------------------------*/
412 /* Add PROBLEM (and any dependent problems) to the DF instance. */
415 df_add_problem (const struct df_problem
*problem
)
417 struct dataflow
*dflow
;
420 /* First try to add the dependent problem. */
421 if (problem
->dependent_problem
)
422 df_add_problem (problem
->dependent_problem
);
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
427 dflow
= df
->problems_by_index
[problem
->id
];
431 /* Make a new one and add it to the end. */
432 dflow
= XCNEW (struct dataflow
);
433 dflow
->problem
= problem
;
434 dflow
->computed
= false;
435 dflow
->solutions_dirty
= true;
436 df
->problems_by_index
[dflow
->problem
->id
] = dflow
;
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
445 df
->num_problems_defined
++;
446 for (i
= df
->num_problems_defined
- 2; i
>= 0; i
--)
448 if (problem
->id
< df
->problems_in_order
[i
]->problem
->id
)
449 df
->problems_in_order
[i
+1] = df
->problems_in_order
[i
];
452 df
->problems_in_order
[i
+1] = dflow
;
456 df
->problems_in_order
[0] = dflow
;
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. */
464 df_set_flags (int changeable_flags
)
466 int old_flags
= df
->changeable_flags
;
467 df
->changeable_flags
|= changeable_flags
;
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. */
476 df_clear_flags (int changeable_flags
)
478 int old_flags
= df
->changeable_flags
;
479 df
->changeable_flags
&= ~changeable_flags
;
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
489 df_set_blocks (bitmap blocks
)
494 bitmap_print (dump_file
, blocks
, "setting blocks to analyze ", "\n");
495 if (df
->blocks_to_analyze
)
497 /* This block is called to change the focus from one subset
500 auto_bitmap
diff (&df_bitmap_obstack
);
501 bitmap_and_compl (diff
, df
->blocks_to_analyze
, blocks
);
502 for (p
= 0; p
< df
->num_problems_defined
; p
++)
504 struct dataflow
*dflow
= df
->problems_in_order
[p
];
505 if (dflow
->optional_p
&& dflow
->problem
->reset_fun
)
506 dflow
->problem
->reset_fun (df
->blocks_to_analyze
);
507 else if (dflow
->problem
->free_blocks_on_set_blocks
)
510 unsigned int bb_index
;
512 EXECUTE_IF_SET_IN_BITMAP (diff
, 0, bb_index
, bi
)
514 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, bb_index
);
517 void *bb_info
= df_get_bb_info (dflow
, bb_index
);
518 dflow
->problem
->free_bb_fun (bb
, bb_info
);
519 df_clear_bb_info (dflow
, bb_index
);
527 /* This block of code is executed to change the focus from
528 the entire function to a subset. */
529 bitmap_head blocks_to_reset
;
530 bool initialized
= false;
532 for (p
= 0; p
< df
->num_problems_defined
; p
++)
534 struct dataflow
*dflow
= df
->problems_in_order
[p
];
535 if (dflow
->optional_p
&& dflow
->problem
->reset_fun
)
540 bitmap_initialize (&blocks_to_reset
, &df_bitmap_obstack
);
541 FOR_ALL_BB_FN (bb
, cfun
)
543 bitmap_set_bit (&blocks_to_reset
, bb
->index
);
546 dflow
->problem
->reset_fun (&blocks_to_reset
);
550 bitmap_clear (&blocks_to_reset
);
552 df
->blocks_to_analyze
= BITMAP_ALLOC (&df_bitmap_obstack
);
554 bitmap_copy (df
->blocks_to_analyze
, blocks
);
555 df
->analyze_subset
= true;
559 /* This block is executed to reset the focus to the entire
562 fprintf (dump_file
, "clearing blocks_to_analyze\n");
563 if (df
->blocks_to_analyze
)
565 BITMAP_FREE (df
->blocks_to_analyze
);
566 df
->blocks_to_analyze
= NULL
;
568 df
->analyze_subset
= false;
571 /* Setting the blocks causes the refs to be unorganized since only
572 the refs in the blocks are seen. */
573 df_maybe_reorganize_def_refs (DF_REF_ORDER_NO_TABLE
);
574 df_maybe_reorganize_use_refs (DF_REF_ORDER_NO_TABLE
);
575 df_mark_solutions_dirty ();
579 /* Delete a DFLOW problem (and any problems that depend on this
583 df_remove_problem (struct dataflow
*dflow
)
585 const struct df_problem
*problem
;
591 problem
= dflow
->problem
;
592 gcc_assert (problem
->remove_problem_fun
);
594 /* Delete any problems that depended on this problem first. */
595 for (i
= 0; i
< df
->num_problems_defined
; i
++)
596 if (df
->problems_in_order
[i
]->problem
->dependent_problem
== problem
)
597 df_remove_problem (df
->problems_in_order
[i
]);
599 /* Now remove this problem. */
600 for (i
= 0; i
< df
->num_problems_defined
; i
++)
601 if (df
->problems_in_order
[i
] == dflow
)
604 for (j
= i
+ 1; j
< df
->num_problems_defined
; j
++)
605 df
->problems_in_order
[j
-1] = df
->problems_in_order
[j
];
606 df
->problems_in_order
[j
-1] = NULL
;
607 df
->num_problems_defined
--;
611 (problem
->remove_problem_fun
) ();
612 df
->problems_by_index
[problem
->id
] = NULL
;
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. */
621 df_finish_pass (bool verify ATTRIBUTE_UNUSED
)
625 #ifdef ENABLE_DF_CHECKING
632 df_maybe_reorganize_def_refs (DF_REF_ORDER_NO_TABLE
);
633 df_maybe_reorganize_use_refs (DF_REF_ORDER_NO_TABLE
);
635 #ifdef ENABLE_DF_CHECKING
636 saved_flags
= df
->changeable_flags
;
639 /* We iterate over problems by index as each problem removed will
640 lead to problems_in_order to be reordered. */
641 for (i
= 0; i
< DF_LAST_PROBLEM_PLUS1
; i
++)
643 struct dataflow
*dflow
= df
->problems_by_index
[i
];
645 if (dflow
&& dflow
->optional_p
)
646 df_remove_problem (dflow
);
649 /* Clear all of the flags. */
650 df
->changeable_flags
= 0;
651 df_process_deferred_rescans ();
653 /* Set the focus back to the whole function. */
654 if (df
->blocks_to_analyze
)
656 BITMAP_FREE (df
->blocks_to_analyze
);
657 df
->blocks_to_analyze
= NULL
;
658 df_mark_solutions_dirty ();
659 df
->analyze_subset
= false;
662 #ifdef ENABLE_DF_CHECKING
663 /* Verification will fail in DF_NO_INSN_RESCAN. */
664 if (!(saved_flags
& DF_NO_INSN_RESCAN
))
666 df_lr_verify_transfer_functions ();
668 df_live_verify_transfer_functions ();
676 if (flag_checking
&& verify
)
677 df
->changeable_flags
|= DF_VERIFY_SCHEDULED
;
681 /* Set up the dataflow instance for the entire back end. */
684 rest_of_handle_df_initialize (void)
687 df
= XCNEW (class df_d
);
688 df
->changeable_flags
= 0;
690 bitmap_obstack_initialize (&df_bitmap_obstack
);
692 /* Set this to a conservative value. Stack_ptr_mod will compute it
694 crtl
->sp_is_unchanging
= 0;
696 df_scan_add_problem ();
697 df_scan_alloc (NULL
);
699 /* These three problems are permanent. */
700 df_lr_add_problem ();
702 df_live_add_problem ();
704 df
->postorder
= XNEWVEC (int, last_basic_block_for_fn (cfun
));
705 df
->n_blocks
= post_order_compute (df
->postorder
, true, true);
706 inverted_post_order_compute (&df
->postorder_inverted
);
707 gcc_assert ((unsigned) df
->n_blocks
== df
->postorder_inverted
.length ());
709 df
->hard_regs_live_count
= XCNEWVEC (unsigned int, FIRST_PSEUDO_REGISTER
);
712 /* After reload, some ports add certain bits to regs_ever_live so
713 this cannot be reset. */
714 df_compute_regs_ever_live (true);
716 df_compute_regs_ever_live (false);
723 const pass_data pass_data_df_initialize_opt
=
727 OPTGROUP_NONE
, /* optinfo_flags */
728 TV_DF_SCAN
, /* tv_id */
729 0, /* properties_required */
730 0, /* properties_provided */
731 0, /* properties_destroyed */
732 0, /* todo_flags_start */
733 0, /* todo_flags_finish */
736 class pass_df_initialize_opt
: public rtl_opt_pass
739 pass_df_initialize_opt (gcc::context
*ctxt
)
740 : rtl_opt_pass (pass_data_df_initialize_opt
, ctxt
)
743 /* opt_pass methods: */
744 bool gate (function
*) final override
{ return optimize
> 0; }
745 unsigned int execute (function
*) final override
747 return rest_of_handle_df_initialize ();
750 }; // class pass_df_initialize_opt
755 make_pass_df_initialize_opt (gcc::context
*ctxt
)
757 return new pass_df_initialize_opt (ctxt
);
763 const pass_data pass_data_df_initialize_no_opt
=
766 "no-opt dfinit", /* name */
767 OPTGROUP_NONE
, /* optinfo_flags */
768 TV_DF_SCAN
, /* tv_id */
769 0, /* properties_required */
770 0, /* properties_provided */
771 0, /* properties_destroyed */
772 0, /* todo_flags_start */
773 0, /* todo_flags_finish */
776 class pass_df_initialize_no_opt
: public rtl_opt_pass
779 pass_df_initialize_no_opt (gcc::context
*ctxt
)
780 : rtl_opt_pass (pass_data_df_initialize_no_opt
, ctxt
)
783 /* opt_pass methods: */
784 bool gate (function
*) final override
{ return optimize
== 0; }
785 unsigned int execute (function
*) final override
787 return rest_of_handle_df_initialize ();
790 }; // class pass_df_initialize_no_opt
795 make_pass_df_initialize_no_opt (gcc::context
*ctxt
)
797 return new pass_df_initialize_no_opt (ctxt
);
801 /* Free all the dataflow info and the DF structure. This should be
802 called from the df_finish macro which also NULLs the parm. */
805 rest_of_handle_df_finish (void)
811 for (i
= 0; i
< df
->num_problems_defined
; i
++)
813 struct dataflow
*dflow
= df
->problems_in_order
[i
];
814 dflow
->problem
->free_fun ();
817 free (df
->postorder
);
818 df
->postorder_inverted
.release ();
819 free (df
->hard_regs_live_count
);
823 bitmap_obstack_release (&df_bitmap_obstack
);
830 const pass_data pass_data_df_finish
=
833 "dfinish", /* name */
834 OPTGROUP_NONE
, /* optinfo_flags */
836 0, /* properties_required */
837 0, /* properties_provided */
838 0, /* properties_destroyed */
839 0, /* todo_flags_start */
840 0, /* todo_flags_finish */
843 class pass_df_finish
: public rtl_opt_pass
846 pass_df_finish (gcc::context
*ctxt
)
847 : rtl_opt_pass (pass_data_df_finish
, ctxt
)
850 /* opt_pass methods: */
851 unsigned int execute (function
*) final override
853 return rest_of_handle_df_finish ();
856 }; // class pass_df_finish
861 make_pass_df_finish (gcc::context
*ctxt
)
863 return new pass_df_finish (ctxt
);
870 /*----------------------------------------------------------------------------
871 The general data flow analysis engine.
872 ----------------------------------------------------------------------------*/
874 /* Helper function for df_worklist_dataflow.
875 Propagate the dataflow forward.
876 Given a BB_INDEX, do the dataflow propagation
877 and set bits on for successors in PENDING for earlier
878 and WORKLIST for later in bbindex_to_postorder
879 if the out set of the dataflow has changed.
881 AGE specify time when BB was visited last time.
882 AGE of 0 means we are visiting for first time and need to
883 compute transfer function to initialize datastructures.
884 Otherwise we re-do transfer function only if something change
885 while computing confluence functions.
886 We need to compute confluence only of basic block that are younger
887 then last visit of the BB.
889 Return true if BB info has changed. This is always the case
890 in the first visit. */
893 df_worklist_propagate_forward (struct dataflow
*dataflow
,
895 unsigned *bbindex_to_postorder
,
899 vec
<int> &last_change_age
,
904 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, bb_index
);
907 /* Calculate <conf_op> of incoming edges. */
908 if (EDGE_COUNT (bb
->preds
) > 0)
909 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
911 if (bbindex_to_postorder
[e
->src
->index
] < last_change_age
.length ()
912 && age
<= last_change_age
[bbindex_to_postorder
[e
->src
->index
]]
913 && bitmap_bit_p (considered
, e
->src
->index
))
914 changed
|= dataflow
->problem
->con_fun_n (e
);
916 else if (dataflow
->problem
->con_fun_0
)
917 dataflow
->problem
->con_fun_0 (bb
);
920 && dataflow
->problem
->trans_fun (bb_index
))
922 /* The out set of this block has changed.
923 Propagate to the outgoing blocks. */
924 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
926 unsigned ob_index
= e
->dest
->index
;
928 if (bitmap_bit_p (considered
, ob_index
))
930 if (bbindex_to_postorder
[bb_index
]
931 < bbindex_to_postorder
[ob_index
])
932 bitmap_set_bit (worklist
, bbindex_to_postorder
[ob_index
]);
934 bitmap_set_bit (pending
, bbindex_to_postorder
[ob_index
]);
943 /* Helper function for df_worklist_dataflow.
944 Propagate the dataflow backward. */
947 df_worklist_propagate_backward (struct dataflow
*dataflow
,
949 unsigned *bbindex_to_postorder
,
953 vec
<int> &last_change_age
,
958 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, bb_index
);
961 /* Calculate <conf_op> of incoming edges. */
962 if (EDGE_COUNT (bb
->succs
) > 0)
963 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
965 if (bbindex_to_postorder
[e
->dest
->index
] < last_change_age
.length ()
966 && age
<= last_change_age
[bbindex_to_postorder
[e
->dest
->index
]]
967 && bitmap_bit_p (considered
, e
->dest
->index
))
968 changed
|= dataflow
->problem
->con_fun_n (e
);
970 else if (dataflow
->problem
->con_fun_0
)
971 dataflow
->problem
->con_fun_0 (bb
);
974 && dataflow
->problem
->trans_fun (bb_index
))
976 /* The out set of this block has changed.
977 Propagate to the outgoing blocks. */
978 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
980 unsigned ob_index
= e
->src
->index
;
982 if (bitmap_bit_p (considered
, ob_index
))
984 if (bbindex_to_postorder
[bb_index
]
985 < bbindex_to_postorder
[ob_index
])
986 bitmap_set_bit (worklist
, bbindex_to_postorder
[ob_index
]);
988 bitmap_set_bit (pending
, bbindex_to_postorder
[ob_index
]);
996 /* Main dataflow solver loop.
998 DATAFLOW is problem we are solving, PENDING is worklist of basic blocks we
1000 BLOCK_IN_POSTORDER is array of size N_BLOCKS specifying postorder in BBs and
1001 BBINDEX_TO_POSTORDER is array mapping back BB->index to postorder position.
1002 PENDING will be freed.
1004 The worklists are bitmaps indexed by postorder positions.
1006 The function implements standard algorithm for dataflow solving with two
1007 worklists (we are processing WORKLIST and storing new BBs to visit in
1010 As an optimization we maintain ages when BB was changed (stored in
1011 last_change_age) and when it was last visited (stored in last_visit_age).
1012 This avoids need to re-do confluence function for edges to basic blocks
1013 whose source did not change since destination was visited last time. */
1016 df_worklist_dataflow_doublequeue (struct dataflow
*dataflow
,
1019 int *blocks_in_postorder
,
1020 unsigned *bbindex_to_postorder
,
1023 enum df_flow_dir dir
= dataflow
->problem
->dir
;
1025 bitmap worklist
= BITMAP_ALLOC (&df_bitmap_obstack
);
1028 vec
<int> last_visit_age
= vNULL
;
1029 vec
<int> last_change_age
= vNULL
;
1032 last_visit_age
.safe_grow_cleared (n_blocks
, true);
1033 last_change_age
.safe_grow_cleared (n_blocks
, true);
1035 /* Double-queueing. Worklist is for the current iteration,
1036 and pending is for the next. */
1037 while (!bitmap_empty_p (pending
))
1039 std::swap (pending
, worklist
);
1043 unsigned index
= bitmap_first_set_bit (worklist
);
1044 bitmap_clear_bit (worklist
, index
);
1049 bb_index
= blocks_in_postorder
[index
];
1050 prev_age
= last_visit_age
[index
];
1051 if (dir
== DF_FORWARD
)
1052 changed
= df_worklist_propagate_forward (dataflow
, bb_index
,
1053 bbindex_to_postorder
,
1059 changed
= df_worklist_propagate_backward (dataflow
, bb_index
,
1060 bbindex_to_postorder
,
1065 last_visit_age
[index
] = ++age
;
1067 last_change_age
[index
] = age
;
1069 while (!bitmap_empty_p (worklist
));
1072 BITMAP_FREE (worklist
);
1073 BITMAP_FREE (pending
);
1074 last_visit_age
.release ();
1075 last_change_age
.release ();
1077 /* Dump statistics. */
1079 fprintf (dump_file
, "df_worklist_dataflow_doublequeue:"
1080 " n_basic_blocks %d n_edges %d"
1081 " count %d (%5.2g)\n",
1082 n_basic_blocks_for_fn (cfun
), n_edges_for_fn (cfun
),
1083 dcount
, dcount
/ (double)n_basic_blocks_for_fn (cfun
));
1086 /* Worklist-based dataflow solver. It uses sbitmap as a worklist,
1087 with "n"-th bit representing the n-th block in the reverse-postorder order.
1088 The solver is a double-queue algorithm similar to the "double stack" solver
1089 from Cooper, Harvey and Kennedy, "Iterative data-flow analysis, Revisited".
1090 The only significant difference is that the worklist in this implementation
1091 is always sorted in RPO of the CFG visiting direction. */
1094 df_worklist_dataflow (struct dataflow
*dataflow
,
1095 bitmap blocks_to_consider
,
1096 int *blocks_in_postorder
,
1099 bitmap pending
= BITMAP_ALLOC (&df_bitmap_obstack
);
1101 unsigned int *bbindex_to_postorder
;
1104 enum df_flow_dir dir
= dataflow
->problem
->dir
;
1106 gcc_assert (dir
!= DF_NONE
);
1108 /* BBINDEX_TO_POSTORDER maps the bb->index to the reverse postorder. */
1109 bbindex_to_postorder
= XNEWVEC (unsigned int,
1110 last_basic_block_for_fn (cfun
));
1112 /* Initialize the array to an out-of-bound value. */
1113 for (i
= 0; i
< last_basic_block_for_fn (cfun
); i
++)
1114 bbindex_to_postorder
[i
] = last_basic_block_for_fn (cfun
);
1116 /* Initialize the considered map. */
1117 auto_sbitmap
considered (last_basic_block_for_fn (cfun
));
1118 bitmap_clear (considered
);
1119 EXECUTE_IF_SET_IN_BITMAP (blocks_to_consider
, 0, index
, bi
)
1121 bitmap_set_bit (considered
, index
);
1124 /* Initialize the mapping of block index to postorder. */
1125 for (i
= 0; i
< n_blocks
; i
++)
1127 bbindex_to_postorder
[blocks_in_postorder
[i
]] = i
;
1128 /* Add all blocks to the worklist. */
1129 bitmap_set_bit (pending
, i
);
1132 /* Initialize the problem. */
1133 if (dataflow
->problem
->init_fun
)
1134 dataflow
->problem
->init_fun (blocks_to_consider
);
1137 df_worklist_dataflow_doublequeue (dataflow
, pending
, considered
,
1138 blocks_in_postorder
,
1139 bbindex_to_postorder
,
1141 free (bbindex_to_postorder
);
1145 /* Remove the entries not in BLOCKS from the LIST of length LEN, preserving
1146 the order of the remaining entries. Returns the length of the resulting
1150 df_prune_to_subcfg (int list
[], unsigned len
, bitmap blocks
)
1154 for (act
= 0, last
= 0; act
< len
; act
++)
1155 if (bitmap_bit_p (blocks
, list
[act
]))
1156 list
[last
++] = list
[act
];
1162 /* Execute dataflow analysis on a single dataflow problem.
1164 BLOCKS_TO_CONSIDER are the blocks whose solution can either be
1165 examined or will be computed. For calls from DF_ANALYZE, this is
1166 the set of blocks that has been passed to DF_SET_BLOCKS.
1170 df_analyze_problem (struct dataflow
*dflow
,
1171 bitmap blocks_to_consider
,
1172 int *postorder
, int n_blocks
)
1174 timevar_push (dflow
->problem
->tv_id
);
1176 /* (Re)Allocate the datastructures necessary to solve the problem. */
1177 if (dflow
->problem
->alloc_fun
)
1178 dflow
->problem
->alloc_fun (blocks_to_consider
);
1180 #ifdef ENABLE_DF_CHECKING
1181 if (dflow
->problem
->verify_start_fun
)
1182 dflow
->problem
->verify_start_fun ();
1185 /* Set up the problem and compute the local information. */
1186 if (dflow
->problem
->local_compute_fun
)
1187 dflow
->problem
->local_compute_fun (blocks_to_consider
);
1189 /* Solve the equations. */
1190 if (dflow
->problem
->dataflow_fun
)
1191 dflow
->problem
->dataflow_fun (dflow
, blocks_to_consider
,
1192 postorder
, n_blocks
);
1194 /* Massage the solution. */
1195 if (dflow
->problem
->finalize_fun
)
1196 dflow
->problem
->finalize_fun (blocks_to_consider
);
1198 #ifdef ENABLE_DF_CHECKING
1199 if (dflow
->problem
->verify_end_fun
)
1200 dflow
->problem
->verify_end_fun ();
1203 timevar_pop (dflow
->problem
->tv_id
);
1205 dflow
->computed
= true;
1209 /* Analyze dataflow info. */
1216 /* These should be the same. */
1217 gcc_assert ((unsigned) df
->n_blocks
== df
->postorder_inverted
.length ());
1219 /* We need to do this before the df_verify_all because this is
1220 not kept incrementally up to date. */
1221 df_compute_regs_ever_live (false);
1222 df_process_deferred_rescans ();
1225 fprintf (dump_file
, "df_analyze called\n");
1227 #ifndef ENABLE_DF_CHECKING
1228 if (df
->changeable_flags
& DF_VERIFY_SCHEDULED
)
1232 /* Skip over the DF_SCAN problem. */
1233 for (i
= 1; i
< df
->num_problems_defined
; i
++)
1235 struct dataflow
*dflow
= df
->problems_in_order
[i
];
1236 if (dflow
->solutions_dirty
)
1238 if (dflow
->problem
->dir
== DF_FORWARD
)
1239 df_analyze_problem (dflow
,
1240 df
->blocks_to_analyze
,
1241 df
->postorder_inverted
.address (),
1242 df
->postorder_inverted
.length ());
1244 df_analyze_problem (dflow
,
1245 df
->blocks_to_analyze
,
1251 if (!df
->analyze_subset
)
1253 BITMAP_FREE (df
->blocks_to_analyze
);
1254 df
->blocks_to_analyze
= NULL
;
1258 df_set_clean_cfg ();
1262 /* Analyze dataflow info. */
1267 bitmap current_all_blocks
= BITMAP_ALLOC (&df_bitmap_obstack
);
1269 free (df
->postorder
);
1270 df
->postorder
= XNEWVEC (int, last_basic_block_for_fn (cfun
));
1271 df
->n_blocks
= post_order_compute (df
->postorder
, true, true);
1272 df
->postorder_inverted
.truncate (0);
1273 inverted_post_order_compute (&df
->postorder_inverted
);
1275 for (int i
= 0; i
< df
->n_blocks
; i
++)
1276 bitmap_set_bit (current_all_blocks
, df
->postorder
[i
]);
1280 /* Verify that POSTORDER_INVERTED only contains blocks reachable from
1282 for (unsigned int i
= 0; i
< df
->postorder_inverted
.length (); i
++)
1283 gcc_assert (bitmap_bit_p (current_all_blocks
,
1284 df
->postorder_inverted
[i
]));
1287 /* Make sure that we have pruned any unreachable blocks from these
1289 if (df
->analyze_subset
)
1291 bitmap_and_into (df
->blocks_to_analyze
, current_all_blocks
);
1292 df
->n_blocks
= df_prune_to_subcfg (df
->postorder
,
1293 df
->n_blocks
, df
->blocks_to_analyze
);
1294 unsigned int newlen
= df_prune_to_subcfg (df
->postorder_inverted
.address (),
1295 df
->postorder_inverted
.length (),
1296 df
->blocks_to_analyze
);
1297 df
->postorder_inverted
.truncate (newlen
);
1298 BITMAP_FREE (current_all_blocks
);
1302 df
->blocks_to_analyze
= current_all_blocks
;
1303 current_all_blocks
= NULL
;
1309 /* Compute the reverse top sort order of the sub-CFG specified by LOOP.
1310 Returns the number of blocks which is always loop->num_nodes. */
1313 loop_post_order_compute (int *post_order
, class loop
*loop
)
1315 edge_iterator
*stack
;
1317 int post_order_num
= 0;
1319 /* Allocate stack for back-tracking up CFG. */
1320 stack
= XNEWVEC (edge_iterator
, loop
->num_nodes
+ 1);
1323 /* Allocate bitmap to track nodes that have been visited. */
1324 auto_bitmap visited
;
1326 /* Push the first edge on to the stack. */
1327 stack
[sp
++] = ei_start (loop_preheader_edge (loop
)->src
->succs
);
1335 /* Look at the edge on the top of the stack. */
1337 src
= ei_edge (ei
)->src
;
1338 dest
= ei_edge (ei
)->dest
;
1340 /* Check if the edge destination has been visited yet and mark it
1342 if (flow_bb_inside_loop_p (loop
, dest
)
1343 && bitmap_set_bit (visited
, dest
->index
))
1345 if (EDGE_COUNT (dest
->succs
) > 0)
1346 /* Since the DEST node has been visited for the first
1347 time, check its successors. */
1348 stack
[sp
++] = ei_start (dest
->succs
);
1350 post_order
[post_order_num
++] = dest
->index
;
1354 if (ei_one_before_end_p (ei
)
1355 && src
!= loop_preheader_edge (loop
)->src
)
1356 post_order
[post_order_num
++] = src
->index
;
1358 if (!ei_one_before_end_p (ei
))
1359 ei_next (&stack
[sp
- 1]);
1367 return post_order_num
;
1370 /* Compute the reverse top sort order of the inverted sub-CFG specified
1371 by LOOP. Returns the number of blocks which is always loop->num_nodes. */
1374 loop_inverted_post_order_compute (vec
<int> *post_order
, class loop
*loop
)
1377 edge_iterator
*stack
;
1380 post_order
->reserve_exact (loop
->num_nodes
);
1382 /* Allocate stack for back-tracking up CFG. */
1383 stack
= XNEWVEC (edge_iterator
, loop
->num_nodes
+ 1);
1386 /* Allocate bitmap to track nodes that have been visited. */
1387 auto_bitmap visited
;
1389 /* Put all latches into the initial work list. In theory we'd want
1390 to start from loop exits but then we'd have the special case of
1391 endless loops. It doesn't really matter for DF iteration order and
1392 handling latches last is probably even better. */
1393 stack
[sp
++] = ei_start (loop
->header
->preds
);
1394 bitmap_set_bit (visited
, loop
->header
->index
);
1396 /* The inverted traversal loop. */
1402 /* Look at the edge on the top of the stack. */
1404 bb
= ei_edge (ei
)->dest
;
1405 pred
= ei_edge (ei
)->src
;
1407 /* Check if the predecessor has been visited yet and mark it
1409 if (flow_bb_inside_loop_p (loop
, pred
)
1410 && bitmap_set_bit (visited
, pred
->index
))
1412 if (EDGE_COUNT (pred
->preds
) > 0)
1413 /* Since the predecessor node has been visited for the first
1414 time, check its predecessors. */
1415 stack
[sp
++] = ei_start (pred
->preds
);
1417 post_order
->quick_push (pred
->index
);
1421 if (flow_bb_inside_loop_p (loop
, bb
)
1422 && ei_one_before_end_p (ei
))
1423 post_order
->quick_push (bb
->index
);
1425 if (!ei_one_before_end_p (ei
))
1426 ei_next (&stack
[sp
- 1]);
1436 /* Analyze dataflow info for the basic blocks contained in LOOP. */
1439 df_analyze_loop (class loop
*loop
)
1441 free (df
->postorder
);
1443 df
->postorder
= XNEWVEC (int, loop
->num_nodes
);
1444 df
->postorder_inverted
.truncate (0);
1445 df
->n_blocks
= loop_post_order_compute (df
->postorder
, loop
);
1446 loop_inverted_post_order_compute (&df
->postorder_inverted
, loop
);
1447 gcc_assert ((unsigned) df
->n_blocks
== loop
->num_nodes
);
1448 gcc_assert (df
->postorder_inverted
.length () == loop
->num_nodes
);
1450 bitmap blocks
= BITMAP_ALLOC (&df_bitmap_obstack
);
1451 for (int i
= 0; i
< df
->n_blocks
; ++i
)
1452 bitmap_set_bit (blocks
, df
->postorder
[i
]);
1453 df_set_blocks (blocks
);
1454 BITMAP_FREE (blocks
);
1460 /* Return the number of basic blocks from the last call to df_analyze. */
1463 df_get_n_blocks (enum df_flow_dir dir
)
1465 gcc_assert (dir
!= DF_NONE
);
1467 if (dir
== DF_FORWARD
)
1469 gcc_assert (df
->postorder_inverted
.length ());
1470 return df
->postorder_inverted
.length ();
1473 gcc_assert (df
->postorder
);
1474 return df
->n_blocks
;
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. */
1483 df_get_postorder (enum df_flow_dir dir
)
1485 gcc_assert (dir
!= DF_NONE
);
1487 if (dir
== DF_FORWARD
)
1489 gcc_assert (df
->postorder_inverted
.length ());
1490 return df
->postorder_inverted
.address ();
1492 gcc_assert (df
->postorder
);
1493 return df
->postorder
;
1496 static struct df_problem user_problem
;
1497 static struct dataflow user_dflow
;
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. */
1508 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
)
1515 memset (&user_problem
, 0, sizeof (struct df_problem
));
1516 user_problem
.dir
= dir
;
1517 user_problem
.init_fun
= init_fun
;
1518 user_problem
.con_fun_0
= con_fun_0
;
1519 user_problem
.con_fun_n
= con_fun_n
;
1520 user_problem
.trans_fun
= trans_fun
;
1521 user_dflow
.problem
= &user_problem
;
1522 df_worklist_dataflow (&user_dflow
, blocks
, postorder
, n_blocks
);
1527 /*----------------------------------------------------------------------------
1528 Functions to support limited incremental change.
1529 ----------------------------------------------------------------------------*/
1532 /* Get basic block info. */
1535 df_get_bb_info (struct dataflow
*dflow
, unsigned int index
)
1537 if (dflow
->block_info
== NULL
)
1539 if (index
>= dflow
->block_info_size
)
1541 return (void *)((char *)dflow
->block_info
1542 + index
* dflow
->problem
->block_info_elt_size
);
1546 /* Set basic block info. */
1549 df_set_bb_info (struct dataflow
*dflow
, unsigned int index
,
1552 gcc_assert (dflow
->block_info
);
1553 memcpy ((char *)dflow
->block_info
1554 + index
* dflow
->problem
->block_info_elt_size
,
1555 bb_info
, dflow
->problem
->block_info_elt_size
);
1559 /* Clear basic block info. */
1562 df_clear_bb_info (struct dataflow
*dflow
, unsigned int index
)
1564 gcc_assert (dflow
->block_info
);
1565 gcc_assert (dflow
->block_info_size
> index
);
1566 memset ((char *)dflow
->block_info
1567 + index
* dflow
->problem
->block_info_elt_size
,
1568 0, dflow
->problem
->block_info_elt_size
);
1572 /* Mark the solutions as being out of date. */
1575 df_mark_solutions_dirty (void)
1580 for (p
= 1; p
< df
->num_problems_defined
; p
++)
1581 df
->problems_in_order
[p
]->solutions_dirty
= true;
1586 /* Return true if BB needs it's transfer functions recomputed. */
1589 df_get_bb_dirty (basic_block bb
)
1591 return bitmap_bit_p ((df_live
1592 ? df_live
: df_lr
)->out_of_date_transfer_functions
,
1597 /* Mark BB as needing it's transfer functions as being out of
1601 df_set_bb_dirty (basic_block bb
)
1603 bb
->flags
|= BB_MODIFIED
;
1607 for (p
= 1; p
< df
->num_problems_defined
; p
++)
1609 struct dataflow
*dflow
= df
->problems_in_order
[p
];
1610 if (dflow
->out_of_date_transfer_functions
)
1611 bitmap_set_bit (dflow
->out_of_date_transfer_functions
, bb
->index
);
1613 df_mark_solutions_dirty ();
1618 /* Grow the bb_info array. */
1621 df_grow_bb_info (struct dataflow
*dflow
)
1623 unsigned int new_size
= last_basic_block_for_fn (cfun
) + 1;
1624 if (dflow
->block_info_size
< new_size
)
1626 new_size
+= new_size
/ 4;
1628 = (void *)XRESIZEVEC (char, (char *)dflow
->block_info
,
1630 * dflow
->problem
->block_info_elt_size
);
1631 memset ((char *)dflow
->block_info
1632 + dflow
->block_info_size
1633 * dflow
->problem
->block_info_elt_size
,
1635 (new_size
- dflow
->block_info_size
)
1636 * dflow
->problem
->block_info_elt_size
);
1637 dflow
->block_info_size
= new_size
;
1642 /* Clear the dirty bits. This is called from places that delete
1645 df_clear_bb_dirty (basic_block bb
)
1648 for (p
= 1; p
< df
->num_problems_defined
; p
++)
1650 struct dataflow
*dflow
= df
->problems_in_order
[p
];
1651 if (dflow
->out_of_date_transfer_functions
)
1652 bitmap_clear_bit (dflow
->out_of_date_transfer_functions
, bb
->index
);
1656 /* Called from the rtl_compact_blocks to reorganize the problems basic
1660 df_compact_blocks (void)
1664 void *problem_temps
;
1666 auto_bitmap
tmp (&df_bitmap_obstack
);
1667 for (p
= 0; p
< df
->num_problems_defined
; p
++)
1669 struct dataflow
*dflow
= df
->problems_in_order
[p
];
1671 /* Need to reorganize the out_of_date_transfer_functions for the
1673 if (dflow
->out_of_date_transfer_functions
)
1675 bitmap_copy (tmp
, dflow
->out_of_date_transfer_functions
);
1676 bitmap_clear (dflow
->out_of_date_transfer_functions
);
1677 if (bitmap_bit_p (tmp
, ENTRY_BLOCK
))
1678 bitmap_set_bit (dflow
->out_of_date_transfer_functions
, ENTRY_BLOCK
);
1679 if (bitmap_bit_p (tmp
, EXIT_BLOCK
))
1680 bitmap_set_bit (dflow
->out_of_date_transfer_functions
, EXIT_BLOCK
);
1682 i
= NUM_FIXED_BLOCKS
;
1683 FOR_EACH_BB_FN (bb
, cfun
)
1685 if (bitmap_bit_p (tmp
, bb
->index
))
1686 bitmap_set_bit (dflow
->out_of_date_transfer_functions
, i
);
1691 /* Now shuffle the block info for the problem. */
1692 if (dflow
->problem
->free_bb_fun
)
1694 int size
= (last_basic_block_for_fn (cfun
)
1695 * dflow
->problem
->block_info_elt_size
);
1696 problem_temps
= XNEWVAR (char, size
);
1697 df_grow_bb_info (dflow
);
1698 memcpy (problem_temps
, dflow
->block_info
, size
);
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 i
= NUM_FIXED_BLOCKS
;
1704 FOR_EACH_BB_FN (bb
, cfun
)
1706 df_set_bb_info (dflow
, i
,
1707 (char *)problem_temps
1708 + bb
->index
* dflow
->problem
->block_info_elt_size
);
1711 memset ((char *)dflow
->block_info
1712 + i
* dflow
->problem
->block_info_elt_size
, 0,
1713 (last_basic_block_for_fn (cfun
) - i
)
1714 * dflow
->problem
->block_info_elt_size
);
1715 free (problem_temps
);
1719 /* Shuffle the bits in the basic_block indexed arrays. */
1721 if (df
->blocks_to_analyze
)
1723 if (bitmap_bit_p (tmp
, ENTRY_BLOCK
))
1724 bitmap_set_bit (df
->blocks_to_analyze
, ENTRY_BLOCK
);
1725 if (bitmap_bit_p (tmp
, EXIT_BLOCK
))
1726 bitmap_set_bit (df
->blocks_to_analyze
, EXIT_BLOCK
);
1727 bitmap_copy (tmp
, df
->blocks_to_analyze
);
1728 bitmap_clear (df
->blocks_to_analyze
);
1729 i
= NUM_FIXED_BLOCKS
;
1730 FOR_EACH_BB_FN (bb
, cfun
)
1732 if (bitmap_bit_p (tmp
, bb
->index
))
1733 bitmap_set_bit (df
->blocks_to_analyze
, i
);
1738 i
= NUM_FIXED_BLOCKS
;
1739 FOR_EACH_BB_FN (bb
, cfun
)
1741 SET_BASIC_BLOCK_FOR_FN (cfun
, i
, bb
);
1746 gcc_assert (i
== n_basic_blocks_for_fn (cfun
));
1748 for (; i
< last_basic_block_for_fn (cfun
); i
++)
1749 SET_BASIC_BLOCK_FOR_FN (cfun
, i
, NULL
);
1752 if (!df_lr
->solutions_dirty
)
1753 df_set_clean_cfg ();
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. */
1762 df_bb_replace (int old_index
, basic_block new_block
)
1764 int new_block_index
= new_block
->index
;
1768 fprintf (dump_file
, "shoving block %d into %d\n", new_block_index
, old_index
);
1771 gcc_assert (BASIC_BLOCK_FOR_FN (cfun
, old_index
) == NULL
);
1773 for (p
= 0; p
< df
->num_problems_defined
; p
++)
1775 struct dataflow
*dflow
= df
->problems_in_order
[p
];
1776 if (dflow
->block_info
)
1778 df_grow_bb_info (dflow
);
1779 df_set_bb_info (dflow
, old_index
,
1780 df_get_bb_info (dflow
, new_block_index
));
1784 df_clear_bb_dirty (new_block
);
1785 SET_BASIC_BLOCK_FOR_FN (cfun
, old_index
, new_block
);
1786 new_block
->index
= old_index
;
1787 df_set_bb_dirty (BASIC_BLOCK_FOR_FN (cfun
, old_index
));
1788 SET_BASIC_BLOCK_FOR_FN (cfun
, new_block_index
, NULL
);
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. */
1797 df_bb_delete (int bb_index
)
1799 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, bb_index
);
1805 for (i
= 0; i
< df
->num_problems_defined
; i
++)
1807 struct dataflow
*dflow
= df
->problems_in_order
[i
];
1808 if (dflow
->problem
->free_bb_fun
)
1810 void *bb_info
= df_get_bb_info (dflow
, bb_index
);
1813 dflow
->problem
->free_bb_fun (bb
, bb_info
);
1814 df_clear_bb_info (dflow
, bb_index
);
1818 df_clear_bb_dirty (bb
);
1819 df_mark_solutions_dirty ();
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
1835 #ifdef ENABLE_DF_CHECKING
1836 df_lr_verify_transfer_functions ();
1838 df_live_verify_transfer_functions ();
1840 df
->changeable_flags
&= ~DF_VERIFY_SCHEDULED
;
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. */
1852 df_compute_cfg_image (void)
1855 int size
= 2 + (2 * n_basic_blocks_for_fn (cfun
));
1859 FOR_ALL_BB_FN (bb
, cfun
)
1861 size
+= EDGE_COUNT (bb
->succs
);
1864 map
= XNEWVEC (int, size
);
1867 FOR_ALL_BB_FN (bb
, cfun
)
1872 map
[i
++] = bb
->index
;
1873 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1874 map
[i
++] = e
->dest
->index
;
1881 static int *saved_cfg
= NULL
;
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
1890 df_check_cfg_clean (void)
1897 if (df_lr
->solutions_dirty
)
1900 if (saved_cfg
== NULL
)
1903 new_map
= df_compute_cfg_image ();
1904 gcc_assert (memcmp (saved_cfg
, new_map
, saved_cfg
[0] * sizeof (int)) == 0);
1909 /* This function builds a cfg fingerprint and squirrels it away in
1913 df_set_clean_cfg (void)
1916 saved_cfg
= df_compute_cfg_image ();
1919 #endif /* DF_DEBUG_CFG */
1920 /*----------------------------------------------------------------------------
1921 PUBLIC INTERFACES TO QUERY INFORMATION.
1922 ----------------------------------------------------------------------------*/
1925 /* Return first def of REGNO within BB. */
1928 df_bb_regno_first_def_find (basic_block bb
, unsigned int regno
)
1933 FOR_BB_INSNS (bb
, insn
)
1938 FOR_EACH_INSN_DEF (def
, insn
)
1939 if (DF_REF_REGNO (def
) == regno
)
1946 /* Return last def of REGNO within BB. */
1949 df_bb_regno_last_def_find (basic_block bb
, unsigned int regno
)
1954 FOR_BB_INSNS_REVERSE (bb
, insn
)
1959 FOR_EACH_INSN_DEF (def
, insn
)
1960 if (DF_REF_REGNO (def
) == regno
)
1967 /* Finds the reference corresponding to the definition of REG in INSN.
1968 DF is the dataflow object. */
1971 df_find_def (rtx_insn
*insn
, rtx reg
)
1975 if (GET_CODE (reg
) == SUBREG
)
1976 reg
= SUBREG_REG (reg
);
1977 gcc_assert (REG_P (reg
));
1979 FOR_EACH_INSN_DEF (def
, insn
)
1980 if (DF_REF_REGNO (def
) == REGNO (reg
))
1987 /* Return true if REG is defined in INSN, zero otherwise. */
1990 df_reg_defined (rtx_insn
*insn
, rtx reg
)
1992 return df_find_def (insn
, reg
) != NULL
;
1996 /* Finds the reference corresponding to the use of REG in INSN.
1997 DF is the dataflow object. */
2000 df_find_use (rtx_insn
*insn
, rtx reg
)
2004 if (GET_CODE (reg
) == SUBREG
)
2005 reg
= SUBREG_REG (reg
);
2006 gcc_assert (REG_P (reg
));
2008 df_insn_info
*insn_info
= DF_INSN_INFO_GET (insn
);
2009 FOR_EACH_INSN_INFO_USE (use
, insn_info
)
2010 if (DF_REF_REGNO (use
) == REGNO (reg
))
2012 if (df
->changeable_flags
& DF_EQ_NOTES
)
2013 FOR_EACH_INSN_INFO_EQ_USE (use
, insn_info
)
2014 if (DF_REF_REGNO (use
) == REGNO (reg
))
2020 /* Return true if REG is referenced in INSN, zero otherwise. */
2023 df_reg_used (rtx_insn
*insn
, rtx reg
)
2025 return df_find_use (insn
, reg
) != NULL
;
2028 /* If REG has a single definition, return its known value, otherwise return
2032 df_find_single_def_src (rtx reg
)
2036 /* Don't look through unbounded number of single definition REG copies,
2037 there might be loops for sources with uninitialized variables. */
2038 for (int cnt
= 0; cnt
< 128; cnt
++)
2040 df_ref adef
= DF_REG_DEF_CHAIN (REGNO (reg
));
2041 if (adef
== NULL
|| DF_REF_NEXT_REG (adef
) != NULL
2042 || DF_REF_IS_ARTIFICIAL (adef
)
2043 || (DF_REF_FLAGS (adef
)
2044 & (DF_REF_PARTIAL
| DF_REF_CONDITIONAL
)))
2047 rtx set
= single_set (DF_REF_INSN (adef
));
2048 if (set
== NULL
|| !rtx_equal_p (SET_DEST (set
), reg
))
2051 rtx note
= find_reg_equal_equiv_note (DF_REF_INSN (adef
));
2052 if (note
&& function_invariant_p (XEXP (note
, 0)))
2053 return XEXP (note
, 0);
2054 src
= SET_SRC (set
);
2063 if (!function_invariant_p (src
))
2070 /*----------------------------------------------------------------------------
2071 Debugging and printing functions.
2072 ----------------------------------------------------------------------------*/
2074 /* Write information about registers and basic blocks into FILE.
2075 This is part of making a debugging dump. */
2078 dump_regset (regset r
, FILE *outf
)
2081 reg_set_iterator rsi
;
2085 fputs (" (nil)", outf
);
2089 EXECUTE_IF_SET_IN_REG_SET (r
, 0, i
, rsi
)
2091 fprintf (outf
, " %d", i
);
2092 if (i
< FIRST_PSEUDO_REGISTER
)
2093 fprintf (outf
, " [%s]",
2098 /* Print a human-readable representation of R on the standard error
2099 stream. This function is designed to be used from within the
2101 extern void debug_regset (regset
);
2103 debug_regset (regset r
)
2105 dump_regset (r
, stderr
);
2106 putc ('\n', stderr
);
2109 /* Write information about registers and basic blocks into FILE.
2110 This is part of making a debugging dump. */
2113 df_print_regset (FILE *file
, const_bitmap r
)
2119 fputs (" (nil)", file
);
2122 EXECUTE_IF_SET_IN_BITMAP (r
, 0, i
, bi
)
2124 fprintf (file
, " %d", i
);
2125 if (i
< FIRST_PSEUDO_REGISTER
)
2126 fprintf (file
, " [%s]", reg_names
[i
]);
2129 fprintf (file
, "\n");
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
2138 df_print_word_regset (FILE *file
, const_bitmap r
)
2140 unsigned int max_reg
= max_reg_num ();
2143 fputs (" (nil)", file
);
2147 for (i
= FIRST_PSEUDO_REGISTER
; i
< max_reg
; i
++)
2149 bool found
= (bitmap_bit_p (r
, 2 * i
)
2150 || bitmap_bit_p (r
, 2 * i
+ 1));
2154 const char * sep
= "";
2155 fprintf (file
, " %d", i
);
2156 fprintf (file
, "(");
2157 for (word
= 0; word
< 2; word
++)
2158 if (bitmap_bit_p (r
, 2 * i
+ word
))
2160 fprintf (file
, "%s%d", sep
, word
);
2163 fprintf (file
, ")");
2167 fprintf (file
, "\n");
2171 /* Dump dataflow info. */
2174 df_dump (FILE *file
)
2177 df_dump_start (file
);
2179 FOR_ALL_BB_FN (bb
, cfun
)
2181 df_print_bb_index (bb
, file
);
2182 df_dump_top (bb
, file
);
2183 df_dump_bottom (bb
, file
);
2186 fprintf (file
, "\n");
2190 /* Dump dataflow info for df->blocks_to_analyze. */
2193 df_dump_region (FILE *file
)
2195 if (df
->blocks_to_analyze
)
2198 unsigned int bb_index
;
2200 fprintf (file
, "\n\nstarting region dump\n");
2201 df_dump_start (file
);
2203 EXECUTE_IF_SET_IN_BITMAP (df
->blocks_to_analyze
, 0, bb_index
, bi
)
2205 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, bb_index
);
2206 dump_bb (file
, bb
, 0, TDF_DETAILS
);
2208 fprintf (file
, "\n");
2215 /* Dump the introductory information for each problem defined. */
2218 df_dump_start (FILE *file
)
2225 fprintf (file
, "\n\n%s\n", current_function_name ());
2226 fprintf (file
, "\nDataflow summary:\n");
2227 if (df
->blocks_to_analyze
)
2228 fprintf (file
, "def_info->table_size = %d, use_info->table_size = %d\n",
2229 DF_DEFS_TABLE_SIZE (), DF_USES_TABLE_SIZE ());
2231 for (i
= 0; i
< df
->num_problems_defined
; i
++)
2233 struct dataflow
*dflow
= df
->problems_in_order
[i
];
2234 if (dflow
->computed
)
2236 df_dump_problem_function fun
= dflow
->problem
->dump_start_fun
;
2244 /* Dump the top or bottom of the block information for BB. */
2246 df_dump_bb_problem_data (basic_block bb
, FILE *file
, bool top
)
2253 for (i
= 0; i
< df
->num_problems_defined
; i
++)
2255 struct dataflow
*dflow
= df
->problems_in_order
[i
];
2256 if (dflow
->computed
)
2258 df_dump_bb_problem_function bbfun
;
2261 bbfun
= dflow
->problem
->dump_top_fun
;
2263 bbfun
= dflow
->problem
->dump_bottom_fun
;
2271 /* Dump the top of the block information for BB. */
2274 df_dump_top (basic_block bb
, FILE *file
)
2276 df_dump_bb_problem_data (bb
, file
, /*top=*/true);
2279 /* Dump the bottom of the block information for BB. */
2282 df_dump_bottom (basic_block bb
, FILE *file
)
2284 df_dump_bb_problem_data (bb
, file
, /*top=*/false);
2288 /* Dump information about INSN just before or after dumping INSN itself. */
2290 df_dump_insn_problem_data (const rtx_insn
*insn
, FILE *file
, bool top
)
2297 for (i
= 0; i
< df
->num_problems_defined
; i
++)
2299 struct dataflow
*dflow
= df
->problems_in_order
[i
];
2300 if (dflow
->computed
)
2302 df_dump_insn_problem_function insnfun
;
2305 insnfun
= dflow
->problem
->dump_insn_top_fun
;
2307 insnfun
= dflow
->problem
->dump_insn_bottom_fun
;
2310 insnfun (insn
, file
);
2315 /* Dump information about INSN before dumping INSN itself. */
2318 df_dump_insn_top (const rtx_insn
*insn
, FILE *file
)
2320 df_dump_insn_problem_data (insn
, file
, /*top=*/true);
2323 /* Dump information about INSN after dumping INSN itself. */
2326 df_dump_insn_bottom (const rtx_insn
*insn
, FILE *file
)
2328 df_dump_insn_problem_data (insn
, file
, /*top=*/false);
2333 df_ref_dump (df_ref ref
, FILE *file
)
2335 fprintf (file
, "%c%d(%d)",
2336 DF_REF_REG_DEF_P (ref
)
2338 : (DF_REF_FLAGS (ref
) & DF_REF_IN_NOTE
) ? 'e' : 'u',
2340 DF_REF_REGNO (ref
));
2344 df_refs_chain_dump (df_ref ref
, bool follow_chain
, FILE *file
)
2346 fprintf (file
, "{ ");
2347 for (; ref
; ref
= DF_REF_NEXT_LOC (ref
))
2349 df_ref_dump (ref
, file
);
2351 df_chain_dump (DF_REF_CHAIN (ref
), file
);
2353 fprintf (file
, "}");
2357 /* Dump either a ref-def or reg-use chain. */
2360 df_regs_chain_dump (df_ref ref
, FILE *file
)
2362 fprintf (file
, "{ ");
2365 df_ref_dump (ref
, file
);
2366 ref
= DF_REF_NEXT_REG (ref
);
2368 fprintf (file
, "}");
2373 df_mws_dump (struct df_mw_hardreg
*mws
, FILE *file
)
2375 for (; mws
; mws
= DF_MWS_NEXT (mws
))
2376 fprintf (file
, "mw %c r[%d..%d]\n",
2377 DF_MWS_REG_DEF_P (mws
) ? 'd' : 'u',
2378 mws
->start_regno
, mws
->end_regno
);
2383 df_insn_uid_debug (unsigned int uid
,
2384 bool follow_chain
, FILE *file
)
2386 fprintf (file
, "insn %d luid %d",
2387 uid
, DF_INSN_UID_LUID (uid
));
2389 if (DF_INSN_UID_DEFS (uid
))
2391 fprintf (file
, " defs ");
2392 df_refs_chain_dump (DF_INSN_UID_DEFS (uid
), follow_chain
, file
);
2395 if (DF_INSN_UID_USES (uid
))
2397 fprintf (file
, " uses ");
2398 df_refs_chain_dump (DF_INSN_UID_USES (uid
), follow_chain
, file
);
2401 if (DF_INSN_UID_EQ_USES (uid
))
2403 fprintf (file
, " eq uses ");
2404 df_refs_chain_dump (DF_INSN_UID_EQ_USES (uid
), follow_chain
, file
);
2407 if (DF_INSN_UID_MWS (uid
))
2409 fprintf (file
, " mws ");
2410 df_mws_dump (DF_INSN_UID_MWS (uid
), file
);
2412 fprintf (file
, "\n");
2417 df_insn_debug (rtx_insn
*insn
, bool follow_chain
, FILE *file
)
2419 df_insn_uid_debug (INSN_UID (insn
), follow_chain
, file
);
2423 df_insn_debug_regno (rtx_insn
*insn
, FILE *file
)
2425 struct df_insn_info
*insn_info
= DF_INSN_INFO_GET (insn
);
2427 fprintf (file
, "insn %d bb %d luid %d defs ",
2428 INSN_UID (insn
), BLOCK_FOR_INSN (insn
)->index
,
2429 DF_INSN_INFO_LUID (insn_info
));
2430 df_refs_chain_dump (DF_INSN_INFO_DEFS (insn_info
), false, file
);
2432 fprintf (file
, " uses ");
2433 df_refs_chain_dump (DF_INSN_INFO_USES (insn_info
), false, file
);
2435 fprintf (file
, " eq_uses ");
2436 df_refs_chain_dump (DF_INSN_INFO_EQ_USES (insn_info
), false, file
);
2437 fprintf (file
, "\n");
2441 df_regno_debug (unsigned int regno
, FILE *file
)
2443 fprintf (file
, "reg %d defs ", regno
);
2444 df_regs_chain_dump (DF_REG_DEF_CHAIN (regno
), file
);
2445 fprintf (file
, " uses ");
2446 df_regs_chain_dump (DF_REG_USE_CHAIN (regno
), file
);
2447 fprintf (file
, " eq_uses ");
2448 df_regs_chain_dump (DF_REG_EQ_USE_CHAIN (regno
), file
);
2449 fprintf (file
, "\n");
2454 df_ref_debug (df_ref ref
, FILE *file
)
2456 fprintf (file
, "%c%d ",
2457 DF_REF_REG_DEF_P (ref
) ? 'd' : 'u',
2459 fprintf (file
, "reg %d bb %d insn %d flag %#x type %#x ",
2462 DF_REF_IS_ARTIFICIAL (ref
) ? -1 : DF_REF_INSN_UID (ref
),
2465 if (DF_REF_LOC (ref
))
2467 if (flag_dump_noaddr
)
2468 fprintf (file
, "loc #(#) chain ");
2470 fprintf (file
, "loc %p(%p) chain ", (void *)DF_REF_LOC (ref
),
2471 (void *)*DF_REF_LOC (ref
));
2474 fprintf (file
, "chain ");
2475 df_chain_dump (DF_REF_CHAIN (ref
), file
);
2476 fprintf (file
, "\n");
2479 /* Functions for debugging from GDB. */
2482 debug_df_insn (rtx_insn
*insn
)
2484 df_insn_debug (insn
, true, stderr
);
2490 debug_df_reg (rtx reg
)
2492 df_regno_debug (REGNO (reg
), stderr
);
2497 debug_df_regno (unsigned int regno
)
2499 df_regno_debug (regno
, stderr
);
2504 debug_df_ref (df_ref ref
)
2506 df_ref_debug (ref
, stderr
);
2511 debug_df_defno (unsigned int defno
)
2513 df_ref_debug (DF_DEFS_GET (defno
), stderr
);
2518 debug_df_useno (unsigned int defno
)
2520 df_ref_debug (DF_USES_GET (defno
), stderr
);
2525 debug_df_chain (struct df_link
*link
)
2527 df_chain_dump (link
, stderr
);
2528 fputc ('\n', stderr
);