OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

libgfortran.h (descriptor_dimension, [...]): Rename _lbound to lower_bound and data to base_addr. 

2012-03-10  Tobias Burnus  <burnus@net-b.de>

        * libgfortran.h (descriptor_dimension, GFC_DIMENSION_LBOUND,
        GFC_DIMENSION_EXTENT, GFC_DIMENSION_SET, GFC_DESCRIPTOR_DATA,
        GFC_ARRAY_DESCRIPTOR): Rename _lbound to lower_bound and
        data to base_addr.
        * intrinsics/cshift0.c (size0, cshift0): Handle data to
        base_addr rename.
        * intrinsics/date_and_time.c (date_and_time, secnds, itime_i4,
        itime_i8, gmtime_i4, gmtime_i8, ltime_i4, ltime_i8): Ditto.
        * intrinsics/dtime.c (dtime_sub): Ditto.
        * intrinsics/eoshift0.c (eoshift0): Ditto.
        * intrinsics/eoshift2.c (eoshift2): Ditto.
        * intrinsics/etime.c (etime_sub): Ditto.
        * intrinsics/iso_c_binding.c (c_f_pointer_u0): Ditto.
        * intrinsics/move_alloc.c (move_alloc): Ditto.
        * intrinsics/pack_generic.c (pack_internal, pack,
        pack_s_internal): Ditto.
        * intrinsics/random.c (arandom_r4, arandom_r8, arandom_r10,
        arandom_r16, random_seed_i4, random_seed_i8): Ditto.
        * intrinsics/reshape_generic.c (reshape_internal): Ditto.
        * intrinsics/spread_generic.c (spread_internal,
        spread_internal_scalar, spread, spread_scalar): Ditto.
        * intrinsics/stat.c (stat_i4_sub_0, stat_i8_sub_0, fstat_i4_sub,
        fstat_i8_sub): Ditto.
        * intrinsics/transpose_generic.c (transpose_internal): Ditto.
        * intrinsics/unpack_generic.c (unpack_bounds, unpack_internal,
        unpack1, unpack0, unpack0_char4): Ditto.
        * m4/bessel.m4 (bessel_jn_r'rtype_kind`,
        * bessel_yn_r'rtype_kind`):
        Ditto.
        * m4/cshift0.m4 (cshift0_'rtype_code`): Ditto.
        * m4/cshift1.m4 (cshift1): Ditto.
        * m4/eoshift1.m4 (eoshift1): Ditto.
        * m4/eoshift3.m4 (eoshift3): Ditto.
        * m4/iforeach.m4 (name`'rtype_qual`_'atype_code): Ditto.
        * m4/ifunction.m4 (name`'rtype_qual`_'atype_code): Ditto.
        * m4/ifunction_logical.m4 (name`'rtype_qual`_'atype_code):
        * Ditto.
        * m4/in_pack.m4 (internal_pack_'rtype_ccode`): Ditto.
        * m4/in_unpack.m4 (internal_unpack_'rtype_ccode`): Ditto.
        * m4/matmul.m4 (matmul_'rtype_code`): Ditto.
        * m4/matmull.m4 (matmul_'rtype_code`): Ditto.
        * m4/pack.m4 (pack_'rtype_code`): Ditto.
        * m4/reshape.m4 (reshape_'rtype_ccode`): Ditto.
        * m4/shape.m4 (shape_'rtype_kind`): Ditto.
        * m4/spread.m4 (spread_'rtype_code`): Ditto.
        * m4/transpose.m4 (transpose_'rtype_code`): Ditto.
        * m4/unpack.m4 (unpack0_'rtype_code`, unpack1_'rtype_code`):
        * Ditto.
        * runtime/bounds.c (count_0): Ditto.
        * runtime/in_pack_generic.c (internal_pack): Ditto.
        * runtime/in_unpack_generic.c (internal_unpack): Ditto.
        * generated/cshift0_r4.c: Regenerated.
        * generated/unpack_r8.c: Regenerated.
        * generated/cshift0_c10.c: Regenerated.
        * generated/in_unpack_i1.c: Regenerated.
        * generated/eoshift1_16.c: Regenerated.
        * generated/iany_i16.c: Regenerated.
        * generated/reshape_i4.c: Regenerated.
        * generated/parity_l16.c: Regenerated.
        * generated/in_unpack_r16.c: Regenerated.
        * generated/iparity_i1.c: Regenerated.
        * generated/minloc0_16_r10.c: Regenerated.
        * generated/minloc1_16_i8.c: Regenerated.
        * generated/bessel_r8.c: Regenerated.
        * generated/maxloc0_4_i8.c: Regenerated.
        * generated/maxloc1_8_i1.c: Regenerated.
        * generated/sum_c10.c: Regenerated.
        * generated/maxloc0_8_r10.c: Regenerated.
        * generated/unpack_r16.c: Regenerated.
        * generated/maxloc1_16_i1.c: Regenerated.
        * generated/minloc1_4_i1.c: Regenerated.
        * generated/unpack_i4.c: Regenerated.
        * generated/in_pack_i1.c: Regenerated.
        * generated/cshift0_i1.c: Regenerated.
        * generated/minloc0_16_i4.c: Regenerated.
        * generated/minloc1_8_r8.c: Regenerated.
        * generated/maxval_r8.c: Regenerated.
        * generated/unpack_i2.c: Regenerated.
        * generated/matmul_r16.c: Regenerated.
        * generated/maxloc0_16_r8.c: Regenerated.
        * generated/maxloc1_8_i16.c: Regenerated.
        * generated/maxloc0_4_r4.c: Regenerated.
        * generated/pack_c10.c: Regenerated.
        * generated/in_unpack_c8.c: Regenerated.
        * generated/maxloc1_8_i8.c: Regenerated.
        * generated/in_pack_c16.c: Regenerated.
        * generated/parity_l1.c: Regenerated.
        * generated/in_pack_i2.c: Regenerated.
        * generated/maxloc0_4_r8.c: Regenerated.
        * generated/pack_r4.c: Regenerated.
        * generated/matmul_r8.c: Regenerated.
        * generated/pack_i1.c: Regenerated.
        * generated/minloc0_16_r16.c: Regenerated.
        * generated/cshift0_c8.c: Regenerated.
        * generated/minloc1_4_i16.c: Regenerated.
        * generated/minloc0_4_r4.c: Regenerated.
        * generated/product_i2.c: Regenerated.
        * generated/maxval_r10.c: Regenerated.
        * generated/minloc0_16_r8.c: Regenerated.
        * generated/in_pack_i8.c: Regenerated.
        * generated/all_l8.c: Regenerated.
        * generated/minloc0_8_i16.c: Regenerated.
        * generated/minloc1_8_i2.c: Regenerated.
        * generated/matmul_l8.c: Regenerated.
        * generated/spread_r10.c: Regenerated.
        * generated/product_c4.c: Regenerated.
        * generated/reshape_r16.c: Regenerated.
        * generated/cshift0_i16.c: Regenerated.
        * generated/minloc1_8_r10.c: Regenerated.
        * generated/iparity_i8.c: Regenerated.
        * generated/minloc0_16_i8.c: Regenerated.
        * generated/minloc1_8_i1.c: Regenerated.
        * generated/maxloc0_16_r10.c: Regenerated.
        * generated/maxloc1_8_i4.c: Regenerated.
        * generated/maxloc0_16_i8.c: Regenerated.
        * generated/maxloc1_16_i16.c: Regenerated.
        * generated/reshape_i8.c: Regenerated.
        * generated/all_l16.c: Regenerated.
        * generated/cshift1_8.c: Regenerated.
        * generated/matmul_c10.c: Regenerated.
        * generated/pack_r16.c: Regenerated.
        * generated/transpose_r10.c: Regenerated.
        * generated/maxloc1_16_i2.c: Regenerated.
        * generated/minloc1_4_r4.c: Regenerated.
        * generated/reshape_r8.c: Regenerated.
        * generated/product_r10.c: Regenerated.
        * generated/spread_c10.c: Regenerated.
        * generated/reshape_r4.c: Regenerated.
        * generated/in_unpack_i4.c: Regenerated.
        * generated/minval_r4.c: Regenerated.
        * generated/minloc1_16_r16.c: Regenerated.
        * generated/norm2_r8.c: Regenerated.
        * generated/iany_i2.c: Regenerated.
        * generated/eoshift3_8.c: Regenerated.
        * generated/maxloc1_16_r8.c: Regenerated.
        * generated/maxloc0_16_r16.c: Regenerated.
        * generated/cshift0_i8.c: Regenerated.
        * generated/all_l1.c: Regenerated.
        * generated/minloc1_16_r10.c: Regenerated.
        * generated/spread_i16.c: Regenerated.
        * generated/minloc1_8_r16.c: Regenerated.
        * generated/spread_r16.c: Regenerated.
        * generated/matmul_c8.c: Regenerated.
        * generated/pack_r10.c: Regenerated.
        * generated/reshape_r10.c: Regenerated.
        * generated/sum_r10.c: Regenerated.
        * generated/count_8_l.c: Regenerated.
        * generated/minloc1_16_i16.c: Regenerated.
        * generated/maxloc0_16_i2.c: Regenerated.
        * generated/count_1_l.c: Regenerated.
        * generated/unpack_c16.c: Regenerated.
        * generated/any_l8.c: Regenerated.
        * generated/minloc1_16_i1.c: Regenerated.
        * generated/sum_r4.c: Regenerated.
        * generated/in_unpack_r8.c: Regenerated.
        * generated/product_r8.c: Regenerated.
        * generated/in_unpack_r4.c: Regenerated.
        * generated/unpack_i1.c: Regenerated.
        * generated/cshift0_r8.c: Regenerated.
        * generated/spread_i2.c: Regenerated.
        * generated/minloc1_4_r10.c: Regenerated.
        * generated/minloc1_16_i2.c: Regenerated.
        * generated/minloc0_16_i2.c: Regenerated.
        * generated/eoshift3_16.c: Regenerated.
        * generated/maxloc0_8_i4.c: Regenerated.
        * generated/maxloc1_16_r10.c: Regenerated.
        * generated/maxloc1_4_i16.c: Regenerated.
        * generated/maxloc1_4_r8.c: Regenerated.
        * generated/parity_l2.c: Regenerated.
        * generated/maxloc0_16_i16.c: Regenerated.
        * generated/product_r4.c: Regenerated.
        * generated/in_unpack_r10.c: Regenerated.
        * generated/maxloc1_8_i2.c: Regenerated.
        * generated/iparity_i2.c: Regenerated.
        * generated/maxloc1_8_r4.c: Regenerated.
        * generated/maxloc1_8_r8.c: Regenerated.
        * generated/iall_i4.c: Regenerated.
        * generated/maxloc0_4_i16.c: Regenerated.
        * generated/cshift0_i4.c: Regenerated.
        * generated/in_unpack_c10.c: Regenerated.
        * generated/unpack_c8.c: Regenerated.
        * generated/transpose_c8.c: Regenerated.
        * generated/in_unpack_c16.c: Regenerated.
        * generated/product_c16.c: Regenerated.
        * generated/minval_r8.c: Regenerated.
        * generated/minloc0_4_i1.c: Regenerated.
        * generated/minloc0_8_r16.c: Regenerated.
        * generated/in_unpack_i16.c: Regenerated.
        * generated/reshape_c16.c: Regenerated.
        * generated/pack_i4.c: Regenerated.
        * generated/minval_r10.c: Regenerated.
        * generated/maxloc0_4_r10.c: Regenerated.
        * generated/unpack_i8.c: Regenerated.
        * generated/minloc1_16_r8.c: Regenerated.
        * generated/pack_c16.c: Regenerated.
        * generated/maxval_r4.c: Regenerated.
        * generated/spread_r8.c: Regenerated.
        * generated/minloc0_16_r4.c: Regenerated.
        * generated/maxval_i4.c: Regenerated.
        * generated/matmul_r4.c: Regenerated.
        * generated/product_c8.c: Regenerated.
        * generated/maxloc1_4_i4.c: Regenerated.
        * generated/any_l4.c: Regenerated.
        * generated/cshift0_r16.c: Regenerated.
        * generated/maxloc1_16_r4.c: Regenerated.
        * generated/in_pack_r10.c: Regenerated.
        * generated/iall_i1.c: Regenerated.
        * generated/product_i1.c: Regenerated.
        * generated/maxloc0_4_i1.c: Regenerated.
        * generated/maxloc0_8_r16.c: Regenerated.
        * generated/minloc1_8_i16.c: Regenerated.
        * generated/reshape_c10.c: Regenerated.
        * generated/matmul_l4.c: Regenerated.
        * generated/cshift0_c16.c: Regenerated.
        * generated/spread_r4.c: Regenerated.
        * generated/sum_r16.c: Regenerated.
        * generated/in_unpack_c4.c: Regenerated.
        * generated/maxval_i8.c: Regenerated.
        * generated/maxloc0_8_r8.c: Regenerated.
        * generated/unpack_i16.c: Regenerated.
        * generated/norm2_r4.c: Regenerated.
        * generated/maxloc1_4_r16.c: Regenerated.
        * generated/in_pack_r4.c: Regenerated.
        * generated/sum_c8.c: Regenerated.
        * generated/parity_l8.c: Regenerated.
        * generated/minval_i2.c: Regenerated.
        * generated/transpose_c10.c: Regenerated.
        * generated/cshift0_r10.c: Regenerated.
        * generated/cshift0_i2.c: Regenerated.
        * generated/spread_c4.c: Regenerated.
        * generated/maxval_r16.c: Regenerated.
        * generated/unpack_c10.c: Regenerated.
        * generated/bessel_r4.c: Regenerated.
        * generated/minloc0_8_i1.c: Regenerated.
        * generated/product_c10.c: Regenerated.
        * generated/minloc1_4_i4.c: Regenerated.
        * generated/minloc1_4_i2.c: Regenerated.
        * generated/transpose_c4.c: Regenerated.
        * generated/in_pack_c8.c: Regenerated.
        * generated/minval_i8.c: Regenerated.
        * generated/maxloc1_4_i2.c: Regenerated.
        * generated/maxloc1_4_i1.c: Regenerated.
        * generated/iall_i8.c: Regenerated.
        * generated/iany_i8.c: Regenerated.
        * generated/sum_c16.c: Regenerated.
        * generated/spread_i8.c: Regenerated.
        * generated/sum_i8.c: Regenerated.
        * generated/pack_i2.c: Regenerated.
        * generated/unpack_r10.c: Regenerated.
        * generated/minloc0_4_i4.c: Regenerated.
        * generated/iany_i4.c: Regenerated.
        * generated/maxloc0_4_i4.c: Regenerated.
        * generated/in_pack_r8.c: Regenerated.
        * generated/spread_i1.c: Regenerated.
        * generated/maxval_i16.c: Regenerated.
        * generated/pack_c8.c: Regenerated.
        * generated/iparity_i16.c: Regenerated.
        * generated/matmul_c16.c: Regenerated.
        * generated/eoshift1_8.c: Regenerated.
        * generated/any_l16.c: Regenerated.
        * generated/maxloc1_4_i8.c: Regenerated.
        * generated/minloc0_8_r4.c: Regenerated.
        * generated/transpose_c16.c: Regenerated.
        * generated/reshape_c4.c: Regenerated.
        * generated/minloc0_8_r8.c: Regenerated.
        * generated/count_16_l.c: Regenerated.
        * generated/minloc0_16_i1.c: Regenerated.
        * generated/minloc1_16_r4.c: Regenerated.
        * generated/maxloc0_8_i1.c: Regenerated.
        * generated/matmul_i1.c: Regenerated.
        * generated/sum_i2.c: Regenerated.
        * generated/cshift1_4.c: Regenerated.
        * generated/minloc0_4_i2.c: Regenerated.
        * generated/bessel_r10.c: Regenerated.
        * generated/matmul_c4.c: Regenerated.
        * generated/parity_l4.c: Regenerated.
        * generated/in_unpack_i2.c: Regenerated.
        * generated/product_i16.c: Regenerated.
        * generated/maxloc0_16_i4.c: Regenerated.
        * generated/minloc0_4_r10.c: Regenerated.
        * generated/transpose_i16.c: Regenerated.
        * generated/matmul_l16.c: Regenerated.
        * generated/any_l1.c: Regenerated.
        * generated/minval_r16.c: Regenerated.
        * generated/shape_i16.c: Regenerated.
        * generated/in_pack_c4.c: Regenerated.
        * generated/minloc1_8_r4.c: Regenerated.
        * generated/iany_i1.c: Regenerated.
        * generated/matmul_i16.c: Regenerated.
        * generated/maxloc0_16_r4.c: Regenerated.
        * generated/spread_c8.c: Regenerated.
        * generated/product_i8.c: Regenerated.
        * generated/minloc1_8_i4.c: Regenerated.
        * generated/product_i4.c: Regenerated.
        * generated/minval_i16.c: Regenerated.
        * generated/pack_r8.c: Regenerated.
        * generated/matmul_r10.c: Regenerated.
        * generated/shape_i8.c: Regenerated.
        * generated/eoshift1_4.c: Regenerated.
        * generated/minloc1_16_i4.c: Regenerated.
        * generated/transpose_r16.c: Regenerated.
        * generated/spread_c16.c: Regenerated.
        * generated/maxloc0_8_i16.c: Regenerated.
        * generated/minval_i1.c: Regenerated.
        * generated/sum_i4.c: Regenerated.
        * generated/in_pack_r16.c: Regenerated.
        * generated/iall_i16.c: Regenerated.
        * generated/minloc0_8_r10.c: Regenerated.
        * generated/maxloc0_8_i8.c: Regenerated.
        * generated/transpose_i4.c: Regenerated.
        * generated/maxloc0_4_i2.c: Regenerated.
        * generated/iall_i2.c: Regenerated.
        * generated/maxloc0_8_r4.c: Regenerated.
        * generated/minloc0_4_r16.c: Regenerated.
        * generated/minloc1_4_r8.c: Regenerated.
        * generated/minloc0_4_i8.c: Regenerated.
        * generated/minval_i4.c: Regenerated.
        * generated/minloc1_8_i8.c: Regenerated.
        * generated/in_pack_i16.c: Regenerated.
        * generated/spread_i4.c: Regenerated.
        * generated/cshift0_c4.c: Regenerated.
        * generated/minloc0_4_i16.c: Regenerated.
        * generated/sum_r8.c: Regenerated.
        * generated/minloc0_16_i16.c: Regenerated.
        * generated/sum_i1.c: Regenerated.
        * generated/all_l2.c: Regenerated.
        * generated/sum_c4.c: Regenerated.
        * generated/shape_i4.c: Regenerated.
        * generated/maxval_i1.c: Regenerated.
        * generated/norm2_r10.c: Regenerated.
        * generated/unpack_c4.c: Regenerated.
        * generated/maxloc0_16_i1.c: Regenerated.
        * generated/all_l4.c: Regenerated.
        * generated/maxloc1_16_i8.c: Regenerated.
        * generated/sum_i16.c: Regenerated.
        * generated/maxloc1_8_r16.c: Regenerated.
        * generated/minloc1_4_r16.c: Regenerated.
        * generated/maxloc1_16_r16.c: Regenerated.
        * generated/transpose_i8.c: Regenerated.
        * generated/minloc0_8_i2.c: Regenerated.
        * generated/product_r16.c: Regenerated.
        * generated/in_pack_c10.c: Regenerated.
        * generated/maxloc0_4_r16.c: Regenerated.
        * generated/pack_c4.c: Regenerated.
        * generated/bessel_r16.c: Regenerated.
        * generated/norm2_r16.c: Regenerated.
        * generated/in_unpack_i8.c: Regenerated.
        * generated/maxloc1_16_i4.c: Regenerated.
        * generated/minloc1_4_i8.c: Regenerated.
        * generated/eoshift3_4.c: Regenerated.
        * generated/maxloc1_8_r10.c: Regenerated.
        * generated/matmul_i8.c: Regenerated.
        * generated/matmul_i4.c: Regenerated.
        * generated/reshape_i16.c: Regenerated.
        * generated/matmul_i2.c: Regenerated.
        * generated/transpose_r8.c: Regenerated.
        * generated/transpose_r4.c: Regenerated.
        * generated/cshift1_16.c: Regenerated.
        * generated/maxloc1_4_r10.c: Regenerated.
        * generated/iparity_i4.c: Regenerated.
        * generated/in_pack_i4.c: Regenerated.
        * generated/maxloc0_8_i2.c: Regenerated.
        * generated/unpack_r4.c: Regenerated.
        * generated/count_4_l.c: Regenerated.
        * generated/maxloc1_4_r4.c: Regenerated.
        * generated/minloc0_8_i8.c: Regenerated.
        * generated/any_l2.c: Regenerated.
        * generated/minloc0_8_i4.c: Regenerated.
        * generated/pack_i8.c: Regenerated.
        * generated/count_2_l.c: Regenerated.
        * generated/reshape_c8.c: Regenerated.
        * generated/maxval_i2.c: Regenerated.
        * generated/minloc0_4_r8.c: Regenerated.

From-SVN: r185177
This commit is contained in:
Tobias Burnus 2012-03-10 18:22:31 +01:00 committed by Tobias Burnus
parent 30823ba60c
commit 21d1335b2a
361 changed files with 3909 additions and 3544 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

373
libgfortran/ChangeLog
View File

@ -1,3 +1,376 @@
2012-03-10 Tobias Burnus <burnus@net-b.de>
* libgfortran.h (descriptor_dimension, GFC_DIMENSION_LBOUND,
GFC_DIMENSION_EXTENT, GFC_DIMENSION_SET, GFC_DESCRIPTOR_DATA,
GFC_ARRAY_DESCRIPTOR): Rename _lbound to lower_bound and
data to base_addr.
* intrinsics/cshift0.c (size0, cshift0): Handle data to
base_addr rename.
* intrinsics/date_and_time.c (date_and_time, secnds, itime_i4,
itime_i8, gmtime_i4, gmtime_i8, ltime_i4, ltime_i8): Ditto.
* intrinsics/dtime.c (dtime_sub): Ditto.
* intrinsics/eoshift0.c (eoshift0): Ditto.
* intrinsics/eoshift2.c (eoshift2): Ditto.
* intrinsics/etime.c (etime_sub): Ditto.
* intrinsics/iso_c_binding.c (c_f_pointer_u0): Ditto.
* intrinsics/move_alloc.c (move_alloc): Ditto.
* intrinsics/pack_generic.c (pack_internal, pack,
pack_s_internal): Ditto.
* intrinsics/random.c (arandom_r4, arandom_r8, arandom_r10,
arandom_r16, random_seed_i4, random_seed_i8): Ditto.
* intrinsics/reshape_generic.c (reshape_internal): Ditto.
* intrinsics/spread_generic.c (spread_internal,
spread_internal_scalar, spread, spread_scalar): Ditto.
* intrinsics/stat.c (stat_i4_sub_0, stat_i8_sub_0, fstat_i4_sub,
fstat_i8_sub): Ditto.
* intrinsics/transpose_generic.c (transpose_internal): Ditto.
* intrinsics/unpack_generic.c (unpack_bounds, unpack_internal,
unpack1, unpack0, unpack0_char4): Ditto.
* m4/bessel.m4 (bessel_jn_r'rtype_kind`, bessel_yn_r'rtype_kind`):
Ditto.
* m4/cshift0.m4 (cshift0_'rtype_code`): Ditto.
* m4/cshift1.m4 (cshift1): Ditto.
* m4/eoshift1.m4 (eoshift1): Ditto.
* m4/eoshift3.m4 (eoshift3): Ditto.
* m4/iforeach.m4 (name`'rtype_qual`_'atype_code): Ditto.
* m4/ifunction.m4 (name`'rtype_qual`_'atype_code): Ditto.
* m4/ifunction_logical.m4 (name`'rtype_qual`_'atype_code): Ditto.
* m4/in_pack.m4 (internal_pack_'rtype_ccode`): Ditto.
* m4/in_unpack.m4 (internal_unpack_'rtype_ccode`): Ditto.
* m4/matmul.m4 (matmul_'rtype_code`): Ditto.
* m4/matmull.m4 (matmul_'rtype_code`): Ditto.
* m4/pack.m4 (pack_'rtype_code`): Ditto.
* m4/reshape.m4 (reshape_'rtype_ccode`): Ditto.
* m4/shape.m4 (shape_'rtype_kind`): Ditto.
* m4/spread.m4 (spread_'rtype_code`): Ditto.
* m4/transpose.m4 (transpose_'rtype_code`): Ditto.
* m4/unpack.m4 (unpack0_'rtype_code`, unpack1_'rtype_code`): Ditto.
* runtime/bounds.c (count_0): Ditto.
* runtime/in_pack_generic.c (internal_pack): Ditto.
* runtime/in_unpack_generic.c (internal_unpack): Ditto.
* generated/cshift0_r4.c: Regenerated.
* generated/unpack_r8.c: Regenerated.
* generated/cshift0_c10.c: Regenerated.
* generated/in_unpack_i1.c: Regenerated.
* generated/eoshift1_16.c: Regenerated.
* generated/iany_i16.c: Regenerated.
* generated/reshape_i4.c: Regenerated.
* generated/parity_l16.c: Regenerated.
* generated/in_unpack_r16.c: Regenerated.
* generated/iparity_i1.c: Regenerated.
* generated/minloc0_16_r10.c: Regenerated.
* generated/minloc1_16_i8.c: Regenerated.
* generated/bessel_r8.c: Regenerated.
* generated/maxloc0_4_i8.c: Regenerated.
* generated/maxloc1_8_i1.c: Regenerated.
* generated/sum_c10.c: Regenerated.
* generated/maxloc0_8_r10.c: Regenerated.
* generated/unpack_r16.c: Regenerated.
* generated/maxloc1_16_i1.c: Regenerated.
* generated/minloc1_4_i1.c: Regenerated.
* generated/unpack_i4.c: Regenerated.
* generated/in_pack_i1.c: Regenerated.
* generated/cshift0_i1.c: Regenerated.
* generated/minloc0_16_i4.c: Regenerated.
* generated/minloc1_8_r8.c: Regenerated.
* generated/maxval_r8.c: Regenerated.
* generated/unpack_i2.c: Regenerated.
* generated/matmul_r16.c: Regenerated.
* generated/maxloc0_16_r8.c: Regenerated.
* generated/maxloc1_8_i16.c: Regenerated.
* generated/maxloc0_4_r4.c: Regenerated.
* generated/pack_c10.c: Regenerated.
* generated/in_unpack_c8.c: Regenerated.
* generated/maxloc1_8_i8.c: Regenerated.
* generated/in_pack_c16.c: Regenerated.
* generated/parity_l1.c: Regenerated.
* generated/in_pack_i2.c: Regenerated.
* generated/maxloc0_4_r8.c: Regenerated.
* generated/pack_r4.c: Regenerated.
* generated/matmul_r8.c: Regenerated.
* generated/pack_i1.c: Regenerated.
* generated/minloc0_16_r16.c: Regenerated.
* generated/cshift0_c8.c: Regenerated.
* generated/minloc1_4_i16.c: Regenerated.
* generated/minloc0_4_r4.c: Regenerated.
* generated/product_i2.c: Regenerated.
* generated/maxval_r10.c: Regenerated.
* generated/minloc0_16_r8.c: Regenerated.
* generated/in_pack_i8.c: Regenerated.
* generated/all_l8.c: Regenerated.
* generated/minloc0_8_i16.c: Regenerated.
* generated/minloc1_8_i2.c: Regenerated.
* generated/matmul_l8.c: Regenerated.
* generated/spread_r10.c: Regenerated.
* generated/product_c4.c: Regenerated.
* generated/reshape_r16.c: Regenerated.
* generated/cshift0_i16.c: Regenerated.
* generated/minloc1_8_r10.c: Regenerated.
* generated/iparity_i8.c: Regenerated.
* generated/minloc0_16_i8.c: Regenerated.
* generated/minloc1_8_i1.c: Regenerated.
* generated/maxloc0_16_r10.c: Regenerated.
* generated/maxloc1_8_i4.c: Regenerated.
* generated/maxloc0_16_i8.c: Regenerated.
* generated/maxloc1_16_i16.c: Regenerated.
* generated/reshape_i8.c: Regenerated.
* generated/all_l16.c: Regenerated.
* generated/cshift1_8.c: Regenerated.
* generated/matmul_c10.c: Regenerated.
* generated/pack_r16.c: Regenerated.
* generated/transpose_r10.c: Regenerated.
* generated/maxloc1_16_i2.c: Regenerated.
* generated/minloc1_4_r4.c: Regenerated.
* generated/reshape_r8.c: Regenerated.
* generated/product_r10.c: Regenerated.
* generated/spread_c10.c: Regenerated.
* generated/reshape_r4.c: Regenerated.
* generated/in_unpack_i4.c: Regenerated.
* generated/minval_r4.c: Regenerated.
* generated/minloc1_16_r16.c: Regenerated.
* generated/norm2_r8.c: Regenerated.
* generated/iany_i2.c: Regenerated.
* generated/eoshift3_8.c: Regenerated.
* generated/maxloc1_16_r8.c: Regenerated.
* generated/maxloc0_16_r16.c: Regenerated.
* generated/cshift0_i8.c: Regenerated.
* generated/all_l1.c: Regenerated.
* generated/minloc1_16_r10.c: Regenerated.
* generated/spread_i16.c: Regenerated.
* generated/minloc1_8_r16.c: Regenerated.
* generated/spread_r16.c: Regenerated.
* generated/matmul_c8.c: Regenerated.
* generated/pack_r10.c: Regenerated.
* generated/reshape_r10.c: Regenerated.
* generated/sum_r10.c: Regenerated.
* generated/count_8_l.c: Regenerated.
* generated/minloc1_16_i16.c: Regenerated.
* generated/maxloc0_16_i2.c: Regenerated.
* generated/count_1_l.c: Regenerated.
* generated/unpack_c16.c: Regenerated.
* generated/any_l8.c: Regenerated.
* generated/minloc1_16_i1.c: Regenerated.
* generated/sum_r4.c: Regenerated.
* generated/in_unpack_r8.c: Regenerated.
* generated/product_r8.c: Regenerated.
* generated/in_unpack_r4.c: Regenerated.
* generated/unpack_i1.c: Regenerated.
* generated/cshift0_r8.c: Regenerated.
* generated/spread_i2.c: Regenerated.
* generated/minloc1_4_r10.c: Regenerated.
* generated/minloc1_16_i2.c: Regenerated.
* generated/minloc0_16_i2.c: Regenerated.
* generated/eoshift3_16.c: Regenerated.
* generated/maxloc0_8_i4.c: Regenerated.
* generated/maxloc1_16_r10.c: Regenerated.
* generated/maxloc1_4_i16.c: Regenerated.
* generated/maxloc1_4_r8.c: Regenerated.
* generated/parity_l2.c: Regenerated.
* generated/maxloc0_16_i16.c: Regenerated.
* generated/product_r4.c: Regenerated.
* generated/in_unpack_r10.c: Regenerated.
* generated/maxloc1_8_i2.c: Regenerated.
* generated/iparity_i2.c: Regenerated.
* generated/maxloc1_8_r4.c: Regenerated.
* generated/maxloc1_8_r8.c: Regenerated.
* generated/iall_i4.c: Regenerated.
* generated/maxloc0_4_i16.c: Regenerated.
* generated/cshift0_i4.c: Regenerated.
* generated/in_unpack_c10.c: Regenerated.
* generated/unpack_c8.c: Regenerated.
* generated/transpose_c8.c: Regenerated.
* generated/in_unpack_c16.c: Regenerated.
* generated/product_c16.c: Regenerated.
* generated/minval_r8.c: Regenerated.
* generated/minloc0_4_i1.c: Regenerated.
* generated/minloc0_8_r16.c: Regenerated.
* generated/in_unpack_i16.c: Regenerated.
* generated/reshape_c16.c: Regenerated.
* generated/pack_i4.c: Regenerated.
* generated/minval_r10.c: Regenerated.
* generated/maxloc0_4_r10.c: Regenerated.
* generated/unpack_i8.c: Regenerated.
* generated/minloc1_16_r8.c: Regenerated.
* generated/pack_c16.c: Regenerated.
* generated/maxval_r4.c: Regenerated.
* generated/spread_r8.c: Regenerated.
* generated/minloc0_16_r4.c: Regenerated.
* generated/maxval_i4.c: Regenerated.
* generated/matmul_r4.c: Regenerated.
* generated/product_c8.c: Regenerated.
* generated/maxloc1_4_i4.c: Regenerated.
* generated/any_l4.c: Regenerated.
* generated/cshift0_r16.c: Regenerated.
* generated/maxloc1_16_r4.c: Regenerated.
* generated/in_pack_r10.c: Regenerated.
* generated/iall_i1.c: Regenerated.
* generated/product_i1.c: Regenerated.
* generated/maxloc0_4_i1.c: Regenerated.
* generated/maxloc0_8_r16.c: Regenerated.
* generated/minloc1_8_i16.c: Regenerated.
* generated/reshape_c10.c: Regenerated.
* generated/matmul_l4.c: Regenerated.
* generated/cshift0_c16.c: Regenerated.
* generated/spread_r4.c: Regenerated.
* generated/sum_r16.c: Regenerated.
* generated/in_unpack_c4.c: Regenerated.
* generated/maxval_i8.c: Regenerated.
* generated/maxloc0_8_r8.c: Regenerated.
* generated/unpack_i16.c: Regenerated.
* generated/norm2_r4.c: Regenerated.
* generated/maxloc1_4_r16.c: Regenerated.
* generated/in_pack_r4.c: Regenerated.
* generated/sum_c8.c: Regenerated.
* generated/parity_l8.c: Regenerated.
* generated/minval_i2.c: Regenerated.
* generated/transpose_c10.c: Regenerated.
* generated/cshift0_r10.c: Regenerated.
* generated/cshift0_i2.c: Regenerated.
* generated/spread_c4.c: Regenerated.
* generated/maxval_r16.c: Regenerated.
* generated/unpack_c10.c: Regenerated.
* generated/bessel_r4.c: Regenerated.
* generated/minloc0_8_i1.c: Regenerated.
* generated/product_c10.c: Regenerated.
* generated/minloc1_4_i4.c: Regenerated.
* generated/minloc1_4_i2.c: Regenerated.
* generated/transpose_c4.c: Regenerated.
* generated/in_pack_c8.c: Regenerated.
* generated/minval_i8.c: Regenerated.
* generated/maxloc1_4_i2.c: Regenerated.
* generated/maxloc1_4_i1.c: Regenerated.
* generated/iall_i8.c: Regenerated.
* generated/iany_i8.c: Regenerated.
* generated/sum_c16.c: Regenerated.
* generated/spread_i8.c: Regenerated.
* generated/sum_i8.c: Regenerated.
* generated/pack_i2.c: Regenerated.
* generated/unpack_r10.c: Regenerated.
* generated/minloc0_4_i4.c: Regenerated.
* generated/iany_i4.c: Regenerated.
* generated/maxloc0_4_i4.c: Regenerated.
* generated/in_pack_r8.c: Regenerated.
* generated/spread_i1.c: Regenerated.
* generated/maxval_i16.c: Regenerated.
* generated/pack_c8.c: Regenerated.
* generated/iparity_i16.c: Regenerated.
* generated/matmul_c16.c: Regenerated.
* generated/eoshift1_8.c: Regenerated.
* generated/any_l16.c: Regenerated.
* generated/maxloc1_4_i8.c: Regenerated.
* generated/minloc0_8_r4.c: Regenerated.
* generated/transpose_c16.c: Regenerated.
* generated/reshape_c4.c: Regenerated.
* generated/minloc0_8_r8.c: Regenerated.
* generated/count_16_l.c: Regenerated.
* generated/minloc0_16_i1.c: Regenerated.
* generated/minloc1_16_r4.c: Regenerated.
* generated/maxloc0_8_i1.c: Regenerated.
* generated/matmul_i1.c: Regenerated.
* generated/sum_i2.c: Regenerated.
* generated/cshift1_4.c: Regenerated.
* generated/minloc0_4_i2.c: Regenerated.
* generated/bessel_r10.c: Regenerated.
* generated/matmul_c4.c: Regenerated.
* generated/parity_l4.c: Regenerated.
* generated/in_unpack_i2.c: Regenerated.
* generated/product_i16.c: Regenerated.
* generated/maxloc0_16_i4.c: Regenerated.
* generated/minloc0_4_r10.c: Regenerated.
* generated/transpose_i16.c: Regenerated.
* generated/matmul_l16.c: Regenerated.
* generated/any_l1.c: Regenerated.
* generated/minval_r16.c: Regenerated.
* generated/shape_i16.c: Regenerated.
* generated/in_pack_c4.c: Regenerated.
* generated/minloc1_8_r4.c: Regenerated.
* generated/iany_i1.c: Regenerated.
* generated/matmul_i16.c: Regenerated.
* generated/maxloc0_16_r4.c: Regenerated.
* generated/spread_c8.c: Regenerated.
* generated/product_i8.c: Regenerated.
* generated/minloc1_8_i4.c: Regenerated.
* generated/product_i4.c: Regenerated.
* generated/minval_i16.c: Regenerated.
* generated/pack_r8.c: Regenerated.
* generated/matmul_r10.c: Regenerated.
* generated/shape_i8.c: Regenerated.
* generated/eoshift1_4.c: Regenerated.
* generated/minloc1_16_i4.c: Regenerated.
* generated/transpose_r16.c: Regenerated.
* generated/spread_c16.c: Regenerated.
* generated/maxloc0_8_i16.c: Regenerated.
* generated/minval_i1.c: Regenerated.
* generated/sum_i4.c: Regenerated.
* generated/in_pack_r16.c: Regenerated.
* generated/iall_i16.c: Regenerated.
* generated/minloc0_8_r10.c: Regenerated.
* generated/maxloc0_8_i8.c: Regenerated.
* generated/transpose_i4.c: Regenerated.
* generated/maxloc0_4_i2.c: Regenerated.
* generated/iall_i2.c: Regenerated.
* generated/maxloc0_8_r4.c: Regenerated.
* generated/minloc0_4_r16.c: Regenerated.
* generated/minloc1_4_r8.c: Regenerated.
* generated/minloc0_4_i8.c: Regenerated.
* generated/minval_i4.c: Regenerated.
* generated/minloc1_8_i8.c: Regenerated.
* generated/in_pack_i16.c: Regenerated.
* generated/spread_i4.c: Regenerated.
* generated/cshift0_c4.c: Regenerated.
* generated/minloc0_4_i16.c: Regenerated.
* generated/sum_r8.c: Regenerated.
* generated/minloc0_16_i16.c: Regenerated.
* generated/sum_i1.c: Regenerated.
* generated/all_l2.c: Regenerated.
* generated/sum_c4.c: Regenerated.
* generated/shape_i4.c: Regenerated.
* generated/maxval_i1.c: Regenerated.
* generated/norm2_r10.c: Regenerated.
* generated/unpack_c4.c: Regenerated.
* generated/maxloc0_16_i1.c: Regenerated.
* generated/all_l4.c: Regenerated.
* generated/maxloc1_16_i8.c: Regenerated.
* generated/sum_i16.c: Regenerated.
* generated/maxloc1_8_r16.c: Regenerated.
* generated/minloc1_4_r16.c: Regenerated.
* generated/maxloc1_16_r16.c: Regenerated.
* generated/transpose_i8.c: Regenerated.
* generated/minloc0_8_i2.c: Regenerated.
* generated/product_r16.c: Regenerated.
* generated/in_pack_c10.c: Regenerated.
* generated/maxloc0_4_r16.c: Regenerated.
* generated/pack_c4.c: Regenerated.
* generated/bessel_r16.c: Regenerated.
* generated/norm2_r16.c: Regenerated.
* generated/in_unpack_i8.c: Regenerated.
* generated/maxloc1_16_i4.c: Regenerated.
* generated/minloc1_4_i8.c: Regenerated.
* generated/eoshift3_4.c: Regenerated.
* generated/maxloc1_8_r10.c: Regenerated.
* generated/matmul_i8.c: Regenerated.
* generated/matmul_i4.c: Regenerated.
* generated/reshape_i16.c: Regenerated.
* generated/matmul_i2.c: Regenerated.
* generated/transpose_r8.c: Regenerated.
* generated/transpose_r4.c: Regenerated.
* generated/cshift1_16.c: Regenerated.
* generated/maxloc1_4_r10.c: Regenerated.
* generated/iparity_i4.c: Regenerated.
* generated/in_pack_i4.c: Regenerated.
* generated/maxloc0_8_i2.c: Regenerated.
* generated/unpack_r4.c: Regenerated.
* generated/count_4_l.c: Regenerated.
* generated/maxloc1_4_r4.c: Regenerated.
* generated/minloc0_8_i8.c: Regenerated.
* generated/any_l2.c: Regenerated.
* generated/minloc0_8_i4.c: Regenerated.
* generated/pack_i8.c: Regenerated.
* generated/count_2_l.c: Regenerated.
* generated/reshape_c8.c: Regenerated.
* generated/maxval_i2.c: Regenerated.
* generated/minloc0_4_r8.c: Regenerated.
2012-01-20 Tobias Burnus <burnus@net-b.de>
PR libgfortran/51899

8
libgfortran/generated/all_l1.c
View File

@ -83,7 +83,7 @@ all_l1 (gfc_array_l1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ all_l1 (gfc_array_l1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ all_l1 (gfc_array_l1 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ all_l1 (gfc_array_l1 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in ALL intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/all_l16.c
View File

@ -83,7 +83,7 @@ all_l16 (gfc_array_l16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ all_l16 (gfc_array_l16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ all_l16 (gfc_array_l16 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ all_l16 (gfc_array_l16 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in ALL intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/all_l2.c
View File

@ -83,7 +83,7 @@ all_l2 (gfc_array_l2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ all_l2 (gfc_array_l2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ all_l2 (gfc_array_l2 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ all_l2 (gfc_array_l2 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in ALL intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/all_l4.c
View File

@ -83,7 +83,7 @@ all_l4 (gfc_array_l4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ all_l4 (gfc_array_l4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ all_l4 (gfc_array_l4 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ all_l4 (gfc_array_l4 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in ALL intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/all_l8.c
View File

@ -83,7 +83,7 @@ all_l8 (gfc_array_l8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ all_l8 (gfc_array_l8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ all_l8 (gfc_array_l8 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ all_l8 (gfc_array_l8 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in ALL intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/any_l1.c
View File

@ -83,7 +83,7 @@ any_l1 (gfc_array_l1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ any_l1 (gfc_array_l1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ any_l1 (gfc_array_l1 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ any_l1 (gfc_array_l1 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in ANY intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/any_l16.c
View File

@ -83,7 +83,7 @@ any_l16 (gfc_array_l16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ any_l16 (gfc_array_l16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ any_l16 (gfc_array_l16 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ any_l16 (gfc_array_l16 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in ANY intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/any_l2.c
View File

@ -83,7 +83,7 @@ any_l2 (gfc_array_l2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ any_l2 (gfc_array_l2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ any_l2 (gfc_array_l2 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ any_l2 (gfc_array_l2 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in ANY intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/any_l4.c
View File

@ -83,7 +83,7 @@ any_l4 (gfc_array_l4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ any_l4 (gfc_array_l4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ any_l4 (gfc_array_l4 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ any_l4 (gfc_array_l4 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in ANY intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/any_l8.c
View File

@ -83,7 +83,7 @@ any_l8 (gfc_array_l8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ any_l8 (gfc_array_l8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ any_l8 (gfc_array_l8 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ any_l8 (gfc_array_l8 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in ANY intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

39
libgfortran/generated/bessel_r10.c
View File

@ -1,6 +1,6 @@
/* Implementation of the BESSEL_JN and BESSEL_YN transformational
function using a recurrence algorithm.
Copyright 2010 Free Software Foundation, Inc.
Copyright 2010, 2012 Free Software Foundation, Inc.
Contributed by Tobias Burnus <burnus@net-b.de>
This file is part of the GNU Fortran runtime library (libgfortran).
@ -51,11 +51,11 @@ bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2, GFC_REAL_10 x
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
size_t size = n2 < n1 ? 0 : n2-n1+1;
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
ret->data = internal_malloc_size (sizeof (GFC_REAL_10) * size);
ret->base_addr = internal_malloc_size (sizeof (GFC_REAL_10) * size);
ret->offset = 0;
}
@ -72,21 +72,20 @@ bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2, GFC_REAL_10 x
if (unlikely (x == 0))
{
ret->data[0] = 1;
ret->base_addr[0] = 1;
for (i = 1; i <= n2-n1; i++)
ret->data[i*stride] = 0;
ret->base_addr[i*stride] = 0;
return;
}
ret->data = ret->data;
last1 = MATHFUNC(jn) (n2, x);
ret->data[(n2-n1)*stride] = last1;
ret->base_addr[(n2-n1)*stride] = last1;
if (n1 == n2)
return;
last2 = MATHFUNC(jn) (n2 - 1, x);
ret->data[(n2-n1-1)*stride] = last2;
ret->base_addr[(n2-n1-1)*stride] = last2;
if (n1 + 1 == n2)
return;
@ -95,9 +94,9 @@ bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2, GFC_REAL_10 x
for (i = n2-n1-2; i >= 0; i--)
{
ret->data[i*stride] = x2rev * (i+1+n1) * last2 - last1;
ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
last1 = last2;
last2 = ret->data[i*stride];
last2 = ret->base_addr[i*stride];
}
}
@ -119,11 +118,11 @@ bessel_yn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2,
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
size_t size = n2 < n1 ? 0 : n2-n1+1;
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
ret->data = internal_malloc_size (sizeof (GFC_REAL_10) * size);
ret->base_addr = internal_malloc_size (sizeof (GFC_REAL_10) * size);
ret->offset = 0;
}
@ -142,22 +141,22 @@ bessel_yn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2,
{
for (i = 0; i <= n2-n1; i++)
#if defined(GFC_REAL_10_INFINITY)
ret->data[i*stride] = -GFC_REAL_10_INFINITY;
ret->base_addr[i*stride] = -GFC_REAL_10_INFINITY;
#else
ret->data[i*stride] = -GFC_REAL_10_HUGE;
ret->base_addr[i*stride] = -GFC_REAL_10_HUGE;
#endif
return;
}
ret->data = ret->data;
ret->base_addr = ret->base_addr;
last1 = MATHFUNC(yn) (n1, x);
ret->data[0] = last1;
ret->base_addr[0] = last1;
if (n1 == n2)
return;
last2 = MATHFUNC(yn) (n1 + 1, x);
ret->data[1*stride] = last2;
ret->base_addr[1*stride] = last2;
if (n1 + 1 == n2)
return;
@ -169,14 +168,14 @@ bessel_yn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2,
#if defined(GFC_REAL_10_INFINITY)
if (unlikely (last2 == -GFC_REAL_10_INFINITY))
{
ret->data[i*stride] = -GFC_REAL_10_INFINITY;
ret->base_addr[i*stride] = -GFC_REAL_10_INFINITY;
}
else
#endif
{
ret->data[i*stride] = x2rev * (i-1+n1) * last2 - last1;
ret->base_addr[i*stride] = x2rev * (i-1+n1) * last2 - last1;
last1 = last2;
last2 = ret->data[i*stride];
last2 = ret->base_addr[i*stride];
}
}
}

39
libgfortran/generated/bessel_r16.c
View File

@ -1,6 +1,6 @@
/* Implementation of the BESSEL_JN and BESSEL_YN transformational
function using a recurrence algorithm.
Copyright 2010 Free Software Foundation, Inc.
Copyright 2010, 2012 Free Software Foundation, Inc.
Contributed by Tobias Burnus <burnus@net-b.de>
This file is part of the GNU Fortran runtime library (libgfortran).
@ -55,11 +55,11 @@ bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2, GFC_REAL_16 x
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
size_t size = n2 < n1 ? 0 : n2-n1+1;
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
ret->data = internal_malloc_size (sizeof (GFC_REAL_16) * size);
ret->base_addr = internal_malloc_size (sizeof (GFC_REAL_16) * size);
ret->offset = 0;
}
@ -76,21 +76,20 @@ bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2, GFC_REAL_16 x
if (unlikely (x == 0))
{
ret->data[0] = 1;
ret->base_addr[0] = 1;
for (i = 1; i <= n2-n1; i++)
ret->data[i*stride] = 0;
ret->base_addr[i*stride] = 0;
return;
}
ret->data = ret->data;
last1 = MATHFUNC(jn) (n2, x);
ret->data[(n2-n1)*stride] = last1;
ret->base_addr[(n2-n1)*stride] = last1;
if (n1 == n2)
return;
last2 = MATHFUNC(jn) (n2 - 1, x);
ret->data[(n2-n1-1)*stride] = last2;
ret->base_addr[(n2-n1-1)*stride] = last2;
if (n1 + 1 == n2)
return;
@ -99,9 +98,9 @@ bessel_jn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2, GFC_REAL_16 x
for (i = n2-n1-2; i >= 0; i--)
{
ret->data[i*stride] = x2rev * (i+1+n1) * last2 - last1;
ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
last1 = last2;
last2 = ret->data[i*stride];
last2 = ret->base_addr[i*stride];
}
}
@ -123,11 +122,11 @@ bessel_yn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2,
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
size_t size = n2 < n1 ? 0 : n2-n1+1;
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
ret->data = internal_malloc_size (sizeof (GFC_REAL_16) * size);
ret->base_addr = internal_malloc_size (sizeof (GFC_REAL_16) * size);
ret->offset = 0;
}
@ -146,22 +145,22 @@ bessel_yn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2,
{
for (i = 0; i <= n2-n1; i++)
#if defined(GFC_REAL_16_INFINITY)
ret->data[i*stride] = -GFC_REAL_16_INFINITY;
ret->base_addr[i*stride] = -GFC_REAL_16_INFINITY;
#else
ret->data[i*stride] = -GFC_REAL_16_HUGE;
ret->base_addr[i*stride] = -GFC_REAL_16_HUGE;
#endif
return;
}
ret->data = ret->data;
ret->base_addr = ret->base_addr;
last1 = MATHFUNC(yn) (n1, x);
ret->data[0] = last1;
ret->base_addr[0] = last1;
if (n1 == n2)
return;
last2 = MATHFUNC(yn) (n1 + 1, x);
ret->data[1*stride] = last2;
ret->base_addr[1*stride] = last2;
if (n1 + 1 == n2)
return;
@ -173,14 +172,14 @@ bessel_yn_r16 (gfc_array_r16 * const restrict ret, int n1, int n2,
#if defined(GFC_REAL_16_INFINITY)
if (unlikely (last2 == -GFC_REAL_16_INFINITY))
{
ret->data[i*stride] = -GFC_REAL_16_INFINITY;
ret->base_addr[i*stride] = -GFC_REAL_16_INFINITY;
}
else
#endif
{
ret->data[i*stride] = x2rev * (i-1+n1) * last2 - last1;
ret->base_addr[i*stride] = x2rev * (i-1+n1) * last2 - last1;
last1 = last2;
last2 = ret->data[i*stride];
last2 = ret->base_addr[i*stride];
}
}
}

39
libgfortran/generated/bessel_r4.c
View File

@ -1,6 +1,6 @@
/* Implementation of the BESSEL_JN and BESSEL_YN transformational
function using a recurrence algorithm.
Copyright 2010 Free Software Foundation, Inc.
Copyright 2010, 2012 Free Software Foundation, Inc.
Contributed by Tobias Burnus <burnus@net-b.de>
This file is part of the GNU Fortran runtime library (libgfortran).
@ -51,11 +51,11 @@ bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2, GFC_REAL_4 x)
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
size_t size = n2 < n1 ? 0 : n2-n1+1;
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
ret->data = internal_malloc_size (sizeof (GFC_REAL_4) * size);
ret->base_addr = internal_malloc_size (sizeof (GFC_REAL_4) * size);
ret->offset = 0;
}
@ -72,21 +72,20 @@ bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2, GFC_REAL_4 x)
if (unlikely (x == 0))
{
ret->data[0] = 1;
ret->base_addr[0] = 1;
for (i = 1; i <= n2-n1; i++)
ret->data[i*stride] = 0;
ret->base_addr[i*stride] = 0;
return;
}
ret->data = ret->data;
last1 = MATHFUNC(jn) (n2, x);
ret->data[(n2-n1)*stride] = last1;
ret->base_addr[(n2-n1)*stride] = last1;
if (n1 == n2)
return;
last2 = MATHFUNC(jn) (n2 - 1, x);
ret->data[(n2-n1-1)*stride] = last2;
ret->base_addr[(n2-n1-1)*stride] = last2;
if (n1 + 1 == n2)
return;
@ -95,9 +94,9 @@ bessel_jn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2, GFC_REAL_4 x)
for (i = n2-n1-2; i >= 0; i--)
{
ret->data[i*stride] = x2rev * (i+1+n1) * last2 - last1;
ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
last1 = last2;
last2 = ret->data[i*stride];
last2 = ret->base_addr[i*stride];
}
}
@ -119,11 +118,11 @@ bessel_yn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2,
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
size_t size = n2 < n1 ? 0 : n2-n1+1;
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
ret->data = internal_malloc_size (sizeof (GFC_REAL_4) * size);
ret->base_addr = internal_malloc_size (sizeof (GFC_REAL_4) * size);
ret->offset = 0;
}
@ -142,22 +141,22 @@ bessel_yn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2,
{
for (i = 0; i <= n2-n1; i++)
#if defined(GFC_REAL_4_INFINITY)
ret->data[i*stride] = -GFC_REAL_4_INFINITY;
ret->base_addr[i*stride] = -GFC_REAL_4_INFINITY;
#else
ret->data[i*stride] = -GFC_REAL_4_HUGE;
ret->base_addr[i*stride] = -GFC_REAL_4_HUGE;
#endif
return;
}
ret->data = ret->data;
ret->base_addr = ret->base_addr;
last1 = MATHFUNC(yn) (n1, x);
ret->data[0] = last1;
ret->base_addr[0] = last1;
if (n1 == n2)
return;
last2 = MATHFUNC(yn) (n1 + 1, x);
ret->data[1*stride] = last2;
ret->base_addr[1*stride] = last2;
if (n1 + 1 == n2)
return;
@ -169,14 +168,14 @@ bessel_yn_r4 (gfc_array_r4 * const restrict ret, int n1, int n2,
#if defined(GFC_REAL_4_INFINITY)
if (unlikely (last2 == -GFC_REAL_4_INFINITY))
{
ret->data[i*stride] = -GFC_REAL_4_INFINITY;
ret->base_addr[i*stride] = -GFC_REAL_4_INFINITY;
}
else
#endif
{
ret->data[i*stride] = x2rev * (i-1+n1) * last2 - last1;
ret->base_addr[i*stride] = x2rev * (i-1+n1) * last2 - last1;
last1 = last2;
last2 = ret->data[i*stride];
last2 = ret->base_addr[i*stride];
}
}
}

39
libgfortran/generated/bessel_r8.c
View File

@ -1,6 +1,6 @@
/* Implementation of the BESSEL_JN and BESSEL_YN transformational
function using a recurrence algorithm.
Copyright 2010 Free Software Foundation, Inc.
Copyright 2010, 2012 Free Software Foundation, Inc.
Contributed by Tobias Burnus <burnus@net-b.de>
This file is part of the GNU Fortran runtime library (libgfortran).
@ -51,11 +51,11 @@ bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2, GFC_REAL_8 x)
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
size_t size = n2 < n1 ? 0 : n2-n1+1;
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
ret->data = internal_malloc_size (sizeof (GFC_REAL_8) * size);
ret->base_addr = internal_malloc_size (sizeof (GFC_REAL_8) * size);
ret->offset = 0;
}
@ -72,21 +72,20 @@ bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2, GFC_REAL_8 x)
if (unlikely (x == 0))
{
ret->data[0] = 1;
ret->base_addr[0] = 1;
for (i = 1; i <= n2-n1; i++)
ret->data[i*stride] = 0;
ret->base_addr[i*stride] = 0;
return;
}
ret->data = ret->data;
last1 = MATHFUNC(jn) (n2, x);
ret->data[(n2-n1)*stride] = last1;
ret->base_addr[(n2-n1)*stride] = last1;
if (n1 == n2)
return;
last2 = MATHFUNC(jn) (n2 - 1, x);
ret->data[(n2-n1-1)*stride] = last2;
ret->base_addr[(n2-n1-1)*stride] = last2;
if (n1 + 1 == n2)
return;
@ -95,9 +94,9 @@ bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2, GFC_REAL_8 x)
for (i = n2-n1-2; i >= 0; i--)
{
ret->data[i*stride] = x2rev * (i+1+n1) * last2 - last1;
ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
last1 = last2;
last2 = ret->data[i*stride];
last2 = ret->base_addr[i*stride];
}
}
@ -119,11 +118,11 @@ bessel_yn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2,
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
size_t size = n2 < n1 ? 0 : n2-n1+1;
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
ret->data = internal_malloc_size (sizeof (GFC_REAL_8) * size);
ret->base_addr = internal_malloc_size (sizeof (GFC_REAL_8) * size);
ret->offset = 0;
}
@ -142,22 +141,22 @@ bessel_yn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2,
{
for (i = 0; i <= n2-n1; i++)
#if defined(GFC_REAL_8_INFINITY)
ret->data[i*stride] = -GFC_REAL_8_INFINITY;
ret->base_addr[i*stride] = -GFC_REAL_8_INFINITY;
#else
ret->data[i*stride] = -GFC_REAL_8_HUGE;
ret->base_addr[i*stride] = -GFC_REAL_8_HUGE;
#endif
return;
}
ret->data = ret->data;
ret->base_addr = ret->base_addr;
last1 = MATHFUNC(yn) (n1, x);
ret->data[0] = last1;
ret->base_addr[0] = last1;
if (n1 == n2)
return;
last2 = MATHFUNC(yn) (n1 + 1, x);
ret->data[1*stride] = last2;
ret->base_addr[1*stride] = last2;
if (n1 + 1 == n2)
return;
@ -169,14 +168,14 @@ bessel_yn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2,
#if defined(GFC_REAL_8_INFINITY)
if (unlikely (last2 == -GFC_REAL_8_INFINITY))
{
ret->data[i*stride] = -GFC_REAL_8_INFINITY;
ret->base_addr[i*stride] = -GFC_REAL_8_INFINITY;
}
else
#endif
{
ret->data[i*stride] = x2rev * (i-1+n1) * last2 - last1;
ret->base_addr[i*stride] = x2rev * (i-1+n1) * last2 - last1;
last1 = last2;
last2 = ret->data[i*stride];
last2 = ret->base_addr[i*stride];
}
}
}

8
libgfortran/generated/count_16_l.c
View File

@ -83,7 +83,7 @@ count_16_l (gfc_array_i16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ count_16_l (gfc_array_i16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ count_16_l (gfc_array_i16 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ count_16_l (gfc_array_i16 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in COUNT intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/count_1_l.c
View File

@ -83,7 +83,7 @@ count_1_l (gfc_array_i1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ count_1_l (gfc_array_i1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ count_1_l (gfc_array_i1 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ count_1_l (gfc_array_i1 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in COUNT intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/count_2_l.c
View File

@ -83,7 +83,7 @@ count_2_l (gfc_array_i2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ count_2_l (gfc_array_i2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ count_2_l (gfc_array_i2 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ count_2_l (gfc_array_i2 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in COUNT intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/count_4_l.c
View File

@ -83,7 +83,7 @@ count_4_l (gfc_array_i4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ count_4_l (gfc_array_i4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ count_4_l (gfc_array_i4 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ count_4_l (gfc_array_i4 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in COUNT intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/count_8_l.c
View File

@ -83,7 +83,7 @@ count_8_l (gfc_array_i8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -111,7 +111,7 @@ count_8_l (gfc_array_i8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -145,7 +145,7 @@ count_8_l (gfc_array_i8 * const restrict retarray,
return;
}
base = array->data;
base = array->base_addr;
if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -159,7 +159,7 @@ count_8_l (gfc_array_i8 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array in COUNT intrinsic");
dest = retarray->data;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)

8
libgfortran/generated/cshift0_c10.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_c10 (gfc_array_c10 *ret, const gfc_array_c10 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_c16.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_c16 (gfc_array_c16 *ret, const gfc_array_c16 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_c4.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_c4 (gfc_array_c4 *ret, const gfc_array_c4 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_c8.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_c8 (gfc_array_c8 *ret, const gfc_array_c8 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_i1.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_i1 (gfc_array_i1 *ret, const gfc_array_i1 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_i16.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_i16 (gfc_array_i16 *ret, const gfc_array_i16 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_i2.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_i2 (gfc_array_i2 *ret, const gfc_array_i2 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_i4.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_i4 (gfc_array_i4 *ret, const gfc_array_i4 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_i8.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_i8 (gfc_array_i8 *ret, const gfc_array_i8 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_r10.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_r10 (gfc_array_r10 *ret, const gfc_array_r10 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_r16.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_r16 (gfc_array_r16 *ret, const gfc_array_r16 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_r4.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_r4 (gfc_array_r4 *ret, const gfc_array_r4 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

8
libgfortran/generated/cshift0_r8.c
View File

@ -1,8 +1,8 @@
/* Helper function for cshift functions.
Copyright 2008, 2009 Free Software Foundation, Inc.
Copyright 2008, 2009, 2012 Free Software Foundation, Inc.
Contributed by Thomas Koenig <tkoenig@gcc.gnu.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -94,8 +94,8 @@ cshift0_r8 (gfc_array_r8 *ret, const gfc_array_r8 *array, ptrdiff_t shift,
dim = GFC_DESCRIPTOR_RANK (array);
rstride0 = rstride[0];
sstride0 = sstride[0];
rptr = ret->data;
sptr = array->data;
rptr = ret->base_addr;
sptr = array->base_addr;
shift = len == 0 ? 0 : shift % (ptrdiff_t)len;
if (shift < 0)

14
libgfortran/generated/cshift1_16.c
View File

@ -1,8 +1,8 @@
/* Implementation of the CSHIFT intrinsic
Copyright 2003, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Feng Wang <wf_cs@yahoo.com>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -76,11 +76,11 @@ cshift1 (gfc_array_char * const restrict ret,
arraysize = size0 ((array_t *)array);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
int i;
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
ret->offset = 0;
ret->dtype = array->dtype;
for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
@ -156,9 +156,9 @@ cshift1 (gfc_array_char * const restrict ret,
rstride0 = rstride[0];
sstride0 = sstride[0];
hstride0 = hstride[0];
rptr = ret->data;
sptr = array->data;
hptr = h->data;
rptr = ret->base_addr;
sptr = array->base_addr;
hptr = h->base_addr;
while (rptr)
{

14
libgfortran/generated/cshift1_4.c
View File

@ -1,8 +1,8 @@
/* Implementation of the CSHIFT intrinsic
Copyright 2003, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Feng Wang <wf_cs@yahoo.com>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -76,11 +76,11 @@ cshift1 (gfc_array_char * const restrict ret,
arraysize = size0 ((array_t *)array);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
int i;
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
ret->offset = 0;
ret->dtype = array->dtype;
for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
@ -156,9 +156,9 @@ cshift1 (gfc_array_char * const restrict ret,
rstride0 = rstride[0];
sstride0 = sstride[0];
hstride0 = hstride[0];
rptr = ret->data;
sptr = array->data;
hptr = h->data;
rptr = ret->base_addr;
sptr = array->base_addr;
hptr = h->base_addr;
while (rptr)
{

14
libgfortran/generated/cshift1_8.c
View File

@ -1,8 +1,8 @@
/* Implementation of the CSHIFT intrinsic
Copyright 2003, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Feng Wang <wf_cs@yahoo.com>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -76,11 +76,11 @@ cshift1 (gfc_array_char * const restrict ret,
arraysize = size0 ((array_t *)array);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
int i;
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
ret->offset = 0;
ret->dtype = array->dtype;
for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
@ -156,9 +156,9 @@ cshift1 (gfc_array_char * const restrict ret,
rstride0 = rstride[0];
sstride0 = sstride[0];
hstride0 = hstride[0];
rptr = ret->data;
sptr = array->data;
hptr = h->data;
rptr = ret->base_addr;
sptr = array->base_addr;
hptr = h->base_addr;
while (rptr)
{

14
libgfortran/generated/eoshift1_16.c
View File

@ -1,8 +1,8 @@
/* Implementation of the EOSHIFT intrinsic
Copyright 2002, 2005, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -84,7 +84,7 @@ eoshift1 (gfc_array_char * const restrict ret,
count[0] = 0;
arraysize = size0 ((array_t *) array);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
int i;
@ -106,7 +106,7 @@ eoshift1 (gfc_array_char * const restrict ret,
}
/* internal_malloc_size allocates a single byte for zero size. */
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
}
else if (unlikely (compile_options.bounds_check))
@ -159,9 +159,9 @@ eoshift1 (gfc_array_char * const restrict ret,
rstride0 = rstride[0];
sstride0 = sstride[0];
hstride0 = hstride[0];
rptr = ret->data;
sptr = array->data;
hptr = h->data;
rptr = ret->base_addr;
sptr = array->base_addr;
hptr = h->base_addr;
while (rptr)
{

14
libgfortran/generated/eoshift1_4.c
View File

@ -1,8 +1,8 @@
/* Implementation of the EOSHIFT intrinsic
Copyright 2002, 2005, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -84,7 +84,7 @@ eoshift1 (gfc_array_char * const restrict ret,
count[0] = 0;
arraysize = size0 ((array_t *) array);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
int i;
@ -106,7 +106,7 @@ eoshift1 (gfc_array_char * const restrict ret,
}
/* internal_malloc_size allocates a single byte for zero size. */
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
}
else if (unlikely (compile_options.bounds_check))
@ -159,9 +159,9 @@ eoshift1 (gfc_array_char * const restrict ret,
rstride0 = rstride[0];
sstride0 = sstride[0];
hstride0 = hstride[0];
rptr = ret->data;
sptr = array->data;
hptr = h->data;
rptr = ret->base_addr;
sptr = array->base_addr;
hptr = h->base_addr;
while (rptr)
{

14
libgfortran/generated/eoshift1_8.c
View File

@ -1,8 +1,8 @@
/* Implementation of the EOSHIFT intrinsic
Copyright 2002, 2005, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -84,7 +84,7 @@ eoshift1 (gfc_array_char * const restrict ret,
count[0] = 0;
arraysize = size0 ((array_t *) array);
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
int i;
@ -106,7 +106,7 @@ eoshift1 (gfc_array_char * const restrict ret,
}
/* internal_malloc_size allocates a single byte for zero size. */
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
}
else if (unlikely (compile_options.bounds_check))
@ -159,9 +159,9 @@ eoshift1 (gfc_array_char * const restrict ret,
rstride0 = rstride[0];
sstride0 = sstride[0];
hstride0 = hstride[0];
rptr = ret->data;
sptr = array->data;
hptr = h->data;
rptr = ret->base_addr;
sptr = array->base_addr;
hptr = h->base_addr;
while (rptr)
{

18
libgfortran/generated/eoshift3_16.c
View File

@ -1,8 +1,8 @@
/* Implementation of the EOSHIFT intrinsic
Copyright 2002, 2005, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -85,11 +85,11 @@ eoshift3 (gfc_array_char * const restrict ret,
else
which = 0;
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
int i;
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
ret->offset = 0;
ret->dtype = array->dtype;
for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
@ -108,7 +108,7 @@ eoshift3 (gfc_array_char * const restrict ret,
}
/* internal_malloc_size allocates a single byte for zero size. */
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
}
else if (unlikely (compile_options.bounds_check))
@ -170,11 +170,11 @@ eoshift3 (gfc_array_char * const restrict ret,
sstride0 = sstride[0];
hstride0 = hstride[0];
bstride0 = bstride[0];
rptr = ret->data;
sptr = array->data;
hptr = h->data;
rptr = ret->base_addr;
sptr = array->base_addr;
hptr = h->base_addr;
if (bound)
bptr = bound->data;
bptr = bound->base_addr;
else
bptr = NULL;

18
libgfortran/generated/eoshift3_4.c
View File

@ -1,8 +1,8 @@
/* Implementation of the EOSHIFT intrinsic
Copyright 2002, 2005, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -85,11 +85,11 @@ eoshift3 (gfc_array_char * const restrict ret,
else
which = 0;
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
int i;
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
ret->offset = 0;
ret->dtype = array->dtype;
for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
@ -108,7 +108,7 @@ eoshift3 (gfc_array_char * const restrict ret,
}
/* internal_malloc_size allocates a single byte for zero size. */
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
}
else if (unlikely (compile_options.bounds_check))
@ -170,11 +170,11 @@ eoshift3 (gfc_array_char * const restrict ret,
sstride0 = sstride[0];
hstride0 = hstride[0];
bstride0 = bstride[0];
rptr = ret->data;
sptr = array->data;
hptr = h->data;
rptr = ret->base_addr;
sptr = array->base_addr;
hptr = h->base_addr;
if (bound)
bptr = bound->data;
bptr = bound->base_addr;
else
bptr = NULL;

18
libgfortran/generated/eoshift3_8.c
View File

@ -1,8 +1,8 @@
/* Implementation of the EOSHIFT intrinsic
Copyright 2002, 2005, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -85,11 +85,11 @@ eoshift3 (gfc_array_char * const restrict ret,
else
which = 0;
if (ret->data == NULL)
if (ret->base_addr == NULL)
{
int i;
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
ret->offset = 0;
ret->dtype = array->dtype;
for (i = 0; i < GFC_DESCRIPTOR_RANK (array); i++)
@ -108,7 +108,7 @@ eoshift3 (gfc_array_char * const restrict ret,
}
/* internal_malloc_size allocates a single byte for zero size. */
ret->data = internal_malloc_size (size * arraysize);
ret->base_addr = internal_malloc_size (size * arraysize);
}
else if (unlikely (compile_options.bounds_check))
@ -170,11 +170,11 @@ eoshift3 (gfc_array_char * const restrict ret,
sstride0 = sstride[0];
hstride0 = hstride[0];
bstride0 = bstride[0];
rptr = ret->data;
sptr = array->data;
hptr = h->data;
rptr = ret->base_addr;
sptr = array->base_addr;
hptr = h->base_addr;
if (bound)
bptr = bound->data;
bptr = bound->base_addr;
else
bptr = NULL;

25
libgfortran/generated/iall_i1.c
View File

@ -79,7 +79,7 @@ iall_i1 (gfc_array_i1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iall_i1 (gfc_array_i1 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_1) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iall_i1 (gfc_array_i1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iall_i1 (gfc_array_i1 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miall_i1 (gfc_array_i1 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miall_i1 (gfc_array_i1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miall_i1 (gfc_array_i1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miall_i1 (gfc_array_i1 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siall_i1 (gfc_array_i1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siall_i1 (gfc_array_i1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siall_i1 (gfc_array_i1 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iall_i16.c
View File

@ -79,7 +79,7 @@ iall_i16 (gfc_array_i16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iall_i16 (gfc_array_i16 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_16) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iall_i16 (gfc_array_i16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iall_i16 (gfc_array_i16 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miall_i16 (gfc_array_i16 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miall_i16 (gfc_array_i16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miall_i16 (gfc_array_i16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miall_i16 (gfc_array_i16 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siall_i16 (gfc_array_i16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siall_i16 (gfc_array_i16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siall_i16 (gfc_array_i16 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iall_i2.c
View File

@ -79,7 +79,7 @@ iall_i2 (gfc_array_i2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iall_i2 (gfc_array_i2 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_2) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iall_i2 (gfc_array_i2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iall_i2 (gfc_array_i2 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miall_i2 (gfc_array_i2 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miall_i2 (gfc_array_i2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miall_i2 (gfc_array_i2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miall_i2 (gfc_array_i2 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siall_i2 (gfc_array_i2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siall_i2 (gfc_array_i2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siall_i2 (gfc_array_i2 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iall_i4.c
View File

@ -79,7 +79,7 @@ iall_i4 (gfc_array_i4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iall_i4 (gfc_array_i4 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_4) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iall_i4 (gfc_array_i4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iall_i4 (gfc_array_i4 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miall_i4 (gfc_array_i4 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miall_i4 (gfc_array_i4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miall_i4 (gfc_array_i4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miall_i4 (gfc_array_i4 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siall_i4 (gfc_array_i4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siall_i4 (gfc_array_i4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siall_i4 (gfc_array_i4 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iall_i8.c
View File

@ -79,7 +79,7 @@ iall_i8 (gfc_array_i8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iall_i8 (gfc_array_i8 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_8) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iall_i8 (gfc_array_i8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iall_i8 (gfc_array_i8 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miall_i8 (gfc_array_i8 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miall_i8 (gfc_array_i8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miall_i8 (gfc_array_i8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miall_i8 (gfc_array_i8 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siall_i8 (gfc_array_i8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siall_i8 (gfc_array_i8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siall_i8 (gfc_array_i8 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iany_i1.c
View File

@ -79,7 +79,7 @@ iany_i1 (gfc_array_i1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iany_i1 (gfc_array_i1 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_1) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iany_i1 (gfc_array_i1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iany_i1 (gfc_array_i1 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miany_i1 (gfc_array_i1 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miany_i1 (gfc_array_i1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miany_i1 (gfc_array_i1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miany_i1 (gfc_array_i1 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siany_i1 (gfc_array_i1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siany_i1 (gfc_array_i1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siany_i1 (gfc_array_i1 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iany_i16.c
View File

@ -79,7 +79,7 @@ iany_i16 (gfc_array_i16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iany_i16 (gfc_array_i16 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_16) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iany_i16 (gfc_array_i16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iany_i16 (gfc_array_i16 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miany_i16 (gfc_array_i16 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miany_i16 (gfc_array_i16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miany_i16 (gfc_array_i16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miany_i16 (gfc_array_i16 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siany_i16 (gfc_array_i16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siany_i16 (gfc_array_i16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siany_i16 (gfc_array_i16 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iany_i2.c
View File

@ -79,7 +79,7 @@ iany_i2 (gfc_array_i2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iany_i2 (gfc_array_i2 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_2) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iany_i2 (gfc_array_i2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iany_i2 (gfc_array_i2 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miany_i2 (gfc_array_i2 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miany_i2 (gfc_array_i2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miany_i2 (gfc_array_i2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miany_i2 (gfc_array_i2 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siany_i2 (gfc_array_i2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siany_i2 (gfc_array_i2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siany_i2 (gfc_array_i2 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iany_i4.c
View File

@ -79,7 +79,7 @@ iany_i4 (gfc_array_i4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iany_i4 (gfc_array_i4 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_4) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iany_i4 (gfc_array_i4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iany_i4 (gfc_array_i4 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miany_i4 (gfc_array_i4 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miany_i4 (gfc_array_i4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miany_i4 (gfc_array_i4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miany_i4 (gfc_array_i4 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siany_i4 (gfc_array_i4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siany_i4 (gfc_array_i4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siany_i4 (gfc_array_i4 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iany_i8.c
View File

@ -79,7 +79,7 @@ iany_i8 (gfc_array_i8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iany_i8 (gfc_array_i8 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_8) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iany_i8 (gfc_array_i8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iany_i8 (gfc_array_i8 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miany_i8 (gfc_array_i8 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miany_i8 (gfc_array_i8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miany_i8 (gfc_array_i8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miany_i8 (gfc_array_i8 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siany_i8 (gfc_array_i8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siany_i8 (gfc_array_i8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siany_i8 (gfc_array_i8 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

8
libgfortran/generated/in_pack_c10.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_c10 (gfc_array_c10 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_COMPLEX_10 *)internal_malloc_size (ssize * sizeof (GFC_COMPLEX_10));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_c16.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_c16 (gfc_array_c16 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_COMPLEX_16 *)internal_malloc_size (ssize * sizeof (GFC_COMPLEX_16));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_c4.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_c4 (gfc_array_c4 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_COMPLEX_4 *)internal_malloc_size (ssize * sizeof (GFC_COMPLEX_4));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_c8.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_c8 (gfc_array_c8 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_COMPLEX_8 *)internal_malloc_size (ssize * sizeof (GFC_COMPLEX_8));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_i1.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_1 (gfc_array_i1 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_INTEGER_1 *)internal_malloc_size (ssize * sizeof (GFC_INTEGER_1));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_i16.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_16 (gfc_array_i16 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_INTEGER_16 *)internal_malloc_size (ssize * sizeof (GFC_INTEGER_16));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_i2.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_2 (gfc_array_i2 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_INTEGER_2 *)internal_malloc_size (ssize * sizeof (GFC_INTEGER_2));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_i4.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_4 (gfc_array_i4 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_INTEGER_4 *)internal_malloc_size (ssize * sizeof (GFC_INTEGER_4));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_i8.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_8 (gfc_array_i8 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_INTEGER_8 *)internal_malloc_size (ssize * sizeof (GFC_INTEGER_8));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_r10.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_r10 (gfc_array_r10 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_REAL_10 *)internal_malloc_size (ssize * sizeof (GFC_REAL_10));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_r16.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_r16 (gfc_array_r16 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_REAL_16 *)internal_malloc_size (ssize * sizeof (GFC_REAL_16));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_r4.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_r4 (gfc_array_r4 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_REAL_4 *)internal_malloc_size (ssize * sizeof (GFC_REAL_4));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

8
libgfortran/generated/in_pack_r8.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -73,12 +73,12 @@ internal_pack_r8 (gfc_array_r8 * source)
}
if (packed)
return source->data;
return source->base_addr;
/* Allocate storage for the destination. */
destptr = (GFC_REAL_8 *)internal_malloc_size (ssize * sizeof (GFC_REAL_8));
dest = destptr;
src = source->data;
src = source->base_addr;
stride0 = stride[0];

6
libgfortran/generated/in_unpack_c10.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_c10 (gfc_array_c10 * d, const GFC_COMPLEX_10 * src)
GFC_COMPLEX_10 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_c16.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_c16 (gfc_array_c16 * d, const GFC_COMPLEX_16 * src)
GFC_COMPLEX_16 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_c4.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_c4 (gfc_array_c4 * d, const GFC_COMPLEX_4 * src)
GFC_COMPLEX_4 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_c8.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_c8 (gfc_array_c8 * d, const GFC_COMPLEX_8 * src)
GFC_COMPLEX_8 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_i1.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_1 (gfc_array_i1 * d, const GFC_INTEGER_1 * src)
GFC_INTEGER_1 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_i16.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_16 (gfc_array_i16 * d, const GFC_INTEGER_16 * src)
GFC_INTEGER_16 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_i2.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_2 (gfc_array_i2 * d, const GFC_INTEGER_2 * src)
GFC_INTEGER_2 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_i4.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_4 (gfc_array_i4 * d, const GFC_INTEGER_4 * src)
GFC_INTEGER_4 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_i8.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_8 (gfc_array_i8 * d, const GFC_INTEGER_8 * src)
GFC_INTEGER_8 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_r10.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_r10 (gfc_array_r10 * d, const GFC_REAL_10 * src)
GFC_REAL_10 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_r16.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_r16 (gfc_array_r16 * d, const GFC_REAL_16 * src)
GFC_REAL_16 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_r4.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_r4 (gfc_array_r4 * d, const GFC_REAL_4 * src)
GFC_REAL_4 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

6
libgfortran/generated/in_unpack_r8.c
View File

@ -1,8 +1,8 @@
/* Helper function for repacking arrays.
Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -43,7 +43,7 @@ internal_unpack_r8 (gfc_array_r8 * d, const GFC_REAL_8 * src)
GFC_REAL_8 * restrict dest;
int n;
dest = d->data;
dest = d->base_addr;
if (src == dest || !src)
return;

25
libgfortran/generated/iparity_i1.c
View File

@ -79,7 +79,7 @@ iparity_i1 (gfc_array_i1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iparity_i1 (gfc_array_i1 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_1) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iparity_i1 (gfc_array_i1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iparity_i1 (gfc_array_i1 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miparity_i1 (gfc_array_i1 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miparity_i1 (gfc_array_i1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miparity_i1 (gfc_array_i1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miparity_i1 (gfc_array_i1 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siparity_i1 (gfc_array_i1 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siparity_i1 (gfc_array_i1 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siparity_i1 (gfc_array_i1 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iparity_i16.c
View File

@ -79,7 +79,7 @@ iparity_i16 (gfc_array_i16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iparity_i16 (gfc_array_i16 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_16) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iparity_i16 (gfc_array_i16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iparity_i16 (gfc_array_i16 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miparity_i16 (gfc_array_i16 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miparity_i16 (gfc_array_i16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miparity_i16 (gfc_array_i16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miparity_i16 (gfc_array_i16 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siparity_i16 (gfc_array_i16 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siparity_i16 (gfc_array_i16 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siparity_i16 (gfc_array_i16 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iparity_i2.c
View File

@ -79,7 +79,7 @@ iparity_i2 (gfc_array_i2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iparity_i2 (gfc_array_i2 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_2) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iparity_i2 (gfc_array_i2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iparity_i2 (gfc_array_i2 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miparity_i2 (gfc_array_i2 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miparity_i2 (gfc_array_i2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miparity_i2 (gfc_array_i2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miparity_i2 (gfc_array_i2 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siparity_i2 (gfc_array_i2 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siparity_i2 (gfc_array_i2 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siparity_i2 (gfc_array_i2 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iparity_i4.c
View File

@ -79,7 +79,7 @@ iparity_i4 (gfc_array_i4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iparity_i4 (gfc_array_i4 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_4) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iparity_i4 (gfc_array_i4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iparity_i4 (gfc_array_i4 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miparity_i4 (gfc_array_i4 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miparity_i4 (gfc_array_i4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miparity_i4 (gfc_array_i4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miparity_i4 (gfc_array_i4 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siparity_i4 (gfc_array_i4 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siparity_i4 (gfc_array_i4 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siparity_i4 (gfc_array_i4 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

25
libgfortran/generated/iparity_i8.c
View File

@ -79,7 +79,7 @@ iparity_i8 (gfc_array_i8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -100,6 +100,7 @@ iparity_i8 (gfc_array_i8 * const restrict retarray,
alloc_size = sizeof (GFC_INTEGER_8) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
* extent[rank-1];
retarray->base_addr = internal_malloc_size (alloc_size);
if (alloc_size == 0)
{
/* Make sure we have a zero-sized array. */
@ -107,8 +108,6 @@ iparity_i8 (gfc_array_i8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
}
else
{
@ -131,8 +130,8 @@ iparity_i8 (gfc_array_i8 * const restrict retarray,
return;
}
base = array->data;
dest = retarray->data;
base = array->base_addr;
dest = retarray->base_addr;
continue_loop = 1;
while (continue_loop)
@ -222,7 +221,7 @@ miparity_i8 (gfc_array_i8 * const restrict retarray,
if (len <= 0)
return;
mbase = mask->data;
mbase = mask->base_addr;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
@ -258,7 +257,7 @@ miparity_i8 (gfc_array_i8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -286,7 +285,7 @@ miparity_i8 (gfc_array_i8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
@ -311,8 +310,8 @@ miparity_i8 (gfc_array_i8 * const restrict retarray,
return;
}
dest = retarray->data;
base = array->data;
dest = retarray->base_addr;
base = array->base_addr;
while (base)
{
@ -418,7 +417,7 @@ siparity_i8 (gfc_array_i8 * const restrict retarray,
extent[n] = 0;
}
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
size_t alloc_size, str;
@ -446,7 +445,7 @@ siparity_i8 (gfc_array_i8 * const restrict retarray,
return;
}
else
retarray->data = internal_malloc_size (alloc_size);
retarray->base_addr = internal_malloc_size (alloc_size);
}
else
{
@ -478,7 +477,7 @@ siparity_i8 (gfc_array_i8 * const restrict retarray,
dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
}
dest = retarray->data;
dest = retarray->base_addr;
while(1)
{

14
libgfortran/generated/matmul_c10.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_c10 (gfc_array_c10 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_c10 (gfc_array_c10 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_COMPLEX_10) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_c10 (gfc_array_c10 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_c16.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_c16 (gfc_array_c16 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_c16 (gfc_array_c16 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_COMPLEX_16) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_c16 (gfc_array_c16 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_c4.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_c4 (gfc_array_c4 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_c4 (gfc_array_c4 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_COMPLEX_4) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_c4 (gfc_array_c4 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_c8.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_c8 (gfc_array_c8 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_c8 (gfc_array_c8 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_COMPLEX_8) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_c8 (gfc_array_c8 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_i1.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_i1 (gfc_array_i1 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_i1 (gfc_array_i1 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_INTEGER_1) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_i1 (gfc_array_i1 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_i16.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_i16 (gfc_array_i16 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_i16 (gfc_array_i16 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_INTEGER_16) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_i16 (gfc_array_i16 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_i2.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_i2 (gfc_array_i2 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_i2 (gfc_array_i2 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_INTEGER_2) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_i2 (gfc_array_i2 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_i4.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_i4 (gfc_array_i4 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_i4 (gfc_array_i4 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_INTEGER_4) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_i4 (gfc_array_i4 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_i8.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_i8 (gfc_array_i8 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_i8 (gfc_array_i8 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_INTEGER_8) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_i8 (gfc_array_i8 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_l16.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -65,7 +65,7 @@ matmul_l16 (gfc_array_l16 * const restrict retarray,
assert (GFC_DESCRIPTOR_RANK (a) == 2
|| GFC_DESCRIPTOR_RANK (b) == 2);
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -87,7 +87,7 @@ matmul_l16 (gfc_array_l16 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_LOGICAL_16) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -133,7 +133,7 @@ matmul_l16 (gfc_array_l16 * const restrict retarray,
}
}
abase = a->data;
abase = a->base_addr;
a_kind = GFC_DESCRIPTOR_SIZE (a);
if (a_kind == 1 || a_kind == 2 || a_kind == 4 || a_kind == 8
@ -145,7 +145,7 @@ matmul_l16 (gfc_array_l16 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array");
bbase = b->data;
bbase = b->base_addr;
b_kind = GFC_DESCRIPTOR_SIZE (b);
if (b_kind == 1 || b_kind == 2 || b_kind == 4 || b_kind == 8
@ -157,7 +157,7 @@ matmul_l16 (gfc_array_l16 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array");
dest = retarray->data;
dest = retarray->base_addr;
if (GFC_DESCRIPTOR_RANK (retarray) == 1)

14
libgfortran/generated/matmul_l4.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -65,7 +65,7 @@ matmul_l4 (gfc_array_l4 * const restrict retarray,
assert (GFC_DESCRIPTOR_RANK (a) == 2
|| GFC_DESCRIPTOR_RANK (b) == 2);
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -87,7 +87,7 @@ matmul_l4 (gfc_array_l4 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_LOGICAL_4) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -133,7 +133,7 @@ matmul_l4 (gfc_array_l4 * const restrict retarray,
}
}
abase = a->data;
abase = a->base_addr;
a_kind = GFC_DESCRIPTOR_SIZE (a);
if (a_kind == 1 || a_kind == 2 || a_kind == 4 || a_kind == 8
@ -145,7 +145,7 @@ matmul_l4 (gfc_array_l4 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array");
bbase = b->data;
bbase = b->base_addr;
b_kind = GFC_DESCRIPTOR_SIZE (b);
if (b_kind == 1 || b_kind == 2 || b_kind == 4 || b_kind == 8
@ -157,7 +157,7 @@ matmul_l4 (gfc_array_l4 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array");
dest = retarray->data;
dest = retarray->base_addr;
if (GFC_DESCRIPTOR_RANK (retarray) == 1)

14
libgfortran/generated/matmul_l8.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -65,7 +65,7 @@ matmul_l8 (gfc_array_l8 * const restrict retarray,
assert (GFC_DESCRIPTOR_RANK (a) == 2
|| GFC_DESCRIPTOR_RANK (b) == 2);
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -87,7 +87,7 @@ matmul_l8 (gfc_array_l8 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_LOGICAL_8) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -133,7 +133,7 @@ matmul_l8 (gfc_array_l8 * const restrict retarray,
}
}
abase = a->data;
abase = a->base_addr;
a_kind = GFC_DESCRIPTOR_SIZE (a);
if (a_kind == 1 || a_kind == 2 || a_kind == 4 || a_kind == 8
@ -145,7 +145,7 @@ matmul_l8 (gfc_array_l8 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array");
bbase = b->data;
bbase = b->base_addr;
b_kind = GFC_DESCRIPTOR_SIZE (b);
if (b_kind == 1 || b_kind == 2 || b_kind == 4 || b_kind == 8
@ -157,7 +157,7 @@ matmul_l8 (gfc_array_l8 * const restrict retarray,
else
internal_error (NULL, "Funny sized logical array");
dest = retarray->data;
dest = retarray->base_addr;
if (GFC_DESCRIPTOR_RANK (retarray) == 1)

14
libgfortran/generated/matmul_r10.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_r10 (gfc_array_r10 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_r10 (gfc_array_r10 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_REAL_10) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_r10 (gfc_array_r10 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_r16.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_r16 (gfc_array_r16 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_r16 (gfc_array_r16 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_REAL_16) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_r16 (gfc_array_r16 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_r4.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_r4 (gfc_array_r4 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_r4 (gfc_array_r4 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_REAL_4) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_r4 (gfc_array_r4 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

14
libgfortran/generated/matmul_r8.c
View File

@ -1,8 +1,8 @@
/* Implementation of the MATMUL intrinsic
Copyright 2002, 2005, 2006, 2007, 2009 Free Software Foundation, Inc.
Copyright 2002, 2005, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Paul Brook <paul@nowt.org>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
@ -101,7 +101,7 @@ matmul_r8 (gfc_array_r8 * const restrict retarray,
dimensioned [count, 1], so ycount=1.
*/
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
if (GFC_DESCRIPTOR_RANK (a) == 1)
{
@ -123,7 +123,7 @@ matmul_r8 (gfc_array_r8 * const restrict retarray,
GFC_DESCRIPTOR_EXTENT(retarray,0));
}
retarray->data
retarray->base_addr
= internal_malloc_size (sizeof (GFC_REAL_8) * size0 ((array_t *) retarray));
retarray->offset = 0;
}
@ -226,9 +226,9 @@ matmul_r8 (gfc_array_r8 * const restrict retarray,
ycount = GFC_DESCRIPTOR_EXTENT(b,1);
}
abase = a->data;
bbase = b->data;
dest = retarray->data;
abase = a->base_addr;
bbase = b->base_addr;
dest = retarray->base_addr;
/* Now that everything is set up, we're performing the multiplication

24
libgfortran/generated/maxloc0_16_i1.c
View File

@ -53,12 +53,12 @@ maxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
if (rank <= 0)
runtime_error ("Rank of array needs to be > 0");
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
GFC_DIMENSION_SET(retarray->dim[0], 0, rank-1, 1);
retarray->dtype = (retarray->dtype & ~GFC_DTYPE_RANK_MASK) | 1;
retarray->offset = 0;
retarray->data = internal_malloc_size (sizeof (GFC_INTEGER_16) * rank);
retarray->base_addr = internal_malloc_size (sizeof (GFC_INTEGER_16) * rank);
}
else
{
@ -68,7 +68,7 @@ maxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
}
dstride = GFC_DESCRIPTOR_STRIDE(retarray,0);
dest = retarray->data;
dest = retarray->base_addr;
for (n = 0; n < rank; n++)
{
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n);
@ -83,7 +83,7 @@ maxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
}
}
base = array->data;
base = array->base_addr;
/* Initialize the return value. */
for (n = 0; n < rank; n++)
@ -194,12 +194,12 @@ mmaxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
if (rank <= 0)
runtime_error ("Rank of array needs to be > 0");
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
GFC_DIMENSION_SET(retarray->dim[0], 0, rank - 1, 1);
retarray->dtype = (retarray->dtype & ~GFC_DTYPE_RANK_MASK) | 1;
retarray->offset = 0;
retarray->data = internal_malloc_size (sizeof (GFC_INTEGER_16) * rank);
retarray->base_addr = internal_malloc_size (sizeof (GFC_INTEGER_16) * rank);
}
else
{
@ -215,7 +215,7 @@ mmaxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
mbase = mask->data;
mbase = mask->base_addr;
if (mask_kind == 1 || mask_kind == 2 || mask_kind == 4 || mask_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
@ -227,7 +227,7 @@ mmaxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
runtime_error ("Funny sized logical array");
dstride = GFC_DESCRIPTOR_STRIDE(retarray,0);
dest = retarray->data;
dest = retarray->base_addr;
for (n = 0; n < rank; n++)
{
sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n);
@ -243,7 +243,7 @@ mmaxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
}
}
base = array->data;
base = array->base_addr;
/* Initialize the return value. */
for (n = 0; n < rank; n++)
@ -362,12 +362,12 @@ smaxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
if (rank <= 0)
runtime_error ("Rank of array needs to be > 0");
if (retarray->data == NULL)
if (retarray->base_addr == NULL)
{
GFC_DIMENSION_SET(retarray->dim[0], 0, rank-1, 1);
retarray->dtype = (retarray->dtype & ~GFC_DTYPE_RANK_MASK) | 1;
retarray->offset = 0;
retarray->data = internal_malloc_size (sizeof (GFC_INTEGER_16) * rank);
retarray->base_addr = internal_malloc_size (sizeof (GFC_INTEGER_16) * rank);
}
else if (unlikely (compile_options.bounds_check))
{
@ -376,7 +376,7 @@ smaxloc0_16_i1 (gfc_array_i16 * const restrict retarray,
}
dstride = GFC_DESCRIPTOR_STRIDE(retarray,0);
dest = retarray->data;
dest = retarray->base_addr;
for (n = 0; n<rank; n++)
dest[n * dstride] = 0 ;
}

Some files were not shown because too many files have changed in this diff Show More