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

Subversion Repositories openrisc

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

Details | Compare with Previous | View Log

Line No. Rev Author Line
1 733 jeremybenn
/* Implementation of the ANY intrinsic
2
   Copyright 2002, 2007, 2009, 2010 Free Software Foundation, Inc.
3
   Contributed by Paul Brook <paul@nowt.org>
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 <assert.h>
29
 
30
 
31
#if defined (HAVE_GFC_LOGICAL_16)
32
 
33
 
34
extern void any_l16 (gfc_array_l16 * const restrict,
35
        gfc_array_l1 * const restrict, const index_type * const restrict);
36
export_proto(any_l16);
37
 
38
void
39
any_l16 (gfc_array_l16 * const restrict retarray,
40
        gfc_array_l1 * const restrict array,
41
        const index_type * const restrict pdim)
42
{
43
  index_type count[GFC_MAX_DIMENSIONS];
44
  index_type extent[GFC_MAX_DIMENSIONS];
45
  index_type sstride[GFC_MAX_DIMENSIONS];
46
  index_type dstride[GFC_MAX_DIMENSIONS];
47
  const GFC_LOGICAL_1 * restrict base;
48
  GFC_LOGICAL_16 * restrict dest;
49
  index_type rank;
50
  index_type n;
51
  index_type len;
52
  index_type delta;
53
  index_type dim;
54
  int src_kind;
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
  src_kind = GFC_DESCRIPTOR_SIZE (array);
62
 
63
  len = GFC_DESCRIPTOR_EXTENT(array,dim);
64
  if (len < 0)
65
    len = 0;
66
 
67
  delta = GFC_DESCRIPTOR_STRIDE_BYTES(array,dim);
68
 
69
  for (n = 0; n < dim; n++)
70
    {
71
      sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,n);
72
      extent[n] = GFC_DESCRIPTOR_EXTENT(array,n);
73
 
74
      if (extent[n] < 0)
75
        extent[n] = 0;
76
    }
77
  for (n = dim; n < rank; n++)
78
    {
79
      sstride[n] = GFC_DESCRIPTOR_STRIDE_BYTES(array,n + 1);
80
      extent[n] = GFC_DESCRIPTOR_EXTENT(array,n + 1);
81
 
82
      if (extent[n] < 0)
83
        extent[n] = 0;
84
    }
85
 
86
  if (retarray->data == NULL)
87
    {
88
      size_t alloc_size, str;
89
 
90
      for (n = 0; n < rank; n++)
91
        {
92
          if (n == 0)
93
            str = 1;
94
          else
95
            str = GFC_DESCRIPTOR_STRIDE(retarray,n-1) * extent[n-1];
96
 
97
          GFC_DIMENSION_SET(retarray->dim[n], 0, extent[n] - 1, str);
98
 
99
        }
100
 
101
      retarray->offset = 0;
102
      retarray->dtype = (array->dtype & ~GFC_DTYPE_RANK_MASK) | rank;
103
 
104
      alloc_size = sizeof (GFC_LOGICAL_16) * GFC_DESCRIPTOR_STRIDE(retarray,rank-1)
105
                   * extent[rank-1];
106
 
107
      if (alloc_size == 0)
108
        {
109
          /* Make sure we have a zero-sized array.  */
110
          GFC_DIMENSION_SET(retarray->dim[0], 0, -1, 1);
111
          return;
112
        }
113
      else
114
        retarray->data = internal_malloc_size (alloc_size);
115
    }
116
  else
117
    {
118
      if (rank != GFC_DESCRIPTOR_RANK (retarray))
119
        runtime_error ("rank of return array incorrect in"
120
                       " ANY intrinsic: is %ld, should be %ld",
121
                       (long int) GFC_DESCRIPTOR_RANK (retarray),
122
                       (long int) rank);
123
 
124
      if (unlikely (compile_options.bounds_check))
125
        {
126
          for (n=0; n < rank; n++)
127
            {
128
              index_type ret_extent;
129
 
130
              ret_extent = GFC_DESCRIPTOR_EXTENT(retarray,n);
131
              if (extent[n] != ret_extent)
132
                runtime_error ("Incorrect extent in return value of"
133
                               " ANY intrinsic in dimension %d:"
134
                               " is %ld, should be %ld", (int) n + 1,
135
                               (long int) ret_extent, (long int) extent[n]);
136
            }
137
        }
138
    }
139
 
140
  for (n = 0; n < rank; n++)
141
    {
142
      count[n] = 0;
143
      dstride[n] = GFC_DESCRIPTOR_STRIDE(retarray,n);
144
      if (extent[n] <= 0)
145
        return;
146
    }
147
 
148
  base = array->data;
149
 
150
  if (src_kind == 1 || src_kind == 2 || src_kind == 4 || src_kind == 8
151
#ifdef HAVE_GFC_LOGICAL_16
152
      || src_kind == 16
153
#endif
154
    )
155
    {
156
      if (base)
157
        base = GFOR_POINTER_TO_L1 (base, src_kind);
158
    }
159
  else
160
    internal_error (NULL, "Funny sized logical array in ANY intrinsic");
161
 
162
  dest = retarray->data;
163
 
164
  continue_loop = 1;
165
  while (continue_loop)
166
    {
167
      const GFC_LOGICAL_1 * restrict src;
168
      GFC_LOGICAL_16 result;
169
      src = base;
170
      {
171
 
172
  result = 0;
173
        if (len <= 0)
174
          *dest = 0;
175
        else
176
          {
177
            for (n = 0; n < len; n++, src += delta)
178
              {
179
 
180
  /* Return true if any of the elements are set.  */
181
  if (*src)
182
    {
183
      result = 1;
184
      break;
185
    }
186
          }
187
            *dest = result;
188
          }
189
      }
190
      /* Advance to the next element.  */
191
      count[0]++;
192
      base += sstride[0];
193
      dest += dstride[0];
194
      n = 0;
195
      while (count[n] == extent[n])
196
        {
197
          /* When we get to the end of a dimension, reset it and increment
198
             the next dimension.  */
199
          count[n] = 0;
200
          /* We could precalculate these products, but this is a less
201
             frequently used path so probably not worth it.  */
202
          base -= sstride[n] * extent[n];
203
          dest -= dstride[n] * extent[n];
204
          n++;
205
          if (n == rank)
206
            {
207
              /* Break out of the look.  */
208
              continue_loop = 0;
209
              break;
210
            }
211
          else
212
            {
213
              count[n]++;
214
              base += sstride[n];
215
              dest += dstride[n];
216
            }
217
        }
218
    }
219
}
220
 
221
#endif

powered by: WebSVN 2.1.0

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