summaryrefslogtreecommitdiff
path: root/libgfortran/m4/shape.m4
blob: b189f804e55095635c17c52a2fce84c17f61f2af (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
`/* Implementation of the SHAPE intrinsic
   Copyright 2002, 2006, 2007, 2009 Free Software Foundation, Inc.
   Contributed by Paul Brook <paul@nowt.org>

This file is part of the GNU Fortran 95 runtime library (libgfortran).

Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
License as published by the Free Software Foundation; either
version 3 of the License, or (at your option) any later version.

Libgfortran 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 General Public License for more details.

Under Section 7 of GPL version 3, you are granted additional
permissions described in the GCC Runtime Library Exception, version
3.1, as published by the Free Software Foundation.

You should have received a copy of the GNU General Public License and
a copy of the GCC Runtime Library Exception along with this program;
see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
<http://www.gnu.org/licenses/>.  */

#include "libgfortran.h"
#include <stdlib.h>
#include <assert.h>'

include(iparm.m4)dnl

`#if defined (HAVE_'rtype_name`)

extern void shape_'rtype_kind` ('rtype` * const restrict ret, 
	const 'rtype` * const restrict array);
export_proto(shape_'rtype_kind`);

void
shape_'rtype_kind` ('rtype` * const restrict ret, 
	const 'rtype` * const restrict array)
{
  int n;
  index_type stride;
  index_type extent;

  stride = ret->dim[0].stride;

  if (ret->dim[0].ubound < ret->dim[0].lbound)
    return;

  for (n = 0; n < GFC_DESCRIPTOR_RANK (array); n++)
    {
      extent = array->dim[n].ubound + 1 - array->dim[n].lbound;
      ret->data[n * stride] = extent > 0 ? extent : 0 ;
    }
}

#endif'