1 /* Tree based points-to analysis
2 Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
4 Contributed by Daniel Berlin <dberlin@dberlin.org>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
32 #include "hard-reg-set.h"
33 #include "basic-block.h"
36 #include "tree-flow.h"
37 #include "tree-inline.h"
38 #include "diagnostic.h"
44 #include "tree-pass.h"
46 #include "alloc-pool.h"
47 #include "splay-tree.h"
51 #include "pointer-set.h"
53 /* The idea behind this analyzer is to generate set constraints from the
54 program, then solve the resulting constraints in order to generate the
57 Set constraints are a way of modeling program analysis problems that
58 involve sets. They consist of an inclusion constraint language,
59 describing the variables (each variable is a set) and operations that
60 are involved on the variables, and a set of rules that derive facts
61 from these operations. To solve a system of set constraints, you derive
62 all possible facts under the rules, which gives you the correct sets
65 See "Efficient Field-sensitive pointer analysis for C" by "David
66 J. Pearce and Paul H. J. Kelly and Chris Hankin, at
67 http://citeseer.ist.psu.edu/pearce04efficient.html
69 Also see "Ultra-fast Aliasing Analysis using CLA: A Million Lines
70 of C Code in a Second" by ""Nevin Heintze and Olivier Tardieu" at
71 http://citeseer.ist.psu.edu/heintze01ultrafast.html
73 There are three types of real constraint expressions, DEREF,
74 ADDRESSOF, and SCALAR. Each constraint expression consists
75 of a constraint type, a variable, and an offset.
77 SCALAR is a constraint expression type used to represent x, whether
78 it appears on the LHS or the RHS of a statement.
79 DEREF is a constraint expression type used to represent *x, whether
80 it appears on the LHS or the RHS of a statement.
81 ADDRESSOF is a constraint expression used to represent &x, whether
82 it appears on the LHS or the RHS of a statement.
84 Each pointer variable in the program is assigned an integer id, and
85 each field of a structure variable is assigned an integer id as well.
87 Structure variables are linked to their list of fields through a "next
88 field" in each variable that points to the next field in offset
90 Each variable for a structure field has
92 1. "size", that tells the size in bits of that field.
93 2. "fullsize, that tells the size in bits of the entire structure.
94 3. "offset", that tells the offset in bits from the beginning of the
95 structure to this field.
107 foo.a -> id 1, size 32, offset 0, fullsize 64, next foo.b
108 foo.b -> id 2, size 32, offset 32, fullsize 64, next NULL
109 bar -> id 3, size 32, offset 0, fullsize 32, next NULL
112 In order to solve the system of set constraints, the following is
115 1. Each constraint variable x has a solution set associated with it,
118 2. Constraints are separated into direct, copy, and complex.
119 Direct constraints are ADDRESSOF constraints that require no extra
120 processing, such as P = &Q
121 Copy constraints are those of the form P = Q.
122 Complex constraints are all the constraints involving dereferences
123 and offsets (including offsetted copies).
125 3. All direct constraints of the form P = &Q are processed, such
126 that Q is added to Sol(P)
128 4. All complex constraints for a given constraint variable are stored in a
129 linked list attached to that variable's node.
131 5. A directed graph is built out of the copy constraints. Each
132 constraint variable is a node in the graph, and an edge from
133 Q to P is added for each copy constraint of the form P = Q
135 6. The graph is then walked, and solution sets are
136 propagated along the copy edges, such that an edge from Q to P
137 causes Sol(P) <- Sol(P) union Sol(Q).
139 7. As we visit each node, all complex constraints associated with
140 that node are processed by adding appropriate copy edges to the graph, or the
141 appropriate variables to the solution set.
143 8. The process of walking the graph is iterated until no solution
146 Prior to walking the graph in steps 6 and 7, We perform static
147 cycle elimination on the constraint graph, as well
148 as off-line variable substitution.
150 TODO: Adding offsets to pointer-to-structures can be handled (IE not punted
151 on and turned into anything), but isn't. You can just see what offset
152 inside the pointed-to struct it's going to access.
154 TODO: Constant bounded arrays can be handled as if they were structs of the
155 same number of elements.
157 TODO: Modeling heap and incoming pointers becomes much better if we
158 add fields to them as we discover them, which we could do.
160 TODO: We could handle unions, but to be honest, it's probably not
161 worth the pain or slowdown. */
163 /* IPA-PTA optimizations possible.
165 When the indirect function called is ANYTHING we can add disambiguation
166 based on the function signatures (or simply the parameter count which
167 is the varinfo size). We also do not need to consider functions that
168 do not have their address taken.
170 The is_global_var bit which marks escape points is overly conservative
171 in IPA mode. Split it to is_escape_point and is_global_var - only
172 externally visible globals are escape points in IPA mode. This is
173 also needed to fix the pt_solution_includes_global predicate
174 (and thus ptr_deref_may_alias_global_p).
176 The way we introduce DECL_PT_UID to avoid fixing up all points-to
177 sets in the translation unit when we copy a DECL during inlining
178 pessimizes precision. The advantage is that the DECL_PT_UID keeps
179 compile-time and memory usage overhead low - the points-to sets
180 do not grow or get unshared as they would during a fixup phase.
181 An alternative solution is to delay IPA PTA until after all
182 inlining transformations have been applied.
184 The way we propagate clobber/use information isn't optimized.
185 It should use a new complex constraint that properly filters
186 out local variables of the callee (though that would make
187 the sets invalid after inlining). OTOH we might as well
188 admit defeat to WHOPR and simply do all the clobber/use analysis
189 and propagation after PTA finished but before we threw away
190 points-to information for memory variables. WHOPR and PTA
191 do not play along well anyway - the whole constraint solving
192 would need to be done in WPA phase and it will be very interesting
193 to apply the results to local SSA names during LTRANS phase.
195 We probably should compute a per-function unit-ESCAPE solution
196 propagating it simply like the clobber / uses solutions. The
197 solution can go alongside the non-IPA espaced solution and be
198 used to query which vars escape the unit through a function.
200 We never put function decls in points-to sets so we do not
201 keep the set of called functions for indirect calls.
203 And probably more. */
205 static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
206 htab_t heapvar_for_stmt;
208 static bool use_field_sensitive = true;
209 static int in_ipa_mode = 0;
211 /* Used for predecessor bitmaps. */
212 static bitmap_obstack predbitmap_obstack;
214 /* Used for points-to sets. */
215 static bitmap_obstack pta_obstack;
217 /* Used for oldsolution members of variables. */
218 static bitmap_obstack oldpta_obstack;
220 /* Used for per-solver-iteration bitmaps. */
221 static bitmap_obstack iteration_obstack;
223 static unsigned int create_variable_info_for (tree, const char *);
224 typedef struct constraint_graph *constraint_graph_t;
225 static void unify_nodes (constraint_graph_t, unsigned int, unsigned int, bool);
228 typedef struct constraint *constraint_t;
230 DEF_VEC_P(constraint_t);
231 DEF_VEC_ALLOC_P(constraint_t,heap);
233 #define EXECUTE_IF_IN_NONNULL_BITMAP(a, b, c, d) \
235 EXECUTE_IF_SET_IN_BITMAP (a, b, c, d)
237 static struct constraint_stats
239 unsigned int total_vars;
240 unsigned int nonpointer_vars;
241 unsigned int unified_vars_static;
242 unsigned int unified_vars_dynamic;
243 unsigned int iterations;
244 unsigned int num_edges;
245 unsigned int num_implicit_edges;
246 unsigned int points_to_sets_created;
251 /* ID of this variable */
254 /* True if this is a variable created by the constraint analysis, such as
255 heap variables and constraints we had to break up. */
256 unsigned int is_artificial_var : 1;
258 /* True if this is a special variable whose solution set should not be
260 unsigned int is_special_var : 1;
262 /* True for variables whose size is not known or variable. */
263 unsigned int is_unknown_size_var : 1;
265 /* True for (sub-)fields that represent a whole variable. */
266 unsigned int is_full_var : 1;
268 /* True if this is a heap variable. */
269 unsigned int is_heap_var : 1;
271 /* True if this is a variable tracking a restrict pointer source. */
272 unsigned int is_restrict_var : 1;
274 /* True if this field may contain pointers. */
275 unsigned int may_have_pointers : 1;
277 /* True if this field has only restrict qualified pointers. */
278 unsigned int only_restrict_pointers : 1;
280 /* True if this represents a global variable. */
281 unsigned int is_global_var : 1;
283 /* True if this represents a IPA function info. */
284 unsigned int is_fn_info : 1;
286 /* A link to the variable for the next field in this structure. */
287 struct variable_info *next;
289 /* Offset of this variable, in bits, from the base variable */
290 unsigned HOST_WIDE_INT offset;
292 /* Size of the variable, in bits. */
293 unsigned HOST_WIDE_INT size;
295 /* Full size of the base variable, in bits. */
296 unsigned HOST_WIDE_INT fullsize;
298 /* Name of this variable */
301 /* Tree that this variable is associated with. */
304 /* Points-to set for this variable. */
307 /* Old points-to set for this variable. */
310 typedef struct variable_info *varinfo_t;
312 static varinfo_t first_vi_for_offset (varinfo_t, unsigned HOST_WIDE_INT);
313 static varinfo_t first_or_preceding_vi_for_offset (varinfo_t,
314 unsigned HOST_WIDE_INT);
315 static varinfo_t lookup_vi_for_tree (tree);
317 /* Pool of variable info structures. */
318 static alloc_pool variable_info_pool;
320 DEF_VEC_P(varinfo_t);
322 DEF_VEC_ALLOC_P(varinfo_t, heap);
324 /* Table of variable info structures for constraint variables.
325 Indexed directly by variable info id. */
326 static VEC(varinfo_t,heap) *varmap;
328 /* Return the varmap element N */
330 static inline varinfo_t
331 get_varinfo (unsigned int n)
333 return VEC_index (varinfo_t, varmap, n);
336 /* Static IDs for the special variables. */
337 enum { nothing_id = 0, anything_id = 1, readonly_id = 2,
338 escaped_id = 3, nonlocal_id = 4,
339 storedanything_id = 5, integer_id = 6 };
341 struct GTY(()) heapvar_map {
343 unsigned HOST_WIDE_INT offset;
347 heapvar_map_eq (const void *p1, const void *p2)
349 const struct heapvar_map *h1 = (const struct heapvar_map *)p1;
350 const struct heapvar_map *h2 = (const struct heapvar_map *)p2;
351 return (h1->map.base.from == h2->map.base.from
352 && h1->offset == h2->offset);
356 heapvar_map_hash (struct heapvar_map *h)
358 return iterative_hash_host_wide_int (h->offset,
359 htab_hash_pointer (h->map.base.from));
362 /* Lookup a heap var for FROM, and return it if we find one. */
365 heapvar_lookup (tree from, unsigned HOST_WIDE_INT offset)
367 struct heapvar_map *h, in;
368 in.map.base.from = from;
370 h = (struct heapvar_map *) htab_find_with_hash (heapvar_for_stmt, &in,
371 heapvar_map_hash (&in));
377 /* Insert a mapping FROM->TO in the heap var for statement
381 heapvar_insert (tree from, unsigned HOST_WIDE_INT offset, tree to)
383 struct heapvar_map *h;
386 h = GGC_NEW (struct heapvar_map);
387 h->map.base.from = from;
389 h->map.hash = heapvar_map_hash (h);
391 loc = htab_find_slot_with_hash (heapvar_for_stmt, h, h->map.hash, INSERT);
392 gcc_assert (*loc == NULL);
393 *(struct heapvar_map **) loc = h;
396 /* Return a new variable info structure consisting for a variable
397 named NAME, and using constraint graph node NODE. Append it
398 to the vector of variable info structures. */
401 new_var_info (tree t, const char *name)
403 unsigned index = VEC_length (varinfo_t, varmap);
404 varinfo_t ret = (varinfo_t) pool_alloc (variable_info_pool);
409 /* Vars without decl are artificial and do not have sub-variables. */
410 ret->is_artificial_var = (t == NULL_TREE);
411 ret->is_special_var = false;
412 ret->is_unknown_size_var = false;
413 ret->is_full_var = (t == NULL_TREE);
414 ret->is_heap_var = false;
415 ret->is_restrict_var = false;
416 ret->may_have_pointers = true;
417 ret->only_restrict_pointers = false;
418 ret->is_global_var = (t == NULL_TREE);
419 ret->is_fn_info = false;
421 ret->is_global_var = is_global_var (t);
422 ret->solution = BITMAP_ALLOC (&pta_obstack);
423 ret->oldsolution = BITMAP_ALLOC (&oldpta_obstack);
428 VEC_safe_push (varinfo_t, heap, varmap, ret);
434 /* A map mapping call statements to per-stmt variables for uses
435 and clobbers specific to the call. */
436 struct pointer_map_t *call_stmt_vars;
438 /* Lookup or create the variable for the call statement CALL. */
441 get_call_vi (gimple call)
446 slot_p = pointer_map_insert (call_stmt_vars, call);
448 return (varinfo_t) *slot_p;
450 vi = new_var_info (NULL_TREE, "CALLUSED");
454 vi->is_full_var = true;
456 vi->next = vi2 = new_var_info (NULL_TREE, "CALLCLOBBERED");
460 vi2->is_full_var = true;
462 *slot_p = (void *) vi;
466 /* Lookup the variable for the call statement CALL representing
467 the uses. Returns NULL if there is nothing special about this call. */
470 lookup_call_use_vi (gimple call)
474 slot_p = pointer_map_contains (call_stmt_vars, call);
476 return (varinfo_t) *slot_p;
481 /* Lookup the variable for the call statement CALL representing
482 the clobbers. Returns NULL if there is nothing special about this call. */
485 lookup_call_clobber_vi (gimple call)
487 varinfo_t uses = lookup_call_use_vi (call);
494 /* Lookup or create the variable for the call statement CALL representing
498 get_call_use_vi (gimple call)
500 return get_call_vi (call);
503 /* Lookup or create the variable for the call statement CALL representing
506 static varinfo_t ATTRIBUTE_UNUSED
507 get_call_clobber_vi (gimple call)
509 return get_call_vi (call)->next;
513 typedef enum {SCALAR, DEREF, ADDRESSOF} constraint_expr_type;
515 /* An expression that appears in a constraint. */
517 struct constraint_expr
519 /* Constraint type. */
520 constraint_expr_type type;
522 /* Variable we are referring to in the constraint. */
525 /* Offset, in bits, of this constraint from the beginning of
526 variables it ends up referring to.
528 IOW, in a deref constraint, we would deref, get the result set,
529 then add OFFSET to each member. */
530 HOST_WIDE_INT offset;
533 /* Use 0x8000... as special unknown offset. */
534 #define UNKNOWN_OFFSET ((HOST_WIDE_INT)-1 << (HOST_BITS_PER_WIDE_INT-1))
536 typedef struct constraint_expr ce_s;
538 DEF_VEC_ALLOC_O(ce_s, heap);
539 static void get_constraint_for_1 (tree, VEC(ce_s, heap) **, bool);
540 static void get_constraint_for (tree, VEC(ce_s, heap) **);
541 static void do_deref (VEC (ce_s, heap) **);
543 /* Our set constraints are made up of two constraint expressions, one
546 As described in the introduction, our set constraints each represent an
547 operation between set valued variables.
551 struct constraint_expr lhs;
552 struct constraint_expr rhs;
555 /* List of constraints that we use to build the constraint graph from. */
557 static VEC(constraint_t,heap) *constraints;
558 static alloc_pool constraint_pool;
560 /* The constraint graph is represented as an array of bitmaps
561 containing successor nodes. */
563 struct constraint_graph
565 /* Size of this graph, which may be different than the number of
566 nodes in the variable map. */
569 /* Explicit successors of each node. */
572 /* Implicit predecessors of each node (Used for variable
574 bitmap *implicit_preds;
576 /* Explicit predecessors of each node (Used for variable substitution). */
579 /* Indirect cycle representatives, or -1 if the node has no indirect
581 int *indirect_cycles;
583 /* Representative node for a node. rep[a] == a unless the node has
587 /* Equivalence class representative for a label. This is used for
588 variable substitution. */
591 /* Pointer equivalence label for a node. All nodes with the same
592 pointer equivalence label can be unified together at some point
593 (either during constraint optimization or after the constraint
597 /* Pointer equivalence representative for a label. This is used to
598 handle nodes that are pointer equivalent but not location
599 equivalent. We can unite these once the addressof constraints
600 are transformed into initial points-to sets. */
603 /* Pointer equivalence label for each node, used during variable
605 unsigned int *pointer_label;
607 /* Location equivalence label for each node, used during location
608 equivalence finding. */
609 unsigned int *loc_label;
611 /* Pointed-by set for each node, used during location equivalence
612 finding. This is pointed-by rather than pointed-to, because it
613 is constructed using the predecessor graph. */
616 /* Points to sets for pointer equivalence. This is *not* the actual
617 points-to sets for nodes. */
620 /* Bitmap of nodes where the bit is set if the node is a direct
621 node. Used for variable substitution. */
622 sbitmap direct_nodes;
624 /* Bitmap of nodes where the bit is set if the node is address
625 taken. Used for variable substitution. */
626 bitmap address_taken;
628 /* Vector of complex constraints for each graph node. Complex
629 constraints are those involving dereferences or offsets that are
631 VEC(constraint_t,heap) **complex;
634 static constraint_graph_t graph;
636 /* During variable substitution and the offline version of indirect
637 cycle finding, we create nodes to represent dereferences and
638 address taken constraints. These represent where these start and
640 #define FIRST_REF_NODE (VEC_length (varinfo_t, varmap))
641 #define LAST_REF_NODE (FIRST_REF_NODE + (FIRST_REF_NODE - 1))
643 /* Return the representative node for NODE, if NODE has been unioned
645 This function performs path compression along the way to finding
646 the representative. */
649 find (unsigned int node)
651 gcc_assert (node < graph->size);
652 if (graph->rep[node] != node)
653 return graph->rep[node] = find (graph->rep[node]);
657 /* Union the TO and FROM nodes to the TO nodes.
658 Note that at some point in the future, we may want to do
659 union-by-rank, in which case we are going to have to return the
660 node we unified to. */
663 unite (unsigned int to, unsigned int from)
665 gcc_assert (to < graph->size && from < graph->size);
666 if (to != from && graph->rep[from] != to)
668 graph->rep[from] = to;
674 /* Create a new constraint consisting of LHS and RHS expressions. */
677 new_constraint (const struct constraint_expr lhs,
678 const struct constraint_expr rhs)
680 constraint_t ret = (constraint_t) pool_alloc (constraint_pool);
686 /* Print out constraint C to FILE. */
689 dump_constraint (FILE *file, constraint_t c)
691 if (c->lhs.type == ADDRESSOF)
693 else if (c->lhs.type == DEREF)
695 fprintf (file, "%s", get_varinfo (c->lhs.var)->name);
696 if (c->lhs.offset == UNKNOWN_OFFSET)
697 fprintf (file, " + UNKNOWN");
698 else if (c->lhs.offset != 0)
699 fprintf (file, " + " HOST_WIDE_INT_PRINT_DEC, c->lhs.offset);
700 fprintf (file, " = ");
701 if (c->rhs.type == ADDRESSOF)
703 else if (c->rhs.type == DEREF)
705 fprintf (file, "%s", get_varinfo (c->rhs.var)->name);
706 if (c->rhs.offset == UNKNOWN_OFFSET)
707 fprintf (file, " + UNKNOWN");
708 else if (c->rhs.offset != 0)
709 fprintf (file, " + " HOST_WIDE_INT_PRINT_DEC, c->rhs.offset);
710 fprintf (file, "\n");
714 void debug_constraint (constraint_t);
715 void debug_constraints (void);
716 void debug_constraint_graph (void);
717 void debug_solution_for_var (unsigned int);
718 void debug_sa_points_to_info (void);
720 /* Print out constraint C to stderr. */
723 debug_constraint (constraint_t c)
725 dump_constraint (stderr, c);
728 /* Print out all constraints to FILE */
731 dump_constraints (FILE *file, int from)
735 for (i = from; VEC_iterate (constraint_t, constraints, i, c); i++)
736 dump_constraint (file, c);
739 /* Print out all constraints to stderr. */
742 debug_constraints (void)
744 dump_constraints (stderr, 0);
747 /* Print out to FILE the edge in the constraint graph that is created by
748 constraint c. The edge may have a label, depending on the type of
749 constraint that it represents. If complex1, e.g: a = *b, then the label
750 is "=*", if complex2, e.g: *a = b, then the label is "*=", if
751 complex with an offset, e.g: a = b + 8, then the label is "+".
752 Otherwise the edge has no label. */
755 dump_constraint_edge (FILE *file, constraint_t c)
757 if (c->rhs.type != ADDRESSOF)
759 const char *src = get_varinfo (c->rhs.var)->name;
760 const char *dst = get_varinfo (c->lhs.var)->name;
761 fprintf (file, " \"%s\" -> \"%s\" ", src, dst);
762 /* Due to preprocessing of constraints, instructions like *a = *b are
763 illegal; thus, we do not have to handle such cases. */
764 if (c->lhs.type == DEREF)
765 fprintf (file, " [ label=\"*=\" ] ;\n");
766 else if (c->rhs.type == DEREF)
767 fprintf (file, " [ label=\"=*\" ] ;\n");
770 /* We must check the case where the constraint is an offset.
771 In this case, it is treated as a complex constraint. */
772 if (c->rhs.offset != c->lhs.offset)
773 fprintf (file, " [ label=\"+\" ] ;\n");
775 fprintf (file, " ;\n");
780 /* Print the constraint graph in dot format. */
783 dump_constraint_graph (FILE *file)
785 unsigned int i=0, size;
788 /* Only print the graph if it has already been initialized: */
792 /* Print the constraints used to produce the constraint graph. The
793 constraints will be printed as comments in the dot file: */
794 fprintf (file, "\n\n/* Constraints used in the constraint graph:\n");
795 dump_constraints (file, 0);
796 fprintf (file, "*/\n");
798 /* Prints the header of the dot file: */
799 fprintf (file, "\n\n// The constraint graph in dot format:\n");
800 fprintf (file, "strict digraph {\n");
801 fprintf (file, " node [\n shape = box\n ]\n");
802 fprintf (file, " edge [\n fontsize = \"12\"\n ]\n");
803 fprintf (file, "\n // List of nodes in the constraint graph:\n");
805 /* The next lines print the nodes in the graph. In order to get the
806 number of nodes in the graph, we must choose the minimum between the
807 vector VEC (varinfo_t, varmap) and graph->size. If the graph has not
808 yet been initialized, then graph->size == 0, otherwise we must only
809 read nodes that have an entry in VEC (varinfo_t, varmap). */
810 size = VEC_length (varinfo_t, varmap);
811 size = size < graph->size ? size : graph->size;
812 for (i = 0; i < size; i++)
814 const char *name = get_varinfo (graph->rep[i])->name;
815 fprintf (file, " \"%s\" ;\n", name);
818 /* Go over the list of constraints printing the edges in the constraint
820 fprintf (file, "\n // The constraint edges:\n");
821 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++)
823 dump_constraint_edge (file, c);
825 /* Prints the tail of the dot file. By now, only the closing bracket. */
826 fprintf (file, "}\n\n\n");
829 /* Print out the constraint graph to stderr. */
832 debug_constraint_graph (void)
834 dump_constraint_graph (stderr);
839 The solver is a simple worklist solver, that works on the following
842 sbitmap changed_nodes = all zeroes;
844 For each node that is not already collapsed:
846 set bit in changed nodes
848 while (changed_count > 0)
850 compute topological ordering for constraint graph
852 find and collapse cycles in the constraint graph (updating
853 changed if necessary)
855 for each node (n) in the graph in topological order:
858 Process each complex constraint associated with the node,
859 updating changed if necessary.
861 For each outgoing edge from n, propagate the solution from n to
862 the destination of the edge, updating changed as necessary.
866 /* Return true if two constraint expressions A and B are equal. */
869 constraint_expr_equal (struct constraint_expr a, struct constraint_expr b)
871 return a.type == b.type && a.var == b.var && a.offset == b.offset;
874 /* Return true if constraint expression A is less than constraint expression
875 B. This is just arbitrary, but consistent, in order to give them an
879 constraint_expr_less (struct constraint_expr a, struct constraint_expr b)
881 if (a.type == b.type)
884 return a.offset < b.offset;
886 return a.var < b.var;
889 return a.type < b.type;
892 /* Return true if constraint A is less than constraint B. This is just
893 arbitrary, but consistent, in order to give them an ordering. */
896 constraint_less (const constraint_t a, const constraint_t b)
898 if (constraint_expr_less (a->lhs, b->lhs))
900 else if (constraint_expr_less (b->lhs, a->lhs))
903 return constraint_expr_less (a->rhs, b->rhs);
906 /* Return true if two constraints A and B are equal. */
909 constraint_equal (struct constraint a, struct constraint b)
911 return constraint_expr_equal (a.lhs, b.lhs)
912 && constraint_expr_equal (a.rhs, b.rhs);
916 /* Find a constraint LOOKFOR in the sorted constraint vector VEC */
919 constraint_vec_find (VEC(constraint_t,heap) *vec,
920 struct constraint lookfor)
928 place = VEC_lower_bound (constraint_t, vec, &lookfor, constraint_less);
929 if (place >= VEC_length (constraint_t, vec))
931 found = VEC_index (constraint_t, vec, place);
932 if (!constraint_equal (*found, lookfor))
937 /* Union two constraint vectors, TO and FROM. Put the result in TO. */
940 constraint_set_union (VEC(constraint_t,heap) **to,
941 VEC(constraint_t,heap) **from)
946 for (i = 0; VEC_iterate (constraint_t, *from, i, c); i++)
948 if (constraint_vec_find (*to, *c) == NULL)
950 unsigned int place = VEC_lower_bound (constraint_t, *to, c,
952 VEC_safe_insert (constraint_t, heap, *to, place, c);
957 /* Expands the solution in SET to all sub-fields of variables included.
958 Union the expanded result into RESULT. */
961 solution_set_expand (bitmap result, bitmap set)
967 /* In a first pass record all variables we need to add all
968 sub-fields off. This avoids quadratic behavior. */
969 EXECUTE_IF_SET_IN_BITMAP (set, 0, j, bi)
971 varinfo_t v = get_varinfo (j);
972 if (v->is_artificial_var
975 v = lookup_vi_for_tree (v->decl);
977 vars = BITMAP_ALLOC (NULL);
978 bitmap_set_bit (vars, v->id);
981 /* In the second pass now do the addition to the solution and
982 to speed up solving add it to the delta as well. */
985 EXECUTE_IF_SET_IN_BITMAP (vars, 0, j, bi)
987 varinfo_t v = get_varinfo (j);
988 for (; v != NULL; v = v->next)
989 bitmap_set_bit (result, v->id);
995 /* Take a solution set SET, add OFFSET to each member of the set, and
996 overwrite SET with the result when done. */
999 solution_set_add (bitmap set, HOST_WIDE_INT offset)
1001 bitmap result = BITMAP_ALLOC (&iteration_obstack);
1005 /* If the offset is unknown we have to expand the solution to
1007 if (offset == UNKNOWN_OFFSET)
1009 solution_set_expand (set, set);
1013 EXECUTE_IF_SET_IN_BITMAP (set, 0, i, bi)
1015 varinfo_t vi = get_varinfo (i);
1017 /* If this is a variable with just one field just set its bit
1019 if (vi->is_artificial_var
1020 || vi->is_unknown_size_var
1022 bitmap_set_bit (result, i);
1025 unsigned HOST_WIDE_INT fieldoffset = vi->offset + offset;
1027 /* If the offset makes the pointer point to before the
1028 variable use offset zero for the field lookup. */
1030 && fieldoffset > vi->offset)
1034 vi = first_or_preceding_vi_for_offset (vi, fieldoffset);
1036 bitmap_set_bit (result, vi->id);
1037 /* If the result is not exactly at fieldoffset include the next
1038 field as well. See get_constraint_for_ptr_offset for more
1040 if (vi->offset != fieldoffset
1041 && vi->next != NULL)
1042 bitmap_set_bit (result, vi->next->id);
1046 bitmap_copy (set, result);
1047 BITMAP_FREE (result);
1050 /* Union solution sets TO and FROM, and add INC to each member of FROM in the
1054 set_union_with_increment (bitmap to, bitmap from, HOST_WIDE_INT inc)
1057 return bitmap_ior_into (to, from);
1063 tmp = BITMAP_ALLOC (&iteration_obstack);
1064 bitmap_copy (tmp, from);
1065 solution_set_add (tmp, inc);
1066 res = bitmap_ior_into (to, tmp);
1072 /* Insert constraint C into the list of complex constraints for graph
1076 insert_into_complex (constraint_graph_t graph,
1077 unsigned int var, constraint_t c)
1079 VEC (constraint_t, heap) *complex = graph->complex[var];
1080 unsigned int place = VEC_lower_bound (constraint_t, complex, c,
1083 /* Only insert constraints that do not already exist. */
1084 if (place >= VEC_length (constraint_t, complex)
1085 || !constraint_equal (*c, *VEC_index (constraint_t, complex, place)))
1086 VEC_safe_insert (constraint_t, heap, graph->complex[var], place, c);
1090 /* Condense two variable nodes into a single variable node, by moving
1091 all associated info from SRC to TO. */
1094 merge_node_constraints (constraint_graph_t graph, unsigned int to,
1100 gcc_assert (find (from) == to);
1102 /* Move all complex constraints from src node into to node */
1103 for (i = 0; VEC_iterate (constraint_t, graph->complex[from], i, c); i++)
1105 /* In complex constraints for node src, we may have either
1106 a = *src, and *src = a, or an offseted constraint which are
1107 always added to the rhs node's constraints. */
1109 if (c->rhs.type == DEREF)
1111 else if (c->lhs.type == DEREF)
1116 constraint_set_union (&graph->complex[to], &graph->complex[from]);
1117 VEC_free (constraint_t, heap, graph->complex[from]);
1118 graph->complex[from] = NULL;
1122 /* Remove edges involving NODE from GRAPH. */
1125 clear_edges_for_node (constraint_graph_t graph, unsigned int node)
1127 if (graph->succs[node])
1128 BITMAP_FREE (graph->succs[node]);
1131 /* Merge GRAPH nodes FROM and TO into node TO. */
1134 merge_graph_nodes (constraint_graph_t graph, unsigned int to,
1137 if (graph->indirect_cycles[from] != -1)
1139 /* If we have indirect cycles with the from node, and we have
1140 none on the to node, the to node has indirect cycles from the
1141 from node now that they are unified.
1142 If indirect cycles exist on both, unify the nodes that they
1143 are in a cycle with, since we know they are in a cycle with
1145 if (graph->indirect_cycles[to] == -1)
1146 graph->indirect_cycles[to] = graph->indirect_cycles[from];
1149 /* Merge all the successor edges. */
1150 if (graph->succs[from])
1152 if (!graph->succs[to])
1153 graph->succs[to] = BITMAP_ALLOC (&pta_obstack);
1154 bitmap_ior_into (graph->succs[to],
1155 graph->succs[from]);
1158 clear_edges_for_node (graph, from);
1162 /* Add an indirect graph edge to GRAPH, going from TO to FROM if
1163 it doesn't exist in the graph already. */
1166 add_implicit_graph_edge (constraint_graph_t graph, unsigned int to,
1172 if (!graph->implicit_preds[to])
1173 graph->implicit_preds[to] = BITMAP_ALLOC (&predbitmap_obstack);
1175 if (bitmap_set_bit (graph->implicit_preds[to], from))
1176 stats.num_implicit_edges++;
1179 /* Add a predecessor graph edge to GRAPH, going from TO to FROM if
1180 it doesn't exist in the graph already.
1181 Return false if the edge already existed, true otherwise. */
1184 add_pred_graph_edge (constraint_graph_t graph, unsigned int to,
1187 if (!graph->preds[to])
1188 graph->preds[to] = BITMAP_ALLOC (&predbitmap_obstack);
1189 bitmap_set_bit (graph->preds[to], from);
1192 /* Add a graph edge to GRAPH, going from FROM to TO if
1193 it doesn't exist in the graph already.
1194 Return false if the edge already existed, true otherwise. */
1197 add_graph_edge (constraint_graph_t graph, unsigned int to,
1208 if (!graph->succs[from])
1209 graph->succs[from] = BITMAP_ALLOC (&pta_obstack);
1210 if (bitmap_set_bit (graph->succs[from], to))
1213 if (to < FIRST_REF_NODE && from < FIRST_REF_NODE)
1221 /* Return true if {DEST.SRC} is an existing graph edge in GRAPH. */
1224 valid_graph_edge (constraint_graph_t graph, unsigned int src,
1227 return (graph->succs[dest]
1228 && bitmap_bit_p (graph->succs[dest], src));
1231 /* Initialize the constraint graph structure to contain SIZE nodes. */
1234 init_graph (unsigned int size)
1238 graph = XCNEW (struct constraint_graph);
1240 graph->succs = XCNEWVEC (bitmap, graph->size);
1241 graph->indirect_cycles = XNEWVEC (int, graph->size);
1242 graph->rep = XNEWVEC (unsigned int, graph->size);
1243 graph->complex = XCNEWVEC (VEC(constraint_t, heap) *, size);
1244 graph->pe = XCNEWVEC (unsigned int, graph->size);
1245 graph->pe_rep = XNEWVEC (int, graph->size);
1247 for (j = 0; j < graph->size; j++)
1250 graph->pe_rep[j] = -1;
1251 graph->indirect_cycles[j] = -1;
1255 /* Build the constraint graph, adding only predecessor edges right now. */
1258 build_pred_graph (void)
1264 graph->implicit_preds = XCNEWVEC (bitmap, graph->size);
1265 graph->preds = XCNEWVEC (bitmap, graph->size);
1266 graph->pointer_label = XCNEWVEC (unsigned int, graph->size);
1267 graph->loc_label = XCNEWVEC (unsigned int, graph->size);
1268 graph->pointed_by = XCNEWVEC (bitmap, graph->size);
1269 graph->points_to = XCNEWVEC (bitmap, graph->size);
1270 graph->eq_rep = XNEWVEC (int, graph->size);
1271 graph->direct_nodes = sbitmap_alloc (graph->size);
1272 graph->address_taken = BITMAP_ALLOC (&predbitmap_obstack);
1273 sbitmap_zero (graph->direct_nodes);
1275 for (j = 0; j < FIRST_REF_NODE; j++)
1277 if (!get_varinfo (j)->is_special_var)
1278 SET_BIT (graph->direct_nodes, j);
1281 for (j = 0; j < graph->size; j++)
1282 graph->eq_rep[j] = -1;
1284 for (j = 0; j < VEC_length (varinfo_t, varmap); j++)
1285 graph->indirect_cycles[j] = -1;
1287 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++)
1289 struct constraint_expr lhs = c->lhs;
1290 struct constraint_expr rhs = c->rhs;
1291 unsigned int lhsvar = lhs.var;
1292 unsigned int rhsvar = rhs.var;
1294 if (lhs.type == DEREF)
1297 if (rhs.offset == 0 && lhs.offset == 0 && rhs.type == SCALAR)
1298 add_pred_graph_edge (graph, FIRST_REF_NODE + lhsvar, rhsvar);
1300 else if (rhs.type == DEREF)
1303 if (rhs.offset == 0 && lhs.offset == 0 && lhs.type == SCALAR)
1304 add_pred_graph_edge (graph, lhsvar, FIRST_REF_NODE + rhsvar);
1306 RESET_BIT (graph->direct_nodes, lhsvar);
1308 else if (rhs.type == ADDRESSOF)
1313 if (graph->points_to[lhsvar] == NULL)
1314 graph->points_to[lhsvar] = BITMAP_ALLOC (&predbitmap_obstack);
1315 bitmap_set_bit (graph->points_to[lhsvar], rhsvar);
1317 if (graph->pointed_by[rhsvar] == NULL)
1318 graph->pointed_by[rhsvar] = BITMAP_ALLOC (&predbitmap_obstack);
1319 bitmap_set_bit (graph->pointed_by[rhsvar], lhsvar);
1321 /* Implicitly, *x = y */
1322 add_implicit_graph_edge (graph, FIRST_REF_NODE + lhsvar, rhsvar);
1324 /* All related variables are no longer direct nodes. */
1325 RESET_BIT (graph->direct_nodes, rhsvar);
1326 v = get_varinfo (rhsvar);
1327 if (!v->is_full_var)
1329 v = lookup_vi_for_tree (v->decl);
1332 RESET_BIT (graph->direct_nodes, v->id);
1337 bitmap_set_bit (graph->address_taken, rhsvar);
1339 else if (lhsvar > anything_id
1340 && lhsvar != rhsvar && lhs.offset == 0 && rhs.offset == 0)
1343 add_pred_graph_edge (graph, lhsvar, rhsvar);
1344 /* Implicitly, *x = *y */
1345 add_implicit_graph_edge (graph, FIRST_REF_NODE + lhsvar,
1346 FIRST_REF_NODE + rhsvar);
1348 else if (lhs.offset != 0 || rhs.offset != 0)
1350 if (rhs.offset != 0)
1351 RESET_BIT (graph->direct_nodes, lhs.var);
1352 else if (lhs.offset != 0)
1353 RESET_BIT (graph->direct_nodes, rhs.var);
1358 /* Build the constraint graph, adding successor edges. */
1361 build_succ_graph (void)
1366 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++)
1368 struct constraint_expr lhs;
1369 struct constraint_expr rhs;
1370 unsigned int lhsvar;
1371 unsigned int rhsvar;
1378 lhsvar = find (lhs.var);
1379 rhsvar = find (rhs.var);
1381 if (lhs.type == DEREF)
1383 if (rhs.offset == 0 && lhs.offset == 0 && rhs.type == SCALAR)
1384 add_graph_edge (graph, FIRST_REF_NODE + lhsvar, rhsvar);
1386 else if (rhs.type == DEREF)
1388 if (rhs.offset == 0 && lhs.offset == 0 && lhs.type == SCALAR)
1389 add_graph_edge (graph, lhsvar, FIRST_REF_NODE + rhsvar);
1391 else if (rhs.type == ADDRESSOF)
1394 gcc_assert (find (rhs.var) == rhs.var);
1395 bitmap_set_bit (get_varinfo (lhsvar)->solution, rhsvar);
1397 else if (lhsvar > anything_id
1398 && lhsvar != rhsvar && lhs.offset == 0 && rhs.offset == 0)
1400 add_graph_edge (graph, lhsvar, rhsvar);
1404 /* Add edges from STOREDANYTHING to all non-direct nodes that can
1405 receive pointers. */
1406 t = find (storedanything_id);
1407 for (i = integer_id + 1; i < FIRST_REF_NODE; ++i)
1409 if (!TEST_BIT (graph->direct_nodes, i)
1410 && get_varinfo (i)->may_have_pointers)
1411 add_graph_edge (graph, find (i), t);
1414 /* Everything stored to ANYTHING also potentially escapes. */
1415 add_graph_edge (graph, find (escaped_id), t);
1419 /* Changed variables on the last iteration. */
1420 static unsigned int changed_count;
1421 static sbitmap changed;
1423 /* Strongly Connected Component visitation info. */
1430 unsigned int *node_mapping;
1432 VEC(unsigned,heap) *scc_stack;
1436 /* Recursive routine to find strongly connected components in GRAPH.
1437 SI is the SCC info to store the information in, and N is the id of current
1438 graph node we are processing.
1440 This is Tarjan's strongly connected component finding algorithm, as
1441 modified by Nuutila to keep only non-root nodes on the stack.
1442 The algorithm can be found in "On finding the strongly connected
1443 connected components in a directed graph" by Esko Nuutila and Eljas
1444 Soisalon-Soininen, in Information Processing Letters volume 49,
1445 number 1, pages 9-14. */
1448 scc_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n)
1452 unsigned int my_dfs;
1454 SET_BIT (si->visited, n);
1455 si->dfs[n] = si->current_index ++;
1456 my_dfs = si->dfs[n];
1458 /* Visit all the successors. */
1459 EXECUTE_IF_IN_NONNULL_BITMAP (graph->succs[n], 0, i, bi)
1463 if (i > LAST_REF_NODE)
1467 if (TEST_BIT (si->deleted, w))
1470 if (!TEST_BIT (si->visited, w))
1471 scc_visit (graph, si, w);
1473 unsigned int t = find (w);
1474 unsigned int nnode = find (n);
1475 gcc_assert (nnode == n);
1477 if (si->dfs[t] < si->dfs[nnode])
1478 si->dfs[n] = si->dfs[t];
1482 /* See if any components have been identified. */
1483 if (si->dfs[n] == my_dfs)
1485 if (VEC_length (unsigned, si->scc_stack) > 0
1486 && si->dfs[VEC_last (unsigned, si->scc_stack)] >= my_dfs)
1488 bitmap scc = BITMAP_ALLOC (NULL);
1489 unsigned int lowest_node;
1492 bitmap_set_bit (scc, n);
1494 while (VEC_length (unsigned, si->scc_stack) != 0
1495 && si->dfs[VEC_last (unsigned, si->scc_stack)] >= my_dfs)
1497 unsigned int w = VEC_pop (unsigned, si->scc_stack);
1499 bitmap_set_bit (scc, w);
1502 lowest_node = bitmap_first_set_bit (scc);
1503 gcc_assert (lowest_node < FIRST_REF_NODE);
1505 /* Collapse the SCC nodes into a single node, and mark the
1507 EXECUTE_IF_SET_IN_BITMAP (scc, 0, i, bi)
1509 if (i < FIRST_REF_NODE)
1511 if (unite (lowest_node, i))
1512 unify_nodes (graph, lowest_node, i, false);
1516 unite (lowest_node, i);
1517 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node;
1521 SET_BIT (si->deleted, n);
1524 VEC_safe_push (unsigned, heap, si->scc_stack, n);
1527 /* Unify node FROM into node TO, updating the changed count if
1528 necessary when UPDATE_CHANGED is true. */
1531 unify_nodes (constraint_graph_t graph, unsigned int to, unsigned int from,
1532 bool update_changed)
1535 gcc_assert (to != from && find (to) == to);
1536 if (dump_file && (dump_flags & TDF_DETAILS))
1537 fprintf (dump_file, "Unifying %s to %s\n",
1538 get_varinfo (from)->name,
1539 get_varinfo (to)->name);
1542 stats.unified_vars_dynamic++;
1544 stats.unified_vars_static++;
1546 merge_graph_nodes (graph, to, from);
1547 merge_node_constraints (graph, to, from);
1549 /* Mark TO as changed if FROM was changed. If TO was already marked
1550 as changed, decrease the changed count. */
1552 if (update_changed && TEST_BIT (changed, from))
1554 RESET_BIT (changed, from);
1555 if (!TEST_BIT (changed, to))
1556 SET_BIT (changed, to);
1559 gcc_assert (changed_count > 0);
1563 if (get_varinfo (from)->solution)
1565 /* If the solution changes because of the merging, we need to mark
1566 the variable as changed. */
1567 if (bitmap_ior_into (get_varinfo (to)->solution,
1568 get_varinfo (from)->solution))
1570 if (update_changed && !TEST_BIT (changed, to))
1572 SET_BIT (changed, to);
1577 BITMAP_FREE (get_varinfo (from)->solution);
1578 BITMAP_FREE (get_varinfo (from)->oldsolution);
1580 if (stats.iterations > 0)
1582 BITMAP_FREE (get_varinfo (to)->oldsolution);
1583 get_varinfo (to)->oldsolution = BITMAP_ALLOC (&oldpta_obstack);
1586 if (valid_graph_edge (graph, to, to))
1588 if (graph->succs[to])
1589 bitmap_clear_bit (graph->succs[to], to);
1593 /* Information needed to compute the topological ordering of a graph. */
1597 /* sbitmap of visited nodes. */
1599 /* Array that stores the topological order of the graph, *in
1601 VEC(unsigned,heap) *topo_order;
1605 /* Initialize and return a topological info structure. */
1607 static struct topo_info *
1608 init_topo_info (void)
1610 size_t size = graph->size;
1611 struct topo_info *ti = XNEW (struct topo_info);
1612 ti->visited = sbitmap_alloc (size);
1613 sbitmap_zero (ti->visited);
1614 ti->topo_order = VEC_alloc (unsigned, heap, 1);
1619 /* Free the topological sort info pointed to by TI. */
1622 free_topo_info (struct topo_info *ti)
1624 sbitmap_free (ti->visited);
1625 VEC_free (unsigned, heap, ti->topo_order);
1629 /* Visit the graph in topological order, and store the order in the
1630 topo_info structure. */
1633 topo_visit (constraint_graph_t graph, struct topo_info *ti,
1639 SET_BIT (ti->visited, n);
1641 if (graph->succs[n])
1642 EXECUTE_IF_SET_IN_BITMAP (graph->succs[n], 0, j, bi)
1644 if (!TEST_BIT (ti->visited, j))
1645 topo_visit (graph, ti, j);
1648 VEC_safe_push (unsigned, heap, ti->topo_order, n);
1651 /* Process a constraint C that represents x = *(y + off), using DELTA as the
1652 starting solution for y. */
1655 do_sd_constraint (constraint_graph_t graph, constraint_t c,
1658 unsigned int lhs = c->lhs.var;
1660 bitmap sol = get_varinfo (lhs)->solution;
1663 HOST_WIDE_INT roffset = c->rhs.offset;
1665 /* Our IL does not allow this. */
1666 gcc_assert (c->lhs.offset == 0);
1668 /* If the solution of Y contains anything it is good enough to transfer
1670 if (bitmap_bit_p (delta, anything_id))
1672 flag |= bitmap_set_bit (sol, anything_id);
1676 /* If we do not know at with offset the rhs is dereferenced compute
1677 the reachability set of DELTA, conservatively assuming it is
1678 dereferenced at all valid offsets. */
1679 if (roffset == UNKNOWN_OFFSET)
1681 solution_set_expand (delta, delta);
1682 /* No further offset processing is necessary. */
1686 /* For each variable j in delta (Sol(y)), add
1687 an edge in the graph from j to x, and union Sol(j) into Sol(x). */
1688 EXECUTE_IF_SET_IN_BITMAP (delta, 0, j, bi)
1690 varinfo_t v = get_varinfo (j);
1691 HOST_WIDE_INT fieldoffset = v->offset + roffset;
1695 fieldoffset = v->offset;
1696 else if (roffset != 0)
1697 v = first_vi_for_offset (v, fieldoffset);
1698 /* If the access is outside of the variable we can ignore it. */
1706 /* Adding edges from the special vars is pointless.
1707 They don't have sets that can change. */
1708 if (get_varinfo (t)->is_special_var)
1709 flag |= bitmap_ior_into (sol, get_varinfo (t)->solution);
1710 /* Merging the solution from ESCAPED needlessly increases
1711 the set. Use ESCAPED as representative instead. */
1712 else if (v->id == escaped_id)
1713 flag |= bitmap_set_bit (sol, escaped_id);
1714 else if (v->may_have_pointers
1715 && add_graph_edge (graph, lhs, t))
1716 flag |= bitmap_ior_into (sol, get_varinfo (t)->solution);
1718 /* If the variable is not exactly at the requested offset
1719 we have to include the next one. */
1720 if (v->offset == (unsigned HOST_WIDE_INT)fieldoffset
1725 fieldoffset = v->offset;
1731 /* If the LHS solution changed, mark the var as changed. */
1734 get_varinfo (lhs)->solution = sol;
1735 if (!TEST_BIT (changed, lhs))
1737 SET_BIT (changed, lhs);
1743 /* Process a constraint C that represents *(x + off) = y using DELTA
1744 as the starting solution for x. */
1747 do_ds_constraint (constraint_t c, bitmap delta)
1749 unsigned int rhs = c->rhs.var;
1750 bitmap sol = get_varinfo (rhs)->solution;
1753 HOST_WIDE_INT loff = c->lhs.offset;
1754 bool escaped_p = false;
1756 /* Our IL does not allow this. */
1757 gcc_assert (c->rhs.offset == 0);
1759 /* If the solution of y contains ANYTHING simply use the ANYTHING
1760 solution. This avoids needlessly increasing the points-to sets. */
1761 if (bitmap_bit_p (sol, anything_id))
1762 sol = get_varinfo (find (anything_id))->solution;
1764 /* If the solution for x contains ANYTHING we have to merge the
1765 solution of y into all pointer variables which we do via
1767 if (bitmap_bit_p (delta, anything_id))
1769 unsigned t = find (storedanything_id);
1770 if (add_graph_edge (graph, t, rhs))
1772 if (bitmap_ior_into (get_varinfo (t)->solution, sol))
1774 if (!TEST_BIT (changed, t))
1776 SET_BIT (changed, t);
1784 /* If we do not know at with offset the rhs is dereferenced compute
1785 the reachability set of DELTA, conservatively assuming it is
1786 dereferenced at all valid offsets. */
1787 if (loff == UNKNOWN_OFFSET)
1789 solution_set_expand (delta, delta);
1793 /* For each member j of delta (Sol(x)), add an edge from y to j and
1794 union Sol(y) into Sol(j) */
1795 EXECUTE_IF_SET_IN_BITMAP (delta, 0, j, bi)
1797 varinfo_t v = get_varinfo (j);
1799 HOST_WIDE_INT fieldoffset = v->offset + loff;
1802 fieldoffset = v->offset;
1804 v = first_vi_for_offset (v, fieldoffset);
1805 /* If the access is outside of the variable we can ignore it. */
1811 if (v->may_have_pointers)
1813 /* If v is a global variable then this is an escape point. */
1814 if (v->is_global_var
1817 t = find (escaped_id);
1818 if (add_graph_edge (graph, t, rhs)
1819 && bitmap_ior_into (get_varinfo (t)->solution, sol)
1820 && !TEST_BIT (changed, t))
1822 SET_BIT (changed, t);
1825 /* Enough to let rhs escape once. */
1829 if (v->is_special_var)
1833 if (add_graph_edge (graph, t, rhs)
1834 && bitmap_ior_into (get_varinfo (t)->solution, sol)
1835 && !TEST_BIT (changed, t))
1837 SET_BIT (changed, t);
1842 /* If the variable is not exactly at the requested offset
1843 we have to include the next one. */
1844 if (v->offset == (unsigned HOST_WIDE_INT)fieldoffset
1849 fieldoffset = v->offset;
1855 /* Handle a non-simple (simple meaning requires no iteration),
1856 constraint (IE *x = &y, x = *y, *x = y, and x = y with offsets involved). */
1859 do_complex_constraint (constraint_graph_t graph, constraint_t c, bitmap delta)
1861 if (c->lhs.type == DEREF)
1863 if (c->rhs.type == ADDRESSOF)
1870 do_ds_constraint (c, delta);
1873 else if (c->rhs.type == DEREF)
1876 if (!(get_varinfo (c->lhs.var)->is_special_var))
1877 do_sd_constraint (graph, c, delta);
1885 gcc_assert (c->rhs.type == SCALAR && c->lhs.type == SCALAR);
1886 solution = get_varinfo (c->rhs.var)->solution;
1887 tmp = get_varinfo (c->lhs.var)->solution;
1889 flag = set_union_with_increment (tmp, solution, c->rhs.offset);
1893 get_varinfo (c->lhs.var)->solution = tmp;
1894 if (!TEST_BIT (changed, c->lhs.var))
1896 SET_BIT (changed, c->lhs.var);
1903 /* Initialize and return a new SCC info structure. */
1905 static struct scc_info *
1906 init_scc_info (size_t size)
1908 struct scc_info *si = XNEW (struct scc_info);
1911 si->current_index = 0;
1912 si->visited = sbitmap_alloc (size);
1913 sbitmap_zero (si->visited);
1914 si->deleted = sbitmap_alloc (size);
1915 sbitmap_zero (si->deleted);
1916 si->node_mapping = XNEWVEC (unsigned int, size);
1917 si->dfs = XCNEWVEC (unsigned int, size);
1919 for (i = 0; i < size; i++)
1920 si->node_mapping[i] = i;
1922 si->scc_stack = VEC_alloc (unsigned, heap, 1);
1926 /* Free an SCC info structure pointed to by SI */
1929 free_scc_info (struct scc_info *si)
1931 sbitmap_free (si->visited);
1932 sbitmap_free (si->deleted);
1933 free (si->node_mapping);
1935 VEC_free (unsigned, heap, si->scc_stack);
1940 /* Find indirect cycles in GRAPH that occur, using strongly connected
1941 components, and note them in the indirect cycles map.
1943 This technique comes from Ben Hardekopf and Calvin Lin,
1944 "It Pays to be Lazy: Fast and Accurate Pointer Analysis for Millions of
1945 Lines of Code", submitted to PLDI 2007. */
1948 find_indirect_cycles (constraint_graph_t graph)
1951 unsigned int size = graph->size;
1952 struct scc_info *si = init_scc_info (size);
1954 for (i = 0; i < MIN (LAST_REF_NODE, size); i ++ )
1955 if (!TEST_BIT (si->visited, i) && find (i) == i)
1956 scc_visit (graph, si, i);
1961 /* Compute a topological ordering for GRAPH, and store the result in the
1962 topo_info structure TI. */
1965 compute_topo_order (constraint_graph_t graph,
1966 struct topo_info *ti)
1969 unsigned int size = graph->size;
1971 for (i = 0; i != size; ++i)
1972 if (!TEST_BIT (ti->visited, i) && find (i) == i)
1973 topo_visit (graph, ti, i);
1976 /* Structure used to for hash value numbering of pointer equivalence
1979 typedef struct equiv_class_label
1982 unsigned int equivalence_class;
1984 } *equiv_class_label_t;
1985 typedef const struct equiv_class_label *const_equiv_class_label_t;
1987 /* A hashtable for mapping a bitmap of labels->pointer equivalence
1989 static htab_t pointer_equiv_class_table;
1991 /* A hashtable for mapping a bitmap of labels->location equivalence
1993 static htab_t location_equiv_class_table;
1995 /* Hash function for a equiv_class_label_t */
1998 equiv_class_label_hash (const void *p)
2000 const_equiv_class_label_t const ecl = (const_equiv_class_label_t) p;
2001 return ecl->hashcode;
2004 /* Equality function for two equiv_class_label_t's. */
2007 equiv_class_label_eq (const void *p1, const void *p2)
2009 const_equiv_class_label_t const eql1 = (const_equiv_class_label_t) p1;
2010 const_equiv_class_label_t const eql2 = (const_equiv_class_label_t) p2;
2011 return (eql1->hashcode == eql2->hashcode
2012 && bitmap_equal_p (eql1->labels, eql2->labels));
2015 /* Lookup a equivalence class in TABLE by the bitmap of LABELS it
2019 equiv_class_lookup (htab_t table, bitmap labels)
2022 struct equiv_class_label ecl;
2024 ecl.labels = labels;
2025 ecl.hashcode = bitmap_hash (labels);
2027 slot = htab_find_slot_with_hash (table, &ecl,
2028 ecl.hashcode, NO_INSERT);
2032 return ((equiv_class_label_t) *slot)->equivalence_class;
2036 /* Add an equivalence class named EQUIVALENCE_CLASS with labels LABELS
2040 equiv_class_add (htab_t table, unsigned int equivalence_class,
2044 equiv_class_label_t ecl = XNEW (struct equiv_class_label);
2046 ecl->labels = labels;
2047 ecl->equivalence_class = equivalence_class;
2048 ecl->hashcode = bitmap_hash (labels);
2050 slot = htab_find_slot_with_hash (table, ecl,
2051 ecl->hashcode, INSERT);
2052 gcc_assert (!*slot);
2053 *slot = (void *) ecl;
2056 /* Perform offline variable substitution.
2058 This is a worst case quadratic time way of identifying variables
2059 that must have equivalent points-to sets, including those caused by
2060 static cycles, and single entry subgraphs, in the constraint graph.
2062 The technique is described in "Exploiting Pointer and Location
2063 Equivalence to Optimize Pointer Analysis. In the 14th International
2064 Static Analysis Symposium (SAS), August 2007." It is known as the
2065 "HU" algorithm, and is equivalent to value numbering the collapsed
2066 constraint graph including evaluating unions.
2068 The general method of finding equivalence classes is as follows:
2069 Add fake nodes (REF nodes) and edges for *a = b and a = *b constraints.
2070 Initialize all non-REF nodes to be direct nodes.
2071 For each constraint a = a U {b}, we set pts(a) = pts(a) u {fresh
2073 For each constraint containing the dereference, we also do the same
2076 We then compute SCC's in the graph and unify nodes in the same SCC,
2079 For each non-collapsed node x:
2080 Visit all unvisited explicit incoming edges.
2081 Ignoring all non-pointers, set pts(x) = Union of pts(a) for y
2083 Lookup the equivalence class for pts(x).
2084 If we found one, equivalence_class(x) = found class.
2085 Otherwise, equivalence_class(x) = new class, and new_class is
2086 added to the lookup table.
2088 All direct nodes with the same equivalence class can be replaced
2089 with a single representative node.
2090 All unlabeled nodes (label == 0) are not pointers and all edges
2091 involving them can be eliminated.
2092 We perform these optimizations during rewrite_constraints
2094 In addition to pointer equivalence class finding, we also perform
2095 location equivalence class finding. This is the set of variables
2096 that always appear together in points-to sets. We use this to
2097 compress the size of the points-to sets. */
2099 /* Current maximum pointer equivalence class id. */
2100 static int pointer_equiv_class;
2102 /* Current maximum location equivalence class id. */
2103 static int location_equiv_class;
2105 /* Recursive routine to find strongly connected components in GRAPH,
2106 and label it's nodes with DFS numbers. */
2109 condense_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n)
2113 unsigned int my_dfs;
2115 gcc_assert (si->node_mapping[n] == n);
2116 SET_BIT (si->visited, n);
2117 si->dfs[n] = si->current_index ++;
2118 my_dfs = si->dfs[n];
2120 /* Visit all the successors. */
2121 EXECUTE_IF_IN_NONNULL_BITMAP (graph->preds[n], 0, i, bi)
2123 unsigned int w = si->node_mapping[i];
2125 if (TEST_BIT (si->deleted, w))
2128 if (!TEST_BIT (si->visited, w))
2129 condense_visit (graph, si, w);
2131 unsigned int t = si->node_mapping[w];
2132 unsigned int nnode = si->node_mapping[n];
2133 gcc_assert (nnode == n);
2135 if (si->dfs[t] < si->dfs[nnode])
2136 si->dfs[n] = si->dfs[t];
2140 /* Visit all the implicit predecessors. */
2141 EXECUTE_IF_IN_NONNULL_BITMAP (graph->implicit_preds[n], 0, i, bi)
2143 unsigned int w = si->node_mapping[i];
2145 if (TEST_BIT (si->deleted, w))
2148 if (!TEST_BIT (si->visited, w))
2149 condense_visit (graph, si, w);
2151 unsigned int t = si->node_mapping[w];
2152 unsigned int nnode = si->node_mapping[n];
2153 gcc_assert (nnode == n);
2155 if (si->dfs[t] < si->dfs[nnode])
2156 si->dfs[n] = si->dfs[t];
2160 /* See if any components have been identified. */
2161 if (si->dfs[n] == my_dfs)
2163 while (VEC_length (unsigned, si->scc_stack) != 0
2164 && si->dfs[VEC_last (unsigned, si->scc_stack)] >= my_dfs)
2166 unsigned int w = VEC_pop (unsigned, si->scc_stack);
2167 si->node_mapping[w] = n;
2169 if (!TEST_BIT (graph->direct_nodes, w))
2170 RESET_BIT (graph->direct_nodes, n);
2172 /* Unify our nodes. */
2173 if (graph->preds[w])
2175 if (!graph->preds[n])
2176 graph->preds[n] = BITMAP_ALLOC (&predbitmap_obstack);
2177 bitmap_ior_into (graph->preds[n], graph->preds[w]);
2179 if (graph->implicit_preds[w])
2181 if (!graph->implicit_preds[n])
2182 graph->implicit_preds[n] = BITMAP_ALLOC (&predbitmap_obstack);
2183 bitmap_ior_into (graph->implicit_preds[n],
2184 graph->implicit_preds[w]);
2186 if (graph->points_to[w])
2188 if (!graph->points_to[n])
2189 graph->points_to[n] = BITMAP_ALLOC (&predbitmap_obstack);
2190 bitmap_ior_into (graph->points_to[n],
2191 graph->points_to[w]);
2194 SET_BIT (si->deleted, n);
2197 VEC_safe_push (unsigned, heap, si->scc_stack, n);
2200 /* Label pointer equivalences. */
2203 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n)
2207 SET_BIT (si->visited, n);
2209 if (!graph->points_to[n])
2210 graph->points_to[n] = BITMAP_ALLOC (&predbitmap_obstack);
2212 /* Label and union our incoming edges's points to sets. */
2213 EXECUTE_IF_IN_NONNULL_BITMAP (graph->preds[n], 0, i, bi)
2215 unsigned int w = si->node_mapping[i];
2216 if (!TEST_BIT (si->visited, w))
2217 label_visit (graph, si, w);
2219 /* Skip unused edges */
2220 if (w == n || graph->pointer_label[w] == 0)
2223 if (graph->points_to[w])
2224 bitmap_ior_into(graph->points_to[n], graph->points_to[w]);
2226 /* Indirect nodes get fresh variables. */
2227 if (!TEST_BIT (graph->direct_nodes, n))
2228 bitmap_set_bit (graph->points_to[n], FIRST_REF_NODE + n);
2230 if (!bitmap_empty_p (graph->points_to[n]))
2232 unsigned int label = equiv_class_lookup (pointer_equiv_class_table,
2233 graph->points_to[n]);
2236 label = pointer_equiv_class++;
2237 equiv_class_add (pointer_equiv_class_table,
2238 label, graph->points_to[n]);
2240 graph->pointer_label[n] = label;
2244 /* Perform offline variable substitution, discovering equivalence
2245 classes, and eliminating non-pointer variables. */
2247 static struct scc_info *
2248 perform_var_substitution (constraint_graph_t graph)
2251 unsigned int size = graph->size;
2252 struct scc_info *si = init_scc_info (size);
2254 bitmap_obstack_initialize (&iteration_obstack);
2255 pointer_equiv_class_table = htab_create (511, equiv_class_label_hash,
2256 equiv_class_label_eq, free);
2257 location_equiv_class_table = htab_create (511, equiv_class_label_hash,
2258 equiv_class_label_eq, free);
2259 pointer_equiv_class = 1;
2260 location_equiv_class = 1;
2262 /* Condense the nodes, which means to find SCC's, count incoming
2263 predecessors, and unite nodes in SCC's. */
2264 for (i = 0; i < FIRST_REF_NODE; i++)
2265 if (!TEST_BIT (si->visited, si->node_mapping[i]))
2266 condense_visit (graph, si, si->node_mapping[i]);
2268 sbitmap_zero (si->visited);
2269 /* Actually the label the nodes for pointer equivalences */
2270 for (i = 0; i < FIRST_REF_NODE; i++)
2271 if (!TEST_BIT (si->visited, si->node_mapping[i]))
2272 label_visit (graph, si, si->node_mapping[i]);
2274 /* Calculate location equivalence labels. */
2275 for (i = 0; i < FIRST_REF_NODE; i++)
2282 if (!graph->pointed_by[i])
2284 pointed_by = BITMAP_ALLOC (&iteration_obstack);
2286 /* Translate the pointed-by mapping for pointer equivalence
2288 EXECUTE_IF_SET_IN_BITMAP (graph->pointed_by[i], 0, j, bi)
2290 bitmap_set_bit (pointed_by,
2291 graph->pointer_label[si->node_mapping[j]]);
2293 /* The original pointed_by is now dead. */
2294 BITMAP_FREE (graph->pointed_by[i]);
2296 /* Look up the location equivalence label if one exists, or make
2298 label = equiv_class_lookup (location_equiv_class_table,
2302 label = location_equiv_class++;
2303 equiv_class_add (location_equiv_class_table,
2308 if (dump_file && (dump_flags & TDF_DETAILS))
2309 fprintf (dump_file, "Found location equivalence for node %s\n",
2310 get_varinfo (i)->name);
2311 BITMAP_FREE (pointed_by);
2313 graph->loc_label[i] = label;
2317 if (dump_file && (dump_flags & TDF_DETAILS))
2318 for (i = 0; i < FIRST_REF_NODE; i++)
2320 bool direct_node = TEST_BIT (graph->direct_nodes, i);
2322 "Equivalence classes for %s node id %d:%s are pointer: %d"
2324 direct_node ? "Direct node" : "Indirect node", i,
2325 get_varinfo (i)->name,
2326 graph->pointer_label[si->node_mapping[i]],
2327 graph->loc_label[si->node_mapping[i]]);
2330 /* Quickly eliminate our non-pointer variables. */
2332 for (i = 0; i < FIRST_REF_NODE; i++)
2334 unsigned int node = si->node_mapping[i];
2336 if (graph->pointer_label[node] == 0)
2338 if (dump_file && (dump_flags & TDF_DETAILS))
2340 "%s is a non-pointer variable, eliminating edges.\n",
2341 get_varinfo (node)->name);
2342 stats.nonpointer_vars++;
2343 clear_edges_for_node (graph, node);
2350 /* Free information that was only necessary for variable
2354 free_var_substitution_info (struct scc_info *si)
2357 free (graph->pointer_label);
2358 free (graph->loc_label);
2359 free (graph->pointed_by);
2360 free (graph->points_to);
2361 free (graph->eq_rep);
2362 sbitmap_free (graph->direct_nodes);
2363 htab_delete (pointer_equiv_class_table);
2364 htab_delete (location_equiv_class_table);
2365 bitmap_obstack_release (&iteration_obstack);
2368 /* Return an existing node that is equivalent to NODE, which has
2369 equivalence class LABEL, if one exists. Return NODE otherwise. */
2372 find_equivalent_node (constraint_graph_t graph,
2373 unsigned int node, unsigned int label)
2375 /* If the address version of this variable is unused, we can
2376 substitute it for anything else with the same label.
2377 Otherwise, we know the pointers are equivalent, but not the
2378 locations, and we can unite them later. */
2380 if (!bitmap_bit_p (graph->address_taken, node))
2382 gcc_assert (label < graph->size);
2384 if (graph->eq_rep[label] != -1)
2386 /* Unify the two variables since we know they are equivalent. */
2387 if (unite (graph->eq_rep[label], node))
2388 unify_nodes (graph, graph->eq_rep[label], node, false);
2389 return graph->eq_rep[label];
2393 graph->eq_rep[label] = node;
2394 graph->pe_rep[label] = node;
2399 gcc_assert (label < graph->size);
2400 graph->pe[node] = label;
2401 if (graph->pe_rep[label] == -1)
2402 graph->pe_rep[label] = node;
2408 /* Unite pointer equivalent but not location equivalent nodes in
2409 GRAPH. This may only be performed once variable substitution is
2413 unite_pointer_equivalences (constraint_graph_t graph)
2417 /* Go through the pointer equivalences and unite them to their
2418 representative, if they aren't already. */
2419 for (i = 0; i < FIRST_REF_NODE; i++)
2421 unsigned int label = graph->pe[i];
2424 int label_rep = graph->pe_rep[label];
2426 if (label_rep == -1)
2429 label_rep = find (label_rep);
2430 if (label_rep >= 0 && unite (label_rep, find (i)))
2431 unify_nodes (graph, label_rep, i, false);
2436 /* Move complex constraints to the GRAPH nodes they belong to. */
2439 move_complex_constraints (constraint_graph_t graph)
2444 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++)
2448 struct constraint_expr lhs = c->lhs;
2449 struct constraint_expr rhs = c->rhs;
2451 if (lhs.type == DEREF)
2453 insert_into_complex (graph, lhs.var, c);
2455 else if (rhs.type == DEREF)
2457 if (!(get_varinfo (lhs.var)->is_special_var))
2458 insert_into_complex (graph, rhs.var, c);
2460 else if (rhs.type != ADDRESSOF && lhs.var > anything_id
2461 && (lhs.offset != 0 || rhs.offset != 0))
2463 insert_into_complex (graph, rhs.var, c);
2470 /* Optimize and rewrite complex constraints while performing
2471 collapsing of equivalent nodes. SI is the SCC_INFO that is the
2472 result of perform_variable_substitution. */
2475 rewrite_constraints (constraint_graph_t graph,
2476 struct scc_info *si)
2482 for (j = 0; j < graph->size; j++)
2483 gcc_assert (find (j) == j);
2485 for (i = 0; VEC_iterate (constraint_t, constraints, i, c); i++)
2487 struct constraint_expr lhs = c->lhs;
2488 struct constraint_expr rhs = c->rhs;
2489 unsigned int lhsvar = find (lhs.var);
2490 unsigned int rhsvar = find (rhs.var);
2491 unsigned int lhsnode, rhsnode;
2492 unsigned int lhslabel, rhslabel;
2494 lhsnode = si->node_mapping[lhsvar];
2495 rhsnode = si->node_mapping[rhsvar];
2496 lhslabel = graph->pointer_label[lhsnode];
2497 rhslabel = graph->pointer_label[rhsnode];
2499 /* See if it is really a non-pointer variable, and if so, ignore
2503 if (dump_file && (dump_flags & TDF_DETAILS))
2506 fprintf (dump_file, "%s is a non-pointer variable,"
2507 "ignoring constraint:",
2508 get_varinfo (lhs.var)->name);
2509 dump_constraint (dump_file, c);
2511 VEC_replace (constraint_t, constraints, i, NULL);
2517 if (dump_file && (dump_flags & TDF_DETAILS))
2520 fprintf (dump_file, "%s is a non-pointer variable,"
2521 "ignoring constraint:",
2522 get_varinfo (rhs.var)->name);
2523 dump_constraint (dump_file, c);
2525 VEC_replace (constraint_t, constraints, i, NULL);
2529 lhsvar = find_equivalent_node (graph, lhsvar, lhslabel);
2530 rhsvar = find_equivalent_node (graph, rhsvar, rhslabel);
2531 c->lhs.var = lhsvar;
2532 c->rhs.var = rhsvar;
2537 /* Eliminate indirect cycles involving NODE. Return true if NODE was
2538 part of an SCC, false otherwise. */
2541 eliminate_indirect_cycles (unsigned int node)
2543 if (graph->indirect_cycles[node] != -1
2544 && !bitmap_empty_p (get_varinfo (node)->solution))
2547 VEC(unsigned,heap) *queue = NULL;
2549 unsigned int to = find (graph->indirect_cycles[node]);
2552 /* We can't touch the solution set and call unify_nodes
2553 at the same time, because unify_nodes is going to do
2554 bitmap unions into it. */
2556 EXECUTE_IF_SET_IN_BITMAP (get_varinfo (node)->solution, 0, i, bi)
2558 if (find (i) == i && i != to)
2561 VEC_safe_push (unsigned, heap, queue, i);
2566 VEC_iterate (unsigned, queue, queuepos, i);
2569 unify_nodes (graph, to, i, true);
2571 VEC_free (unsigned, heap, queue);
2577 /* Solve the constraint graph GRAPH using our worklist solver.
2578 This is based on the PW* family of solvers from the "Efficient Field
2579 Sensitive Pointer Analysis for C" paper.
2580 It works by iterating over all the graph nodes, processing the complex
2581 constraints and propagating the copy constraints, until everything stops
2582 changed. This corresponds to steps 6-8 in the solving list given above. */
2585 solve_graph (constraint_graph_t graph)
2587 unsigned int size = graph->size;
2592 changed = sbitmap_alloc (size);
2593 sbitmap_zero (changed);
2595 /* Mark all initial non-collapsed nodes as changed. */
2596 for (i = 0; i < size; i++)
2598 varinfo_t ivi = get_varinfo (i);
2599 if (find (i) == i && !bitmap_empty_p (ivi->solution)
2600 && ((graph->succs[i] && !bitmap_empty_p (graph->succs[i]))
2601 || VEC_length (constraint_t, graph->complex[i]) > 0))
2603 SET_BIT (changed, i);
2608 /* Allocate a bitmap to be used to store the changed bits. */
2609 pts = BITMAP_ALLOC (&pta_obstack);
2611 while (changed_count > 0)
2614 struct topo_info *ti = init_topo_info ();
2617 bitmap_obstack_initialize (&iteration_obstack);
2619 compute_topo_order (graph, ti);
2621 while (VEC_length (unsigned, ti->topo_order) != 0)
2624 i = VEC_pop (unsigned, ti->topo_order);
2626 /* If this variable is not a representative, skip it. */
2630 /* In certain indirect cycle cases, we may merge this
2631 variable to another. */
2632 if (eliminate_indirect_cycles (i) && find (i) != i)
2635 /* If the node has changed, we need to process the
2636 complex constraints and outgoing edges again. */
2637 if (TEST_BIT (changed, i))
2642 VEC(constraint_t,heap) *complex = graph->complex[i];
2643 bool solution_empty;
2645 RESET_BIT (changed, i);
2648 /* Compute the changed set of solution bits. */
2649 bitmap_and_compl (pts, get_varinfo (i)->solution,
2650 get_varinfo (i)->oldsolution);
2652 if (bitmap_empty_p (pts))
2655 bitmap_ior_into (get_varinfo (i)->oldsolution, pts);
2657 solution = get_varinfo (i)->solution;
2658 solution_empty = bitmap_empty_p (solution);
2660 /* Process the complex constraints */
2661 for (j = 0; VEC_iterate (constraint_t, complex, j, c); j++)
2663 /* XXX: This is going to unsort the constraints in
2664 some cases, which will occasionally add duplicate
2665 constraints during unification. This does not
2666 affect correctness. */
2667 c->lhs.var = find (c->lhs.var);
2668 c->rhs.var = find (c->rhs.var);
2670 /* The only complex constraint that can change our
2671 solution to non-empty, given an empty solution,
2672 is a constraint where the lhs side is receiving
2673 some set from elsewhere. */
2674 if (!solution_empty || c->lhs.type != DEREF)
2675 do_complex_constraint (graph, c, pts);
2678 solution_empty = bitmap_empty_p (solution);
2680 if (!solution_empty)
2683 unsigned eff_escaped_id = find (escaped_id);
2685 /* Propagate solution to all successors. */
2686 EXECUTE_IF_IN_NONNULL_BITMAP (graph->succs[i],
2692 unsigned int to = find (j);
2693 tmp = get_varinfo (to)->solution;
2696 /* Don't try to propagate to ourselves. */
2700 /* If we propagate from ESCAPED use ESCAPED as
2702 if (i == eff_escaped_id)
2703 flag = bitmap_set_bit (tmp, escaped_id);
2705 flag = set_union_with_increment (tmp, pts, 0);
2709 get_varinfo (to)->solution = tmp;
2710 if (!TEST_BIT (changed, to))
2712 SET_BIT (changed, to);
2720 free_topo_info (ti);
2721 bitmap_obstack_release (&iteration_obstack);
2725 sbitmap_free (changed);
2726 bitmap_obstack_release (&oldpta_obstack);
2729 /* Map from trees to variable infos. */
2730 static struct pointer_map_t *vi_for_tree;
2733 /* Insert ID as the variable id for tree T in the vi_for_tree map. */
2736 insert_vi_for_tree (tree t, varinfo_t vi)
2738 void **slot = pointer_map_insert (vi_for_tree, t);
2740 gcc_assert (*slot == NULL);
2744 /* Find the variable info for tree T in VI_FOR_TREE. If T does not
2745 exist in the map, return NULL, otherwise, return the varinfo we found. */
2748 lookup_vi_for_tree (tree t)
2750 void **slot = pointer_map_contains (vi_for_tree, t);
2754 return (varinfo_t) *slot;
2757 /* Return a printable name for DECL */
2760 alias_get_name (tree decl)
2764 int num_printed = 0;
2766 if (DECL_ASSEMBLER_NAME_SET_P (decl))
2767 res = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));
2769 res= get_name (decl);
2777 if (TREE_CODE (decl) == SSA_NAME)
2779 num_printed = asprintf (&temp, "%s_%u",
2780 alias_get_name (SSA_NAME_VAR (decl)),
2781 SSA_NAME_VERSION (decl));
2783 else if (DECL_P (decl))
2785 num_printed = asprintf (&temp, "D.%u", DECL_UID (decl));
2787 if (num_printed > 0)
2789 res = ggc_strdup (temp);
2795 /* Find the variable id for tree T in the map.
2796 If T doesn't exist in the map, create an entry for it and return it. */
2799 get_vi_for_tree (tree t)
2801 void **slot = pointer_map_contains (vi_for_tree, t);
2803 return get_varinfo (create_variable_info_for (t, alias_get_name (t)));
2805 return (varinfo_t) *slot;
2808 /* Get a scalar constraint expression for a new temporary variable. */
2810 static struct constraint_expr
2811 new_scalar_tmp_constraint_exp (const char *name)
2813 struct constraint_expr tmp;
2816 vi = new_var_info (NULL_TREE, name);
2820 vi->is_full_var = 1;
2829 /* Get a constraint expression vector from an SSA_VAR_P node.
2830 If address_p is true, the result will be taken its address of. */
2833 get_constraint_for_ssa_var (tree t, VEC(ce_s, heap) **results, bool address_p)
2835 struct constraint_expr cexpr;
2838 /* We allow FUNCTION_DECLs here even though it doesn't make much sense. */
2839 gcc_assert (SSA_VAR_P (t) || DECL_P (t));
2841 /* For parameters, get at the points-to set for the actual parm
2843 if (TREE_CODE (t) == SSA_NAME
2844 && TREE_CODE (SSA_NAME_VAR (t)) == PARM_DECL
2845 && SSA_NAME_IS_DEFAULT_DEF (t))
2847 get_constraint_for_ssa_var (SSA_NAME_VAR (t), results, address_p);
2851 vi = get_vi_for_tree (t);
2853 cexpr.type = SCALAR;
2855 /* If we determine the result is "anything", and we know this is readonly,
2856 say it points to readonly memory instead. */
2857 if (cexpr.var == anything_id && TREE_READONLY (t))
2860 cexpr.type = ADDRESSOF;
2861 cexpr.var = readonly_id;
2864 /* If we are not taking the address of the constraint expr, add all
2865 sub-fiels of the variable as well. */
2867 && !vi->is_full_var)
2869 for (; vi; vi = vi->next)
2872 VEC_safe_push (ce_s, heap, *results, &cexpr);
2877 VEC_safe_push (ce_s, heap, *results, &cexpr);
2880 /* Process constraint T, performing various simplifications and then
2881 adding it to our list of overall constraints. */
2884 process_constraint (constraint_t t)
2886 struct constraint_expr rhs = t->rhs;
2887 struct constraint_expr lhs = t->lhs;
2889 gcc_assert (rhs.var < VEC_length (varinfo_t, varmap));
2890 gcc_assert (lhs.var < VEC_length (varinfo_t, varmap));
2892 /* If we didn't get any useful constraint from the lhs we get
2893 &ANYTHING as fallback from get_constraint_for. Deal with
2894 it here by turning it into *ANYTHING. */
2895 if (lhs.type == ADDRESSOF
2896 && lhs.var == anything_id)
2899 /* ADDRESSOF on the lhs is invalid. */
2900 gcc_assert (lhs.type != ADDRESSOF);
2902 /* We shouldn't add constraints from things that cannot have pointers.
2903 It's not completely trivial to avoid in the callers, so do it here. */
2904 if (rhs.type != ADDRESSOF
2905 && !get_varinfo (rhs.var)->may_have_pointers)
2908 /* Likewise adding to the solution of a non-pointer var isn't useful. */
2909 if (!get_varinfo (lhs.var)->may_have_pointers)
2912 /* This can happen in our IR with things like n->a = *p */
2913 if (rhs.type == DEREF && lhs.type == DEREF && rhs.var != anything_id)
2915 /* Split into tmp = *rhs, *lhs = tmp */
2916 struct constraint_expr tmplhs;
2917 tmplhs = new_scalar_tmp_constraint_exp ("doubledereftmp");
2918 process_constraint (new_constraint (tmplhs, rhs));
2919 process_constraint (new_constraint (lhs, tmplhs));
2921 else if (rhs.type == ADDRESSOF && lhs.type == DEREF)
2923 /* Split into tmp = &rhs, *lhs = tmp */
2924 struct constraint_expr tmplhs;
2925 tmplhs = new_scalar_tmp_constraint_exp ("derefaddrtmp");
2926 process_constraint (new_constraint (tmplhs, rhs));
2927 process_constraint (new_constraint (lhs, tmplhs));
2931 gcc_assert (rhs.type != ADDRESSOF || rhs.offset == 0);
2932 VEC_safe_push (constraint_t, heap, constraints, t);
2936 /* Return true if T is a type that could contain pointers. */
2939 type_could_have_pointers (tree type)
2941 if (POINTER_TYPE_P (type))
2944 if (TREE_CODE (type) == ARRAY_TYPE)
2945 return type_could_have_pointers (TREE_TYPE (type));
2947 /* A function or method can consume pointers.
2948 ??? We could be more precise here. */
2949 if (TREE_CODE (type) == FUNCTION_TYPE
2950 || TREE_CODE (type) == METHOD_TYPE)
2953 return AGGREGATE_TYPE_P (type);
2956 /* Return true if T is a variable of a type that could contain
2960 could_have_pointers (tree t)
2962 return (((TREE_CODE (t) == VAR_DECL
2963 || TREE_CODE (t) == PARM_DECL
2964 || TREE_CODE (t) == RESULT_DECL)
2965 && (TREE_PUBLIC (t) || DECL_EXTERNAL (t) || TREE_ADDRESSABLE (t)))
2966 || type_could_have_pointers (TREE_TYPE (t)));
2969 /* Return the position, in bits, of FIELD_DECL from the beginning of its
2972 static HOST_WIDE_INT
2973 bitpos_of_field (const tree fdecl)
2976 if (!host_integerp (DECL_FIELD_OFFSET (fdecl), 0)
2977 || !host_integerp (DECL_FIELD_BIT_OFFSET (fdecl), 0))
2980 return (TREE_INT_CST_LOW (DECL_FIELD_OFFSET (fdecl)) * 8
2981 + TREE_INT_CST_LOW (DECL_FIELD_BIT_OFFSET (fdecl)));
2985 /* Get constraint expressions for offsetting PTR by OFFSET. Stores the
2986 resulting constraint expressions in *RESULTS. */
2989 get_constraint_for_ptr_offset (tree ptr, tree offset,
2990 VEC (ce_s, heap) **results)
2992 struct constraint_expr c;
2994 HOST_WIDE_INT rhsunitoffset, rhsoffset;
2996 /* If we do not do field-sensitive PTA adding offsets to pointers
2997 does not change the points-to solution. */
2998 if (!use_field_sensitive)
3000 get_constraint_for (ptr, results);
3004 /* If the offset is not a non-negative integer constant that fits
3005 in a HOST_WIDE_INT, we have to fall back to a conservative
3006 solution which includes all sub-fields of all pointed-to
3007 variables of ptr. */
3008 if (offset == NULL_TREE
3009 || !host_integerp (offset, 0))
3010 rhsoffset = UNKNOWN_OFFSET;
3013 /* Make sure the bit-offset also fits. */
3014 rhsunitoffset = TREE_INT_CST_LOW (offset);
3015 rhsoffset = rhsunitoffset * BITS_PER_UNIT;
3016 if (rhsunitoffset != rhsoffset / BITS_PER_UNIT)
3017 rhsoffset = UNKNOWN_OFFSET;
3020 get_constraint_for (ptr, results);
3024 /* As we are eventually appending to the solution do not use
3025 VEC_iterate here. */
3026 n = VEC_length (ce_s, *results);
3027 for (j = 0; j < n; j++)
3030 c = *VEC_index (ce_s, *results, j);
3031 curr = get_varinfo (c.var);
3033 if (c.type == ADDRESSOF
3034 /* If this varinfo represents a full variable just use it. */
3035 && curr->is_full_var)
3037 else if (c.type == ADDRESSOF
3038 /* If we do not know the offset add all subfields. */
3039 && rhsoffset == UNKNOWN_OFFSET)
3041 varinfo_t temp = lookup_vi_for_tree (curr->decl);
3044 struct constraint_expr c2;
3046 c2.type = ADDRESSOF;
3048 if (c2.var != c.var)
3049 VEC_safe_push (ce_s, heap, *results, &c2);
3054 else if (c.type == ADDRESSOF)
3057 unsigned HOST_WIDE_INT offset = curr->offset + rhsoffset;
3059 /* Search the sub-field which overlaps with the
3060 pointed-to offset. If the result is outside of the variable
3061 we have to provide a conservative result, as the variable is
3062 still reachable from the resulting pointer (even though it
3063 technically cannot point to anything). The last and first
3064 sub-fields are such conservative results.
3065 ??? If we always had a sub-field for &object + 1 then
3066 we could represent this in a more precise way. */
3068 && curr->offset < offset)
3070 temp = first_or_preceding_vi_for_offset (curr, offset);
3072 /* If the found variable is not exactly at the pointed to
3073 result, we have to include the next variable in the
3074 solution as well. Otherwise two increments by offset / 2
3075 do not result in the same or a conservative superset
3077 if (temp->offset != offset
3078 && temp->next != NULL)
3080 struct constraint_expr c2;
3081 c2.var = temp->next->id;
3082 c2.type = ADDRESSOF;
3084 VEC_safe_push (ce_s, heap, *results, &c2);
3090 c.offset = rhsoffset;
3092 VEC_replace (ce_s, *results, j, &c);
3097 /* Given a COMPONENT_REF T, return the constraint_expr vector for it.
3098 If address_p is true the result will be taken its address of. */
3101 get_constraint_for_component_ref (tree t, VEC(ce_s, heap) **results,
3105 HOST_WIDE_INT bitsize = -1;
3106 HOST_WIDE_INT bitmaxsize = -1;
3107 HOST_WIDE_INT bitpos;
3109 struct constraint_expr *result;
3111 /* Some people like to do cute things like take the address of
3114 while (handled_component_p (forzero)
3115 || INDIRECT_REF_P (forzero))
3116 forzero = TREE_OPERAND (forzero, 0);
3118 if (CONSTANT_CLASS_P (forzero) && integer_zerop (forzero))
3120 struct constraint_expr temp;
3123 temp.var = integer_id;
3125 VEC_safe_push (ce_s, heap, *results, &temp);
3129 t = get_ref_base_and_extent (t, &bitpos, &bitsize, &bitmaxsize);
3131 /* Pretend to take the address of the base, we'll take care of
3132 adding the required subset of sub-fields below. */
3133 get_constraint_for_1 (t, results, true);
3134 gcc_assert (VEC_length (ce_s, *results) == 1);
3135 result = VEC_last (ce_s, *results);
3137 if (result->type == SCALAR
3138 && get_varinfo (result->var)->is_full_var)
3139 /* For single-field vars do not bother about the offset. */
3141 else if (result->type == SCALAR)
3143 /* In languages like C, you can access one past the end of an
3144 array. You aren't allowed to dereference it, so we can
3145 ignore this constraint. When we handle pointer subtraction,
3146 we may have to do something cute here. */
3148 if ((unsigned HOST_WIDE_INT)bitpos < get_varinfo (result->var)->fullsize
3151 /* It's also not true that the constraint will actually start at the
3152 right offset, it may start in some padding. We only care about
3153 setting the constraint to the first actual field it touches, so
3155 struct constraint_expr cexpr = *result;
3157 VEC_pop (ce_s, *results);
3159 for (curr = get_varinfo (cexpr.var); curr; curr = curr->next)
3161 if (ranges_overlap_p (curr->offset, curr->size,
3162 bitpos, bitmaxsize))
3164 cexpr.var = curr->id;
3165 VEC_safe_push (ce_s, heap, *results, &cexpr);
3170 /* If we are going to take the address of this field then
3171 to be able to compute reachability correctly add at least
3172 the last field of the variable. */
3174 && VEC_length (ce_s, *results) == 0)
3176 curr = get_varinfo (cexpr.var);
3177 while (curr->next != NULL)
3179 cexpr.var = curr->id;
3180 VEC_safe_push (ce_s, heap, *results, &cexpr);
3183 /* Assert that we found *some* field there. The user couldn't be
3184 accessing *only* padding. */
3185 /* Still the user could access one past the end of an array
3186 embedded in a struct resulting in accessing *only* padding. */
3187 gcc_assert (VEC_length (ce_s, *results) >= 1
3188 || ref_contains_array_ref (orig_t));
3190 else if (bitmaxsize == 0)
3192 if (dump_file && (dump_flags & TDF_DETAILS))
3193 fprintf (dump_file, "Access to zero-sized part of variable,"
3197 if (dump_file && (dump_flags & TDF_DETAILS))
3198 fprintf (dump_file, "Access to past the end of variable, ignoring\n");
3200 else if (result->type == DEREF)
3202 /* If we do not know exactly where the access goes say so. Note
3203 that only for non-structure accesses we know that we access
3204 at most one subfiled of any variable. */
3206 || bitsize != bitmaxsize
3207 || AGGREGATE_TYPE_P (TREE_TYPE (orig_t)))
3208 result->offset = UNKNOWN_OFFSET;
3210 result->offset = bitpos;
3212 else if (result->type == ADDRESSOF)
3214 /* We can end up here for component references on a
3215 VIEW_CONVERT_EXPR <>(&foobar). */
3216 result->type = SCALAR;
3217 result->var = anything_id;
3225 /* Dereference the constraint expression CONS, and return the result.
3226 DEREF (ADDRESSOF) = SCALAR
3227 DEREF (SCALAR) = DEREF
3228 DEREF (DEREF) = (temp = DEREF1; result = DEREF(temp))
3229 This is needed so that we can handle dereferencing DEREF constraints. */
3232 do_deref (VEC (ce_s, heap) **constraints)
3234 struct constraint_expr *c;
3237 for (i = 0; VEC_iterate (ce_s, *constraints, i, c); i++)
3239 if (c->type == SCALAR)
3241 else if (c->type == ADDRESSOF)
3243 else if (c->type == DEREF)
3245 struct constraint_expr tmplhs;
3246 tmplhs = new_scalar_tmp_constraint_exp ("dereftmp");
3247 process_constraint (new_constraint (tmplhs, *c));
3248 c->var = tmplhs.var;
3255 static void get_constraint_for_1 (tree, VEC (ce_s, heap) **, bool);
3257 /* Given a tree T, return the constraint expression for taking the
3261 get_constraint_for_address_of (tree t, VEC (ce_s, heap) **results)
3263 struct constraint_expr *c;
3266 get_constraint_for_1 (t, results, true);
3268 for (i = 0; VEC_iterate (ce_s, *results, i, c); i++)
3270 if (c->type == DEREF)
3273 c->type = ADDRESSOF;
3277 /* Given a tree T, return the constraint expression for it. */
3280 get_constraint_for_1 (tree t, VEC (ce_s, heap) **results, bool address_p)
3282 struct constraint_expr temp;
3284 /* x = integer is all glommed to a single variable, which doesn't
3285 point to anything by itself. That is, of course, unless it is an
3286 integer constant being treated as a pointer, in which case, we
3287 will return that this is really the addressof anything. This
3288 happens below, since it will fall into the default case. The only
3289 case we know something about an integer treated like a pointer is
3290 when it is the NULL pointer, and then we just say it points to
3293 Do not do that if -fno-delete-null-pointer-checks though, because
3294 in that case *NULL does not fail, so it _should_ alias *anything.
3295 It is not worth adding a new option or renaming the existing one,
3296 since this case is relatively obscure. */
3297 if ((TREE_CODE (t) == INTEGER_CST
3298 && integer_zerop (t))
3299 /* The only valid CONSTRUCTORs in gimple with pointer typed
3300 elements are zero-initializer. But in IPA mode we also
3301 process global initializers, so verify at least. */
3302 || (TREE_CODE (t) == CONSTRUCTOR
3303 && CONSTRUCTOR_NELTS (t) == 0))
3305 if (flag_delete_null_pointer_checks)
3306 temp.var = nothing_id;
3308 temp.var = anything_id;
3309 temp.type = ADDRESSOF;
3311 VEC_safe_push (ce_s, heap, *results, &temp);
3315 /* String constants are read-only. */
3316 if (TREE_CODE (t) == STRING_CST)
3318 temp.var = readonly_id;
3321 VEC_safe_push (ce_s, heap, *results, &temp);
3325 switch (TREE_CODE_CLASS (TREE_CODE (t)))
3327 case tcc_expression:
3329 switch (TREE_CODE (t))
3332 get_constraint_for_address_of (TREE_OPERAND (t, 0), results);
3340 switch (TREE_CODE (t))
3344 get_constraint_for_1 (TREE_OPERAND (t, 0), results, address_p);
3349 case ARRAY_RANGE_REF:
3351 get_constraint_for_component_ref (t, results, address_p);
3353 case VIEW_CONVERT_EXPR:
3354 get_constraint_for_1 (TREE_OPERAND (t, 0), results, address_p);
3356 /* We are missing handling for TARGET_MEM_REF here. */
3361 case tcc_exceptional:
3363 switch (TREE_CODE (t))
3367 get_constraint_for_ssa_var (t, results, address_p);
3374 VEC (ce_s, heap) *tmp = NULL;
3375 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (t), i, val)
3377 struct constraint_expr *rhsp;
3379 get_constraint_for_1 (val, &tmp, address_p);
3380 for (j = 0; VEC_iterate (ce_s, tmp, j, rhsp); ++j)
3381 VEC_safe_push (ce_s, heap, *results, rhsp);
3382 VEC_truncate (ce_s, tmp, 0);
3384 VEC_free (ce_s, heap, tmp);
3385 /* We do not know whether the constructor was complete,
3386 so technically we have to add &NOTHING or &ANYTHING
3387 like we do for an empty constructor as well. */
3394 case tcc_declaration:
3396 get_constraint_for_ssa_var (t, results, address_p);
3402 /* The default fallback is a constraint from anything. */
3403 temp.type = ADDRESSOF;
3404 temp.var = anything_id;
3406 VEC_safe_push (ce_s, heap, *results, &temp);
3409 /* Given a gimple tree T, return the constraint expression vector for it. */
3412 get_constraint_for (tree t, VEC (ce_s, heap) **results)
3414 gcc_assert (VEC_length (ce_s, *results) == 0);
3416 get_constraint_for_1 (t, results, false);
3420 /* Efficiently generates constraints from all entries in *RHSC to all
3421 entries in *LHSC. */
3424 process_all_all_constraints (VEC (ce_s, heap) *lhsc, VEC (ce_s, heap) *rhsc)
3426 struct constraint_expr *lhsp, *rhsp;
3429 if (VEC_length (ce_s, lhsc) <= 1
3430 || VEC_length (ce_s, rhsc) <= 1)
3432 for (i = 0; VEC_iterate (ce_s, lhsc, i, lhsp); ++i)
3433 for (j = 0; VEC_iterate (ce_s, rhsc, j, rhsp); ++j)
3434 process_constraint (new_constraint (*lhsp, *rhsp));
3438 struct constraint_expr tmp;
3439 tmp = new_scalar_tmp_constraint_exp ("allalltmp");
3440 for (i = 0; VEC_iterate (ce_s, rhsc, i, rhsp); ++i)
3441 process_constraint (new_constraint (tmp, *rhsp));
3442 for (i = 0; VEC_iterate (ce_s, lhsc, i, lhsp); ++i)
3443 process_constraint (new_constraint (*lhsp, tmp));
3447 /* Handle aggregate copies by expanding into copies of the respective
3448 fields of the structures. */
3451 do_structure_copy (tree lhsop, tree rhsop)
3453 struct constraint_expr *lhsp, *rhsp;
3454 VEC (ce_s, heap) *lhsc = NULL, *rhsc = NULL;
3457 get_constraint_for (lhsop, &lhsc);
3458 get_constraint_for (rhsop, &rhsc);
3459 lhsp = VEC_index (ce_s, lhsc, 0);
3460 rhsp = VEC_index (ce_s, rhsc, 0);
3461 if (lhsp->type == DEREF
3462 || (lhsp->type == ADDRESSOF && lhsp->var == anything_id)
3463 || rhsp->type == DEREF)
3465 if (lhsp->type == DEREF)
3467 gcc_assert (VEC_length (ce_s, lhsc) == 1);
3468 lhsp->offset = UNKNOWN_OFFSET;
3470 if (rhsp->type == DEREF)
3472 gcc_assert (VEC_length (ce_s, rhsc) == 1);
3473 rhsp->offset = UNKNOWN_OFFSET;
3475 process_all_all_constraints (lhsc, rhsc);
3477 else if (lhsp->type == SCALAR
3478 && (rhsp->type == SCALAR
3479 || rhsp->type == ADDRESSOF))
3481 HOST_WIDE_INT lhssize, lhsmaxsize, lhsoffset;
3482 HOST_WIDE_INT rhssize, rhsmaxsize, rhsoffset;
3484 get_ref_base_and_extent (lhsop, &lhsoffset, &lhssize, &lhsmaxsize);
3485 get_ref_base_and_extent (rhsop, &rhsoffset, &rhssize, &rhsmaxsize);
3486 for (j = 0; VEC_iterate (ce_s, lhsc, j, lhsp);)
3488 varinfo_t lhsv, rhsv;
3489 rhsp = VEC_index (ce_s, rhsc, k);
3490 lhsv = get_varinfo (lhsp->var);
3491 rhsv = get_varinfo (rhsp->var);
3492 if (lhsv->may_have_pointers
3493 && ranges_overlap_p (lhsv->offset + rhsoffset, lhsv->size,
3494 rhsv->offset + lhsoffset, rhsv->size))
3495 process_constraint (new_constraint (*lhsp, *rhsp));
3496 if (lhsv->offset + rhsoffset + lhsv->size
3497 > rhsv->offset + lhsoffset + rhsv->size)
3500 if (k >= VEC_length (ce_s, rhsc))
3510 VEC_free (ce_s, heap, lhsc);
3511 VEC_free (ce_s, heap, rhsc);
3514 /* Create a constraint ID = OP. */
3517 make_constraint_to (unsigned id, tree op)
3519 VEC(ce_s, heap) *rhsc = NULL;
3520 struct constraint_expr *c;
3521 struct constraint_expr includes;
3525 includes.offset = 0;
3526 includes.type = SCALAR;
3528 get_constraint_for (op, &rhsc);
3529 for (j = 0; VEC_iterate (ce_s, rhsc, j, c); j++)
3530 process_constraint (new_constraint (includes, *c));
3531 VEC_free (ce_s, heap, rhsc);
3534 /* Create a constraint ID = &FROM. */
3537 make_constraint_from (varinfo_t vi, int from)
3539 struct constraint_expr lhs, rhs;
3547 rhs.type = ADDRESSOF;
3548 process_constraint (new_constraint (lhs, rhs));
3551 /* Create a constraint ID = FROM. */
3554 make_copy_constraint (varinfo_t vi, int from)
3556 struct constraint_expr lhs, rhs;
3565 process_constraint (new_constraint (lhs, rhs));
3568 /* Make constraints necessary to make OP escape. */
3571 make_escape_constraint (tree op)
3573 make_constraint_to (escaped_id, op);
3576 /* Add constraints to that the solution of VI is transitively closed. */
3579 make_transitive_closure_constraints (varinfo_t vi)
3581 struct constraint_expr lhs, rhs;
3590 process_constraint (new_constraint (lhs, rhs));
3592 /* VAR = VAR + UNKNOWN; */
3598 rhs.offset = UNKNOWN_OFFSET;
3599 process_constraint (new_constraint (lhs, rhs));
3602 /* Create a new artificial heap variable with NAME.
3603 Return the created variable. */
3606 make_heapvar_for (varinfo_t lhs, const char *name)
3609 tree heapvar = heapvar_lookup (lhs->decl, lhs->offset);
3611 if (heapvar == NULL_TREE)
3614 heapvar = create_tmp_var_raw (ptr_type_node, name);
3615 DECL_EXTERNAL (heapvar) = 1;
3617 heapvar_insert (lhs->decl, lhs->offset, heapvar);
3619 ann = get_var_ann (heapvar);
3620 ann->is_heapvar = 1;
3623 /* For global vars we need to add a heapvar to the list of referenced
3624 vars of a different function than it was created for originally. */
3625 if (cfun && gimple_referenced_vars (cfun))
3626 add_referenced_var (heapvar);
3628 vi = new_var_info (heapvar, name);
3629 vi->is_artificial_var = true;
3630 vi->is_heap_var = true;
3631 vi->is_unknown_size_var = true;
3635 vi->is_full_var = true;
3636 insert_vi_for_tree (heapvar, vi);
3641 /* Create a new artificial heap variable with NAME and make a
3642 constraint from it to LHS. Return the created variable. */
3645 make_constraint_from_heapvar (varinfo_t lhs, const char *name)
3647 varinfo_t vi = make_heapvar_for (lhs, name);
3648 make_constraint_from (lhs, vi->id);
3653 /* Create a new artificial heap variable with NAME and make a
3654 constraint from it to LHS. Set flags according to a tag used
3655 for tracking restrict pointers. */
3658 make_constraint_from_restrict (varinfo_t lhs, const char *name)
3661 vi = make_constraint_from_heapvar (lhs, name);
3662 vi->is_restrict_var = 1;
3663 vi->is_global_var = 0;
3664 vi->is_special_var = 1;
3665 vi->may_have_pointers = 0;
3668 /* In IPA mode there are varinfos for different aspects of reach
3669 function designator. One for the points-to set of the return
3670 value, one for the variables that are clobbered by the function,
3671 one for its uses and one for each parameter (including a single
3672 glob for remaining variadic arguments). */
3674 enum { fi_clobbers = 1, fi_uses = 2,
3675 fi_static_chain = 3, fi_result = 4, fi_parm_base = 5 };
3677 /* Get a constraint for the requested part of a function designator FI
3678 when operating in IPA mode. */
3680 static struct constraint_expr
3681 get_function_part_constraint (varinfo_t fi, unsigned part)
3683 struct constraint_expr c;
3685 gcc_assert (in_ipa_mode);
3687 if (fi->id == anything_id)
3689 /* ??? We probably should have a ANYFN special variable. */
3690 c.var = anything_id;
3694 else if (TREE_CODE (fi->decl) == FUNCTION_DECL)
3696 varinfo_t ai = first_vi_for_offset (fi, part);
3700 c.var = anything_id;
3714 /* For non-IPA mode, generate constraints necessary for a call on the
3718 handle_rhs_call (gimple stmt, VEC(ce_s, heap) **results)
3720 struct constraint_expr rhsc;
3722 bool returns_uses = false;
3724 for (i = 0; i < gimple_call_num_args (stmt); ++i)
3726 tree arg = gimple_call_arg (stmt, i);
3727 int flags = gimple_call_arg_flags (stmt, i);
3729 /* If the argument is not used or it does not contain pointers
3730 we can ignore it. */
3731 if ((flags & EAF_UNUSED)
3732 || !could_have_pointers (arg))
3735 /* As we compute ESCAPED context-insensitive we do not gain
3736 any precision with just EAF_NOCLOBBER but not EAF_NOESCAPE
3737 set. The argument would still get clobbered through the
3739 ??? We might get away with less (and more precise) constraints
3740 if using a temporary for transitively closing things. */
3741 if ((flags & EAF_NOCLOBBER)
3742 && (flags & EAF_NOESCAPE))
3744 varinfo_t uses = get_call_use_vi (stmt);
3745 if (!(flags & EAF_DIRECT))
3746 make_transitive_closure_constraints (uses);
3747 make_constraint_to (uses->id, arg);
3748 returns_uses = true;
3750 else if (flags & EAF_NOESCAPE)
3752 varinfo_t uses = get_call_use_vi (stmt);
3753 varinfo_t clobbers = get_call_clobber_vi (stmt);
3754 if (!(flags & EAF_DIRECT))
3756 make_transitive_closure_constraints (uses);
3757 make_transitive_closure_constraints (clobbers);
3759 make_constraint_to (uses->id, arg);
3760 make_constraint_to (clobbers->id, arg);
3761 returns_uses = true;
3764 make_escape_constraint (arg);
3767 /* If we added to the calls uses solution make sure we account for
3768 pointers to it to be returned. */
3771 rhsc.var = get_call_use_vi (stmt)->id;
3774 VEC_safe_push (ce_s, heap, *results, &rhsc);
3777 /* The static chain escapes as well. */
3778 if (gimple_call_chain (stmt))
3779 make_escape_constraint (gimple_call_chain (stmt));
3781 /* And if we applied NRV the address of the return slot escapes as well. */
3782 if (gimple_call_return_slot_opt_p (stmt)
3783 && gimple_call_lhs (stmt) != NULL_TREE
3784 && TREE_ADDRESSABLE (TREE_TYPE (gimple_call_lhs (stmt))))
3786 VEC(ce_s, heap) *tmpc = NULL;
3787 struct constraint_expr lhsc, *c;
3788 get_constraint_for_address_of (gimple_call_lhs (stmt), &tmpc);
3789 lhsc.var = escaped_id;
3792 for (i = 0; VEC_iterate (ce_s, tmpc, i, c); ++i)
3793 process_constraint (new_constraint (lhsc, *c));
3794 VEC_free(ce_s, heap, tmpc);
3797 /* Regular functions return nonlocal memory. */
3798 rhsc.var = nonlocal_id;
3801 VEC_safe_push (ce_s, heap, *results, &rhsc);
3804 /* For non-IPA mode, generate constraints necessary for a call
3805 that returns a pointer and assigns it to LHS. This simply makes
3806 the LHS point to global and escaped variables. */
3809 handle_lhs_call (gimple stmt, tree lhs, int flags, VEC(ce_s, heap) *rhsc,
3812 VEC(ce_s, heap) *lhsc = NULL;
3814 get_constraint_for (lhs, &lhsc);
3815 /* If the store is to a global decl make sure to
3816 add proper escape constraints. */
3817 lhs = get_base_address (lhs);
3820 && is_global_var (lhs))
3822 struct constraint_expr tmpc;
3823 tmpc.var = escaped_id;
3826 VEC_safe_push (ce_s, heap, lhsc, &tmpc);
3829 /* If the call returns an argument unmodified override the rhs
3831 flags = gimple_call_return_flags (stmt);
3832 if (flags & ERF_RETURNS_ARG
3833 && (flags & ERF_RETURN_ARG_MASK) < gimple_call_num_args (stmt))
3837 arg = gimple_call_arg (stmt, flags & ERF_RETURN_ARG_MASK);
3838 get_constraint_for (arg, &rhsc);
3839 process_all_all_constraints (lhsc, rhsc);
3840 VEC_free (ce_s, heap, rhsc);
3842 else if (flags & ERF_NOALIAS)
3845 struct constraint_expr tmpc;
3847 vi = make_heapvar_for (get_vi_for_tree (lhs), "HEAP");
3848 /* We delay marking allocated storage global until we know if
3850 DECL_EXTERNAL (vi->decl) = 0;
3851 vi->is_global_var = 0;
3852 /* If this is not a real malloc call assume the memory was
3853 initialized and thus may point to global memory. All
3854 builtin functions with the malloc attribute behave in a sane way. */
3856 || DECL_BUILT_IN_CLASS (fndecl) != BUILT_IN_NORMAL)
3857 make_constraint_from (vi, nonlocal_id);
3860 tmpc.type = ADDRESSOF;
3861 VEC_safe_push (ce_s, heap, rhsc, &tmpc);
3864 process_all_all_constraints (lhsc, rhsc);
3866 VEC_free (ce_s, heap, lhsc);
3869 /* For non-IPA mode, generate constraints necessary for a call of a
3870 const function that returns a pointer in the statement STMT. */
3873 handle_const_call (gimple stmt, VEC(ce_s, heap) **results)
3875 struct constraint_expr rhsc;
3878 /* Treat nested const functions the same as pure functions as far
3879 as the static chain is concerned. */
3880 if (gimple_call_chain (stmt))
3882 varinfo_t uses = get_call_use_vi (stmt);
3883 make_transitive_closure_constraints (uses);
3884 make_constraint_to (uses->id, gimple_call_chain (stmt));
3885 rhsc.var = uses->id;
3888 VEC_safe_push (ce_s, heap, *results, &rhsc);
3891 /* May return arguments. */
3892 for (k = 0; k < gimple_call_num_args (stmt); ++k)
3894 tree arg = gimple_call_arg (stmt, k);
3896 if (could_have_pointers (arg))
3898 VEC(ce_s, heap) *argc = NULL;
3900 struct constraint_expr *argp;
3901 get_constraint_for (arg, &argc);
3902 for (i = 0; VEC_iterate (ce_s, argc, i, argp); ++i)
3903 VEC_safe_push (ce_s, heap, *results, argp);
3904 VEC_free(ce_s, heap, argc);
3908 /* May return addresses of globals. */
3909 rhsc.var = nonlocal_id;
3911 rhsc.type = ADDRESSOF;
3912 VEC_safe_push (ce_s, heap, *results, &rhsc);
3915 /* For non-IPA mode, generate constraints necessary for a call to a
3916 pure function in statement STMT. */
3919 handle_pure_call (gimple stmt, VEC(ce_s, heap) **results)
3921 struct constraint_expr rhsc;
3923 varinfo_t uses = NULL;
3925 /* Memory reached from pointer arguments is call-used. */
3926 for (i = 0; i < gimple_call_num_args (stmt); ++i)
3928 tree arg = gimple_call_arg (stmt, i);
3930 if (could_have_pointers (arg))
3934 uses = get_call_use_vi (stmt);
3935 make_transitive_closure_constraints (uses);
3937 make_constraint_to (uses->id, arg);
3941 /* The static chain is used as well. */
3942 if (gimple_call_chain (stmt))
3946 uses = get_call_use_vi (stmt);
3947 make_transitive_closure_constraints (uses);
3949 make_constraint_to (uses->id, gimple_call_chain (stmt));
3952 /* Pure functions may return call-used and nonlocal memory. */
3955 rhsc.var = uses->id;
3958 VEC_safe_push (ce_s, heap, *results, &rhsc);
3960 rhsc.var = nonlocal_id;
3963 VEC_safe_push (ce_s, heap, *results, &rhsc);
3967 /* Return the varinfo for the callee of CALL. */
3970 get_fi_for_callee (gimple call)
3974 /* If we can directly resolve the function being called, do so.
3975 Otherwise, it must be some sort of indirect expression that
3976 we should still be able to handle. */
3977 decl = gimple_call_fndecl (call);
3979 return get_vi_for_tree (decl);
3981 decl = gimple_call_fn (call);
3982 /* The function can be either an SSA name pointer or,
3983 worse, an OBJ_TYPE_REF. In this case we have no
3984 clue and should be getting ANYFN (well, ANYTHING for now). */
3985 if (TREE_CODE (decl) == SSA_NAME)
3987 if (TREE_CODE (decl) == SSA_NAME
3988 && TREE_CODE (SSA_NAME_VAR (decl)) == PARM_DECL
3989 && SSA_NAME_IS_DEFAULT_DEF (decl))
3990 decl = SSA_NAME_VAR (decl);
3991 return get_vi_for_tree (decl);
3993 else if (TREE_CODE (decl) == INTEGER_CST
3994 || TREE_CODE (decl) == OBJ_TYPE_REF)
3995 return get_varinfo (anything_id);
4000 /* Walk statement T setting up aliasing constraints according to the
4001 references found in T. This function is the main part of the
4002 constraint builder. AI points to auxiliary alias information used
4003 when building alias sets and computing alias grouping heuristics. */
4006 find_func_aliases (gimple origt)
4009 VEC(ce_s, heap) *lhsc = NULL;
4010 VEC(ce_s, heap) *rhsc = NULL;
4011 struct constraint_expr *c;
4014 /* Now build constraints expressions. */
4015 if (gimple_code (t) == GIMPLE_PHI)
4017 gcc_assert (!AGGREGATE_TYPE_P (TREE_TYPE (gimple_phi_result (t))));
4019 /* Only care about pointers and structures containing
4021 if (could_have_pointers (gimple_phi_result (t)))
4026 /* For a phi node, assign all the arguments to
4028 get_constraint_for (gimple_phi_result (t), &lhsc);
4029 for (i = 0; i < gimple_phi_num_args (t); i++)
4031 tree strippedrhs = PHI_ARG_DEF (t, i);
4033 STRIP_NOPS (strippedrhs);
4034 get_constraint_for (gimple_phi_arg_def (t, i), &rhsc);
4036 for (j = 0; VEC_iterate (ce_s, lhsc, j, c); j++)
4038 struct constraint_expr *c2;
4039 while (VEC_length (ce_s, rhsc) > 0)
4041 c2 = VEC_last (ce_s, rhsc);
4042 process_constraint (new_constraint (*c, *c2));
4043 VEC_pop (ce_s, rhsc);
4049 /* In IPA mode, we need to generate constraints to pass call
4050 arguments through their calls. There are two cases,
4051 either a GIMPLE_CALL returning a value, or just a plain
4052 GIMPLE_CALL when we are not.
4054 In non-ipa mode, we need to generate constraints for each
4055 pointer passed by address. */
4056 else if (is_gimple_call (t))
4058 tree fndecl = gimple_call_fndecl (t);
4059 if (fndecl != NULL_TREE
4060 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
4061 /* ??? All builtins that are handled here need to be handled
4062 in the alias-oracle query functions explicitly! */
4063 switch (DECL_FUNCTION_CODE (fndecl))
4065 /* All the following functions return a pointer to the same object
4066 as their first argument points to. The functions do not add
4067 to the ESCAPED solution. The functions make the first argument
4068 pointed to memory point to what the second argument pointed to
4069 memory points to. */
4070 case BUILT_IN_STRCPY:
4071 case BUILT_IN_STRNCPY:
4072 case BUILT_IN_BCOPY:
4073 case BUILT_IN_MEMCPY:
4074 case BUILT_IN_MEMMOVE:
4075 case BUILT_IN_MEMPCPY:
4076 case BUILT_IN_STPCPY:
4077 case BUILT_IN_STPNCPY:
4078 case BUILT_IN_STRCAT:
4079 case BUILT_IN_STRNCAT:
4081 tree res = gimple_call_lhs (t);
4082 tree dest = gimple_call_arg (t, (DECL_FUNCTION_CODE (fndecl)
4083 == BUILT_IN_BCOPY ? 1 : 0));
4084 tree src = gimple_call_arg (t, (DECL_FUNCTION_CODE (fndecl)
4085 == BUILT_IN_BCOPY ? 0 : 1));
4086 if (res != NULL_TREE)
4088 get_constraint_for (res, &lhsc);
4089 if (DECL_FUNCTION_CODE (fndecl) == BUILT_IN_MEMPCPY
4090 || DECL_FUNCTION_CODE (fndecl) == BUILT_IN_STPCPY
4091 || DECL_FUNCTION_CODE (fndecl) == BUILT_IN_STPNCPY)
4092 get_constraint_for_ptr_offset (dest, NULL_TREE, &rhsc);
4094 get_constraint_for (dest, &rhsc);
4095 process_all_all_constraints (lhsc, rhsc);
4096 VEC_free (ce_s, heap, lhsc);
4097 VEC_free (ce_s, heap, rhsc);
4099 get_constraint_for_ptr_offset (dest, NULL_TREE, &lhsc);
4100 get_constraint_for_ptr_offset (src, NULL_TREE, &rhsc);
4103 process_all_all_constraints (lhsc, rhsc);
4104 VEC_free (ce_s, heap, lhsc);
4105 VEC_free (ce_s, heap, rhsc);
4108 case BUILT_IN_MEMSET:
4110 tree res = gimple_call_lhs (t);
4111 tree dest = gimple_call_arg (t, 0);
4114 struct constraint_expr ac;
4115 if (res != NULL_TREE)
4117 get_constraint_for (res, &lhsc);
4118 get_constraint_for (dest, &rhsc);
4119 process_all_all_constraints (lhsc, rhsc);
4120 VEC_free (ce_s, heap, lhsc);
4121 VEC_free (ce_s, heap, rhsc);
4123 get_constraint_for_ptr_offset (dest, NULL_TREE, &lhsc);
4125 if (flag_delete_null_pointer_checks
4126 && integer_zerop (gimple_call_arg (t, 1)))
4128 ac.type = ADDRESSOF;
4129 ac.var = nothing_id;
4134 ac.var = integer_id;
4137 for (i = 0; VEC_iterate (ce_s, lhsc, i, lhsp); ++i)
4138 process_constraint (new_constraint (*lhsp, ac));
4139 VEC_free (ce_s, heap, lhsc);
4142 /* All the following functions do not return pointers, do not
4143 modify the points-to sets of memory reachable from their
4144 arguments and do not add to the ESCAPED solution. */
4145 case BUILT_IN_SINCOS:
4146 case BUILT_IN_SINCOSF:
4147 case BUILT_IN_SINCOSL:
4148 case BUILT_IN_FREXP:
4149 case BUILT_IN_FREXPF:
4150 case BUILT_IN_FREXPL:
4151 case BUILT_IN_GAMMA_R:
4152 case BUILT_IN_GAMMAF_R:
4153 case BUILT_IN_GAMMAL_R:
4154 case BUILT_IN_LGAMMA_R:
4155 case BUILT_IN_LGAMMAF_R:
4156 case BUILT_IN_LGAMMAL_R:
4158 case BUILT_IN_MODFF:
4159 case BUILT_IN_MODFL:
4160 case BUILT_IN_REMQUO:
4161 case BUILT_IN_REMQUOF:
4162 case BUILT_IN_REMQUOL:
4165 /* Trampolines are special - they set up passing the static
4167 case BUILT_IN_INIT_TRAMPOLINE:
4169 tree tramp = gimple_call_arg (t, 0);
4170 tree nfunc = gimple_call_arg (t, 1);
4171 tree frame = gimple_call_arg (t, 2);
4173 struct constraint_expr lhs, *rhsp;
4176 varinfo_t nfi = NULL;
4177 gcc_assert (TREE_CODE (nfunc) == ADDR_EXPR);
4178 nfi = lookup_vi_for_tree (TREE_OPERAND (nfunc, 0));
4181 lhs = get_function_part_constraint (nfi, fi_static_chain);
4182 get_constraint_for (frame, &rhsc);
4183 for (i = 0; VEC_iterate (ce_s, rhsc, i, rhsp); ++i)
4184 process_constraint (new_constraint (lhs, *rhsp));
4185 VEC_free (ce_s, heap, rhsc);
4187 /* Make the frame point to the function for
4188 the trampoline adjustment call. */
4189 get_constraint_for (tramp, &lhsc);
4191 get_constraint_for (nfunc, &rhsc);
4192 process_all_all_constraints (lhsc, rhsc);
4193 VEC_free (ce_s, heap, rhsc);
4194 VEC_free (ce_s, heap, lhsc);
4199 /* Else fallthru to generic handling which will let
4200 the frame escape. */
4203 case BUILT_IN_ADJUST_TRAMPOLINE:
4205 tree tramp = gimple_call_arg (t, 0);
4206 tree res = gimple_call_lhs (t);
4207 if (in_ipa_mode && res)
4209 get_constraint_for (res, &lhsc);
4210 get_constraint_for (tramp, &rhsc);
4212 process_all_all_constraints (lhsc, rhsc);
4213 VEC_free (ce_s, heap, rhsc);
4214 VEC_free (ce_s, heap, lhsc);
4218 /* Variadic argument handling needs to be handled in IPA
4220 case BUILT_IN_VA_START:
4224 tree valist = gimple_call_arg (t, 0);
4225 struct constraint_expr rhs, *lhsp;
4227 /* The va_list gets access to pointers in variadic
4229 fi = lookup_vi_for_tree (cfun->decl);
4230 gcc_assert (fi != NULL);
4231 get_constraint_for (valist, &lhsc);
4233 rhs = get_function_part_constraint (fi, ~0);
4234 rhs.type = ADDRESSOF;
4235 for (i = 0; VEC_iterate (ce_s, lhsc, i, lhsp); ++i)
4236 process_constraint (new_constraint (*lhsp, rhs));
4237 VEC_free (ce_s, heap, lhsc);
4238 /* va_list is clobbered. */
4239 make_constraint_to (get_call_clobber_vi (t)->id, valist);
4244 /* va_end doesn't have any effect that matters. */
4245 case BUILT_IN_VA_END:
4247 /* printf-style functions may have hooks to set pointers to
4248 point to somewhere into the generated string. Leave them
4249 for a later excercise... */
4251 /* Fallthru to general call handling. */;
4255 && (!(fi = lookup_vi_for_tree (fndecl))
4256 || !fi->is_fn_info)))
4258 VEC(ce_s, heap) *rhsc = NULL;
4259 int flags = gimple_call_flags (t);
4261 /* Const functions can return their arguments and addresses
4262 of global memory but not of escaped memory. */
4263 if (flags & (ECF_CONST|ECF_NOVOPS))
4265 if (gimple_call_lhs (t)
4266 && could_have_pointers (gimple_call_lhs (t)))
4267 handle_const_call (t, &rhsc);
4269 /* Pure functions can return addresses in and of memory
4270 reachable from their arguments, but they are not an escape
4271 point for reachable memory of their arguments. */
4272 else if (flags & (ECF_PURE|ECF_LOOPING_CONST_OR_PURE))
4273 handle_pure_call (t, &rhsc);
4275 handle_rhs_call (t, &rhsc);
4276 if (gimple_call_lhs (t)
4277 && could_have_pointers (gimple_call_lhs (t)))
4278 handle_lhs_call (t, gimple_call_lhs (t), flags, rhsc, fndecl);
4279 VEC_free (ce_s, heap, rhsc);
4286 fi = get_fi_for_callee (t);
4288 /* Assign all the passed arguments to the appropriate incoming
4289 parameters of the function. */
4290 for (j = 0; j < gimple_call_num_args (t); j++)
4292 struct constraint_expr lhs ;
4293 struct constraint_expr *rhsp;
4294 tree arg = gimple_call_arg (t, j);
4296 if (!could_have_pointers (arg))
4299 get_constraint_for (arg, &rhsc);
4300 lhs = get_function_part_constraint (fi, fi_parm_base + j);
4301 while (VEC_length (ce_s, rhsc) != 0)
4303 rhsp = VEC_last (ce_s, rhsc);
4304 process_constraint (new_constraint (lhs, *rhsp));
4305 VEC_pop (ce_s, rhsc);
4309 /* If we are returning a value, assign it to the result. */
4310 lhsop = gimple_call_lhs (t);
4312 && type_could_have_pointers (TREE_TYPE (lhsop)))
4314 struct constraint_expr rhs;
4315 struct constraint_expr *lhsp;
4317 get_constraint_for (lhsop, &lhsc);
4318 rhs = get_function_part_constraint (fi, fi_result);
4320 && DECL_RESULT (fndecl)
4321 && DECL_BY_REFERENCE (DECL_RESULT (fndecl)))
4323 VEC(ce_s, heap) *tem = NULL;
4324 VEC_safe_push (ce_s, heap, tem, &rhs);
4326 rhs = *VEC_index (ce_s, tem, 0);
4327 VEC_free(ce_s, heap, tem);
4329 for (j = 0; VEC_iterate (ce_s, lhsc, j, lhsp); j++)
4330 process_constraint (new_constraint (*lhsp, rhs));
4333 /* If we pass the result decl by reference, honor that. */
4336 && DECL_RESULT (fndecl)
4337 && DECL_BY_REFERENCE (DECL_RESULT (fndecl)))
4339 struct constraint_expr lhs;
4340 struct constraint_expr *rhsp;
4342 get_constraint_for_address_of (lhsop, &rhsc);
4343 lhs = get_function_part_constraint (fi, fi_result);
4344 for (j = 0; VEC_iterate (ce_s, rhsc, j, rhsp); j++)
4345 process_constraint (new_constraint (lhs, *rhsp));
4346 VEC_free (ce_s, heap, rhsc);
4349 /* If we use a static chain, pass it along. */
4350 if (gimple_call_chain (t))
4352 struct constraint_expr lhs;
4353 struct constraint_expr *rhsp;
4355 get_constraint_for (gimple_call_chain (t), &rhsc);
4356 lhs = get_function_part_constraint (fi, fi_static_chain);
4357 for (j = 0; VEC_iterate (ce_s, rhsc, j, rhsp); j++)
4358 process_constraint (new_constraint (lhs, *rhsp));
4362 /* Otherwise, just a regular assignment statement. Only care about
4363 operations with pointer result, others are dealt with as escape
4364 points if they have pointer operands. */
4365 else if (is_gimple_assign (t)
4366 && type_could_have_pointers (TREE_TYPE (gimple_assign_lhs (t))))
4368 /* Otherwise, just a regular assignment statement. */
4369 tree lhsop = gimple_assign_lhs (t);
4370 tree rhsop = (gimple_num_ops (t) == 2) ? gimple_assign_rhs1 (t) : NULL;
4372 if (rhsop && AGGREGATE_TYPE_P (TREE_TYPE (lhsop)))
4373 do_structure_copy (lhsop, rhsop);
4376 struct constraint_expr temp;
4377 get_constraint_for (lhsop, &lhsc);
4379 if (gimple_assign_rhs_code (t) == POINTER_PLUS_EXPR)
4380 get_constraint_for_ptr_offset (gimple_assign_rhs1 (t),
4381 gimple_assign_rhs2 (t), &rhsc);
4382 else if ((CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (t))
4383 && !(POINTER_TYPE_P (gimple_expr_type (t))
4384 && !POINTER_TYPE_P (TREE_TYPE (rhsop))))
4385 || gimple_assign_single_p (t))
4386 get_constraint_for (rhsop, &rhsc);
4389 temp.type = ADDRESSOF;
4390 temp.var = anything_id;
4392 VEC_safe_push (ce_s, heap, rhsc, &temp);
4394 process_all_all_constraints (lhsc, rhsc);
4396 /* If there is a store to a global variable the rhs escapes. */
4397 if ((lhsop = get_base_address (lhsop)) != NULL_TREE
4399 && is_global_var (lhsop)
4401 || DECL_EXTERNAL (lhsop) || TREE_PUBLIC (lhsop)))
4402 make_escape_constraint (rhsop);
4403 /* If this is a conversion of a non-restrict pointer to a
4404 restrict pointer track it with a new heapvar. */
4405 else if (gimple_assign_cast_p (t)
4406 && POINTER_TYPE_P (TREE_TYPE (rhsop))
4407 && POINTER_TYPE_P (TREE_TYPE (lhsop))
4408 && !TYPE_RESTRICT (TREE_TYPE (rhsop))
4409 && TYPE_RESTRICT (TREE_TYPE (lhsop)))
4410 make_constraint_from_restrict (get_vi_for_tree (lhsop),
4413 /* For conversions of pointers to non-pointers the pointer escapes. */
4414 else if (gimple_assign_cast_p (t)
4415 && POINTER_TYPE_P (TREE_TYPE (gimple_assign_rhs1 (t)))
4416 && !POINTER_TYPE_P (TREE_TYPE (gimple_assign_lhs (t))))
4418 make_escape_constraint (gimple_assign_rhs1 (t));
4420 /* Handle escapes through return. */
4421 else if (gimple_code (t) == GIMPLE_RETURN
4422 && gimple_return_retval (t) != NULL_TREE
4423 && could_have_pointers (gimple_return_retval (t)))
4427 || !(fi = get_vi_for_tree (cfun->decl)))
4428 make_escape_constraint (gimple_return_retval (t));
4429 else if (in_ipa_mode
4432 struct constraint_expr lhs ;
4433 struct constraint_expr *rhsp;
4436 lhs = get_function_part_constraint (fi, fi_result);
4437 get_constraint_for (gimple_return_retval (t), &rhsc);
4438 for (i = 0; VEC_iterate (ce_s, rhsc, i, rhsp); i++)
4439 process_constraint (new_constraint (lhs, *rhsp));
4442 /* Handle asms conservatively by adding escape constraints to everything. */
4443 else if (gimple_code (t) == GIMPLE_ASM)
4445 unsigned i, noutputs;
4446 const char **oconstraints;
4447 const char *constraint;
4448 bool allows_mem, allows_reg, is_inout;
4450 noutputs = gimple_asm_noutputs (t);
4451 oconstraints = XALLOCAVEC (const char *, noutputs);
4453 for (i = 0; i < noutputs; ++i)
4455 tree link = gimple_asm_output_op (t, i);
4456 tree op = TREE_VALUE (link);
4458 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4459 oconstraints[i] = constraint;
4460 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
4461 &allows_reg, &is_inout);
4463 /* A memory constraint makes the address of the operand escape. */
4464 if (!allows_reg && allows_mem)
4465 make_escape_constraint (build_fold_addr_expr (op));
4467 /* The asm may read global memory, so outputs may point to
4468 any global memory. */
4469 if (op && could_have_pointers (op))
4471 VEC(ce_s, heap) *lhsc = NULL;
4472 struct constraint_expr rhsc, *lhsp;
4474 get_constraint_for (op, &lhsc);
4475 rhsc.var = nonlocal_id;
4478 for (j = 0; VEC_iterate (ce_s, lhsc, j, lhsp); j++)
4479 process_constraint (new_constraint (*lhsp, rhsc));
4480 VEC_free (ce_s, heap, lhsc);
4483 for (i = 0; i < gimple_asm_ninputs (t); ++i)
4485 tree link = gimple_asm_input_op (t, i);
4486 tree op = TREE_VALUE (link);
4488 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
4490 parse_input_constraint (&constraint, 0, 0, noutputs, 0, oconstraints,
4491 &allows_mem, &allows_reg);
4493 /* A memory constraint makes the address of the operand escape. */
4494 if (!allows_reg && allows_mem)
4495 make_escape_constraint (build_fold_addr_expr (op));
4496 /* Strictly we'd only need the constraint to ESCAPED if
4497 the asm clobbers memory, otherwise using something
4498 along the lines of per-call clobbers/uses would be enough. */
4499 else if (op && could_have_pointers (op))
4500 make_escape_constraint (op);
4504 VEC_free (ce_s, heap, rhsc);
4505 VEC_free (ce_s, heap, lhsc);
4509 /* Create a constraint adding to the clobber set of FI the memory
4510 pointed to by PTR. */
4513 process_ipa_clobber (varinfo_t fi, tree ptr)
4515 VEC(ce_s, heap) *ptrc = NULL;
4516 struct constraint_expr *c, lhs;
4518 get_constraint_for (ptr, &ptrc);
4519 lhs = get_function_part_constraint (fi, fi_clobbers);
4520 for (i = 0; VEC_iterate (ce_s, ptrc, i, c); i++)
4521 process_constraint (new_constraint (lhs, *c));
4522 VEC_free (ce_s, heap, ptrc);
4525 /* Walk statement T setting up clobber and use constraints according to the
4526 references found in T. This function is a main part of the
4527 IPA constraint builder. */
4530 find_func_clobbers (gimple origt)
4533 VEC(ce_s, heap) *lhsc = NULL;
4534 VEC(ce_s, heap) *rhsc = NULL;
4537 /* Add constraints for clobbered/used in IPA mode.
4538 We are not interested in what automatic variables are clobbered
4539 or used as we only use the information in the caller to which
4540 they do not escape. */
4541 gcc_assert (in_ipa_mode);
4543 /* If the stmt refers to memory in any way it better had a VUSE. */
4544 if (gimple_vuse (t) == NULL_TREE)
4547 /* We'd better have function information for the current function. */
4548 fi = lookup_vi_for_tree (cfun->decl);
4549 gcc_assert (fi != NULL);
4551 /* Account for stores in assignments and calls. */
4552 if (gimple_vdef (t) != NULL_TREE
4553 && gimple_has_lhs (t))
4555 tree lhs = gimple_get_lhs (t);
4557 while (handled_component_p (tem))
4558 tem = TREE_OPERAND (tem, 0);
4560 && !auto_var_in_fn_p (tem, cfun->decl))
4561 || INDIRECT_REF_P (tem))
4563 struct constraint_expr lhsc, *rhsp;
4565 lhsc = get_function_part_constraint (fi, fi_clobbers);
4566 get_constraint_for_address_of (lhs, &rhsc);
4567 for (i = 0; VEC_iterate (ce_s, rhsc, i, rhsp); i++)
4568 process_constraint (new_constraint (lhsc, *rhsp));
4569 VEC_free (ce_s, heap, rhsc);
4573 /* Account for uses in assigments and returns. */
4574 if (gimple_assign_single_p (t)
4575 || (gimple_code (t) == GIMPLE_RETURN
4576 && gimple_return_retval (t) != NULL_TREE))
4578 tree rhs = (gimple_assign_single_p (t)
4579 ? gimple_assign_rhs1 (t) : gimple_return_retval (t));
4581 while (handled_component_p (tem))
4582 tem = TREE_OPERAND (tem, 0);
4584 && !auto_var_in_fn_p (tem, cfun->decl))
4585 || INDIRECT_REF_P (tem))
4587 struct constraint_expr lhs, *rhsp;
4589 lhs = get_function_part_constraint (fi, fi_uses);
4590 get_constraint_for_address_of (rhs, &rhsc);
4591 for (i = 0; VEC_iterate (ce_s, rhsc, i, rhsp); i++)
4592 process_constraint (new_constraint (lhs, *rhsp));
4593 VEC_free (ce_s, heap, rhsc);
4597 if (is_gimple_call (t))
4599 varinfo_t cfi = NULL;
4600 tree decl = gimple_call_fndecl (t);
4601 struct constraint_expr lhs, rhs;
4604 /* For builtins we do not have separate function info. For those
4605 we do not generate escapes for we have to generate clobbers/uses. */
4607 && DECL_BUILT_IN_CLASS (decl) == BUILT_IN_NORMAL)
4608 switch (DECL_FUNCTION_CODE (decl))
4610 /* The following functions use and clobber memory pointed to
4611 by their arguments. */
4612 case BUILT_IN_STRCPY:
4613 case BUILT_IN_STRNCPY:
4614 case BUILT_IN_BCOPY:
4615 case BUILT_IN_MEMCPY:
4616 case BUILT_IN_MEMMOVE:
4617 case BUILT_IN_MEMPCPY:
4618 case BUILT_IN_STPCPY:
4619 case BUILT_IN_STPNCPY:
4620 case BUILT_IN_STRCAT:
4621 case BUILT_IN_STRNCAT:
4623 tree dest = gimple_call_arg (t, (DECL_FUNCTION_CODE (decl)
4624 == BUILT_IN_BCOPY ? 1 : 0));
4625 tree src = gimple_call_arg (t, (DECL_FUNCTION_CODE (decl)
4626 == BUILT_IN_BCOPY ? 0 : 1));
4628 struct constraint_expr *rhsp, *lhsp;
4629 get_constraint_for_ptr_offset (dest, NULL_TREE, &lhsc);
4630 lhs = get_function_part_constraint (fi, fi_clobbers);
4631 for (i = 0; VEC_iterate (ce_s, lhsc, i, lhsp); i++)
4632 process_constraint (new_constraint (lhs, *lhsp));
4633 VEC_free (ce_s, heap, lhsc);
4634 get_constraint_for_ptr_offset (src, NULL_TREE, &rhsc);
4635 lhs = get_function_part_constraint (fi, fi_uses);
4636 for (i = 0; VEC_iterate (ce_s, rhsc, i, rhsp); i++)
4637 process_constraint (new_constraint (lhs, *rhsp));
4638 VEC_free (ce_s, heap, rhsc);
4641 /* The following function clobbers memory pointed to by
4643 case BUILT_IN_MEMSET:
4645 tree dest = gimple_call_arg (t, 0);
4648 get_constraint_for_ptr_offset (dest, NULL_TREE, &lhsc);
4649 lhs = get_function_part_constraint (fi, fi_clobbers);
4650 for (i = 0; VEC_iterate (ce_s, lhsc, i, lhsp); i++)
4651 process_constraint (new_constraint (lhs, *lhsp));
4652 VEC_free (ce_s, heap, lhsc);
4655 /* The following functions clobber their second and third
4657 case BUILT_IN_SINCOS:
4658 case BUILT_IN_SINCOSF:
4659 case BUILT_IN_SINCOSL:
4661 process_ipa_clobber (fi, gimple_call_arg (t, 1));
4662 process_ipa_clobber (fi, gimple_call_arg (t, 2));
4665 /* The following functions clobber their second argument. */
4666 case BUILT_IN_FREXP:
4667 case BUILT_IN_FREXPF:
4668 case BUILT_IN_FREXPL:
4669 case BUILT_IN_LGAMMA_R:
4670 case BUILT_IN_LGAMMAF_R:
4671 case BUILT_IN_LGAMMAL_R:
4672 case BUILT_IN_GAMMA_R:
4673 case BUILT_IN_GAMMAF_R:
4674 case BUILT_IN_GAMMAL_R:
4676 case BUILT_IN_MODFF:
4677 case BUILT_IN_MODFL:
4679 process_ipa_clobber (fi, gimple_call_arg (t, 1));
4682 /* The following functions clobber their third argument. */
4683 case BUILT_IN_REMQUO:
4684 case BUILT_IN_REMQUOF:
4685 case BUILT_IN_REMQUOL:
4687 process_ipa_clobber (fi, gimple_call_arg (t, 2));
4690 /* The following functions neither read nor clobber memory. */
4693 /* Trampolines are of no interest to us. */
4694 case BUILT_IN_INIT_TRAMPOLINE:
4695 case BUILT_IN_ADJUST_TRAMPOLINE:
4697 case BUILT_IN_VA_START:
4698 case BUILT_IN_VA_END:
4700 /* printf-style functions may have hooks to set pointers to
4701 point to somewhere into the generated string. Leave them
4702 for a later excercise... */
4704 /* Fallthru to general call handling. */;
4707 /* Parameters passed by value are used. */
4708 lhs = get_function_part_constraint (fi, fi_uses);
4709 for (i = 0; i < gimple_call_num_args (t); i++)
4711 struct constraint_expr *rhsp;
4712 tree arg = gimple_call_arg (t, i);
4714 if (TREE_CODE (arg) == SSA_NAME
4715 || is_gimple_min_invariant (arg))
4718 get_constraint_for_address_of (arg, &rhsc);
4719 for (j = 0; VEC_iterate (ce_s, rhsc, j, rhsp); j++)
4720 process_constraint (new_constraint (lhs, *rhsp));
4721 VEC_free (ce_s, heap, rhsc);
4724 /* Build constraints for propagating clobbers/uses along the
4726 cfi = get_fi_for_callee (t);
4727 if (cfi->id == anything_id)
4729 if (gimple_vdef (t))
4730 make_constraint_from (first_vi_for_offset (fi, fi_clobbers),
4732 make_constraint_from (first_vi_for_offset (fi, fi_uses),
4737 /* For callees without function info (that's external functions),
4738 ESCAPED is clobbered and used. */
4739 if (gimple_call_fndecl (t)
4740 && !cfi->is_fn_info)
4744 if (gimple_vdef (t))
4745 make_copy_constraint (first_vi_for_offset (fi, fi_clobbers),
4747 make_copy_constraint (first_vi_for_offset (fi, fi_uses), escaped_id);
4749 /* Also honor the call statement use/clobber info. */
4750 if ((vi = lookup_call_clobber_vi (t)) != NULL)
4751 make_copy_constraint (first_vi_for_offset (fi, fi_clobbers),
4753 if ((vi = lookup_call_use_vi (t)) != NULL)
4754 make_copy_constraint (first_vi_for_offset (fi, fi_uses),
4759 /* Otherwise the caller clobbers and uses what the callee does.
4760 ??? This should use a new complex constraint that filters
4761 local variables of the callee. */
4762 if (gimple_vdef (t))
4764 lhs = get_function_part_constraint (fi, fi_clobbers);
4765 rhs = get_function_part_constraint (cfi, fi_clobbers);
4766 process_constraint (new_constraint (lhs, rhs));
4768 lhs = get_function_part_constraint (fi, fi_uses);
4769 rhs = get_function_part_constraint (cfi, fi_uses);
4770 process_constraint (new_constraint (lhs, rhs));
4772 else if (gimple_code (t) == GIMPLE_ASM)
4774 /* ??? Ick. We can do better. */
4775 if (gimple_vdef (t))
4776 make_constraint_from (first_vi_for_offset (fi, fi_clobbers),
4778 make_constraint_from (first_vi_for_offset (fi, fi_uses),
4782 VEC_free (ce_s, heap, rhsc);
4786 /* Find the first varinfo in the same variable as START that overlaps with
4787 OFFSET. Return NULL if we can't find one. */
4790 first_vi_for_offset (varinfo_t start, unsigned HOST_WIDE_INT offset)
4792 /* If the offset is outside of the variable, bail out. */
4793 if (offset >= start->fullsize)
4796 /* If we cannot reach offset from start, lookup the first field
4797 and start from there. */
4798 if (start->offset > offset)
4799 start = lookup_vi_for_tree (start->decl);
4803 /* We may not find a variable in the field list with the actual
4804 offset when when we have glommed a structure to a variable.
4805 In that case, however, offset should still be within the size
4807 if (offset >= start->offset
4808 && (offset - start->offset) < start->size)
4817 /* Find the first varinfo in the same variable as START that overlaps with
4818 OFFSET. If there is no such varinfo the varinfo directly preceding
4819 OFFSET is returned. */
4822 first_or_preceding_vi_for_offset (varinfo_t start,
4823 unsigned HOST_WIDE_INT offset)
4825 /* If we cannot reach offset from start, lookup the first field
4826 and start from there. */
4827 if (start->offset > offset)
4828 start = lookup_vi_for_tree (start->decl);
4830 /* We may not find a variable in the field list with the actual
4831 offset when when we have glommed a structure to a variable.
4832 In that case, however, offset should still be within the size
4834 If we got beyond the offset we look for return the field
4835 directly preceding offset which may be the last field. */
4837 && offset >= start->offset
4838 && !((offset - start->offset) < start->size))
4839 start = start->next;
4845 /* This structure is used during pushing fields onto the fieldstack
4846 to track the offset of the field, since bitpos_of_field gives it
4847 relative to its immediate containing type, and we want it relative
4848 to the ultimate containing object. */
4852 /* Offset from the base of the base containing object to this field. */
4853 HOST_WIDE_INT offset;
4855 /* Size, in bits, of the field. */
4856 unsigned HOST_WIDE_INT size;
4858 unsigned has_unknown_size : 1;
4860 unsigned may_have_pointers : 1;
4862 unsigned only_restrict_pointers : 1;
4864 typedef struct fieldoff fieldoff_s;
4866 DEF_VEC_O(fieldoff_s);
4867 DEF_VEC_ALLOC_O(fieldoff_s,heap);
4869 /* qsort comparison function for two fieldoff's PA and PB */
4872 fieldoff_compare (const void *pa, const void *pb)
4874 const fieldoff_s *foa = (const fieldoff_s *)pa;
4875 const fieldoff_s *fob = (const fieldoff_s *)pb;
4876 unsigned HOST_WIDE_INT foasize, fobsize;
4878 if (foa->offset < fob->offset)
4880 else if (foa->offset > fob->offset)
4883 foasize = foa->size;
4884 fobsize = fob->size;
4885 if (foasize < fobsize)
4887 else if (foasize > fobsize)
4892 /* Sort a fieldstack according to the field offset and sizes. */
4894 sort_fieldstack (VEC(fieldoff_s,heap) *fieldstack)
4896 qsort (VEC_address (fieldoff_s, fieldstack),
4897 VEC_length (fieldoff_s, fieldstack),
4898 sizeof (fieldoff_s),
4902 /* Return true if V is a tree that we can have subvars for.
4903 Normally, this is any aggregate type. Also complex
4904 types which are not gimple registers can have subvars. */
4907 var_can_have_subvars (const_tree v)
4909 /* Volatile variables should never have subvars. */
4910 if (TREE_THIS_VOLATILE (v))
4913 /* Non decls or memory tags can never have subvars. */
4917 /* Aggregates without overlapping fields can have subvars. */
4918 if (TREE_CODE (TREE_TYPE (v)) == RECORD_TYPE)
4924 /* Given a TYPE, and a vector of field offsets FIELDSTACK, push all
4925 the fields of TYPE onto fieldstack, recording their offsets along
4928 OFFSET is used to keep track of the offset in this entire
4929 structure, rather than just the immediately containing structure.
4930 Returns false if the caller is supposed to handle the field we
4934 push_fields_onto_fieldstack (tree type, VEC(fieldoff_s,heap) **fieldstack,
4935 HOST_WIDE_INT offset, bool must_have_pointers_p)
4938 bool empty_p = true;
4940 if (TREE_CODE (type) != RECORD_TYPE)
4943 /* If the vector of fields is growing too big, bail out early.
4944 Callers check for VEC_length <= MAX_FIELDS_FOR_FIELD_SENSITIVE, make
4946 if (VEC_length (fieldoff_s, *fieldstack) > MAX_FIELDS_FOR_FIELD_SENSITIVE)
4949 for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
4950 if (TREE_CODE (field) == FIELD_DECL)
4953 HOST_WIDE_INT foff = bitpos_of_field (field);
4955 if (!var_can_have_subvars (field)
4956 || TREE_CODE (TREE_TYPE (field)) == QUAL_UNION_TYPE
4957 || TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
4959 else if (!push_fields_onto_fieldstack
4960 (TREE_TYPE (field), fieldstack, offset + foff,
4961 must_have_pointers_p)
4962 && (DECL_SIZE (field)
4963 && !integer_zerop (DECL_SIZE (field))))
4964 /* Empty structures may have actual size, like in C++. So
4965 see if we didn't push any subfields and the size is
4966 nonzero, push the field onto the stack. */
4971 fieldoff_s *pair = NULL;
4972 bool has_unknown_size = false;
4974 if (!VEC_empty (fieldoff_s, *fieldstack))
4975 pair = VEC_last (fieldoff_s, *fieldstack);
4977 if (!DECL_SIZE (field)
4978 || !host_integerp (DECL_SIZE (field), 1))
4979 has_unknown_size = true;
4981 /* If adjacent fields do not contain pointers merge them. */
4983 && !pair->may_have_pointers
4984 && !pair->has_unknown_size
4985 && !has_unknown_size
4986 && pair->offset + (HOST_WIDE_INT)pair->size == offset + foff
4987 && !must_have_pointers_p
4988 && !could_have_pointers (field))
4990 pair->size += TREE_INT_CST_LOW (DECL_SIZE (field));
4994 pair = VEC_safe_push (fieldoff_s, heap, *fieldstack, NULL);
4995 pair->offset = offset + foff;
4996 pair->has_unknown_size = has_unknown_size;
4997 if (!has_unknown_size)
4998 pair->size = TREE_INT_CST_LOW (DECL_SIZE (field));
5001 pair->may_have_pointers
5002 = must_have_pointers_p || could_have_pointers (field);
5003 pair->only_restrict_pointers
5004 = (!has_unknown_size
5005 && POINTER_TYPE_P (TREE_TYPE (field))
5006 && TYPE_RESTRICT (TREE_TYPE (field)));
5016 /* Count the number of arguments DECL has, and set IS_VARARGS to true
5017 if it is a varargs function. */
5020 count_num_arguments (tree decl, bool *is_varargs)
5022 unsigned int num = 0;
5025 /* Capture named arguments for K&R functions. They do not
5026 have a prototype and thus no TYPE_ARG_TYPES. */
5027 for (t = DECL_ARGUMENTS (decl); t; t = TREE_CHAIN (t))
5030 /* Check if the function has variadic arguments. */
5031 for (t = TYPE_ARG_TYPES (TREE_TYPE (decl)); t; t = TREE_CHAIN (t))
5032 if (TREE_VALUE (t) == void_type_node)
5040 /* Creation function node for DECL, using NAME, and return the index
5041 of the variable we've created for the function. */
5044 create_function_info_for (tree decl, const char *name)
5046 struct function *fn = DECL_STRUCT_FUNCTION (decl);
5047 varinfo_t vi, prev_vi;
5050 bool is_varargs = false;
5051 unsigned int num_args = count_num_arguments (decl, &is_varargs);
5053 /* Create the variable info. */
5055 vi = new_var_info (decl, name);
5058 vi->fullsize = fi_parm_base + num_args;
5060 vi->may_have_pointers = false;
5063 insert_vi_for_tree (vi->decl, vi);
5067 /* Create a variable for things the function clobbers and one for
5068 things the function uses. */
5070 varinfo_t clobbervi, usevi;
5071 const char *newname;
5074 asprintf (&tempname, "%s.clobber", name);
5075 newname = ggc_strdup (tempname);
5078 clobbervi = new_var_info (NULL, newname);
5079 clobbervi->offset = fi_clobbers;
5080 clobbervi->size = 1;
5081 clobbervi->fullsize = vi->fullsize;
5082 clobbervi->is_full_var = true;
5083 clobbervi->is_global_var = false;
5084 gcc_assert (prev_vi->offset < clobbervi->offset);
5085 prev_vi->next = clobbervi;
5086 prev_vi = clobbervi;
5088 asprintf (&tempname, "%s.use", name);
5089 newname = ggc_strdup (tempname);
5092 usevi = new_var_info (NULL, newname);
5093 usevi->offset = fi_uses;
5095 usevi->fullsize = vi->fullsize;
5096 usevi->is_full_var = true;
5097 usevi->is_global_var = false;
5098 gcc_assert (prev_vi->offset < usevi->offset);
5099 prev_vi->next = usevi;
5103 /* And one for the static chain. */
5104 if (fn->static_chain_decl != NULL_TREE)
5107 const char *newname;
5110 asprintf (&tempname, "%s.chain", name);
5111 newname = ggc_strdup (tempname);
5114 chainvi = new_var_info (fn->static_chain_decl, newname);
5115 chainvi->offset = fi_static_chain;
5117 chainvi->fullsize = vi->fullsize;
5118 chainvi->is_full_var = true;
5119 chainvi->is_global_var = false;
5120 gcc_assert (prev_vi->offset < chainvi->offset);
5121 prev_vi->next = chainvi;
5123 insert_vi_for_tree (fn->static_chain_decl, chainvi);
5126 /* Create a variable for the return var. */
5127 if (DECL_RESULT (decl) != NULL
5128 || !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (decl))))
5131 const char *newname;
5133 tree resultdecl = decl;
5135 if (DECL_RESULT (decl))
5136 resultdecl = DECL_RESULT (decl);
5138 asprintf (&tempname, "%s.result", name);
5139 newname = ggc_strdup (tempname);
5142 resultvi = new_var_info (resultdecl, newname);
5143 resultvi->offset = fi_result;
5145 resultvi->fullsize = vi->fullsize;
5146 resultvi->is_full_var = true;
5147 if (DECL_RESULT (decl))
5148 resultvi->may_have_pointers = could_have_pointers (DECL_RESULT (decl));
5149 gcc_assert (prev_vi->offset < resultvi->offset);
5150 prev_vi->next = resultvi;
5152 if (DECL_RESULT (decl))
5153 insert_vi_for_tree (DECL_RESULT (decl), resultvi);
5156 /* Set up variables for each argument. */
5157 arg = DECL_ARGUMENTS (decl);
5158 for (i = 0; i < num_args; i++)
5161 const char *newname;
5163 tree argdecl = decl;
5168 asprintf (&tempname, "%s.arg%d", name, i);
5169 newname = ggc_strdup (tempname);
5172 argvi = new_var_info (argdecl, newname);
5173 argvi->offset = fi_parm_base + i;
5175 argvi->is_full_var = true;
5176 argvi->fullsize = vi->fullsize;
5178 argvi->may_have_pointers = could_have_pointers (arg);
5179 gcc_assert (prev_vi->offset < argvi->offset);
5180 prev_vi->next = argvi;
5184 insert_vi_for_tree (arg, argvi);
5185 arg = TREE_CHAIN (arg);
5189 /* Add one representative for all further args. */
5193 const char *newname;
5197 asprintf (&tempname, "%s.varargs", name);
5198 newname = ggc_strdup (tempname);
5201 /* We need sth that can be pointed to for va_start. */
5202 decl = create_tmp_var_raw (ptr_type_node, name);
5205 argvi = new_var_info (decl, newname);
5206 argvi->offset = fi_parm_base + num_args;
5208 argvi->is_full_var = true;
5209 argvi->is_heap_var = true;
5210 argvi->fullsize = vi->fullsize;
5211 gcc_assert (prev_vi->offset < argvi->offset);
5212 prev_vi->next = argvi;
5220 /* Return true if FIELDSTACK contains fields that overlap.
5221 FIELDSTACK is assumed to be sorted by offset. */
5224 check_for_overlaps (VEC (fieldoff_s,heap) *fieldstack)
5226 fieldoff_s *fo = NULL;
5228 HOST_WIDE_INT lastoffset = -1;
5230 for (i = 0; VEC_iterate (fieldoff_s, fieldstack, i, fo); i++)
5232 if (fo->offset == lastoffset)
5234 lastoffset = fo->offset;
5239 /* Create a varinfo structure for NAME and DECL, and add it to VARMAP.
5240 This will also create any varinfo structures necessary for fields
5244 create_variable_info_for_1 (tree decl, const char *name)
5246 varinfo_t vi, newvi;
5247 tree decl_type = TREE_TYPE (decl);
5248 tree declsize = DECL_P (decl) ? DECL_SIZE (decl) : TYPE_SIZE (decl_type);
5249 VEC (fieldoff_s,heap) *fieldstack = NULL;
5254 || !host_integerp (declsize, 1))
5256 vi = new_var_info (decl, name);
5260 vi->is_unknown_size_var = true;
5261 vi->is_full_var = true;
5262 vi->may_have_pointers = could_have_pointers (decl);
5266 /* Collect field information. */
5267 if (use_field_sensitive
5268 && var_can_have_subvars (decl)
5269 /* ??? Force us to not use subfields for global initializers
5270 in IPA mode. Else we'd have to parse arbitrary initializers. */
5272 && is_global_var (decl)
5273 && DECL_INITIAL (decl)))
5275 fieldoff_s *fo = NULL;
5276 bool notokay = false;
5279 push_fields_onto_fieldstack (decl_type, &fieldstack, 0,
5281 || DECL_EXTERNAL (decl)
5282 || TREE_ADDRESSABLE (decl));
5284 for (i = 0; !notokay && VEC_iterate (fieldoff_s, fieldstack, i, fo); i++)
5285 if (fo->has_unknown_size
5292 /* We can't sort them if we have a field with a variable sized type,
5293 which will make notokay = true. In that case, we are going to return
5294 without creating varinfos for the fields anyway, so sorting them is a
5298 sort_fieldstack (fieldstack);
5299 /* Due to some C++ FE issues, like PR 22488, we might end up
5300 what appear to be overlapping fields even though they,
5301 in reality, do not overlap. Until the C++ FE is fixed,
5302 we will simply disable field-sensitivity for these cases. */
5303 notokay = check_for_overlaps (fieldstack);
5307 VEC_free (fieldoff_s, heap, fieldstack);
5310 /* If we didn't end up collecting sub-variables create a full
5311 variable for the decl. */
5312 if (VEC_length (fieldoff_s, fieldstack) <= 1
5313 || VEC_length (fieldoff_s, fieldstack) > MAX_FIELDS_FOR_FIELD_SENSITIVE)
5315 vi = new_var_info (decl, name);
5317 vi->may_have_pointers = could_have_pointers (decl);
5318 vi->fullsize = TREE_INT_CST_LOW (declsize);
5319 vi->size = vi->fullsize;
5320 vi->is_full_var = true;
5321 VEC_free (fieldoff_s, heap, fieldstack);
5325 vi = new_var_info (decl, name);
5326 vi->fullsize = TREE_INT_CST_LOW (declsize);
5327 for (i = 0, newvi = vi;
5328 VEC_iterate (fieldoff_s, fieldstack, i, fo);
5329 ++i, newvi = newvi->next)
5331 const char *newname = "NULL";
5336 asprintf (&tempname, "%s." HOST_WIDE_INT_PRINT_DEC
5337 "+" HOST_WIDE_INT_PRINT_DEC, name, fo->offset, fo->size);
5338 newname = ggc_strdup (tempname);
5341 newvi->name = newname;
5342 newvi->offset = fo->offset;
5343 newvi->size = fo->size;
5344 newvi->fullsize = vi->fullsize;
5345 newvi->may_have_pointers = fo->may_have_pointers;
5346 newvi->only_restrict_pointers = fo->only_restrict_pointers;
5347 if (i + 1 < VEC_length (fieldoff_s, fieldstack))
5348 newvi->next = new_var_info (decl, name);
5351 VEC_free (fieldoff_s, heap, fieldstack);
5357 create_variable_info_for (tree decl, const char *name)
5359 varinfo_t vi = create_variable_info_for_1 (decl, name);
5360 unsigned int id = vi->id;
5362 insert_vi_for_tree (decl, vi);
5364 /* Create initial constraints for globals. */
5365 for (; vi; vi = vi->next)
5367 if (!vi->may_have_pointers
5368 || !vi->is_global_var)
5371 /* Mark global restrict qualified pointers. */
5372 if ((POINTER_TYPE_P (TREE_TYPE (decl))
5373 && TYPE_RESTRICT (TREE_TYPE (decl)))
5374 || vi->only_restrict_pointers)
5375 make_constraint_from_restrict (vi, "GLOBAL_RESTRICT");
5377 /* For escaped variables initialize them from nonlocal. */
5379 || DECL_EXTERNAL (decl) || TREE_PUBLIC (decl))
5380 make_copy_constraint (vi, nonlocal_id);
5382 /* If this is a global variable with an initializer and we are in
5383 IPA mode generate constraints for it. In non-IPA mode
5384 the initializer from nonlocal is all we need. */
5386 && DECL_INITIAL (decl))
5388 VEC (ce_s, heap) *rhsc = NULL;
5389 struct constraint_expr lhs, *rhsp;
5391 get_constraint_for (DECL_INITIAL (decl), &rhsc);
5395 for (i = 0; VEC_iterate (ce_s, rhsc, i, rhsp); ++i)
5396 process_constraint (new_constraint (lhs, *rhsp));
5397 /* If this is a variable that escapes from the unit
5398 the initializer escapes as well. */
5399 if (DECL_EXTERNAL (decl) || TREE_PUBLIC (decl))
5401 lhs.var = escaped_id;
5404 for (i = 0; VEC_iterate (ce_s, rhsc, i, rhsp); ++i)
5405 process_constraint (new_constraint (lhs, *rhsp));
5407 VEC_free (ce_s, heap, rhsc);
5414 /* Print out the points-to solution for VAR to FILE. */
5417 dump_solution_for_var (FILE *file, unsigned int var)
5419 varinfo_t vi = get_varinfo (var);
5423 /* Dump the solution for unified vars anyway, this avoids difficulties
5424 in scanning dumps in the testsuite. */
5425 fprintf (file, "%s = { ", vi->name);
5426 vi = get_varinfo (find (var));
5427 EXECUTE_IF_SET_IN_BITMAP (vi->solution, 0, i, bi)
5428 fprintf (file, "%s ", get_varinfo (i)->name);
5429 fprintf (file, "}");
5431 /* But note when the variable was unified. */
5433 fprintf (file, " same as %s", vi->name);
5435 fprintf (file, "\n");
5438 /* Print the points-to solution for VAR to stdout. */
5441 debug_solution_for_var (unsigned int var)
5443 dump_solution_for_var (stdout, var);
5446 /* Create varinfo structures for all of the variables in the
5447 function for intraprocedural mode. */
5450 intra_create_variable_infos (void)
5454 /* For each incoming pointer argument arg, create the constraint ARG
5455 = NONLOCAL or a dummy variable if it is a restrict qualified
5456 passed-by-reference argument. */
5457 for (t = DECL_ARGUMENTS (current_function_decl); t; t = TREE_CHAIN (t))
5461 if (!could_have_pointers (t))
5464 /* For restrict qualified pointers to objects passed by
5465 reference build a real representative for the pointed-to object. */
5466 if (DECL_BY_REFERENCE (t)
5467 && POINTER_TYPE_P (TREE_TYPE (t))
5468 && TYPE_RESTRICT (TREE_TYPE (t)))
5470 struct constraint_expr lhsc, rhsc;
5472 tree heapvar = heapvar_lookup (t, 0);
5473 if (heapvar == NULL_TREE)
5476 heapvar = create_tmp_var_raw (TREE_TYPE (TREE_TYPE (t)),
5478 DECL_EXTERNAL (heapvar) = 1;
5479 heapvar_insert (t, 0, heapvar);
5480 ann = get_var_ann (heapvar);
5481 ann->is_heapvar = 1;
5483 if (gimple_referenced_vars (cfun))
5484 add_referenced_var (heapvar);
5485 lhsc.var = get_vi_for_tree (t)->id;
5488 rhsc.var = (vi = get_vi_for_tree (heapvar))->id;
5489 rhsc.type = ADDRESSOF;
5491 process_constraint (new_constraint (lhsc, rhsc));
5492 vi->is_restrict_var = 1;
5496 for (p = get_vi_for_tree (t); p; p = p->next)
5498 if (p->may_have_pointers)
5499 make_constraint_from (p, nonlocal_id);
5500 if (p->only_restrict_pointers)
5501 make_constraint_from_restrict (p, "PARM_RESTRICT");
5503 if (POINTER_TYPE_P (TREE_TYPE (t))
5504 && TYPE_RESTRICT (TREE_TYPE (t)))
5505 make_constraint_from_restrict (get_vi_for_tree (t), "PARM_RESTRICT");
5508 /* Add a constraint for a result decl that is passed by reference. */
5509 if (DECL_RESULT (cfun->decl)
5510 && DECL_BY_REFERENCE (DECL_RESULT (cfun->decl)))
5512 varinfo_t p, result_vi = get_vi_for_tree (DECL_RESULT (cfun->decl));
5514 for (p = result_vi; p; p = p->next)
5515 make_constraint_from (p, nonlocal_id);
5518 /* Add a constraint for the incoming static chain parameter. */
5519 if (cfun->static_chain_decl != NULL_TREE)
5521 varinfo_t p, chain_vi = get_vi_for_tree (cfun->static_chain_decl);
5523 for (p = chain_vi; p; p = p->next)
5524 make_constraint_from (p, nonlocal_id);
5528 /* Structure used to put solution bitmaps in a hashtable so they can
5529 be shared among variables with the same points-to set. */
5531 typedef struct shared_bitmap_info
5535 } *shared_bitmap_info_t;
5536 typedef const struct shared_bitmap_info *const_shared_bitmap_info_t;
5538 static htab_t shared_bitmap_table;
5540 /* Hash function for a shared_bitmap_info_t */
5543 shared_bitmap_hash (const void *p)
5545 const_shared_bitmap_info_t const bi = (const_shared_bitmap_info_t) p;
5546 return bi->hashcode;
5549 /* Equality function for two shared_bitmap_info_t's. */
5552 shared_bitmap_eq (const void *p1, const void *p2)
5554 const_shared_bitmap_info_t const sbi1 = (const_shared_bitmap_info_t) p1;
5555 const_shared_bitmap_info_t const sbi2 = (const_shared_bitmap_info_t) p2;
5556 return bitmap_equal_p (sbi1->pt_vars, sbi2->pt_vars);
5559 /* Lookup a bitmap in the shared bitmap hashtable, and return an already
5560 existing instance if there is one, NULL otherwise. */
5563 shared_bitmap_lookup (bitmap pt_vars)
5566 struct shared_bitmap_info sbi;
5568 sbi.pt_vars = pt_vars;
5569 sbi.hashcode = bitmap_hash (pt_vars);
5571 slot = htab_find_slot_with_hash (shared_bitmap_table, &sbi,
5572 sbi.hashcode, NO_INSERT);
5576 return ((shared_bitmap_info_t) *slot)->pt_vars;
5580 /* Add a bitmap to the shared bitmap hashtable. */
5583 shared_bitmap_add (bitmap pt_vars)
5586 shared_bitmap_info_t sbi = XNEW (struct shared_bitmap_info);
5588 sbi->pt_vars = pt_vars;
5589 sbi->hashcode = bitmap_hash (pt_vars);
5591 slot = htab_find_slot_with_hash (shared_bitmap_table, sbi,
5592 sbi->hashcode, INSERT);
5593 gcc_assert (!*slot);
5594 *slot = (void *) sbi;
5598 /* Set bits in INTO corresponding to the variable uids in solution set FROM. */
5601 set_uids_in_ptset (bitmap into, bitmap from, struct pt_solution *pt)
5606 EXECUTE_IF_SET_IN_BITMAP (from, 0, i, bi)
5608 varinfo_t vi = get_varinfo (i);
5610 /* The only artificial variables that are allowed in a may-alias
5611 set are heap variables. */
5612 if (vi->is_artificial_var && !vi->is_heap_var)
5615 if (TREE_CODE (vi->decl) == VAR_DECL
5616 || TREE_CODE (vi->decl) == PARM_DECL
5617 || TREE_CODE (vi->decl) == RESULT_DECL)
5619 /* If we are in IPA mode we will not recompute points-to
5620 sets after inlining so make sure they stay valid. */
5622 && !DECL_PT_UID_SET_P (vi->decl))
5623 SET_DECL_PT_UID (vi->decl, DECL_UID (vi->decl));
5625 /* Add the decl to the points-to set. Note that the points-to
5626 set contains global variables. */
5627 bitmap_set_bit (into, DECL_PT_UID (vi->decl));
5628 if (vi->is_global_var)
5629 pt->vars_contains_global = true;
5635 /* Compute the points-to solution *PT for the variable VI. */
5638 find_what_var_points_to (varinfo_t orig_vi, struct pt_solution *pt)
5642 bitmap finished_solution;
5646 memset (pt, 0, sizeof (struct pt_solution));
5648 /* This variable may have been collapsed, let's get the real
5650 vi = get_varinfo (find (orig_vi->id));
5652 /* Translate artificial variables into SSA_NAME_PTR_INFO
5654 EXECUTE_IF_SET_IN_BITMAP (vi->solution, 0, i, bi)
5656 varinfo_t vi = get_varinfo (i);
5658 if (vi->is_artificial_var)
5660 if (vi->id == nothing_id)
5662 else if (vi->id == escaped_id)
5665 pt->ipa_escaped = 1;
5669 else if (vi->id == nonlocal_id)
5671 else if (vi->is_heap_var)
5672 /* We represent heapvars in the points-to set properly. */
5674 else if (vi->id == readonly_id)
5677 else if (vi->id == anything_id
5678 || vi->id == integer_id)
5681 if (vi->is_restrict_var)
5682 pt->vars_contains_restrict = true;
5685 /* Instead of doing extra work, simply do not create
5686 elaborate points-to information for pt_anything pointers. */
5688 && (orig_vi->is_artificial_var
5689 || !pt->vars_contains_restrict))
5692 /* Share the final set of variables when possible. */
5693 finished_solution = BITMAP_GGC_ALLOC ();
5694 stats.points_to_sets_created++;
5696 set_uids_in_ptset (finished_solution, vi->solution, pt);
5697 result = shared_bitmap_lookup (finished_solution);
5700 shared_bitmap_add (finished_solution);
5701 pt->vars = finished_solution;
5706 bitmap_clear (finished_solution);
5710 /* Given a pointer variable P, fill in its points-to set. */
5713 find_what_p_points_to (tree p)
5715 struct ptr_info_def *pi;
5719 /* For parameters, get at the points-to set for the actual parm
5721 if (TREE_CODE (p) == SSA_NAME
5722 && TREE_CODE (SSA_NAME_VAR (p)) == PARM_DECL
5723 && SSA_NAME_IS_DEFAULT_DEF (p))
5724 lookup_p = SSA_NAME_VAR (p);
5726 vi = lookup_vi_for_tree (lookup_p);
5730 pi = get_ptr_info (p);
5731 find_what_var_points_to (vi, &pi->pt);
5735 /* Query statistics for points-to solutions. */
5738 unsigned HOST_WIDE_INT pt_solution_includes_may_alias;
5739 unsigned HOST_WIDE_INT pt_solution_includes_no_alias;
5740 unsigned HOST_WIDE_INT pt_solutions_intersect_may_alias;
5741 unsigned HOST_WIDE_INT pt_solutions_intersect_no_alias;
5745 dump_pta_stats (FILE *s)
5747 fprintf (s, "\nPTA query stats:\n");
5748 fprintf (s, " pt_solution_includes: "
5749 HOST_WIDE_INT_PRINT_DEC" disambiguations, "
5750 HOST_WIDE_INT_PRINT_DEC" queries\n",
5751 pta_stats.pt_solution_includes_no_alias,
5752 pta_stats.pt_solution_includes_no_alias
5753 + pta_stats.pt_solution_includes_may_alias);
5754 fprintf (s, " pt_solutions_intersect: "
5755 HOST_WIDE_INT_PRINT_DEC" disambiguations, "
5756 HOST_WIDE_INT_PRINT_DEC" queries\n",
5757 pta_stats.pt_solutions_intersect_no_alias,
5758 pta_stats.pt_solutions_intersect_no_alias
5759 + pta_stats.pt_solutions_intersect_may_alias);
5763 /* Reset the points-to solution *PT to a conservative default
5764 (point to anything). */
5767 pt_solution_reset (struct pt_solution *pt)
5769 memset (pt, 0, sizeof (struct pt_solution));
5770 pt->anything = true;
5773 /* Set the points-to solution *PT to point only to the variables
5774 in VARS. VARS_CONTAINS_GLOBAL specifies whether that contains
5775 global variables and VARS_CONTAINS_RESTRICT specifies whether
5776 it contains restrict tag variables. */
5779 pt_solution_set (struct pt_solution *pt, bitmap vars,
5780 bool vars_contains_global, bool vars_contains_restrict)
5782 memset (pt, 0, sizeof (struct pt_solution));
5784 pt->vars_contains_global = vars_contains_global;
5785 pt->vars_contains_restrict = vars_contains_restrict;
5788 /* Computes the union of the points-to solutions *DEST and *SRC and
5789 stores the result in *DEST. This changes the points-to bitmap
5790 of *DEST and thus may not be used if that might be shared.
5791 The points-to bitmap of *SRC and *DEST will not be shared after
5792 this function if they were not before. */
5795 pt_solution_ior_into (struct pt_solution *dest, struct pt_solution *src)
5797 dest->anything |= src->anything;
5800 pt_solution_reset (dest);
5804 dest->nonlocal |= src->nonlocal;
5805 dest->escaped |= src->escaped;
5806 dest->ipa_escaped |= src->ipa_escaped;
5807 dest->null |= src->null;
5808 dest->vars_contains_global |= src->vars_contains_global;
5809 dest->vars_contains_restrict |= src->vars_contains_restrict;
5814 dest->vars = BITMAP_GGC_ALLOC ();
5815 bitmap_ior_into (dest->vars, src->vars);
5818 /* Return true if the points-to solution *PT is empty. */
5821 pt_solution_empty_p (struct pt_solution *pt)
5828 && !bitmap_empty_p (pt->vars))
5831 /* If the solution includes ESCAPED, check if that is empty. */
5833 && !pt_solution_empty_p (&cfun->gimple_df->escaped))
5836 /* If the solution includes ESCAPED, check if that is empty. */
5838 && !pt_solution_empty_p (&ipa_escaped_pt))
5844 /* Return true if the points-to solution *PT includes global memory. */
5847 pt_solution_includes_global (struct pt_solution *pt)
5851 || pt->vars_contains_global)
5855 return pt_solution_includes_global (&cfun->gimple_df->escaped);
5857 if (pt->ipa_escaped)
5858 return pt_solution_includes_global (&ipa_escaped_pt);
5860 /* ??? This predicate is not correct for the IPA-PTA solution
5861 as we do not properly distinguish between unit escape points
5862 and global variables. */
5863 if (cfun->gimple_df->ipa_pta)
5869 /* Return true if the points-to solution *PT includes the variable
5870 declaration DECL. */
5873 pt_solution_includes_1 (struct pt_solution *pt, const_tree decl)
5879 && is_global_var (decl))
5883 && bitmap_bit_p (pt->vars, DECL_PT_UID (decl)))
5886 /* If the solution includes ESCAPED, check it. */
5888 && pt_solution_includes_1 (&cfun->gimple_df->escaped, decl))
5891 /* If the solution includes ESCAPED, check it. */
5893 && pt_solution_includes_1 (&ipa_escaped_pt, decl))
5900 pt_solution_includes (struct pt_solution *pt, const_tree decl)
5902 bool res = pt_solution_includes_1 (pt, decl);
5904 ++pta_stats.pt_solution_includes_may_alias;
5906 ++pta_stats.pt_solution_includes_no_alias;
5910 /* Return true if both points-to solutions PT1 and PT2 have a non-empty
5914 pt_solutions_intersect_1 (struct pt_solution *pt1, struct pt_solution *pt2)
5916 if (pt1->anything || pt2->anything)
5919 /* If either points to unknown global memory and the other points to
5920 any global memory they alias. */
5923 || pt2->vars_contains_global))
5925 && pt1->vars_contains_global))
5928 /* Check the escaped solution if required. */
5929 if ((pt1->escaped || pt2->escaped)
5930 && !pt_solution_empty_p (&cfun->gimple_df->escaped))
5932 /* If both point to escaped memory and that solution
5933 is not empty they alias. */
5934 if (pt1->escaped && pt2->escaped)
5937 /* If either points to escaped memory see if the escaped solution
5938 intersects with the other. */
5940 && pt_solutions_intersect_1 (&cfun->gimple_df->escaped, pt2))
5942 && pt_solutions_intersect_1 (&cfun->gimple_df->escaped, pt1)))
5946 /* Check the escaped solution if required.
5947 ??? Do we need to check the local against the IPA escaped sets? */
5948 if ((pt1->ipa_escaped || pt2->ipa_escaped)
5949 && !pt_solution_empty_p (&ipa_escaped_pt))
5951 /* If both point to escaped memory and that solution
5952 is not empty they alias. */
5953 if (pt1->ipa_escaped && pt2->ipa_escaped)
5956 /* If either points to escaped memory see if the escaped solution
5957 intersects with the other. */
5958 if ((pt1->ipa_escaped
5959 && pt_solutions_intersect_1 (&ipa_escaped_pt, pt2))
5960 || (pt2->ipa_escaped
5961 && pt_solutions_intersect_1 (&ipa_escaped_pt, pt1)))
5965 /* Now both pointers alias if their points-to solution intersects. */
5968 && bitmap_intersect_p (pt1->vars, pt2->vars));
5972 pt_solutions_intersect (struct pt_solution *pt1, struct pt_solution *pt2)
5974 bool res = pt_solutions_intersect_1 (pt1, pt2);
5976 ++pta_stats.pt_solutions_intersect_may_alias;
5978 ++pta_stats.pt_solutions_intersect_no_alias;
5982 /* Return true if both points-to solutions PT1 and PT2 for two restrict
5983 qualified pointers are possibly based on the same pointer. */
5986 pt_solutions_same_restrict_base (struct pt_solution *pt1,
5987 struct pt_solution *pt2)
5989 /* If we deal with points-to solutions of two restrict qualified
5990 pointers solely rely on the pointed-to variable bitmap intersection.
5991 For two pointers that are based on each other the bitmaps will
5993 if (pt1->vars_contains_restrict
5994 && pt2->vars_contains_restrict)
5996 gcc_assert (pt1->vars && pt2->vars);
5997 return bitmap_intersect_p (pt1->vars, pt2->vars);
6004 /* Dump points-to information to OUTFILE. */
6007 dump_sa_points_to_info (FILE *outfile)
6011 fprintf (outfile, "\nPoints-to sets\n\n");
6013 if (dump_flags & TDF_STATS)
6015 fprintf (outfile, "Stats:\n");
6016 fprintf (outfile, "Total vars: %d\n", stats.total_vars);
6017 fprintf (outfile, "Non-pointer vars: %d\n",
6018 stats.nonpointer_vars);
6019 fprintf (outfile, "Statically unified vars: %d\n",
6020 stats.unified_vars_static);
6021 fprintf (outfile, "Dynamically unified vars: %d\n",
6022 stats.unified_vars_dynamic);
6023 fprintf (outfile, "Iterations: %d\n", stats.iterations);
6024 fprintf (outfile, "Number of edges: %d\n", stats.num_edges);
6025 fprintf (outfile, "Number of implicit edges: %d\n",
6026 stats.num_implicit_edges);
6029 for (i = 0; i < VEC_length (varinfo_t, varmap); i++)
6031 varinfo_t vi = get_varinfo (i);
6032 if (!vi->may_have_pointers)
6034 dump_solution_for_var (outfile, i);
6039 /* Debug points-to information to stderr. */
6042 debug_sa_points_to_info (void)
6044 dump_sa_points_to_info (stderr);
6048 /* Initialize the always-existing constraint variables for NULL
6049 ANYTHING, READONLY, and INTEGER */
6052 init_base_vars (void)
6054 struct constraint_expr lhs, rhs;
6055 varinfo_t var_anything;
6056 varinfo_t var_nothing;
6057 varinfo_t var_readonly;
6058 varinfo_t var_escaped;
6059 varinfo_t var_nonlocal;
6060 varinfo_t var_storedanything;
6061 varinfo_t var_integer;
6063 /* Create the NULL variable, used to represent that a variable points
6065 var_nothing = new_var_info (NULL_TREE, "NULL");
6066 gcc_assert (var_nothing->id == nothing_id);
6067 var_nothing->is_artificial_var = 1;
6068 var_nothing->offset = 0;
6069 var_nothing->size = ~0;
6070 var_nothing->fullsize = ~0;
6071 var_nothing->is_special_var = 1;
6072 var_nothing->may_have_pointers = 0;
6073 var_nothing->is_global_var = 0;
6075 /* Create the ANYTHING variable, used to represent that a variable
6076 points to some unknown piece of memory. */
6077 var_anything = new_var_info (NULL_TREE, "ANYTHING");
6078 gcc_assert (var_anything->id == anything_id);
6079 var_anything->is_artificial_var = 1;
6080 var_anything->size = ~0;
6081 var_anything->offset = 0;
6082 var_anything->next = NULL;
6083 var_anything->fullsize = ~0;
6084 var_anything->is_special_var = 1;
6086 /* Anything points to anything. This makes deref constraints just
6087 work in the presence of linked list and other p = *p type loops,
6088 by saying that *ANYTHING = ANYTHING. */
6090 lhs.var = anything_id;
6092 rhs.type = ADDRESSOF;
6093 rhs.var = anything_id;
6096 /* This specifically does not use process_constraint because
6097 process_constraint ignores all anything = anything constraints, since all
6098 but this one are redundant. */
6099 VEC_safe_push (constraint_t, heap, constraints, new_constraint (lhs, rhs));
6101 /* Create the READONLY variable, used to represent that a variable
6102 points to readonly memory. */
6103 var_readonly = new_var_info (NULL_TREE, "READONLY");
6104 gcc_assert (var_readonly->id == readonly_id);
6105 var_readonly->is_artificial_var = 1;
6106 var_readonly->offset = 0;
6107 var_readonly->size = ~0;
6108 var_readonly->fullsize = ~0;
6109 var_readonly->next = NULL;
6110 var_readonly->is_special_var = 1;
6112 /* readonly memory points to anything, in order to make deref
6113 easier. In reality, it points to anything the particular
6114 readonly variable can point to, but we don't track this
6117 lhs.var = readonly_id;
6119 rhs.type = ADDRESSOF;
6120 rhs.var = readonly_id; /* FIXME */
6122 process_constraint (new_constraint (lhs, rhs));
6124 /* Create the ESCAPED variable, used to represent the set of escaped
6126 var_escaped = new_var_info (NULL_TREE, "ESCAPED");
6127 gcc_assert (var_escaped->id == escaped_id);
6128 var_escaped->is_artificial_var = 1;
6129 var_escaped->offset = 0;
6130 var_escaped->size = ~0;
6131 var_escaped->fullsize = ~0;
6132 var_escaped->is_special_var = 0;
6134 /* Create the NONLOCAL variable, used to represent the set of nonlocal
6136 var_nonlocal = new_var_info (NULL_TREE, "NONLOCAL");
6137 gcc_assert (var_nonlocal->id == nonlocal_id);
6138 var_nonlocal->is_artificial_var = 1;
6139 var_nonlocal->offset = 0;
6140 var_nonlocal->size = ~0;
6141 var_nonlocal->fullsize = ~0;
6142 var_nonlocal->is_special_var = 1;
6144 /* ESCAPED = *ESCAPED, because escaped is may-deref'd at calls, etc. */
6146 lhs.var = escaped_id;
6149 rhs.var = escaped_id;
6151 process_constraint (new_constraint (lhs, rhs));
6153 /* ESCAPED = ESCAPED + UNKNOWN_OFFSET, because if a sub-field escapes the
6154 whole variable escapes. */
6156 lhs.var = escaped_id;
6159 rhs.var = escaped_id;
6160 rhs.offset = UNKNOWN_OFFSET;
6161 process_constraint (new_constraint (lhs, rhs));
6163 /* *ESCAPED = NONLOCAL. This is true because we have to assume
6164 everything pointed to by escaped points to what global memory can
6167 lhs.var = escaped_id;
6170 rhs.var = nonlocal_id;
6172 process_constraint (new_constraint (lhs, rhs));
6174 /* NONLOCAL = &NONLOCAL, NONLOCAL = &ESCAPED. This is true because
6175 global memory may point to global memory and escaped memory. */
6177 lhs.var = nonlocal_id;
6179 rhs.type = ADDRESSOF;
6180 rhs.var = nonlocal_id;
6182 process_constraint (new_constraint (lhs, rhs));
6183 rhs.type = ADDRESSOF;
6184 rhs.var = escaped_id;
6186 process_constraint (new_constraint (lhs, rhs));
6188 /* Create the STOREDANYTHING variable, used to represent the set of
6189 variables stored to *ANYTHING. */
6190 var_storedanything = new_var_info (NULL_TREE, "STOREDANYTHING");
6191 gcc_assert (var_storedanything->id == storedanything_id);
6192 var_storedanything->is_artificial_var = 1;
6193 var_storedanything->offset = 0;
6194 var_storedanything->size = ~0;
6195 var_storedanything->fullsize = ~0;
6196 var_storedanything->is_special_var = 0;
6198 /* Create the INTEGER variable, used to represent that a variable points
6199 to what an INTEGER "points to". */
6200 var_integer = new_var_info (NULL_TREE, "INTEGER");
6201 gcc_assert (var_integer->id == integer_id);
6202 var_integer->is_artificial_var = 1;
6203 var_integer->size = ~0;
6204 var_integer->fullsize = ~0;
6205 var_integer->offset = 0;
6206 var_integer->next = NULL;
6207 var_integer->is_special_var = 1;
6209 /* INTEGER = ANYTHING, because we don't know where a dereference of
6210 a random integer will point to. */
6212 lhs.var = integer_id;
6214 rhs.type = ADDRESSOF;
6215 rhs.var = anything_id;
6217 process_constraint (new_constraint (lhs, rhs));
6220 /* Initialize things necessary to perform PTA */
6223 init_alias_vars (void)
6225 use_field_sensitive = (MAX_FIELDS_FOR_FIELD_SENSITIVE > 1);
6227 bitmap_obstack_initialize (&pta_obstack);
6228 bitmap_obstack_initialize (&oldpta_obstack);
6229 bitmap_obstack_initialize (&predbitmap_obstack);
6231 constraint_pool = create_alloc_pool ("Constraint pool",
6232 sizeof (struct constraint), 30);
6233 variable_info_pool = create_alloc_pool ("Variable info pool",
6234 sizeof (struct variable_info), 30);
6235 constraints = VEC_alloc (constraint_t, heap, 8);
6236 varmap = VEC_alloc (varinfo_t, heap, 8);
6237 vi_for_tree = pointer_map_create ();
6238 call_stmt_vars = pointer_map_create ();
6240 memset (&stats, 0, sizeof (stats));
6241 shared_bitmap_table = htab_create (511, shared_bitmap_hash,
6242 shared_bitmap_eq, free);
6246 /* Remove the REF and ADDRESS edges from GRAPH, as well as all the
6247 predecessor edges. */
6250 remove_preds_and_fake_succs (constraint_graph_t graph)
6254 /* Clear the implicit ref and address nodes from the successor
6256 for (i = 0; i < FIRST_REF_NODE; i++)
6258 if (graph->succs[i])
6259 bitmap_clear_range (graph->succs[i], FIRST_REF_NODE,
6260 FIRST_REF_NODE * 2);
6263 /* Free the successor list for the non-ref nodes. */
6264 for (i = FIRST_REF_NODE; i < graph->size; i++)
6266 if (graph->succs[i])
6267 BITMAP_FREE (graph->succs[i]);
6270 /* Now reallocate the size of the successor list as, and blow away
6271 the predecessor bitmaps. */
6272 graph->size = VEC_length (varinfo_t, varmap);
6273 graph->succs = XRESIZEVEC (bitmap, graph->succs, graph->size);
6275 free (graph->implicit_preds);
6276 graph->implicit_preds = NULL;
6277 free (graph->preds);
6278 graph->preds = NULL;
6279 bitmap_obstack_release (&predbitmap_obstack);
6282 /* Initialize the heapvar for statement mapping. */
6285 init_alias_heapvars (void)
6287 if (!heapvar_for_stmt)
6288 heapvar_for_stmt = htab_create_ggc (11, tree_map_hash, heapvar_map_eq,
6292 /* Delete the heapvar for statement mapping. */
6295 delete_alias_heapvars (void)
6297 if (heapvar_for_stmt)
6298 htab_delete (heapvar_for_stmt);
6299 heapvar_for_stmt = NULL;
6302 /* Solve the constraint set. */
6305 solve_constraints (void)
6307 struct scc_info *si;
6311 "\nCollapsing static cycles and doing variable "
6314 init_graph (VEC_length (varinfo_t, varmap) * 2);
6317 fprintf (dump_file, "Building predecessor graph\n");
6318 build_pred_graph ();
6321 fprintf (dump_file, "Detecting pointer and location "
6323 si = perform_var_substitution (graph);
6326 fprintf (dump_file, "Rewriting constraints and unifying "
6328 rewrite_constraints (graph, si);
6330 build_succ_graph ();
6331 free_var_substitution_info (si);
6333 if (dump_file && (dump_flags & TDF_GRAPH))
6334 dump_constraint_graph (dump_file);
6336 move_complex_constraints (graph);
6339 fprintf (dump_file, "Uniting pointer but not location equivalent "
6341 unite_pointer_equivalences (graph);
6344 fprintf (dump_file, "Finding indirect cycles\n");
6345 find_indirect_cycles (graph);
6347 /* Implicit nodes and predecessors are no longer necessary at this
6349 remove_preds_and_fake_succs (graph);
6352 fprintf (dump_file, "Solving graph\n");
6354 solve_graph (graph);
6357 dump_sa_points_to_info (dump_file);
6360 /* Create points-to sets for the current function. See the comments
6361 at the start of the file for an algorithmic overview. */
6364 compute_points_to_sets (void)
6370 timevar_push (TV_TREE_PTA);
6373 init_alias_heapvars ();
6375 intra_create_variable_infos ();
6377 /* Now walk all statements and build the constraint set. */
6380 gimple_stmt_iterator gsi;
6382 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
6384 gimple phi = gsi_stmt (gsi);
6386 if (is_gimple_reg (gimple_phi_result (phi)))
6387 find_func_aliases (phi);
6390 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
6392 gimple stmt = gsi_stmt (gsi);
6394 find_func_aliases (stmt);
6400 fprintf (dump_file, "Points-to analysis\n\nConstraints:\n\n");
6401 dump_constraints (dump_file, 0);
6404 /* From the constraints compute the points-to sets. */
6405 solve_constraints ();
6407 /* Compute the points-to set for ESCAPED used for call-clobber analysis. */
6408 find_what_var_points_to (get_varinfo (escaped_id),
6409 &cfun->gimple_df->escaped);
6411 /* Make sure the ESCAPED solution (which is used as placeholder in
6412 other solutions) does not reference itself. This simplifies
6413 points-to solution queries. */
6414 cfun->gimple_df->escaped.escaped = 0;
6416 /* Mark escaped HEAP variables as global. */
6417 for (i = 0; VEC_iterate (varinfo_t, varmap, i, vi); ++i)
6419 && !vi->is_restrict_var
6420 && !vi->is_global_var)
6421 DECL_EXTERNAL (vi->decl) = vi->is_global_var
6422 = pt_solution_includes (&cfun->gimple_df->escaped, vi->decl);
6424 /* Compute the points-to sets for pointer SSA_NAMEs. */
6425 for (i = 0; i < num_ssa_names; ++i)
6427 tree ptr = ssa_name (i);
6429 && POINTER_TYPE_P (TREE_TYPE (ptr)))
6430 find_what_p_points_to (ptr);
6433 /* Compute the call-used/clobbered sets. */
6436 gimple_stmt_iterator gsi;
6438 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
6440 gimple stmt = gsi_stmt (gsi);
6441 struct pt_solution *pt;
6442 if (!is_gimple_call (stmt))
6445 pt = gimple_call_use_set (stmt);
6446 if (gimple_call_flags (stmt) & ECF_CONST)
6447 memset (pt, 0, sizeof (struct pt_solution));
6448 else if ((vi = lookup_call_use_vi (stmt)) != NULL)
6450 find_what_var_points_to (vi, pt);
6451 /* Escaped (and thus nonlocal) variables are always
6452 implicitly used by calls. */
6453 /* ??? ESCAPED can be empty even though NONLOCAL
6460 /* If there is nothing special about this call then
6461 we have made everything that is used also escape. */
6462 *pt = cfun->gimple_df->escaped;
6466 pt = gimple_call_clobber_set (stmt);
6467 if (gimple_call_flags (stmt) & (ECF_CONST|ECF_PURE|ECF_NOVOPS))
6468 memset (pt, 0, sizeof (struct pt_solution));
6469 else if ((vi = lookup_call_clobber_vi (stmt)) != NULL)
6471 find_what_var_points_to (vi, pt);
6472 /* Escaped (and thus nonlocal) variables are always
6473 implicitly clobbered by calls. */
6474 /* ??? ESCAPED can be empty even though NONLOCAL
6481 /* If there is nothing special about this call then
6482 we have made everything that is used also escape. */
6483 *pt = cfun->gimple_df->escaped;
6489 timevar_pop (TV_TREE_PTA);
6493 /* Delete created points-to sets. */
6496 delete_points_to_sets (void)
6500 htab_delete (shared_bitmap_table);
6501 if (dump_file && (dump_flags & TDF_STATS))
6502 fprintf (dump_file, "Points to sets created:%d\n",
6503 stats.points_to_sets_created);
6505 pointer_map_destroy (vi_for_tree);
6506 pointer_map_destroy (call_stmt_vars);
6507 bitmap_obstack_release (&pta_obstack);
6508 VEC_free (constraint_t, heap, constraints);
6510 for (i = 0; i < graph->size; i++)
6511 VEC_free (constraint_t, heap, graph->complex[i]);
6512 free (graph->complex);
6515 free (graph->succs);
6517 free (graph->pe_rep);
6518 free (graph->indirect_cycles);
6521 VEC_free (varinfo_t, heap, varmap);
6522 free_alloc_pool (variable_info_pool);
6523 free_alloc_pool (constraint_pool);
6527 /* Compute points-to information for every SSA_NAME pointer in the
6528 current function and compute the transitive closure of escaped
6529 variables to re-initialize the call-clobber states of local variables. */
6532 compute_may_aliases (void)
6534 if (cfun->gimple_df->ipa_pta)
6538 fprintf (dump_file, "\nNot re-computing points-to information "
6539 "because IPA points-to information is available.\n\n");
6541 /* But still dump what we have remaining it. */
6542 dump_alias_info (dump_file);
6544 if (dump_flags & TDF_DETAILS)
6545 dump_referenced_vars (dump_file);
6551 /* For each pointer P_i, determine the sets of variables that P_i may
6552 point-to. Compute the reachability set of escaped and call-used
6554 compute_points_to_sets ();
6556 /* Debugging dumps. */
6559 dump_alias_info (dump_file);
6561 if (dump_flags & TDF_DETAILS)
6562 dump_referenced_vars (dump_file);
6565 /* Deallocate memory used by aliasing data structures and the internal
6566 points-to solution. */
6567 delete_points_to_sets ();
6569 gcc_assert (!need_ssa_update_p (cfun));
6575 gate_tree_pta (void)
6577 return flag_tree_pta;
6580 /* A dummy pass to cause points-to information to be computed via
6581 TODO_rebuild_alias. */
6583 struct gimple_opt_pass pass_build_alias =
6588 gate_tree_pta, /* gate */
6592 0, /* static_pass_number */
6593 TV_NONE, /* tv_id */
6594 PROP_cfg | PROP_ssa, /* properties_required */
6595 0, /* properties_provided */
6596 0, /* properties_destroyed */
6597 0, /* todo_flags_start */
6598 TODO_rebuild_alias | TODO_dump_func /* todo_flags_finish */
6602 /* A dummy pass to cause points-to information to be computed via
6603 TODO_rebuild_alias. */
6605 struct gimple_opt_pass pass_build_ealias =
6609 "ealias", /* name */
6610 gate_tree_pta, /* gate */
6614 0, /* static_pass_number */
6615 TV_NONE, /* tv_id */
6616 PROP_cfg | PROP_ssa, /* properties_required */
6617 0, /* properties_provided */
6618 0, /* properties_destroyed */
6619 0, /* todo_flags_start */
6620 TODO_rebuild_alias | TODO_dump_func /* todo_flags_finish */
6625 /* Return true if we should execute IPA PTA. */
6631 /* Don't bother doing anything if the program has errors. */
6632 && !(errorcount || sorrycount));
6635 /* IPA PTA solutions for ESCAPED. */
6636 struct pt_solution ipa_escaped_pt
6637 = { true, false, false, false, false, false, false, NULL };
6639 /* Execute the driver for IPA PTA. */
6641 ipa_pta_execute (void)
6643 struct cgraph_node *node;
6644 struct varpool_node *var;
6649 init_alias_heapvars ();
6652 /* Build the constraints. */
6653 for (node = cgraph_nodes; node; node = node->next)
6655 struct cgraph_node *alias;
6658 /* Nodes without a body are not interesting. Especially do not
6659 visit clones at this point for now - we get duplicate decls
6660 there for inline clones at least. */
6661 if (!gimple_has_body_p (node->decl)
6665 vi = create_function_info_for (node->decl,
6666 alias_get_name (node->decl));
6668 /* Associate the varinfo node with all aliases. */
6669 for (alias = node->same_body; alias; alias = alias->next)
6670 insert_vi_for_tree (alias->decl, vi);
6673 /* Create constraints for global variables and their initializers. */
6674 for (var = varpool_nodes; var; var = var->next)
6676 struct varpool_node *alias;
6679 vi = get_vi_for_tree (var->decl);
6681 /* Associate the varinfo node with all aliases. */
6682 for (alias = var->extra_name; alias; alias = alias->next)
6683 insert_vi_for_tree (alias->decl, vi);
6689 "Generating constraints for global initializers\n\n");
6690 dump_constraints (dump_file, 0);
6691 fprintf (dump_file, "\n");
6693 from = VEC_length (constraint_t, constraints);
6695 for (node = cgraph_nodes; node; node = node->next)
6697 struct function *func;
6701 /* Nodes without a body are not interesting. */
6702 if (!gimple_has_body_p (node->decl)
6709 "Generating constraints for %s", cgraph_node_name (node));
6710 if (DECL_ASSEMBLER_NAME_SET_P (node->decl))
6711 fprintf (dump_file, " (%s)",
6712 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (node->decl)));
6713 fprintf (dump_file, "\n");
6716 func = DECL_STRUCT_FUNCTION (node->decl);
6717 old_func_decl = current_function_decl;
6719 current_function_decl = node->decl;
6721 /* For externally visible functions use local constraints for
6722 their arguments. For local functions we see all callers
6723 and thus do not need initial constraints for parameters. */
6724 if (node->local.externally_visible)
6725 intra_create_variable_infos ();
6727 /* Build constriants for the function body. */
6728 FOR_EACH_BB_FN (bb, func)
6730 gimple_stmt_iterator gsi;
6732 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi);
6735 gimple phi = gsi_stmt (gsi);
6737 if (is_gimple_reg (gimple_phi_result (phi)))
6738 find_func_aliases (phi);
6741 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
6743 gimple stmt = gsi_stmt (gsi);
6745 find_func_aliases (stmt);
6746 find_func_clobbers (stmt);
6750 current_function_decl = old_func_decl;
6755 fprintf (dump_file, "\n");
6756 dump_constraints (dump_file, from);
6757 fprintf (dump_file, "\n");
6759 from = VEC_length (constraint_t, constraints);
6762 /* From the constraints compute the points-to sets. */
6763 solve_constraints ();
6765 /* Compute the global points-to sets for ESCAPED.
6766 ??? Note that the computed escape set is not correct
6767 for the whole unit as we fail to consider graph edges to
6768 externally visible functions. */
6769 find_what_var_points_to (get_varinfo (escaped_id), &ipa_escaped_pt);
6771 /* Make sure the ESCAPED solution (which is used as placeholder in
6772 other solutions) does not reference itself. This simplifies
6773 points-to solution queries. */
6774 ipa_escaped_pt.ipa_escaped = 0;
6776 /* Assign the points-to sets to the SSA names in the unit. */
6777 for (node = cgraph_nodes; node; node = node->next)
6780 struct function *fn;
6784 struct pt_solution uses, clobbers;
6785 struct cgraph_edge *e;
6787 /* Nodes without a body are not interesting. */
6788 if (!gimple_has_body_p (node->decl)
6792 fn = DECL_STRUCT_FUNCTION (node->decl);
6794 /* Compute the points-to sets for pointer SSA_NAMEs. */
6795 for (i = 0; VEC_iterate (tree, fn->gimple_df->ssa_names, i, ptr); ++i)
6798 && POINTER_TYPE_P (TREE_TYPE (ptr)))
6799 find_what_p_points_to (ptr);
6802 /* Compute the call-use and call-clobber sets for all direct calls. */
6803 fi = lookup_vi_for_tree (node->decl);
6804 gcc_assert (fi->is_fn_info);
6805 find_what_var_points_to (first_vi_for_offset (fi, fi_clobbers),
6807 find_what_var_points_to (first_vi_for_offset (fi, fi_uses), &uses);
6808 for (e = node->callers; e; e = e->next_caller)
6813 *gimple_call_clobber_set (e->call_stmt) = clobbers;
6814 *gimple_call_use_set (e->call_stmt) = uses;
6817 /* Compute the call-use and call-clobber sets for indirect calls
6818 and calls to external functions. */
6819 FOR_EACH_BB_FN (bb, fn)
6821 gimple_stmt_iterator gsi;
6823 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
6825 gimple stmt = gsi_stmt (gsi);
6826 struct pt_solution *pt;
6830 if (!is_gimple_call (stmt))
6833 /* Handle direct calls to external functions. */
6834 decl = gimple_call_fndecl (stmt);
6836 && (!(fi = lookup_vi_for_tree (decl))
6837 || !fi->is_fn_info))
6839 pt = gimple_call_use_set (stmt);
6840 if (gimple_call_flags (stmt) & ECF_CONST)
6841 memset (pt, 0, sizeof (struct pt_solution));
6842 else if ((vi = lookup_call_use_vi (stmt)) != NULL)
6844 find_what_var_points_to (vi, pt);
6845 /* Escaped (and thus nonlocal) variables are always
6846 implicitly used by calls. */
6847 /* ??? ESCAPED can be empty even though NONLOCAL
6850 pt->ipa_escaped = 1;
6854 /* If there is nothing special about this call then
6855 we have made everything that is used also escape. */
6856 *pt = ipa_escaped_pt;
6860 pt = gimple_call_clobber_set (stmt);
6861 if (gimple_call_flags (stmt) & (ECF_CONST|ECF_PURE|ECF_NOVOPS))
6862 memset (pt, 0, sizeof (struct pt_solution));
6863 else if ((vi = lookup_call_clobber_vi (stmt)) != NULL)
6865 find_what_var_points_to (vi, pt);
6866 /* Escaped (and thus nonlocal) variables are always
6867 implicitly clobbered by calls. */
6868 /* ??? ESCAPED can be empty even though NONLOCAL
6871 pt->ipa_escaped = 1;
6875 /* If there is nothing special about this call then
6876 we have made everything that is used also escape. */
6877 *pt = ipa_escaped_pt;
6882 /* Handle indirect calls. */
6884 && (fi = get_fi_for_callee (stmt)))
6886 /* We need to accumulate all clobbers/uses of all possible
6888 fi = get_varinfo (find (fi->id));
6889 /* If we cannot constrain the set of functions we'll end up
6890 calling we end up using/clobbering everything. */
6891 if (bitmap_bit_p (fi->solution, anything_id)
6892 || bitmap_bit_p (fi->solution, nonlocal_id)
6893 || bitmap_bit_p (fi->solution, escaped_id))
6895 pt_solution_reset (gimple_call_clobber_set (stmt));
6896 pt_solution_reset (gimple_call_use_set (stmt));
6902 struct pt_solution *uses, *clobbers;
6904 uses = gimple_call_use_set (stmt);
6905 clobbers = gimple_call_clobber_set (stmt);
6906 memset (uses, 0, sizeof (struct pt_solution));
6907 memset (clobbers, 0, sizeof (struct pt_solution));
6908 EXECUTE_IF_SET_IN_BITMAP (fi->solution, 0, i, bi)
6910 struct pt_solution sol;
6912 vi = get_varinfo (i);
6913 if (!vi->is_fn_info)
6915 /* ??? We could be more precise here? */
6917 uses->ipa_escaped = 1;
6918 clobbers->nonlocal = 1;
6919 clobbers->ipa_escaped = 1;
6923 if (!uses->anything)
6925 find_what_var_points_to
6926 (first_vi_for_offset (vi, fi_uses), &sol);
6927 pt_solution_ior_into (uses, &sol);
6929 if (!clobbers->anything)
6931 find_what_var_points_to
6932 (first_vi_for_offset (vi, fi_clobbers), &sol);
6933 pt_solution_ior_into (clobbers, &sol);
6941 fn->gimple_df->ipa_pta = true;
6944 delete_points_to_sets ();
6951 struct simple_ipa_opt_pass pass_ipa_pta =
6956 gate_ipa_pta, /* gate */
6957 ipa_pta_execute, /* execute */
6960 0, /* static_pass_number */
6961 TV_IPA_PTA, /* tv_id */
6962 0, /* properties_required */
6963 0, /* properties_provided */
6964 0, /* properties_destroyed */
6965 0, /* todo_flags_start */
6966 TODO_update_ssa /* todo_flags_finish */
6971 #include "gt-tree-ssa-structalias.h"