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

Subversion Repositories openrisc

[/] [openrisc/] [trunk/] [gnu-dev/] [or1k-gcc/] [libgfortran/] [generated/] [parity_l1.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
#if defined (HAVE_GFC_LOGICAL_1) && defined (HAVE_GFC_LOGICAL_1)
33
 
34
 
35
extern void parity_l1 (gfc_array_l1 * const restrict,
36
        gfc_array_l1 * const restrict, const index_type * const restrict);
37
export_proto(parity_l1);
38
 
39
void
40
parity_l1 (gfc_array_l1 * const restrict retarray,
41
        gfc_array_l1 * const restrict array,
42
        const index_type * const restrict pdim)
43
{
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_LOGICAL_1 * restrict base;
49
  GFC_LOGICAL_1 * restrict dest;
50
  index_type rank;
51
  index_type n;
52
  index_type len;
53
  index_type delta;
54
  index_type dim;
55
  int continue_loop;
56
 
57
  /* Make dim zero based to avoid confusion.  */
58
  dim = (*pdim) - 1;
59
  rank = GFC_DESCRIPTOR_RANK (array) - 1;
60
 
61
  len = GFC_DESCRIPTOR_EXTENT(array,dim);
62
  if (len < 0)
63
    len = 0;
64
  delta = GFC_DESCRIPTOR_STRIDE(array,dim);
65
 
66
  for (n = 0; n < dim; n++)
67
    {
68
      sstride[n] = GFC_DESCRIPTOR_STRIDE(array,n);
69
      extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
70
 
71
      if (extent[n] < 0)
72
        extent[n] = 0;
73
    }
74
  for (n = dim; n < rank; n++)
75
    {
76
      sstride[n] = GFC_DESCRIPTOR_STRIDE(array, n + 1);
77
      extent[n] = GFC_DESCRIPTOR_EXTENT(array, n + 1);
78
 
79
      if (extent[n] < 0)
80
        extent[n] = 0;
81
    }
82
 
83
  if (retarray->data == NULL)
84
    {
85
      size_t alloc_size, str;
86
 
87
      for (n = 0; n < rank; n++)
88
        {
89
          if (n == 0)
90
            str = 1;
91
          else
92
            str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
93
 
94
          GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
95
 
96
        }
97
 
98
      retarray->offset = 0;
99
      retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
100
 
101
      alloc_size = sizeof (GFC_LOGICAL_1) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
102
                   * extent[rank-1];
103
 
104
      if (alloc_size == 0)
105
        {
106
          /* Make sure we have a zero-sized array.  */
107
          GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
108
          return;
109
 
110
        }
111
      else
112
        retarray->data = internal_malloc_size (alloc_size);
113
    }
114
  else
115
    {
116
      if (rank != GFC_DESCRIPTOR_RANK (retarray))
117
        runtime_error ("rank of return array incorrect in"
118
                       " PARITY intrinsic: is %ld, should be %ld",
119
                       (long int) (GFC_DESCRIPTOR_RANK (retarray)),
120
                       (long int) rank);
121
 
122
      if (unlikely (compile_options.bounds_check))
123
        bounds_ifunction_return ((array_t *) retarray, extent,
124
                                 "return value", "PARITY");
125
    }
126
 
127
  for (n = 0; n < rank; n++)
128
    {
129
      count[n] = 0;
130
      dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
131
      if (extent[n] <= 0)
132
        return;
133
    }
134
 
135
  base = array->data;
136
  dest = retarray->data;
137
 
138
  continue_loop = 1;
139
  while (continue_loop)
140
    {
141
      const GFC_LOGICAL_1 * restrict src;
142
      GFC_LOGICAL_1 result;
143
      src = base;
144
      {
145
 
146
  result = 0;
147
        if (len <= 0)
148
          *dest = 0;
149
        else
150
          {
151
            for (n = 0; n < len; n++, src += delta)
152
              {
153
 
154
  result = result != *src;
155
              }
156
 
157
            *dest = result;
158
          }
159
      }
160
      /* Advance to the next element.  */
161
      count[0]++;
162
      base += sstride[0];
163
      dest += dstride[0];
164
      n = 0;
165
      while (count[n] == extent[n])
166
        {
167
          /* When we get to the end of a dimension, reset it and increment
168
             the next dimension.  */
169
          count[n] = 0;
170
          /* We could precalculate these products, but this is a less
171
             frequently used path so probably not worth it.  */
172
          base -= sstride[n] * extent[n];
173
          dest -= dstride[n] * extent[n];
174
          n++;
175
          if (n == rank)
176
            {
177
              /* Break out of the look.  */
178
              continue_loop = 0;
179
              break;
180
            }
181
          else
182
            {
183
              count[n]++;
184
              base += sstride[n];
185
              dest += dstride[n];
186
            }
187
        }
188
    }
189
}
190
 
191
#endif

powered by: WebSVN 2.1.0

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