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