===================================================================
@@ -85,7 +85,7 @@ define(FINISH_FOREACH_FUNCTION,
frequently used path so probably not worth it. */
base -= sstride[n] * extent[n];
n++;
- if (n == rank)
+ if (n >= rank)
{
/* Break out of the loop. */
base = NULL;
@@ -203,7 +203,7 @@ define(FINISH_MASKED_FOREACH_FUNCTION,
base -= sstride[n] * extent[n];
mbase -= mstride[n] * extent[n];
n++;
- if (n == rank)
+ if (n >= rank)
{
/* Break out of the loop. */
base = NULL;
===================================================================
@@ -157,7 +157,7 @@ define(FINISH_ARRAY_FUNCTION,
base -= sstride[n] * extent[n];
dest -= dstride[n] * extent[n];
n++;
- if (n == rank)
+ if (n >= rank)
{
/* Break out of the look. */
continue_loop = 0;
@@ -333,7 +333,7 @@ define(FINISH_MASKED_ARRAY_FUNCTION,
mbase -= mstride[n] * extent[n];
dest -= dstride[n] * extent[n];
n++;
- if (n == rank)
+ if (n >= rank)
{
/* Break out of the look. */
base = NULL;
@@ -473,7 +473,7 @@ void
frequently used path so probably not worth it. */
dest -= dstride[n] * extent[n];
n++;
- if (n == rank)
+ if (n >= rank)
return;
else
{
===================================================================
@@ -184,7 +184,7 @@ define(FINISH_ARRAY_FUNCTION,
base -= sstride[n] * extent[n];
dest -= dstride[n] * extent[n];
n++;
- if (n == rank)
+ if (n >= rank)
{
/* Break out of the look. */
continue_loop = 0;