X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=libgfortran%2Fgenerated%2Fminloc0_8_i16.c;h=8c4153e855d029c7eea4334fc8baf698718e5411;hb=4d8cd3a26294ce35abb17668eac2b6c38dd23bd0;hp=980cd7e4a8f52c9e88b39854485b5043aa01ab43;hpb=b209d8dc611f3cd793491b8490522bdaf819622b;p=platform%2Fupstream%2Fgcc48.git diff --git a/libgfortran/generated/minloc0_8_i16.c b/libgfortran/generated/minloc0_8_i16.c index 980cd7e..8c4153e 100644 --- a/libgfortran/generated/minloc0_8_i16.c +++ b/libgfortran/generated/minloc0_8_i16.c @@ -1,5 +1,5 @@ /* Implementation of the MINLOC intrinsic - Copyright 2002, 2007, 2009 Free Software Foundation, Inc. + Copyright (C) 2002-2013 Free Software Foundation, Inc. Contributed by Paul Brook This file is part of the GNU Fortran 95 runtime library (libgfortran). @@ -53,12 +53,12 @@ minloc0_8_i16 (gfc_array_i8 * 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_8) * rank); + retarray->base_addr = xmalloc (sizeof (GFC_INTEGER_8) * rank); } else { @@ -68,7 +68,7 @@ minloc0_8_i16 (gfc_array_i8 * 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 @@ minloc0_8_i16 (gfc_array_i8 * const restrict retarray, } } - base = array->data; + base = array->base_addr; /* Initialize the return value. */ for (n = 0; n < rank; n++) @@ -194,12 +194,12 @@ mminloc0_8_i16 (gfc_array_i8 * 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_8) * rank); + retarray->base_addr = xmalloc (sizeof (GFC_INTEGER_8) * rank); } else { @@ -215,7 +215,7 @@ mminloc0_8_i16 (gfc_array_i8 * 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 @@ mminloc0_8_i16 (gfc_array_i8 * 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 @@ mminloc0_8_i16 (gfc_array_i8 * const restrict retarray, } } - base = array->data; + base = array->base_addr; /* Initialize the return value. */ for (n = 0; n < rank; n++) @@ -362,12 +362,12 @@ sminloc0_8_i16 (gfc_array_i8 * 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_8) * rank); + retarray->base_addr = xmalloc (sizeof (GFC_INTEGER_8) * rank); } else if (unlikely (compile_options.bounds_check)) { @@ -376,7 +376,7 @@ sminloc0_8_i16 (gfc_array_i8 * const restrict retarray, } dstride = GFC_DESCRIPTOR_STRIDE(retarray,0); - dest = retarray->data; + dest = retarray->base_addr; for (n = 0; n