1 /* Routines for performing Temporary Expression Replacement (TER) in SSA trees.
2 Copyright (C) 2003-2013 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"
27 #include "gimple-pretty-print.h"
30 #include "gimple-ssa.h"
31 #include "tree-phinodes.h"
32 #include "ssa-iterators.h"
33 #include "tree-ssanames.h"
35 #include "tree-ssa-live.h"
36 #include "tree-ssa-ter.h"
37 #include "tree-outof-ssa.h"
41 /* Temporary Expression Replacement (TER)
43 Replace SSA version variables during out-of-ssa with their defining
44 expression if there is only one use of the variable.
46 This pass is required in order for the RTL expansion pass to see larger
47 chunks of code. This allows it to make better choices on RTL pattern
48 selection. When expand is rewritten and merged with out-of-ssa, and
49 understands SSA, this should be eliminated.
51 A pass is made through the function, one block at a time. No cross block
52 information is tracked.
54 Variables which only have one use, and whose defining stmt is considered
55 a replaceable expression (see ssa_is_replaceable_p) are tracked to see whether
56 they can be replaced at their use location.
62 if there are the only use of n_12 and a_2, TER will substitute in their
63 expressions in v_9, and end up with:
65 v_9 = (b_5 + 6) * (C * 10)
67 which will then have the ssa_name assigned to regular variables, and the
68 resulting code which will be passed to the expander looks something like:
70 v = (b + 6) * (C * 10)
73 This requires ensuring that none of the variables used by the expression
74 change between the def point and where it is used. Furthermore, if any
75 of the ssa_names used in this expression are themselves replaceable, we
76 have to ensure none of that expressions' arguments change either.
77 Although SSA_NAMES themselves don't change, this pass is performed after
78 coalescing has coalesced different SSA_NAMES together, so there could be a
79 definition of an SSA_NAME which is coalesced with a use that causes a
82 PHI b_5 = <b_8(2), b_14(1)>
89 If b_5, b_8 and b_14 are all coalesced together...
90 The expression b_5 + 6 CANNOT replace the use in the statement defining v_9
91 because b_8 is in fact killing the value of b_5 since they share a partition
92 and will be assigned the same memory or register location.
94 TER implements this but stepping through the instructions in a block and
95 tracking potential expressions for replacement, and the partitions they are
96 dependent on. Expressions are represented by the SSA_NAME_VERSION of the
97 DEF on the LHS of a GIMPLE_ASSIGN and the expression is the RHS.
99 When a stmt is determined to be a possible replacement expression, the
100 following steps are taken:
102 EXPR_DECL_UID bitmap is allocated and set to the base variable UID of the
103 def and any uses in the expression. non-NULL means the expression is being
104 tracked. The UID's themselves are used to prevent TER substitution into
105 accumulating sequences, i.e.,
111 this can result in very large expressions which don't accomplish anything
112 see PR tree-optimization/17549.
114 PARTITION_DEPENDENCIES is another bitmap array, and it has a bit set for any
115 partition which is used in the expression. This is primarily used to remove
116 an expression from the partition kill lists when a decision is made whether
117 to replace it or not. This is indexed by ssa version number as well, and
118 indicates a partition number. virtual operands are not tracked individually,
119 but they are summarized by an artificial partition called VIRTUAL_PARTITION.
120 This means a MAY or MUST def will kill *ALL* expressions that are dependent
121 on a virtual operand.
122 Note that the EXPR_DECL_UID and this bitmap represent very similar
123 information, but the info in one is not easy to obtain from the other.
125 KILL_LIST is yet another bitmap array, this time it is indexed by partition
126 number, and represents a list of active expressions which will will no
127 longer be valid if a definition into this partition takes place.
129 PARTITION_IN_USE is simply a bitmap which is used to track which partitions
130 currently have something in their kill list. This is used at the end of
131 a block to clear out the KILL_LIST bitmaps at the end of each block.
133 NEW_REPLACEABLE_DEPENDENCIES is used as a temporary place to store
134 dependencies which will be reused by the current definition. All the uses
135 on an expression are processed before anything else is done. If a use is
136 determined to be a replaceable expression AND the current stmt is also going
137 to be replaceable, all the dependencies of this replaceable use will be
138 picked up by the current stmt's expression. Rather than recreate them, they
139 are simply copied here and then copied into the new expression when it is
145 a_2's expression 'b_5 + 6' is determined to be replaceable at the use
146 location. It is dependent on the partition 'b_5' is in. This is cached into
147 the NEW_REPLACEABLE_DEPENDENCIES bitmap, and when v_8 is examined for
148 replaceability, it is a candidate, and it is dependent on the partition
149 b_5 is in *NOT* a_2, as well as c_4's partition.
151 if v_8 is also replaceable:
155 x_9 is dependent on partitions b_5, and c_4
157 if a statement is found which has either of those partitions written to
158 before x_9 is used, then x_9 itself is NOT replaceable. */
161 /* Temporary Expression Replacement (TER) table information. */
163 typedef struct temp_expr_table_d
166 bitmap
*partition_dependencies
; /* Partitions expr is dependent on. */
167 bitmap replaceable_expressions
; /* Replacement expression table. */
168 bitmap
*expr_decl_uids
; /* Base uids of exprs. */
169 bitmap
*kill_list
; /* Expr's killed by a partition. */
170 int virtual_partition
; /* Pseudo partition for virtual ops. */
171 bitmap partition_in_use
; /* Partitions with kill entries. */
172 bitmap new_replaceable_dependencies
; /* Holding place for pending dep's. */
173 int *num_in_part
; /* # of ssa_names in a partition. */
174 int *call_cnt
; /* Call count at definition. */
175 } *temp_expr_table_p
;
177 /* Used to indicate a dependency on VDEFs. */
178 #define VIRTUAL_PARTITION(table) (table->virtual_partition)
180 /* A place for the many, many bitmaps we create. */
181 static bitmap_obstack ter_bitmap_obstack
;
183 #ifdef ENABLE_CHECKING
184 extern void debug_ter (FILE *, temp_expr_table_p
);
188 /* Create a new TER table for MAP. */
190 static temp_expr_table_p
191 new_temp_expr_table (var_map map
)
196 t
= XNEW (struct temp_expr_table_d
);
199 t
->partition_dependencies
= XCNEWVEC (bitmap
, num_ssa_names
+ 1);
200 t
->expr_decl_uids
= XCNEWVEC (bitmap
, num_ssa_names
+ 1);
201 t
->kill_list
= XCNEWVEC (bitmap
, num_var_partitions (map
) + 1);
203 t
->partition_in_use
= BITMAP_ALLOC (&ter_bitmap_obstack
);
205 t
->virtual_partition
= num_var_partitions (map
);
206 t
->new_replaceable_dependencies
= BITMAP_ALLOC (&ter_bitmap_obstack
);
208 t
->replaceable_expressions
= NULL
;
209 t
->num_in_part
= XCNEWVEC (int, num_var_partitions (map
));
210 for (x
= 1; x
< num_ssa_names
; x
++)
213 tree name
= ssa_name (x
);
216 p
= var_to_partition (map
, name
);
217 if (p
!= NO_PARTITION
)
220 t
->call_cnt
= XCNEWVEC (int, num_ssa_names
+ 1);
226 /* Free TER table T. If there are valid replacements, return the expression
230 free_temp_expr_table (temp_expr_table_p t
)
234 #ifdef ENABLE_CHECKING
236 for (x
= 0; x
<= num_var_partitions (t
->map
); x
++)
237 gcc_assert (!t
->kill_list
[x
]);
238 for (x
= 0; x
< num_ssa_names
; x
++)
240 gcc_assert (t
->expr_decl_uids
[x
] == NULL
);
241 gcc_assert (t
->partition_dependencies
[x
] == NULL
);
245 BITMAP_FREE (t
->partition_in_use
);
246 BITMAP_FREE (t
->new_replaceable_dependencies
);
248 free (t
->expr_decl_uids
);
250 free (t
->partition_dependencies
);
251 free (t
->num_in_part
);
254 if (t
->replaceable_expressions
)
255 ret
= t
->replaceable_expressions
;
262 /* Return TRUE if VERSION is to be replaced by an expression in TAB. */
265 version_to_be_replaced_p (temp_expr_table_p tab
, int version
)
267 if (!tab
->replaceable_expressions
)
269 return bitmap_bit_p (tab
->replaceable_expressions
, version
);
273 /* Add partition P to the list if partitions VERSION is dependent on. TAB is
274 the expression table */
277 make_dependent_on_partition (temp_expr_table_p tab
, int version
, int p
)
279 if (!tab
->partition_dependencies
[version
])
280 tab
->partition_dependencies
[version
] = BITMAP_ALLOC (&ter_bitmap_obstack
);
282 bitmap_set_bit (tab
->partition_dependencies
[version
], p
);
286 /* Add VER to the kill list for P. TAB is the expression table */
289 add_to_partition_kill_list (temp_expr_table_p tab
, int p
, int ver
)
291 if (!tab
->kill_list
[p
])
293 tab
->kill_list
[p
] = BITMAP_ALLOC (&ter_bitmap_obstack
);
294 bitmap_set_bit (tab
->partition_in_use
, p
);
296 bitmap_set_bit (tab
->kill_list
[p
], ver
);
300 /* Remove VER from the partition kill list for P. TAB is the expression
304 remove_from_partition_kill_list (temp_expr_table_p tab
, int p
, int version
)
306 gcc_checking_assert (tab
->kill_list
[p
]);
307 bitmap_clear_bit (tab
->kill_list
[p
], version
);
308 if (bitmap_empty_p (tab
->kill_list
[p
]))
310 bitmap_clear_bit (tab
->partition_in_use
, p
);
311 BITMAP_FREE (tab
->kill_list
[p
]);
316 /* Add a dependency between the def of ssa VERSION and VAR. If VAR is
317 replaceable by an expression, add a dependence each of the elements of the
318 expression. These are contained in the new_replaceable list. TAB is the
322 add_dependence (temp_expr_table_p tab
, int version
, tree var
)
328 i
= SSA_NAME_VERSION (var
);
329 if (version_to_be_replaced_p (tab
, i
))
331 if (!bitmap_empty_p (tab
->new_replaceable_dependencies
))
333 /* Version will now be killed by a write to any partition the
334 substituted expression would have been killed by. */
335 EXECUTE_IF_SET_IN_BITMAP (tab
->new_replaceable_dependencies
, 0, x
, bi
)
336 add_to_partition_kill_list (tab
, x
, version
);
338 /* Rather than set partition_dependencies and in_use lists bit by
339 bit, simply OR in the new_replaceable_dependencies bits. */
340 if (!tab
->partition_dependencies
[version
])
341 tab
->partition_dependencies
[version
] =
342 BITMAP_ALLOC (&ter_bitmap_obstack
);
343 bitmap_ior_into (tab
->partition_dependencies
[version
],
344 tab
->new_replaceable_dependencies
);
345 bitmap_ior_into (tab
->partition_in_use
,
346 tab
->new_replaceable_dependencies
);
347 /* It is only necessary to add these once. */
348 bitmap_clear (tab
->new_replaceable_dependencies
);
353 i
= var_to_partition (tab
->map
, var
);
354 gcc_checking_assert (i
!= NO_PARTITION
);
355 gcc_checking_assert (tab
->num_in_part
[i
] != 0);
356 /* Only dependencies on ssa_names which are coalesced with something need
357 to be tracked. Partitions with containing only a single SSA_NAME
358 *cannot* have their value changed. */
359 if (tab
->num_in_part
[i
] > 1)
361 add_to_partition_kill_list (tab
, i
, version
);
362 make_dependent_on_partition (tab
, version
, i
);
368 /* This function will remove the expression for VERSION from replacement
369 consideration in table TAB. If FREE_EXPR is true, then remove the
370 expression from consideration as well by freeing the decl uid bitmap. */
373 finished_with_expr (temp_expr_table_p tab
, int version
, bool free_expr
)
378 /* Remove this expression from its dependent lists. The partition dependence
379 list is retained and transferred later to whomever uses this version. */
380 if (tab
->partition_dependencies
[version
])
382 EXECUTE_IF_SET_IN_BITMAP (tab
->partition_dependencies
[version
], 0, i
, bi
)
383 remove_from_partition_kill_list (tab
, i
, version
);
384 BITMAP_FREE (tab
->partition_dependencies
[version
]);
387 BITMAP_FREE (tab
->expr_decl_uids
[version
]);
391 /* Return TRUE if expression STMT is suitable for replacement.
392 In addition to ssa_is_replaceable_p, require the same bb, and for -O0
393 same locus and same BLOCK), Considers memory loads as replaceable if aliasing
397 ter_is_replaceable_p (gimple stmt
)
400 if (ssa_is_replaceable_p (stmt
))
405 location_t locus1
, locus2
;
408 /* Only consider definitions which have a single use. ssa_is_replaceable_p
409 already performed this check, but the use stmt pointer is required for
411 def
= SINGLE_SSA_TREE_OPERAND (stmt
, SSA_OP_DEF
);
412 if (!single_imm_use (def
, &use_p
, &use_stmt
))
415 /* If the use isn't in this block, it wont be replaced either. */
416 if (gimple_bb (use_stmt
) != gimple_bb (stmt
))
419 locus1
= gimple_location (stmt
);
420 block1
= LOCATION_BLOCK (locus1
);
421 locus1
= LOCATION_LOCUS (locus1
);
423 if (gimple_code (use_stmt
) == GIMPLE_PHI
)
424 locus2
= gimple_phi_arg_location (use_stmt
,
425 PHI_ARG_INDEX_FROM_USE (use_p
));
427 locus2
= gimple_location (use_stmt
);
428 block2
= LOCATION_BLOCK (locus2
);
429 locus2
= LOCATION_LOCUS (locus2
);
431 if ((!optimize
|| optimize_debug
)
432 && ((locus1
!= UNKNOWN_LOCATION
&& locus1
!= locus2
)
433 || (block1
!= NULL_TREE
&& block1
!= block2
)))
436 /* Without alias info we can't move around loads. */
437 if (!optimize
&& gimple_assign_single_p (stmt
)
438 && !is_gimple_val (gimple_assign_rhs1 (stmt
)))
447 /* Create an expression entry for a replaceable expression. */
450 process_replaceable (temp_expr_table_p tab
, gimple stmt
, int call_cnt
)
452 tree var
, def
, basevar
;
455 bitmap def_vars
, use_vars
;
457 gcc_checking_assert (ter_is_replaceable_p (stmt
));
459 def
= SINGLE_SSA_TREE_OPERAND (stmt
, SSA_OP_DEF
);
460 version
= SSA_NAME_VERSION (def
);
461 def_vars
= BITMAP_ALLOC (&ter_bitmap_obstack
);
463 basevar
= SSA_NAME_VAR (def
);
465 bitmap_set_bit (def_vars
, DECL_UID (basevar
));
467 /* Add this expression to the dependency list for each use partition. */
468 FOR_EACH_SSA_TREE_OPERAND (var
, stmt
, iter
, SSA_OP_USE
)
470 int var_version
= SSA_NAME_VERSION (var
);
472 use_vars
= tab
->expr_decl_uids
[var_version
];
473 add_dependence (tab
, version
, var
);
476 bitmap_ior_into (def_vars
, use_vars
);
477 BITMAP_FREE (tab
->expr_decl_uids
[var_version
]);
479 else if (SSA_NAME_VAR (var
))
480 bitmap_set_bit (def_vars
, DECL_UID (SSA_NAME_VAR (var
)));
482 tab
->expr_decl_uids
[version
] = def_vars
;
484 /* If there are VUSES, add a dependence on virtual defs. */
485 if (gimple_vuse (stmt
))
487 make_dependent_on_partition (tab
, version
, VIRTUAL_PARTITION (tab
));
488 add_to_partition_kill_list (tab
, VIRTUAL_PARTITION (tab
), version
);
491 tab
->call_cnt
[version
] = call_cnt
;
495 /* This function removes any expression in TAB which is dependent on PARTITION
496 from consideration, making it not replaceable. */
499 kill_expr (temp_expr_table_p tab
, int partition
)
503 /* Mark every active expr dependent on this var as not replaceable.
504 finished_with_expr can modify the bitmap, so we can't execute over it. */
505 while (tab
->kill_list
[partition
])
507 version
= bitmap_first_set_bit (tab
->kill_list
[partition
]);
508 finished_with_expr (tab
, version
, true);
511 gcc_checking_assert (!tab
->kill_list
[partition
]);
515 /* This function kills all expressions in TAB which are dependent on virtual
519 kill_virtual_exprs (temp_expr_table_p tab
)
521 kill_expr (tab
, VIRTUAL_PARTITION (tab
));
525 /* Mark the expression associated with VAR as replaceable, and enter
526 the defining stmt into the partition_dependencies table TAB. If
527 MORE_REPLACING is true, accumulate the pending partition dependencies. */
530 mark_replaceable (temp_expr_table_p tab
, tree var
, bool more_replacing
)
532 int version
= SSA_NAME_VERSION (var
);
534 /* Move the dependence list to the pending listpending. */
535 if (more_replacing
&& tab
->partition_dependencies
[version
])
536 bitmap_ior_into (tab
->new_replaceable_dependencies
,
537 tab
->partition_dependencies
[version
]);
539 finished_with_expr (tab
, version
, !more_replacing
);
541 /* Set the replaceable expression.
542 The bitmap for this "escapes" from this file so it's allocated
543 on the default obstack. */
544 if (!tab
->replaceable_expressions
)
545 tab
->replaceable_expressions
= BITMAP_ALLOC (NULL
);
546 bitmap_set_bit (tab
->replaceable_expressions
, version
);
550 /* This function processes basic block BB, and looks for variables which can
551 be replaced by their expressions. Results are stored in the table TAB. */
554 find_replaceable_in_bb (temp_expr_table_p tab
, basic_block bb
)
556 gimple_stmt_iterator bsi
;
558 tree def
, use
, fndecl
;
560 var_map map
= tab
->map
;
562 bool stmt_replaceable
;
563 int cur_call_cnt
= 0;
565 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
567 stmt
= gsi_stmt (bsi
);
569 if (is_gimple_debug (stmt
))
572 stmt_replaceable
= ter_is_replaceable_p (stmt
);
574 /* Determine if this stmt finishes an existing expression. */
575 FOR_EACH_SSA_TREE_OPERAND (use
, stmt
, iter
, SSA_OP_USE
)
577 unsigned ver
= SSA_NAME_VERSION (use
);
579 /* If this use is a potential replacement variable, process it. */
580 if (tab
->expr_decl_uids
[ver
])
582 bool same_root_var
= false;
584 bitmap vars
= tab
->expr_decl_uids
[ver
];
586 /* See if the root variables are the same. If they are, we
587 do not want to do the replacement to avoid problems with
588 code size, see PR tree-optimization/17549. */
589 if (!bitmap_empty_p (vars
))
590 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, iter2
, SSA_OP_DEF
)
592 if (SSA_NAME_VAR (def
)
593 && bitmap_bit_p (vars
, DECL_UID (SSA_NAME_VAR (def
))))
595 same_root_var
= true;
600 /* If the stmt does a memory store and the replacement
601 is a load aliasing it avoid creating overlapping
602 assignments which we cannot expand correctly. */
603 if (gimple_vdef (stmt
)
604 && gimple_assign_single_p (stmt
))
606 gimple def_stmt
= SSA_NAME_DEF_STMT (use
);
607 while (is_gimple_assign (def_stmt
)
608 && gimple_assign_rhs_code (def_stmt
) == SSA_NAME
)
610 = SSA_NAME_DEF_STMT (gimple_assign_rhs1 (def_stmt
));
611 if (gimple_vuse (def_stmt
)
612 && gimple_assign_single_p (def_stmt
)
613 && refs_may_alias_p (gimple_assign_lhs (stmt
),
614 gimple_assign_rhs1 (def_stmt
)))
615 same_root_var
= true;
618 /* Mark expression as replaceable unless stmt is volatile, or the
619 def variable has the same root variable as something in the
620 substitution list, or the def and use span a call such that
621 we'll expand lifetimes across a call. */
622 if (gimple_has_volatile_ops (stmt
) || same_root_var
623 || (tab
->call_cnt
[ver
] != cur_call_cnt
624 && SINGLE_SSA_USE_OPERAND (SSA_NAME_DEF_STMT (use
), SSA_OP_USE
)
625 == NULL_USE_OPERAND_P
))
626 finished_with_expr (tab
, ver
, true);
628 mark_replaceable (tab
, use
, stmt_replaceable
);
632 /* Next, see if this stmt kills off an active expression. */
633 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, iter
, SSA_OP_DEF
)
635 partition
= var_to_partition (map
, def
);
636 if (partition
!= NO_PARTITION
&& tab
->kill_list
[partition
])
637 kill_expr (tab
, partition
);
640 /* Increment counter if this is a non BUILT_IN call. We allow
641 replacement over BUILT_IN calls since many will expand to inline
642 insns instead of a true call. */
643 if (is_gimple_call (stmt
)
644 && !((fndecl
= gimple_call_fndecl (stmt
))
645 && DECL_BUILT_IN (fndecl
)))
648 /* Now see if we are creating a new expression or not. */
649 if (stmt_replaceable
)
650 process_replaceable (tab
, stmt
, cur_call_cnt
);
652 /* Free any unused dependency lists. */
653 bitmap_clear (tab
->new_replaceable_dependencies
);
655 /* A V_{MAY,MUST}_DEF kills any expression using a virtual operand,
656 including the current stmt. */
657 if (gimple_vdef (stmt
))
658 kill_virtual_exprs (tab
);
663 /* This function is the driver routine for replacement of temporary expressions
664 in the SSA->normal phase, operating on MAP. If there are replaceable
665 expressions, a table is returned which maps SSA versions to the
666 expressions they should be replaced with. A NULL_TREE indicates no
667 replacement should take place. If there are no replacements at all,
668 NULL is returned by the function, otherwise an expression vector indexed
669 by SSA_NAME version numbers. */
672 find_replaceable_exprs (var_map map
)
675 temp_expr_table_p table
;
678 bitmap_obstack_initialize (&ter_bitmap_obstack
);
679 table
= new_temp_expr_table (map
);
682 find_replaceable_in_bb (table
, bb
);
683 gcc_checking_assert (bitmap_empty_p (table
->partition_in_use
));
685 ret
= free_temp_expr_table (table
);
686 bitmap_obstack_release (&ter_bitmap_obstack
);
690 /* Dump TER expression table EXPR to file F. */
693 dump_replaceable_exprs (FILE *f
, bitmap expr
)
698 fprintf (f
, "\nReplacing Expressions\n");
699 for (x
= 0; x
< num_ssa_names
; x
++)
700 if (bitmap_bit_p (expr
, x
))
703 print_generic_expr (f
, var
, TDF_SLIM
);
704 fprintf (f
, " replace with --> ");
705 print_gimple_stmt (f
, SSA_NAME_DEF_STMT (var
), 0, TDF_SLIM
);
712 #ifdef ENABLE_CHECKING
713 /* Dump the status of the various tables in the expression table. This is used
714 exclusively to debug TER. F is the place to send debug info and T is the
715 table being debugged. */
718 debug_ter (FILE *f
, temp_expr_table_p t
)
723 fprintf (f
, "\nDumping current state of TER\n virtual partition = %d\n",
724 VIRTUAL_PARTITION (t
));
725 if (t
->replaceable_expressions
)
726 dump_replaceable_exprs (f
, t
->replaceable_expressions
);
727 fprintf (f
, "Currently tracking the following expressions:\n");
729 for (x
= 1; x
< num_ssa_names
; x
++)
730 if (t
->expr_decl_uids
[x
])
732 print_generic_expr (f
, ssa_name (x
), TDF_SLIM
);
733 fprintf (f
, " dep-parts : ");
734 if (t
->partition_dependencies
[x
]
735 && !bitmap_empty_p (t
->partition_dependencies
[x
]))
737 EXECUTE_IF_SET_IN_BITMAP (t
->partition_dependencies
[x
], 0, y
, bi
)
738 fprintf (f
, "P%d ",y
);
740 fprintf (f
, " basedecls: ");
741 EXECUTE_IF_SET_IN_BITMAP (t
->expr_decl_uids
[x
], 0, y
, bi
)
742 fprintf (f
, "%d ",y
);
743 fprintf (f
, " call_cnt : %d",t
->call_cnt
[x
]);
747 bitmap_print (f
, t
->partition_in_use
, "Partitions in use ",
748 "\npartition KILL lists:\n");
750 for (x
= 0; x
<= num_var_partitions (t
->map
); x
++)
753 fprintf (f
, "Partition %d : ", x
);
754 EXECUTE_IF_SET_IN_BITMAP (t
->kill_list
[x
], 0, y
, bi
)
755 fprintf (f
, "_%d ",y
);
758 fprintf (f
, "\n----------\n");