]> git.ipfire.org Git - thirdparty/gcc.git/blame - gcc/df-scan.c
projects / thirdparty / gcc.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
c++: Handle multiple aggregate overloads [PR95319].
[thirdparty/gcc.git] / gcc / df-scan.c
CommitLineData
4d779342 1/* Scanning of rtl for dataflow analysis.
8d9254fc 2 Copyright (C) 1999-2020 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
8This file is part of GCC.
9
10GCC is free software; you can redistribute it and/or modify it under
11the terms of the GNU General Public License as published by the Free
9dcd6f09 12Software Foundation; either version 3, or (at your option) any later
4d779342
DB		 13version.
14
15GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16WARRANTY; without even the implied warranty of MERCHANTABILITY or
17FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18for more details.
19
20You should have received a copy of the GNU General Public License
9dcd6f09
NC		 21along 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"
5a5a3bc5 38#include "function-abi.h"
c2569604 39
4d779342
DB		 40/* The set of hard registers in eliminables[i].from. */
41
42static 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
6c1dae73 47class df_collection_rec
6fb5fa3c 48{
6c1dae73 49public:
00f96dc9
TS		 50 auto_vec<df_ref, 128> def_vec;
51 auto_vec<df_ref, 32> use_vec;
52 auto_vec<df_ref, 32> eq_use_vec;
526ceb68 53 auto_vec<df_mw_hardreg *, 32> mw_vec;
6fb5fa3c
DB		 54};
55
99b1c316 56static void df_ref_record (enum df_ref_class, class df_collection_rec *,
b8698a0f 57 rtx, rtx *,
50e94c7e 58 basic_block, struct df_insn_info *,
502ef838 59 enum df_ref_type, int ref_flags);
99b1c316 60static void df_def_record_1 (class df_collection_rec *, rtx *,
50e94c7e 61 basic_block, struct df_insn_info *,
bbbbb16a 62 int ref_flags);
99b1c316 63static void df_defs_record (class df_collection_rec *, rtx,
50e94c7e 64 basic_block, struct df_insn_info *,
bbbbb16a 65 int ref_flags);
99b1c316 66static void df_uses_record (class df_collection_rec *,
6fb5fa3c 67 rtx *, enum df_ref_type,
50e94c7e 68 basic_block, struct df_insn_info *,
502ef838 69 int ref_flags);
4d779342 70
dc007c1f 71static void df_install_ref_incremental (df_ref);
99b1c316 72static void df_insn_refs_collect (class df_collection_rec*,
b8698a0f 73 basic_block, struct df_insn_info *);
99b1c316 74static void df_canonize_collection_rec (class df_collection_rec *);
6fb5fa3c
DB		 75
76static void df_get_regular_block_artificial_uses (bitmap);
77static void df_get_eh_block_artificial_uses (bitmap);
78
79static void df_record_entry_block_defs (bitmap);
80static void df_record_exit_block_uses (bitmap);
81static void df_get_exit_block_use_set (bitmap);
82static void df_get_entry_block_def_set (bitmap);
4d779342 83static void df_grow_ref_info (struct df_ref_info *, unsigned int);
b512946c
RS		 84static void df_ref_chain_delete_du_chain (df_ref);
85static void df_ref_chain_delete (df_ref);
4d779342 86
99b1c316 87static void df_refs_add_to_chains (class df_collection_rec *,
b2908ba6 88 basic_block, rtx_insn *, unsigned int);
6fb5fa3c 89
99b1c316 90static bool df_insn_refs_verify (class df_collection_rec *, basic_block,
b2908ba6 91 rtx_insn *, bool);
99b1c316
MS		 92static void df_entry_block_defs_collect (class df_collection_rec *, bitmap);
93static void df_exit_block_uses_collect (class df_collection_rec *, bitmap);
b8698a0f 94static void df_install_ref (df_ref, struct df_reg_info *,
6fb5fa3c
DB		 95 struct df_ref_info *, bool);
96
b512946c
RS		 97static int df_ref_compare (df_ref, df_ref);
98static int df_ref_ptr_compare (const void *, const void *);
99static int df_mw_compare (const df_mw_hardreg *, const df_mw_hardreg *);
100static int df_mw_ptr_compare (const void *, const void *);
6fb5fa3c 101
80eb8028
SB		 102static void df_insn_info_delete (unsigned int);
103
6fb5fa3c
DB		 104/* Indexed by hardware reg number, is true if that register is ever
105 used in the current function.
106
107 In df-scan.c, this is set up to record the hard regs used
108 explicitly. Reload adds in the hard regs used for holding pseudo
109 regs. Final uses it to generate the code in the function prologue
110 and epilogue to save and restore registers as needed. */
111
112static bool regs_ever_live[FIRST_PSEUDO_REGISTER];
ff4c81cc
TS		 113
114/* Flags used to tell df_refs_add_to_chains() which vectors it should copy. */
115static const unsigned int copy_defs = 0x1;
116static const unsigned int copy_uses = 0x2;
117static const unsigned int copy_eq_uses = 0x4;
118static const unsigned int copy_mw = 0x8;
119static const unsigned int copy_all = copy_defs | copy_uses | copy_eq_uses
120| copy_mw;
4d779342
DB		 121\f
122/*----------------------------------------------------------------------------
123 SCANNING DATAFLOW PROBLEM
124
125 There are several ways in which scanning looks just like the other
126 dataflow problems. It shares the all the mechanisms for local info
127 as well as basic block info. Where it differs is when and how often
128 it gets run. It also has no need for the iterative solver.
129----------------------------------------------------------------------------*/
130
131/* Problem data for the scanning dataflow function. */
132struct df_scan_problem_data
133{
fb0b2914
ML		 134 object_allocator<df_base_ref> *ref_base_pool;
135 object_allocator<df_artificial_ref> *ref_artificial_pool;
136 object_allocator<df_regular_ref> *ref_regular_pool;
137 object_allocator<df_insn_info> *insn_pool;
138 object_allocator<df_reg_info> *reg_pool;
139 object_allocator<df_mw_hardreg> *mw_reg_pool;
e956943e 140
6fb5fa3c
DB		 141 bitmap_obstack reg_bitmaps;
142 bitmap_obstack insn_bitmaps;
4d779342
DB		 143};
144
370f38e8 145/* Internal function to shut down the scanning problem. */
b8698a0f 146static void
6fb5fa3c 147df_scan_free_internal (void)
4d779342 148{
23249ac4 149 struct df_scan_problem_data *problem_data
6fb5fa3c 150 = (struct df_scan_problem_data *) df_scan->problem_data;
4d779342 151
4d779342 152 free (df->def_info.refs);
6fb5fa3c
DB		 153 free (df->def_info.begin);
154 free (df->def_info.count);
4d779342
DB		 155 memset (&df->def_info, 0, (sizeof (struct df_ref_info)));
156
4d779342 157 free (df->use_info.refs);
6fb5fa3c
DB		 158 free (df->use_info.begin);
159 free (df->use_info.count);
4d779342
DB		 160 memset (&df->use_info, 0, (sizeof (struct df_ref_info)));
161
6fb5fa3c
DB		 162 free (df->def_regs);
163 df->def_regs = NULL;
164 free (df->use_regs);
165 df->use_regs = NULL;
166 free (df->eq_use_regs);
167 df->eq_use_regs = NULL;
168 df->regs_size = 0;
c3284718 169 DF_REG_SIZE (df) = 0;
6fb5fa3c 170
4d779342
DB		 171 free (df->insns);
172 df->insns = NULL;
6fb5fa3c 173 DF_INSN_SIZE () = 0;
4d779342 174
6fb5fa3c
DB		 175 free (df_scan->block_info);
176 df_scan->block_info = NULL;
177 df_scan->block_info_size = 0;
4d779342 178
a7e3698d
JH		 179 bitmap_clear (&df->hardware_regs_used);
180 bitmap_clear (&df->regular_block_artificial_uses);
181 bitmap_clear (&df->eh_block_artificial_uses);
912f2dac 182 BITMAP_FREE (df->entry_block_defs);
4d779342 183 BITMAP_FREE (df->exit_block_uses);
a7e3698d
JH		 184 bitmap_clear (&df->insns_to_delete);
185 bitmap_clear (&df->insns_to_rescan);
186 bitmap_clear (&df->insns_to_notes_rescan);
4d779342 187
e956943e
ML		 188 delete problem_data->ref_base_pool;
189 delete problem_data->ref_artificial_pool;
190 delete problem_data->ref_regular_pool;
191 delete problem_data->insn_pool;
192 delete problem_data->reg_pool;
193 delete problem_data->mw_reg_pool;
6fb5fa3c
DB		 194 bitmap_obstack_release (&problem_data->reg_bitmaps);
195 bitmap_obstack_release (&problem_data->insn_bitmaps);
196 free (df_scan->problem_data);
4d779342
DB		 197}
198
199
4d779342
DB		 200/* Free basic block info. */
201
202static void
6fb5fa3c 203df_scan_free_bb_info (basic_block bb, void *vbb_info)
4d779342
DB		 204{
205 struct df_scan_bb_info *bb_info = (struct df_scan_bb_info *) vbb_info;
6fb5fa3c 206 unsigned int bb_index = bb->index;
dd3eed93 207 rtx_insn *insn;
e285df08 208
b512946c
RS		 209 FOR_BB_INSNS (bb, insn)
210 if (INSN_P (insn))
211 df_insn_info_delete (INSN_UID (insn));
212
213 if (bb_index < df_scan->block_info_size)
214 bb_info = df_scan_get_bb_info (bb_index);
215
216 /* Get rid of any artificial uses or defs. */
217 df_ref_chain_delete_du_chain (bb_info->artificial_defs);
218 df_ref_chain_delete_du_chain (bb_info->artificial_uses);
219 df_ref_chain_delete (bb_info->artificial_defs);
220 df_ref_chain_delete (bb_info->artificial_uses);
221 bb_info->artificial_defs = NULL;
222 bb_info->artificial_uses = NULL;
4d779342
DB		 223}
224
225
226/* Allocate the problem data for the scanning problem. This should be
227 called when the problem is created or when the entire function is to
228 be rescanned. */
b8698a0f 229void
6fb5fa3c 230df_scan_alloc (bitmap all_blocks ATTRIBUTE_UNUSED)
4d779342 231{
4d779342 232 struct df_scan_problem_data *problem_data;
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
6fb5fa3c 260 df_grow_reg_info ();
4d779342 261
6fb5fa3c
DB		 262 df_grow_insn_info ();
263 df_grow_bb_info (df_scan);
4d779342 264
04a90bec 265 FOR_ALL_BB_FN (bb, cfun)
4d779342 266 {
6fb5fa3c
DB		 267 unsigned int bb_index = bb->index;
268 struct df_scan_bb_info *bb_info = df_scan_get_bb_info (bb_index);
4d779342
DB		 269 bb_info->artificial_defs = NULL;
270 bb_info->artificial_uses = NULL;
271 }
272
a7e3698d
JH		 273 bitmap_initialize (&df->hardware_regs_used, &problem_data->reg_bitmaps);
274 bitmap_initialize (&df->regular_block_artificial_uses, &problem_data->reg_bitmaps);
275 bitmap_initialize (&df->eh_block_artificial_uses, &problem_data->reg_bitmaps);
6fb5fa3c
DB		 276 df->entry_block_defs = BITMAP_ALLOC (&problem_data->reg_bitmaps);
277 df->exit_block_uses = BITMAP_ALLOC (&problem_data->reg_bitmaps);
a7e3698d
JH		 278 bitmap_initialize (&df->insns_to_delete, &problem_data->insn_bitmaps);
279 bitmap_initialize (&df->insns_to_rescan, &problem_data->insn_bitmaps);
280 bitmap_initialize (&df->insns_to_notes_rescan, &problem_data->insn_bitmaps);
89a95777 281 df_scan->optional_p = false;
4d779342
DB		 282}
283
284
285/* Free all of the data associated with the scan problem. */
286
b8698a0f 287static void
6fb5fa3c 288df_scan_free (void)
4d779342 289{
6fb5fa3c
DB		 290 if (df_scan->problem_data)
291 df_scan_free_internal ();
3b8266e2 292
4d779342 293 if (df->blocks_to_analyze)
6fb5fa3c
DB		 294 {
295 BITMAP_FREE (df->blocks_to_analyze);
296 df->blocks_to_analyze = NULL;
297 }
4d779342 298
6fb5fa3c 299 free (df_scan);
4d779342
DB		 300}
301
6fb5fa3c 302/* Dump the preamble for DF_SCAN dump. */
b8698a0f 303static void
6fb5fa3c 304df_scan_start_dump (FILE *file ATTRIBUTE_UNUSED)
4d779342 305{
4d779342 306 int i;
57512f53
KZ		 307 int dcount = 0;
308 int ucount = 0;
309 int ecount = 0;
310 int icount = 0;
311 int ccount = 0;
312 basic_block bb;
dd3eed93 313 rtx_insn *insn;
4d779342 314
c9250371
RS		 315 fprintf (file, ";; fully invalidated by EH \t");
316 df_print_regset
317 (file, bitmap_view<HARD_REG_SET> (eh_edge_abi.full_reg_clobbers ()));
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 377static void
6fb5fa3c
DB		 378df_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 401static 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		 435void
436df_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 454void
6fb5fa3c 455df_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 503static void
4d779342
DB		 504df_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
521static void
b8698a0f 522df_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 538void
6fb5fa3c 539df_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
562void
6fb5fa3c 563df_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
596void
b2908ba6 597df_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		 606static void
607df_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 694static void
57512f53 695df_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
722static void
b8698a0f 723df_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
803static void
804df_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 813struct df_insn_info *
b2908ba6 814df_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 834static void
b512946c 835df_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
847static void
b512946c 848df_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
861static void
b512946c 862df_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
877static void
878df_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		 904static void
905df_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
926void
b2908ba6 927df_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 986static void
99b1c316 987df_free_collection_rec (class 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 1012bool
b2908ba6 1013df_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);
99b1c316 1018 class 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
1102bool
b2908ba6 1103df_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
1157void
1158df_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		 1209void
1210df_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
1283static unsigned int
b8698a0f 1284df_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 1308static void
6fb5fa3c 1309df_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 1388static void
6fb5fa3c 1389df_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 1549static void
6fb5fa3c 1550df_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		 1565static unsigned int
1566df_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
1585static unsigned int
b8698a0f 1586df_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
1623static void
1624df_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 1662void
6fb5fa3c
DB		 1663df_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 1704void
6fb5fa3c
DB		 1705df_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
1742void
b2908ba6 1743df_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
1788static void
b8698a0f 1789df_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
1881void
e1a2b021 1882df_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 1908static void
6fb5fa3c
DB		 1909df_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
1931void
b2908ba6 1932df_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;
99b1c316 1980 class 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
2031static bool
57512f53 2032df_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
2070static int
b512946c 2071df_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
2109static int
2110df_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 2117static void
ff4c81cc 2118df_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
2180static bool
2181df_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
2196static int
b512946c 2197df_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
74a4de68 2211 return mw1->mw_order - mw2->mw_order;
6fb5fa3c
DB		 2212}
2213
b512946c
RS		 2214/* Like df_mw_compare, but compare two df_mw_hardreg** pointers R1 and R2. */
2215
2216static int
2217df_mw_ptr_compare (const void *m1, const void *m2)
2218{
2219 return df_mw_compare (*(const df_mw_hardreg *const *) m1,
2220 *(const df_mw_hardreg *const *) m2);
2221}
6fb5fa3c
DB		 2222
2223/* Sort and compress a set of refs. */
2224
c2569604 2225static void
526ceb68 2226df_sort_and_compress_mws (vec<df_mw_hardreg *, va_heap> *mw_vec)
6fb5fa3c 2227{
c2569604 2228 unsigned int count;
b8698a0f 2229 struct df_scan_problem_data *problem_data
6fb5fa3c
DB		 2230 = (struct df_scan_problem_data *) df_scan->problem_data;
2231 unsigned int i;
2232 unsigned int dist = 0;
6fb5fa3c 2233
9771b263 2234 count = mw_vec->length ();
6fb5fa3c 2235 if (count < 2)
c2569604 2236 return;
6fb5fa3c
DB		 2237 else if (count == 2)
2238 {
9771b263
DN		 2239 struct df_mw_hardreg *m0 = (*mw_vec)[0];
2240 struct df_mw_hardreg *m1 = (*mw_vec)[1];
b512946c 2241 if (df_mw_compare (m0, m1) > 0)
6fb5fa3c 2242 {
9771b263
DN		 2243 struct df_mw_hardreg *tmp = (*mw_vec)[0];
2244 (*mw_vec)[0] = (*mw_vec)[1];
2245 (*mw_vec)[1] = tmp;
6fb5fa3c
DB		 2246 }
2247 }
2248 else
b512946c 2249 mw_vec->qsort (df_mw_ptr_compare);
6fb5fa3c
DB		 2250
2251 for (i=0; i<count-dist; i++)
2252 {
2253 /* Find the next ref that is not equal to the current ref. */
c2569604 2254 while (i + dist + 1 < count
9771b263 2255 && df_mw_equal_p ((*mw_vec)[i], (*mw_vec)[i + dist + 1]))
6fb5fa3c 2256 {
e956943e 2257 problem_data->mw_reg_pool->remove ((*mw_vec)[i + dist + 1]);
6fb5fa3c
DB		 2258 dist++;
2259 }
2260 /* Copy it down to the next position. */
c2569604 2261 if (dist && i + dist + 1 < count)
9771b263 2262 (*mw_vec)[i + 1] = (*mw_vec)[i + dist + 1];
6fb5fa3c
DB		 2263 }
2264
2265 count -= dist;
9771b263 2266 mw_vec->truncate (count);
6fb5fa3c
DB		 2267}
2268
2269
2270/* Sort and remove duplicates from the COLLECTION_REC. */
2271
2272static void
99b1c316 2273df_canonize_collection_rec (class df_collection_rec *collection_rec)
6fb5fa3c 2274{
c2569604
ILT		 2275 df_sort_and_compress_refs (&collection_rec->def_vec);
2276 df_sort_and_compress_refs (&collection_rec->use_vec);
2277 df_sort_and_compress_refs (&collection_rec->eq_use_vec);
2278 df_sort_and_compress_mws (&collection_rec->mw_vec);
6fb5fa3c
DB		 2279}
2280
2281
2282/* Add the new df_ref to appropriate reg_info/ref_info chains. */
2283
2284static void
b8698a0f
L		 2285df_install_ref (df_ref this_ref,
2286 struct df_reg_info *reg_info,
6fb5fa3c
DB		 2287 struct df_ref_info *ref_info,
2288 bool add_to_table)
2289{
2290 unsigned int regno = DF_REF_REGNO (this_ref);
2291 /* Add the ref to the reg_{def,use,eq_use} chain. */
57512f53 2292 df_ref head = reg_info->reg_chain;
6fb5fa3c
DB		 2293
2294 reg_info->reg_chain = this_ref;
2295 reg_info->n_refs++;
2296
2297 if (DF_REF_FLAGS_IS_SET (this_ref, DF_HARD_REG_LIVE))
2298 {
2299 gcc_assert (regno < FIRST_PSEUDO_REGISTER);
2300 df->hard_regs_live_count[regno]++;
2301 }
2302
7a40b8b1
JH		 2303 gcc_checking_assert (DF_REF_NEXT_REG (this_ref) == NULL
2304 && DF_REF_PREV_REG (this_ref) == NULL);
6fb5fa3c
DB		 2305
2306 DF_REF_NEXT_REG (this_ref) = head;
2307
2308 /* We cannot actually link to the head of the chain. */
2309 DF_REF_PREV_REG (this_ref) = NULL;
2310
2311 if (head)
2312 DF_REF_PREV_REG (head) = this_ref;
b8698a0f 2313
6fb5fa3c
DB		 2314 if (add_to_table)
2315 {
2316 gcc_assert (ref_info->ref_order != DF_REF_ORDER_NO_TABLE);
2317 df_check_and_grow_ref_info (ref_info, 1);
2318 DF_REF_ID (this_ref) = ref_info->table_size;
2319 /* Add the ref to the big array of defs. */
2320 ref_info->refs[ref_info->table_size] = this_ref;
2321 ref_info->table_size++;
b8698a0f 2322 }
6fb5fa3c
DB		 2323 else
2324 DF_REF_ID (this_ref) = -1;
b8698a0f 2325
6fb5fa3c
DB		 2326 ref_info->total_size++;
2327}
2328
2329
2330/* This function takes one of the groups of refs (defs, uses or
2331 eq_uses) and installs the entire group into the insn. It also adds
2332 each of these refs into the appropriate chains. */
2333
b512946c 2334static df_ref
6fb5fa3c 2335df_install_refs (basic_block bb,
ff4c81cc 2336 const vec<df_ref, va_heap> *old_vec,
b8698a0f 2337 struct df_reg_info **reg_info,
6fb5fa3c
DB		 2338 struct df_ref_info *ref_info,
2339 bool is_notes)
2340{
ff4c81cc 2341 unsigned int count = old_vec->length ();
6fb5fa3c
DB		 2342 if (count)
2343 {
6fb5fa3c 2344 bool add_to_table;
c2569604
ILT		 2345 df_ref this_ref;
2346 unsigned int ix;
6fb5fa3c
DB		 2347
2348 switch (ref_info->ref_order)
2349 {
2350 case DF_REF_ORDER_UNORDERED_WITH_NOTES:
2351 case DF_REF_ORDER_BY_REG_WITH_NOTES:
2352 case DF_REF_ORDER_BY_INSN_WITH_NOTES:
2353 ref_info->ref_order = DF_REF_ORDER_UNORDERED_WITH_NOTES;
2354 add_to_table = true;
2355 break;
2356 case DF_REF_ORDER_UNORDERED:
2357 case DF_REF_ORDER_BY_REG:
2358 case DF_REF_ORDER_BY_INSN:
2359 ref_info->ref_order = DF_REF_ORDER_UNORDERED;
2360 add_to_table = !is_notes;
2361 break;
2362 default:
2363 add_to_table = false;
2364 break;
2365 }
2366
2367 /* Do not add if ref is not in the right blocks. */
2368 if (add_to_table && df->analyze_subset)
2369 add_to_table = bitmap_bit_p (df->blocks_to_analyze, bb->index);
2370
ff4c81cc 2371 FOR_EACH_VEC_ELT (*old_vec, ix, this_ref)
6fb5fa3c 2372 {
b512946c
RS		 2373 DF_REF_NEXT_LOC (this_ref) = (ix + 1 < old_vec->length ()
2374 ? (*old_vec)[ix + 1]
2375 : NULL);
b8698a0f 2376 df_install_ref (this_ref, reg_info[DF_REF_REGNO (this_ref)],
6fb5fa3c
DB		 2377 ref_info, add_to_table);
2378 }
b512946c 2379 return (*old_vec)[0];
6fb5fa3c
DB		 2380 }
2381 else
b512946c 2382 return 0;
6fb5fa3c
DB		 2383}
2384
2385
2386/* This function takes the mws installs the entire group into the
2387 insn. */
2388
b512946c 2389static struct df_mw_hardreg *
526ceb68 2390df_install_mws (const vec<df_mw_hardreg *, va_heap> *old_vec)
6fb5fa3c 2391{
ff4c81cc 2392 unsigned int count = old_vec->length ();
6fb5fa3c
DB		 2393 if (count)
2394 {
b512946c
RS		 2395 for (unsigned int i = 0; i < count - 1; i++)
2396 DF_MWS_NEXT ((*old_vec)[i]) = (*old_vec)[i + 1];
2397 DF_MWS_NEXT ((*old_vec)[count - 1]) = 0;
2398 return (*old_vec)[0];
6fb5fa3c
DB		 2399 }
2400 else
b512946c 2401 return 0;
6fb5fa3c
DB		 2402}
2403
2404
2405/* Add a chain of df_refs to appropriate ref chain/reg_info/ref_info
2406 chains and update other necessary information. */
2407
2408static void
99b1c316 2409df_refs_add_to_chains (class df_collection_rec *collection_rec,
b2908ba6 2410 basic_block bb, rtx_insn *insn, unsigned int flags)
6fb5fa3c
DB		 2411{
2412 if (insn)
2413 {
50e94c7e 2414 struct df_insn_info *insn_rec = DF_INSN_INFO_GET (insn);
6fb5fa3c
DB		 2415 /* If there is a vector in the collection rec, add it to the
2416 insn. A null rec is a signal that the caller will handle the
2417 chain specially. */
ff4c81cc 2418 if (flags & copy_defs)
6fb5fa3c 2419 {
b512946c 2420 gcc_checking_assert (!insn_rec->defs);
b8698a0f 2421 insn_rec->defs
ff4c81cc 2422 = df_install_refs (bb, &collection_rec->def_vec,
6fb5fa3c
DB		 2423 df->def_regs,
2424 &df->def_info, false);
2425 }
ff4c81cc 2426 if (flags & copy_uses)
6fb5fa3c 2427 {
b512946c 2428 gcc_checking_assert (!insn_rec->uses);
b8698a0f 2429 insn_rec->uses
ff4c81cc 2430 = df_install_refs (bb, &collection_rec->use_vec,
6fb5fa3c
DB		 2431 df->use_regs,
2432 &df->use_info, false);
2433 }
ff4c81cc 2434 if (flags & copy_eq_uses)
6fb5fa3c 2435 {
b512946c 2436 gcc_checking_assert (!insn_rec->eq_uses);
b8698a0f 2437 insn_rec->eq_uses
ff4c81cc 2438 = df_install_refs (bb, &collection_rec->eq_use_vec,
6fb5fa3c
DB		 2439 df->eq_use_regs,
2440 &df->use_info, true);
2441 }
ff4c81cc 2442 if (flags & copy_mw)
6fb5fa3c 2443 {
b512946c 2444 gcc_checking_assert (!insn_rec->mw_hardregs);
b8698a0f 2445 insn_rec->mw_hardregs
ff4c81cc 2446 = df_install_mws (&collection_rec->mw_vec);
6fb5fa3c
DB		 2447 }
2448 }
2449 else
2450 {
2451 struct df_scan_bb_info *bb_info = df_scan_get_bb_info (bb->index);
2452
b512946c 2453 gcc_checking_assert (!bb_info->artificial_defs);
b8698a0f 2454 bb_info->artificial_defs
ff4c81cc 2455 = df_install_refs (bb, &collection_rec->def_vec,
6fb5fa3c
DB		 2456 df->def_regs,
2457 &df->def_info, false);
b512946c 2458 gcc_checking_assert (!bb_info->artificial_uses);
b8698a0f 2459 bb_info->artificial_uses
ff4c81cc 2460 = df_install_refs (bb, &collection_rec->use_vec,
6fb5fa3c
DB		 2461 df->use_regs,
2462 &df->use_info, false);
2463 }
2464}
4d779342 2465
4d779342 2466
502ef838 2467/* Allocate a ref and initialize its fields. */
6fb5fa3c 2468
b8698a0f
L		 2469static df_ref
2470df_ref_create_structure (enum df_ref_class cl,
99b1c316 2471 class df_collection_rec *collection_rec,
b8698a0f 2472 rtx reg, rtx *loc,
50e94c7e 2473 basic_block bb, struct df_insn_info *info,
b8698a0f 2474 enum df_ref_type ref_type,
502ef838 2475 int ref_flags)
6fb5fa3c 2476{
57512f53 2477 df_ref this_ref = NULL;
460bdc0a 2478 unsigned int regno = REGNO (GET_CODE (reg) == SUBREG ? SUBREG_REG (reg) : reg);
6fb5fa3c
DB		 2479 struct df_scan_problem_data *problem_data
2480 = (struct df_scan_problem_data *) df_scan->problem_data;
2481
57512f53 2482 switch (cl)
ca9052ce 2483 {
57512f53 2484 case DF_REF_BASE:
e956943e 2485 this_ref = (df_ref) (problem_data->ref_base_pool->allocate ());
7a40b8b1 2486 gcc_checking_assert (loc == NULL);
57512f53
KZ		 2487 break;
2488
2489 case DF_REF_ARTIFICIAL:
e956943e 2490 this_ref = (df_ref) (problem_data->ref_artificial_pool->allocate ());
57512f53 2491 this_ref->artificial_ref.bb = bb;
7a40b8b1 2492 gcc_checking_assert (loc == NULL);
57512f53
KZ		 2493 break;
2494
2495 case DF_REF_REGULAR:
e956943e 2496 this_ref = (df_ref) (problem_data->ref_regular_pool->allocate ());
57512f53 2497 this_ref->regular_ref.loc = loc;
7a40b8b1 2498 gcc_checking_assert (loc);
57512f53 2499 break;
ca9052ce 2500 }
57512f53
KZ		 2501
2502 DF_REF_CLASS (this_ref) = cl;
6fb5fa3c
DB		 2503 DF_REF_ID (this_ref) = -1;
2504 DF_REF_REG (this_ref) = reg;
2505 DF_REF_REGNO (this_ref) = regno;
57512f53 2506 DF_REF_TYPE (this_ref) = ref_type;
50e94c7e 2507 DF_REF_INSN_INFO (this_ref) = info;
6fb5fa3c 2508 DF_REF_CHAIN (this_ref) = NULL;
6fb5fa3c 2509 DF_REF_FLAGS (this_ref) = ref_flags;
6fb5fa3c
DB		 2510 DF_REF_NEXT_REG (this_ref) = NULL;
2511 DF_REF_PREV_REG (this_ref) = NULL;
2512 DF_REF_ORDER (this_ref) = df->ref_order++;
2513
2514 /* We need to clear this bit because fwprop, and in the future
2515 possibly other optimizations sometimes create new refs using ond
2516 refs as the model. */
2517 DF_REF_FLAGS_CLEAR (this_ref, DF_HARD_REG_LIVE);
2518
2519 /* See if this ref needs to have DF_HARD_REG_LIVE bit set. */
bf743fc4
JJ		 2520 if (regno < FIRST_PSEUDO_REGISTER
2521 && !DF_REF_IS_ARTIFICIAL (this_ref)
2522 && !DEBUG_INSN_P (DF_REF_INSN (this_ref)))
6fb5fa3c 2523 {
57512f53 2524 if (DF_REF_REG_DEF_P (this_ref))
6fb5fa3c
DB		 2525 {
2526 if (!DF_REF_FLAGS_IS_SET (this_ref, DF_REF_MAY_CLOBBER))
2527 DF_REF_FLAGS_SET (this_ref, DF_HARD_REG_LIVE);
2528 }
2529 else if (!(TEST_HARD_REG_BIT (elim_reg_set, regno)
2530 && (regno == FRAME_POINTER_REGNUM
2531 || regno == ARG_POINTER_REGNUM)))
2532 DF_REF_FLAGS_SET (this_ref, DF_HARD_REG_LIVE);
2533 }
2534
2535 if (collection_rec)
2536 {
57512f53 2537 if (DF_REF_REG_DEF_P (this_ref))
9771b263 2538 collection_rec->def_vec.safe_push (this_ref);
6fb5fa3c 2539 else if (DF_REF_FLAGS (this_ref) & DF_REF_IN_NOTE)
9771b263 2540 collection_rec->eq_use_vec.safe_push (this_ref);
6fb5fa3c 2541 else
9771b263 2542 collection_rec->use_vec.safe_push (this_ref);
4d779342 2543 }
dc007c1f
PB		 2544 else
2545 df_install_ref_incremental (this_ref);
6fb5fa3c 2546
4d779342
DB		 2547 return this_ref;
2548}
2549
2550
2551/* Create new references of type DF_REF_TYPE for each part of register REG
502ef838 2552 at address LOC within INSN of BB. */
ca9052ce 2553
4d779342
DB		 2554
2555static void
b8698a0f 2556df_ref_record (enum df_ref_class cl,
99b1c316 2557 class df_collection_rec *collection_rec,
b8698a0f 2558 rtx reg, rtx *loc,
50e94c7e 2559 basic_block bb, struct df_insn_info *insn_info,
b8698a0f 2560 enum df_ref_type ref_type,
502ef838 2561 int ref_flags)
4d779342 2562{
23249ac4 2563 unsigned int regno;
4d779342 2564
7a40b8b1 2565 gcc_checking_assert (REG_P (reg) || GET_CODE (reg) == SUBREG);
4d779342 2566
4d779342
DB		 2567 regno = REGNO (GET_CODE (reg) == SUBREG ? SUBREG_REG (reg) : reg);
2568 if (regno < FIRST_PSEUDO_REGISTER)
2569 {
23249ac4
DB		 2570 struct df_mw_hardreg *hardreg = NULL;
2571 struct df_scan_problem_data *problem_data
6fb5fa3c
DB		 2572 = (struct df_scan_problem_data *) df_scan->problem_data;
2573 unsigned int i;
2574 unsigned int endregno;
57512f53 2575 df_ref ref;
4d779342 2576
4d779342 2577 if (GET_CODE (reg) == SUBREG)
f1f4e530
JM		 2578 {
2579 regno += subreg_regno_offset (regno, GET_MODE (SUBREG_REG (reg)),
2580 SUBREG_BYTE (reg), GET_MODE (reg));
09e18274 2581 endregno = regno + subreg_nregs (reg);
f1f4e530
JM		 2582 }
2583 else
72d19505 2584 endregno = END_REGNO (reg);
4d779342 2585
6fb5fa3c
DB		 2586 /* If this is a multiword hardreg, we create some extra
2587 datastructures that will enable us to easily build REG_DEAD
2588 and REG_UNUSED notes. */
dc007c1f
PB		 2589 if (collection_rec
2590 && (endregno != regno + 1) && insn_info)
23249ac4 2591 {
b8698a0f 2592 /* Sets to a subreg of a multiword register are partial.
23249ac4 2593 Sets to a non-subreg of a multiword register are not. */
6f5c1520 2594 if (GET_CODE (reg) == SUBREG)
23249ac4
DB		 2595 ref_flags |= DF_REF_PARTIAL;
2596 ref_flags |= DF_REF_MW_HARDREG;
6fb5fa3c 2597
e956943e 2598 hardreg = problem_data->mw_reg_pool->allocate ();
23249ac4
DB		 2599 hardreg->type = ref_type;
2600 hardreg->flags = ref_flags;
2601 hardreg->mw_reg = reg;
6fb5fa3c
DB		 2602 hardreg->start_regno = regno;
2603 hardreg->end_regno = endregno - 1;
2604 hardreg->mw_order = df->ref_order++;
9771b263 2605 collection_rec->mw_vec.safe_push (hardreg);
23249ac4
DB		 2606 }
2607
4d779342
DB		 2608 for (i = regno; i < endregno; i++)
2609 {
b8698a0f 2610 ref = df_ref_create_structure (cl, collection_rec, regno_reg_rtx[i], loc,
502ef838 2611 bb, insn_info, ref_type, ref_flags);
23249ac4 2612
6fb5fa3c 2613 gcc_assert (ORIGINAL_REGNO (DF_REF_REG (ref)) == i);
4d779342
DB		 2614 }
2615 }
2616 else
2617 {
b8698a0f 2618 df_ref_create_structure (cl, collection_rec, reg, loc, bb, insn_info,
502ef838 2619 ref_type, ref_flags);
4d779342
DB		 2620 }
2621}
2622
2623
c5ebdc25
DA		 2624/* Process all the registers defined in the rtx pointed by LOC.
2625 Autoincrement/decrement definitions will be picked up by df_uses_record.
2626 Any change here has to be matched in df_find_hard_reg_defs_1. */
4d779342
DB		 2627
2628static void
99b1c316 2629df_def_record_1 (class df_collection_rec *collection_rec,
c5ebdc25 2630 rtx *loc, basic_block bb, struct df_insn_info *insn_info,
bbbbb16a 2631 int flags)
4d779342 2632{
c5ebdc25 2633 rtx dst = *loc;
4d779342 2634
b5642e20
DB		 2635 /* It is legal to have a set destination be a parallel. */
2636 if (GET_CODE (dst) == PARALLEL)
4d779342
DB		 2637 {
2638 int i;
4d779342
DB		 2639 for (i = XVECLEN (dst, 0) - 1; i >= 0; i--)
2640 {
2641 rtx temp = XVECEXP (dst, 0, i);
c5ebdc25
DA		 2642 gcc_assert (GET_CODE (temp) == EXPR_LIST);
2643 df_def_record_1 (collection_rec, &XEXP (temp, 0),
2644 bb, insn_info, flags);
4d779342
DB		 2645 }
2646 return;
2647 }
2648
ca9052ce 2649 if (GET_CODE (dst) == STRICT_LOW_PART)
4d779342 2650 {
ca9052ce
KZ		 2651 flags |= DF_REF_READ_WRITE | DF_REF_PARTIAL | DF_REF_STRICT_LOW_PART;
2652
2653 loc = &XEXP (dst, 0);
2654 dst = *loc;
2655 }
2656
2657 if (GET_CODE (dst) == ZERO_EXTRACT)
2658 {
2659 flags |= DF_REF_READ_WRITE | DF_REF_PARTIAL | DF_REF_ZERO_EXTRACT;
b8698a0f 2660
4d779342
DB		 2661 loc = &XEXP (dst, 0);
2662 dst = *loc;
4d779342
DB		 2663 }
2664
ba49cb7b
KZ		 2665 /* At this point if we do not have a reg or a subreg, just return. */
2666 if (REG_P (dst))
2667 {
502ef838
PB		 2668 df_ref_record (DF_REF_REGULAR, collection_rec,
2669 dst, loc, bb, insn_info, DF_REF_REG_DEF, flags);
ba49cb7b
KZ		 2670
2671 /* We want to keep sp alive everywhere - by making all
2672 writes to sp also use of sp. */
2673 if (REGNO (dst) == STACK_POINTER_REGNUM)
57512f53 2674 df_ref_record (DF_REF_BASE, collection_rec,
502ef838 2675 dst, NULL, bb, insn_info, DF_REF_REG_USE, flags);
ba49cb7b
KZ		 2676 }
2677 else if (GET_CODE (dst) == SUBREG && REG_P (SUBREG_REG (dst)))
2678 {
33845ca9 2679 if (read_modify_subreg_p (dst))
ba49cb7b 2680 flags |= DF_REF_READ_WRITE | DF_REF_PARTIAL;
7bb3ae2f 2681
ba49cb7b 2682 flags |= DF_REF_SUBREG;
47220f03 2683
502ef838
PB		 2684 df_ref_record (DF_REF_REGULAR, collection_rec,
2685 dst, loc, bb, insn_info, DF_REF_REG_DEF, flags);
ba49cb7b 2686 }
4d779342
DB		 2687}
2688
2689
c5ebdc25
DA		 2690/* Process all the registers defined in the pattern rtx, X. Any change
2691 here has to be matched in df_find_hard_reg_defs. */
4d779342
DB		 2692
2693static void
99b1c316 2694df_defs_record (class df_collection_rec *collection_rec,
50e94c7e 2695 rtx x, basic_block bb, struct df_insn_info *insn_info,
bbbbb16a 2696 int flags)
4d779342
DB		 2697{
2698 RTX_CODE code = GET_CODE (x);
c5ebdc25 2699 int i;
4d779342 2700
c5ebdc25 2701 switch (code)
4d779342 2702 {
c5ebdc25
DA		 2703 case SET:
2704 df_def_record_1 (collection_rec, &SET_DEST (x), bb, insn_info, flags);
2705 break;
2706
2707 case CLOBBER:
2708 flags |= DF_REF_MUST_CLOBBER;
2709 df_def_record_1 (collection_rec, &XEXP (x, 0), bb, insn_info, flags);
2710 break;
2711
2712 case COND_EXEC:
b8698a0f 2713 df_defs_record (collection_rec, COND_EXEC_CODE (x),
50e94c7e 2714 bb, insn_info, DF_REF_CONDITIONAL);
c5ebdc25
DA		 2715 break;
2716
2717 case PARALLEL:
2718 for (i = 0; i < XVECLEN (x, 0); i++)
2719 df_defs_record (collection_rec, XVECEXP (x, 0, i),
2720 bb, insn_info, flags);
2721 break;
2722 default:
2723 /* No DEFs to record in other cases */
2724 break;
4d779342 2725 }
c5ebdc25
DA		 2726}
2727
2728/* Set bits in *DEFS for hard registers found in the rtx DST, which is the
2729 destination of a set or clobber. This has to match the logic in
2730 df_defs_record_1. */
2731
2732static void
2733df_find_hard_reg_defs_1 (rtx dst, HARD_REG_SET *defs)
2734{
2735 /* It is legal to have a set destination be a parallel. */
2736 if (GET_CODE (dst) == PARALLEL)
4d779342
DB		 2737 {
2738 int i;
c5ebdc25
DA		 2739 for (i = XVECLEN (dst, 0) - 1; i >= 0; i--)
2740 {
2741 rtx temp = XVECEXP (dst, 0, i);
2742 gcc_assert (GET_CODE (temp) == EXPR_LIST);
2743 df_find_hard_reg_defs_1 (XEXP (temp, 0), defs);
2744 }
2745 return;
2746 }
2747
2748 if (GET_CODE (dst) == STRICT_LOW_PART)
2749 dst = XEXP (dst, 0);
2750
2751 if (GET_CODE (dst) == ZERO_EXTRACT)
2752 dst = XEXP (dst, 0);
2753
2754 /* At this point if we do not have a reg or a subreg, just return. */
2755 if (REG_P (dst) && HARD_REGISTER_P (dst))
2756 SET_HARD_REG_BIT (*defs, REGNO (dst));
2757 else if (GET_CODE (dst) == SUBREG
2758 && REG_P (SUBREG_REG (dst)) && HARD_REGISTER_P (dst))
2759 SET_HARD_REG_BIT (*defs, REGNO (SUBREG_REG (dst)));
2760}
2761
2762/* Set bits in *DEFS for hard registers defined in the pattern X. This
2763 has to match the logic in df_defs_record. */
4d779342 2764
c5ebdc25
DA		 2765static void
2766df_find_hard_reg_defs (rtx x, HARD_REG_SET *defs)
2767{
2768 RTX_CODE code = GET_CODE (x);
2769 int i;
2770
2771 switch (code)
2772 {
2773 case SET:
2774 df_find_hard_reg_defs_1 (SET_DEST (x), defs);
2775 break;
2776
2777 case CLOBBER:
2778 df_find_hard_reg_defs_1 (XEXP (x, 0), defs);
2779 break;
2780
2781 case COND_EXEC:
2782 df_find_hard_reg_defs (COND_EXEC_CODE (x), defs);
2783 break;
2784
2785 case PARALLEL:
2786 for (i = 0; i < XVECLEN (x, 0); i++)
2787 df_find_hard_reg_defs (XVECEXP (x, 0, i), defs);
2788 break;
2789 default:
2790 /* No DEFs to record in other cases */
2791 break;
4d779342
DB		 2792 }
2793}
2794
2795
502ef838 2796/* Process all the registers used in the rtx at address LOC. */
4d779342
DB		 2797
2798static void
99b1c316 2799df_uses_record (class df_collection_rec *collection_rec,
6fb5fa3c 2800 rtx *loc, enum df_ref_type ref_type,
50e94c7e 2801 basic_block bb, struct df_insn_info *insn_info,
502ef838 2802 int flags)
4d779342
DB		 2803{
2804 RTX_CODE code;
2805 rtx x;
6fb5fa3c 2806
4d779342
DB		 2807 retry:
2808 x = *loc;
2809 if (!x)
2810 return;
2811 code = GET_CODE (x);
2812 switch (code)
2813 {
2814 case LABEL_REF:
2815 case SYMBOL_REF:
4d779342 2816 case CONST:
d8116890 2817 CASE_CONST_ANY:
4d779342
DB		 2818 case PC:
2819 case CC0:
2820 case ADDR_VEC:
2821 case ADDR_DIFF_VEC:
2822 return;
2823
2824 case CLOBBER:
2825 /* If we are clobbering a MEM, mark any registers inside the address
2826 as being used. */
2827 if (MEM_P (XEXP (x, 0)))
502ef838 2828 df_uses_record (collection_rec,
6fb5fa3c 2829 &XEXP (XEXP (x, 0), 0),
50e94c7e
SB		 2830 DF_REF_REG_MEM_STORE,
2831 bb, insn_info,
502ef838 2832 flags);
4d779342
DB		 2833
2834 /* If we're clobbering a REG then we have a def so ignore. */
2835 return;
2836
2837 case MEM:
502ef838 2838 df_uses_record (collection_rec,
b8698a0f 2839 &XEXP (x, 0), DF_REF_REG_MEM_LOAD,
502ef838 2840 bb, insn_info, flags & DF_REF_IN_NOTE);
4d779342
DB		 2841 return;
2842
2843 case SUBREG:
2844 /* While we're here, optimize this case. */
23249ac4 2845 flags |= DF_REF_PARTIAL;
4d779342
DB		 2846 /* In case the SUBREG is not of a REG, do not optimize. */
2847 if (!REG_P (SUBREG_REG (x)))
2848 {
2849 loc = &SUBREG_REG (x);
502ef838 2850 df_uses_record (collection_rec, loc, ref_type, bb, insn_info, flags);
4d779342
DB		 2851 return;
2852 }
191816a3 2853 /* Fall through */
4d779342
DB		 2854
2855 case REG:
502ef838 2856 df_ref_record (DF_REF_REGULAR, collection_rec,
50e94c7e 2857 x, loc, bb, insn_info,
502ef838 2858 ref_type, flags);
4d779342
DB		 2859 return;
2860
ca9052ce
KZ		 2861 case SIGN_EXTRACT:
2862 case ZERO_EXTRACT:
2863 {
502ef838
PB		 2864 df_uses_record (collection_rec,
2865 &XEXP (x, 1), ref_type, bb, insn_info, flags);
2866 df_uses_record (collection_rec,
2867 &XEXP (x, 2), ref_type, bb, insn_info, flags);
2868
2869 /* If the parameters to the zero or sign extract are
2870 constants, strip them off and recurse, otherwise there is
2871 no information that we can gain from this operation. */
2872 if (code == ZERO_EXTRACT)
2873 flags |= DF_REF_ZERO_EXTRACT;
2874 else
2875 flags |= DF_REF_SIGN_EXTRACT;
2876
2877 df_uses_record (collection_rec,
2878 &XEXP (x, 0), ref_type, bb, insn_info, flags);
2879 return;
ca9052ce
KZ		 2880 }
2881 break;
2882
4d779342
DB		 2883 case SET:
2884 {
2885 rtx dst = SET_DEST (x);
2886 gcc_assert (!(flags & DF_REF_IN_NOTE));
502ef838
PB		 2887 df_uses_record (collection_rec,
2888 &SET_SRC (x), DF_REF_REG_USE, bb, insn_info, flags);
4d779342
DB		 2889
2890 switch (GET_CODE (dst))
2891 {
2892 case SUBREG:
33845ca9 2893 if (read_modify_subreg_p (dst))
4d779342 2894 {
502ef838 2895 df_uses_record (collection_rec, &SUBREG_REG (dst),
b8698a0f 2896 DF_REF_REG_USE, bb, insn_info,
502ef838 2897 flags | DF_REF_READ_WRITE | DF_REF_SUBREG);
4d779342
DB		 2898 break;
2899 }
2900 /* Fall through. */
2901 case REG:
2902 case PARALLEL:
2903 case SCRATCH:
2904 case PC:
2905 case CC0:
2906 break;
2907 case MEM:
502ef838
PB		 2908 df_uses_record (collection_rec, &XEXP (dst, 0),
2909 DF_REF_REG_MEM_STORE, bb, insn_info, flags);
4d779342
DB		 2910 break;
2911 case STRICT_LOW_PART:
2912 {
2913 rtx *temp = &XEXP (dst, 0);
2914 /* A strict_low_part uses the whole REG and not just the
2915 SUBREG. */
2916 dst = XEXP (dst, 0);
502ef838 2917 df_uses_record (collection_rec,
b8698a0f 2918 (GET_CODE (dst) == SUBREG) ? &SUBREG_REG (dst) : temp,
50e94c7e 2919 DF_REF_REG_USE, bb, insn_info,
502ef838 2920 DF_REF_READ_WRITE | DF_REF_STRICT_LOW_PART);
4d779342
DB		 2921 }
2922 break;
2923 case ZERO_EXTRACT:
ca9052ce 2924 {
502ef838
PB		 2925 df_uses_record (collection_rec, &XEXP (dst, 1),
2926 DF_REF_REG_USE, bb, insn_info, flags);
2927 df_uses_record (collection_rec, &XEXP (dst, 2),
2928 DF_REF_REG_USE, bb, insn_info, flags);
2929 if (GET_CODE (XEXP (dst,0)) == MEM)
2930 df_uses_record (collection_rec, &XEXP (dst, 0),
2931 DF_REF_REG_USE, bb, insn_info,
2932 flags);
2933 else
2934 df_uses_record (collection_rec, &XEXP (dst, 0),
2935 DF_REF_REG_USE, bb, insn_info,
2936 DF_REF_READ_WRITE | DF_REF_ZERO_EXTRACT);
ca9052ce 2937 }
4d779342 2938 break;
ca9052ce 2939
4d779342
DB		 2940 default:
2941 gcc_unreachable ();
2942 }
2943 return;
2944 }
2945
2946 case RETURN:
26898771 2947 case SIMPLE_RETURN:
4d779342
DB		 2948 break;
2949
2950 case ASM_OPERANDS:
2951 case UNSPEC_VOLATILE:
2952 case TRAP_IF:
2953 case ASM_INPUT:
2954 {
2955 /* Traditional and volatile asm instructions must be
2956 considered to use and clobber all hard registers, all
2957 pseudo-registers and all of memory. So must TRAP_IF and
2958 UNSPEC_VOLATILE operations.
2959
2960 Consider for instance a volatile asm that changes the fpu
2961 rounding mode. An insn should not be moved across this
2962 even if it only uses pseudo-regs because it might give an
2963 incorrectly rounded result.
2964
2965 However, flow.c's liveness computation did *not* do this,
2966 giving the reasoning as " ?!? Unfortunately, marking all
2967 hard registers as live causes massive problems for the
2968 register allocator and marking all pseudos as live creates
2969 mountains of uninitialized variable warnings."
2970
2971 In order to maintain the status quo with regard to liveness
2972 and uses, we do what flow.c did and just mark any regs we
6fb5fa3c
DB		 2973 can find in ASM_OPERANDS as used. In global asm insns are
2974 scanned and regs_asm_clobbered is filled out.
4d779342
DB		 2975
2976 For all ASM_OPERANDS, we must traverse the vector of input
67914693 2977 operands. We cannot just fall through here since then we
4d779342
DB		 2978 would be confused by the ASM_INPUT rtx inside ASM_OPERANDS,
2979 which do not indicate traditional asms unlike their normal
2980 usage. */
2981 if (code == ASM_OPERANDS)
2982 {
2983 int j;
2984
2985 for (j = 0; j < ASM_OPERANDS_INPUT_LENGTH (x); j++)
502ef838
PB		 2986 df_uses_record (collection_rec, &ASM_OPERANDS_INPUT (x, j),
2987 DF_REF_REG_USE, bb, insn_info, flags);
4d779342
DB		 2988 return;
2989 }
2990 break;
2991 }
2992
b5b8b0ac 2993 case VAR_LOCATION:
502ef838 2994 df_uses_record (collection_rec,
b5b8b0ac 2995 &PAT_VAR_LOCATION_LOC (x),
502ef838 2996 DF_REF_REG_USE, bb, insn_info, flags);
b5b8b0ac
AO		 2997 return;
2998
4d779342
DB		 2999 case PRE_DEC:
3000 case POST_DEC:
3001 case PRE_INC:
3002 case POST_INC:
3003 case PRE_MODIFY:
3004 case POST_MODIFY:
b5b8b0ac 3005 gcc_assert (!DEBUG_INSN_P (insn_info->insn));
4d779342 3006 /* Catch the def of the register being modified. */
502ef838 3007 df_ref_record (DF_REF_REGULAR, collection_rec, XEXP (x, 0), &XEXP (x, 0),
b8698a0f 3008 bb, insn_info,
203927fc 3009 DF_REF_REG_DEF,
502ef838 3010 flags | DF_REF_READ_WRITE | DF_REF_PRE_POST_MODIFY);
4d779342
DB		 3011
3012 /* ... Fall through to handle uses ... */
3013
3014 default:
3015 break;
3016 }
3017
3018 /* Recursively scan the operands of this expression. */
3019 {
3020 const char *fmt = GET_RTX_FORMAT (code);
3021 int i;
3022
3023 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3024 {
3025 if (fmt[i] == 'e')
3026 {
3027 /* Tail recursive case: save a function call level. */
3028 if (i == 0)
3029 {
3030 loc = &XEXP (x, 0);
3031 goto retry;
3032 }
502ef838
PB		 3033 df_uses_record (collection_rec, &XEXP (x, i), ref_type,
3034 bb, insn_info, flags);
4d779342
DB		 3035 }
3036 else if (fmt[i] == 'E')
3037 {
3038 int j;
3039 for (j = 0; j < XVECLEN (x, i); j++)
502ef838 3040 df_uses_record (collection_rec,
b8698a0f 3041 &XVECEXP (x, i, j), ref_type,
502ef838 3042 bb, insn_info, flags);
4d779342
DB		 3043 }
3044 }
3045 }
4d779342 3046
6fb5fa3c 3047 return;
4d779342
DB		 3048}
3049
3050
6fb5fa3c 3051/* For all DF_REF_CONDITIONAL defs, add a corresponding uses. */
4d779342 3052
6fb5fa3c 3053static void
99b1c316 3054df_get_conditional_uses (class df_collection_rec *collection_rec)
4d779342 3055{
c2569604
ILT		 3056 unsigned int ix;
3057 df_ref ref;
3058
9771b263 3059 FOR_EACH_VEC_ELT (collection_rec->def_vec, ix, ref)
6fb5fa3c 3060 {
6fb5fa3c
DB		 3061 if (DF_REF_FLAGS_IS_SET (ref, DF_REF_CONDITIONAL))
3062 {
57512f53 3063 df_ref use;
ca9052ce 3064
57512f53 3065 use = df_ref_create_structure (DF_REF_CLASS (ref), collection_rec, DF_REF_REG (ref),
ca9052ce 3066 DF_REF_LOC (ref), DF_REF_BB (ref),
50e94c7e 3067 DF_REF_INSN_INFO (ref), DF_REF_REG_USE,
502ef838 3068 DF_REF_FLAGS (ref) & ~DF_REF_CONDITIONAL);
6fb5fa3c
DB		 3069 DF_REF_REGNO (use) = DF_REF_REGNO (ref);
3070 }
3071 }
4d779342
DB		 3072}
3073
3074
c5ebdc25 3075/* Get call's extra defs and uses (track caller-saved registers). */
4d779342
DB		 3076
3077static void
99b1c316 3078df_get_call_refs (class df_collection_rec *collection_rec,
b8698a0f 3079 basic_block bb,
50e94c7e 3080 struct df_insn_info *insn_info,
bbbbb16a 3081 int flags)
4d779342 3082{
6fb5fa3c 3083 rtx note;
6fb5fa3c
DB		 3084 bool is_sibling_call;
3085 unsigned int i;
c5ebdc25 3086 HARD_REG_SET defs_generated;
a7e3698d 3087
c5ebdc25
DA		 3088 CLEAR_HARD_REG_SET (defs_generated);
3089 df_find_hard_reg_defs (PATTERN (insn_info->insn), &defs_generated);
3090 is_sibling_call = SIBLING_CALL_P (insn_info->insn);
5a5a3bc5 3091 function_abi callee_abi = insn_callee_abi (insn_info->insn);
4d779342 3092
c5ebdc25
DA		 3093 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3094 {
3095 if (i == STACK_POINTER_REGNUM)
3096 /* The stack ptr is used (honorarily) by a CALL insn. */
3097 df_ref_record (DF_REF_BASE, collection_rec, regno_reg_rtx[i],
3098 NULL, bb, insn_info, DF_REF_REG_USE,
3099 DF_REF_CALL_STACK_USAGE | flags);
3100 else if (global_regs[i])
3101 {
3102 /* Calls to const functions cannot access any global registers and
3103 calls to pure functions cannot set them. All other calls may
3104 reference any of the global registers, so they are recorded as
3105 used. */
3106 if (!RTL_CONST_CALL_P (insn_info->insn))
3107 {
3108 df_ref_record (DF_REF_BASE, collection_rec, regno_reg_rtx[i],
3109 NULL, bb, insn_info, DF_REF_REG_USE, flags);
3110 if (!RTL_PURE_CALL_P (insn_info->insn))
3111 df_ref_record (DF_REF_BASE, collection_rec, regno_reg_rtx[i],
3112 NULL, bb, insn_info, DF_REF_REG_DEF, flags);
3113 }
3114 }
5a5a3bc5 3115 else if (callee_abi.clobbers_full_reg_p (i)
c5ebdc25
DA		 3116 /* no clobbers for regs that are the result of the call */
3117 && !TEST_HARD_REG_BIT (defs_generated, i)
3118 && (!is_sibling_call
3119 || !bitmap_bit_p (df->exit_block_uses, i)
c9bd6bcd 3120 || refers_to_regno_p (i, crtl->return_rtx)))
c5ebdc25
DA		 3121 df_ref_record (DF_REF_BASE, collection_rec, regno_reg_rtx[i],
3122 NULL, bb, insn_info, DF_REF_REG_DEF,
3123 DF_REF_MAY_CLOBBER | flags);
3124 }
4d779342 3125
6fb5fa3c
DB		 3126 /* Record the registers used to pass arguments, and explicitly
3127 noted as clobbered. */
50e94c7e 3128 for (note = CALL_INSN_FUNCTION_USAGE (insn_info->insn); note;
6fb5fa3c
DB		 3129 note = XEXP (note, 1))
3130 {
3131 if (GET_CODE (XEXP (note, 0)) == USE)
502ef838
PB		 3132 df_uses_record (collection_rec, &XEXP (XEXP (note, 0), 0),
3133 DF_REF_REG_USE, bb, insn_info, flags);
6fb5fa3c
DB		 3134 else if (GET_CODE (XEXP (note, 0)) == CLOBBER)
3135 {
7e657ec2
EB		 3136 if (REG_P (XEXP (XEXP (note, 0), 0)))
3137 {
3138 unsigned int regno = REGNO (XEXP (XEXP (note, 0), 0));
c5ebdc25 3139 if (!TEST_HARD_REG_BIT (defs_generated, regno))
7e657ec2 3140 df_defs_record (collection_rec, XEXP (note, 0), bb,
50e94c7e 3141 insn_info, flags);
7e657ec2
EB		 3142 }
3143 else
502ef838
PB		 3144 df_uses_record (collection_rec, &XEXP (note, 0),
3145 DF_REF_REG_USE, bb, insn_info, flags);
6fb5fa3c
DB		 3146 }
3147 }
4d779342 3148
6fb5fa3c
DB		 3149 return;
3150}
4d779342 3151
6fb5fa3c
DB		 3152/* Collect all refs in the INSN. This function is free of any
3153 side-effect - it will create and return a lists of df_ref's in the
3154 COLLECTION_REC without putting those refs into existing ref chains
3155 and reg chains. */
4d779342 3156
6fb5fa3c 3157static void
99b1c316 3158df_insn_refs_collect (class df_collection_rec *collection_rec,
b8698a0f 3159 basic_block bb, struct df_insn_info *insn_info)
6fb5fa3c
DB		 3160{
3161 rtx note;
50e94c7e 3162 bool is_cond_exec = (GET_CODE (PATTERN (insn_info->insn)) == COND_EXEC);
4d779342 3163
6fb5fa3c 3164 /* Clear out the collection record. */
9771b263
DN		 3165 collection_rec->def_vec.truncate (0);
3166 collection_rec->use_vec.truncate (0);
3167 collection_rec->eq_use_vec.truncate (0);
3168 collection_rec->mw_vec.truncate (0);
4d779342 3169
50e94c7e
SB		 3170 /* Process REG_EQUIV/REG_EQUAL notes. */
3171 for (note = REG_NOTES (insn_info->insn); note;
6fb5fa3c
DB		 3172 note = XEXP (note, 1))
3173 {
3174 switch (REG_NOTE_KIND (note))
3175 {
3176 case REG_EQUIV:
3177 case REG_EQUAL:
502ef838 3178 df_uses_record (collection_rec,
6fb5fa3c 3179 &XEXP (note, 0), DF_REF_REG_USE,
502ef838 3180 bb, insn_info, DF_REF_IN_NOTE);
6fb5fa3c
DB		 3181 break;
3182 case REG_NON_LOCAL_GOTO:
3183 /* The frame ptr is used by a non-local goto. */
57512f53 3184 df_ref_record (DF_REF_BASE, collection_rec,
6fb5fa3c 3185 regno_reg_rtx[FRAME_POINTER_REGNUM],
50e94c7e 3186 NULL, bb, insn_info,
502ef838 3187 DF_REF_REG_USE, 0);
c3e08036
TS		 3188 if (!HARD_FRAME_POINTER_IS_FRAME_POINTER)
3189 df_ref_record (DF_REF_BASE, collection_rec,
3190 regno_reg_rtx[HARD_FRAME_POINTER_REGNUM],
3191 NULL, bb, insn_info,
3192 DF_REF_REG_USE, 0);
6fb5fa3c
DB		 3193 break;
3194 default:
3195 break;
3196 }
4d779342 3197 }
6fb5fa3c 3198
f80041ef 3199 int flags = (is_cond_exec) ? DF_REF_CONDITIONAL : 0;
c5ebdc25
DA		 3200 /* For CALL_INSNs, first record DF_REF_BASE register defs, as well as
3201 uses from CALL_INSN_FUNCTION_USAGE. */
50e94c7e 3202 if (CALL_P (insn_info->insn))
f80041ef
BS		 3203 df_get_call_refs (collection_rec, bb, insn_info, flags);
3204
c5ebdc25
DA		 3205 /* Record other defs. These should be mostly for DF_REF_REGULAR, so
3206 that a qsort on the defs is unnecessary in most cases. */
3207 df_defs_record (collection_rec,
3208 PATTERN (insn_info->insn), bb, insn_info, 0);
3209
6fb5fa3c 3210 /* Record the register uses. */
502ef838
PB		 3211 df_uses_record (collection_rec,
3212 &PATTERN (insn_info->insn), DF_REF_REG_USE, bb, insn_info, 0);
6fb5fa3c
DB		 3213
3214 /* DF_REF_CONDITIONAL needs corresponding USES. */
3215 if (is_cond_exec)
3216 df_get_conditional_uses (collection_rec);
3217
3218 df_canonize_collection_rec (collection_rec);
4d779342
DB		 3219}
3220
6fb5fa3c
DB		 3221/* Recompute the luids for the insns in BB. */
3222
3223void
3224df_recompute_luids (basic_block bb)
4d779342 3225{
dd3eed93 3226 rtx_insn *insn;
4d779342 3227 int luid = 0;
23249ac4 3228
6fb5fa3c 3229 df_grow_insn_info ();
4d779342
DB		 3230
3231 /* Scan the block an insn at a time from beginning to end. */
3232 FOR_BB_INSNS (bb, insn)
3233 {
50e94c7e 3234 struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
6fb5fa3c
DB		 3235 /* Inserting labels does not always trigger the incremental
3236 rescanning. */
3237 if (!insn_info)
4d779342 3238 {
6fb5fa3c 3239 gcc_assert (!INSN_P (insn));
50e94c7e 3240 insn_info = df_insn_create_insn_record (insn);
4d779342 3241 }
6fb5fa3c 3242
50e94c7e 3243 DF_INSN_INFO_LUID (insn_info) = luid;
6fb5fa3c
DB		 3244 if (INSN_P (insn))
3245 luid++;
3246 }
3247}
3248
3249
6fb5fa3c
DB		 3250/* Collect all artificial refs at the block level for BB and add them
3251 to COLLECTION_REC. */
3252
3253static void
99b1c316 3254df_bb_refs_collect (class df_collection_rec *collection_rec, basic_block bb)
6fb5fa3c 3255{
9771b263
DN		 3256 collection_rec->def_vec.truncate (0);
3257 collection_rec->use_vec.truncate (0);
3258 collection_rec->eq_use_vec.truncate (0);
3259 collection_rec->mw_vec.truncate (0);
6fb5fa3c
DB		 3260
3261 if (bb->index == ENTRY_BLOCK)
3262 {
3263 df_entry_block_defs_collect (collection_rec, df->entry_block_defs);
3264 return;
3265 }
3266 else if (bb->index == EXIT_BLOCK)
3267 {
3268 df_exit_block_uses_collect (collection_rec, df->exit_block_uses);
3269 return;
4d779342
DB		 3270 }
3271
ba49cb7b 3272 if (bb_has_eh_pred (bb))
4d779342
DB		 3273 {
3274 unsigned int i;
3275 /* Mark the registers that will contain data for the handler. */
912f2dac
DB		 3276 for (i = 0; ; ++i)
3277 {
3278 unsigned regno = EH_RETURN_DATA_REGNO (i);
3279 if (regno == INVALID_REGNUM)
3280 break;
57512f53 3281 df_ref_record (DF_REF_ARTIFICIAL, collection_rec, regno_reg_rtx[regno], NULL,
502ef838 3282 bb, NULL, DF_REF_REG_DEF, DF_REF_AT_TOP);
912f2dac 3283 }
4d779342 3284 }
4d779342 3285
6fb5fa3c
DB		 3286 /* Add the hard_frame_pointer if this block is the target of a
3287 non-local goto. */
3288 if (bb->flags & BB_NON_LOCAL_GOTO_TARGET)
57512f53 3289 df_ref_record (DF_REF_ARTIFICIAL, collection_rec, hard_frame_pointer_rtx, NULL,
502ef838 3290 bb, NULL, DF_REF_REG_DEF, DF_REF_AT_TOP);
b8698a0f 3291
6fb5fa3c
DB		 3292 /* Add the artificial uses. */
3293 if (bb->index >= NUM_FIXED_BLOCKS)
23249ac4
DB		 3294 {
3295 bitmap_iterator bi;
3296 unsigned int regno;
b8698a0f 3297 bitmap au = bb_has_eh_pred (bb)
a7e3698d
JH		 3298 ? &df->eh_block_artificial_uses
3299 : &df->regular_block_artificial_uses;
23249ac4 3300
6fb5fa3c 3301 EXECUTE_IF_SET_IN_BITMAP (au, 0, regno, bi)
23249ac4 3302 {
57512f53 3303 df_ref_record (DF_REF_ARTIFICIAL, collection_rec, regno_reg_rtx[regno], NULL,
502ef838 3304 bb, NULL, DF_REF_REG_USE, 0);
23249ac4 3305 }
4d779342 3306 }
6fb5fa3c
DB		 3307
3308 df_canonize_collection_rec (collection_rec);
4d779342
DB		 3309}
3310
268886f3 3311
6fb5fa3c
DB		 3312/* Record all the refs within the basic block BB_INDEX and scan the instructions if SCAN_INSNS. */
3313
3314void
3315df_bb_refs_record (int bb_index, bool scan_insns)
268886f3 3316{
06e28de2 3317 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, bb_index);
dd3eed93 3318 rtx_insn *insn;
6fb5fa3c 3319 int luid = 0;
268886f3 3320
6fb5fa3c 3321 if (!df)
268886f3
ZD		 3322 return;
3323
ff4c81cc 3324 df_collection_rec collection_rec;
e285df08 3325 df_grow_bb_info (df_scan);
6fb5fa3c
DB		 3326 if (scan_insns)
3327 /* Scan the block an insn at a time from beginning to end. */
3328 FOR_BB_INSNS (bb, insn)
3329 {
50e94c7e 3330 struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
6fb5fa3c
DB		 3331 gcc_assert (!insn_info);
3332
50e94c7e 3333 insn_info = df_insn_create_insn_record (insn);
6fb5fa3c
DB		 3334 if (INSN_P (insn))
3335 {
3336 /* Record refs within INSN. */
50e94c7e
SB		 3337 DF_INSN_INFO_LUID (insn_info) = luid++;
3338 df_insn_refs_collect (&collection_rec, bb, DF_INSN_INFO_GET (insn));
ff4c81cc 3339 df_refs_add_to_chains (&collection_rec, bb, insn, copy_all);
6fb5fa3c 3340 }
50e94c7e 3341 DF_INSN_INFO_LUID (insn_info) = luid;
6fb5fa3c
DB		 3342 }
3343
3344 /* Other block level artificial refs */
3345 df_bb_refs_collect (&collection_rec, bb);
ff4c81cc 3346 df_refs_add_to_chains (&collection_rec, bb, NULL, copy_all);
c2569604 3347
6fb5fa3c 3348 /* Now that the block has been processed, set the block as dirty so
05c219bb 3349 LR and LIVE will get it processed. */
6fb5fa3c 3350 df_set_bb_dirty (bb);
268886f3 3351}
4d779342 3352
6fb5fa3c
DB		 3353
3354/* Get the artificial use set for a regular (i.e. non-exit/non-entry)
3355 block. */
4d779342
DB		 3356
3357static void
6fb5fa3c 3358df_get_regular_block_artificial_uses (bitmap regular_block_artificial_uses)
4d779342 3359{
60d52d0d
JJ		 3360#ifdef EH_USES
3361 unsigned int i;
3362#endif
3363
6fb5fa3c 3364 bitmap_clear (regular_block_artificial_uses);
4d779342 3365
6fb5fa3c 3366 if (reload_completed)
4d779342 3367 {
6fb5fa3c
DB		 3368 if (frame_pointer_needed)
3369 bitmap_set_bit (regular_block_artificial_uses, HARD_FRAME_POINTER_REGNUM);
3370 }
3371 else
3372 /* Before reload, there are a few registers that must be forced
3373 live everywhere -- which might not already be the case for
3374 blocks within infinite loops. */
3375 {
2098e438
JL		 3376 unsigned int picreg = PIC_OFFSET_TABLE_REGNUM;
3377
6fb5fa3c
DB		 3378 /* Any reference to any pseudo before reload is a potential
3379 reference of the frame pointer. */
3380 bitmap_set_bit (regular_block_artificial_uses, FRAME_POINTER_REGNUM);
b8698a0f 3381
c3e08036
TS		 3382 if (!HARD_FRAME_POINTER_IS_FRAME_POINTER)
3383 bitmap_set_bit (regular_block_artificial_uses,
3384 HARD_FRAME_POINTER_REGNUM);
6fb5fa3c 3385
6fb5fa3c
DB		 3386 /* Pseudos with argument area equivalences may require
3387 reloading via the argument pointer. */
3f393fc6
TS		 3388 if (FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3389 && fixed_regs[ARG_POINTER_REGNUM])
6fb5fa3c 3390 bitmap_set_bit (regular_block_artificial_uses, ARG_POINTER_REGNUM);
b8698a0f 3391
6fb5fa3c
DB		 3392 /* Any constant, or pseudo with constant equivalences, may
3393 require reloading from memory using the pic register. */
2098e438
JL		 3394 if (picreg != INVALID_REGNUM
3395 && fixed_regs[picreg])
3396 bitmap_set_bit (regular_block_artificial_uses, picreg);
4d779342 3397 }
6fb5fa3c
DB		 3398 /* The all-important stack pointer must always be live. */
3399 bitmap_set_bit (regular_block_artificial_uses, STACK_POINTER_REGNUM);
60d52d0d
JJ		 3400
3401#ifdef EH_USES
3402 /* EH_USES registers are used:
3403 1) at all insns that might throw (calls or with -fnon-call-exceptions
3404 trapping insns)
3405 2) in all EH edges
3406 3) to support backtraces and/or debugging, anywhere between their
3407 initialization and where they the saved registers are restored
3408 from them, including the cases where we don't reach the epilogue
3409 (noreturn call or infinite loop). */
3410 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3411 if (EH_USES (i))
3412 bitmap_set_bit (regular_block_artificial_uses, i);
3413#endif
6fb5fa3c
DB		 3414}
3415
4d779342 3416
6fb5fa3c 3417/* Get the artificial use set for an eh block. */
912f2dac 3418
6fb5fa3c
DB		 3419static void
3420df_get_eh_block_artificial_uses (bitmap eh_block_artificial_uses)
3421{
3422 bitmap_clear (eh_block_artificial_uses);
268886f3 3423
073a8998 3424 /* The following code (down through the arg_pointer setting APPEARS
6fb5fa3c
DB		 3425 to be necessary because there is nothing that actually
3426 describes what the exception handling code may actually need
3427 to keep alive. */
3428 if (reload_completed)
3429 {
3430 if (frame_pointer_needed)
3431 {
3432 bitmap_set_bit (eh_block_artificial_uses, FRAME_POINTER_REGNUM);
c3e08036
TS		 3433 if (!HARD_FRAME_POINTER_IS_FRAME_POINTER)
3434 bitmap_set_bit (eh_block_artificial_uses,
3435 HARD_FRAME_POINTER_REGNUM);
6fb5fa3c 3436 }
3f393fc6
TS		 3437 if (FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3438 && fixed_regs[ARG_POINTER_REGNUM])
6fb5fa3c 3439 bitmap_set_bit (eh_block_artificial_uses, ARG_POINTER_REGNUM);
6fb5fa3c 3440 }
4d779342
DB		 3441}
3442
3443
6fb5fa3c 3444\f
4d779342
DB		 3445/*----------------------------------------------------------------------------
3446 Specialized hard register scanning functions.
3447----------------------------------------------------------------------------*/
3448
6fb5fa3c 3449
4d779342
DB		 3450/* Mark a register in SET. Hard registers in large modes get all
3451 of their component registers set as well. */
3452
3453static void
3454df_mark_reg (rtx reg, void *vset)
3455{
07a737f3 3456 bitmap_set_range ((bitmap) vset, REGNO (reg), REG_NREGS (reg));
4d779342
DB		 3457}
3458
912f2dac 3459
6fb5fa3c 3460/* Set the bit for regs that are considered being defined at the entry. */
912f2dac
DB		 3461
3462static void
6fb5fa3c 3463df_get_entry_block_def_set (bitmap entry_block_defs)
912f2dac 3464{
912f2dac 3465 rtx r;
6fb5fa3c 3466 int i;
912f2dac 3467
6fb5fa3c 3468 bitmap_clear (entry_block_defs);
912f2dac 3469
7157aa85
SB		 3470 /* For separate shrink-wrapping we use LIVE to analyze which basic blocks
3471 need a prologue for some component to be executed before that block,
3472 and we do not care about any other registers. Hence, we do not want
3473 any register for any component defined in the entry block, and we can
3474 just leave all registers undefined. */
3475 if (df_scan->local_flags & DF_SCAN_EMPTY_ENTRY_EXIT)
3476 return;
3477
912f2dac 3478 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
211d71a7
SB		 3479 {
3480 if (global_regs[i])
3481 bitmap_set_bit (entry_block_defs, i);
3482 if (FUNCTION_ARG_REGNO_P (i))
3483 bitmap_set_bit (entry_block_defs, INCOMING_REGNO (i));
3484 }
b8698a0f 3485
1d489435
RS		 3486 /* The always important stack pointer. */
3487 bitmap_set_bit (entry_block_defs, STACK_POINTER_REGNUM);
3488
912f2dac
DB		 3489 /* Once the prologue has been generated, all of these registers
3490 should just show up in the first regular block. */
e86a9946 3491 if (targetm.have_prologue () && epilogue_completed)
912f2dac
DB		 3492 {
3493 /* Defs for the callee saved registers are inserted so that the
3494 pushes have some defining location. */
3495 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
559c1ae1
RS		 3496 if (!crtl->abi->clobbers_full_reg_p (i)
3497 && !fixed_regs[i]
3498 && df_regs_ever_live_p (i))
6fb5fa3c 3499 bitmap_set_bit (entry_block_defs, i);
912f2dac 3500 }
912f2dac 3501
bff98546
JJ		 3502 r = targetm.calls.struct_value_rtx (current_function_decl, true);
3503 if (r && REG_P (r))
3504 bitmap_set_bit (entry_block_defs, REGNO (r));
3505
531ca746
RH		 3506 /* If the function has an incoming STATIC_CHAIN, it has to show up
3507 in the entry def set. */
4b522b8f 3508 r = rtx_for_static_chain (current_function_decl, true);
531ca746
RH		 3509 if (r && REG_P (r))
3510 bitmap_set_bit (entry_block_defs, REGNO (r));
3511
23249ac4 3512 if ((!reload_completed) || frame_pointer_needed)
912f2dac
DB		 3513 {
3514 /* Any reference to any pseudo before reload is a potential
3515 reference of the frame pointer. */
6fb5fa3c 3516 bitmap_set_bit (entry_block_defs, FRAME_POINTER_REGNUM);
c3e08036 3517
23249ac4 3518 /* If they are different, also mark the hard frame pointer as live. */
c3e08036
TS		 3519 if (!HARD_FRAME_POINTER_IS_FRAME_POINTER
3520 && !LOCAL_REGNO (HARD_FRAME_POINTER_REGNUM))
6fb5fa3c 3521 bitmap_set_bit (entry_block_defs, HARD_FRAME_POINTER_REGNUM);
23249ac4 3522 }
912f2dac 3523
23249ac4
DB		 3524 /* These registers are live everywhere. */
3525 if (!reload_completed)
3526 {
912f2dac
DB		 3527 /* Pseudos with argument area equivalences may require
3528 reloading via the argument pointer. */
3f393fc6
TS		 3529 if (FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3530 && fixed_regs[ARG_POINTER_REGNUM])
6fb5fa3c 3531 bitmap_set_bit (entry_block_defs, ARG_POINTER_REGNUM);
b8698a0f 3532
912f2dac
DB		 3533 /* Any constant, or pseudo with constant equivalences, may
3534 require reloading from memory using the pic register. */
faa7b0de 3535 unsigned int picreg = PIC_OFFSET_TABLE_REGNUM;
2098e438
JL		 3536 if (picreg != INVALID_REGNUM
3537 && fixed_regs[picreg])
3538 bitmap_set_bit (entry_block_defs, picreg);
6fb5fa3c
DB		 3539 }
3540
3541#ifdef INCOMING_RETURN_ADDR_RTX
3542 if (REG_P (INCOMING_RETURN_ADDR_RTX))
3543 bitmap_set_bit (entry_block_defs, REGNO (INCOMING_RETURN_ADDR_RTX));
3544#endif
b8698a0f 3545
38f8b050 3546 targetm.extra_live_on_entry (entry_block_defs);
6fb5fa3c
DB		 3547}
3548
3549
3550/* Return the (conservative) set of hard registers that are defined on
b8698a0f
L		 3551 entry to the function.
3552 It uses df->entry_block_defs to determine which register
6fb5fa3c
DB		 3553 reference to include. */
3554
3555static void
99b1c316 3556df_entry_block_defs_collect (class df_collection_rec *collection_rec,
6fb5fa3c
DB		 3557 bitmap entry_block_defs)
3558{
b8698a0f 3559 unsigned int i;
6fb5fa3c
DB		 3560 bitmap_iterator bi;
3561
3562 EXECUTE_IF_SET_IN_BITMAP (entry_block_defs, 0, i, bi)
3563 {
b8698a0f 3564 df_ref_record (DF_REF_ARTIFICIAL, collection_rec, regno_reg_rtx[i], NULL,
fefa31b5 3565 ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, DF_REF_REG_DEF, 0);
6fb5fa3c
DB		 3566 }
3567
3568 df_canonize_collection_rec (collection_rec);
3569}
3570
3571
3572/* Record the (conservative) set of hard registers that are defined on
3573 entry to the function. */
3574
3575static void
3576df_record_entry_block_defs (bitmap entry_block_defs)
3577{
99b1c316 3578 class df_collection_rec collection_rec;
6fb5fa3c
DB		 3579 df_entry_block_defs_collect (&collection_rec, entry_block_defs);
3580
3581 /* Process bb_refs chain */
06e28de2
DM		 3582 df_refs_add_to_chains (&collection_rec,
3583 BASIC_BLOCK_FOR_FN (cfun, ENTRY_BLOCK),
3584 NULL,
ff4c81cc 3585 copy_defs);
6fb5fa3c
DB		 3586}
3587
3588
15dc95cb 3589/* Update the defs in the entry block. */
6fb5fa3c
DB		 3590
3591void
3592df_update_entry_block_defs (void)
3593{
6fb5fa3c 3594 bool changed = false;
912f2dac 3595
d648b5ff
TS		 3596 auto_bitmap refs (&df_bitmap_obstack);
3597 df_get_entry_block_def_set (refs);
adef5d4f
ML		 3598 gcc_assert (df->entry_block_defs);
3599 if (!bitmap_equal_p (df->entry_block_defs, refs))
6fb5fa3c 3600 {
adef5d4f
ML		 3601 struct df_scan_bb_info *bb_info = df_scan_get_bb_info (ENTRY_BLOCK);
3602 df_ref_chain_delete_du_chain (bb_info->artificial_defs);
3603 df_ref_chain_delete (bb_info->artificial_defs);
3604 bb_info->artificial_defs = NULL;
6fb5fa3c
DB		 3605 changed = true;
3606 }
912f2dac 3607
6fb5fa3c 3608 if (changed)
912f2dac 3609 {
d648b5ff
TS		 3610 df_record_entry_block_defs (refs);
3611 bitmap_copy (df->entry_block_defs, refs);
06e28de2 3612 df_set_bb_dirty (BASIC_BLOCK_FOR_FN (cfun, ENTRY_BLOCK));
912f2dac
DB		 3613 }
3614}
3615
3616
6fb5fa3c 3617/* Set the bit for regs that are considered being used at the exit. */
4d779342
DB		 3618
3619static void
6fb5fa3c 3620df_get_exit_block_use_set (bitmap exit_block_uses)
4d779342 3621{
b8698a0f 3622 unsigned int i;
2098e438 3623 unsigned int picreg = PIC_OFFSET_TABLE_REGNUM;
4d779342 3624
6fb5fa3c 3625 bitmap_clear (exit_block_uses);
b718216c 3626
7157aa85
SB		 3627 /* For separate shrink-wrapping we use LIVE to analyze which basic blocks
3628 need an epilogue for some component to be executed after that block,
3629 and we do not care about any other registers. Hence, we do not want
3630 any register for any component seen as used in the exit block, and we
3631 can just say no registers at all are used. */
3632 if (df_scan->local_flags & DF_SCAN_EMPTY_ENTRY_EXIT)
3633 return;
3634
b718216c
SP		 3635 /* Stack pointer is always live at the exit. */
3636 bitmap_set_bit (exit_block_uses, STACK_POINTER_REGNUM);
b8698a0f 3637
4d779342
DB		 3638 /* Mark the frame pointer if needed at the end of the function.
3639 If we end up eliminating it, it will be removed from the live
3640 list of each basic block by reload. */
b8698a0f 3641
23249ac4 3642 if ((!reload_completed) || frame_pointer_needed)
4d779342 3643 {
6fb5fa3c 3644 bitmap_set_bit (exit_block_uses, FRAME_POINTER_REGNUM);
c3e08036 3645
4d779342 3646 /* If they are different, also mark the hard frame pointer as live. */
c3e08036
TS		 3647 if (!HARD_FRAME_POINTER_IS_FRAME_POINTER
3648 && !LOCAL_REGNO (HARD_FRAME_POINTER_REGNUM))
6fb5fa3c 3649 bitmap_set_bit (exit_block_uses, HARD_FRAME_POINTER_REGNUM);
4d779342
DB		 3650 }
3651
4d779342
DB		 3652 /* Many architectures have a GP register even without flag_pic.
3653 Assume the pic register is not in use, or will be handled by
3654 other means, if it is not fixed. */
f8fe0a4a 3655 if (!PIC_OFFSET_TABLE_REG_CALL_CLOBBERED
2098e438
JL		 3656 && picreg != INVALID_REGNUM
3657 && fixed_regs[picreg])
3658 bitmap_set_bit (exit_block_uses, picreg);
b8698a0f 3659
4d779342
DB		 3660 /* Mark all global registers, and all registers used by the
3661 epilogue as being live at the end of the function since they
3662 may be referenced by our caller. */
3663 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3664 if (global_regs[i] || EPILOGUE_USES (i))
6fb5fa3c 3665 bitmap_set_bit (exit_block_uses, i);
b8698a0f 3666
e86a9946 3667 if (targetm.have_epilogue () && epilogue_completed)
4d779342
DB		 3668 {
3669 /* Mark all call-saved registers that we actually used. */
3670 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
559c1ae1
RS		 3671 if (df_regs_ever_live_p (i)
3672 && !LOCAL_REGNO (i)
3673 && !crtl->abi->clobbers_full_reg_p (i))
6fb5fa3c 3674 bitmap_set_bit (exit_block_uses, i);
4d779342 3675 }
b8698a0f 3676
4d779342 3677 /* Mark the registers that will contain data for the handler. */
e3b5732b 3678 if (reload_completed && crtl->calls_eh_return)
4d779342
DB		 3679 for (i = 0; ; ++i)
3680 {
3681 unsigned regno = EH_RETURN_DATA_REGNO (i);
3682 if (regno == INVALID_REGNUM)
3683 break;
6fb5fa3c 3684 bitmap_set_bit (exit_block_uses, regno);
4d779342 3685 }
4d779342
DB		 3686
3687#ifdef EH_RETURN_STACKADJ_RTX
e86a9946 3688 if ((!targetm.have_epilogue () || ! epilogue_completed)
e3b5732b 3689 && crtl->calls_eh_return)
4d779342
DB		 3690 {
3691 rtx tmp = EH_RETURN_STACKADJ_RTX;
3692 if (tmp && REG_P (tmp))
6fb5fa3c 3693 df_mark_reg (tmp, exit_block_uses);
4d779342
DB		 3694 }
3695#endif
3696
e86a9946 3697 if ((!targetm.have_epilogue () || ! epilogue_completed)
e3b5732b 3698 && crtl->calls_eh_return)
4d779342
DB		 3699 {
3700 rtx tmp = EH_RETURN_HANDLER_RTX;
3701 if (tmp && REG_P (tmp))
6fb5fa3c 3702 df_mark_reg (tmp, exit_block_uses);
4d779342 3703 }
6fb5fa3c 3704
4d779342 3705 /* Mark function return value. */
6fb5fa3c
DB		 3706 diddle_return_value (df_mark_reg, (void*) exit_block_uses);
3707}
3708
3709
b8698a0f 3710/* Return the refs of hard registers that are used in the exit block.
6fb5fa3c
DB		 3711 It uses df->exit_block_uses to determine register to include. */
3712
3713static void
99b1c316 3714df_exit_block_uses_collect (class df_collection_rec *collection_rec, bitmap exit_block_uses)
6fb5fa3c 3715{
b8698a0f 3716 unsigned int i;
6fb5fa3c
DB		 3717 bitmap_iterator bi;
3718
3719 EXECUTE_IF_SET_IN_BITMAP (exit_block_uses, 0, i, bi)
57512f53 3720 df_ref_record (DF_REF_ARTIFICIAL, collection_rec, regno_reg_rtx[i], NULL,
fefa31b5 3721 EXIT_BLOCK_PTR_FOR_FN (cfun), NULL, DF_REF_REG_USE, 0);
4d779342 3722
6fb5fa3c
DB		 3723 /* It is deliberate that this is not put in the exit block uses but
3724 I do not know why. */
3f393fc6
TS		 3725 if (FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
3726 && reload_completed
6fb5fa3c 3727 && !bitmap_bit_p (exit_block_uses, ARG_POINTER_REGNUM)
fefa31b5 3728 && bb_has_eh_pred (EXIT_BLOCK_PTR_FOR_FN (cfun))
6fb5fa3c 3729 && fixed_regs[ARG_POINTER_REGNUM])
57512f53 3730 df_ref_record (DF_REF_ARTIFICIAL, collection_rec, regno_reg_rtx[ARG_POINTER_REGNUM], NULL,
fefa31b5 3731 EXIT_BLOCK_PTR_FOR_FN (cfun), NULL, DF_REF_REG_USE, 0);
6fb5fa3c
DB		 3732
3733 df_canonize_collection_rec (collection_rec);
3734}
3735
3736
b8698a0f 3737/* Record the set of hard registers that are used in the exit block.
6fb5fa3c
DB		 3738 It uses df->exit_block_uses to determine which bit to include. */
3739
3740static void
3741df_record_exit_block_uses (bitmap exit_block_uses)
3742{
99b1c316 3743 class df_collection_rec collection_rec;
6fb5fa3c
DB		 3744 df_exit_block_uses_collect (&collection_rec, exit_block_uses);
3745
3746 /* Process bb_refs chain */
06e28de2
DM		 3747 df_refs_add_to_chains (&collection_rec,
3748 BASIC_BLOCK_FOR_FN (cfun, EXIT_BLOCK),
3749 NULL,
ff4c81cc 3750 copy_uses);
6fb5fa3c
DB		 3751}
3752
3753
3754/* Update the uses in the exit block. */
3755
3756void
3757df_update_exit_block_uses (void)
3758{
6fb5fa3c
DB		 3759 bool changed = false;
3760
d648b5ff
TS		 3761 auto_bitmap refs (&df_bitmap_obstack);
3762 df_get_exit_block_use_set (refs);
adef5d4f
ML		 3763 gcc_assert (df->exit_block_uses);
3764 if (!bitmap_equal_p (df->exit_block_uses, refs))
6fb5fa3c 3765 {
adef5d4f
ML		 3766 struct df_scan_bb_info *bb_info = df_scan_get_bb_info (EXIT_BLOCK);
3767 df_ref_chain_delete_du_chain (bb_info->artificial_uses);
3768 df_ref_chain_delete (bb_info->artificial_uses);
3769 bb_info->artificial_uses = NULL;
6fb5fa3c
DB		 3770 changed = true;
3771 }
3772
3773 if (changed)
3774 {
d648b5ff
TS		 3775 df_record_exit_block_uses (refs);
3776 bitmap_copy (df->exit_block_uses, refs);
06e28de2 3777 df_set_bb_dirty (BASIC_BLOCK_FOR_FN (cfun, EXIT_BLOCK));
6fb5fa3c 3778 }
4d779342
DB		 3779}
3780
3781static bool initialized = false;
3782
6fb5fa3c 3783
4d779342
DB		 3784/* Initialize some platform specific structures. */
3785
b8698a0f 3786void
4d779342
DB		 3787df_hard_reg_init (void)
3788{
7bda4a1d 3789 int i;
4d779342 3790 static const struct {const int from, to; } eliminables[] = ELIMINABLE_REGS;
53680238 3791
4d779342
DB		 3792 if (initialized)
3793 return;
3794
4d779342
DB		 3795 /* Record which registers will be eliminated. We use this in
3796 mark_used_regs. */
3797 CLEAR_HARD_REG_SET (elim_reg_set);
b8698a0f 3798
4d779342
DB		 3799 for (i = 0; i < (int) ARRAY_SIZE (eliminables); i++)
3800 SET_HARD_REG_BIT (elim_reg_set, eliminables[i].from);
b8698a0f 3801
4d779342
DB		 3802 initialized = true;
3803}
6fb5fa3c
DB		 3804
3805
3806/* Recompute the parts of scanning that are based on regs_ever_live
b8698a0f 3807 because something changed in that array. */
6fb5fa3c 3808
b8698a0f 3809void
6fb5fa3c
DB		 3810df_update_entry_exit_and_calls (void)
3811{
3812 basic_block bb;
3813
3814 df_update_entry_block_defs ();
3815 df_update_exit_block_uses ();
3816
3817 /* The call insns need to be rescanned because there may be changes
3818 in the set of registers clobbered across the call. */
11cd3bed 3819 FOR_EACH_BB_FN (bb, cfun)
6fb5fa3c 3820 {
dd3eed93 3821 rtx_insn *insn;
6fb5fa3c
DB		 3822 FOR_BB_INSNS (bb, insn)
3823 {
3824 if (INSN_P (insn) && CALL_P (insn))
3825 df_insn_rescan (insn);
3826 }
3827 }
3828}
3829
3830
3831/* Return true if hard REG is actually used in the some instruction.
3832 There are a fair number of conditions that affect the setting of
3833 this array. See the comment in df.h for df->hard_regs_live_count
3834 for the conditions that this array is set. */
3835
b8698a0f 3836bool
6fb5fa3c
DB		 3837df_hard_reg_used_p (unsigned int reg)
3838{
6fb5fa3c
DB		 3839 return df->hard_regs_live_count[reg] != 0;
3840}
3841
3842
3843/* A count of the number of times REG is actually used in the some
3844 instruction. There are a fair number of conditions that affect the
3845 setting of this array. See the comment in df.h for
3846 df->hard_regs_live_count for the conditions that this array is
3847 set. */
3848
3849
3850unsigned int
3851df_hard_reg_used_count (unsigned int reg)
3852{
6fb5fa3c
DB		 3853 return df->hard_regs_live_count[reg];
3854}
3855
3856
3857/* Get the value of regs_ever_live[REGNO]. */
3858
b8698a0f 3859bool
6fb5fa3c
DB		 3860df_regs_ever_live_p (unsigned int regno)
3861{
3862 return regs_ever_live[regno];
3863}
3864
3865
3866/* Set regs_ever_live[REGNO] to VALUE. If this cause regs_ever_live
3867 to change, schedule that change for the next update. */
3868
b8698a0f 3869void
6fb5fa3c
DB		 3870df_set_regs_ever_live (unsigned int regno, bool value)
3871{
3872 if (regs_ever_live[regno] == value)
3873 return;
3874
3875 regs_ever_live[regno] = value;
3876 if (df)
3877 df->redo_entry_and_exit = true;
3878}
3879
3880
3881/* Compute "regs_ever_live" information from the underlying df
3882 information. Set the vector to all false if RESET. */
3883
3884void
3885df_compute_regs_ever_live (bool reset)
3886{
3887 unsigned int i;
3888 bool changed = df->redo_entry_and_exit;
b8698a0f 3889
6fb5fa3c
DB		 3890 if (reset)
3891 memset (regs_ever_live, 0, sizeof (regs_ever_live));
3892
3893 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3894 if ((!regs_ever_live[i]) && df_hard_reg_used_p (i))
3895 {
3896 regs_ever_live[i] = true;
3897 changed = true;
3898 }
3899 if (changed)
3900 df_update_entry_exit_and_calls ();
3901 df->redo_entry_and_exit = false;
3902}
3903
3904\f
3905/*----------------------------------------------------------------------------
3906 Dataflow ref information verification functions.
3907
3908 df_reg_chain_mark (refs, regno, is_def, is_eq_use)
3909 df_reg_chain_verify_unmarked (refs)
9771b263 3910 df_refs_verify (vec<stack, va_df_ref>, ref*, bool)
6fb5fa3c
DB		 3911 df_mws_verify (mw*, mw*, bool)
3912 df_insn_refs_verify (collection_rec, bb, insn, bool)
3913 df_bb_refs_verify (bb, refs, bool)
3914 df_bb_verify (bb)
3915 df_exit_block_bitmap_verify (bool)
3916 df_entry_block_bitmap_verify (bool)
3917 df_scan_verify ()
3918----------------------------------------------------------------------------*/
3919
3920
3921/* Mark all refs in the reg chain. Verify that all of the registers
b8698a0f 3922are in the correct chain. */
6fb5fa3c
DB		 3923
3924static unsigned int
b8698a0f 3925df_reg_chain_mark (df_ref refs, unsigned int regno,
6fb5fa3c
DB		 3926 bool is_def, bool is_eq_use)
3927{
3928 unsigned int count = 0;
57512f53 3929 df_ref ref;
6fb5fa3c
DB		 3930 for (ref = refs; ref; ref = DF_REF_NEXT_REG (ref))
3931 {
3932 gcc_assert (!DF_REF_IS_REG_MARKED (ref));
3933
3934 /* If there are no def-use or use-def chains, make sure that all
3935 of the chains are clear. */
3936 if (!df_chain)
3937 gcc_assert (!DF_REF_CHAIN (ref));
3938
3939 /* Check to make sure the ref is in the correct chain. */
3940 gcc_assert (DF_REF_REGNO (ref) == regno);
3941 if (is_def)
57512f53 3942 gcc_assert (DF_REF_REG_DEF_P (ref));
6fb5fa3c 3943 else
57512f53 3944 gcc_assert (!DF_REF_REG_DEF_P (ref));
6fb5fa3c
DB		 3945
3946 if (is_eq_use)
3947 gcc_assert ((DF_REF_FLAGS (ref) & DF_REF_IN_NOTE));
3948 else
3949 gcc_assert ((DF_REF_FLAGS (ref) & DF_REF_IN_NOTE) == 0);
3950
57512f53
KZ		 3951 if (DF_REF_NEXT_REG (ref))
3952 gcc_assert (DF_REF_PREV_REG (DF_REF_NEXT_REG (ref)) == ref);
6fb5fa3c
DB		 3953 count++;
3954 DF_REF_REG_MARK (ref);
3955 }
3956 return count;
3957}
3958
3959
b8698a0f 3960/* Verify that all of the registers in the chain are unmarked. */
6fb5fa3c
DB		 3961
3962static void
57512f53 3963df_reg_chain_verify_unmarked (df_ref refs)
6fb5fa3c 3964{
57512f53 3965 df_ref ref;
6fb5fa3c
DB		 3966 for (ref = refs; ref; ref = DF_REF_NEXT_REG (ref))
3967 gcc_assert (!DF_REF_IS_REG_MARKED (ref));
3968}
3969
3970
3971/* Verify that NEW_REC and OLD_REC have exactly the same members. */
3972
3973static bool
b512946c 3974df_refs_verify (const vec<df_ref, va_heap> *new_rec, df_ref old_rec,
6fb5fa3c
DB		 3975 bool abort_if_fail)
3976{
c2569604
ILT		 3977 unsigned int ix;
3978 df_ref new_ref;
3979
ff4c81cc 3980 FOR_EACH_VEC_ELT (*new_rec, ix, new_ref)
6fb5fa3c 3981 {
b512946c 3982 if (old_rec == NULL || !df_ref_equal_p (new_ref, old_rec))
6fb5fa3c
DB		 3983 {
3984 if (abort_if_fail)
3985 gcc_assert (0);
3986 else
3987 return false;
3988 }
3989
3990 /* Abort if fail is called from the function level verifier. If
3991 that is the context, mark this reg as being seem. */
3992 if (abort_if_fail)
3993 {
b512946c
RS		 3994 gcc_assert (DF_REF_IS_REG_MARKED (old_rec));
3995 DF_REF_REG_UNMARK (old_rec);
6fb5fa3c
DB		 3996 }
3997
b512946c 3998 old_rec = DF_REF_NEXT_LOC (old_rec);
6fb5fa3c
DB		 3999 }
4000
4001 if (abort_if_fail)
b512946c 4002 gcc_assert (old_rec == NULL);
6fb5fa3c 4003 else
b512946c 4004 return old_rec == NULL;
6fb5fa3c
DB		 4005 return false;
4006}
4007
4008
4009/* Verify that NEW_REC and OLD_REC have exactly the same members. */
4010
4011static bool
526ceb68 4012df_mws_verify (const vec<df_mw_hardreg *, va_heap> *new_rec,
b512946c 4013 struct df_mw_hardreg *old_rec,
6fb5fa3c
DB		 4014 bool abort_if_fail)
4015{
c2569604
ILT		 4016 unsigned int ix;
4017 struct df_mw_hardreg *new_reg;
4018
ff4c81cc 4019 FOR_EACH_VEC_ELT (*new_rec, ix, new_reg)
6fb5fa3c 4020 {
b512946c 4021 if (old_rec == NULL || !df_mw_equal_p (new_reg, old_rec))
6fb5fa3c
DB		 4022 {
4023 if (abort_if_fail)
4024 gcc_assert (0);
4025 else
4026 return false;
4027 }
b512946c 4028 old_rec = DF_MWS_NEXT (old_rec);
6fb5fa3c
DB		 4029 }
4030
4031 if (abort_if_fail)
b512946c 4032 gcc_assert (old_rec == NULL);
6fb5fa3c 4033 else
b512946c 4034 return old_rec == NULL;
6fb5fa3c
DB		 4035 return false;
4036}
4037
4038
4039/* Return true if the existing insn refs information is complete and
4040 correct. Otherwise (i.e. if there's any missing or extra refs),
b8698a0f 4041 return the correct df_ref chain in REFS_RETURN.
6fb5fa3c
DB		 4042
4043 If ABORT_IF_FAIL, leave the refs that are verified (already in the
4044 ref chain) as DF_REF_MARKED(). If it's false, then it's a per-insn
4045 verification mode instead of the whole function, so unmark
4046 everything.
4047
4048 If ABORT_IF_FAIL is set, this function never returns false. */
4049
4050static bool
99b1c316 4051df_insn_refs_verify (class df_collection_rec *collection_rec,
b8698a0f 4052 basic_block bb,
b2908ba6 4053 rtx_insn *insn,
6fb5fa3c
DB		 4054 bool abort_if_fail)
4055{
6173a9e3 4056 bool ret1, ret2, ret3;
6fb5fa3c 4057 unsigned int uid = INSN_UID (insn);
50e94c7e 4058 struct df_insn_info *insn_info = DF_INSN_INFO_GET (insn);
6fb5fa3c 4059
50e94c7e 4060 df_insn_refs_collect (collection_rec, bb, insn_info);
6fb5fa3c 4061
6fb5fa3c 4062 /* Unfortunately we cannot opt out early if one of these is not
6173a9e3 4063 right and abort_if_fail is set because the marks will not get cleared. */
ff4c81cc 4064 ret1 = df_refs_verify (&collection_rec->def_vec, DF_INSN_UID_DEFS (uid),
6fb5fa3c 4065 abort_if_fail);
6173a9e3
RB		 4066 if (!ret1 && !abort_if_fail)
4067 return false;
ff4c81cc 4068 ret2 = df_refs_verify (&collection_rec->use_vec, DF_INSN_UID_USES (uid),
6fb5fa3c 4069 abort_if_fail);
6173a9e3
RB		 4070 if (!ret2 && !abort_if_fail)
4071 return false;
ff4c81cc 4072 ret3 = df_refs_verify (&collection_rec->eq_use_vec, DF_INSN_UID_EQ_USES (uid),
6fb5fa3c 4073 abort_if_fail);
6173a9e3
RB		 4074 if (!ret3 && !abort_if_fail)
4075 return false;
4076 if (! df_mws_verify (&collection_rec->mw_vec, DF_INSN_UID_MWS (uid),
4077 abort_if_fail))
4078 return false;
4079 return (ret1 && ret2 && ret3);
6fb5fa3c
DB		 4080}
4081
4082
4083/* Return true if all refs in the basic block are correct and complete.
4084 Due to df_ref_chain_verify, it will cause all refs
4085 that are verified to have DF_REF_MARK bit set. */
4086
4087static bool
4088df_bb_verify (basic_block bb)
4089{
dd3eed93 4090 rtx_insn *insn;
6fb5fa3c 4091 struct df_scan_bb_info *bb_info = df_scan_get_bb_info (bb->index);
99b1c316 4092 class df_collection_rec collection_rec;
b8698a0f 4093
6fb5fa3c
DB		 4094 gcc_assert (bb_info);
4095
57512f53 4096 /* Scan the block, one insn at a time, from beginning to end. */
6fb5fa3c
DB		 4097 FOR_BB_INSNS_REVERSE (bb, insn)
4098 {
4099 if (!INSN_P (insn))
4100 continue;
4101 df_insn_refs_verify (&collection_rec, bb, insn, true);
1aee8991 4102 df_free_collection_rec (&collection_rec);
6fb5fa3c
DB		 4103 }
4104
4105 /* Do the artificial defs and uses. */
4106 df_bb_refs_collect (&collection_rec, bb);
ff4c81cc
TS		 4107 df_refs_verify (&collection_rec.def_vec, df_get_artificial_defs (bb->index), true);
4108 df_refs_verify (&collection_rec.use_vec, df_get_artificial_uses (bb->index), true);
6fb5fa3c 4109 df_free_collection_rec (&collection_rec);
b8698a0f 4110
6fb5fa3c
DB		 4111 return true;
4112}
4113
4114
b8698a0f 4115/* Returns true if the entry block has correct and complete df_ref set.
6fb5fa3c
DB		 4116 If not it either aborts if ABORT_IF_FAIL is true or returns false. */
4117
4118static bool
4119df_entry_block_bitmap_verify (bool abort_if_fail)
4120{
6fb5fa3c
DB		 4121 bool is_eq;
4122
d648b5ff
TS		 4123 auto_bitmap entry_block_defs (&df_bitmap_obstack);
4124 df_get_entry_block_def_set (entry_block_defs);
6fb5fa3c 4125
d648b5ff 4126 is_eq = bitmap_equal_p (entry_block_defs, df->entry_block_defs);
6fb5fa3c
DB		 4127
4128 if (!is_eq && abort_if_fail)
4129 {
6fb5fa3c 4130 fprintf (stderr, "entry_block_defs = ");
d648b5ff 4131 df_print_regset (stderr, entry_block_defs);
6fb5fa3c
DB		 4132 fprintf (stderr, "df->entry_block_defs = ");
4133 df_print_regset (stderr, df->entry_block_defs);
4134 gcc_assert (0);
4135 }
4136
6fb5fa3c
DB		 4137 return is_eq;
4138}
4139
4140
b8698a0f 4141/* Returns true if the exit block has correct and complete df_ref set.
6fb5fa3c
DB		 4142 If not it either aborts if ABORT_IF_FAIL is true or returns false. */
4143
4144static bool
4145df_exit_block_bitmap_verify (bool abort_if_fail)
4146{
6fb5fa3c
DB		 4147 bool is_eq;
4148
d648b5ff
TS		 4149 auto_bitmap exit_block_uses (&df_bitmap_obstack);
4150 df_get_exit_block_use_set (exit_block_uses);
6fb5fa3c 4151
d648b5ff 4152 is_eq = bitmap_equal_p (exit_block_uses, df->exit_block_uses);
6fb5fa3c
DB		 4153
4154 if (!is_eq && abort_if_fail)
4155 {
6fb5fa3c 4156 fprintf (stderr, "exit_block_uses = ");
d648b5ff 4157 df_print_regset (stderr, exit_block_uses);
6fb5fa3c
DB		 4158 fprintf (stderr, "df->exit_block_uses = ");
4159 df_print_regset (stderr, df->exit_block_uses);
4160 gcc_assert (0);
4161 }
4162
6fb5fa3c
DB		 4163 return is_eq;
4164}
4165
4166
cc806ac1
RS		 4167/* Return true if df_ref information for all insns in all blocks are
4168 correct and complete. */
6fb5fa3c
DB		 4169
4170void
4171df_scan_verify (void)
4172{
4173 unsigned int i;
4174 basic_block bb;
6fb5fa3c
DB		 4175
4176 if (!df)
4177 return;
4178
6fb5fa3c
DB		 4179 /* Verification is a 4 step process. */
4180
073a8998 4181 /* (1) All of the refs are marked by going through the reg chains. */
6fb5fa3c
DB		 4182 for (i = 0; i < DF_REG_SIZE (df); i++)
4183 {
b8698a0f 4184 gcc_assert (df_reg_chain_mark (DF_REG_DEF_CHAIN (i), i, true, false)
c3284718 4185 == DF_REG_DEF_COUNT (i));
b8698a0f 4186 gcc_assert (df_reg_chain_mark (DF_REG_USE_CHAIN (i), i, false, false)
c3284718 4187 == DF_REG_USE_COUNT (i));
b8698a0f 4188 gcc_assert (df_reg_chain_mark (DF_REG_EQ_USE_CHAIN (i), i, false, true)
c3284718 4189 == DF_REG_EQ_USE_COUNT (i));
6fb5fa3c
DB		 4190 }
4191
4192 /* (2) There are various bitmaps whose value may change over the
4193 course of the compilation. This step recomputes them to make
4194 sure that they have not slipped out of date. */
d648b5ff
TS		 4195 auto_bitmap regular_block_artificial_uses (&df_bitmap_obstack);
4196 auto_bitmap eh_block_artificial_uses (&df_bitmap_obstack);
6fb5fa3c 4197
d648b5ff
TS		 4198 df_get_regular_block_artificial_uses (regular_block_artificial_uses);
4199 df_get_eh_block_artificial_uses (eh_block_artificial_uses);
6fb5fa3c 4200
d648b5ff
TS		 4201 bitmap_ior_into (eh_block_artificial_uses,
4202 regular_block_artificial_uses);
6fb5fa3c
DB		 4203
4204 /* Check artificial_uses bitmaps didn't change. */
d648b5ff 4205 gcc_assert (bitmap_equal_p (regular_block_artificial_uses,
a7e3698d 4206 &df->regular_block_artificial_uses));
d648b5ff 4207 gcc_assert (bitmap_equal_p (eh_block_artificial_uses,
a7e3698d 4208 &df->eh_block_artificial_uses));
6fb5fa3c 4209
6fb5fa3c
DB		 4210 /* Verify entry block and exit block. These only verify the bitmaps,
4211 the refs are verified in df_bb_verify. */
4212 df_entry_block_bitmap_verify (true);
4213 df_exit_block_bitmap_verify (true);
b8698a0f 4214
6fb5fa3c
DB		 4215 /* (3) All of the insns in all of the blocks are traversed and the
4216 marks are cleared both in the artificial refs attached to the
4217 blocks and the real refs inside the insns. It is a failure to
4218 clear a mark that has not been set as this means that the ref in
4219 the block or insn was not in the reg chain. */
4220
04a90bec 4221 FOR_ALL_BB_FN (bb, cfun)
6fb5fa3c
DB		 4222 df_bb_verify (bb);
4223
4224 /* (4) See if all reg chains are traversed a second time. This time
4225 a check is made that the marks are clear. A set mark would be a
4226 from a reg that is not in any insn or basic block. */
4227
4228 for (i = 0; i < DF_REG_SIZE (df); i++)
4229 {
4230 df_reg_chain_verify_unmarked (DF_REG_DEF_CHAIN (i));
4231 df_reg_chain_verify_unmarked (DF_REG_USE_CHAIN (i));
4232 df_reg_chain_verify_unmarked (DF_REG_EQ_USE_CHAIN (i));
4233 }
4234}
Mirror of https://gcc.gnu.org/git/gcc.git