1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
|
/* Implementation of the FINDLOC intrinsic
Copyright (C) 2018-2020 Free Software Foundation, Inc.
Contributed by Thomas König <tk@tkoenig.net>
This file is part of the GNU Fortran 95 runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
License as published by the Free Software Foundation; either
version 3 of the License, or (at your option) any later version.
Libgfortran is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
Under Section 7 of GPL version 3, you are granted additional
permissions described in the GCC Runtime Library Exception, version
3.1, as published by the Free Software Foundation.
You should have received a copy of the GNU General Public License and
a copy of the GCC Runtime Library Exception along with this program;
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
<http://www.gnu.org/licenses/>. */
#include "libgfortran.h"
#ifdef HAVE_GFC_UINTEGER_1
index_type findloc2_s1 (gfc_array_s1 * const restrict array,
const GFC_UINTEGER_1 * restrict value, GFC_LOGICAL_4 back,
gfc_charlen_type len_array, gfc_charlen_type len_value);
export_proto(findloc2_s1);
index_type
findloc2_s1 (gfc_array_s1 * const restrict array, const GFC_UINTEGER_1 * restrict value,
GFC_LOGICAL_4 back,
gfc_charlen_type len_array, gfc_charlen_type len_value)
{
index_type i;
index_type sstride;
index_type extent;
const GFC_UINTEGER_1 * restrict src;
extent = GFC_DESCRIPTOR_EXTENT(array,0);
if (extent <= 0)
return 0;
sstride = GFC_DESCRIPTOR_STRIDE(array,0) * len_array;
if (back)
{
src = array->base_addr + (extent - 1) * sstride;
for (i = extent; i >= 0; i--)
{
if (compare_string (len_array, (char *) src, len_value, (char *) value) == 0)
return i;
src -= sstride;
}
}
else
{
src = array->base_addr;
for (i = 1; i <= extent; i++)
{
if (compare_string (len_array, (char *) src, len_value, (char *) value) == 0)
return i;
src += sstride;
}
}
return 0;
}
index_type mfindloc2_s1 (gfc_array_s1 * const restrict array,
const GFC_UINTEGER_1 * restrict value,
gfc_array_l1 *const restrict mask, GFC_LOGICAL_4 back,
gfc_charlen_type len_array, gfc_charlen_type len_value);
export_proto(mfindloc2_s1);
index_type
mfindloc2_s1 (gfc_array_s1 * const restrict array,
const GFC_UINTEGER_1 * restrict value, gfc_array_l1 *const restrict mask,
GFC_LOGICAL_4 back, gfc_charlen_type len_array,
gfc_charlen_type len_value)
{
index_type i;
index_type sstride;
index_type extent;
const GFC_UINTEGER_1 * restrict src;
const GFC_LOGICAL_1 * restrict mbase;
int mask_kind;
index_type mstride;
extent = GFC_DESCRIPTOR_EXTENT(array,0);
if (extent <= 0)
return 0;
mask_kind = GFC_DESCRIPTOR_SIZE (mask);
mbase = mask->base_addr;
if (mask_kind == 1 || mask_kind == 2 || mask_kind == 4 || mask_kind == 8
#ifdef HAVE_GFC_LOGICAL_16
|| mask_kind == 16
#endif
)
mbase = GFOR_POINTER_TO_L1 (mbase, mask_kind);
else
internal_error (NULL, "Funny sized logical array");
sstride = GFC_DESCRIPTOR_STRIDE(array,0) * len_array;
mstride = GFC_DESCRIPTOR_STRIDE_BYTES(mask,0);
if (back)
{
src = array->base_addr + (extent - 1) * sstride;
mbase += (extent - 1) * mstride;
for (i = extent; i >= 0; i--)
{
if (*mbase && (compare_string (len_array, (char *) src, len_value, (char *) value) == 0))
return i;
src -= sstride;
mbase -= mstride;
}
}
else
{
src = array->base_addr;
for (i = 1; i <= extent; i++)
{
if (*mbase && (compare_string (len_array, (char *) src, len_value, (char *) value) == 0))
return i;
src += sstride;
mbase += mstride;
}
}
return 0;
}
index_type sfindloc2_s1 (gfc_array_s1 * const restrict array,
const GFC_UINTEGER_1 * restrict value,
GFC_LOGICAL_4 *const restrict mask, GFC_LOGICAL_4 back,
gfc_charlen_type len_array, gfc_charlen_type len_value);
export_proto(sfindloc2_s1);
index_type
sfindloc2_s1 (gfc_array_s1 * const restrict array,
const GFC_UINTEGER_1 * restrict value, GFC_LOGICAL_4 *const restrict mask,
GFC_LOGICAL_4 back, gfc_charlen_type len_array,
gfc_charlen_type len_value)
{
if (mask == NULL || *mask)
{
return findloc2_s1 (array, value, back, len_array, len_value);
}
return 0;
}
#endif
|
