mirror of
git://gcc.gnu.org/git/gcc.git
synced 2025-01-11 08:04:31 +08:00
f21edfd62d
* intrinsics/c99_functions.c, intrinsics/eoshift0.c,
intrinsics/eoshift2.c, intrinsics/exit.c, intrinsics/flush.c,
intrinsics/ishftc.c, intrinsics/mvbits.c, intrinsics/pack_generic.c,
intrinsics/random.c, intrinsics/reshape_generic.c, intrinsics/size.c,
intrinsics/spread_generic.c, intrinsics/stat.c,
intrinsics/string_intrinsics.c, intrinsics/system_clock.c,
intrinsics/transpose_generic.c, intrinsics/unlink.c,
intrinsics/unpack_generic.c, io/backspace.c, io/format.c,
io/list_read.c, io/lock.c, io/open.c, io/transfer.c, io/unix.c,
io/write.c, runtime/environ.c, runtime/error.c,
runtime/in_pack_generic.c, runtime/in_unpack_generic.c, runtime/main.c,
runtime/memory.c, runtime/pause.c, runtime/stop.c,
runtime/string.c: Whitespace fixes.
From-SVN: r91794
53 lines
1.4 KiB
C
53 lines
1.4 KiB
C
/* Implementation of the size intrinsic.
|
|
Copyright 2002 Free Software Foundation, Inc.
|
|
Contributed by Paul Brook <paul@nowt.org>
|
|
|
|
This file is part of the GNU Fortran 95 runtime library (libgfor).
|
|
|
|
Libgfor is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2.1 of the License, or (at your option) any later version.
|
|
|
|
Libgfor is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with libgfor; see the file COPYING.LIB. If not,
|
|
write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
#include "libgfortran.h"
|
|
|
|
index_type size0 (const array_t * array)
|
|
{
|
|
int n;
|
|
index_type size;
|
|
index_type len;
|
|
|
|
size = 1;
|
|
for (n = 0; n < GFC_DESCRIPTOR_RANK (array); n++)
|
|
{
|
|
len = array->dim[n].ubound + 1 - array->dim[n].lbound;
|
|
if (len < 0)
|
|
len = 0;
|
|
size *= len;
|
|
}
|
|
return size;
|
|
}
|
|
|
|
#define size1 prefix(size1)
|
|
index_type size1 (const array_t * array, index_type dim)
|
|
{
|
|
index_type size;
|
|
|
|
dim--;
|
|
|
|
size = array->dim[dim].ubound + 1 - array->dim[dim].lbound;
|
|
if (size < 0)
|
|
size = 0;
|
|
return size;
|
|
}
|