This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
[patch] Add dump-tree-*-analysis
- From: Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>
- To: gcc-patches at gcc dot gnu dot org
- Date: Fri, 9 Dec 2005 15:07:05 +0100
- Subject: [patch] Add dump-tree-*-analysis
Hello,
detailed dumps of on-demand analyses tend to be interlaced with the
dumps of the passes that invoke them. This makes the dumps harder to
read, and the details from inside of scev/data dependence analysis
are rarely interesting (unless there is a bug in one of them). This
patch adds a new dump option (-analysis) that enables the dumps from
this type of low-level analyses, and disables these dumps by default.
Bootstrapped & regtested on i686.
Zdenek
* tree-data-ref.c (analyze_array, analyze_indirect_ref, init_data_ref,
analyze_offset_expr, address_analysis, object_analysis,
create_data_ref, finalize_ddr_dependent, analyze_ziv_subscript,
analyze_subscript_affine_affine, analyze_siv_subscript,
analyze_miv_subscript, analyze_overlapping_iterations,
subscript_dependence_tester, compute_affine_dependence,
analyze_all_data_dependences): Dump only with TDF_ANALYSIS.
* tree-scalar-evolution.c (set_scalar_evolution, get_scalar_evolution,
add_to_evolution, set_nb_iterations_in_loop, get_loop_exit_condition,
analyze_evolution_in_loop, analyze_initial_condition,
analyze_scalar_evolution, instantiate_parameters,
number_of_iterations_in_loop): Ditto.
* tree-dump.c (dump_options): Add TDF_ANALYSIS.
* tree-pass.h (enum tdf): New. Add TDF_ANALYSIS.
Index: tree-dump.c
===================================================================
--- tree-dump.c (revision 108242)
+++ tree-dump.c (working copy)
@@ -756,6 +756,7 @@
{"vops", TDF_VOPS},
{"lineno", TDF_LINENO},
{"uid", TDF_UID},
+ {"analysis", TDF_ANALYSIS},
{"stmtaddr", TDF_STMTADDR},
{"all", ~(TDF_RAW | TDF_SLIM | TDF_LINENO | TDF_TREE | TDF_RTL | TDF_IPA
| TDF_STMTADDR | TDF_GRAPH)},
Index: tree-pass.h
===================================================================
--- tree-pass.h (revision 108242)
+++ tree-pass.h (working copy)
@@ -50,24 +50,26 @@
/* Bit masks to control dumping. Not all values are applicable to
all dumps. Add new ones at the end. When you define new
values, extend the DUMP_OPTIONS array in tree-dump.c */
-#define TDF_ADDRESS (1 << 0) /* dump node addresses */
-#define TDF_SLIM (1 << 1) /* don't go wild following links */
-#define TDF_RAW (1 << 2) /* don't unparse the function */
-#define TDF_DETAILS (1 << 3) /* show more detailed info about
- each pass */
-#define TDF_STATS (1 << 4) /* dump various statistics about
- each pass */
-#define TDF_BLOCKS (1 << 5) /* display basic block boundaries */
-#define TDF_VOPS (1 << 6) /* display virtual operands */
-#define TDF_LINENO (1 << 7) /* display statement line numbers */
-#define TDF_UID (1 << 8) /* display decl UIDs */
+enum tdf
+{
+ TDF_ADDRESS = (1 << 0), /* dump node addresses */
+ TDF_SLIM = (1 << 1), /* don't go wild following links */
+ TDF_RAW = (1 << 2), /* don't unparse the function */
+ TDF_DETAILS = (1 << 3), /* show more detailed info about each pass */
+ TDF_STATS = (1 << 4), /* dump various statistics about each pass */
+ TDF_BLOCKS = (1 << 5), /* display basic block boundaries */
+ TDF_VOPS = (1 << 6), /* display virtual operands */
+ TDF_LINENO = (1 << 7), /* display statement line numbers */
+ TDF_UID = (1 << 8), /* display decl UIDs */
+ TDF_ANALYSIS = (1 << 9), /* dump details of on-demand analyses */
-#define TDF_TREE (1 << 9) /* is a tree dump */
-#define TDF_RTL (1 << 10) /* is a RTL dump */
-#define TDF_IPA (1 << 11) /* is an IPA dump */
-#define TDF_STMTADDR (1 << 12) /* Address of stmt. */
+ TDF_TREE = (1 << 10), /* is a tree dump */
+ TDF_RTL = (1 << 11), /* is a RTL dump */
+ TDF_IPA = (1 << 12), /* is an IPA dump */
+ TDF_STMTADDR = (1 << 13), /* Address of stmt. */
-#define TDF_GRAPH (1 << 13) /* a graph dump is being emitted */
+ TDF_GRAPH = (1 << 14) /* a graph dump is being emitted */
+};
extern char *get_dump_file_name (enum tree_dump_index);
extern int dump_enabled_p (enum tree_dump_index);
Index: tree-scalar-evolution.c
===================================================================
--- tree-scalar-evolution.c (revision 108242)
+++ tree-scalar-evolution.c (working copy)
@@ -586,7 +586,7 @@
if (dump_file)
{
- if (dump_flags & TDF_DETAILS)
+ if (dump_flags & TDF_ANALYSIS)
{
fprintf (dump_file, "(set_scalar_evolution \n");
fprintf (dump_file, " (scalar = ");
@@ -611,7 +611,7 @@
if (dump_file)
{
- if (dump_flags & TDF_DETAILS)
+ if (dump_flags & TDF_ANALYSIS)
{
fprintf (dump_file, "(get_scalar_evolution \n");
fprintf (dump_file, " (scalar = ");
@@ -638,7 +638,7 @@
break;
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, " (scalar_evolution = ");
print_generic_expr (dump_file, res, 0);
@@ -858,7 +858,7 @@
/* This should not happen. */
return chrec_dont_know;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(add_to_evolution \n");
fprintf (dump_file, " (loop_nb = %d)\n", loop_nb);
@@ -876,7 +876,7 @@
res = add_to_evolution_1 (loop_nb, chrec_before, to_add);
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, " (res = ");
print_generic_expr (dump_file, res, 0);
@@ -904,7 +904,7 @@
|| TREE_OVERFLOW (res)))
res = chrec_dont_know;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, " (set_nb_iterations_in_loop = ");
print_generic_expr (dump_file, res, 0);
@@ -965,7 +965,7 @@
edge exit_edge = loop->single_exit;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "(get_loop_exit_condition \n ");
if (exit_edge)
@@ -977,7 +977,7 @@
res = expr;
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
print_generic_expr (dump_file, res, 0);
fprintf (dump_file, ")\n");
@@ -1431,7 +1431,7 @@
struct loop *loop = loop_containing_stmt (loop_phi_node);
basic_block bb;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(analyze_evolution_in_loop \n");
fprintf (dump_file, " (loop_phi_node = ");
@@ -1475,7 +1475,7 @@
evolution_function = chrec_merge (evolution_function, ev_fn);
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, " (evolution_function = ");
print_generic_expr (dump_file, evolution_function, 0);
@@ -1499,7 +1499,7 @@
tree init_cond = chrec_not_analyzed_yet;
struct loop *loop = bb_for_stmt (loop_phi_node)->loop_father;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(analyze_initial_condition \n");
fprintf (dump_file, " (loop_phi_node = \n");
@@ -1536,7 +1536,7 @@
if (init_cond == chrec_not_analyzed_yet)
init_cond = chrec_dont_know;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, " (init_cond = ");
print_generic_expr (dump_file, init_cond, 0);
@@ -1809,7 +1809,7 @@
{
tree res;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(analyze_scalar_evolution \n");
fprintf (dump_file, " (loop_nb = %d)\n", loop->num);
@@ -1823,7 +1823,7 @@
if (TREE_CODE (var) == SSA_NAME && res == chrec_dont_know)
res = var;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, ")\n");
return res;
@@ -2189,7 +2189,7 @@
tree res;
htab_t cache = htab_create (10, hash_scev_info, eq_scev_info, del_scev_info);
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(instantiate_parameters \n");
fprintf (dump_file, " (loop_nb = %d)\n", loop->num);
@@ -2201,7 +2201,7 @@
res = instantiate_parameters_1 (loop, chrec, INSERT_SUPERLOOP_CHRECS, cache,
0);
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, " (res = ");
print_generic_expr (dump_file, res, 0);
@@ -2261,7 +2261,7 @@
return res;
res = chrec_dont_know;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "(number_of_iterations_in_loop\n");
exit = loop->single_exit;
Index: tree-data-ref.c
===================================================================
--- tree-data-ref.c (revision 108242)
+++ tree-data-ref.c (working copy)
@@ -874,7 +874,7 @@
struct data_reference *res;
VEC(tree,heap) *acc_fns;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(analyze_array \n");
fprintf (dump_file, " (ref = ");
@@ -900,7 +900,7 @@
DR_MEMTAG (res) = NULL_TREE;
DR_PTR_INFO (res) = NULL;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, ")\n");
return res;
@@ -929,7 +929,7 @@
STRIP_NOPS (init);
if (access_fn == chrec_dont_know || !init || init == chrec_dont_know)
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nBad access function of ptr: ");
print_generic_expr (dump_file, ref, TDF_SLIM);
@@ -938,7 +938,7 @@
return NULL;
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nAccess function of ptr: ");
print_generic_expr (dump_file, access_fn, TDF_SLIM);
@@ -947,7 +947,7 @@
if (!expr_invariant_in_loop_p (loop, init))
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "\ninitial condition is not loop invariant.\n");
}
else
@@ -963,12 +963,12 @@
if (TREE_CODE (evolution) == INTEGER_CST)
step = fold_convert (ssizetype, evolution);
else
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "\nnon constant step for ptr access.\n");
}
}
else
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "\nunknown evolution of ptr.\n");
}
return init_data_ref (stmt, ref, NULL_TREE, access_fn, is_read, base_address,
@@ -996,7 +996,7 @@
struct data_reference *res;
VEC(tree,heap) *acc_fns;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(init_data_ref \n");
fprintf (dump_file, " (ref = ");
@@ -1022,7 +1022,7 @@
DR_MEMTAG (res) = memtag;
DR_PTR_INFO (res) = ptr_info;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, ")\n");
return res;
@@ -1166,7 +1166,7 @@
if (!BINARY_CLASS_P (expr))
{
/* We expect to get binary expressions (PLUS/MINUS and MULT). */
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nNot binary expression ");
print_generic_expr (dump_file, expr, TDF_SLIM);
@@ -1330,7 +1330,7 @@
address. */
if ((base_addr0 && base_addr1) || (!base_addr0 && !base_addr1))
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file,
"\neither more than one address or no addresses in expr ");
@@ -1376,7 +1376,7 @@
case SSA_NAME:
if (!POINTER_TYPE_P (TREE_TYPE (expr)))
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nnot pointer SSA_NAME ");
print_generic_expr (dump_file, expr, TDF_SLIM);
@@ -1488,7 +1488,7 @@
else
{
/* FORNOW. */
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\ndata-ref of unsupported type ");
print_generic_expr (dump_file, memref, TDF_SLIM);
@@ -1504,7 +1504,7 @@
&pmode, &punsignedp, &pvolatilep, false);
if (!base)
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nfailed to get inner ref for ");
print_generic_expr (dump_file, memref, TDF_SLIM);
@@ -1519,7 +1519,7 @@
&object_misalign, &object_aligned_to,
&object_step))
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nfailed to compute offset or step for ");
print_generic_expr (dump_file, memref, TDF_SLIM);
@@ -1534,7 +1534,7 @@
/* Check that there is no remainder in bits. */
if (pbitpos%BITS_PER_UNIT)
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "\nbit offset alignment.\n");
return NULL_TREE;
}
@@ -1553,7 +1553,7 @@
/* We expect to get a decl only if we already have a DR. */
if (!(*dr))
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nunhandled decl ");
print_generic_expr (dump_file, memref, TDF_SLIM);
@@ -1591,7 +1591,7 @@
ptr_dr = analyze_indirect_ref (stmt, memref, is_read);
if (!ptr_dr)
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nfailed to create dr for ");
print_generic_expr (dump_file, memref, TDF_SLIM);
@@ -1606,7 +1606,7 @@
if (!ptr_init || !ptr_step || !POINTER_TYPE_P (TREE_TYPE (ptr_init)))
{
*dr = (*dr) ? *dr : ptr_dr;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nbad pointer access ");
print_generic_expr (dump_file, memref, TDF_SLIM);
@@ -1617,7 +1617,7 @@
if (integer_zerop (ptr_step) && !(*dr))
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "\nptr is loop invariant.\n");
*dr = ptr_dr;
return NULL_TREE;
@@ -1639,7 +1639,7 @@
&address_aligned_to, &address_step);
if (!base_address)
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nfailed to analyze address ");
print_generic_expr (dump_file, ptr_init, TDF_SLIM);
@@ -1661,7 +1661,7 @@
*memtag = TREE_OPERAND (base_address, 0);
break;
default:
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\nno memtag for ");
print_generic_expr (dump_file, memref, TDF_SLIM);
@@ -1675,7 +1675,7 @@
if (!base_address)
{
/* MEMREF cannot be analyzed. */
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\ndata-ref of unsupported type ");
print_generic_expr (dump_file, memref, TDF_SLIM);
@@ -1791,7 +1791,7 @@
&ptr_info, &subvars);
if (!dr || !base_address)
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "\ncreate_data_ref: failed to create a dr for ");
print_generic_expr (dump_file, memref, TDF_SLIM);
@@ -1854,7 +1854,7 @@
VEC_replace (tree, DR_ACCESS_FNS (dr), 0, access_fn);
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
struct ptr_info_def *pi = DR_PTR_INFO (dr);
@@ -2038,7 +2038,7 @@
finalize_ddr_dependent (struct data_dependence_relation *ddr,
tree chrec)
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(dependence classified: ");
print_generic_expr (dump_file, chrec, 0);
@@ -2055,7 +2055,7 @@
static inline void
non_affine_dependence_relation (struct data_dependence_relation *ddr)
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "(Dependence relation cannot be represented by distance vector.) \n");
DDR_AFFINE_P (ddr) = false;
@@ -2129,7 +2129,7 @@
{
tree difference;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "(analyze_ziv_subscript \n");
difference = chrec_fold_minus (integer_type_node, chrec_a, chrec_b);
@@ -2163,7 +2163,7 @@
break;
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, ")\n");
}
@@ -2557,7 +2557,7 @@
*last_conflicts = chrec_dont_know;
return;
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "(analyze_subscript_affine_affine \n");
/* For determining the initial intersection, we have to solve a
@@ -2809,7 +2809,7 @@
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, " (overlaps_a = ");
print_generic_expr (dump_file, *overlaps_a, 0);
@@ -2818,7 +2818,7 @@
fprintf (dump_file, ")\n");
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, ")\n");
}
@@ -2836,7 +2836,7 @@
tree *overlaps_b,
tree *last_conflicts)
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "(analyze_siv_subscript \n");
if (evolution_function_is_constant_p (chrec_a)
@@ -2860,7 +2860,7 @@
*last_conflicts = chrec_dont_know;
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, ")\n");
}
@@ -2907,7 +2907,7 @@
*/
tree difference;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "(analyze_miv_subscript \n");
difference = chrec_fold_minus (integer_type_node, chrec_a, chrec_b);
@@ -2966,7 +2966,7 @@
*last_conflicts = chrec_dont_know;
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, ")\n");
}
@@ -2987,7 +2987,7 @@
tree *overlap_iterations_b,
tree *last_conflicts)
{
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(analyze_overlapping_iterations \n");
fprintf (dump_file, " (chrec_a = ");
@@ -3023,7 +3023,7 @@
overlap_iterations_a, overlap_iterations_b,
last_conflicts);
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, " (overlap_iterations_a = ");
print_generic_expr (dump_file, *overlap_iterations_a, 0);
@@ -3047,7 +3047,7 @@
struct data_reference *drb = DDR_B (ddr);
tree last_conflicts;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, "(subscript_dependence_tester \n");
for (i = 0; i < DDR_NUM_SUBSCRIPTS (ddr); i++)
@@ -3082,7 +3082,7 @@
}
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, ")\n");
}
@@ -3296,7 +3296,7 @@
classic_dist_done:;
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(build_classic_dist_vector\n");
@@ -3535,7 +3535,7 @@
struct data_reference *dra = DDR_A (ddr);
struct data_reference *drb = DDR_B (ddr);
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
{
fprintf (dump_file, "(compute_affine_dependence\n");
fprintf (dump_file, " (stmt_a = \n");
@@ -3559,7 +3559,7 @@
finalize_ddr_dependent (ddr, chrec_dont_know);
}
- if (dump_file && (dump_flags & TDF_DETAILS))
+ if (dump_file && (dump_flags & TDF_ANALYSIS))
fprintf (dump_file, ")\n");
}
@@ -3877,7 +3877,7 @@
dump_data_dependence_relations (dump_file, dependence_relations);
fprintf (dump_file, "\n\n");
- if (dump_flags & TDF_DETAILS)
+ if (dump_flags & TDF_ANALYSIS)
dump_dist_dir_vectors (dump_file, dependence_relations);
if (dump_flags & TDF_STATS)