gcc/df.h

   1 /* Form lists of pseudo register references for autoinc optimization
   2    for GNU compiler.  This is part of flow optimization.
   3    Copyright (C) 1999, 2000, 2001, 2003, 2004, 2005, 2006
   4    Free Software Foundation, Inc.
   5    Originally contributed by Michael P. Hayes
   6              (m.hayes@elec.canterbury.ac.nz, mhayes@redhat.com)
   7    Major rewrite contributed by Danny Berlin (dberlin@dberlin.org)
   8              and Kenneth Zadeck (zadeck@naturalbridge.com).
   9
  10 This file is part of GCC.
  11
  12 GCC is free software; you can redistribute it and/or modify it under
  13 the terms of the GNU General Public License as published by the Free
  14 Software Foundation; either version 2, or (at your option) any later
  15 version.
  16
  17 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
  18 WARRANTY; without even the implied warranty of MERCHANTABILITY or
  19 FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  20 for more details.
  21
  22 You should have received a copy of the GNU General Public License
  23 along with GCC; see the file COPYING.  If not, write to the Free
  24 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
  25 02110-1301, USA.  */
  26
  27 #ifndef GCC_DF_H
  28 #define GCC_DF_H
  29
  30 #include "bitmap.h"
  31 #include "basic-block.h"
  32 #include "alloc-pool.h"
  33
  34 struct dataflow;
  35 struct df;
  36 struct df_problem;
  37
  38 /* Data flow problems.  All problems must have a unique here.  */
  39 /* Scanning is not really a dataflow problem, but it is useful to have
  40    the basic block functions in the vector so that things get done in
  41    a uniform manner.  */
  42 #define DF_SCAN  0
  43 #define DF_RU    1      /* Reaching Uses. */
  44 #define DF_RD    2      /* Reaching Defs. */
  45 #define DF_LR    3      /* Live Registers. */
  46 #define DF_UR    4      /* Uninitialized Registers. */
  47 #define DF_UREC  5      /* Uninitialized Registers with Early Clobber. */
  48 #define DF_CHAIN 6      /* Def-Use and/or Use-Def Chains. */
  49 #define DF_RI    7      /* Register Info. */
  50 #define DF_LAST_PROBLEM_PLUS1 (DF_RI + 1)
  51
  52 /* Flags that control the building of chains.  */
  53 #define DF_DU_CHAIN   1    /* Build DU chains.  */
  54 #define DF_UD_CHAIN   2    /* Build UD chains.  */
  55
  56
  57 /* Dataflow direction.  */
  58 enum df_flow_dir
  59   {
  60     DF_NONE,
  61     DF_FORWARD,
  62     DF_BACKWARD
  63   };
  64
  65 /* Function prototypes added to df_problem instance.  */
  66
  67 /* Allocate the problem specific data.  */
  68 typedef void (*df_alloc_function) (struct dataflow *, bitmap);
  69
  70 /* This function is called if the problem has global data that needs
  71    to be cleared when ever the set of blocks changes.  The bitmap
  72    contains the set of blocks that may require special attention.
  73    This call is only made if some of the blocks are going to change.
  74    If everything is to be deleted, the wholesale deletion mechanisms
  75    apply. */
  76 typedef void (*df_reset_function) (struct dataflow *, bitmap);
  77
  78 /* Free the basic block info.  Called from the block reordering code
  79    to get rid of the blocks that have been squished down.   */
  80 typedef void (*df_free_bb_function) (struct dataflow *, basic_block, void *);
  81
  82 /* Local compute function.  */
  83 typedef void (*df_local_compute_function) (struct dataflow *, bitmap, bitmap);
  84
  85 /* Init the solution specific data.  */
  86 typedef void (*df_init_function) (struct dataflow *, bitmap);
  87
  88 /* Iterative dataflow function.  */
  89 typedef void (*df_dataflow_function) (struct dataflow *, bitmap, bitmap,
  90                                    int *, int, bool);
  91
  92 /* Confluence operator for blocks with 0 out (or in) edges.  */
  93 typedef void (*df_confluence_function_0) (struct dataflow *, basic_block);
  94
  95 /* Confluence operator for blocks with 1 or more out (or in) edges.  */
  96 typedef void (*df_confluence_function_n) (struct dataflow *, edge);
  97
  98 /* Transfer function for blocks.  */
  99 typedef bool (*df_transfer_function) (struct dataflow *, int);
 100
 101 /* Function to massage the information after the problem solving.  */
 102 typedef void (*df_finalizer_function) (struct dataflow*, bitmap);
 103
 104 /* Function to free all of the problem specific datastructures.  */
 105 typedef void (*df_free_function) (struct dataflow *);
 106
 107 /* Function to dump results to FILE.  */
 108 typedef void (*df_dump_problem_function) (struct dataflow *, FILE *);
 109
 110 /* The static description of a dataflow problem to solve.  See above
 111    typedefs for doc for the function fields.  */
 112
 113 struct df_problem {
 114   /* The unique id of the problem.  This is used it index into
 115      df->defined_problems to make accessing the problem data easy.  */
 116   unsigned int id;
 117   enum df_flow_dir dir;                 /* Dataflow direction.  */
 118   df_alloc_function alloc_fun;
 119   df_reset_function reset_fun;
 120   df_free_bb_function free_bb_fun;
 121   df_local_compute_function local_compute_fun;
 122   df_init_function init_fun;
 123   df_dataflow_function dataflow_fun;
 124   df_confluence_function_0 con_fun_0;
 125   df_confluence_function_n con_fun_n;
 126   df_transfer_function trans_fun;
 127   df_finalizer_function finalize_fun;
 128   df_free_function free_fun;
 129   df_dump_problem_function dump_fun;
 130
 131   /* A dataflow problem that must be solved before this problem can be
 132      solved.  */
 133   struct df_problem *dependent_problem;
 134 };
 135
 136
 137 /* The specific instance of the problem to solve.  */
 138 struct dataflow
 139 {
 140   struct df *df;                        /* Instance of df we are working in.  */
 141   struct df_problem *problem;           /* The problem to be solved.  */
 142
 143   /* Communication between iterative_dataflow and hybrid_search. */
 144   sbitmap visited, pending, considered;
 145
 146   /* Array indexed by bb->index, that contains basic block problem and
 147      solution specific information.  */
 148   void **block_info;
 149   unsigned int block_info_size;
 150
 151   /* The pool to allocate the block_info from. */
 152   alloc_pool block_pool;
 153
 154   /* Other problem specific data that is not on a per basic block
 155      basis.  The structure is generally defined privately for the
 156      problem.  The exception being the scanning problem where it is
 157      fully public.  */
 158   void *problem_data;
 159 };
 160
 161 /* One of these structures is allocated for every insn.  */
 162 struct df_insn_info
 163 {
 164   struct df_ref *defs;          /* Head of insn-def chain.  */
 165   struct df_ref *uses;          /* Head of insn-use chain.  */
 166   /* ???? The following luid field should be considered private so that
 167      we can change it on the fly to accommodate new insns?  */
 168   int luid;                     /* Logical UID.  */
 169   bool contains_asm;            /* Contains an asm instruction.  */
 170 };
 171
 172 /* Two of these structures are allocated for every pseudo reg, one for
 173    the uses and one for the defs.  */
 174 struct df_reg_info
 175 {
 176   struct df_ref *reg_chain;     /* Head of reg-use or def chain.  */
 177   unsigned int begin;           /* First def_index for this pseudo.  */
 178   unsigned int n_refs;          /* Number of refs or defs for this pseudo.  */
 179 };
 180
 181
 182 enum df_ref_type {DF_REF_REG_DEF, DF_REF_REG_USE, DF_REF_REG_MEM_LOAD,
 183                   DF_REF_REG_MEM_STORE};
 184
 185 #define DF_REF_TYPE_NAMES {"def", "use", "mem load", "mem store"}
 186
 187 enum df_ref_flags
 188   {
 189     /* Read-modify-write refs generate both a use and a def and
 190        these are marked with this flag to show that they are not
 191        independent.  */
 192     DF_REF_READ_WRITE = 1,
 193
 194     /* This flag is set, if we stripped the subreg from the reference.
 195        In this case we must make conservative guesses, at what the
 196        outer mode was.  */
 197     DF_REF_STRIPPED = 2,
 198
 199     /* If this flag is set, this is not a real definition/use, but an
 200        artificial one created to model always live registers, eh uses, etc.  */
 201     DF_REF_ARTIFICIAL = 4,
 202
 203
 204     /* If this flag is set for an artificial use or def, that ref
 205        logically happens at the top of the block.  If it is not set
 206        for an artificial use or def, that ref logically happens at the
 207        bottom of the block.  This is never set for regular refs.  */
 208     DF_REF_AT_TOP = 8,
 209
 210     /* This flag is set if the use is inside a REG_EQUAL note.  */
 211     DF_REF_IN_NOTE = 16,
 212
 213     /* This flag is set if this ref is really a clobber, and not a def.  */
 214     DF_REF_CLOBBER = 32,
 215
 216     /* True if ref is dead (i.e. the next ref is a def or clobber or
 217        the end of the function.)  This is only valid the RI problem
 218        has been set in this df instance.  */
 219     DF_REF_DIES_AFTER_THIS_USE = 64
 220   };
 221
 222
 223 /* Define a register reference structure.  One of these is allocated
 224    for every register reference (use or def).  Note some register
 225    references (e.g., post_inc, subreg) generate both a def and a use.  */
 226 struct df_ref
 227 {
 228   rtx reg;                      /* The register referenced.  */
 229   unsigned int regno;           /* The register number referenced.  */
 230   basic_block bb;               /* Basic block containing the instruction. */
 231
 232   /* Insn containing ref. This will be null if this is an artificial
 233      reference.  */
 234   rtx insn;
 235   rtx *loc;                     /* The location of the reg.  */
 236   struct df_link *chain;        /* Head of def-use, use-def.  */
 237   unsigned int id;              /* Location in table.  */
 238   enum df_ref_type type;        /* Type of ref.  */
 239   enum df_ref_flags flags;      /* Various flags.  */
 240
 241   /* For each regno, there are two chains of refs, one for the uses
 242      and one for the defs.  These chains go thru the refs themselves
 243      rather than using an external structure.  */
 244   struct df_ref *next_reg;     /* Next ref with same regno and type.  */
 245   struct df_ref *prev_reg;     /* Prev ref with same regno and type.  */
 246
 247   /* Each insn has two lists, one for the uses and one for the
 248      defs. This is the next field in either of these chains. */
 249   struct df_ref *next_ref;
 250   void *data;                   /* The data assigned to it by user.  */
 251 };
 252
 253 /* There are two kinds of links: */
 254
 255 /* This is used for def-use or use-def chains.  */
 256 struct df_link
 257 {
 258   struct df_ref *ref;
 259   struct df_link *next;
 260 };
 261
 262 /* Two of these structures are allocated, one for the uses and one for
 263    the defs.  */
 264 struct df_ref_info
 265 {
 266   struct df_reg_info **regs;    /* Array indexed by pseudo regno. */
 267   unsigned int regs_size;       /* Size of currently allocated regs table.  */
 268   unsigned int regs_inited;     /* Number of regs with reg_infos allocated.  */
 269   struct df_ref **refs;         /* Ref table, indexed by id.  */
 270   unsigned int refs_size;       /* Size of currently allocated refs table.  */
 271   unsigned int bitmap_size;     /* Number of refs seen.  */
 272
 273   /* True if refs table is organized so that every reference for a
 274      pseudo is contigious.  */
 275   bool refs_organized;
 276   /* True if the next refs should be added immediately or false to
 277      defer to later to reorganize the table.  */
 278   bool add_refs_inline;
 279 };
 280
 281 \f
 282 /*----------------------------------------------------------------------------
 283    Problem data for the scanning dataflow problem.  Unlike the other
 284    dataflow problems, the problem data for scanning is fully exposed and
 285    used by owners of the problem.
 286 ----------------------------------------------------------------------------*/
 287
 288 struct df
 289 {
 290
 291 #define DF_HARD_REGS         1  /* Mark hard registers.  */
 292 #define DF_EQUIV_NOTES       2  /* Mark uses present in EQUIV/EQUAL notes.  */
 293 #define DF_SUBREGS           4  /* Return subregs rather than the inner reg.  */
 294
 295   int flags;                    /* Indicates what's recorded.  */
 296
 297   /* The set of problems to be solved is stored in two arrays.  In
 298      PROBLEMS_IN_ORDER, the problems are stored in the order that they
 299      are solved.  This is an internally dense array that may have
 300      nulls at the end of it.  In PROBLEMS_BY_INDEX, the problem is
 301      stored by the value in df_problem.id.  These are used to access
 302      the problem local data without having to search the first
 303      array.  */
 304
 305   struct dataflow *problems_in_order [DF_LAST_PROBLEM_PLUS1];
 306   struct dataflow *problems_by_index [DF_LAST_PROBLEM_PLUS1];
 307   int num_problems_defined;
 308
 309   /* Set after calls to df_scan_blocks, this contains all of the
 310      blocks that higher level problems must rescan before solving the
 311      dataflow equations.  If this is NULL, the blocks_to_analyze is
 312      used. */
 313   bitmap blocks_to_scan;
 314
 315   /* If not NULL, the subset of blocks of the program to be considered
 316      for analysis.  */
 317   bitmap blocks_to_analyze;
 318
 319   /* The following information is really the problem data for the
 320      scanning instance but it is used too often by the other problems
 321      to keep getting it from there.  */
 322   struct df_ref_info def_info;   /* Def info.  */
 323   struct df_ref_info use_info;   /* Use info.  */
 324   struct df_insn_info **insns;   /* Insn table, indexed by insn UID.  */
 325   unsigned int insns_size;       /* Size of insn table.  */
 326   bitmap hardware_regs_used;     /* The set of hardware registers used.  */
 327   bitmap entry_block_defs;       /* The set of hardware registers live on entry to the function.  */
 328   bitmap exit_block_uses;        /* The set of hardware registers used in exit block.  */
 329 };
 330
 331 #define DF_SCAN_BB_INFO(DF, BB) (df_scan_get_bb_info((DF)->problems_by_index[DF_SCAN],(BB)->index))
 332 #define DF_RU_BB_INFO(DF, BB) (df_ru_get_bb_info((DF)->problems_by_index[DF_RU],(BB)->index))
 333 #define DF_RD_BB_INFO(DF, BB) (df_rd_get_bb_info((DF)->problems_by_index[DF_RD],(BB)->index))
 334 #define DF_LR_BB_INFO(DF, BB) (df_lr_get_bb_info((DF)->problems_by_index[DF_LR],(BB)->index))
 335 #define DF_UR_BB_INFO(DF, BB) (df_ur_get_bb_info((DF)->problems_by_index[DF_UR],(BB)->index))
 336 #define DF_UREC_BB_INFO(DF, BB) (df_urec_get_bb_info((DF)->problems_by_index[DF_UREC],(BB)->index))
 337
 338 /* Most transformations that wish to use live register analysis will
 339    use these macros.  The DF_UPWARD_LIVE* macros are only half of the
 340    solution.  */
 341 #define DF_LIVE_IN(DF, BB) (DF_UR_BB_INFO(DF, BB)->in)
 342 #define DF_LIVE_OUT(DF, BB) (DF_UR_BB_INFO(DF, BB)->out)
 343
 344
 345 /* Live in for register allocation also takes into account several other factors.  */
 346 #define DF_RA_LIVE_IN(DF, BB) (DF_UREC_BB_INFO(DF, BB)->in)
 347 #define DF_RA_LIVE_OUT(DF, BB) (DF_UREC_BB_INFO(DF, BB)->out)
 348
 349 /* These macros are currently used by only reg-stack since it is not
 350    tolerant of uninitialized variables.  This intolerance should be
 351    fixed because it causes other problems.  */
 352 #define DF_UPWARD_LIVE_IN(DF, BB) (DF_LR_BB_INFO(DF, BB)->in)
 353 #define DF_UPWARD_LIVE_OUT(DF, BB) (DF_LR_BB_INFO(DF, BB)->out)
 354
 355
 356 /* Macros to access the elements within the ref structure.  */
 357
 358
 359 #define DF_REF_REAL_REG(REF) (GET_CODE ((REF)->reg) == SUBREG \
 360                                 ? SUBREG_REG ((REF)->reg) : ((REF)->reg))
 361 #define DF_REF_REGNO(REF) ((REF)->regno)
 362 #define DF_REF_REAL_LOC(REF) (GET_CODE ((REF)->reg) == SUBREG \
 363                                 ? &SUBREG_REG ((REF)->reg) : ((REF)->loc))
 364 #define DF_REF_REG(REF) ((REF)->reg)
 365 #define DF_REF_LOC(REF) ((REF)->loc)
 366 #define DF_REF_BB(REF) ((REF)->bb)
 367 #define DF_REF_BBNO(REF) (DF_REF_BB (REF)->index)
 368 #define DF_REF_INSN(REF) ((REF)->insn)
 369 #define DF_REF_INSN_UID(REF) (INSN_UID ((REF)->insn))
 370 #define DF_REF_TYPE(REF) ((REF)->type)
 371 #define DF_REF_CHAIN(REF) ((REF)->chain)
 372 #define DF_REF_ID(REF) ((REF)->id)
 373 #define DF_REF_FLAGS(REF) ((REF)->flags)
 374 #define DF_REF_NEXT_REG(REF) ((REF)->next_reg)
 375 #define DF_REF_PREV_REG(REF) ((REF)->prev_reg)
 376 #define DF_REF_NEXT_REF(REF) ((REF)->next_ref)
 377 #define DF_REF_DATA(REF) ((REF)->data)
 378
 379 /* Macros to determine the reference type.  */
 380
 381 #define DF_REF_REG_DEF_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_DEF)
 382 #define DF_REF_REG_USE_P(REF) ((REF) && ! DF_REF_REG_DEF_P (REF))
 383 #define DF_REF_REG_MEM_STORE_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_MEM_STORE)
 384 #define DF_REF_REG_MEM_LOAD_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_MEM_LOAD)
 385 #define DF_REF_REG_MEM_P(REF) (DF_REF_REG_MEM_STORE_P (REF) \
 386                                || DF_REF_REG_MEM_LOAD_P (REF))
 387
 388 /* Macros to get the refs out of def_info or use_info refs table.  */
 389 #define DF_DEFS_SIZE(DF) ((DF)->def_info.bitmap_size)
 390 #define DF_DEFS_GET(DF,ID) ((DF)->def_info.refs[(ID)])
 391 #define DF_DEFS_SET(DF,ID,VAL) ((DF)->def_info.refs[(ID)]=(VAL))
 392 #define DF_USES_SIZE(DF) ((DF)->use_info.bitmap_size)
 393 #define DF_USES_GET(DF,ID) ((DF)->use_info.refs[(ID)])
 394 #define DF_USES_SET(DF,ID,VAL) ((DF)->use_info.refs[(ID)]=(VAL))
 395
 396 /* Macros to access the register information from scan dataflow record.  */
 397
 398 #define DF_REG_SIZE(DF) ((DF)->def_info.regs_inited)
 399 #define DF_REG_DEF_GET(DF, REG) ((DF)->def_info.regs[(REG)])
 400 #define DF_REG_DEF_SET(DF, REG, VAL) ((DF)->def_info.regs[(REG)]=(VAL))
 401 #define DF_REG_USE_GET(DF, REG) ((DF)->use_info.regs[(REG)])
 402 #define DF_REG_USE_SET(DF, REG, VAL) ((DF)->use_info.regs[(REG)]=(VAL))
 403
 404 /* Macros to access the elements within the reg_info structure table.  */
 405
 406 #define DF_REGNO_FIRST_DEF(DF, REGNUM) \
 407 (DF_REG_DEF_GET(DF, REGNUM) ? DF_REG_DEF_GET(DF, REGNUM) : 0)
 408 #define DF_REGNO_LAST_USE(DF, REGNUM) \
 409 (DF_REG_USE_GET(DF, REGNUM) ? DF_REG_USE_GET(DF, REGNUM) : 0)
 410
 411 /* Macros to access the elements within the insn_info structure table.  */
 412
 413 #define DF_INSN_SIZE(DF) ((DF)->insns_size)
 414 #define DF_INSN_GET(DF,INSN) ((DF)->insns[(INSN_UID(INSN))])
 415 #define DF_INSN_SET(DF,INSN,VAL) ((DF)->insns[(INSN_UID (INSN))]=(VAL))
 416 #define DF_INSN_CONTAINS_ASM(DF, INSN) (DF_INSN_GET(DF,INSN)->contains_asm)
 417 #define DF_INSN_LUID(DF, INSN) (DF_INSN_GET(DF,INSN)->luid)
 418 #define DF_INSN_DEFS(DF, INSN) (DF_INSN_GET(DF,INSN)->defs)
 419 #define DF_INSN_USES(DF, INSN) (DF_INSN_GET(DF,INSN)->uses)
 420
 421 #define DF_INSN_UID_GET(DF,UID) ((DF)->insns[(UID)])
 422 #define DF_INSN_UID_LUID(DF, INSN) (DF_INSN_UID_GET(DF,INSN)->luid)
 423 #define DF_INSN_UID_DEFS(DF, INSN) (DF_INSN_UID_GET(DF,INSN)->defs)
 424 #define DF_INSN_UID_USES(DF, INSN) (DF_INSN_UID_GET(DF,INSN)->uses)
 425
 426 /* This is a bitmap copy of regs_invalidated_by_call so that we can
 427    easily add it into bitmaps, etc. */
 428
 429 extern bitmap df_invalidated_by_call;
 430
 431 /* Initialize ur_in and ur_out as if all hard registers were partially
 432 available.  */
 433
 434 /* The way that registers are processed, especially hard registers,
 435    changes as the compilation proceeds. These states are passed to
 436    df_set_state to control this processing.  */
 437
 438 #define DF_SCAN_INITIAL    1    /* Processing from beginning of rtl to
 439                                    global-alloc.  */
 440 #define DF_SCAN_GLOBAL     2    /* Processing before global
 441                                    allocation.  */
 442 #define DF_SCAN_POST_ALLOC 4    /* Processing after register
 443                                    allocation.  */
 444 extern int df_state;            /* Indicates where we are in the compilation.  */
 445
 446
 447 /* One of these structures is allocated for every basic block.  */
 448 struct df_scan_bb_info
 449 {
 450   /* Defs at the start of a basic block that is the target of an
 451      exception edge.  */
 452   struct df_ref *artificial_defs;
 453
 454   /* Uses of hard registers that are live at every block.  */
 455   struct df_ref *artificial_uses;
 456 };
 457
 458
 459 /* Reaching uses.  */
 460 struct df_ru_bb_info
 461 {
 462   bitmap kill;
 463   bitmap sparse_kill;
 464   bitmap gen;
 465   bitmap in;
 466   bitmap out;
 467 };
 468
 469
 470 /* Reaching definitions.  */
 471 struct df_rd_bb_info
 472 {
 473   bitmap kill;
 474   bitmap sparse_kill;
 475   bitmap gen;
 476   bitmap in;
 477   bitmap out;
 478 };
 479
 480
 481 /* Live registers.  */
 482 struct df_lr_bb_info
 483 {
 484   bitmap def;
 485   bitmap use;
 486   bitmap in;
 487   bitmap out;
 488 };
 489
 490
 491 /* Uninitialized registers.  */
 492 struct df_ur_bb_info
 493 {
 494   bitmap kill;
 495   bitmap gen;
 496   bitmap in;
 497   bitmap out;
 498 };
 499
 500 /* Uninitialized registers.  */
 501 struct df_urec_bb_info
 502 {
 503   bitmap earlyclobber;
 504   bitmap kill;
 505   bitmap gen;
 506   bitmap in;
 507   bitmap out;
 508 };
 509
 510
 511 #define df_finish(df) {df_finish1(df); df=NULL;}
 512
 513 /* Functions defined in df-core.c.  */
 514
 515 extern struct df *df_init (int);
 516 extern struct dataflow *df_add_problem (struct df *, struct df_problem *);
 517 extern void df_set_blocks (struct df*, bitmap);
 518 extern void df_finish1 (struct df *);
 519 extern void df_analyze (struct df *);
 520 extern void df_compact_blocks (struct df *);
 521 extern void df_bb_replace (struct df *, int, basic_block);
 522 extern struct df_ref *df_bb_regno_last_use_find (struct df *, basic_block, unsigned int);
 523 extern struct df_ref *df_bb_regno_first_def_find (struct df *, basic_block, unsigned int);
 524 extern struct df_ref *df_bb_regno_last_def_find (struct df *, basic_block, unsigned int);
 525 extern bool df_insn_regno_def_p (struct df *, rtx, unsigned int);
 526 extern struct df_ref *df_find_def (struct df *, rtx, rtx);
 527 extern bool df_reg_defined (struct df *, rtx, rtx);
 528 extern struct df_ref *df_find_use (struct df *, rtx, rtx);
 529 extern bool df_reg_used (struct df *, rtx, rtx);
 530 extern void df_iterative_dataflow (struct dataflow *, bitmap, bitmap, int *, int, bool);
 531 extern void df_dump (struct df *, FILE *);
 532 extern void df_chain_dump (struct df *, struct df_link *, FILE *);
 533 extern void df_refs_chain_dump (struct df *, struct df_ref *, bool, FILE *);
 534 extern void df_regs_chain_dump (struct df *, struct df_ref *,  FILE *);
 535 extern void df_insn_debug (struct df *, rtx, bool, FILE *);
 536 extern void df_insn_debug_regno (struct df *, rtx, FILE *);
 537 extern void df_regno_debug (struct df *, unsigned int, FILE *);
 538 extern void df_ref_debug (struct df *, struct df_ref *, FILE *);
 539 extern void debug_df_insn (rtx);
 540 extern void debug_df_regno (unsigned int);
 541 extern void debug_df_reg (rtx);
 542 extern void debug_df_defno (unsigned int);
 543 extern void debug_df_useno (unsigned int);
 544 extern void debug_df_ref (struct df_ref *);
 545 extern void debug_df_chain (struct df_link *);
 546 /* An instance of df that can be shared between passes.  */
 547 extern struct df *shared_df;
 548
 549
 550 /* Functions defined in df-problems.c. */
 551
 552 extern struct dataflow *df_get_dependent_problem (struct dataflow *);
 553 extern struct df_link *df_chain_create (struct dataflow *, struct df_ref *, struct df_ref *);
 554 extern void df_chain_unlink (struct dataflow *, struct df_ref *, struct df_link *);
 555 extern void df_chain_copy (struct dataflow *, struct df_ref *, struct df_link *);
 556 extern bitmap df_get_live_in (struct df *, basic_block);
 557 extern bitmap df_get_live_out (struct df *, basic_block);
 558 extern void df_grow_bb_info (struct dataflow *);
 559 extern void df_chain_dump (struct df *, struct df_link *, FILE *);
 560 extern void df_print_bb_index (basic_block bb, FILE *file);
 561 extern struct dataflow *df_ru_add_problem (struct df *);
 562 extern struct df_ru_bb_info *df_ru_get_bb_info (struct dataflow *, unsigned int);
 563 extern struct dataflow *df_rd_add_problem (struct df *);
 564 extern struct df_rd_bb_info *df_rd_get_bb_info (struct dataflow *, unsigned int);
 565 extern struct dataflow *df_lr_add_problem (struct df *);
 566 extern struct df_lr_bb_info *df_lr_get_bb_info (struct dataflow *, unsigned int);
 567 extern struct dataflow *df_ur_add_problem (struct df *);
 568 extern struct df_ur_bb_info *df_ur_get_bb_info (struct dataflow *, unsigned int);
 569 extern struct dataflow *df_urec_add_problem (struct df *);
 570 extern struct df_urec_bb_info *df_urec_get_bb_info (struct dataflow *, unsigned int);
 571 extern struct dataflow *df_chain_add_problem (struct df *, int flags);
 572 extern struct dataflow *df_ri_add_problem (struct df *);
 573 extern int df_reg_lifetime (struct df *, rtx reg);
 574
 575
 576 /* Functions defined in df-scan.c.  */
 577
 578 extern struct df_scan_bb_info *df_scan_get_bb_info (struct dataflow *, unsigned int);
 579 extern struct dataflow *df_scan_add_problem (struct df *);
 580 extern void df_rescan_blocks (struct df *, bitmap);
 581 extern struct df_ref *df_ref_create (struct df *, rtx, rtx *, rtx,basic_block,enum df_ref_type, enum df_ref_flags);
 582 extern struct df_ref *df_get_artificial_defs (struct df *, unsigned int);
 583 extern struct df_ref *df_get_artificial_uses (struct df *, unsigned int);
 584 extern void df_reg_chain_create (struct df_reg_info *, struct df_ref *);
 585 extern struct df_ref *df_reg_chain_unlink (struct dataflow *, struct df_ref *);
 586 extern void df_ref_remove (struct df *, struct df_ref *);
 587 extern void df_insn_refs_delete (struct dataflow *, rtx);
 588 extern void df_bb_refs_delete (struct dataflow *, int);
 589 extern void df_refs_delete (struct dataflow *, bitmap);
 590 extern void df_reorganize_refs (struct df_ref_info *);
 591 extern void df_set_state (int);
 592 extern void df_hard_reg_init (void);
 593 extern bool df_read_modify_subreg_p (rtx);
 594
 595
 596 #endif /* GCC_DF_H */