mirror of
git://gcc.gnu.org/git/gcc.git
synced 2025-04-22 17:40:45 +08:00
re PR fortran/35995 (ANY, ALL, and COUNT errors for zero sized sections)
2008-05-04 Thomas Koenig <tkoenig@gcc.gnu.org> PR libfortran/35995 * m4/ifunction_logical.m4: If the extent of "array" is less than zero, set it to zero. Use an explicit flag for breaking out of the main loop to avoid, because the data pointer for "array" may be NULL for an empty array. * m4/ifunction.m4: Likewise. * generated/all_l1.c: Regenerated. * generated/all_l16.c: Regenerated. * generated/all_l2.c: Regenerated. * generated/all_l4.c: Regenerated. * generated/all_l8.c: Regenerated. * generated/any_l1.c: Regenerated. * generated/any_l16.c: Regenerated. * generated/any_l2.c: Regenerated. * generated/any_l4.c: Regenerated. * generated/any_l8.c: Regenerated. * generated/count_16_l.c: Regenerated. * generated/count_1_l.c: Regenerated. * generated/count_2_l.c: Regenerated. * generated/count_4_l.c: Regenerated. * generated/count_8_l.c: Regenerated. * generated/maxloc1_16_i1.c: Regenerated. * generated/maxloc1_16_i16.c: Regenerated. * generated/maxloc1_16_i2.c: Regenerated. * generated/maxloc1_16_i4.c: Regenerated. * generated/maxloc1_16_i8.c: Regenerated. * generated/maxloc1_16_r10.c: Regenerated. * generated/maxloc1_16_r16.c: Regenerated. * generated/maxloc1_16_r4.c: Regenerated. * generated/maxloc1_16_r8.c: Regenerated. * generated/maxloc1_4_i1.c: Regenerated. * generated/maxloc1_4_i16.c: Regenerated. * generated/maxloc1_4_i2.c: Regenerated. * generated/maxloc1_4_i4.c: Regenerated. * generated/maxloc1_4_i8.c: Regenerated. * generated/maxloc1_4_r10.c: Regenerated. * generated/maxloc1_4_r16.c: Regenerated. * generated/maxloc1_4_r4.c: Regenerated. * generated/maxloc1_4_r8.c: Regenerated. * generated/maxloc1_8_i1.c: Regenerated. * generated/maxloc1_8_i16.c: Regenerated. * generated/maxloc1_8_i2.c: Regenerated. * generated/maxloc1_8_i4.c: Regenerated. * generated/maxloc1_8_i8.c: Regenerated. * generated/maxloc1_8_r10.c: Regenerated. * generated/maxloc1_8_r16.c: Regenerated. * generated/maxloc1_8_r4.c: Regenerated. * generated/maxloc1_8_r8.c: Regenerated. * generated/maxval_i1.c: Regenerated. * generated/maxval_i16.c: Regenerated. * generated/maxval_i2.c: Regenerated. * generated/maxval_i4.c: Regenerated. * generated/maxval_i8.c: Regenerated. * generated/maxval_r10.c: Regenerated. * generated/maxval_r16.c: Regenerated. * generated/maxval_r4.c: Regenerated. * generated/maxval_r8.c: Regenerated. * generated/minloc1_16_i1.c: Regenerated. * generated/minloc1_16_i16.c: Regenerated. * generated/minloc1_16_i2.c: Regenerated. * generated/minloc1_16_i4.c: Regenerated. * generated/minloc1_16_i8.c: Regenerated. * generated/minloc1_16_r10.c: Regenerated. * generated/minloc1_16_r16.c: Regenerated. * generated/minloc1_16_r4.c: Regenerated. * generated/minloc1_16_r8.c: Regenerated. * generated/minloc1_4_i1.c: Regenerated. * generated/minloc1_4_i16.c: Regenerated. * generated/minloc1_4_i2.c: Regenerated. * generated/minloc1_4_i4.c: Regenerated. * generated/minloc1_4_i8.c: Regenerated. * generated/minloc1_4_r10.c: Regenerated. * generated/minloc1_4_r16.c: Regenerated. * generated/minloc1_4_r4.c: Regenerated. * generated/minloc1_4_r8.c: Regenerated. * generated/minloc1_8_i1.c: Regenerated. * generated/minloc1_8_i16.c: Regenerated. * generated/minloc1_8_i2.c: Regenerated. * generated/minloc1_8_i4.c: Regenerated. * generated/minloc1_8_i8.c: Regenerated. * generated/minloc1_8_r10.c: Regenerated. * generated/minloc1_8_r16.c: Regenerated. * generated/minloc1_8_r4.c: Regenerated. * generated/minloc1_8_r8.c: Regenerated. * generated/minval_i1.c: Regenerated. * generated/minval_i16.c: Regenerated. * generated/minval_i2.c: Regenerated. * generated/minval_i4.c: Regenerated. * generated/minval_i8.c: Regenerated. * generated/minval_r10.c: Regenerated. * generated/minval_r16.c: Regenerated. * generated/minval_r4.c: Regenerated. * generated/minval_r8.c: Regenerated. * generated/product_c10.c: Regenerated. * generated/product_c16.c: Regenerated. * generated/product_c4.c: Regenerated. * generated/product_c8.c: Regenerated. * generated/product_i1.c: Regenerated. * generated/product_i16.c: Regenerated. * generated/product_i2.c: Regenerated. * generated/product_i4.c: Regenerated. * generated/product_i8.c: Regenerated. * generated/product_r10.c: Regenerated. * generated/product_r16.c: Regenerated. * generated/product_r4.c: Regenerated. * generated/product_r8.c: Regenerated. * generated/sum_c10.c: Regenerated. * generated/sum_c16.c: Regenerated. * generated/sum_c4.c: Regenerated. * generated/sum_c8.c: Regenerated. * generated/sum_i1.c: Regenerated. * generated/sum_i16.c: Regenerated. * generated/sum_i2.c: Regenerated. * generated/sum_i4.c: Regenerated. * generated/sum_i8.c: Regenerated. * generated/sum_r10.c: Regenerated. * generated/sum_r16.c: Regenerated. * generated/sum_r4.c: Regenerated. * generated/sum_r8.c: Regenerated. 2008-05-04 Thomas Koenig <tkoenig@gcc.gnu.org> PR libfortran/35995 * gfortran.dg/intrinsic_ifunction_1.f90: New test case. From-SVN: r134934
This commit is contained in:
parent
62d2739afd
commit
da96f5ab49
@ -1,3 +1,8 @@
|
||||
2008-05-04 Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
PR libfortran/35995
|
||||
* gfortran.dg/intrinsic_ifunction_1.f90: New test case.
|
||||
|
||||
2008-05-04 Andy Hutchinson <hutchinsonandy@aim.com>
|
||||
|
||||
* gcc.dg/nested-func-5.c: Skip for target without trampolines.
|
||||
|
43
gcc/testsuite/gfortran.dg/intrinsic_ifunction_1.f90
Normal file
43
gcc/testsuite/gfortran.dg/intrinsic_ifunction_1.f90
Normal file
@ -0,0 +1,43 @@
|
||||
! { dg-do run }
|
||||
! PR 35995 - ifunction.m4 and ifunction_logical.m4 had a bug
|
||||
! where zero-sized arguments were not handled correctly.
|
||||
! Test case provided by Dick Hendrickson, amended by
|
||||
! Thomas Koenig.
|
||||
|
||||
program try_gf0026_etc
|
||||
|
||||
call gf0026( 0, 1)
|
||||
call foo ( 0, 1)
|
||||
|
||||
end program
|
||||
|
||||
SUBROUTINE GF0026(nf0,nf1)
|
||||
LOGICAL LDA(9)
|
||||
INTEGER IDA(NF0,9), iii(9)
|
||||
|
||||
lda = (/ (i/2*2 .eq. I, i=1,9) /)
|
||||
LDA = ALL ( IDA .NE. -1000, 1)
|
||||
if (.not. all(lda)) call abort
|
||||
if (.not. all(ida .ne. -1000)) call abort
|
||||
|
||||
lda = (/ (i/2*2 .eq. I, i=1,9) /)
|
||||
LDA = any ( IDA .NE. -1000, 1)
|
||||
print *, lda !expect FALSE
|
||||
if (any(lda)) call abort
|
||||
print *, any(ida .ne. -1000) !expect FALSE
|
||||
if (any(ida .ne. -1000)) call abort
|
||||
|
||||
iii = 137
|
||||
iii = count ( IDA .NE. -1000, 1)
|
||||
if (any(iii /= 0)) call abort
|
||||
if (count(ida .ne. -1000) /= 0) call abort
|
||||
|
||||
END SUBROUTINE
|
||||
|
||||
subroutine foo (nf0, nf1)
|
||||
integer, dimension(9):: res, iii
|
||||
integer, dimension(nf0,9) :: ida
|
||||
res = (/ (-i, i=1,9) /)
|
||||
res = product (ida, 1)
|
||||
if (any(res /= 1)) call abort
|
||||
end subroutine foo
|
@ -1,3 +1,126 @@
|
||||
2008-05-04 Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
PR libfortran/35995
|
||||
* m4/ifunction_logical.m4: If the extent of "array"
|
||||
is less than zero, set it to zero. Use an explicit
|
||||
flag for breaking out of the main loop to avoid, because
|
||||
the data pointer for "array" may be NULL for an empty
|
||||
array.
|
||||
* m4/ifunction.m4: Likewise.
|
||||
* generated/all_l1.c: Regenerated.
|
||||
* generated/all_l16.c: Regenerated.
|
||||
* generated/all_l2.c: Regenerated.
|
||||
* generated/all_l4.c: Regenerated.
|
||||
* generated/all_l8.c: Regenerated.
|
||||
* generated/any_l1.c: Regenerated.
|
||||
* generated/any_l16.c: Regenerated.
|
||||
* generated/any_l2.c: Regenerated.
|
||||
* generated/any_l4.c: Regenerated.
|
||||
* generated/any_l8.c: Regenerated.
|
||||
* generated/count_16_l.c: Regenerated.
|
||||
* generated/count_1_l.c: Regenerated.
|
||||
* generated/count_2_l.c: Regenerated.
|
||||
* generated/count_4_l.c: Regenerated.
|
||||
* generated/count_8_l.c: Regenerated.
|
||||
* generated/maxloc1_16_i1.c: Regenerated.
|
||||
* generated/maxloc1_16_i16.c: Regenerated.
|
||||
* generated/maxloc1_16_i2.c: Regenerated.
|
||||
* generated/maxloc1_16_i4.c: Regenerated.
|
||||
* generated/maxloc1_16_i8.c: Regenerated.
|
||||
* generated/maxloc1_16_r10.c: Regenerated.
|
||||
* generated/maxloc1_16_r16.c: Regenerated.
|
||||
* generated/maxloc1_16_r4.c: Regenerated.
|
||||
* generated/maxloc1_16_r8.c: Regenerated.
|
||||
* generated/maxloc1_4_i1.c: Regenerated.
|
||||
* generated/maxloc1_4_i16.c: Regenerated.
|
||||
* generated/maxloc1_4_i2.c: Regenerated.
|
||||
* generated/maxloc1_4_i4.c: Regenerated.
|
||||
* generated/maxloc1_4_i8.c: Regenerated.
|
||||
* generated/maxloc1_4_r10.c: Regenerated.
|
||||
* generated/maxloc1_4_r16.c: Regenerated.
|
||||
* generated/maxloc1_4_r4.c: Regenerated.
|
||||
* generated/maxloc1_4_r8.c: Regenerated.
|
||||
* generated/maxloc1_8_i1.c: Regenerated.
|
||||
* generated/maxloc1_8_i16.c: Regenerated.
|
||||
* generated/maxloc1_8_i2.c: Regenerated.
|
||||
* generated/maxloc1_8_i4.c: Regenerated.
|
||||
* generated/maxloc1_8_i8.c: Regenerated.
|
||||
* generated/maxloc1_8_r10.c: Regenerated.
|
||||
* generated/maxloc1_8_r16.c: Regenerated.
|
||||
* generated/maxloc1_8_r4.c: Regenerated.
|
||||
* generated/maxloc1_8_r8.c: Regenerated.
|
||||
* generated/maxval_i1.c: Regenerated.
|
||||
* generated/maxval_i16.c: Regenerated.
|
||||
* generated/maxval_i2.c: Regenerated.
|
||||
* generated/maxval_i4.c: Regenerated.
|
||||
* generated/maxval_i8.c: Regenerated.
|
||||
* generated/maxval_r10.c: Regenerated.
|
||||
* generated/maxval_r16.c: Regenerated.
|
||||
* generated/maxval_r4.c: Regenerated.
|
||||
* generated/maxval_r8.c: Regenerated.
|
||||
* generated/minloc1_16_i1.c: Regenerated.
|
||||
* generated/minloc1_16_i16.c: Regenerated.
|
||||
* generated/minloc1_16_i2.c: Regenerated.
|
||||
* generated/minloc1_16_i4.c: Regenerated.
|
||||
* generated/minloc1_16_i8.c: Regenerated.
|
||||
* generated/minloc1_16_r10.c: Regenerated.
|
||||
* generated/minloc1_16_r16.c: Regenerated.
|
||||
* generated/minloc1_16_r4.c: Regenerated.
|
||||
* generated/minloc1_16_r8.c: Regenerated.
|
||||
* generated/minloc1_4_i1.c: Regenerated.
|
||||
* generated/minloc1_4_i16.c: Regenerated.
|
||||
* generated/minloc1_4_i2.c: Regenerated.
|
||||
* generated/minloc1_4_i4.c: Regenerated.
|
||||
* generated/minloc1_4_i8.c: Regenerated.
|
||||
* generated/minloc1_4_r10.c: Regenerated.
|
||||
* generated/minloc1_4_r16.c: Regenerated.
|
||||
* generated/minloc1_4_r4.c: Regenerated.
|
||||
* generated/minloc1_4_r8.c: Regenerated.
|
||||
* generated/minloc1_8_i1.c: Regenerated.
|
||||
* generated/minloc1_8_i16.c: Regenerated.
|
||||
* generated/minloc1_8_i2.c: Regenerated.
|
||||
* generated/minloc1_8_i4.c: Regenerated.
|
||||
* generated/minloc1_8_i8.c: Regenerated.
|
||||
* generated/minloc1_8_r10.c: Regenerated.
|
||||
* generated/minloc1_8_r16.c: Regenerated.
|
||||
* generated/minloc1_8_r4.c: Regenerated.
|
||||
* generated/minloc1_8_r8.c: Regenerated.
|
||||
* generated/minval_i1.c: Regenerated.
|
||||
* generated/minval_i16.c: Regenerated.
|
||||
* generated/minval_i2.c: Regenerated.
|
||||
* generated/minval_i4.c: Regenerated.
|
||||
* generated/minval_i8.c: Regenerated.
|
||||
* generated/minval_r10.c: Regenerated.
|
||||
* generated/minval_r16.c: Regenerated.
|
||||
* generated/minval_r4.c: Regenerated.
|
||||
* generated/minval_r8.c: Regenerated.
|
||||
* generated/product_c10.c: Regenerated.
|
||||
* generated/product_c16.c: Regenerated.
|
||||
* generated/product_c4.c: Regenerated.
|
||||
* generated/product_c8.c: Regenerated.
|
||||
* generated/product_i1.c: Regenerated.
|
||||
* generated/product_i16.c: Regenerated.
|
||||
* generated/product_i2.c: Regenerated.
|
||||
* generated/product_i4.c: Regenerated.
|
||||
* generated/product_i8.c: Regenerated.
|
||||
* generated/product_r10.c: Regenerated.
|
||||
* generated/product_r16.c: Regenerated.
|
||||
* generated/product_r4.c: Regenerated.
|
||||
* generated/product_r8.c: Regenerated.
|
||||
* generated/sum_c10.c: Regenerated.
|
||||
* generated/sum_c16.c: Regenerated.
|
||||
* generated/sum_c4.c: Regenerated.
|
||||
* generated/sum_c8.c: Regenerated.
|
||||
* generated/sum_i1.c: Regenerated.
|
||||
* generated/sum_i16.c: Regenerated.
|
||||
* generated/sum_i2.c: Regenerated.
|
||||
* generated/sum_i4.c: Regenerated.
|
||||
* generated/sum_i8.c: Regenerated.
|
||||
* generated/sum_r10.c: Regenerated.
|
||||
* generated/sum_r16.c: Regenerated.
|
||||
* generated/sum_r4.c: Regenerated.
|
||||
* generated/sum_r8.c: Regenerated.
|
||||
|
||||
2008-05-04 Thomas Koenig <tkoenig@gcc.gnu.org>
|
||||
|
||||
PR libfortran/35990
|
||||
|
@ -57,6 +57,7 @@ all_l1 (gfc_array_l1 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ all_l1 (gfc_array_l1 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ all_l1 (gfc_array_l1 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_LOGICAL_1 result;
|
||||
@ -207,7 +212,7 @@ all_l1 (gfc_array_l1 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ all_l16 (gfc_array_l16 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ all_l16 (gfc_array_l16 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ all_l16 (gfc_array_l16 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_LOGICAL_16 result;
|
||||
@ -207,7 +212,7 @@ all_l16 (gfc_array_l16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ all_l2 (gfc_array_l2 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ all_l2 (gfc_array_l2 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ all_l2 (gfc_array_l2 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_LOGICAL_2 result;
|
||||
@ -207,7 +212,7 @@ all_l2 (gfc_array_l2 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ all_l4 (gfc_array_l4 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ all_l4 (gfc_array_l4 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ all_l4 (gfc_array_l4 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_LOGICAL_4 result;
|
||||
@ -207,7 +212,7 @@ all_l4 (gfc_array_l4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ all_l8 (gfc_array_l8 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ all_l8 (gfc_array_l8 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ all_l8 (gfc_array_l8 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_LOGICAL_8 result;
|
||||
@ -207,7 +212,7 @@ all_l8 (gfc_array_l8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ any_l1 (gfc_array_l1 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ any_l1 (gfc_array_l1 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ any_l1 (gfc_array_l1 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_LOGICAL_1 result;
|
||||
@ -207,7 +212,7 @@ any_l1 (gfc_array_l1 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ any_l16 (gfc_array_l16 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ any_l16 (gfc_array_l16 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ any_l16 (gfc_array_l16 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_LOGICAL_16 result;
|
||||
@ -207,7 +212,7 @@ any_l16 (gfc_array_l16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ any_l2 (gfc_array_l2 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ any_l2 (gfc_array_l2 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ any_l2 (gfc_array_l2 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_LOGICAL_2 result;
|
||||
@ -207,7 +212,7 @@ any_l2 (gfc_array_l2 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ any_l4 (gfc_array_l4 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ any_l4 (gfc_array_l4 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ any_l4 (gfc_array_l4 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_LOGICAL_4 result;
|
||||
@ -207,7 +212,7 @@ any_l4 (gfc_array_l4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ any_l8 (gfc_array_l8 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ any_l8 (gfc_array_l8 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ any_l8 (gfc_array_l8 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_LOGICAL_8 result;
|
||||
@ -207,7 +212,7 @@ any_l8 (gfc_array_l8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ count_16_l (gfc_array_i16 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ count_16_l (gfc_array_i16 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ count_16_l (gfc_array_i16 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -203,7 +208,7 @@ count_16_l (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ count_1_l (gfc_array_i1 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ count_1_l (gfc_array_i1 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ count_1_l (gfc_array_i1 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_INTEGER_1 result;
|
||||
@ -203,7 +208,7 @@ count_1_l (gfc_array_i1 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ count_2_l (gfc_array_i2 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ count_2_l (gfc_array_i2 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ count_2_l (gfc_array_i2 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_INTEGER_2 result;
|
||||
@ -203,7 +208,7 @@ count_2_l (gfc_array_i2 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ count_4_l (gfc_array_i4 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ count_4_l (gfc_array_i4 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ count_4_l (gfc_array_i4 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -203,7 +208,7 @@ count_4_l (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,6 +57,7 @@ count_8_l (gfc_array_i8 * const restrict retarray,
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int src_kind;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
@ -65,6 +66,9 @@ count_8_l (gfc_array_i8 * const restrict retarray,
|
||||
src_kind = GFC_DESCRIPTOR_SIZE (array);
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
|
||||
delta = array->dim[dim].stride * src_kind;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -164,7 +168,8 @@ count_8_l (gfc_array_i8 * const restrict retarray,
|
||||
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_LOGICAL_1 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -203,7 +208,7 @@ count_8_l (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
|
@ -57,12 +57,15 @@ maxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_1 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_16 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_2 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_4 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_8 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_10 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_16 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_4 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_8 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_1 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_16 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_2 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_4 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_8 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_10 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_16 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_4 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_8 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_1 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_16 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_2 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_4 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_8 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_10 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_16 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_4 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ maxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ maxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_8 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ maxloc1_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ maxval_i1 (gfc_array_i1 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ maxval_i1 (gfc_array_i1 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_1 * restrict src;
|
||||
GFC_INTEGER_1 result;
|
||||
@ -187,8 +191,8 @@ maxval_i1 (gfc_array_i1 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ maxval_i16 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ maxval_i16 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_16 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -187,8 +191,8 @@ maxval_i16 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ maxval_i2 (gfc_array_i2 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ maxval_i2 (gfc_array_i2 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_2 * restrict src;
|
||||
GFC_INTEGER_2 result;
|
||||
@ -187,8 +191,8 @@ maxval_i2 (gfc_array_i2 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ maxval_i4 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ maxval_i4 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_4 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -187,8 +191,8 @@ maxval_i4 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ maxval_i8 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ maxval_i8 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_8 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -187,8 +191,8 @@ maxval_i8 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ maxval_r10 (gfc_array_r10 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ maxval_r10 (gfc_array_r10 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_10 * restrict src;
|
||||
GFC_REAL_10 result;
|
||||
@ -187,8 +191,8 @@ maxval_r10 (gfc_array_r10 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ maxval_r16 (gfc_array_r16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ maxval_r16 (gfc_array_r16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_16 * restrict src;
|
||||
GFC_REAL_16 result;
|
||||
@ -187,8 +191,8 @@ maxval_r16 (gfc_array_r16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ maxval_r4 (gfc_array_r4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ maxval_r4 (gfc_array_r4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_4 * restrict src;
|
||||
GFC_REAL_4 result;
|
||||
@ -187,8 +191,8 @@ maxval_r4 (gfc_array_r4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ maxval_r8 (gfc_array_r8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ maxval_r8 (gfc_array_r8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_8 * restrict src;
|
||||
GFC_REAL_8 result;
|
||||
@ -187,8 +191,8 @@ maxval_r8 (gfc_array_r8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_1 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ minloc1_16_i1 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_16 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ minloc1_16_i16 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_2 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ minloc1_16_i2 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_4 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ minloc1_16_i4 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_8 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ minloc1_16_i8 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_10 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ minloc1_16_r10 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_16 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ minloc1_16_r16 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_4 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ minloc1_16_r4 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_8 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -193,8 +197,8 @@ minloc1_16_r8 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_1 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ minloc1_4_i1 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_16 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ minloc1_4_i16 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_2 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ minloc1_4_i2 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_4 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ minloc1_4_i4 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_8 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ minloc1_4_i8 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_10 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ minloc1_4_r10 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_16 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ minloc1_4_r16 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_4 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ minloc1_4_r4 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_8 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -193,8 +197,8 @@ minloc1_4_r8 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_1 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ minloc1_8_i1 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_16 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ minloc1_8_i16 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_2 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ minloc1_8_i2 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_4 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ minloc1_8_i4 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_8 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ minloc1_8_i8 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_10 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ minloc1_8_r10 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_16 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ minloc1_8_r16 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_4 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ minloc1_8_r4 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -57,12 +57,15 @@ minloc1_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -149,7 +152,8 @@ minloc1_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_8 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -193,8 +197,8 @@ minloc1_8_r8 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ minval_i1 (gfc_array_i1 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ minval_i1 (gfc_array_i1 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_1 * restrict src;
|
||||
GFC_INTEGER_1 result;
|
||||
@ -187,8 +191,8 @@ minval_i1 (gfc_array_i1 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ minval_i16 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ minval_i16 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_16 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -187,8 +191,8 @@ minval_i16 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ minval_i2 (gfc_array_i2 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ minval_i2 (gfc_array_i2 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_2 * restrict src;
|
||||
GFC_INTEGER_2 result;
|
||||
@ -187,8 +191,8 @@ minval_i2 (gfc_array_i2 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ minval_i4 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ minval_i4 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_4 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -187,8 +191,8 @@ minval_i4 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ minval_i8 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ minval_i8 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_8 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -187,8 +191,8 @@ minval_i8 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ minval_r10 (gfc_array_r10 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ minval_r10 (gfc_array_r10 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_10 * restrict src;
|
||||
GFC_REAL_10 result;
|
||||
@ -187,8 +191,8 @@ minval_r10 (gfc_array_r10 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ minval_r16 (gfc_array_r16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ minval_r16 (gfc_array_r16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_16 * restrict src;
|
||||
GFC_REAL_16 result;
|
||||
@ -187,8 +191,8 @@ minval_r16 (gfc_array_r16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ minval_r4 (gfc_array_r4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ minval_r4 (gfc_array_r4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_4 * restrict src;
|
||||
GFC_REAL_4 result;
|
||||
@ -187,8 +191,8 @@ minval_r4 (gfc_array_r4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ minval_r8 (gfc_array_r8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ minval_r8 (gfc_array_r8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_8 * restrict src;
|
||||
GFC_REAL_8 result;
|
||||
@ -187,8 +191,8 @@ minval_r8 (gfc_array_r8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ product_c10 (gfc_array_c10 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ product_c10 (gfc_array_c10 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_COMPLEX_10 * restrict src;
|
||||
GFC_COMPLEX_10 result;
|
||||
@ -186,8 +190,8 @@ product_c10 (gfc_array_c10 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ product_c16 (gfc_array_c16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ product_c16 (gfc_array_c16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_COMPLEX_16 * restrict src;
|
||||
GFC_COMPLEX_16 result;
|
||||
@ -186,8 +190,8 @@ product_c16 (gfc_array_c16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ product_c4 (gfc_array_c4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ product_c4 (gfc_array_c4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_COMPLEX_4 * restrict src;
|
||||
GFC_COMPLEX_4 result;
|
||||
@ -186,8 +190,8 @@ product_c4 (gfc_array_c4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ product_c8 (gfc_array_c8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ product_c8 (gfc_array_c8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_COMPLEX_8 * restrict src;
|
||||
GFC_COMPLEX_8 result;
|
||||
@ -186,8 +190,8 @@ product_c8 (gfc_array_c8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ product_i1 (gfc_array_i1 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ product_i1 (gfc_array_i1 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_1 * restrict src;
|
||||
GFC_INTEGER_1 result;
|
||||
@ -186,8 +190,8 @@ product_i1 (gfc_array_i1 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ product_i16 (gfc_array_i16 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ product_i16 (gfc_array_i16 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_16 * restrict src;
|
||||
GFC_INTEGER_16 result;
|
||||
@ -186,8 +190,8 @@ product_i16 (gfc_array_i16 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ product_i2 (gfc_array_i2 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ product_i2 (gfc_array_i2 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_2 * restrict src;
|
||||
GFC_INTEGER_2 result;
|
||||
@ -186,8 +190,8 @@ product_i2 (gfc_array_i2 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ product_i4 (gfc_array_i4 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ product_i4 (gfc_array_i4 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_4 * restrict src;
|
||||
GFC_INTEGER_4 result;
|
||||
@ -186,8 +190,8 @@ product_i4 (gfc_array_i4 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ product_i8 (gfc_array_i8 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ product_i8 (gfc_array_i8 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_INTEGER_8 * restrict src;
|
||||
GFC_INTEGER_8 result;
|
||||
@ -186,8 +190,8 @@ product_i8 (gfc_array_i8 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
@ -56,12 +56,15 @@ product_r10 (gfc_array_r10 * const restrict retarray,
|
||||
index_type len;
|
||||
index_type delta;
|
||||
index_type dim;
|
||||
int continue_loop;
|
||||
|
||||
/* Make dim zero based to avoid confusion. */
|
||||
dim = (*pdim) - 1;
|
||||
rank = GFC_DESCRIPTOR_RANK (array) - 1;
|
||||
|
||||
len = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
||||
if (len < 0)
|
||||
len = 0;
|
||||
delta = array->dim[dim].stride;
|
||||
|
||||
for (n = 0; n < dim; n++)
|
||||
@ -148,7 +151,8 @@ product_r10 (gfc_array_r10 * const restrict retarray,
|
||||
base = array->data;
|
||||
dest = retarray->data;
|
||||
|
||||
while (base)
|
||||
continue_loop = 1;
|
||||
while (continue_loop)
|
||||
{
|
||||
const GFC_REAL_10 * restrict src;
|
||||
GFC_REAL_10 result;
|
||||
@ -186,8 +190,8 @@ product_r10 (gfc_array_r10 * const restrict retarray,
|
||||
if (n == rank)
|
||||
{
|
||||
/* Break out of the look. */
|
||||
base = NULL;
|
||||
break;
|
||||
continue_loop = 0;
|
||||
break;
|
||||
}
|
||||
else
|
||||
{
|
||||
|
Some files were not shown because too many files have changed in this diff Show More
Loading…
x
Reference in New Issue
Block a user