X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fdf.h;h=60f6030fae15ec305f8b55f9fa8b06f8953b0234;hb=576aff9d272cd8ebec2b93b10dcf5eae125e9667;hp=4d9ea0f30f5e1cea8dee4370e3c6b3b479fce271;hpb=4270b4b9847f7bb93e010f2d96cb2c17aedd9fae;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/df.h b/gcc/df.h index 4d9ea0f30f5..60f6030fae1 100644 --- a/gcc/df.h +++ b/gcc/df.h @@ -1,6 +1,7 @@ /* Form lists of pseudo register references for autoinc optimization - for GNU compiler. This is part of flow optimization. - Copyright (C) 1999, 2000, 2001 Free Software Foundation, Inc. + for GNU compiler. This is part of flow optimization. + Copyright (C) 1999, 2000, 2001, 2003, 2004, 2005 + Free Software Foundation, Inc. Contributed by Michael P. Hayes (m.hayes@elec.canterbury.ac.nz) This file is part of GCC. @@ -20,27 +21,29 @@ along with GCC; see the file COPYING. If not, write to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ -#define DF_RD 1 /* Reaching definitions. */ -#define DF_RU 2 /* Reaching uses. */ -#define DF_LR 4 /* Live registers. */ -#define DF_DU_CHAIN 8 /* Def-use chain. */ -#define DF_UD_CHAIN 16 /* Use-def chain. */ +#ifndef GCC_DF_H +#define GCC_DF_H + +#include "bitmap.h" +#include "basic-block.h" + +#define DF_RD 1 /* Reaching definitions. */ +#define DF_RU 2 /* Reaching uses. */ +#define DF_LR 4 /* Live registers. */ +#define DF_DU_CHAIN 8 /* Def-use chain. */ +#define DF_UD_CHAIN 16 /* Use-def chain. */ #define DF_REG_INFO 32 /* Register info. */ #define DF_RD_CHAIN 64 /* Reg-def chain. */ -#define DF_RU_CHAIN 128 /* Reg-use chain. */ -#define DF_ALL 255 -#define DF_HARD_REGS 1024 -#define DF_EQUIV_NOTES 2048 /* Mark uses present in EQUIV/EQUAL notes. */ +#define DF_RU_CHAIN 128 /* Reg-use chain. */ +#define DF_ALL 255 +#define DF_HARD_REGS 1024 /* Mark hard registers. */ +#define DF_EQUIV_NOTES 2048 /* Mark uses present in EQUIV/EQUAL notes. */ enum df_ref_type {DF_REF_REG_DEF, DF_REF_REG_USE, DF_REF_REG_MEM_LOAD, DF_REF_REG_MEM_STORE}; #define DF_REF_TYPE_NAMES {"def", "use", "mem load", "mem store"} -/* ???> Perhaps all these data structures should be made private - to enforce the interface. */ - - /* Link on a def-use or use-def chain. */ struct df_link { @@ -50,20 +53,31 @@ struct df_link enum df_ref_flags { - DF_REF_READ_WRITE = 1 + /* 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, + + /* This flag is set, if we stripped the subreg from the reference. + In this case we must make conservative guesses, at what the + outer mode was. */ + DF_REF_STRIPPED = 2 }; -/* Define a register reference structure. */ + +/* 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 ref { rtx reg; /* The register referenced. */ - basic_block bb; /* BB containing ref. */ rtx insn; /* Insn containing ref. */ - rtx *loc; /* Loc is the location of the reg. */ + rtx *loc; /* The location of the reg. */ struct df_link *chain; /* Head of def-use or use-def chain. */ + unsigned int id; /* Ref index. */ enum df_ref_type type; /* Type of ref. */ - int id; /* Ref index. */ enum df_ref_flags flags; /* Various flags. */ + void *data; /* The data assigned to it by user. */ }; @@ -72,12 +86,9 @@ struct insn_info { struct df_link *defs; /* Head of insn-def chain. */ struct df_link *uses; /* Head of insn-use chain. */ - /* ???? The following luid field should be considerd private so that + /* ???? The following luid field should be considered private so that we can change it on the fly to accommodate new insns? */ int luid; /* Logical UID. */ -#if 0 - rtx insn; /* Backpointer to the insn. */ -#endif }; @@ -140,15 +151,12 @@ struct df bitmap insns_modified; /* Insns that (may) have changed. */ bitmap bbs_modified; /* Blocks that (may) have changed. */ bitmap all_blocks; /* All blocks in CFG. */ - /* The sbitmap vector of dominators or NULL if not computed. - Ideally, this should be a pointer to a CFG object. */ - sbitmap *dom; - int * dfs_order; /* DFS order -> block number */ - int * rc_order; /* reverse completion order -> block number */ - int * rts_order; /* reverse top sort order -> block number */ - int * inverse_rc_map; /* block number -> reverse completion order */ - int * inverse_dfs_map; /* block number -> DFS order */ - int * inverse_rts_map; /* block number -> reverse top-sort order */ + int *dfs_order; /* DFS order -> block number. */ + int *rc_order; /* Reverse completion order -> block number. */ + int *rts_order; /* Reverse top sort order -> block number. */ + int *inverse_rc_map; /* Block number -> reverse completion order. */ + int *inverse_dfs_map; /* Block number -> DFS order. */ + int *inverse_rts_map; /* Block number -> reverse top-sort order. */ }; @@ -163,26 +171,23 @@ struct df_map /* Macros to access the elements within the ref structure. */ + #define DF_REF_REAL_REG(REF) (GET_CODE ((REF)->reg) == SUBREG \ ? SUBREG_REG ((REF)->reg) : ((REF)->reg)) #define DF_REF_REGNO(REF) REGNO (DF_REF_REAL_REG (REF)) #define DF_REF_REAL_LOC(REF) (GET_CODE ((REF)->reg) == SUBREG \ ? &SUBREG_REG ((REF)->reg) : ((REF)->loc)) -#ifdef OLD_DF_INTERFACE -#define DF_REF_REG(REF) DF_REF_REAL_REG(REF) -#define DF_REF_LOC(REF) DF_REF_REAL_LOC(REF) -#else #define DF_REF_REG(REF) ((REF)->reg) #define DF_REF_LOC(REF) ((REF)->loc) -#endif -#define DF_REF_BB(REF) ((REF)->bb) -#define DF_REF_BBNO(REF) ((REF)->bb->index) +#define DF_REF_BB(REF) (BLOCK_FOR_INSN ((REF)->insn)) +#define DF_REF_BBNO(REF) (BLOCK_FOR_INSN ((REF)->insn)->index) #define DF_REF_INSN(REF) ((REF)->insn) #define DF_REF_INSN_UID(REF) (INSN_UID ((REF)->insn)) #define DF_REF_TYPE(REF) ((REF)->type) #define DF_REF_CHAIN(REF) ((REF)->chain) #define DF_REF_ID(REF) ((REF)->id) #define DF_REF_FLAGS(REF) ((REF)->flags) +#define DF_REF_DATA(REF) ((REF)->data) /* Macros to determine the reference type. */ @@ -191,7 +196,7 @@ struct df_map #define DF_REF_REG_MEM_STORE_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_MEM_STORE) #define DF_REF_REG_MEM_LOAD_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_MEM_LOAD) #define DF_REF_REG_MEM_P(REF) (DF_REF_REG_MEM_STORE_P (REF) \ - || DF_REF_REG_MEM_LOAD_P (REF)) + || DF_REF_REG_MEM_LOAD_P (REF)) /* Macros to access the elements within the reg_info structure table. */ @@ -216,122 +221,147 @@ struct df_map #define DF_INSN_USES(DF, INSN) ((DF)->insns[INSN_UID (INSN)].uses) -/* Functions to build and analyse dataflow information. */ +/* Functions to build and analyze dataflow information. */ -extern struct df *df_init PARAMS ((void)); +extern struct df *df_init (void); -extern int df_analyse PARAMS ((struct df *, bitmap, int)); +extern int df_analyze (struct df *, bitmap, int); +extern void df_analyze_subcfg (struct df *, bitmap, int); -extern void df_finish PARAMS ((struct df *)); +extern void df_finish (struct df *); -extern void df_dump PARAMS ((struct df *, int, FILE *)); +extern void df_dump (struct df *, int, FILE *); -/* Functions to modify insns. */ -extern void df_insn_modify PARAMS ((struct df *, basic_block, rtx)); +/* Functions to modify insns. */ -extern rtx df_insn_delete PARAMS ((struct df *, basic_block, rtx)); +extern void df_insn_modify (struct df *, basic_block, rtx); -extern rtx df_pattern_emit_before PARAMS ((struct df *, rtx, - basic_block, rtx)); +extern rtx df_insn_delete (struct df *, basic_block, rtx); -extern rtx df_jump_pattern_emit_after PARAMS ((struct df *, rtx, - basic_block, rtx)); +extern rtx df_pattern_emit_before (struct df *, rtx, basic_block, rtx); -extern rtx df_pattern_emit_after PARAMS ((struct df *, rtx, - basic_block, rtx)); +extern rtx df_jump_pattern_emit_after (struct df *, rtx, basic_block, rtx); -extern rtx df_insn_move_before PARAMS ((struct df *, basic_block, rtx, - basic_block, rtx)); +extern rtx df_pattern_emit_after (struct df *, rtx, basic_block, rtx); -extern int df_reg_replace PARAMS ((struct df *, bitmap, rtx, rtx)); +extern rtx df_insn_move_before (struct df *, basic_block, rtx, basic_block, + rtx); -extern int df_ref_reg_replace PARAMS ((struct df *, struct ref *, rtx, rtx)); +extern int df_reg_replace (struct df *, bitmap, rtx, rtx); -extern int df_ref_remove PARAMS ((struct df *, struct ref *)); +extern int df_ref_reg_replace (struct df *, struct ref *, rtx, rtx); -extern int df_insn_reg_replace PARAMS ((struct df *, basic_block, - rtx, rtx, rtx)); +extern int df_ref_remove (struct df *, struct ref *); -extern int df_insn_mem_replace PARAMS ((struct df *, basic_block, - rtx, rtx, rtx)); +extern int df_insn_mem_replace (struct df *, basic_block, rtx, rtx, rtx); -extern struct ref *df_bb_def_use_swap PARAMS ((struct df *, basic_block, - rtx, rtx, unsigned int)); +extern struct ref *df_bb_def_use_swap (struct df *, basic_block, rtx, rtx, + unsigned int); /* Functions to query dataflow information. */ -extern basic_block df_regno_bb PARAMS((struct df *, unsigned int)); +extern basic_block df_regno_bb (struct df *, unsigned int); + +extern int df_reg_lifetime (struct df *, rtx); + +extern int df_reg_global_p (struct df *, rtx); + +extern int df_insn_regno_def_p (struct df *, basic_block, rtx, unsigned int); -extern int df_reg_lifetime PARAMS ((struct df *, rtx)); +extern int df_insn_dominates_all_uses_p (struct df *, basic_block, rtx); -extern int df_reg_global_p PARAMS ((struct df *, rtx)); +extern int df_insn_dominates_uses_p (struct df *, basic_block, rtx, bitmap); -extern int df_insn_regno_def_p PARAMS ((struct df *, - basic_block, rtx, unsigned int)); +extern int df_bb_reg_live_start_p (struct df *, basic_block, rtx); -extern int df_insn_dominates_all_uses_p PARAMS ((struct df *, - basic_block, rtx)); +extern int df_bb_reg_live_end_p (struct df *, basic_block, rtx); -extern int df_insn_dominates_uses_p PARAMS ((struct df *, basic_block, - rtx, bitmap)); +extern int df_bb_regs_lives_compare (struct df *, basic_block, rtx, rtx); -extern int df_bb_reg_live_start_p PARAMS ((struct df *, basic_block, rtx)); +extern rtx df_bb_single_def_use_insn_find (struct df *, basic_block, rtx, + rtx); +extern struct ref *df_bb_regno_last_use_find (struct df *, basic_block, unsigned int); -extern int df_bb_reg_live_end_p PARAMS ((struct df *, basic_block, rtx)); +extern struct ref *df_bb_regno_first_def_find (struct df *, basic_block, unsigned int); -extern int df_bb_regs_lives_compare PARAMS ((struct df *, basic_block, - rtx, rtx)); +extern struct ref *df_bb_regno_last_def_find (struct df *, basic_block, unsigned int); -extern rtx df_bb_single_def_use_insn_find PARAMS((struct df *, basic_block, - rtx, rtx)); +extern struct ref *df_find_def (struct df *, rtx, rtx); +extern int df_reg_used (struct df *, rtx, rtx); /* Functions for debugging from GDB. */ -extern void debug_df_insn PARAMS ((rtx)); +extern void debug_df_insn (rtx); + +extern void debug_df_regno (unsigned int); + +extern void debug_df_reg (rtx); + +extern void debug_df_defno (unsigned int); -extern void debug_df_regno PARAMS ((unsigned int)); +extern void debug_df_useno (unsigned int); -extern void debug_df_reg PARAMS ((rtx)); +extern void debug_df_ref (struct ref *); -extern void debug_df_defno PARAMS ((unsigned int)); +extern void debug_df_chain (struct df_link *); -extern void debug_df_useno PARAMS ((unsigned int)); +extern void df_insn_debug (struct df *, rtx, FILE *); -extern void debug_df_ref PARAMS ((struct ref *)); +extern void df_insn_debug_regno (struct df *, rtx, FILE *); -extern void debug_df_chain PARAMS ((struct df_link *)); -extern void df_insn_debug PARAMS ((struct df *, rtx, FILE *)); -extern void df_insn_debug_regno PARAMS ((struct df *, rtx, FILE *)); -/* Meet over any path (UNION) or meet over all paths (INTERSECTION) */ + +/* Meet over any path (UNION) or meet over all paths (INTERSECTION). */ enum df_confluence_op { - UNION, - INTERSECTION + DF_UNION, + DF_INTERSECTION }; -/* Dataflow direction */ + + +/* Dataflow direction. */ enum df_flow_dir { - FORWARD, - BACKWARD + DF_FORWARD, + DF_BACKWARD }; -typedef void (*transfer_function_sbitmap) (int, int *, sbitmap, sbitmap, - sbitmap, sbitmap, void *); -typedef void (*transfer_function_bitmap) (int, int *, bitmap, bitmap, - bitmap, bitmap, void *); - -extern void iterative_dataflow_sbitmap PARAMS ((sbitmap *, sbitmap *, - sbitmap *, sbitmap *, - bitmap, enum df_flow_dir, - enum df_confluence_op, - transfer_function_sbitmap, - int *, void *)); -extern void iterative_dataflow_bitmap PARAMS ((bitmap *, bitmap *, bitmap *, - bitmap *, bitmap, - enum df_flow_dir, - enum df_confluence_op, - transfer_function_bitmap, - int *, void *)); + +typedef void (*transfer_function) (int, int *, void *, void *, + void *, void *, void *); + +/* The description of a dataflow problem to solve. */ + +enum set_representation +{ + SR_SBITMAP, /* Represent sets by bitmaps. */ + SR_BITMAP /* Represent sets by sbitmaps. */ +}; + +struct dataflow +{ + enum set_representation repr; /* The way the sets are represented. */ + + /* The following arrays are indexed by block indices, so they must always + be large enough even if we restrict ourselves just to a subset of cfg. */ + void **gen, **kill; /* Gen and kill sets. */ + void **in, **out; /* Results. */ + + enum df_flow_dir dir; /* Dataflow direction. */ + enum df_confluence_op conf_op; /* Confluence operator. */ + unsigned n_blocks; /* Number of basic blocks in the + order. */ + int *order; /* The list of basic blocks to work + with, in the order they should + be processed in. */ + transfer_function transfun; /* The transfer function. */ + void *data; /* Data used by the transfer + function. */ +}; + +extern void iterative_dataflow (struct dataflow *); +extern bool read_modify_subreg_p (rtx); + +#endif /* GCC_DF_H */