* class.c (build_class_ref): Mark _Jv_fooClass DECL_EXTERNAL.
[official-gcc.git] / gcc / df.h
blob0a3f2d4f5ad45cc89ec24847f54bed145a158ab8
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 Free Software Foundation, Inc.
4 Contributed by Michael P. Hayes (m.hayes@elec.canterbury.ac.nz)
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
21 02111-1307, USA. */
23 #define DF_RD 1 /* Reaching definitions. */
24 #define DF_RU 2 /* Reaching uses. */
25 #define DF_LR 4 /* Live registers. */
26 #define DF_DU_CHAIN 8 /* Def-use chain. */
27 #define DF_UD_CHAIN 16 /* Use-def chain. */
28 #define DF_REG_INFO 32 /* Register info. */
29 #define DF_RD_CHAIN 64 /* Reg-def chain. */
30 #define DF_RU_CHAIN 128 /* Reg-use chain. */
31 #define DF_ALL 255
32 #define DF_HARD_REGS 1024
33 #define DF_EQUIV_NOTES 2048 /* Mark uses present in EQUIV/EQUAL notes. */
35 enum df_ref_type {DF_REF_REG_DEF, DF_REF_REG_USE, DF_REF_REG_MEM_LOAD,
36 DF_REF_REG_MEM_STORE};
38 #define DF_REF_TYPE_NAMES {"def", "use", "mem load", "mem store"}
40 /* ???> Perhaps all these data structures should be made private
41 to enforce the interface. */
44 /* Link on a def-use or use-def chain. */
45 struct df_link
47 struct df_link *next;
48 struct ref *ref;
51 enum df_ref_flags
53 DF_REF_READ_WRITE = 1
56 /* Define a register reference structure. */
57 struct ref
59 rtx reg; /* The register referenced. */
60 basic_block bb; /* BB containing ref. */
61 rtx insn; /* Insn containing ref. */
62 rtx *loc; /* Loc is the location of the reg. */
63 struct df_link *chain; /* Head of def-use or use-def chain. */
64 enum df_ref_type type; /* Type of ref. */
65 int id; /* Ref index. */
66 enum df_ref_flags flags; /* Various flags. */
70 /* One of these structures is allocated for every insn. */
71 struct insn_info
73 struct df_link *defs; /* Head of insn-def chain. */
74 struct df_link *uses; /* Head of insn-use chain. */
75 /* ???? The following luid field should be considerd private so that
76 we can change it on the fly to accommodate new insns? */
77 int luid; /* Logical UID. */
78 #if 0
79 rtx insn; /* Backpointer to the insn. */
80 #endif
84 /* One of these structures is allocated for every reg. */
85 struct reg_info
87 struct df_link *defs; /* Head of reg-def chain. */
88 struct df_link *uses; /* Head of reg-use chain. */
89 int lifetime;
90 int n_defs;
91 int n_uses;
95 /* One of these structures is allocated for every basic block. */
96 struct bb_info
98 /* Reaching def bitmaps have def_id elements. */
99 bitmap rd_kill;
100 bitmap rd_gen;
101 bitmap rd_in;
102 bitmap rd_out;
103 /* Reaching use bitmaps have use_id elements. */
104 bitmap ru_kill;
105 bitmap ru_gen;
106 bitmap ru_in;
107 bitmap ru_out;
108 /* Live variable bitmaps have n_regs elements. */
109 bitmap lr_def;
110 bitmap lr_use;
111 bitmap lr_in;
112 bitmap lr_out;
113 int rd_valid;
114 int ru_valid;
115 int lr_valid;
119 struct df
121 int flags; /* Indicates what's recorded. */
122 struct bb_info *bbs; /* Basic block table. */
123 struct ref **defs; /* Def table, indexed by def_id. */
124 struct ref **uses; /* Use table, indexed by use_id. */
125 struct ref **reg_def_last; /* Indexed by regno. */
126 struct reg_info *regs; /* Regs table, index by regno. */
127 unsigned int reg_size; /* Size of regs table. */
128 struct insn_info *insns; /* Insn table, indexed by insn UID. */
129 unsigned int insn_size; /* Size of insn table. */
130 unsigned int def_id; /* Next def ID. */
131 unsigned int def_size; /* Size of def table. */
132 unsigned int n_defs; /* Size of def bitmaps. */
133 unsigned int use_id; /* Next use ID. */
134 unsigned int use_size; /* Size of use table. */
135 unsigned int n_uses; /* Size of use bitmaps. */
136 unsigned int n_bbs; /* Number of basic blocks. */
137 unsigned int n_regs; /* Number of regs. */
138 unsigned int def_id_save; /* Saved next def ID. */
139 unsigned int use_id_save; /* Saved next use ID. */
140 bitmap insns_modified; /* Insns that (may) have changed. */
141 bitmap bbs_modified; /* Blocks that (may) have changed. */
142 bitmap all_blocks; /* All blocks in CFG. */
143 /* The sbitmap vector of dominators or NULL if not computed.
144 Ideally, this should be a pointer to a CFG object. */
145 sbitmap *dom;
146 int * dfs_order; /* DFS order -> block number */
147 int * rc_order; /* reverse completion order -> block number */
148 int * rts_order; /* reverse top sort order -> block number */
149 int * inverse_rc_map; /* block number -> reverse completion order */
150 int * inverse_dfs_map; /* block number -> DFS order */
151 int * inverse_rts_map; /* block number -> reverse top-sort order */
155 struct df_map
157 rtx old;
158 rtx new;
162 #define DF_BB_INFO(REFS, BB) (&REFS->bbs[(BB)->index])
165 /* Macros to access the elements within the ref structure. */
166 #define DF_REF_REAL_REG(REF) (GET_CODE ((REF)->reg) == SUBREG \
167 ? SUBREG_REG ((REF)->reg) : ((REF)->reg))
168 #define DF_REF_REGNO(REF) REGNO (DF_REF_REAL_REG (REF))
169 #define DF_REF_REAL_LOC(REF) (GET_CODE ((REF)->reg) == SUBREG \
170 ? &SUBREG_REG ((REF)->reg) : ((REF)->loc))
171 #ifdef OLD_DF_INTERFACE
172 #define DF_REF_REG(REF) DF_REF_REAL_REG(REF)
173 #define DF_REF_LOC(REF) DF_REF_REAL_LOC(REF)
174 #else
175 #define DF_REF_REG(REF) ((REF)->reg)
176 #define DF_REF_LOC(REF) ((REF)->loc)
177 #endif
178 #define DF_REF_BB(REF) ((REF)->bb)
179 #define DF_REF_BBNO(REF) ((REF)->bb->index)
180 #define DF_REF_INSN(REF) ((REF)->insn)
181 #define DF_REF_INSN_UID(REF) (INSN_UID ((REF)->insn))
182 #define DF_REF_TYPE(REF) ((REF)->type)
183 #define DF_REF_CHAIN(REF) ((REF)->chain)
184 #define DF_REF_ID(REF) ((REF)->id)
185 #define DF_REF_FLAGS(REF) ((REF)->flags)
187 /* Macros to determine the reference type. */
189 #define DF_REF_REG_DEF_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_DEF)
190 #define DF_REF_REG_USE_P(REF) ((REF) && ! DF_REF_REG_DEF_P (REF))
191 #define DF_REF_REG_MEM_STORE_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_MEM_STORE)
192 #define DF_REF_REG_MEM_LOAD_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_MEM_LOAD)
193 #define DF_REF_REG_MEM_P(REF) (DF_REF_REG_MEM_STORE_P (REF) \
194 || DF_REF_REG_MEM_LOAD_P (REF))
197 /* Macros to access the elements within the reg_info structure table. */
199 #define DF_REGNO_FIRST_DEF(DF, REGNUM) \
200 ((DF)->regs[REGNUM].defs ? (DF)->regs[REGNUM].defs->ref : 0)
201 #define DF_REGNO_LAST_USE(DF, REGNUM) \
202 ((DF)->regs[REGNUM].uses ? (DF)->regs[REGNUM].uses->ref : 0)
204 #define DF_REGNO_FIRST_BB(DF, REGNUM) \
205 (DF_REGNO_FIRST_DEF (DF, REGNUM) \
206 ? DF_REF_BB (DF_REGNO_FIRST_DEF (DF, REGNUM)) : 0)
207 #define DF_REGNO_LAST_BB(DF, REGNUM) \
208 (DF_REGNO_LAST_USE (DF, REGNUM) \
209 ? DF_REF_BB (DF_REGNO_LAST_USE (DF, REGNUM)) : 0)
212 /* Macros to access the elements within the insn_info structure table. */
214 #define DF_INSN_LUID(DF, INSN) ((DF)->insns[INSN_UID (INSN)].luid)
215 #define DF_INSN_DEFS(DF, INSN) ((DF)->insns[INSN_UID (INSN)].defs)
216 #define DF_INSN_USES(DF, INSN) ((DF)->insns[INSN_UID (INSN)].uses)
219 /* Functions to build and analyse dataflow information. */
221 extern struct df *df_init PARAMS ((void));
223 extern int df_analyse PARAMS ((struct df *, bitmap, int));
225 extern void df_finish PARAMS ((struct df *));
227 extern void df_dump PARAMS ((struct df *, int, FILE *));
229 /* Functions to modify insns. */
231 extern void df_insn_modify PARAMS ((struct df *, basic_block, rtx));
233 extern rtx df_insn_delete PARAMS ((struct df *, basic_block, rtx));
235 extern rtx df_pattern_emit_before PARAMS ((struct df *, rtx,
236 basic_block, rtx));
238 extern rtx df_jump_pattern_emit_after PARAMS ((struct df *, rtx,
239 basic_block, rtx));
241 extern rtx df_pattern_emit_after PARAMS ((struct df *, rtx,
242 basic_block, rtx));
244 extern rtx df_insn_move_before PARAMS ((struct df *, basic_block, rtx,
245 basic_block, rtx));
247 extern int df_reg_replace PARAMS ((struct df *, bitmap, rtx, rtx));
249 extern int df_ref_reg_replace PARAMS ((struct df *, struct ref *, rtx, rtx));
251 extern int df_ref_remove PARAMS ((struct df *, struct ref *));
253 extern int df_insn_reg_replace PARAMS ((struct df *, basic_block,
254 rtx, rtx, rtx));
256 extern int df_insn_mem_replace PARAMS ((struct df *, basic_block,
257 rtx, rtx, rtx));
259 extern struct ref *df_bb_def_use_swap PARAMS ((struct df *, basic_block,
260 rtx, rtx, unsigned int));
263 /* Functions to query dataflow information. */
265 extern basic_block df_regno_bb PARAMS((struct df *, unsigned int));
267 extern int df_reg_lifetime PARAMS ((struct df *, rtx));
269 extern int df_reg_global_p PARAMS ((struct df *, rtx));
271 extern int df_insn_regno_def_p PARAMS ((struct df *,
272 basic_block, rtx, unsigned int));
274 extern int df_insn_dominates_all_uses_p PARAMS ((struct df *,
275 basic_block, rtx));
277 extern int df_insn_dominates_uses_p PARAMS ((struct df *, basic_block,
278 rtx, bitmap));
280 extern int df_bb_reg_live_start_p PARAMS ((struct df *, basic_block, rtx));
282 extern int df_bb_reg_live_end_p PARAMS ((struct df *, basic_block, rtx));
284 extern int df_bb_regs_lives_compare PARAMS ((struct df *, basic_block,
285 rtx, rtx));
287 extern rtx df_bb_single_def_use_insn_find PARAMS((struct df *, basic_block,
288 rtx, rtx));
291 /* Functions for debugging from GDB. */
293 extern void debug_df_insn PARAMS ((rtx));
295 extern void debug_df_regno PARAMS ((unsigned int));
297 extern void debug_df_reg PARAMS ((rtx));
299 extern void debug_df_defno PARAMS ((unsigned int));
301 extern void debug_df_useno PARAMS ((unsigned int));
303 extern void debug_df_ref PARAMS ((struct ref *));
305 extern void debug_df_chain PARAMS ((struct df_link *));
306 extern void df_insn_debug PARAMS ((struct df *, rtx, FILE *));
307 extern void df_insn_debug_regno PARAMS ((struct df *, rtx, FILE *));
308 /* Meet over any path (UNION) or meet over all paths (INTERSECTION) */
309 enum df_confluence_op
311 UNION,
312 INTERSECTION
314 /* Dataflow direction */
315 enum df_flow_dir
317 FORWARD,
318 BACKWARD
321 typedef void (*transfer_function_sbitmap) PARAMS ((int, int *, sbitmap, sbitmap,
322 sbitmap, sbitmap, void *));
323 typedef void (*transfer_function_bitmap) PARAMS ((int, int *, bitmap, bitmap,
324 bitmap, bitmap, void *));
326 extern void iterative_dataflow_sbitmap PARAMS ((sbitmap *, sbitmap *,
327 sbitmap *, sbitmap *,
328 bitmap, enum df_flow_dir,
329 enum df_confluence_op,
330 transfer_function_sbitmap,
331 int *, void *));
332 extern void iterative_dataflow_bitmap PARAMS ((bitmap *, bitmap *, bitmap *,
333 bitmap *, bitmap,
334 enum df_flow_dir,
335 enum df_confluence_op,
336 transfer_function_bitmap,
337 int *, void *));