1 /* Routines for performing Temporary Expression Replacement (TER) in SSA trees.
2 Copyright (C) 2003-2016 Free Software Foundation, Inc.
3 Contributed by Andrew MacLeod <amacleod@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
29 #include "gimple-pretty-print.h"
30 #include "gimple-iterator.h"
32 #include "tree-ssa-live.h"
33 #include "tree-ssa-ter.h"
34 #include "tree-outof-ssa.h"
35 #include "gimple-walk.h"
38 /* Temporary Expression Replacement (TER)
40 Replace SSA version variables during out-of-ssa with their defining
41 expression if there is only one use of the variable.
43 This pass is required in order for the RTL expansion pass to see larger
44 chunks of code. This allows it to make better choices on RTL pattern
45 selection. When expand is rewritten and merged with out-of-ssa, and
46 understands SSA, this should be eliminated.
48 A pass is made through the function, one block at a time. No cross block
49 information is tracked.
51 Variables which only have one use, and whose defining stmt is considered
52 a replaceable expression (see ssa_is_replaceable_p) are tracked to see whether
53 they can be replaced at their use location.
59 if there are the only use of n_12 and a_2, TER will substitute in their
60 expressions in v_9, and end up with:
62 v_9 = (b_5 + 6) * (C * 10)
64 which will then have the ssa_name assigned to regular variables, and the
65 resulting code which will be passed to the expander looks something like:
67 v = (b + 6) * (C * 10)
70 This requires ensuring that none of the variables used by the expression
71 change between the def point and where it is used. Furthermore, if any
72 of the ssa_names used in this expression are themselves replaceable, we
73 have to ensure none of that expressions' arguments change either.
74 Although SSA_NAMES themselves don't change, this pass is performed after
75 coalescing has coalesced different SSA_NAMES together, so there could be a
76 definition of an SSA_NAME which is coalesced with a use that causes a
79 PHI b_5 = <b_8(2), b_14(1)>
86 If b_5, b_8 and b_14 are all coalesced together...
87 The expression b_5 + 6 CANNOT replace the use in the statement defining v_9
88 because b_8 is in fact killing the value of b_5 since they share a partition
89 and will be assigned the same memory or register location.
91 TER implements this but stepping through the instructions in a block and
92 tracking potential expressions for replacement, and the partitions they are
93 dependent on. Expressions are represented by the SSA_NAME_VERSION of the
94 DEF on the LHS of a GIMPLE_ASSIGN and the expression is the RHS.
96 When a stmt is determined to be a possible replacement expression, the
97 following steps are taken:
99 EXPR_DECL_UID bitmap is allocated and set to the base variable UID of the
100 def and any uses in the expression. non-NULL means the expression is being
101 tracked. The UID's themselves are used to prevent TER substitution into
102 accumulating sequences, i.e.,
108 this can result in very large expressions which don't accomplish anything
109 see PR tree-optimization/17549.
111 PARTITION_DEPENDENCIES is another bitmap array, and it has a bit set for any
112 partition which is used in the expression. This is primarily used to remove
113 an expression from the partition kill lists when a decision is made whether
114 to replace it or not. This is indexed by ssa version number as well, and
115 indicates a partition number. virtual operands are not tracked individually,
116 but they are summarized by an artificial partition called VIRTUAL_PARTITION.
117 This means a MAY or MUST def will kill *ALL* expressions that are dependent
118 on a virtual operand.
119 Note that the EXPR_DECL_UID and this bitmap represent very similar
120 information, but the info in one is not easy to obtain from the other.
122 KILL_LIST is yet another bitmap array, this time it is indexed by partition
123 number, and represents a list of active expressions which will no
124 longer be valid if a definition into this partition takes place.
126 PARTITION_IN_USE is simply a bitmap which is used to track which partitions
127 currently have something in their kill list. This is used at the end of
128 a block to clear out the KILL_LIST bitmaps at the end of each block.
130 NEW_REPLACEABLE_DEPENDENCIES is used as a temporary place to store
131 dependencies which will be reused by the current definition. All the uses
132 on an expression are processed before anything else is done. If a use is
133 determined to be a replaceable expression AND the current stmt is also going
134 to be replaceable, all the dependencies of this replaceable use will be
135 picked up by the current stmt's expression. Rather than recreate them, they
136 are simply copied here and then copied into the new expression when it is
142 a_2's expression 'b_5 + 6' is determined to be replaceable at the use
143 location. It is dependent on the partition 'b_5' is in. This is cached into
144 the NEW_REPLACEABLE_DEPENDENCIES bitmap, and when v_8 is examined for
145 replaceability, it is a candidate, and it is dependent on the partition
146 b_5 is in *NOT* a_2, as well as c_4's partition.
148 if v_8 is also replaceable:
152 x_9 is dependent on partitions b_5, and c_4
154 if a statement is found which has either of those partitions written to
155 before x_9 is used, then x_9 itself is NOT replaceable. */
158 /* Temporary Expression Replacement (TER) table information. */
160 struct temp_expr_table
163 bitmap *partition_dependencies; /* Partitions expr is dependent on. */
164 bitmap replaceable_expressions; /* Replacement expression table. */
165 bitmap *expr_decl_uids; /* Base uids of exprs. */
166 bitmap *kill_list; /* Expr's killed by a partition. */
167 int virtual_partition; /* Pseudo partition for virtual ops. */
168 bitmap partition_in_use; /* Partitions with kill entries. */
169 bitmap new_replaceable_dependencies; /* Holding place for pending dep's. */
170 int *num_in_part; /* # of ssa_names in a partition. */
171 int *call_cnt; /* Call count at definition. */
172 int *reg_vars_cnt; /* Number of register variable
173 definitions encountered. */
176 /* Used to indicate a dependency on VDEFs. */
177 #define VIRTUAL_PARTITION(table) (table->virtual_partition)
179 /* A place for the many, many bitmaps we create. */
180 static bitmap_obstack ter_bitmap_obstack;
182 extern void debug_ter (FILE *, temp_expr_table *);
185 /* Create a new TER table for MAP. */
187 static temp_expr_table *
188 new_temp_expr_table (var_map map)
192 temp_expr_table *t = XNEW (struct temp_expr_table);
195 t->partition_dependencies = XCNEWVEC (bitmap, num_ssa_names + 1);
196 t->expr_decl_uids = XCNEWVEC (bitmap, num_ssa_names + 1);
197 t->kill_list = XCNEWVEC (bitmap, num_var_partitions (map) + 1);
199 t->partition_in_use = BITMAP_ALLOC (&ter_bitmap_obstack);
201 t->virtual_partition = num_var_partitions (map);
202 t->new_replaceable_dependencies = BITMAP_ALLOC (&ter_bitmap_obstack);
204 t->replaceable_expressions = NULL;
205 t->num_in_part = XCNEWVEC (int, num_var_partitions (map));
206 for (x = 1; x < num_ssa_names; x++)
209 tree name = ssa_name (x);
212 p = var_to_partition (map, name);
213 if (p != NO_PARTITION)
216 t->call_cnt = XCNEWVEC (int, num_ssa_names + 1);
217 t->reg_vars_cnt = XCNEWVEC (int, num_ssa_names + 1);
223 /* Free TER table T. If there are valid replacements, return the expression
227 free_temp_expr_table (temp_expr_table *t)
233 for (unsigned x = 0; x <= num_var_partitions (t->map); x++)
234 gcc_assert (!t->kill_list[x]);
235 for (unsigned x = 0; x < num_ssa_names; x++)
237 gcc_assert (t->expr_decl_uids[x] == NULL);
238 gcc_assert (t->partition_dependencies[x] == NULL);
242 BITMAP_FREE (t->partition_in_use);
243 BITMAP_FREE (t->new_replaceable_dependencies);
245 free (t->expr_decl_uids);
247 free (t->partition_dependencies);
248 free (t->num_in_part);
250 free (t->reg_vars_cnt);
252 if (t->replaceable_expressions)
253 ret = t->replaceable_expressions;
260 /* Return TRUE if VERSION is to be replaced by an expression in TAB. */
263 version_to_be_replaced_p (temp_expr_table *tab, int version)
265 if (!tab->replaceable_expressions)
267 return bitmap_bit_p (tab->replaceable_expressions, version);
271 /* Add partition P to the list if partitions VERSION is dependent on. TAB is
272 the expression table */
275 make_dependent_on_partition (temp_expr_table *tab, int version, int p)
277 if (!tab->partition_dependencies[version])
278 tab->partition_dependencies[version] = BITMAP_ALLOC (&ter_bitmap_obstack);
280 bitmap_set_bit (tab->partition_dependencies[version], p);
284 /* Add VER to the kill list for P. TAB is the expression table */
287 add_to_partition_kill_list (temp_expr_table *tab, int p, int ver)
289 if (!tab->kill_list[p])
291 tab->kill_list[p] = BITMAP_ALLOC (&ter_bitmap_obstack);
292 bitmap_set_bit (tab->partition_in_use, p);
294 bitmap_set_bit (tab->kill_list[p], ver);
298 /* Remove VER from the partition kill list for P. TAB is the expression
302 remove_from_partition_kill_list (temp_expr_table *tab, int p, int version)
304 gcc_checking_assert (tab->kill_list[p]);
305 bitmap_clear_bit (tab->kill_list[p], version);
306 if (bitmap_empty_p (tab->kill_list[p]))
308 bitmap_clear_bit (tab->partition_in_use, p);
309 BITMAP_FREE (tab->kill_list[p]);
314 /* Add a dependency between the def of ssa VERSION and VAR. If VAR is
315 replaceable by an expression, add a dependence each of the elements of the
316 expression. These are contained in the new_replaceable list. TAB is the
320 add_dependence (temp_expr_table *tab, int version, tree var)
326 i = SSA_NAME_VERSION (var);
327 if (version_to_be_replaced_p (tab, i))
329 if (!bitmap_empty_p (tab->new_replaceable_dependencies))
331 /* Version will now be killed by a write to any partition the
332 substituted expression would have been killed by. */
333 EXECUTE_IF_SET_IN_BITMAP (tab->new_replaceable_dependencies, 0, x, bi)
334 add_to_partition_kill_list (tab, x, version);
336 /* Rather than set partition_dependencies and in_use lists bit by
337 bit, simply OR in the new_replaceable_dependencies bits. */
338 if (!tab->partition_dependencies[version])
339 tab->partition_dependencies[version] =
340 BITMAP_ALLOC (&ter_bitmap_obstack);
341 bitmap_ior_into (tab->partition_dependencies[version],
342 tab->new_replaceable_dependencies);
343 bitmap_ior_into (tab->partition_in_use,
344 tab->new_replaceable_dependencies);
345 /* It is only necessary to add these once. */
346 bitmap_clear (tab->new_replaceable_dependencies);
351 i = var_to_partition (tab->map, var);
352 gcc_checking_assert (i != NO_PARTITION);
353 gcc_checking_assert (tab->num_in_part[i] != 0);
354 /* Only dependencies on ssa_names which are coalesced with something need
355 to be tracked. Partitions with containing only a single SSA_NAME
356 *cannot* have their value changed. */
357 if (tab->num_in_part[i] > 1)
359 add_to_partition_kill_list (tab, i, version);
360 make_dependent_on_partition (tab, version, i);
366 /* This function will remove the expression for VERSION from replacement
367 consideration in table TAB. If FREE_EXPR is true, then remove the
368 expression from consideration as well by freeing the decl uid bitmap. */
371 finished_with_expr (temp_expr_table *tab, int version, bool free_expr)
376 /* Remove this expression from its dependent lists. The partition dependence
377 list is retained and transferred later to whomever uses this version. */
378 if (tab->partition_dependencies[version])
380 EXECUTE_IF_SET_IN_BITMAP (tab->partition_dependencies[version], 0, i, bi)
381 remove_from_partition_kill_list (tab, i, version);
382 BITMAP_FREE (tab->partition_dependencies[version]);
385 BITMAP_FREE (tab->expr_decl_uids[version]);
389 /* Return TRUE if expression STMT is suitable for replacement.
390 In addition to ssa_is_replaceable_p, require the same bb, and for -O0
391 same locus and same BLOCK), Considers memory loads as replaceable if aliasing
395 ter_is_replaceable_p (gimple *stmt)
398 if (ssa_is_replaceable_p (stmt))
403 location_t locus1, locus2;
406 /* Only consider definitions which have a single use. ssa_is_replaceable_p
407 already performed this check, but the use stmt pointer is required for
409 def = SINGLE_SSA_TREE_OPERAND (stmt, SSA_OP_DEF);
410 if (!single_imm_use (def, &use_p, &use_stmt))
413 /* If the use isn't in this block, it wont be replaced either. */
414 if (gimple_bb (use_stmt) != gimple_bb (stmt))
417 locus1 = gimple_location (stmt);
418 block1 = LOCATION_BLOCK (locus1);
419 locus1 = LOCATION_LOCUS (locus1);
421 if (gphi *phi = dyn_cast <gphi *> (use_stmt))
422 locus2 = gimple_phi_arg_location (phi,
423 PHI_ARG_INDEX_FROM_USE (use_p));
425 locus2 = gimple_location (use_stmt);
426 block2 = LOCATION_BLOCK (locus2);
427 locus2 = LOCATION_LOCUS (locus2);
429 if ((!optimize || optimize_debug)
430 && ((locus1 != UNKNOWN_LOCATION && locus1 != locus2)
431 || (block1 != NULL_TREE && block1 != block2)))
440 /* Create an expression entry for a replaceable expression. */
443 process_replaceable (temp_expr_table *tab, gimple *stmt, int call_cnt,
446 tree var, def, basevar;
449 bitmap def_vars, use_vars;
451 gcc_checking_assert (ter_is_replaceable_p (stmt));
453 def = SINGLE_SSA_TREE_OPERAND (stmt, SSA_OP_DEF);
454 version = SSA_NAME_VERSION (def);
455 def_vars = BITMAP_ALLOC (&ter_bitmap_obstack);
457 basevar = SSA_NAME_VAR (def);
459 bitmap_set_bit (def_vars, DECL_UID (basevar));
461 /* Add this expression to the dependency list for each use partition. */
462 FOR_EACH_SSA_TREE_OPERAND (var, stmt, iter, SSA_OP_USE)
464 int var_version = SSA_NAME_VERSION (var);
466 use_vars = tab->expr_decl_uids[var_version];
467 add_dependence (tab, version, var);
470 bitmap_ior_into (def_vars, use_vars);
471 BITMAP_FREE (tab->expr_decl_uids[var_version]);
473 else if (SSA_NAME_VAR (var))
474 bitmap_set_bit (def_vars, DECL_UID (SSA_NAME_VAR (var)));
476 tab->expr_decl_uids[version] = def_vars;
478 /* If there are VUSES, add a dependence on virtual defs. */
479 if (gimple_vuse (stmt))
481 make_dependent_on_partition (tab, version, VIRTUAL_PARTITION (tab));
482 add_to_partition_kill_list (tab, VIRTUAL_PARTITION (tab), version);
485 tab->call_cnt[version] = call_cnt;
486 tab->reg_vars_cnt[version] = reg_vars_cnt;
490 /* This function removes any expression in TAB which is dependent on PARTITION
491 from consideration, making it not replaceable. */
494 kill_expr (temp_expr_table *tab, int partition)
498 /* Mark every active expr dependent on this var as not replaceable.
499 finished_with_expr can modify the bitmap, so we can't execute over it. */
500 while (tab->kill_list[partition])
502 version = bitmap_first_set_bit (tab->kill_list[partition]);
503 finished_with_expr (tab, version, true);
506 gcc_checking_assert (!tab->kill_list[partition]);
510 /* This function kills all expressions in TAB which are dependent on virtual
514 kill_virtual_exprs (temp_expr_table *tab)
516 kill_expr (tab, VIRTUAL_PARTITION (tab));
520 /* Mark the expression associated with VAR as replaceable, and enter
521 the defining stmt into the partition_dependencies table TAB. If
522 MORE_REPLACING is true, accumulate the pending partition dependencies. */
525 mark_replaceable (temp_expr_table *tab, tree var, bool more_replacing)
527 int version = SSA_NAME_VERSION (var);
529 /* Move the dependence list to the pending listpending. */
530 if (more_replacing && tab->partition_dependencies[version])
531 bitmap_ior_into (tab->new_replaceable_dependencies,
532 tab->partition_dependencies[version]);
534 finished_with_expr (tab, version, !more_replacing);
536 /* Set the replaceable expression.
537 The bitmap for this "escapes" from this file so it's allocated
538 on the default obstack. */
539 if (!tab->replaceable_expressions)
540 tab->replaceable_expressions = BITMAP_ALLOC (NULL);
541 bitmap_set_bit (tab->replaceable_expressions, version);
545 /* Helper function for find_ssaname_in_stores. Called via walk_tree to
546 find a SSA_NAME DATA somewhere in *TP. */
549 find_ssaname (tree *tp, int *walk_subtrees, void *data)
551 tree var = (tree) data;
554 else if (IS_TYPE_OR_DECL_P (*tp))
559 /* Helper function for find_replaceable_in_bb. Return true if SSA_NAME DATA
560 is used somewhere in T, which is a store in the statement. Called via
561 walk_stmt_load_store_addr_ops. */
564 find_ssaname_in_store (gimple *, tree, tree t, void *data)
566 return walk_tree (&t, find_ssaname, data, NULL) != NULL_TREE;
569 /* This function processes basic block BB, and looks for variables which can
570 be replaced by their expressions. Results are stored in the table TAB. */
573 find_replaceable_in_bb (temp_expr_table *tab, basic_block bb)
575 gimple_stmt_iterator bsi;
577 tree def, use, fndecl;
579 var_map map = tab->map;
581 bool stmt_replaceable;
582 int cur_call_cnt = 0;
583 int cur_reg_vars_cnt = 0;
585 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
587 stmt = gsi_stmt (bsi);
589 if (is_gimple_debug (stmt))
592 stmt_replaceable = ter_is_replaceable_p (stmt);
594 /* Determine if this stmt finishes an existing expression. */
595 FOR_EACH_SSA_TREE_OPERAND (use, stmt, iter, SSA_OP_USE)
597 unsigned ver = SSA_NAME_VERSION (use);
599 /* If this use is a potential replacement variable, process it. */
600 if (tab->expr_decl_uids[ver])
602 bool same_root_var = false;
604 bitmap vars = tab->expr_decl_uids[ver];
606 /* See if the root variables are the same. If they are, we
607 do not want to do the replacement to avoid problems with
608 code size, see PR tree-optimization/17549. */
609 if (!bitmap_empty_p (vars))
610 FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter2, SSA_OP_DEF)
612 if (SSA_NAME_VAR (def)
613 && bitmap_bit_p (vars, DECL_UID (SSA_NAME_VAR (def))))
615 same_root_var = true;
620 /* If the stmt does a memory store and the replacement
621 is a load aliasing it avoid creating overlapping
622 assignments which we cannot expand correctly. */
623 if (gimple_vdef (stmt))
625 gimple *def_stmt = SSA_NAME_DEF_STMT (use);
626 while (is_gimple_assign (def_stmt)
627 && gimple_assign_rhs_code (def_stmt) == SSA_NAME)
629 = SSA_NAME_DEF_STMT (gimple_assign_rhs1 (def_stmt));
630 if (gimple_vuse (def_stmt)
631 && gimple_assign_single_p (def_stmt)
632 && stmt_may_clobber_ref_p (stmt,
633 gimple_assign_rhs1 (def_stmt)))
635 /* For calls, it is not a problem if USE is among
636 call's arguments or say OBJ_TYPE_REF argument,
637 all those necessarily need to be evaluated before
638 the call that may clobber the memory. But if
639 LHS of the call refers to USE, expansion might
640 evaluate it after the call, prevent TER in that
642 For inline asm, allow TER of loads into input
643 arguments, but disallow TER for USEs that occur
644 somewhere in outputs. */
645 if (is_gimple_call (stmt)
646 || gimple_code (stmt) == GIMPLE_ASM)
648 if (walk_stmt_load_store_ops (stmt, use, NULL,
649 find_ssaname_in_store))
650 same_root_var = true;
653 same_root_var = true;
657 /* Mark expression as replaceable unless stmt is volatile, or the
658 def variable has the same root variable as something in the
659 substitution list, or the def and use span a call such that
660 we'll expand lifetimes across a call. We also don't want to
661 replace across these expressions that may call libcalls that
662 clobber the register involved. See PR 70184. */
663 if (gimple_has_volatile_ops (stmt) || same_root_var
664 || (tab->call_cnt[ver] != cur_call_cnt
665 && SINGLE_SSA_USE_OPERAND (SSA_NAME_DEF_STMT (use), SSA_OP_USE)
666 == NULL_USE_OPERAND_P)
667 || tab->reg_vars_cnt[ver] != cur_reg_vars_cnt)
668 finished_with_expr (tab, ver, true);
670 mark_replaceable (tab, use, stmt_replaceable);
674 /* Next, see if this stmt kills off an active expression. */
675 FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter, SSA_OP_DEF)
677 partition = var_to_partition (map, def);
678 if (partition != NO_PARTITION && tab->kill_list[partition])
679 kill_expr (tab, partition);
682 /* Increment counter if this is a non BUILT_IN call. We allow
683 replacement over BUILT_IN calls since many will expand to inline
684 insns instead of a true call. */
685 if (is_gimple_call (stmt)
686 && !((fndecl = gimple_call_fndecl (stmt))
687 && DECL_BUILT_IN (fndecl)))
690 /* Increment counter if this statement sets a local
691 register variable. */
692 if (gimple_assign_single_p (stmt)
693 && (TREE_CODE (gimple_assign_lhs (stmt)) == VAR_DECL
694 && DECL_HARD_REGISTER (gimple_assign_lhs (stmt))))
697 /* Now see if we are creating a new expression or not. */
698 if (stmt_replaceable)
699 process_replaceable (tab, stmt, cur_call_cnt, cur_reg_vars_cnt);
701 /* Free any unused dependency lists. */
702 bitmap_clear (tab->new_replaceable_dependencies);
704 /* A V_{MAY,MUST}_DEF kills any expression using a virtual operand,
705 including the current stmt. */
706 if (gimple_vdef (stmt))
707 kill_virtual_exprs (tab);
712 /* This function is the driver routine for replacement of temporary expressions
713 in the SSA->normal phase, operating on MAP. If there are replaceable
714 expressions, a table is returned which maps SSA versions to the
715 expressions they should be replaced with. A NULL_TREE indicates no
716 replacement should take place. If there are no replacements at all,
717 NULL is returned by the function, otherwise an expression vector indexed
718 by SSA_NAME version numbers. */
721 find_replaceable_exprs (var_map map)
724 temp_expr_table *table;
727 bitmap_obstack_initialize (&ter_bitmap_obstack);
728 table = new_temp_expr_table (map);
729 FOR_EACH_BB_FN (bb, cfun)
731 find_replaceable_in_bb (table, bb);
732 gcc_checking_assert (bitmap_empty_p (table->partition_in_use));
734 ret = free_temp_expr_table (table);
735 bitmap_obstack_release (&ter_bitmap_obstack);
739 /* Dump TER expression table EXPR to file F. */
742 dump_replaceable_exprs (FILE *f, bitmap expr)
747 fprintf (f, "\nReplacing Expressions\n");
748 for (x = 0; x < num_ssa_names; x++)
749 if (bitmap_bit_p (expr, x))
752 print_generic_expr (f, var, TDF_SLIM);
753 fprintf (f, " replace with --> ");
754 print_gimple_stmt (f, SSA_NAME_DEF_STMT (var), 0, TDF_SLIM);
761 /* Dump the status of the various tables in the expression table. This is used
762 exclusively to debug TER. F is the place to send debug info and T is the
763 table being debugged. */
766 debug_ter (FILE *f, temp_expr_table *t)
771 fprintf (f, "\nDumping current state of TER\n virtual partition = %d\n",
772 VIRTUAL_PARTITION (t));
773 if (t->replaceable_expressions)
774 dump_replaceable_exprs (f, t->replaceable_expressions);
775 fprintf (f, "Currently tracking the following expressions:\n");
777 for (x = 1; x < num_ssa_names; x++)
778 if (t->expr_decl_uids[x])
780 print_generic_expr (f, ssa_name (x), TDF_SLIM);
781 fprintf (f, " dep-parts : ");
782 if (t->partition_dependencies[x]
783 && !bitmap_empty_p (t->partition_dependencies[x]))
785 EXECUTE_IF_SET_IN_BITMAP (t->partition_dependencies[x], 0, y, bi)
786 fprintf (f, "P%d ",y);
788 fprintf (f, " basedecls: ");
789 EXECUTE_IF_SET_IN_BITMAP (t->expr_decl_uids[x], 0, y, bi)
790 fprintf (f, "%d ",y);
791 fprintf (f, " call_cnt : %d",t->call_cnt[x]);
795 bitmap_print (f, t->partition_in_use, "Partitions in use ",
796 "\npartition KILL lists:\n");
798 for (x = 0; x <= num_var_partitions (t->map); x++)
801 fprintf (f, "Partition %d : ", x);
802 EXECUTE_IF_SET_IN_BITMAP (t->kill_list[x], 0, y, bi)
803 fprintf (f, "_%d ",y);
806 fprintf (f, "\n----------\n");