1 /* Implementation of the NORM2 intrinsic
2 Copyright (C) 2010-2018 Free Software Foundation, Inc.
3 Contributed by Tobias Burnus <burnus@net-b.de>
5 This file is part of the GNU Fortran runtime library (libgfortran).
7 Libgfortran is free software; you can redistribute it and/or
8 modify it under the terms of the GNU General Public
9 License as published by the Free Software Foundation; either
10 version 3 of the License, or (at your option) any later version.
12 Libgfortran is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 Under Section 7 of GPL version 3, you are granted additional
18 permissions described in the GCC Runtime Library Exception, version
19 3.1, as published by the Free Software Foundation.
21 You should have received a copy of the GNU General Public License and
22 a copy of the GCC Runtime Library Exception along with this program;
23 see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 <http://www.gnu.org/licenses/>. */
26 #include "libgfortran.h"
30 #if defined (HAVE_GFC_REAL_8) && defined (HAVE_GFC_REAL_8) && defined (HAVE_SQRT) && defined (HAVE_FABS)
32 #define MATHFUNC(funcname) funcname
35 extern void norm2_r8 (gfc_array_r8
* const restrict
,
36 gfc_array_r8
* const restrict
, const index_type
* const restrict
);
37 export_proto(norm2_r8
);
40 norm2_r8 (gfc_array_r8
* const restrict retarray
,
41 gfc_array_r8
* const restrict array
,
42 const index_type
* const restrict pdim
)
44 index_type count
[GFC_MAX_DIMENSIONS
];
45 index_type extent
[GFC_MAX_DIMENSIONS
];
46 index_type sstride
[GFC_MAX_DIMENSIONS
];
47 index_type dstride
[GFC_MAX_DIMENSIONS
];
48 const GFC_REAL_8
* restrict base
;
49 GFC_REAL_8
* restrict dest
;
57 /* Make dim zero based to avoid confusion. */
58 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
61 if (unlikely (dim
< 0 || dim
> rank
))
63 runtime_error ("Dim argument incorrect in NORM intrinsic: "
64 "is %ld, should be between 1 and %ld",
65 (long int) dim
+ 1, (long int) rank
+ 1);
68 len
= GFC_DESCRIPTOR_EXTENT(array
,dim
);
71 delta
= GFC_DESCRIPTOR_STRIDE(array
,dim
);
73 for (n
= 0; n
< dim
; n
++)
75 sstride
[n
] = GFC_DESCRIPTOR_STRIDE(array
,n
);
76 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
,n
);
81 for (n
= dim
; n
< rank
; n
++)
83 sstride
[n
] = GFC_DESCRIPTOR_STRIDE(array
, n
+ 1);
84 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
, n
+ 1);
90 if (retarray
->base_addr
== NULL
)
92 size_t alloc_size
, str
;
94 for (n
= 0; n
< rank
; n
++)
99 str
= GFC_DESCRIPTOR_STRIDE(retarray
,n
-1) * extent
[n
-1];
101 GFC_DIMENSION_SET(retarray
->dim
[n
], 0, extent
[n
] - 1, str
);
105 retarray
->offset
= 0;
106 GFC_DTYPE_COPY_SETRANK(retarray
,array
,rank
);
108 alloc_size
= GFC_DESCRIPTOR_STRIDE(retarray
,rank
-1) * extent
[rank
-1];
110 retarray
->base_addr
= xmallocarray (alloc_size
, sizeof (GFC_REAL_8
));
113 /* Make sure we have a zero-sized array. */
114 GFC_DIMENSION_SET(retarray
->dim
[0], 0, -1, 1);
121 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
122 runtime_error ("rank of return array incorrect in"
123 " NORM intrinsic: is %ld, should be %ld",
124 (long int) (GFC_DESCRIPTOR_RANK (retarray
)),
127 if (unlikely (compile_options
.bounds_check
))
128 bounds_ifunction_return ((array_t
*) retarray
, extent
,
129 "return value", "NORM");
132 for (n
= 0; n
< rank
; n
++)
135 dstride
[n
] = GFC_DESCRIPTOR_STRIDE(retarray
,n
);
140 base
= array
->base_addr
;
141 dest
= retarray
->base_addr
;
144 while (continue_loop
)
146 const GFC_REAL_8
* restrict src
;
158 #if ! defined HAVE_BACK_ARG
159 for (n
= 0; n
< len
; n
++, src
+= delta
)
165 GFC_REAL_8 absX
, val
;
166 absX
= MATHFUNC(fabs
) (*src
);
170 result
= 1 + result
* val
* val
;
180 result
= scale
* MATHFUNC(sqrt
) (result
);
184 /* Advance to the next element. */
189 while (count
[n
] == extent
[n
])
191 /* When we get to the end of a dimension, reset it and increment
192 the next dimension. */
194 /* We could precalculate these products, but this is a less
195 frequently used path so probably not worth it. */
196 base
-= sstride
[n
] * extent
[n
];
197 dest
-= dstride
[n
] * extent
[n
];
201 /* Break out of the loop. */