Implement a flag -fext-numeric-literals that allows control of whether GNU
[official-gcc.git] / libgfortran / generated / norm2_r16.c
blobfda5a205559025f6533a611de352ef9c6179e367
1 /* Implementation of the NORM2 intrinsic
2 Copyright 2010 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"
27 #include <stdlib.h>
28 #include <math.h>
29 #include <assert.h>
33 #if defined (HAVE_GFC_REAL_16) && defined (HAVE_GFC_REAL_16) && (defined(GFC_REAL_16_IS_FLOAT128) || defined(HAVE_SQRTL)) && (defined(GFC_REAL_16_IS_FLOAT128) || defined(HAVE_FABSL))
35 #if defined(GFC_REAL_16_IS_FLOAT128)
36 #define MATHFUNC(funcname) funcname ## q
37 #else
38 #define MATHFUNC(funcname) funcname ## l
39 #endif
42 extern void norm2_r16 (gfc_array_r16 * const restrict,
43 gfc_array_r16 * const restrict, const index_type * const restrict);
44 export_proto(norm2_r16);
46 void
47 norm2_r16 (gfc_array_r16 * const restrict retarray,
48 gfc_array_r16 * const restrict array,
49 const index_type * const restrict pdim)
51 index_type count[GFC_MAX_DIMENSIONS];
52 index_type extent[GFC_MAX_DIMENSIONS];
53 index_type sstride[GFC_MAX_DIMENSIONS];
54 index_type dstride[GFC_MAX_DIMENSIONS];
55 const GFC_REAL_16 * restrict base;
56 GFC_REAL_16 * restrict dest;
57 index_type rank;
58 index_type n;
59 index_type len;
60 index_type delta;
61 index_type dim;
62 int continue_loop;
64 /* Make dim zero based to avoid confusion. */
65 dim = (*pdim) - 1;
66 rank = GFC_DESCRIPTOR_RANK (array) - 1;
68 len = GFC_DESCRIPTOR_EXTENT(array,dim);
69 if (len < 0)
70 len = 0;
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);
78 if (extent[n] < 0)
79 extent[n] = 0;
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);
86 if (extent[n] < 0)
87 extent[n] = 0;
90 if (retarray->base_addr == NULL)
92 size_t alloc_size, str;
94 for (n = 0; n < rank; n++)
96 if (n == 0)
97 str = 1;
98 else
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 retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
108 alloc_size = sizeof (GFC_REAL_16) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
109 * extent[rank-1];
111 retarray->base_addr = xmalloc (alloc_size);
112 if (alloc_size == 0)
114 /* Make sure we have a zero-sized array. */
115 GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
116 return;
120 else
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)),
126 (long int) rank);
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++)
135 count[n] = 0;
136 dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
137 if (extent[n] <= 0)
138 return;
141 base = array->base_addr;
142 dest = retarray->base_addr;
144 continue_loop = 1;
145 while (continue_loop)
147 const GFC_REAL_16 * restrict src;
148 GFC_REAL_16 result;
149 src = base;
152 GFC_REAL_16 scale;
153 result = 0;
154 scale = 1;
155 if (len <= 0)
156 *dest = 0;
157 else
159 for (n = 0; n < len; n++, src += delta)
162 if (*src != 0)
164 GFC_REAL_16 absX, val;
165 absX = MATHFUNC(fabs) (*src);
166 if (scale < absX)
168 val = scale / absX;
169 result = 1 + result * val * val;
170 scale = absX;
172 else
174 val = absX / scale;
175 result += val * val;
179 result = scale * MATHFUNC(sqrt) (result);
180 *dest = result;
183 /* Advance to the next element. */
184 count[0]++;
185 base += sstride[0];
186 dest += dstride[0];
187 n = 0;
188 while (count[n] == extent[n])
190 /* When we get to the end of a dimension, reset it and increment
191 the next dimension. */
192 count[n] = 0;
193 /* We could precalculate these products, but this is a less
194 frequently used path so probably not worth it. */
195 base -= sstride[n] * extent[n];
196 dest -= dstride[n] * extent[n];
197 n++;
198 if (n == rank)
200 /* Break out of the look. */
201 continue_loop = 0;
202 break;
204 else
206 count[n]++;
207 base += sstride[n];
208 dest += dstride[n];
214 #endif