2009-04-21 Taras Glek <tglek@mozilla.com>
[official-gcc.git] / gcc / tree-flow.h
blobb59774f29ceb3ba60de486e6534f8e963b331609
1 /* Data and Control Flow Analysis for Trees.
2 Copyright (C) 2001, 2003, 2004, 2005, 2006, 2007, 2008, 2009
3 Free Software Foundation, Inc.
4 Contributed by Diego Novillo <dnovillo@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 #ifndef _TREE_FLOW_H
23 #define _TREE_FLOW_H 1
25 #include "bitmap.h"
26 #include "hard-reg-set.h"
27 #include "basic-block.h"
28 #include "hashtab.h"
29 #include "gimple.h"
30 #include "tree-ssa-operands.h"
31 #include "cgraph.h"
32 #include "ipa-reference.h"
33 #include "tree-ssa-alias.h"
35 /* Forward declare structures for the garbage collector GTY markers. */
36 #ifndef GCC_BASIC_BLOCK_H
37 struct edge_def;
38 typedef struct edge_def *edge;
39 struct basic_block_def;
40 typedef struct basic_block_def *basic_block;
41 #endif
42 struct static_var_ann_d;
45 /* Gimple dataflow datastructure. All publicly available fields shall have
46 gimple_ accessor defined in tree-flow-inline.h, all publicly modifiable
47 fields should have gimple_set accessor. */
48 struct GTY(()) gimple_df {
49 /* Array of all variables referenced in the function. */
50 htab_t GTY((param_is (union tree_node))) referenced_vars;
52 /* A vector of all the noreturn calls passed to modify_stmt.
53 cleanup_control_flow uses it to detect cases where a mid-block
54 indirect call has been turned into a noreturn call. When this
55 happens, all the instructions after the call are no longer
56 reachable and must be deleted as dead. */
57 VEC(gimple,gc) *modified_noreturn_calls;
59 /* Array of all SSA_NAMEs used in the function. */
60 VEC(tree,gc) *ssa_names;
62 /* Artificial variable used for the virtual operand FUD chain. */
63 tree vop;
65 /* Artificial variable used to model the effects of nonlocal
66 variables. */
67 tree nonlocal_all;
69 /* The PTA solution for the ESCAPED artificial variable. */
70 struct pt_solution escaped;
72 /* The PTA solution for the CALLUSED artificial variable. */
73 struct pt_solution callused;
75 /* Free list of SSA_NAMEs. */
76 tree free_ssanames;
78 /* Hashtable holding definition for symbol. If this field is not NULL, it
79 means that the first reference to this variable in the function is a
80 USE or a VUSE. In those cases, the SSA renamer creates an SSA name
81 for this variable with an empty defining statement. */
82 htab_t GTY((param_is (union tree_node))) default_defs;
84 /* Symbols whose SSA form needs to be updated or created for the first
85 time. */
86 bitmap syms_to_rename;
88 /* True if the code is in ssa form. */
89 unsigned int in_ssa_p : 1;
91 struct ssa_operands ssa_operands;
94 /* Accessors for internal use only. Generic code should use abstraction
95 provided by tree-flow-inline.h or specific modules. */
96 #define FREE_SSANAMES(fun) (fun)->gimple_df->free_ssanames
97 #define SSANAMES(fun) (fun)->gimple_df->ssa_names
98 #define MODIFIED_NORETURN_CALLS(fun) (fun)->gimple_df->modified_noreturn_calls
99 #define DEFAULT_DEFS(fun) (fun)->gimple_df->default_defs
100 #define SYMS_TO_RENAME(fun) (fun)->gimple_df->syms_to_rename
102 typedef struct
104 htab_t htab;
105 PTR *slot;
106 PTR *limit;
107 } htab_iterator;
109 /* Iterate through the elements of hashtable HTAB, using htab_iterator ITER,
110 storing each element in RESULT, which is of type TYPE. */
111 #define FOR_EACH_HTAB_ELEMENT(HTAB, RESULT, TYPE, ITER) \
112 for (RESULT = (TYPE) first_htab_element (&(ITER), (HTAB)); \
113 !end_htab_p (&(ITER)); \
114 RESULT = (TYPE) next_htab_element (&(ITER)))
116 /*---------------------------------------------------------------------------
117 Attributes for SSA_NAMEs.
119 NOTE: These structures are stored in struct tree_ssa_name
120 but are only used by the tree optimizers, so it makes better sense
121 to declare them here to avoid recompiling unrelated files when
122 making changes.
123 ---------------------------------------------------------------------------*/
125 /* Aliasing information for SSA_NAMEs representing pointer variables. */
126 struct GTY(()) ptr_info_def
128 /* The points-to solution, TBAA-pruned if the pointer is dereferenced. */
129 struct pt_solution pt;
133 /*---------------------------------------------------------------------------
134 Tree annotations stored in tree_base.ann
135 ---------------------------------------------------------------------------*/
136 enum tree_ann_type { TREE_ANN_COMMON, VAR_ANN, FUNCTION_ANN };
138 struct GTY(()) tree_ann_common_d {
139 /* Annotation type. */
140 enum tree_ann_type type;
142 /* Record EH region number into a statement tree created during RTL
143 expansion (see gimple_to_tree). */
144 int rn;
146 /* Auxiliary info specific to a pass. At all times, this
147 should either point to valid data or be NULL. */
148 PTR GTY ((skip (""))) aux;
150 /* The value handle for this expression. Used by GVN-PRE. */
151 tree GTY((skip)) value_handle;
153 /* Pointer to original GIMPLE statement. Used during RTL expansion
154 (see gimple_to_tree). */
155 gimple stmt;
158 /* It is advantageous to avoid things like life analysis for variables which
159 do not need PHI nodes. This enum describes whether or not a particular
160 variable may need a PHI node. */
162 enum need_phi_state {
163 /* This is the default. If we are still in this state after finding
164 all the definition and use sites, then we will assume the variable
165 needs PHI nodes. This is probably an overly conservative assumption. */
166 NEED_PHI_STATE_UNKNOWN,
168 /* This state indicates that we have seen one or more sets of the
169 variable in a single basic block and that the sets dominate all
170 uses seen so far. If after finding all definition and use sites
171 we are still in this state, then the variable does not need any
172 PHI nodes. */
173 NEED_PHI_STATE_NO,
175 /* This state indicates that we have either seen multiple definitions of
176 the variable in multiple blocks, or that we encountered a use in a
177 block that was not dominated by the block containing the set(s) of
178 this variable. This variable is assumed to need PHI nodes. */
179 NEED_PHI_STATE_MAYBE
183 /* The "no alias" attribute allows alias analysis to make more
184 aggressive assumptions when assigning alias sets, computing
185 points-to information and memory partitions. These attributes
186 are the result of user annotations or flags (e.g.,
187 -fargument-noalias). */
188 enum noalias_state {
189 /* Default state. No special assumptions can be made about this
190 symbol. */
191 MAY_ALIAS = 0,
193 /* The symbol does not alias with other symbols that have a
194 NO_ALIAS* attribute. */
195 NO_ALIAS,
197 /* The symbol does not alias with other symbols that have a
198 NO_ALIAS*, and it may not alias with global symbols. */
199 NO_ALIAS_GLOBAL,
201 /* The symbol does not alias with any other symbols. */
202 NO_ALIAS_ANYTHING
206 struct GTY(()) var_ann_d {
207 struct tree_ann_common_d common;
209 /* Used by the out of SSA pass to determine whether this variable has
210 been seen yet or not. */
211 unsigned out_of_ssa_tag : 1;
213 /* Used when building base variable structures in a var_map. */
214 unsigned base_var_processed : 1;
216 /* Nonzero if this variable was used after SSA optimizations were
217 applied. We set this when translating out of SSA form. */
218 unsigned used : 1;
220 /* This field indicates whether or not the variable may need PHI nodes.
221 See the enum's definition for more detailed information about the
222 states. */
223 ENUM_BITFIELD (need_phi_state) need_phi_state : 2;
225 /* True for HEAP artificial variables. These variables represent
226 the memory area allocated by a call to malloc. */
227 unsigned is_heapvar : 1;
229 /* This field describes several "no alias" attributes that some
230 symbols are known to have. See the enum's definition for more
231 information on each attribute. */
232 ENUM_BITFIELD (noalias_state) noalias_state : 2;
234 /* Used when going out of SSA form to indicate which partition this
235 variable represents storage for. */
236 unsigned partition;
238 /* Used by var_map for the base index of ssa base variables. */
239 unsigned base_index;
241 /* During into-ssa and the dominator optimizer, this field holds the
242 current version of this variable (an SSA_NAME). */
243 tree current_def;
246 /* Container for variable annotation used by hashtable for annotations for
247 static variables. */
248 struct GTY(()) static_var_ann_d {
249 struct var_ann_d ann;
250 unsigned int uid;
253 struct GTY(()) function_ann_d {
254 struct tree_ann_common_d common;
258 /* Immediate use lists are used to directly access all uses for an SSA
259 name and get pointers to the statement for each use.
261 The structure ssa_use_operand_d consists of PREV and NEXT pointers
262 to maintain the list. A USE pointer, which points to address where
263 the use is located and a LOC pointer which can point to the
264 statement where the use is located, or, in the case of the root
265 node, it points to the SSA name itself.
267 The list is anchored by an occurrence of ssa_operand_d *in* the
268 ssa_name node itself (named 'imm_uses'). This node is uniquely
269 identified by having a NULL USE pointer. and the LOC pointer
270 pointing back to the ssa_name node itself. This node forms the
271 base for a circular list, and initially this is the only node in
272 the list.
274 Fast iteration allows each use to be examined, but does not allow
275 any modifications to the uses or stmts.
277 Normal iteration allows insertion, deletion, and modification. the
278 iterator manages this by inserting a marker node into the list
279 immediately before the node currently being examined in the list.
280 this marker node is uniquely identified by having null stmt *and* a
281 null use pointer.
283 When iterating to the next use, the iteration routines check to see
284 if the node after the marker has changed. if it has, then the node
285 following the marker is now the next one to be visited. if not, the
286 marker node is moved past that node in the list (visualize it as
287 bumping the marker node through the list). this continues until
288 the marker node is moved to the original anchor position. the
289 marker node is then removed from the list.
291 If iteration is halted early, the marker node must be removed from
292 the list before continuing. */
293 typedef struct immediate_use_iterator_d
295 /* This is the current use the iterator is processing. */
296 ssa_use_operand_t *imm_use;
297 /* This marks the last use in the list (use node from SSA_NAME) */
298 ssa_use_operand_t *end_p;
299 /* This node is inserted and used to mark the end of the uses for a stmt. */
300 ssa_use_operand_t iter_node;
301 /* This is the next ssa_name to visit. IMM_USE may get removed before
302 the next one is traversed to, so it must be cached early. */
303 ssa_use_operand_t *next_imm_name;
304 } imm_use_iterator;
307 /* Use this iterator when simply looking at stmts. Adding, deleting or
308 modifying stmts will cause this iterator to malfunction. */
310 #define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR) \
311 for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR)); \
312 !end_readonly_imm_use_p (&(ITER)); \
313 (DEST) = next_readonly_imm_use (&(ITER)))
315 /* Use this iterator to visit each stmt which has a use of SSAVAR. */
317 #define FOR_EACH_IMM_USE_STMT(STMT, ITER, SSAVAR) \
318 for ((STMT) = first_imm_use_stmt (&(ITER), (SSAVAR)); \
319 !end_imm_use_stmt_p (&(ITER)); \
320 (STMT) = next_imm_use_stmt (&(ITER)))
322 /* Use this to terminate the FOR_EACH_IMM_USE_STMT loop early. Failure to
323 do so will result in leaving a iterator marker node in the immediate
324 use list, and nothing good will come from that. */
325 #define BREAK_FROM_IMM_USE_STMT(ITER) \
327 end_imm_use_stmt_traverse (&(ITER)); \
328 break; \
332 /* Use this iterator in combination with FOR_EACH_IMM_USE_STMT to
333 get access to each occurrence of ssavar on the stmt returned by
334 that iterator.. for instance:
336 FOR_EACH_IMM_USE_STMT (stmt, iter, var)
338 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
340 SET_USE (use_p, blah);
342 update_stmt (stmt);
343 } */
345 #define FOR_EACH_IMM_USE_ON_STMT(DEST, ITER) \
346 for ((DEST) = first_imm_use_on_stmt (&(ITER)); \
347 !end_imm_use_on_stmt_p (&(ITER)); \
348 (DEST) = next_imm_use_on_stmt (&(ITER)))
352 union GTY((desc ("ann_type ((tree_ann_t)&%h)"))) tree_ann_d {
353 struct tree_ann_common_d GTY((tag ("TREE_ANN_COMMON"))) common;
354 struct var_ann_d GTY((tag ("VAR_ANN"))) vdecl;
355 struct function_ann_d GTY((tag ("FUNCTION_ANN"))) fdecl;
358 typedef union tree_ann_d *tree_ann_t;
359 typedef struct var_ann_d *var_ann_t;
360 typedef struct function_ann_d *function_ann_t;
361 typedef struct tree_ann_common_d *tree_ann_common_t;
363 static inline tree_ann_common_t tree_common_ann (const_tree);
364 static inline tree_ann_common_t get_tree_common_ann (tree);
365 static inline var_ann_t var_ann (const_tree);
366 static inline var_ann_t get_var_ann (tree);
367 static inline function_ann_t function_ann (const_tree);
368 static inline function_ann_t get_function_ann (tree);
369 static inline enum tree_ann_type ann_type (tree_ann_t);
370 static inline void update_stmt (gimple);
371 static inline int get_lineno (const_gimple);
373 /*---------------------------------------------------------------------------
374 Structure representing predictions in tree level.
375 ---------------------------------------------------------------------------*/
376 struct GTY((chain_next ("%h.ep_next"))) edge_prediction {
377 struct edge_prediction *ep_next;
378 edge ep_edge;
379 enum br_predictor ep_predictor;
380 int ep_probability;
383 /* Accessors for basic block annotations. */
384 static inline gimple_seq phi_nodes (const_basic_block);
385 static inline void set_phi_nodes (basic_block, gimple_seq);
387 /*---------------------------------------------------------------------------
388 Global declarations
389 ---------------------------------------------------------------------------*/
390 struct GTY(()) int_tree_map {
392 unsigned int uid;
393 tree to;
396 extern unsigned int int_tree_map_hash (const void *);
397 extern int int_tree_map_eq (const void *, const void *);
399 extern unsigned int uid_decl_map_hash (const void *);
400 extern int uid_decl_map_eq (const void *, const void *);
402 typedef struct
404 htab_iterator hti;
405 } referenced_var_iterator;
408 /* This macro loops over all the referenced vars, one at a time, putting the
409 current var in VAR. Note: You are not allowed to add referenced variables
410 to the hashtable while using this macro. Doing so may cause it to behave
411 erratically. */
413 #define FOR_EACH_REFERENCED_VAR(VAR, ITER) \
414 for ((VAR) = first_referenced_var (&(ITER)); \
415 !end_referenced_vars_p (&(ITER)); \
416 (VAR) = next_referenced_var (&(ITER)))
419 typedef struct
421 int i;
422 } safe_referenced_var_iterator;
424 /* This macro loops over all the referenced vars, one at a time, putting the
425 current var in VAR. You are allowed to add referenced variables during the
426 execution of this macro, however, the macro will not iterate over them. It
427 requires a temporary vector of trees, VEC, whose lifetime is controlled by
428 the caller. The purpose of the vector is to temporarily store the
429 referenced_variables hashtable so that adding referenced variables does not
430 affect the hashtable. */
432 #define FOR_EACH_REFERENCED_VAR_SAFE(VAR, VEC, ITER) \
433 for ((ITER).i = 0, fill_referenced_var_vec (&(VEC)); \
434 VEC_iterate (tree, (VEC), (ITER).i, (VAR)); \
435 (ITER).i++)
437 extern tree referenced_var_lookup (unsigned int);
438 extern bool referenced_var_check_and_insert (tree);
439 #define num_referenced_vars htab_elements (gimple_referenced_vars (cfun))
440 #define referenced_var(i) referenced_var_lookup (i)
442 #define num_ssa_names (VEC_length (tree, cfun->gimple_df->ssa_names))
443 #define ssa_name(i) (VEC_index (tree, cfun->gimple_df->ssa_names, (i)))
445 /* Macros for showing usage statistics. */
446 #define SCALE(x) ((unsigned long) ((x) < 1024*10 \
447 ? (x) \
448 : ((x) < 1024*1024*10 \
449 ? (x) / 1024 \
450 : (x) / (1024*1024))))
452 #define LABEL(x) ((x) < 1024*10 ? 'b' : ((x) < 1024*1024*10 ? 'k' : 'M'))
454 #define PERCENT(x,y) ((float)(x) * 100.0 / (float)(y))
456 /*---------------------------------------------------------------------------
457 OpenMP Region Tree
458 ---------------------------------------------------------------------------*/
460 /* Parallel region information. Every parallel and workshare
461 directive is enclosed between two markers, the OMP_* directive
462 and a corresponding OMP_RETURN statement. */
464 struct omp_region
466 /* The enclosing region. */
467 struct omp_region *outer;
469 /* First child region. */
470 struct omp_region *inner;
472 /* Next peer region. */
473 struct omp_region *next;
475 /* Block containing the omp directive as its last stmt. */
476 basic_block entry;
478 /* Block containing the OMP_RETURN as its last stmt. */
479 basic_block exit;
481 /* Block containing the OMP_CONTINUE as its last stmt. */
482 basic_block cont;
484 /* If this is a combined parallel+workshare region, this is a list
485 of additional arguments needed by the combined parallel+workshare
486 library call. */
487 tree ws_args;
489 /* The code for the omp directive of this region. */
490 enum gimple_code type;
492 /* Schedule kind, only used for OMP_FOR type regions. */
493 enum omp_clause_schedule_kind sched_kind;
495 /* True if this is a combined parallel+workshare region. */
496 bool is_combined_parallel;
499 extern struct omp_region *root_omp_region;
500 extern struct omp_region *new_omp_region (basic_block, enum gimple_code,
501 struct omp_region *);
502 extern void free_omp_regions (void);
503 void omp_expand_local (basic_block);
504 extern tree find_omp_clause (tree, enum omp_clause_code);
505 tree copy_var_decl (tree, tree, tree);
507 /*---------------------------------------------------------------------------
508 Function prototypes
509 ---------------------------------------------------------------------------*/
510 /* In tree-cfg.c */
512 /* Location to track pending stmt for edge insertion. */
513 #define PENDING_STMT(e) ((e)->insns.g)
515 extern void delete_tree_cfg_annotations (void);
516 extern bool stmt_ends_bb_p (gimple);
517 extern bool is_ctrl_stmt (gimple);
518 extern bool is_ctrl_altering_stmt (gimple);
519 extern bool simple_goto_p (gimple);
520 extern bool stmt_can_make_abnormal_goto (gimple);
521 extern basic_block single_noncomplex_succ (basic_block bb);
522 extern void gimple_dump_bb (basic_block, FILE *, int, int);
523 extern void gimple_debug_bb (basic_block);
524 extern basic_block gimple_debug_bb_n (int);
525 extern void gimple_dump_cfg (FILE *, int);
526 extern void gimple_debug_cfg (int);
527 extern void dump_cfg_stats (FILE *);
528 extern void dot_cfg (void);
529 extern void debug_cfg_stats (void);
530 extern void debug_loops (int);
531 extern void debug_loop (struct loop *, int);
532 extern void debug_loop_num (unsigned, int);
533 extern void print_loops (FILE *, int);
534 extern void print_loops_bb (FILE *, basic_block, int, int);
535 extern void cleanup_dead_labels (void);
536 extern void group_case_labels (void);
537 extern gimple first_stmt (basic_block);
538 extern gimple last_stmt (basic_block);
539 extern gimple last_and_only_stmt (basic_block);
540 extern edge find_taken_edge (basic_block, tree);
541 extern basic_block label_to_block_fn (struct function *, tree);
542 #define label_to_block(t) (label_to_block_fn (cfun, t))
543 extern void notice_special_calls (gimple);
544 extern void clear_special_calls (void);
545 extern void verify_stmts (void);
546 extern void verify_gimple (void);
547 extern void verify_types_in_gimple_seq (gimple_seq);
548 extern tree gimple_block_label (basic_block);
549 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
550 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
551 basic_block *);
552 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
553 basic_block *);
554 extern void gather_blocks_in_sese_region (basic_block entry, basic_block exit,
555 VEC(basic_block,heap) **bbs_p);
556 extern void add_phi_args_after_copy_bb (basic_block);
557 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
558 extern bool gimple_purge_dead_abnormal_call_edges (basic_block);
559 extern bool gimple_purge_dead_eh_edges (basic_block);
560 extern bool gimple_purge_all_dead_eh_edges (const_bitmap);
561 extern tree gimplify_build1 (gimple_stmt_iterator *, enum tree_code,
562 tree, tree);
563 extern tree gimplify_build2 (gimple_stmt_iterator *, enum tree_code,
564 tree, tree, tree);
565 extern tree gimplify_build3 (gimple_stmt_iterator *, enum tree_code,
566 tree, tree, tree, tree);
567 extern void init_empty_tree_cfg (void);
568 extern void init_empty_tree_cfg_for_function (struct function *);
569 extern void fold_cond_expr_cond (void);
570 extern void make_abnormal_goto_edges (basic_block, bool);
571 extern void replace_uses_by (tree, tree);
572 extern void start_recording_case_labels (void);
573 extern void end_recording_case_labels (void);
574 extern basic_block move_sese_region_to_fn (struct function *, basic_block,
575 basic_block, tree);
576 void remove_edge_and_dominated_blocks (edge);
577 void mark_virtual_ops_in_bb (basic_block);
579 /* In tree-cfgcleanup.c */
580 extern bitmap cfgcleanup_altered_bbs;
581 extern bool cleanup_tree_cfg (void);
583 /* In tree-pretty-print.c. */
584 extern void dump_generic_bb (FILE *, basic_block, int, int);
585 extern int op_code_prio (enum tree_code);
586 extern int op_prio (const_tree);
587 extern const char *op_symbol_code (enum tree_code);
589 /* In tree-dfa.c */
590 extern var_ann_t create_var_ann (tree);
591 extern function_ann_t create_function_ann (tree);
592 extern void renumber_gimple_stmt_uids (void);
593 extern tree_ann_common_t create_tree_common_ann (tree);
594 extern void dump_dfa_stats (FILE *);
595 extern void debug_dfa_stats (void);
596 extern void debug_referenced_vars (void);
597 extern void dump_referenced_vars (FILE *);
598 extern void dump_variable (FILE *, tree);
599 extern void debug_variable (tree);
600 extern tree get_virtual_var (tree);
601 extern bool add_referenced_var (tree);
602 extern void remove_referenced_var (tree);
603 extern void mark_symbols_for_renaming (gimple);
604 extern void find_new_referenced_vars (gimple);
605 extern tree make_rename_temp (tree, const char *);
606 extern void set_default_def (tree, tree);
607 extern tree gimple_default_def (struct function *, tree);
608 extern bool stmt_references_abnormal_ssa_name (gimple);
609 extern tree get_ref_base_and_extent (tree, HOST_WIDE_INT *,
610 HOST_WIDE_INT *, HOST_WIDE_INT *);
611 extern void find_referenced_vars_in (gimple);
613 /* In tree-phinodes.c */
614 extern void reserve_phi_args_for_new_edge (basic_block);
615 extern void add_phi_node_to_bb (gimple phi, basic_block bb);
616 extern gimple make_phi_node (tree var, int len);
617 extern gimple create_phi_node (tree, basic_block);
618 extern void add_phi_arg (gimple, tree, edge);
619 extern void remove_phi_args (edge);
620 extern void remove_phi_node (gimple_stmt_iterator *, bool);
621 extern void remove_phi_nodes (basic_block);
622 extern void init_phinodes (void);
623 extern void fini_phinodes (void);
624 extern void release_phi_node (gimple);
625 #ifdef GATHER_STATISTICS
626 extern void phinodes_print_statistics (void);
627 #endif
629 /* In gimple-low.c */
630 extern void record_vars_into (tree, tree);
631 extern void record_vars (tree);
632 extern bool block_may_fallthru (const_tree);
633 extern bool gimple_seq_may_fallthru (gimple_seq);
634 extern bool gimple_stmt_may_fallthru (gimple);
637 /* In tree-ssa.c */
639 /* Mapping for redirected edges. */
640 struct GTY(()) _edge_var_map {
641 tree result; /* PHI result. */
642 tree def; /* PHI arg definition. */
644 typedef struct _edge_var_map edge_var_map;
646 DEF_VEC_O(edge_var_map);
647 DEF_VEC_ALLOC_O(edge_var_map, heap);
649 /* A vector of var maps. */
650 typedef VEC(edge_var_map, heap) *edge_var_map_vector;
652 extern void init_tree_ssa (struct function *);
653 extern void redirect_edge_var_map_add (edge, tree, tree);
654 extern void redirect_edge_var_map_clear (edge);
655 extern void redirect_edge_var_map_dup (edge, edge);
656 extern edge_var_map_vector redirect_edge_var_map_vector (edge);
657 extern void redirect_edge_var_map_destroy (void);
659 extern edge ssa_redirect_edge (edge, basic_block);
660 extern void flush_pending_stmts (edge);
661 extern void verify_ssa (bool);
662 extern void delete_tree_ssa (void);
663 extern bool ssa_undefined_value_p (tree);
664 extern void execute_update_addresses_taken (bool);
666 /* Call-back function for walk_use_def_chains(). At each reaching
667 definition, a function with this prototype is called. */
668 typedef bool (*walk_use_def_chains_fn) (tree, gimple, void *);
670 extern void walk_use_def_chains (tree, walk_use_def_chains_fn, void *, bool);
673 /* In tree-into-ssa.c */
674 void update_ssa (unsigned);
675 void delete_update_ssa (void);
676 void register_new_name_mapping (tree, tree);
677 tree create_new_def_for (tree, gimple, def_operand_p);
678 bool need_ssa_update_p (struct function *);
679 bool name_mappings_registered_p (void);
680 bool name_registered_for_update_p (tree);
681 bitmap ssa_names_to_replace (void);
682 void release_ssa_name_after_update_ssa (tree);
683 void compute_global_livein (bitmap, bitmap);
684 void mark_sym_for_renaming (tree);
685 void mark_set_for_renaming (bitmap);
686 tree get_current_def (tree);
687 void set_current_def (tree, tree);
689 /* In tree-ssanames.c */
690 extern void init_ssanames (struct function *, int);
691 extern void fini_ssanames (void);
692 extern tree make_ssa_name_fn (struct function *, tree, gimple);
693 extern tree duplicate_ssa_name (tree, gimple);
694 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
695 extern void release_ssa_name (tree);
696 extern void release_defs (gimple);
697 extern void replace_ssa_name_symbol (tree, tree);
699 #ifdef GATHER_STATISTICS
700 extern void ssanames_print_statistics (void);
701 #endif
703 /* In tree-ssa-ccp.c */
704 bool fold_stmt (gimple_stmt_iterator *);
705 bool fold_stmt_inplace (gimple);
706 tree get_symbol_constant_value (tree);
707 tree fold_const_aggregate_ref (tree);
708 bool may_propagate_address_into_dereference (tree, tree);
711 /* In tree-vrp.c */
712 tree vrp_evaluate_conditional (enum tree_code, tree, tree, gimple);
713 bool simplify_stmt_using_ranges (gimple_stmt_iterator *);
715 /* In tree-ssa-dom.c */
716 extern void dump_dominator_optimization_stats (FILE *);
717 extern void debug_dominator_optimization_stats (void);
718 int loop_depth_of_name (tree);
719 tree degenerate_phi_result (gimple);
721 /* In tree-ssa-copy.c */
722 extern void merge_alias_info (tree, tree);
723 extern void propagate_value (use_operand_p, tree);
724 extern void propagate_tree_value (tree *, tree);
725 extern void propagate_tree_value_into_stmt (gimple_stmt_iterator *, tree);
726 extern void replace_exp (use_operand_p, tree);
727 extern bool may_propagate_copy (tree, tree);
728 extern bool may_propagate_copy_into_stmt (gimple, tree);
729 extern bool may_propagate_copy_into_asm (tree);
731 /* Affine iv. */
733 typedef struct
735 /* Iv = BASE + STEP * i. */
736 tree base, step;
738 /* True if this iv does not overflow. */
739 bool no_overflow;
740 } affine_iv;
742 /* Description of number of iterations of a loop. All the expressions inside
743 the structure can be evaluated at the end of the loop's preheader
744 (and due to ssa form, also anywhere inside the body of the loop). */
746 struct tree_niter_desc
748 tree assumptions; /* The boolean expression. If this expression evaluates
749 to false, then the other fields in this structure
750 should not be used; there is no guarantee that they
751 will be correct. */
752 tree may_be_zero; /* The boolean expression. If it evaluates to true,
753 the loop will exit in the first iteration (i.e.
754 its latch will not be executed), even if the niter
755 field says otherwise. */
756 tree niter; /* The expression giving the number of iterations of
757 a loop (provided that assumptions == true and
758 may_be_zero == false), more precisely the number
759 of executions of the latch of the loop. */
760 double_int max; /* The upper bound on the number of iterations of
761 the loop. */
763 /* The simplified shape of the exit condition. The loop exits if
764 CONTROL CMP BOUND is false, where CMP is one of NE_EXPR,
765 LT_EXPR, or GT_EXPR, and step of CONTROL is positive if CMP is
766 LE_EXPR and negative if CMP is GE_EXPR. This information is used
767 by loop unrolling. */
768 affine_iv control;
769 tree bound;
770 enum tree_code cmp;
773 /* In tree-vectorizer.c */
774 unsigned vectorize_loops (void);
775 extern bool vect_can_force_dr_alignment_p (const_tree, unsigned int);
776 extern tree get_vectype_for_scalar_type (tree);
778 /* In tree-ssa-phiopt.c */
779 bool empty_block_p (basic_block);
780 basic_block *blocks_in_phiopt_order (void);
782 /* In tree-ssa-loop*.c */
784 void tree_ssa_lim (void);
785 unsigned int tree_ssa_unswitch_loops (void);
786 unsigned int canonicalize_induction_variables (void);
787 unsigned int tree_unroll_loops_completely (bool, bool);
788 unsigned int tree_ssa_prefetch_arrays (void);
789 unsigned int remove_empty_loops (void);
790 void tree_ssa_iv_optimize (void);
791 unsigned tree_predictive_commoning (void);
792 tree canonicalize_loop_ivs (struct loop *, htab_t, tree *);
793 bool parallelize_loops (void);
795 bool loop_only_exit_p (const struct loop *, const_edge);
796 bool number_of_iterations_exit (struct loop *, edge,
797 struct tree_niter_desc *niter, bool);
798 tree find_loop_niter (struct loop *, edge *);
799 tree loop_niter_by_eval (struct loop *, edge);
800 tree find_loop_niter_by_eval (struct loop *, edge *);
801 void estimate_numbers_of_iterations (void);
802 bool scev_probably_wraps_p (tree, tree, gimple, struct loop *, bool);
803 bool convert_affine_scev (struct loop *, tree, tree *, tree *, gimple, bool);
805 bool nowrap_type_p (tree);
806 enum ev_direction {EV_DIR_GROWS, EV_DIR_DECREASES, EV_DIR_UNKNOWN};
807 enum ev_direction scev_direction (const_tree);
809 void free_numbers_of_iterations_estimates (void);
810 void free_numbers_of_iterations_estimates_loop (struct loop *);
811 void rewrite_into_loop_closed_ssa (bitmap, unsigned);
812 void verify_loop_closed_ssa (void);
813 bool for_each_index (tree *, bool (*) (tree, tree *, void *), void *);
814 void create_iv (tree, tree, tree, struct loop *, gimple_stmt_iterator *, bool,
815 tree *, tree *);
816 basic_block split_loop_exit_edge (edge);
817 void standard_iv_increment_position (struct loop *, gimple_stmt_iterator *,
818 bool *);
819 basic_block ip_end_pos (struct loop *);
820 basic_block ip_normal_pos (struct loop *);
821 bool gimple_duplicate_loop_to_header_edge (struct loop *, edge,
822 unsigned int, sbitmap,
823 edge, VEC (edge, heap) **,
824 int);
825 struct loop *slpeel_tree_duplicate_loop_to_edge_cfg (struct loop *, edge);
826 void rename_variables_in_loop (struct loop *);
827 void rename_variables_in_bb (basic_block bb);
828 struct loop *tree_ssa_loop_version (struct loop *, tree,
829 basic_block *);
830 tree expand_simple_operations (tree);
831 void substitute_in_loop_info (struct loop *, tree, tree);
832 edge single_dom_exit (struct loop *);
833 bool can_unroll_loop_p (struct loop *loop, unsigned factor,
834 struct tree_niter_desc *niter);
835 void tree_unroll_loop (struct loop *, unsigned,
836 edge, struct tree_niter_desc *);
837 typedef void (*transform_callback)(struct loop *, void *);
838 void tree_transform_and_unroll_loop (struct loop *, unsigned,
839 edge, struct tree_niter_desc *,
840 transform_callback, void *);
841 bool contains_abnormal_ssa_name_p (tree);
842 bool stmt_dominates_stmt_p (gimple, gimple);
843 void mark_virtual_ops_for_renaming (gimple);
845 /* In tree-ssa-threadedge.c */
846 extern bool potentially_threadable_block (basic_block);
847 extern void thread_across_edge (gimple, edge, bool,
848 VEC(tree, heap) **, tree (*) (gimple, gimple));
850 /* In tree-ssa-loop-im.c */
851 /* The possibilities of statement movement. */
853 enum move_pos
855 MOVE_IMPOSSIBLE, /* No movement -- side effect expression. */
856 MOVE_PRESERVE_EXECUTION, /* Must not cause the non-executed statement
857 become executed -- memory accesses, ... */
858 MOVE_POSSIBLE /* Unlimited movement. */
860 extern enum move_pos movement_possibility (gimple);
861 char *get_lsm_tmp_name (tree, unsigned);
863 /* In tree-flow-inline.h */
864 static inline bool is_call_clobbered (const_tree);
865 static inline void set_is_used (tree);
866 static inline bool unmodifiable_var_p (const_tree);
867 static inline bool ref_contains_array_ref (const_tree);
868 static inline bool array_ref_contains_indirect_ref (const_tree);
870 /* In tree-eh.c */
871 extern void make_eh_edges (gimple);
872 extern bool tree_could_trap_p (tree);
873 extern bool operation_could_trap_helper_p (enum tree_code, bool, bool, bool,
874 bool, tree, bool *);
875 extern bool operation_could_trap_p (enum tree_code, bool, bool, tree);
876 extern bool stmt_could_throw_p (gimple);
877 extern bool tree_could_throw_p (tree);
878 extern bool stmt_can_throw_internal (gimple);
879 extern bool stmt_can_throw_external (gimple);
880 extern void add_stmt_to_eh_region (gimple, int);
881 extern bool remove_stmt_from_eh_region (gimple);
882 extern bool maybe_clean_or_replace_eh_stmt (gimple, gimple);
883 extern void add_stmt_to_eh_region_fn (struct function *, gimple, int);
884 extern bool remove_stmt_from_eh_region_fn (struct function *, gimple);
885 extern int lookup_stmt_eh_region_fn (struct function *, gimple);
886 extern int lookup_expr_eh_region (tree);
887 extern int lookup_stmt_eh_region (gimple);
888 extern bool verify_eh_edges (gimple);
891 /* In tree-ssa-pre.c */
892 struct pre_expr_d;
893 void add_to_value (unsigned int, struct pre_expr_d *);
894 void debug_value_expressions (unsigned int);
895 void print_value_expressions (FILE *, unsigned int);
898 /* In tree-vn.c */
899 tree make_value_handle (tree);
900 void set_value_handle (tree, tree);
901 bool expressions_equal_p (tree, tree);
902 void sort_vuses (VEC (tree, gc) *);
903 void sort_vuses_heap (VEC (tree, heap) *);
904 tree vn_lookup_or_add (tree);
905 tree vn_lookup_or_add_with_stmt (tree, gimple);
906 tree vn_lookup_or_add_with_vuses (tree, VEC (tree, gc) *);
907 void vn_add (tree, tree);
908 void vn_add_with_vuses (tree, tree, VEC (tree, gc) *);
909 tree vn_lookup_with_stmt (tree, gimple);
910 tree vn_lookup (tree);
911 tree vn_lookup_with_vuses (tree, VEC (tree, gc) *);
913 /* In tree-ssa-sink.c */
914 bool is_hidden_global_store (gimple);
916 /* In tree-sra.c */
917 void insert_edge_copies_seq (gimple_seq, basic_block);
918 void sra_insert_before (gimple_stmt_iterator *, gimple_seq);
919 void sra_insert_after (gimple_stmt_iterator *, gimple_seq);
920 void sra_init_cache (void);
921 bool sra_type_can_be_decomposed_p (tree);
923 /* In tree-loop-linear.c */
924 extern void linear_transform_loops (void);
925 extern unsigned perfect_loop_nest_depth (struct loop *);
927 /* In graphite.c */
928 extern void graphite_transform_loops (void);
930 /* In tree-data-ref.c */
931 extern void tree_check_data_deps (void);
933 /* In tree-ssa-loop-ivopts.c */
934 bool expr_invariant_in_loop_p (struct loop *, tree);
935 bool stmt_invariant_in_loop_p (struct loop *, gimple);
936 bool multiplier_allowed_in_address_p (HOST_WIDE_INT, enum machine_mode);
937 unsigned multiply_by_cost (HOST_WIDE_INT, enum machine_mode, bool);
939 /* In tree-ssa-threadupdate.c. */
940 extern bool thread_through_all_blocks (bool);
941 extern void register_jump_thread (edge, edge);
943 /* In gimplify.c */
944 tree force_gimple_operand (tree, gimple_seq *, bool, tree);
945 tree force_gimple_operand_gsi (gimple_stmt_iterator *, tree, bool, tree,
946 bool, enum gsi_iterator_update);
947 tree gimple_fold_indirect_ref (tree);
948 void mark_addressable (tree);
950 /* In tree-ssa-live.c */
951 extern void remove_unused_locals (void);
952 extern void dump_scope_blocks (FILE *, int);
954 /* In tree-ssa-address.c */
956 /* Description of a memory address. */
958 struct mem_address
960 tree symbol, base, index, step, offset;
963 struct affine_tree_combination;
964 tree create_mem_ref (gimple_stmt_iterator *, tree,
965 struct affine_tree_combination *, bool);
966 rtx addr_for_mem_ref (struct mem_address *, bool);
967 void get_address_description (tree, struct mem_address *);
968 tree maybe_fold_tmr (tree);
970 unsigned int execute_fixup_cfg (void);
972 #include "tree-flow-inline.h"
974 void swap_tree_operands (gimple, tree *, tree *);
976 int least_common_multiple (int, int);
978 #endif /* _TREE_FLOW_H */