re PR c++/19476 (Missed null checking elimination with new)
[official-gcc.git] / gcc / tree-ssa-ter.c
blob3659cf0c428fbd619519c59359f1996ec432b0c8
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)
10 any later version.
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/>. */
22 #include "config.h"
23 #include "system.h"
24 #include "coretypes.h"
25 #include "tm.h"
26 #include "tree.h"
27 #include "gimple-pretty-print.h"
28 #include "bitmap.h"
29 #include "tree-ssa.h"
30 #include "dumpfile.h"
31 #include "tree-outof-ssa.h"
32 #include "flags.h"
35 /* Temporary Expression Replacement (TER)
37 Replace SSA version variables during out-of-ssa with their defining
38 expression if there is only one use of the variable.
40 This pass is required in order for the RTL expansion pass to see larger
41 chunks of code. This allows it to make better choices on RTL pattern
42 selection. When expand is rewritten and merged with out-of-ssa, and
43 understands SSA, this should be eliminated.
45 A pass is made through the function, one block at a time. No cross block
46 information is tracked.
48 Variables which only have one use, and whose defining stmt is considered
49 a replaceable expression (see ssa_is_replaceable_p) are tracked to see whether
50 they can be replaced at their use location.
52 n_12 = C * 10
53 a_2 = b_5 + 6
54 v_9 = a_2 * n_12
56 if there are the only use of n_12 and a_2, TER will substitute in their
57 expressions in v_9, and end up with:
59 v_9 = (b_5 + 6) * (C * 10)
61 which will then have the ssa_name assigned to regular variables, and the
62 resulting code which will be passed to the expander looks something like:
64 v = (b + 6) * (C * 10)
67 This requires ensuring that none of the variables used by the expression
68 change between the def point and where it is used. Furthermore, if any
69 of the ssa_names used in this expression are themselves replaceable, we
70 have to ensure none of that expressions' arguments change either.
71 Although SSA_NAMES themselves don't change, this pass is performed after
72 coalescing has coalesced different SSA_NAMES together, so there could be a
73 definition of an SSA_NAME which is coalesced with a use that causes a
74 problem, i.e.,
76 PHI b_5 = <b_8(2), b_14(1)>
77 <...>
78 a_2 = b_5 + 6
79 b_8 = c_4 + 4
80 v_9 = a_2 * n_12
81 <...>
83 If b_5, b_8 and b_14 are all coalesced together...
84 The expression b_5 + 6 CANNOT replace the use in the statement defining v_9
85 because b_8 is in fact killing the value of b_5 since they share a partition
86 and will be assigned the same memory or register location.
88 TER implements this but stepping through the instructions in a block and
89 tracking potential expressions for replacement, and the partitions they are
90 dependent on. Expressions are represented by the SSA_NAME_VERSION of the
91 DEF on the LHS of a GIMPLE_ASSIGN and the expression is the RHS.
93 When a stmt is determined to be a possible replacement expression, the
94 following steps are taken:
96 EXPR_DECL_UID bitmap is allocated and set to the base variable UID of the
97 def and any uses in the expression. non-NULL means the expression is being
98 tracked. The UID's themselves are used to prevent TER substitution into
99 accumulating sequences, i.e.,
101 x = x + y
102 x = x + z
103 x = x + w
104 etc.
105 this can result in very large expressions which don't accomplish anything
106 see PR tree-optimization/17549.
108 PARTITION_DEPENDENCIES is another bitmap array, and it has a bit set for any
109 partition which is used in the expression. This is primarily used to remove
110 an expression from the partition kill lists when a decision is made whether
111 to replace it or not. This is indexed by ssa version number as well, and
112 indicates a partition number. virtual operands are not tracked individually,
113 but they are summarized by an artificial partition called VIRTUAL_PARTITION.
114 This means a MAY or MUST def will kill *ALL* expressions that are dependent
115 on a virtual operand.
116 Note that the EXPR_DECL_UID and this bitmap represent very similar
117 information, but the info in one is not easy to obtain from the other.
119 KILL_LIST is yet another bitmap array, this time it is indexed by partition
120 number, and represents a list of active expressions which will will no
121 longer be valid if a definition into this partition takes place.
123 PARTITION_IN_USE is simply a bitmap which is used to track which partitions
124 currently have something in their kill list. This is used at the end of
125 a block to clear out the KILL_LIST bitmaps at the end of each block.
127 NEW_REPLACEABLE_DEPENDENCIES is used as a temporary place to store
128 dependencies which will be reused by the current definition. All the uses
129 on an expression are processed before anything else is done. If a use is
130 determined to be a replaceable expression AND the current stmt is also going
131 to be replaceable, all the dependencies of this replaceable use will be
132 picked up by the current stmt's expression. Rather than recreate them, they
133 are simply copied here and then copied into the new expression when it is
134 processed.
136 a_2 = b_5 + 6
137 v_8 = a_2 + c_4
139 a_2's expression 'b_5 + 6' is determined to be replaceable at the use
140 location. It is dependent on the partition 'b_5' is in. This is cached into
141 the NEW_REPLACEABLE_DEPENDENCIES bitmap, and when v_8 is examined for
142 replaceability, it is a candidate, and it is dependent on the partition
143 b_5 is in *NOT* a_2, as well as c_4's partition.
145 if v_8 is also replaceable:
147 x_9 = v_8 * 5
149 x_9 is dependent on partitions b_5, and c_4
151 if a statement is found which has either of those partitions written to
152 before x_9 is used, then x_9 itself is NOT replaceable. */
155 /* Temporary Expression Replacement (TER) table information. */
157 typedef struct temp_expr_table_d
159 var_map map;
160 bitmap *partition_dependencies; /* Partitions expr is dependent on. */
161 bitmap replaceable_expressions; /* Replacement expression table. */
162 bitmap *expr_decl_uids; /* Base uids of exprs. */
163 bitmap *kill_list; /* Expr's killed by a partition. */
164 int virtual_partition; /* Pseudo partition for virtual ops. */
165 bitmap partition_in_use; /* Partitions with kill entries. */
166 bitmap new_replaceable_dependencies; /* Holding place for pending dep's. */
167 int *num_in_part; /* # of ssa_names in a partition. */
168 int *call_cnt; /* Call count at definition. */
169 } *temp_expr_table_p;
171 /* Used to indicate a dependency on VDEFs. */
172 #define VIRTUAL_PARTITION(table) (table->virtual_partition)
174 /* A place for the many, many bitmaps we create. */
175 static bitmap_obstack ter_bitmap_obstack;
177 #ifdef ENABLE_CHECKING
178 extern void debug_ter (FILE *, temp_expr_table_p);
179 #endif
182 /* Create a new TER table for MAP. */
184 static temp_expr_table_p
185 new_temp_expr_table (var_map map)
187 temp_expr_table_p t;
188 unsigned x;
190 t = XNEW (struct temp_expr_table_d);
191 t->map = map;
193 t->partition_dependencies = XCNEWVEC (bitmap, num_ssa_names + 1);
194 t->expr_decl_uids = XCNEWVEC (bitmap, num_ssa_names + 1);
195 t->kill_list = XCNEWVEC (bitmap, num_var_partitions (map) + 1);
197 t->partition_in_use = BITMAP_ALLOC (&ter_bitmap_obstack);
199 t->virtual_partition = num_var_partitions (map);
200 t->new_replaceable_dependencies = BITMAP_ALLOC (&ter_bitmap_obstack);
202 t->replaceable_expressions = NULL;
203 t->num_in_part = XCNEWVEC (int, num_var_partitions (map));
204 for (x = 1; x < num_ssa_names; x++)
206 int p;
207 tree name = ssa_name (x);
208 if (!name)
209 continue;
210 p = var_to_partition (map, name);
211 if (p != NO_PARTITION)
212 t->num_in_part[p]++;
214 t->call_cnt = XCNEWVEC (int, num_ssa_names + 1);
216 return t;
220 /* Free TER table T. If there are valid replacements, return the expression
221 vector. */
223 static bitmap
224 free_temp_expr_table (temp_expr_table_p t)
226 bitmap ret = NULL;
228 #ifdef ENABLE_CHECKING
229 unsigned x;
230 for (x = 0; x <= num_var_partitions (t->map); x++)
231 gcc_assert (!t->kill_list[x]);
232 for (x = 0; x < num_ssa_names; x++)
234 gcc_assert (t->expr_decl_uids[x] == NULL);
235 gcc_assert (t->partition_dependencies[x] == NULL);
237 #endif
239 BITMAP_FREE (t->partition_in_use);
240 BITMAP_FREE (t->new_replaceable_dependencies);
242 free (t->expr_decl_uids);
243 free (t->kill_list);
244 free (t->partition_dependencies);
245 free (t->num_in_part);
246 free (t->call_cnt);
248 if (t->replaceable_expressions)
249 ret = t->replaceable_expressions;
251 free (t);
252 return ret;
256 /* Return TRUE if VERSION is to be replaced by an expression in TAB. */
258 static inline bool
259 version_to_be_replaced_p (temp_expr_table_p tab, int version)
261 if (!tab->replaceable_expressions)
262 return false;
263 return bitmap_bit_p (tab->replaceable_expressions, version);
267 /* Add partition P to the list if partitions VERSION is dependent on. TAB is
268 the expression table */
270 static inline void
271 make_dependent_on_partition (temp_expr_table_p tab, int version, int p)
273 if (!tab->partition_dependencies[version])
274 tab->partition_dependencies[version] = BITMAP_ALLOC (&ter_bitmap_obstack);
276 bitmap_set_bit (tab->partition_dependencies[version], p);
280 /* Add VER to the kill list for P. TAB is the expression table */
282 static inline void
283 add_to_partition_kill_list (temp_expr_table_p tab, int p, int ver)
285 if (!tab->kill_list[p])
287 tab->kill_list[p] = BITMAP_ALLOC (&ter_bitmap_obstack);
288 bitmap_set_bit (tab->partition_in_use, p);
290 bitmap_set_bit (tab->kill_list[p], ver);
294 /* Remove VER from the partition kill list for P. TAB is the expression
295 table. */
297 static inline void
298 remove_from_partition_kill_list (temp_expr_table_p tab, int p, int version)
300 gcc_checking_assert (tab->kill_list[p]);
301 bitmap_clear_bit (tab->kill_list[p], version);
302 if (bitmap_empty_p (tab->kill_list[p]))
304 bitmap_clear_bit (tab->partition_in_use, p);
305 BITMAP_FREE (tab->kill_list[p]);
310 /* Add a dependency between the def of ssa VERSION and VAR. If VAR is
311 replaceable by an expression, add a dependence each of the elements of the
312 expression. These are contained in the new_replaceable list. TAB is the
313 expression table. */
315 static void
316 add_dependence (temp_expr_table_p tab, int version, tree var)
318 int i;
319 bitmap_iterator bi;
320 unsigned x;
322 i = SSA_NAME_VERSION (var);
323 if (version_to_be_replaced_p (tab, i))
325 if (!bitmap_empty_p (tab->new_replaceable_dependencies))
327 /* Version will now be killed by a write to any partition the
328 substituted expression would have been killed by. */
329 EXECUTE_IF_SET_IN_BITMAP (tab->new_replaceable_dependencies, 0, x, bi)
330 add_to_partition_kill_list (tab, x, version);
332 /* Rather than set partition_dependencies and in_use lists bit by
333 bit, simply OR in the new_replaceable_dependencies bits. */
334 if (!tab->partition_dependencies[version])
335 tab->partition_dependencies[version] =
336 BITMAP_ALLOC (&ter_bitmap_obstack);
337 bitmap_ior_into (tab->partition_dependencies[version],
338 tab->new_replaceable_dependencies);
339 bitmap_ior_into (tab->partition_in_use,
340 tab->new_replaceable_dependencies);
341 /* It is only necessary to add these once. */
342 bitmap_clear (tab->new_replaceable_dependencies);
345 else
347 i = var_to_partition (tab->map, var);
348 gcc_checking_assert (i != NO_PARTITION);
349 gcc_checking_assert (tab->num_in_part[i] != 0);
350 /* Only dependencies on ssa_names which are coalesced with something need
351 to be tracked. Partitions with containing only a single SSA_NAME
352 *cannot* have their value changed. */
353 if (tab->num_in_part[i] > 1)
355 add_to_partition_kill_list (tab, i, version);
356 make_dependent_on_partition (tab, version, i);
362 /* This function will remove the expression for VERSION from replacement
363 consideration in table TAB. If FREE_EXPR is true, then remove the
364 expression from consideration as well by freeing the decl uid bitmap. */
366 static void
367 finished_with_expr (temp_expr_table_p tab, int version, bool free_expr)
369 unsigned i;
370 bitmap_iterator bi;
372 /* Remove this expression from its dependent lists. The partition dependence
373 list is retained and transferred later to whomever uses this version. */
374 if (tab->partition_dependencies[version])
376 EXECUTE_IF_SET_IN_BITMAP (tab->partition_dependencies[version], 0, i, bi)
377 remove_from_partition_kill_list (tab, i, version);
378 BITMAP_FREE (tab->partition_dependencies[version]);
380 if (free_expr)
381 BITMAP_FREE (tab->expr_decl_uids[version]);
385 /* Return TRUE if expression STMT is suitable for replacement.
386 In addition to ssa_is_replaceable_p, require the same bb, and for -O0
387 same locus and same BLOCK), Considers memory loads as replaceable if aliasing
388 is available. */
390 static inline bool
391 ter_is_replaceable_p (gimple stmt)
394 if (ssa_is_replaceable_p (stmt))
396 use_operand_p use_p;
397 tree def;
398 gimple use_stmt;
399 location_t locus1, locus2;
400 tree block1, block2;
402 /* Only consider definitions which have a single use. ssa_is_replaceable_p
403 already performed this check, but the use stmt pointer is required for
404 further checks. */
405 def = SINGLE_SSA_TREE_OPERAND (stmt, SSA_OP_DEF);
406 if (!single_imm_use (def, &use_p, &use_stmt))
407 return false;
409 /* If the use isn't in this block, it wont be replaced either. */
410 if (gimple_bb (use_stmt) != gimple_bb (stmt))
411 return false;
413 locus1 = gimple_location (stmt);
414 block1 = LOCATION_BLOCK (locus1);
415 locus1 = LOCATION_LOCUS (locus1);
417 if (gimple_code (use_stmt) == GIMPLE_PHI)
418 locus2 = gimple_phi_arg_location (use_stmt,
419 PHI_ARG_INDEX_FROM_USE (use_p));
420 else
421 locus2 = gimple_location (use_stmt);
422 block2 = LOCATION_BLOCK (locus2);
423 locus2 = LOCATION_LOCUS (locus2);
425 if ((!optimize || optimize_debug)
426 && ((locus1 != UNKNOWN_LOCATION && locus1 != locus2)
427 || (block1 != NULL_TREE && block1 != block2)))
428 return false;
430 /* Without alias info we can't move around loads. */
431 if (!optimize && gimple_assign_single_p (stmt)
432 && !is_gimple_val (gimple_assign_rhs1 (stmt)))
433 return false;
435 return true;
437 return false;
441 /* Create an expression entry for a replaceable expression. */
443 static void
444 process_replaceable (temp_expr_table_p tab, gimple stmt, int call_cnt)
446 tree var, def, basevar;
447 int version;
448 ssa_op_iter iter;
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);
458 if (basevar)
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);
468 if (use_vars)
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;
489 /* This function removes any expression in TAB which is dependent on PARTITION
490 from consideration, making it not replaceable. */
492 static inline void
493 kill_expr (temp_expr_table_p tab, int partition)
495 unsigned version;
497 /* Mark every active expr dependent on this var as not replaceable.
498 finished_with_expr can modify the bitmap, so we can't execute over it. */
499 while (tab->kill_list[partition])
501 version = bitmap_first_set_bit (tab->kill_list[partition]);
502 finished_with_expr (tab, version, true);
505 gcc_checking_assert (!tab->kill_list[partition]);
509 /* This function kills all expressions in TAB which are dependent on virtual
510 partitions. */
512 static inline void
513 kill_virtual_exprs (temp_expr_table_p tab)
515 kill_expr (tab, VIRTUAL_PARTITION (tab));
519 /* Mark the expression associated with VAR as replaceable, and enter
520 the defining stmt into the partition_dependencies table TAB. If
521 MORE_REPLACING is true, accumulate the pending partition dependencies. */
523 static void
524 mark_replaceable (temp_expr_table_p tab, tree var, bool more_replacing)
526 int version = SSA_NAME_VERSION (var);
528 /* Move the dependence list to the pending listpending. */
529 if (more_replacing && tab->partition_dependencies[version])
530 bitmap_ior_into (tab->new_replaceable_dependencies,
531 tab->partition_dependencies[version]);
533 finished_with_expr (tab, version, !more_replacing);
535 /* Set the replaceable expression.
536 The bitmap for this "escapes" from this file so it's allocated
537 on the default obstack. */
538 if (!tab->replaceable_expressions)
539 tab->replaceable_expressions = BITMAP_ALLOC (NULL);
540 bitmap_set_bit (tab->replaceable_expressions, version);
544 /* This function processes basic block BB, and looks for variables which can
545 be replaced by their expressions. Results are stored in the table TAB. */
547 static void
548 find_replaceable_in_bb (temp_expr_table_p tab, basic_block bb)
550 gimple_stmt_iterator bsi;
551 gimple stmt;
552 tree def, use, fndecl;
553 int partition;
554 var_map map = tab->map;
555 ssa_op_iter iter;
556 bool stmt_replaceable;
557 int cur_call_cnt = 0;
559 for (bsi = gsi_start_bb (bb); !gsi_end_p (bsi); gsi_next (&bsi))
561 stmt = gsi_stmt (bsi);
563 if (is_gimple_debug (stmt))
564 continue;
566 stmt_replaceable = ter_is_replaceable_p (stmt);
568 /* Determine if this stmt finishes an existing expression. */
569 FOR_EACH_SSA_TREE_OPERAND (use, stmt, iter, SSA_OP_USE)
571 unsigned ver = SSA_NAME_VERSION (use);
573 /* If this use is a potential replacement variable, process it. */
574 if (tab->expr_decl_uids[ver])
576 bool same_root_var = false;
577 ssa_op_iter iter2;
578 bitmap vars = tab->expr_decl_uids[ver];
580 /* See if the root variables are the same. If they are, we
581 do not want to do the replacement to avoid problems with
582 code size, see PR tree-optimization/17549. */
583 if (!bitmap_empty_p (vars))
584 FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter2, SSA_OP_DEF)
586 if (SSA_NAME_VAR (def)
587 && bitmap_bit_p (vars, DECL_UID (SSA_NAME_VAR (def))))
589 same_root_var = true;
590 break;
594 /* If the stmt does a memory store and the replacement
595 is a load aliasing it avoid creating overlapping
596 assignments which we cannot expand correctly. */
597 if (gimple_vdef (stmt)
598 && gimple_assign_single_p (stmt))
600 gimple def_stmt = SSA_NAME_DEF_STMT (use);
601 while (is_gimple_assign (def_stmt)
602 && gimple_assign_rhs_code (def_stmt) == SSA_NAME)
603 def_stmt
604 = SSA_NAME_DEF_STMT (gimple_assign_rhs1 (def_stmt));
605 if (gimple_vuse (def_stmt)
606 && gimple_assign_single_p (def_stmt)
607 && refs_may_alias_p (gimple_assign_lhs (stmt),
608 gimple_assign_rhs1 (def_stmt)))
609 same_root_var = true;
612 /* Mark expression as replaceable unless stmt is volatile, or the
613 def variable has the same root variable as something in the
614 substitution list, or the def and use span a call such that
615 we'll expand lifetimes across a call. */
616 if (gimple_has_volatile_ops (stmt) || same_root_var
617 || (tab->call_cnt[ver] != cur_call_cnt
618 && SINGLE_SSA_USE_OPERAND (SSA_NAME_DEF_STMT (use), SSA_OP_USE)
619 == NULL_USE_OPERAND_P))
620 finished_with_expr (tab, ver, true);
621 else
622 mark_replaceable (tab, use, stmt_replaceable);
626 /* Next, see if this stmt kills off an active expression. */
627 FOR_EACH_SSA_TREE_OPERAND (def, stmt, iter, SSA_OP_DEF)
629 partition = var_to_partition (map, def);
630 if (partition != NO_PARTITION && tab->kill_list[partition])
631 kill_expr (tab, partition);
634 /* Increment counter if this is a non BUILT_IN call. We allow
635 replacement over BUILT_IN calls since many will expand to inline
636 insns instead of a true call. */
637 if (is_gimple_call (stmt)
638 && !((fndecl = gimple_call_fndecl (stmt))
639 && DECL_BUILT_IN (fndecl)))
640 cur_call_cnt++;
642 /* Now see if we are creating a new expression or not. */
643 if (stmt_replaceable)
644 process_replaceable (tab, stmt, cur_call_cnt);
646 /* Free any unused dependency lists. */
647 bitmap_clear (tab->new_replaceable_dependencies);
649 /* A V_{MAY,MUST}_DEF kills any expression using a virtual operand,
650 including the current stmt. */
651 if (gimple_vdef (stmt))
652 kill_virtual_exprs (tab);
657 /* This function is the driver routine for replacement of temporary expressions
658 in the SSA->normal phase, operating on MAP. If there are replaceable
659 expressions, a table is returned which maps SSA versions to the
660 expressions they should be replaced with. A NULL_TREE indicates no
661 replacement should take place. If there are no replacements at all,
662 NULL is returned by the function, otherwise an expression vector indexed
663 by SSA_NAME version numbers. */
665 bitmap
666 find_replaceable_exprs (var_map map)
668 basic_block bb;
669 temp_expr_table_p table;
670 bitmap ret;
672 bitmap_obstack_initialize (&ter_bitmap_obstack);
673 table = new_temp_expr_table (map);
674 FOR_EACH_BB (bb)
676 find_replaceable_in_bb (table, bb);
677 gcc_checking_assert (bitmap_empty_p (table->partition_in_use));
679 ret = free_temp_expr_table (table);
680 bitmap_obstack_release (&ter_bitmap_obstack);
681 return ret;
684 /* Dump TER expression table EXPR to file F. */
686 void
687 dump_replaceable_exprs (FILE *f, bitmap expr)
689 tree var;
690 unsigned x;
692 fprintf (f, "\nReplacing Expressions\n");
693 for (x = 0; x < num_ssa_names; x++)
694 if (bitmap_bit_p (expr, x))
696 var = ssa_name (x);
697 print_generic_expr (f, var, TDF_SLIM);
698 fprintf (f, " replace with --> ");
699 print_gimple_stmt (f, SSA_NAME_DEF_STMT (var), 0, TDF_SLIM);
700 fprintf (f, "\n");
702 fprintf (f, "\n");
706 #ifdef ENABLE_CHECKING
707 /* Dump the status of the various tables in the expression table. This is used
708 exclusively to debug TER. F is the place to send debug info and T is the
709 table being debugged. */
711 DEBUG_FUNCTION void
712 debug_ter (FILE *f, temp_expr_table_p t)
714 unsigned x, y;
715 bitmap_iterator bi;
717 fprintf (f, "\nDumping current state of TER\n virtual partition = %d\n",
718 VIRTUAL_PARTITION (t));
719 if (t->replaceable_expressions)
720 dump_replaceable_exprs (f, t->replaceable_expressions);
721 fprintf (f, "Currently tracking the following expressions:\n");
723 for (x = 1; x < num_ssa_names; x++)
724 if (t->expr_decl_uids[x])
726 print_generic_expr (f, ssa_name (x), TDF_SLIM);
727 fprintf (f, " dep-parts : ");
728 if (t->partition_dependencies[x]
729 && !bitmap_empty_p (t->partition_dependencies[x]))
731 EXECUTE_IF_SET_IN_BITMAP (t->partition_dependencies[x], 0, y, bi)
732 fprintf (f, "P%d ",y);
734 fprintf (f, " basedecls: ");
735 EXECUTE_IF_SET_IN_BITMAP (t->expr_decl_uids[x], 0, y, bi)
736 fprintf (f, "%d ",y);
737 fprintf (f, " call_cnt : %d",t->call_cnt[x]);
738 fprintf (f, "\n");
741 bitmap_print (f, t->partition_in_use, "Partitions in use ",
742 "\npartition KILL lists:\n");
744 for (x = 0; x <= num_var_partitions (t->map); x++)
745 if (t->kill_list[x])
747 fprintf (f, "Partition %d : ", x);
748 EXECUTE_IF_SET_IN_BITMAP (t->kill_list[x], 0, y, bi)
749 fprintf (f, "_%d ",y);
752 fprintf (f, "\n----------\n");
754 #endif