1 /* Implementation of the NORM2 intrinsic
2 Copyright (C) 2010-2023 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_17) && defined (HAVE_GFC_REAL_17) && 1 /* FIXME: figure this out later. */ && 1 /* FIXME: figure this out later. */
32 #if defined(POWER_IEEE128)
33 #define MATHFUNC(funcname) __ ## funcname ## ieee128
34 #elif defined(GFC_REAL_17_USE_IEC_60559)
35 #define MATHFUNC(funcname) funcname ## f128
37 #define MATHFUNC(funcname) funcname ## q
41 extern void norm2_r17 (gfc_array_r17
* const restrict
,
42 gfc_array_r17
* const restrict
, const index_type
* const restrict
);
43 export_proto(norm2_r17
);
46 norm2_r17 (gfc_array_r17
* const restrict retarray
,
47 gfc_array_r17
* const restrict array
,
48 const index_type
* const restrict pdim
)
50 index_type count
[GFC_MAX_DIMENSIONS
];
51 index_type extent
[GFC_MAX_DIMENSIONS
];
52 index_type sstride
[GFC_MAX_DIMENSIONS
];
53 index_type dstride
[GFC_MAX_DIMENSIONS
];
54 const GFC_REAL_17
* restrict base
;
55 GFC_REAL_17
* restrict dest
;
63 /* Make dim zero based to avoid confusion. */
64 rank
= GFC_DESCRIPTOR_RANK (array
) - 1;
67 if (unlikely (dim
< 0 || dim
> rank
))
69 runtime_error ("Dim argument incorrect in NORM intrinsic: "
70 "is %ld, should be between 1 and %ld",
71 (long int) dim
+ 1, (long int) rank
+ 1);
74 len
= GFC_DESCRIPTOR_EXTENT(array
,dim
);
77 delta
= GFC_DESCRIPTOR_STRIDE(array
,dim
);
79 for (n
= 0; n
< dim
; n
++)
81 sstride
[n
] = GFC_DESCRIPTOR_STRIDE(array
,n
);
82 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
,n
);
87 for (n
= dim
; n
< rank
; n
++)
89 sstride
[n
] = GFC_DESCRIPTOR_STRIDE(array
, n
+ 1);
90 extent
[n
] = GFC_DESCRIPTOR_EXTENT(array
, n
+ 1);
96 if (retarray
->base_addr
== NULL
)
98 size_t alloc_size
, str
;
100 for (n
= 0; n
< rank
; n
++)
105 str
= GFC_DESCRIPTOR_STRIDE(retarray
,n
-1) * extent
[n
-1];
107 GFC_DIMENSION_SET(retarray
->dim
[n
], 0, extent
[n
] - 1, str
);
111 retarray
->offset
= 0;
112 retarray
->dtype
.rank
= rank
;
114 alloc_size
= GFC_DESCRIPTOR_STRIDE(retarray
,rank
-1) * extent
[rank
-1];
116 retarray
->base_addr
= xmallocarray (alloc_size
, sizeof (GFC_REAL_17
));
122 if (rank
!= GFC_DESCRIPTOR_RANK (retarray
))
123 runtime_error ("rank of return array incorrect in"
124 " NORM intrinsic: is %ld, should be %ld",
125 (long int) (GFC_DESCRIPTOR_RANK (retarray
)),
128 if (unlikely (compile_options
.bounds_check
))
129 bounds_ifunction_return ((array_t
*) retarray
, extent
,
130 "return value", "NORM");
133 for (n
= 0; n
< rank
; n
++)
136 dstride
[n
] = GFC_DESCRIPTOR_STRIDE(retarray
,n
);
141 base
= array
->base_addr
;
142 dest
= retarray
->base_addr
;
145 while (continue_loop
)
147 const GFC_REAL_17
* restrict src
;
159 #if ! defined HAVE_BACK_ARG
160 for (n
= 0; n
< len
; n
++, src
+= delta
)
166 GFC_REAL_17 absX
, val
;
167 absX
= MATHFUNC(fabs
) (*src
);
171 result
= 1 + result
* val
* val
;
181 result
= scale
* MATHFUNC(sqrt
) (result
);
185 /* Advance to the next element. */
190 while (count
[n
] == extent
[n
])
192 /* When we get to the end of a dimension, reset it and increment
193 the next dimension. */
195 /* We could precalculate these products, but this is a less
196 frequently used path so probably not worth it. */
197 base
-= sstride
[n
] * extent
[n
];
198 dest
-= dstride
[n
] * extent
[n
];
202 /* Break out of the loop. */