1 /* Alias analysis for trees.
2 Copyright (C) 2004, 2005, 2006, 2007 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 3, 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 COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
28 #include "hard-reg-set.h"
29 #include "basic-block.h"
33 #include "langhooks.h"
36 #include "diagnostic.h"
37 #include "tree-dump.h"
38 #include "tree-gimple.h"
39 #include "tree-flow.h"
40 #include "tree-inline.h"
41 #include "tree-pass.h"
42 #include "tree-ssa-structalias.h"
45 #include "ipa-type-escape.h"
49 #include "pointer-set.h"
50 #include "alloc-pool.h"
52 /* Broad overview of how aliasing works:
54 First we compute points-to sets, which is done in
55 tree-ssa-structalias.c
57 During points-to set constraint finding, a bunch of little bits of
58 information is collected.
59 This is not done because it is necessary for points-to, but because
60 points-to has to walk every statement anyway. The function performing
61 this collecting is update_alias_info.
63 Bits update_alias_info collects include:
64 1. Directly escaping variables and variables whose value escapes
65 (using is_escape_site). This is the set of variables and values that
66 escape prior to transitive closure of the clobbers.
67 2. The set of variables dereferenced on the LHS (into
68 dereferenced_ptr_stores)
69 3. The set of variables dereferenced on the RHS (into
70 dereferenced_ptr_loads)
71 4. The set of all pointers we saw.
72 5. The number of loads and stores for each variable
73 6. The number of statements touching memory
74 7. The set of address taken variables.
77 #1 is computed by a combination of is_escape_site, and counting the
78 number of uses/deref operators. This function properly accounts for
79 situations like &ptr->field, which is *not* a dereference.
81 After points-to sets are computed, the sets themselves still
82 contain points-to specific variables, such as a variable that says
83 the pointer points to anything, a variable that says the pointer
84 points to readonly memory, etc.
86 These are eliminated in a later phase, as we will see.
88 The rest of the phases are located in tree-ssa-alias.c
90 The next phase after points-to set computation is called
91 "setup_pointers_and_addressables"
93 This pass does 3 main things:
95 1. All variables that can have TREE_ADDRESSABLE removed safely (IE
96 non-globals whose address is not taken), have TREE_ADDRESSABLE
98 2. All variables that may be aliased (which is the set of addressable
99 variables and globals) at all, are marked for renaming, and have
100 symbol memory tags created for them.
101 3. All variables which are stored into have their SMT's added to
105 After this function is run, all variables that will ever have an
106 SMT, have one, though its aliases are not filled in.
108 The next phase is to compute flow-insensitive aliasing, which in
109 our case, is a misnomer. it is really computing aliasing that
110 requires no transitive closure to be correct. In particular, it
111 uses stack vs non-stack, TBAA, etc, to determine whether two
112 symbols could *ever* alias . This phase works by going through all
113 the pointers we collected during update_alias_info, and for every
114 addressable variable in the program, seeing if they alias. If so,
115 the addressable variable is added to the symbol memory tag for the
118 As part of this, we handle symbol memory tags that conflict but
119 have no aliases in common, by forcing them to have a symbol in
120 common (through unioning alias sets or adding one as an alias of
121 the other), or by adding one as an alias of another. The case of
122 conflicts with no aliases in common occurs mainly due to aliasing
123 we cannot see. In particular, it generally means we have a load
124 through a pointer whose value came from outside the function.
125 Without an addressable symbol to point to, they would get the wrong
128 After flow insensitive aliasing is computed, we compute name tags
129 (called compute_flow_sensitive_info). We walk each pointer we
130 collected and see if it has a usable points-to set. If so, we
131 generate a name tag using that pointer, and make an alias bitmap for
132 it. Name tags are shared between all things with the same alias
133 bitmap. The alias bitmap will be translated from what points-to
134 computed. In particular, the "anything" variable in points-to will be
135 transformed into a pruned set of SMT's and their aliases that
136 compute_flow_insensitive_aliasing computed.
137 Note that since 4.3, every pointer that points-to computed a solution for
138 will get a name tag (whereas before 4.3, only those whose set did
139 *not* include the anything variable would). At the point where name
140 tags are all assigned, symbol memory tags are dead, and could be
141 deleted, *except* on global variables. Global variables still use
142 symbol memory tags as of right now.
144 After name tags are computed, the set of clobbered variables is
145 transitively closed. In particular, we compute the set of clobbered
146 variables based on the initial set of clobbers, plus the aliases of
147 pointers which either escape, or have their value escape.
149 After this, maybe_create_global_var is run, which handles a corner
150 case where we have no call clobbered variables, but have pure and
153 Staring at this function, I now remember it is a hack for the fact
154 that we do not mark all globals in the program as call clobbered for a
155 function unless they are actually used in that function. Instead, we
156 only mark the set that is actually clobbered. As a result, you can
157 end up with situations where you have no call clobbered vars set.
159 After maybe_create_global_var, we set pointers with the REF_ALL flag
160 to have alias sets that include all clobbered
161 memory tags and variables.
163 After this, memory partitioning is computed (by the function
164 compute_memory_partitions) and alias sets are reworked accordingly.
166 Lastly, we delete partitions with no symbols, and clean up after
169 /* Structure to map a variable to its alias set. */
172 /* Variable and its alias set. */
178 /* Counters used to display statistics on alias analysis. */
181 unsigned int alias_queries;
182 unsigned int alias_mayalias;
183 unsigned int alias_noalias;
184 unsigned int simple_queries;
185 unsigned int simple_resolved;
186 unsigned int tbaa_queries;
187 unsigned int tbaa_resolved;
188 unsigned int structnoaddress_queries;
189 unsigned int structnoaddress_resolved;
193 /* Local variables. */
194 static struct alias_stats_d alias_stats;
195 static bitmap_obstack alias_bitmap_obstack;
197 /* Local functions. */
198 static void compute_flow_insensitive_aliasing (struct alias_info *);
199 static void dump_alias_stats (FILE *);
200 static bool may_alias_p (tree, alias_set_type, tree, alias_set_type, bool);
201 static tree create_memory_tag (tree type, bool is_type_tag);
202 static tree get_smt_for (tree, struct alias_info *);
203 static tree get_nmt_for (tree);
204 static void add_may_alias (tree, tree);
205 static struct alias_info *init_alias_info (void);
206 static void delete_alias_info (struct alias_info *);
207 static void compute_flow_sensitive_aliasing (struct alias_info *);
208 static void setup_pointers_and_addressables (struct alias_info *);
209 static void create_global_var (void);
210 static void maybe_create_global_var (void);
211 static void set_pt_anything (tree);
213 void debug_mp_info (VEC(mem_sym_stats_t,heap) *);
215 static alloc_pool mem_sym_stats_pool;
217 /* Return memory reference stats for symbol VAR. Create a new slot in
218 cfun->gimple_df->mem_sym_stats if needed. */
220 static struct mem_sym_stats_d *
221 get_mem_sym_stats_for (tree var)
224 struct mem_sym_stats_d *stats;
225 struct pointer_map_t *map = gimple_mem_ref_stats (cfun)->mem_sym_stats;
229 slot = pointer_map_insert (map, var);
232 stats = pool_alloc (mem_sym_stats_pool);
233 memset (stats, 0, sizeof (*stats));
235 *slot = (void *) stats;
238 stats = (struct mem_sym_stats_d *) *slot;
244 /* Return memory reference statistics for variable VAR in function FN.
245 This is computed by alias analysis, but it is not kept
246 incrementally up-to-date. So, these stats are only accurate if
247 pass_may_alias has been run recently. If no alias information
248 exists, this function returns NULL. */
250 static mem_sym_stats_t
251 mem_sym_stats (struct function *fn, tree var)
254 struct pointer_map_t *stats_map = gimple_mem_ref_stats (fn)->mem_sym_stats;
256 if (stats_map == NULL)
259 slot = pointer_map_contains (stats_map, var);
263 return (mem_sym_stats_t) *slot;
267 /* Set MPT to be the memory partition associated with symbol SYM. */
270 set_memory_partition (tree sym, tree mpt)
272 #if defined ENABLE_CHECKING
274 gcc_assert (TREE_CODE (mpt) == MEMORY_PARTITION_TAG
275 && !is_gimple_reg (sym));
278 var_ann (sym)->mpt = mpt;
281 if (MPT_SYMBOLS (mpt) == NULL)
282 MPT_SYMBOLS (mpt) = BITMAP_ALLOC (&alias_bitmap_obstack);
284 bitmap_set_bit (MPT_SYMBOLS (mpt), DECL_UID (sym));
286 /* MPT inherits the call-clobbering attributes from SYM. */
287 if (is_call_clobbered (sym))
289 MTAG_GLOBAL (mpt) = 1;
290 mark_call_clobbered (mpt, ESCAPE_IS_GLOBAL);
296 /* Mark variable VAR as being non-addressable. */
299 mark_non_addressable (tree var)
303 if (!TREE_ADDRESSABLE (var))
306 mpt = memory_partition (var);
309 var_ann (var)->call_clobbered = false;
311 bitmap_clear_bit (gimple_call_clobbered_vars (cfun), DECL_UID (var));
312 TREE_ADDRESSABLE (var) = 0;
316 /* Note that it's possible for a symbol to have an associated
317 MPT and the MPT have a NULL empty set. During
318 init_alias_info, all MPTs get their sets cleared out, but the
319 symbols still point to the old MPTs that used to hold them.
320 This is done so that compute_memory_partitions can now which
321 symbols are losing or changing partitions and mark them for
323 if (MPT_SYMBOLS (mpt))
324 bitmap_clear_bit (MPT_SYMBOLS (mpt), DECL_UID (var));
325 set_memory_partition (var, NULL_TREE);
330 /* qsort comparison function to sort type/name tags by DECL_UID. */
333 sort_tags_by_id (const void *pa, const void *pb)
335 const_tree const a = *(const_tree const *)pa;
336 const_tree const b = *(const_tree const *)pb;
338 return DECL_UID (a) - DECL_UID (b);
341 /* Initialize WORKLIST to contain those memory tags that are marked call
342 clobbered. Initialized WORKLIST2 to contain the reasons these
343 memory tags escaped. */
346 init_transitive_clobber_worklist (VEC (tree, heap) **worklist,
347 VEC (int, heap) **worklist2,
350 referenced_var_iterator rvi;
353 FOR_EACH_REFERENCED_VAR (curr, rvi)
355 if (MTAG_P (curr) && is_call_clobbered (curr))
357 VEC_safe_push (tree, heap, *worklist, curr);
358 VEC_safe_push (int, heap, *worklist2,
359 var_ann (curr)->escape_mask);
360 bitmap_set_bit (on_worklist, DECL_UID (curr));
365 /* Add ALIAS to WORKLIST (and the reason for escaping REASON to WORKLIST2) if
366 ALIAS is not already marked call clobbered, and is a memory
370 add_to_worklist (tree alias, VEC (tree, heap) **worklist,
371 VEC (int, heap) **worklist2, int reason,
374 if (MTAG_P (alias) && !is_call_clobbered (alias)
375 && !bitmap_bit_p (on_worklist, DECL_UID (alias)))
377 VEC_safe_push (tree, heap, *worklist, alias);
378 VEC_safe_push (int, heap, *worklist2, reason);
379 bitmap_set_bit (on_worklist, DECL_UID (alias));
383 /* Mark aliases of TAG as call clobbered, and place any tags on the
384 alias list that were not already call clobbered on WORKLIST. */
387 mark_aliases_call_clobbered (tree tag, VEC (tree, heap) **worklist,
388 VEC (int, heap) **worklist2, bitmap on_worklist)
394 var_ann_t ta = var_ann (tag);
398 aliases = may_aliases (tag);
402 EXECUTE_IF_SET_IN_BITMAP (aliases, 0, i, bi)
404 entry = referenced_var (i);
405 /* If you clobber one part of a structure, you
406 clobber the entire thing. While this does not make
407 the world a particularly nice place, it is necessary
408 in order to allow C/C++ tricks that involve
409 pointer arithmetic to work. */
410 if (!unmodifiable_var_p (entry))
412 add_to_worklist (entry, worklist, worklist2, ta->escape_mask,
414 mark_call_clobbered (entry, ta->escape_mask);
419 /* Tags containing global vars need to be marked as global.
420 Tags containing call clobbered vars need to be marked as call
424 compute_tag_properties (void)
426 referenced_var_iterator rvi;
429 VEC (tree, heap) *taglist = NULL;
431 FOR_EACH_REFERENCED_VAR (tag, rvi)
435 VEC_safe_push (tree, heap, taglist, tag);
438 /* We sort the taglist by DECL_UID, for two reasons.
439 1. To get a sequential ordering to make the bitmap accesses
441 2. Because of the way we compute aliases, it's more likely that
442 an earlier tag is included in a later tag, and this will reduce
443 the number of iterations.
445 If we had a real tag graph, we would just topo-order it and be
447 qsort (VEC_address (tree, taglist),
448 VEC_length (tree, taglist),
452 /* Go through each tag not marked as global, and if it aliases
453 global vars, mark it global.
455 If the tag contains call clobbered vars, mark it call
458 This loop iterates because tags may appear in the may-aliases
459 list of other tags when we group. */
466 for (k = 0; VEC_iterate (tree, taglist, k, tag); k++)
472 bool tagcc = is_call_clobbered (tag);
473 bool tagglobal = MTAG_GLOBAL (tag);
475 if (tagcc && tagglobal)
478 ma = may_aliases (tag);
482 EXECUTE_IF_SET_IN_BITMAP (ma, 0, i, bi)
484 entry = referenced_var (i);
485 /* Call clobbered entries cause the tag to be marked
487 if (!tagcc && is_call_clobbered (entry))
489 mark_call_clobbered (tag, var_ann (entry)->escape_mask);
494 /* Global vars cause the tag to be marked global. */
495 if (!tagglobal && is_global_var (entry))
497 MTAG_GLOBAL (tag) = true;
502 /* Early exit once both global and cc are set, since the
503 loop can't do any more than that. */
504 if (tagcc && tagglobal)
509 VEC_free (tree, heap, taglist);
512 /* Set up the initial variable clobbers and globalness.
513 When this function completes, only tags whose aliases need to be
514 clobbered will be set clobbered. Tags clobbered because they
515 contain call clobbered vars are handled in compute_tag_properties. */
518 set_initial_properties (struct alias_info *ai)
521 referenced_var_iterator rvi;
525 FOR_EACH_REFERENCED_VAR (var, rvi)
527 if (is_global_var (var))
529 if (!unmodifiable_var_p (var))
530 mark_call_clobbered (var, ESCAPE_IS_GLOBAL);
532 else if (TREE_CODE (var) == PARM_DECL
533 && gimple_default_def (cfun, var)
534 && POINTER_TYPE_P (TREE_TYPE (var)))
536 tree def = gimple_default_def (cfun, var);
537 get_ptr_info (def)->value_escapes_p = 1;
538 get_ptr_info (def)->escape_mask |= ESCAPE_IS_PARM;
542 for (i = 0; VEC_iterate (tree, ai->processed_ptrs, i, ptr); i++)
544 struct ptr_info_def *pi = SSA_NAME_PTR_INFO (ptr);
545 tree tag = symbol_mem_tag (SSA_NAME_VAR (ptr));
547 if (pi->value_escapes_p)
549 /* If PTR escapes then its associated memory tags and
550 pointed-to variables are call-clobbered. */
551 if (pi->name_mem_tag)
552 mark_call_clobbered (pi->name_mem_tag, pi->escape_mask);
555 mark_call_clobbered (tag, pi->escape_mask);
561 EXECUTE_IF_SET_IN_BITMAP (pi->pt_vars, 0, j, bi)
563 tree alias = referenced_var (j);
565 /* If you clobber one part of a structure, you
566 clobber the entire thing. While this does not make
567 the world a particularly nice place, it is necessary
568 in order to allow C/C++ tricks that involve
569 pointer arithmetic to work. */
570 if (!unmodifiable_var_p (alias))
571 mark_call_clobbered (alias, pi->escape_mask);
574 else if (pi->pt_anything)
579 /* If we do not have the points-to set filled out we
580 still need to honor that this escaped pointer points
582 EXECUTE_IF_SET_IN_BITMAP (gimple_addressable_vars (cfun),
585 tree var = referenced_var (j);
586 if (!unmodifiable_var_p (var))
587 mark_call_clobbered (var, pi->escape_mask);
592 /* If the name tag is call clobbered, so is the symbol tag
593 associated with the base VAR_DECL. */
596 && is_call_clobbered (pi->name_mem_tag))
597 mark_call_clobbered (tag, pi->escape_mask);
599 /* Name tags and symbol tags that we don't know where they point
600 to, might point to global memory, and thus, are clobbered.
602 FIXME: This is not quite right. They should only be
603 clobbered if value_escapes_p is true, regardless of whether
604 they point to global memory or not.
605 So removing this code and fixing all the bugs would be nice.
606 It is the cause of a bunch of clobbering. */
607 if ((pi->pt_global_mem || pi->pt_anything)
608 && pi->is_dereferenced && pi->name_mem_tag)
610 mark_call_clobbered (pi->name_mem_tag, ESCAPE_IS_GLOBAL);
611 MTAG_GLOBAL (pi->name_mem_tag) = true;
614 if ((pi->pt_global_mem || pi->pt_anything)
615 && pi->is_dereferenced
618 mark_call_clobbered (tag, ESCAPE_IS_GLOBAL);
619 MTAG_GLOBAL (tag) = true;
624 /* Compute which variables need to be marked call clobbered because
625 their tag is call clobbered, and which tags need to be marked
626 global because they contain global variables. */
629 compute_call_clobbered (struct alias_info *ai)
631 VEC (tree, heap) *worklist = NULL;
632 VEC (int,heap) *worklist2 = NULL;
635 timevar_push (TV_CALL_CLOBBER);
636 on_worklist = BITMAP_ALLOC (NULL);
638 set_initial_properties (ai);
639 init_transitive_clobber_worklist (&worklist, &worklist2, on_worklist);
640 while (VEC_length (tree, worklist) != 0)
642 tree curr = VEC_pop (tree, worklist);
643 int reason = VEC_pop (int, worklist2);
645 bitmap_clear_bit (on_worklist, DECL_UID (curr));
646 mark_call_clobbered (curr, reason);
647 mark_aliases_call_clobbered (curr, &worklist, &worklist2, on_worklist);
649 VEC_free (tree, heap, worklist);
650 VEC_free (int, heap, worklist2);
651 BITMAP_FREE (on_worklist);
652 compute_tag_properties ();
653 timevar_pop (TV_CALL_CLOBBER);
657 /* Dump memory partition information to FILE. */
660 dump_memory_partitions (FILE *file)
666 fprintf (file, "\nMemory partitions\n\n");
667 for (i = 0, npart = 0, nsyms = 0;
668 VEC_iterate (tree, gimple_ssa_operands (cfun)->mpt_table, i, mpt);
673 bitmap syms = MPT_SYMBOLS (mpt);
674 unsigned long n = (syms) ? bitmap_count_bits (syms) : 0;
676 fprintf (file, "#%u: ", i);
677 print_generic_expr (file, mpt, 0);
678 fprintf (file, ": %lu elements: ", n);
679 dump_decl_set (file, syms);
685 fprintf (file, "\n%u memory partitions holding %lu symbols\n", npart, nsyms);
689 /* Dump memory partition information to stderr. */
692 debug_memory_partitions (void)
694 dump_memory_partitions (stderr);
698 /* Return true if memory partitioning is required given the memory
699 reference estimates in STATS. */
702 need_to_partition_p (struct mem_ref_stats_d *stats)
704 long num_vops = stats->num_vuses + stats->num_vdefs;
705 long avg_vops = CEIL (num_vops, stats->num_mem_stmts);
706 return (num_vops > (long) MAX_ALIASED_VOPS
707 && avg_vops > (long) AVG_ALIASED_VOPS);
711 /* Count the actual number of virtual operators in CFUN. Note that
712 this is only meaningful after virtual operands have been populated,
713 so it should be invoked at the end of compute_may_aliases.
715 The number of virtual operators are stored in *NUM_VDEFS_P and
716 *NUM_VUSES_P, the number of partitioned symbols in
717 *NUM_PARTITIONED_P and the number of unpartitioned symbols in
718 *NUM_UNPARTITIONED_P.
720 If any of these pointers is NULL the corresponding count is not
724 count_mem_refs (long *num_vuses_p, long *num_vdefs_p,
725 long *num_partitioned_p, long *num_unpartitioned_p)
727 block_stmt_iterator bsi;
729 long num_vdefs, num_vuses, num_partitioned, num_unpartitioned;
730 referenced_var_iterator rvi;
733 num_vuses = num_vdefs = num_partitioned = num_unpartitioned = 0;
735 if (num_vuses_p || num_vdefs_p)
737 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
739 tree stmt = bsi_stmt (bsi);
740 if (stmt_references_memory_p (stmt))
742 num_vuses += NUM_SSA_OPERANDS (stmt, SSA_OP_VUSE);
743 num_vdefs += NUM_SSA_OPERANDS (stmt, SSA_OP_VDEF);
747 if (num_partitioned_p || num_unpartitioned_p)
748 FOR_EACH_REFERENCED_VAR (sym, rvi)
750 if (is_gimple_reg (sym))
753 if (memory_partition (sym))
760 *num_vdefs_p = num_vdefs;
763 *num_vuses_p = num_vuses;
765 if (num_partitioned_p)
766 *num_partitioned_p = num_partitioned;
768 if (num_unpartitioned_p)
769 *num_unpartitioned_p = num_unpartitioned;
773 /* The list is sorted by increasing partitioning score (PSCORE).
774 This score is computed such that symbols with high scores are
775 those that are least likely to be partitioned. Given a symbol
776 MP->VAR, PSCORE(S) is the result of the following weighted sum
778 PSCORE(S) = FW * 64 + FR * 32
785 FW Execution frequency of writes to S
786 FR Execution frequency of reads from S
787 DW Number of direct writes to S
788 DR Number of direct reads from S
789 IW Number of indirect writes to S
790 IR Number of indirect reads from S
791 NO_ALIAS State of the NO_ALIAS* flags
793 The basic idea here is that symbols that are frequently
794 written-to in hot paths of the code are the last to be considered
798 mem_sym_score (mem_sym_stats_t mp)
800 return mp->frequency_writes * 64 + mp->frequency_reads * 32
801 + mp->num_direct_writes * 16 + mp->num_direct_reads * 8
802 + mp->num_indirect_writes * 4 + mp->num_indirect_reads * 2
803 + var_ann (mp->var)->noalias_state;
807 /* Dump memory reference stats for function CFUN to FILE. */
810 dump_mem_ref_stats (FILE *file)
812 long actual_num_vuses, actual_num_vdefs;
813 long num_partitioned, num_unpartitioned;
814 struct mem_ref_stats_d *stats;
816 stats = gimple_mem_ref_stats (cfun);
818 count_mem_refs (&actual_num_vuses, &actual_num_vdefs, &num_partitioned,
821 fprintf (file, "\nMemory reference statistics for %s\n\n",
822 lang_hooks.decl_printable_name (current_function_decl, 2));
824 fprintf (file, "Number of memory statements: %ld\n",
825 stats->num_mem_stmts);
826 fprintf (file, "Number of call sites: %ld\n",
827 stats->num_call_sites);
828 fprintf (file, "Number of pure/const call sites: %ld\n",
829 stats->num_pure_const_call_sites);
830 fprintf (file, "Number of asm sites: %ld\n",
831 stats->num_asm_sites);
832 fprintf (file, "Estimated number of loads: %ld (%ld/stmt)\n",
834 (stats->num_mem_stmts)
835 ? CEIL (stats->num_vuses, stats->num_mem_stmts)
837 fprintf (file, "Actual number of loads: %ld (%ld/stmt)\n",
839 (stats->num_mem_stmts)
840 ? CEIL (actual_num_vuses, stats->num_mem_stmts)
843 if (actual_num_vuses > stats->num_vuses + (stats->num_vuses / 25))
844 fprintf (file, "\t(warning: estimation is lower by more than 25%%)\n");
846 fprintf (file, "Estimated number of stores: %ld (%ld/stmt)\n",
848 (stats->num_mem_stmts)
849 ? CEIL (stats->num_vdefs, stats->num_mem_stmts)
851 fprintf (file, "Actual number of stores: %ld (%ld/stmt)\n",
853 (stats->num_mem_stmts)
854 ? CEIL (actual_num_vdefs, stats->num_mem_stmts)
857 if (actual_num_vdefs > stats->num_vdefs + (stats->num_vdefs / 25))
858 fprintf (file, "\t(warning: estimation is lower by more than 25%%)\n");
860 fprintf (file, "Partitioning thresholds: MAX = %d AVG = %d "
861 "(%sNEED TO PARTITION)\n", MAX_ALIASED_VOPS, AVG_ALIASED_VOPS,
862 stats->num_mem_stmts && need_to_partition_p (stats) ? "" : "NO ");
863 fprintf (file, "Number of partitioned symbols: %ld\n", num_partitioned);
864 fprintf (file, "Number of unpartitioned symbols: %ld\n", num_unpartitioned);
868 /* Dump memory reference stats for function FN to stderr. */
871 debug_mem_ref_stats (void)
873 dump_mem_ref_stats (stderr);
877 /* Dump memory reference stats for variable VAR to FILE. */
880 dump_mem_sym_stats (FILE *file, tree var)
882 mem_sym_stats_t stats = mem_sym_stats (cfun, var);
887 fprintf (file, "read frequency: %6ld, write frequency: %6ld, "
888 "direct reads: %3ld, direct writes: %3ld, "
889 "indirect reads: %4ld, indirect writes: %4ld, symbol: ",
890 stats->frequency_reads, stats->frequency_writes,
891 stats->num_direct_reads, stats->num_direct_writes,
892 stats->num_indirect_reads, stats->num_indirect_writes);
893 print_generic_expr (file, stats->var, 0);
894 fprintf (file, ", tags: ");
895 dump_decl_set (file, stats->parent_tags);
899 /* Dump memory reference stats for variable VAR to stderr. */
902 debug_mem_sym_stats (tree var)
904 dump_mem_sym_stats (stderr, var);
907 /* Dump memory reference stats for variable VAR to FILE. For use
908 of tree-dfa.c:dump_variable. */
911 dump_mem_sym_stats_for_var (FILE *file, tree var)
913 mem_sym_stats_t stats = mem_sym_stats (cfun, var);
918 fprintf (file, ", score: %ld", mem_sym_score (stats));
919 fprintf (file, ", direct reads: %ld", stats->num_direct_reads);
920 fprintf (file, ", direct writes: %ld", stats->num_direct_writes);
921 fprintf (file, ", indirect reads: %ld", stats->num_indirect_reads);
922 fprintf (file, ", indirect writes: %ld", stats->num_indirect_writes);
925 /* Dump memory reference stats for all memory symbols to FILE. */
928 dump_all_mem_sym_stats (FILE *file)
930 referenced_var_iterator rvi;
933 FOR_EACH_REFERENCED_VAR (sym, rvi)
935 if (is_gimple_reg (sym))
938 dump_mem_sym_stats (file, sym);
943 /* Dump memory reference stats for all memory symbols to stderr. */
946 debug_all_mem_sym_stats (void)
948 dump_all_mem_sym_stats (stderr);
952 /* Dump the MP_INFO array to FILE. */
955 dump_mp_info (FILE *file, VEC(mem_sym_stats_t,heap) *mp_info)
958 mem_sym_stats_t mp_p;
960 for (i = 0; VEC_iterate (mem_sym_stats_t, mp_info, i, mp_p); i++)
961 if (!mp_p->partitioned_p)
962 dump_mem_sym_stats (file, mp_p->var);
966 /* Dump the MP_INFO array to stderr. */
969 debug_mp_info (VEC(mem_sym_stats_t,heap) *mp_info)
971 dump_mp_info (stderr, mp_info);
975 /* Update memory reference stats for symbol VAR in statement STMT.
976 NUM_DIRECT_READS and NUM_DIRECT_WRITES specify the number of times
977 that VAR is read/written in STMT (indirect reads/writes are not
978 recorded by this function, see compute_memory_partitions). */
981 update_mem_sym_stats_from_stmt (tree var, tree stmt, long num_direct_reads,
982 long num_direct_writes)
984 mem_sym_stats_t stats;
986 gcc_assert (num_direct_reads >= 0 && num_direct_writes >= 0);
988 stats = get_mem_sym_stats_for (var);
990 stats->num_direct_reads += num_direct_reads;
991 stats->frequency_reads += ((long) bb_for_stmt (stmt)->frequency
994 stats->num_direct_writes += num_direct_writes;
995 stats->frequency_writes += ((long) bb_for_stmt (stmt)->frequency
996 * num_direct_writes);
1000 /* Given two MP_INFO entries MP1 and MP2, return -1 if MP1->VAR should
1001 be partitioned before MP2->VAR, 0 if they are the same or 1 if
1002 MP1->VAR should be partitioned after MP2->VAR. */
1005 compare_mp_info_entries (mem_sym_stats_t mp1, mem_sym_stats_t mp2)
1007 long pscore1 = mem_sym_score (mp1);
1008 long pscore2 = mem_sym_score (mp2);
1010 if (pscore1 < pscore2)
1012 else if (pscore1 > pscore2)
1015 return DECL_UID (mp1->var) - DECL_UID (mp2->var);
1019 /* Comparison routine for qsort. The list is sorted by increasing
1020 partitioning score (PSCORE). This score is computed such that
1021 symbols with high scores are those that are least likely to be
1025 mp_info_cmp (const void *p, const void *q)
1027 mem_sym_stats_t e1 = *((const mem_sym_stats_t *) p);
1028 mem_sym_stats_t e2 = *((const mem_sym_stats_t *) q);
1029 return compare_mp_info_entries (e1, e2);
1033 /* Sort the array of reference counts used to compute memory partitions.
1034 Elements are sorted in ascending order of execution frequency and
1035 descending order of virtual operators needed. */
1038 sort_mp_info (VEC(mem_sym_stats_t,heap) *list)
1040 unsigned num = VEC_length (mem_sym_stats_t, list);
1047 if (compare_mp_info_entries (VEC_index (mem_sym_stats_t, list, 0),
1048 VEC_index (mem_sym_stats_t, list, 1)) > 0)
1050 /* Swap elements if they are in the wrong order. */
1051 mem_sym_stats_t tmp = VEC_index (mem_sym_stats_t, list, 0);
1052 VEC_replace (mem_sym_stats_t, list, 0,
1053 VEC_index (mem_sym_stats_t, list, 1));
1054 VEC_replace (mem_sym_stats_t, list, 1, tmp);
1060 /* There are 3 or more elements, call qsort. */
1061 qsort (VEC_address (mem_sym_stats_t, list),
1062 VEC_length (mem_sym_stats_t, list),
1063 sizeof (mem_sym_stats_t),
1068 /* Return the memory partition tag (MPT) associated with memory
1072 get_mpt_for (tree sym)
1076 /* Don't create a new tag unnecessarily. */
1077 mpt = memory_partition (sym);
1078 if (mpt == NULL_TREE)
1080 mpt = create_tag_raw (MEMORY_PARTITION_TAG, TREE_TYPE (sym), "MPT");
1081 TREE_ADDRESSABLE (mpt) = 0;
1082 add_referenced_var (mpt);
1083 VEC_safe_push (tree, heap, gimple_ssa_operands (cfun)->mpt_table, mpt);
1084 gcc_assert (MPT_SYMBOLS (mpt) == NULL);
1085 set_memory_partition (sym, mpt);
1092 /* Add MP_P->VAR to a memory partition and return the partition. */
1095 find_partition_for (mem_sym_stats_t mp_p)
1098 VEC(tree,heap) *mpt_table;
1101 mpt_table = gimple_ssa_operands (cfun)->mpt_table;
1104 /* Find an existing partition for MP_P->VAR. */
1105 for (i = 0; VEC_iterate (tree, mpt_table, i, mpt); i++)
1107 mem_sym_stats_t mpt_stats;
1109 /* If MPT does not have any symbols yet, use it. */
1110 if (MPT_SYMBOLS (mpt) == NULL)
1113 /* Otherwise, see if MPT has common parent tags with MP_P->VAR,
1114 but avoid grouping clobbered variables with non-clobbered
1115 variables (otherwise, this tends to creates a single memory
1116 partition because other call-clobbered variables may have
1117 common parent tags with non-clobbered ones). */
1118 mpt_stats = get_mem_sym_stats_for (mpt);
1119 if (mp_p->parent_tags
1120 && mpt_stats->parent_tags
1121 && is_call_clobbered (mpt) == is_call_clobbered (mp_p->var)
1122 && bitmap_intersect_p (mpt_stats->parent_tags, mp_p->parent_tags))
1125 /* If no common parent tags are found, see if both MPT and
1126 MP_P->VAR are call-clobbered. */
1127 if (is_call_clobbered (mpt) && is_call_clobbered (mp_p->var))
1131 if (mpt == NULL_TREE)
1132 mpt = get_mpt_for (mp_p->var);
1134 set_memory_partition (mp_p->var, mpt);
1136 mp_p->partitioned_p = true;
1138 mark_sym_for_renaming (mp_p->var);
1139 mark_sym_for_renaming (mpt);
1145 /* Rewrite the alias set for TAG to use the newly created partitions.
1146 If TAG is NULL, rewrite the set of call-clobbered variables.
1147 NEW_ALIASES is a scratch bitmap to build the new set of aliases for
1151 rewrite_alias_set_for (tree tag, bitmap new_aliases)
1157 EXECUTE_IF_SET_IN_BITMAP (MTAG_ALIASES (tag), 0, i, bi)
1159 sym = referenced_var (i);
1160 mpt = memory_partition (sym);
1162 bitmap_set_bit (new_aliases, DECL_UID (mpt));
1164 bitmap_set_bit (new_aliases, DECL_UID (sym));
1167 /* Rebuild the may-alias array for TAG. */
1168 bitmap_copy (MTAG_ALIASES (tag), new_aliases);
1172 /* Determine how many virtual operands can be saved by partitioning
1173 MP_P->VAR into MPT. When a symbol S is thrown inside a partition
1174 P, every virtual operand that used to reference S will now
1175 reference P. Whether it reduces the number of virtual operands
1178 1- Direct references to S are never saved. Instead of the virtual
1179 operand to S, we will now have a virtual operand to P.
1181 2- Indirect references to S are reduced only for those memory tags
1182 holding S that already had other symbols partitioned into P.
1183 For instance, if a memory tag T has the alias set { a b S c },
1184 the first time we partition S into P, the alias set will become
1185 { a b P c }, so no virtual operands will be saved. However, if
1186 we now partition symbol 'c' into P, then the alias set for T
1187 will become { a b P }, so we will be saving one virtual operand
1188 for every indirect reference to 'c'.
1190 3- Is S is call-clobbered, we save as many virtual operands as
1191 call/asm sites exist in the code, but only if other
1192 call-clobbered symbols have been grouped into P. The first
1193 call-clobbered symbol that we group does not produce any
1196 MEM_REF_STATS points to CFUN's memory reference information. */
1199 estimate_vop_reduction (struct mem_ref_stats_d *mem_ref_stats,
1200 mem_sym_stats_t mp_p, tree mpt)
1204 mem_sym_stats_t mpt_stats;
1206 /* We should only get symbols with indirect references here. */
1207 gcc_assert (mp_p->num_indirect_reads > 0 || mp_p->num_indirect_writes > 0);
1209 /* Note that the only statistics we keep for MPT is the set of
1210 parent tags to know which memory tags have had alias members
1211 partitioned, and the indicator has_call_clobbered_vars.
1212 Reference counts are not important for MPT. */
1213 mpt_stats = get_mem_sym_stats_for (mpt);
1215 /* Traverse all the parent tags for MP_P->VAR. For every tag T, if
1216 partition P is already grouping aliases of T, then reduce the
1217 number of virtual operands by the number of direct references
1219 if (mp_p->parent_tags)
1221 if (mpt_stats->parent_tags == NULL)
1222 mpt_stats->parent_tags = BITMAP_ALLOC (&alias_bitmap_obstack);
1224 EXECUTE_IF_SET_IN_BITMAP (mp_p->parent_tags, 0, i, bi)
1226 if (bitmap_bit_p (mpt_stats->parent_tags, i))
1228 /* Partition MPT is already partitioning symbols in the
1229 alias set for TAG. This means that we are now saving
1230 1 virtual operand for every direct reference to TAG. */
1231 tree tag = referenced_var (i);
1232 mem_sym_stats_t tag_stats = mem_sym_stats (cfun, tag);
1233 mem_ref_stats->num_vuses -= tag_stats->num_direct_reads;
1234 mem_ref_stats->num_vdefs -= tag_stats->num_direct_writes;
1238 /* This is the first symbol in tag I's alias set that is
1239 being grouped under MPT. We will not save any
1240 virtual operands this time, but record that MPT is
1241 grouping a symbol from TAG's alias set so that the
1242 next time we get the savings. */
1243 bitmap_set_bit (mpt_stats->parent_tags, i);
1248 /* If MP_P->VAR is call-clobbered, and MPT is already grouping
1249 call-clobbered symbols, then we will save as many virtual
1250 operands as asm/call sites there are. */
1251 if (is_call_clobbered (mp_p->var))
1253 if (mpt_stats->has_call_clobbered_vars)
1254 mem_ref_stats->num_vdefs -= mem_ref_stats->num_call_sites
1255 + mem_ref_stats->num_asm_sites;
1257 mpt_stats->has_call_clobbered_vars = true;
1262 /* Helper for compute_memory_partitions. Transfer reference counts
1263 from pointers to their pointed-to sets. Counters for pointers were
1264 computed by update_alias_info. MEM_REF_STATS points to CFUN's
1265 memory reference information. */
1268 update_reference_counts (struct mem_ref_stats_d *mem_ref_stats)
1272 mem_sym_stats_t sym_stats;
1274 for (i = 1; i < num_ssa_names; i++)
1277 struct ptr_info_def *pi;
1281 && POINTER_TYPE_P (TREE_TYPE (ptr))
1282 && (pi = SSA_NAME_PTR_INFO (ptr)) != NULL
1283 && pi->is_dereferenced)
1288 mem_sym_stats_t ptr_stats, tag_stats;
1290 /* If PTR has flow-sensitive points-to information, use
1291 PTR's name tag, otherwise use the symbol tag associated
1292 with PTR's symbol. */
1293 if (pi->name_mem_tag)
1294 tag = pi->name_mem_tag;
1296 tag = symbol_mem_tag (SSA_NAME_VAR (ptr));
1298 ptr_stats = get_mem_sym_stats_for (ptr);
1299 tag_stats = get_mem_sym_stats_for (tag);
1301 /* TAG has as many direct references as dereferences we
1302 found for its parent pointer. */
1303 tag_stats->num_direct_reads += ptr_stats->num_direct_reads;
1304 tag_stats->num_direct_writes += ptr_stats->num_direct_writes;
1306 /* All the dereferences of pointer PTR are considered direct
1307 references to PTR's memory tag (TAG). In turn,
1308 references to TAG will become virtual operands for every
1309 symbol in TAG's alias set. So, for every symbol ALIAS in
1310 TAG's alias set, add as many indirect references to ALIAS
1311 as direct references there are for TAG. */
1312 if (MTAG_ALIASES (tag))
1313 EXECUTE_IF_SET_IN_BITMAP (MTAG_ALIASES (tag), 0, j, bj)
1315 tree alias = referenced_var (j);
1316 sym_stats = get_mem_sym_stats_for (alias);
1318 /* All the direct references to TAG are indirect references
1320 sym_stats->num_indirect_reads += ptr_stats->num_direct_reads;
1321 sym_stats->num_indirect_writes += ptr_stats->num_direct_writes;
1322 sym_stats->frequency_reads += ptr_stats->frequency_reads;
1323 sym_stats->frequency_writes += ptr_stats->frequency_writes;
1325 /* Indicate that TAG is one of ALIAS's parent tags. */
1326 if (sym_stats->parent_tags == NULL)
1327 sym_stats->parent_tags = BITMAP_ALLOC (&alias_bitmap_obstack);
1328 bitmap_set_bit (sym_stats->parent_tags, DECL_UID (tag));
1333 /* Call-clobbered symbols are indirectly written at every
1335 EXECUTE_IF_SET_IN_BITMAP (gimple_call_clobbered_vars (cfun), 0, i, bi)
1337 tree sym = referenced_var (i);
1338 sym_stats = get_mem_sym_stats_for (sym);
1339 sym_stats->num_indirect_writes += mem_ref_stats->num_call_sites
1340 + mem_ref_stats->num_asm_sites;
1343 /* Addressable symbols are indirectly written at some ASM sites.
1344 Since only ASM sites that clobber memory actually affect
1345 addressable symbols, this is an over-estimation. */
1346 EXECUTE_IF_SET_IN_BITMAP (gimple_addressable_vars (cfun), 0, i, bi)
1348 tree sym = referenced_var (i);
1349 sym_stats = get_mem_sym_stats_for (sym);
1350 sym_stats->num_indirect_writes += mem_ref_stats->num_asm_sites;
1355 /* Helper for compute_memory_partitions. Add all memory symbols to
1356 *MP_INFO_P and compute the initial estimate for the total number of
1357 virtual operands needed. MEM_REF_STATS points to CFUN's memory
1358 reference information. On exit, *TAGS_P will contain the list of
1359 memory tags whose alias set need to be rewritten after
1363 build_mp_info (struct mem_ref_stats_d *mem_ref_stats,
1364 VEC(mem_sym_stats_t,heap) **mp_info_p,
1365 VEC(tree,heap) **tags_p)
1368 referenced_var_iterator rvi;
1370 FOR_EACH_REFERENCED_VAR (var, rvi)
1372 mem_sym_stats_t sym_stats;
1375 /* We are only interested in memory symbols other than MPTs. */
1376 if (is_gimple_reg (var) || TREE_CODE (var) == MEMORY_PARTITION_TAG)
1379 /* Collect memory tags into the TAGS array so that we can
1380 rewrite their alias sets after partitioning. */
1381 if (MTAG_P (var) && MTAG_ALIASES (var))
1382 VEC_safe_push (tree, heap, *tags_p, var);
1384 /* Since we are going to re-compute partitions, any symbols that
1385 used to belong to a partition must be detached from it and
1386 marked for renaming. */
1387 if ((old_mpt = memory_partition (var)) != NULL)
1389 mark_sym_for_renaming (old_mpt);
1390 set_memory_partition (var, NULL_TREE);
1391 mark_sym_for_renaming (var);
1394 sym_stats = get_mem_sym_stats_for (var);
1396 /* Add VAR's reference info to MP_INFO. Note that the only
1397 symbols that make sense to partition are those that have
1398 indirect references. If a symbol S is always directly
1399 referenced, partitioning it will not reduce the number of
1400 virtual operators. The only symbols that are profitable to
1401 partition are those that belong to alias sets and/or are
1403 if (sym_stats->num_indirect_reads > 0
1404 || sym_stats->num_indirect_writes > 0)
1405 VEC_safe_push (mem_sym_stats_t, heap, *mp_info_p, sym_stats);
1407 /* Update the number of estimated VOPS. Note that direct
1408 references to memory tags are always counted as indirect
1409 references to their alias set members, so if a memory tag has
1410 aliases, do not count its direct references to avoid double
1412 if (!MTAG_P (var) || !MTAG_ALIASES (var))
1414 mem_ref_stats->num_vuses += sym_stats->num_direct_reads;
1415 mem_ref_stats->num_vdefs += sym_stats->num_direct_writes;
1418 mem_ref_stats->num_vuses += sym_stats->num_indirect_reads;
1419 mem_ref_stats->num_vdefs += sym_stats->num_indirect_writes;
1424 /* Compute memory partitions. A memory partition (MPT) is an
1425 arbitrary grouping of memory symbols, such that references to one
1426 member of the group is considered a reference to all the members of
1429 As opposed to alias sets in memory tags, the grouping into
1430 partitions is completely arbitrary and only done to reduce the
1431 number of virtual operands. The only rule that needs to be
1432 observed when creating memory partitions is that given two memory
1433 partitions MPT.i and MPT.j, they must not contain symbols in
1436 Memory partitions are used when putting the program into Memory-SSA
1437 form. In particular, in Memory-SSA PHI nodes are not computed for
1438 individual memory symbols. They are computed for memory
1439 partitions. This reduces the amount of PHI nodes in the SSA graph
1440 at the expense of precision (i.e., it makes unrelated stores affect
1443 However, it is possible to increase precision by changing this
1444 partitioning scheme. For instance, if the partitioning scheme is
1445 such that get_mpt_for is the identity function (that is,
1446 get_mpt_for (s) = s), this will result in ultimate precision at the
1447 expense of huge SSA webs.
1449 At the other extreme, a partitioning scheme that groups all the
1450 symbols in the same set results in minimal SSA webs and almost
1451 total loss of precision.
1453 There partitioning heuristic uses three parameters to decide the
1454 order in which symbols are processed. The list of symbols is
1455 sorted so that symbols that are more likely to be partitioned are
1456 near the top of the list:
1458 - Execution frequency. If a memory references is in a frequently
1459 executed code path, grouping it into a partition may block useful
1460 transformations and cause sub-optimal code generation. So, the
1461 partition heuristic tries to avoid grouping symbols with high
1462 execution frequency scores. Execution frequency is taken
1463 directly from the basic blocks where every reference is made (see
1464 update_mem_sym_stats_from_stmt), which in turn uses the
1465 profile guided machinery, so if the program is compiled with PGO
1466 enabled, more accurate partitioning decisions will be made.
1468 - Number of references. Symbols with few references in the code,
1469 are partitioned before symbols with many references.
1471 - NO_ALIAS attributes. Symbols with any of the NO_ALIAS*
1472 attributes are partitioned after symbols marked MAY_ALIAS.
1474 Once the list is sorted, the partitioning proceeds as follows:
1476 1- For every symbol S in MP_INFO, create a new memory partition MP,
1477 if necessary. To avoid memory partitions that contain symbols
1478 from non-conflicting alias sets, memory partitions are
1479 associated to the memory tag that holds S in its alias set. So,
1480 when looking for a memory partition for S, the memory partition
1481 associated with one of the memory tags holding S is chosen. If
1482 none exists, a new one is created.
1484 2- Add S to memory partition MP.
1486 3- Reduce by 1 the number of VOPS for every memory tag holding S.
1488 4- If the total number of VOPS is less than MAX_ALIASED_VOPS or the
1489 average number of VOPS per statement is less than
1490 AVG_ALIASED_VOPS, stop. Otherwise, go to the next symbol in the
1494 compute_memory_partitions (void)
1498 mem_sym_stats_t mp_p;
1499 VEC(mem_sym_stats_t,heap) *mp_info;
1501 VEC(tree,heap) *tags;
1502 struct mem_ref_stats_d *mem_ref_stats;
1503 int prev_max_aliased_vops;
1505 mem_ref_stats = gimple_mem_ref_stats (cfun);
1506 gcc_assert (mem_ref_stats->num_vuses == 0 && mem_ref_stats->num_vdefs == 0);
1508 if (mem_ref_stats->num_mem_stmts == 0)
1511 timevar_push (TV_MEMORY_PARTITIONING);
1515 prev_max_aliased_vops = MAX_ALIASED_VOPS;
1517 /* Since we clearly cannot lower the number of virtual operators
1518 below the total number of memory statements in the function, we
1519 may need to adjust MAX_ALIASED_VOPS beforehand. */
1520 if (MAX_ALIASED_VOPS < mem_ref_stats->num_mem_stmts)
1521 MAX_ALIASED_VOPS = mem_ref_stats->num_mem_stmts;
1523 /* Update reference stats for all the pointed-to variables and
1525 update_reference_counts (mem_ref_stats);
1527 /* Add all the memory symbols to MP_INFO. */
1528 build_mp_info (mem_ref_stats, &mp_info, &tags);
1530 /* No partitions required if we are below the threshold. */
1531 if (!need_to_partition_p (mem_ref_stats))
1534 fprintf (dump_file, "\nMemory partitioning NOT NEEDED for %s\n",
1535 get_name (current_function_decl));
1539 /* Sort the MP_INFO array so that symbols that should be partitioned
1540 first are near the top of the list. */
1541 sort_mp_info (mp_info);
1545 fprintf (dump_file, "\nMemory partitioning NEEDED for %s\n\n",
1546 get_name (current_function_decl));
1547 fprintf (dump_file, "Memory symbol references before partitioning:\n");
1548 dump_mp_info (dump_file, mp_info);
1551 /* Create partitions for variables in MP_INFO until we have enough
1552 to lower the total number of VOPS below MAX_ALIASED_VOPS or if
1553 the average number of VOPS per statement is below
1554 AVG_ALIASED_VOPS. */
1555 for (i = 0; VEC_iterate (mem_sym_stats_t, mp_info, i, mp_p); i++)
1559 /* If we are below the threshold, stop. */
1560 if (!need_to_partition_p (mem_ref_stats))
1563 mpt = find_partition_for (mp_p);
1564 estimate_vop_reduction (mem_ref_stats, mp_p, mpt);
1567 /* After partitions have been created, rewrite alias sets to use
1568 them instead of the original symbols. This way, if the alias set
1569 was computed as { a b c d e f }, and the subset { b e f } was
1570 grouped into partition MPT.3, then the new alias set for the tag
1571 will be { a c d MPT.3 }.
1573 Note that this is not strictly necessary. The operand scanner
1574 will always check if a symbol belongs to a partition when adding
1575 virtual operands. However, by reducing the size of the alias
1576 sets to be scanned, the work needed inside the operand scanner is
1577 significantly reduced. */
1578 new_aliases = BITMAP_ALLOC (&alias_bitmap_obstack);
1580 for (i = 0; VEC_iterate (tree, tags, i, tag); i++)
1582 rewrite_alias_set_for (tag, new_aliases);
1583 bitmap_clear (new_aliases);
1586 BITMAP_FREE (new_aliases);
1590 fprintf (dump_file, "\nMemory symbol references after partitioning:\n");
1591 dump_mp_info (dump_file, mp_info);
1595 /* Free allocated memory. */
1596 VEC_free (mem_sym_stats_t, heap, mp_info);
1597 VEC_free (tree, heap, tags);
1599 MAX_ALIASED_VOPS = prev_max_aliased_vops;
1601 timevar_pop (TV_MEMORY_PARTITIONING);
1605 /* Compute may-alias information for every variable referenced in function
1608 Alias analysis proceeds in 3 main phases:
1610 1- Points-to and escape analysis.
1612 This phase walks the use-def chains in the SSA web looking for three
1615 * Assignments of the form P_i = &VAR
1616 * Assignments of the form P_i = malloc()
1617 * Pointers and ADDR_EXPR that escape the current function.
1619 The concept of 'escaping' is the same one used in the Java world. When
1620 a pointer or an ADDR_EXPR escapes, it means that it has been exposed
1621 outside of the current function. So, assignment to global variables,
1622 function arguments and returning a pointer are all escape sites, as are
1623 conversions between pointers and integers.
1625 This is where we are currently limited. Since not everything is renamed
1626 into SSA, we lose track of escape properties when a pointer is stashed
1627 inside a field in a structure, for instance. In those cases, we are
1628 assuming that the pointer does escape.
1630 We use escape analysis to determine whether a variable is
1631 call-clobbered. Simply put, if an ADDR_EXPR escapes, then the variable
1632 is call-clobbered. If a pointer P_i escapes, then all the variables
1633 pointed-to by P_i (and its memory tag) also escape.
1635 2- Compute flow-sensitive aliases
1637 We have two classes of memory tags. Memory tags associated with the
1638 pointed-to data type of the pointers in the program. These tags are
1639 called "symbol memory tag" (SMT). The other class are those associated
1640 with SSA_NAMEs, called "name memory tag" (NMT). The basic idea is that
1641 when adding operands for an INDIRECT_REF *P_i, we will first check
1642 whether P_i has a name tag, if it does we use it, because that will have
1643 more precise aliasing information. Otherwise, we use the standard symbol
1646 In this phase, we go through all the pointers we found in points-to
1647 analysis and create alias sets for the name memory tags associated with
1648 each pointer P_i. If P_i escapes, we mark call-clobbered the variables
1649 it points to and its tag.
1652 3- Compute flow-insensitive aliases
1654 This pass will compare the alias set of every symbol memory tag and
1655 every addressable variable found in the program. Given a symbol
1656 memory tag SMT and an addressable variable V. If the alias sets of
1657 SMT and V conflict (as computed by may_alias_p), then V is marked
1658 as an alias tag and added to the alias set of SMT.
1660 For instance, consider the following function:
1676 After aliasing analysis has finished, the symbol memory tag for pointer
1677 'p' will have two aliases, namely variables 'a' and 'b'. Every time
1678 pointer 'p' is dereferenced, we want to mark the operation as a
1679 potential reference to 'a' and 'b'.
1689 # p_1 = PHI <p_4(1), p_6(2)>;
1704 In certain cases, the list of may aliases for a pointer may grow too
1705 large. This may cause an explosion in the number of virtual operands
1706 inserted in the code. Resulting in increased memory consumption and
1709 When the number of virtual operands needed to represent aliased
1710 loads and stores grows too large (configurable with option --param
1711 max-aliased-vops and --param avg-aliased-vops), alias sets are
1712 grouped to avoid severe compile-time slow downs and memory
1713 consumption. See compute_memory_partitions. */
1716 compute_may_aliases (void)
1718 struct alias_info *ai;
1720 timevar_push (TV_TREE_MAY_ALIAS);
1722 memset (&alias_stats, 0, sizeof (alias_stats));
1724 /* Initialize aliasing information. */
1725 ai = init_alias_info ();
1727 /* For each pointer P_i, determine the sets of variables that P_i may
1728 point-to. For every addressable variable V, determine whether the
1729 address of V escapes the current function, making V call-clobbered
1730 (i.e., whether &V is stored in a global variable or if its passed as a
1731 function call argument). */
1732 compute_points_to_sets (ai);
1734 /* Collect all pointers and addressable variables, compute alias sets,
1735 create memory tags for pointers and promote variables whose address is
1736 not needed anymore. */
1737 setup_pointers_and_addressables (ai);
1739 /* Compute type-based flow-insensitive aliasing for all the type
1741 compute_flow_insensitive_aliasing (ai);
1743 /* Compute flow-sensitive, points-to based aliasing for all the name
1745 compute_flow_sensitive_aliasing (ai);
1747 /* Compute call clobbering information. */
1748 compute_call_clobbered (ai);
1750 /* If the program makes no reference to global variables, but it
1751 contains a mixture of pure and non-pure functions, then we need
1752 to create use-def and def-def links between these functions to
1753 avoid invalid transformations on them. */
1754 maybe_create_global_var ();
1756 /* Compute memory partitions for every memory variable. */
1757 compute_memory_partitions ();
1759 /* Remove partitions with no symbols. Partitions may end up with an
1760 empty MPT_SYMBOLS set if a previous round of alias analysis
1761 needed to partition more symbols. Since we don't need those
1762 partitions anymore, remove them to free up the space. */
1766 VEC(tree,heap) *mpt_table;
1768 mpt_table = gimple_ssa_operands (cfun)->mpt_table;
1770 while (i < VEC_length (tree, mpt_table))
1772 mpt = VEC_index (tree, mpt_table, i);
1773 if (MPT_SYMBOLS (mpt) == NULL)
1774 VEC_unordered_remove (tree, mpt_table, i);
1780 /* Populate all virtual operands and newly promoted register operands. */
1782 block_stmt_iterator bsi;
1785 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
1786 update_stmt_if_modified (bsi_stmt (bsi));
1789 /* Debugging dumps. */
1792 dump_mem_ref_stats (dump_file);
1793 dump_alias_info (dump_file);
1794 dump_points_to_info (dump_file);
1796 if (dump_flags & TDF_STATS)
1797 dump_alias_stats (dump_file);
1799 if (dump_flags & TDF_DETAILS)
1800 dump_referenced_vars (dump_file);
1803 /* Report strict aliasing violations. */
1804 strict_aliasing_warning_backend ();
1806 /* Deallocate memory used by aliasing data structures. */
1807 delete_alias_info (ai);
1809 if (need_ssa_update_p ())
1810 update_ssa (TODO_update_ssa);
1812 timevar_pop (TV_TREE_MAY_ALIAS);
1817 /* Data structure used to count the number of dereferences to PTR
1818 inside an expression. */
1826 /* Helper for count_uses_and_derefs. Called by walk_tree to look for
1827 (ALIGN/MISALIGNED_)INDIRECT_REF nodes for the pointer passed in DATA. */
1830 count_ptr_derefs (tree *tp, int *walk_subtrees, void *data)
1832 struct count_ptr_d *count_p = (struct count_ptr_d *) data;
1834 /* Do not walk inside ADDR_EXPR nodes. In the expression &ptr->fld,
1835 pointer 'ptr' is *not* dereferenced, it is simply used to compute
1836 the address of 'fld' as 'ptr + offsetof(fld)'. */
1837 if (TREE_CODE (*tp) == ADDR_EXPR)
1843 if (INDIRECT_REF_P (*tp) && TREE_OPERAND (*tp, 0) == count_p->ptr)
1850 /* Count the number of direct and indirect uses for pointer PTR in
1851 statement STMT. The number of direct uses is stored in
1852 *NUM_USES_P. Indirect references are counted separately depending
1853 on whether they are store or load operations. The counts are
1854 stored in *NUM_STORES_P and *NUM_LOADS_P. */
1857 count_uses_and_derefs (tree ptr, tree stmt, unsigned *num_uses_p,
1858 unsigned *num_loads_p, unsigned *num_stores_p)
1867 /* Find out the total number of uses of PTR in STMT. */
1868 FOR_EACH_SSA_TREE_OPERAND (use, stmt, i, SSA_OP_USE)
1872 /* Now count the number of indirect references to PTR. This is
1873 truly awful, but we don't have much choice. There are no parent
1874 pointers inside INDIRECT_REFs, so an expression like
1875 '*x_1 = foo (x_1, *x_1)' needs to be traversed piece by piece to
1876 find all the indirect and direct uses of x_1 inside. The only
1877 shortcut we can take is the fact that GIMPLE only allows
1878 INDIRECT_REFs inside the expressions below. */
1879 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT
1880 || (TREE_CODE (stmt) == RETURN_EXPR
1881 && TREE_CODE (TREE_OPERAND (stmt, 0)) == GIMPLE_MODIFY_STMT)
1882 || TREE_CODE (stmt) == ASM_EXPR
1883 || TREE_CODE (stmt) == CALL_EXPR)
1887 if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT)
1889 lhs = GIMPLE_STMT_OPERAND (stmt, 0);
1890 rhs = GIMPLE_STMT_OPERAND (stmt, 1);
1892 else if (TREE_CODE (stmt) == RETURN_EXPR)
1894 tree e = TREE_OPERAND (stmt, 0);
1895 lhs = GIMPLE_STMT_OPERAND (e, 0);
1896 rhs = GIMPLE_STMT_OPERAND (e, 1);
1898 else if (TREE_CODE (stmt) == ASM_EXPR)
1900 lhs = ASM_OUTPUTS (stmt);
1901 rhs = ASM_INPUTS (stmt);
1910 && (TREE_CODE (lhs) == TREE_LIST
1912 || GIMPLE_STMT_P (lhs)))
1914 struct count_ptr_d count;
1917 walk_tree (&lhs, count_ptr_derefs, &count, NULL);
1918 *num_stores_p = count.count;
1922 && (TREE_CODE (rhs) == TREE_LIST
1924 || GIMPLE_STMT_P (rhs)))
1926 struct count_ptr_d count;
1929 walk_tree (&rhs, count_ptr_derefs, &count, NULL);
1930 *num_loads_p = count.count;
1934 gcc_assert (*num_uses_p >= *num_loads_p + *num_stores_p);
1937 /* Remove memory references stats for function FN. */
1940 delete_mem_ref_stats (struct function *fn)
1942 if (gimple_mem_ref_stats (fn)->mem_sym_stats)
1944 free_alloc_pool (mem_sym_stats_pool);
1945 pointer_map_destroy (gimple_mem_ref_stats (fn)->mem_sym_stats);
1947 gimple_mem_ref_stats (fn)->mem_sym_stats = NULL;
1951 /* Initialize memory reference stats. */
1954 init_mem_ref_stats (void)
1956 struct mem_ref_stats_d *mem_ref_stats = gimple_mem_ref_stats (cfun);
1958 mem_sym_stats_pool = create_alloc_pool ("Mem sym stats",
1959 sizeof (struct mem_sym_stats_d),
1961 memset (mem_ref_stats, 0, sizeof (struct mem_ref_stats_d));
1962 mem_ref_stats->mem_sym_stats = pointer_map_create ();
1966 /* Helper for init_alias_info. Reset existing aliasing information. */
1969 reset_alias_info (void)
1971 referenced_var_iterator rvi;
1974 bitmap active_nmts, all_nmts;
1976 /* Clear the set of addressable variables. We do not need to clear
1977 the TREE_ADDRESSABLE bit on every symbol because we are going to
1978 re-compute addressability here. */
1979 bitmap_clear (gimple_addressable_vars (cfun));
1981 active_nmts = BITMAP_ALLOC (&alias_bitmap_obstack);
1982 all_nmts = BITMAP_ALLOC (&alias_bitmap_obstack);
1984 /* Clear flow-insensitive alias information from each symbol. */
1985 FOR_EACH_REFERENCED_VAR (var, rvi)
1987 if (is_gimple_reg (var))
1991 MTAG_ALIASES (var) = NULL;
1993 /* Memory partition information will be computed from scratch. */
1994 if (TREE_CODE (var) == MEMORY_PARTITION_TAG)
1995 MPT_SYMBOLS (var) = NULL;
1997 /* Collect all the name tags to determine if we have any
1998 orphaned that need to be removed from the IL. A name tag
1999 will be orphaned if it is not associated with any active SSA
2001 if (TREE_CODE (var) == NAME_MEMORY_TAG)
2002 bitmap_set_bit (all_nmts, DECL_UID (var));
2004 /* Since we are about to re-discover call-clobbered
2005 variables, clear the call-clobbered flag. Variables that
2006 are intrinsically call-clobbered (globals, local statics,
2007 etc) will not be marked by the aliasing code, so we can't
2008 remove them from CALL_CLOBBERED_VARS.
2010 NB: STRUCT_FIELDS are still call clobbered if they are for a
2011 global variable, so we *don't* clear their call clobberedness
2012 just because they are tags, though we will clear it if they
2013 aren't for global variables. */
2014 if (TREE_CODE (var) == NAME_MEMORY_TAG
2015 || TREE_CODE (var) == SYMBOL_MEMORY_TAG
2016 || TREE_CODE (var) == MEMORY_PARTITION_TAG
2017 || !is_global_var (var))
2018 clear_call_clobbered (var);
2021 /* Clear flow-sensitive points-to information from each SSA name. */
2022 for (i = 1; i < num_ssa_names; i++)
2024 tree name = ssa_name (i);
2026 if (!name || !POINTER_TYPE_P (TREE_TYPE (name)))
2029 if (SSA_NAME_PTR_INFO (name))
2031 struct ptr_info_def *pi = SSA_NAME_PTR_INFO (name);
2033 /* Clear all the flags but keep the name tag to
2034 avoid creating new temporaries unnecessarily. If
2035 this pointer is found to point to a subset or
2036 superset of its former points-to set, then a new
2037 tag will need to be created in create_name_tags. */
2038 pi->pt_anything = 0;
2040 pi->value_escapes_p = 0;
2041 pi->is_dereferenced = 0;
2043 bitmap_clear (pi->pt_vars);
2045 /* Add NAME's name tag to the set of active tags. */
2046 if (pi->name_mem_tag)
2047 bitmap_set_bit (active_nmts, DECL_UID (pi->name_mem_tag));
2051 /* Name memory tags that are no longer associated with an SSA name
2052 are considered stale and should be removed from the IL. All the
2053 name tags that are in the set ALL_NMTS but not in ACTIVE_NMTS are
2054 considered stale and marked for renaming. */
2055 bitmap_and_compl_into (all_nmts, active_nmts);
2056 mark_set_for_renaming (all_nmts);
2058 BITMAP_FREE (all_nmts);
2059 BITMAP_FREE (active_nmts);
2063 /* Initialize the data structures used for alias analysis. */
2065 static struct alias_info *
2066 init_alias_info (void)
2068 struct alias_info *ai;
2069 referenced_var_iterator rvi;
2072 ai = XCNEW (struct alias_info);
2073 ai->ssa_names_visited = sbitmap_alloc (num_ssa_names);
2074 sbitmap_zero (ai->ssa_names_visited);
2075 ai->processed_ptrs = VEC_alloc (tree, heap, 50);
2076 ai->written_vars = pointer_set_create ();
2077 ai->dereferenced_ptrs_store = pointer_set_create ();
2078 ai->dereferenced_ptrs_load = pointer_set_create ();
2080 /* Clear out all memory reference stats. */
2081 init_mem_ref_stats ();
2083 /* If aliases have been computed before, clear existing information. */
2084 if (gimple_aliases_computed_p (cfun))
2085 reset_alias_info ();
2088 /* If this is the first time we compute aliasing information,
2089 every non-register symbol will need to be put into SSA form
2090 (the initial SSA form only operates on GIMPLE registers). */
2091 FOR_EACH_REFERENCED_VAR (var, rvi)
2092 if (!is_gimple_reg (var))
2093 mark_sym_for_renaming (var);
2096 /* Next time, we will need to reset alias information. */
2097 cfun->gimple_df->aliases_computed_p = true;
2098 if (alias_bitmap_obstack.elements != NULL)
2099 bitmap_obstack_release (&alias_bitmap_obstack);
2100 bitmap_obstack_initialize (&alias_bitmap_obstack);
2106 /* Deallocate memory used by alias analysis. */
2109 delete_alias_info (struct alias_info *ai)
2113 sbitmap_free (ai->ssa_names_visited);
2115 VEC_free (tree, heap, ai->processed_ptrs);
2117 for (i = 0; i < ai->num_addressable_vars; i++)
2118 free (ai->addressable_vars[i]);
2119 free (ai->addressable_vars);
2121 for (i = 0; i < ai->num_pointers; i++)
2122 free (ai->pointers[i]);
2123 free (ai->pointers);
2125 pointer_set_destroy (ai->written_vars);
2126 pointer_set_destroy (ai->dereferenced_ptrs_store);
2127 pointer_set_destroy (ai->dereferenced_ptrs_load);
2130 delete_mem_ref_stats (cfun);
2131 delete_points_to_sets ();
2135 /* Used for hashing to identify pointer infos with identical
2139 eq_ptr_info (const void *p1, const void *p2)
2141 const struct ptr_info_def *n1 = (const struct ptr_info_def *) p1;
2142 const struct ptr_info_def *n2 = (const struct ptr_info_def *) p2;
2143 return bitmap_equal_p (n1->pt_vars, n2->pt_vars);
2147 ptr_info_hash (const void *p)
2149 const struct ptr_info_def *n = (const struct ptr_info_def *) p;
2150 return bitmap_hash (n->pt_vars);
2154 /* Create name tags for all the pointers that have been dereferenced.
2155 We only create a name tag for a pointer P if P is found to point to
2156 a set of variables (so that we can alias them to *P) or if it is
2157 the result of a call to malloc (which means that P cannot point to
2158 anything else nor alias any other variable).
2160 If two pointers P and Q point to the same set of variables, they
2161 are assigned the same name tag. */
2164 create_name_tags (void)
2167 VEC (tree, heap) *with_ptvars = NULL;
2171 /* Collect the list of pointers with a non-empty points to set. */
2172 for (i = 1; i < num_ssa_names; i++)
2174 tree ptr = ssa_name (i);
2175 struct ptr_info_def *pi;
2178 || !POINTER_TYPE_P (TREE_TYPE (ptr))
2179 || !SSA_NAME_PTR_INFO (ptr))
2182 pi = SSA_NAME_PTR_INFO (ptr);
2184 if (pi->pt_anything || !pi->is_dereferenced)
2186 /* No name tags for pointers that have not been
2187 dereferenced or point to an arbitrary location. */
2188 pi->name_mem_tag = NULL_TREE;
2192 /* Set pt_anything on the pointers without pt_vars filled in so
2193 that they are assigned a symbol tag. */
2194 if (pi->pt_vars && !bitmap_empty_p (pi->pt_vars))
2195 VEC_safe_push (tree, heap, with_ptvars, ptr);
2197 set_pt_anything (ptr);
2200 /* If we didn't find any pointers with pt_vars set, we're done. */
2204 ptr_hash = htab_create (10, ptr_info_hash, eq_ptr_info, NULL);
2206 /* Now go through the pointers with pt_vars, and find a name tag
2207 with the same pt_vars as this pointer, or create one if one
2209 for (i = 0; VEC_iterate (tree, with_ptvars, i, ptr); i++)
2211 struct ptr_info_def *pi = SSA_NAME_PTR_INFO (ptr);
2212 tree old_name_tag = pi->name_mem_tag;
2213 struct ptr_info_def **slot;
2215 /* If PTR points to a set of variables, check if we don't
2216 have another pointer Q with the same points-to set before
2217 creating a tag. If so, use Q's tag instead of creating a
2220 This is important for not creating unnecessary symbols
2221 and also for copy propagation. If we ever need to
2222 propagate PTR into Q or vice-versa, we would run into
2223 problems if they both had different name tags because
2224 they would have different SSA version numbers (which
2225 would force us to take the name tags in and out of SSA). */
2226 slot = (struct ptr_info_def **) htab_find_slot (ptr_hash, pi, INSERT);
2228 pi->name_mem_tag = (*slot)->name_mem_tag;
2233 /* If we didn't find a pointer with the same points-to set
2234 as PTR, create a new name tag if needed. */
2235 if (pi->name_mem_tag == NULL_TREE)
2236 pi->name_mem_tag = get_nmt_for (ptr);
2239 /* If the new name tag computed for PTR is different than
2240 the old name tag that it used to have, then the old tag
2241 needs to be removed from the IL, so we mark it for
2243 if (old_name_tag && old_name_tag != pi->name_mem_tag)
2244 mark_sym_for_renaming (old_name_tag);
2246 /* Inherit volatility from the pointed-to type. */
2247 TREE_THIS_VOLATILE (pi->name_mem_tag)
2248 |= TYPE_VOLATILE (TREE_TYPE (TREE_TYPE (ptr)));
2250 /* Mark the new name tag for renaming. */
2251 mark_sym_for_renaming (pi->name_mem_tag);
2254 htab_delete (ptr_hash);
2256 VEC_free (tree, heap, with_ptvars);
2260 /* Union the alias set SET into the may-aliases for TAG. */
2263 union_alias_set_into (tree tag, bitmap set)
2265 bitmap ma = MTAG_ALIASES (tag);
2267 if (bitmap_empty_p (set))
2271 ma = MTAG_ALIASES (tag) = BITMAP_ALLOC (&alias_bitmap_obstack);
2272 bitmap_ior_into (ma, set);
2276 /* For every pointer P_i in AI->PROCESSED_PTRS, create may-alias sets for
2277 the name memory tag (NMT) associated with P_i. If P_i escapes, then its
2278 name tag and the variables it points-to are call-clobbered. Finally, if
2279 P_i escapes and we could not determine where it points to, then all the
2280 variables in the same alias set as *P_i are marked call-clobbered. This
2281 is necessary because we must assume that P_i may take the address of any
2282 variable in the same alias set. */
2285 compute_flow_sensitive_aliasing (struct alias_info *ai)
2290 timevar_push (TV_FLOW_SENSITIVE);
2293 for (i = 0; VEC_iterate (tree, ai->processed_ptrs, i, ptr); i++)
2295 if (!find_what_p_points_to (ptr))
2296 set_pt_anything (ptr);
2299 create_name_tags ();
2301 for (i = 0; VEC_iterate (tree, ai->processed_ptrs, i, ptr); i++)
2303 struct ptr_info_def *pi = SSA_NAME_PTR_INFO (ptr);
2305 /* Set up aliasing information for PTR's name memory tag (if it has
2306 one). Note that only pointers that have been dereferenced will
2307 have a name memory tag. */
2308 if (pi->name_mem_tag && pi->pt_vars)
2310 if (!bitmap_empty_p (pi->pt_vars))
2311 union_alias_set_into (pi->name_mem_tag, pi->pt_vars);
2314 timevar_pop (TV_FLOW_SENSITIVE);
2318 /* Return TRUE if at least one symbol in TAG2's alias set is also
2319 present in TAG1's alias set. */
2322 have_common_aliases_p (bitmap tag1aliases, bitmap tag2aliases)
2325 /* This is the old behavior of have_common_aliases_p, which is to
2326 return false if both sets are empty, or one set is and the other
2328 if (tag1aliases == NULL || tag2aliases == NULL)
2331 return bitmap_intersect_p (tag1aliases, tag2aliases);
2334 /* Compute type-based alias sets. Traverse all the pointers and
2335 addressable variables found in setup_pointers_and_addressables.
2337 For every pointer P in AI->POINTERS and addressable variable V in
2338 AI->ADDRESSABLE_VARS, add V to the may-alias sets of P's symbol
2339 memory tag (SMT) if their alias sets conflict. V is then marked as
2340 an aliased symbol so that the operand scanner knows that statements
2341 containing V have aliased operands. */
2344 compute_flow_insensitive_aliasing (struct alias_info *ai)
2348 timevar_push (TV_FLOW_INSENSITIVE);
2349 /* For every pointer P, determine which addressable variables may alias
2350 with P's symbol memory tag. */
2351 for (i = 0; i < ai->num_pointers; i++)
2354 struct alias_map_d *p_map = ai->pointers[i];
2355 tree tag = symbol_mem_tag (p_map->var);
2358 for (j = 0; j < ai->num_addressable_vars; j++)
2360 struct alias_map_d *v_map;
2362 bool tag_stored_p, var_stored_p;
2364 v_map = ai->addressable_vars[j];
2366 v_ann = var_ann (var);
2368 /* Skip memory tags and variables that have never been
2369 written to. We also need to check if the variables are
2370 call-clobbered because they may be overwritten by
2372 tag_stored_p = pointer_set_contains (ai->written_vars, tag)
2373 || is_call_clobbered (tag);
2374 var_stored_p = pointer_set_contains (ai->written_vars, var)
2375 || is_call_clobbered (var);
2376 if (!tag_stored_p && !var_stored_p)
2379 if (may_alias_p (p_map->var, p_map->set, var, v_map->set, false))
2381 /* Add VAR to TAG's may-aliases set. */
2382 add_may_alias (tag, var);
2387 /* Since this analysis is based exclusively on symbols, it fails to
2388 handle cases where two pointers P and Q have different memory
2389 tags with conflicting alias set numbers but no aliased symbols in
2392 For example, suppose that we have two memory tags SMT.1 and SMT.2
2395 may-aliases (SMT.1) = { a }
2396 may-aliases (SMT.2) = { b }
2398 and the alias set number of SMT.1 conflicts with that of SMT.2.
2399 Since they don't have symbols in common, loads and stores from
2400 SMT.1 and SMT.2 will seem independent of each other, which will
2401 lead to the optimizers making invalid transformations (see
2402 testsuite/gcc.c-torture/execute/pr15262-[12].c).
2404 To avoid this problem, we do a final traversal of AI->POINTERS
2405 looking for pairs of pointers that have no aliased symbols in
2406 common and yet have conflicting alias set numbers. */
2407 for (i = 0; i < ai->num_pointers; i++)
2410 struct alias_map_d *p_map1 = ai->pointers[i];
2411 tree tag1 = symbol_mem_tag (p_map1->var);
2412 bitmap may_aliases1 = MTAG_ALIASES (tag1);
2414 for (j = 0; j < ai->num_pointers; j++)
2416 struct alias_map_d *p_map2 = ai->pointers[j];
2417 tree tag2 = symbol_mem_tag (p_map2->var);
2418 bitmap may_aliases2 = may_aliases (tag2);
2420 /* By convention tags don't alias themselves. */
2424 /* If the pointers may not point to each other, do nothing. */
2425 if (!may_alias_p (p_map1->var, p_map1->set, tag2, p_map2->set, true))
2428 /* The two pointers may alias each other. If they already have
2429 symbols in common, do nothing. */
2430 if (have_common_aliases_p (may_aliases1, may_aliases2))
2433 add_may_alias (tag1, tag2);
2436 timevar_pop (TV_FLOW_INSENSITIVE);
2440 /* Create a new alias set entry for VAR in AI->ADDRESSABLE_VARS. */
2443 create_alias_map_for (tree var, struct alias_info *ai)
2445 struct alias_map_d *alias_map;
2446 alias_map = XCNEW (struct alias_map_d);
2447 alias_map->var = var;
2448 alias_map->set = get_alias_set (var);
2449 ai->addressable_vars[ai->num_addressable_vars++] = alias_map;
2453 /* Create memory tags for all the dereferenced pointers and build the
2454 ADDRESSABLE_VARS and POINTERS arrays used for building the may-alias
2455 sets. Based on the address escape and points-to information collected
2456 earlier, this pass will also clear the TREE_ADDRESSABLE flag from those
2457 variables whose address is not needed anymore. */
2460 setup_pointers_and_addressables (struct alias_info *ai)
2462 size_t num_addressable_vars, num_pointers;
2463 referenced_var_iterator rvi;
2465 VEC (tree, heap) *varvec = NULL;
2466 safe_referenced_var_iterator srvi;
2468 /* Size up the arrays ADDRESSABLE_VARS and POINTERS. */
2469 num_addressable_vars = num_pointers = 0;
2471 FOR_EACH_REFERENCED_VAR (var, rvi)
2473 if (may_be_aliased (var))
2474 num_addressable_vars++;
2476 if (POINTER_TYPE_P (TREE_TYPE (var)))
2478 /* Since we don't keep track of volatile variables, assume that
2479 these pointers are used in indirect store operations. */
2480 if (TREE_THIS_VOLATILE (var))
2481 pointer_set_insert (ai->dereferenced_ptrs_store, var);
2487 /* Create ADDRESSABLE_VARS and POINTERS. Note that these arrays are
2488 always going to be slightly bigger than we actually need them
2489 because some TREE_ADDRESSABLE variables will be marked
2490 non-addressable below and only pointers with unique symbol tags are
2491 going to be added to POINTERS. */
2492 ai->addressable_vars = XCNEWVEC (struct alias_map_d *, num_addressable_vars);
2493 ai->pointers = XCNEWVEC (struct alias_map_d *, num_pointers);
2494 ai->num_addressable_vars = 0;
2495 ai->num_pointers = 0;
2497 FOR_EACH_REFERENCED_VAR_SAFE (var, varvec, srvi)
2499 /* Name memory tags already have flow-sensitive aliasing
2500 information, so they need not be processed by
2501 compute_flow_insensitive_aliasing. Similarly, symbol memory
2502 tags are already accounted for when we process their
2505 Structure fields, on the other hand, have to have some of this
2506 information processed for them, but it's pointless to mark them
2507 non-addressable (since they are fake variables anyway). */
2511 /* Remove the ADDRESSABLE flag from every addressable variable whose
2512 address is not needed anymore. This is caused by the propagation
2513 of ADDR_EXPR constants into INDIRECT_REF expressions and the
2514 removal of dead pointer assignments done by the early scalar
2516 if (TREE_ADDRESSABLE (var))
2518 if (!bitmap_bit_p (gimple_addressable_vars (cfun), DECL_UID (var))
2519 && TREE_CODE (var) != RESULT_DECL
2520 && !is_global_var (var))
2522 bool okay_to_mark = true;
2524 /* Since VAR is now a regular GIMPLE register, we will need
2525 to rename VAR into SSA afterwards. */
2526 mark_sym_for_renaming (var);
2528 /* The address of VAR is not needed, remove the
2529 addressable bit, so that it can be optimized as a
2530 regular variable. */
2533 /* The memory partition holding VAR will no longer
2534 contain VAR, and statements referencing it will need
2536 if (memory_partition (var))
2537 mark_sym_for_renaming (memory_partition (var));
2539 mark_non_addressable (var);
2544 /* Global variables and addressable locals may be aliased. Create an
2545 entry in ADDRESSABLE_VARS for VAR. */
2546 if (may_be_aliased (var))
2548 create_alias_map_for (var, ai);
2549 mark_sym_for_renaming (var);
2552 /* Add pointer variables that have been dereferenced to the POINTERS
2553 array and create a symbol memory tag for them. */
2554 if (POINTER_TYPE_P (TREE_TYPE (var)))
2556 if ((pointer_set_contains (ai->dereferenced_ptrs_store, var)
2557 || pointer_set_contains (ai->dereferenced_ptrs_load, var)))
2562 /* If pointer VAR still doesn't have a memory tag
2563 associated with it, create it now or re-use an
2565 tag = get_smt_for (var, ai);
2566 t_ann = var_ann (tag);
2568 /* The symbol tag will need to be renamed into SSA
2569 afterwards. Note that we cannot do this inside
2570 get_smt_for because aliasing may run multiple times
2571 and we only create symbol tags the first time. */
2572 mark_sym_for_renaming (tag);
2574 /* Similarly, if pointer VAR used to have another type
2575 tag, we will need to process it in the renamer to
2576 remove the stale virtual operands. */
2577 old_tag = symbol_mem_tag (var);
2579 mark_sym_for_renaming (old_tag);
2581 /* Associate the tag with pointer VAR. */
2582 set_symbol_mem_tag (var, tag);
2584 /* If pointer VAR has been used in a store operation,
2585 then its memory tag must be marked as written-to. */
2586 if (pointer_set_contains (ai->dereferenced_ptrs_store, var))
2587 pointer_set_insert (ai->written_vars, tag);
2591 /* The pointer has not been dereferenced. If it had a
2592 symbol memory tag, remove it and mark the old tag for
2593 renaming to remove it out of the IL. */
2594 tree tag = symbol_mem_tag (var);
2597 mark_sym_for_renaming (tag);
2598 set_symbol_mem_tag (var, NULL_TREE);
2604 VEC_free (tree, heap, varvec);
2608 /* Determine whether to use .GLOBAL_VAR to model call clobbering
2609 semantics. If the function makes no references to global
2610 variables and contains at least one call to a non-pure function,
2611 then we need to mark the side-effects of the call using .GLOBAL_VAR
2612 to represent all possible global memory referenced by the callee. */
2615 maybe_create_global_var (void)
2617 /* No need to create it, if we have one already. */
2618 if (gimple_global_var (cfun) == NULL_TREE)
2620 struct mem_ref_stats_d *stats = gimple_mem_ref_stats (cfun);
2622 /* Create .GLOBAL_VAR if there are no call-clobbered
2623 variables and the program contains a mixture of pure/const
2624 and regular function calls. This is to avoid the problem
2625 described in PR 20115:
2628 int func_pure (void) { return X; }
2629 int func_non_pure (int a) { X += a; }
2632 int a = func_pure ();
2638 Since foo() has no call-clobbered variables, there is
2639 no relationship between the calls to func_pure and
2640 func_non_pure. Since func_pure has no side-effects, value
2641 numbering optimizations elide the second call to func_pure.
2642 So, if we have some pure/const and some regular calls in the
2643 program we create .GLOBAL_VAR to avoid missing these
2645 if (bitmap_empty_p (gimple_call_clobbered_vars (cfun))
2646 && stats->num_call_sites > 0
2647 && stats->num_pure_const_call_sites > 0
2648 && stats->num_call_sites > stats->num_pure_const_call_sites)
2649 create_global_var ();
2654 /* Return TRUE if pointer PTR may point to variable VAR.
2656 MEM_ALIAS_SET is the alias set for the memory location pointed-to by PTR
2657 This is needed because when checking for type conflicts we are
2658 interested in the alias set of the memory location pointed-to by
2659 PTR. The alias set of PTR itself is irrelevant.
2661 VAR_ALIAS_SET is the alias set for VAR. */
2664 may_alias_p (tree ptr, alias_set_type mem_alias_set,
2665 tree var, alias_set_type var_alias_set,
2666 bool alias_set_only)
2670 alias_stats.alias_queries++;
2671 alias_stats.simple_queries++;
2673 /* By convention, a variable cannot alias itself. */
2674 mem = symbol_mem_tag (ptr);
2677 alias_stats.alias_noalias++;
2678 alias_stats.simple_resolved++;
2682 /* If -fargument-noalias-global is > 2, pointer arguments may
2683 not point to anything else. */
2684 if (flag_argument_noalias > 2 && TREE_CODE (ptr) == PARM_DECL)
2686 alias_stats.alias_noalias++;
2687 alias_stats.simple_resolved++;
2691 /* If -fargument-noalias-global is > 1, pointer arguments may
2692 not point to global variables. */
2693 if (flag_argument_noalias > 1 && is_global_var (var)
2694 && TREE_CODE (ptr) == PARM_DECL)
2696 alias_stats.alias_noalias++;
2697 alias_stats.simple_resolved++;
2701 /* If either MEM or VAR is a read-only global and the other one
2702 isn't, then PTR cannot point to VAR. */
2703 if ((unmodifiable_var_p (mem) && !unmodifiable_var_p (var))
2704 || (unmodifiable_var_p (var) && !unmodifiable_var_p (mem)))
2706 alias_stats.alias_noalias++;
2707 alias_stats.simple_resolved++;
2711 /* If the pointed to memory has alias set zero, or the pointer
2712 is ref-all, or the pointer decl is marked that no TBAA is to
2713 be applied, the MEM can alias VAR. */
2714 if (mem_alias_set == 0
2715 || DECL_POINTER_ALIAS_SET (ptr) == 0
2716 || TYPE_REF_CAN_ALIAS_ALL (TREE_TYPE (ptr))
2717 || DECL_NO_TBAA_P (ptr))
2719 alias_stats.alias_mayalias++;
2720 alias_stats.simple_resolved++;
2724 gcc_assert (TREE_CODE (mem) == SYMBOL_MEMORY_TAG);
2726 alias_stats.tbaa_queries++;
2728 /* If the alias sets don't conflict then MEM cannot alias VAR. */
2729 if (mem_alias_set != var_alias_set
2730 && !alias_set_subset_of (mem_alias_set, var_alias_set))
2732 alias_stats.alias_noalias++;
2733 alias_stats.tbaa_resolved++;
2737 /* If VAR is a record or union type, PTR cannot point into VAR
2738 unless there is some explicit address operation in the
2739 program that can reference a field of the type pointed-to by
2740 PTR. This also assumes that the types of both VAR and PTR
2741 are contained within the compilation unit, and that there is
2742 no fancy addressing arithmetic associated with any of the
2744 if (mem_alias_set != 0 && var_alias_set != 0)
2746 tree ptr_type = TREE_TYPE (ptr);
2747 tree var_type = TREE_TYPE (var);
2749 /* The star count is -1 if the type at the end of the
2750 pointer_to chain is not a record or union type. */
2752 && ipa_type_escape_star_count_of_interesting_type (var_type) >= 0)
2754 int ptr_star_count = 0;
2756 /* ipa_type_escape_star_count_of_interesting_type is a
2757 little too restrictive for the pointer type, need to
2758 allow pointers to primitive types as long as those
2759 types cannot be pointers to everything. */
2760 while (POINTER_TYPE_P (ptr_type))
2762 /* Strip the *s off. */
2763 ptr_type = TREE_TYPE (ptr_type);
2767 /* There does not appear to be a better test to see if
2768 the pointer type was one of the pointer to everything
2770 if (ptr_star_count > 0)
2772 alias_stats.structnoaddress_queries++;
2773 if (ipa_type_escape_field_does_not_clobber_p (var_type,
2776 alias_stats.structnoaddress_resolved++;
2777 alias_stats.alias_noalias++;
2781 else if (ptr_star_count == 0)
2783 /* If PTR_TYPE was not really a pointer to type, it cannot
2785 alias_stats.structnoaddress_queries++;
2786 alias_stats.structnoaddress_resolved++;
2787 alias_stats.alias_noalias++;
2793 alias_stats.alias_mayalias++;
2798 /* Add ALIAS to the set of variables that may alias VAR. */
2801 add_may_alias (tree var, tree alias)
2803 /* Don't allow self-referential aliases. */
2804 gcc_assert (var != alias);
2806 /* ALIAS must be addressable if it's being added to an alias set. */
2808 TREE_ADDRESSABLE (alias) = 1;
2810 gcc_assert (may_be_aliased (alias));
2813 /* VAR must be a symbol or a name tag. */
2814 gcc_assert (TREE_CODE (var) == SYMBOL_MEMORY_TAG
2815 || TREE_CODE (var) == NAME_MEMORY_TAG);
2817 if (MTAG_ALIASES (var) == NULL)
2818 MTAG_ALIASES (var) = BITMAP_ALLOC (&alias_bitmap_obstack);
2820 bitmap_set_bit (MTAG_ALIASES (var), DECL_UID (alias));
2824 /* Mark pointer PTR as pointing to an arbitrary memory location. */
2827 set_pt_anything (tree ptr)
2829 struct ptr_info_def *pi = get_ptr_info (ptr);
2831 pi->pt_anything = 1;
2834 /* The pointer used to have a name tag, but we now found it pointing
2835 to an arbitrary location. The name tag needs to be renamed and
2836 disassociated from PTR. */
2837 if (pi->name_mem_tag)
2839 mark_sym_for_renaming (pi->name_mem_tag);
2840 pi->name_mem_tag = NULL_TREE;
2845 /* Return true if STMT is an "escape" site from the current function. Escape
2846 sites those statements which might expose the address of a variable
2847 outside the current function. STMT is an escape site iff:
2849 1- STMT is a function call, or
2850 2- STMT is an __asm__ expression, or
2851 3- STMT is an assignment to a non-local variable, or
2852 4- STMT is a return statement.
2854 Return the type of escape site found, if we found one, or NO_ESCAPE
2858 is_escape_site (tree stmt)
2860 tree call = get_call_expr_in (stmt);
2861 if (call != NULL_TREE)
2863 if (!TREE_SIDE_EFFECTS (call))
2864 return ESCAPE_TO_PURE_CONST;
2866 return ESCAPE_TO_CALL;
2868 else if (TREE_CODE (stmt) == ASM_EXPR)
2869 return ESCAPE_TO_ASM;
2870 else if (TREE_CODE (stmt) == GIMPLE_MODIFY_STMT)
2872 tree lhs = GIMPLE_STMT_OPERAND (stmt, 0);
2874 /* Get to the base of _REF nodes. */
2875 if (TREE_CODE (lhs) != SSA_NAME)
2876 lhs = get_base_address (lhs);
2878 /* If we couldn't recognize the LHS of the assignment, assume that it
2879 is a non-local store. */
2880 if (lhs == NULL_TREE)
2881 return ESCAPE_UNKNOWN;
2883 if (CONVERT_EXPR_P (GIMPLE_STMT_OPERAND (stmt, 1))
2884 || TREE_CODE (GIMPLE_STMT_OPERAND (stmt, 1)) == VIEW_CONVERT_EXPR)
2887 = TREE_TYPE (TREE_OPERAND (GIMPLE_STMT_OPERAND (stmt, 1), 0));
2888 tree to = TREE_TYPE (GIMPLE_STMT_OPERAND (stmt, 1));
2890 /* If the RHS is a conversion between a pointer and an integer, the
2891 pointer escapes since we can't track the integer. */
2892 if (POINTER_TYPE_P (from) && !POINTER_TYPE_P (to))
2893 return ESCAPE_BAD_CAST;
2896 /* If the LHS is an SSA name, it can't possibly represent a non-local
2898 if (TREE_CODE (lhs) == SSA_NAME)
2901 /* FIXME: LHS is not an SSA_NAME. Even if it's an assignment to a
2902 local variables we cannot be sure if it will escape, because we
2903 don't have information about objects not in SSA form. Need to
2904 implement something along the lines of
2906 J.-D. Choi, M. Gupta, M. J. Serrano, V. C. Sreedhar, and S. P.
2907 Midkiff, ``Escape analysis for java,'' in Proceedings of the
2908 Conference on Object-Oriented Programming Systems, Languages, and
2909 Applications (OOPSLA), pp. 1-19, 1999. */
2910 return ESCAPE_STORED_IN_GLOBAL;
2912 else if (TREE_CODE (stmt) == RETURN_EXPR)
2913 return ESCAPE_TO_RETURN;
2918 /* Create a new memory tag of type TYPE.
2919 Does NOT push it into the current binding. */
2922 create_tag_raw (enum tree_code code, tree type, const char *prefix)
2926 tmp_var = build_decl (code, create_tmp_var_name (prefix), type);
2928 /* Make the variable writable. */
2929 TREE_READONLY (tmp_var) = 0;
2931 /* It doesn't start out global. */
2932 MTAG_GLOBAL (tmp_var) = 0;
2933 TREE_STATIC (tmp_var) = 0;
2934 TREE_USED (tmp_var) = 1;
2939 /* Create a new memory tag of type TYPE. If IS_TYPE_TAG is true, the tag
2940 is considered to represent all the pointers whose pointed-to types are
2941 in the same alias set class. Otherwise, the tag represents a single
2942 SSA_NAME pointer variable. */
2945 create_memory_tag (tree type, bool is_type_tag)
2947 tree tag = create_tag_raw (is_type_tag ? SYMBOL_MEMORY_TAG : NAME_MEMORY_TAG,
2948 type, (is_type_tag) ? "SMT" : "NMT");
2950 /* By default, memory tags are local variables. Alias analysis will
2951 determine whether they should be considered globals. */
2952 DECL_CONTEXT (tag) = current_function_decl;
2954 /* Memory tags are by definition addressable. */
2955 TREE_ADDRESSABLE (tag) = 1;
2957 set_symbol_mem_tag (tag, NULL_TREE);
2959 /* Add the tag to the symbol table. */
2960 add_referenced_var (tag);
2966 /* Create a name memory tag to represent a specific SSA_NAME pointer P_i.
2967 This is used if P_i has been found to point to a specific set of
2968 variables or to a non-aliased memory location like the address returned
2969 by malloc functions. */
2972 get_nmt_for (tree ptr)
2974 struct ptr_info_def *pi = get_ptr_info (ptr);
2975 tree tag = pi->name_mem_tag;
2977 if (tag == NULL_TREE)
2978 tag = create_memory_tag (TREE_TYPE (TREE_TYPE (ptr)), false);
2983 /* Return the symbol memory tag associated to pointer PTR. A memory
2984 tag is an artificial variable that represents the memory location
2985 pointed-to by PTR. It is used to model the effects of pointer
2986 de-references on addressable variables.
2988 AI points to the data gathered during alias analysis. This
2989 function populates the array AI->POINTERS. */
2992 get_smt_for (tree ptr, struct alias_info *ai)
2996 tree tag_type = TREE_TYPE (TREE_TYPE (ptr));
2997 alias_set_type tag_set = get_alias_set (tag_type);
2999 /* To avoid creating unnecessary memory tags, only create one memory tag
3000 per alias set class. Note that it may be tempting to group
3001 memory tags based on conflicting alias sets instead of
3002 equivalence. That would be wrong because alias sets are not
3003 necessarily transitive (as demonstrated by the libstdc++ test
3004 23_containers/vector/cons/4.cc). Given three alias sets A, B, C
3005 such that conflicts (A, B) == true and conflicts (A, C) == true,
3006 it does not necessarily follow that conflicts (B, C) == true. */
3007 for (i = 0, tag = NULL_TREE; i < ai->num_pointers; i++)
3009 struct alias_map_d *curr = ai->pointers[i];
3010 tree curr_tag = symbol_mem_tag (curr->var);
3011 if (tag_set == curr->set)
3018 /* If VAR cannot alias with any of the existing memory tags, create a new
3019 tag for PTR and add it to the POINTERS array. */
3020 if (tag == NULL_TREE)
3022 struct alias_map_d *alias_map;
3024 /* If PTR did not have a symbol tag already, create a new SMT.*
3025 artificial variable representing the memory location
3026 pointed-to by PTR. */
3027 tag = symbol_mem_tag (ptr);
3028 if (tag == NULL_TREE)
3029 tag = create_memory_tag (tag_type, true);
3031 /* Add PTR to the POINTERS array. Note that we are not interested in
3032 PTR's alias set. Instead, we cache the alias set for the memory that
3034 alias_map = XCNEW (struct alias_map_d);
3035 alias_map->var = ptr;
3036 alias_map->set = tag_set;
3037 ai->pointers[ai->num_pointers++] = alias_map;
3040 /* If the pointed-to type is volatile, so is the tag. */
3041 TREE_THIS_VOLATILE (tag) |= TREE_THIS_VOLATILE (tag_type);
3043 /* Make sure that the symbol tag has the same alias set as the
3044 pointed-to type or at least accesses through the pointer will
3045 alias that set. The latter can happen after the vectorizer
3046 created pointers of vector type. */
3047 gcc_assert (tag_set == get_alias_set (tag)
3048 || alias_set_subset_of (tag_set, get_alias_set (tag)));
3054 /* Create GLOBAL_VAR, an artificial global variable to act as a
3055 representative of all the variables that may be clobbered by function
3059 create_global_var (void)
3061 tree global_var = build_decl (VAR_DECL, get_identifier (".GLOBAL_VAR"),
3063 DECL_ARTIFICIAL (global_var) = 1;
3064 TREE_READONLY (global_var) = 0;
3065 DECL_EXTERNAL (global_var) = 1;
3066 TREE_STATIC (global_var) = 1;
3067 TREE_USED (global_var) = 1;
3068 DECL_CONTEXT (global_var) = NULL_TREE;
3069 TREE_THIS_VOLATILE (global_var) = 0;
3070 TREE_ADDRESSABLE (global_var) = 0;
3072 create_var_ann (global_var);
3073 mark_call_clobbered (global_var, ESCAPE_UNKNOWN);
3074 add_referenced_var (global_var);
3075 mark_sym_for_renaming (global_var);
3076 cfun->gimple_df->global_var = global_var;
3080 /* Dump alias statistics on FILE. */
3083 dump_alias_stats (FILE *file)
3085 const char *funcname
3086 = lang_hooks.decl_printable_name (current_function_decl, 2);
3087 fprintf (file, "\nAlias statistics for %s\n\n", funcname);
3088 fprintf (file, "Total alias queries:\t%u\n", alias_stats.alias_queries);
3089 fprintf (file, "Total alias mayalias results:\t%u\n",
3090 alias_stats.alias_mayalias);
3091 fprintf (file, "Total alias noalias results:\t%u\n",
3092 alias_stats.alias_noalias);
3093 fprintf (file, "Total simple queries:\t%u\n",
3094 alias_stats.simple_queries);
3095 fprintf (file, "Total simple resolved:\t%u\n",
3096 alias_stats.simple_resolved);
3097 fprintf (file, "Total TBAA queries:\t%u\n",
3098 alias_stats.tbaa_queries);
3099 fprintf (file, "Total TBAA resolved:\t%u\n",
3100 alias_stats.tbaa_resolved);
3101 fprintf (file, "Total non-addressable structure type queries:\t%u\n",
3102 alias_stats.structnoaddress_queries);
3103 fprintf (file, "Total non-addressable structure type resolved:\t%u\n",
3104 alias_stats.structnoaddress_resolved);
3108 /* Dump alias information on FILE. */
3111 dump_alias_info (FILE *file)
3114 const char *funcname
3115 = lang_hooks.decl_printable_name (current_function_decl, 2);
3116 referenced_var_iterator rvi;
3119 fprintf (file, "\nAlias information for %s\n\n", funcname);
3121 dump_memory_partitions (file);
3123 fprintf (file, "\nFlow-insensitive alias information for %s\n\n", funcname);
3125 fprintf (file, "Aliased symbols\n\n");
3127 FOR_EACH_REFERENCED_VAR (var, rvi)
3129 if (may_be_aliased (var))
3130 dump_variable (file, var);
3133 fprintf (file, "\nDereferenced pointers\n\n");
3135 FOR_EACH_REFERENCED_VAR (var, rvi)
3136 if (symbol_mem_tag (var))
3137 dump_variable (file, var);
3139 fprintf (file, "\nSymbol memory tags\n\n");
3141 FOR_EACH_REFERENCED_VAR (var, rvi)
3143 if (TREE_CODE (var) == SYMBOL_MEMORY_TAG)
3144 dump_variable (file, var);
3147 fprintf (file, "\n\nFlow-sensitive alias information for %s\n\n", funcname);
3149 fprintf (file, "SSA_NAME pointers\n\n");
3150 for (i = 1; i < num_ssa_names; i++)
3152 tree ptr = ssa_name (i);
3153 struct ptr_info_def *pi;
3155 if (ptr == NULL_TREE)
3158 pi = SSA_NAME_PTR_INFO (ptr);
3159 if (!SSA_NAME_IN_FREE_LIST (ptr)
3161 && pi->name_mem_tag)
3162 dump_points_to_info_for (file, ptr);
3165 fprintf (file, "\nName memory tags\n\n");
3167 FOR_EACH_REFERENCED_VAR (var, rvi)
3169 if (TREE_CODE (var) == NAME_MEMORY_TAG)
3170 dump_variable (file, var);
3173 fprintf (file, "\n");
3177 /* Dump alias information on stderr. */
3180 debug_alias_info (void)
3182 dump_alias_info (stderr);
3186 /* Return the alias information associated with pointer T. It creates a
3187 new instance if none existed. */
3189 struct ptr_info_def *
3190 get_ptr_info (tree t)
3192 struct ptr_info_def *pi;
3194 gcc_assert (POINTER_TYPE_P (TREE_TYPE (t)));
3196 pi = SSA_NAME_PTR_INFO (t);
3199 pi = GGC_CNEW (struct ptr_info_def);
3200 SSA_NAME_PTR_INFO (t) = pi;
3207 /* Dump points-to information for SSA_NAME PTR into FILE. */
3210 dump_points_to_info_for (FILE *file, tree ptr)
3212 struct ptr_info_def *pi = SSA_NAME_PTR_INFO (ptr);
3214 print_generic_expr (file, ptr, dump_flags);
3218 if (pi->name_mem_tag)
3220 fprintf (file, ", name memory tag: ");
3221 print_generic_expr (file, pi->name_mem_tag, dump_flags);
3224 if (pi->is_dereferenced)
3225 fprintf (file, ", is dereferenced");
3227 if (pi->value_escapes_p)
3228 fprintf (file, ", its value escapes");
3230 if (pi->pt_anything)
3231 fprintf (file, ", points-to anything");
3234 fprintf (file, ", points-to NULL");
3238 fprintf (file, ", points-to vars: ");
3239 dump_decl_set (file, pi->pt_vars);
3243 fprintf (file, "\n");
3247 /* Dump points-to information for VAR into stderr. */
3250 debug_points_to_info_for (tree var)
3252 dump_points_to_info_for (stderr, var);
3256 /* Dump points-to information into FILE. NOTE: This function is slow, as
3257 it needs to traverse the whole CFG looking for pointer SSA_NAMEs. */
3260 dump_points_to_info (FILE *file)
3263 block_stmt_iterator si;
3266 lang_hooks.decl_printable_name (current_function_decl, 2);
3267 referenced_var_iterator rvi;
3270 fprintf (file, "\n\nPointed-to sets for pointers in %s\n\n", fname);
3272 /* First dump points-to information for the default definitions of
3273 pointer variables. This is necessary because default definitions are
3274 not part of the code. */
3275 FOR_EACH_REFERENCED_VAR (var, rvi)
3277 if (POINTER_TYPE_P (TREE_TYPE (var)))
3279 tree def = gimple_default_def (cfun, var);
3281 dump_points_to_info_for (file, def);
3285 /* Dump points-to information for every pointer defined in the program. */
3290 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
3292 tree ptr = PHI_RESULT (phi);
3293 if (POINTER_TYPE_P (TREE_TYPE (ptr)))
3294 dump_points_to_info_for (file, ptr);
3297 for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si))
3299 tree stmt = bsi_stmt (si);
3301 FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter, SSA_OP_DEF)
3302 if (TREE_CODE (def) == SSA_NAME
3303 && POINTER_TYPE_P (TREE_TYPE (def)))
3304 dump_points_to_info_for (file, def);
3308 fprintf (file, "\n");
3312 /* Dump points-to info pointed to by PTO into STDERR. */
3315 debug_points_to_info (void)
3317 dump_points_to_info (stderr);
3320 /* Dump to FILE the list of variables that may be aliasing VAR. */
3323 dump_may_aliases_for (FILE *file, tree var)
3327 aliases = MTAG_ALIASES (var);
3334 fprintf (file, "{ ");
3335 EXECUTE_IF_SET_IN_BITMAP (aliases, 0, i, bi)
3337 al = referenced_var (i);
3338 print_generic_expr (file, al, dump_flags);
3339 fprintf (file, " ");
3341 fprintf (file, "}");
3346 /* Dump to stderr the list of variables that may be aliasing VAR. */
3349 debug_may_aliases_for (tree var)
3351 dump_may_aliases_for (stderr, var);
3355 /* Return true if VAR may be aliased. */
3358 may_be_aliased (tree var)
3361 if (TREE_ADDRESSABLE (var))
3364 /* Globally visible variables can have their addresses taken by other
3365 translation units. */
3367 && (MTAG_GLOBAL (var) || TREE_PUBLIC (var)))
3369 else if (!MTAG_P (var)
3370 && (DECL_EXTERNAL (var) || TREE_PUBLIC (var)))
3373 /* Automatic variables can't have their addresses escape any other
3374 way. This must be after the check for global variables, as
3375 extern declarations do not have TREE_STATIC set. */
3376 if (!TREE_STATIC (var))
3379 /* If we're in unit-at-a-time mode, then we must have seen all
3380 occurrences of address-of operators, and so we can trust
3381 TREE_ADDRESSABLE. Otherwise we can only be sure the variable
3382 isn't addressable if it's local to the current function. */
3383 if (flag_unit_at_a_time)
3386 if (decl_function_context (var) == current_function_decl)
3392 /* The following is based on code in add_stmt_operand to ensure that the
3393 same defs/uses/vdefs/vuses will be found after replacing a reference
3394 to var (or ARRAY_REF to var) with an INDIRECT_REF to ptr whose value
3395 is the address of var. Return a memtag for the ptr, after adding the
3396 proper may_aliases to it (which are the aliases of var, if it has any,
3400 add_may_alias_for_new_tag (tree tag, tree var)
3402 bitmap aliases = NULL;
3405 aliases = may_aliases (var);
3407 /* Case 1: |aliases| == 1 */
3409 && bitmap_single_bit_set_p (aliases))
3411 tree ali = referenced_var (bitmap_first_set_bit (aliases));
3412 if (TREE_CODE (ali) == SYMBOL_MEMORY_TAG)
3416 /* Case 2: |aliases| == 0 */
3417 if (aliases == NULL)
3418 add_may_alias (tag, var);
3421 /* Case 3: |aliases| > 1 */
3422 union_alias_set_into (tag, aliases);
3427 /* Create a new symbol tag for PTR. Construct the may-alias list of
3428 this type tag so that it has the aliasing of VAR according to the
3429 location accessed by EXPR.
3431 Note, the set of aliases represented by the new symbol tag are not
3432 marked for renaming. */
3435 new_type_alias (tree ptr, tree var, tree expr)
3437 tree tag_type = TREE_TYPE (TREE_TYPE (ptr));
3439 tree ali = NULL_TREE;
3440 HOST_WIDE_INT offset, size, maxsize;
3443 gcc_assert (symbol_mem_tag (ptr) == NULL_TREE);
3444 gcc_assert (!MTAG_P (var));
3446 ref = get_ref_base_and_extent (expr, &offset, &size, &maxsize);
3449 tag = create_memory_tag (tag_type, true);
3450 set_symbol_mem_tag (ptr, tag);
3452 ali = add_may_alias_for_new_tag (tag, var);
3454 set_symbol_mem_tag (ptr, ali);
3455 MTAG_GLOBAL (tag) = is_global_var (var);
3459 /* Reset the call_clobbered flags on our referenced vars. In
3460 theory, this only needs to be done for globals. */
3463 reset_cc_flags (void)
3466 referenced_var_iterator rvi;
3468 FOR_EACH_REFERENCED_VAR (var, rvi)
3469 var_ann (var)->call_clobbered = false;
3473 struct gimple_opt_pass pass_reset_cc_flags =
3479 reset_cc_flags, /* execute */
3482 0, /* static_pass_number */
3484 PROP_referenced_vars |PROP_cfg, /* properties_required */
3485 0, /* properties_provided */
3486 0, /* properties_destroyed */
3487 0, /* todo_flags_start */
3488 0 /* todo_flags_finish */
3493 /* A dummy pass to cause aliases to be computed via TODO_rebuild_alias. */
3495 struct gimple_opt_pass pass_build_alias =
3504 0, /* static_pass_number */
3506 PROP_cfg | PROP_ssa, /* properties_required */
3507 PROP_alias, /* properties_provided */
3508 0, /* properties_destroyed */
3509 0, /* todo_flags_start */
3510 TODO_rebuild_alias | TODO_dump_func /* todo_flags_finish */