diff options
author | Mikael Morin <mikael@gcc.gnu.org> | 2011-11-03 23:41:28 +0000 |
---|---|---|
committer | Mikael Morin <mikael@gcc.gnu.org> | 2011-11-03 23:41:28 +0000 |
commit | 30ae600f1fb18945d44e94a70c8818dcd63dbe07 (patch) | |
tree | e9e9faf30eb67c9060fa27b78daeb2ce4e9bf739 /gcc/fortran/trans-array.c | |
parent | 9d75804367cd7c3aac109d33a98f3a038cbe8020 (diff) | |
download | gcc-30ae600f1fb18945d44e94a70c8818dcd63dbe07.zip gcc-30ae600f1fb18945d44e94a70c8818dcd63dbe07.tar.gz gcc-30ae600f1fb18945d44e94a70c8818dcd63dbe07.tar.bz2 |
trans-array.c (gfc_add_loop_ss_code): Skip non-nestedmost ss.
* trans-array.c (gfc_add_loop_ss_code): Skip non-nestedmost ss.
Call recursively gfc_add_loop_ss_code for all the nested loops.
(gfc_conv_ss_startstride): Only get the descriptor for the outermost
ss. Call recursively gfc_conv_ss_startstride for all the nested loops.
(set_loop_bounds): Call recursively for all the nested loops.
(set_delta): Ditto.
From-SVN: r180898
Diffstat (limited to 'gcc/fortran/trans-array.c')
-rw-r--r-- | gcc/fortran/trans-array.c | 33 |
1 files changed, 30 insertions, 3 deletions
diff --git a/gcc/fortran/trans-array.c b/gcc/fortran/trans-array.c index 0c1dc89..27356a1 100644 --- a/gcc/fortran/trans-array.c +++ b/gcc/fortran/trans-array.c @@ -2295,10 +2295,12 @@ static void gfc_add_loop_ss_code (gfc_loopinfo * loop, gfc_ss * ss, bool subscript, locus * where) { + gfc_loopinfo *nested_loop; gfc_se se; gfc_ss_info *ss_info; gfc_array_info *info; gfc_expr *expr; + bool skip_nested = false; int n; /* TODO: This can generate bad code if there are ordering dependencies, @@ -2309,6 +2311,10 @@ gfc_add_loop_ss_code (gfc_loopinfo * loop, gfc_ss * ss, bool subscript, { gcc_assert (ss); + /* Cross loop arrays are handled from within the most nested loop. */ + if (ss->nested_ss != NULL) + continue; + ss_info = ss->info; expr = ss_info->expr; info = &ss_info->data.array; @@ -2355,7 +2361,12 @@ gfc_add_loop_ss_code (gfc_loopinfo * loop, gfc_ss * ss, bool subscript, /* Add the expressions for scalar and vector subscripts. */ for (n = 0; n < GFC_MAX_DIMENSIONS; n++) if (info->subscript[n]) - gfc_add_loop_ss_code (loop, info->subscript[n], true, where); + { + gfc_add_loop_ss_code (loop, info->subscript[n], true, where); + /* The recursive call will have taken care of the nested loops. + No need to do it twice. */ + skip_nested = true; + } set_vector_loop_bounds (ss); break; @@ -2410,6 +2421,11 @@ gfc_add_loop_ss_code (gfc_loopinfo * loop, gfc_ss * ss, bool subscript, gcc_unreachable (); } } + + if (!skip_nested) + for (nested_loop = loop->nested; nested_loop; + nested_loop = nested_loop->next) + gfc_add_loop_ss_code (nested_loop, nested_loop->ss, subscript, where); } @@ -3495,8 +3511,10 @@ done: switch (ss_info->type) { case GFC_SS_SECTION: - /* Get the descriptor for the array. */ - gfc_conv_ss_descriptor (&loop->pre, ss, !loop->array_parameter); + /* Get the descriptor for the array. If it is a cross loops array, + we got the descriptor already in the outermost loop. */ + if (ss->parent == NULL) + gfc_conv_ss_descriptor (&loop->pre, ss, !loop->array_parameter); for (n = 0; n < ss->dimen; n++) gfc_conv_section_startstride (loop, ss, ss->dim[n]); @@ -3785,6 +3803,9 @@ done: tmp = gfc_finish_block (&block); gfc_add_expr_to_block (&loop->pre, tmp); } + + for (loop = loop->nested; loop; loop = loop->next) + gfc_conv_ss_startstride (loop); } /* Return true if both symbols could refer to the same data object. Does @@ -4246,6 +4267,9 @@ set_loop_bounds (gfc_loopinfo *loop) } } mpz_clear (i); + + for (loop = loop->nested; loop; loop = loop->next) + set_loop_bounds (loop); } @@ -4356,6 +4380,9 @@ set_delta (gfc_loopinfo *loop) } } } + + for (loop = loop->nested; loop; loop = loop->next) + set_delta (loop); } |