X-Git-Url: https://git.libre-soc.org/?a=blobdiff_plain;f=libgfortran%2Fgenerated%2Fsum_i1.c;h=244c3ac3568c89080a11f0275b87c1d1fb7b4d1b;hb=e3c063ceda2aad832267b81c14e2e5e18023371c;hp=d839b0fee68e40d7bca27862440a1ae4f9091bd5;hpb=0cd0559e8ceb1764a41c8964f30a7de025956e8a;p=gcc.git diff --git a/libgfortran/generated/sum_i1.c b/libgfortran/generated/sum_i1.c index d839b0fee68..244c3ac3568 100644 --- a/libgfortran/generated/sum_i1.c +++ b/libgfortran/generated/sum_i1.c @@ -1,5 +1,5 @@ /* Implementation of the SUM 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). @@ -79,7 +79,7 @@ sum_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 @@ sum_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 = xmalloc (alloc_size); if (alloc_size == 0) { /* Make sure we have a zero-sized array. */ @@ -107,8 +108,6 @@ sum_i1 (gfc_array_i1 * const restrict retarray, return; } - else - retarray->data = internal_malloc_size (alloc_size); } else { @@ -128,11 +127,11 @@ sum_i1 (gfc_array_i1 * const restrict retarray, count[n] = 0; dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n); if (extent[n] <= 0) - len = 0; + 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 @@ msum_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 @@ msum_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 @@ msum_i1 (gfc_array_i1 * const restrict retarray, return; } else - retarray->data = internal_malloc_size (alloc_size); + retarray->base_addr = xmalloc (alloc_size); } else @@ -311,8 +310,8 @@ msum_i1 (gfc_array_i1 * const restrict retarray, return; } - dest = retarray->data; - base = array->data; + dest = retarray->base_addr; + base = array->base_addr; while (base) { @@ -324,18 +323,13 @@ msum_i1 (gfc_array_i1 * const restrict retarray, { result = 0; - if (len <= 0) - *dest = 0; - else + for (n = 0; n < len; n++, src += delta, msrc += mdelta) { - for (n = 0; n < len; n++, src += delta, msrc += mdelta) - { if (*msrc) result += *src; - } - *dest = result; } + *dest = result; } /* Advance to the next element. */ count[0]++; @@ -418,7 +412,7 @@ ssum_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 +440,7 @@ ssum_i1 (gfc_array_i1 * const restrict retarray, return; } else - retarray->data = internal_malloc_size (alloc_size); + retarray->base_addr = xmalloc (alloc_size); } else { @@ -478,7 +472,7 @@ ssum_i1 (gfc_array_i1 * const restrict retarray, dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n); } - dest = retarray->data; + dest = retarray->base_addr; while(1) {