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)
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/>. */
23 #define _TREE_FLOW_H 1
26 #include "hard-reg-set.h"
27 #include "basic-block.h"
30 #include "tree-ssa-operands.h"
32 #include "ipa-reference.h"
33 #include "tree-ssa-alias.h"
35 struct static_var_ann_d;
38 /* Gimple dataflow datastructure. All publicly available fields shall have
39 gimple_ accessor defined in tree-flow-inline.h, all publicly modifiable
40 fields should have gimple_set accessor. */
41 struct GTY(()) gimple_df {
42 /* Array of all variables referenced in the function. */
43 htab_t GTY((param_is (union tree_node))) referenced_vars;
45 /* A vector of all the noreturn calls passed to modify_stmt.
46 cleanup_control_flow uses it to detect cases where a mid-block
47 indirect call has been turned into a noreturn call. When this
48 happens, all the instructions after the call are no longer
49 reachable and must be deleted as dead. */
50 VEC(gimple,gc) *modified_noreturn_calls;
52 /* Array of all SSA_NAMEs used in the function. */
53 VEC(tree,gc) *ssa_names;
55 /* Artificial variable used for the virtual operand FUD chain. */
58 /* Artificial variable used to model the effects of nonlocal
62 /* The PTA solution for the ESCAPED artificial variable. */
63 struct pt_solution escaped;
65 /* The PTA solution for the CALLUSED artificial variable. */
66 struct pt_solution callused;
68 /* Free list of SSA_NAMEs. */
71 /* Hashtable holding definition for symbol. If this field is not NULL, it
72 means that the first reference to this variable in the function is a
73 USE or a VUSE. In those cases, the SSA renamer creates an SSA name
74 for this variable with an empty defining statement. */
75 htab_t GTY((param_is (union tree_node))) default_defs;
77 /* Symbols whose SSA form needs to be updated or created for the first
79 bitmap syms_to_rename;
81 /* True if the code is in ssa form. */
82 unsigned int in_ssa_p : 1;
84 struct ssa_operands ssa_operands;
87 /* Accessors for internal use only. Generic code should use abstraction
88 provided by tree-flow-inline.h or specific modules. */
89 #define FREE_SSANAMES(fun) (fun)->gimple_df->free_ssanames
90 #define SSANAMES(fun) (fun)->gimple_df->ssa_names
91 #define MODIFIED_NORETURN_CALLS(fun) (fun)->gimple_df->modified_noreturn_calls
92 #define DEFAULT_DEFS(fun) (fun)->gimple_df->default_defs
93 #define SYMS_TO_RENAME(fun) (fun)->gimple_df->syms_to_rename
102 /* Iterate through the elements of hashtable HTAB, using htab_iterator ITER,
103 storing each element in RESULT, which is of type TYPE. */
104 #define FOR_EACH_HTAB_ELEMENT(HTAB, RESULT, TYPE, ITER) \
105 for (RESULT = (TYPE) first_htab_element (&(ITER), (HTAB)); \
106 !end_htab_p (&(ITER)); \
107 RESULT = (TYPE) next_htab_element (&(ITER)))
109 /*---------------------------------------------------------------------------
110 Attributes for SSA_NAMEs.
112 NOTE: These structures are stored in struct tree_ssa_name
113 but are only used by the tree optimizers, so it makes better sense
114 to declare them here to avoid recompiling unrelated files when
116 ---------------------------------------------------------------------------*/
118 /* Aliasing information for SSA_NAMEs representing pointer variables. */
119 struct GTY(()) ptr_info_def
121 /* The points-to solution, TBAA-pruned if the pointer is dereferenced. */
122 struct pt_solution pt;
126 /*---------------------------------------------------------------------------
127 Tree annotations stored in tree_base.ann
128 ---------------------------------------------------------------------------*/
129 enum tree_ann_type { TREE_ANN_COMMON, VAR_ANN, FUNCTION_ANN };
131 struct GTY(()) tree_ann_common_d {
132 /* Annotation type. */
133 enum tree_ann_type type;
135 /* Record EH region number into a statement tree created during RTL
136 expansion (see gimple_to_tree). */
139 /* Auxiliary info specific to a pass. At all times, this
140 should either point to valid data or be NULL. */
141 PTR GTY ((skip (""))) aux;
143 /* The value handle for this expression. Used by GVN-PRE. */
144 tree GTY((skip)) value_handle;
146 /* Pointer to original GIMPLE statement. Used during RTL expansion
147 (see gimple_to_tree). */
151 /* It is advantageous to avoid things like life analysis for variables which
152 do not need PHI nodes. This enum describes whether or not a particular
153 variable may need a PHI node. */
155 enum need_phi_state {
156 /* This is the default. If we are still in this state after finding
157 all the definition and use sites, then we will assume the variable
158 needs PHI nodes. This is probably an overly conservative assumption. */
159 NEED_PHI_STATE_UNKNOWN,
161 /* This state indicates that we have seen one or more sets of the
162 variable in a single basic block and that the sets dominate all
163 uses seen so far. If after finding all definition and use sites
164 we are still in this state, then the variable does not need any
168 /* This state indicates that we have either seen multiple definitions of
169 the variable in multiple blocks, or that we encountered a use in a
170 block that was not dominated by the block containing the set(s) of
171 this variable. This variable is assumed to need PHI nodes. */
176 /* The "no alias" attribute allows alias analysis to make more
177 aggressive assumptions when assigning alias sets, computing
178 points-to information and memory partitions. These attributes
179 are the result of user annotations or flags (e.g.,
180 -fargument-noalias). */
182 /* Default state. No special assumptions can be made about this
186 /* The symbol does not alias with other symbols that have a
187 NO_ALIAS* attribute. */
190 /* The symbol does not alias with other symbols that have a
191 NO_ALIAS*, and it may not alias with global symbols. */
194 /* The symbol does not alias with any other symbols. */
199 struct GTY(()) var_ann_d {
200 struct tree_ann_common_d common;
202 /* Used by the out of SSA pass to determine whether this variable has
203 been seen yet or not. */
204 unsigned out_of_ssa_tag : 1;
206 /* Used when building base variable structures in a var_map. */
207 unsigned base_var_processed : 1;
209 /* Nonzero if this variable was used after SSA optimizations were
210 applied. We set this when translating out of SSA form. */
213 /* This field indicates whether or not the variable may need PHI nodes.
214 See the enum's definition for more detailed information about the
216 ENUM_BITFIELD (need_phi_state) need_phi_state : 2;
218 /* True for HEAP artificial variables. These variables represent
219 the memory area allocated by a call to malloc. */
220 unsigned is_heapvar : 1;
222 /* This field describes several "no alias" attributes that some
223 symbols are known to have. See the enum's definition for more
224 information on each attribute. */
225 ENUM_BITFIELD (noalias_state) noalias_state : 2;
227 /* Used when going out of SSA form to indicate which partition this
228 variable represents storage for. */
231 /* Used by var_map for the base index of ssa base variables. */
234 /* During into-ssa and the dominator optimizer, this field holds the
235 current version of this variable (an SSA_NAME). */
239 /* Container for variable annotation used by hashtable for annotations for
241 struct GTY(()) static_var_ann_d {
242 struct var_ann_d ann;
246 struct GTY(()) function_ann_d {
247 struct tree_ann_common_d common;
251 /* Immediate use lists are used to directly access all uses for an SSA
252 name and get pointers to the statement for each use.
254 The structure ssa_use_operand_d consists of PREV and NEXT pointers
255 to maintain the list. A USE pointer, which points to address where
256 the use is located and a LOC pointer which can point to the
257 statement where the use is located, or, in the case of the root
258 node, it points to the SSA name itself.
260 The list is anchored by an occurrence of ssa_operand_d *in* the
261 ssa_name node itself (named 'imm_uses'). This node is uniquely
262 identified by having a NULL USE pointer. and the LOC pointer
263 pointing back to the ssa_name node itself. This node forms the
264 base for a circular list, and initially this is the only node in
267 Fast iteration allows each use to be examined, but does not allow
268 any modifications to the uses or stmts.
270 Normal iteration allows insertion, deletion, and modification. the
271 iterator manages this by inserting a marker node into the list
272 immediately before the node currently being examined in the list.
273 this marker node is uniquely identified by having null stmt *and* a
276 When iterating to the next use, the iteration routines check to see
277 if the node after the marker has changed. if it has, then the node
278 following the marker is now the next one to be visited. if not, the
279 marker node is moved past that node in the list (visualize it as
280 bumping the marker node through the list). this continues until
281 the marker node is moved to the original anchor position. the
282 marker node is then removed from the list.
284 If iteration is halted early, the marker node must be removed from
285 the list before continuing. */
286 typedef struct immediate_use_iterator_d
288 /* This is the current use the iterator is processing. */
289 ssa_use_operand_t *imm_use;
290 /* This marks the last use in the list (use node from SSA_NAME) */
291 ssa_use_operand_t *end_p;
292 /* This node is inserted and used to mark the end of the uses for a stmt. */
293 ssa_use_operand_t iter_node;
294 /* This is the next ssa_name to visit. IMM_USE may get removed before
295 the next one is traversed to, so it must be cached early. */
296 ssa_use_operand_t *next_imm_name;
300 /* Use this iterator when simply looking at stmts. Adding, deleting or
301 modifying stmts will cause this iterator to malfunction. */
303 #define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR) \
304 for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR)); \
305 !end_readonly_imm_use_p (&(ITER)); \
306 (DEST) = next_readonly_imm_use (&(ITER)))
308 /* Use this iterator to visit each stmt which has a use of SSAVAR. */
310 #define FOR_EACH_IMM_USE_STMT(STMT, ITER, SSAVAR) \
311 for ((STMT) = first_imm_use_stmt (&(ITER), (SSAVAR)); \
312 !end_imm_use_stmt_p (&(ITER)); \
313 (STMT) = next_imm_use_stmt (&(ITER)))
315 /* Use this to terminate the FOR_EACH_IMM_USE_STMT loop early. Failure to
316 do so will result in leaving a iterator marker node in the immediate
317 use list, and nothing good will come from that. */
318 #define BREAK_FROM_IMM_USE_STMT(ITER) \
320 end_imm_use_stmt_traverse (&(ITER)); \
325 /* Use this iterator in combination with FOR_EACH_IMM_USE_STMT to
326 get access to each occurrence of ssavar on the stmt returned by
327 that iterator.. for instance:
329 FOR_EACH_IMM_USE_STMT (stmt, iter, var)
331 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
333 SET_USE (use_p, blah);
338 #define FOR_EACH_IMM_USE_ON_STMT(DEST, ITER) \
339 for ((DEST) = first_imm_use_on_stmt (&(ITER)); \
340 !end_imm_use_on_stmt_p (&(ITER)); \
341 (DEST) = next_imm_use_on_stmt (&(ITER)))
345 union GTY((desc ("ann_type ((tree_ann_t)&%h)"))) tree_ann_d {
346 struct tree_ann_common_d GTY((tag ("TREE_ANN_COMMON"))) common;
347 struct var_ann_d GTY((tag ("VAR_ANN"))) vdecl;
348 struct function_ann_d GTY((tag ("FUNCTION_ANN"))) fdecl;
351 typedef union tree_ann_d *tree_ann_t;
352 typedef struct var_ann_d *var_ann_t;
353 typedef struct function_ann_d *function_ann_t;
354 typedef struct tree_ann_common_d *tree_ann_common_t;
356 static inline tree_ann_common_t tree_common_ann (const_tree);
357 static inline tree_ann_common_t get_tree_common_ann (tree);
358 static inline var_ann_t var_ann (const_tree);
359 static inline var_ann_t get_var_ann (tree);
360 static inline function_ann_t function_ann (const_tree);
361 static inline function_ann_t get_function_ann (tree);
362 static inline enum tree_ann_type ann_type (tree_ann_t);
363 static inline void update_stmt (gimple);
364 static inline int get_lineno (const_gimple);
366 /*---------------------------------------------------------------------------
367 Structure representing predictions in tree level.
368 ---------------------------------------------------------------------------*/
369 struct GTY((chain_next ("%h.ep_next"))) edge_prediction {
370 struct edge_prediction *ep_next;
372 enum br_predictor ep_predictor;
376 /* Accessors for basic block annotations. */
377 static inline gimple_seq phi_nodes (const_basic_block);
378 static inline void set_phi_nodes (basic_block, gimple_seq);
380 /*---------------------------------------------------------------------------
382 ---------------------------------------------------------------------------*/
383 struct GTY(()) int_tree_map {
389 extern unsigned int int_tree_map_hash (const void *);
390 extern int int_tree_map_eq (const void *, const void *);
392 extern unsigned int uid_decl_map_hash (const void *);
393 extern int uid_decl_map_eq (const void *, const void *);
398 } referenced_var_iterator;
401 /* This macro loops over all the referenced vars, one at a time, putting the
402 current var in VAR. Note: You are not allowed to add referenced variables
403 to the hashtable while using this macro. Doing so may cause it to behave
406 #define FOR_EACH_REFERENCED_VAR(VAR, ITER) \
407 for ((VAR) = first_referenced_var (&(ITER)); \
408 !end_referenced_vars_p (&(ITER)); \
409 (VAR) = next_referenced_var (&(ITER)))
415 } safe_referenced_var_iterator;
417 /* This macro loops over all the referenced vars, one at a time, putting the
418 current var in VAR. You are allowed to add referenced variables during the
419 execution of this macro, however, the macro will not iterate over them. It
420 requires a temporary vector of trees, VEC, whose lifetime is controlled by
421 the caller. The purpose of the vector is to temporarily store the
422 referenced_variables hashtable so that adding referenced variables does not
423 affect the hashtable. */
425 #define FOR_EACH_REFERENCED_VAR_SAFE(VAR, VEC, ITER) \
426 for ((ITER).i = 0, fill_referenced_var_vec (&(VEC)); \
427 VEC_iterate (tree, (VEC), (ITER).i, (VAR)); \
430 extern tree referenced_var_lookup (unsigned int);
431 extern bool referenced_var_check_and_insert (tree);
432 #define num_referenced_vars htab_elements (gimple_referenced_vars (cfun))
433 #define referenced_var(i) referenced_var_lookup (i)
435 #define num_ssa_names (VEC_length (tree, cfun->gimple_df->ssa_names))
436 #define ssa_name(i) (VEC_index (tree, cfun->gimple_df->ssa_names, (i)))
438 /* Macros for showing usage statistics. */
439 #define SCALE(x) ((unsigned long) ((x) < 1024*10 \
441 : ((x) < 1024*1024*10 \
443 : (x) / (1024*1024))))
445 #define LABEL(x) ((x) < 1024*10 ? 'b' : ((x) < 1024*1024*10 ? 'k' : 'M'))
447 #define PERCENT(x,y) ((float)(x) * 100.0 / (float)(y))
449 /*---------------------------------------------------------------------------
451 ---------------------------------------------------------------------------*/
453 /* Parallel region information. Every parallel and workshare
454 directive is enclosed between two markers, the OMP_* directive
455 and a corresponding OMP_RETURN statement. */
459 /* The enclosing region. */
460 struct omp_region *outer;
462 /* First child region. */
463 struct omp_region *inner;
465 /* Next peer region. */
466 struct omp_region *next;
468 /* Block containing the omp directive as its last stmt. */
471 /* Block containing the OMP_RETURN as its last stmt. */
474 /* Block containing the OMP_CONTINUE as its last stmt. */
477 /* If this is a combined parallel+workshare region, this is a list
478 of additional arguments needed by the combined parallel+workshare
482 /* The code for the omp directive of this region. */
483 enum gimple_code type;
485 /* Schedule kind, only used for OMP_FOR type regions. */
486 enum omp_clause_schedule_kind sched_kind;
488 /* True if this is a combined parallel+workshare region. */
489 bool is_combined_parallel;
492 extern struct omp_region *root_omp_region;
493 extern struct omp_region *new_omp_region (basic_block, enum gimple_code,
494 struct omp_region *);
495 extern void free_omp_regions (void);
496 void omp_expand_local (basic_block);
497 extern tree find_omp_clause (tree, enum omp_clause_code);
498 tree copy_var_decl (tree, tree, tree);
500 /*---------------------------------------------------------------------------
502 ---------------------------------------------------------------------------*/
505 /* Location to track pending stmt for edge insertion. */
506 #define PENDING_STMT(e) ((e)->insns.g)
508 extern void delete_tree_cfg_annotations (void);
509 extern bool stmt_ends_bb_p (gimple);
510 extern bool is_ctrl_stmt (gimple);
511 extern bool is_ctrl_altering_stmt (gimple);
512 extern bool simple_goto_p (gimple);
513 extern bool stmt_can_make_abnormal_goto (gimple);
514 extern basic_block single_noncomplex_succ (basic_block bb);
515 extern void gimple_dump_bb (basic_block, FILE *, int, int);
516 extern void gimple_debug_bb (basic_block);
517 extern basic_block gimple_debug_bb_n (int);
518 extern void gimple_dump_cfg (FILE *, int);
519 extern void gimple_debug_cfg (int);
520 extern void dump_cfg_stats (FILE *);
521 extern void dot_cfg (void);
522 extern void debug_cfg_stats (void);
523 extern void debug_loops (int);
524 extern void debug_loop (struct loop *, int);
525 extern void debug_loop_num (unsigned, int);
526 extern void print_loops (FILE *, int);
527 extern void print_loops_bb (FILE *, basic_block, int, int);
528 extern void cleanup_dead_labels (void);
529 extern void group_case_labels (void);
530 extern gimple first_stmt (basic_block);
531 extern gimple last_stmt (basic_block);
532 extern gimple last_and_only_stmt (basic_block);
533 extern edge find_taken_edge (basic_block, tree);
534 extern basic_block label_to_block_fn (struct function *, tree);
535 #define label_to_block(t) (label_to_block_fn (cfun, t))
536 extern void notice_special_calls (gimple);
537 extern void clear_special_calls (void);
538 extern void verify_stmts (void);
539 extern void verify_gimple (void);
540 extern void verify_types_in_gimple_seq (gimple_seq);
541 extern tree gimple_block_label (basic_block);
542 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
543 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
545 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
547 extern void gather_blocks_in_sese_region (basic_block entry, basic_block exit,
548 VEC(basic_block,heap) **bbs_p);
549 extern void add_phi_args_after_copy_bb (basic_block);
550 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
551 extern bool gimple_purge_dead_abnormal_call_edges (basic_block);
552 extern bool gimple_purge_dead_eh_edges (basic_block);
553 extern bool gimple_purge_all_dead_eh_edges (const_bitmap);
554 extern tree gimplify_build1 (gimple_stmt_iterator *, enum tree_code,
556 extern tree gimplify_build2 (gimple_stmt_iterator *, enum tree_code,
558 extern tree gimplify_build3 (gimple_stmt_iterator *, enum tree_code,
559 tree, tree, tree, tree);
560 extern void init_empty_tree_cfg (void);
561 extern void init_empty_tree_cfg_for_function (struct function *);
562 extern void fold_cond_expr_cond (void);
563 extern void make_abnormal_goto_edges (basic_block, bool);
564 extern void replace_uses_by (tree, tree);
565 extern void start_recording_case_labels (void);
566 extern void end_recording_case_labels (void);
567 extern basic_block move_sese_region_to_fn (struct function *, basic_block,
569 void remove_edge_and_dominated_blocks (edge);
570 void mark_virtual_ops_in_bb (basic_block);
572 /* In tree-cfgcleanup.c */
573 extern bitmap cfgcleanup_altered_bbs;
574 extern bool cleanup_tree_cfg (void);
576 /* In tree-pretty-print.c. */
577 extern void dump_generic_bb (FILE *, basic_block, int, int);
578 extern int op_code_prio (enum tree_code);
579 extern int op_prio (const_tree);
580 extern const char *op_symbol_code (enum tree_code);
583 extern var_ann_t create_var_ann (tree);
584 extern function_ann_t create_function_ann (tree);
585 extern void renumber_gimple_stmt_uids (void);
586 extern tree_ann_common_t create_tree_common_ann (tree);
587 extern void dump_dfa_stats (FILE *);
588 extern void debug_dfa_stats (void);
589 extern void debug_referenced_vars (void);
590 extern void dump_referenced_vars (FILE *);
591 extern void dump_variable (FILE *, tree);
592 extern void debug_variable (tree);
593 extern tree get_virtual_var (tree);
594 extern bool add_referenced_var (tree);
595 extern void remove_referenced_var (tree);
596 extern void mark_symbols_for_renaming (gimple);
597 extern void find_new_referenced_vars (gimple);
598 extern tree make_rename_temp (tree, const char *);
599 extern void set_default_def (tree, tree);
600 extern tree gimple_default_def (struct function *, tree);
601 extern bool stmt_references_abnormal_ssa_name (gimple);
602 extern tree get_ref_base_and_extent (tree, HOST_WIDE_INT *,
603 HOST_WIDE_INT *, HOST_WIDE_INT *);
604 extern void find_referenced_vars_in (gimple);
606 /* In tree-phinodes.c */
607 extern void reserve_phi_args_for_new_edge (basic_block);
608 extern void add_phi_node_to_bb (gimple phi, basic_block bb);
609 extern gimple make_phi_node (tree var, int len);
610 extern gimple create_phi_node (tree, basic_block);
611 extern void add_phi_arg (gimple, tree, edge);
612 extern void remove_phi_args (edge);
613 extern void remove_phi_node (gimple_stmt_iterator *, bool);
614 extern void remove_phi_nodes (basic_block);
615 extern void init_phinodes (void);
616 extern void fini_phinodes (void);
617 extern void release_phi_node (gimple);
618 #ifdef GATHER_STATISTICS
619 extern void phinodes_print_statistics (void);
622 /* In gimple-low.c */
623 extern void record_vars_into (tree, tree);
624 extern void record_vars (tree);
625 extern bool block_may_fallthru (const_tree);
626 extern bool gimple_seq_may_fallthru (gimple_seq);
627 extern bool gimple_stmt_may_fallthru (gimple);
632 /* Mapping for redirected edges. */
633 struct GTY(()) _edge_var_map {
634 tree result; /* PHI result. */
635 tree def; /* PHI arg definition. */
637 typedef struct _edge_var_map edge_var_map;
639 DEF_VEC_O(edge_var_map);
640 DEF_VEC_ALLOC_O(edge_var_map, heap);
642 /* A vector of var maps. */
643 typedef VEC(edge_var_map, heap) *edge_var_map_vector;
645 extern void init_tree_ssa (struct function *);
646 extern void redirect_edge_var_map_add (edge, tree, tree);
647 extern void redirect_edge_var_map_clear (edge);
648 extern void redirect_edge_var_map_dup (edge, edge);
649 extern edge_var_map_vector redirect_edge_var_map_vector (edge);
650 extern void redirect_edge_var_map_destroy (void);
652 extern edge ssa_redirect_edge (edge, basic_block);
653 extern void flush_pending_stmts (edge);
654 extern void verify_ssa (bool);
655 extern void delete_tree_ssa (void);
656 extern bool ssa_undefined_value_p (tree);
657 extern void execute_update_addresses_taken (bool);
659 /* Call-back function for walk_use_def_chains(). At each reaching
660 definition, a function with this prototype is called. */
661 typedef bool (*walk_use_def_chains_fn) (tree, gimple, void *);
663 extern void walk_use_def_chains (tree, walk_use_def_chains_fn, void *, bool);
666 /* In tree-into-ssa.c */
667 void update_ssa (unsigned);
668 void delete_update_ssa (void);
669 void register_new_name_mapping (tree, tree);
670 tree create_new_def_for (tree, gimple, def_operand_p);
671 bool need_ssa_update_p (struct function *);
672 bool name_mappings_registered_p (void);
673 bool name_registered_for_update_p (tree);
674 bitmap ssa_names_to_replace (void);
675 void release_ssa_name_after_update_ssa (tree);
676 void compute_global_livein (bitmap, bitmap);
677 void mark_sym_for_renaming (tree);
678 void mark_set_for_renaming (bitmap);
679 tree get_current_def (tree);
680 void set_current_def (tree, tree);
682 /* In tree-ssanames.c */
683 extern void init_ssanames (struct function *, int);
684 extern void fini_ssanames (void);
685 extern tree make_ssa_name_fn (struct function *, tree, gimple);
686 extern tree duplicate_ssa_name (tree, gimple);
687 extern void duplicate_ssa_name_ptr_info (tree, struct ptr_info_def *);
688 extern void release_ssa_name (tree);
689 extern void release_defs (gimple);
690 extern void replace_ssa_name_symbol (tree, tree);
692 #ifdef GATHER_STATISTICS
693 extern void ssanames_print_statistics (void);
696 /* In tree-ssa-ccp.c */
697 bool fold_stmt (gimple_stmt_iterator *);
698 bool fold_stmt_inplace (gimple);
699 tree get_symbol_constant_value (tree);
700 tree fold_const_aggregate_ref (tree);
701 bool may_propagate_address_into_dereference (tree, tree);
705 tree vrp_evaluate_conditional (enum tree_code, tree, tree, gimple);
706 bool simplify_stmt_using_ranges (gimple_stmt_iterator *);
708 /* In tree-ssa-dom.c */
709 extern void dump_dominator_optimization_stats (FILE *);
710 extern void debug_dominator_optimization_stats (void);
711 int loop_depth_of_name (tree);
712 tree degenerate_phi_result (gimple);
714 /* In tree-ssa-copy.c */
715 extern void merge_alias_info (tree, tree);
716 extern void propagate_value (use_operand_p, tree);
717 extern void propagate_tree_value (tree *, tree);
718 extern void propagate_tree_value_into_stmt (gimple_stmt_iterator *, tree);
719 extern void replace_exp (use_operand_p, tree);
720 extern bool may_propagate_copy (tree, tree);
721 extern bool may_propagate_copy_into_stmt (gimple, tree);
722 extern bool may_propagate_copy_into_asm (tree);
728 /* Iv = BASE + STEP * i. */
731 /* True if this iv does not overflow. */
735 /* Description of number of iterations of a loop. All the expressions inside
736 the structure can be evaluated at the end of the loop's preheader
737 (and due to ssa form, also anywhere inside the body of the loop). */
739 struct tree_niter_desc
741 tree assumptions; /* The boolean expression. If this expression evaluates
742 to false, then the other fields in this structure
743 should not be used; there is no guarantee that they
745 tree may_be_zero; /* The boolean expression. If it evaluates to true,
746 the loop will exit in the first iteration (i.e.
747 its latch will not be executed), even if the niter
748 field says otherwise. */
749 tree niter; /* The expression giving the number of iterations of
750 a loop (provided that assumptions == true and
751 may_be_zero == false), more precisely the number
752 of executions of the latch of the loop. */
753 double_int max; /* The upper bound on the number of iterations of
756 /* The simplified shape of the exit condition. The loop exits if
757 CONTROL CMP BOUND is false, where CMP is one of NE_EXPR,
758 LT_EXPR, or GT_EXPR, and step of CONTROL is positive if CMP is
759 LE_EXPR and negative if CMP is GE_EXPR. This information is used
760 by loop unrolling. */
766 /* In tree-vectorizer.c */
767 unsigned vectorize_loops (void);
768 extern bool vect_can_force_dr_alignment_p (const_tree, unsigned int);
769 extern tree get_vectype_for_scalar_type (tree);
771 /* In tree-ssa-phiopt.c */
772 bool empty_block_p (basic_block);
773 basic_block *blocks_in_phiopt_order (void);
775 /* In tree-ssa-loop*.c */
777 void tree_ssa_lim (void);
778 unsigned int tree_ssa_unswitch_loops (void);
779 unsigned int canonicalize_induction_variables (void);
780 unsigned int tree_unroll_loops_completely (bool, bool);
781 unsigned int tree_ssa_prefetch_arrays (void);
782 unsigned int remove_empty_loops (void);
783 void tree_ssa_iv_optimize (void);
784 unsigned tree_predictive_commoning (void);
785 tree canonicalize_loop_ivs (struct loop *, htab_t, tree *);
786 bool parallelize_loops (void);
788 bool loop_only_exit_p (const struct loop *, const_edge);
789 bool number_of_iterations_exit (struct loop *, edge,
790 struct tree_niter_desc *niter, bool);
791 tree find_loop_niter (struct loop *, edge *);
792 tree loop_niter_by_eval (struct loop *, edge);
793 tree find_loop_niter_by_eval (struct loop *, edge *);
794 void estimate_numbers_of_iterations (void);
795 bool scev_probably_wraps_p (tree, tree, gimple, struct loop *, bool);
796 bool convert_affine_scev (struct loop *, tree, tree *, tree *, gimple, bool);
798 bool nowrap_type_p (tree);
799 enum ev_direction {EV_DIR_GROWS, EV_DIR_DECREASES, EV_DIR_UNKNOWN};
800 enum ev_direction scev_direction (const_tree);
802 void free_numbers_of_iterations_estimates (void);
803 void free_numbers_of_iterations_estimates_loop (struct loop *);
804 void rewrite_into_loop_closed_ssa (bitmap, unsigned);
805 void verify_loop_closed_ssa (void);
806 bool for_each_index (tree *, bool (*) (tree, tree *, void *), void *);
807 void create_iv (tree, tree, tree, struct loop *, gimple_stmt_iterator *, bool,
809 basic_block split_loop_exit_edge (edge);
810 void standard_iv_increment_position (struct loop *, gimple_stmt_iterator *,
812 basic_block ip_end_pos (struct loop *);
813 basic_block ip_normal_pos (struct loop *);
814 bool gimple_duplicate_loop_to_header_edge (struct loop *, edge,
815 unsigned int, sbitmap,
816 edge, VEC (edge, heap) **,
818 struct loop *slpeel_tree_duplicate_loop_to_edge_cfg (struct loop *, edge);
819 void rename_variables_in_loop (struct loop *);
820 void rename_variables_in_bb (basic_block bb);
821 struct loop *tree_ssa_loop_version (struct loop *, tree,
823 tree expand_simple_operations (tree);
824 void substitute_in_loop_info (struct loop *, tree, tree);
825 edge single_dom_exit (struct loop *);
826 bool can_unroll_loop_p (struct loop *loop, unsigned factor,
827 struct tree_niter_desc *niter);
828 void tree_unroll_loop (struct loop *, unsigned,
829 edge, struct tree_niter_desc *);
830 typedef void (*transform_callback)(struct loop *, void *);
831 void tree_transform_and_unroll_loop (struct loop *, unsigned,
832 edge, struct tree_niter_desc *,
833 transform_callback, void *);
834 bool contains_abnormal_ssa_name_p (tree);
835 bool stmt_dominates_stmt_p (gimple, gimple);
836 void mark_virtual_ops_for_renaming (gimple);
838 /* In tree-ssa-threadedge.c */
839 extern bool potentially_threadable_block (basic_block);
840 extern void thread_across_edge (gimple, edge, bool,
841 VEC(tree, heap) **, tree (*) (gimple, gimple));
843 /* In tree-ssa-loop-im.c */
844 /* The possibilities of statement movement. */
848 MOVE_IMPOSSIBLE, /* No movement -- side effect expression. */
849 MOVE_PRESERVE_EXECUTION, /* Must not cause the non-executed statement
850 become executed -- memory accesses, ... */
851 MOVE_POSSIBLE /* Unlimited movement. */
853 extern enum move_pos movement_possibility (gimple);
854 char *get_lsm_tmp_name (tree, unsigned);
856 /* In tree-flow-inline.h */
857 static inline bool is_call_clobbered (const_tree);
858 static inline void set_is_used (tree);
859 static inline bool unmodifiable_var_p (const_tree);
860 static inline bool ref_contains_array_ref (const_tree);
861 static inline bool array_ref_contains_indirect_ref (const_tree);
864 extern void make_eh_edges (gimple);
865 extern bool tree_could_trap_p (tree);
866 extern bool operation_could_trap_helper_p (enum tree_code, bool, bool, bool,
868 extern bool operation_could_trap_p (enum tree_code, bool, bool, tree);
869 extern bool stmt_could_throw_p (gimple);
870 extern bool tree_could_throw_p (tree);
871 extern bool stmt_can_throw_internal (gimple);
872 extern bool stmt_can_throw_external (gimple);
873 extern void add_stmt_to_eh_region (gimple, int);
874 extern bool remove_stmt_from_eh_region (gimple);
875 extern bool maybe_clean_or_replace_eh_stmt (gimple, gimple);
876 extern void add_stmt_to_eh_region_fn (struct function *, gimple, int);
877 extern bool remove_stmt_from_eh_region_fn (struct function *, gimple);
878 extern int lookup_stmt_eh_region_fn (struct function *, gimple);
879 extern int lookup_expr_eh_region (tree);
880 extern int lookup_stmt_eh_region (gimple);
881 extern bool verify_eh_edges (gimple);
884 /* In tree-ssa-pre.c */
886 void add_to_value (unsigned int, struct pre_expr_d *);
887 void debug_value_expressions (unsigned int);
888 void print_value_expressions (FILE *, unsigned int);
892 tree make_value_handle (tree);
893 void set_value_handle (tree, tree);
894 bool expressions_equal_p (tree, tree);
895 void sort_vuses (VEC (tree, gc) *);
896 void sort_vuses_heap (VEC (tree, heap) *);
897 tree vn_lookup_or_add (tree);
898 tree vn_lookup_or_add_with_stmt (tree, gimple);
899 tree vn_lookup_or_add_with_vuses (tree, VEC (tree, gc) *);
900 void vn_add (tree, tree);
901 void vn_add_with_vuses (tree, tree, VEC (tree, gc) *);
902 tree vn_lookup_with_stmt (tree, gimple);
903 tree vn_lookup (tree);
904 tree vn_lookup_with_vuses (tree, VEC (tree, gc) *);
906 /* In tree-ssa-sink.c */
907 bool is_hidden_global_store (gimple);
910 void insert_edge_copies_seq (gimple_seq, basic_block);
911 void sra_insert_before (gimple_stmt_iterator *, gimple_seq);
912 void sra_insert_after (gimple_stmt_iterator *, gimple_seq);
913 void sra_init_cache (void);
914 bool sra_type_can_be_decomposed_p (tree);
916 /* In tree-loop-linear.c */
917 extern void linear_transform_loops (void);
918 extern unsigned perfect_loop_nest_depth (struct loop *);
921 extern void graphite_transform_loops (void);
923 /* In tree-data-ref.c */
924 extern void tree_check_data_deps (void);
926 /* In tree-ssa-loop-ivopts.c */
927 bool expr_invariant_in_loop_p (struct loop *, tree);
928 bool stmt_invariant_in_loop_p (struct loop *, gimple);
929 bool multiplier_allowed_in_address_p (HOST_WIDE_INT, enum machine_mode);
930 unsigned multiply_by_cost (HOST_WIDE_INT, enum machine_mode, bool);
932 /* In tree-ssa-threadupdate.c. */
933 extern bool thread_through_all_blocks (bool);
934 extern void register_jump_thread (edge, edge);
937 tree force_gimple_operand (tree, gimple_seq *, bool, tree);
938 tree force_gimple_operand_gsi (gimple_stmt_iterator *, tree, bool, tree,
939 bool, enum gsi_iterator_update);
940 tree gimple_fold_indirect_ref (tree);
941 void mark_addressable (tree);
943 /* In tree-ssa-live.c */
944 extern void remove_unused_locals (void);
945 extern void dump_scope_blocks (FILE *, int);
947 /* In tree-ssa-address.c */
949 /* Description of a memory address. */
953 tree symbol, base, index, step, offset;
956 struct affine_tree_combination;
957 tree create_mem_ref (gimple_stmt_iterator *, tree,
958 struct affine_tree_combination *, bool);
959 rtx addr_for_mem_ref (struct mem_address *, bool);
960 void get_address_description (tree, struct mem_address *);
961 tree maybe_fold_tmr (tree);
963 unsigned int execute_fixup_cfg (void);
965 #include "tree-flow-inline.h"
967 void swap_tree_operands (gimple, tree *, tree *);
969 int least_common_multiple (int, int);
970 edge redirect_eh_edge (edge e, basic_block new_bb);
972 #endif /* _TREE_FLOW_H */