1 /* Data and Control Flow Analysis for Trees.
2 Copyright (C) 2001, 2003, 2004, 2005 Free Software Foundation, Inc.
3 Contributed by Diego Novillo <dnovillo@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to
19 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
20 Boston, MA 02110-1301, USA. */
23 #define _TREE_FLOW_H 1
26 #include "hard-reg-set.h"
27 #include "basic-block.h"
29 #include "tree-gimple.h"
30 #include "tree-ssa-operands.h"
32 #include "ipa-reference.h"
34 /* Forward declare structures for the garbage collector GTY markers. */
35 #ifndef GCC_BASIC_BLOCK_H
37 typedef struct edge_def
*edge
;
38 struct basic_block_def
;
39 typedef struct basic_block_def
*basic_block
;
42 /* True if the code is in ssa form. */
52 /* Iterate through the elements of hashtable HTAB, using htab_iterator ITER,
53 storing each element in RESULT, which is of type TYPE. */
54 #define FOR_EACH_HTAB_ELEMENT(HTAB, RESULT, TYPE, ITER) \
55 for (RESULT = (TYPE) first_htab_element (&(ITER), (HTAB)); \
56 !end_htab_p (&(ITER)); \
57 RESULT = (TYPE) next_htab_element (&(ITER)))
59 /*---------------------------------------------------------------------------
60 Attributes for SSA_NAMEs.
62 NOTE: These structures are stored in struct tree_ssa_name
63 but are only used by the tree optimizers, so it makes better sense
64 to declare them here to avoid recompiling unrelated files when
66 ---------------------------------------------------------------------------*/
68 /* Aliasing information for SSA_NAMEs representing pointer variables. */
69 struct ptr_info_def
GTY(())
71 /* Nonzero if points-to analysis couldn't determine where this pointer
73 unsigned int pt_anything
: 1;
75 /* Nonzero if the value of this pointer escapes the current function. */
76 unsigned int value_escapes_p
: 1;
78 /* Nonzero if this pointer is dereferenced. */
79 unsigned int is_dereferenced
: 1;
81 /* Nonzero if this pointer points to a global variable. */
82 unsigned int pt_global_mem
: 1;
84 /* Nonzero if this pointer points to NULL. */
85 unsigned int pt_null
: 1;
87 /* Set of variables that this pointer may point to. */
90 /* If this pointer has been dereferenced, and points-to information is
91 more precise than type-based aliasing, indirect references to this
92 pointer will be represented by this memory tag, instead of the type
93 tag computed by TBAA. */
98 /*---------------------------------------------------------------------------
99 Tree annotations stored in tree_common.ann
100 ---------------------------------------------------------------------------*/
101 enum tree_ann_type
{ TREE_ANN_COMMON
, VAR_ANN
, STMT_ANN
};
103 struct tree_ann_common_d
GTY(())
105 /* Annotation type. */
106 enum tree_ann_type type
;
108 /* Auxiliary info specific to a pass. At all times, this
109 should either point to valid data or be NULL. */
110 PTR
GTY ((skip (""))) aux
;
112 /* The value handle for this expression. Used by GVN-PRE. */
113 tree
GTY((skip
)) value_handle
;
116 /* It is advantageous to avoid things like life analysis for variables which
117 do not need PHI nodes. This enum describes whether or not a particular
118 variable may need a PHI node. */
120 enum need_phi_state
{
121 /* This is the default. If we are still in this state after finding
122 all the definition and use sites, then we will assume the variable
123 needs PHI nodes. This is probably an overly conservative assumption. */
124 NEED_PHI_STATE_UNKNOWN
,
126 /* This state indicates that we have seen one or more sets of the
127 variable in a single basic block and that the sets dominate all
128 uses seen so far. If after finding all definition and use sites
129 we are still in this state, then the variable does not need any
133 /* This state indicates that we have either seen multiple definitions of
134 the variable in multiple blocks, or that we encountered a use in a
135 block that was not dominated by the block containing the set(s) of
136 this variable. This variable is assumed to need PHI nodes. */
141 /* When computing aliasing information, we represent the memory pointed-to
142 by pointers with artificial variables called "memory tags" (MT). There
143 are two kinds of tags: type and name. Type tags (TMT) are used in
144 type-based alias analysis, they represent all the pointed-to locations
145 and variables of the same alias set class. Name tags (NMT) are used in
146 flow-sensitive points-to alias analysis, they represent the variables
147 and memory locations pointed-to by a specific SSA_NAME pointer. */
149 /* This variable is not a memory tag. */
152 /* This variable is a type memory tag (TMT). */
155 /* This variable is a name memory tag (NMT). */
158 /* This variable represents a structure field. */
163 typedef struct subvar
*subvar_t
;
165 /* This structure represents a fake sub-variable for a structure field. */
166 struct subvar
GTY(())
171 /* Offset inside structure. */
172 unsigned HOST_WIDE_INT offset
;
174 /* Size of the field. */
175 unsigned HOST_WIDE_INT size
;
177 /* Next subvar for this structure. */
181 struct var_ann_d
GTY(())
183 struct tree_ann_common_d common
;
185 /* Used by the out of SSA pass to determine whether this variable has
186 been seen yet or not. */
187 unsigned out_of_ssa_tag
: 1;
189 /* Used when building root_var structures in tree_ssa_live.[ch]. */
190 unsigned root_var_processed
: 1;
192 /* If nonzero, this variable is a memory tag. */
193 ENUM_BITFIELD (mem_tag_kind
) mem_tag_kind
: 2;
195 /* Nonzero if this variable is an alias tag that represents references to
196 other variables (i.e., this variable appears in the MAY_ALIASES array
197 of other variables). */
198 unsigned is_alias_tag
: 1;
200 /* Nonzero if this variable was used after SSA optimizations were
201 applied. We set this when translating out of SSA form. */
204 /* This field indicates whether or not the variable may need PHI nodes.
205 See the enum's definition for more detailed information about the
207 ENUM_BITFIELD (need_phi_state
) need_phi_state
: 2;
209 /* Used during operand processing to determine if this variable is already
211 unsigned in_vuse_list
: 1;
213 /* Used during operand processing to determine if this variable is already
214 in the v_may_def list. */
215 unsigned in_v_may_def_list
: 1;
217 /* An artificial variable representing the memory location pointed-to by
218 all the pointers that TBAA (type-based alias analysis) considers
219 to be aliased. If the variable is not a pointer or if it is never
220 dereferenced, this must be NULL. */
223 /* Variables that may alias this variable. */
224 varray_type may_aliases
;
226 /* Used when going out of SSA form to indicate which partition this
227 variable represents storage for. */
230 /* Used by the root-var object in tree-ssa-live.[ch]. */
233 /* Default definition for this symbol. If this field is not NULL, it
234 means that the first reference to this variable in the function is a
235 USE or a VUSE. In those cases, the SSA renamer creates an SSA name
236 for this variable with an empty defining statement. */
239 /* During into-ssa and the dominator optimizer, this field holds the
240 current version of this variable (an SSA_NAME). */
243 /* Pointer to the structure that contains the sets of global
244 variables modified by function calls. This field is only used
245 for FUNCTION_DECLs. */
246 ipa_reference_vars_info_t
GTY ((skip
)) reference_vars_info
;
248 /* If this variable is a structure, this fields holds a list of
249 symbols representing each of the fields of the structure. */
254 typedef struct immediate_use_iterator_d
256 ssa_use_operand_t
*imm_use
;
257 ssa_use_operand_t
*end_p
;
258 ssa_use_operand_t iter_node
;
262 /* Use this iterator when simply looking at stmts. Adding, deleting or
263 modifying stmts will cause this iterator to malfunction. */
265 #define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR) \
266 for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR)); \
267 !end_readonly_imm_use_p (&(ITER)); \
268 (DEST) = next_readonly_imm_use (&(ITER)))
271 #define FOR_EACH_IMM_USE_SAFE(DEST, ITER, SSAVAR) \
272 for ((DEST) = first_safe_imm_use (&(ITER), (SSAVAR)); \
273 !end_safe_imm_use_p (&(ITER)); \
274 (DEST) = next_safe_imm_use (&(ITER)))
276 #define BREAK_FROM_SAFE_IMM_USE(ITER) \
278 end_safe_imm_use_traverse (&(ITER)); \
282 struct stmt_ann_d
GTY(())
284 struct tree_ann_common_d common
;
286 /* Nonzero if the statement has been modified (meaning that the operands
287 need to be scanned again). */
288 unsigned modified
: 1;
290 /* Nonzero if the statement makes aliased loads. */
291 unsigned makes_aliased_loads
: 1;
293 /* Nonzero if the statement makes aliased stores. */
294 unsigned makes_aliased_stores
: 1;
296 /* Nonzero if the statement makes references to volatile storage. */
297 unsigned has_volatile_ops
: 1;
299 /* Nonzero if the statement makes a function call that may clobber global
300 and local addressable variables. */
301 unsigned makes_clobbering_call
: 1;
303 /* Basic block that contains this statement. */
306 /* Operand cache for stmt. */
307 struct stmt_operands_d
GTY ((skip (""))) operands
;
309 /* Set of variables that have had their address taken in the statement. */
310 bitmap addresses_taken
;
312 /* Unique identifier for this statement. These ID's are to be created
313 by each pass on an as-needed basis in any order convenient for the
314 pass which needs statement UIDs. */
317 /* Linked list of histograms for value-based profiling. This is really a
318 struct histogram_value*. We use void* to avoid having to export that
319 everywhere, and to avoid having to put it in GC memory. */
321 void * GTY ((skip (""))) histograms
;
324 union tree_ann_d
GTY((desc ("ann_type ((tree_ann_t)&%h)")))
326 struct tree_ann_common_d
GTY((tag ("TREE_ANN_COMMON"))) common
;
327 struct var_ann_d
GTY((tag ("VAR_ANN"))) decl
;
328 struct stmt_ann_d
GTY((tag ("STMT_ANN"))) stmt
;
331 extern GTY(()) VEC(tree
,gc
) *modified_noreturn_calls
;
333 typedef union tree_ann_d
*tree_ann_t
;
334 typedef struct var_ann_d
*var_ann_t
;
335 typedef struct stmt_ann_d
*stmt_ann_t
;
337 static inline tree_ann_t
tree_ann (tree
);
338 static inline tree_ann_t
get_tree_ann (tree
);
339 static inline var_ann_t
var_ann (tree
);
340 static inline var_ann_t
get_var_ann (tree
);
341 static inline stmt_ann_t
stmt_ann (tree
);
342 static inline stmt_ann_t
get_stmt_ann (tree
);
343 static inline enum tree_ann_type
ann_type (tree_ann_t
);
344 static inline basic_block
bb_for_stmt (tree
);
345 extern void set_bb_for_stmt (tree
, basic_block
);
346 static inline bool noreturn_call_p (tree
);
347 static inline void update_stmt (tree
);
348 static inline bool stmt_modified_p (tree
);
349 static inline varray_type
may_aliases (tree
);
350 static inline int get_lineno (tree
);
351 static inline const char *get_filename (tree
);
352 static inline bool is_exec_stmt (tree
);
353 static inline bool is_label_stmt (tree
);
354 static inline bitmap
addresses_taken (tree
);
355 static inline void set_default_def (tree
, tree
);
356 static inline tree
default_def (tree
);
358 /*---------------------------------------------------------------------------
359 Structure representing predictions in tree level.
360 ---------------------------------------------------------------------------*/
361 struct edge_prediction
GTY((chain_next ("%h.next")))
363 struct edge_prediction
*next
;
365 enum br_predictor predictor
;
369 /* Accessors for basic block annotations. */
370 static inline tree
phi_nodes (basic_block
);
371 static inline void set_phi_nodes (basic_block
, tree
);
373 /*---------------------------------------------------------------------------
375 ---------------------------------------------------------------------------*/
376 struct int_tree_map
GTY(())
383 extern unsigned int int_tree_map_hash (const void *);
384 extern int int_tree_map_eq (const void *, const void *);
389 } referenced_var_iterator
;
392 /* This macro loops over all the referenced vars, one at a time, putting the
393 current var in VAR. Note: You are not allowed to add referenced variables
394 to the hashtable while using this macro. Doing so may cause it to behave
397 #define FOR_EACH_REFERENCED_VAR(VAR, ITER) \
398 for ((VAR) = first_referenced_var (&(ITER)); \
399 !end_referenced_vars_p (&(ITER)); \
400 (VAR) = next_referenced_var (&(ITER)))
406 } safe_referenced_var_iterator
;
408 /* This macro loops over all the referenced vars, one at a time, putting the
409 current var in VAR. You are allowed to add referenced variables during the
410 execution of this macro, however, the macro will not iterate over them. It
411 requires a temporary vector of trees, VEC, whose lifetime is controlled by
412 the caller. The purpose of the vector is to temporarily store the
413 referenced_variables hashtable so that adding referenced variables does not
414 affect the hashtable. */
416 #define FOR_EACH_REFERENCED_VAR_SAFE(VAR, VEC, ITER) \
417 for ((ITER).i = 0, fill_referenced_var_vec (&(VEC)); \
418 VEC_iterate (tree, (VEC), (ITER).i, (VAR)); \
421 /* Array of all variables referenced in the function. */
422 extern GTY((param_is (struct int_tree_map
))) htab_t referenced_vars
;
424 extern tree
referenced_var_lookup (unsigned int);
425 extern tree
referenced_var_lookup_if_exists (unsigned int);
426 #define num_referenced_vars htab_elements (referenced_vars)
427 #define referenced_var(i) referenced_var_lookup (i)
429 /* Array of all SSA_NAMEs used in the function. */
430 extern GTY(()) VEC(tree
,gc
) *ssa_names
;
432 #define num_ssa_names (VEC_length (tree, ssa_names))
433 #define ssa_name(i) (VEC_index (tree, ssa_names, (i)))
435 /* Artificial variable used to model the effects of function calls. */
436 extern GTY(()) tree global_var
;
438 /* Call clobbered variables in the function. If bit I is set, then
439 REFERENCED_VARS (I) is call-clobbered. */
440 extern bitmap call_clobbered_vars
;
442 /* Addressable variables in the function. If bit I is set, then
443 REFERENCED_VARS (I) has had its address taken. */
444 extern bitmap addressable_vars
;
446 /* 'true' after aliases have been computed (see compute_may_aliases). */
447 extern bool aliases_computed_p
;
449 /* Macros for showing usage statistics. */
450 #define SCALE(x) ((unsigned long) ((x) < 1024*10 \
452 : ((x) < 1024*1024*10 \
454 : (x) / (1024*1024))))
456 #define LABEL(x) ((x) < 1024*10 ? 'b' : ((x) < 1024*1024*10 ? 'k' : 'M'))
458 #define PERCENT(x,y) ((float)(x) * 100.0 / (float)(y))
460 /*---------------------------------------------------------------------------
462 ---------------------------------------------------------------------------*/
465 tree_stmt_iterator tsi
;
467 } block_stmt_iterator
;
469 static inline block_stmt_iterator
bsi_start (basic_block
);
470 static inline block_stmt_iterator
bsi_last (basic_block
);
471 static inline block_stmt_iterator
bsi_after_labels (basic_block
);
472 block_stmt_iterator
bsi_for_stmt (tree
);
473 static inline bool bsi_end_p (block_stmt_iterator
);
474 static inline void bsi_next (block_stmt_iterator
*);
475 static inline void bsi_prev (block_stmt_iterator
*);
476 static inline tree
bsi_stmt (block_stmt_iterator
);
477 static inline tree
* bsi_stmt_ptr (block_stmt_iterator
);
479 extern void bsi_remove (block_stmt_iterator
*);
480 extern void bsi_move_before (block_stmt_iterator
*, block_stmt_iterator
*);
481 extern void bsi_move_after (block_stmt_iterator
*, block_stmt_iterator
*);
482 extern void bsi_move_to_bb_end (block_stmt_iterator
*, basic_block
);
484 enum bsi_iterator_update
486 /* Note that these are intentionally in the same order as TSI_FOO. They
487 mean exactly the same as their TSI_* counterparts. */
495 extern void bsi_insert_before (block_stmt_iterator
*, tree
,
496 enum bsi_iterator_update
);
497 extern void bsi_insert_after (block_stmt_iterator
*, tree
,
498 enum bsi_iterator_update
);
500 extern void bsi_replace (const block_stmt_iterator
*, tree
, bool);
502 /*---------------------------------------------------------------------------
504 ---------------------------------------------------------------------------*/
507 /* Location to track pending stmt for edge insertion. */
508 #define PENDING_STMT(e) ((e)->insns.t)
510 extern void delete_tree_cfg_annotations (void);
511 extern void disband_implicit_edges (void);
512 extern bool stmt_ends_bb_p (tree
);
513 extern bool is_ctrl_stmt (tree
);
514 extern bool is_ctrl_altering_stmt (tree
);
515 extern bool computed_goto_p (tree
);
516 extern bool simple_goto_p (tree
);
517 extern void tree_dump_bb (basic_block
, FILE *, int);
518 extern void debug_tree_bb (basic_block
);
519 extern basic_block
debug_tree_bb_n (int);
520 extern void dump_tree_cfg (FILE *, int);
521 extern void debug_tree_cfg (int);
522 extern void dump_cfg_stats (FILE *);
523 extern void debug_cfg_stats (void);
524 extern void debug_loop_ir (void);
525 extern void print_loop_ir (FILE *);
526 extern void cleanup_dead_labels (void);
527 extern void group_case_labels (void);
528 extern tree
first_stmt (basic_block
);
529 extern tree
last_stmt (basic_block
);
530 extern tree
*last_stmt_ptr (basic_block
);
531 extern tree
last_and_only_stmt (basic_block
);
532 extern edge
find_taken_edge (basic_block
, tree
);
533 extern basic_block
label_to_block_fn (struct function
*, tree
);
534 #define label_to_block(t) (label_to_block_fn (cfun, t))
535 extern void bsi_insert_on_edge (edge
, tree
);
536 extern basic_block
bsi_insert_on_edge_immediate (edge
, tree
);
537 extern void bsi_commit_one_edge_insert (edge
, basic_block
*);
538 extern void bsi_commit_edge_inserts (void);
539 extern void notice_special_calls (tree
);
540 extern void clear_special_calls (void);
541 extern void verify_stmts (void);
542 extern tree
tree_block_label (basic_block
);
543 extern void extract_true_false_edges_from_block (basic_block
, edge
*, edge
*);
544 extern bool tree_duplicate_sese_region (edge
, edge
, basic_block
*, unsigned,
546 extern void add_phi_args_after_copy_bb (basic_block
);
547 extern void add_phi_args_after_copy (basic_block
*, unsigned);
548 extern bool tree_purge_dead_eh_edges (basic_block
);
549 extern bool tree_purge_all_dead_eh_edges (bitmap
);
550 extern tree
gimplify_val (block_stmt_iterator
*, tree
, tree
);
551 extern tree
gimplify_build1 (block_stmt_iterator
*, enum tree_code
,
553 extern tree
gimplify_build2 (block_stmt_iterator
*, enum tree_code
,
555 extern tree
gimplify_build3 (block_stmt_iterator
*, enum tree_code
,
556 tree
, tree
, tree
, tree
);
557 extern void init_empty_tree_cfg (void);
558 extern void fold_cond_expr_cond (void);
559 extern void replace_uses_by (tree
, tree
);
560 extern void start_recording_case_labels (void);
561 extern void end_recording_case_labels (void);
563 /* In tree-cfgcleanup.c */
564 extern bool cleanup_tree_cfg (void);
565 extern void cleanup_tree_cfg_loop (void);
567 /* In tree-pretty-print.c. */
568 extern void dump_generic_bb (FILE *, basic_block
, int, int);
571 extern var_ann_t
create_var_ann (tree
);
572 extern stmt_ann_t
create_stmt_ann (tree
);
573 extern tree_ann_t
create_tree_ann (tree
);
574 extern void reserve_phi_args_for_new_edge (basic_block
);
575 extern tree
create_phi_node (tree
, basic_block
);
576 extern void add_phi_arg (tree
, tree
, edge
);
577 extern void remove_phi_args (edge
);
578 extern void remove_phi_node (tree
, tree
);
579 extern tree
phi_reverse (tree
);
580 extern void dump_dfa_stats (FILE *);
581 extern void debug_dfa_stats (void);
582 extern void debug_referenced_vars (void);
583 extern void dump_referenced_vars (FILE *);
584 extern void dump_variable (FILE *, tree
);
585 extern void debug_variable (tree
);
586 extern void dump_subvars_for (FILE *, tree
);
587 extern void debug_subvars_for (tree
);
588 extern tree
get_virtual_var (tree
);
589 extern void add_referenced_tmp_var (tree
);
590 extern void mark_new_vars_to_rename (tree
);
591 extern void find_new_referenced_vars (tree
*);
593 extern tree
make_rename_temp (tree
, const char *);
595 /* In gimple-low.c */
596 extern void record_vars (tree
);
597 extern bool block_may_fallthru (tree block
);
599 /* In tree-ssa-alias.c */
600 extern void dump_may_aliases_for (FILE *, tree
);
601 extern void debug_may_aliases_for (tree
);
602 extern void dump_alias_info (FILE *);
603 extern void debug_alias_info (void);
604 extern void dump_points_to_info (FILE *);
605 extern void debug_points_to_info (void);
606 extern void dump_points_to_info_for (FILE *, tree
);
607 extern void debug_points_to_info_for (tree
);
608 extern bool may_be_aliased (tree
);
609 extern bool is_aliased_with (tree
, tree
);
610 extern struct ptr_info_def
*get_ptr_info (tree
);
611 extern void add_type_alias (tree
, tree
);
612 extern void new_type_alias (tree
, tree
);
613 extern void count_uses_and_derefs (tree
, tree
, unsigned *, unsigned *, bool *);
614 static inline subvar_t
get_subvars_for_var (tree
);
615 static inline tree
get_subvar_at (tree
, unsigned HOST_WIDE_INT
);
616 static inline bool ref_contains_array_ref (tree
);
617 static inline bool array_ref_contains_indirect_ref (tree
);
618 extern tree
okay_component_ref_for_subvars (tree
, unsigned HOST_WIDE_INT
*,
619 unsigned HOST_WIDE_INT
*);
620 static inline bool var_can_have_subvars (tree
);
621 static inline bool overlap_subvar (unsigned HOST_WIDE_INT
,
622 unsigned HOST_WIDE_INT
,
625 /* Call-back function for walk_use_def_chains(). At each reaching
626 definition, a function with this prototype is called. */
627 typedef bool (*walk_use_def_chains_fn
) (tree
, tree
, void *);
631 extern void init_tree_ssa (void);
632 extern edge
ssa_redirect_edge (edge
, basic_block
);
633 extern void flush_pending_stmts (edge
);
634 extern bool tree_ssa_useless_type_conversion (tree
);
635 extern bool tree_ssa_useless_type_conversion_1 (tree
, tree
);
636 extern void verify_ssa (bool);
637 extern void delete_tree_ssa (void);
638 extern void register_new_def (tree
, VEC(tree
,heap
) **);
639 extern void walk_use_def_chains (tree
, walk_use_def_chains_fn
, void *, bool);
640 extern bool stmt_references_memory_p (tree
);
642 /* In tree-into-ssa.c */
643 void update_ssa (unsigned);
644 void delete_update_ssa (void);
645 void register_new_name_mapping (tree
, tree
);
646 tree
create_new_def_for (tree
, tree
, def_operand_p
);
647 bool need_ssa_update_p (void);
648 bool name_registered_for_update_p (tree
);
649 bitmap
ssa_names_to_replace (void);
650 void release_ssa_name_after_update_ssa (tree name
);
651 void compute_global_livein (bitmap
, bitmap
);
652 tree
duplicate_ssa_name (tree
, tree
);
653 void mark_sym_for_renaming (tree
);
654 void mark_set_for_renaming (bitmap
);
655 tree
get_current_def (tree
);
656 void set_current_def (tree
, tree
);
658 /* In tree-ssa-ccp.c */
659 bool fold_stmt (tree
*);
660 bool fold_stmt_inplace (tree
);
661 tree
widen_bitfield (tree
, tree
, tree
);
664 tree
vrp_evaluate_conditional (tree
, bool);
665 void simplify_stmt_using_ranges (tree
);
667 /* In tree-ssa-dom.c */
668 extern void dump_dominator_optimization_stats (FILE *);
669 extern void debug_dominator_optimization_stats (void);
670 int loop_depth_of_name (tree
);
672 /* In tree-ssa-copy.c */
673 extern void merge_alias_info (tree
, tree
);
674 extern void propagate_value (use_operand_p
, tree
);
675 extern void propagate_tree_value (tree
*, tree
);
676 extern void replace_exp (use_operand_p
, tree
);
677 extern bool may_propagate_copy (tree
, tree
);
678 extern bool may_propagate_copy_into_asm (tree
);
680 /* Description of number of iterations of a loop. All the expressions inside
681 the structure can be evaluated at the end of the loop's preheader
682 (and due to ssa form, also anywhere inside the body of the loop). */
684 struct tree_niter_desc
686 tree assumptions
; /* The boolean expression. If this expression evaluates
687 to false, then the other fields in this structure
688 should not be used; there is no guarantee that they
690 tree may_be_zero
; /* The boolean expression. If it evaluates to true,
691 the loop will exit in the first iteration (i.e.
692 its latch will not be executed), even if the niter
693 field says otherwise. */
694 tree niter
; /* The expression giving the number of iterations of
695 a loop (provided that assumptions == true and
696 may_be_zero == false), more precisely the number
697 of executions of the latch of the loop. */
698 tree additional_info
; /* The boolean expression. Sometimes we use additional
699 knowledge to simplify the other expressions
700 contained in this structure (for example the
701 knowledge about value ranges of operands on entry to
702 the loop). If this is a case, conjunction of such
703 condition is stored in this field, so that we do not
704 lose the information: for example if may_be_zero
705 is (n <= 0) and niter is (unsigned) n, we know
706 that the number of iterations is at most
707 MAX_SIGNED_INT. However if the (n <= 0) assumption
708 is eliminated (by looking at the guard on entry of
709 the loop), then the information would be lost. */
712 /* In tree-vectorizer.c */
713 void vectorize_loops (struct loops
*);
715 /* In tree-ssa-phiopt.c */
716 bool empty_block_p (basic_block
);
718 /* In tree-ssa-loop*.c */
720 void tree_ssa_lim (struct loops
*);
721 void tree_ssa_unswitch_loops (struct loops
*);
722 void canonicalize_induction_variables (struct loops
*);
723 void tree_unroll_loops_completely (struct loops
*, bool);
724 void remove_empty_loops (struct loops
*);
725 void tree_ssa_iv_optimize (struct loops
*);
727 bool number_of_iterations_exit (struct loop
*, edge
,
728 struct tree_niter_desc
*niter
, bool);
729 tree
find_loop_niter (struct loop
*, edge
*);
730 tree
loop_niter_by_eval (struct loop
*, edge
);
731 tree
find_loop_niter_by_eval (struct loop
*, edge
*);
732 void estimate_numbers_of_iterations (struct loops
*);
733 bool scev_probably_wraps_p (tree
, tree
, tree
, tree
, struct loop
*, bool *,
735 tree
convert_step (struct loop
*, tree
, tree
, tree
, tree
);
736 void free_numbers_of_iterations_estimates (struct loops
*);
737 void free_numbers_of_iterations_estimates_loop (struct loop
*);
738 void rewrite_into_loop_closed_ssa (bitmap
, unsigned);
739 void verify_loop_closed_ssa (void);
740 void loop_commit_inserts (void);
741 bool for_each_index (tree
*, bool (*) (tree
, tree
*, void *), void *);
742 void create_iv (tree
, tree
, tree
, struct loop
*, block_stmt_iterator
*, bool,
744 void split_loop_exit_edge (edge
);
745 void compute_phi_arg_on_exit (edge
, tree
, tree
);
746 unsigned force_expr_to_var_cost (tree
);
747 basic_block
bsi_insert_on_edge_immediate_loop (edge
, tree
);
748 void standard_iv_increment_position (struct loop
*, block_stmt_iterator
*,
750 basic_block
ip_end_pos (struct loop
*);
751 basic_block
ip_normal_pos (struct loop
*);
752 bool tree_duplicate_loop_to_header_edge (struct loop
*, edge
, struct loops
*,
753 unsigned int, sbitmap
,
755 unsigned int *, int);
756 struct loop
*tree_ssa_loop_version (struct loops
*, struct loop
*, tree
,
758 tree
expand_simple_operations (tree
);
759 void substitute_in_loop_info (struct loop
*, tree
, tree
);
760 edge
single_dom_exit (struct loop
*);
762 /* In tree-ssa-loop-im.c */
763 /* The possibilities of statement movement. */
767 MOVE_IMPOSSIBLE
, /* No movement -- side effect expression. */
768 MOVE_PRESERVE_EXECUTION
, /* Must not cause the non-executed statement
769 become executed -- memory accesses, ... */
770 MOVE_POSSIBLE
/* Unlimited movement. */
772 extern enum move_pos
movement_possibility (tree
);
774 /* In tree-flow-inline.h */
775 static inline bool is_call_clobbered (tree
);
776 static inline void mark_call_clobbered (tree
);
777 static inline void set_is_used (tree
);
778 static inline bool unmodifiable_var_p (tree
);
781 extern void make_eh_edges (tree
);
782 extern bool tree_could_trap_p (tree
);
783 extern bool tree_could_throw_p (tree
);
784 extern bool tree_can_throw_internal (tree
);
785 extern bool tree_can_throw_external (tree
);
786 extern int lookup_stmt_eh_region (tree
);
787 extern void add_stmt_to_eh_region (tree
, int);
788 extern bool remove_stmt_from_eh_region (tree
);
789 extern bool maybe_clean_or_replace_eh_stmt (tree
, tree
);
791 /* In tree-ssa-pre.c */
792 void add_to_value (tree
, tree
);
793 void debug_value_expressions (tree
);
794 void print_value_expressions (FILE *, tree
);
798 bool expressions_equal_p (tree
, tree
);
799 tree
get_value_handle (tree
);
800 hashval_t
vn_compute (tree
, hashval_t
, tree
);
801 tree
vn_lookup_or_add (tree
, tree
);
802 void vn_add (tree
, tree
, tree
);
803 tree
vn_lookup (tree
, tree
);
805 void vn_delete (void);
807 /* In tree-ssa-sink.c */
808 bool is_hidden_global_store (tree
);
811 void insert_edge_copies (tree
, basic_block
);
812 void sra_insert_before (block_stmt_iterator
*, tree
);
813 void sra_insert_after (block_stmt_iterator
*, tree
);
814 void sra_init_cache (void);
815 bool sra_type_can_be_decomposed_p (tree
);
817 /* In tree-loop-linear.c */
818 extern void linear_transform_loops (struct loops
*);
820 /* In tree-ssa-loop-ivopts.c */
821 bool expr_invariant_in_loop_p (struct loop
*, tree
);
822 bool multiplier_allowed_in_address_p (HOST_WIDE_INT
);
823 unsigned multiply_by_cost (HOST_WIDE_INT
, enum machine_mode
);
825 /* In tree-ssa-threadupdate.c. */
826 extern bool thread_through_all_blocks (bitmap
);
829 tree
force_gimple_operand (tree
, tree
*, bool, tree
);
830 tree
force_gimple_operand_bsi (block_stmt_iterator
*, tree
, bool, tree
);
832 /* In tree-ssa-structalias.c */
833 bool find_what_p_points_to (tree
);
835 /* In tree-ssa-address.c */
837 /* Affine combination of trees. We keep track of at most MAX_AFF_ELTS elements
838 to make things simpler; this is sufficient in most cases. */
840 #define MAX_AFF_ELTS 8
842 struct affine_tree_combination
844 /* Type of the result of the combination. */
847 /* Mask modulo that the operations are performed. */
848 unsigned HOST_WIDE_INT mask
;
850 /* Constant offset. */
851 unsigned HOST_WIDE_INT offset
;
853 /* Number of elements of the combination. */
856 /* Elements and their coefficients. */
857 tree elts
[MAX_AFF_ELTS
];
858 unsigned HOST_WIDE_INT coefs
[MAX_AFF_ELTS
];
860 /* Remainder of the expression. */
864 /* Description of a memory address. */
868 tree symbol
, base
, index
, step
, offset
;
871 tree
create_mem_ref (block_stmt_iterator
*, tree
,
872 struct affine_tree_combination
*);
873 rtx
addr_for_mem_ref (struct mem_address
*, bool);
874 void get_address_description (tree
, struct mem_address
*);
875 tree
maybe_fold_tmr (tree
);
876 /* This structure is simply used during pushing fields onto the fieldstack
877 to track the offset of the field, since bitpos_of_field gives it relative
878 to its immediate containing type, and we want it relative to the ultimate
879 containing object. */
884 HOST_WIDE_INT offset
;
886 typedef struct fieldoff fieldoff_s
;
888 DEF_VEC_O(fieldoff_s
);
889 DEF_VEC_ALLOC_O(fieldoff_s
,heap
);
890 int push_fields_onto_fieldstack (tree
, VEC(fieldoff_s
,heap
) **,
891 HOST_WIDE_INT
, bool *);
892 void sort_fieldstack (VEC(fieldoff_s
,heap
) *);
894 void init_alias_heapvars (void);
895 void delete_alias_heapvars (void);
897 #include "tree-flow-inline.h"
899 #endif /* _TREE_FLOW_H */