CbC/CbC_gcc: gcc/df.h comparison

comparison gcc/df.h @ 55:77e2b8dfacca gcc-4.4.5

update it from 4.4.3 to 4.5.0

author	ryoma <e075725@ie.u-ryukyu.ac.jp>
date	Fri, 12 Feb 2010 23:39:51 +0900
parents	a06113de4d67
children	b7f97abdc517

comparison

equal deleted inserted replaced

-:c156f1bd5cd9
+:77e2b8dfacca
 /* Form lists of pseudo register references for autoinc optimization
 for GNU compiler.  This is part of flow optimization.
 Copyright (C) 1999, 2000, 2001, 2003, 2004, 2005, 2006, 2007, 2008, 2009
 Free Software Foundation, Inc.
 Originally contributed by Michael P. Hayes
 (m.hayes@elec.canterbury.ac.nz, mhayes@redhat.com)
 Major rewrite contributed by Danny Berlin (dberlin@dberlin.org)
 and Kenneth Zadeck (zadeck@naturalbridge.com).
 This file is part of GCC.
 #define GCC_DF_H
 #include "bitmap.h"
 #include "basic-block.h"
 #include "alloc-pool.h"
+#include "timevar.h"
 struct dataflow;
 struct df;
 struct df_problem;
 struct df_link;
 struct df_insn_info;
 union df_ref_d;
 /* Data flow problems.  All problems must have a unique id here.  */
 /* Scanning is not really a dataflow problem, but it is useful to have
 the basic block functions in the vector so that things get done in
 a uniform manner.  The last four problems can be added or deleted
 at any time are always defined (though LIVE is always there at -O2
 or higher); the others are always there.  */
 #define DF_SCAN    0
 #define DF_LR      1      /* Live Registers backward. */
 #define DF_LIVE    2      /* Live Registers & Uninitialized Registers */
 #define DF_RD      3      /* Reaching Defs. */
 #define DF_CHAIN   4      /* Def-Use and/or Use-Def Chains. */
 #define DF_BYTE_LR 5      /* Subreg tracking lr.  */
 #define DF_NOTE    6      /* REG_DEF and REG_UNUSED notes. */
