Commit f9be04cd by Richard Guenther Committed by Richard Biener

re PR tree-optimization/26420 (-ftree-vectorizer-verbose=1 prints unvectorized loops information)

2007-03-05  Richard Guenther  <rguenther@suse.de>
	Dorit Nuzman  <dorit@il.ibm.com>

	PR tree-optimization/26420
	* tree-vectorizer.c (vectorize_loops): Bail out early if there
	are no loops in the function.  Only print the number of
	vectorized loops if it is greater than zero or we are supposed
	to print information about unvectorized loops.

Co-Authored-By: Dorit Nuzman <dorit@il.ibm.com>

From-SVN: r122544
parent c1c5a431
2007-03-05 Richard Guenther <rguenther@suse.de>
Dorit Nuzman <dorit@il.ibm.com>
PR tree-optimization/26420
* tree-vectorizer.c (vectorize_loops): Bail out early if there
are no loops in the function. Only print the number of
vectorized loops if it is greater than zero or we are supposed
to print information about unvectorized loops.
2007-03-05 Revital Eres <eres@il.ibm.com>
* gcc.dg/var-expand1.c: New test.
......
......@@ -2196,6 +2196,12 @@ vectorize_loops (void)
loop_iterator li;
struct loop *loop;
vect_loops_num = number_of_loops ();
/* Bail out if there are no loops. */
if (vect_loops_num <= 1)
return 0;
/* Fix the verbosity level if not defined explicitly by the user. */
vect_set_dump_settings ();
......@@ -2208,7 +2214,6 @@ vectorize_loops (void)
/* If some loop was duplicated, it gets bigger number
than all previously defined loops. This fact allows us to run
only over initial loops skipping newly generated ones. */
vect_loops_num = number_of_loops ();
FOR_EACH_LOOP (li, loop, 0)
{
loop_vec_info loop_vinfo;
......@@ -2225,7 +2230,9 @@ vectorize_loops (void)
}
vect_loop_location = UNKNOWN_LOC;
if (vect_print_dump_info (REPORT_VECTORIZED_LOOPS))
if (vect_print_dump_info (REPORT_UNVECTORIZED_LOOPS)
|| (vect_print_dump_info (REPORT_VECTORIZED_LOOPS)
&& num_vectorized_loops > 0))
fprintf (vect_dump, "vectorized %u loops in function.\n",
num_vectorized_loops);
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment