]>
Commit | Line | Data |
---|---|---|
4d779342 | 1 | /* Scanning of rtl for dataflow analysis. |
a5544970 | 2 | Copyright (C) 1999-2019 Free Software Foundation, Inc. |
b8698a0f | 3 | Originally contributed by Michael P. Hayes |
4d779342 DB |
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 | |
9dcd6f09 | 12 | Software Foundation; either version 3, or (at your option) any later |
4d779342 DB |
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 | |
9dcd6f09 NC |
21 | along with GCC; see the file COPYING3. If not see |
22 | <http://www.gnu.org/licenses/>. */ | |
4d779342 DB |
23 | |
24 | #include "config.h" | |
25 | #include "system.h" | |
26 | #include "coretypes.h" | |
c7131fb2 | 27 | #include "backend.h" |
957060b5 | 28 | #include "target.h" |
4d779342 | 29 | #include "rtl.h" |
957060b5 | 30 | #include "tree.h" |
c7131fb2 | 31 | #include "df.h" |
4d0cdd0c | 32 | #include "memmodel.h" |
4d779342 | 33 | #include "tm_p.h" |
957060b5 AM |
34 | #include "regs.h" |
35 | #include "emit-rtl.h" /* FIXME: Can go away once crtl is moved to rtl.h. */ | |
7ee2468b | 36 | #include "dumpfile.h" |
4b522b8f | 37 | #include "calls.h" |
4d779342 | 38 | |
c2569604 | 39 | |
4d779342 DB |
40 | /* The set of hard registers in eliminables[i].from. */ |
41 | ||
42 | static HARD_REG_SET elim_reg_set; | |
43 | ||
4d779342 DB |
44 | /* Initialize ur_in and ur_out as if all hard registers were partially |
45 | available. */ | |
46 | ||
6fb5fa3c DB |
47 | struct df_collection_rec |
48 | { | |
00f96dc9 TS |
49 | auto_vec<df_ref, 128> def_vec; |
50 | auto_vec<df_ref, 32> use_vec; | |
51 | auto_vec<df_ref, 32> eq_use_vec; | |
526ceb68 | 52 | auto_vec<df_mw_hardreg *, 32> mw_vec; |
6fb5fa3c DB |
53 | }; |
54 | ||
57512f53 | 55 | static void df_ref_record (enum df_ref_class, struct df_collection_rec *, |
b8698a0f | 56 | rtx, rtx *, |
50e94c7e | 57 | basic_block, struct df_insn_info *, |
502ef838 | 58 | enum df_ref_type, int ref_flags); |
c5ebdc25 | 59 | static void df_def_record_1 (struct df_collection_rec *, rtx *, |
50e94c7e | 60 | basic_block, struct df_insn_info *, |
bbbbb16a | 61 | int ref_flags); |
50e94c7e SB |
62 | static void df_defs_record (struct df_collection_rec *, rtx, |
63 | basic_block, struct df_insn_info *, | |
bbbbb16a | 64 | int ref_flags); |
502ef838 | 65 | static void df_uses_record (struct df_collection_rec *, |
6fb5fa3c | 66 | rtx *, enum df_ref_type, |
50e94c7e | 67 | basic_block, struct df_insn_info *, |
502ef838 | 68 | int ref_flags); |
4d779342 | 69 | |
dc007c1f | 70 | static void df_install_ref_incremental (df_ref); |
b8698a0f L |
71 | static void df_insn_refs_collect (struct df_collection_rec*, |
72 | basic_block, struct df_insn_info *); | |
6fb5fa3c DB |
73 | static void df_canonize_collection_rec (struct df_collection_rec *); |
74 | ||
75 | static void df_get_regular_block_artificial_uses (bitmap); | |
76 | static void df_get_eh_block_artificial_uses (bitmap); | |
77 | ||
78 | static void df_record_entry_block_defs (bitmap); | |
79 | static void df_record_exit_block_uses (bitmap); | |
80 | static void df_get_exit_block_use_set (bitmap); | |
81 | static void df_get_entry_block_def_set (bitmap); | |
4d779342 | 82 | static void df_grow_ref_info (struct df_ref_info *, unsigned int); |
b512946c RS |
83 | static void df_ref_chain_delete_du_chain (df_ref); |
84 | static void df_ref_chain_delete (df_ref); | |
4d779342 | 85 | |
b8698a0f | 86 | static void df_refs_add_to_chains (struct df_collection_rec *, |
b2908ba6 | 87 | basic_block, rtx_insn *, unsigned int); |
6fb5fa3c | 88 | |
b2908ba6 DM |
89 | static bool df_insn_refs_verify (struct df_collection_rec *, basic_block, |
90 | rtx_insn *, bool); | |
6fb5fa3c DB |
91 | static void df_entry_block_defs_collect (struct df_collection_rec *, bitmap); |
92 | static void df_exit_block_uses_collect (struct df_collection_rec *, bitmap); | |
b8698a0f | 93 | static void df_install_ref (df_ref, struct df_reg_info *, |
6fb5fa3c DB |
94 | struct df_ref_info *, bool); |
95 | ||
b512946c RS |
96 | static int df_ref_compare (df_ref, df_ref); |
97 | static int df_ref_ptr_compare (const void *, const void *); | |
98 | static int df_mw_compare (const df_mw_hardreg *, const df_mw_hardreg *); | |
99 | static int df_mw_ptr_compare (const void *, const void *); | |
6fb5fa3c | 100 | |
80eb8028 SB |
101 | static void df_insn_info_delete (unsigned int); |
102 | ||
6fb5fa3c DB |
103 | /* Indexed by hardware reg number, is true if that register is ever |
104 | used in the current function. | |
105 | ||
106 | In df-scan.c, this is set up to record the hard regs used | |
107 | explicitly. Reload adds in the hard regs used for holding pseudo | |
108 | regs. Final uses it to generate the code in the function prologue | |
109 | and epilogue to save and restore registers as needed. */ | |
110 | ||
111 | static bool regs_ever_live[FIRST_PSEUDO_REGISTER]; | |
ff4c81cc TS |
112 | |
113 | /* Flags used to tell df_refs_add_to_chains() which vectors it should copy. */ | |
114 | static const unsigned int copy_defs = 0x1; | |
115 | static const unsigned int copy_uses = 0x2; | |
116 | static const unsigned int copy_eq_uses = 0x4; | |
117 | static const unsigned int copy_mw = 0x8; | |
118 | static const unsigned int copy_all = copy_defs | copy_uses | copy_eq_uses | |
119 | | copy_mw; | |
4d779342 DB |
120 | \f |
121 | /*---------------------------------------------------------------------------- | |
122 | SCANNING DATAFLOW PROBLEM | |
123 | ||
124 | There are several ways in which scanning looks just like the other | |
125 | dataflow problems. It shares the all the mechanisms for local info | |
126 | as well as basic block info. Where it differs is when and how often | |
127 | it gets run. It also has no need for the iterative solver. | |
128 | ----------------------------------------------------------------------------*/ | |
129 | ||
130 | /* Problem data for the scanning dataflow function. */ | |
131 | struct df_scan_problem_data | |
132 | { | |
fb0b2914 ML |
133 | object_allocator<df_base_ref> *ref_base_pool; |
134 | object_allocator<df_artificial_ref> *ref_artificial_pool; | |
135 | object_allocator<df_regular_ref> *ref_regular_pool; | |
136 | object_allocator<df_insn_info> *insn_pool; | |
137 | object_allocator<df_reg_info> *reg_pool; | |
138 | object_allocator<df_mw_hardreg> *mw_reg_pool; | |
e956943e | 139 | |
6fb5fa3c DB |
140 | bitmap_obstack reg_bitmaps; |
141 | bitmap_obstack insn_bitmaps; | |
4d779342 DB |
142 | }; |
143 | ||
370f38e8 | 144 | /* Internal function to shut down the scanning problem. */ |
b8698a0f | 145 | static void |
6fb5fa3c | 146 | df_scan_free_internal (void) |
4d779342 | 147 | { |
23249ac4 | 148 | struct df_scan_problem_data *problem_data |
6fb5fa3c | 149 | = (struct df_scan_problem_data *) df_scan->problem_data; |
4d779342 | 150 | |
4d779342 | 151 | free (df->def_info.refs); |
6fb5fa3c DB |
152 | free (df->def_info.begin); |
153 | free (df->def_info.count); | |
4d779342 DB |
154 | memset (&df->def_info, 0, (sizeof (struct df_ref_info))); |
155 | ||
4d779342 | 156 | free (df->use_info.refs); |
6fb5fa3c DB |
157 | free (df->use_info.begin); |
158 | free (df->use_info.count); | |
4d779342 DB |
159 | memset (&df->use_info, 0, (sizeof (struct df_ref_info))); |
160 | ||
6fb5fa3c DB |
161 | free (df->def_regs); |
162 | df->def_regs = NULL; | |
163 | free (df->use_regs); | |
164 | df->use_regs = NULL; | |
165 | free (df->eq_use_regs); | |
166 | df->eq_use_regs = NULL; | |
167 | df->regs_size = 0; | |
c3284718 | 168 | DF_REG_SIZE (df) = 0; |
6fb5fa3c | 169 | |
4d779342 DB |
170 | free (df->insns); |
171 | df->insns = NULL; | |
6fb5fa3c | 172 | DF_INSN_SIZE () = 0; |
4d779342 | 173 | |
6fb5fa3c DB |
174 | free (df_scan->block_info); |
175 | df_scan->block_info = NULL; | |
176 | df_scan->block_info_size = 0; | |
4d779342 | 177 | |
a7e3698d JH |
178 | bitmap_clear (&df->hardware_regs_used); |
179 | bitmap_clear (&df->regular_block_artificial_uses); | |
180 | bitmap_clear (&df->eh_block_artificial_uses); | |
912f2dac | 181 | BITMAP_FREE (df->entry_block_defs); |
4d779342 | 182 | BITMAP_FREE (df->exit_block_uses); |
a7e3698d JH |
183 | bitmap_clear (&df->insns_to_delete); |
184 | bitmap_clear (&df->insns_to_rescan); | |
185 | bitmap_clear (&df->insns_to_notes_rescan); | |
4d779342 | 186 | |
e956943e ML |
187 | delete problem_data->ref_base_pool; |
188 | delete problem_data->ref_artificial_pool; | |
189 | delete problem_data->ref_regular_pool; | |
190 | delete problem_data->insn_pool; | |
191 | delete problem_data->reg_pool; | |
192 | delete problem_data->mw_reg_pool; | |
6fb5fa3c DB |
193 | bitmap_obstack_release (&problem_data->reg_bitmaps); |
194 | bitmap_obstack_release (&problem_data->insn_bitmaps); | |
195 | free (df_scan->problem_data); | |
4d779342 DB |
196 | } |
197 | ||
198 | ||
4d779342 DB |
199 | /* Free basic block info. */ |
200 | ||
201 | static void | |
6fb5fa3c | 202 | df_scan_free_bb_info (basic_block bb, void *vbb_info) |
4d779342 DB |
203 | { |
204 | struct df_scan_bb_info *bb_info = (struct df_scan_bb_info *) vbb_info; | |
6fb5fa3c | 205 | unsigned int bb_index = bb->index; |
dd3eed93 | 206 | rtx_insn *insn; |
e285df08 | 207 | |
b512946c RS |
208 | FOR_BB_INSNS (bb, insn) |
209 | if (INSN_P (insn)) | |
210 | df_insn_info_delete (INSN_UID (insn)); | |
211 | ||
212 | if (bb_index < df_scan->block_info_size) | |
213 | bb_info = df_scan_get_bb_info (bb_index); | |
214 | ||
215 | /* Get rid of any artificial uses or defs. */ | |
216 | df_ref_chain_delete_du_chain (bb_info->artificial_defs); | |
217 | df_ref_chain_delete_du_chain (bb_info->artificial_uses); | |
218 | df_ref_chain_delete (bb_info->artificial_defs); | |
219 | df_ref_chain_delete (bb_info->artificial_uses); | |
220 | bb_info->artificial_defs = NULL; | |
221 | bb_info->artificial_uses = NULL; | |
4d779342 DB |
222 | } |
223 | ||
224 | ||
225 | /* Allocate the problem data for the scanning problem. This should be | |
226 | called when the problem is created or when the entire function is to | |
227 | be rescanned. */ | |
b8698a0f | 228 | void |
6fb5fa3c | 229 | df_scan_alloc (bitmap all_blocks ATTRIBUTE_UNUSED) |
4d779342 | 230 | { |
4d779342 DB |
231 | struct df_scan_problem_data *problem_data; |
232 | unsigned int insn_num = get_max_uid () + 1; | |
6fb5fa3c | 233 | basic_block bb; |
4d779342 DB |
234 | |
235 | /* Given the number of pools, this is really faster than tearing | |
236 | everything apart. */ | |
6fb5fa3c DB |
237 | if (df_scan->problem_data) |
238 | df_scan_free_internal (); | |
4d779342 | 239 | |
5ed6ace5 | 240 | problem_data = XNEW (struct df_scan_problem_data); |
6fb5fa3c DB |
241 | df_scan->problem_data = problem_data; |
242 | df_scan->computed = true; | |
4d779342 | 243 | |
fb0b2914 | 244 | problem_data->ref_base_pool = new object_allocator<df_base_ref> |
fcb87c50 | 245 | ("df_scan ref base"); |
fb0b2914 | 246 | problem_data->ref_artificial_pool = new object_allocator<df_artificial_ref> |
fcb87c50 | 247 | ("df_scan ref artificial"); |
fb0b2914 | 248 | problem_data->ref_regular_pool = new object_allocator<df_regular_ref> |
fcb87c50 | 249 | ("df_scan ref regular"); |
fb0b2914 | 250 | problem_data->insn_pool = new object_allocator<df_insn_info> |
fcb87c50 | 251 | ("df_scan insn"); |
fb0b2914 | 252 | problem_data->reg_pool = new object_allocator<df_reg_info> |
fcb87c50 | 253 | ("df_scan reg"); |
fb0b2914 | 254 | problem_data->mw_reg_pool = new object_allocator<df_mw_hardreg> |
fcb87c50 | 255 | ("df_scan mw_reg"); |
4d779342 | 256 | |
6fb5fa3c DB |
257 | bitmap_obstack_initialize (&problem_data->reg_bitmaps); |
258 | bitmap_obstack_initialize (&problem_data->insn_bitmaps); | |
4d779342 | 259 | |
b8698a0f | 260 | insn_num += insn_num / 4; |
6fb5fa3c | 261 | df_grow_reg_info (); |
4d779342 | 262 | |
6fb5fa3c DB |
263 | df_grow_insn_info (); |
264 | df_grow_bb_info (df_scan); | |
4d779342 | 265 | |
04a90bec | 266 | FOR_ALL_BB_FN (bb, cfun) |
4d779342 | 267 | { |
6fb5fa3c DB |
268 | unsigned int bb_index = bb->index; |
269 | struct df_scan_bb_info *bb_info = df_scan_get_bb_info (bb_index); | |
4d779342 DB |
270 | bb_info->artificial_defs = NULL; |
271 | bb_info->artificial_uses = NULL; | |
272 | } | |
273 | ||
a7e3698d JH |
274 | bitmap_initialize (&df->hardware_regs_used, &problem_data->reg_bitmaps); |
275 | bitmap_initialize (&df->regular_block_artificial_uses, &problem_data->reg_bitmaps); | |
276 | bitmap_initialize (&df->eh_block_artificial_uses, &problem_data->reg_bitmaps); | |
6fb5fa3c DB |
277 | df->entry_block_defs = BITMAP_ALLOC (&problem_data->reg_bitmaps); |
278 | df->exit_block_uses = BITMAP_ALLOC (&problem_data->reg_bitmaps); | |
a7e3698d JH |
279 | bitmap_initialize (&df->insns_to_delete, &problem_data->insn_bitmaps); |
280 | bitmap_initialize (&df->insns_to_rescan, &problem_data->insn_bitmaps); | |
281 | bitmap_initialize (&df->insns_to_notes_rescan, &problem_data->insn_bitmaps); | |
89a95777 | 282 | df_scan->optional_p = false; |
4d779342 DB |
283 | } |
284 | ||
285 | ||
286 | /* Free all of the data associated with the scan problem. */ | |
287 | ||
b8698a0f | 288 | static void |
6fb5fa3c | 289 | df_scan_free (void) |
4d779342 | 290 | { |
6fb5fa3c DB |
291 | if (df_scan->problem_data) |
292 | df_scan_free_internal (); | |
3b8266e2 | 293 | |
4d779342 | 294 | if (df->blocks_to_analyze) |
6fb5fa3c DB |
295 | { |
296 | BITMAP_FREE (df->blocks_to_analyze); | |
297 | df->blocks_to_analyze = NULL; | |
298 | } | |
4d779342 | 299 | |
6fb5fa3c | 300 | free (df_scan); |
4d779342 DB |
301 | } |
302 | ||
6fb5fa3c | 303 | /* Dump the preamble for DF_SCAN dump. */ |
b8698a0f | 304 | static void |
6fb5fa3c | 305 | df_scan_start_dump (FILE *file ATTRIBUTE_UNUSED) |
4d779342 | 306 | { |
4d779342 | 307 | int i; |
57512f53 KZ |
308 | int dcount = 0; |
309 | int ucount = 0; | |
310 | int ecount = 0; | |
311 | int icount = 0; | |
312 | int ccount = 0; | |
313 | basic_block bb; | |
dd3eed93 | 314 | rtx_insn *insn; |
4d779342 | 315 | |
6fb5fa3c | 316 | fprintf (file, ";; invalidated by call \t"); |
f2ecb626 | 317 | df_print_regset (file, regs_invalidated_by_call_regset); |
6fb5fa3c | 318 | fprintf (file, ";; hardware regs used \t"); |
a7e3698d | 319 | df_print_regset (file, &df->hardware_regs_used); |
6fb5fa3c | 320 | fprintf (file, ";; regular block artificial uses \t"); |
a7e3698d | 321 | df_print_regset (file, &df->regular_block_artificial_uses); |
6fb5fa3c | 322 | fprintf (file, ";; eh block artificial uses \t"); |
a7e3698d | 323 | df_print_regset (file, &df->eh_block_artificial_uses); |
6fb5fa3c DB |
324 | fprintf (file, ";; entry block defs \t"); |
325 | df_print_regset (file, df->entry_block_defs); | |
326 | fprintf (file, ";; exit block uses \t"); | |
327 | df_print_regset (file, df->exit_block_uses); | |
328 | fprintf (file, ";; regs ever live \t"); | |
4d779342 | 329 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) |
6fb5fa3c | 330 | if (df_regs_ever_live_p (i)) |
b4147b63 | 331 | fprintf (file, " %d [%s]", i, reg_names[i]); |
57512f53 | 332 | fprintf (file, "\n;; ref usage \t"); |
b8698a0f | 333 | |
57512f53 KZ |
334 | for (i = 0; i < (int)df->regs_inited; i++) |
335 | if (DF_REG_DEF_COUNT (i) || DF_REG_USE_COUNT (i) || DF_REG_EQ_USE_COUNT (i)) | |
336 | { | |
337 | const char * sep = ""; | |
338 | ||
339 | fprintf (file, "r%d={", i); | |
340 | if (DF_REG_DEF_COUNT (i)) | |
341 | { | |
342 | fprintf (file, "%dd", DF_REG_DEF_COUNT (i)); | |
343 | sep = ","; | |
344 | dcount += DF_REG_DEF_COUNT (i); | |
345 | } | |
346 | if (DF_REG_USE_COUNT (i)) | |
347 | { | |
348 | fprintf (file, "%s%du", sep, DF_REG_USE_COUNT (i)); | |
349 | sep = ","; | |
350 | ucount += DF_REG_USE_COUNT (i); | |
351 | } | |
352 | if (DF_REG_EQ_USE_COUNT (i)) | |
353 | { | |
885c9b5d | 354 | fprintf (file, "%s%de", sep, DF_REG_EQ_USE_COUNT (i)); |
57512f53 KZ |
355 | ecount += DF_REG_EQ_USE_COUNT (i); |
356 | } | |
357 | fprintf (file, "} "); | |
358 | } | |
6fb5fa3c | 359 | |
11cd3bed | 360 | FOR_EACH_BB_FN (bb, cfun) |
57512f53 KZ |
361 | FOR_BB_INSNS (bb, insn) |
362 | if (INSN_P (insn)) | |
363 | { | |
364 | if (CALL_P (insn)) | |
365 | ccount++; | |
366 | else | |
367 | icount++; | |
368 | } | |
369 | ||
885c9b5d EB |
370 | fprintf (file, "\n;; total ref usage %d{%dd,%du,%de}" |
371 | " in %d{%d regular + %d call} insns.\n", | |
372 | dcount + ucount + ecount, dcount, ucount, ecount, | |
373 | icount + ccount, icount, ccount); | |
4d779342 DB |
374 | } |
375 | ||
6fb5fa3c | 376 | /* Dump the bb_info for a given basic block. */ |
b8698a0f | 377 | static void |
6fb5fa3c DB |
378 | df_scan_start_block (basic_block bb, FILE *file) |
379 | { | |
380 | struct df_scan_bb_info *bb_info | |
381 | = df_scan_get_bb_info (bb->index); | |
382 | ||
383 | if (bb_info) | |
384 | { | |
385 | fprintf (file, ";; bb %d artificial_defs: ", bb->index); | |
386 | df_refs_chain_dump (bb_info->artificial_defs, true, file); | |
387 | fprintf (file, "\n;; bb %d artificial_uses: ", bb->index); | |
388 | df_refs_chain_dump (bb_info->artificial_uses, true, file); | |
389 | fprintf (file, "\n"); | |
390 | } | |
391 | #if 0 | |
392 | { | |
dd3eed93 | 393 | rtx_insn *insn; |
6fb5fa3c DB |
394 | FOR_BB_INSNS (bb, insn) |
395 | if (INSN_P (insn)) | |
396 | df_insn_debug (insn, false, file); | |
397 | } | |
398 | #endif | |
399 | } | |
400 | ||
fdd5680c | 401 | static const struct df_problem problem_SCAN = |
4d779342 DB |
402 | { |
403 | DF_SCAN, /* Problem id. */ | |
404 | DF_NONE, /* Direction. */ | |
405 | df_scan_alloc, /* Allocate the problem specific data. */ | |
30cb87a0 | 406 | NULL, /* Reset global information. */ |
4d779342 DB |
407 | df_scan_free_bb_info, /* Free basic block info. */ |
408 | NULL, /* Local compute function. */ | |
409 | NULL, /* Init the solution specific data. */ | |
410 | NULL, /* Iterative solver. */ | |
b8698a0f L |
411 | NULL, /* Confluence operator 0. */ |
412 | NULL, /* Confluence operator n. */ | |
4d779342 DB |
413 | NULL, /* Transfer function. */ |
414 | NULL, /* Finalize function. */ | |
415 | df_scan_free, /* Free all of the problem information. */ | |
6fb5fa3c DB |
416 | NULL, /* Remove this problem from the stack of dataflow problems. */ |
417 | df_scan_start_dump, /* Debugging. */ | |
418 | df_scan_start_block, /* Debugging start block. */ | |
419 | NULL, /* Debugging end block. */ | |
7b19209f SB |
420 | NULL, /* Debugging start insn. */ |
421 | NULL, /* Debugging end insn. */ | |
6fb5fa3c | 422 | NULL, /* Incremental solution verify start. */ |
6ed3da00 | 423 | NULL, /* Incremental solution verify end. */ |
23249ac4 | 424 | NULL, /* Dependent problem. */ |
e285df08 | 425 | sizeof (struct df_scan_bb_info),/* Size of entry of block_info array. */ |
89a95777 KZ |
426 | TV_DF_SCAN, /* Timing variable. */ |
427 | false /* Reset blocks on dropping out of blocks_to_analyze. */ | |
4d779342 DB |
428 | }; |
429 | ||
430 | ||
431 | /* Create a new DATAFLOW instance and add it to an existing instance | |
432 | of DF. The returned structure is what is used to get at the | |
433 | solution. */ | |
434 | ||
6fb5fa3c DB |
435 | void |
436 | df_scan_add_problem (void) | |
4d779342 | 437 | { |
6fb5fa3c | 438 | df_add_problem (&problem_SCAN); |
4d779342 DB |
439 | } |
440 | ||
6fb5fa3c | 441 | \f |
4d779342 DB |
442 | /*---------------------------------------------------------------------------- |
443 | Storage Allocation Utilities | |
444 | ----------------------------------------------------------------------------*/ | |
445 | ||
446 | ||
447 | /* First, grow the reg_info information. If the current size is less than | |
fa10beec | 448 | the number of pseudos, grow to 25% more than the number of |
b8698a0f | 449 | pseudos. |
4d779342 DB |
450 | |
451 | Second, assure that all of the slots up to max_reg_num have been | |
452 | filled with reg_info structures. */ | |
453 | ||
b8698a0f | 454 | void |
6fb5fa3c | 455 | df_grow_reg_info (void) |
4d779342 DB |
456 | { |
457 | unsigned int max_reg = max_reg_num (); | |
458 | unsigned int new_size = max_reg; | |
23249ac4 | 459 | struct df_scan_problem_data *problem_data |
6fb5fa3c | 460 | = (struct df_scan_problem_data *) df_scan->problem_data; |
4d779342 DB |
461 | unsigned int i; |
462 | ||
6fb5fa3c | 463 | if (df->regs_size < new_size) |
4d779342 DB |
464 | { |
465 | new_size += new_size / 4; | |
f883e0a7 KG |
466 | df->def_regs = XRESIZEVEC (struct df_reg_info *, df->def_regs, new_size); |
467 | df->use_regs = XRESIZEVEC (struct df_reg_info *, df->use_regs, new_size); | |
468 | df->eq_use_regs = XRESIZEVEC (struct df_reg_info *, df->eq_use_regs, | |
469 | new_size); | |
470 | df->def_info.begin = XRESIZEVEC (unsigned, df->def_info.begin, new_size); | |
471 | df->def_info.count = XRESIZEVEC (unsigned, df->def_info.count, new_size); | |
472 | df->use_info.begin = XRESIZEVEC (unsigned, df->use_info.begin, new_size); | |
473 | df->use_info.count = XRESIZEVEC (unsigned, df->use_info.count, new_size); | |
6fb5fa3c | 474 | df->regs_size = new_size; |
4d779342 DB |
475 | } |
476 | ||
6fb5fa3c | 477 | for (i = df->regs_inited; i < max_reg; i++) |
4d779342 | 478 | { |
6fb5fa3c DB |
479 | struct df_reg_info *reg_info; |
480 | ||
e956943e ML |
481 | // TODO |
482 | reg_info = problem_data->reg_pool->allocate (); | |
6fb5fa3c DB |
483 | memset (reg_info, 0, sizeof (struct df_reg_info)); |
484 | df->def_regs[i] = reg_info; | |
e956943e | 485 | reg_info = problem_data->reg_pool->allocate (); |
6fb5fa3c DB |
486 | memset (reg_info, 0, sizeof (struct df_reg_info)); |
487 | df->use_regs[i] = reg_info; | |
e956943e | 488 | reg_info = problem_data->reg_pool->allocate (); |
4d779342 | 489 | memset (reg_info, 0, sizeof (struct df_reg_info)); |
6fb5fa3c DB |
490 | df->eq_use_regs[i] = reg_info; |
491 | df->def_info.begin[i] = 0; | |
492 | df->def_info.count[i] = 0; | |
493 | df->use_info.begin[i] = 0; | |
494 | df->use_info.count[i] = 0; | |
4d779342 | 495 | } |
b8698a0f | 496 | |
6fb5fa3c | 497 | df->regs_inited = max_reg; |
4d779342 DB |
498 | } |
499 | ||
500 | ||
501 | /* Grow the ref information. */ | |
502 | ||
b8698a0f | 503 | static void |
4d779342 DB |
504 | df_grow_ref_info (struct df_ref_info *ref_info, unsigned int new_size) |
505 | { | |
506 | if (ref_info->refs_size < new_size) | |
507 | { | |
57512f53 | 508 | ref_info->refs = XRESIZEVEC (df_ref, ref_info->refs, new_size); |
4d779342 | 509 | memset (ref_info->refs + ref_info->refs_size, 0, |
57512f53 | 510 | (new_size - ref_info->refs_size) *sizeof (df_ref)); |
4d779342 DB |
511 | ref_info->refs_size = new_size; |
512 | } | |
513 | } | |
514 | ||
515 | ||
6fb5fa3c DB |
516 | /* Check and grow the ref information if necessary. This routine |
517 | guarantees total_size + BITMAP_ADDEND amount of entries in refs | |
518 | array. It updates ref_info->refs_size only and does not change | |
519 | ref_info->total_size. */ | |
520 | ||
521 | static void | |
b8698a0f | 522 | df_check_and_grow_ref_info (struct df_ref_info *ref_info, |
6fb5fa3c DB |
523 | unsigned bitmap_addend) |
524 | { | |
525 | if (ref_info->refs_size < ref_info->total_size + bitmap_addend) | |
526 | { | |
527 | int new_size = ref_info->total_size + bitmap_addend; | |
528 | new_size += ref_info->total_size / 4; | |
529 | df_grow_ref_info (ref_info, new_size); | |
530 | } | |
531 | } | |
532 | ||
533 | ||
4d779342 DB |
534 | /* Grow the ref information. If the current size is less than the |
535 | number of instructions, grow to 25% more than the number of | |
536 | instructions. */ | |
537 | ||
b8698a0f | 538 | void |
6fb5fa3c | 539 | df_grow_insn_info (void) |
4d779342 DB |
540 | { |
541 | unsigned int new_size = get_max_uid () + 1; | |
6fb5fa3c | 542 | if (DF_INSN_SIZE () < new_size) |
4d779342 DB |
543 | { |
544 | new_size += new_size / 4; | |
f883e0a7 | 545 | df->insns = XRESIZEVEC (struct df_insn_info *, df->insns, new_size); |
4d779342 | 546 | memset (df->insns + df->insns_size, 0, |
6fb5fa3c DB |
547 | (new_size - DF_INSN_SIZE ()) *sizeof (struct df_insn_info *)); |
548 | DF_INSN_SIZE () = new_size; | |
4d779342 DB |
549 | } |
550 | } | |
551 | ||
552 | ||
553 | ||
554 | \f | |
555 | /*---------------------------------------------------------------------------- | |
556 | PUBLIC INTERFACES FOR SMALL GRAIN CHANGES TO SCANNING. | |
557 | ----------------------------------------------------------------------------*/ | |
558 | ||
6fb5fa3c DB |
559 | /* Rescan all of the block_to_analyze or all of the blocks in the |
560 | function if df_set_blocks if blocks_to_analyze is NULL; */ | |
4d779342 DB |
561 | |
562 | void | |
6fb5fa3c | 563 | df_scan_blocks (void) |
4d779342 | 564 | { |
4d779342 DB |
565 | basic_block bb; |
566 | ||
6fb5fa3c DB |
567 | df->def_info.ref_order = DF_REF_ORDER_NO_TABLE; |
568 | df->use_info.ref_order = DF_REF_ORDER_NO_TABLE; | |
23249ac4 | 569 | |
a7e3698d JH |
570 | df_get_regular_block_artificial_uses (&df->regular_block_artificial_uses); |
571 | df_get_eh_block_artificial_uses (&df->eh_block_artificial_uses); | |
4d779342 | 572 | |
a7e3698d JH |
573 | bitmap_ior_into (&df->eh_block_artificial_uses, |
574 | &df->regular_block_artificial_uses); | |
30cb87a0 | 575 | |
6fb5fa3c DB |
576 | /* ENTRY and EXIT blocks have special defs/uses. */ |
577 | df_get_entry_block_def_set (df->entry_block_defs); | |
578 | df_record_entry_block_defs (df->entry_block_defs); | |
579 | df_get_exit_block_use_set (df->exit_block_uses); | |
580 | df_record_exit_block_uses (df->exit_block_uses); | |
06e28de2 DM |
581 | df_set_bb_dirty (BASIC_BLOCK_FOR_FN (cfun, ENTRY_BLOCK)); |
582 | df_set_bb_dirty (BASIC_BLOCK_FOR_FN (cfun, EXIT_BLOCK)); | |
4d779342 | 583 | |
6fb5fa3c | 584 | /* Regular blocks */ |
11cd3bed | 585 | FOR_EACH_BB_FN (bb, cfun) |
4d779342 | 586 | { |
6fb5fa3c DB |
587 | unsigned int bb_index = bb->index; |
588 | df_bb_refs_record (bb_index, true); | |
4d779342 | 589 | } |
4d779342 DB |
590 | } |
591 | ||
dc007c1f PB |
592 | /* Create new refs under address LOC within INSN. This function is |
593 | only used externally. REF_FLAGS must be either 0 or DF_REF_IN_NOTE, | |
594 | depending on whether LOC is inside PATTERN (INSN) or a note. */ | |
595 | ||
596 | void | |
b2908ba6 | 597 | df_uses_create (rtx *loc, rtx_insn *insn, int ref_flags) |
dc007c1f PB |
598 | { |
599 | gcc_assert (!(ref_flags & ~DF_REF_IN_NOTE)); | |
600 | df_uses_record (NULL, loc, DF_REF_REG_USE, | |
601 | BLOCK_FOR_INSN (insn), | |
602 | DF_INSN_INFO_GET (insn), | |
603 | ref_flags); | |
604 | } | |
23249ac4 | 605 | |
dc007c1f PB |
606 | static void |
607 | df_install_ref_incremental (df_ref ref) | |
608 | { | |
609 | struct df_reg_info **reg_info; | |
610 | struct df_ref_info *ref_info; | |
b512946c | 611 | df_ref *ref_ptr; |
dc007c1f PB |
612 | bool add_to_table; |
613 | ||
dd3eed93 | 614 | rtx_insn *insn = DF_REF_INSN (ref); |
dc007c1f | 615 | basic_block bb = BLOCK_FOR_INSN (insn); |
4d779342 | 616 | |
57512f53 | 617 | if (DF_REF_REG_DEF_P (ref)) |
6fb5fa3c DB |
618 | { |
619 | reg_info = df->def_regs; | |
620 | ref_info = &df->def_info; | |
b512946c | 621 | ref_ptr = &DF_INSN_DEFS (insn); |
6fb5fa3c DB |
622 | add_to_table = ref_info->ref_order != DF_REF_ORDER_NO_TABLE; |
623 | } | |
624 | else if (DF_REF_FLAGS (ref) & DF_REF_IN_NOTE) | |
625 | { | |
626 | reg_info = df->eq_use_regs; | |
627 | ref_info = &df->use_info; | |
b512946c | 628 | ref_ptr = &DF_INSN_EQ_USES (insn); |
6fb5fa3c DB |
629 | switch (ref_info->ref_order) |
630 | { | |
631 | case DF_REF_ORDER_UNORDERED_WITH_NOTES: | |
632 | case DF_REF_ORDER_BY_REG_WITH_NOTES: | |
633 | case DF_REF_ORDER_BY_INSN_WITH_NOTES: | |
634 | add_to_table = true; | |
635 | break; | |
636 | default: | |
637 | add_to_table = false; | |
638 | break; | |
639 | } | |
640 | } | |
641 | else | |
642 | { | |
643 | reg_info = df->use_regs; | |
644 | ref_info = &df->use_info; | |
b512946c | 645 | ref_ptr = &DF_INSN_USES (insn); |
6fb5fa3c DB |
646 | add_to_table = ref_info->ref_order != DF_REF_ORDER_NO_TABLE; |
647 | } | |
4d779342 | 648 | |
6fb5fa3c DB |
649 | /* Do not add if ref is not in the right blocks. */ |
650 | if (add_to_table && df->analyze_subset) | |
651 | add_to_table = bitmap_bit_p (df->blocks_to_analyze, bb->index); | |
4d779342 | 652 | |
6fb5fa3c | 653 | df_install_ref (ref, reg_info[DF_REF_REGNO (ref)], ref_info, add_to_table); |
b8698a0f | 654 | |
6fb5fa3c DB |
655 | if (add_to_table) |
656 | switch (ref_info->ref_order) | |
657 | { | |
658 | case DF_REF_ORDER_UNORDERED_WITH_NOTES: | |
659 | case DF_REF_ORDER_BY_REG_WITH_NOTES: | |
660 | case DF_REF_ORDER_BY_INSN_WITH_NOTES: | |
661 | ref_info->ref_order = DF_REF_ORDER_UNORDERED_WITH_NOTES; | |
662 | break; | |
663 | default: | |
664 | ref_info->ref_order = DF_REF_ORDER_UNORDERED; | |
665 | break; | |
666 | } | |
4d779342 | 667 | |
b512946c RS |
668 | while (*ref_ptr && df_ref_compare (*ref_ptr, ref) < 0) |
669 | ref_ptr = &DF_REF_NEXT_LOC (*ref_ptr); | |
4d779342 | 670 | |
b512946c RS |
671 | DF_REF_NEXT_LOC (ref) = *ref_ptr; |
672 | *ref_ptr = ref; | |
4d779342 | 673 | |
6fb5fa3c DB |
674 | #if 0 |
675 | if (dump_file) | |
676 | { | |
677 | fprintf (dump_file, "adding ref "); | |
678 | df_ref_debug (ref, dump_file); | |
4d779342 | 679 | } |
6fb5fa3c DB |
680 | #endif |
681 | /* By adding the ref directly, df_insn_rescan my not find any | |
682 | differences even though the block will have changed. So we need | |
b8698a0f | 683 | to mark the block dirty ourselves. */ |
d785e46f AO |
684 | if (!DEBUG_INSN_P (DF_REF_INSN (ref))) |
685 | df_set_bb_dirty (bb); | |
4d779342 DB |
686 | } |
687 | ||
688 | ||
6fb5fa3c DB |
689 | \f |
690 | /*---------------------------------------------------------------------------- | |
691 | UTILITIES TO CREATE AND DESTROY REFS AND CHAINS. | |
692 | ----------------------------------------------------------------------------*/ | |
693 | ||
ca9052ce | 694 | static void |
57512f53 | 695 | df_free_ref (df_ref ref) |
ca9052ce KZ |
696 | { |
697 | struct df_scan_problem_data *problem_data | |
698 | = (struct df_scan_problem_data *) df_scan->problem_data; | |
699 | ||
57512f53 KZ |
700 | switch (DF_REF_CLASS (ref)) |
701 | { | |
702 | case DF_REF_BASE: | |
e956943e | 703 | problem_data->ref_base_pool->remove ((df_base_ref *) (ref)); |
57512f53 KZ |
704 | break; |
705 | ||
706 | case DF_REF_ARTIFICIAL: | |
e956943e ML |
707 | problem_data->ref_artificial_pool->remove |
708 | ((df_artificial_ref *) (ref)); | |
57512f53 KZ |
709 | break; |
710 | ||
711 | case DF_REF_REGULAR: | |
e956943e ML |
712 | problem_data->ref_regular_pool->remove |
713 | ((df_regular_ref *) (ref)); | |
57512f53 | 714 | break; |
57512f53 | 715 | } |
ca9052ce KZ |
716 | } |
717 | ||
4d779342 | 718 | |
6fb5fa3c DB |
719 | /* Unlink and delete REF at the reg_use, reg_eq_use or reg_def chain. |
720 | Also delete the def-use or use-def chain if it exists. */ | |
721 | ||
722 | static void | |
b8698a0f | 723 | df_reg_chain_unlink (df_ref ref) |
4d779342 | 724 | { |
b8698a0f | 725 | df_ref next = DF_REF_NEXT_REG (ref); |
57512f53 | 726 | df_ref prev = DF_REF_PREV_REG (ref); |
6fb5fa3c | 727 | int id = DF_REF_ID (ref); |
4d779342 | 728 | struct df_reg_info *reg_info; |
57512f53 | 729 | df_ref *refs = NULL; |
4d779342 | 730 | |
57512f53 | 731 | if (DF_REF_REG_DEF_P (ref)) |
4d779342 | 732 | { |
57512f53 KZ |
733 | int regno = DF_REF_REGNO (ref); |
734 | reg_info = DF_REG_DEF_GET (regno); | |
6fb5fa3c | 735 | refs = df->def_info.refs; |
4d779342 | 736 | } |
b8698a0f | 737 | else |
4d779342 | 738 | { |
6fb5fa3c DB |
739 | if (DF_REF_FLAGS (ref) & DF_REF_IN_NOTE) |
740 | { | |
741 | reg_info = DF_REG_EQ_USE_GET (DF_REF_REGNO (ref)); | |
742 | switch (df->use_info.ref_order) | |
743 | { | |
744 | case DF_REF_ORDER_UNORDERED_WITH_NOTES: | |
745 | case DF_REF_ORDER_BY_REG_WITH_NOTES: | |
746 | case DF_REF_ORDER_BY_INSN_WITH_NOTES: | |
747 | refs = df->use_info.refs; | |
748 | break; | |
749 | default: | |
750 | break; | |
751 | } | |
752 | } | |
753 | else | |
754 | { | |
755 | reg_info = DF_REG_USE_GET (DF_REF_REGNO (ref)); | |
756 | refs = df->use_info.refs; | |
757 | } | |
758 | } | |
759 | ||
760 | if (refs) | |
761 | { | |
762 | if (df->analyze_subset) | |
763 | { | |
57512f53 | 764 | if (bitmap_bit_p (df->blocks_to_analyze, DF_REF_BBNO (ref))) |
6fb5fa3c DB |
765 | refs[id] = NULL; |
766 | } | |
767 | else | |
768 | refs[id] = NULL; | |
4d779342 | 769 | } |
b8698a0f | 770 | |
6fb5fa3c DB |
771 | /* Delete any def-use or use-def chains that start here. It is |
772 | possible that there is trash in this field. This happens for | |
773 | insns that have been deleted when rescanning has been deferred | |
774 | and the chain problem has also been deleted. The chain tear down | |
775 | code skips deleted insns. */ | |
776 | if (df_chain && DF_REF_CHAIN (ref)) | |
777 | df_chain_unlink (ref); | |
b8698a0f | 778 | |
4d779342 | 779 | reg_info->n_refs--; |
6fb5fa3c DB |
780 | if (DF_REF_FLAGS_IS_SET (ref, DF_HARD_REG_LIVE)) |
781 | { | |
782 | gcc_assert (DF_REF_REGNO (ref) < FIRST_PSEUDO_REGISTER); | |
783 | df->hard_regs_live_count[DF_REF_REGNO (ref)]--; | |
784 | } | |
4d779342 DB |
785 | |
786 | /* Unlink from the reg chain. If there is no prev, this is the | |
787 | first of the list. If not, just join the next and prev. */ | |
788 | if (prev) | |
6fb5fa3c | 789 | DF_REF_NEXT_REG (prev) = next; |
4d779342 DB |
790 | else |
791 | { | |
6fb5fa3c | 792 | gcc_assert (reg_info->reg_chain == ref); |
4d779342 | 793 | reg_info->reg_chain = next; |
4d779342 | 794 | } |
6fb5fa3c DB |
795 | if (next) |
796 | DF_REF_PREV_REG (next) = prev; | |
4d779342 | 797 | |
ca9052ce | 798 | df_free_ref (ref); |
6fb5fa3c DB |
799 | } |
800 | ||
762613be RS |
801 | /* Initialize INSN_INFO to describe INSN. */ |
802 | ||
803 | static void | |
804 | df_insn_info_init_fields (df_insn_info *insn_info, rtx_insn *insn) | |
805 | { | |
806 | memset (insn_info, 0, sizeof (struct df_insn_info)); | |
807 | insn_info->insn = insn; | |
808 | } | |
6fb5fa3c | 809 | |
6fb5fa3c DB |
810 | /* Create the insn record for INSN. If there was one there, zero it |
811 | out. */ | |
4d779342 | 812 | |
6fb5fa3c | 813 | struct df_insn_info * |
b2908ba6 | 814 | df_insn_create_insn_record (rtx_insn *insn) |
4d779342 | 815 | { |
23249ac4 | 816 | struct df_scan_problem_data *problem_data |
6fb5fa3c DB |
817 | = (struct df_scan_problem_data *) df_scan->problem_data; |
818 | struct df_insn_info *insn_rec; | |
4d779342 | 819 | |
6fb5fa3c | 820 | df_grow_insn_info (); |
50e94c7e | 821 | insn_rec = DF_INSN_INFO_GET (insn); |
4d779342 DB |
822 | if (!insn_rec) |
823 | { | |
e956943e | 824 | insn_rec = problem_data->insn_pool->allocate (); |
50e94c7e | 825 | DF_INSN_INFO_SET (insn, insn_rec); |
4d779342 | 826 | } |
762613be | 827 | df_insn_info_init_fields (insn_rec, insn); |
4d779342 DB |
828 | return insn_rec; |
829 | } | |
830 | ||
3b8266e2 | 831 | |
6fb5fa3c | 832 | /* Delete all du chain (DF_REF_CHAIN()) of all refs in the ref chain. */ |
4d779342 | 833 | |
6fb5fa3c | 834 | static void |
b512946c | 835 | df_ref_chain_delete_du_chain (df_ref ref) |
4d779342 | 836 | { |
b512946c RS |
837 | for (; ref; ref = DF_REF_NEXT_LOC (ref)) |
838 | /* CHAIN is allocated by DF_CHAIN. So make sure to | |
839 | pass df_scan instance for the problem. */ | |
840 | if (DF_REF_CHAIN (ref)) | |
841 | df_chain_unlink (ref); | |
6fb5fa3c | 842 | } |
23249ac4 | 843 | |
4d779342 | 844 | |
6fb5fa3c DB |
845 | /* Delete all refs in the ref chain. */ |
846 | ||
847 | static void | |
b512946c | 848 | df_ref_chain_delete (df_ref ref) |
6fb5fa3c | 849 | { |
b512946c RS |
850 | df_ref next; |
851 | for (; ref; ref = next) | |
6fb5fa3c | 852 | { |
b512946c RS |
853 | next = DF_REF_NEXT_LOC (ref); |
854 | df_reg_chain_unlink (ref); | |
6fb5fa3c | 855 | } |
6fb5fa3c DB |
856 | } |
857 | ||
858 | ||
859 | /* Delete the hardreg chain. */ | |
860 | ||
861 | static void | |
b512946c | 862 | df_mw_hardreg_chain_delete (struct df_mw_hardreg *hardregs) |
6fb5fa3c | 863 | { |
b512946c RS |
864 | struct df_scan_problem_data *problem_data |
865 | = (struct df_scan_problem_data *) df_scan->problem_data; | |
866 | df_mw_hardreg *next; | |
6fb5fa3c | 867 | |
b512946c | 868 | for (; hardregs; hardregs = next) |
6fb5fa3c | 869 | { |
b512946c | 870 | next = DF_MWS_NEXT (hardregs); |
e956943e | 871 | problem_data->mw_reg_pool->remove (hardregs); |
6fb5fa3c DB |
872 | } |
873 | } | |
874 | ||
762613be RS |
875 | /* Remove the contents of INSN_INFO (but don't free INSN_INFO itself). */ |
876 | ||
877 | static void | |
878 | df_insn_info_free_fields (df_insn_info *insn_info) | |
879 | { | |
880 | /* In general, notes do not have the insn_info fields | |
881 | initialized. However, combine deletes insns by changing them | |
882 | to notes. How clever. So we cannot just check if it is a | |
883 | valid insn before short circuiting this code, we need to see | |
884 | if we actually initialized it. */ | |
885 | df_mw_hardreg_chain_delete (insn_info->mw_hardregs); | |
886 | ||
887 | if (df_chain) | |
888 | { | |
889 | df_ref_chain_delete_du_chain (insn_info->defs); | |
890 | df_ref_chain_delete_du_chain (insn_info->uses); | |
891 | df_ref_chain_delete_du_chain (insn_info->eq_uses); | |
892 | } | |
893 | ||
894 | df_ref_chain_delete (insn_info->defs); | |
895 | df_ref_chain_delete (insn_info->uses); | |
896 | df_ref_chain_delete (insn_info->eq_uses); | |
897 | } | |
6fb5fa3c | 898 | |
80eb8028 SB |
899 | /* Delete all of the refs information from the insn with UID. |
900 | Internal helper for df_insn_delete, df_insn_rescan, and other | |
901 | df-scan routines that don't have to work in deferred mode | |
902 | and do not have to mark basic blocks for re-processing. */ | |
6fb5fa3c | 903 | |
80eb8028 SB |
904 | static void |
905 | df_insn_info_delete (unsigned int uid) | |
6fb5fa3c | 906 | { |
80eb8028 | 907 | struct df_insn_info *insn_info = DF_INSN_UID_SAFE_GET (uid); |
6fb5fa3c | 908 | |
a7e3698d JH |
909 | bitmap_clear_bit (&df->insns_to_delete, uid); |
910 | bitmap_clear_bit (&df->insns_to_rescan, uid); | |
911 | bitmap_clear_bit (&df->insns_to_notes_rescan, uid); | |
6fb5fa3c DB |
912 | if (insn_info) |
913 | { | |
b8698a0f | 914 | struct df_scan_problem_data *problem_data |
6fb5fa3c DB |
915 | = (struct df_scan_problem_data *) df_scan->problem_data; |
916 | ||
762613be | 917 | df_insn_info_free_fields (insn_info); |
e956943e | 918 | problem_data->insn_pool->remove (insn_info); |
6fb5fa3c | 919 | DF_INSN_UID_SET (uid, NULL); |
4d779342 DB |
920 | } |
921 | } | |
922 | ||
80eb8028 SB |
923 | /* Delete all of the refs information from INSN, either right now |
924 | or marked for later in deferred mode. */ | |
925 | ||
926 | void | |
b2908ba6 | 927 | df_insn_delete (rtx_insn *insn) |
80eb8028 SB |
928 | { |
929 | unsigned int uid; | |
930 | basic_block bb; | |
931 | ||
932 | gcc_checking_assert (INSN_P (insn)); | |
933 | ||
934 | if (!df) | |
935 | return; | |
936 | ||
937 | uid = INSN_UID (insn); | |
938 | bb = BLOCK_FOR_INSN (insn); | |
939 | ||
940 | /* ??? bb can be NULL after pass_free_cfg. At that point, DF should | |
941 | not exist anymore (as mentioned in df-core.c: "The only requirement | |
942 | [for DF] is that there be a correct control flow graph." Clearly | |
943 | that isn't the case after pass_free_cfg. But DF is freed much later | |
944 | because some back-ends want to use DF info even though the CFG is | |
945 | already gone. It's not clear to me whether that is safe, actually. | |
946 | In any case, we expect BB to be non-NULL at least up to register | |
947 | allocation, so disallow a non-NULL BB up to there. Not perfect | |
948 | but better than nothing... */ | |
67a8d719 | 949 | gcc_checking_assert (bb != NULL || reload_completed); |
80eb8028 SB |
950 | |
951 | df_grow_bb_info (df_scan); | |
952 | df_grow_reg_info (); | |
953 | ||
954 | /* The block must be marked as dirty now, rather than later as in | |
955 | df_insn_rescan and df_notes_rescan because it may not be there at | |
956 | rescanning time and the mark would blow up. | |
957 | DEBUG_INSNs do not make a block's data flow solution dirty (at | |
958 | worst the LUIDs are no longer contiguous). */ | |
959 | if (bb != NULL && NONDEBUG_INSN_P (insn)) | |
960 | df_set_bb_dirty (bb); | |
961 | ||
962 | /* The client has deferred rescanning. */ | |
963 | if (df->changeable_flags & DF_DEFER_INSN_RESCAN) | |
964 | { | |
965 | struct df_insn_info *insn_info = DF_INSN_UID_SAFE_GET (uid); | |
966 | if (insn_info) | |
967 | { | |
968 | bitmap_clear_bit (&df->insns_to_rescan, uid); | |
969 | bitmap_clear_bit (&df->insns_to_notes_rescan, uid); | |
970 | bitmap_set_bit (&df->insns_to_delete, uid); | |
971 | } | |
972 | if (dump_file) | |
973 | fprintf (dump_file, "deferring deletion of insn with uid = %d.\n", uid); | |
974 | return; | |
975 | } | |
976 | ||
977 | if (dump_file) | |
978 | fprintf (dump_file, "deleting insn with uid = %d.\n", uid); | |
979 | ||
980 | df_insn_info_delete (uid); | |
981 | } | |
982 | ||
4d779342 | 983 | |
6fb5fa3c | 984 | /* Free all of the refs and the mw_hardregs in COLLECTION_REC. */ |
3b8266e2 | 985 | |
6fb5fa3c DB |
986 | static void |
987 | df_free_collection_rec (struct df_collection_rec *collection_rec) | |
3b8266e2 | 988 | { |
c2569604 | 989 | unsigned int ix; |
b8698a0f | 990 | struct df_scan_problem_data *problem_data |
6fb5fa3c | 991 | = (struct df_scan_problem_data *) df_scan->problem_data; |
c2569604 ILT |
992 | df_ref ref; |
993 | struct df_mw_hardreg *mw; | |
994 | ||
9771b263 | 995 | FOR_EACH_VEC_ELT (collection_rec->def_vec, ix, ref) |
c2569604 | 996 | df_free_ref (ref); |
9771b263 | 997 | FOR_EACH_VEC_ELT (collection_rec->use_vec, ix, ref) |
c2569604 | 998 | df_free_ref (ref); |
9771b263 | 999 | FOR_EACH_VEC_ELT (collection_rec->eq_use_vec, ix, ref) |
c2569604 | 1000 | df_free_ref (ref); |
9771b263 | 1001 | FOR_EACH_VEC_ELT (collection_rec->mw_vec, ix, mw) |
e956943e | 1002 | problem_data->mw_reg_pool->remove (mw); |
c2569604 | 1003 | |
9771b263 DN |
1004 | collection_rec->def_vec.release (); |
1005 | collection_rec->use_vec.release (); | |
1006 | collection_rec->eq_use_vec.release (); | |
1007 | collection_rec->mw_vec.release (); | |
6fb5fa3c | 1008 | } |
3b8266e2 | 1009 | |
6fb5fa3c DB |
1010 | /* Rescan INSN. Return TRUE if the rescanning produced any changes. */ |
1011 | ||
b8698a0f | 1012 | bool |
b2908ba6 | 1013 | df_insn_rescan (rtx_insn *insn) |
6fb5fa3c DB |
1014 | { |
1015 | unsigned int uid = INSN_UID (insn); | |
1016 | struct df_insn_info *insn_info = NULL; | |
1017 | basic_block bb = BLOCK_FOR_INSN (insn); | |
1018 | struct df_collection_rec collection_rec; | |
6fb5fa3c DB |
1019 | |
1020 | if ((!df) || (!INSN_P (insn))) | |
1021 | return false; | |
1022 | ||
1023 | if (!bb) | |
3b8266e2 | 1024 | { |
6fb5fa3c DB |
1025 | if (dump_file) |
1026 | fprintf (dump_file, "no bb for insn with uid = %d.\n", uid); | |
1027 | return false; | |
1028 | } | |
1029 | ||
1030 | /* The client has disabled rescanning and plans to do it itself. */ | |
1031 | if (df->changeable_flags & DF_NO_INSN_RESCAN) | |
1032 | return false; | |
1033 | ||
1034 | df_grow_bb_info (df_scan); | |
1035 | df_grow_reg_info (); | |
1036 | ||
1037 | insn_info = DF_INSN_UID_SAFE_GET (uid); | |
1038 | ||
0a41f3b2 | 1039 | /* The client has deferred rescanning. */ |
6fb5fa3c DB |
1040 | if (df->changeable_flags & DF_DEFER_INSN_RESCAN) |
1041 | { | |
1042 | if (!insn_info) | |
1043 | { | |
1044 | insn_info = df_insn_create_insn_record (insn); | |
b512946c RS |
1045 | insn_info->defs = 0; |
1046 | insn_info->uses = 0; | |
1047 | insn_info->eq_uses = 0; | |
1048 | insn_info->mw_hardregs = 0; | |
6fb5fa3c DB |
1049 | } |
1050 | if (dump_file) | |
b718216c | 1051 | fprintf (dump_file, "deferring rescan insn with uid = %d.\n", uid); |
b8698a0f | 1052 | |
a7e3698d JH |
1053 | bitmap_clear_bit (&df->insns_to_delete, uid); |
1054 | bitmap_clear_bit (&df->insns_to_notes_rescan, uid); | |
1055 | bitmap_set_bit (&df->insns_to_rescan, INSN_UID (insn)); | |
6fb5fa3c DB |
1056 | return false; |
1057 | } | |
1058 | ||
a7e3698d JH |
1059 | bitmap_clear_bit (&df->insns_to_delete, uid); |
1060 | bitmap_clear_bit (&df->insns_to_rescan, uid); | |
1061 | bitmap_clear_bit (&df->insns_to_notes_rescan, uid); | |
6fb5fa3c DB |
1062 | if (insn_info) |
1063 | { | |
4a81774c | 1064 | int luid; |
6fb5fa3c DB |
1065 | bool the_same = df_insn_refs_verify (&collection_rec, bb, insn, false); |
1066 | /* If there's no change, return false. */ | |
1067 | if (the_same) | |
3b8266e2 | 1068 | { |
6fb5fa3c DB |
1069 | df_free_collection_rec (&collection_rec); |
1070 | if (dump_file) | |
1071 | fprintf (dump_file, "verify found no changes in insn with uid = %d.\n", uid); | |
1072 | return false; | |
3b8266e2 | 1073 | } |
6fb5fa3c DB |
1074 | if (dump_file) |
1075 | fprintf (dump_file, "rescanning insn with uid = %d.\n", uid); | |
1076 | ||
4a81774c SB |
1077 | /* There's change - we need to delete the existing info. |
1078 | Since the insn isn't moved, we can salvage its LUID. */ | |
1079 | luid = DF_INSN_LUID (insn); | |
762613be RS |
1080 | df_insn_info_free_fields (insn_info); |
1081 | df_insn_info_init_fields (insn_info, insn); | |
4a81774c | 1082 | DF_INSN_LUID (insn) = luid; |
6fb5fa3c DB |
1083 | } |
1084 | else | |
1085 | { | |
50e94c7e SB |
1086 | struct df_insn_info *insn_info = df_insn_create_insn_record (insn); |
1087 | df_insn_refs_collect (&collection_rec, bb, insn_info); | |
6fb5fa3c DB |
1088 | if (dump_file) |
1089 | fprintf (dump_file, "scanning new insn with uid = %d.\n", uid); | |
1090 | } | |
1091 | ||
ff4c81cc | 1092 | df_refs_add_to_chains (&collection_rec, bb, insn, copy_all); |
f9aeaebf | 1093 | if (!DEBUG_INSN_P (insn)) |
c23cd1d6 | 1094 | df_set_bb_dirty (bb); |
c2569604 | 1095 | |
6fb5fa3c DB |
1096 | return true; |
1097 | } | |
1098 | ||
b5b8b0ac AO |
1099 | /* Same as df_insn_rescan, but don't mark the basic block as |
1100 | dirty. */ | |
1101 | ||
1102 | bool | |
b2908ba6 | 1103 | df_insn_rescan_debug_internal (rtx_insn *insn) |
b5b8b0ac AO |
1104 | { |
1105 | unsigned int uid = INSN_UID (insn); | |
1106 | struct df_insn_info *insn_info; | |
1107 | ||
a099f7d4 RG |
1108 | gcc_assert (DEBUG_INSN_P (insn) |
1109 | && VAR_LOC_UNKNOWN_P (INSN_VAR_LOCATION_LOC (insn))); | |
b5b8b0ac AO |
1110 | |
1111 | if (!df) | |
1112 | return false; | |
1113 | ||
1114 | insn_info = DF_INSN_UID_SAFE_GET (INSN_UID (insn)); | |
1115 | if (!insn_info) | |
1116 | return false; | |
1117 | ||
1118 | if (dump_file) | |
1119 | fprintf (dump_file, "deleting debug_insn with uid = %d.\n", uid); | |
1120 | ||
a7e3698d JH |
1121 | bitmap_clear_bit (&df->insns_to_delete, uid); |
1122 | bitmap_clear_bit (&df->insns_to_rescan, uid); | |
1123 | bitmap_clear_bit (&df->insns_to_notes_rescan, uid); | |
b5b8b0ac | 1124 | |
b512946c RS |
1125 | if (insn_info->defs == 0 |
1126 | && insn_info->uses == 0 | |
1127 | && insn_info->eq_uses == 0 | |
1128 | && insn_info->mw_hardregs == 0) | |
b5b8b0ac AO |
1129 | return false; |
1130 | ||
1131 | df_mw_hardreg_chain_delete (insn_info->mw_hardregs); | |
1132 | ||
1133 | if (df_chain) | |
1134 | { | |
1135 | df_ref_chain_delete_du_chain (insn_info->defs); | |
1136 | df_ref_chain_delete_du_chain (insn_info->uses); | |
1137 | df_ref_chain_delete_du_chain (insn_info->eq_uses); | |
1138 | } | |
1139 | ||
1140 | df_ref_chain_delete (insn_info->defs); | |
1141 | df_ref_chain_delete (insn_info->uses); | |
1142 | df_ref_chain_delete (insn_info->eq_uses); | |
1143 | ||
b512946c RS |
1144 | insn_info->defs = 0; |
1145 | insn_info->uses = 0; | |
1146 | insn_info->eq_uses = 0; | |
1147 | insn_info->mw_hardregs = 0; | |
b5b8b0ac AO |
1148 | |
1149 | return true; | |
1150 | } | |
1151 | ||
6fb5fa3c DB |
1152 | |
1153 | /* Rescan all of the insns in the function. Note that the artificial | |
80eb8028 | 1154 | uses and defs are not touched. This function will destroy def-use |
6fb5fa3c DB |
1155 | or use-def chains. */ |
1156 | ||
1157 | void | |
1158 | df_insn_rescan_all (void) | |
1159 | { | |
1160 | bool no_insn_rescan = false; | |
1161 | bool defer_insn_rescan = false; | |
1162 | basic_block bb; | |
1163 | bitmap_iterator bi; | |
1164 | unsigned int uid; | |
b8698a0f | 1165 | |
6fb5fa3c DB |
1166 | if (df->changeable_flags & DF_NO_INSN_RESCAN) |
1167 | { | |
1168 | df_clear_flags (DF_NO_INSN_RESCAN); | |
1169 | no_insn_rescan = true; | |
3b8266e2 | 1170 | } |
b8698a0f | 1171 | |
6fb5fa3c | 1172 | if (df->changeable_flags & DF_DEFER_INSN_RESCAN) |
3b8266e2 | 1173 | { |
6fb5fa3c DB |
1174 | df_clear_flags (DF_DEFER_INSN_RESCAN); |
1175 | defer_insn_rescan = true; | |
1176 | } | |
1177 | ||
d648b5ff TS |
1178 | auto_bitmap tmp (&df_bitmap_obstack); |
1179 | bitmap_copy (tmp, &df->insns_to_delete); | |
1180 | EXECUTE_IF_SET_IN_BITMAP (tmp, 0, uid, bi) | |
6fb5fa3c DB |
1181 | { |
1182 | struct df_insn_info *insn_info = DF_INSN_UID_SAFE_GET (uid); | |
1183 | if (insn_info) | |
80eb8028 | 1184 | df_insn_info_delete (uid); |
3b8266e2 | 1185 | } |
6fb5fa3c | 1186 | |
a7e3698d JH |
1187 | bitmap_clear (&df->insns_to_delete); |
1188 | bitmap_clear (&df->insns_to_rescan); | |
1189 | bitmap_clear (&df->insns_to_notes_rescan); | |
6fb5fa3c | 1190 | |
11cd3bed | 1191 | FOR_EACH_BB_FN (bb, cfun) |
6fb5fa3c | 1192 | { |
dd3eed93 | 1193 | rtx_insn *insn; |
6fb5fa3c DB |
1194 | FOR_BB_INSNS (bb, insn) |
1195 | { | |
1196 | df_insn_rescan (insn); | |
1197 | } | |
1198 | } | |
1199 | ||
1200 | if (no_insn_rescan) | |
1201 | df_set_flags (DF_NO_INSN_RESCAN); | |
1202 | if (defer_insn_rescan) | |
1203 | df_set_flags (DF_DEFER_INSN_RESCAN); | |
3b8266e2 KZ |
1204 | } |
1205 | ||
1206 | ||
0a41f3b2 | 1207 | /* Process all of the deferred rescans or deletions. */ |
4d779342 | 1208 | |
6fb5fa3c DB |
1209 | void |
1210 | df_process_deferred_rescans (void) | |
4d779342 | 1211 | { |
6fb5fa3c DB |
1212 | bool no_insn_rescan = false; |
1213 | bool defer_insn_rescan = false; | |
4d779342 | 1214 | bitmap_iterator bi; |
6fb5fa3c | 1215 | unsigned int uid; |
b8698a0f | 1216 | |
6fb5fa3c DB |
1217 | if (df->changeable_flags & DF_NO_INSN_RESCAN) |
1218 | { | |
1219 | df_clear_flags (DF_NO_INSN_RESCAN); | |
1220 | no_insn_rescan = true; | |
1221 | } | |
b8698a0f | 1222 | |
6fb5fa3c DB |
1223 | if (df->changeable_flags & DF_DEFER_INSN_RESCAN) |
1224 | { | |
1225 | df_clear_flags (DF_DEFER_INSN_RESCAN); | |
1226 | defer_insn_rescan = true; | |
1227 | } | |
1228 | ||
1229 | if (dump_file) | |
0a41f3b2 | 1230 | fprintf (dump_file, "starting the processing of deferred insns\n"); |
6fb5fa3c | 1231 | |
d648b5ff TS |
1232 | auto_bitmap tmp (&df_bitmap_obstack); |
1233 | bitmap_copy (tmp, &df->insns_to_delete); | |
1234 | EXECUTE_IF_SET_IN_BITMAP (tmp, 0, uid, bi) | |
6fb5fa3c DB |
1235 | { |
1236 | struct df_insn_info *insn_info = DF_INSN_UID_SAFE_GET (uid); | |
1237 | if (insn_info) | |
80eb8028 | 1238 | df_insn_info_delete (uid); |
6fb5fa3c DB |
1239 | } |
1240 | ||
d648b5ff TS |
1241 | bitmap_copy (tmp, &df->insns_to_rescan); |
1242 | EXECUTE_IF_SET_IN_BITMAP (tmp, 0, uid, bi) | |
6fb5fa3c DB |
1243 | { |
1244 | struct df_insn_info *insn_info = DF_INSN_UID_SAFE_GET (uid); | |
1245 | if (insn_info) | |
1246 | df_insn_rescan (insn_info->insn); | |
1247 | } | |
1248 | ||
d648b5ff TS |
1249 | bitmap_copy (tmp, &df->insns_to_notes_rescan); |
1250 | EXECUTE_IF_SET_IN_BITMAP (tmp, 0, uid, bi) | |
6fb5fa3c DB |
1251 | { |
1252 | struct df_insn_info *insn_info = DF_INSN_UID_SAFE_GET (uid); | |
1253 | if (insn_info) | |
1254 | df_notes_rescan (insn_info->insn); | |
1255 | } | |
1256 | ||
1257 | if (dump_file) | |
0a41f3b2 | 1258 | fprintf (dump_file, "ending the processing of deferred insns\n"); |
6fb5fa3c | 1259 | |
a7e3698d JH |
1260 | bitmap_clear (&df->insns_to_delete); |
1261 | bitmap_clear (&df->insns_to_rescan); | |
1262 | bitmap_clear (&df->insns_to_notes_rescan); | |
6fb5fa3c DB |
1263 | |
1264 | if (no_insn_rescan) | |
1265 | df_set_flags (DF_NO_INSN_RESCAN); | |
1266 | if (defer_insn_rescan) | |
1267 | df_set_flags (DF_DEFER_INSN_RESCAN); | |
1268 | ||
1269 | /* If someone changed regs_ever_live during this pass, fix up the | |
1270 | entry and exit blocks. */ | |
1271 | if (df->redo_entry_and_exit) | |
1272 | { | |
1273 | df_update_entry_exit_and_calls (); | |
1274 | df->redo_entry_and_exit = false; | |
1275 | } | |
1276 | } | |
1277 | ||
4d779342 | 1278 | |
6fb5fa3c DB |
1279 | /* Count the number of refs. Include the defs if INCLUDE_DEFS. Include |
1280 | the uses if INCLUDE_USES. Include the eq_uses if | |
1281 | INCLUDE_EQ_USES. */ | |
1282 | ||
1283 | static unsigned int | |
b8698a0f | 1284 | df_count_refs (bool include_defs, bool include_uses, |
6fb5fa3c DB |
1285 | bool include_eq_uses) |
1286 | { | |
1287 | unsigned int regno; | |
1288 | int size = 0; | |
1289 | unsigned int m = df->regs_inited; | |
b8698a0f | 1290 | |
6fb5fa3c | 1291 | for (regno = 0; regno < m; regno++) |
4d779342 | 1292 | { |
6fb5fa3c DB |
1293 | if (include_defs) |
1294 | size += DF_REG_DEF_COUNT (regno); | |
1295 | if (include_uses) | |
1296 | size += DF_REG_USE_COUNT (regno); | |
1297 | if (include_eq_uses) | |
1298 | size += DF_REG_EQ_USE_COUNT (regno); | |
4d779342 | 1299 | } |
6fb5fa3c | 1300 | return size; |
4d779342 DB |
1301 | } |
1302 | ||
1303 | ||
1304 | /* Take build ref table for either the uses or defs from the reg-use | |
6fb5fa3c DB |
1305 | or reg-def chains. This version processes the refs in reg order |
1306 | which is likely to be best if processing the whole function. */ | |
4d779342 | 1307 | |
b8698a0f | 1308 | static void |
6fb5fa3c | 1309 | df_reorganize_refs_by_reg_by_reg (struct df_ref_info *ref_info, |
b8698a0f L |
1310 | bool include_defs, |
1311 | bool include_uses, | |
6fb5fa3c | 1312 | bool include_eq_uses) |
4d779342 | 1313 | { |
6fb5fa3c | 1314 | unsigned int m = df->regs_inited; |
4d779342 DB |
1315 | unsigned int regno; |
1316 | unsigned int offset = 0; | |
6fb5fa3c | 1317 | unsigned int start; |
4d779342 | 1318 | |
6fb5fa3c DB |
1319 | if (df->changeable_flags & DF_NO_HARD_REGS) |
1320 | { | |
1321 | start = FIRST_PSEUDO_REGISTER; | |
1322 | memset (ref_info->begin, 0, sizeof (int) * FIRST_PSEUDO_REGISTER); | |
1323 | memset (ref_info->count, 0, sizeof (int) * FIRST_PSEUDO_REGISTER); | |
4d779342 | 1324 | } |
6fb5fa3c DB |
1325 | else |
1326 | start = 0; | |
4d779342 | 1327 | |
b8698a0f | 1328 | ref_info->total_size |
6fb5fa3c DB |
1329 | = df_count_refs (include_defs, include_uses, include_eq_uses); |
1330 | ||
1331 | df_check_and_grow_ref_info (ref_info, 1); | |
1332 | ||
1333 | for (regno = start; regno < m; regno++) | |
4d779342 | 1334 | { |
4d779342 | 1335 | int count = 0; |
6fb5fa3c DB |
1336 | ref_info->begin[regno] = offset; |
1337 | if (include_defs) | |
1338 | { | |
57512f53 | 1339 | df_ref ref = DF_REG_DEF_CHAIN (regno); |
b8698a0f | 1340 | while (ref) |
6fb5fa3c DB |
1341 | { |
1342 | ref_info->refs[offset] = ref; | |
1343 | DF_REF_ID (ref) = offset++; | |
1344 | count++; | |
1345 | ref = DF_REF_NEXT_REG (ref); | |
7a40b8b1 | 1346 | gcc_checking_assert (offset < ref_info->refs_size); |
6fb5fa3c DB |
1347 | } |
1348 | } | |
1349 | if (include_uses) | |
4d779342 | 1350 | { |
57512f53 | 1351 | df_ref ref = DF_REG_USE_CHAIN (regno); |
b8698a0f | 1352 | while (ref) |
4d779342 DB |
1353 | { |
1354 | ref_info->refs[offset] = ref; | |
1355 | DF_REF_ID (ref) = offset++; | |
6fb5fa3c | 1356 | count++; |
4d779342 | 1357 | ref = DF_REF_NEXT_REG (ref); |
7a40b8b1 | 1358 | gcc_checking_assert (offset < ref_info->refs_size); |
6fb5fa3c DB |
1359 | } |
1360 | } | |
1361 | if (include_eq_uses) | |
1362 | { | |
57512f53 | 1363 | df_ref ref = DF_REG_EQ_USE_CHAIN (regno); |
b8698a0f | 1364 | while (ref) |
6fb5fa3c DB |
1365 | { |
1366 | ref_info->refs[offset] = ref; | |
1367 | DF_REF_ID (ref) = offset++; | |
4d779342 | 1368 | count++; |
6fb5fa3c | 1369 | ref = DF_REF_NEXT_REG (ref); |
7a40b8b1 | 1370 | gcc_checking_assert (offset < ref_info->refs_size); |
4d779342 | 1371 | } |
4d779342 | 1372 | } |
6fb5fa3c | 1373 | ref_info->count[regno] = count; |
4d779342 | 1374 | } |
b8698a0f | 1375 | |
4d779342 DB |
1376 | /* The bitmap size is not decremented when refs are deleted. So |
1377 | reset it now that we have squished out all of the empty | |
1378 | slots. */ | |
6fb5fa3c | 1379 | ref_info->table_size = offset; |
4d779342 DB |
1380 | } |
1381 | ||
4d779342 | 1382 | |
6fb5fa3c DB |
1383 | /* Take build ref table for either the uses or defs from the reg-use |
1384 | or reg-def chains. This version processes the refs in insn order | |
1385 | which is likely to be best if processing some segment of the | |
1386 | function. */ | |
4d779342 | 1387 | |
b8698a0f | 1388 | static void |
6fb5fa3c | 1389 | df_reorganize_refs_by_reg_by_insn (struct df_ref_info *ref_info, |
b8698a0f L |
1390 | bool include_defs, |
1391 | bool include_uses, | |
6fb5fa3c | 1392 | bool include_eq_uses) |
4d779342 | 1393 | { |
6fb5fa3c DB |
1394 | bitmap_iterator bi; |
1395 | unsigned int bb_index; | |
1396 | unsigned int m = df->regs_inited; | |
1397 | unsigned int offset = 0; | |
1398 | unsigned int r; | |
b8698a0f | 1399 | unsigned int start |
6fb5fa3c | 1400 | = (df->changeable_flags & DF_NO_HARD_REGS) ? FIRST_PSEUDO_REGISTER : 0; |
4d779342 | 1401 | |
6fb5fa3c DB |
1402 | memset (ref_info->begin, 0, sizeof (int) * df->regs_inited); |
1403 | memset (ref_info->count, 0, sizeof (int) * df->regs_inited); | |
1404 | ||
1405 | ref_info->total_size = df_count_refs (include_defs, include_uses, include_eq_uses); | |
1406 | df_check_and_grow_ref_info (ref_info, 1); | |
4d779342 | 1407 | |
6fb5fa3c | 1408 | EXECUTE_IF_SET_IN_BITMAP (df->blocks_to_analyze, 0, bb_index, bi) |
4d779342 | 1409 | { |
06e28de2 | 1410 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bb_index); |
dd3eed93 | 1411 | rtx_insn *insn; |
bfac633a | 1412 | df_ref def, use; |
6fb5fa3c DB |
1413 | |
1414 | if (include_defs) | |
292321a5 | 1415 | FOR_EACH_ARTIFICIAL_DEF (def, bb_index) |
23249ac4 | 1416 | { |
292321a5 | 1417 | unsigned int regno = DF_REF_REGNO (def); |
6fb5fa3c | 1418 | ref_info->count[regno]++; |
23249ac4 | 1419 | } |
6fb5fa3c | 1420 | if (include_uses) |
292321a5 | 1421 | FOR_EACH_ARTIFICIAL_USE (use, bb_index) |
23249ac4 | 1422 | { |
292321a5 | 1423 | unsigned int regno = DF_REF_REGNO (use); |
6fb5fa3c | 1424 | ref_info->count[regno]++; |
23249ac4 | 1425 | } |
4d779342 | 1426 | |
6fb5fa3c DB |
1427 | FOR_BB_INSNS (bb, insn) |
1428 | { | |
1429 | if (INSN_P (insn)) | |
1430 | { | |
bfac633a | 1431 | struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn); |
b8698a0f | 1432 | |
6fb5fa3c | 1433 | if (include_defs) |
bfac633a | 1434 | FOR_EACH_INSN_INFO_DEF (def, insn_info) |
6fb5fa3c | 1435 | { |
bfac633a | 1436 | unsigned int regno = DF_REF_REGNO (def); |
6fb5fa3c DB |
1437 | ref_info->count[regno]++; |
1438 | } | |
1439 | if (include_uses) | |
bfac633a | 1440 | FOR_EACH_INSN_INFO_USE (use, insn_info) |
6fb5fa3c | 1441 | { |
bfac633a | 1442 | unsigned int regno = DF_REF_REGNO (use); |
6fb5fa3c DB |
1443 | ref_info->count[regno]++; |
1444 | } | |
1445 | if (include_eq_uses) | |
bfac633a | 1446 | FOR_EACH_INSN_INFO_EQ_USE (use, insn_info) |
6fb5fa3c | 1447 | { |
bfac633a | 1448 | unsigned int regno = DF_REF_REGNO (use); |
6fb5fa3c DB |
1449 | ref_info->count[regno]++; |
1450 | } | |
1451 | } | |
1452 | } | |
1453 | } | |
1454 | ||
1455 | for (r = start; r < m; r++) | |
1456 | { | |
1457 | ref_info->begin[r] = offset; | |
1458 | offset += ref_info->count[r]; | |
1459 | ref_info->count[r] = 0; | |
1460 | } | |
b8698a0f | 1461 | |
6fb5fa3c DB |
1462 | EXECUTE_IF_SET_IN_BITMAP (df->blocks_to_analyze, 0, bb_index, bi) |
1463 | { | |
06e28de2 | 1464 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bb_index); |
dd3eed93 | 1465 | rtx_insn *insn; |
bfac633a | 1466 | df_ref def, use; |
6fb5fa3c DB |
1467 | |
1468 | if (include_defs) | |
292321a5 | 1469 | FOR_EACH_ARTIFICIAL_DEF (def, bb_index) |
23249ac4 | 1470 | { |
292321a5 | 1471 | unsigned int regno = DF_REF_REGNO (def); |
6fb5fa3c | 1472 | if (regno >= start) |
23249ac4 | 1473 | { |
6fb5fa3c DB |
1474 | unsigned int id |
1475 | = ref_info->begin[regno] + ref_info->count[regno]++; | |
292321a5 RS |
1476 | DF_REF_ID (def) = id; |
1477 | ref_info->refs[id] = def; | |
23249ac4 | 1478 | } |
23249ac4 | 1479 | } |
6fb5fa3c | 1480 | if (include_uses) |
292321a5 | 1481 | FOR_EACH_ARTIFICIAL_USE (use, bb_index) |
23249ac4 | 1482 | { |
292321a5 | 1483 | unsigned int regno = DF_REF_REGNO (def); |
6fb5fa3c DB |
1484 | if (regno >= start) |
1485 | { | |
1486 | unsigned int id | |
1487 | = ref_info->begin[regno] + ref_info->count[regno]++; | |
292321a5 RS |
1488 | DF_REF_ID (use) = id; |
1489 | ref_info->refs[id] = use; | |
6fb5fa3c | 1490 | } |
23249ac4 | 1491 | } |
6fb5fa3c DB |
1492 | |
1493 | FOR_BB_INSNS (bb, insn) | |
1494 | { | |
1495 | if (INSN_P (insn)) | |
1496 | { | |
bfac633a | 1497 | struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn); |
b8698a0f | 1498 | |
6fb5fa3c | 1499 | if (include_defs) |
bfac633a | 1500 | FOR_EACH_INSN_INFO_DEF (def, insn_info) |
6fb5fa3c | 1501 | { |
bfac633a | 1502 | unsigned int regno = DF_REF_REGNO (def); |
6fb5fa3c DB |
1503 | if (regno >= start) |
1504 | { | |
1505 | unsigned int id | |
1506 | = ref_info->begin[regno] + ref_info->count[regno]++; | |
bfac633a RS |
1507 | DF_REF_ID (def) = id; |
1508 | ref_info->refs[id] = def; | |
6fb5fa3c DB |
1509 | } |
1510 | } | |
1511 | if (include_uses) | |
bfac633a | 1512 | FOR_EACH_INSN_INFO_USE (use, insn_info) |
6fb5fa3c | 1513 | { |
bfac633a | 1514 | unsigned int regno = DF_REF_REGNO (use); |
6fb5fa3c DB |
1515 | if (regno >= start) |
1516 | { | |
1517 | unsigned int id | |
1518 | = ref_info->begin[regno] + ref_info->count[regno]++; | |
bfac633a RS |
1519 | DF_REF_ID (use) = id; |
1520 | ref_info->refs[id] = use; | |
6fb5fa3c DB |
1521 | } |
1522 | } | |
1523 | if (include_eq_uses) | |
bfac633a | 1524 | FOR_EACH_INSN_INFO_EQ_USE (use, insn_info) |
6fb5fa3c | 1525 | { |
bfac633a | 1526 | unsigned int regno = DF_REF_REGNO (use); |
6fb5fa3c DB |
1527 | if (regno >= start) |
1528 | { | |
1529 | unsigned int id | |
1530 | = ref_info->begin[regno] + ref_info->count[regno]++; | |
bfac633a RS |
1531 | DF_REF_ID (use) = id; |
1532 | ref_info->refs[id] = use; | |
6fb5fa3c DB |
1533 | } |
1534 | } | |
1535 | } | |
1536 | } | |
1537 | } | |
1538 | ||
1539 | /* The bitmap size is not decremented when refs are deleted. So | |
1540 | reset it now that we have squished out all of the empty | |
1541 | slots. */ | |
1542 | ||
1543 | ref_info->table_size = offset; | |
1544 | } | |
1545 | ||
1546 | /* Take build ref table for either the uses or defs from the reg-use | |
1547 | or reg-def chains. */ | |
1548 | ||
b8698a0f | 1549 | static void |
6fb5fa3c | 1550 | df_reorganize_refs_by_reg (struct df_ref_info *ref_info, |
b8698a0f L |
1551 | bool include_defs, |
1552 | bool include_uses, | |
6fb5fa3c DB |
1553 | bool include_eq_uses) |
1554 | { | |
1555 | if (df->analyze_subset) | |
b8698a0f | 1556 | df_reorganize_refs_by_reg_by_insn (ref_info, include_defs, |
6fb5fa3c DB |
1557 | include_uses, include_eq_uses); |
1558 | else | |
b8698a0f | 1559 | df_reorganize_refs_by_reg_by_reg (ref_info, include_defs, |
6fb5fa3c DB |
1560 | include_uses, include_eq_uses); |
1561 | } | |
1562 | ||
1563 | ||
1564 | /* Add the refs in REF_VEC to the table in REF_INFO starting at OFFSET. */ | |
b8698a0f L |
1565 | static unsigned int |
1566 | df_add_refs_to_table (unsigned int offset, | |
1567 | struct df_ref_info *ref_info, | |
b512946c | 1568 | df_ref ref) |
6fb5fa3c | 1569 | { |
b512946c RS |
1570 | for (; ref; ref = DF_REF_NEXT_LOC (ref)) |
1571 | if (!(df->changeable_flags & DF_NO_HARD_REGS) | |
1572 | || (DF_REF_REGNO (ref) >= FIRST_PSEUDO_REGISTER)) | |
1573 | { | |
1574 | ref_info->refs[offset] = ref; | |
1575 | DF_REF_ID (ref) = offset++; | |
1576 | } | |
6fb5fa3c DB |
1577 | return offset; |
1578 | } | |
1579 | ||
1580 | ||
1581 | /* Count the number of refs in all of the insns of BB. Include the | |
1582 | defs if INCLUDE_DEFS. Include the uses if INCLUDE_USES. Include the | |
1583 | eq_uses if INCLUDE_EQ_USES. */ | |
1584 | ||
1585 | static unsigned int | |
b8698a0f | 1586 | df_reorganize_refs_by_insn_bb (basic_block bb, unsigned int offset, |
6fb5fa3c | 1587 | struct df_ref_info *ref_info, |
b8698a0f | 1588 | bool include_defs, bool include_uses, |
6fb5fa3c DB |
1589 | bool include_eq_uses) |
1590 | { | |
dd3eed93 | 1591 | rtx_insn *insn; |
6fb5fa3c DB |
1592 | |
1593 | if (include_defs) | |
b8698a0f | 1594 | offset = df_add_refs_to_table (offset, ref_info, |
6fb5fa3c DB |
1595 | df_get_artificial_defs (bb->index)); |
1596 | if (include_uses) | |
b8698a0f | 1597 | offset = df_add_refs_to_table (offset, ref_info, |
6fb5fa3c DB |
1598 | df_get_artificial_uses (bb->index)); |
1599 | ||
1600 | FOR_BB_INSNS (bb, insn) | |
1601 | if (INSN_P (insn)) | |
1602 | { | |
1603 | unsigned int uid = INSN_UID (insn); | |
1604 | if (include_defs) | |
b8698a0f | 1605 | offset = df_add_refs_to_table (offset, ref_info, |
6fb5fa3c DB |
1606 | DF_INSN_UID_DEFS (uid)); |
1607 | if (include_uses) | |
b8698a0f | 1608 | offset = df_add_refs_to_table (offset, ref_info, |
6fb5fa3c DB |
1609 | DF_INSN_UID_USES (uid)); |
1610 | if (include_eq_uses) | |
b8698a0f | 1611 | offset = df_add_refs_to_table (offset, ref_info, |
6fb5fa3c | 1612 | DF_INSN_UID_EQ_USES (uid)); |
23249ac4 | 1613 | } |
6fb5fa3c DB |
1614 | return offset; |
1615 | } | |
1616 | ||
1617 | ||
0d52bcc1 | 1618 | /* Organize the refs by insn into the table in REF_INFO. If |
6fb5fa3c DB |
1619 | blocks_to_analyze is defined, use that set, otherwise the entire |
1620 | program. Include the defs if INCLUDE_DEFS. Include the uses if | |
1621 | INCLUDE_USES. Include the eq_uses if INCLUDE_EQ_USES. */ | |
1622 | ||
1623 | static void | |
1624 | df_reorganize_refs_by_insn (struct df_ref_info *ref_info, | |
b8698a0f | 1625 | bool include_defs, bool include_uses, |
6fb5fa3c DB |
1626 | bool include_eq_uses) |
1627 | { | |
1628 | basic_block bb; | |
1629 | unsigned int offset = 0; | |
1630 | ||
1631 | ref_info->total_size = df_count_refs (include_defs, include_uses, include_eq_uses); | |
1632 | df_check_and_grow_ref_info (ref_info, 1); | |
1633 | if (df->blocks_to_analyze) | |
1634 | { | |
1635 | bitmap_iterator bi; | |
1636 | unsigned int index; | |
1637 | ||
1638 | EXECUTE_IF_SET_IN_BITMAP (df->blocks_to_analyze, 0, index, bi) | |
1639 | { | |
06e28de2 DM |
1640 | offset = df_reorganize_refs_by_insn_bb (BASIC_BLOCK_FOR_FN (cfun, |
1641 | index), | |
1642 | offset, ref_info, | |
b8698a0f | 1643 | include_defs, include_uses, |
6fb5fa3c DB |
1644 | include_eq_uses); |
1645 | } | |
1646 | ||
1647 | ref_info->table_size = offset; | |
1648 | } | |
1649 | else | |
1650 | { | |
04a90bec | 1651 | FOR_ALL_BB_FN (bb, cfun) |
b8698a0f L |
1652 | offset = df_reorganize_refs_by_insn_bb (bb, offset, ref_info, |
1653 | include_defs, include_uses, | |
6fb5fa3c DB |
1654 | include_eq_uses); |
1655 | ref_info->table_size = offset; | |
1656 | } | |
1657 | } | |
1658 | ||
1659 | ||
1660 | /* If the use refs in DF are not organized, reorganize them. */ | |
1661 | ||
b8698a0f | 1662 | void |
6fb5fa3c DB |
1663 | df_maybe_reorganize_use_refs (enum df_ref_order order) |
1664 | { | |
1665 | if (order == df->use_info.ref_order) | |
1666 | return; | |
1667 | ||
1668 | switch (order) | |
1669 | { | |
1670 | case DF_REF_ORDER_BY_REG: | |
1671 | df_reorganize_refs_by_reg (&df->use_info, false, true, false); | |
1672 | break; | |
1673 | ||
1674 | case DF_REF_ORDER_BY_REG_WITH_NOTES: | |
1675 | df_reorganize_refs_by_reg (&df->use_info, false, true, true); | |
1676 | break; | |
1677 | ||
1678 | case DF_REF_ORDER_BY_INSN: | |
1679 | df_reorganize_refs_by_insn (&df->use_info, false, true, false); | |
1680 | break; | |
1681 | ||
1682 | case DF_REF_ORDER_BY_INSN_WITH_NOTES: | |
1683 | df_reorganize_refs_by_insn (&df->use_info, false, true, true); | |
1684 | break; | |
1685 | ||
1686 | case DF_REF_ORDER_NO_TABLE: | |
1687 | free (df->use_info.refs); | |
1688 | df->use_info.refs = NULL; | |
1689 | df->use_info.refs_size = 0; | |
1690 | break; | |
1691 | ||
1692 | case DF_REF_ORDER_UNORDERED: | |
1693 | case DF_REF_ORDER_UNORDERED_WITH_NOTES: | |
1694 | gcc_unreachable (); | |
1695 | break; | |
1696 | } | |
b8698a0f | 1697 | |
6fb5fa3c DB |
1698 | df->use_info.ref_order = order; |
1699 | } | |
1700 | ||
1701 | ||
1702 | /* If the def refs in DF are not organized, reorganize them. */ | |
1703 | ||
b8698a0f | 1704 | void |
6fb5fa3c DB |
1705 | df_maybe_reorganize_def_refs (enum df_ref_order order) |
1706 | { | |
1707 | if (order == df->def_info.ref_order) | |
1708 | return; | |
1709 | ||
1710 | switch (order) | |
1711 | { | |
1712 | case DF_REF_ORDER_BY_REG: | |
1713 | df_reorganize_refs_by_reg (&df->def_info, true, false, false); | |
1714 | break; | |
1715 | ||
1716 | case DF_REF_ORDER_BY_INSN: | |
1717 | df_reorganize_refs_by_insn (&df->def_info, true, false, false); | |
1718 | break; | |
1719 | ||
1720 | case DF_REF_ORDER_NO_TABLE: | |
1721 | free (df->def_info.refs); | |
1722 | df->def_info.refs = NULL; | |
1723 | df->def_info.refs_size = 0; | |
1724 | break; | |
1725 | ||
1726 | case DF_REF_ORDER_BY_INSN_WITH_NOTES: | |
1727 | case DF_REF_ORDER_BY_REG_WITH_NOTES: | |
1728 | case DF_REF_ORDER_UNORDERED: | |
1729 | case DF_REF_ORDER_UNORDERED_WITH_NOTES: | |
1730 | gcc_unreachable (); | |
1731 | break; | |
1732 | } | |
b8698a0f | 1733 | |
6fb5fa3c DB |
1734 | df->def_info.ref_order = order; |
1735 | } | |
1736 | ||
1737 | ||
6fb5fa3c | 1738 | /* Change all of the basic block references in INSN to use the insn's |
b8698a0f L |
1739 | current basic block. This function is called from routines that move |
1740 | instructions from one block to another. */ | |
6fb5fa3c DB |
1741 | |
1742 | void | |
b2908ba6 | 1743 | df_insn_change_bb (rtx_insn *insn, basic_block new_bb) |
6fb5fa3c | 1744 | { |
63642d5a | 1745 | basic_block old_bb = BLOCK_FOR_INSN (insn); |
6fb5fa3c DB |
1746 | struct df_insn_info *insn_info; |
1747 | unsigned int uid = INSN_UID (insn); | |
1748 | ||
63642d5a AO |
1749 | if (old_bb == new_bb) |
1750 | return; | |
1751 | ||
1752 | set_block_for_insn (insn, new_bb); | |
1753 | ||
6fb5fa3c DB |
1754 | if (!df) |
1755 | return; | |
1756 | ||
1757 | if (dump_file) | |
1758 | fprintf (dump_file, "changing bb of uid %d\n", uid); | |
1759 | ||
1760 | insn_info = DF_INSN_UID_SAFE_GET (uid); | |
1761 | if (insn_info == NULL) | |
1762 | { | |
1763 | if (dump_file) | |
1764 | fprintf (dump_file, " unscanned insn\n"); | |
1765 | df_insn_rescan (insn); | |
1766 | return; | |
1767 | } | |
1768 | ||
1769 | if (!INSN_P (insn)) | |
1770 | return; | |
1771 | ||
6fb5fa3c DB |
1772 | df_set_bb_dirty (new_bb); |
1773 | if (old_bb) | |
1774 | { | |
1775 | if (dump_file) | |
b8698a0f | 1776 | fprintf (dump_file, " from %d to %d\n", |
6fb5fa3c DB |
1777 | old_bb->index, new_bb->index); |
1778 | df_set_bb_dirty (old_bb); | |
1779 | } | |
1780 | else | |
1781 | if (dump_file) | |
1782 | fprintf (dump_file, " to %d\n", new_bb->index); | |
1783 | } | |
1784 | ||
1785 | ||
1786 | /* Helper function for df_ref_change_reg_with_loc. */ | |
1787 | ||
1788 | static void | |
b8698a0f | 1789 | df_ref_change_reg_with_loc_1 (struct df_reg_info *old_df, |
57512f53 | 1790 | struct df_reg_info *new_df, |
e1a2b021 | 1791 | unsigned int new_regno, rtx loc) |
6fb5fa3c | 1792 | { |
57512f53 | 1793 | df_ref the_ref = old_df->reg_chain; |
6fb5fa3c DB |
1794 | |
1795 | while (the_ref) | |
1796 | { | |
57512f53 | 1797 | if ((!DF_REF_IS_ARTIFICIAL (the_ref)) |
502ef838 | 1798 | && DF_REF_LOC (the_ref) |
57512f53 | 1799 | && (*DF_REF_LOC (the_ref) == loc)) |
6fb5fa3c | 1800 | { |
57512f53 KZ |
1801 | df_ref next_ref = DF_REF_NEXT_REG (the_ref); |
1802 | df_ref prev_ref = DF_REF_PREV_REG (the_ref); | |
b512946c | 1803 | df_ref *ref_ptr; |
57512f53 | 1804 | struct df_insn_info *insn_info = DF_REF_INSN_INFO (the_ref); |
6fb5fa3c DB |
1805 | |
1806 | DF_REF_REGNO (the_ref) = new_regno; | |
1807 | DF_REF_REG (the_ref) = regno_reg_rtx[new_regno]; | |
1808 | ||
1809 | /* Pull the_ref out of the old regno chain. */ | |
1810 | if (prev_ref) | |
57512f53 | 1811 | DF_REF_NEXT_REG (prev_ref) = next_ref; |
6fb5fa3c | 1812 | else |
60564289 | 1813 | old_df->reg_chain = next_ref; |
6fb5fa3c | 1814 | if (next_ref) |
57512f53 | 1815 | DF_REF_PREV_REG (next_ref) = prev_ref; |
60564289 | 1816 | old_df->n_refs--; |
6fb5fa3c DB |
1817 | |
1818 | /* Put the ref into the new regno chain. */ | |
57512f53 KZ |
1819 | DF_REF_PREV_REG (the_ref) = NULL; |
1820 | DF_REF_NEXT_REG (the_ref) = new_df->reg_chain; | |
60564289 | 1821 | if (new_df->reg_chain) |
57512f53 | 1822 | DF_REF_PREV_REG (new_df->reg_chain) = the_ref; |
60564289 KG |
1823 | new_df->reg_chain = the_ref; |
1824 | new_df->n_refs++; | |
5288f999 KZ |
1825 | if (DF_REF_BB (the_ref)) |
1826 | df_set_bb_dirty (DF_REF_BB (the_ref)); | |
6fb5fa3c | 1827 | |
57512f53 KZ |
1828 | /* Need to sort the record again that the ref was in because |
1829 | the regno is a sorting key. First, find the right | |
1830 | record. */ | |
b512946c RS |
1831 | if (DF_REF_REG_DEF_P (the_ref)) |
1832 | ref_ptr = &insn_info->defs; | |
1833 | else if (DF_REF_FLAGS (the_ref) & DF_REF_IN_NOTE) | |
1834 | ref_ptr = &insn_info->eq_uses; | |
6fb5fa3c | 1835 | else |
b512946c | 1836 | ref_ptr = &insn_info->uses; |
57512f53 | 1837 | if (dump_file) |
b8698a0f L |
1838 | fprintf (dump_file, "changing reg in insn %d\n", |
1839 | DF_REF_INSN_UID (the_ref)); | |
1840 | ||
b512946c RS |
1841 | /* Stop if we find the current reference or where the reference |
1842 | needs to be. */ | |
1843 | while (*ref_ptr != the_ref && df_ref_compare (*ref_ptr, the_ref) < 0) | |
1844 | ref_ptr = &DF_REF_NEXT_LOC (*ref_ptr); | |
1845 | if (*ref_ptr != the_ref) | |
6fb5fa3c | 1846 | { |
b512946c RS |
1847 | /* The reference needs to be promoted up the list. */ |
1848 | df_ref next = DF_REF_NEXT_LOC (the_ref); | |
1849 | DF_REF_NEXT_LOC (the_ref) = *ref_ptr; | |
1850 | *ref_ptr = the_ref; | |
1851 | do | |
1852 | ref_ptr = &DF_REF_NEXT_LOC (*ref_ptr); | |
1853 | while (*ref_ptr != the_ref); | |
1854 | *ref_ptr = next; | |
1855 | } | |
1856 | else if (DF_REF_NEXT_LOC (the_ref) | |
1857 | && df_ref_compare (the_ref, DF_REF_NEXT_LOC (the_ref)) > 0) | |
1858 | { | |
1859 | /* The reference needs to be demoted down the list. */ | |
1860 | *ref_ptr = DF_REF_NEXT_LOC (the_ref); | |
1861 | do | |
1862 | ref_ptr = &DF_REF_NEXT_LOC (*ref_ptr); | |
1863 | while (*ref_ptr && df_ref_compare (the_ref, *ref_ptr) > 0); | |
1864 | DF_REF_NEXT_LOC (the_ref) = *ref_ptr; | |
1865 | *ref_ptr = the_ref; | |
6fb5fa3c | 1866 | } |
6fb5fa3c DB |
1867 | |
1868 | the_ref = next_ref; | |
1869 | } | |
1870 | else | |
57512f53 | 1871 | the_ref = DF_REF_NEXT_REG (the_ref); |
6fb5fa3c DB |
1872 | } |
1873 | } | |
1874 | ||
1875 | ||
e1a2b021 RS |
1876 | /* Change the regno of register LOC to NEW_REGNO and update the df |
1877 | information accordingly. Refs that do not match LOC are not changed | |
1878 | which means that artificial refs are not changed since they have no loc. | |
1879 | This call is to support the SET_REGNO macro. */ | |
6fb5fa3c DB |
1880 | |
1881 | void | |
e1a2b021 | 1882 | df_ref_change_reg_with_loc (rtx loc, unsigned int new_regno) |
6fb5fa3c | 1883 | { |
e1a2b021 RS |
1884 | unsigned int old_regno = REGNO (loc); |
1885 | if (old_regno == new_regno) | |
6fb5fa3c DB |
1886 | return; |
1887 | ||
e1a2b021 RS |
1888 | if (df) |
1889 | { | |
1890 | df_grow_reg_info (); | |
1891 | ||
1892 | df_ref_change_reg_with_loc_1 (DF_REG_DEF_GET (old_regno), | |
1893 | DF_REG_DEF_GET (new_regno), | |
1894 | new_regno, loc); | |
1895 | df_ref_change_reg_with_loc_1 (DF_REG_USE_GET (old_regno), | |
1896 | DF_REG_USE_GET (new_regno), | |
1897 | new_regno, loc); | |
1898 | df_ref_change_reg_with_loc_1 (DF_REG_EQ_USE_GET (old_regno), | |
1899 | DF_REG_EQ_USE_GET (new_regno), | |
1900 | new_regno, loc); | |
1901 | } | |
9188b286 | 1902 | set_mode_and_regno (loc, GET_MODE (loc), new_regno); |
6fb5fa3c DB |
1903 | } |
1904 | ||
1905 | ||
1906 | /* Delete the mw_hardregs that point into the eq_notes. */ | |
1907 | ||
b512946c | 1908 | static void |
6fb5fa3c DB |
1909 | df_mw_hardreg_chain_delete_eq_uses (struct df_insn_info *insn_info) |
1910 | { | |
b512946c | 1911 | struct df_mw_hardreg **mw_ptr = &insn_info->mw_hardregs; |
b8698a0f | 1912 | struct df_scan_problem_data *problem_data |
6fb5fa3c DB |
1913 | = (struct df_scan_problem_data *) df_scan->problem_data; |
1914 | ||
b512946c | 1915 | while (*mw_ptr) |
6fb5fa3c | 1916 | { |
b512946c RS |
1917 | df_mw_hardreg *mw = *mw_ptr; |
1918 | if (mw->flags & DF_REF_IN_NOTE) | |
6fb5fa3c | 1919 | { |
b512946c | 1920 | *mw_ptr = DF_MWS_NEXT (mw); |
e956943e | 1921 | problem_data->mw_reg_pool->remove (mw); |
6fb5fa3c DB |
1922 | } |
1923 | else | |
b512946c | 1924 | mw_ptr = &DF_MWS_NEXT (mw); |
6fb5fa3c | 1925 | } |
6fb5fa3c DB |
1926 | } |
1927 | ||
1928 | ||
1929 | /* Rescan only the REG_EQUIV/REG_EQUAL notes part of INSN. */ | |
1930 | ||
1931 | void | |
b2908ba6 | 1932 | df_notes_rescan (rtx_insn *insn) |
6fb5fa3c DB |
1933 | { |
1934 | struct df_insn_info *insn_info; | |
1935 | unsigned int uid = INSN_UID (insn); | |
1936 | ||
1937 | if (!df) | |
1938 | return; | |
1939 | ||
1940 | /* The client has disabled rescanning and plans to do it itself. */ | |
1941 | if (df->changeable_flags & DF_NO_INSN_RESCAN) | |
1942 | return; | |
1943 | ||
c9b69ba2 RS |
1944 | /* Do nothing if the insn hasn't been emitted yet. */ |
1945 | if (!BLOCK_FOR_INSN (insn)) | |
1946 | return; | |
1947 | ||
6fb5fa3c DB |
1948 | df_grow_bb_info (df_scan); |
1949 | df_grow_reg_info (); | |
1950 | ||
c3284718 | 1951 | insn_info = DF_INSN_UID_SAFE_GET (INSN_UID (insn)); |
6fb5fa3c | 1952 | |
0a41f3b2 | 1953 | /* The client has deferred rescanning. */ |
6fb5fa3c DB |
1954 | if (df->changeable_flags & DF_DEFER_INSN_RESCAN) |
1955 | { | |
1956 | if (!insn_info) | |
1957 | { | |
1958 | insn_info = df_insn_create_insn_record (insn); | |
b512946c RS |
1959 | insn_info->defs = 0; |
1960 | insn_info->uses = 0; | |
1961 | insn_info->eq_uses = 0; | |
1962 | insn_info->mw_hardregs = 0; | |
6fb5fa3c | 1963 | } |
b8698a0f | 1964 | |
a7e3698d | 1965 | bitmap_clear_bit (&df->insns_to_delete, uid); |
6fb5fa3c DB |
1966 | /* If the insn is set to be rescanned, it does not need to also |
1967 | be notes rescanned. */ | |
a7e3698d JH |
1968 | if (!bitmap_bit_p (&df->insns_to_rescan, uid)) |
1969 | bitmap_set_bit (&df->insns_to_notes_rescan, INSN_UID (insn)); | |
6fb5fa3c DB |
1970 | return; |
1971 | } | |
1972 | ||
a7e3698d JH |
1973 | bitmap_clear_bit (&df->insns_to_delete, uid); |
1974 | bitmap_clear_bit (&df->insns_to_notes_rescan, uid); | |
6fb5fa3c DB |
1975 | |
1976 | if (insn_info) | |
1977 | { | |
1978 | basic_block bb = BLOCK_FOR_INSN (insn); | |
1979 | rtx note; | |
1980 | struct df_collection_rec collection_rec; | |
b512946c | 1981 | unsigned int i; |
6fb5fa3c | 1982 | |
b512946c | 1983 | df_mw_hardreg_chain_delete_eq_uses (insn_info); |
6fb5fa3c DB |
1984 | df_ref_chain_delete (insn_info->eq_uses); |
1985 | insn_info->eq_uses = NULL; | |
1986 | ||
1987 | /* Process REG_EQUIV/REG_EQUAL notes */ | |
1988 | for (note = REG_NOTES (insn); note; | |
1989 | note = XEXP (note, 1)) | |
1990 | { | |
1991 | switch (REG_NOTE_KIND (note)) | |
1992 | { | |
1993 | case REG_EQUIV: | |
1994 | case REG_EQUAL: | |
502ef838 | 1995 | df_uses_record (&collection_rec, |
6fb5fa3c | 1996 | &XEXP (note, 0), DF_REF_REG_USE, |
502ef838 | 1997 | bb, insn_info, DF_REF_IN_NOTE); |
6fb5fa3c DB |
1998 | default: |
1999 | break; | |
2000 | } | |
2001 | } | |
2002 | ||
2003 | /* Find some place to put any new mw_hardregs. */ | |
2004 | df_canonize_collection_rec (&collection_rec); | |
b512946c RS |
2005 | struct df_mw_hardreg **mw_ptr = &insn_info->mw_hardregs, *mw; |
2006 | FOR_EACH_VEC_ELT (collection_rec.mw_vec, i, mw) | |
6fb5fa3c | 2007 | { |
b512946c RS |
2008 | while (*mw_ptr && df_mw_compare (*mw_ptr, mw) < 0) |
2009 | mw_ptr = &DF_MWS_NEXT (*mw_ptr); | |
2010 | DF_MWS_NEXT (mw) = *mw_ptr; | |
2011 | *mw_ptr = mw; | |
2012 | mw_ptr = &DF_MWS_NEXT (mw); | |
6fb5fa3c | 2013 | } |
ff4c81cc | 2014 | df_refs_add_to_chains (&collection_rec, bb, insn, copy_eq_uses); |
6fb5fa3c DB |
2015 | } |
2016 | else | |
2017 | df_insn_rescan (insn); | |
2018 | ||
2019 | } | |
2020 | ||
2021 | \f | |
2022 | /*---------------------------------------------------------------------------- | |
2023 | Hard core instruction scanning code. No external interfaces here, | |
2024 | just a lot of routines that look inside insns. | |
2025 | ----------------------------------------------------------------------------*/ | |
2026 | ||
2027 | ||
b8698a0f | 2028 | /* Return true if the contents of two df_ref's are identical. |
6fb5fa3c DB |
2029 | It ignores DF_REF_MARKER. */ |
2030 | ||
2031 | static bool | |
57512f53 | 2032 | df_ref_equal_p (df_ref ref1, df_ref ref2) |
6fb5fa3c DB |
2033 | { |
2034 | if (!ref2) | |
2035 | return false; | |
b8698a0f | 2036 | |
57512f53 KZ |
2037 | if (ref1 == ref2) |
2038 | return true; | |
2039 | ||
2040 | if (DF_REF_CLASS (ref1) != DF_REF_CLASS (ref2) | |
2041 | || DF_REF_REGNO (ref1) != DF_REF_REGNO (ref2) | |
2042 | || DF_REF_REG (ref1) != DF_REF_REG (ref2) | |
2043 | || DF_REF_TYPE (ref1) != DF_REF_TYPE (ref2) | |
b8698a0f | 2044 | || ((DF_REF_FLAGS (ref1) & ~(DF_REF_REG_MARKER + DF_REF_MW_HARDREG)) |
57512f53 KZ |
2045 | != (DF_REF_FLAGS (ref2) & ~(DF_REF_REG_MARKER + DF_REF_MW_HARDREG))) |
2046 | || DF_REF_BB (ref1) != DF_REF_BB (ref2) | |
2047 | || DF_REF_INSN_INFO (ref1) != DF_REF_INSN_INFO (ref2)) | |
2048 | return false; | |
b8698a0f | 2049 | |
57512f53 KZ |
2050 | switch (DF_REF_CLASS (ref1)) |
2051 | { | |
2052 | case DF_REF_ARTIFICIAL: | |
2053 | case DF_REF_BASE: | |
2054 | return true; | |
ca9052ce | 2055 | |
57512f53 KZ |
2056 | case DF_REF_REGULAR: |
2057 | return DF_REF_LOC (ref1) == DF_REF_LOC (ref2); | |
ca9052ce | 2058 | |
57512f53 KZ |
2059 | default: |
2060 | gcc_unreachable (); | |
2061 | } | |
2062 | return false; | |
6fb5fa3c DB |
2063 | } |
2064 | ||
2065 | ||
2066 | /* Compare REF1 and REF2 for sorting. This is only called from places | |
2067 | where all of the refs are of the same type, in the same insn, and | |
2068 | have the same bb. So these fields are not checked. */ | |
2069 | ||
2070 | static int | |
b512946c | 2071 | df_ref_compare (df_ref ref1, df_ref ref2) |
6fb5fa3c | 2072 | { |
57512f53 KZ |
2073 | if (DF_REF_CLASS (ref1) != DF_REF_CLASS (ref2)) |
2074 | return (int)DF_REF_CLASS (ref1) - (int)DF_REF_CLASS (ref2); | |
2075 | ||
6fb5fa3c DB |
2076 | if (DF_REF_REGNO (ref1) != DF_REF_REGNO (ref2)) |
2077 | return (int)DF_REF_REGNO (ref1) - (int)DF_REF_REGNO (ref2); | |
b8698a0f | 2078 | |
6fb5fa3c DB |
2079 | if (DF_REF_TYPE (ref1) != DF_REF_TYPE (ref2)) |
2080 | return (int)DF_REF_TYPE (ref1) - (int)DF_REF_TYPE (ref2); | |
2081 | ||
57512f53 KZ |
2082 | if (DF_REF_REG (ref1) != DF_REF_REG (ref2)) |
2083 | return (int)DF_REF_ORDER (ref1) - (int)DF_REF_ORDER (ref2); | |
2084 | ||
2085 | /* Cannot look at the LOC field on artificial refs. */ | |
2086 | if (DF_REF_CLASS (ref1) != DF_REF_ARTIFICIAL | |
2087 | && DF_REF_LOC (ref1) != DF_REF_LOC (ref2)) | |
6fb5fa3c DB |
2088 | return (int)DF_REF_ORDER (ref1) - (int)DF_REF_ORDER (ref2); |
2089 | ||
2090 | if (DF_REF_FLAGS (ref1) != DF_REF_FLAGS (ref2)) | |
2091 | { | |
2092 | /* If two refs are identical except that one of them has is from | |
2093 | a mw and one is not, we need to have the one with the mw | |
2094 | first. */ | |
2095 | if (DF_REF_FLAGS_IS_SET (ref1, DF_REF_MW_HARDREG) == | |
2096 | DF_REF_FLAGS_IS_SET (ref2, DF_REF_MW_HARDREG)) | |
2097 | return DF_REF_FLAGS (ref1) - DF_REF_FLAGS (ref2); | |
2098 | else if (DF_REF_FLAGS_IS_SET (ref1, DF_REF_MW_HARDREG)) | |
2099 | return -1; | |
2100 | else | |
2101 | return 1; | |
2102 | } | |
ca9052ce | 2103 | |
5797be12 | 2104 | return (int)DF_REF_ORDER (ref1) - (int)DF_REF_ORDER (ref2); |
6fb5fa3c DB |
2105 | } |
2106 | ||
b512946c RS |
2107 | /* Like df_ref_compare, but compare two df_ref* pointers R1 and R2. */ |
2108 | ||
2109 | static int | |
2110 | df_ref_ptr_compare (const void *r1, const void *r2) | |
2111 | { | |
2112 | return df_ref_compare (*(const df_ref *) r1, *(const df_ref *) r2); | |
2113 | } | |
2114 | ||
6fb5fa3c DB |
2115 | /* Sort and compress a set of refs. */ |
2116 | ||
c2569604 | 2117 | static void |
ff4c81cc | 2118 | df_sort_and_compress_refs (vec<df_ref, va_heap> *ref_vec) |
6fb5fa3c | 2119 | { |
c2569604 | 2120 | unsigned int count; |
6fb5fa3c DB |
2121 | unsigned int i; |
2122 | unsigned int dist = 0; | |
2123 | ||
9771b263 | 2124 | count = ref_vec->length (); |
c2569604 | 2125 | |
6fb5fa3c DB |
2126 | /* If there are 1 or 0 elements, there is nothing to do. */ |
2127 | if (count < 2) | |
c2569604 | 2128 | return; |
6fb5fa3c DB |
2129 | else if (count == 2) |
2130 | { | |
9771b263 DN |
2131 | df_ref r0 = (*ref_vec)[0]; |
2132 | df_ref r1 = (*ref_vec)[1]; | |
b512946c | 2133 | if (df_ref_compare (r0, r1) > 0) |
6b4db501 | 2134 | std::swap ((*ref_vec)[0], (*ref_vec)[1]); |
6fb5fa3c DB |
2135 | } |
2136 | else | |
2137 | { | |
2138 | for (i = 0; i < count - 1; i++) | |
c2569604 | 2139 | { |
9771b263 DN |
2140 | df_ref r0 = (*ref_vec)[i]; |
2141 | df_ref r1 = (*ref_vec)[i + 1]; | |
b512946c | 2142 | if (df_ref_compare (r0, r1) >= 0) |
c2569604 ILT |
2143 | break; |
2144 | } | |
6fb5fa3c DB |
2145 | /* If the array is already strictly ordered, |
2146 | which is the most common case for large COUNT case | |
2147 | (which happens for CALL INSNs), | |
2148 | no need to sort and filter out duplicate. | |
b8698a0f | 2149 | Simply return the count. |
6fb5fa3c DB |
2150 | Make sure DF_GET_ADD_REFS adds refs in the increasing order |
2151 | of DF_REF_COMPARE. */ | |
2152 | if (i == count - 1) | |
c2569604 | 2153 | return; |
b512946c | 2154 | ref_vec->qsort (df_ref_ptr_compare); |
6fb5fa3c DB |
2155 | } |
2156 | ||
2157 | for (i=0; i<count-dist; i++) | |
2158 | { | |
2159 | /* Find the next ref that is not equal to the current ref. */ | |
c2569604 | 2160 | while (i + dist + 1 < count |
9771b263 DN |
2161 | && df_ref_equal_p ((*ref_vec)[i], |
2162 | (*ref_vec)[i + dist + 1])) | |
6fb5fa3c | 2163 | { |
9771b263 | 2164 | df_free_ref ((*ref_vec)[i + dist + 1]); |
6fb5fa3c DB |
2165 | dist++; |
2166 | } | |
2167 | /* Copy it down to the next position. */ | |
c2569604 | 2168 | if (dist && i + dist + 1 < count) |
9771b263 | 2169 | (*ref_vec)[i + 1] = (*ref_vec)[i + dist + 1]; |
6fb5fa3c DB |
2170 | } |
2171 | ||
2172 | count -= dist; | |
9771b263 | 2173 | ref_vec->truncate (count); |
6fb5fa3c DB |
2174 | } |
2175 | ||
2176 | ||
b8698a0f | 2177 | /* Return true if the contents of two df_ref's are identical. |
6fb5fa3c DB |
2178 | It ignores DF_REF_MARKER. */ |
2179 | ||
2180 | static bool | |
2181 | df_mw_equal_p (struct df_mw_hardreg *mw1, struct df_mw_hardreg *mw2) | |
2182 | { | |
2183 | if (!mw2) | |
2184 | return false; | |
2185 | return (mw1 == mw2) || | |
2186 | (mw1->mw_reg == mw2->mw_reg | |
2187 | && mw1->type == mw2->type | |
2188 | && mw1->flags == mw2->flags | |
2189 | && mw1->start_regno == mw2->start_regno | |
2190 | && mw1->end_regno == mw2->end_regno); | |
2191 | } | |
2192 | ||
2193 | ||
2194 | /* Compare MW1 and MW2 for sorting. */ | |
2195 | ||
2196 | static int | |
b512946c | 2197 | df_mw_compare (const df_mw_hardreg *mw1, const df_mw_hardreg *mw2) |
6fb5fa3c | 2198 | { |
6fb5fa3c DB |
2199 | if (mw1->type != mw2->type) |
2200 | return mw1->type - mw2->type; | |
2201 | ||
2202 | if (mw1->flags != mw2->flags) | |
2203 | return mw1->flags - mw2->flags; | |
2204 | ||
2205 | if (mw1->start_regno != mw2->start_regno) | |
2206 | return mw1->start_regno - mw2->start_regno; | |
2207 | ||
2208 | if (mw1->end_regno != mw2->end_regno) | |
2209 | return mw1->end_regno - mw2->end_regno; | |
2210 | ||
2211 | if (mw1->mw_reg != mw2->mw_reg) | |
2212 | return mw1->mw_order - mw2->mw_order; | |
2213 | ||
2214 | return 0; | |
2215 | } | |
2216 | ||
b512946c RS |
2217 | /* Like df_mw_compare, but compare two df_mw_hardreg** pointers R1 and R2. */ |
2218 | ||
2219 | static int | |
2220 | df_mw_ptr_compare (const void *m1, const void *m2) | |
2221 | { | |
2222 | return df_mw_compare (*(const df_mw_hardreg *const *) m1, | |
2223 | *(const df_mw_hardreg *const *) m2); | |
2224 | } | |
6fb5fa3c DB |
2225 | |
2226 | /* Sort and compress a set of refs. */ | |
2227 | ||
c2569604 | 2228 | static void |
526ceb68 | 2229 | df_sort_and_compress_mws (vec<df_mw_hardreg *, va_heap> *mw_vec) |
6fb5fa3c | 2230 | { |
c2569604 | 2231 | unsigned int count; |
b8698a0f | 2232 | struct df_scan_problem_data *problem_data |
6fb5fa3c DB |
2233 | = (struct df_scan_problem_data *) df_scan->problem_data; |
2234 | unsigned int i; | |
2235 | unsigned int dist = 0; | |
6fb5fa3c | 2236 | |
9771b263 | 2237 | count = mw_vec->length (); |
6fb5fa3c | 2238 | if (count < 2) |
c2569604 | 2239 | return; |
6fb5fa3c DB |
2240 | else if (count == 2) |
2241 | { | |
9771b263 DN |
2242 | struct df_mw_hardreg *m0 = (*mw_vec)[0]; |
2243 | struct df_mw_hardreg *m1 = (*mw_vec)[1]; | |
b512946c | 2244 | if (df_mw_compare (m0, m1) > 0) |
6fb5fa3c | 2245 | { |
9771b263 DN |
2246 | struct df_mw_hardreg *tmp = (*mw_vec)[0]; |
2247 | (*mw_vec)[0] = (*mw_vec)[1]; | |
2248 | (*mw_vec)[1] = tmp; | |
6fb5fa3c DB |
2249 | } |
2250 | } | |
2251 | else | |
b512946c | 2252 | mw_vec->qsort (df_mw_ptr_compare); |
6fb5fa3c DB |
2253 | |
2254 | for (i=0; i<count-dist; i++) | |
2255 | { | |
2256 | /* Find the next ref that is not equal to the current ref. */ | |
c2569604 | 2257 | while (i + dist + 1 < count |
9771b263 | 2258 | && df_mw_equal_p ((*mw_vec)[i], (*mw_vec)[i + dist + 1])) |
6fb5fa3c | 2259 | { |
e956943e | 2260 | problem_data->mw_reg_pool->remove ((*mw_vec)[i + dist + 1]); |
6fb5fa3c DB |
2261 | dist++; |
2262 | } | |
2263 | /* Copy it down to the next position. */ | |
c2569604 | 2264 | if (dist && i + dist + 1 < count) |
9771b263 | 2265 | (*mw_vec)[i + 1] = (*mw_vec)[i + dist + 1]; |
6fb5fa3c DB |
2266 | } |
2267 | ||
2268 | count -= dist; | |
9771b263 | 2269 | mw_vec->truncate (count); |
6fb5fa3c DB |
2270 | } |
2271 | ||
2272 | ||
2273 | /* Sort and remove duplicates from the COLLECTION_REC. */ | |
2274 | ||
2275 | static void | |
2276 | df_canonize_collection_rec (struct df_collection_rec *collection_rec) | |
2277 | { | |
c2569604 ILT |
2278 | df_sort_and_compress_refs (&collection_rec->def_vec); |
2279 | df_sort_and_compress_refs (&collection_rec->use_vec); | |
2280 | df_sort_and_compress_refs (&collection_rec->eq_use_vec); | |
2281 | df_sort_and_compress_mws (&collection_rec->mw_vec); | |
6fb5fa3c DB |
2282 | } |
2283 | ||
2284 | ||
2285 | /* Add the new df_ref to appropriate reg_info/ref_info chains. */ | |
2286 | ||
2287 | static void | |
b8698a0f L |
2288 | df_install_ref (df_ref this_ref, |
2289 | struct df_reg_info *reg_info, | |
6fb5fa3c DB |
2290 | struct df_ref_info *ref_info, |
2291 | bool add_to_table) | |
2292 | { | |
2293 | unsigned int regno = DF_REF_REGNO (this_ref); | |
2294 | /* Add the ref to the reg_{def,use,eq_use} chain. */ | |
57512f53 | 2295 | df_ref head = reg_info->reg_chain; |
6fb5fa3c DB |
2296 | |
2297 | reg_info->reg_chain = this_ref; | |
2298 | reg_info->n_refs++; | |
2299 | ||
2300 | if (DF_REF_FLAGS_IS_SET (this_ref, DF_HARD_REG_LIVE)) | |
2301 | { | |
2302 | gcc_assert (regno < FIRST_PSEUDO_REGISTER); | |
2303 | df->hard_regs_live_count[regno]++; | |
2304 | } | |
2305 | ||
7a40b8b1 JH |
2306 | gcc_checking_assert (DF_REF_NEXT_REG (this_ref) == NULL |
2307 | && DF_REF_PREV_REG (this_ref) == NULL); | |
6fb5fa3c DB |
2308 | |
2309 | DF_REF_NEXT_REG (this_ref) = head; | |
2310 | ||
2311 | /* We cannot actually link to the head of the chain. */ | |
2312 | DF_REF_PREV_REG (this_ref) = NULL; | |
2313 | ||
2314 | if (head) | |
2315 | DF_REF_PREV_REG (head) = this_ref; | |
b8698a0f | 2316 | |
6fb5fa3c DB |
2317 | if (add_to_table) |
2318 | { | |
2319 | gcc_assert (ref_info->ref_order != DF_REF_ORDER_NO_TABLE); | |
2320 | df_check_and_grow_ref_info (ref_info, 1); | |
2321 | DF_REF_ID (this_ref) = ref_info->table_size; | |
2322 | /* Add the ref to the big array of defs. */ | |
2323 | ref_info->refs[ref_info->table_size] = this_ref; | |
2324 | ref_info->table_size++; | |
b8698a0f | 2325 | } |
6fb5fa3c DB |
2326 | else |
2327 | DF_REF_ID (this_ref) = -1; | |
b8698a0f | 2328 | |
6fb5fa3c DB |
2329 | ref_info->total_size++; |
2330 | } | |
2331 | ||
2332 | ||
2333 | /* This function takes one of the groups of refs (defs, uses or | |
2334 | eq_uses) and installs the entire group into the insn. It also adds | |
2335 | each of these refs into the appropriate chains. */ | |
2336 | ||
b512946c | 2337 | static df_ref |
6fb5fa3c | 2338 | df_install_refs (basic_block bb, |
ff4c81cc | 2339 | const vec<df_ref, va_heap> *old_vec, |
b8698a0f | 2340 | struct df_reg_info **reg_info, |
6fb5fa3c DB |
2341 | struct df_ref_info *ref_info, |
2342 | bool is_notes) | |
2343 | { | |
ff4c81cc | 2344 | unsigned int count = old_vec->length (); |
6fb5fa3c DB |
2345 | if (count) |
2346 | { | |
6fb5fa3c | 2347 | bool add_to_table; |
c2569604 ILT |
2348 | df_ref this_ref; |
2349 | unsigned int ix; | |
6fb5fa3c DB |
2350 | |
2351 | switch (ref_info->ref_order) | |
2352 | { | |
2353 | case DF_REF_ORDER_UNORDERED_WITH_NOTES: | |
2354 | case DF_REF_ORDER_BY_REG_WITH_NOTES: | |
2355 | case DF_REF_ORDER_BY_INSN_WITH_NOTES: | |
2356 | ref_info->ref_order = DF_REF_ORDER_UNORDERED_WITH_NOTES; | |
2357 | add_to_table = true; | |
2358 | break; | |
2359 | case DF_REF_ORDER_UNORDERED: | |
2360 | case DF_REF_ORDER_BY_REG: | |
2361 | case DF_REF_ORDER_BY_INSN: | |
2362 | ref_info->ref_order = DF_REF_ORDER_UNORDERED; | |
2363 | add_to_table = !is_notes; | |
2364 | break; | |
2365 | default: | |
2366 | add_to_table = false; | |
2367 | break; | |
2368 | } | |
2369 | ||
2370 | /* Do not add if ref is not in the right blocks. */ | |
2371 | if (add_to_table && df->analyze_subset) | |
2372 | add_to_table = bitmap_bit_p (df->blocks_to_analyze, bb->index); | |
2373 | ||
ff4c81cc | 2374 | FOR_EACH_VEC_ELT (*old_vec, ix, this_ref) |
6fb5fa3c | 2375 | { |
b512946c RS |
2376 | DF_REF_NEXT_LOC (this_ref) = (ix + 1 < old_vec->length () |
2377 | ? (*old_vec)[ix + 1] | |
2378 | : NULL); | |
b8698a0f | 2379 | df_install_ref (this_ref, reg_info[DF_REF_REGNO (this_ref)], |
6fb5fa3c DB |
2380 | ref_info, add_to_table); |
2381 | } | |
b512946c | 2382 | return (*old_vec)[0]; |
6fb5fa3c DB |
2383 | } |
2384 | else | |
b512946c | 2385 | return 0; |
6fb5fa3c DB |
2386 | } |
2387 | ||
2388 | ||
2389 | /* This function takes the mws installs the entire group into the | |
2390 | insn. */ | |
2391 | ||
b512946c | 2392 | static struct df_mw_hardreg * |
526ceb68 | 2393 | df_install_mws (const vec<df_mw_hardreg *, va_heap> *old_vec) |
6fb5fa3c | 2394 | { |
ff4c81cc | 2395 | unsigned int count = old_vec->length (); |
6fb5fa3c DB |
2396 | if (count) |
2397 | { | |
b512946c RS |
2398 | for (unsigned int i = 0; i < count - 1; i++) |
2399 | DF_MWS_NEXT ((*old_vec)[i]) = (*old_vec)[i + 1]; | |
2400 | DF_MWS_NEXT ((*old_vec)[count - 1]) = 0; | |
2401 | return (*old_vec)[0]; | |
6fb5fa3c DB |
2402 | } |
2403 | else | |
b512946c | 2404 | return 0; |
6fb5fa3c DB |
2405 | } |
2406 | ||
2407 | ||
2408 | /* Add a chain of df_refs to appropriate ref chain/reg_info/ref_info | |
2409 | chains and update other necessary information. */ | |
2410 | ||
2411 | static void | |
b8698a0f | 2412 | df_refs_add_to_chains (struct df_collection_rec *collection_rec, |
b2908ba6 | 2413 | basic_block bb, rtx_insn *insn, unsigned int flags) |
6fb5fa3c DB |
2414 | { |
2415 | if (insn) | |
2416 | { | |
50e94c7e | 2417 | struct df_insn_info *insn_rec = DF_INSN_INFO_GET (insn); |
6fb5fa3c DB |
2418 | /* If there is a vector in the collection rec, add it to the |
2419 | insn. A null rec is a signal that the caller will handle the | |
2420 | chain specially. */ | |
ff4c81cc | 2421 | if (flags & copy_defs) |
6fb5fa3c | 2422 | { |
b512946c | 2423 | gcc_checking_assert (!insn_rec->defs); |
b8698a0f | 2424 | insn_rec->defs |
ff4c81cc | 2425 | = df_install_refs (bb, &collection_rec->def_vec, |
6fb5fa3c DB |
2426 | df->def_regs, |
2427 | &df->def_info, false); | |
2428 | } | |
ff4c81cc | 2429 | if (flags & copy_uses) |
6fb5fa3c | 2430 | { |
b512946c | 2431 | gcc_checking_assert (!insn_rec->uses); |
b8698a0f | 2432 | insn_rec->uses |
ff4c81cc | 2433 | = df_install_refs (bb, &collection_rec->use_vec, |
6fb5fa3c DB |
2434 | df->use_regs, |
2435 | &df->use_info, false); | |
2436 | } | |
ff4c81cc | 2437 | if (flags & copy_eq_uses) |
6fb5fa3c | 2438 | { |
b512946c | 2439 | gcc_checking_assert (!insn_rec->eq_uses); |
b8698a0f | 2440 | insn_rec->eq_uses |
ff4c81cc | 2441 | = df_install_refs (bb, &collection_rec->eq_use_vec, |
6fb5fa3c DB |
2442 | df->eq_use_regs, |
2443 | &df->use_info, true); | |
2444 | } | |
ff4c81cc | 2445 | if (flags & copy_mw) |
6fb5fa3c | 2446 | { |
b512946c | 2447 | gcc_checking_assert (!insn_rec->mw_hardregs); |
b8698a0f | 2448 | insn_rec->mw_hardregs |
ff4c81cc | 2449 | = df_install_mws (&collection_rec->mw_vec); |
6fb5fa3c DB |
2450 | } |
2451 | } | |
2452 | else | |
2453 | { | |
2454 | struct df_scan_bb_info *bb_info = df_scan_get_bb_info (bb->index); | |
2455 | ||
b512946c | 2456 | gcc_checking_assert (!bb_info->artificial_defs); |
b8698a0f | 2457 | bb_info->artificial_defs |
ff4c81cc | 2458 | = df_install_refs (bb, &collection_rec->def_vec, |
6fb5fa3c DB |
2459 | df->def_regs, |
2460 | &df->def_info, false); | |
b512946c | 2461 | gcc_checking_assert (!bb_info->artificial_uses); |
b8698a0f | 2462 | bb_info->artificial_uses |
ff4c81cc | 2463 | = df_install_refs (bb, &collection_rec->use_vec, |
6fb5fa3c DB |
2464 | df->use_regs, |
2465 | &df->use_info, false); | |
2466 | } | |
2467 | } | |
4d779342 | 2468 | |
4d779342 | 2469 | |
502ef838 | 2470 | /* Allocate a ref and initialize its fields. */ |
6fb5fa3c | 2471 | |
b8698a0f L |
2472 | static df_ref |
2473 | df_ref_create_structure (enum df_ref_class cl, | |
57512f53 | 2474 | struct df_collection_rec *collection_rec, |
b8698a0f | 2475 | rtx reg, rtx *loc, |
50e94c7e | 2476 | basic_block bb, struct df_insn_info *info, |
b8698a0f | 2477 | enum df_ref_type ref_type, |
502ef838 | 2478 | int ref_flags) |
6fb5fa3c | 2479 | { |
57512f53 | 2480 | df_ref this_ref = NULL; |
460bdc0a | 2481 | unsigned int regno = REGNO (GET_CODE (reg) == SUBREG ? SUBREG_REG (reg) : reg); |
6fb5fa3c DB |
2482 | struct df_scan_problem_data *problem_data |
2483 | = (struct df_scan_problem_data *) df_scan->problem_data; | |
2484 | ||
57512f53 | 2485 | switch (cl) |
ca9052ce | 2486 | { |
57512f53 | 2487 | case DF_REF_BASE: |
e956943e | 2488 | this_ref = (df_ref) (problem_data->ref_base_pool->allocate ()); |
7a40b8b1 | 2489 | gcc_checking_assert (loc == NULL); |
57512f53 KZ |
2490 | break; |
2491 | ||
2492 | case DF_REF_ARTIFICIAL: | |
e956943e | 2493 | this_ref = (df_ref) (problem_data->ref_artificial_pool->allocate ()); |
57512f53 | 2494 | this_ref->artificial_ref.bb = bb; |
7a40b8b1 | 2495 | gcc_checking_assert (loc == NULL); |
57512f53 KZ |
2496 | break; |
2497 | ||
2498 | case DF_REF_REGULAR: | |
e956943e | 2499 | this_ref = (df_ref) (problem_data->ref_regular_pool->allocate ()); |
57512f53 | 2500 | this_ref->regular_ref.loc = loc; |
7a40b8b1 | 2501 | gcc_checking_assert (loc); |
57512f53 | 2502 | break; |
ca9052ce | 2503 | } |
57512f53 KZ |
2504 | |
2505 | DF_REF_CLASS (this_ref) = cl; | |
6fb5fa3c DB |
2506 | DF_REF_ID (this_ref) = -1; |
2507 | DF_REF_REG (this_ref) = reg; | |
2508 | DF_REF_REGNO (this_ref) = regno; | |
57512f53 | 2509 | DF_REF_TYPE (this_ref) = ref_type; |
50e94c7e | 2510 | DF_REF_INSN_INFO (this_ref) = info; |
6fb5fa3c | 2511 | DF_REF_CHAIN (this_ref) = NULL; |
6fb5fa3c | 2512 | DF_REF_FLAGS (this_ref) = ref_flags; |
6fb5fa3c DB |
2513 | DF_REF_NEXT_REG (this_ref) = NULL; |
2514 | DF_REF_PREV_REG (this_ref) = NULL; | |
2515 | DF_REF_ORDER (this_ref) = df->ref_order++; | |
2516 | ||
2517 | /* We need to clear this bit because fwprop, and in the future | |
2518 | possibly other optimizations sometimes create new refs using ond | |
2519 | refs as the model. */ | |
2520 | DF_REF_FLAGS_CLEAR (this_ref, DF_HARD_REG_LIVE); | |
2521 | ||
2522 | /* See if this ref needs to have DF_HARD_REG_LIVE bit set. */ | |
bf743fc4 JJ |
2523 | if (regno < FIRST_PSEUDO_REGISTER |
2524 | && !DF_REF_IS_ARTIFICIAL (this_ref) | |
2525 | && !DEBUG_INSN_P (DF_REF_INSN (this_ref))) | |
6fb5fa3c | 2526 | { |
57512f53 | 2527 | if (DF_REF_REG_DEF_P (this_ref)) |
6fb5fa3c DB |
2528 | { |
2529 | if (!DF_REF_FLAGS_IS_SET (this_ref, DF_REF_MAY_CLOBBER)) | |
2530 | DF_REF_FLAGS_SET (this_ref, DF_HARD_REG_LIVE); | |
2531 | } | |
2532 | else if (!(TEST_HARD_REG_BIT (elim_reg_set, regno) | |
2533 | && (regno == FRAME_POINTER_REGNUM | |
2534 | || regno == ARG_POINTER_REGNUM))) | |
2535 | DF_REF_FLAGS_SET (this_ref, DF_HARD_REG_LIVE); | |
2536 | } | |
2537 | ||
2538 | if (collection_rec) | |
2539 | { | |
57512f53 | 2540 | if (DF_REF_REG_DEF_P (this_ref)) |
9771b263 | 2541 | collection_rec->def_vec.safe_push (this_ref); |
6fb5fa3c | 2542 | else if (DF_REF_FLAGS (this_ref) & DF_REF_IN_NOTE) |
9771b263 | 2543 | collection_rec->eq_use_vec.safe_push (this_ref); |
6fb5fa3c | 2544 | else |
9771b263 | 2545 | collection_rec->use_vec.safe_push (this_ref); |
4d779342 | 2546 | } |
dc007c1f PB |
2547 | else |
2548 | df_install_ref_incremental (this_ref); | |
6fb5fa3c | 2549 | |
4d779342 DB |
2550 | return this_ref; |
2551 | } | |
2552 | ||
2553 | ||
2554 | /* Create new references of type DF_REF_TYPE for each part of register REG | |
502ef838 | 2555 | at address LOC within INSN of BB. */ |
ca9052ce | 2556 | |
4d779342 DB |
2557 | |
2558 | static void | |
b8698a0f | 2559 | df_ref_record (enum df_ref_class cl, |
57512f53 | 2560 | struct df_collection_rec *collection_rec, |
b8698a0f | 2561 | rtx reg, rtx *loc, |
50e94c7e | 2562 | basic_block bb, struct df_insn_info *insn_info, |
b8698a0f | 2563 | enum df_ref_type ref_type, |
502ef838 | 2564 | int ref_flags) |
4d779342 | 2565 | { |
23249ac4 | 2566 | unsigned int regno; |
4d779342 | 2567 | |
7a40b8b1 | 2568 | gcc_checking_assert (REG_P (reg) || GET_CODE (reg) == SUBREG); |
4d779342 | 2569 | |
4d779342 DB |
2570 | regno = REGNO (GET_CODE (reg) == SUBREG ? SUBREG_REG (reg) : reg); |
2571 | if (regno < FIRST_PSEUDO_REGISTER) | |
2572 | { | |
23249ac4 DB |
2573 | struct df_mw_hardreg *hardreg = NULL; |
2574 | struct df_scan_problem_data *problem_data | |
6fb5fa3c DB |
2575 | = (struct df_scan_problem_data *) df_scan->problem_data; |
2576 | unsigned int i; | |
2577 | unsigned int endregno; | |
57512f53 | 2578 | df_ref ref; |
4d779342 | 2579 | |
4d779342 | 2580 | if (GET_CODE (reg) == SUBREG) |
f1f4e530 JM |
2581 | { |
2582 | regno += subreg_regno_offset (regno, GET_MODE (SUBREG_REG (reg)), | |
2583 | SUBREG_BYTE (reg), GET_MODE (reg)); | |
09e18274 | 2584 | endregno = regno + subreg_nregs (reg); |
f1f4e530 JM |
2585 | } |
2586 | else | |
72d19505 | 2587 | endregno = END_REGNO (reg); |
4d779342 | 2588 | |
6fb5fa3c DB |
2589 | /* If this is a multiword hardreg, we create some extra |
2590 | datastructures that will enable us to easily build REG_DEAD | |
2591 | and REG_UNUSED notes. */ | |
dc007c1f PB |
2592 | if (collection_rec |
2593 | && (endregno != regno + 1) && insn_info) | |
23249ac4 | 2594 | { |
b8698a0f | 2595 | /* Sets to a subreg of a multiword register are partial. |
23249ac4 | 2596 | Sets to a non-subreg of a multiword register are not. */ |
6f5c1520 | 2597 | if (GET_CODE (reg) == SUBREG) |
23249ac4 DB |
2598 | ref_flags |= DF_REF_PARTIAL; |
2599 | ref_flags |= DF_REF_MW_HARDREG; | |
6fb5fa3c | 2600 | |
e956943e | 2601 | hardreg = problem_data->mw_reg_pool->allocate (); |
23249ac4 DB |
2602 | hardreg->type = ref_type; |
2603 | hardreg->flags = ref_flags; | |
2604 | hardreg->mw_reg = reg; | |
6fb5fa3c DB |
2605 | hardreg->start_regno = regno; |
2606 | hardreg->end_regno = endregno - 1; | |
2607 | hardreg->mw_order = df->ref_order++; | |
9771b263 | 2608 | collection_rec->mw_vec.safe_push (hardreg); |
23249ac4 DB |
2609 | } |
2610 | ||
4d779342 DB |
2611 | for (i = regno; i < endregno; i++) |
2612 | { | |
b8698a0f | 2613 | ref = df_ref_create_structure (cl, collection_rec, regno_reg_rtx[i], loc, |
502ef838 | 2614 | bb, insn_info, ref_type, ref_flags); |
23249ac4 | 2615 | |
6fb5fa3c | 2616 | gcc_assert (ORIGINAL_REGNO (DF_REF_REG (ref)) == i); |
4d779342 DB |
2617 | } |
2618 | } | |
2619 | else | |
2620 | { | |
b8698a0f | 2621 | df_ref_create_structure (cl, collection_rec, reg, loc, bb, insn_info, |
502ef838 | 2622 | ref_type, ref_flags); |
4d779342 DB |
2623 | } |
2624 | } | |
2625 | ||
2626 | ||
c5ebdc25 DA |
2627 | /* Process all the registers defined in the rtx pointed by LOC. |
2628 | Autoincrement/decrement definitions will be picked up by df_uses_record. | |
2629 | Any change here has to be matched in df_find_hard_reg_defs_1. */ | |
4d779342 DB |
2630 | |
2631 | static void | |
6fb5fa3c | 2632 | df_def_record_1 (struct df_collection_rec *collection_rec, |
c5ebdc25 | 2633 | rtx *loc, basic_block bb, struct df_insn_info *insn_info, |
bbbbb16a | 2634 | int flags) |
4d779342 | 2635 | { |
c5ebdc25 | 2636 | rtx dst = *loc; |
4d779342 | 2637 | |
b5642e20 DB |
2638 | /* It is legal to have a set destination be a parallel. */ |
2639 | if (GET_CODE (dst) == PARALLEL) | |
4d779342 DB |
2640 | { |
2641 | int i; | |
4d779342 DB |
2642 | for (i = XVECLEN (dst, 0) - 1; i >= 0; i--) |
2643 | { | |
2644 | rtx temp = XVECEXP (dst, 0, i); | |
c5ebdc25 DA |
2645 | gcc_assert (GET_CODE (temp) == EXPR_LIST); |
2646 | df_def_record_1 (collection_rec, &XEXP (temp, 0), | |
2647 | bb, insn_info, flags); | |
4d779342 DB |
2648 | } |
2649 | return; | |
2650 | } | |
2651 | ||
ca9052ce | 2652 | if (GET_CODE (dst) == STRICT_LOW_PART) |
4d779342 | 2653 | { |
ca9052ce KZ |
2654 | flags |= DF_REF_READ_WRITE | DF_REF_PARTIAL | DF_REF_STRICT_LOW_PART; |
2655 | ||
2656 | loc = &XEXP (dst, 0); | |
2657 | dst = *loc; | |
2658 | } | |
2659 | ||
2660 | if (GET_CODE (dst) == ZERO_EXTRACT) | |
2661 | { | |
2662 | flags |= DF_REF_READ_WRITE | DF_REF_PARTIAL | DF_REF_ZERO_EXTRACT; | |
b8698a0f | 2663 | |
4d779342 DB |
2664 | loc = &XEXP (dst, 0); |
2665 | dst = *loc; | |
4d779342 DB |
2666 | } |
2667 | ||
ba49cb7b KZ |
2668 | /* At this point if we do not have a reg or a subreg, just return. */ |
2669 | if (REG_P (dst)) | |
2670 | { | |
502ef838 PB |
2671 | df_ref_record (DF_REF_REGULAR, collection_rec, |
2672 | dst, loc, bb, insn_info, DF_REF_REG_DEF, flags); | |
ba49cb7b KZ |
2673 | |
2674 | /* We want to keep sp alive everywhere - by making all | |
2675 | writes to sp also use of sp. */ | |
2676 | if (REGNO (dst) == STACK_POINTER_REGNUM) | |
57512f53 | 2677 | df_ref_record (DF_REF_BASE, collection_rec, |
502ef838 | 2678 | dst, NULL, bb, insn_info, DF_REF_REG_USE, flags); |
ba49cb7b KZ |
2679 | } |
2680 | else if (GET_CODE (dst) == SUBREG && REG_P (SUBREG_REG (dst))) | |
2681 | { | |
33845ca9 | 2682 | if (read_modify_subreg_p (dst)) |
ba49cb7b | 2683 | flags |= DF_REF_READ_WRITE | DF_REF_PARTIAL; |
7bb3ae2f | 2684 | |
ba49cb7b | 2685 | flags |= DF_REF_SUBREG; |
47220f03 | 2686 | |
502ef838 PB |
2687 | df_ref_record (DF_REF_REGULAR, collection_rec, |
2688 | dst, loc, bb, insn_info, DF_REF_REG_DEF, flags); | |
ba49cb7b | 2689 | } |
4d779342 DB |
2690 | } |
2691 | ||
2692 | ||
c5ebdc25 DA |
2693 | /* Process all the registers defined in the pattern rtx, X. Any change |
2694 | here has to be matched in df_find_hard_reg_defs. */ | |
4d779342 DB |
2695 | |
2696 | static void | |
b8698a0f | 2697 | df_defs_record (struct df_collection_rec *collection_rec, |
50e94c7e | 2698 | rtx x, basic_block bb, struct df_insn_info *insn_info, |
bbbbb16a | 2699 | int flags) |
4d779342 DB |
2700 | { |
2701 | RTX_CODE code = GET_CODE (x); | |
c5ebdc25 | 2702 | int i; |
4d779342 | 2703 | |
c5ebdc25 | 2704 | switch (code) |
4d779342 | 2705 | { |
c5ebdc25 DA |
2706 | case SET: |
2707 | df_def_record_1 (collection_rec, &SET_DEST (x), bb, insn_info, flags); | |
2708 | break; | |
2709 | ||
2710 | case CLOBBER: | |
2711 | flags |= DF_REF_MUST_CLOBBER; | |
2712 | df_def_record_1 (collection_rec, &XEXP (x, 0), bb, insn_info, flags); | |
2713 | break; | |
2714 | ||
2715 | case COND_EXEC: | |
b8698a0f | 2716 | df_defs_record (collection_rec, COND_EXEC_CODE (x), |
50e94c7e | 2717 | bb, insn_info, DF_REF_CONDITIONAL); |
c5ebdc25 DA |
2718 | break; |
2719 | ||
2720 | case PARALLEL: | |
2721 | for (i = 0; i < XVECLEN (x, 0); i++) | |
2722 | df_defs_record (collection_rec, XVECEXP (x, 0, i), | |
2723 | bb, insn_info, flags); | |
2724 | break; | |
2725 | default: | |
2726 | /* No DEFs to record in other cases */ | |
2727 | break; | |
4d779342 | 2728 | } |
c5ebdc25 DA |
2729 | } |
2730 | ||
2731 | /* Set bits in *DEFS for hard registers found in the rtx DST, which is the | |
2732 | destination of a set or clobber. This has to match the logic in | |
2733 | df_defs_record_1. */ | |
2734 | ||
2735 | static void | |
2736 | df_find_hard_reg_defs_1 (rtx dst, HARD_REG_SET *defs) | |
2737 | { | |
2738 | /* It is legal to have a set destination be a parallel. */ | |
2739 | if (GET_CODE (dst) == PARALLEL) | |
4d779342 DB |
2740 | { |
2741 | int i; | |
c5ebdc25 DA |
2742 | for (i = XVECLEN (dst, 0) - 1; i >= 0; i--) |
2743 | { | |
2744 | rtx temp = XVECEXP (dst, 0, i); | |
2745 | gcc_assert (GET_CODE (temp) == EXPR_LIST); | |
2746 | df_find_hard_reg_defs_1 (XEXP (temp, 0), defs); | |
2747 | } | |
2748 | return; | |
2749 | } | |
2750 | ||
2751 | if (GET_CODE (dst) == STRICT_LOW_PART) | |
2752 | dst = XEXP (dst, 0); | |
2753 | ||
2754 | if (GET_CODE (dst) == ZERO_EXTRACT) | |
2755 | dst = XEXP (dst, 0); | |
2756 | ||
2757 | /* At this point if we do not have a reg or a subreg, just return. */ | |
2758 | if (REG_P (dst) && HARD_REGISTER_P (dst)) | |
2759 | SET_HARD_REG_BIT (*defs, REGNO (dst)); | |
2760 | else if (GET_CODE (dst) == SUBREG | |
2761 | && REG_P (SUBREG_REG (dst)) && HARD_REGISTER_P (dst)) | |
2762 | SET_HARD_REG_BIT (*defs, REGNO (SUBREG_REG (dst))); | |
2763 | } | |
2764 | ||
2765 | /* Set bits in *DEFS for hard registers defined in the pattern X. This | |
2766 | has to match the logic in df_defs_record. */ | |
4d779342 | 2767 | |
c5ebdc25 DA |
2768 | static void |
2769 | df_find_hard_reg_defs (rtx x, HARD_REG_SET *defs) | |
2770 | { | |
2771 | RTX_CODE code = GET_CODE (x); | |
2772 | int i; | |
2773 | ||
2774 | switch (code) | |
2775 | { | |
2776 | case SET: | |
2777 | df_find_hard_reg_defs_1 (SET_DEST (x), defs); | |
2778 | break; | |
2779 | ||
2780 | case CLOBBER: | |
8df47bdf | 2781 | case CLOBBER_HIGH: |
c5ebdc25 DA |
2782 | df_find_hard_reg_defs_1 (XEXP (x, 0), defs); |
2783 | break; | |
2784 | ||
2785 | case COND_EXEC: | |
2786 | df_find_hard_reg_defs (COND_EXEC_CODE (x), defs); | |
2787 | break; | |
2788 | ||
2789 | case PARALLEL: | |
2790 | for (i = 0; i < XVECLEN (x, 0); i++) | |
2791 | df_find_hard_reg_defs (XVECEXP (x, 0, i), defs); | |
2792 | break; | |
2793 | default: | |
2794 | /* No DEFs to record in other cases */ | |
2795 | break; | |
4d779342 DB |
2796 | } |
2797 | } | |
2798 | ||
2799 | ||
502ef838 | 2800 | /* Process all the registers used in the rtx at address LOC. */ |
4d779342 DB |
2801 | |
2802 | static void | |
502ef838 | 2803 | df_uses_record (struct df_collection_rec *collection_rec, |
6fb5fa3c | 2804 | rtx *loc, enum df_ref_type ref_type, |
50e94c7e | 2805 | basic_block bb, struct df_insn_info *insn_info, |
502ef838 | 2806 | int flags) |
4d779342 DB |
2807 | { |
2808 | RTX_CODE code; | |
2809 | rtx x; | |
6fb5fa3c | 2810 | |
4d779342 DB |
2811 | retry: |
2812 | x = *loc; | |
2813 | if (!x) | |
2814 | return; | |
2815 | code = GET_CODE (x); | |
2816 | switch (code) | |
2817 | { | |
2818 | case LABEL_REF: | |
2819 | case SYMBOL_REF: | |
4d779342 | 2820 | case CONST: |
d8116890 | 2821 | CASE_CONST_ANY: |
4d779342 DB |
2822 | case PC: |
2823 | case CC0: | |
2824 | case ADDR_VEC: | |
2825 | case ADDR_DIFF_VEC: | |
2826 | return; | |
2827 | ||
2828 | case CLOBBER: | |
2829 | /* If we are clobbering a MEM, mark any registers inside the address | |
2830 | as being used. */ | |
2831 | if (MEM_P (XEXP (x, 0))) | |
502ef838 | 2832 | df_uses_record (collection_rec, |
6fb5fa3c | 2833 | &XEXP (XEXP (x, 0), 0), |
50e94c7e SB |
2834 | DF_REF_REG_MEM_STORE, |
2835 | bb, insn_info, | |
502ef838 | 2836 | flags); |
4d779342 DB |
2837 | |
2838 | /* If we're clobbering a REG then we have a def so ignore. */ | |
2839 | return; | |
2840 | ||
8df47bdf AH |
2841 | case CLOBBER_HIGH: |
2842 | gcc_assert (REG_P (XEXP (x, 0))); | |
2843 | return; | |
2844 | ||
4d779342 | 2845 | case MEM: |
502ef838 | 2846 | df_uses_record (collection_rec, |
b8698a0f | 2847 | &XEXP (x, 0), DF_REF_REG_MEM_LOAD, |
502ef838 | 2848 | bb, insn_info, flags & DF_REF_IN_NOTE); |
4d779342 DB |
2849 | return; |
2850 | ||
2851 | case SUBREG: | |
2852 | /* While we're here, optimize this case. */ | |
23249ac4 | 2853 | flags |= DF_REF_PARTIAL; |
4d779342 DB |
2854 | /* In case the SUBREG is not of a REG, do not optimize. */ |
2855 | if (!REG_P (SUBREG_REG (x))) | |
2856 | { | |
2857 | loc = &SUBREG_REG (x); | |
502ef838 | 2858 | df_uses_record (collection_rec, loc, ref_type, bb, insn_info, flags); |
4d779342 DB |
2859 | return; |
2860 | } | |
191816a3 | 2861 | /* Fall through */ |
4d779342 DB |
2862 | |
2863 | case REG: | |
502ef838 | 2864 | df_ref_record (DF_REF_REGULAR, collection_rec, |
50e94c7e | 2865 | x, loc, bb, insn_info, |
502ef838 | 2866 | ref_type, flags); |
4d779342 DB |
2867 | return; |
2868 | ||
ca9052ce KZ |
2869 | case SIGN_EXTRACT: |
2870 | case ZERO_EXTRACT: | |
2871 | { | |
502ef838 PB |
2872 | df_uses_record (collection_rec, |
2873 | &XEXP (x, 1), ref_type, bb, insn_info, flags); | |
2874 | df_uses_record (collection_rec, | |
2875 | &XEXP (x, 2), ref_type, bb, insn_info, flags); | |
2876 | ||
2877 | /* If the parameters to the zero or sign extract are | |
2878 | constants, strip them off and recurse, otherwise there is | |
2879 | no information that we can gain from this operation. */ | |
2880 | if (code == ZERO_EXTRACT) | |
2881 | flags |= DF_REF_ZERO_EXTRACT; | |
2882 | else | |
2883 | flags |= DF_REF_SIGN_EXTRACT; | |
2884 | ||
2885 | df_uses_record (collection_rec, | |
2886 | &XEXP (x, 0), ref_type, bb, insn_info, flags); | |
2887 | return; | |
ca9052ce KZ |
2888 | } |
2889 | break; | |
2890 | ||
4d779342 DB |
2891 | case SET: |
2892 | { | |
2893 | rtx dst = SET_DEST (x); | |
2894 | gcc_assert (!(flags & DF_REF_IN_NOTE)); | |
502ef838 PB |
2895 | df_uses_record (collection_rec, |
2896 | &SET_SRC (x), DF_REF_REG_USE, bb, insn_info, flags); | |
4d779342 DB |
2897 | |
2898 | switch (GET_CODE (dst)) | |
2899 | { | |
2900 | case SUBREG: | |
33845ca9 | 2901 | if (read_modify_subreg_p (dst)) |
4d779342 | 2902 | { |
502ef838 | 2903 | df_uses_record (collection_rec, &SUBREG_REG (dst), |
b8698a0f | 2904 | DF_REF_REG_USE, bb, insn_info, |
502ef838 | 2905 | flags | DF_REF_READ_WRITE | DF_REF_SUBREG); |
4d779342 DB |
2906 | break; |
2907 | } | |
2908 | /* Fall through. */ | |
2909 | case REG: | |
2910 | case PARALLEL: | |
2911 | case SCRATCH: | |
2912 | case PC: | |
2913 | case CC0: | |
2914 | break; | |
2915 | case MEM: | |
502ef838 PB |
2916 | df_uses_record (collection_rec, &XEXP (dst, 0), |
2917 | DF_REF_REG_MEM_STORE, bb, insn_info, flags); | |
4d779342 DB |
2918 | break; |
2919 | case STRICT_LOW_PART: | |
2920 | { | |
2921 | rtx *temp = &XEXP (dst, 0); | |
2922 | /* A strict_low_part uses the whole REG and not just the | |
2923 | SUBREG. */ | |
2924 | dst = XEXP (dst, 0); | |
502ef838 | 2925 | df_uses_record (collection_rec, |
b8698a0f | 2926 | (GET_CODE (dst) == SUBREG) ? &SUBREG_REG (dst) : temp, |
50e94c7e | 2927 | DF_REF_REG_USE, bb, insn_info, |
502ef838 | 2928 | DF_REF_READ_WRITE | DF_REF_STRICT_LOW_PART); |
4d779342 DB |
2929 | } |
2930 | break; | |
2931 | case ZERO_EXTRACT: | |
ca9052ce | 2932 | { |
502ef838 PB |
2933 | df_uses_record (collection_rec, &XEXP (dst, 1), |
2934 | DF_REF_REG_USE, bb, insn_info, flags); | |
2935 | df_uses_record (collection_rec, &XEXP (dst, 2), | |
2936 | DF_REF_REG_USE, bb, insn_info, flags); | |
2937 | if (GET_CODE (XEXP (dst,0)) == MEM) | |
2938 | df_uses_record (collection_rec, &XEXP (dst, 0), | |
2939 | DF_REF_REG_USE, bb, insn_info, | |
2940 | flags); | |
2941 | else | |
2942 | df_uses_record (collection_rec, &XEXP (dst, 0), | |
2943 | DF_REF_REG_USE, bb, insn_info, | |
2944 | DF_REF_READ_WRITE | DF_REF_ZERO_EXTRACT); | |
ca9052ce | 2945 | } |
4d779342 | 2946 | break; |
ca9052ce | 2947 | |
4d779342 DB |
2948 | default: |
2949 | gcc_unreachable (); | |
2950 | } | |
2951 | return; | |
2952 | } | |
2953 | ||
2954 | case RETURN: | |
26898771 | 2955 | case SIMPLE_RETURN: |
4d779342 DB |
2956 | break; |
2957 | ||
2958 | case ASM_OPERANDS: | |
2959 | case UNSPEC_VOLATILE: | |
2960 | case TRAP_IF: | |
2961 | case ASM_INPUT: | |
2962 | { | |
2963 | /* Traditional and volatile asm instructions must be | |
2964 | considered to use and clobber all hard registers, all | |
2965 | pseudo-registers and all of memory. So must TRAP_IF and | |
2966 | UNSPEC_VOLATILE operations. | |
2967 | ||
2968 | Consider for instance a volatile asm that changes the fpu | |
2969 | rounding mode. An insn should not be moved across this | |
2970 | even if it only uses pseudo-regs because it might give an | |
2971 | incorrectly rounded result. | |
2972 | ||
2973 | However, flow.c's liveness computation did *not* do this, | |
2974 | giving the reasoning as " ?!? Unfortunately, marking all | |
2975 | hard registers as live causes massive problems for the | |
2976 | register allocator and marking all pseudos as live creates | |
2977 | mountains of uninitialized variable warnings." | |
2978 | ||
2979 | In order to maintain the status quo with regard to liveness | |
2980 | and uses, we do what flow.c did and just mark any regs we | |
6fb5fa3c DB |
2981 | can find in ASM_OPERANDS as used. In global asm insns are |
2982 | scanned and regs_asm_clobbered is filled out. | |
4d779342 DB |
2983 | |
2984 | For all ASM_OPERANDS, we must traverse the vector of input | |
2985 | operands. We can not just fall through here since then we | |
2986 | would be confused by the ASM_INPUT rtx inside ASM_OPERANDS, | |
2987 | which do not indicate traditional asms unlike their normal | |
2988 | usage. */ | |
2989 | if (code == ASM_OPERANDS) | |
2990 | { | |
2991 | int j; | |
2992 | ||
2993 | for (j = 0; j < ASM_OPERANDS_INPUT_LENGTH (x); j++) | |
502ef838 PB |
2994 | df_uses_record (collection_rec, &ASM_OPERANDS_INPUT (x, j), |
2995 | DF_REF_REG_USE, bb, insn_info, flags); | |
4d779342 DB |
2996 | return; |
2997 | } | |
2998 | break; | |
2999 | } | |
3000 | ||
b5b8b0ac | 3001 | case VAR_LOCATION: |
502ef838 | 3002 | df_uses_record (collection_rec, |
b5b8b0ac | 3003 | &PAT_VAR_LOCATION_LOC (x), |
502ef838 | 3004 | DF_REF_REG_USE, bb, insn_info, flags); |
b5b8b0ac AO |
3005 | return; |
3006 | ||
4d779342 DB |
3007 | case PRE_DEC: |
3008 | case POST_DEC: | |
3009 | case PRE_INC: | |
3010 | case POST_INC: | |
3011 | case PRE_MODIFY: | |
3012 | case POST_MODIFY: | |
b5b8b0ac | 3013 | gcc_assert (!DEBUG_INSN_P (insn_info->insn)); |
4d779342 | 3014 | /* Catch the def of the register being modified. */ |
502ef838 | 3015 | df_ref_record (DF_REF_REGULAR, collection_rec, XEXP (x, 0), &XEXP (x, 0), |
b8698a0f | 3016 | bb, insn_info, |
203927fc | 3017 | DF_REF_REG_DEF, |
502ef838 | 3018 | flags | DF_REF_READ_WRITE | DF_REF_PRE_POST_MODIFY); |
4d779342 DB |
3019 | |
3020 | /* ... Fall through to handle uses ... */ | |
3021 | ||
3022 | default: | |
3023 | break; | |
3024 | } | |
3025 | ||
3026 | /* Recursively scan the operands of this expression. */ | |
3027 | { | |
3028 | const char *fmt = GET_RTX_FORMAT (code); | |
3029 | int i; | |
3030 | ||
3031 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
3032 | { | |
3033 | if (fmt[i] == 'e') | |
3034 | { | |
3035 | /* Tail recursive case: save a function call level. */ | |
3036 | if (i == 0) | |
3037 | { | |
3038 | loc = &XEXP (x, 0); | |
3039 | goto retry; | |
3040 | } | |
502ef838 PB |
3041 | df_uses_record (collection_rec, &XEXP (x, i), ref_type, |
3042 | bb, insn_info, flags); | |
4d779342 DB |
3043 | } |
3044 | else if (fmt[i] == 'E') | |
3045 | { | |
3046 | int j; | |
3047 | for (j = 0; j < XVECLEN (x, i); j++) | |
502ef838 | 3048 | df_uses_record (collection_rec, |
b8698a0f | 3049 | &XVECEXP (x, i, j), ref_type, |
502ef838 | 3050 | bb, insn_info, flags); |
4d779342 DB |
3051 | } |
3052 | } | |
3053 | } | |
4d779342 | 3054 | |
6fb5fa3c | 3055 | return; |
4d779342 DB |
3056 | } |
3057 | ||
3058 | ||
6fb5fa3c | 3059 | /* For all DF_REF_CONDITIONAL defs, add a corresponding uses. */ |
4d779342 | 3060 | |
6fb5fa3c DB |
3061 | static void |
3062 | df_get_conditional_uses (struct df_collection_rec *collection_rec) | |
4d779342 | 3063 | { |
c2569604 ILT |
3064 | unsigned int ix; |
3065 | df_ref ref; | |
3066 | ||
9771b263 | 3067 | FOR_EACH_VEC_ELT (collection_rec->def_vec, ix, ref) |
6fb5fa3c | 3068 | { |
6fb5fa3c DB |
3069 | if (DF_REF_FLAGS_IS_SET (ref, DF_REF_CONDITIONAL)) |
3070 | { | |
57512f53 | 3071 | df_ref use; |
ca9052ce | 3072 | |
57512f53 | 3073 | use = df_ref_create_structure (DF_REF_CLASS (ref), collection_rec, DF_REF_REG (ref), |
ca9052ce | 3074 | DF_REF_LOC (ref), DF_REF_BB (ref), |
50e94c7e | 3075 | DF_REF_INSN_INFO (ref), DF_REF_REG_USE, |
502ef838 | 3076 | DF_REF_FLAGS (ref) & ~DF_REF_CONDITIONAL); |
6fb5fa3c DB |
3077 | DF_REF_REGNO (use) = DF_REF_REGNO (ref); |
3078 | } | |
3079 | } | |
4d779342 DB |
3080 | } |
3081 | ||
3082 | ||
c5ebdc25 | 3083 | /* Get call's extra defs and uses (track caller-saved registers). */ |
4d779342 DB |
3084 | |
3085 | static void | |
c5ebdc25 | 3086 | df_get_call_refs (struct df_collection_rec *collection_rec, |
b8698a0f | 3087 | basic_block bb, |
50e94c7e | 3088 | struct df_insn_info *insn_info, |
bbbbb16a | 3089 | int flags) |
4d779342 | 3090 | { |
6fb5fa3c | 3091 | rtx note; |
6fb5fa3c DB |
3092 | bool is_sibling_call; |
3093 | unsigned int i; | |
c5ebdc25 | 3094 | HARD_REG_SET defs_generated; |
c2ba7e7a | 3095 | HARD_REG_SET fn_reg_set_usage; |
a7e3698d | 3096 | |
c5ebdc25 DA |
3097 | CLEAR_HARD_REG_SET (defs_generated); |
3098 | df_find_hard_reg_defs (PATTERN (insn_info->insn), &defs_generated); | |
3099 | is_sibling_call = SIBLING_CALL_P (insn_info->insn); | |
c2ba7e7a RO |
3100 | get_call_reg_set_usage (insn_info->insn, &fn_reg_set_usage, |
3101 | regs_invalidated_by_call); | |
4d779342 | 3102 | |
c5ebdc25 DA |
3103 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) |
3104 | { | |
3105 | if (i == STACK_POINTER_REGNUM) | |
3106 | /* The stack ptr is used (honorarily) by a CALL insn. */ | |
3107 | df_ref_record (DF_REF_BASE, collection_rec, regno_reg_rtx[i], | |
3108 | NULL, bb, insn_info, DF_REF_REG_USE, | |
3109 | DF_REF_CALL_STACK_USAGE | flags); | |
3110 | else if (global_regs[i]) | |
3111 | { | |
3112 | /* Calls to const functions cannot access any global registers and | |
3113 | calls to pure functions cannot set them. All other calls may | |
3114 | reference any of the global registers, so they are recorded as | |
3115 | used. */ | |
3116 | if (!RTL_CONST_CALL_P (insn_info->insn)) | |
3117 | { | |
3118 | df_ref_record (DF_REF_BASE, collection_rec, regno_reg_rtx[i], | |
3119 | NULL, bb, insn_info, DF_REF_REG_USE, flags); | |
3120 | if (!RTL_PURE_CALL_P (insn_info->insn)) | |
3121 | df_ref_record (DF_REF_BASE, collection_rec, regno_reg_rtx[i], | |
3122 | NULL, bb, insn_info, DF_REF_REG_DEF, flags); | |
3123 | } | |
3124 | } | |
c2ba7e7a | 3125 | else if (TEST_HARD_REG_BIT (fn_reg_set_usage, i) |
c5ebdc25 DA |
3126 | /* no clobbers for regs that are the result of the call */ |
3127 | && !TEST_HARD_REG_BIT (defs_generated, i) | |
3128 | && (!is_sibling_call | |
3129 | || !bitmap_bit_p (df->exit_block_uses, i) | |
c9bd6bcd | 3130 | || refers_to_regno_p (i, crtl->return_rtx))) |
c5ebdc25 DA |
3131 | df_ref_record (DF_REF_BASE, collection_rec, regno_reg_rtx[i], |
3132 | NULL, bb, insn_info, DF_REF_REG_DEF, | |
3133 | DF_REF_MAY_CLOBBER | flags); | |
3134 | } | |
4d779342 | 3135 | |
6fb5fa3c DB |
3136 | /* Record the registers used to pass arguments, and explicitly |
3137 | noted as clobbered. */ | |
50e94c7e | 3138 | for (note = CALL_INSN_FUNCTION_USAGE (insn_info->insn); note; |
6fb5fa3c DB |
3139 | note = XEXP (note, 1)) |
3140 | { | |
8df47bdf | 3141 | gcc_assert (GET_CODE (XEXP (note, 0)) != CLOBBER_HIGH); |
6fb5fa3c | 3142 | if (GET_CODE (XEXP (note, 0)) == USE) |
502ef838 PB |
3143 | df_uses_record (collection_rec, &XEXP (XEXP (note, 0), 0), |
3144 | DF_REF_REG_USE, bb, insn_info, flags); | |
6fb5fa3c DB |
3145 | else if (GET_CODE (XEXP (note, 0)) == CLOBBER) |
3146 | { | |
7e657ec2 EB |
3147 | if (REG_P (XEXP (XEXP (note, 0), 0))) |
3148 | { | |
3149 | unsigned int regno = REGNO (XEXP (XEXP (note, 0), 0)); | |
c5ebdc25 | 3150 | if (!TEST_HARD_REG_BIT (defs_generated, regno)) |
7e657ec2 | 3151 | df_defs_record (collection_rec, XEXP (note, 0), bb, |
50e94c7e | 3152 | insn_info, flags); |
7e657ec2 EB |
3153 | } |
3154 | else | |
502ef838 PB |
3155 | df_uses_record (collection_rec, &XEXP (note, 0), |
3156 | DF_REF_REG_USE, bb, insn_info, flags); | |
6fb5fa3c DB |
3157 | } |
3158 | } | |
4d779342 | 3159 | |
6fb5fa3c DB |
3160 | return; |
3161 | } | |
4d779342 | 3162 | |
6fb5fa3c DB |
3163 | /* Collect all refs in the INSN. This function is free of any |
3164 | side-effect - it will create and return a lists of df_ref's in the | |
3165 | COLLECTION_REC without putting those refs into existing ref chains | |
3166 | and reg chains. */ | |
4d779342 | 3167 | |
6fb5fa3c | 3168 | static void |
c5ebdc25 | 3169 | df_insn_refs_collect (struct df_collection_rec *collection_rec, |
b8698a0f | 3170 | basic_block bb, struct df_insn_info *insn_info) |
6fb5fa3c DB |
3171 | { |
3172 | rtx note; | |
50e94c7e | 3173 | bool is_cond_exec = (GET_CODE (PATTERN (insn_info->insn)) == COND_EXEC); |
4d779342 | 3174 | |
6fb5fa3c | 3175 | /* Clear out the collection record. */ |
9771b263 DN |
3176 | collection_rec->def_vec.truncate (0); |
3177 | collection_rec->use_vec.truncate (0); | |
3178 | collection_rec->eq_use_vec.truncate (0); | |
3179 | collection_rec->mw_vec.truncate (0); | |
4d779342 | 3180 | |
50e94c7e SB |
3181 | /* Process REG_EQUIV/REG_EQUAL notes. */ |
3182 | for (note = REG_NOTES (insn_info->insn); note; | |
6fb5fa3c DB |
3183 | note = XEXP (note, 1)) |
3184 | { | |
3185 | switch (REG_NOTE_KIND (note)) | |
3186 | { | |
3187 | case REG_EQUIV: | |
3188 | case REG_EQUAL: | |
502ef838 | 3189 | df_uses_record (collection_rec, |
6fb5fa3c | 3190 | &XEXP (note, 0), DF_REF_REG_USE, |
502ef838 | 3191 | bb, insn_info, DF_REF_IN_NOTE); |
6fb5fa3c DB |
3192 | break; |
3193 | case REG_NON_LOCAL_GOTO: | |
3194 | /* The frame ptr is used by a non-local goto. */ | |
57512f53 | 3195 | df_ref_record (DF_REF_BASE, collection_rec, |
6fb5fa3c | 3196 | regno_reg_rtx[FRAME_POINTER_REGNUM], |
50e94c7e | 3197 | NULL, bb, insn_info, |
502ef838 | 3198 | DF_REF_REG_USE, 0); |
c3e08036 TS |
3199 | if (!HARD_FRAME_POINTER_IS_FRAME_POINTER) |
3200 | df_ref_record (DF_REF_BASE, collection_rec, | |
3201 | regno_reg_rtx[HARD_FRAME_POINTER_REGNUM], | |
3202 | NULL, bb, insn_info, | |
3203 | DF_REF_REG_USE, 0); | |
6fb5fa3c DB |
3204 | break; |
3205 | default: | |
3206 | break; | |
3207 | } | |
4d779342 | 3208 | } |
6fb5fa3c | 3209 | |
f80041ef | 3210 | int flags = (is_cond_exec) ? DF_REF_CONDITIONAL : 0; |
c5ebdc25 DA |
3211 | /* For CALL_INSNs, first record DF_REF_BASE register defs, as well as |
3212 | uses from CALL_INSN_FUNCTION_USAGE. */ | |
50e94c7e | 3213 | if (CALL_P (insn_info->insn)) |
f80041ef BS |
3214 | df_get_call_refs (collection_rec, bb, insn_info, flags); |
3215 | ||
c5ebdc25 DA |
3216 | /* Record other defs. These should be mostly for DF_REF_REGULAR, so |
3217 | that a qsort on the defs is unnecessary in most cases. */ | |
3218 | df_defs_record (collection_rec, | |
3219 | PATTERN (insn_info->insn), bb, insn_info, 0); | |
3220 | ||
6fb5fa3c | 3221 | /* Record the register uses. */ |
502ef838 PB |
3222 | df_uses_record (collection_rec, |
3223 | &PATTERN (insn_info->insn), DF_REF_REG_USE, bb, insn_info, 0); | |
6fb5fa3c DB |
3224 | |
3225 | /* DF_REF_CONDITIONAL needs corresponding USES. */ | |
3226 | if (is_cond_exec) | |
3227 | df_get_conditional_uses (collection_rec); | |
3228 | ||
3229 | df_canonize_collection_rec (collection_rec); | |
4d779342 DB |
3230 | } |
3231 | ||
6fb5fa3c DB |
3232 | /* Recompute the luids for the insns in BB. */ |
3233 | ||
3234 | void | |
3235 | df_recompute_luids (basic_block bb) | |
4d779342 | 3236 | { |
dd3eed93 | 3237 | rtx_insn *insn; |
4d779342 | 3238 | int luid = 0; |
23249ac4 | 3239 | |
6fb5fa3c | 3240 | df_grow_insn_info (); |
4d779342 DB |
3241 | |
3242 | /* Scan the block an insn at a time from beginning to end. */ | |
3243 | FOR_BB_INSNS (bb, insn) | |
3244 | { | |
50e94c7e | 3245 | struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn); |
6fb5fa3c DB |
3246 | /* Inserting labels does not always trigger the incremental |
3247 | rescanning. */ | |
3248 | if (!insn_info) | |
4d779342 | 3249 | { |
6fb5fa3c | 3250 | gcc_assert (!INSN_P (insn)); |
50e94c7e | 3251 | insn_info = df_insn_create_insn_record (insn); |
4d779342 | 3252 | } |
6fb5fa3c | 3253 | |
50e94c7e | 3254 | DF_INSN_INFO_LUID (insn_info) = luid; |
6fb5fa3c DB |
3255 | if (INSN_P (insn)) |
3256 | luid++; | |
3257 | } | |
3258 | } | |
3259 | ||
3260 | ||
6fb5fa3c DB |
3261 | /* Collect all artificial refs at the block level for BB and add them |
3262 | to COLLECTION_REC. */ | |
3263 | ||
3264 | static void | |
3265 | df_bb_refs_collect (struct df_collection_rec *collection_rec, basic_block bb) | |
3266 | { | |
9771b263 DN |
3267 | collection_rec->def_vec.truncate (0); |
3268 | collection_rec->use_vec.truncate (0); | |
3269 | collection_rec->eq_use_vec.truncate (0); | |
3270 | collection_rec->mw_vec.truncate (0); | |
6fb5fa3c DB |
3271 | |
3272 | if (bb->index == ENTRY_BLOCK) | |
3273 | { | |
3274 | df_entry_block_defs_collect (collection_rec, df->entry_block_defs); | |
3275 | return; | |
3276 | } | |
3277 | else if (bb->index == EXIT_BLOCK) | |
3278 | { | |
3279 | df_exit_block_uses_collect (collection_rec, df->exit_block_uses); | |
3280 | return; | |
4d779342 DB |
3281 | } |
3282 | ||
ba49cb7b | 3283 | if (bb_has_eh_pred (bb)) |
4d779342 DB |
3284 | { |
3285 | unsigned int i; | |
3286 | /* Mark the registers that will contain data for the handler. */ | |
912f2dac DB |
3287 | for (i = 0; ; ++i) |
3288 | { | |
3289 | unsigned regno = EH_RETURN_DATA_REGNO (i); | |
3290 | if (regno == INVALID_REGNUM) | |
3291 | break; | |
57512f53 | 3292 | df_ref_record (DF_REF_ARTIFICIAL, collection_rec, regno_reg_rtx[regno], NULL, |
502ef838 | 3293 | bb, NULL, DF_REF_REG_DEF, DF_REF_AT_TOP); |
912f2dac | 3294 | } |
4d779342 | 3295 | } |
4d779342 | 3296 | |
6fb5fa3c DB |
3297 | /* Add the hard_frame_pointer if this block is the target of a |
3298 | non-local goto. */ | |
3299 | if (bb->flags & BB_NON_LOCAL_GOTO_TARGET) | |
57512f53 | 3300 | df_ref_record (DF_REF_ARTIFICIAL, collection_rec, hard_frame_pointer_rtx, NULL, |
502ef838 | 3301 | bb, NULL, DF_REF_REG_DEF, DF_REF_AT_TOP); |
b8698a0f | 3302 | |
6fb5fa3c DB |
3303 | /* Add the artificial uses. */ |
3304 | if (bb->index >= NUM_FIXED_BLOCKS) | |
23249ac4 DB |
3305 | { |
3306 | bitmap_iterator bi; | |
3307 | unsigned int regno; | |
b8698a0f | 3308 | bitmap au = bb_has_eh_pred (bb) |
a7e3698d JH |
3309 | ? &df->eh_block_artificial_uses |
3310 | : &df->regular_block_artificial_uses; | |
23249ac4 | 3311 | |
6fb5fa3c | 3312 | EXECUTE_IF_SET_IN_BITMAP (au, 0, regno, bi) |
23249ac4 | 3313 | { |
57512f53 | 3314 | df_ref_record (DF_REF_ARTIFICIAL, collection_rec, regno_reg_rtx[regno], NULL, |
502ef838 | 3315 | bb, NULL, DF_REF_REG_USE, 0); |
23249ac4 | 3316 | } |
4d779342 | 3317 | } |
6fb5fa3c DB |
3318 | |
3319 | df_canonize_collection_rec (collection_rec); | |
4d779342 DB |
3320 | } |
3321 | ||
268886f3 | 3322 | |
6fb5fa3c DB |
3323 | /* Record all the refs within the basic block BB_INDEX and scan the instructions if SCAN_INSNS. */ |
3324 | ||
3325 | void | |
3326 | df_bb_refs_record (int bb_index, bool scan_insns) | |
268886f3 | 3327 | { |
06e28de2 | 3328 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bb_index); |
dd3eed93 | 3329 | rtx_insn *insn; |
6fb5fa3c | 3330 | int luid = 0; |
268886f3 | 3331 | |
6fb5fa3c | 3332 | if (!df) |
268886f3 ZD |
3333 | return; |
3334 | ||
ff4c81cc | 3335 | df_collection_rec collection_rec; |
e285df08 | 3336 | df_grow_bb_info (df_scan); |
6fb5fa3c DB |
3337 | if (scan_insns) |
3338 | /* Scan the block an insn at a time from beginning to end. */ | |
3339 | FOR_BB_INSNS (bb, insn) | |
3340 | { | |
50e94c7e | 3341 | struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn); |
6fb5fa3c DB |
3342 | gcc_assert (!insn_info); |
3343 | ||
50e94c7e | 3344 | insn_info = df_insn_create_insn_record (insn); |
6fb5fa3c DB |
3345 | if (INSN_P (insn)) |
3346 | { | |
3347 | /* Record refs within INSN. */ | |
50e94c7e SB |
3348 | DF_INSN_INFO_LUID (insn_info) = luid++; |
3349 | df_insn_refs_collect (&collection_rec, bb, DF_INSN_INFO_GET (insn)); | |
ff4c81cc | 3350 | df_refs_add_to_chains (&collection_rec, bb, insn, copy_all); |
6fb5fa3c | 3351 | } |
50e94c7e | 3352 | DF_INSN_INFO_LUID (insn_info) = luid; |
6fb5fa3c DB |
3353 | } |
3354 | ||
3355 | /* Other block level artificial refs */ | |
3356 | df_bb_refs_collect (&collection_rec, bb); | |
ff4c81cc | 3357 | df_refs_add_to_chains (&collection_rec, bb, NULL, copy_all); |
c2569604 | 3358 | |
6fb5fa3c | 3359 | /* Now that the block has been processed, set the block as dirty so |
05c219bb | 3360 | LR and LIVE will get it processed. */ |
6fb5fa3c | 3361 | df_set_bb_dirty (bb); |
268886f3 | 3362 | } |
4d779342 | 3363 | |
6fb5fa3c DB |
3364 | |
3365 | /* Get the artificial use set for a regular (i.e. non-exit/non-entry) | |
3366 | block. */ | |
4d779342 DB |
3367 | |
3368 | static void | |
6fb5fa3c | 3369 | df_get_regular_block_artificial_uses (bitmap regular_block_artificial_uses) |
4d779342 | 3370 | { |
60d52d0d JJ |
3371 | #ifdef EH_USES |
3372 | unsigned int i; | |
3373 | #endif | |
3374 | ||
6fb5fa3c | 3375 | bitmap_clear (regular_block_artificial_uses); |
4d779342 | 3376 | |
6fb5fa3c | 3377 | if (reload_completed) |
4d779342 | 3378 | { |
6fb5fa3c DB |
3379 | if (frame_pointer_needed) |
3380 | bitmap_set_bit (regular_block_artificial_uses, HARD_FRAME_POINTER_REGNUM); | |
3381 | } | |
3382 | else | |
3383 | /* Before reload, there are a few registers that must be forced | |
3384 | live everywhere -- which might not already be the case for | |
3385 | blocks within infinite loops. */ | |
3386 | { | |
2098e438 JL |
3387 | unsigned int picreg = PIC_OFFSET_TABLE_REGNUM; |
3388 | ||
6fb5fa3c DB |
3389 | /* Any reference to any pseudo before reload is a potential |
3390 | reference of the frame pointer. */ | |
3391 | bitmap_set_bit (regular_block_artificial_uses, FRAME_POINTER_REGNUM); | |
b8698a0f | 3392 | |
c3e08036 TS |
3393 | if (!HARD_FRAME_POINTER_IS_FRAME_POINTER) |
3394 | bitmap_set_bit (regular_block_artificial_uses, | |
3395 | HARD_FRAME_POINTER_REGNUM); | |
6fb5fa3c | 3396 | |
6fb5fa3c DB |
3397 | /* Pseudos with argument area equivalences may require |
3398 | reloading via the argument pointer. */ | |
3f393fc6 TS |
3399 | if (FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM |
3400 | && fixed_regs[ARG_POINTER_REGNUM]) | |
6fb5fa3c | 3401 | bitmap_set_bit (regular_block_artificial_uses, ARG_POINTER_REGNUM); |
b8698a0f | 3402 | |
6fb5fa3c DB |
3403 | /* Any constant, or pseudo with constant equivalences, may |
3404 | require reloading from memory using the pic register. */ | |
2098e438 JL |
3405 | if (picreg != INVALID_REGNUM |
3406 | && fixed_regs[picreg]) | |
3407 | bitmap_set_bit (regular_block_artificial_uses, picreg); | |
4d779342 | 3408 | } |
6fb5fa3c DB |
3409 | /* The all-important stack pointer must always be live. */ |
3410 | bitmap_set_bit (regular_block_artificial_uses, STACK_POINTER_REGNUM); | |
60d52d0d JJ |
3411 | |
3412 | #ifdef EH_USES | |
3413 | /* EH_USES registers are used: | |
3414 | 1) at all insns that might throw (calls or with -fnon-call-exceptions | |
3415 | trapping insns) | |
3416 | 2) in all EH edges | |
3417 | 3) to support backtraces and/or debugging, anywhere between their | |
3418 | initialization and where they the saved registers are restored | |
3419 | from them, including the cases where we don't reach the epilogue | |
3420 | (noreturn call or infinite loop). */ | |
3421 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
3422 | if (EH_USES (i)) | |
3423 | bitmap_set_bit (regular_block_artificial_uses, i); | |
3424 | #endif | |
6fb5fa3c DB |
3425 | } |
3426 | ||
4d779342 | 3427 | |
6fb5fa3c | 3428 | /* Get the artificial use set for an eh block. */ |
912f2dac | 3429 | |
6fb5fa3c DB |
3430 | static void |
3431 | df_get_eh_block_artificial_uses (bitmap eh_block_artificial_uses) | |
3432 | { | |
3433 | bitmap_clear (eh_block_artificial_uses); | |
268886f3 | 3434 | |
073a8998 | 3435 | /* The following code (down through the arg_pointer setting APPEARS |
6fb5fa3c DB |
3436 | to be necessary because there is nothing that actually |
3437 | describes what the exception handling code may actually need | |
3438 | to keep alive. */ | |
3439 | if (reload_completed) | |
3440 | { | |
3441 | if (frame_pointer_needed) | |
3442 | { | |
3443 | bitmap_set_bit (eh_block_artificial_uses, FRAME_POINTER_REGNUM); | |
c3e08036 TS |
3444 | if (!HARD_FRAME_POINTER_IS_FRAME_POINTER) |
3445 | bitmap_set_bit (eh_block_artificial_uses, | |
3446 | HARD_FRAME_POINTER_REGNUM); | |
6fb5fa3c | 3447 | } |
3f393fc6 TS |
3448 | if (FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM |
3449 | && fixed_regs[ARG_POINTER_REGNUM]) | |
6fb5fa3c | 3450 | bitmap_set_bit (eh_block_artificial_uses, ARG_POINTER_REGNUM); |
6fb5fa3c | 3451 | } |
4d779342 DB |
3452 | } |
3453 | ||
3454 | ||
6fb5fa3c | 3455 | \f |
4d779342 DB |
3456 | /*---------------------------------------------------------------------------- |
3457 | Specialized hard register scanning functions. | |
3458 | ----------------------------------------------------------------------------*/ | |
3459 | ||
6fb5fa3c | 3460 | |
4d779342 DB |
3461 | /* Mark a register in SET. Hard registers in large modes get all |
3462 | of their component registers set as well. */ | |
3463 | ||
3464 | static void | |
3465 | df_mark_reg (rtx reg, void *vset) | |
3466 | { | |
07a737f3 | 3467 | bitmap_set_range ((bitmap) vset, REGNO (reg), REG_NREGS (reg)); |
4d779342 DB |
3468 | } |
3469 | ||
912f2dac | 3470 | |
6fb5fa3c | 3471 | /* Set the bit for regs that are considered being defined at the entry. */ |
912f2dac DB |
3472 | |
3473 | static void | |
6fb5fa3c | 3474 | df_get_entry_block_def_set (bitmap entry_block_defs) |
912f2dac | 3475 | { |
912f2dac | 3476 | rtx r; |
6fb5fa3c | 3477 | int i; |
912f2dac | 3478 | |
6fb5fa3c | 3479 | bitmap_clear (entry_block_defs); |
912f2dac | 3480 | |
7157aa85 SB |
3481 | /* For separate shrink-wrapping we use LIVE to analyze which basic blocks |
3482 | need a prologue for some component to be executed before that block, | |
3483 | and we do not care about any other registers. Hence, we do not want | |
3484 | any register for any component defined in the entry block, and we can | |
3485 | just leave all registers undefined. */ | |
3486 | if (df_scan->local_flags & DF_SCAN_EMPTY_ENTRY_EXIT) | |
3487 | return; | |
3488 | ||
912f2dac | 3489 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) |
211d71a7 SB |
3490 | { |
3491 | if (global_regs[i]) | |
3492 | bitmap_set_bit (entry_block_defs, i); | |
3493 | if (FUNCTION_ARG_REGNO_P (i)) | |
3494 | bitmap_set_bit (entry_block_defs, INCOMING_REGNO (i)); | |
3495 | } | |
b8698a0f | 3496 | |
1d489435 RS |
3497 | /* The always important stack pointer. */ |
3498 | bitmap_set_bit (entry_block_defs, STACK_POINTER_REGNUM); | |
3499 | ||
912f2dac DB |
3500 | /* Once the prologue has been generated, all of these registers |
3501 | should just show up in the first regular block. */ | |
e86a9946 | 3502 | if (targetm.have_prologue () && epilogue_completed) |
912f2dac DB |
3503 | { |
3504 | /* Defs for the callee saved registers are inserted so that the | |
3505 | pushes have some defining location. */ | |
3506 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
6fb5fa3c DB |
3507 | if ((call_used_regs[i] == 0) && (df_regs_ever_live_p (i))) |
3508 | bitmap_set_bit (entry_block_defs, i); | |
912f2dac | 3509 | } |
912f2dac | 3510 | |
bff98546 JJ |
3511 | r = targetm.calls.struct_value_rtx (current_function_decl, true); |
3512 | if (r && REG_P (r)) | |
3513 | bitmap_set_bit (entry_block_defs, REGNO (r)); | |
3514 | ||
531ca746 RH |
3515 | /* If the function has an incoming STATIC_CHAIN, it has to show up |
3516 | in the entry def set. */ | |
4b522b8f | 3517 | r = rtx_for_static_chain (current_function_decl, true); |
531ca746 RH |
3518 | if (r && REG_P (r)) |
3519 | bitmap_set_bit (entry_block_defs, REGNO (r)); | |
3520 | ||
23249ac4 | 3521 | if ((!reload_completed) || frame_pointer_needed) |
912f2dac DB |
3522 | { |
3523 | /* Any reference to any pseudo before reload is a potential | |
3524 | reference of the frame pointer. */ | |
6fb5fa3c | 3525 | bitmap_set_bit (entry_block_defs, FRAME_POINTER_REGNUM); |
c3e08036 | 3526 | |
23249ac4 | 3527 | /* If they are different, also mark the hard frame pointer as live. */ |
c3e08036 TS |
3528 | if (!HARD_FRAME_POINTER_IS_FRAME_POINTER |
3529 | && !LOCAL_REGNO (HARD_FRAME_POINTER_REGNUM)) | |
6fb5fa3c | 3530 | bitmap_set_bit (entry_block_defs, HARD_FRAME_POINTER_REGNUM); |
23249ac4 | 3531 | } |
912f2dac | 3532 | |
23249ac4 DB |
3533 | /* These registers are live everywhere. */ |
3534 | if (!reload_completed) | |
3535 | { | |
912f2dac DB |
3536 | /* Pseudos with argument area equivalences may require |
3537 | reloading via the argument pointer. */ | |
3f393fc6 TS |
3538 | if (FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM |
3539 | && fixed_regs[ARG_POINTER_REGNUM]) | |
6fb5fa3c | 3540 | bitmap_set_bit (entry_block_defs, ARG_POINTER_REGNUM); |
b8698a0f | 3541 | |
912f2dac DB |
3542 | /* Any constant, or pseudo with constant equivalences, may |
3543 | require reloading from memory using the pic register. */ | |
faa7b0de | 3544 | unsigned int picreg = PIC_OFFSET_TABLE_REGNUM; |
2098e438 JL |
3545 | if (picreg != INVALID_REGNUM |
3546 | && fixed_regs[picreg]) | |
3547 | bitmap_set_bit (entry_block_defs, picreg); | |
6fb5fa3c DB |
3548 | } |
3549 | ||
3550 | #ifdef INCOMING_RETURN_ADDR_RTX | |
3551 | if (REG_P (INCOMING_RETURN_ADDR_RTX)) | |
3552 | bitmap_set_bit (entry_block_defs, REGNO (INCOMING_RETURN_ADDR_RTX)); | |
3553 | #endif | |
b8698a0f | 3554 | |
38f8b050 | 3555 | targetm.extra_live_on_entry (entry_block_defs); |
6fb5fa3c DB |
3556 | } |
3557 | ||
3558 | ||
3559 | /* Return the (conservative) set of hard registers that are defined on | |
b8698a0f L |
3560 | entry to the function. |
3561 | It uses df->entry_block_defs to determine which register | |
6fb5fa3c DB |
3562 | reference to include. */ |
3563 | ||
3564 | static void | |
b8698a0f | 3565 | df_entry_block_defs_collect (struct df_collection_rec *collection_rec, |
6fb5fa3c DB |
3566 | bitmap entry_block_defs) |
3567 | { | |
b8698a0f | 3568 | unsigned int i; |
6fb5fa3c DB |
3569 | bitmap_iterator bi; |
3570 | ||
3571 | EXECUTE_IF_SET_IN_BITMAP (entry_block_defs, 0, i, bi) | |
3572 | { | |
b8698a0f | 3573 | df_ref_record (DF_REF_ARTIFICIAL, collection_rec, regno_reg_rtx[i], NULL, |
fefa31b5 | 3574 | ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, DF_REF_REG_DEF, 0); |
6fb5fa3c DB |
3575 | } |
3576 | ||
3577 | df_canonize_collection_rec (collection_rec); | |
3578 | } | |
3579 | ||
3580 | ||
3581 | /* Record the (conservative) set of hard registers that are defined on | |
3582 | entry to the function. */ | |
3583 | ||
3584 | static void | |
3585 | df_record_entry_block_defs (bitmap entry_block_defs) | |
3586 | { | |
3587 | struct df_collection_rec collection_rec; | |
6fb5fa3c DB |
3588 | df_entry_block_defs_collect (&collection_rec, entry_block_defs); |
3589 | ||
3590 | /* Process bb_refs chain */ | |
06e28de2 DM |
3591 | df_refs_add_to_chains (&collection_rec, |
3592 | BASIC_BLOCK_FOR_FN (cfun, ENTRY_BLOCK), | |
3593 | NULL, | |
ff4c81cc | 3594 | copy_defs); |
6fb5fa3c DB |
3595 | } |
3596 | ||
3597 | ||
15dc95cb | 3598 | /* Update the defs in the entry block. */ |
6fb5fa3c DB |
3599 | |
3600 | void | |
3601 | df_update_entry_block_defs (void) | |
3602 | { | |
6fb5fa3c | 3603 | bool changed = false; |
912f2dac | 3604 | |
d648b5ff TS |
3605 | auto_bitmap refs (&df_bitmap_obstack); |
3606 | df_get_entry_block_def_set (refs); | |
6fb5fa3c DB |
3607 | if (df->entry_block_defs) |
3608 | { | |
d648b5ff | 3609 | if (!bitmap_equal_p (df->entry_block_defs, refs)) |
6fb5fa3c DB |
3610 | { |
3611 | struct df_scan_bb_info *bb_info = df_scan_get_bb_info (ENTRY_BLOCK); | |
3612 | df_ref_chain_delete_du_chain (bb_info->artificial_defs); | |
3613 | df_ref_chain_delete (bb_info->artificial_defs); | |
3614 | bb_info->artificial_defs = NULL; | |
3615 | changed = true; | |
3616 | } | |
3617 | } | |
3618 | else | |
3619 | { | |
3620 | struct df_scan_problem_data *problem_data | |
3621 | = (struct df_scan_problem_data *) df_scan->problem_data; | |
a7e3698d | 3622 | gcc_unreachable (); |
6fb5fa3c DB |
3623 | df->entry_block_defs = BITMAP_ALLOC (&problem_data->reg_bitmaps); |
3624 | changed = true; | |
3625 | } | |
912f2dac | 3626 | |
6fb5fa3c | 3627 | if (changed) |
912f2dac | 3628 | { |
d648b5ff TS |
3629 | df_record_entry_block_defs (refs); |
3630 | bitmap_copy (df->entry_block_defs, refs); | |
06e28de2 | 3631 | df_set_bb_dirty (BASIC_BLOCK_FOR_FN (cfun, ENTRY_BLOCK)); |
912f2dac DB |
3632 | } |
3633 | } | |
3634 | ||
3635 | ||
6fb5fa3c | 3636 | /* Set the bit for regs that are considered being used at the exit. */ |
4d779342 DB |
3637 | |
3638 | static void | |
6fb5fa3c | 3639 | df_get_exit_block_use_set (bitmap exit_block_uses) |
4d779342 | 3640 | { |
b8698a0f | 3641 | unsigned int i; |
2098e438 | 3642 | unsigned int picreg = PIC_OFFSET_TABLE_REGNUM; |
4d779342 | 3643 | |
6fb5fa3c | 3644 | bitmap_clear (exit_block_uses); |
b718216c | 3645 | |
7157aa85 SB |
3646 | /* For separate shrink-wrapping we use LIVE to analyze which basic blocks |
3647 | need an epilogue for some component to be executed after that block, | |
3648 | and we do not care about any other registers. Hence, we do not want | |
3649 | any register for any component seen as used in the exit block, and we | |
3650 | can just say no registers at all are used. */ | |
3651 | if (df_scan->local_flags & DF_SCAN_EMPTY_ENTRY_EXIT) | |
3652 | return; | |
3653 | ||
b718216c SP |
3654 | /* Stack pointer is always live at the exit. */ |
3655 | bitmap_set_bit (exit_block_uses, STACK_POINTER_REGNUM); | |
b8698a0f | 3656 | |
4d779342 DB |
3657 | /* Mark the frame pointer if needed at the end of the function. |
3658 | If we end up eliminating it, it will be removed from the live | |
3659 | list of each basic block by reload. */ | |
b8698a0f | 3660 | |
23249ac4 | 3661 | if ((!reload_completed) || frame_pointer_needed) |
4d779342 | 3662 | { |
6fb5fa3c | 3663 | bitmap_set_bit (exit_block_uses, FRAME_POINTER_REGNUM); |
c3e08036 | 3664 | |
4d779342 | 3665 | /* If they are different, also mark the hard frame pointer as live. */ |
c3e08036 TS |
3666 | if (!HARD_FRAME_POINTER_IS_FRAME_POINTER |
3667 | && !LOCAL_REGNO (HARD_FRAME_POINTER_REGNUM)) | |
6fb5fa3c | 3668 | bitmap_set_bit (exit_block_uses, HARD_FRAME_POINTER_REGNUM); |
4d779342 DB |
3669 | } |
3670 | ||
4d779342 DB |
3671 | /* Many architectures have a GP register even without flag_pic. |
3672 | Assume the pic register is not in use, or will be handled by | |
3673 | other means, if it is not fixed. */ | |
f8fe0a4a | 3674 | if (!PIC_OFFSET_TABLE_REG_CALL_CLOBBERED |
2098e438 JL |
3675 | && picreg != INVALID_REGNUM |
3676 | && fixed_regs[picreg]) | |
3677 | bitmap_set_bit (exit_block_uses, picreg); | |
b8698a0f | 3678 | |
4d779342 DB |
3679 | /* Mark all global registers, and all registers used by the |
3680 | epilogue as being live at the end of the function since they | |
3681 | may be referenced by our caller. */ | |
3682 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
3683 | if (global_regs[i] || EPILOGUE_USES (i)) | |
6fb5fa3c | 3684 | bitmap_set_bit (exit_block_uses, i); |
b8698a0f | 3685 | |
e86a9946 | 3686 | if (targetm.have_epilogue () && epilogue_completed) |
4d779342 DB |
3687 | { |
3688 | /* Mark all call-saved registers that we actually used. */ | |
3689 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
6fb5fa3c | 3690 | if (df_regs_ever_live_p (i) && !LOCAL_REGNO (i) |
23249ac4 | 3691 | && !TEST_HARD_REG_BIT (regs_invalidated_by_call, i)) |
6fb5fa3c | 3692 | bitmap_set_bit (exit_block_uses, i); |
4d779342 | 3693 | } |
b8698a0f | 3694 | |
4d779342 | 3695 | /* Mark the registers that will contain data for the handler. */ |
e3b5732b | 3696 | if (reload_completed && crtl->calls_eh_return) |
4d779342 DB |
3697 | for (i = 0; ; ++i) |
3698 | { | |
3699 | unsigned regno = EH_RETURN_DATA_REGNO (i); | |
3700 | if (regno == INVALID_REGNUM) | |
3701 | break; | |
6fb5fa3c | 3702 | bitmap_set_bit (exit_block_uses, regno); |
4d779342 | 3703 | } |
4d779342 DB |
3704 | |
3705 | #ifdef EH_RETURN_STACKADJ_RTX | |
e86a9946 | 3706 | if ((!targetm.have_epilogue () || ! epilogue_completed) |
e3b5732b | 3707 | && crtl->calls_eh_return) |
4d779342 DB |
3708 | { |
3709 | rtx tmp = EH_RETURN_STACKADJ_RTX; | |
3710 | if (tmp && REG_P (tmp)) | |
6fb5fa3c | 3711 | df_mark_reg (tmp, exit_block_uses); |
4d779342 DB |
3712 | } |
3713 | #endif | |
3714 | ||
e86a9946 | 3715 | if ((!targetm.have_epilogue () || ! epilogue_completed) |
e3b5732b | 3716 | && crtl->calls_eh_return) |
4d779342 DB |
3717 | { |
3718 | rtx tmp = EH_RETURN_HANDLER_RTX; | |
3719 | if (tmp && REG_P (tmp)) | |
6fb5fa3c | 3720 | df_mark_reg (tmp, exit_block_uses); |
4d779342 | 3721 | } |
6fb5fa3c | 3722 | |
4d779342 | 3723 | /* Mark function return value. */ |
6fb5fa3c DB |
3724 | diddle_return_value (df_mark_reg, (void*) exit_block_uses); |
3725 | } | |
3726 | ||
3727 | ||
b8698a0f | 3728 | /* Return the refs of hard registers that are used in the exit block. |
6fb5fa3c DB |
3729 | It uses df->exit_block_uses to determine register to include. */ |
3730 | ||
3731 | static void | |
3732 | df_exit_block_uses_collect (struct df_collection_rec *collection_rec, bitmap exit_block_uses) | |
3733 | { | |
b8698a0f | 3734 | unsigned int i; |
6fb5fa3c DB |
3735 | bitmap_iterator bi; |
3736 | ||
3737 | EXECUTE_IF_SET_IN_BITMAP (exit_block_uses, 0, i, bi) | |
57512f53 | 3738 | df_ref_record (DF_REF_ARTIFICIAL, collection_rec, regno_reg_rtx[i], NULL, |
fefa31b5 | 3739 | EXIT_BLOCK_PTR_FOR_FN (cfun), NULL, DF_REF_REG_USE, 0); |
4d779342 | 3740 | |
6fb5fa3c DB |
3741 | /* It is deliberate that this is not put in the exit block uses but |
3742 | I do not know why. */ | |
3f393fc6 TS |
3743 | if (FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM |
3744 | && reload_completed | |
6fb5fa3c | 3745 | && !bitmap_bit_p (exit_block_uses, ARG_POINTER_REGNUM) |
fefa31b5 | 3746 | && bb_has_eh_pred (EXIT_BLOCK_PTR_FOR_FN (cfun)) |
6fb5fa3c | 3747 | && fixed_regs[ARG_POINTER_REGNUM]) |
57512f53 | 3748 | df_ref_record (DF_REF_ARTIFICIAL, collection_rec, regno_reg_rtx[ARG_POINTER_REGNUM], NULL, |
fefa31b5 | 3749 | EXIT_BLOCK_PTR_FOR_FN (cfun), NULL, DF_REF_REG_USE, 0); |
6fb5fa3c DB |
3750 | |
3751 | df_canonize_collection_rec (collection_rec); | |
3752 | } | |
3753 | ||
3754 | ||
b8698a0f | 3755 | /* Record the set of hard registers that are used in the exit block. |
6fb5fa3c DB |
3756 | It uses df->exit_block_uses to determine which bit to include. */ |
3757 | ||
3758 | static void | |
3759 | df_record_exit_block_uses (bitmap exit_block_uses) | |
3760 | { | |
3761 | struct df_collection_rec collection_rec; | |
6fb5fa3c DB |
3762 | df_exit_block_uses_collect (&collection_rec, exit_block_uses); |
3763 | ||
3764 | /* Process bb_refs chain */ | |
06e28de2 DM |
3765 | df_refs_add_to_chains (&collection_rec, |
3766 | BASIC_BLOCK_FOR_FN (cfun, EXIT_BLOCK), | |
3767 | NULL, | |
ff4c81cc | 3768 | copy_uses); |
6fb5fa3c DB |
3769 | } |
3770 | ||
3771 | ||
3772 | /* Update the uses in the exit block. */ | |
3773 | ||
3774 | void | |
3775 | df_update_exit_block_uses (void) | |
3776 | { | |
6fb5fa3c DB |
3777 | bool changed = false; |
3778 | ||
d648b5ff TS |
3779 | auto_bitmap refs (&df_bitmap_obstack); |
3780 | df_get_exit_block_use_set (refs); | |
6fb5fa3c DB |
3781 | if (df->exit_block_uses) |
3782 | { | |
d648b5ff | 3783 | if (!bitmap_equal_p (df->exit_block_uses, refs)) |
6fb5fa3c DB |
3784 | { |
3785 | struct df_scan_bb_info *bb_info = df_scan_get_bb_info (EXIT_BLOCK); | |
3786 | df_ref_chain_delete_du_chain (bb_info->artificial_uses); | |
3787 | df_ref_chain_delete (bb_info->artificial_uses); | |
3788 | bb_info->artificial_uses = NULL; | |
3789 | changed = true; | |
3790 | } | |
3791 | } | |
3792 | else | |
3793 | { | |
3794 | struct df_scan_problem_data *problem_data | |
3795 | = (struct df_scan_problem_data *) df_scan->problem_data; | |
a7e3698d | 3796 | gcc_unreachable (); |
6fb5fa3c DB |
3797 | df->exit_block_uses = BITMAP_ALLOC (&problem_data->reg_bitmaps); |
3798 | changed = true; | |
3799 | } | |
3800 | ||
3801 | if (changed) | |
3802 | { | |
d648b5ff TS |
3803 | df_record_exit_block_uses (refs); |
3804 | bitmap_copy (df->exit_block_uses, refs); | |
06e28de2 | 3805 | df_set_bb_dirty (BASIC_BLOCK_FOR_FN (cfun, EXIT_BLOCK)); |
6fb5fa3c | 3806 | } |
4d779342 DB |
3807 | } |
3808 | ||
3809 | static bool initialized = false; | |
3810 | ||
6fb5fa3c | 3811 | |
4d779342 DB |
3812 | /* Initialize some platform specific structures. */ |
3813 | ||
b8698a0f | 3814 | void |
4d779342 DB |
3815 | df_hard_reg_init (void) |
3816 | { | |
7bda4a1d | 3817 | int i; |
4d779342 | 3818 | static const struct {const int from, to; } eliminables[] = ELIMINABLE_REGS; |
53680238 | 3819 | |
4d779342 DB |
3820 | if (initialized) |
3821 | return; | |
3822 | ||
4d779342 DB |
3823 | /* Record which registers will be eliminated. We use this in |
3824 | mark_used_regs. */ | |
3825 | CLEAR_HARD_REG_SET (elim_reg_set); | |
b8698a0f | 3826 | |
4d779342 DB |
3827 | for (i = 0; i < (int) ARRAY_SIZE (eliminables); i++) |
3828 | SET_HARD_REG_BIT (elim_reg_set, eliminables[i].from); | |
b8698a0f | 3829 | |
4d779342 DB |
3830 | initialized = true; |
3831 | } | |
6fb5fa3c DB |
3832 | |
3833 | ||
3834 | /* Recompute the parts of scanning that are based on regs_ever_live | |
b8698a0f | 3835 | because something changed in that array. */ |
6fb5fa3c | 3836 | |
b8698a0f | 3837 | void |
6fb5fa3c DB |
3838 | df_update_entry_exit_and_calls (void) |
3839 | { | |
3840 | basic_block bb; | |
3841 | ||
3842 | df_update_entry_block_defs (); | |
3843 | df_update_exit_block_uses (); | |
3844 | ||
3845 | /* The call insns need to be rescanned because there may be changes | |
3846 | in the set of registers clobbered across the call. */ | |
11cd3bed | 3847 | FOR_EACH_BB_FN (bb, cfun) |
6fb5fa3c | 3848 | { |
dd3eed93 | 3849 | rtx_insn *insn; |
6fb5fa3c DB |
3850 | FOR_BB_INSNS (bb, insn) |
3851 | { | |
3852 | if (INSN_P (insn) && CALL_P (insn)) | |
3853 | df_insn_rescan (insn); | |
3854 | } | |
3855 | } | |
3856 | } | |
3857 | ||
3858 | ||
3859 | /* Return true if hard REG is actually used in the some instruction. | |
3860 | There are a fair number of conditions that affect the setting of | |
3861 | this array. See the comment in df.h for df->hard_regs_live_count | |
3862 | for the conditions that this array is set. */ | |
3863 | ||
b8698a0f | 3864 | bool |
6fb5fa3c DB |
3865 | df_hard_reg_used_p (unsigned int reg) |
3866 | { | |
6fb5fa3c DB |
3867 | return df->hard_regs_live_count[reg] != 0; |
3868 | } | |
3869 | ||
3870 | ||
3871 | /* A count of the number of times REG is actually used in the some | |
3872 | instruction. There are a fair number of conditions that affect the | |
3873 | setting of this array. See the comment in df.h for | |
3874 | df->hard_regs_live_count for the conditions that this array is | |
3875 | set. */ | |
3876 | ||
3877 | ||
3878 | unsigned int | |
3879 | df_hard_reg_used_count (unsigned int reg) | |
3880 | { | |
6fb5fa3c DB |
3881 | return df->hard_regs_live_count[reg]; |
3882 | } | |
3883 | ||
3884 | ||
3885 | /* Get the value of regs_ever_live[REGNO]. */ | |
3886 | ||
b8698a0f | 3887 | bool |
6fb5fa3c DB |
3888 | df_regs_ever_live_p (unsigned int regno) |
3889 | { | |
3890 | return regs_ever_live[regno]; | |
3891 | } | |
3892 | ||
3893 | ||
3894 | /* Set regs_ever_live[REGNO] to VALUE. If this cause regs_ever_live | |
3895 | to change, schedule that change for the next update. */ | |
3896 | ||
b8698a0f | 3897 | void |
6fb5fa3c DB |
3898 | df_set_regs_ever_live (unsigned int regno, bool value) |
3899 | { | |
3900 | if (regs_ever_live[regno] == value) | |
3901 | return; | |
3902 | ||
3903 | regs_ever_live[regno] = value; | |
3904 | if (df) | |
3905 | df->redo_entry_and_exit = true; | |
3906 | } | |
3907 | ||
3908 | ||
3909 | /* Compute "regs_ever_live" information from the underlying df | |
3910 | information. Set the vector to all false if RESET. */ | |
3911 | ||
3912 | void | |
3913 | df_compute_regs_ever_live (bool reset) | |
3914 | { | |
3915 | unsigned int i; | |
3916 | bool changed = df->redo_entry_and_exit; | |
b8698a0f | 3917 | |
6fb5fa3c DB |
3918 | if (reset) |
3919 | memset (regs_ever_live, 0, sizeof (regs_ever_live)); | |
3920 | ||
3921 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) | |
3922 | if ((!regs_ever_live[i]) && df_hard_reg_used_p (i)) | |
3923 | { | |
3924 | regs_ever_live[i] = true; | |
3925 | changed = true; | |
3926 | } | |
3927 | if (changed) | |
3928 | df_update_entry_exit_and_calls (); | |
3929 | df->redo_entry_and_exit = false; | |
3930 | } | |
3931 | ||
3932 | \f | |
3933 | /*---------------------------------------------------------------------------- | |
3934 | Dataflow ref information verification functions. | |
3935 | ||
3936 | df_reg_chain_mark (refs, regno, is_def, is_eq_use) | |
3937 | df_reg_chain_verify_unmarked (refs) | |
9771b263 | 3938 | df_refs_verify (vec<stack, va_df_ref>, ref*, bool) |
6fb5fa3c DB |
3939 | df_mws_verify (mw*, mw*, bool) |
3940 | df_insn_refs_verify (collection_rec, bb, insn, bool) | |
3941 | df_bb_refs_verify (bb, refs, bool) | |
3942 | df_bb_verify (bb) | |
3943 | df_exit_block_bitmap_verify (bool) | |
3944 | df_entry_block_bitmap_verify (bool) | |
3945 | df_scan_verify () | |
3946 | ----------------------------------------------------------------------------*/ | |
3947 | ||
3948 | ||
3949 | /* Mark all refs in the reg chain. Verify that all of the registers | |
b8698a0f | 3950 | are in the correct chain. */ |
6fb5fa3c DB |
3951 | |
3952 | static unsigned int | |
b8698a0f | 3953 | df_reg_chain_mark (df_ref refs, unsigned int regno, |
6fb5fa3c DB |
3954 | bool is_def, bool is_eq_use) |
3955 | { | |
3956 | unsigned int count = 0; | |
57512f53 | 3957 | df_ref ref; |
6fb5fa3c DB |
3958 | for (ref = refs; ref; ref = DF_REF_NEXT_REG (ref)) |
3959 | { | |
3960 | gcc_assert (!DF_REF_IS_REG_MARKED (ref)); | |
3961 | ||
3962 | /* If there are no def-use or use-def chains, make sure that all | |
3963 | of the chains are clear. */ | |
3964 | if (!df_chain) | |
3965 | gcc_assert (!DF_REF_CHAIN (ref)); | |
3966 | ||
3967 | /* Check to make sure the ref is in the correct chain. */ | |
3968 | gcc_assert (DF_REF_REGNO (ref) == regno); | |
3969 | if (is_def) | |
57512f53 | 3970 | gcc_assert (DF_REF_REG_DEF_P (ref)); |
6fb5fa3c | 3971 | else |
57512f53 | 3972 | gcc_assert (!DF_REF_REG_DEF_P (ref)); |
6fb5fa3c DB |
3973 | |
3974 | if (is_eq_use) | |
3975 | gcc_assert ((DF_REF_FLAGS (ref) & DF_REF_IN_NOTE)); | |
3976 | else | |
3977 | gcc_assert ((DF_REF_FLAGS (ref) & DF_REF_IN_NOTE) == 0); | |
3978 | ||
57512f53 KZ |
3979 | if (DF_REF_NEXT_REG (ref)) |
3980 | gcc_assert (DF_REF_PREV_REG (DF_REF_NEXT_REG (ref)) == ref); | |
6fb5fa3c DB |
3981 | count++; |
3982 | DF_REF_REG_MARK (ref); | |
3983 | } | |
3984 | return count; | |
3985 | } | |
3986 | ||
3987 | ||
b8698a0f | 3988 | /* Verify that all of the registers in the chain are unmarked. */ |
6fb5fa3c DB |
3989 | |
3990 | static void | |
57512f53 | 3991 | df_reg_chain_verify_unmarked (df_ref refs) |
6fb5fa3c | 3992 | { |
57512f53 | 3993 | df_ref ref; |
6fb5fa3c DB |
3994 | for (ref = refs; ref; ref = DF_REF_NEXT_REG (ref)) |
3995 | gcc_assert (!DF_REF_IS_REG_MARKED (ref)); | |
3996 | } | |
3997 | ||
3998 | ||
3999 | /* Verify that NEW_REC and OLD_REC have exactly the same members. */ | |
4000 | ||
4001 | static bool | |
b512946c | 4002 | df_refs_verify (const vec<df_ref, va_heap> *new_rec, df_ref old_rec, |
6fb5fa3c DB |
4003 | bool abort_if_fail) |
4004 | { | |
c2569604 ILT |
4005 | unsigned int ix; |
4006 | df_ref new_ref; | |
4007 | ||
ff4c81cc | 4008 | FOR_EACH_VEC_ELT (*new_rec, ix, new_ref) |
6fb5fa3c | 4009 | { |
b512946c | 4010 | if (old_rec == NULL || !df_ref_equal_p (new_ref, old_rec)) |
6fb5fa3c DB |
4011 | { |
4012 | if (abort_if_fail) | |
4013 | gcc_assert (0); | |
4014 | else | |
4015 | return false; | |
4016 | } | |
4017 | ||
4018 | /* Abort if fail is called from the function level verifier. If | |
4019 | that is the context, mark this reg as being seem. */ | |
4020 | if (abort_if_fail) | |
4021 | { | |
b512946c RS |
4022 | gcc_assert (DF_REF_IS_REG_MARKED (old_rec)); |
4023 | DF_REF_REG_UNMARK (old_rec); | |
6fb5fa3c DB |
4024 | } |
4025 | ||
b512946c | 4026 | old_rec = DF_REF_NEXT_LOC (old_rec); |
6fb5fa3c DB |
4027 | } |
4028 | ||
4029 | if (abort_if_fail) | |
b512946c | 4030 | gcc_assert (old_rec == NULL); |
6fb5fa3c | 4031 | else |
b512946c | 4032 | return old_rec == NULL; |
6fb5fa3c DB |
4033 | return false; |
4034 | } | |
4035 | ||
4036 | ||
4037 | /* Verify that NEW_REC and OLD_REC have exactly the same members. */ | |
4038 | ||
4039 | static bool | |
526ceb68 | 4040 | df_mws_verify (const vec<df_mw_hardreg *, va_heap> *new_rec, |
b512946c | 4041 | struct df_mw_hardreg *old_rec, |
6fb5fa3c DB |
4042 | bool abort_if_fail) |
4043 | { | |
c2569604 ILT |
4044 | unsigned int ix; |
4045 | struct df_mw_hardreg *new_reg; | |
4046 | ||
ff4c81cc | 4047 | FOR_EACH_VEC_ELT (*new_rec, ix, new_reg) |
6fb5fa3c | 4048 | { |
b512946c | 4049 | if (old_rec == NULL || !df_mw_equal_p (new_reg, old_rec)) |
6fb5fa3c DB |
4050 | { |
4051 | if (abort_if_fail) | |
4052 | gcc_assert (0); | |
4053 | else | |
4054 | return false; | |
4055 | } | |
b512946c | 4056 | old_rec = DF_MWS_NEXT (old_rec); |
6fb5fa3c DB |
4057 | } |
4058 | ||
4059 | if (abort_if_fail) | |
b512946c | 4060 | gcc_assert (old_rec == NULL); |
6fb5fa3c | 4061 | else |
b512946c | 4062 | return old_rec == NULL; |
6fb5fa3c DB |
4063 | return false; |
4064 | } | |
4065 | ||
4066 | ||
4067 | /* Return true if the existing insn refs information is complete and | |
4068 | correct. Otherwise (i.e. if there's any missing or extra refs), | |
b8698a0f | 4069 | return the correct df_ref chain in REFS_RETURN. |
6fb5fa3c DB |
4070 | |
4071 | If ABORT_IF_FAIL, leave the refs that are verified (already in the | |
4072 | ref chain) as DF_REF_MARKED(). If it's false, then it's a per-insn | |
4073 | verification mode instead of the whole function, so unmark | |
4074 | everything. | |
4075 | ||
4076 | If ABORT_IF_FAIL is set, this function never returns false. */ | |
4077 | ||
4078 | static bool | |
4079 | df_insn_refs_verify (struct df_collection_rec *collection_rec, | |
b8698a0f | 4080 | basic_block bb, |
b2908ba6 | 4081 | rtx_insn *insn, |
6fb5fa3c DB |
4082 | bool abort_if_fail) |
4083 | { | |
6173a9e3 | 4084 | bool ret1, ret2, ret3; |
6fb5fa3c | 4085 | unsigned int uid = INSN_UID (insn); |
50e94c7e | 4086 | struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn); |
6fb5fa3c | 4087 | |
50e94c7e | 4088 | df_insn_refs_collect (collection_rec, bb, insn_info); |
6fb5fa3c | 4089 | |
6fb5fa3c | 4090 | /* Unfortunately we cannot opt out early if one of these is not |
6173a9e3 | 4091 | right and abort_if_fail is set because the marks will not get cleared. */ |
ff4c81cc | 4092 | ret1 = df_refs_verify (&collection_rec->def_vec, DF_INSN_UID_DEFS (uid), |
6fb5fa3c | 4093 | abort_if_fail); |
6173a9e3 RB |
4094 | if (!ret1 && !abort_if_fail) |
4095 | return false; | |
ff4c81cc | 4096 | ret2 = df_refs_verify (&collection_rec->use_vec, DF_INSN_UID_USES (uid), |
6fb5fa3c | 4097 | abort_if_fail); |
6173a9e3 RB |
4098 | if (!ret2 && !abort_if_fail) |
4099 | return false; | |
ff4c81cc | 4100 | ret3 = df_refs_verify (&collection_rec->eq_use_vec, DF_INSN_UID_EQ_USES (uid), |
6fb5fa3c | 4101 | abort_if_fail); |
6173a9e3 RB |
4102 | if (!ret3 && !abort_if_fail) |
4103 | return false; | |
4104 | if (! df_mws_verify (&collection_rec->mw_vec, DF_INSN_UID_MWS (uid), | |
4105 | abort_if_fail)) | |
4106 | return false; | |
4107 | return (ret1 && ret2 && ret3); | |
6fb5fa3c DB |
4108 | } |
4109 | ||
4110 | ||
4111 | /* Return true if all refs in the basic block are correct and complete. | |
4112 | Due to df_ref_chain_verify, it will cause all refs | |
4113 | that are verified to have DF_REF_MARK bit set. */ | |
4114 | ||
4115 | static bool | |
4116 | df_bb_verify (basic_block bb) | |
4117 | { | |
dd3eed93 | 4118 | rtx_insn *insn; |
6fb5fa3c DB |
4119 | struct df_scan_bb_info *bb_info = df_scan_get_bb_info (bb->index); |
4120 | struct df_collection_rec collection_rec; | |
b8698a0f | 4121 | |
6fb5fa3c DB |
4122 | gcc_assert (bb_info); |
4123 | ||
57512f53 | 4124 | /* Scan the block, one insn at a time, from beginning to end. */ |
6fb5fa3c DB |
4125 | FOR_BB_INSNS_REVERSE (bb, insn) |
4126 | { | |
4127 | if (!INSN_P (insn)) | |
4128 | continue; | |
4129 | df_insn_refs_verify (&collection_rec, bb, insn, true); | |
1aee8991 | 4130 | df_free_collection_rec (&collection_rec); |
6fb5fa3c DB |
4131 | } |
4132 | ||
4133 | /* Do the artificial defs and uses. */ | |
4134 | df_bb_refs_collect (&collection_rec, bb); | |
ff4c81cc TS |
4135 | df_refs_verify (&collection_rec.def_vec, df_get_artificial_defs (bb->index), true); |
4136 | df_refs_verify (&collection_rec.use_vec, df_get_artificial_uses (bb->index), true); | |
6fb5fa3c | 4137 | df_free_collection_rec (&collection_rec); |
b8698a0f | 4138 | |
6fb5fa3c DB |
4139 | return true; |
4140 | } | |
4141 | ||
4142 | ||
b8698a0f | 4143 | /* Returns true if the entry block has correct and complete df_ref set. |
6fb5fa3c DB |
4144 | If not it either aborts if ABORT_IF_FAIL is true or returns false. */ |
4145 | ||
4146 | static bool | |
4147 | df_entry_block_bitmap_verify (bool abort_if_fail) | |
4148 | { | |
6fb5fa3c DB |
4149 | bool is_eq; |
4150 | ||
d648b5ff TS |
4151 | auto_bitmap entry_block_defs (&df_bitmap_obstack); |
4152 | df_get_entry_block_def_set (entry_block_defs); | |
6fb5fa3c | 4153 | |
d648b5ff | 4154 | is_eq = bitmap_equal_p (entry_block_defs, df->entry_block_defs); |
6fb5fa3c DB |
4155 | |
4156 | if (!is_eq && abort_if_fail) | |
4157 | { | |
6fb5fa3c | 4158 | fprintf (stderr, "entry_block_defs = "); |
d648b5ff | 4159 | df_print_regset (stderr, entry_block_defs); |
6fb5fa3c DB |
4160 | fprintf (stderr, "df->entry_block_defs = "); |
4161 | df_print_regset (stderr, df->entry_block_defs); | |
4162 | gcc_assert (0); | |
4163 | } | |
4164 | ||
6fb5fa3c DB |
4165 | return is_eq; |
4166 | } | |
4167 | ||
4168 | ||
b8698a0f | 4169 | /* Returns true if the exit block has correct and complete df_ref set. |
6fb5fa3c DB |
4170 | If not it either aborts if ABORT_IF_FAIL is true or returns false. */ |
4171 | ||
4172 | static bool | |
4173 | df_exit_block_bitmap_verify (bool abort_if_fail) | |
4174 | { | |
6fb5fa3c DB |
4175 | bool is_eq; |
4176 | ||
d648b5ff TS |
4177 | auto_bitmap exit_block_uses (&df_bitmap_obstack); |
4178 | df_get_exit_block_use_set (exit_block_uses); | |
6fb5fa3c | 4179 | |
d648b5ff | 4180 | is_eq = bitmap_equal_p (exit_block_uses, df->exit_block_uses); |
6fb5fa3c DB |
4181 | |
4182 | if (!is_eq && abort_if_fail) | |
4183 | { | |
6fb5fa3c | 4184 | fprintf (stderr, "exit_block_uses = "); |
d648b5ff | 4185 | df_print_regset (stderr, exit_block_uses); |
6fb5fa3c DB |
4186 | fprintf (stderr, "df->exit_block_uses = "); |
4187 | df_print_regset (stderr, df->exit_block_uses); | |
4188 | gcc_assert (0); | |
4189 | } | |
4190 | ||
6fb5fa3c DB |
4191 | return is_eq; |
4192 | } | |
4193 | ||
4194 | ||
cc806ac1 RS |
4195 | /* Return true if df_ref information for all insns in all blocks are |
4196 | correct and complete. */ | |
6fb5fa3c DB |
4197 | |
4198 | void | |
4199 | df_scan_verify (void) | |
4200 | { | |
4201 | unsigned int i; | |
4202 | basic_block bb; | |
6fb5fa3c DB |
4203 | |
4204 | if (!df) | |
4205 | return; | |
4206 | ||
6fb5fa3c DB |
4207 | /* Verification is a 4 step process. */ |
4208 | ||
073a8998 | 4209 | /* (1) All of the refs are marked by going through the reg chains. */ |
6fb5fa3c DB |
4210 | for (i = 0; i < DF_REG_SIZE (df); i++) |
4211 | { | |
b8698a0f | 4212 | gcc_assert (df_reg_chain_mark (DF_REG_DEF_CHAIN (i), i, true, false) |
c3284718 | 4213 | == DF_REG_DEF_COUNT (i)); |
b8698a0f | 4214 | gcc_assert (df_reg_chain_mark (DF_REG_USE_CHAIN (i), i, false, false) |
c3284718 | 4215 | == DF_REG_USE_COUNT (i)); |
b8698a0f | 4216 | gcc_assert (df_reg_chain_mark (DF_REG_EQ_USE_CHAIN (i), i, false, true) |
c3284718 | 4217 | == DF_REG_EQ_USE_COUNT (i)); |
6fb5fa3c DB |
4218 | } |
4219 | ||
4220 | /* (2) There are various bitmaps whose value may change over the | |
4221 | course of the compilation. This step recomputes them to make | |
4222 | sure that they have not slipped out of date. */ | |
d648b5ff TS |
4223 | auto_bitmap regular_block_artificial_uses (&df_bitmap_obstack); |
4224 | auto_bitmap eh_block_artificial_uses (&df_bitmap_obstack); | |
6fb5fa3c | 4225 | |
d648b5ff TS |
4226 | df_get_regular_block_artificial_uses (regular_block_artificial_uses); |
4227 | df_get_eh_block_artificial_uses (eh_block_artificial_uses); | |
6fb5fa3c | 4228 | |
d648b5ff TS |
4229 | bitmap_ior_into (eh_block_artificial_uses, |
4230 | regular_block_artificial_uses); | |
6fb5fa3c DB |
4231 | |
4232 | /* Check artificial_uses bitmaps didn't change. */ | |
d648b5ff | 4233 | gcc_assert (bitmap_equal_p (regular_block_artificial_uses, |
a7e3698d | 4234 | &df->regular_block_artificial_uses)); |
d648b5ff | 4235 | gcc_assert (bitmap_equal_p (eh_block_artificial_uses, |
a7e3698d | 4236 | &df->eh_block_artificial_uses)); |
6fb5fa3c | 4237 | |
6fb5fa3c DB |
4238 | /* Verify entry block and exit block. These only verify the bitmaps, |
4239 | the refs are verified in df_bb_verify. */ | |
4240 | df_entry_block_bitmap_verify (true); | |
4241 | df_exit_block_bitmap_verify (true); | |
b8698a0f | 4242 | |
6fb5fa3c DB |
4243 | /* (3) All of the insns in all of the blocks are traversed and the |
4244 | marks are cleared both in the artificial refs attached to the | |
4245 | blocks and the real refs inside the insns. It is a failure to | |
4246 | clear a mark that has not been set as this means that the ref in | |
4247 | the block or insn was not in the reg chain. */ | |
4248 | ||
04a90bec | 4249 | FOR_ALL_BB_FN (bb, cfun) |
6fb5fa3c DB |
4250 | df_bb_verify (bb); |
4251 | ||
4252 | /* (4) See if all reg chains are traversed a second time. This time | |
4253 | a check is made that the marks are clear. A set mark would be a | |
4254 | from a reg that is not in any insn or basic block. */ | |
4255 | ||
4256 | for (i = 0; i < DF_REG_SIZE (df); i++) | |
4257 | { | |
4258 | df_reg_chain_verify_unmarked (DF_REG_DEF_CHAIN (i)); | |
4259 | df_reg_chain_verify_unmarked (DF_REG_USE_CHAIN (i)); | |
4260 | df_reg_chain_verify_unmarked (DF_REG_EQ_USE_CHAIN (i)); | |
4261 | } | |
4262 | } |