1 /* SSA operands management for trees.
2 Copyright (C) 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GCC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING. If not, write to
18 the Free Software Foundation, 51 Franklin Street, Fifth Floor,
19 Boston, MA 02110-1301, USA. */
23 #include "coretypes.h"
28 #include "diagnostic.h"
29 #include "tree-flow.h"
30 #include "tree-inline.h"
31 #include "tree-pass.h"
35 #include "langhooks.h"
36 #include "ipa-reference.h"
38 /* This file contains the code required to manage the operands cache of the
39 SSA optimizer. For every stmt, we maintain an operand cache in the stmt
40 annotation. This cache contains operands that will be of interest to
41 optimizers and other passes wishing to manipulate the IL.
43 The operand type are broken up into REAL and VIRTUAL operands. The real
44 operands are represented as pointers into the stmt's operand tree. Thus
45 any manipulation of the real operands will be reflected in the actual tree.
46 Virtual operands are represented solely in the cache, although the base
47 variable for the SSA_NAME may, or may not occur in the stmt's tree.
48 Manipulation of the virtual operands will not be reflected in the stmt tree.
50 The routines in this file are concerned with creating this operand cache
53 The operand tree is the parsed by the various get_* routines which look
54 through the stmt tree for the occurrence of operands which may be of
55 interest, and calls are made to the append_* routines whenever one is
56 found. There are 5 of these routines, each representing one of the
57 5 types of operands. Defs, Uses, Virtual Uses, Virtual May Defs, and
60 The append_* routines check for duplication, and simply keep a list of
61 unique objects for each operand type in the build_* extendable vectors.
63 Once the stmt tree is completely parsed, the finalize_ssa_operands()
64 routine is called, which proceeds to perform the finalization routine
65 on each of the 5 operand vectors which have been built up.
67 If the stmt had a previous operand cache, the finalization routines
68 attempt to match up the new operands with the old ones. If it's a perfect
69 match, the old vector is simply reused. If it isn't a perfect match, then
70 a new vector is created and the new operands are placed there. For
71 virtual operands, if the previous cache had SSA_NAME version of a
72 variable, and that same variable occurs in the same operands cache, then
73 the new cache vector will also get the same SSA_NAME.
75 i.e., if a stmt had a VUSE of 'a_5', and 'a' occurs in the new operand
76 vector for VUSE, then the new vector will also be modified such that
77 it contains 'a_5' rather than 'a'. */
79 /* Flags to describe operand properties in helpers. */
81 /* By default, operands are loaded. */
84 /* Operand is the target of an assignment expression or a
85 call-clobbered variable. */
86 #define opf_is_def (1 << 0)
88 /* Operand is the target of an assignment expression. */
89 #define opf_kill_def (1 << 1)
91 /* No virtual operands should be created in the expression. This is used
92 when traversing ADDR_EXPR nodes which have different semantics than
93 other expressions. Inside an ADDR_EXPR node, the only operands that we
94 need to consider are indices into arrays. For instance, &a.b[i] should
95 generate a USE of 'i' but it should not generate a VUSE for 'a' nor a
97 #define opf_no_vops (1 << 2)
99 /* Operand is a "non-specific" kill for call-clobbers and such. This
100 is used to distinguish "reset the world" events from explicit
101 GIMPLE_MODIFY_STMTs. */
102 #define opf_non_specific (1 << 3)
104 /* Array for building all the def operands. */
105 static VEC(tree,heap) *build_defs;
107 /* Array for building all the use operands. */
108 static VEC(tree,heap) *build_uses;
110 /* Array for building all the V_MAY_DEF operands. */
111 static VEC(tree,heap) *build_v_may_defs;
113 /* Array for building all the VUSE operands. */
114 static VEC(tree,heap) *build_vuses;
116 /* Array for building all the V_MUST_DEF operands. */
117 static VEC(tree,heap) *build_v_must_defs;
119 static void get_expr_operands (tree, tree *, int);
121 /* Number of functions with initialized ssa_operands. */
122 static int n_initialized = 0;
124 /* Allocates operand OP of given TYPE from the appropriate free list,
125 or of the new value if the list is empty. */
127 #define ALLOC_OPTYPE(OP, TYPE) \
130 TYPE##_optype_p ret \
131 = gimple_ssa_operands (cfun)->free_##TYPE##s; \
133 gimple_ssa_operands (cfun)->free_##TYPE##s \
136 ret = ssa_operand_alloc (sizeof (*ret)); \
140 /* Return the DECL_UID of the base variable of T. */
142 static inline unsigned
143 get_name_decl (tree t)
145 if (TREE_CODE (t) != SSA_NAME)
148 return DECL_UID (SSA_NAME_VAR (t));
152 /* Comparison function for qsort used in operand_build_sort_virtual. */
155 operand_build_cmp (const void *p, const void *q)
157 tree e1 = *((const tree *)p);
158 tree e2 = *((const tree *)q);
161 u1 = get_name_decl (e1);
162 u2 = get_name_decl (e2);
164 /* We want to sort in ascending order. They can never be equal. */
165 #ifdef ENABLE_CHECKING
166 gcc_assert (u1 != u2);
168 return (u1 > u2 ? 1 : -1);
172 /* Sort the virtual operands in LIST from lowest DECL_UID to highest. */
175 operand_build_sort_virtual (VEC(tree,heap) *list)
177 int num = VEC_length (tree, list);
184 if (get_name_decl (VEC_index (tree, list, 0))
185 > get_name_decl (VEC_index (tree, list, 1)))
187 /* Swap elements if in the wrong order. */
188 tree tmp = VEC_index (tree, list, 0);
189 VEC_replace (tree, list, 0, VEC_index (tree, list, 1));
190 VEC_replace (tree, list, 1, tmp);
195 /* There are 3 or more elements, call qsort. */
196 qsort (VEC_address (tree, list),
197 VEC_length (tree, list),
203 /* Return true if the SSA operands cache is active. */
206 ssa_operands_active (void)
208 return cfun->gimple_df && gimple_ssa_operands (cfun)->ops_active;
212 /* Structure storing statistics on how many call clobbers we have, and
213 how many where avoided. */
217 /* Number of call-clobbered ops we attempt to add to calls in
218 add_call_clobber_ops. */
219 unsigned int clobbered_vars;
221 /* Number of write-clobbers (V_MAY_DEFs) avoided by using
222 not_written information. */
223 unsigned int static_write_clobbers_avoided;
225 /* Number of reads (VUSEs) avoided by using not_read information. */
226 unsigned int static_read_clobbers_avoided;
228 /* Number of write-clobbers avoided because the variable can't escape to
230 unsigned int unescapable_clobbers_avoided;
232 /* Number of read-only uses we attempt to add to calls in
233 add_call_read_ops. */
234 unsigned int readonly_clobbers;
236 /* Number of read-only uses we avoid using not_read information. */
237 unsigned int static_readonly_clobbers_avoided;
241 /* Initialize the operand cache routines. */
244 init_ssa_operands (void)
246 if (!n_initialized++)
248 build_defs = VEC_alloc (tree, heap, 5);
249 build_uses = VEC_alloc (tree, heap, 10);
250 build_vuses = VEC_alloc (tree, heap, 25);
251 build_v_may_defs = VEC_alloc (tree, heap, 25);
252 build_v_must_defs = VEC_alloc (tree, heap, 25);
255 gcc_assert (gimple_ssa_operands (cfun)->operand_memory == NULL);
256 gimple_ssa_operands (cfun)->operand_memory_index = SSA_OPERAND_MEMORY_SIZE;
257 gimple_ssa_operands (cfun)->ops_active = true;
258 memset (&clobber_stats, 0, sizeof (clobber_stats));
262 /* Dispose of anything required by the operand routines. */
265 fini_ssa_operands (void)
267 struct ssa_operand_memory_d *ptr;
268 if (!--n_initialized)
270 VEC_free (tree, heap, build_defs);
271 VEC_free (tree, heap, build_uses);
272 VEC_free (tree, heap, build_v_must_defs);
273 VEC_free (tree, heap, build_v_may_defs);
274 VEC_free (tree, heap, build_vuses);
276 gimple_ssa_operands (cfun)->free_defs = NULL;
277 gimple_ssa_operands (cfun)->free_uses = NULL;
278 gimple_ssa_operands (cfun)->free_vuses = NULL;
279 gimple_ssa_operands (cfun)->free_maydefs = NULL;
280 gimple_ssa_operands (cfun)->free_mustdefs = NULL;
281 while ((ptr = gimple_ssa_operands (cfun)->operand_memory) != NULL)
283 gimple_ssa_operands (cfun)->operand_memory
284 = gimple_ssa_operands (cfun)->operand_memory->next;
288 gimple_ssa_operands (cfun)->ops_active = false;
290 if (dump_file && (dump_flags & TDF_STATS))
292 fprintf (dump_file, "Original clobbered vars:%d\n",
293 clobber_stats.clobbered_vars);
294 fprintf (dump_file, "Static write clobbers avoided:%d\n",
295 clobber_stats.static_write_clobbers_avoided);
296 fprintf (dump_file, "Static read clobbers avoided:%d\n",
297 clobber_stats.static_read_clobbers_avoided);
298 fprintf (dump_file, "Unescapable clobbers avoided:%d\n",
299 clobber_stats.unescapable_clobbers_avoided);
300 fprintf (dump_file, "Original read-only clobbers:%d\n",
301 clobber_stats.readonly_clobbers);
302 fprintf (dump_file, "Static read-only clobbers avoided:%d\n",
303 clobber_stats.static_readonly_clobbers_avoided);
308 /* Return memory for operands of SIZE chunks. */
311 ssa_operand_alloc (unsigned size)
314 if (gimple_ssa_operands (cfun)->operand_memory_index + size
315 >= SSA_OPERAND_MEMORY_SIZE)
317 struct ssa_operand_memory_d *ptr;
318 ptr = GGC_NEW (struct ssa_operand_memory_d);
319 ptr->next = gimple_ssa_operands (cfun)->operand_memory;
320 gimple_ssa_operands (cfun)->operand_memory = ptr;
321 gimple_ssa_operands (cfun)->operand_memory_index = 0;
323 ptr = &(gimple_ssa_operands (cfun)->operand_memory
324 ->mem[gimple_ssa_operands (cfun)->operand_memory_index]);
325 gimple_ssa_operands (cfun)->operand_memory_index += size;
331 /* This routine makes sure that PTR is in an immediate use list, and makes
332 sure the stmt pointer is set to the current stmt. */
335 set_virtual_use_link (use_operand_p ptr, tree stmt)
337 /* fold_stmt may have changed the stmt pointers. */
338 if (ptr->stmt != stmt)
341 /* If this use isn't in a list, add it to the correct list. */
343 link_imm_use (ptr, *(ptr->use));
346 /* Appends ELT after TO, and moves the TO pointer to ELT. */
348 #define APPEND_OP_AFTER(ELT, TO) \
351 (TO)->next = (ELT); \
355 /* Appends head of list FROM after TO, and move both pointers
356 to their successors. */
358 #define MOVE_HEAD_AFTER(FROM, TO) \
361 APPEND_OP_AFTER (FROM, TO); \
362 (FROM) = (FROM)->next; \
365 /* Moves OP to appropriate freelist. OP is set to its successor. */
367 #define MOVE_HEAD_TO_FREELIST(OP, TYPE) \
370 TYPE##_optype_p next = (OP)->next; \
372 = gimple_ssa_operands (cfun)->free_##TYPE##s; \
373 gimple_ssa_operands (cfun)->free_##TYPE##s = (OP);\
377 /* Initializes immediate use at USE_PTR to value VAL, and links it to the list
378 of immediate uses. STMT is the current statement. */
380 #define INITIALIZE_USE(USE_PTR, VAL, STMT) \
383 (USE_PTR)->use = (VAL); \
384 link_imm_use_stmt ((USE_PTR), *(VAL), (STMT)); \
387 /* Adds OP to the list of defs after LAST, and moves
388 LAST to the new element. */
391 add_def_op (tree *op, def_optype_p *last)
395 ALLOC_OPTYPE (new, def);
396 DEF_OP_PTR (new) = op;
397 APPEND_OP_AFTER (new, *last);
400 /* Adds OP to the list of uses of statement STMT after LAST, and moves
401 LAST to the new element. */
404 add_use_op (tree stmt, tree *op, use_optype_p *last)
408 ALLOC_OPTYPE (new, use);
409 INITIALIZE_USE (USE_OP_PTR (new), op, stmt);
410 APPEND_OP_AFTER (new, *last);
413 /* Adds OP to the list of vuses of statement STMT after LAST, and moves
414 LAST to the new element. */
417 add_vuse_op (tree stmt, tree op, vuse_optype_p *last)
421 ALLOC_OPTYPE (new, vuse);
423 INITIALIZE_USE (VUSE_OP_PTR (new), &VUSE_OP (new), stmt);
424 APPEND_OP_AFTER (new, *last);
427 /* Adds OP to the list of maydefs of statement STMT after LAST, and moves
428 LAST to the new element. */
431 add_maydef_op (tree stmt, tree op, maydef_optype_p *last)
435 ALLOC_OPTYPE (new, maydef);
436 MAYDEF_RESULT (new) = op;
437 MAYDEF_OP (new) = op;
438 INITIALIZE_USE (MAYDEF_OP_PTR (new), &MAYDEF_OP (new), stmt);
439 APPEND_OP_AFTER (new, *last);
442 /* Adds OP to the list of mustdefs of statement STMT after LAST, and moves
443 LAST to the new element. */
446 add_mustdef_op (tree stmt, tree op, mustdef_optype_p *last)
448 mustdef_optype_p new;
450 ALLOC_OPTYPE (new, mustdef);
451 MUSTDEF_RESULT (new) = op;
452 MUSTDEF_KILL (new) = op;
453 INITIALIZE_USE (MUSTDEF_KILL_PTR (new), &MUSTDEF_KILL (new), stmt);
454 APPEND_OP_AFTER (new, *last);
457 /* Takes elements from build_defs and turns them into def operands of STMT.
458 TODO -- Given that def operands list is not necessarily sorted, merging
459 the operands this way does not make much sense.
460 -- Make build_defs VEC of tree *. */
463 finalize_ssa_def_ops (tree stmt)
466 struct def_optype_d new_list;
467 def_optype_p old_ops, last;
470 new_list.next = NULL;
473 old_ops = DEF_OPS (stmt);
476 while (old_ops && new_i < VEC_length (tree, build_defs))
478 tree *new_base = (tree *) VEC_index (tree, build_defs, new_i);
479 old_base = DEF_OP_PTR (old_ops);
481 if (old_base == new_base)
483 /* if variables are the same, reuse this node. */
484 MOVE_HEAD_AFTER (old_ops, last);
487 else if (old_base < new_base)
489 /* if old is less than new, old goes to the free list. */
490 MOVE_HEAD_TO_FREELIST (old_ops, def);
494 /* This is a new operand. */
495 add_def_op (new_base, &last);
500 /* If there is anything remaining in the build_defs list, simply emit it. */
501 for ( ; new_i < VEC_length (tree, build_defs); new_i++)
502 add_def_op ((tree *) VEC_index (tree, build_defs, new_i), &last);
506 /* If there is anything in the old list, free it. */
509 old_ops->next = gimple_ssa_operands (cfun)->free_defs;
510 gimple_ssa_operands (cfun)->free_defs = old_ops;
513 /* Now set the stmt's operands. */
514 DEF_OPS (stmt) = new_list.next;
516 #ifdef ENABLE_CHECKING
520 for (ptr = DEF_OPS (stmt); ptr; ptr = ptr->next)
523 gcc_assert (x == VEC_length (tree, build_defs));
528 /* This routine will create stmt operands for STMT from the def build list. */
531 finalize_ssa_defs (tree stmt)
533 unsigned int num = VEC_length (tree, build_defs);
535 /* There should only be a single real definition per assignment. */
536 gcc_assert ((stmt && TREE_CODE (stmt) != GIMPLE_MODIFY_STMT) || num <= 1);
538 /* If there is an old list, often the new list is identical, or close, so
539 find the elements at the beginning that are the same as the vector. */
540 finalize_ssa_def_ops (stmt);
541 VEC_truncate (tree, build_defs, 0);
544 /* Takes elements from build_uses and turns them into use operands of STMT.
545 TODO -- Make build_uses VEC of tree *. */
548 finalize_ssa_use_ops (tree stmt)
551 struct use_optype_d new_list;
552 use_optype_p old_ops, ptr, last;
554 new_list.next = NULL;
557 old_ops = USE_OPS (stmt);
559 /* If there is anything in the old list, free it. */
562 for (ptr = old_ops; ptr; ptr = ptr->next)
563 delink_imm_use (USE_OP_PTR (ptr));
564 old_ops->next = gimple_ssa_operands (cfun)->free_uses;
565 gimple_ssa_operands (cfun)->free_uses = old_ops;
568 /* Now create nodes for all the new nodes. */
569 for (new_i = 0; new_i < VEC_length (tree, build_uses); new_i++)
570 add_use_op (stmt, (tree *) VEC_index (tree, build_uses, new_i), &last);
574 /* Now set the stmt's operands. */
575 USE_OPS (stmt) = new_list.next;
577 #ifdef ENABLE_CHECKING
580 for (ptr = USE_OPS (stmt); ptr; ptr = ptr->next)
583 gcc_assert (x == VEC_length (tree, build_uses));
588 /* Return a new use operand vector for STMT, comparing to OLD_OPS_P. */
591 finalize_ssa_uses (tree stmt)
593 #ifdef ENABLE_CHECKING
596 unsigned num = VEC_length (tree, build_uses);
598 /* If the pointer to the operand is the statement itself, something is
599 wrong. It means that we are pointing to a local variable (the
600 initial call to update_stmt_operands does not pass a pointer to a
602 for (x = 0; x < num; x++)
603 gcc_assert (*((tree *)VEC_index (tree, build_uses, x)) != stmt);
606 finalize_ssa_use_ops (stmt);
607 VEC_truncate (tree, build_uses, 0);
611 /* Takes elements from build_v_may_defs and turns them into maydef operands of
615 finalize_ssa_v_may_def_ops (tree stmt)
618 struct maydef_optype_d new_list;
619 maydef_optype_p old_ops, ptr, last;
621 unsigned old_base, new_base;
623 new_list.next = NULL;
626 old_ops = MAYDEF_OPS (stmt);
629 while (old_ops && new_i < VEC_length (tree, build_v_may_defs))
631 act = VEC_index (tree, build_v_may_defs, new_i);
632 new_base = get_name_decl (act);
633 old_base = get_name_decl (MAYDEF_OP (old_ops));
635 if (old_base == new_base)
637 /* if variables are the same, reuse this node. */
638 MOVE_HEAD_AFTER (old_ops, last);
639 set_virtual_use_link (MAYDEF_OP_PTR (last), stmt);
642 else if (old_base < new_base)
644 /* if old is less than new, old goes to the free list. */
645 delink_imm_use (MAYDEF_OP_PTR (old_ops));
646 MOVE_HEAD_TO_FREELIST (old_ops, maydef);
650 /* This is a new operand. */
651 add_maydef_op (stmt, act, &last);
656 /* If there is anything remaining in the build_v_may_defs list, simply emit it. */
657 for ( ; new_i < VEC_length (tree, build_v_may_defs); new_i++)
658 add_maydef_op (stmt, VEC_index (tree, build_v_may_defs, new_i), &last);
662 /* If there is anything in the old list, free it. */
665 for (ptr = old_ops; ptr; ptr = ptr->next)
666 delink_imm_use (MAYDEF_OP_PTR (ptr));
667 old_ops->next = gimple_ssa_operands (cfun)->free_maydefs;
668 gimple_ssa_operands (cfun)->free_maydefs = old_ops;
671 /* Now set the stmt's operands. */
672 MAYDEF_OPS (stmt) = new_list.next;
674 #ifdef ENABLE_CHECKING
677 for (ptr = MAYDEF_OPS (stmt); ptr; ptr = ptr->next)
680 gcc_assert (x == VEC_length (tree, build_v_may_defs));
686 finalize_ssa_v_may_defs (tree stmt)
688 finalize_ssa_v_may_def_ops (stmt);
692 /* Clear the in_list bits and empty the build array for V_MAY_DEFs. */
695 cleanup_v_may_defs (void)
698 num = VEC_length (tree, build_v_may_defs);
700 for (x = 0; x < num; x++)
702 tree t = VEC_index (tree, build_v_may_defs, x);
703 if (TREE_CODE (t) != SSA_NAME)
705 var_ann_t ann = var_ann (t);
706 ann->in_v_may_def_list = 0;
709 VEC_truncate (tree, build_v_may_defs, 0);
713 /* Takes elements from build_vuses and turns them into vuse operands of
717 finalize_ssa_vuse_ops (tree stmt)
720 struct vuse_optype_d new_list;
721 vuse_optype_p old_ops, ptr, last;
723 unsigned old_base, new_base;
725 new_list.next = NULL;
728 old_ops = VUSE_OPS (stmt);
731 while (old_ops && new_i < VEC_length (tree, build_vuses))
733 act = VEC_index (tree, build_vuses, new_i);
734 new_base = get_name_decl (act);
735 old_base = get_name_decl (VUSE_OP (old_ops));
737 if (old_base == new_base)
739 /* if variables are the same, reuse this node. */
740 MOVE_HEAD_AFTER (old_ops, last);
741 set_virtual_use_link (VUSE_OP_PTR (last), stmt);
744 else if (old_base < new_base)
746 /* if old is less than new, old goes to the free list. */
747 delink_imm_use (USE_OP_PTR (old_ops));
748 MOVE_HEAD_TO_FREELIST (old_ops, vuse);
752 /* This is a new operand. */
753 add_vuse_op (stmt, act, &last);
758 /* If there is anything remaining in the build_vuses list, simply emit it. */
759 for ( ; new_i < VEC_length (tree, build_vuses); new_i++)
760 add_vuse_op (stmt, VEC_index (tree, build_vuses, new_i), &last);
764 /* If there is anything in the old list, free it. */
767 for (ptr = old_ops; ptr; ptr = ptr->next)
768 delink_imm_use (VUSE_OP_PTR (ptr));
769 old_ops->next = gimple_ssa_operands (cfun)->free_vuses;
770 gimple_ssa_operands (cfun)->free_vuses = old_ops;
773 /* Now set the stmt's operands. */
774 VUSE_OPS (stmt) = new_list.next;
776 #ifdef ENABLE_CHECKING
779 for (ptr = VUSE_OPS (stmt); ptr; ptr = ptr->next)
782 gcc_assert (x == VEC_length (tree, build_vuses));
787 /* Return a new VUSE operand vector, comparing to OLD_OPS_P. */
790 finalize_ssa_vuses (tree stmt)
792 unsigned num, num_v_may_defs;
795 /* Remove superfluous VUSE operands. If the statement already has a
796 V_MAY_DEF operation for a variable 'a', then a VUSE for 'a' is
797 not needed because V_MAY_DEFs imply a VUSE of the variable. For
798 instance, suppose that variable 'a' is aliased:
801 # a_3 = V_MAY_DEF <a_2>
804 The VUSE <a_2> is superfluous because it is implied by the
805 V_MAY_DEF operation. */
806 num = VEC_length (tree, build_vuses);
807 num_v_may_defs = VEC_length (tree, build_v_may_defs);
809 if (num > 0 && num_v_may_defs > 0)
811 for (vuse_index = 0; vuse_index < VEC_length (tree, build_vuses); )
814 vuse = VEC_index (tree, build_vuses, vuse_index);
815 if (TREE_CODE (vuse) != SSA_NAME)
817 var_ann_t ann = var_ann (vuse);
818 ann->in_vuse_list = 0;
819 if (ann->in_v_may_def_list)
821 VEC_ordered_remove (tree, build_vuses, vuse_index);
830 /* Clear out the in_list bits. */
832 vuse_index < VEC_length (tree, build_vuses);
835 tree t = VEC_index (tree, build_vuses, vuse_index);
836 if (TREE_CODE (t) != SSA_NAME)
838 var_ann_t ann = var_ann (t);
839 ann->in_vuse_list = 0;
844 finalize_ssa_vuse_ops (stmt);
846 /* The V_MAY_DEF build vector wasn't cleaned up because we needed it. */
847 cleanup_v_may_defs ();
849 /* Free the VUSEs build vector. */
850 VEC_truncate (tree, build_vuses, 0);
854 /* Takes elements from build_v_must_defs and turns them into mustdef operands of
858 finalize_ssa_v_must_def_ops (tree stmt)
861 struct mustdef_optype_d new_list;
862 mustdef_optype_p old_ops, ptr, last;
864 unsigned old_base, new_base;
866 new_list.next = NULL;
869 old_ops = MUSTDEF_OPS (stmt);
872 while (old_ops && new_i < VEC_length (tree, build_v_must_defs))
874 act = VEC_index (tree, build_v_must_defs, new_i);
875 new_base = get_name_decl (act);
876 old_base = get_name_decl (MUSTDEF_KILL (old_ops));
878 if (old_base == new_base)
880 /* If variables are the same, reuse this node. */
881 MOVE_HEAD_AFTER (old_ops, last);
882 set_virtual_use_link (MUSTDEF_KILL_PTR (last), stmt);
885 else if (old_base < new_base)
887 /* If old is less than new, old goes to the free list. */
888 delink_imm_use (MUSTDEF_KILL_PTR (old_ops));
889 MOVE_HEAD_TO_FREELIST (old_ops, mustdef);
893 /* This is a new operand. */
894 add_mustdef_op (stmt, act, &last);
899 /* If there is anything remaining in the build_v_must_defs list, simply emit it. */
900 for ( ; new_i < VEC_length (tree, build_v_must_defs); new_i++)
901 add_mustdef_op (stmt, VEC_index (tree, build_v_must_defs, new_i), &last);
905 /* If there is anything in the old list, free it. */
908 for (ptr = old_ops; ptr; ptr = ptr->next)
909 delink_imm_use (MUSTDEF_KILL_PTR (ptr));
910 old_ops->next = gimple_ssa_operands (cfun)->free_mustdefs;
911 gimple_ssa_operands (cfun)->free_mustdefs = old_ops;
914 /* Now set the stmt's operands. */
915 MUSTDEF_OPS (stmt) = new_list.next;
917 #ifdef ENABLE_CHECKING
920 for (ptr = MUSTDEF_OPS (stmt); ptr; ptr = ptr->next)
923 gcc_assert (x == VEC_length (tree, build_v_must_defs));
929 finalize_ssa_v_must_defs (tree stmt)
931 /* In the presence of subvars, there may be more than one V_MUST_DEF
932 per statement (one for each subvar). It is a bit expensive to
933 verify that all must-defs in a statement belong to subvars if
934 there is more than one must-def, so we don't do it. Suffice to
935 say, if you reach here without having subvars, and have num >1,
936 you have hit a bug. */
937 finalize_ssa_v_must_def_ops (stmt);
938 VEC_truncate (tree, build_v_must_defs, 0);
942 /* Finalize all the build vectors, fill the new ones into INFO. */
945 finalize_ssa_stmt_operands (tree stmt)
947 finalize_ssa_defs (stmt);
948 finalize_ssa_uses (stmt);
949 finalize_ssa_v_must_defs (stmt);
950 finalize_ssa_v_may_defs (stmt);
951 finalize_ssa_vuses (stmt);
955 /* Start the process of building up operands vectors in INFO. */
958 start_ssa_stmt_operands (void)
960 gcc_assert (VEC_length (tree, build_defs) == 0);
961 gcc_assert (VEC_length (tree, build_uses) == 0);
962 gcc_assert (VEC_length (tree, build_vuses) == 0);
963 gcc_assert (VEC_length (tree, build_v_may_defs) == 0);
964 gcc_assert (VEC_length (tree, build_v_must_defs) == 0);
968 /* Add DEF_P to the list of pointers to operands. */
971 append_def (tree *def_p)
973 VEC_safe_push (tree, heap, build_defs, (tree)def_p);
977 /* Add USE_P to the list of pointers to operands. */
980 append_use (tree *use_p)
982 VEC_safe_push (tree, heap, build_uses, (tree)use_p);
986 /* Add a new virtual may def for variable VAR to the build array. */
989 append_v_may_def (tree var)
991 if (TREE_CODE (var) != SSA_NAME)
993 var_ann_t ann = get_var_ann (var);
995 /* Don't allow duplicate entries. */
996 if (ann->in_v_may_def_list)
998 ann->in_v_may_def_list = 1;
1001 VEC_safe_push (tree, heap, build_v_may_defs, (tree)var);
1005 /* Add VAR to the list of virtual uses. */
1008 append_vuse (tree var)
1010 /* Don't allow duplicate entries. */
1011 if (TREE_CODE (var) != SSA_NAME)
1013 var_ann_t ann = get_var_ann (var);
1015 if (ann->in_vuse_list || ann->in_v_may_def_list)
1017 ann->in_vuse_list = 1;
1020 VEC_safe_push (tree, heap, build_vuses, (tree)var);
1024 /* Add VAR to the list of virtual must definitions for INFO. */
1027 append_v_must_def (tree var)
1031 /* Don't allow duplicate entries. */
1032 for (i = 0; i < VEC_length (tree, build_v_must_defs); i++)
1033 if (var == VEC_index (tree, build_v_must_defs, i))
1036 VEC_safe_push (tree, heap, build_v_must_defs, (tree)var);
1040 /* REF is a tree that contains the entire pointer dereference
1041 expression, if available, or NULL otherwise. ALIAS is the variable
1042 we are asking if REF can access. OFFSET and SIZE come from the
1043 memory access expression that generated this virtual operand. */
1046 access_can_touch_variable (tree ref, tree alias, HOST_WIDE_INT offset,
1049 bool offsetgtz = offset > 0;
1050 unsigned HOST_WIDE_INT uoffset = (unsigned HOST_WIDE_INT) offset;
1051 tree base = ref ? get_base_address (ref) : NULL;
1053 /* If ALIAS is .GLOBAL_VAR then the memory reference REF must be
1054 using a call-clobbered memory tag. By definition, call-clobbered
1055 memory tags can always touch .GLOBAL_VAR. */
1056 if (alias == gimple_global_var (cfun))
1059 /* If ALIAS is an SFT, it can't be touched if the offset
1060 and size of the access is not overlapping with the SFT offset and
1061 size. This is only true if we are accessing through a pointer
1062 to a type that is the same as SFT_PARENT_VAR. Otherwise, we may
1063 be accessing through a pointer to some substruct of the
1064 structure, and if we try to prune there, we will have the wrong
1065 offset, and get the wrong answer.
1066 i.e., we can't prune without more work if we have something like
1072 const char *byte_op;
1080 foo = &targetm.asm_out.aligned_op;
1083 SFT.1, which represents hi, will have SFT_OFFSET=32 because in
1084 terms of SFT_PARENT_VAR, that is where it is.
1085 However, the access through the foo pointer will be at offset 0. */
1087 && TREE_CODE (alias) == STRUCT_FIELD_TAG
1089 && TREE_TYPE (base) == TREE_TYPE (SFT_PARENT_VAR (alias))
1090 && !overlap_subvar (offset, size, alias, NULL))
1092 #ifdef ACCESS_DEBUGGING
1093 fprintf (stderr, "Access to ");
1094 print_generic_expr (stderr, ref, 0);
1095 fprintf (stderr, " may not touch ");
1096 print_generic_expr (stderr, alias, 0);
1097 fprintf (stderr, " in function %s\n", get_name (current_function_decl));
1102 /* Without strict aliasing, it is impossible for a component access
1103 through a pointer to touch a random variable, unless that
1104 variable *is* a structure or a pointer.
1106 That is, given p->c, and some random global variable b,
1107 there is no legal way that p->c could be an access to b.
1109 Without strict aliasing on, we consider it legal to do something
1112 struct foos { int l; };
1114 static struct foos *getfoo(void);
1117 struct foos *f = getfoo();
1124 static struct foos *getfoo(void)
1125 { return (struct foos *)&foo; }
1127 (taken from 20000623-1.c)
1129 The docs also say/imply that access through union pointers
1130 is legal (but *not* if you take the address of the union member,
1131 i.e. the inverse), such that you can do
1141 U *pretmp = (U*)&rv;
1145 To implement this, we just punt on accesses through union
1149 && flag_strict_aliasing
1150 && TREE_CODE (ref) != INDIRECT_REF
1152 && (TREE_CODE (base) != INDIRECT_REF
1153 || TREE_CODE (TREE_TYPE (base)) != UNION_TYPE)
1154 && !AGGREGATE_TYPE_P (TREE_TYPE (alias))
1155 && TREE_CODE (TREE_TYPE (alias)) != COMPLEX_TYPE
1157 /* FIXME: PR tree-optimization/29680. */
1158 && !var_ann (alias)->is_heapvar
1160 && !POINTER_TYPE_P (TREE_TYPE (alias))
1162 /* When the struct has may_alias attached to it, we need not to
1164 && get_alias_set (base))
1166 #ifdef ACCESS_DEBUGGING
1167 fprintf (stderr, "Access to ");
1168 print_generic_expr (stderr, ref, 0);
1169 fprintf (stderr, " may not touch ");
1170 print_generic_expr (stderr, alias, 0);
1171 fprintf (stderr, " in function %s\n", get_name (current_function_decl));
1176 /* If the offset of the access is greater than the size of one of
1177 the possible aliases, it can't be touching that alias, because it
1178 would be past the end of the structure. */
1180 && flag_strict_aliasing
1181 && TREE_CODE (ref) != INDIRECT_REF
1183 && !POINTER_TYPE_P (TREE_TYPE (alias))
1185 && DECL_SIZE (alias)
1186 && TREE_CODE (DECL_SIZE (alias)) == INTEGER_CST
1187 && uoffset > TREE_INT_CST_LOW (DECL_SIZE (alias)))
1189 #ifdef ACCESS_DEBUGGING
1190 fprintf (stderr, "Access to ");
1191 print_generic_expr (stderr, ref, 0);
1192 fprintf (stderr, " may not touch ");
1193 print_generic_expr (stderr, alias, 0);
1194 fprintf (stderr, " in function %s\n", get_name (current_function_decl));
1203 /* Add VAR to the virtual operands array. FLAGS is as in
1204 get_expr_operands. FULL_REF is a tree that contains the entire
1205 pointer dereference expression, if available, or NULL otherwise.
1206 OFFSET and SIZE come from the memory access expression that
1207 generated this virtual operand. FOR_CLOBBER is true is this is
1208 adding a virtual operand for a call clobber. */
1211 add_virtual_operand (tree var, stmt_ann_t s_ann, int flags,
1212 tree full_ref, HOST_WIDE_INT offset,
1213 HOST_WIDE_INT size, bool for_clobber)
1215 VEC(tree,gc) *aliases;
1219 sym = (TREE_CODE (var) == SSA_NAME ? SSA_NAME_VAR (var) : var);
1220 v_ann = var_ann (sym);
1222 /* Mark statements with volatile operands. Optimizers should back
1223 off from statements having volatile operands. */
1224 if (TREE_THIS_VOLATILE (sym) && s_ann)
1225 s_ann->has_volatile_ops = true;
1227 /* If the variable cannot be modified and this is a V_MAY_DEF change
1228 it into a VUSE. This happens when read-only variables are marked
1229 call-clobbered and/or aliased to writable variables. So we only
1230 check that this only happens on non-specific stores.
1232 Note that if this is a specific store, i.e. associated with a
1233 gimple_modify_stmt, then we can't suppress the V_MAY_DEF, lest we run
1234 into validation problems.
1236 This can happen when programs cast away const, leaving us with a
1237 store to read-only memory. If the statement is actually executed
1238 at runtime, then the program is ill formed. If the statement is
1239 not executed then all is well. At the very least, we cannot ICE. */
1240 if ((flags & opf_non_specific) && unmodifiable_var_p (var))
1241 flags &= ~(opf_is_def | opf_kill_def);
1243 /* The variable is not a GIMPLE register. Add it (or its aliases) to
1244 virtual operands, unless the caller has specifically requested
1245 not to add virtual operands (used when adding operands inside an
1246 ADDR_EXPR expression). */
1247 if (flags & opf_no_vops)
1250 aliases = v_ann->may_aliases;
1251 if (aliases == NULL)
1253 /* The variable is not aliased or it is an alias tag. */
1254 if (flags & opf_is_def)
1256 if (flags & opf_kill_def)
1258 /* V_MUST_DEF for non-aliased, non-GIMPLE register
1259 variable definitions. */
1260 gcc_assert (!MTAG_P (var)
1261 || TREE_CODE (var) == STRUCT_FIELD_TAG);
1262 append_v_must_def (var);
1266 /* Add a V_MAY_DEF for call-clobbered variables and
1268 append_v_may_def (var);
1279 /* The variable is aliased. Add its aliases to the virtual
1281 gcc_assert (VEC_length (tree, aliases) != 0);
1283 if (flags & opf_is_def)
1286 bool none_added = true;
1288 for (i = 0; VEC_iterate (tree, aliases, i, al); i++)
1290 if (!access_can_touch_variable (full_ref, al, offset, size))
1294 append_v_may_def (al);
1297 /* If the variable is also an alias tag, add a virtual
1298 operand for it, otherwise we will miss representing
1299 references to the members of the variable's alias set.
1300 This fixes the bug in gcc.c-torture/execute/20020503-1.c.
1302 It is also necessary to add bare defs on clobbers for
1303 SMT's, so that bare SMT uses caused by pruning all the
1304 aliases will link up properly with calls. In order to
1305 keep the number of these bare defs we add down to the
1306 minimum necessary, we keep track of which SMT's were used
1307 alone in statement vdefs or VUSEs. */
1308 if (v_ann->is_aliased
1310 || (TREE_CODE (var) == SYMBOL_MEMORY_TAG
1312 && SMT_USED_ALONE (var)))
1314 /* Every bare SMT def we add should have SMT_USED_ALONE
1315 set on it, or else we will get the wrong answer on
1318 && !updating_used_alone && gimple_aliases_computed_p (cfun)
1319 && TREE_CODE (var) == SYMBOL_MEMORY_TAG)
1320 gcc_assert (SMT_USED_ALONE (var));
1322 append_v_may_def (var);
1327 bool none_added = true;
1328 for (i = 0; VEC_iterate (tree, aliases, i, al); i++)
1330 if (!access_can_touch_variable (full_ref, al, offset, size))
1336 /* Similarly, append a virtual uses for VAR itself, when
1337 it is an alias tag. */
1338 if (v_ann->is_aliased || none_added)
1345 /* Add *VAR_P to the appropriate operand array for S_ANN. FLAGS is as in
1346 get_expr_operands. If *VAR_P is a GIMPLE register, it will be added to
1347 the statement's real operands, otherwise it is added to virtual
1351 add_stmt_operand (tree *var_p, stmt_ann_t s_ann, int flags)
1358 gcc_assert (SSA_VAR_P (var));
1360 is_real_op = is_gimple_reg (var);
1362 /* If this is a real operand, the operand is either an SSA name or a
1363 decl. Virtual operands may only be decls. */
1364 gcc_assert (is_real_op || DECL_P (var));
1366 sym = (TREE_CODE (var) == SSA_NAME ? SSA_NAME_VAR (var) : var);
1367 v_ann = var_ann (sym);
1369 /* Mark statements with volatile operands. Optimizers should back
1370 off from statements having volatile operands. */
1371 if (TREE_THIS_VOLATILE (sym) && s_ann)
1372 s_ann->has_volatile_ops = true;
1376 /* The variable is a GIMPLE register. Add it to real operands. */
1377 if (flags & opf_is_def)
1383 add_virtual_operand (var, s_ann, flags, NULL_TREE, 0, -1, false);
1387 /* A subroutine of get_expr_operands to handle INDIRECT_REF,
1388 ALIGN_INDIRECT_REF and MISALIGNED_INDIRECT_REF.
1390 STMT is the statement being processed, EXPR is the INDIRECT_REF
1393 FLAGS is as in get_expr_operands.
1395 FULL_REF contains the full pointer dereference expression, if we
1396 have it, or NULL otherwise.
1398 OFFSET and SIZE are the location of the access inside the
1399 dereferenced pointer, if known.
1401 RECURSE_ON_BASE should be set to true if we want to continue
1402 calling get_expr_operands on the base pointer, and false if
1403 something else will do it for us. */
1406 get_indirect_ref_operands (tree stmt, tree expr, int flags,
1408 HOST_WIDE_INT offset, HOST_WIDE_INT size,
1409 bool recurse_on_base)
1411 tree *pptr = &TREE_OPERAND (expr, 0);
1413 stmt_ann_t s_ann = stmt_ann (stmt);
1415 /* Stores into INDIRECT_REF operands are never killing definitions. */
1416 flags &= ~opf_kill_def;
1418 if (SSA_VAR_P (ptr))
1420 struct ptr_info_def *pi = NULL;
1422 /* If PTR has flow-sensitive points-to information, use it. */
1423 if (TREE_CODE (ptr) == SSA_NAME
1424 && (pi = SSA_NAME_PTR_INFO (ptr)) != NULL
1425 && pi->name_mem_tag)
1427 /* PTR has its own memory tag. Use it. */
1428 add_virtual_operand (pi->name_mem_tag, s_ann, flags,
1429 full_ref, offset, size, false);
1433 /* If PTR is not an SSA_NAME or it doesn't have a name
1434 tag, use its symbol memory tag. */
1437 /* If we are emitting debugging dumps, display a warning if
1438 PTR is an SSA_NAME with no flow-sensitive alias
1439 information. That means that we may need to compute
1442 && TREE_CODE (ptr) == SSA_NAME
1446 "NOTE: no flow-sensitive alias info for ");
1447 print_generic_expr (dump_file, ptr, dump_flags);
1448 fprintf (dump_file, " in ");
1449 print_generic_stmt (dump_file, stmt, dump_flags);
1452 if (TREE_CODE (ptr) == SSA_NAME)
1453 ptr = SSA_NAME_VAR (ptr);
1454 v_ann = var_ann (ptr);
1456 if (v_ann->symbol_mem_tag)
1457 add_virtual_operand (v_ann->symbol_mem_tag, s_ann, flags,
1458 full_ref, offset, size, false);
1461 else if (TREE_CODE (ptr) == INTEGER_CST)
1463 /* If a constant is used as a pointer, we can't generate a real
1464 operand for it but we mark the statement volatile to prevent
1465 optimizations from messing things up. */
1467 s_ann->has_volatile_ops = true;
1472 /* Ok, this isn't even is_gimple_min_invariant. Something's broke. */
1476 /* If requested, add a USE operand for the base pointer. */
1477 if (recurse_on_base)
1478 get_expr_operands (stmt, pptr, opf_none);
1482 /* A subroutine of get_expr_operands to handle TARGET_MEM_REF. */
1485 get_tmr_operands (tree stmt, tree expr, int flags)
1487 tree tag = TMR_TAG (expr), ref;
1488 HOST_WIDE_INT offset, size, maxsize;
1490 stmt_ann_t s_ann = stmt_ann (stmt);
1492 /* First record the real operands. */
1493 get_expr_operands (stmt, &TMR_BASE (expr), opf_none);
1494 get_expr_operands (stmt, &TMR_INDEX (expr), opf_none);
1496 /* MEM_REFs should never be killing. */
1497 flags &= ~opf_kill_def;
1499 if (TMR_SYMBOL (expr))
1501 stmt_ann_t ann = stmt_ann (stmt);
1502 add_to_addressable_set (TMR_SYMBOL (expr), &ann->addresses_taken);
1507 /* Something weird, so ensure that we will be careful. */
1508 stmt_ann (stmt)->has_volatile_ops = true;
1514 get_expr_operands (stmt, &tag, flags);
1518 ref = get_ref_base_and_extent (tag, &offset, &size, &maxsize);
1519 gcc_assert (ref != NULL_TREE);
1520 svars = get_subvars_for_var (ref);
1521 for (sv = svars; sv; sv = sv->next)
1524 if (overlap_subvar (offset, maxsize, sv->var, &exact))
1526 int subvar_flags = flags;
1527 if (!exact || size != maxsize)
1528 subvar_flags &= ~opf_kill_def;
1529 add_stmt_operand (&sv->var, s_ann, subvar_flags);
1535 /* Add clobbering definitions for .GLOBAL_VAR or for each of the call
1536 clobbered variables in the function. */
1539 add_call_clobber_ops (tree stmt, tree callee)
1543 stmt_ann_t s_ann = stmt_ann (stmt);
1544 bitmap not_read_b, not_written_b;
1546 /* Functions that are not const, pure or never return may clobber
1547 call-clobbered variables. */
1549 s_ann->makes_clobbering_call = true;
1551 /* If we created .GLOBAL_VAR earlier, just use it. See compute_may_aliases
1552 for the heuristic used to decide whether to create .GLOBAL_VAR or not. */
1553 if (gimple_global_var (cfun))
1555 tree var = gimple_global_var (cfun);
1556 add_stmt_operand (&var, s_ann, opf_is_def);
1560 /* Get info for local and module level statics. There is a bit
1561 set for each static if the call being processed does not read
1562 or write that variable. */
1563 not_read_b = callee ? ipa_reference_get_not_read_global (callee) : NULL;
1564 not_written_b = callee ? ipa_reference_get_not_written_global (callee) : NULL;
1565 /* Add a V_MAY_DEF operand for every call clobbered variable. */
1566 EXECUTE_IF_SET_IN_BITMAP (gimple_call_clobbered_vars (cfun), 0, u, bi)
1568 tree var = referenced_var_lookup (u);
1569 unsigned int escape_mask = var_ann (var)->escape_mask;
1570 tree real_var = var;
1574 /* Not read and not written are computed on regular vars, not
1575 subvars, so look at the parent var if this is an SFT. */
1576 if (TREE_CODE (var) == STRUCT_FIELD_TAG)
1577 real_var = SFT_PARENT_VAR (var);
1579 not_read = not_read_b ? bitmap_bit_p (not_read_b,
1580 DECL_UID (real_var)) : false;
1581 not_written = not_written_b ? bitmap_bit_p (not_written_b,
1582 DECL_UID (real_var)) : false;
1583 gcc_assert (!unmodifiable_var_p (var));
1585 clobber_stats.clobbered_vars++;
1587 /* See if this variable is really clobbered by this function. */
1589 /* Trivial case: Things escaping only to pure/const are not
1590 clobbered by non-pure-const, and only read by pure/const. */
1591 if ((escape_mask & ~(ESCAPE_TO_PURE_CONST)) == 0)
1593 tree call = get_call_expr_in (stmt);
1594 if (call_expr_flags (call) & (ECF_CONST | ECF_PURE))
1596 add_stmt_operand (&var, s_ann, opf_none);
1597 clobber_stats.unescapable_clobbers_avoided++;
1602 clobber_stats.unescapable_clobbers_avoided++;
1609 clobber_stats.static_write_clobbers_avoided++;
1611 add_stmt_operand (&var, s_ann, opf_none);
1613 clobber_stats.static_read_clobbers_avoided++;
1616 add_virtual_operand (var, s_ann, opf_is_def, NULL, 0, -1, true);
1621 /* Add VUSE operands for .GLOBAL_VAR or all call clobbered variables in the
1625 add_call_read_ops (tree stmt, tree callee)
1629 stmt_ann_t s_ann = stmt_ann (stmt);
1632 /* if the function is not pure, it may reference memory. Add
1633 a VUSE for .GLOBAL_VAR if it has been created. See add_referenced_var
1634 for the heuristic used to decide whether to create .GLOBAL_VAR. */
1635 if (gimple_global_var (cfun))
1637 tree var = gimple_global_var (cfun);
1638 add_stmt_operand (&var, s_ann, opf_none);
1642 not_read_b = callee ? ipa_reference_get_not_read_global (callee) : NULL;
1644 /* Add a VUSE for each call-clobbered variable. */
1645 EXECUTE_IF_SET_IN_BITMAP (gimple_call_clobbered_vars (cfun), 0, u, bi)
1647 tree var = referenced_var (u);
1648 tree real_var = var;
1651 clobber_stats.readonly_clobbers++;
1653 /* Not read and not written are computed on regular vars, not
1654 subvars, so look at the parent var if this is an SFT. */
1656 if (TREE_CODE (var) == STRUCT_FIELD_TAG)
1657 real_var = SFT_PARENT_VAR (var);
1659 not_read = not_read_b ? bitmap_bit_p (not_read_b, DECL_UID (real_var))
1664 clobber_stats.static_readonly_clobbers_avoided++;
1668 add_stmt_operand (&var, s_ann, opf_none | opf_non_specific);
1673 /* A subroutine of get_expr_operands to handle CALL_EXPR. */
1676 get_call_expr_operands (tree stmt, tree expr)
1679 int call_flags = call_expr_flags (expr);
1681 /* If aliases have been computed already, add V_MAY_DEF or V_USE
1682 operands for all the symbols that have been found to be
1685 Note that if aliases have not been computed, the global effects
1686 of calls will not be included in the SSA web. This is fine
1687 because no optimizer should run before aliases have been
1688 computed. By not bothering with virtual operands for CALL_EXPRs
1689 we avoid adding superfluous virtual operands, which can be a
1690 significant compile time sink (See PR 15855). */
1691 if (gimple_aliases_computed_p (cfun)
1692 && !bitmap_empty_p (gimple_call_clobbered_vars (cfun))
1693 && !(call_flags & ECF_NOVOPS))
1695 /* A 'pure' or a 'const' function never call-clobbers anything.
1696 A 'noreturn' function might, but since we don't return anyway
1697 there is no point in recording that. */
1698 if (TREE_SIDE_EFFECTS (expr)
1699 && !(call_flags & (ECF_PURE | ECF_CONST | ECF_NORETURN)))
1700 add_call_clobber_ops (stmt, get_callee_fndecl (expr));
1701 else if (!(call_flags & ECF_CONST))
1702 add_call_read_ops (stmt, get_callee_fndecl (expr));
1705 /* Find uses in the called function. */
1706 get_expr_operands (stmt, &TREE_OPERAND (expr, 0), opf_none);
1708 for (op = TREE_OPERAND (expr, 1); op; op = TREE_CHAIN (op))
1709 get_expr_operands (stmt, &TREE_VALUE (op), opf_none);
1711 get_expr_operands (stmt, &TREE_OPERAND (expr, 2), opf_none);
1715 /* Scan operands in the ASM_EXPR stmt referred to in INFO. */
1718 get_asm_expr_operands (tree stmt)
1720 stmt_ann_t s_ann = stmt_ann (stmt);
1721 int noutputs = list_length (ASM_OUTPUTS (stmt));
1722 const char **oconstraints
1723 = (const char **) alloca ((noutputs) * sizeof (const char *));
1726 const char *constraint;
1727 bool allows_mem, allows_reg, is_inout;
1729 for (i=0, link = ASM_OUTPUTS (stmt); link; ++i, link = TREE_CHAIN (link))
1731 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
1732 oconstraints[i] = constraint;
1733 parse_output_constraint (&constraint, i, 0, 0, &allows_mem,
1734 &allows_reg, &is_inout);
1736 /* This should have been split in gimplify_asm_expr. */
1737 gcc_assert (!allows_reg || !is_inout);
1739 /* Memory operands are addressable. Note that STMT needs the
1740 address of this operand. */
1741 if (!allows_reg && allows_mem)
1743 tree t = get_base_address (TREE_VALUE (link));
1744 if (t && DECL_P (t) && s_ann)
1745 add_to_addressable_set (t, &s_ann->addresses_taken);
1748 get_expr_operands (stmt, &TREE_VALUE (link), opf_is_def);
1751 for (link = ASM_INPUTS (stmt); link; link = TREE_CHAIN (link))
1753 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (link)));
1754 parse_input_constraint (&constraint, 0, 0, noutputs, 0,
1755 oconstraints, &allows_mem, &allows_reg);
1757 /* Memory operands are addressable. Note that STMT needs the
1758 address of this operand. */
1759 if (!allows_reg && allows_mem)
1761 tree t = get_base_address (TREE_VALUE (link));
1762 if (t && DECL_P (t) && s_ann)
1763 add_to_addressable_set (t, &s_ann->addresses_taken);
1766 get_expr_operands (stmt, &TREE_VALUE (link), 0);
1770 /* Clobber memory for asm ("" : : : "memory"); */
1771 for (link = ASM_CLOBBERS (stmt); link; link = TREE_CHAIN (link))
1772 if (strcmp (TREE_STRING_POINTER (TREE_VALUE (link)), "memory") == 0)
1777 /* Clobber all call-clobbered variables (or .GLOBAL_VAR if we
1778 decided to group them). */
1779 if (gimple_global_var (cfun))
1781 tree var = gimple_global_var (cfun);
1782 add_stmt_operand (&var, s_ann, opf_is_def);
1785 EXECUTE_IF_SET_IN_BITMAP (gimple_call_clobbered_vars (cfun), 0, i, bi)
1787 tree var = referenced_var (i);
1788 add_stmt_operand (&var, s_ann, opf_is_def | opf_non_specific);
1791 /* Now clobber all addressables. */
1792 EXECUTE_IF_SET_IN_BITMAP (gimple_addressable_vars (cfun), 0, i, bi)
1794 tree var = referenced_var (i);
1796 /* Subvars are explicitly represented in this list, so
1797 we don't need the original to be added to the clobber
1798 ops, but the original *will* be in this list because
1799 we keep the addressability of the original
1800 variable up-to-date so we don't screw up the rest of
1802 if (var_can_have_subvars (var)
1803 && get_subvars_for_var (var) != NULL)
1806 add_stmt_operand (&var, s_ann, opf_is_def | opf_non_specific);
1814 /* Scan operands for the assignment expression EXPR in statement STMT. */
1817 get_modify_stmt_operands (tree stmt, tree expr)
1819 /* First get operands from the RHS. */
1820 get_expr_operands (stmt, &GIMPLE_STMT_OPERAND (expr, 1), opf_none);
1822 /* For the LHS, use a regular definition (OPF_IS_DEF) for GIMPLE
1823 registers. If the LHS is a store to memory, we will either need
1824 a preserving definition (V_MAY_DEF) or a killing definition
1827 Preserving definitions are those that modify a part of an
1828 aggregate object for which no subvars have been computed (or the
1829 reference does not correspond exactly to one of them). Stores
1830 through a pointer are also represented with V_MAY_DEF operators.
1832 The determination of whether to use a preserving or a killing
1833 definition is done while scanning the LHS of the assignment. By
1834 default, assume that we will emit a V_MUST_DEF. */
1835 get_expr_operands (stmt, &GIMPLE_STMT_OPERAND (expr, 0),
1836 opf_is_def|opf_kill_def);
1840 /* Recursively scan the expression pointed to by EXPR_P in statement
1841 STMT. FLAGS is one of the OPF_* constants modifying how to
1842 interpret the operands found. */
1845 get_expr_operands (tree stmt, tree *expr_p, int flags)
1847 enum tree_code code;
1848 enum tree_code_class class;
1849 tree expr = *expr_p;
1850 stmt_ann_t s_ann = stmt_ann (stmt);
1855 code = TREE_CODE (expr);
1856 class = TREE_CODE_CLASS (code);
1861 /* Taking the address of a variable does not represent a
1862 reference to it, but the fact that the statement takes its
1863 address will be of interest to some passes (e.g. alias
1865 add_to_addressable_set (TREE_OPERAND (expr, 0), &s_ann->addresses_taken);
1867 /* If the address is invariant, there may be no interesting
1868 variable references inside. */
1869 if (is_gimple_min_invariant (expr))
1872 /* Otherwise, there may be variables referenced inside but there
1873 should be no VUSEs created, since the referenced objects are
1874 not really accessed. The only operands that we should find
1875 here are ARRAY_REF indices which will always be real operands
1876 (GIMPLE does not allow non-registers as array indices). */
1877 flags |= opf_no_vops;
1878 get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
1882 case STRUCT_FIELD_TAG:
1883 case SYMBOL_MEMORY_TAG:
1884 case NAME_MEMORY_TAG:
1885 add_stmt_operand (expr_p, s_ann, flags);
1894 /* Add the subvars for a variable, if it has subvars, to DEFS
1895 or USES. Otherwise, add the variable itself. Whether it
1896 goes to USES or DEFS depends on the operand flags. */
1897 if (var_can_have_subvars (expr)
1898 && (svars = get_subvars_for_var (expr)))
1901 for (sv = svars; sv; sv = sv->next)
1902 add_stmt_operand (&sv->var, s_ann, flags);
1905 add_stmt_operand (expr_p, s_ann, flags);
1910 case MISALIGNED_INDIRECT_REF:
1911 get_expr_operands (stmt, &TREE_OPERAND (expr, 1), flags);
1914 case ALIGN_INDIRECT_REF:
1916 get_indirect_ref_operands (stmt, expr, flags, NULL_TREE, 0, -1, true);
1919 case TARGET_MEM_REF:
1920 get_tmr_operands (stmt, expr, flags);
1924 case ARRAY_RANGE_REF:
1930 HOST_WIDE_INT offset, size, maxsize;
1933 /* This component reference becomes an access to all of the
1934 subvariables it can touch, if we can determine that, but
1935 *NOT* the real one. If we can't determine which fields we
1936 could touch, the recursion will eventually get to a
1937 variable and add *all* of its subvars, or whatever is the
1938 minimum correct subset. */
1939 ref = get_ref_base_and_extent (expr, &offset, &size, &maxsize);
1940 if (SSA_VAR_P (ref) && get_subvars_for_var (ref))
1943 subvar_t svars = get_subvars_for_var (ref);
1945 for (sv = svars; sv; sv = sv->next)
1949 if (overlap_subvar (offset, maxsize, sv->var, &exact))
1951 int subvar_flags = flags;
1953 if (!exact || size != maxsize)
1954 subvar_flags &= ~opf_kill_def;
1955 add_stmt_operand (&sv->var, s_ann, subvar_flags);
1960 flags |= opf_no_vops;
1962 else if (TREE_CODE (ref) == INDIRECT_REF)
1964 get_indirect_ref_operands (stmt, ref, flags, expr, offset,
1966 flags |= opf_no_vops;
1969 /* Even if we found subvars above we need to ensure to see
1970 immediate uses for d in s.a[d]. In case of s.a having
1971 a subvar or we would miss it otherwise. */
1972 get_expr_operands (stmt, &TREE_OPERAND (expr, 0),
1973 flags & ~opf_kill_def);
1975 if (code == COMPONENT_REF)
1977 if (s_ann && TREE_THIS_VOLATILE (TREE_OPERAND (expr, 1)))
1978 s_ann->has_volatile_ops = true;
1979 get_expr_operands (stmt, &TREE_OPERAND (expr, 2), opf_none);
1981 else if (code == ARRAY_REF || code == ARRAY_RANGE_REF)
1983 get_expr_operands (stmt, &TREE_OPERAND (expr, 1), opf_none);
1984 get_expr_operands (stmt, &TREE_OPERAND (expr, 2), opf_none);
1985 get_expr_operands (stmt, &TREE_OPERAND (expr, 3), opf_none);
1991 case WITH_SIZE_EXPR:
1992 /* WITH_SIZE_EXPR is a pass-through reference to its first argument,
1993 and an rvalue reference to its second argument. */
1994 get_expr_operands (stmt, &TREE_OPERAND (expr, 1), opf_none);
1995 get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
1999 get_call_expr_operands (stmt, expr);
2004 get_expr_operands (stmt, &TREE_OPERAND (expr, 0), opf_none);
2005 get_expr_operands (stmt, &TREE_OPERAND (expr, 1), opf_none);
2006 get_expr_operands (stmt, &TREE_OPERAND (expr, 2), opf_none);
2009 case GIMPLE_MODIFY_STMT:
2010 get_modify_stmt_operands (stmt, expr);
2015 /* General aggregate CONSTRUCTORs have been decomposed, but they
2016 are still in use as the COMPLEX_EXPR equivalent for vectors. */
2017 constructor_elt *ce;
2018 unsigned HOST_WIDE_INT idx;
2021 VEC_iterate (constructor_elt, CONSTRUCTOR_ELTS (expr), idx, ce);
2023 get_expr_operands (stmt, &ce->value, opf_none);
2029 /* Stores using BIT_FIELD_REF are always preserving definitions. */
2030 flags &= ~opf_kill_def;
2034 case TRUTH_NOT_EXPR:
2035 case VIEW_CONVERT_EXPR:
2037 get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
2040 case TRUTH_AND_EXPR:
2042 case TRUTH_XOR_EXPR:
2048 get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
2049 get_expr_operands (stmt, &TREE_OPERAND (expr, 1), flags);
2054 case REALIGN_LOAD_EXPR:
2056 get_expr_operands (stmt, &TREE_OPERAND (expr, 0), flags);
2057 get_expr_operands (stmt, &TREE_OPERAND (expr, 1), flags);
2058 get_expr_operands (stmt, &TREE_OPERAND (expr, 2), flags);
2077 /* Expressions that make no memory references. */
2081 if (class == tcc_unary)
2083 if (class == tcc_binary || class == tcc_comparison)
2085 if (class == tcc_constant || class == tcc_type)
2089 /* If we get here, something has gone wrong. */
2090 #ifdef ENABLE_CHECKING
2091 fprintf (stderr, "unhandled expression in get_expr_operands():\n");
2093 fputs ("\n", stderr);
2099 /* Parse STMT looking for operands. When finished, the various
2100 build_* operand vectors will have potential operands in them. */
2103 parse_ssa_operands (tree stmt)
2105 enum tree_code code;
2107 code = TREE_CODE (stmt);
2110 case GIMPLE_MODIFY_STMT:
2111 get_modify_stmt_operands (stmt, stmt);
2115 get_expr_operands (stmt, &COND_EXPR_COND (stmt), opf_none);
2119 get_expr_operands (stmt, &SWITCH_COND (stmt), opf_none);
2123 get_asm_expr_operands (stmt);
2127 get_expr_operands (stmt, &TREE_OPERAND (stmt, 0), opf_none);
2131 get_expr_operands (stmt, &GOTO_DESTINATION (stmt), opf_none);
2135 get_expr_operands (stmt, &LABEL_EXPR_LABEL (stmt), opf_none);
2139 case CASE_LABEL_EXPR:
2140 case TRY_CATCH_EXPR:
2141 case TRY_FINALLY_EXPR:
2142 case EH_FILTER_EXPR:
2145 /* These nodes contain no variable references. */
2149 /* Notice that if get_expr_operands tries to use &STMT as the
2150 operand pointer (which may only happen for USE operands), we
2151 will fail in add_stmt_operand. This default will handle
2152 statements like empty statements, or CALL_EXPRs that may
2153 appear on the RHS of a statement or as statements themselves. */
2154 get_expr_operands (stmt, &stmt, opf_none);
2160 /* Create an operands cache for STMT. */
2163 build_ssa_operands (tree stmt)
2165 stmt_ann_t ann = get_stmt_ann (stmt);
2167 /* Initially assume that the statement has no volatile operands. */
2169 ann->has_volatile_ops = false;
2171 start_ssa_stmt_operands ();
2173 parse_ssa_operands (stmt);
2174 operand_build_sort_virtual (build_vuses);
2175 operand_build_sort_virtual (build_v_may_defs);
2176 operand_build_sort_virtual (build_v_must_defs);
2178 finalize_ssa_stmt_operands (stmt);
2182 /* Free any operands vectors in OPS. */
2185 free_ssa_operands (stmt_operands_p ops)
2187 ops->def_ops = NULL;
2188 ops->use_ops = NULL;
2189 ops->maydef_ops = NULL;
2190 ops->mustdef_ops = NULL;
2191 ops->vuse_ops = NULL;
2195 /* Get the operands of statement STMT. */
2198 update_stmt_operands (tree stmt)
2200 stmt_ann_t ann = get_stmt_ann (stmt);
2202 /* If update_stmt_operands is called before SSA is initialized, do
2204 if (!ssa_operands_active ())
2207 /* The optimizers cannot handle statements that are nothing but a
2208 _DECL. This indicates a bug in the gimplifier. */
2209 gcc_assert (!SSA_VAR_P (stmt));
2211 gcc_assert (ann->modified);
2213 timevar_push (TV_TREE_OPS);
2215 build_ssa_operands (stmt);
2217 /* Clear the modified bit for STMT. */
2220 timevar_pop (TV_TREE_OPS);
2224 /* Copies virtual operands from SRC to DST. */
2227 copy_virtual_operands (tree dest, tree src)
2230 ssa_op_iter iter, old_iter;
2231 use_operand_p use_p, u2;
2232 def_operand_p def_p, d2;
2234 build_ssa_operands (dest);
2236 /* Copy all the virtual fields. */
2237 FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VUSE)
2239 FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VMAYDEF)
2240 append_v_may_def (t);
2241 FOR_EACH_SSA_TREE_OPERAND (t, src, iter, SSA_OP_VMUSTDEF)
2242 append_v_must_def (t);
2244 if (VEC_length (tree, build_vuses) == 0
2245 && VEC_length (tree, build_v_may_defs) == 0
2246 && VEC_length (tree, build_v_must_defs) == 0)
2249 /* Now commit the virtual operands to this stmt. */
2250 finalize_ssa_v_must_defs (dest);
2251 finalize_ssa_v_may_defs (dest);
2252 finalize_ssa_vuses (dest);
2254 /* Finally, set the field to the same values as then originals. */
2255 t = op_iter_init_tree (&old_iter, src, SSA_OP_VUSE);
2256 FOR_EACH_SSA_USE_OPERAND (use_p, dest, iter, SSA_OP_VUSE)
2258 gcc_assert (!op_iter_done (&old_iter));
2260 t = op_iter_next_tree (&old_iter);
2262 gcc_assert (op_iter_done (&old_iter));
2264 op_iter_init_maydef (&old_iter, src, &u2, &d2);
2265 FOR_EACH_SSA_MAYDEF_OPERAND (def_p, use_p, dest, iter)
2267 gcc_assert (!op_iter_done (&old_iter));
2268 SET_USE (use_p, USE_FROM_PTR (u2));
2269 SET_DEF (def_p, DEF_FROM_PTR (d2));
2270 op_iter_next_maymustdef (&u2, &d2, &old_iter);
2272 gcc_assert (op_iter_done (&old_iter));
2274 op_iter_init_mustdef (&old_iter, src, &u2, &d2);
2275 FOR_EACH_SSA_MUSTDEF_OPERAND (def_p, use_p, dest, iter)
2277 gcc_assert (!op_iter_done (&old_iter));
2278 SET_USE (use_p, USE_FROM_PTR (u2));
2279 SET_DEF (def_p, DEF_FROM_PTR (d2));
2280 op_iter_next_maymustdef (&u2, &d2, &old_iter);
2282 gcc_assert (op_iter_done (&old_iter));
2287 /* Specifically for use in DOM's expression analysis. Given a store, we
2288 create an artificial stmt which looks like a load from the store, this can
2289 be used to eliminate redundant loads. OLD_OPS are the operands from the
2290 store stmt, and NEW_STMT is the new load which represents a load of the
2294 create_ssa_artficial_load_stmt (tree new_stmt, tree old_stmt)
2299 use_operand_p use_p;
2302 ann = get_stmt_ann (new_stmt);
2304 /* Process the stmt looking for operands. */
2305 start_ssa_stmt_operands ();
2306 parse_ssa_operands (new_stmt);
2308 for (x = 0; x < VEC_length (tree, build_vuses); x++)
2310 tree t = VEC_index (tree, build_vuses, x);
2311 if (TREE_CODE (t) != SSA_NAME)
2313 var_ann_t ann = var_ann (t);
2314 ann->in_vuse_list = 0;
2318 for (x = 0; x < VEC_length (tree, build_v_may_defs); x++)
2320 tree t = VEC_index (tree, build_v_may_defs, x);
2321 if (TREE_CODE (t) != SSA_NAME)
2323 var_ann_t ann = var_ann (t);
2324 ann->in_v_may_def_list = 0;
2328 /* Remove any virtual operands that were found. */
2329 VEC_truncate (tree, build_v_may_defs, 0);
2330 VEC_truncate (tree, build_v_must_defs, 0);
2331 VEC_truncate (tree, build_vuses, 0);
2333 /* For each VDEF on the original statement, we want to create a
2334 VUSE of the V_MAY_DEF result or V_MUST_DEF op on the new
2336 FOR_EACH_SSA_TREE_OPERAND (op, old_stmt, iter,
2337 (SSA_OP_VMAYDEF | SSA_OP_VMUSTDEF))
2340 /* Now build the operands for this new stmt. */
2341 finalize_ssa_stmt_operands (new_stmt);
2343 /* All uses in this fake stmt must not be in the immediate use lists. */
2344 FOR_EACH_SSA_USE_OPERAND (use_p, new_stmt, iter, SSA_OP_ALL_USES)
2345 delink_imm_use (use_p);
2349 /* Swap operands EXP0 and EXP1 in statement STMT. No attempt is done
2350 to test the validity of the swap operation. */
2353 swap_tree_operands (tree stmt, tree *exp0, tree *exp1)
2359 /* If the operand cache is active, attempt to preserve the relative
2360 positions of these two operands in their respective immediate use
2362 if (ssa_operands_active () && op0 != op1)
2364 use_optype_p use0, use1, ptr;
2367 /* Find the 2 operands in the cache, if they are there. */
2368 for (ptr = USE_OPS (stmt); ptr; ptr = ptr->next)
2369 if (USE_OP_PTR (ptr)->use == exp0)
2375 for (ptr = USE_OPS (stmt); ptr; ptr = ptr->next)
2376 if (USE_OP_PTR (ptr)->use == exp1)
2382 /* If both uses don't have operand entries, there isn't much we can do
2383 at this point. Presumably we don't need to worry about it. */
2386 tree *tmp = USE_OP_PTR (use1)->use;
2387 USE_OP_PTR (use1)->use = USE_OP_PTR (use0)->use;
2388 USE_OP_PTR (use0)->use = tmp;
2392 /* Now swap the data. */
2398 /* Add the base address of REF to the set *ADDRESSES_TAKEN. If
2399 *ADDRESSES_TAKEN is NULL, a new set is created. REF may be
2400 a single variable whose address has been taken or any other valid
2401 GIMPLE memory reference (structure reference, array, etc). If the
2402 base address of REF is a decl that has sub-variables, also add all
2403 of its sub-variables. */
2406 add_to_addressable_set (tree ref, bitmap *addresses_taken)
2411 gcc_assert (addresses_taken);
2413 /* Note that it is *NOT OKAY* to use the target of a COMPONENT_REF
2414 as the only thing we take the address of. If VAR is a structure,
2415 taking the address of a field means that the whole structure may
2416 be referenced using pointer arithmetic. See PR 21407 and the
2417 ensuing mailing list discussion. */
2418 var = get_base_address (ref);
2419 if (var && SSA_VAR_P (var))
2421 if (*addresses_taken == NULL)
2422 *addresses_taken = BITMAP_GGC_ALLOC ();
2424 if (var_can_have_subvars (var)
2425 && (svars = get_subvars_for_var (var)))
2428 for (sv = svars; sv; sv = sv->next)
2430 bitmap_set_bit (*addresses_taken, DECL_UID (sv->var));
2431 TREE_ADDRESSABLE (sv->var) = 1;
2436 bitmap_set_bit (*addresses_taken, DECL_UID (var));
2437 TREE_ADDRESSABLE (var) = 1;
2443 /* Scan the immediate_use list for VAR making sure its linked properly.
2444 Return TRUE if there is a problem and emit an error message to F. */
2447 verify_imm_links (FILE *f, tree var)
2449 use_operand_p ptr, prev, list;
2452 gcc_assert (TREE_CODE (var) == SSA_NAME);
2454 list = &(SSA_NAME_IMM_USE_NODE (var));
2455 gcc_assert (list->use == NULL);
2457 if (list->prev == NULL)
2459 gcc_assert (list->next == NULL);
2465 for (ptr = list->next; ptr != list; )
2467 if (prev != ptr->prev)
2470 if (ptr->use == NULL)
2471 goto error; /* 2 roots, or SAFE guard node. */
2472 else if (*(ptr->use) != var)
2478 /* Avoid infinite loops. 50,000,000 uses probably indicates a
2480 if (count++ > 50000000)
2484 /* Verify list in the other direction. */
2486 for (ptr = list->prev; ptr != list; )
2488 if (prev != ptr->next)
2502 if (ptr->stmt && stmt_modified_p (ptr->stmt))
2504 fprintf (f, " STMT MODIFIED. - <%p> ", (void *)ptr->stmt);
2505 print_generic_stmt (f, ptr->stmt, TDF_SLIM);
2507 fprintf (f, " IMM ERROR : (use_p : tree - %p:%p)", (void *)ptr,
2509 print_generic_expr (f, USE_FROM_PTR (ptr), TDF_SLIM);
2515 /* Dump all the immediate uses to FILE. */
2518 dump_immediate_uses_for (FILE *file, tree var)
2520 imm_use_iterator iter;
2521 use_operand_p use_p;
2523 gcc_assert (var && TREE_CODE (var) == SSA_NAME);
2525 print_generic_expr (file, var, TDF_SLIM);
2526 fprintf (file, " : -->");
2527 if (has_zero_uses (var))
2528 fprintf (file, " no uses.\n");
2530 if (has_single_use (var))
2531 fprintf (file, " single use.\n");
2533 fprintf (file, "%d uses.\n", num_imm_uses (var));
2535 FOR_EACH_IMM_USE_FAST (use_p, iter, var)
2537 if (use_p->stmt == NULL && use_p->use == NULL)
2538 fprintf (file, "***end of stmt iterator marker***\n");
2540 if (!is_gimple_reg (USE_FROM_PTR (use_p)))
2541 print_generic_stmt (file, USE_STMT (use_p), TDF_VOPS);
2543 print_generic_stmt (file, USE_STMT (use_p), TDF_SLIM);
2545 fprintf(file, "\n");
2549 /* Dump all the immediate uses to FILE. */
2552 dump_immediate_uses (FILE *file)
2557 fprintf (file, "Immediate_uses: \n\n");
2558 for (x = 1; x < num_ssa_names; x++)
2563 dump_immediate_uses_for (file, var);
2568 /* Dump def-use edges on stderr. */
2571 debug_immediate_uses (void)
2573 dump_immediate_uses (stderr);
2577 /* Dump def-use edges on stderr. */
2580 debug_immediate_uses_for (tree var)
2582 dump_immediate_uses_for (stderr, var);