From a851ce04f7050dd82aa8344e7b68ee8319fb7b6f Mon Sep 17 00:00:00 2001 From: Richard Biener Date: Fri, 17 Nov 2017 13:15:34 +0000 Subject: re PR fortran/83017 (DO CONCURRENT not parallelizing) 2017-11-17 Richard Biener PR tree-optimization/83017 * tree-parloops.c (MIN_PER_THREAD): Use --param parloops-min-per-thread. (gen_parallel_loop): Properly count iterations. (parallelize_loops): Handle loop->can_be_parallel independent of flag_loop_parallelize_all. Make static profitability test match the runtime one. * params.def (PARAM_PARLOOPS_MIN_PER_THREAD): New. * invoke.texi (parloops-min-per-thread): Document. * gcc.dg/autopar/pr49960.c: Adjust. From-SVN: r254867 --- gcc/doc/invoke.texi | 6 ++++++ 1 file changed, 6 insertions(+) (limited to 'gcc/doc/invoke.texi') diff --git a/gcc/doc/invoke.texi b/gcc/doc/invoke.texi index 1e2b869..e18fa54 100644 --- a/gcc/doc/invoke.texi +++ b/gcc/doc/invoke.texi @@ -10816,6 +10816,12 @@ is 0. Schedule type of omp schedule for loops parallelized by parloops (static, dynamic, guided, auto, runtime). The default is static. +@item parloops-min-per-thread +The minimum number of iterations per thread of an innermost parallelized +loop for which the parallelized variant is prefered over the single threaded +one. The default is 100. Note that for a parallelized loop nest the +minimum number of iterations of the outermost loop per thread is two. + @item max-ssa-name-query-depth Maximum depth of recursion when querying properties of SSA names in things like fold routines. One level of recursion corresponds to following a -- cgit v1.1