OpenCores
URL https://opencores.org/ocsvn/openrisc/openrisc/trunk

Subversion Repositories openrisc

[/] [openrisc/] [trunk/] [gnu-dev/] [or1k-gcc/] [libgfortran/] [generated/] [norm2_r16.c] - Blame information for rev 733

Details | Compare with Previous | View Log

Line No. Rev Author Line
1 733 jeremybenn
/* Implementation of the NORM2 intrinsic
2
   Copyright 2010 Free Software Foundation, Inc.
3
   Contributed by Tobias Burnus  <burnus@net-b.de>
4
 
5
This file is part of the GNU Fortran runtime library (libgfortran).
6
 
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.
11
 
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.
16
 
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.
20
 
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/>.  */
25
 
26
#include "libgfortran.h"
27
#include <stdlib.h>
28
#include <math.h>
29
#include <assert.h>
30
 
31
 
32
 
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))
34
 
35
#if defined(GFC_REAL_16_IS_FLOAT128)
36
#define MATHFUNC(funcname) funcname ## q
37
#else
38
#define MATHFUNC(funcname) funcname ## l
39
#endif
40
 
41
 
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);
45
 
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)
50
{
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;
63
 
64
  /* Make dim zero based to avoid confusion.  */
65
  dim = (*pdim) - 1;
66
  rank = GFC_DESCRIPTOR_RANK (array) - 1;
67
 
68
  len = GFC_DESCRIPTOR_EXTENT(array,dim);
69
  if (len < 0)
70
    len = 0;
71
  delta = GFC_DESCRIPTOR_STRIDE(array,dim);
72
 
73
  for (n = 0; n < dim; n++)
74
    {
75
      sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n);
76
      extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
77
 
78
      if (extent[n] < 0)
79
        extent[n] = 0;
80
    }
81
  for (n = dim; n < rank; n++)
82
    {
83
      sstride[n] = GFC_DESCRIPTOR_STRIDE(array, n + 1);
84
      extent[n] = GFC_DESCRIPTOR_EXTENT(array, n + 1);
85
 
86
      if (extent[n] < 0)
87
        extent[n] = 0;
88
    }
89
 
90
  if (retarray->data == NULL)
91
    {
92
      size_t alloc_size, str;
93
 
94
      for (n = 0; n < rank; n++)
95
        {
96
          if (n == 0)
97
            str = 1;
98
          else
99
            str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
100
 
101
          GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
102
 
103
        }
104
 
105
      retarray->offset = 0;
106
      retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
107
 
108
      alloc_size = sizeof (GFC_REAL_16) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
109
                   * extent[rank-1];
110
 
111
      if (alloc_size == 0)
112
        {
113
          /* Make sure we have a zero-sized array.  */
114
          GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
115
          return;
116
 
117
        }
118
      else
119
        retarray->data = internal_malloc_size (alloc_size);
120
    }
121
  else
122
    {
123
      if (rank != GFC_DESCRIPTOR_RANK (retarray))
124
        runtime_error ("rank of return array incorrect in"
125
                       " NORM intrinsic: is %ld, should be %ld",
126
                       (long int) (GFC_DESCRIPTOR_RANK (retarray)),
127
                       (long int) rank);
128
 
129
      if (unlikely (compile_options.bounds_check))
130
        bounds_ifunction_return ((array_t *) retarray, extent,
131
                                 "return value", "NORM");
132
    }
133
 
134
  for (n = 0; n < rank; n++)
135
    {
136
      count[n] = 0;
137
      dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
138
      if (extent[n] <= 0)
139
        return;
140
    }
141
 
142
  base = array->data;
143
  dest = retarray->data;
144
 
145
  continue_loop = 1;
146
  while (continue_loop)
147
    {
148
      const GFC_REAL_16 * restrict src;
149
      GFC_REAL_16 result;
150
      src = base;
151
      {
152
 
153
        GFC_REAL_16 scale;
154
        result = 0;
155
        scale = 1;
156
        if (len <= 0)
157
          *dest = 0;
158
        else
159
          {
160
            for (n = 0; n < len; n++, src += delta)
161
              {
162
 
163
          if (*src != 0)
164
            {
165
              GFC_REAL_16 absX, val;
166
              absX = MATHFUNC(fabs) (*src);
167
              if (scale < absX)
168
                {
169
                  val = scale / absX;
170
                  result = 1 + result * val * val;
171
                  scale = absX;
172
                }
173
              else
174
                {
175
                  val = absX / scale;
176
                  result += val * val;
177
                }
178
            }
179
              }
180
            result = scale * MATHFUNC(sqrt) (result);
181
            *dest = result;
182
          }
183
      }
184
      /* Advance to the next element.  */
185
      count[0]++;
186
      base += sstride[0];
187
      dest += dstride[0];
188
      n = 0;
189
      while (count[n] == extent[n])
190
        {
191
          /* When we get to the end of a dimension, reset it and increment
192
             the next dimension.  */
193
          count[n] = 0;
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];
198
          n++;
199
          if (n == rank)
200
            {
201
              /* Break out of the look.  */
202
              continue_loop = 0;
203
              break;
204
            }
205
          else
206
            {
207
              count[n]++;
208
              base += sstride[n];
209
              dest += dstride[n];
210
            }
211
        }
212
    }
213
}
214
 
215
#endif

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.