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 when building base variable structures in a var_map. */
203 unsigned base_var_processed
: 1;
205 /* Nonzero if this variable was used after SSA optimizations were
206 applied. We set this when translating out of SSA form. */
209 /* This field indicates whether or not the variable may need PHI nodes.
210 See the enum's definition for more detailed information about the
212 ENUM_BITFIELD (need_phi_state
) need_phi_state
: 2;
214 /* True for HEAP artificial variables. These variables represent
215 the memory area allocated by a call to malloc. */
216 unsigned is_heapvar
: 1;
218 /* This field describes several "no alias" attributes that some
219 symbols are known to have. See the enum's definition for more
220 information on each attribute. */
221 ENUM_BITFIELD (noalias_state
) noalias_state
: 2;
223 /* Used by var_map for the base index of ssa base variables. */
226 /* During into-ssa and the dominator optimizer, this field holds the
227 current version of this variable (an SSA_NAME). */
231 /* Container for variable annotation used by hashtable for annotations for
233 struct GTY(()) static_var_ann_d
{
234 struct var_ann_d ann
;
238 struct GTY(()) function_ann_d
{
239 struct tree_ann_common_d common
;
243 /* Immediate use lists are used to directly access all uses for an SSA
244 name and get pointers to the statement for each use.
246 The structure ssa_use_operand_d consists of PREV and NEXT pointers
247 to maintain the list. A USE pointer, which points to address where
248 the use is located and a LOC pointer which can point to the
249 statement where the use is located, or, in the case of the root
250 node, it points to the SSA name itself.
252 The list is anchored by an occurrence of ssa_operand_d *in* the
253 ssa_name node itself (named 'imm_uses'). This node is uniquely
254 identified by having a NULL USE pointer. and the LOC pointer
255 pointing back to the ssa_name node itself. This node forms the
256 base for a circular list, and initially this is the only node in
259 Fast iteration allows each use to be examined, but does not allow
260 any modifications to the uses or stmts.
262 Normal iteration allows insertion, deletion, and modification. the
263 iterator manages this by inserting a marker node into the list
264 immediately before the node currently being examined in the list.
265 this marker node is uniquely identified by having null stmt *and* a
268 When iterating to the next use, the iteration routines check to see
269 if the node after the marker has changed. if it has, then the node
270 following the marker is now the next one to be visited. if not, the
271 marker node is moved past that node in the list (visualize it as
272 bumping the marker node through the list). this continues until
273 the marker node is moved to the original anchor position. the
274 marker node is then removed from the list.
276 If iteration is halted early, the marker node must be removed from
277 the list before continuing. */
278 typedef struct immediate_use_iterator_d
280 /* This is the current use the iterator is processing. */
281 ssa_use_operand_t
*imm_use
;
282 /* This marks the last use in the list (use node from SSA_NAME) */
283 ssa_use_operand_t
*end_p
;
284 /* This node is inserted and used to mark the end of the uses for a stmt. */
285 ssa_use_operand_t iter_node
;
286 /* This is the next ssa_name to visit. IMM_USE may get removed before
287 the next one is traversed to, so it must be cached early. */
288 ssa_use_operand_t
*next_imm_name
;
292 /* Use this iterator when simply looking at stmts. Adding, deleting or
293 modifying stmts will cause this iterator to malfunction. */
295 #define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR) \
296 for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR)); \
297 !end_readonly_imm_use_p (&(ITER)); \
298 (DEST) = next_readonly_imm_use (&(ITER)))
300 /* Use this iterator to visit each stmt which has a use of SSAVAR. */
302 #define FOR_EACH_IMM_USE_STMT(STMT, ITER, SSAVAR) \
303 for ((STMT) = first_imm_use_stmt (&(ITER), (SSAVAR)); \
304 !end_imm_use_stmt_p (&(ITER)); \
305 (STMT) = next_imm_use_stmt (&(ITER)))
307 /* Use this to terminate the FOR_EACH_IMM_USE_STMT loop early. Failure to
308 do so will result in leaving a iterator marker node in the immediate
309 use list, and nothing good will come from that. */
310 #define BREAK_FROM_IMM_USE_STMT(ITER) \
312 end_imm_use_stmt_traverse (&(ITER)); \
317 /* Use this iterator in combination with FOR_EACH_IMM_USE_STMT to
318 get access to each occurrence of ssavar on the stmt returned by
319 that iterator.. for instance:
321 FOR_EACH_IMM_USE_STMT (stmt, iter, var)
323 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
325 SET_USE (use_p, blah);
330 #define FOR_EACH_IMM_USE_ON_STMT(DEST, ITER) \
331 for ((DEST) = first_imm_use_on_stmt (&(ITER)); \
332 !end_imm_use_on_stmt_p (&(ITER)); \
333 (DEST) = next_imm_use_on_stmt (&(ITER)))
337 union GTY((desc ("ann_type ((tree_ann_t)&%h)"))) tree_ann_d
{
338 struct tree_ann_common_d
GTY((tag ("TREE_ANN_COMMON"))) common
;
339 struct var_ann_d
GTY((tag ("VAR_ANN"))) vdecl
;
340 struct function_ann_d
GTY((tag ("FUNCTION_ANN"))) fdecl
;
343 typedef union tree_ann_d
*tree_ann_t
;
344 typedef struct var_ann_d
*var_ann_t
;
345 typedef struct function_ann_d
*function_ann_t
;
346 typedef struct tree_ann_common_d
*tree_ann_common_t
;
348 static inline tree_ann_common_t
tree_common_ann (const_tree
);
349 static inline tree_ann_common_t
get_tree_common_ann (tree
);
350 static inline var_ann_t
var_ann (const_tree
);
351 static inline var_ann_t
get_var_ann (tree
);
352 static inline function_ann_t
function_ann (const_tree
);
353 static inline function_ann_t
get_function_ann (tree
);
354 static inline enum tree_ann_type
ann_type (tree_ann_t
);
355 static inline void update_stmt (gimple
);
356 static inline int get_lineno (const_gimple
);
358 /*---------------------------------------------------------------------------
359 Structure representing predictions in tree level.
360 ---------------------------------------------------------------------------*/
361 struct GTY((chain_next ("%h.ep_next"))) edge_prediction
{
362 struct edge_prediction
*ep_next
;
364 enum br_predictor ep_predictor
;
368 /* Accessors for basic block annotations. */
369 static inline gimple_seq
phi_nodes (const_basic_block
);
370 static inline void set_phi_nodes (basic_block
, gimple_seq
);
372 /*---------------------------------------------------------------------------
374 ---------------------------------------------------------------------------*/
375 struct GTY(()) int_tree_map
{
381 extern unsigned int int_tree_map_hash (const void *);
382 extern int int_tree_map_eq (const void *, const void *);
384 extern unsigned int uid_decl_map_hash (const void *);
385 extern int uid_decl_map_eq (const void *, const void *);
390 } referenced_var_iterator
;
393 /* This macro loops over all the referenced vars, one at a time, putting the
394 current var in VAR. Note: You are not allowed to add referenced variables
395 to the hashtable while using this macro. Doing so may cause it to behave
398 #define FOR_EACH_REFERENCED_VAR(VAR, ITER) \
399 for ((VAR) = first_referenced_var (&(ITER)); \
400 !end_referenced_vars_p (&(ITER)); \
401 (VAR) = next_referenced_var (&(ITER)))
407 } safe_referenced_var_iterator
;
409 /* This macro loops over all the referenced vars, one at a time, putting the
410 current var in VAR. You are allowed to add referenced variables during the
411 execution of this macro, however, the macro will not iterate over them. It
412 requires a temporary vector of trees, VEC, whose lifetime is controlled by
413 the caller. The purpose of the vector is to temporarily store the
414 referenced_variables hashtable so that adding referenced variables does not
415 affect the hashtable. */
417 #define FOR_EACH_REFERENCED_VAR_SAFE(VAR, VEC, ITER) \
418 for ((ITER).i = 0, fill_referenced_var_vec (&(VEC)); \
419 VEC_iterate (tree, (VEC), (ITER).i, (VAR)); \
422 extern tree
referenced_var_lookup (unsigned int);
423 extern bool referenced_var_check_and_insert (tree
);
424 #define num_referenced_vars htab_elements (gimple_referenced_vars (cfun))
425 #define referenced_var(i) referenced_var_lookup (i)
427 #define num_ssa_names (VEC_length (tree, cfun->gimple_df->ssa_names))
428 #define ssa_name(i) (VEC_index (tree, cfun->gimple_df->ssa_names, (i)))
430 /* Macros for showing usage statistics. */
431 #define SCALE(x) ((unsigned long) ((x) < 1024*10 \
433 : ((x) < 1024*1024*10 \
435 : (x) / (1024*1024))))
437 #define LABEL(x) ((x) < 1024*10 ? 'b' : ((x) < 1024*1024*10 ? 'k' : 'M'))
439 #define PERCENT(x,y) ((float)(x) * 100.0 / (float)(y))
441 /*---------------------------------------------------------------------------
443 ---------------------------------------------------------------------------*/
445 /* Parallel region information. Every parallel and workshare
446 directive is enclosed between two markers, the OMP_* directive
447 and a corresponding OMP_RETURN statement. */
451 /* The enclosing region. */
452 struct omp_region
*outer
;
454 /* First child region. */
455 struct omp_region
*inner
;
457 /* Next peer region. */
458 struct omp_region
*next
;
460 /* Block containing the omp directive as its last stmt. */
463 /* Block containing the OMP_RETURN as its last stmt. */
466 /* Block containing the OMP_CONTINUE as its last stmt. */
469 /* If this is a combined parallel+workshare region, this is a list
470 of additional arguments needed by the combined parallel+workshare
474 /* The code for the omp directive of this region. */
475 enum gimple_code type
;
477 /* Schedule kind, only used for OMP_FOR type regions. */
478 enum omp_clause_schedule_kind sched_kind
;
480 /* True if this is a combined parallel+workshare region. */
481 bool is_combined_parallel
;
484 extern struct omp_region
*root_omp_region
;
485 extern struct omp_region
*new_omp_region (basic_block
, enum gimple_code
,
486 struct omp_region
*);
487 extern void free_omp_regions (void);
488 void omp_expand_local (basic_block
);
489 extern tree
find_omp_clause (tree
, enum omp_clause_code
);
490 tree
copy_var_decl (tree
, tree
, tree
);
492 /*---------------------------------------------------------------------------
494 ---------------------------------------------------------------------------*/
497 /* Location to track pending stmt for edge insertion. */
498 #define PENDING_STMT(e) ((e)->insns.g)
500 extern void delete_tree_cfg_annotations (void);
501 extern bool stmt_ends_bb_p (gimple
);
502 extern bool is_ctrl_stmt (gimple
);
503 extern bool is_ctrl_altering_stmt (gimple
);
504 extern bool simple_goto_p (gimple
);
505 extern bool stmt_can_make_abnormal_goto (gimple
);
506 extern basic_block
single_noncomplex_succ (basic_block bb
);
507 extern void gimple_dump_bb (basic_block
, FILE *, int, int);
508 extern void gimple_debug_bb (basic_block
);
509 extern basic_block
gimple_debug_bb_n (int);
510 extern void gimple_dump_cfg (FILE *, int);
511 extern void gimple_debug_cfg (int);
512 extern void dump_cfg_stats (FILE *);
513 extern void dot_cfg (void);
514 extern void debug_cfg_stats (void);
515 extern void debug_loops (int);
516 extern void debug_loop (struct loop
*, int);
517 extern void debug_loop_num (unsigned, int);
518 extern void print_loops (FILE *, int);
519 extern void print_loops_bb (FILE *, basic_block
, int, int);
520 extern void cleanup_dead_labels (void);
521 extern void group_case_labels (void);
522 extern gimple
first_stmt (basic_block
);
523 extern gimple
last_stmt (basic_block
);
524 extern gimple
last_and_only_stmt (basic_block
);
525 extern edge
find_taken_edge (basic_block
, tree
);
526 extern basic_block
label_to_block_fn (struct function
*, tree
);
527 #define label_to_block(t) (label_to_block_fn (cfun, t))
528 extern void notice_special_calls (gimple
);
529 extern void clear_special_calls (void);
530 extern void verify_stmts (void);
531 extern void verify_gimple (void);
532 extern void verify_types_in_gimple_seq (gimple_seq
);
533 extern tree
gimple_block_label (basic_block
);
534 extern void extract_true_false_edges_from_block (basic_block
, edge
*, edge
*);
535 extern bool gimple_duplicate_sese_region (edge
, edge
, basic_block
*, unsigned,
537 extern bool gimple_duplicate_sese_tail (edge
, edge
, basic_block
*, unsigned,
539 extern void gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
540 VEC(basic_block
,heap
) **bbs_p
);
541 extern void add_phi_args_after_copy_bb (basic_block
);
542 extern void add_phi_args_after_copy (basic_block
*, unsigned, edge
);
543 extern bool gimple_purge_dead_abnormal_call_edges (basic_block
);
544 extern bool gimple_purge_dead_eh_edges (basic_block
);
545 extern bool gimple_purge_all_dead_eh_edges (const_bitmap
);
546 extern tree
gimplify_build1 (gimple_stmt_iterator
*, enum tree_code
,
548 extern tree
gimplify_build2 (gimple_stmt_iterator
*, enum tree_code
,
550 extern tree
gimplify_build3 (gimple_stmt_iterator
*, enum tree_code
,
551 tree
, tree
, tree
, tree
);
552 extern void init_empty_tree_cfg (void);
553 extern void init_empty_tree_cfg_for_function (struct function
*);
554 extern void fold_cond_expr_cond (void);
555 extern void make_abnormal_goto_edges (basic_block
, bool);
556 extern void replace_uses_by (tree
, tree
);
557 extern void start_recording_case_labels (void);
558 extern void end_recording_case_labels (void);
559 extern basic_block
move_sese_region_to_fn (struct function
*, basic_block
,
561 void remove_edge_and_dominated_blocks (edge
);
562 void mark_virtual_ops_in_bb (basic_block
);
564 /* In tree-cfgcleanup.c */
565 extern bitmap cfgcleanup_altered_bbs
;
566 extern bool cleanup_tree_cfg (void);
568 /* In tree-pretty-print.c. */
569 extern void dump_generic_bb (FILE *, basic_block
, int, int);
570 extern int op_code_prio (enum tree_code
);
571 extern int op_prio (const_tree
);
572 extern const char *op_symbol_code (enum tree_code
);
575 extern var_ann_t
create_var_ann (tree
);
576 extern function_ann_t
create_function_ann (tree
);
577 extern void renumber_gimple_stmt_uids (void);
578 extern tree_ann_common_t
create_tree_common_ann (tree
);
579 extern void dump_dfa_stats (FILE *);
580 extern void debug_dfa_stats (void);
581 extern void debug_referenced_vars (void);
582 extern void dump_referenced_vars (FILE *);
583 extern void dump_variable (FILE *, tree
);
584 extern void debug_variable (tree
);
585 extern tree
get_virtual_var (tree
);
586 extern bool add_referenced_var (tree
);
587 extern void remove_referenced_var (tree
);
588 extern void mark_symbols_for_renaming (gimple
);
589 extern void find_new_referenced_vars (gimple
);
590 extern tree
make_rename_temp (tree
, const char *);
591 extern void set_default_def (tree
, tree
);
592 extern tree
gimple_default_def (struct function
*, tree
);
593 extern bool stmt_references_abnormal_ssa_name (gimple
);
594 extern tree
get_ref_base_and_extent (tree
, HOST_WIDE_INT
*,
595 HOST_WIDE_INT
*, HOST_WIDE_INT
*);
596 extern void find_referenced_vars_in (gimple
);
598 /* In tree-phinodes.c */
599 extern void reserve_phi_args_for_new_edge (basic_block
);
600 extern void add_phi_node_to_bb (gimple phi
, basic_block bb
);
601 extern gimple
make_phi_node (tree var
, int len
);
602 extern gimple
create_phi_node (tree
, basic_block
);
603 extern void add_phi_arg (gimple
, tree
, edge
);
604 extern void remove_phi_args (edge
);
605 extern void remove_phi_node (gimple_stmt_iterator
*, bool);
606 extern void remove_phi_nodes (basic_block
);
607 extern void init_phinodes (void);
608 extern void fini_phinodes (void);
609 extern void release_phi_node (gimple
);
610 #ifdef GATHER_STATISTICS
611 extern void phinodes_print_statistics (void);
614 /* In gimple-low.c */
615 extern void record_vars_into (tree
, tree
);
616 extern void record_vars (tree
);
617 extern bool block_may_fallthru (const_tree
);
618 extern bool gimple_seq_may_fallthru (gimple_seq
);
619 extern bool gimple_stmt_may_fallthru (gimple
);
624 /* Mapping for redirected edges. */
625 struct GTY(()) _edge_var_map
{
626 tree result
; /* PHI result. */
627 tree def
; /* PHI arg definition. */
629 typedef struct _edge_var_map edge_var_map
;
631 DEF_VEC_O(edge_var_map
);
632 DEF_VEC_ALLOC_O(edge_var_map
, heap
);
634 /* A vector of var maps. */
635 typedef VEC(edge_var_map
, heap
) *edge_var_map_vector
;
637 extern void init_tree_ssa (struct function
*);
638 extern void redirect_edge_var_map_add (edge
, tree
, tree
);
639 extern void redirect_edge_var_map_clear (edge
);
640 extern void redirect_edge_var_map_dup (edge
, edge
);
641 extern edge_var_map_vector
redirect_edge_var_map_vector (edge
);
642 extern void redirect_edge_var_map_destroy (void);
644 extern edge
ssa_redirect_edge (edge
, basic_block
);
645 extern void flush_pending_stmts (edge
);
646 extern void verify_ssa (bool);
647 extern void delete_tree_ssa (void);
648 extern bool ssa_undefined_value_p (tree
);
649 extern void execute_update_addresses_taken (bool);
651 /* Call-back function for walk_use_def_chains(). At each reaching
652 definition, a function with this prototype is called. */
653 typedef bool (*walk_use_def_chains_fn
) (tree
, gimple
, void *);
655 extern void walk_use_def_chains (tree
, walk_use_def_chains_fn
, void *, bool);
658 /* In tree-into-ssa.c */
659 void update_ssa (unsigned);
660 void delete_update_ssa (void);
661 void register_new_name_mapping (tree
, tree
);
662 tree
create_new_def_for (tree
, gimple
, def_operand_p
);
663 bool need_ssa_update_p (struct function
*);
664 bool name_mappings_registered_p (void);
665 bool name_registered_for_update_p (tree
);
666 bitmap
ssa_names_to_replace (void);
667 void release_ssa_name_after_update_ssa (tree
);
668 void compute_global_livein (bitmap
, bitmap
);
669 void mark_sym_for_renaming (tree
);
670 void mark_set_for_renaming (bitmap
);
671 tree
get_current_def (tree
);
672 void set_current_def (tree
, tree
);
674 /* In tree-ssanames.c */
675 extern void init_ssanames (struct function
*, int);
676 extern void fini_ssanames (void);
677 extern tree
make_ssa_name_fn (struct function
*, tree
, gimple
);
678 extern tree
duplicate_ssa_name (tree
, gimple
);
679 extern void duplicate_ssa_name_ptr_info (tree
, struct ptr_info_def
*);
680 extern void release_ssa_name (tree
);
681 extern void release_defs (gimple
);
682 extern void replace_ssa_name_symbol (tree
, tree
);
684 #ifdef GATHER_STATISTICS
685 extern void ssanames_print_statistics (void);
688 /* In tree-ssa-ccp.c */
689 bool fold_stmt (gimple_stmt_iterator
*);
690 bool fold_stmt_inplace (gimple
);
691 tree
get_symbol_constant_value (tree
);
692 tree
fold_const_aggregate_ref (tree
);
693 bool may_propagate_address_into_dereference (tree
, tree
);
697 tree
vrp_evaluate_conditional (enum tree_code
, tree
, tree
, gimple
);
698 bool simplify_stmt_using_ranges (gimple_stmt_iterator
*);
700 /* In tree-ssa-dom.c */
701 extern void dump_dominator_optimization_stats (FILE *);
702 extern void debug_dominator_optimization_stats (void);
703 int loop_depth_of_name (tree
);
704 tree
degenerate_phi_result (gimple
);
706 /* In tree-ssa-copy.c */
707 extern void merge_alias_info (tree
, tree
);
708 extern void propagate_value (use_operand_p
, tree
);
709 extern void propagate_tree_value (tree
*, tree
);
710 extern void propagate_tree_value_into_stmt (gimple_stmt_iterator
*, tree
);
711 extern void replace_exp (use_operand_p
, tree
);
712 extern bool may_propagate_copy (tree
, tree
);
713 extern bool may_propagate_copy_into_stmt (gimple
, tree
);
714 extern bool may_propagate_copy_into_asm (tree
);
720 /* Iv = BASE + STEP * i. */
723 /* True if this iv does not overflow. */
727 /* Description of number of iterations of a loop. All the expressions inside
728 the structure can be evaluated at the end of the loop's preheader
729 (and due to ssa form, also anywhere inside the body of the loop). */
731 struct tree_niter_desc
733 tree assumptions
; /* The boolean expression. If this expression evaluates
734 to false, then the other fields in this structure
735 should not be used; there is no guarantee that they
737 tree may_be_zero
; /* The boolean expression. If it evaluates to true,
738 the loop will exit in the first iteration (i.e.
739 its latch will not be executed), even if the niter
740 field says otherwise. */
741 tree niter
; /* The expression giving the number of iterations of
742 a loop (provided that assumptions == true and
743 may_be_zero == false), more precisely the number
744 of executions of the latch of the loop. */
745 double_int max
; /* The upper bound on the number of iterations of
748 /* The simplified shape of the exit condition. The loop exits if
749 CONTROL CMP BOUND is false, where CMP is one of NE_EXPR,
750 LT_EXPR, or GT_EXPR, and step of CONTROL is positive if CMP is
751 LE_EXPR and negative if CMP is GE_EXPR. This information is used
752 by loop unrolling. */
758 /* In tree-vectorizer.c */
759 unsigned vectorize_loops (void);
760 extern bool vect_can_force_dr_alignment_p (const_tree
, unsigned int);
761 extern tree
get_vectype_for_scalar_type (tree
);
763 /* In tree-ssa-phiopt.c */
764 bool empty_block_p (basic_block
);
765 basic_block
*blocks_in_phiopt_order (void);
767 /* In tree-ssa-loop*.c */
769 void tree_ssa_lim (void);
770 unsigned int tree_ssa_unswitch_loops (void);
771 unsigned int canonicalize_induction_variables (void);
772 unsigned int tree_unroll_loops_completely (bool, bool);
773 unsigned int tree_ssa_prefetch_arrays (void);
774 unsigned int remove_empty_loops (void);
775 void tree_ssa_iv_optimize (void);
776 unsigned tree_predictive_commoning (void);
777 tree
canonicalize_loop_ivs (struct loop
*, htab_t
, tree
*);
778 bool parallelize_loops (void);
780 bool loop_only_exit_p (const struct loop
*, const_edge
);
781 bool number_of_iterations_exit (struct loop
*, edge
,
782 struct tree_niter_desc
*niter
, bool);
783 tree
find_loop_niter (struct loop
*, edge
*);
784 tree
loop_niter_by_eval (struct loop
*, edge
);
785 tree
find_loop_niter_by_eval (struct loop
*, edge
*);
786 void estimate_numbers_of_iterations (void);
787 bool scev_probably_wraps_p (tree
, tree
, gimple
, struct loop
*, bool);
788 bool convert_affine_scev (struct loop
*, tree
, tree
*, tree
*, gimple
, bool);
790 bool nowrap_type_p (tree
);
791 enum ev_direction
{EV_DIR_GROWS
, EV_DIR_DECREASES
, EV_DIR_UNKNOWN
};
792 enum ev_direction
scev_direction (const_tree
);
794 void free_numbers_of_iterations_estimates (void);
795 void free_numbers_of_iterations_estimates_loop (struct loop
*);
796 void rewrite_into_loop_closed_ssa (bitmap
, unsigned);
797 void verify_loop_closed_ssa (void);
798 bool for_each_index (tree
*, bool (*) (tree
, tree
*, void *), void *);
799 void create_iv (tree
, tree
, tree
, struct loop
*, gimple_stmt_iterator
*, bool,
801 basic_block
split_loop_exit_edge (edge
);
802 void standard_iv_increment_position (struct loop
*, gimple_stmt_iterator
*,
804 basic_block
ip_end_pos (struct loop
*);
805 basic_block
ip_normal_pos (struct loop
*);
806 bool gimple_duplicate_loop_to_header_edge (struct loop
*, edge
,
807 unsigned int, sbitmap
,
808 edge
, VEC (edge
, heap
) **,
810 struct loop
*slpeel_tree_duplicate_loop_to_edge_cfg (struct loop
*, edge
);
811 void rename_variables_in_loop (struct loop
*);
812 void rename_variables_in_bb (basic_block bb
);
813 struct loop
*tree_ssa_loop_version (struct loop
*, tree
,
815 tree
expand_simple_operations (tree
);
816 void substitute_in_loop_info (struct loop
*, tree
, tree
);
817 edge
single_dom_exit (struct loop
*);
818 bool can_unroll_loop_p (struct loop
*loop
, unsigned factor
,
819 struct tree_niter_desc
*niter
);
820 void tree_unroll_loop (struct loop
*, unsigned,
821 edge
, struct tree_niter_desc
*);
822 typedef void (*transform_callback
)(struct loop
*, void *);
823 void tree_transform_and_unroll_loop (struct loop
*, unsigned,
824 edge
, struct tree_niter_desc
*,
825 transform_callback
, void *);
826 bool contains_abnormal_ssa_name_p (tree
);
827 bool stmt_dominates_stmt_p (gimple
, gimple
);
828 void mark_virtual_ops_for_renaming (gimple
);
830 /* In tree-ssa-threadedge.c */
831 extern bool potentially_threadable_block (basic_block
);
832 extern void thread_across_edge (gimple
, edge
, bool,
833 VEC(tree
, heap
) **, tree (*) (gimple
, gimple
));
835 /* In tree-ssa-loop-im.c */
836 /* The possibilities of statement movement. */
840 MOVE_IMPOSSIBLE
, /* No movement -- side effect expression. */
841 MOVE_PRESERVE_EXECUTION
, /* Must not cause the non-executed statement
842 become executed -- memory accesses, ... */
843 MOVE_POSSIBLE
/* Unlimited movement. */
845 extern enum move_pos
movement_possibility (gimple
);
846 char *get_lsm_tmp_name (tree
, unsigned);
848 /* In tree-flow-inline.h */
849 static inline bool is_call_clobbered (const_tree
);
850 static inline void set_is_used (tree
);
851 static inline bool unmodifiable_var_p (const_tree
);
852 static inline bool ref_contains_array_ref (const_tree
);
853 static inline bool array_ref_contains_indirect_ref (const_tree
);
856 extern void make_eh_edges (gimple
);
857 extern bool tree_could_trap_p (tree
);
858 extern bool operation_could_trap_helper_p (enum tree_code
, bool, bool, bool,
860 extern bool operation_could_trap_p (enum tree_code
, bool, bool, tree
);
861 extern bool stmt_could_throw_p (gimple
);
862 extern bool tree_could_throw_p (tree
);
863 extern bool stmt_can_throw_internal (gimple
);
864 extern bool stmt_can_throw_external (gimple
);
865 extern void add_stmt_to_eh_region (gimple
, int);
866 extern bool remove_stmt_from_eh_region (gimple
);
867 extern bool maybe_clean_or_replace_eh_stmt (gimple
, gimple
);
868 extern void add_stmt_to_eh_region_fn (struct function
*, gimple
, int);
869 extern bool remove_stmt_from_eh_region_fn (struct function
*, gimple
);
870 extern int lookup_stmt_eh_region_fn (struct function
*, gimple
);
871 extern int lookup_expr_eh_region (tree
);
872 extern int lookup_stmt_eh_region (gimple
);
873 extern bool verify_eh_edges (gimple
);
876 /* In tree-ssa-pre.c */
878 void add_to_value (unsigned int, struct pre_expr_d
*);
879 void debug_value_expressions (unsigned int);
880 void print_value_expressions (FILE *, unsigned int);
884 tree
make_value_handle (tree
);
885 void set_value_handle (tree
, tree
);
886 bool expressions_equal_p (tree
, tree
);
887 void sort_vuses (VEC (tree
, gc
) *);
888 void sort_vuses_heap (VEC (tree
, heap
) *);
889 tree
vn_lookup_or_add (tree
);
890 tree
vn_lookup_or_add_with_stmt (tree
, gimple
);
891 tree
vn_lookup_or_add_with_vuses (tree
, VEC (tree
, gc
) *);
892 void vn_add (tree
, tree
);
893 void vn_add_with_vuses (tree
, tree
, VEC (tree
, gc
) *);
894 tree
vn_lookup_with_stmt (tree
, gimple
);
895 tree
vn_lookup (tree
);
896 tree
vn_lookup_with_vuses (tree
, VEC (tree
, gc
) *);
898 /* In tree-ssa-sink.c */
899 bool is_hidden_global_store (gimple
);
902 void insert_edge_copies_seq (gimple_seq
, basic_block
);
903 void sra_insert_before (gimple_stmt_iterator
*, gimple_seq
);
904 void sra_insert_after (gimple_stmt_iterator
*, gimple_seq
);
905 void sra_init_cache (void);
906 bool sra_type_can_be_decomposed_p (tree
);
908 /* In tree-loop-linear.c */
909 extern void linear_transform_loops (void);
910 extern unsigned perfect_loop_nest_depth (struct loop
*);
913 extern void graphite_transform_loops (void);
915 /* In tree-data-ref.c */
916 extern void tree_check_data_deps (void);
918 /* In tree-ssa-loop-ivopts.c */
919 bool expr_invariant_in_loop_p (struct loop
*, tree
);
920 bool stmt_invariant_in_loop_p (struct loop
*, gimple
);
921 bool multiplier_allowed_in_address_p (HOST_WIDE_INT
, enum machine_mode
);
922 unsigned multiply_by_cost (HOST_WIDE_INT
, enum machine_mode
, bool);
924 /* In tree-ssa-threadupdate.c. */
925 extern bool thread_through_all_blocks (bool);
926 extern void register_jump_thread (edge
, edge
);
929 tree
force_gimple_operand (tree
, gimple_seq
*, bool, tree
);
930 tree
force_gimple_operand_gsi (gimple_stmt_iterator
*, tree
, bool, tree
,
931 bool, enum gsi_iterator_update
);
932 tree
gimple_fold_indirect_ref (tree
);
933 void mark_addressable (tree
);
935 /* In tree-ssa-live.c */
936 extern void remove_unused_locals (void);
937 extern void dump_scope_blocks (FILE *, int);
939 /* In tree-ssa-address.c */
941 /* Description of a memory address. */
945 tree symbol
, base
, index
, step
, offset
;
948 struct affine_tree_combination
;
949 tree
create_mem_ref (gimple_stmt_iterator
*, tree
,
950 struct affine_tree_combination
*, bool);
951 rtx
addr_for_mem_ref (struct mem_address
*, bool);
952 void get_address_description (tree
, struct mem_address
*);
953 tree
maybe_fold_tmr (tree
);
955 unsigned int execute_free_datastructures (void);
956 unsigned int execute_fixup_cfg (void);
958 #include "tree-flow-inline.h"
960 void swap_tree_operands (gimple
, tree
*, tree
*);
962 int least_common_multiple (int, int);
963 edge
redirect_eh_edge (edge e
, basic_block new_bb
);
965 #endif /* _TREE_FLOW_H */