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;
base -= sstride[n] * extent[n];
mbase -= mstride[n] * extent[n];
n++;
- if (n == rank)
+ if (n >= rank)
{
/* Break out of the loop. */
base = NULL;