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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
|
/* Array and structure constructors
Copyright (C) 2009-2022 Free Software Foundation, Inc.
This file is part of GCC.
GCC 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, or (at your option) any later
version.
GCC 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.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "gfortran.h"
#include "constructor.h"
static void
node_free (splay_tree_value value)
{
gfc_constructor *c = (gfc_constructor*)value;
if (c->expr)
gfc_free_expr (c->expr);
if (c->iterator)
gfc_free_iterator (c->iterator, 1);
mpz_clear (c->offset);
mpz_clear (c->repeat);
free (c);
}
static gfc_constructor *
node_copy (splay_tree_node node, void *base)
{
gfc_constructor *c, *src = (gfc_constructor*)node->value;
c = XCNEW (gfc_constructor);
c->base = (gfc_constructor_base)base;
c->expr = gfc_copy_expr (src->expr);
c->iterator = gfc_copy_iterator (src->iterator);
c->where = src->where;
c->n.component = src->n.component;
mpz_init_set (c->offset, src->offset);
mpz_init_set (c->repeat, src->repeat);
return c;
}
static int
node_copy_and_insert (splay_tree_node node, void *base)
{
int n = mpz_get_si (((gfc_constructor*)node->value)->offset);
gfc_constructor_insert ((gfc_constructor_base*)base,
node_copy (node, base), n);
return 0;
}
gfc_constructor *
gfc_constructor_get (void)
{
gfc_constructor *c = XCNEW (gfc_constructor);
c->base = NULL;
c->expr = NULL;
c->iterator = NULL;
mpz_init_set_si (c->offset, 0);
mpz_init_set_si (c->repeat, 1);
return c;
}
static gfc_constructor_base
gfc_constructor_get_base (void)
{
return splay_tree_new (splay_tree_compare_ints, NULL, node_free);
}
gfc_constructor_base
gfc_constructor_copy (gfc_constructor_base base)
{
gfc_constructor_base new_base;
if (!base)
return NULL;
new_base = gfc_constructor_get_base ();
splay_tree_foreach (base, node_copy_and_insert, &new_base);
return new_base;
}
void
gfc_constructor_free (gfc_constructor_base base)
{
if (base)
splay_tree_delete (base);
}
gfc_constructor *
gfc_constructor_append (gfc_constructor_base *base, gfc_constructor *c)
{
int offset = 0;
if (*base)
offset = (int)(splay_tree_max (*base)->key) + 1;
return gfc_constructor_insert (base, c, offset);
}
gfc_constructor *
gfc_constructor_append_expr (gfc_constructor_base *base,
gfc_expr *e, locus *where)
{
gfc_constructor *c = gfc_constructor_get ();
c->expr = e;
if (where)
c->where = *where;
return gfc_constructor_append (base, c);
}
gfc_constructor *
gfc_constructor_insert (gfc_constructor_base *base, gfc_constructor *c, int n)
{
splay_tree_node node;
if (*base == NULL)
*base = splay_tree_new (splay_tree_compare_ints, NULL, node_free);
c->base = *base;
mpz_set_si (c->offset, n);
node = splay_tree_insert (*base, (splay_tree_key) n, (splay_tree_value) c);
gcc_assert (node);
return (gfc_constructor*)node->value;
}
gfc_constructor *
gfc_constructor_insert_expr (gfc_constructor_base *base,
gfc_expr *e, locus *where, int n)
{
gfc_constructor *c = gfc_constructor_get ();
c->expr = e;
if (where)
c->where = *where;
return gfc_constructor_insert (base, c, n);
}
gfc_constructor *
gfc_constructor_lookup (gfc_constructor_base base, int offset)
{
gfc_constructor *c;
splay_tree_node node;
if (!base)
return NULL;
node = splay_tree_lookup (base, (splay_tree_key) offset);
if (node)
return (gfc_constructor *) node->value;
/* Check if the previous node has a repeat count big enough to
cover the offset looked for. */
node = splay_tree_predecessor (base, (splay_tree_key) offset);
if (!node)
return NULL;
c = (gfc_constructor *) node->value;
if (mpz_cmp_si (c->repeat, 1) > 0)
{
if (mpz_get_si (c->offset) + mpz_get_si (c->repeat) <= offset)
c = NULL;
}
else
c = NULL;
return c;
}
gfc_expr *
gfc_constructor_lookup_expr (gfc_constructor_base base, int offset)
{
gfc_constructor *c = gfc_constructor_lookup (base, offset);
return c ? c->expr : NULL;
}
gfc_constructor *
gfc_constructor_first (gfc_constructor_base base)
{
if (base)
{
splay_tree_node node = splay_tree_min (base);
return node ? (gfc_constructor*) node->value : NULL;
}
else
return NULL;
}
gfc_constructor *
gfc_constructor_next (gfc_constructor *ctor)
{
if (ctor)
{
splay_tree_node node = splay_tree_successor (ctor->base,
mpz_get_si (ctor->offset));
return node ? (gfc_constructor*) node->value : NULL;
}
else
return NULL;
}
void
gfc_constructor_remove (gfc_constructor *ctor)
{
if (ctor)
splay_tree_remove (ctor->base, mpz_get_si (ctor->offset));
}
gfc_constructor *
gfc_constructor_lookup_next (gfc_constructor_base base, int offset)
{
splay_tree_node node;
if (!base)
return NULL;
node = splay_tree_successor (base, (splay_tree_key) offset);
if (!node)
return NULL;
return (gfc_constructor *) node->value;
}
|
