1 /* Routines for performing Temporary Expression Replacement (TER) in SSA trees.
2 Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
4 Contributed by Andrew MacLeod <amacleod@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
25 #include "coretypes.h"
28 #include "tree-pretty-print.h"
29 #include "gimple-pretty-print.h"
31 #include "tree-flow.h"
32 #include "tree-dump.h"
33 #include "tree-ssa-live.h"
37 /* Temporary Expression Replacement (TER)
39 Replace SSA version variables during out-of-ssa with their defining
40 expression if there is only one use of the variable.
42 This pass is required in order for the RTL expansion pass to see larger
43 chunks of code. This allows it to make better choices on RTL pattern
44 selection. When expand is rewritten and merged with out-of-ssa, and
45 understands SSA, this should be eliminated.
47 A pass is made through the function, one block at a time. No cross block
48 information is tracked.
50 Variables which only have one use, and whose defining stmt is considered
51 a replaceable expression (see is_replaceable_p) are tracked to see whether
52 they can be replaced at their use location.
58 if there are the only use of n_12 and a_2, TER will substitute in their
59 expressions in v_9, and end up with:
61 v_9 = (b_5 + 6) * (C * 10)
63 which will then have the ssa_name assigned to regular variables, and the
64 resulting code which will be passed to the expander looks something like:
66 v = (b + 6) * (C * 10)
69 This requires ensuring that none of the variables used by the expression
70 change between the def point and where it is used. Furthermore, if any
71 of the ssa_names used in this expression are themselves replaceable, we
72 have to ensure none of that expressions' arguments change either.
73 Although SSA_NAMES themselves don't change, this pass is performed after
74 coalescing has coalesced different SSA_NAMES together, so there could be a
75 definition of an SSA_NAME which is coalesced with a use that causes a
78 PHI b_5 = <b_8(2), b_14(1)>
85 If b_5, b_8 and b_14 are all coalesced together...
86 The expression b_5 + 6 CANNOT replace the use in the statement defining v_9
87 because b_8 is in fact killing the value of b_5 since they share a partition
88 and will be assigned the same memory or register location.
90 TER implements this but stepping through the instructions in a block and
91 tracking potential expressions for replacement, and the partitions they are
92 dependent on. Expressions are represented by the SSA_NAME_VERSION of the
93 DEF on the LHS of a GIMPLE_ASSIGN and the expression is the RHS.
95 When a stmt is determined to be a possible replacement expression, the
96 following steps are taken:
98 EXPR_DECL_UID bitmap is allocated and set to the base variable UID of the
99 def and any uses in the expression. non-NULL means the expression is being
100 tracked. The UID's themselves are used to prevent TER substitution into
101 accumulating sequences, i.e.,
107 this can result in very large expressions which don't accomplish anything
108 see PR tree-optimization/17549.
110 PARTITION_DEPENDENCIES is another bitmap array, and it has a bit set for any
111 partition which is used in the expression. This is primarily used to remove
112 an expression from the partition kill lists when a decision is made whether
113 to replace it or not. This is indexed by ssa version number as well, and
114 indicates a partition number. virtual operands are not tracked individually,
115 but they are summarized by an artificial partition called VIRTUAL_PARTITION.
116 This means a MAY or MUST def will kill *ALL* expressions that are dependent
117 on a virtual operand.
118 Note that the EXPR_DECL_UID and this bitmap represent very similar
119 information, but the info in one is not easy to obtain from the other.
121 KILL_LIST is yet another bitmap array, this time it is indexed by partition
122 number, and represents a list of active expressions which will will no
123 longer be valid if a definition into this partition takes place.
125 PARTITION_IN_USE is simply a bitmap which is used to track which partitions
126 currently have something in their kill list. This is used at the end of
127 a block to clear out the KILL_LIST bitmaps at the end of each block.
129 NEW_REPLACEABLE_DEPENDENCIES is used as a temporary place to store
130 dependencies which will be reused by the current definition. All the uses
131 on an expression are processed before anything else is done. If a use is
132 determined to be a replaceable expression AND the current stmt is also going
133 to be replaceable, all the dependencies of this replaceable use will be
134 picked up by the current stmt's expression. Rather than recreate them, they
135 are simply copied here and then copied into the new expression when it is
141 a_2's expression 'b_5 + 6' is determined to be replaceable at the use
142 location. It is dependent on the partition 'b_5' is in. This is cached into
143 the NEW_REPLACEABLE_DEPENDENCIES bitmap, and when v_8 is examined for
144 replaceability, it is a candidate, and it is dependent on the partition
145 b_5 is in *NOT* a_2, as well as c_4's partition.
147 if v_8 is also replaceable:
151 x_9 is dependent on partitions b_5, and c_4
153 if a statement is found which has either of those partitions written to
154 before x_9 is used, then x_9 itself is NOT replaceable. */
157 /* Temporary Expression Replacement (TER) table information. */
159 typedef struct temp_expr_table_d
162 bitmap
*partition_dependencies
; /* Partitions expr is dependent on. */
163 bitmap replaceable_expressions
; /* Replacement expression table. */
164 bitmap
*expr_decl_uids
; /* Base uids of exprs. */
165 bitmap
*kill_list
; /* Expr's killed by a partition. */
166 int virtual_partition
; /* Pseudo partition for virtual ops. */
167 bitmap partition_in_use
; /* Partitions with kill entries. */
168 bitmap new_replaceable_dependencies
; /* Holding place for pending dep's. */
169 int *num_in_part
; /* # of ssa_names in a partition. */
170 int *call_cnt
; /* Call count at definition. */
171 } *temp_expr_table_p
;
173 /* Used to indicate a dependency on VDEFs. */
174 #define VIRTUAL_PARTITION(table) (table->virtual_partition)
176 #ifdef ENABLE_CHECKING
177 extern void debug_ter (FILE *, temp_expr_table_p
);
181 /* Create a new TER table for MAP. */
183 static temp_expr_table_p
184 new_temp_expr_table (var_map map
)
189 t
= XNEW (struct temp_expr_table_d
);
192 t
->partition_dependencies
= XCNEWVEC (bitmap
, num_ssa_names
+ 1);
193 t
->expr_decl_uids
= XCNEWVEC (bitmap
, num_ssa_names
+ 1);
194 t
->kill_list
= XCNEWVEC (bitmap
, num_var_partitions (map
) + 1);
196 t
->partition_in_use
= BITMAP_ALLOC (NULL
);
198 t
->virtual_partition
= num_var_partitions (map
);
199 t
->new_replaceable_dependencies
= BITMAP_ALLOC (NULL
);
201 t
->replaceable_expressions
= NULL
;
202 t
->num_in_part
= XCNEWVEC (int, num_var_partitions (map
));
203 for (x
= 1; x
< num_ssa_names
; x
++)
206 tree name
= ssa_name (x
);
209 p
= var_to_partition (map
, name
);
210 if (p
!= NO_PARTITION
)
213 t
->call_cnt
= XCNEWVEC (int, num_ssa_names
+ 1);
219 /* Free TER table T. If there are valid replacements, return the expression
223 free_temp_expr_table (temp_expr_table_p t
)
227 #ifdef ENABLE_CHECKING
229 for (x
= 0; x
<= num_var_partitions (t
->map
); x
++)
230 gcc_assert (!t
->kill_list
[x
]);
231 for (x
= 0; x
< num_ssa_names
; x
++)
233 gcc_assert (t
->expr_decl_uids
[x
] == NULL
);
234 gcc_assert (t
->partition_dependencies
[x
] == NULL
);
238 BITMAP_FREE (t
->partition_in_use
);
239 BITMAP_FREE (t
->new_replaceable_dependencies
);
241 free (t
->expr_decl_uids
);
243 free (t
->partition_dependencies
);
244 free (t
->num_in_part
);
247 if (t
->replaceable_expressions
)
248 ret
= t
->replaceable_expressions
;
255 /* Return TRUE if VERSION is to be replaced by an expression in TAB. */
258 version_to_be_replaced_p (temp_expr_table_p tab
, int version
)
260 if (!tab
->replaceable_expressions
)
262 return bitmap_bit_p (tab
->replaceable_expressions
, version
);
266 /* Add partition P to the list if partitions VERSION is dependent on. TAB is
267 the expression table */
270 make_dependent_on_partition (temp_expr_table_p tab
, int version
, int p
)
272 if (!tab
->partition_dependencies
[version
])
273 tab
->partition_dependencies
[version
] = BITMAP_ALLOC (NULL
);
275 bitmap_set_bit (tab
->partition_dependencies
[version
], p
);
279 /* Add VER to the kill list for P. TAB is the expression table */
282 add_to_partition_kill_list (temp_expr_table_p tab
, int p
, int ver
)
284 if (!tab
->kill_list
[p
])
286 tab
->kill_list
[p
] = BITMAP_ALLOC (NULL
);
287 bitmap_set_bit (tab
->partition_in_use
, p
);
289 bitmap_set_bit (tab
->kill_list
[p
], ver
);
293 /* Remove VER from the partition kill list for P. TAB is the expression
297 remove_from_partition_kill_list (temp_expr_table_p tab
, int p
, int version
)
299 gcc_checking_assert (tab
->kill_list
[p
]);
300 bitmap_clear_bit (tab
->kill_list
[p
], version
);
301 if (bitmap_empty_p (tab
->kill_list
[p
]))
303 bitmap_clear_bit (tab
->partition_in_use
, p
);
304 BITMAP_FREE (tab
->kill_list
[p
]);
309 /* Add a dependency between the def of ssa VERSION and VAR. If VAR is
310 replaceable by an expression, add a dependence each of the elements of the
311 expression. These are contained in the new_replaceable list. TAB is the
315 add_dependence (temp_expr_table_p tab
, int version
, tree var
)
321 i
= SSA_NAME_VERSION (var
);
322 if (version_to_be_replaced_p (tab
, i
))
324 if (!bitmap_empty_p (tab
->new_replaceable_dependencies
))
326 /* Version will now be killed by a write to any partition the
327 substituted expression would have been killed by. */
328 EXECUTE_IF_SET_IN_BITMAP (tab
->new_replaceable_dependencies
, 0, x
, bi
)
329 add_to_partition_kill_list (tab
, x
, version
);
331 /* Rather than set partition_dependencies and in_use lists bit by
332 bit, simply OR in the new_replaceable_dependencies bits. */
333 if (!tab
->partition_dependencies
[version
])
334 tab
->partition_dependencies
[version
] = BITMAP_ALLOC (NULL
);
335 bitmap_ior_into (tab
->partition_dependencies
[version
],
336 tab
->new_replaceable_dependencies
);
337 bitmap_ior_into (tab
->partition_in_use
,
338 tab
->new_replaceable_dependencies
);
339 /* It is only necessary to add these once. */
340 bitmap_clear (tab
->new_replaceable_dependencies
);
345 i
= var_to_partition (tab
->map
, var
);
346 gcc_checking_assert (i
!= NO_PARTITION
);
347 gcc_checking_assert (tab
->num_in_part
[i
] != 0);
348 /* Only dependencies on ssa_names which are coalesced with something need
349 to be tracked. Partitions with containing only a single SSA_NAME
350 *cannot* have their value changed. */
351 if (tab
->num_in_part
[i
] > 1)
353 add_to_partition_kill_list (tab
, i
, version
);
354 make_dependent_on_partition (tab
, version
, i
);
360 /* Return TRUE if expression STMT is suitable for replacement. */
363 is_replaceable_p (gimple stmt
)
368 location_t locus1
, locus2
;
371 /* Only consider modify stmts. */
372 if (!is_gimple_assign (stmt
))
375 /* If the statement may throw an exception, it cannot be replaced. */
376 if (stmt_could_throw_p (stmt
))
379 /* Punt if there is more than 1 def. */
380 def
= SINGLE_SSA_TREE_OPERAND (stmt
, SSA_OP_DEF
);
384 /* Only consider definitions which have a single use. */
385 if (!single_imm_use (def
, &use_p
, &use_stmt
))
388 /* If the use isn't in this block, it wont be replaced either. */
389 if (gimple_bb (use_stmt
) != gimple_bb (stmt
))
392 locus1
= gimple_location (stmt
);
393 block1
= gimple_block (stmt
);
395 if (gimple_code (use_stmt
) == GIMPLE_PHI
)
402 locus2
= gimple_location (use_stmt
);
403 block2
= gimple_block (use_stmt
);
407 && ((locus1
&& locus1
!= locus2
) || (block1
&& block1
!= block2
)))
410 /* Used in this block, but at the TOP of the block, not the end. */
411 if (gimple_code (use_stmt
) == GIMPLE_PHI
)
414 /* There must be no VDEFs. */
415 if (gimple_vdef (stmt
))
418 /* Without alias info we can't move around loads. */
419 if (gimple_references_memory_p (stmt
) && !optimize
)
422 /* Float expressions must go through memory if float-store is on. */
424 && FLOAT_TYPE_P (gimple_expr_type (stmt
)))
427 /* An assignment with a register variable on the RHS is not
429 if (gimple_assign_rhs_code (stmt
) == VAR_DECL
430 && DECL_HARD_REGISTER (gimple_assign_rhs1 (stmt
)))
433 /* No function calls can be replaced. */
434 if (is_gimple_call (stmt
))
437 /* Leave any stmt with volatile operands alone as well. */
438 if (gimple_has_volatile_ops (stmt
))
445 /* This function will remove the expression for VERSION from replacement
446 consideration in table TAB. If FREE_EXPR is true, then remove the
447 expression from consideration as well by freeing the decl uid bitmap. */
450 finished_with_expr (temp_expr_table_p tab
, int version
, bool free_expr
)
455 /* Remove this expression from its dependent lists. The partition dependence
456 list is retained and transfered later to whomever uses this version. */
457 if (tab
->partition_dependencies
[version
])
459 EXECUTE_IF_SET_IN_BITMAP (tab
->partition_dependencies
[version
], 0, i
, bi
)
460 remove_from_partition_kill_list (tab
, i
, version
);
461 BITMAP_FREE (tab
->partition_dependencies
[version
]);
464 BITMAP_FREE (tab
->expr_decl_uids
[version
]);
468 /* Create an expression entry for a replaceable expression. */
471 process_replaceable (temp_expr_table_p tab
, gimple stmt
, int call_cnt
)
473 tree var
, def
, basevar
;
476 bitmap def_vars
, use_vars
;
478 gcc_checking_assert (is_replaceable_p (stmt
));
480 def
= SINGLE_SSA_TREE_OPERAND (stmt
, SSA_OP_DEF
);
481 version
= SSA_NAME_VERSION (def
);
482 basevar
= SSA_NAME_VAR (def
);
483 def_vars
= BITMAP_ALLOC (NULL
);
485 bitmap_set_bit (def_vars
, DECL_UID (basevar
));
487 /* Add this expression to the dependency list for each use partition. */
488 FOR_EACH_SSA_TREE_OPERAND (var
, stmt
, iter
, SSA_OP_USE
)
490 int var_version
= SSA_NAME_VERSION (var
);
492 use_vars
= tab
->expr_decl_uids
[var_version
];
493 add_dependence (tab
, version
, var
);
496 bitmap_ior_into (def_vars
, use_vars
);
497 BITMAP_FREE (tab
->expr_decl_uids
[var_version
]);
500 bitmap_set_bit (def_vars
, DECL_UID (SSA_NAME_VAR (var
)));
502 tab
->expr_decl_uids
[version
] = def_vars
;
504 /* If there are VUSES, add a dependence on virtual defs. */
505 if (gimple_vuse (stmt
))
507 make_dependent_on_partition (tab
, version
, VIRTUAL_PARTITION (tab
));
508 add_to_partition_kill_list (tab
, VIRTUAL_PARTITION (tab
), version
);
511 tab
->call_cnt
[version
] = call_cnt
;
515 /* This function removes any expression in TAB which is dependent on PARTITION
516 from consideration, making it not replaceable. */
519 kill_expr (temp_expr_table_p tab
, int partition
)
523 /* Mark every active expr dependent on this var as not replaceable.
524 finished_with_expr can modify the bitmap, so we can't execute over it. */
525 while (tab
->kill_list
[partition
])
527 version
= bitmap_first_set_bit (tab
->kill_list
[partition
]);
528 finished_with_expr (tab
, version
, true);
531 gcc_checking_assert (!tab
->kill_list
[partition
]);
535 /* This function kills all expressions in TAB which are dependent on virtual
539 kill_virtual_exprs (temp_expr_table_p tab
)
541 kill_expr (tab
, VIRTUAL_PARTITION (tab
));
545 /* Mark the expression associated with VAR as replaceable, and enter
546 the defining stmt into the partition_dependencies table TAB. If
547 MORE_REPLACING is true, accumulate the pending partition dependencies. */
550 mark_replaceable (temp_expr_table_p tab
, tree var
, bool more_replacing
)
552 int version
= SSA_NAME_VERSION (var
);
554 /* Move the dependence list to the pending listpending. */
555 if (more_replacing
&& tab
->partition_dependencies
[version
])
556 bitmap_ior_into (tab
->new_replaceable_dependencies
,
557 tab
->partition_dependencies
[version
]);
559 finished_with_expr (tab
, version
, !more_replacing
);
561 /* Set the replaceable expression. */
562 if (!tab
->replaceable_expressions
)
563 tab
->replaceable_expressions
= BITMAP_ALLOC (NULL
);
564 bitmap_set_bit (tab
->replaceable_expressions
, version
);
568 /* This function processes basic block BB, and looks for variables which can
569 be replaced by their expressions. Results are stored in the table TAB. */
572 find_replaceable_in_bb (temp_expr_table_p tab
, basic_block bb
)
574 gimple_stmt_iterator bsi
;
576 tree def
, use
, fndecl
;
578 var_map map
= tab
->map
;
580 bool stmt_replaceable
;
581 int cur_call_cnt
= 0;
583 for (bsi
= gsi_start_bb (bb
); !gsi_end_p (bsi
); gsi_next (&bsi
))
585 stmt
= gsi_stmt (bsi
);
587 if (is_gimple_debug (stmt
))
590 stmt_replaceable
= is_replaceable_p (stmt
);
592 /* Determine if this stmt finishes an existing expression. */
593 FOR_EACH_SSA_TREE_OPERAND (use
, stmt
, iter
, SSA_OP_USE
)
595 unsigned ver
= SSA_NAME_VERSION (use
);
597 /* If this use is a potential replacement variable, process it. */
598 if (tab
->expr_decl_uids
[ver
])
600 bool same_root_var
= false;
602 bitmap vars
= tab
->expr_decl_uids
[ver
];
604 /* See if the root variables are the same. If they are, we
605 do not want to do the replacement to avoid problems with
606 code size, see PR tree-optimization/17549. */
607 if (!bitmap_empty_p (vars
))
608 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, iter2
, SSA_OP_DEF
)
610 if (bitmap_bit_p (vars
, DECL_UID (SSA_NAME_VAR (def
))))
612 same_root_var
= true;
617 /* If the stmt does a memory store and the replacement
618 is a load aliasing it avoid creating overlapping
619 assignments which we cannot expand correctly. */
620 if (gimple_vdef (stmt
)
621 && gimple_assign_single_p (stmt
))
623 gimple def_stmt
= SSA_NAME_DEF_STMT (use
);
624 while (is_gimple_assign (def_stmt
)
625 && gimple_assign_rhs_code (def_stmt
) == SSA_NAME
)
627 = SSA_NAME_DEF_STMT (gimple_assign_rhs1 (def_stmt
));
628 if (gimple_vuse (def_stmt
)
629 && gimple_assign_single_p (def_stmt
)
630 && refs_may_alias_p (gimple_assign_lhs (stmt
),
631 gimple_assign_rhs1 (def_stmt
)))
632 same_root_var
= true;
635 /* Mark expression as replaceable unless stmt is volatile, or the
636 def variable has the same root variable as something in the
637 substitution list, or the def and use span a call such that
638 we'll expand lifetimes across a call. */
639 if (gimple_has_volatile_ops (stmt
) || same_root_var
640 || (tab
->call_cnt
[ver
] != cur_call_cnt
641 && SINGLE_SSA_USE_OPERAND (SSA_NAME_DEF_STMT (use
), SSA_OP_USE
)
642 == NULL_USE_OPERAND_P
))
643 finished_with_expr (tab
, ver
, true);
645 mark_replaceable (tab
, use
, stmt_replaceable
);
649 /* Next, see if this stmt kills off an active expression. */
650 FOR_EACH_SSA_TREE_OPERAND (def
, stmt
, iter
, SSA_OP_DEF
)
652 partition
= var_to_partition (map
, def
);
653 if (partition
!= NO_PARTITION
&& tab
->kill_list
[partition
])
654 kill_expr (tab
, partition
);
657 /* Increment counter if this is a non BUILT_IN call. We allow
658 replacement over BUILT_IN calls since many will expand to inline
659 insns instead of a true call. */
660 if (is_gimple_call (stmt
)
661 && !((fndecl
= gimple_call_fndecl (stmt
))
662 && DECL_BUILT_IN (fndecl
)))
665 /* Now see if we are creating a new expression or not. */
666 if (stmt_replaceable
)
667 process_replaceable (tab
, stmt
, cur_call_cnt
);
669 /* Free any unused dependency lists. */
670 bitmap_clear (tab
->new_replaceable_dependencies
);
672 /* A V_{MAY,MUST}_DEF kills any expression using a virtual operand,
673 including the current stmt. */
674 if (gimple_vdef (stmt
))
675 kill_virtual_exprs (tab
);
680 /* This function is the driver routine for replacement of temporary expressions
681 in the SSA->normal phase, operating on MAP. If there are replaceable
682 expressions, a table is returned which maps SSA versions to the
683 expressions they should be replaced with. A NULL_TREE indicates no
684 replacement should take place. If there are no replacements at all,
685 NULL is returned by the function, otherwise an expression vector indexed
686 by SSA_NAME version numbers. */
689 find_replaceable_exprs (var_map map
)
692 temp_expr_table_p table
;
695 table
= new_temp_expr_table (map
);
698 find_replaceable_in_bb (table
, bb
);
699 gcc_checking_assert (bitmap_empty_p (table
->partition_in_use
));
702 ret
= free_temp_expr_table (table
);
706 /* Dump TER expression table EXPR to file F. */
709 dump_replaceable_exprs (FILE *f
, bitmap expr
)
714 fprintf (f
, "\nReplacing Expressions\n");
715 for (x
= 0; x
< num_ssa_names
; x
++)
716 if (bitmap_bit_p (expr
, x
))
719 print_generic_expr (f
, var
, TDF_SLIM
);
720 fprintf (f
, " replace with --> ");
721 print_gimple_stmt (f
, SSA_NAME_DEF_STMT (var
), 0, TDF_SLIM
);
728 #ifdef ENABLE_CHECKING
729 /* Dump the status of the various tables in the expression table. This is used
730 exclusively to debug TER. F is the place to send debug info and T is the
731 table being debugged. */
734 debug_ter (FILE *f
, temp_expr_table_p t
)
739 fprintf (f
, "\nDumping current state of TER\n virtual partition = %d\n",
740 VIRTUAL_PARTITION (t
));
741 if (t
->replaceable_expressions
)
742 dump_replaceable_exprs (f
, t
->replaceable_expressions
);
743 fprintf (f
, "Currently tracking the following expressions:\n");
745 for (x
= 1; x
< num_ssa_names
; x
++)
746 if (t
->expr_decl_uids
[x
])
748 print_generic_expr (f
, ssa_name (x
), TDF_SLIM
);
749 fprintf (f
, " dep-parts : ");
750 if (t
->partition_dependencies
[x
]
751 && !bitmap_empty_p (t
->partition_dependencies
[x
]))
753 EXECUTE_IF_SET_IN_BITMAP (t
->partition_dependencies
[x
], 0, y
, bi
)
754 fprintf (f
, "P%d ",y
);
756 fprintf (f
, " basedecls: ");
757 EXECUTE_IF_SET_IN_BITMAP (t
->expr_decl_uids
[x
], 0, y
, bi
)
758 fprintf (f
, "%d ",y
);
759 fprintf (f
, " call_cnt : %d",t
->call_cnt
[x
]);
763 bitmap_print (f
, t
->partition_in_use
, "Partitions in use ",
764 "\npartition KILL lists:\n");
766 for (x
= 0; x
<= num_var_partitions (t
->map
); x
++)
769 fprintf (f
, "Partition %d : ", x
);
770 EXECUTE_IF_SET_IN_BITMAP (t
->kill_list
[x
], 0, y
, bi
)
771 fprintf (f
, "_%d ",y
);
774 fprintf (f
, "\n----------\n");