+#define DF_MD      7      /* Multiple Definitions. */
-#define DF_LAST_PROBLEM_PLUS1 (DF_NOTE + 1)
+#define DF_LAST_PROBLEM_PLUS1 (DF_MD + 1)
 /* Dataflow direction.  */
 enum df_flow_dir
 {
 DF_NONE,
 /* This flag is set if this ref is a partial use or def of the
 associated register.  */
 DF_REF_PARTIAL = 1 << 4,
 /* Read-modify-write refs generate both a use and a def and
 these are marked with this flag to show that they are not
 independent.  */
 DF_REF_READ_WRITE = 1 << 5,
 DF_REF_MUST_CLOBBER.  */
 DF_REF_MAY_CLOBBER = 1 << 6,
 /* This flag is set if this ref, generally a def, is a real
 clobber. This is not currently set for registers live across a
 call because that clobbering may or may not happen.
 Most of the uses of this are with sets that have a
 GET_CODE(..)==CLOBBER.  Note that this is set even if the
 clobber is to a subreg.  So in order to tell if the clobber
 wipes out the entire register, it is necessary to also check
 /* If the ref has one of the following two flags set, then the
 struct df_ref can be cast to struct df_ref_extract to access
 the width and offset fields.  */
 /* This flag is set if the ref contains a SIGN_EXTRACT.  */
 DF_REF_SIGN_EXTRACT = 1 << 8,
 /* This flag is set if the ref contains a ZERO_EXTRACT.  */
 DF_REF_ZERO_EXTRACT = 1 << 9,
 };
 /* The possible ordering of refs within the df_ref_info.  */
 enum df_ref_order
 {
 /* There is not table.  */
 DF_REF_ORDER_NO_TABLE,
 /* There is a table of refs but it is not (or no longer) organized
 by one of the following methods.  */
 DF_REF_ORDER_UNORDERED,
 DF_REF_ORDER_UNORDERED_WITH_NOTES,
 /* Organize the table by reg order, all of the refs with regno 0
 followed by all of the refs with regno 1 ... .  Within all of
 the regs for a particular regno, the refs are unordered.  */
 DF_REF_ORDER_BY_REG,
 /* For uses, the refs within eq notes may be added for
 DF_REF_ORDER_BY_REG.  */
 DF_REF_ORDER_BY_REG_WITH_NOTES,
 /* Organize the refs in insn order.  The insns are ordered within a
 block, and the blocks are ordered by FOR_ALL_BB.  */
 DF_REF_ORDER_BY_INSN,
 /* For uses, the refs within eq notes may be added for
 DF_REF_ORDER_BY_INSN.  */
 DF_REF_ORDER_BY_INSN_WITH_NOTES
 typedefs for doc for the function fields.  */
 struct df_problem {
 /* The unique id of the problem.  This is used it index into
 df->defined_problems to make accessing the problem data easy.  */
 unsigned int id;
 enum df_flow_dir dir;			/* Dataflow direction.  */
 df_alloc_function alloc_fun;
 df_reset_function reset_fun;
 df_free_bb_function free_bb_fun;
 df_local_compute_function local_compute_fun;
 df_verify_solution_start verify_start_fun;
 df_verify_solution_end verify_end_fun;
 struct df_problem *dependent_problem;
 /* The timevar id associated with this pass.  */
-unsigned int tv_id;
+timevar_id_t tv_id;
 /* True if the df_set_blocks should null out the basic block info if
 this block drops out of df->blocks_to_analyze.  */
 bool free_blocks_on_set_blocks;
 };
 solution specific information.  */
 void **block_info;
 unsigned int block_info_size;
 /* The pool to allocate the block_info from. */
 alloc_pool block_pool;
 /* The lr and live problems have their transfer functions recomputed
 only if necessary.  This is possible for them because, the
 problems are kept active for the entire backend and their
 transfer functions are indexed by the REGNO.  These are not
 fully public.  */
 void *problem_data;
 /* Local flags for some of the problems. */
 unsigned int local_flags;
 /* True if this problem of this instance has been initialized.  This
 is used by the dumpers to keep garbage out of the dumps if, for
 debugging a dump is produced before the first call to
 df_analyze after a new problem is added.  */
 bool computed;
 /* True if the something has changed which invalidates the dataflow
 solutions.  Note that this bit is always true for all problems except
 lr and live.  */
 bool solutions_dirty;
 /* If true, this pass is deleted by df_finish_pass.  This is never
 true for DF_SCAN and DF_LR.  It is true for DF_LIVE if optimize >
 instruction. These are factored into individual uses and defs but
 the aggregate is still needed to service the REG_DEAD and
 REG_UNUSED notes.  */
 struct df_mw_hardreg
 {
 rtx mw_reg;                   /* The multiword hardreg.  */
 /* These two bitfields are intentionally oversized, in the hope that
 accesses to 16-bit fields will usually be quicker.  */
 ENUM_BITFIELD(df_ref_type) type : 16;
 				/* Used to see if the ref is read or write.  */
-ENUM_BITFIELD(df_ref_flags) flags : 16;
+int flags : 16;		/* Various df_ref_flags.  */
-				/* Various flags.  */
 unsigned int start_regno;     /* First word of the multi word subreg.  */
 unsigned int end_regno;       /* Last word of the multi word subreg.  */
 unsigned int mw_order;        /* Same as df_ref.ref_order.  */
 };
 /* Define a register reference structure.  One of these is allocated
 for every register reference (use or def).  Note some register
 references (e.g., post_inc, subreg) generate both a def and a use.  */
 struct df_base_ref
 accesses to 8 and 16-bit fields will usually be quicker.  */
 ENUM_BITFIELD(df_ref_class) cl : 8;
 ENUM_BITFIELD(df_ref_type) type : 8;
 				/* Type of ref.  */
-ENUM_BITFIELD(df_ref_flags) flags : 16;
+int flags : 16;		/* Various df_ref_flags.  */
-				/* Various flags.  */
 rtx reg;			/* The register referenced.  */
 struct df_link *chain;	/* Head of def-use, use-def.  */
 /* Pointer to the insn info of the containing instruction.  FIXME!
 Currently this is NULL for artificial refs but this will be used
 when FUDs are added.  */
 struct df_insn_info *insn_info;
 /* For each regno, there are three chains of refs, one for the uses,
 the eq_uses and the defs.  These chains go thru the refs
 themselves rather than using an external structure.  */
 union df_ref_d *next_reg;     /* Next ref with same regno and type.  */
 union df_ref_d *prev_reg;     /* Prev ref with same regno and type.  */
 unsigned int regno;		/* The register number referenced.  */
 /* Location in the ref table.  This is only valid after a call to
 df_maybe_reorganize_[use,def]_refs which is an expensive operation.  */
 int id;
 /* The index at which the operand was scanned in the insn.  This is
 used to totally order the refs in an insn.  */
 unsigned int ref_order;
 };
 /* The three types of df_refs.  Note that the df_ref_extract is an
 extension of the df_regular_ref, not the df_base_ref.  */
 struct df_artificial_ref
 {
 struct df_base_ref base;
 /* Artificial refs do not have an insn, so to get the basic block,
 {
 rtx insn;                     /* The insn this info comes from.  */
 df_ref *defs;	                /* Head of insn-def chain.  */
 df_ref *uses;	                /* Head of insn-use chain.  */
 /* Head of insn-use chain for uses in REG_EQUAL/EQUIV notes.  */
 df_ref *eq_uses;
 struct df_mw_hardreg **mw_hardregs;
 /* The logical uid of the insn in the basic block.  This is valid
 after any call to df_analyze but may rot after insns are added,
 deleted or moved. */
 int luid;
 };
 /* These links are used for ref-ref chains.  Currently only DEF-USE and
 USE-DEF chains can be built by DF.  */
 struct df_link
 {
 df_ref ref;
 enum df_chain_flags
 {
 /* Flags that control the building of chains.  */
 DF_DU_CHAIN      =  1, /* Build DU chains.  */
 DF_UD_CHAIN      =  2  /* Build UD chains.  */
 };
 enum df_changeable_flags
 {
 /* Scanning flags.  */
 /* Flag to control the running of dce as a side effect of building LR.  */
 DF_LR_RUN_DCE           = 1 << 0, /* Run DCE.  */
 DF_NO_HARD_REGS         = 1 << 1, /* Skip hard registers in RD and CHAIN Building.  */
 nulls at the end of it.  In PROBLEMS_BY_INDEX, the problem is
 stored by the value in df_problem.id.  These are used to access
 the problem local data without having to search the first
 array.  */
 struct dataflow *problems_in_order[DF_LAST_PROBLEM_PLUS1];
 struct dataflow *problems_by_index[DF_LAST_PROBLEM_PLUS1];
 /* If not NULL, this subset of blocks of the program to be
 considered for analysis.  At certain times, this will contain all
 the blocks in the function so it cannot be used as an indicator
 of if we are analyzing a subset.  See analyze_subset.  */
 bitmap blocks_to_analyze;
 /* The following information is really the problem data for the
 scanning instance but it is used too often by the other problems
 to keep getting it from there.  */
 /* Insns to delete, rescan or reprocess the notes at next
 df_rescan_all or df_process_deferred_rescans. */
 bitmap insns_to_delete;
 bitmap insns_to_rescan;
 bitmap insns_to_notes_rescan;
 int *postorder;                /* The current set of basic blocks
 in reverse postorder.  */
 int *postorder_inverted;       /* The current set of basic blocks
 in reverse postorder of inverted CFG.  */
 int n_blocks;                  /* The number of blocks in reverse postorder.  */
 int n_blocks_inverted;         /* The number of blocks
 in reverse postorder of inverted CFG.  */
 /* An array [FIRST_PSEUDO_REGISTER], indexed by regno, of the number
 of refs that qualify as being real hard regs uses.  Artificial
 uses and defs as well as refs in eq notes are ignored.  If the
 /* This counter provides a way to totally order refs without using
 addresses.  It is incremented whenever a ref is created.  */
 unsigned int ref_order;
-/* Problem specific control information.  */
+/* Problem specific control information.  This is a combination of
-ENUM_BITFIELD (df_changeable_flags) changeable_flags : 8;
+enum df_changeable_flags values.  */
+int changeable_flags : 8;
 /* If this is true, then only a subset of the blocks of the program
 is considered to compute the solutions of dataflow problems.  */
 bool analyze_subset;
 #define DF_SCAN_BB_INFO(BB) (df_scan_get_bb_info((BB)->index))
 #define DF_RD_BB_INFO(BB) (df_rd_get_bb_info((BB)->index))
 #define DF_LR_BB_INFO(BB) (df_lr_get_bb_info((BB)->index))
 #define DF_LIVE_BB_INFO(BB) (df_live_get_bb_info((BB)->index))
 #define DF_BYTE_LR_BB_INFO(BB) (df_byte_lr_get_bb_info((BB)->index))
+#define DF_MD_BB_INFO(BB) (df_md_get_bb_info((BB)->index))
 /* Most transformations that wish to use live register analysis will
 use these macros.  This info is the and of the lr and live sets.  */
 #define DF_LIVE_IN(BB) (DF_LIVE_BB_INFO(BB)->in)
 #define DF_LIVE_OUT(BB) (DF_LIVE_BB_INFO(BB)->out)
 /* These macros are used by passes that are not tolerant of
 uninitialized variables.  This intolerance should eventually
 be fixed.  */
 #define DF_LR_IN(BB) (DF_LR_BB_INFO(BB)->in)
 #define DF_LR_OUT(BB) (DF_LR_BB_INFO(BB)->out)
 /* These macros are used by passes that are not tolerant of
 uninitialized variables.  This intolerance should eventually
 be fixed.  */
 #define DF_BYTE_LR_IN(BB) (DF_BYTE_LR_BB_INFO(BB)->in)
 #define DF_BYTE_LR_OUT(BB) (DF_BYTE_LR_BB_INFO(BB)->out)
 /* Macros to access the elements within the ref structure.  */
 #define DF_REF_REAL_REG(REF) (GET_CODE ((REF)->base.reg) == SUBREG \
 #define DF_REF_REG_MARK(REF) (DF_REF_FLAGS_SET ((REF),DF_REF_REG_MARKER))
 #define DF_REF_REG_UNMARK(REF) (DF_REF_FLAGS_CLEAR ((REF),DF_REF_REG_MARKER))
 #define DF_REF_IS_REG_MARKED(REF) (DF_REF_FLAGS_IS_SET ((REF),DF_REF_REG_MARKER))
 #define DF_REF_NEXT_REG(REF) ((REF)->base.next_reg)
 #define DF_REF_PREV_REG(REF) ((REF)->base.prev_reg)
 /* The following two macros may only be applied if one of
 DF_REF_SIGN_EXTRACT | DF_REF_ZERO_EXTRACT is true. */
 #define DF_REF_EXTRACT_WIDTH(REF) ((REF)->extract_ref.width)
 #define DF_REF_EXTRACT_OFFSET(REF) ((REF)->extract_ref.offset)
 #define DF_REF_EXTRACT_MODE(REF) ((REF)->extract_ref.mode)
 /* Macros to determine the reference type.  */
 #define DF_MWS_TYPE(MREF) ((MREF)->type)
 /* Macros to get the refs out of def_info or use_info refs table.  If
 the focus of the dataflow has been set to some subset of blocks
 with df_set_blocks, these macros will only find the uses and defs
 in that subset of blocks.
 These macros should be used with care.  The def macros are only
 usable after a call to df_maybe_reorganize_def_refs and the use
 macros are only usable after a call to
 df_maybe_reorganize_use_refs.  HOWEVER, BUILDING AND USING THESE
 };
 /* Reaching definitions.  All bitmaps are indexed by the id field of
 the ref except sparse_kill which is indexed by regno.  */
 struct df_rd_bb_info
 {
 /* Local sets to describe the basic blocks.   */
 bitmap kill;
 bitmap sparse_kill;
 bitmap gen;   /* The set of defs generated in this block.  */
 /* The results of the dataflow problem.  */
 bitmap in;    /* At the top of the block.  */
 bitmap out;   /* At the bottom of the block.  */
 };
+/* Multiple reaching definitions.  All bitmaps are referenced by the
+register number.  */
+struct df_md_bb_info
+{
+/* Local sets to describe the basic blocks.  */
+bitmap gen;    /* Partial/conditional definitions live at BB out.  */
+bitmap kill;   /* Other definitions that are live at BB out.  */
+bitmap init;   /* Definitions coming from dominance frontier edges. */
+/* The results of the dataflow problem.  */
+bitmap in;    /* Just before the block itself. */
+bitmap out;   /* At the bottom of the block.  */
+};
 /* Live registers, a backwards dataflow problem.  All bitmaps are
 referenced by the register number.  */
 struct df_lr_bb_info
 {
 /* Local sets to describe the basic blocks.  */
 bitmap def;   /* The set of registers set in this block
 - except artificial defs at the top.  */
 bitmap use;   /* The set of registers used in this block.  */
 /* The results of the dataflow problem.  */
 bitmap in;    /* Just before the block itself. */
 /* Uninitialized registers.  All bitmaps are referenced by the
 register number.  Anded results of the forwards and backward live
 info.  Note that the forwards live information is not available
 separately.  */
 struct df_live_bb_info
 {
 /* Local sets to describe the basic blocks.  */
 bitmap kill;  /* The set of registers unset in this block.  Calls,
 		   for instance, unset registers.  */
 bitmap gen;   /* The set of registers set in this block.  */
 /* Live registers, a backwards dataflow problem.  These bitmaps are
 indexed by the df_byte_lr_offset array which is indexed by pseudo.  */
 struct df_byte_lr_bb_info
 {
 /* Local sets to describe the basic blocks.  */
 bitmap def;   /* The set of registers set in this block
 - except artificial defs at the top.  */
 bitmap use;   /* The set of registers used in this block.  */
 /* The results of the dataflow problem.  */
 bitmap in;    /* Just before the block itself. */
 };
 /* This is used for debugging and for the dumpers to find the latest
 instance so that the df info can be added to the dumps.  This
 should not be used by regular code.  */
 extern struct df *df;
 #define df_scan    (df->problems_by_index[DF_SCAN])
 #define df_rd      (df->problems_by_index[DF_RD])
 #define df_lr      (df->problems_by_index[DF_LR])
 #define df_live    (df->problems_by_index[DF_LIVE])
 #define df_chain   (df->problems_by_index[DF_CHAIN])
 #define df_byte_lr (df->problems_by_index[DF_BYTE_LR])
 #define df_note    (df->problems_by_index[DF_NOTE])
+#define df_md      (df->problems_by_index[DF_MD])
 /* This symbol turns on checking that each modification of the cfg has
 been identified to the appropriate df routines.  It is not part of
 verification per se because the check that the final solution has
 not changed covers this.  However, if the solution is not being
 /* Functions defined in df-core.c.  */
 extern void df_add_problem (struct df_problem *);
-extern enum df_changeable_flags df_set_flags (enum df_changeable_flags);
+extern int df_set_flags (int);
-extern enum df_changeable_flags df_clear_flags (enum df_changeable_flags);
+extern int df_clear_flags (int);
 extern void df_set_blocks (bitmap);
 extern void df_remove_problem (struct dataflow *);
 extern void df_finish_pass (bool);
 extern void df_analyze_problem (struct dataflow *, bitmap, int *, int);
 extern void df_analyze (void);
 extern bitmap df_get_live_out (basic_block);
 extern void df_grow_bb_info (struct dataflow *);
 extern void df_chain_dump (struct df_link *, FILE *);
 extern void df_print_bb_index (basic_block bb, FILE *file);
 extern void df_rd_add_problem (void);
+extern void df_rd_simulate_artificial_defs_at_top (basic_block, bitmap);
+extern void df_rd_simulate_one_insn (basic_block, rtx, bitmap);
 extern void df_lr_add_problem (void);
 extern void df_lr_verify_transfer_functions (void);
 extern void df_live_verify_transfer_functions (void);
 extern void df_live_add_problem (void);
 extern void df_live_set_all_dirty (void);
-extern void df_chain_add_problem (enum df_chain_flags);
+extern void df_chain_add_problem (unsigned int);
 extern void df_byte_lr_add_problem (void);
 extern int df_byte_lr_get_regno_start (unsigned int);
 extern int df_byte_lr_get_regno_len (unsigned int);
 extern void df_byte_lr_simulate_defs (rtx, bitmap);
 extern void df_byte_lr_simulate_uses (rtx, bitmap);
 extern void df_byte_lr_simulate_artificial_refs_at_top (basic_block, bitmap);
 extern void df_byte_lr_simulate_artificial_refs_at_end (basic_block, bitmap);
 extern void df_note_add_problem (void);
+extern void df_md_add_problem (void);
+extern void df_md_simulate_artificial_defs_at_top (basic_block, bitmap);
+extern void df_md_simulate_one_insn (basic_block, rtx, bitmap);
 extern void df_simulate_find_defs (rtx, bitmap);
 extern void df_simulate_defs (rtx, bitmap);
 extern void df_simulate_uses (rtx, bitmap);
 extern void df_simulate_initialize_backwards (basic_block, bitmap);
 extern void df_simulate_one_insn_backwards (basic_block, rtx, bitmap);
 extern void df_simulate_finalize_backwards (basic_block, bitmap);
 extern void df_simulate_initialize_forwards (basic_block, bitmap);
 extern void df_simulate_one_insn_forwards (basic_block, rtx, bitmap);
-extern void df_simulate_finalize_forwards (basic_block, bitmap);
 /* Functions defined in df-scan.c.  */
 extern void df_scan_alloc (bitmap);
 extern void df_scan_add_problem (void);
 extern void df_grow_reg_info (void);
 extern void df_grow_insn_info (void);
 extern void df_scan_blocks (void);
 extern df_ref df_ref_create (rtx, rtx *, rtx,basic_block,
-				     enum df_ref_type, enum df_ref_flags,
+				     enum df_ref_type, int ref_flags,
 				     int, int, enum machine_mode);
 extern void df_ref_remove (df_ref);
 extern struct df_insn_info * df_insn_create_insn_record (rtx);
 extern void df_insn_delete (basic_block, unsigned int);
 extern void df_bb_refs_record (int, bool);
 extern bool df_insn_rescan (rtx);
+extern bool df_insn_rescan_debug_internal (rtx);
 extern void df_insn_rescan_all (void);
 extern void df_process_deferred_rescans (void);
 extern void df_recompute_luids (basic_block);
 extern void df_insn_change_bb (rtx, basic_block);
 extern void df_maybe_reorganize_use_refs (enum df_ref_order);
 extern void df_compute_regs_ever_live (bool);
 extern bool df_read_modify_subreg_p (rtx);
 extern void df_scan_verify (void);
 /* Functions defined in df-byte-scan.c.  */
 extern bool df_compute_accessed_bytes (df_ref, enum df_mm,
 				       unsigned int *, unsigned int *);
 /* Get basic block info.  */
 return (struct df_lr_bb_info *) df_lr->block_info[index];
 else
 return NULL;
 }
+static inline struct df_md_bb_info *
+df_md_get_bb_info (unsigned int index)
+{
+if (index < df_md->block_info_size)
+return (struct df_md_bb_info *) df_md->block_info[index];
+else
+return NULL;
+}
 static inline struct df_live_bb_info *
 df_live_get_bb_info (unsigned int index)
 {
 if (index < df_live->block_info_size)
 return (struct df_live_bb_info *) df_live->block_info[index];

Mercurial > hg > CbC > CbC_gcc

comparison gcc/df.h @ 55:77e2b8dfacca gcc-4.4.5