summaryrefslogtreecommitdiff
path: root/libgfortran/intrinsics
diff options
context:
space:
mode:
authorburnus <burnus@138bc75d-0d04-0410-961f-82ee72b054a4>2012-03-10 17:22:31 +0000
committerburnus <burnus@138bc75d-0d04-0410-961f-82ee72b054a4>2012-03-10 17:22:31 +0000
commit553877d921e5d7e7d156c95e1214106d2edfa37c (patch)
tree185023329e4ecc90e5a247a71df7042a7bd6bf19 /libgfortran/intrinsics
parentbd279947031bbfda2a8ff1b0f0cdb74b6840a4a4 (diff)
downloadgcc-553877d921e5d7e7d156c95e1214106d2edfa37c.tar.gz
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. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@185177 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libgfortran/intrinsics')
-rw-r--r--libgfortran/intrinsics/cshift0.c28
-rw-r--r--libgfortran/intrinsics/date_and_time.c24
-rw-r--r--libgfortran/intrinsics/dtime.c6
-rw-r--r--libgfortran/intrinsics/eoshift0.c12
-rw-r--r--libgfortran/intrinsics/eoshift2.c14
-rw-r--r--libgfortran/intrinsics/etime.c6
-rw-r--r--libgfortran/intrinsics/iso_c_binding.c6
-rw-r--r--libgfortran/intrinsics/move_alloc.c8
-rw-r--r--libgfortran/intrinsics/pack_generic.c48
-rw-r--r--libgfortran/intrinsics/random.c20
-rw-r--r--libgfortran/intrinsics/reshape_generic.c24
-rw-r--r--libgfortran/intrinsics/spread_generic.c35
-rw-r--r--libgfortran/intrinsics/stat.c130
-rw-r--r--libgfortran/intrinsics/transpose_generic.c12
-rw-r--r--libgfortran/intrinsics/unpack_generic.c50
15 files changed, 215 insertions, 208 deletions
diff --git a/libgfortran/intrinsics/cshift0.c b/libgfortran/intrinsics/cshift0.c
index 026dd1adc0d..5da73d4e170 100644
--- a/libgfortran/intrinsics/cshift0.c
+++ b/libgfortran/intrinsics/cshift0.c
@@ -1,5 +1,5 @@
/* Generic implementation of the CSHIFT intrinsic
- Copyright 2003, 2005, 2006, 2007, 2010 Free Software Foundation, Inc.
+ Copyright 2003, 2005, 2006, 2007, 2010, 2012 Free Software Foundation, Inc.
Contributed by Feng Wang <wf_cs@yahoo.com>
This file is part of the GNU Fortran runtime library (libgfortran).
@@ -58,7 +58,7 @@ cshift0 (gfc_array_char * ret, const gfc_array_char * array,
arraysize = size0 ((array_t *) array);
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
int i;
@@ -80,7 +80,7 @@ cshift0 (gfc_array_char * ret, const gfc_array_char * array,
}
/* 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))
{
@@ -199,7 +199,7 @@ cshift0 (gfc_array_char * ret, const gfc_array_char * array,
break;
case sizeof (GFC_INTEGER_2):
- if (GFC_UNALIGNED_2(ret->data) || GFC_UNALIGNED_2(array->data))
+ if (GFC_UNALIGNED_2(ret->base_addr) || GFC_UNALIGNED_2(array->base_addr))
break;
else
{
@@ -209,7 +209,7 @@ cshift0 (gfc_array_char * ret, const gfc_array_char * array,
}
case sizeof (GFC_INTEGER_4):
- if (GFC_UNALIGNED_4(ret->data) || GFC_UNALIGNED_4(array->data))
+ if (GFC_UNALIGNED_4(ret->base_addr) || GFC_UNALIGNED_4(array->base_addr))
break;
else
{
@@ -219,7 +219,7 @@ cshift0 (gfc_array_char * ret, const gfc_array_char * array,
}
case sizeof (GFC_INTEGER_8):
- if (GFC_UNALIGNED_8(ret->data) || GFC_UNALIGNED_8(array->data))
+ if (GFC_UNALIGNED_8(ret->base_addr) || GFC_UNALIGNED_8(array->base_addr))
{
/* Let's try to use the complex routines. First, a sanity
check that the sizes match; this should be optimized to
@@ -227,7 +227,8 @@ cshift0 (gfc_array_char * ret, const gfc_array_char * array,
if (sizeof(GFC_INTEGER_8) != sizeof(GFC_COMPLEX_4))
break;
- if (GFC_UNALIGNED_C4(ret->data) || GFC_UNALIGNED_C4(array->data))
+ if (GFC_UNALIGNED_C4(ret->base_addr)
+ || GFC_UNALIGNED_C4(array->base_addr))
break;
cshift0_c4 ((gfc_array_c4 *) ret, (gfc_array_c4 *) array, shift,
@@ -243,7 +244,8 @@ cshift0 (gfc_array_char * ret, const gfc_array_char * array,
#ifdef HAVE_GFC_INTEGER_16
case sizeof (GFC_INTEGER_16):
- if (GFC_UNALIGNED_16(ret->data) || GFC_UNALIGNED_16(array->data))
+ if (GFC_UNALIGNED_16(ret->base_addr)
+ || GFC_UNALIGNED_16(array->base_addr))
{
/* Let's try to use the complex routines. First, a sanity
check that the sizes match; this should be optimized to
@@ -251,7 +253,8 @@ cshift0 (gfc_array_char * ret, const gfc_array_char * array,
if (sizeof(GFC_INTEGER_16) != sizeof(GFC_COMPLEX_8))
break;
- if (GFC_UNALIGNED_C8(ret->data) || GFC_UNALIGNED_C8(array->data))
+ if (GFC_UNALIGNED_C8(ret->base_addr)
+ || GFC_UNALIGNED_C8(array->base_addr))
break;
cshift0_c8 ((gfc_array_c8 *) ret, (gfc_array_c8 *) array, shift,
@@ -267,7 +270,8 @@ cshift0 (gfc_array_char * ret, const gfc_array_char * array,
#else
case sizeof (GFC_COMPLEX_8):
- if (GFC_UNALIGNED_C8(ret->data) || GFC_UNALIGNED_C8(array->data))
+ if (GFC_UNALIGNED_C8(ret->base_addr)
+ || GFC_UNALIGNED_C8(array->base_addr))
break;
else
{
@@ -323,8 +327,8 @@ cshift0 (gfc_array_char * ret, const gfc_array_char * array,
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)
diff --git a/libgfortran/intrinsics/date_and_time.c b/libgfortran/intrinsics/date_and_time.c
index 3c386363df4..c785f84c0d9 100644
--- a/libgfortran/intrinsics/date_and_time.c
+++ b/libgfortran/intrinsics/date_and_time.c
@@ -1,5 +1,5 @@
/* Implementation of the DATE_AND_TIME intrinsic.
- Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009, 2010, 2011
+ Copyright (C) 2003, 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2012
Free Software Foundation, Inc.
Contributed by Steven Bosscher.
@@ -208,14 +208,14 @@ date_and_time (char *__date, char *__time, char *__zone,
/* Cope with different type kinds. */
if (elt_size == 4)
{
- GFC_INTEGER_4 *vptr4 = __values->data;
+ GFC_INTEGER_4 *vptr4 = __values->base_addr;
for (i = 0; i < VALUES_SIZE; i++, vptr4 += delta)
*vptr4 = values[i];
}
else if (elt_size == 8)
{
- GFC_INTEGER_8 *vptr8 = (GFC_INTEGER_8 *)__values->data;
+ GFC_INTEGER_8 *vptr8 = (GFC_INTEGER_8 *)__values->base_addr;
for (i = 0; i < VALUES_SIZE; i++, vptr8 += delta)
{
@@ -271,7 +271,7 @@ secnds (GFC_REAL_4 *x)
/* Make the INTEGER*4 array for passing to date_and_time. */
gfc_array_i4 *avalues = internal_malloc_size (sizeof (gfc_array_i4));
- avalues->data = &values[0];
+ avalues->base_addr = &values[0];
GFC_DESCRIPTOR_DTYPE (avalues) = ((BT_REAL << GFC_DTYPE_TYPE_SHIFT)
& GFC_DTYPE_TYPE_MASK) +
(4 << GFC_DTYPE_SIZE_SHIFT);
@@ -336,7 +336,7 @@ itime_i4 (gfc_array_i4 *__values)
if (delta == 0)
delta = 1;
- vptr = __values->data;
+ vptr = __values->base_addr;
for (i = 0; i < 3; i++, vptr += delta)
*vptr = x[i];
}
@@ -362,7 +362,7 @@ itime_i8 (gfc_array_i8 *__values)
if (delta == 0)
delta = 1;
- vptr = __values->data;
+ vptr = __values->base_addr;
for (i = 0; i < 3; i++, vptr += delta)
*vptr = x[i];
}
@@ -414,7 +414,7 @@ idate_i4 (gfc_array_i4 *__values)
if (delta == 0)
delta = 1;
- vptr = __values->data;
+ vptr = __values->base_addr;
for (i = 0; i < 3; i++, vptr += delta)
*vptr = x[i];
}
@@ -440,7 +440,7 @@ idate_i8 (gfc_array_i8 *__values)
if (delta == 0)
delta = 1;
- vptr = __values->data;
+ vptr = __values->base_addr;
for (i = 0; i < 3; i++, vptr += delta)
*vptr = x[i];
}
@@ -504,7 +504,7 @@ gmtime_i4 (GFC_INTEGER_4 * t, gfc_array_i4 * tarray)
if (delta == 0)
delta = 1;
- vptr = tarray->data;
+ vptr = tarray->base_addr;
for (i = 0; i < 9; i++, vptr += delta)
*vptr = x[i];
}
@@ -531,7 +531,7 @@ gmtime_i8 (GFC_INTEGER_8 * t, gfc_array_i8 * tarray)
if (delta == 0)
delta = 1;
- vptr = tarray->data;
+ vptr = tarray->base_addr;
for (i = 0; i < 9; i++, vptr += delta)
*vptr = x[i];
}
@@ -596,7 +596,7 @@ ltime_i4 (GFC_INTEGER_4 * t, gfc_array_i4 * tarray)
if (delta == 0)
delta = 1;
- vptr = tarray->data;
+ vptr = tarray->base_addr;
for (i = 0; i < 9; i++, vptr += delta)
*vptr = x[i];
}
@@ -623,7 +623,7 @@ ltime_i8 (GFC_INTEGER_8 * t, gfc_array_i8 * tarray)
if (delta == 0)
delta = 1;
- vptr = tarray->data;
+ vptr = tarray->base_addr;
for (i = 0; i < 9; i++, vptr += delta)
*vptr = x[i];
}
diff --git a/libgfortran/intrinsics/dtime.c b/libgfortran/intrinsics/dtime.c
index e36e1f1d04a..b5dc91ea067 100644
--- a/libgfortran/intrinsics/dtime.c
+++ b/libgfortran/intrinsics/dtime.c
@@ -1,6 +1,6 @@
/* Implementation of the dtime intrinsic.
- Copyright (C) 2004, 2005, 2006, 2007, 2009, 2011 Free Software
- Foundation, Inc.
+ Copyright (C) 2004, 2005, 2006, 2007, 2009, 2011, 2012
+ Free Software Foundation, Inc.
This file is part of the GNU Fortran runtime library (libgfortran).
@@ -65,7 +65,7 @@ dtime_sub (gfc_array_r4 *t, GFC_REAL_4 *result)
tt = -1;
}
- tp = t->data;
+ tp = t->base_addr;
*tp = tu;
tp += GFC_DESCRIPTOR_STRIDE(t,0);
diff --git a/libgfortran/intrinsics/eoshift0.c b/libgfortran/intrinsics/eoshift0.c
index 6ceed2000e0..8b7dd0a641f 100644
--- a/libgfortran/intrinsics/eoshift0.c
+++ b/libgfortran/intrinsics/eoshift0.c
@@ -1,8 +1,8 @@
/* Generic 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
@@ -64,7 +64,7 @@ eoshift0 (gfc_array_char * ret, const gfc_array_char * array,
arraysize = size0 ((array_t *) array);
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
int i;
@@ -87,7 +87,7 @@ eoshift0 (gfc_array_char * ret, const gfc_array_char * array,
}
/* 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))
{
@@ -134,8 +134,8 @@ eoshift0 (gfc_array_char * ret, const gfc_array_char * array,
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;
if ((shift >= 0 ? shift : -shift) > len)
{
diff --git a/libgfortran/intrinsics/eoshift2.c b/libgfortran/intrinsics/eoshift2.c
index b4f82786964..cd2a827fbfc 100644
--- a/libgfortran/intrinsics/eoshift2.c
+++ b/libgfortran/intrinsics/eoshift2.c
@@ -1,8 +1,8 @@
/* Generic 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
@@ -71,7 +71,7 @@ eoshift2 (gfc_array_char *ret, const gfc_array_char *array,
arraysize = size0 ((array_t *) array);
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
int i;
@@ -92,7 +92,7 @@ eoshift2 (gfc_array_char *ret, const gfc_array_char *array,
GFC_DIMENSION_SET(ret->dim[i], 0, ub, str);
/* 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);
}
}
@@ -149,8 +149,8 @@ eoshift2 (gfc_array_char *ret, const gfc_array_char *array,
rstride0 = rstride[0];
sstride0 = sstride[0];
bstride0 = bstride[0];
- rptr = ret->data;
- sptr = array->data;
+ rptr = ret->base_addr;
+ sptr = array->base_addr;
if ((shift >= 0 ? shift : -shift ) > len)
{
@@ -166,7 +166,7 @@ eoshift2 (gfc_array_char *ret, const gfc_array_char *array,
}
if (bound)
- bptr = bound->data;
+ bptr = bound->base_addr;
else
bptr = NULL;
diff --git a/libgfortran/intrinsics/etime.c b/libgfortran/intrinsics/etime.c
index d90bc3022d7..96c6d712c5c 100644
--- a/libgfortran/intrinsics/etime.c
+++ b/libgfortran/intrinsics/etime.c
@@ -1,6 +1,6 @@
/* Implementation of the ETIME intrinsic.
- Copyright (C) 2004, 2005, 2006, 2007, 2009, 2011 Free Software
- Foundation, Inc.
+ Copyright (C) 2004, 2005, 2006, 2007, 2009, 2011, 2012
+ Free Software Foundation, Inc.
Contributed by Steven G. Kargl <kargls@comcast.net>.
This file is part of the GNU Fortran runtime library (libgfortran).
@@ -52,7 +52,7 @@ etime_sub (gfc_array_r4 *t, GFC_REAL_4 *result)
tt = (GFC_REAL_4)-1.0;
}
- tp = t->data;
+ tp = t->base_addr;
*tp = tu;
tp += GFC_DESCRIPTOR_STRIDE(t,0);
diff --git a/libgfortran/intrinsics/iso_c_binding.c b/libgfortran/intrinsics/iso_c_binding.c
index 327ad5128fd..cab7feb4b47 100644
--- a/libgfortran/intrinsics/iso_c_binding.c
+++ b/libgfortran/intrinsics/iso_c_binding.c
@@ -1,8 +1,8 @@
/* Implementation of the ISO_C_BINDING library helper functions.
- Copyright (C) 2007, 2009, 2010 Free Software Foundation, Inc.
+ Copyright (C) 2007, 2009, 2010, 2012 Free Software Foundation, Inc.
Contributed by Christopher Rickett.
-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
@@ -100,7 +100,7 @@ ISO_C_BINDING_PREFIX (c_f_pointer_u0) (void *c_ptr_in,
f_ptr_out->offset = str;
shapeSize = 0;
- p = shape->data;
+ p = shape->base_addr;
size = GFC_DESCRIPTOR_SIZE(shape);
source_stride = GFC_DESCRIPTOR_STRIDE_BYTES(shape,0);
diff --git a/libgfortran/intrinsics/move_alloc.c b/libgfortran/intrinsics/move_alloc.c
index 7b489ade4c7..a27de4e7c60 100644
--- a/libgfortran/intrinsics/move_alloc.c
+++ b/libgfortran/intrinsics/move_alloc.c
@@ -1,5 +1,5 @@
/* Generic implementation of the MOVE_ALLOC intrinsic
- Copyright (C) 2006, 2007, 2009, 2011 Free Software Foundation, Inc.
+ Copyright (C) 2006, 2007, 2009, 2011, 2012 Free Software Foundation, Inc.
Contributed by Paul Thomas
This file is part of the GNU Fortran runtime library (libgfortran).
@@ -35,7 +35,7 @@ move_alloc (gfc_array_char * from, gfc_array_char * to)
{
int i;
- free (to->data);
+ free (to->base_addr);
for (i = 0; i < GFC_DESCRIPTOR_RANK (from); i++)
{
@@ -48,8 +48,8 @@ move_alloc (gfc_array_char * from, gfc_array_char * to)
to->offset = from->offset;
to->dtype = from->dtype;
- to->data = from->data;
- from->data = NULL;
+ to->base_addr = from->base_addr;
+ from->base_addr = NULL;
}
extern void move_alloc_c (gfc_array_char *, GFC_INTEGER_4,
diff --git a/libgfortran/intrinsics/pack_generic.c b/libgfortran/intrinsics/pack_generic.c
index de1e07facab..77d600a5ecc 100644
--- a/libgfortran/intrinsics/pack_generic.c
+++ b/libgfortran/intrinsics/pack_generic.c
@@ -1,9 +1,9 @@
/* Generic implementation of the PACK intrinsic
- Copyright (C) 2002, 2004, 2005, 2006, 2007, 2009, 2010
+ Copyright (C) 2002, 2004, 2005, 2006, 2007, 2009, 2010, 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
@@ -96,8 +96,8 @@ pack_internal (gfc_array_char *ret, const gfc_array_char *array,
dim = GFC_DESCRIPTOR_RANK (array);
- sptr = array->data;
- mptr = mask->data;
+ sptr = array->base_addr;
+ mptr = mask->base_addr;
/* Use the same loop for all logical types, by using GFC_LOGICAL_1
and using shifting to address size and endian issues. */
@@ -129,7 +129,7 @@ pack_internal (gfc_array_char *ret, const gfc_array_char *array,
if (mstride[0] == 0)
mstride[0] = mask_kind;
- if (ret->data == NULL || unlikely (compile_options.bounds_check))
+ if (ret->base_addr == NULL || unlikely (compile_options.bounds_check))
{
/* Count the elements, either for allocating memory or
for bounds checking. */
@@ -147,14 +147,14 @@ pack_internal (gfc_array_char *ret, const gfc_array_char *array,
total = count_0 (mask);
}
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
/* Setup the array descriptor. */
GFC_DIMENSION_SET(ret->dim[0], 0, total-1, 1);
ret->offset = 0;
/* internal_malloc_size allocates a single byte for zero size. */
- ret->data = internal_malloc_size (size * total);
+ ret->base_addr = internal_malloc_size (size * total);
if (total == 0)
return; /* In this case, nothing remains to be done. */
@@ -177,7 +177,7 @@ pack_internal (gfc_array_char *ret, const gfc_array_char *array,
rstride0 = size;
sstride0 = sstride[0];
mstride0 = mstride[0];
- rptr = ret->data;
+ rptr = ret->base_addr;
while (sptr && mptr)
{
@@ -222,14 +222,14 @@ pack_internal (gfc_array_char *ret, const gfc_array_char *array,
if (vector)
{
n = GFC_DESCRIPTOR_EXTENT(vector,0);
- nelem = ((rptr - ret->data) / rstride0);
+ nelem = ((rptr - ret->base_addr) / rstride0);
if (n > nelem)
{
sstride0 = GFC_DESCRIPTOR_STRIDE_BYTES(vector,0);
if (sstride0 == 0)
sstride0 = size;
- sptr = vector->data + sstride0 * nelem;
+ sptr = vector->base_addr + sstride0 * nelem;
n -= nelem;
while (n--)
{
@@ -358,8 +358,8 @@ pack (gfc_array_char *ret, const gfc_array_char *array,
the unpack functions. */
case GFC_DTYPE_DERIVED_2:
- if (GFC_UNALIGNED_2(ret->data) || GFC_UNALIGNED_2(array->data)
- || (vector && GFC_UNALIGNED_2(vector->data)))
+ if (GFC_UNALIGNED_2(ret->base_addr) || GFC_UNALIGNED_2(array->base_addr)
+ || (vector && GFC_UNALIGNED_2(vector->base_addr)))
break;
else
{
@@ -369,8 +369,8 @@ pack (gfc_array_char *ret, const gfc_array_char *array,
}
case GFC_DTYPE_DERIVED_4:
- if (GFC_UNALIGNED_4(ret->data) || GFC_UNALIGNED_4(array->data)
- || (vector && GFC_UNALIGNED_4(vector->data)))
+ if (GFC_UNALIGNED_4(ret->base_addr) || GFC_UNALIGNED_4(array->base_addr)
+ || (vector && GFC_UNALIGNED_4(vector->base_addr)))
break;
else
{
@@ -380,8 +380,8 @@ pack (gfc_array_char *ret, const gfc_array_char *array,
}
case GFC_DTYPE_DERIVED_8:
- if (GFC_UNALIGNED_8(ret->data) || GFC_UNALIGNED_8(array->data)
- || (vector && GFC_UNALIGNED_8(vector->data)))
+ if (GFC_UNALIGNED_8(ret->base_addr) || GFC_UNALIGNED_8(array->base_addr)
+ || (vector && GFC_UNALIGNED_8(vector->base_addr)))
break;
else
{
@@ -392,8 +392,8 @@ pack (gfc_array_char *ret, const gfc_array_char *array,
#ifdef HAVE_GFC_INTEGER_16
case GFC_DTYPE_DERIVED_16:
- if (GFC_UNALIGNED_16(ret->data) || GFC_UNALIGNED_16(array->data)
- || (vector && GFC_UNALIGNED_16(vector->data)))
+ if (GFC_UNALIGNED_16(ret->base_addr) || GFC_UNALIGNED_16(array->base_addr)
+ || (vector && GFC_UNALIGNED_16(vector->base_addr)))
break;
else
{
@@ -481,11 +481,11 @@ pack_s_internal (gfc_array_char *ret, const gfc_array_char *array,
sstride0 = sstride[0];
if (ssize != 0)
- sptr = array->data;
+ sptr = array->base_addr;
else
sptr = NULL;
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
/* Allocate the memory for the result. */
@@ -520,7 +520,7 @@ pack_s_internal (gfc_array_char *ret, const gfc_array_char *array,
ret->offset = 0;
- ret->data = internal_malloc_size (size * total);
+ ret->base_addr = internal_malloc_size (size * total);
if (total == 0)
return;
@@ -529,7 +529,7 @@ pack_s_internal (gfc_array_char *ret, const gfc_array_char *array,
rstride0 = GFC_DESCRIPTOR_STRIDE_BYTES(ret,0);
if (rstride0 == 0)
rstride0 = size;
- rptr = ret->data;
+ rptr = ret->base_addr;
/* The remaining possibilities are now:
If MASK is .TRUE., we have to copy the source array into the
@@ -577,14 +577,14 @@ pack_s_internal (gfc_array_char *ret, const gfc_array_char *array,
if (vector)
{
n = GFC_DESCRIPTOR_EXTENT(vector,0);
- nelem = ((rptr - ret->data) / rstride0);
+ nelem = ((rptr - ret->base_addr) / rstride0);
if (n > nelem)
{
sstride0 = GFC_DESCRIPTOR_STRIDE_BYTES(vector,0);
if (sstride0 == 0)
sstride0 = size;
- sptr = vector->data + sstride0 * nelem;
+ sptr = vector->base_addr + sstride0 * nelem;
n -= nelem;
while (n--)
{
diff --git a/libgfortran/intrinsics/random.c b/libgfortran/intrinsics/random.c
index 35576b85bda..a6fede034c8 100644
--- a/libgfortran/intrinsics/random.c
+++ b/libgfortran/intrinsics/random.c
@@ -1,10 +1,10 @@
/* Implementation of the RANDOM intrinsics
- Copyright 2002, 2004, 2005, 2006, 2007, 2009, 2010
+ Copyright 2002, 2004, 2005, 2006, 2007, 2009, 2010, 2012
Free Software Foundation, Inc.
Contributed by Lars Segerlund <seger@linuxmail.org>
and Steve Kargl.
-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
@@ -368,7 +368,7 @@ arandom_r4 (gfc_array_r4 *x)
GFC_UINTEGER_4 kiss;
int n;
- dest = x->data;
+ dest = x->base_addr;
dim = GFC_DESCRIPTOR_RANK (x);
@@ -435,7 +435,7 @@ arandom_r8 (gfc_array_r8 *x)
GFC_UINTEGER_8 kiss;
int n;
- dest = x->data;
+ dest = x->base_addr;
dim = GFC_DESCRIPTOR_RANK (x);
@@ -505,7 +505,7 @@ arandom_r10 (gfc_array_r10 *x)
GFC_UINTEGER_8 kiss;
int n;
- dest = x->data;
+ dest = x->base_addr;
dim = GFC_DESCRIPTOR_RANK (x);
@@ -577,7 +577,7 @@ arandom_r16 (gfc_array_r16 *x)
GFC_UINTEGER_8 kiss1, kiss2;
int n;
- dest = x->data;
+ dest = x->base_addr;
dim = GFC_DESCRIPTOR_RANK (x);
@@ -697,7 +697,7 @@ random_seed_i4 (GFC_INTEGER_4 *size, gfc_array_i4 *put, gfc_array_i4 *get)
/* We copy the seed given by the user. */
for (i = 0; i < kiss_size; i++)
memcpy (seed + i * sizeof(GFC_UINTEGER_4),
- &(put->data[(kiss_size - 1 - i) * GFC_DESCRIPTOR_STRIDE(put,0)]),
+ &(put->base_addr[(kiss_size - 1 - i) * GFC_DESCRIPTOR_STRIDE(put,0)]),
sizeof(GFC_UINTEGER_4));
/* We put it after scrambling the bytes, to paper around users who
@@ -721,7 +721,7 @@ random_seed_i4 (GFC_INTEGER_4 *size, gfc_array_i4 *put, gfc_array_i4 *get)
/* Then copy it back to the user variable. */
for (i = 0; i < kiss_size; i++)
- memcpy (&(get->data[(kiss_size - 1 - i) * GFC_DESCRIPTOR_STRIDE(get,0)]),
+ memcpy (&(get->base_addr[(kiss_size - 1 - i) * GFC_DESCRIPTOR_STRIDE(get,0)]),
seed + i * sizeof(GFC_UINTEGER_4),
sizeof(GFC_UINTEGER_4));
}
@@ -763,7 +763,7 @@ random_seed_i8 (GFC_INTEGER_8 *size, gfc_array_i8 *put, gfc_array_i8 *get)
/* This code now should do correct strides. */
for (i = 0; i < kiss_size / 2; i++)
- memcpy (&kiss_seed[2*i], &(put->data[i * GFC_DESCRIPTOR_STRIDE(put,0)]),
+ memcpy (&kiss_seed[2*i], &(put->base_addr[i * GFC_DESCRIPTOR_STRIDE(put,0)]),
sizeof (GFC_UINTEGER_8));
}
@@ -780,7 +780,7 @@ random_seed_i8 (GFC_INTEGER_8 *size, gfc_array_i8 *put, gfc_array_i8 *get)
/* This code now should do correct strides. */
for (i = 0; i < kiss_size / 2; i++)
- memcpy (&(get->data[i * GFC_DESCRIPTOR_STRIDE(get,0)]), &kiss_seed[2*i],
+ memcpy (&(get->base_addr[i * GFC_DESCRIPTOR_STRIDE(get,0)]), &kiss_seed[2*i],
sizeof (GFC_UINTEGER_8));
}
diff --git a/libgfortran/intrinsics/reshape_generic.c b/libgfortran/intrinsics/reshape_generic.c
index 5b39711cea6..b16690ac1fc 100644
--- a/libgfortran/intrinsics/reshape_generic.c
+++ b/libgfortran/intrinsics/reshape_generic.c
@@ -1,8 +1,8 @@
/* Generic implementation of the RESHAPE intrinsic
- Copyright 2002, 2006, 2007, 2009 Free Software Foundation, Inc.
+ Copyright 2002, 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
@@ -75,7 +75,7 @@ reshape_internal (parray *ret, parray *source, shape_type *shape,
for (n = 0; n < rdim; n++)
{
- shape_data[n] = shape->data[n * GFC_DESCRIPTOR_STRIDE(shape,0)];
+ shape_data[n] = shape->base_addr[n * GFC_DESCRIPTOR_STRIDE(shape,0)];
if (shape_data[n] <= 0)
{
shape_data[n] = 0;
@@ -83,7 +83,7 @@ reshape_internal (parray *ret, parray *source, shape_type *shape,
}
}
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
index_type alloc_size;
@@ -103,7 +103,7 @@ reshape_internal (parray *ret, parray *source, shape_type *shape,
else
alloc_size = rs * size;
- ret->data = internal_malloc_size (alloc_size);
+ ret->base_addr = internal_malloc_size (alloc_size);
ret->dtype = (source->dtype & ~GFC_DTYPE_RANK_MASK) | rdim;
}
@@ -132,7 +132,7 @@ reshape_internal (parray *ret, parray *source, shape_type *shape,
else
psize = 0;
}
- pptr = pad->data;
+ pptr = pad->base_addr;
}
else
{
@@ -182,7 +182,7 @@ reshape_internal (parray *ret, parray *source, shape_type *shape,
for (n = 0; n < rdim; n++)
{
- v = order->data[n * GFC_DESCRIPTOR_STRIDE(order,0)] - 1;
+ v = order->base_addr[n * GFC_DESCRIPTOR_STRIDE(order,0)] - 1;
if (v < 0 || v >= rdim)
runtime_error("Value %ld out of range in ORDER argument"
@@ -201,7 +201,7 @@ reshape_internal (parray *ret, parray *source, shape_type *shape,
for (n = 0; n < rdim; n++)
{
if (order)
- dim = order->data[n * GFC_DESCRIPTOR_STRIDE(order,0)] - 1;
+ dim = order->base_addr[n * GFC_DESCRIPTOR_STRIDE(order,0)] - 1;
else
dim = n;
@@ -245,12 +245,12 @@ reshape_internal (parray *ret, parray *source, shape_type *shape,
rsize *= size;
ssize *= size;
psize *= size;
- reshape_packed (ret->data, rsize, source->data, ssize,
- pad ? pad->data : NULL, psize);
+ reshape_packed (ret->base_addr, rsize, source->base_addr, ssize,
+ pad ? pad->base_addr : NULL, psize);
return;
}
- rptr = ret->data;
- src = sptr = source->data;
+ rptr = ret->base_addr;
+ src = sptr = source->base_addr;
rstride0 = rstride[0] * size;
sstride0 = sstride[0] * size;
diff --git a/libgfortran/intrinsics/spread_generic.c b/libgfortran/intrinsics/spread_generic.c
index 2eeb24b8444..2a478f18899 100644
--- a/libgfortran/intrinsics/spread_generic.c
+++ b/libgfortran/intrinsics/spread_generic.c
@@ -1,8 +1,8 @@
/* Generic implementation of the SPREAD intrinsic
- Copyright 2002, 2005, 2006, 2007, 2009, 2010 Free Software Foundation, Inc.
+ Copyright 2002, 2005, 2006, 2007, 2009, 2010, 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
@@ -66,7 +66,7 @@ spread_internal (gfc_array_char *ret, const gfc_array_char *source,
ncopies = *pncopies;
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
/* The front end has signalled that we need to populate the
return array descriptor. */
@@ -100,7 +100,7 @@ spread_internal (gfc_array_char *ret, const gfc_array_char *source,
GFC_DIMENSION_SET(ret->dim[n], 0, ub, stride);
}
ret->offset = 0;
- ret->data = internal_malloc_size (rs * size);
+ ret->base_addr = internal_malloc_size (rs * size);
if (rs <= 0)
return;
@@ -180,8 +180,8 @@ spread_internal (gfc_array_char *ret, const gfc_array_char *source,
}
sstride0 = sstride[0];
rstride0 = rstride[0];
- rptr = ret->data;
- sptr = source->data;
+ rptr = ret->base_addr;
+ sptr = source->base_addr;
while (sptr)
{
@@ -243,9 +243,9 @@ spread_internal_scalar (gfc_array_char *ret, const char *source,
if (*along > 1)
runtime_error ("dim outside of rank in spread()");
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
- ret->data = internal_malloc_size (ncopies * size);
+ ret->base_addr = internal_malloc_size (ncopies * size);
ret->offset = 0;
GFC_DIMENSION_SET(ret->dim[0], 0, ncopies - 1, 1);
}
@@ -258,7 +258,7 @@ spread_internal_scalar (gfc_array_char *ret, const char *source,
for (n = 0; n < ncopies; n++)
{
- dest = (char*)(ret->data + n * GFC_DESCRIPTOR_STRIDE_BYTES(ret,0));
+ dest = (char*)(ret->base_addr + n * GFC_DESCRIPTOR_STRIDE_BYTES(ret,0));
memcpy (dest , source, size);
}
}
@@ -374,7 +374,7 @@ spread (gfc_array_char *ret, const gfc_array_char *source,
#endif
case GFC_DTYPE_DERIVED_2:
- if (GFC_UNALIGNED_2(ret->data) || GFC_UNALIGNED_2(source->data))
+ if (GFC_UNALIGNED_2(ret->base_addr) || GFC_UNALIGNED_2(source->base_addr))
break;
else
{
@@ -384,7 +384,7 @@ spread (gfc_array_char *ret, const gfc_array_char *source,
}
case GFC_DTYPE_DERIVED_4:
- if (GFC_UNALIGNED_4(ret->data) || GFC_UNALIGNED_4(source->data))
+ if (GFC_UNALIGNED_4(ret->base_addr) || GFC_UNALIGNED_4(source->base_addr))
break;
else
{
@@ -394,7 +394,7 @@ spread (gfc_array_char *ret, const gfc_array_char *source,
}
case GFC_DTYPE_DERIVED_8:
- if (GFC_UNALIGNED_8(ret->data) || GFC_UNALIGNED_8(source->data))
+ if (GFC_UNALIGNED_8(ret->base_addr) || GFC_UNALIGNED_8(source->base_addr))
break;
else
{
@@ -405,7 +405,8 @@ spread (gfc_array_char *ret, const gfc_array_char *source,
#ifdef HAVE_GFC_INTEGER_16
case GFC_DTYPE_DERIVED_16:
- if (GFC_UNALIGNED_16(ret->data) || GFC_UNALIGNED_16(source->data))
+ if (GFC_UNALIGNED_16(ret->base_addr)
+ || GFC_UNALIGNED_16(source->base_addr))
break;
else
{
@@ -569,7 +570,7 @@ spread_scalar (gfc_array_char *ret, const char *source,
#endif
case GFC_DTYPE_DERIVED_2:
- if (GFC_UNALIGNED_2(ret->data) || GFC_UNALIGNED_2(source))
+ if (GFC_UNALIGNED_2(ret->base_addr) || GFC_UNALIGNED_2(source))
break;
else
{
@@ -579,7 +580,7 @@ spread_scalar (gfc_array_char *ret, const char *source,
}
case GFC_DTYPE_DERIVED_4:
- if (GFC_UNALIGNED_4(ret->data) || GFC_UNALIGNED_4(source))
+ if (GFC_UNALIGNED_4(ret->base_addr) || GFC_UNALIGNED_4(source))
break;
else
{
@@ -589,7 +590,7 @@ spread_scalar (gfc_array_char *ret, const char *source,
}
case GFC_DTYPE_DERIVED_8:
- if (GFC_UNALIGNED_8(ret->data) || GFC_UNALIGNED_8(source))
+ if (GFC_UNALIGNED_8(ret->base_addr) || GFC_UNALIGNED_8(source))
break;
else
{
@@ -599,7 +600,7 @@ spread_scalar (gfc_array_char *ret, const char *source,
}
#ifdef HAVE_GFC_INTEGER_16
case GFC_DTYPE_DERIVED_16:
- if (GFC_UNALIGNED_16(ret->data) || GFC_UNALIGNED_16(source))
+ if (GFC_UNALIGNED_16(ret->base_addr) || GFC_UNALIGNED_16(source))
break;
else
{
diff --git a/libgfortran/intrinsics/stat.c b/libgfortran/intrinsics/stat.c
index 28821f1546d..a0d99104b17 100644
--- a/libgfortran/intrinsics/stat.c
+++ b/libgfortran/intrinsics/stat.c
@@ -1,5 +1,5 @@
/* Implementation of the STAT and FSTAT intrinsics.
- Copyright (C) 2004, 2005, 2006, 2007, 2009, 2011
+ Copyright (C) 2004, 2005, 2006, 2007, 2009, 2011, 2012
Free Software Foundation, Inc.
Contributed by Steven G. Kargl <kargls@comcast.net>.
@@ -90,54 +90,54 @@ stat_i4_sub_0 (char *name, gfc_array_i4 *sarray, GFC_INTEGER_4 *status,
index_type stride = GFC_DESCRIPTOR_STRIDE(sarray,0);
/* Device ID */
- sarray->data[0 * stride] = sb.st_dev;
+ sarray->base_addr[0 * stride] = sb.st_dev;
/* Inode number */
- sarray->data[1 * stride] = sb.st_ino;
+ sarray->base_addr[1 * stride] = sb.st_ino;
/* File mode */
- sarray->data[2 * stride] = sb.st_mode;
+ sarray->base_addr[2 * stride] = sb.st_mode;
/* Number of (hard) links */
- sarray->data[3 * stride] = sb.st_nlink;
+ sarray->base_addr[3 * stride] = sb.st_nlink;
/* Owner's uid */
- sarray->data[4 * stride] = sb.st_uid;
+ sarray->base_addr[4 * stride] = sb.st_uid;
/* Owner's gid */
- sarray->data[5 * stride] = sb.st_gid;
+ sarray->base_addr[5 * stride] = sb.st_gid;
/* ID of device containing directory entry for file (0 if not available) */
#if HAVE_STRUCT_STAT_ST_RDEV
- sarray->data[6 * stride] = sb.st_rdev;
+ sarray->base_addr[6 * stride] = sb.st_rdev;
#else
- sarray->data[6 * stride] = 0;
+ sarray->base_addr[6 * stride] = 0;
#endif
/* File size (bytes) */
- sarray->data[7 * stride] = sb.st_size;
+ sarray->base_addr[7 * stride] = sb.st_size;
/* Last access time */
- sarray->data[8 * stride] = sb.st_atime;
+ sarray->base_addr[8 * stride] = sb.st_atime;
/* Last modification time */
- sarray->data[9 * stride] = sb.st_mtime;
+ sarray->base_addr[9 * stride] = sb.st_mtime;
/* Last file status change time */
- sarray->data[10 * stride] = sb.st_ctime;
+ sarray->base_addr[10 * stride] = sb.st_ctime;
/* Preferred I/O block size (-1 if not available) */
#if HAVE_STRUCT_STAT_ST_BLKSIZE
- sarray->data[11 * stride] = sb.st_blksize;
+ sarray->base_addr[11 * stride] = sb.st_blksize;
#else
- sarray->data[11 * stride] = -1;
+ sarray->base_addr[11 * stride] = -1;
#endif
/* Number of blocks allocated (-1 if not available) */
#if HAVE_STRUCT_STAT_ST_BLOCKS
- sarray->data[12 * stride] = sb.st_blocks;
+ sarray->base_addr[12 * stride] = sb.st_blocks;
#else
- sarray->data[12 * stride] = -1;
+ sarray->base_addr[12 * stride] = -1;
#endif
}
@@ -211,54 +211,54 @@ stat_i8_sub_0 (char *name, gfc_array_i8 *sarray, GFC_INTEGER_8 *status,
index_type stride = GFC_DESCRIPTOR_STRIDE(sarray,0);
/* Device ID */
- sarray->data[0] = sb.st_dev;
+ sarray->base_addr[0] = sb.st_dev;
/* Inode number */
- sarray->data[stride] = sb.st_ino;
+ sarray->base_addr[stride] = sb.st_ino;
/* File mode */
- sarray->data[2 * stride] = sb.st_mode;
+ sarray->base_addr[2 * stride] = sb.st_mode;
/* Number of (hard) links */
- sarray->data[3 * stride] = sb.st_nlink;
+ sarray->base_addr[3 * stride] = sb.st_nlink;
/* Owner's uid */
- sarray->data[4 * stride] = sb.st_uid;
+ sarray->base_addr[4 * stride] = sb.st_uid;
/* Owner's gid */
- sarray->data[5 * stride] = sb.st_gid;
+ sarray->base_addr[5 * stride] = sb.st_gid;
/* ID of device containing directory entry for file (0 if not available) */
#if HAVE_STRUCT_STAT_ST_RDEV
- sarray->data[6 * stride] = sb.st_rdev;
+ sarray->base_addr[6 * stride] = sb.st_rdev;
#else
- sarray->data[6 * stride] = 0;
+ sarray->base_addr[6 * stride] = 0;
#endif
/* File size (bytes) */
- sarray->data[7 * stride] = sb.st_size;
+ sarray->base_addr[7 * stride] = sb.st_size;
/* Last access time */
- sarray->data[8 * stride] = sb.st_atime;
+ sarray->base_addr[8 * stride] = sb.st_atime;
/* Last modification time */
- sarray->data[9 * stride] = sb.st_mtime;
+ sarray->base_addr[9 * stride] = sb.st_mtime;
/* Last file status change time */
- sarray->data[10 * stride] = sb.st_ctime;
+ sarray->base_addr[10 * stride] = sb.st_ctime;
/* Preferred I/O block size (-1 if not available) */
#if HAVE_STRUCT_STAT_ST_BLKSIZE
- sarray->data[11 * stride] = sb.st_blksize;
+ sarray->base_addr[11 * stride] = sb.st_blksize;
#else
- sarray->data[11 * stride] = -1;
+ sarray->base_addr[11 * stride] = -1;
#endif
/* Number of blocks allocated (-1 if not available) */
#if HAVE_STRUCT_STAT_ST_BLOCKS
- sarray->data[12 * stride] = sb.st_blocks;
+ sarray->base_addr[12 * stride] = sb.st_blocks;
#else
- sarray->data[12 * stride] = -1;
+ sarray->base_addr[12 * stride] = -1;
#endif
}
@@ -392,54 +392,54 @@ fstat_i4_sub (GFC_INTEGER_4 *unit, gfc_array_i4 *sarray, GFC_INTEGER_4 *status)
index_type stride = GFC_DESCRIPTOR_STRIDE(sarray,0);
/* Device ID */
- sarray->data[0 * stride] = sb.st_dev;
+ sarray->base_addr[0 * stride] = sb.st_dev;
/* Inode number */
- sarray->data[1 * stride] = sb.st_ino;
+ sarray->base_addr[1 * stride] = sb.st_ino;
/* File mode */
- sarray->data[2 * stride] = sb.st_mode;
+ sarray->base_addr[2 * stride] = sb.st_mode;
/* Number of (hard) links */
- sarray->data[3 * stride] = sb.st_nlink;
+ sarray->base_addr[3 * stride] = sb.st_nlink;
/* Owner's uid */
- sarray->data[4 * stride] = sb.st_uid;
+ sarray->base_addr[4 * stride] = sb.st_uid;
/* Owner's gid */
- sarray->data[5 * stride] = sb.st_gid;
+ sarray->base_addr[5 * stride] = sb.st_gid;
/* ID of device containing directory entry for file (0 if not available) */
#if HAVE_STRUCT_STAT_ST_RDEV
- sarray->data[6 * stride] = sb.st_rdev;
+ sarray->base_addr[6 * stride] = sb.st_rdev;
#else
- sarray->data[6 * stride] = 0;
+ sarray->base_addr[6 * stride] = 0;
#endif
/* File size (bytes) */
- sarray->data[7 * stride] = sb.st_size;
+ sarray->base_addr[7 * stride] = sb.st_size;
/* Last access time */
- sarray->data[8 * stride] = sb.st_atime;
+ sarray->base_addr[8 * stride] = sb.st_atime;
/* Last modification time */
- sarray->data[9 * stride] = sb.st_mtime;
+ sarray->base_addr[9 * stride] = sb.st_mtime;
/* Last file status change time */
- sarray->data[10 * stride] = sb.st_ctime;
+ sarray->base_addr[10 * stride] = sb.st_ctime;
/* Preferred I/O block size (-1 if not available) */
#if HAVE_STRUCT_STAT_ST_BLKSIZE
- sarray->data[11 * stride] = sb.st_blksize;
+ sarray->base_addr[11 * stride] = sb.st_blksize;
#else
- sarray->data[11 * stride] = -1;
+ sarray->base_addr[11 * stride] = -1;
#endif
/* Number of blocks allocated (-1 if not available) */
#if HAVE_STRUCT_STAT_ST_BLOCKS
- sarray->data[12 * stride] = sb.st_blocks;
+ sarray->base_addr[12 * stride] = sb.st_blocks;
#else
- sarray->data[12 * stride] = -1;
+ sarray->base_addr[12 * stride] = -1;
#endif
}
@@ -475,54 +475,54 @@ fstat_i8_sub (GFC_INTEGER_8 *unit, gfc_array_i8 *sarray, GFC_INTEGER_8 *status)
index_type stride = GFC_DESCRIPTOR_STRIDE(sarray,0);
/* Device ID */
- sarray->data[0] = sb.st_dev;
+ sarray->base_addr[0] = sb.st_dev;
/* Inode number */
- sarray->data[stride] = sb.st_ino;
+ sarray->base_addr[stride] = sb.st_ino;
/* File mode */
- sarray->data[2 * stride] = sb.st_mode;
+ sarray->base_addr[2 * stride] = sb.st_mode;
/* Number of (hard) links */
- sarray->data[3 * stride] = sb.st_nlink;
+ sarray->base_addr[3 * stride] = sb.st_nlink;
/* Owner's uid */
- sarray->data[4 * stride] = sb.st_uid;
+ sarray->base_addr[4 * stride] = sb.st_uid;
/* Owner's gid */
- sarray->data[5 * stride] = sb.st_gid;
+ sarray->base_addr[5 * stride] = sb.st_gid;
/* ID of device containing directory entry for file (0 if not available) */
#if HAVE_STRUCT_STAT_ST_RDEV
- sarray->data[6 * stride] = sb.st_rdev;
+ sarray->base_addr[6 * stride] = sb.st_rdev;
#else
- sarray->data[6 * stride] = 0;
+ sarray->base_addr[6 * stride] = 0;
#endif
/* File size (bytes) */
- sarray->data[7 * stride] = sb.st_size;
+ sarray->base_addr[7 * stride] = sb.st_size;
/* Last access time */
- sarray->data[8 * stride] = sb.st_atime;
+ sarray->base_addr[8 * stride] = sb.st_atime;
/* Last modification time */
- sarray->data[9 * stride] = sb.st_mtime;
+ sarray->base_addr[9 * stride] = sb.st_mtime;
/* Last file status change time */
- sarray->data[10 * stride] = sb.st_ctime;
+ sarray->base_addr[10 * stride] = sb.st_ctime;
/* Preferred I/O block size (-1 if not available) */
#if HAVE_STRUCT_STAT_ST_BLKSIZE
- sarray->data[11 * stride] = sb.st_blksize;
+ sarray->base_addr[11 * stride] = sb.st_blksize;
#else
- sarray->data[11 * stride] = -1;
+ sarray->base_addr[11 * stride] = -1;
#endif
/* Number of blocks allocated (-1 if not available) */
#if HAVE_STRUCT_STAT_ST_BLOCKS
- sarray->data[12 * stride] = sb.st_blocks;
+ sarray->base_addr[12 * stride] = sb.st_blocks;
#else
- sarray->data[12 * stride] = -1;
+ sarray->base_addr[12 * stride] = -1;
#endif
}
diff --git a/libgfortran/intrinsics/transpose_generic.c b/libgfortran/intrinsics/transpose_generic.c
index b0c2fff5719..03fbbef24ed 100644
--- a/libgfortran/intrinsics/transpose_generic.c
+++ b/libgfortran/intrinsics/transpose_generic.c
@@ -1,8 +1,8 @@
/* Implementation of the TRANSPOSE intrinsic
- Copyright 2003, 2006, 2007, 2009 Free Software Foundation, Inc.
+ Copyright 2003, 2006, 2007, 2009, 2012 Free Software Foundation, Inc.
Contributed by Tobias Schlüter
-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
@@ -50,7 +50,7 @@ transpose_internal (gfc_array_char *ret, gfc_array_char *source)
size = GFC_DESCRIPTOR_SIZE(ret);
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
assert (ret->dtype == source->dtype);
@@ -60,7 +60,7 @@ transpose_internal (gfc_array_char *ret, gfc_array_char *source)
GFC_DIMENSION_SET(ret->dim[1], 0, GFC_DESCRIPTOR_EXTENT(source,0) - 1,
GFC_DESCRIPTOR_EXTENT(source, 1));
- ret->data = internal_malloc_size (size * size0 ((array_t*)ret));
+ ret->base_addr = internal_malloc_size (size * size0 ((array_t*)ret));
ret->offset = 0;
}
else if (unlikely (compile_options.bounds_check))
@@ -95,8 +95,8 @@ transpose_internal (gfc_array_char *ret, gfc_array_char *source)
rxstride = GFC_DESCRIPTOR_STRIDE_BYTES(ret,0);
rystride = GFC_DESCRIPTOR_STRIDE_BYTES(ret,1);
- rptr = ret->data;
- sptr = source->data;
+ rptr = ret->base_addr;
+ sptr = source->base_addr;
for (y = 0; y < ycount; y++)
{
diff --git a/libgfortran/intrinsics/unpack_generic.c b/libgfortran/intrinsics/unpack_generic.c
index db624996def..123f5e1980f 100644
--- a/libgfortran/intrinsics/unpack_generic.c
+++ b/libgfortran/intrinsics/unpack_generic.c
@@ -1,9 +1,9 @@
/* Generic implementation of the UNPACK intrinsic
- Copyright 2002, 2003, 2004, 2005, 2007, 2009, 2010
+ Copyright 2002, 2003, 2004, 2005, 2007, 2009, 2010, 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
@@ -49,7 +49,7 @@ unpack_bounds (gfc_array_char *ret, const gfc_array_char *vector,
bounds_equal_extents ((array_t *) field, (array_t *) mask,
"FIELD", "UNPACK");
- if (ret->data != NULL)
+ if (ret->base_addr != NULL)
bounds_equal_extents ((array_t *) ret, (array_t *) mask,
"return value", "UNPACK");
@@ -87,7 +87,7 @@ unpack_internal (gfc_array_char *ret, const gfc_array_char *vector,
empty = 0;
- mptr = mask->data;
+ mptr = mask->base_addr;
/* Use the same loop for all logical types, by using GFC_LOGICAL_1
and using shifting to address size and endian issues. */
@@ -107,7 +107,7 @@ unpack_internal (gfc_array_char *ret, const gfc_array_char *vector,
else
runtime_error ("Funny sized logical array");
- if (ret->data == NULL)
+ if (ret->base_addr == NULL)
{
/* The front end has signalled that we need to populate the
return array descriptor. */
@@ -126,7 +126,7 @@ unpack_internal (gfc_array_char *ret, const gfc_array_char *vector,
rs *= extent[n];
}
ret->offset = 0;
- ret->data = internal_malloc_size (rs * size);
+ ret->base_addr = internal_malloc_size (rs * size);
}
else
{
@@ -149,9 +149,9 @@ unpack_internal (gfc_array_char *ret, const gfc_array_char *vector,
rstride0 = rstride[0];
fstride0 = fstride[0];
mstride0 = mstride[0];
- rptr = ret->data;
- fptr = field->data;
- vptr = vector->data;
+ rptr = ret->base_addr;
+ fptr = field->base_addr;
+ vptr = vector->base_addr;
while (rptr)
{
@@ -317,8 +317,8 @@ unpack1 (gfc_array_char *ret, const gfc_array_char *vector,
#endif
case GFC_DTYPE_DERIVED_2:
- if (GFC_UNALIGNED_2(ret->data) || GFC_UNALIGNED_2(vector->data)
- || GFC_UNALIGNED_2(field->data))
+ if (GFC_UNALIGNED_2(ret->base_addr) || GFC_UNALIGNED_2(vector->base_addr)
+ || GFC_UNALIGNED_2(field->base_addr))
break;
else
{
@@ -328,8 +328,8 @@ unpack1 (gfc_array_char *ret, const gfc_array_char *vector,
}
case GFC_DTYPE_DERIVED_4:
- if (GFC_UNALIGNED_4(ret->data) || GFC_UNALIGNED_4(vector->data)
- || GFC_UNALIGNED_4(field->data))
+ if (GFC_UNALIGNED_4(ret->base_addr) || GFC_UNALIGNED_4(vector->base_addr)
+ || GFC_UNALIGNED_4(field->base_addr))
break;
else
{
@@ -339,8 +339,8 @@ unpack1 (gfc_array_char *ret, const gfc_array_char *vector,
}
case GFC_DTYPE_DERIVED_8:
- if (GFC_UNALIGNED_8(ret->data) || GFC_UNALIGNED_8(vector->data)
- || GFC_UNALIGNED_8(field->data))
+ if (GFC_UNALIGNED_8(ret->base_addr) || GFC_UNALIGNED_8(vector->base_addr)
+ || GFC_UNALIGNED_8(field->base_addr))
break;
else
{
@@ -351,8 +351,9 @@ unpack1 (gfc_array_char *ret, const gfc_array_char *vector,
#ifdef HAVE_GFC_INTEGER_16
case GFC_DTYPE_DERIVED_16:
- if (GFC_UNALIGNED_16(ret->data) || GFC_UNALIGNED_16(vector->data)
- || GFC_UNALIGNED_16(field->data))
+ if (GFC_UNALIGNED_16(ret->base_addr)
+ || GFC_UNALIGNED_16(vector->base_addr)
+ || GFC_UNALIGNED_16(field->base_addr))
break;
else
{
@@ -527,7 +528,7 @@ unpack0 (gfc_array_char *ret, const gfc_array_char *vector,
#endif
case GFC_DTYPE_DERIVED_2:
- if (GFC_UNALIGNED_2(ret->data) || GFC_UNALIGNED_2(vector->data)
+ if (GFC_UNALIGNED_2(ret->base_addr) || GFC_UNALIGNED_2(vector->base_addr)
|| GFC_UNALIGNED_2(field))
break;
else
@@ -538,7 +539,7 @@ unpack0 (gfc_array_char *ret, const gfc_array_char *vector,
}
case GFC_DTYPE_DERIVED_4:
- if (GFC_UNALIGNED_4(ret->data) || GFC_UNALIGNED_4(vector->data)
+ if (GFC_UNALIGNED_4(ret->base_addr) || GFC_UNALIGNED_4(vector->base_addr)
|| GFC_UNALIGNED_4(field))
break;
else
@@ -549,7 +550,7 @@ unpack0 (gfc_array_char *ret, const gfc_array_char *vector,
}
case GFC_DTYPE_DERIVED_8:
- if (GFC_UNALIGNED_8(ret->data) || GFC_UNALIGNED_8(vector->data)
+ if (GFC_UNALIGNED_8(ret->base_addr) || GFC_UNALIGNED_8(vector->base_addr)
|| GFC_UNALIGNED_8(field))
break;
else
@@ -561,7 +562,8 @@ unpack0 (gfc_array_char *ret, const gfc_array_char *vector,
#ifdef HAVE_GFC_INTEGER_16
case GFC_DTYPE_DERIVED_16:
- if (GFC_UNALIGNED_16(ret->data) || GFC_UNALIGNED_16(vector->data)
+ if (GFC_UNALIGNED_16(ret->base_addr)
+ || GFC_UNALIGNED_16(vector->base_addr)
|| GFC_UNALIGNED_16(field))
break;
else
@@ -576,7 +578,7 @@ unpack0 (gfc_array_char *ret, const gfc_array_char *vector,
memset (&tmp, 0, sizeof (tmp));
tmp.dtype = 0;
- tmp.data = field;
+ tmp.base_addr = field;
unpack_internal (ret, vector, mask, &tmp, GFC_DESCRIPTOR_SIZE (vector));
}
@@ -600,7 +602,7 @@ unpack0_char (gfc_array_char *ret,
memset (&tmp, 0, sizeof (tmp));
tmp.dtype = 0;
- tmp.data = field;
+ tmp.base_addr = field;
unpack_internal (ret, vector, mask, &tmp, vector_length);
}
@@ -624,7 +626,7 @@ unpack0_char4 (gfc_array_char *ret,
memset (&tmp, 0, sizeof (tmp));
tmp.dtype = 0;
- tmp.data = field;
+ tmp.base_addr = field;
unpack_internal (ret, vector, mask, &tmp,
vector_length * sizeof (gfc_char4_t));
}