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