]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | /* Backend support for Fortran 95 basic types and derived types. |
fa502cb2 | 2 | Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, |
8d51f26f | 3 | 2010, 2011 |
835aac92 | 4 | Free Software Foundation, Inc. |
6de9cd9a DN |
5 | Contributed by Paul Brook <paul@nowt.org> |
6 | and Steven Bosscher <s.bosscher@student.tudelft.nl> | |
7 | ||
9fc4d79b | 8 | This file is part of GCC. |
6de9cd9a | 9 | |
9fc4d79b TS |
10 | GCC is free software; you can redistribute it and/or modify it under |
11 | the terms of the GNU General Public License as published by the Free | |
d234d788 | 12 | Software Foundation; either version 3, or (at your option) any later |
9fc4d79b | 13 | version. |
6de9cd9a | 14 | |
9fc4d79b TS |
15 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
16 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
17 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
18 | for more details. | |
6de9cd9a DN |
19 | |
20 | You should have received a copy of the GNU General Public License | |
d234d788 NC |
21 | along with GCC; see the file COPYING3. If not see |
22 | <http://www.gnu.org/licenses/>. */ | |
6de9cd9a DN |
23 | |
24 | /* trans-types.c -- gfortran backend types */ | |
25 | ||
26 | #include "config.h" | |
27 | #include "system.h" | |
28 | #include "coretypes.h" | |
29eabd78 JR |
29 | #include "tm.h" /* For INTMAX_TYPE, INT8_TYPE, INT16_TYPE, INT32_TYPE, |
30 | INT64_TYPE, INT_LEAST8_TYPE, INT_LEAST16_TYPE, | |
31 | INT_LEAST32_TYPE, INT_LEAST64_TYPE, INT_FAST8_TYPE, | |
32 | INT_FAST16_TYPE, INT_FAST32_TYPE, INT_FAST64_TYPE, | |
33 | BOOL_TYPE_SIZE, BITS_PER_UNIT, POINTER_SIZE, | |
34 | INT_TYPE_SIZE, CHAR_TYPE_SIZE, SHORT_TYPE_SIZE, | |
35 | LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE, | |
36 | FLOAT_TYPE_SIZE, DOUBLE_TYPE_SIZE, | |
37 | LONG_DOUBLE_TYPE_SIZE and LIBGCC2_HAS_TF_MODE. */ | |
6de9cd9a | 38 | #include "tree.h" |
a48ba7e1 | 39 | #include "langhooks.h" /* For iso-c-bindings.def. */ |
5e8e542f | 40 | #include "target.h" |
6de9cd9a | 41 | #include "ggc.h" |
c829d016 TB |
42 | #include "diagnostic-core.h" /* For fatal_error. */ |
43 | #include "toplev.h" /* For rest_of_decl_compilation. */ | |
6de9cd9a DN |
44 | #include "gfortran.h" |
45 | #include "trans.h" | |
46 | #include "trans-types.h" | |
47 | #include "trans-const.h" | |
08789087 | 48 | #include "flags.h" |
a48ba7e1 | 49 | #include "dwarf2out.h" /* For struct array_descr_info. */ |
6de9cd9a DN |
50 | \f |
51 | ||
52 | #if (GFC_MAX_DIMENSIONS < 10) | |
53 | #define GFC_RANK_DIGITS 1 | |
54 | #define GFC_RANK_PRINTF_FORMAT "%01d" | |
55 | #elif (GFC_MAX_DIMENSIONS < 100) | |
56 | #define GFC_RANK_DIGITS 2 | |
57 | #define GFC_RANK_PRINTF_FORMAT "%02d" | |
58 | #else | |
59 | #error If you really need >99 dimensions, continue the sequence above... | |
60 | #endif | |
61 | ||
a8b3b0b6 CR |
62 | /* array of structs so we don't have to worry about xmalloc or free */ |
63 | CInteropKind_t c_interop_kinds_table[ISOCBINDING_NUMBER]; | |
64 | ||
6de9cd9a | 65 | tree gfc_array_index_type; |
b4838d29 | 66 | tree gfc_array_range_type; |
7e6de2a5 | 67 | tree gfc_character1_type_node; |
6de9cd9a | 68 | tree pvoid_type_node; |
10174ddf | 69 | tree prvoid_type_node; |
6de9cd9a DN |
70 | tree ppvoid_type_node; |
71 | tree pchar_type_node; | |
089db47d | 72 | tree pfunc_type_node; |
7e6de2a5 | 73 | |
d7177ab2 | 74 | tree gfc_charlen_type_node; |
6de9cd9a | 75 | |
a3c85b74 FXC |
76 | tree float128_type_node = NULL_TREE; |
77 | tree complex_float128_type_node = NULL_TREE; | |
78 | ||
79 | bool gfc_real16_is_float128 = false; | |
80 | ||
e2cad04b | 81 | static GTY(()) tree gfc_desc_dim_type; |
6de9cd9a | 82 | static GTY(()) tree gfc_max_array_element_size; |
10174ddf | 83 | static GTY(()) tree gfc_array_descriptor_base[2 * GFC_MAX_DIMENSIONS]; |
6de9cd9a | 84 | |
5e8e542f RH |
85 | /* Arrays for all integral and real kinds. We'll fill this in at runtime |
86 | after the target has a chance to process command-line options. */ | |
87 | ||
88 | #define MAX_INT_KINDS 5 | |
89 | gfc_integer_info gfc_integer_kinds[MAX_INT_KINDS + 1]; | |
90 | gfc_logical_info gfc_logical_kinds[MAX_INT_KINDS + 1]; | |
e2cad04b RH |
91 | static GTY(()) tree gfc_integer_types[MAX_INT_KINDS + 1]; |
92 | static GTY(()) tree gfc_logical_types[MAX_INT_KINDS + 1]; | |
5e8e542f | 93 | |
e8f35d4d | 94 | #define MAX_REAL_KINDS 5 |
5e8e542f | 95 | gfc_real_info gfc_real_kinds[MAX_REAL_KINDS + 1]; |
e2cad04b RH |
96 | static GTY(()) tree gfc_real_types[MAX_REAL_KINDS + 1]; |
97 | static GTY(()) tree gfc_complex_types[MAX_REAL_KINDS + 1]; | |
5e8e542f | 98 | |
374929b2 FXC |
99 | #define MAX_CHARACTER_KINDS 2 |
100 | gfc_character_info gfc_character_kinds[MAX_CHARACTER_KINDS + 1]; | |
101 | static GTY(()) tree gfc_character_types[MAX_CHARACTER_KINDS + 1]; | |
102 | static GTY(()) tree gfc_pcharacter_types[MAX_CHARACTER_KINDS + 1]; | |
103 | ||
35151cd5 | 104 | static tree gfc_add_field_to_struct_1 (tree, tree, tree, tree **); |
66e4ab31 | 105 | |
5e8e542f RH |
106 | /* The integer kind to use for array indices. This will be set to the |
107 | proper value based on target information from the backend. */ | |
108 | ||
109 | int gfc_index_integer_kind; | |
110 | ||
111 | /* The default kinds of the various types. */ | |
112 | ||
9d64df18 | 113 | int gfc_default_integer_kind; |
f4e7375a | 114 | int gfc_max_integer_kind; |
9d64df18 TS |
115 | int gfc_default_real_kind; |
116 | int gfc_default_double_kind; | |
117 | int gfc_default_character_kind; | |
118 | int gfc_default_logical_kind; | |
119 | int gfc_default_complex_kind; | |
e8525382 | 120 | int gfc_c_int_kind; |
5e8e542f | 121 | |
4fec64b0 JD |
122 | /* The kind size used for record offsets. If the target system supports |
123 | kind=8, this will be set to 8, otherwise it is set to 4. */ | |
014ec6ee | 124 | int gfc_intio_kind; |
4fec64b0 | 125 | |
f1412ca5 FXC |
126 | /* The integer kind used to store character lengths. */ |
127 | int gfc_charlen_int_kind; | |
128 | ||
39f87c03 FXC |
129 | /* The size of the numeric storage unit and character storage unit. */ |
130 | int gfc_numeric_storage_size; | |
131 | int gfc_character_storage_size; | |
132 | ||
a8b3b0b6 | 133 | |
17b1d2a0 | 134 | gfc_try |
a8b3b0b6 CR |
135 | gfc_check_any_c_kind (gfc_typespec *ts) |
136 | { | |
137 | int i; | |
138 | ||
139 | for (i = 0; i < ISOCBINDING_NUMBER; i++) | |
140 | { | |
141 | /* Check for any C interoperable kind for the given type/kind in ts. | |
142 | This can be used after verify_c_interop to make sure that the | |
143 | Fortran kind being used exists in at least some form for C. */ | |
144 | if (c_interop_kinds_table[i].f90_type == ts->type && | |
145 | c_interop_kinds_table[i].value == ts->kind) | |
146 | return SUCCESS; | |
147 | } | |
148 | ||
149 | return FAILURE; | |
150 | } | |
151 | ||
152 | ||
153 | static int | |
154 | get_real_kind_from_node (tree type) | |
155 | { | |
156 | int i; | |
157 | ||
158 | for (i = 0; gfc_real_kinds[i].kind != 0; i++) | |
159 | if (gfc_real_kinds[i].mode_precision == TYPE_PRECISION (type)) | |
160 | return gfc_real_kinds[i].kind; | |
161 | ||
162 | return -4; | |
163 | } | |
164 | ||
165 | static int | |
166 | get_int_kind_from_node (tree type) | |
167 | { | |
168 | int i; | |
169 | ||
170 | if (!type) | |
171 | return -2; | |
172 | ||
173 | for (i = 0; gfc_integer_kinds[i].kind != 0; i++) | |
174 | if (gfc_integer_kinds[i].bit_size == TYPE_PRECISION (type)) | |
175 | return gfc_integer_kinds[i].kind; | |
176 | ||
177 | return -1; | |
178 | } | |
179 | ||
e0a6661b FXC |
180 | /* Return a typenode for the "standard" C type with a given name. */ |
181 | static tree | |
182 | get_typenode_from_name (const char *name) | |
183 | { | |
184 | if (name == NULL || *name == '\0') | |
185 | return NULL_TREE; | |
186 | ||
187 | if (strcmp (name, "char") == 0) | |
188 | return char_type_node; | |
189 | if (strcmp (name, "unsigned char") == 0) | |
190 | return unsigned_char_type_node; | |
191 | if (strcmp (name, "signed char") == 0) | |
192 | return signed_char_type_node; | |
193 | ||
194 | if (strcmp (name, "short int") == 0) | |
195 | return short_integer_type_node; | |
196 | if (strcmp (name, "short unsigned int") == 0) | |
197 | return short_unsigned_type_node; | |
198 | ||
199 | if (strcmp (name, "int") == 0) | |
200 | return integer_type_node; | |
201 | if (strcmp (name, "unsigned int") == 0) | |
202 | return unsigned_type_node; | |
203 | ||
204 | if (strcmp (name, "long int") == 0) | |
205 | return long_integer_type_node; | |
206 | if (strcmp (name, "long unsigned int") == 0) | |
207 | return long_unsigned_type_node; | |
208 | ||
209 | if (strcmp (name, "long long int") == 0) | |
210 | return long_long_integer_type_node; | |
211 | if (strcmp (name, "long long unsigned int") == 0) | |
212 | return long_long_unsigned_type_node; | |
213 | ||
214 | gcc_unreachable (); | |
215 | } | |
216 | ||
217 | static int | |
218 | get_int_kind_from_name (const char *name) | |
219 | { | |
220 | return get_int_kind_from_node (get_typenode_from_name (name)); | |
221 | } | |
222 | ||
223 | ||
224 | /* Get the kind number corresponding to an integer of given size, | |
225 | following the required return values for ISO_FORTRAN_ENV INT* constants: | |
226 | -2 is returned if we support a kind of larger size, -1 otherwise. */ | |
227 | int | |
228 | gfc_get_int_kind_from_width_isofortranenv (int size) | |
229 | { | |
230 | int i; | |
231 | ||
232 | /* Look for a kind with matching storage size. */ | |
233 | for (i = 0; gfc_integer_kinds[i].kind != 0; i++) | |
234 | if (gfc_integer_kinds[i].bit_size == size) | |
235 | return gfc_integer_kinds[i].kind; | |
236 | ||
237 | /* Look for a kind with larger storage size. */ | |
238 | for (i = 0; gfc_integer_kinds[i].kind != 0; i++) | |
239 | if (gfc_integer_kinds[i].bit_size > size) | |
240 | return -2; | |
241 | ||
242 | return -1; | |
243 | } | |
244 | ||
245 | /* Get the kind number corresponding to a real of given storage size, | |
246 | following the required return values for ISO_FORTRAN_ENV REAL* constants: | |
247 | -2 is returned if we support a kind of larger size, -1 otherwise. */ | |
248 | int | |
249 | gfc_get_real_kind_from_width_isofortranenv (int size) | |
250 | { | |
251 | int i; | |
252 | ||
253 | size /= 8; | |
254 | ||
255 | /* Look for a kind with matching storage size. */ | |
256 | for (i = 0; gfc_real_kinds[i].kind != 0; i++) | |
257 | if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) == size) | |
258 | return gfc_real_kinds[i].kind; | |
259 | ||
260 | /* Look for a kind with larger storage size. */ | |
261 | for (i = 0; gfc_real_kinds[i].kind != 0; i++) | |
262 | if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) > size) | |
263 | return -2; | |
264 | ||
265 | return -1; | |
266 | } | |
267 | ||
268 | ||
269 | ||
a8b3b0b6 CR |
270 | static int |
271 | get_int_kind_from_width (int size) | |
272 | { | |
273 | int i; | |
274 | ||
275 | for (i = 0; gfc_integer_kinds[i].kind != 0; i++) | |
276 | if (gfc_integer_kinds[i].bit_size == size) | |
277 | return gfc_integer_kinds[i].kind; | |
278 | ||
279 | return -2; | |
280 | } | |
281 | ||
282 | static int | |
283 | get_int_kind_from_minimal_width (int size) | |
284 | { | |
285 | int i; | |
286 | ||
287 | for (i = 0; gfc_integer_kinds[i].kind != 0; i++) | |
288 | if (gfc_integer_kinds[i].bit_size >= size) | |
289 | return gfc_integer_kinds[i].kind; | |
290 | ||
291 | return -2; | |
292 | } | |
293 | ||
294 | ||
295 | /* Generate the CInteropKind_t objects for the C interoperable | |
296 | kinds. */ | |
297 | ||
298 | static | |
299 | void init_c_interop_kinds (void) | |
300 | { | |
301 | int i; | |
a8b3b0b6 CR |
302 | |
303 | /* init all pointers in the list to NULL */ | |
304 | for (i = 0; i < ISOCBINDING_NUMBER; i++) | |
305 | { | |
306 | /* Initialize the name and value fields. */ | |
307 | c_interop_kinds_table[i].name[0] = '\0'; | |
308 | c_interop_kinds_table[i].value = -100; | |
309 | c_interop_kinds_table[i].f90_type = BT_UNKNOWN; | |
310 | } | |
311 | ||
21684705 | 312 | #define NAMED_INTCST(a,b,c,d) \ |
a8b3b0b6 CR |
313 | strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \ |
314 | c_interop_kinds_table[a].f90_type = BT_INTEGER; \ | |
315 | c_interop_kinds_table[a].value = c; | |
316 | #define NAMED_REALCST(a,b,c) \ | |
317 | strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \ | |
318 | c_interop_kinds_table[a].f90_type = BT_REAL; \ | |
319 | c_interop_kinds_table[a].value = c; | |
320 | #define NAMED_CMPXCST(a,b,c) \ | |
321 | strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \ | |
322 | c_interop_kinds_table[a].f90_type = BT_COMPLEX; \ | |
323 | c_interop_kinds_table[a].value = c; | |
324 | #define NAMED_LOGCST(a,b,c) \ | |
325 | strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \ | |
326 | c_interop_kinds_table[a].f90_type = BT_LOGICAL; \ | |
327 | c_interop_kinds_table[a].value = c; | |
328 | #define NAMED_CHARKNDCST(a,b,c) \ | |
329 | strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \ | |
330 | c_interop_kinds_table[a].f90_type = BT_CHARACTER; \ | |
331 | c_interop_kinds_table[a].value = c; | |
332 | #define NAMED_CHARCST(a,b,c) \ | |
333 | strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \ | |
334 | c_interop_kinds_table[a].f90_type = BT_CHARACTER; \ | |
335 | c_interop_kinds_table[a].value = c; | |
336 | #define DERIVED_TYPE(a,b,c) \ | |
337 | strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \ | |
338 | c_interop_kinds_table[a].f90_type = BT_DERIVED; \ | |
339 | c_interop_kinds_table[a].value = c; | |
340 | #define PROCEDURE(a,b) \ | |
341 | strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \ | |
342 | c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \ | |
343 | c_interop_kinds_table[a].value = 0; | |
344 | #include "iso-c-binding.def" | |
d000aa67 TB |
345 | #define NAMED_FUNCTION(a,b,c,d) \ |
346 | strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \ | |
347 | c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \ | |
348 | c_interop_kinds_table[a].value = c; | |
349 | #include "iso-c-binding.def" | |
a8b3b0b6 CR |
350 | } |
351 | ||
352 | ||
5e8e542f RH |
353 | /* Query the target to determine which machine modes are available for |
354 | computation. Choose KIND numbers for them. */ | |
355 | ||
356 | void | |
357 | gfc_init_kinds (void) | |
358 | { | |
09639a83 | 359 | unsigned int mode; |
374929b2 | 360 | int i_index, r_index, kind; |
5e8e542f RH |
361 | bool saw_i4 = false, saw_i8 = false; |
362 | bool saw_r4 = false, saw_r8 = false, saw_r16 = false; | |
363 | ||
364 | for (i_index = 0, mode = MIN_MODE_INT; mode <= MAX_MODE_INT; mode++) | |
365 | { | |
366 | int kind, bitsize; | |
367 | ||
09639a83 | 368 | if (!targetm.scalar_mode_supported_p ((enum machine_mode) mode)) |
5e8e542f RH |
369 | continue; |
370 | ||
04204c2f RH |
371 | /* The middle end doesn't support constants larger than 2*HWI. |
372 | Perhaps the target hook shouldn't have accepted these either, | |
373 | but just to be safe... */ | |
374 | bitsize = GET_MODE_BITSIZE (mode); | |
375 | if (bitsize > 2*HOST_BITS_PER_WIDE_INT) | |
376 | continue; | |
377 | ||
6e45f57b | 378 | gcc_assert (i_index != MAX_INT_KINDS); |
5e8e542f RH |
379 | |
380 | /* Let the kind equal the bit size divided by 8. This insulates the | |
381 | programmer from the underlying byte size. */ | |
5e8e542f RH |
382 | kind = bitsize / 8; |
383 | ||
384 | if (kind == 4) | |
385 | saw_i4 = true; | |
386 | if (kind == 8) | |
387 | saw_i8 = true; | |
388 | ||
389 | gfc_integer_kinds[i_index].kind = kind; | |
390 | gfc_integer_kinds[i_index].radix = 2; | |
391 | gfc_integer_kinds[i_index].digits = bitsize - 1; | |
392 | gfc_integer_kinds[i_index].bit_size = bitsize; | |
393 | ||
394 | gfc_logical_kinds[i_index].kind = kind; | |
395 | gfc_logical_kinds[i_index].bit_size = bitsize; | |
396 | ||
397 | i_index += 1; | |
398 | } | |
399 | ||
014ec6ee | 400 | /* Set the kind used to match GFC_INT_IO in libgfortran. This is |
4fec64b0 JD |
401 | used for large file access. */ |
402 | ||
403 | if (saw_i8) | |
014ec6ee | 404 | gfc_intio_kind = 8; |
4fec64b0 | 405 | else |
014ec6ee | 406 | gfc_intio_kind = 4; |
4fec64b0 JD |
407 | |
408 | /* If we do not at least have kind = 4, everything is pointless. */ | |
409 | gcc_assert(saw_i4); | |
410 | ||
f4e7375a SK |
411 | /* Set the maximum integer kind. Used with at least BOZ constants. */ |
412 | gfc_max_integer_kind = gfc_integer_kinds[i_index - 1].kind; | |
413 | ||
5e8e542f RH |
414 | for (r_index = 0, mode = MIN_MODE_FLOAT; mode <= MAX_MODE_FLOAT; mode++) |
415 | { | |
09639a83 ILT |
416 | const struct real_format *fmt = |
417 | REAL_MODE_FORMAT ((enum machine_mode) mode); | |
5e8e542f RH |
418 | int kind; |
419 | ||
420 | if (fmt == NULL) | |
421 | continue; | |
09639a83 | 422 | if (!targetm.scalar_mode_supported_p ((enum machine_mode) mode)) |
5e8e542f RH |
423 | continue; |
424 | ||
a3c85b74 FXC |
425 | /* Only let float, double, long double and __float128 go through. |
426 | Runtime support for others is not provided, so they would be | |
87e6d9dc | 427 | useless. */ |
a3c85b74 | 428 | if (mode != TYPE_MODE (float_type_node) |
1ec601bf FXC |
429 | && (mode != TYPE_MODE (double_type_node)) |
430 | && (mode != TYPE_MODE (long_double_type_node)) | |
87e6d9dc | 431 | #if defined(LIBGCC2_HAS_TF_MODE) && defined(ENABLE_LIBQUADMATH_SUPPORT) |
1ec601bf FXC |
432 | && (mode != TFmode) |
433 | #endif | |
434 | ) | |
216ac520 SE |
435 | continue; |
436 | ||
5e8e542f RH |
437 | /* Let the kind equal the precision divided by 8, rounding up. Again, |
438 | this insulates the programmer from the underlying byte size. | |
439 | ||
440 | Also, it effectively deals with IEEE extended formats. There, the | |
441 | total size of the type may equal 16, but it's got 6 bytes of padding | |
442 | and the increased size can get in the way of a real IEEE quad format | |
443 | which may also be supported by the target. | |
444 | ||
445 | We round up so as to handle IA-64 __floatreg (RFmode), which is an | |
446 | 82 bit type. Not to be confused with __float80 (XFmode), which is | |
447 | an 80 bit type also supported by IA-64. So XFmode should come out | |
448 | to be kind=10, and RFmode should come out to be kind=11. Egads. */ | |
449 | ||
450 | kind = (GET_MODE_PRECISION (mode) + 7) / 8; | |
451 | ||
452 | if (kind == 4) | |
453 | saw_r4 = true; | |
454 | if (kind == 8) | |
455 | saw_r8 = true; | |
456 | if (kind == 16) | |
457 | saw_r16 = true; | |
458 | ||
df2fba9e | 459 | /* Careful we don't stumble a weird internal mode. */ |
6e45f57b | 460 | gcc_assert (r_index <= 0 || gfc_real_kinds[r_index-1].kind != kind); |
5e8e542f | 461 | /* Or have too many modes for the allocated space. */ |
6e45f57b | 462 | gcc_assert (r_index != MAX_REAL_KINDS); |
5e8e542f RH |
463 | |
464 | gfc_real_kinds[r_index].kind = kind; | |
465 | gfc_real_kinds[r_index].radix = fmt->b; | |
466 | gfc_real_kinds[r_index].digits = fmt->p; | |
467 | gfc_real_kinds[r_index].min_exponent = fmt->emin; | |
468 | gfc_real_kinds[r_index].max_exponent = fmt->emax; | |
c69cb92f AM |
469 | if (fmt->pnan < fmt->p) |
470 | /* This is an IBM extended double format (or the MIPS variant) | |
471 | made up of two IEEE doubles. The value of the long double is | |
472 | the sum of the values of the two parts. The most significant | |
473 | part is required to be the value of the long double rounded | |
474 | to the nearest double. If we use emax of 1024 then we can't | |
475 | represent huge(x) = (1 - b**(-p)) * b**(emax-1) * b, because | |
476 | rounding will make the most significant part overflow. */ | |
477 | gfc_real_kinds[r_index].max_exponent = fmt->emax - 1; | |
e2cad04b | 478 | gfc_real_kinds[r_index].mode_precision = GET_MODE_PRECISION (mode); |
5e8e542f RH |
479 | r_index += 1; |
480 | } | |
481 | ||
482 | /* Choose the default integer kind. We choose 4 unless the user | |
483 | directs us otherwise. */ | |
3ae9eb27 | 484 | if (gfc_option.flag_default_integer) |
5e8e542f RH |
485 | { |
486 | if (!saw_i8) | |
3ae9eb27 | 487 | fatal_error ("integer kind=8 not available for -fdefault-integer-8 option"); |
9d64df18 | 488 | gfc_default_integer_kind = 8; |
39f87c03 FXC |
489 | |
490 | /* Even if the user specified that the default integer kind be 8, | |
df2fba9e | 491 | the numeric storage size isn't 64. In this case, a warning will |
39f87c03 FXC |
492 | be issued when NUMERIC_STORAGE_SIZE is used. */ |
493 | gfc_numeric_storage_size = 4 * 8; | |
5e8e542f RH |
494 | } |
495 | else if (saw_i4) | |
39f87c03 FXC |
496 | { |
497 | gfc_default_integer_kind = 4; | |
498 | gfc_numeric_storage_size = 4 * 8; | |
499 | } | |
5e8e542f | 500 | else |
39f87c03 FXC |
501 | { |
502 | gfc_default_integer_kind = gfc_integer_kinds[i_index - 1].kind; | |
503 | gfc_numeric_storage_size = gfc_integer_kinds[i_index - 1].bit_size; | |
504 | } | |
5e8e542f RH |
505 | |
506 | /* Choose the default real kind. Again, we choose 4 when possible. */ | |
3ae9eb27 | 507 | if (gfc_option.flag_default_real) |
5e8e542f RH |
508 | { |
509 | if (!saw_r8) | |
3ae9eb27 | 510 | fatal_error ("real kind=8 not available for -fdefault-real-8 option"); |
9d64df18 | 511 | gfc_default_real_kind = 8; |
5e8e542f RH |
512 | } |
513 | else if (saw_r4) | |
9d64df18 | 514 | gfc_default_real_kind = 4; |
5e8e542f | 515 | else |
9d64df18 | 516 | gfc_default_real_kind = gfc_real_kinds[0].kind; |
5e8e542f | 517 | |
3ae9eb27 SK |
518 | /* Choose the default double kind. If -fdefault-real and -fdefault-double |
519 | are specified, we use kind=8, if it's available. If -fdefault-real is | |
520 | specified without -fdefault-double, we use kind=16, if it's available. | |
521 | Otherwise we do not change anything. */ | |
522 | if (gfc_option.flag_default_double && !gfc_option.flag_default_real) | |
523 | fatal_error ("Use of -fdefault-double-8 requires -fdefault-real-8"); | |
524 | ||
525 | if (gfc_option.flag_default_real && gfc_option.flag_default_double && saw_r8) | |
526 | gfc_default_double_kind = 8; | |
527 | else if (gfc_option.flag_default_real && saw_r16) | |
9d64df18 | 528 | gfc_default_double_kind = 16; |
5e8e542f | 529 | else if (saw_r4 && saw_r8) |
9d64df18 | 530 | gfc_default_double_kind = 8; |
5e8e542f RH |
531 | else |
532 | { | |
533 | /* F95 14.6.3.1: A nonpointer scalar object of type double precision | |
534 | real ... occupies two contiguous numeric storage units. | |
535 | ||
536 | Therefore we must be supplied a kind twice as large as we chose | |
537 | for single precision. There are loopholes, in that double | |
538 | precision must *occupy* two storage units, though it doesn't have | |
539 | to *use* two storage units. Which means that you can make this | |
540 | kind artificially wide by padding it. But at present there are | |
541 | no GCC targets for which a two-word type does not exist, so we | |
542 | just let gfc_validate_kind abort and tell us if something breaks. */ | |
543 | ||
9d64df18 TS |
544 | gfc_default_double_kind |
545 | = gfc_validate_kind (BT_REAL, gfc_default_real_kind * 2, false); | |
5e8e542f RH |
546 | } |
547 | ||
548 | /* The default logical kind is constrained to be the same as the | |
549 | default integer kind. Similarly with complex and real. */ | |
9d64df18 TS |
550 | gfc_default_logical_kind = gfc_default_integer_kind; |
551 | gfc_default_complex_kind = gfc_default_real_kind; | |
5e8e542f | 552 | |
374929b2 FXC |
553 | /* We only have two character kinds: ASCII and UCS-4. |
554 | ASCII corresponds to a 8-bit integer type, if one is available. | |
555 | UCS-4 corresponds to a 32-bit integer type, if one is available. */ | |
556 | i_index = 0; | |
557 | if ((kind = get_int_kind_from_width (8)) > 0) | |
558 | { | |
559 | gfc_character_kinds[i_index].kind = kind; | |
560 | gfc_character_kinds[i_index].bit_size = 8; | |
561 | gfc_character_kinds[i_index].name = "ascii"; | |
562 | i_index++; | |
563 | } | |
564 | if ((kind = get_int_kind_from_width (32)) > 0) | |
565 | { | |
566 | gfc_character_kinds[i_index].kind = kind; | |
567 | gfc_character_kinds[i_index].bit_size = 32; | |
568 | gfc_character_kinds[i_index].name = "iso_10646"; | |
569 | i_index++; | |
570 | } | |
571 | ||
5e8e542f | 572 | /* Choose the smallest integer kind for our default character. */ |
374929b2 | 573 | gfc_default_character_kind = gfc_character_kinds[0].kind; |
39f87c03 | 574 | gfc_character_storage_size = gfc_default_character_kind * 8; |
5e8e542f RH |
575 | |
576 | /* Choose the integer kind the same size as "void*" for our index kind. */ | |
577 | gfc_index_integer_kind = POINTER_SIZE / 8; | |
e8525382 SK |
578 | /* Pick a kind the same size as the C "int" type. */ |
579 | gfc_c_int_kind = INT_TYPE_SIZE / 8; | |
a8b3b0b6 CR |
580 | |
581 | /* initialize the C interoperable kinds */ | |
582 | init_c_interop_kinds(); | |
5e8e542f RH |
583 | } |
584 | ||
5e8e542f RH |
585 | /* Make sure that a valid kind is present. Returns an index into the |
586 | associated kinds array, -1 if the kind is not present. */ | |
587 | ||
588 | static int | |
589 | validate_integer (int kind) | |
590 | { | |
591 | int i; | |
592 | ||
593 | for (i = 0; gfc_integer_kinds[i].kind != 0; i++) | |
594 | if (gfc_integer_kinds[i].kind == kind) | |
595 | return i; | |
596 | ||
597 | return -1; | |
598 | } | |
599 | ||
600 | static int | |
601 | validate_real (int kind) | |
602 | { | |
603 | int i; | |
604 | ||
605 | for (i = 0; gfc_real_kinds[i].kind != 0; i++) | |
606 | if (gfc_real_kinds[i].kind == kind) | |
607 | return i; | |
608 | ||
609 | return -1; | |
610 | } | |
611 | ||
612 | static int | |
613 | validate_logical (int kind) | |
614 | { | |
615 | int i; | |
616 | ||
617 | for (i = 0; gfc_logical_kinds[i].kind; i++) | |
618 | if (gfc_logical_kinds[i].kind == kind) | |
619 | return i; | |
620 | ||
621 | return -1; | |
622 | } | |
623 | ||
624 | static int | |
625 | validate_character (int kind) | |
626 | { | |
374929b2 FXC |
627 | int i; |
628 | ||
629 | for (i = 0; gfc_character_kinds[i].kind; i++) | |
630 | if (gfc_character_kinds[i].kind == kind) | |
631 | return i; | |
632 | ||
633 | return -1; | |
5e8e542f RH |
634 | } |
635 | ||
636 | /* Validate a kind given a basic type. The return value is the same | |
637 | for the child functions, with -1 indicating nonexistence of the | |
638 | type. If MAY_FAIL is false, then -1 is never returned, and we ICE. */ | |
639 | ||
640 | int | |
641 | gfc_validate_kind (bt type, int kind, bool may_fail) | |
642 | { | |
643 | int rc; | |
644 | ||
645 | switch (type) | |
646 | { | |
647 | case BT_REAL: /* Fall through */ | |
648 | case BT_COMPLEX: | |
649 | rc = validate_real (kind); | |
650 | break; | |
651 | case BT_INTEGER: | |
652 | rc = validate_integer (kind); | |
653 | break; | |
654 | case BT_LOGICAL: | |
655 | rc = validate_logical (kind); | |
656 | break; | |
657 | case BT_CHARACTER: | |
658 | rc = validate_character (kind); | |
659 | break; | |
660 | ||
661 | default: | |
662 | gfc_internal_error ("gfc_validate_kind(): Got bad type"); | |
663 | } | |
664 | ||
665 | if (rc < 0 && !may_fail) | |
666 | gfc_internal_error ("gfc_validate_kind(): Got bad kind"); | |
667 | ||
668 | return rc; | |
669 | } | |
670 | ||
671 | ||
e2cad04b RH |
672 | /* Four subroutines of gfc_init_types. Create type nodes for the given kind. |
673 | Reuse common type nodes where possible. Recognize if the kind matches up | |
674 | with a C type. This will be used later in determining which routines may | |
675 | be scarfed from libm. */ | |
676 | ||
677 | static tree | |
678 | gfc_build_int_type (gfc_integer_info *info) | |
679 | { | |
680 | int mode_precision = info->bit_size; | |
681 | ||
682 | if (mode_precision == CHAR_TYPE_SIZE) | |
683 | info->c_char = 1; | |
684 | if (mode_precision == SHORT_TYPE_SIZE) | |
685 | info->c_short = 1; | |
686 | if (mode_precision == INT_TYPE_SIZE) | |
687 | info->c_int = 1; | |
688 | if (mode_precision == LONG_TYPE_SIZE) | |
689 | info->c_long = 1; | |
690 | if (mode_precision == LONG_LONG_TYPE_SIZE) | |
691 | info->c_long_long = 1; | |
692 | ||
693 | if (TYPE_PRECISION (intQI_type_node) == mode_precision) | |
694 | return intQI_type_node; | |
695 | if (TYPE_PRECISION (intHI_type_node) == mode_precision) | |
696 | return intHI_type_node; | |
697 | if (TYPE_PRECISION (intSI_type_node) == mode_precision) | |
698 | return intSI_type_node; | |
699 | if (TYPE_PRECISION (intDI_type_node) == mode_precision) | |
700 | return intDI_type_node; | |
701 | if (TYPE_PRECISION (intTI_type_node) == mode_precision) | |
702 | return intTI_type_node; | |
703 | ||
704 | return make_signed_type (mode_precision); | |
705 | } | |
706 | ||
0a05c536 | 707 | tree |
374929b2 FXC |
708 | gfc_build_uint_type (int size) |
709 | { | |
710 | if (size == CHAR_TYPE_SIZE) | |
711 | return unsigned_char_type_node; | |
712 | if (size == SHORT_TYPE_SIZE) | |
713 | return short_unsigned_type_node; | |
714 | if (size == INT_TYPE_SIZE) | |
715 | return unsigned_type_node; | |
716 | if (size == LONG_TYPE_SIZE) | |
717 | return long_unsigned_type_node; | |
718 | if (size == LONG_LONG_TYPE_SIZE) | |
719 | return long_long_unsigned_type_node; | |
720 | ||
721 | return make_unsigned_type (size); | |
722 | } | |
723 | ||
724 | ||
e2cad04b RH |
725 | static tree |
726 | gfc_build_real_type (gfc_real_info *info) | |
727 | { | |
728 | int mode_precision = info->mode_precision; | |
729 | tree new_type; | |
730 | ||
731 | if (mode_precision == FLOAT_TYPE_SIZE) | |
732 | info->c_float = 1; | |
733 | if (mode_precision == DOUBLE_TYPE_SIZE) | |
734 | info->c_double = 1; | |
735 | if (mode_precision == LONG_DOUBLE_TYPE_SIZE) | |
736 | info->c_long_double = 1; | |
a3c85b74 FXC |
737 | if (mode_precision != LONG_DOUBLE_TYPE_SIZE && mode_precision == 128) |
738 | { | |
739 | info->c_float128 = 1; | |
740 | gfc_real16_is_float128 = true; | |
741 | } | |
e2cad04b RH |
742 | |
743 | if (TYPE_PRECISION (float_type_node) == mode_precision) | |
744 | return float_type_node; | |
745 | if (TYPE_PRECISION (double_type_node) == mode_precision) | |
746 | return double_type_node; | |
747 | if (TYPE_PRECISION (long_double_type_node) == mode_precision) | |
748 | return long_double_type_node; | |
749 | ||
750 | new_type = make_node (REAL_TYPE); | |
751 | TYPE_PRECISION (new_type) = mode_precision; | |
752 | layout_type (new_type); | |
753 | return new_type; | |
754 | } | |
755 | ||
756 | static tree | |
757 | gfc_build_complex_type (tree scalar_type) | |
758 | { | |
759 | tree new_type; | |
760 | ||
761 | if (scalar_type == NULL) | |
762 | return NULL; | |
763 | if (scalar_type == float_type_node) | |
764 | return complex_float_type_node; | |
765 | if (scalar_type == double_type_node) | |
766 | return complex_double_type_node; | |
767 | if (scalar_type == long_double_type_node) | |
768 | return complex_long_double_type_node; | |
769 | ||
770 | new_type = make_node (COMPLEX_TYPE); | |
771 | TREE_TYPE (new_type) = scalar_type; | |
772 | layout_type (new_type); | |
773 | return new_type; | |
774 | } | |
775 | ||
776 | static tree | |
777 | gfc_build_logical_type (gfc_logical_info *info) | |
778 | { | |
779 | int bit_size = info->bit_size; | |
780 | tree new_type; | |
781 | ||
782 | if (bit_size == BOOL_TYPE_SIZE) | |
783 | { | |
784 | info->c_bool = 1; | |
785 | return boolean_type_node; | |
786 | } | |
787 | ||
788 | new_type = make_unsigned_type (bit_size); | |
789 | TREE_SET_CODE (new_type, BOOLEAN_TYPE); | |
790 | TYPE_MAX_VALUE (new_type) = build_int_cst (new_type, 1); | |
791 | TYPE_PRECISION (new_type) = 1; | |
792 | ||
793 | return new_type; | |
794 | } | |
795 | ||
e0a6661b | 796 | |
6de9cd9a DN |
797 | /* Create the backend type nodes. We map them to their |
798 | equivalent C type, at least for now. We also give | |
799 | names to the types here, and we push them in the | |
800 | global binding level context.*/ | |
c3e8c6b8 | 801 | |
6de9cd9a DN |
802 | void |
803 | gfc_init_types (void) | |
804 | { | |
e5008df7 | 805 | char name_buf[18]; |
e2cad04b RH |
806 | int index; |
807 | tree type; | |
6de9cd9a DN |
808 | unsigned n; |
809 | unsigned HOST_WIDE_INT hi; | |
810 | unsigned HOST_WIDE_INT lo; | |
811 | ||
e2cad04b | 812 | /* Create and name the types. */ |
6de9cd9a | 813 | #define PUSH_TYPE(name, node) \ |
c2255bc4 AH |
814 | pushdecl (build_decl (input_location, \ |
815 | TYPE_DECL, get_identifier (name), node)) | |
6de9cd9a | 816 | |
e2cad04b RH |
817 | for (index = 0; gfc_integer_kinds[index].kind != 0; ++index) |
818 | { | |
819 | type = gfc_build_int_type (&gfc_integer_kinds[index]); | |
dead0bae JJ |
820 | /* Ensure integer(kind=1) doesn't have TYPE_STRING_FLAG set. */ |
821 | if (TYPE_STRING_FLAG (type)) | |
822 | type = make_signed_type (gfc_integer_kinds[index].bit_size); | |
e2cad04b | 823 | gfc_integer_types[index] = type; |
40373aa6 | 824 | snprintf (name_buf, sizeof(name_buf), "integer(kind=%d)", |
e2cad04b RH |
825 | gfc_integer_kinds[index].kind); |
826 | PUSH_TYPE (name_buf, type); | |
827 | } | |
6de9cd9a | 828 | |
e2cad04b RH |
829 | for (index = 0; gfc_logical_kinds[index].kind != 0; ++index) |
830 | { | |
831 | type = gfc_build_logical_type (&gfc_logical_kinds[index]); | |
832 | gfc_logical_types[index] = type; | |
40373aa6 | 833 | snprintf (name_buf, sizeof(name_buf), "logical(kind=%d)", |
e2cad04b RH |
834 | gfc_logical_kinds[index].kind); |
835 | PUSH_TYPE (name_buf, type); | |
836 | } | |
6de9cd9a | 837 | |
e2cad04b RH |
838 | for (index = 0; gfc_real_kinds[index].kind != 0; index++) |
839 | { | |
840 | type = gfc_build_real_type (&gfc_real_kinds[index]); | |
841 | gfc_real_types[index] = type; | |
40373aa6 | 842 | snprintf (name_buf, sizeof(name_buf), "real(kind=%d)", |
e2cad04b RH |
843 | gfc_real_kinds[index].kind); |
844 | PUSH_TYPE (name_buf, type); | |
845 | ||
a3c85b74 FXC |
846 | if (gfc_real_kinds[index].c_float128) |
847 | float128_type_node = type; | |
848 | ||
e2cad04b RH |
849 | type = gfc_build_complex_type (type); |
850 | gfc_complex_types[index] = type; | |
40373aa6 | 851 | snprintf (name_buf, sizeof(name_buf), "complex(kind=%d)", |
e2cad04b RH |
852 | gfc_real_kinds[index].kind); |
853 | PUSH_TYPE (name_buf, type); | |
a3c85b74 FXC |
854 | |
855 | if (gfc_real_kinds[index].c_float128) | |
856 | complex_float128_type_node = type; | |
e2cad04b | 857 | } |
6de9cd9a | 858 | |
374929b2 FXC |
859 | for (index = 0; gfc_character_kinds[index].kind != 0; ++index) |
860 | { | |
861 | type = gfc_build_uint_type (gfc_character_kinds[index].bit_size); | |
862 | type = build_qualified_type (type, TYPE_UNQUALIFIED); | |
863 | snprintf (name_buf, sizeof(name_buf), "character(kind=%d)", | |
864 | gfc_character_kinds[index].kind); | |
865 | PUSH_TYPE (name_buf, type); | |
866 | gfc_character_types[index] = type; | |
867 | gfc_pcharacter_types[index] = build_pointer_type (type); | |
868 | } | |
869 | gfc_character1_type_node = gfc_character_types[0]; | |
6de9cd9a DN |
870 | |
871 | PUSH_TYPE ("byte", unsigned_char_type_node); | |
872 | PUSH_TYPE ("void", void_type_node); | |
873 | ||
874 | /* DBX debugging output gets upset if these aren't set. */ | |
875 | if (!TYPE_NAME (integer_type_node)) | |
876 | PUSH_TYPE ("c_integer", integer_type_node); | |
877 | if (!TYPE_NAME (char_type_node)) | |
878 | PUSH_TYPE ("c_char", char_type_node); | |
e2cad04b | 879 | |
6de9cd9a DN |
880 | #undef PUSH_TYPE |
881 | ||
882 | pvoid_type_node = build_pointer_type (void_type_node); | |
10174ddf | 883 | prvoid_type_node = build_qualified_type (pvoid_type_node, TYPE_QUAL_RESTRICT); |
6de9cd9a DN |
884 | ppvoid_type_node = build_pointer_type (pvoid_type_node); |
885 | pchar_type_node = build_pointer_type (gfc_character1_type_node); | |
089db47d | 886 | pfunc_type_node |
b64fca63 | 887 | = build_pointer_type (build_function_type_list (void_type_node, NULL_TREE)); |
6de9cd9a | 888 | |
6de9cd9a | 889 | gfc_array_index_type = gfc_get_int_type (gfc_index_integer_kind); |
b4838d29 ZD |
890 | /* We cannot use gfc_index_zero_node in definition of gfc_array_range_type, |
891 | since this function is called before gfc_init_constants. */ | |
892 | gfc_array_range_type | |
893 | = build_range_type (gfc_array_index_type, | |
894 | build_int_cst (gfc_array_index_type, 0), | |
895 | NULL_TREE); | |
6de9cd9a DN |
896 | |
897 | /* The maximum array element size that can be handled is determined | |
898 | by the number of bits available to store this field in the array | |
899 | descriptor. */ | |
900 | ||
e2cad04b RH |
901 | n = TYPE_PRECISION (gfc_array_index_type) - GFC_DTYPE_SIZE_SHIFT; |
902 | lo = ~ (unsigned HOST_WIDE_INT) 0; | |
903 | if (n > HOST_BITS_PER_WIDE_INT) | |
904 | hi = lo >> (2*HOST_BITS_PER_WIDE_INT - n); | |
6de9cd9a | 905 | else |
e2cad04b | 906 | hi = 0, lo >>= HOST_BITS_PER_WIDE_INT - n; |
7d60be94 NS |
907 | gfc_max_array_element_size |
908 | = build_int_cst_wide (long_unsigned_type_node, lo, hi); | |
6de9cd9a | 909 | |
e2cad04b | 910 | boolean_type_node = gfc_get_logical_type (gfc_default_logical_kind); |
7d60be94 NS |
911 | boolean_true_node = build_int_cst (boolean_type_node, 1); |
912 | boolean_false_node = build_int_cst (boolean_type_node, 0); | |
e2cad04b RH |
913 | |
914 | /* ??? Shouldn't this be based on gfc_index_integer_kind or so? */ | |
f1412ca5 FXC |
915 | gfc_charlen_int_kind = 4; |
916 | gfc_charlen_type_node = gfc_get_int_type (gfc_charlen_int_kind); | |
6de9cd9a DN |
917 | } |
918 | ||
e2cad04b | 919 | /* Get the type node for the given type and kind. */ |
c3e8c6b8 | 920 | |
6de9cd9a DN |
921 | tree |
922 | gfc_get_int_type (int kind) | |
923 | { | |
644cb69f FXC |
924 | int index = gfc_validate_kind (BT_INTEGER, kind, true); |
925 | return index < 0 ? 0 : gfc_integer_types[index]; | |
6de9cd9a DN |
926 | } |
927 | ||
6de9cd9a DN |
928 | tree |
929 | gfc_get_real_type (int kind) | |
930 | { | |
644cb69f FXC |
931 | int index = gfc_validate_kind (BT_REAL, kind, true); |
932 | return index < 0 ? 0 : gfc_real_types[index]; | |
6de9cd9a DN |
933 | } |
934 | ||
6de9cd9a DN |
935 | tree |
936 | gfc_get_complex_type (int kind) | |
937 | { | |
644cb69f FXC |
938 | int index = gfc_validate_kind (BT_COMPLEX, kind, true); |
939 | return index < 0 ? 0 : gfc_complex_types[index]; | |
6de9cd9a DN |
940 | } |
941 | ||
6de9cd9a DN |
942 | tree |
943 | gfc_get_logical_type (int kind) | |
944 | { | |
644cb69f FXC |
945 | int index = gfc_validate_kind (BT_LOGICAL, kind, true); |
946 | return index < 0 ? 0 : gfc_logical_types[index]; | |
6de9cd9a | 947 | } |
374929b2 FXC |
948 | |
949 | tree | |
950 | gfc_get_char_type (int kind) | |
951 | { | |
952 | int index = gfc_validate_kind (BT_CHARACTER, kind, true); | |
953 | return index < 0 ? 0 : gfc_character_types[index]; | |
954 | } | |
955 | ||
956 | tree | |
957 | gfc_get_pchar_type (int kind) | |
958 | { | |
959 | int index = gfc_validate_kind (BT_CHARACTER, kind, true); | |
960 | return index < 0 ? 0 : gfc_pcharacter_types[index]; | |
961 | } | |
962 | ||
6de9cd9a | 963 | \f |
40f20186 | 964 | /* Create a character type with the given kind and length. */ |
c3e8c6b8 | 965 | |
6de9cd9a | 966 | tree |
d393bbd7 | 967 | gfc_get_character_type_len_for_eltype (tree eltype, tree len) |
6de9cd9a | 968 | { |
e2cad04b | 969 | tree bounds, type; |
6de9cd9a | 970 | |
5e3b8727 | 971 | bounds = build_range_type (gfc_charlen_type_node, gfc_index_one_node, len); |
d393bbd7 | 972 | type = build_array_type (eltype, bounds); |
6de9cd9a DN |
973 | TYPE_STRING_FLAG (type) = 1; |
974 | ||
975 | return type; | |
976 | } | |
40f20186 | 977 | |
d393bbd7 FXC |
978 | tree |
979 | gfc_get_character_type_len (int kind, tree len) | |
980 | { | |
981 | gfc_validate_kind (BT_CHARACTER, kind, false); | |
982 | return gfc_get_character_type_len_for_eltype (gfc_get_char_type (kind), len); | |
983 | } | |
984 | ||
40f20186 PB |
985 | |
986 | /* Get a type node for a character kind. */ | |
987 | ||
988 | tree | |
989 | gfc_get_character_type (int kind, gfc_charlen * cl) | |
990 | { | |
991 | tree len; | |
992 | ||
993 | len = (cl == NULL) ? NULL_TREE : cl->backend_decl; | |
994 | ||
995 | return gfc_get_character_type_len (kind, len); | |
996 | } | |
6de9cd9a DN |
997 | \f |
998 | /* Covert a basic type. This will be an array for character types. */ | |
c3e8c6b8 | 999 | |
6de9cd9a DN |
1000 | tree |
1001 | gfc_typenode_for_spec (gfc_typespec * spec) | |
1002 | { | |
1003 | tree basetype; | |
1004 | ||
1005 | switch (spec->type) | |
1006 | { | |
1007 | case BT_UNKNOWN: | |
6e45f57b | 1008 | gcc_unreachable (); |
6de9cd9a DN |
1009 | |
1010 | case BT_INTEGER: | |
a8b3b0b6 CR |
1011 | /* We use INTEGER(c_intptr_t) for C_PTR and C_FUNPTR once the symbol |
1012 | has been resolved. This is done so we can convert C_PTR and | |
1013 | C_FUNPTR to simple variables that get translated to (void *). */ | |
1014 | if (spec->f90_type == BT_VOID) | |
089db47d | 1015 | { |
bc21d315 JW |
1016 | if (spec->u.derived |
1017 | && spec->u.derived->intmod_sym_id == ISOCBINDING_PTR) | |
089db47d CR |
1018 | basetype = ptr_type_node; |
1019 | else | |
1020 | basetype = pfunc_type_node; | |
1021 | } | |
a8b3b0b6 CR |
1022 | else |
1023 | basetype = gfc_get_int_type (spec->kind); | |
6de9cd9a DN |
1024 | break; |
1025 | ||
1026 | case BT_REAL: | |
1027 | basetype = gfc_get_real_type (spec->kind); | |
1028 | break; | |
1029 | ||
1030 | case BT_COMPLEX: | |
1031 | basetype = gfc_get_complex_type (spec->kind); | |
1032 | break; | |
1033 | ||
1034 | case BT_LOGICAL: | |
1035 | basetype = gfc_get_logical_type (spec->kind); | |
1036 | break; | |
1037 | ||
1038 | case BT_CHARACTER: | |
597553ab PT |
1039 | #if 0 |
1040 | if (spec->deferred) | |
1041 | basetype = gfc_get_character_type (spec->kind, NULL); | |
1042 | else | |
1043 | #endif | |
1044 | basetype = gfc_get_character_type (spec->kind, spec->u.cl); | |
6de9cd9a DN |
1045 | break; |
1046 | ||
1047 | case BT_DERIVED: | |
cf2b3c22 | 1048 | case BT_CLASS: |
bc21d315 | 1049 | basetype = gfc_get_derived_type (spec->u.derived); |
6de9cd9a | 1050 | |
a8b3b0b6 CR |
1051 | /* If we're dealing with either C_PTR or C_FUNPTR, we modified the |
1052 | type and kind to fit a (void *) and the basetype returned was a | |
1053 | ptr_type_node. We need to pass up this new information to the | |
1054 | symbol that was declared of type C_PTR or C_FUNPTR. */ | |
bc21d315 | 1055 | if (spec->u.derived->attr.is_iso_c) |
a8b3b0b6 | 1056 | { |
bc21d315 JW |
1057 | spec->type = spec->u.derived->ts.type; |
1058 | spec->kind = spec->u.derived->ts.kind; | |
1059 | spec->f90_type = spec->u.derived->ts.f90_type; | |
a8b3b0b6 CR |
1060 | } |
1061 | break; | |
1062 | case BT_VOID: | |
089db47d CR |
1063 | /* This is for the second arg to c_f_pointer and c_f_procpointer |
1064 | of the iso_c_binding module, to accept any ptr type. */ | |
1065 | basetype = ptr_type_node; | |
1066 | if (spec->f90_type == BT_VOID) | |
1067 | { | |
bc21d315 JW |
1068 | if (spec->u.derived |
1069 | && spec->u.derived->intmod_sym_id == ISOCBINDING_PTR) | |
089db47d CR |
1070 | basetype = ptr_type_node; |
1071 | else | |
1072 | basetype = pfunc_type_node; | |
1073 | } | |
a8b3b0b6 | 1074 | break; |
6de9cd9a | 1075 | default: |
6e45f57b | 1076 | gcc_unreachable (); |
6de9cd9a DN |
1077 | } |
1078 | return basetype; | |
1079 | } | |
1080 | \f | |
1081 | /* Build an INT_CST for constant expressions, otherwise return NULL_TREE. */ | |
c3e8c6b8 | 1082 | |
6de9cd9a DN |
1083 | static tree |
1084 | gfc_conv_array_bound (gfc_expr * expr) | |
1085 | { | |
1086 | /* If expr is an integer constant, return that. */ | |
1087 | if (expr != NULL && expr->expr_type == EXPR_CONSTANT) | |
1088 | return gfc_conv_mpz_to_tree (expr->value.integer, gfc_index_integer_kind); | |
1089 | ||
1090 | /* Otherwise return NULL. */ | |
1091 | return NULL_TREE; | |
1092 | } | |
1093 | \f | |
1094 | tree | |
1095 | gfc_get_element_type (tree type) | |
1096 | { | |
1097 | tree element; | |
1098 | ||
1099 | if (GFC_ARRAY_TYPE_P (type)) | |
1100 | { | |
1101 | if (TREE_CODE (type) == POINTER_TYPE) | |
1102 | type = TREE_TYPE (type); | |
4409de24 TB |
1103 | if (GFC_TYPE_ARRAY_RANK (type) == 0) |
1104 | { | |
1105 | gcc_assert (GFC_TYPE_ARRAY_CORANK (type) > 0); | |
1106 | element = type; | |
1107 | } | |
1108 | else | |
1109 | { | |
1110 | gcc_assert (TREE_CODE (type) == ARRAY_TYPE); | |
1111 | element = TREE_TYPE (type); | |
1112 | } | |
6de9cd9a DN |
1113 | } |
1114 | else | |
1115 | { | |
6e45f57b | 1116 | gcc_assert (GFC_DESCRIPTOR_TYPE_P (type)); |
4c73896d | 1117 | element = GFC_TYPE_ARRAY_DATAPTR_TYPE (type); |
6de9cd9a | 1118 | |
6e45f57b | 1119 | gcc_assert (TREE_CODE (element) == POINTER_TYPE); |
6de9cd9a DN |
1120 | element = TREE_TYPE (element); |
1121 | ||
6e45f57b | 1122 | gcc_assert (TREE_CODE (element) == ARRAY_TYPE); |
6de9cd9a DN |
1123 | element = TREE_TYPE (element); |
1124 | } | |
1125 | ||
1126 | return element; | |
1127 | } | |
1128 | \f | |
eb28fb7d | 1129 | /* Build an array. This function is called from gfc_sym_type(). |
c3e8c6b8 | 1130 | Actually returns array descriptor type. |
6de9cd9a DN |
1131 | |
1132 | Format of array descriptors is as follows: | |
1133 | ||
1134 | struct gfc_array_descriptor | |
1135 | { | |
1136 | array *data | |
1137 | index offset; | |
1138 | index dtype; | |
1139 | struct descriptor_dimension dimension[N_DIM]; | |
1140 | } | |
1141 | ||
1142 | struct descriptor_dimension | |
1143 | { | |
1144 | index stride; | |
1145 | index lbound; | |
1146 | index ubound; | |
1147 | } | |
1148 | ||
eb28fb7d TS |
1149 | Translation code should use gfc_conv_descriptor_* rather than |
1150 | accessing the descriptor directly. Any changes to the array | |
1151 | descriptor type will require changes in gfc_conv_descriptor_* and | |
1152 | gfc_build_array_initializer. | |
6de9cd9a | 1153 | |
eb28fb7d TS |
1154 | This is represented internally as a RECORD_TYPE. The index nodes |
1155 | are gfc_array_index_type and the data node is a pointer to the | |
1156 | data. See below for the handling of character types. | |
6de9cd9a DN |
1157 | |
1158 | The dtype member is formatted as follows: | |
1159 | rank = dtype & GFC_DTYPE_RANK_MASK // 3 bits | |
1160 | type = (dtype & GFC_DTYPE_TYPE_MASK) >> GFC_DTYPE_TYPE_SHIFT // 3 bits | |
1161 | size = dtype >> GFC_DTYPE_SIZE_SHIFT | |
1162 | ||
eb28fb7d TS |
1163 | I originally used nested ARRAY_TYPE nodes to represent arrays, but |
1164 | this generated poor code for assumed/deferred size arrays. These | |
1165 | require use of PLACEHOLDER_EXPR/WITH_RECORD_EXPR, which isn't part | |
1166 | of the GENERIC grammar. Also, there is no way to explicitly set | |
1167 | the array stride, so all data must be packed(1). I've tried to | |
1168 | mark all the functions which would require modification with a GCC | |
1169 | ARRAYS comment. | |
6de9cd9a | 1170 | |
eb28fb7d | 1171 | The data component points to the first element in the array. The |
df2fba9e RW |
1172 | offset field is the position of the origin of the array (i.e. element |
1173 | (0, 0 ...)). This may be outside the bounds of the array. | |
6de9cd9a DN |
1174 | |
1175 | An element is accessed by | |
eb28fb7d | 1176 | data[offset + index0*stride0 + index1*stride1 + index2*stride2] |
c3e8c6b8 | 1177 | This gives good performance as the computation does not involve the |
eb28fb7d TS |
1178 | bounds of the array. For packed arrays, this is optimized further |
1179 | by substituting the known strides. | |
6de9cd9a | 1180 | |
eb28fb7d TS |
1181 | This system has one problem: all array bounds must be within 2^31 |
1182 | elements of the origin (2^63 on 64-bit machines). For example | |
1183 | integer, dimension (80000:90000, 80000:90000, 2) :: array | |
1184 | may not work properly on 32-bit machines because 80000*80000 > | |
df2fba9e | 1185 | 2^31, so the calculation for stride2 would overflow. This may |
eb28fb7d TS |
1186 | still work, but I haven't checked, and it relies on the overflow |
1187 | doing the right thing. | |
6de9cd9a | 1188 | |
1f2959f0 | 1189 | The way to fix this problem is to access elements as follows: |
eb28fb7d TS |
1190 | data[(index0-lbound0)*stride0 + (index1-lbound1)*stride1] |
1191 | Obviously this is much slower. I will make this a compile time | |
1192 | option, something like -fsmall-array-offsets. Mixing code compiled | |
1193 | with and without this switch will work. | |
1194 | ||
1195 | (1) This can be worked around by modifying the upper bound of the | |
1196 | previous dimension. This requires extra fields in the descriptor | |
1197 | (both real_ubound and fake_ubound). */ | |
6de9cd9a DN |
1198 | |
1199 | ||
1200 | /* Returns true if the array sym does not require a descriptor. */ | |
1201 | ||
1202 | int | |
1203 | gfc_is_nodesc_array (gfc_symbol * sym) | |
1204 | { | |
c81e79b5 | 1205 | gcc_assert (sym->attr.dimension || sym->attr.codimension); |
6de9cd9a DN |
1206 | |
1207 | /* We only want local arrays. */ | |
1208 | if (sym->attr.pointer || sym->attr.allocatable) | |
1209 | return 0; | |
1210 | ||
571d54de DK |
1211 | /* We want a descriptor for associate-name arrays that do not have an |
1212 | explicitely known shape already. */ | |
1213 | if (sym->assoc && sym->as->type != AS_EXPLICIT) | |
1214 | return 0; | |
1215 | ||
6de9cd9a | 1216 | if (sym->attr.dummy) |
571d54de | 1217 | return sym->as->type != AS_ASSUMED_SHAPE; |
6de9cd9a DN |
1218 | |
1219 | if (sym->attr.result || sym->attr.function) | |
1220 | return 0; | |
1221 | ||
b3aefde2 | 1222 | gcc_assert (sym->as->type == AS_EXPLICIT || sym->as->cp_was_assumed); |
6de9cd9a DN |
1223 | |
1224 | return 1; | |
1225 | } | |
1226 | ||
40f20186 PB |
1227 | |
1228 | /* Create an array descriptor type. */ | |
1229 | ||
6de9cd9a | 1230 | static tree |
fad0afd7 | 1231 | gfc_build_array_type (tree type, gfc_array_spec * as, |
fe4e525c TB |
1232 | enum gfc_array_kind akind, bool restricted, |
1233 | bool contiguous) | |
6de9cd9a DN |
1234 | { |
1235 | tree lbound[GFC_MAX_DIMENSIONS]; | |
1236 | tree ubound[GFC_MAX_DIMENSIONS]; | |
1237 | int n; | |
1238 | ||
1239 | for (n = 0; n < as->rank; n++) | |
1240 | { | |
1241 | /* Create expressions for the known bounds of the array. */ | |
1242 | if (as->type == AS_ASSUMED_SHAPE && as->lower[n] == NULL) | |
7ab92584 | 1243 | lbound[n] = gfc_index_one_node; |
6de9cd9a DN |
1244 | else |
1245 | lbound[n] = gfc_conv_array_bound (as->lower[n]); | |
1246 | ubound[n] = gfc_conv_array_bound (as->upper[n]); | |
1247 | } | |
1248 | ||
a3935ffc TB |
1249 | for (n = as->rank; n < as->rank + as->corank; n++) |
1250 | { | |
1251 | if (as->lower[n] == NULL) | |
1252 | lbound[n] = gfc_index_one_node; | |
1253 | else | |
1254 | lbound[n] = gfc_conv_array_bound (as->lower[n]); | |
1255 | ||
1256 | if (n < as->rank + as->corank - 1) | |
1257 | ubound[n] = gfc_conv_array_bound (as->upper[n]); | |
1258 | } | |
1259 | ||
fad0afd7 | 1260 | if (as->type == AS_ASSUMED_SHAPE) |
fe4e525c TB |
1261 | akind = contiguous ? GFC_ARRAY_ASSUMED_SHAPE_CONT |
1262 | : GFC_ARRAY_ASSUMED_SHAPE; | |
f33beee9 TB |
1263 | return gfc_get_array_type_bounds (type, as->rank, as->corank, lbound, |
1264 | ubound, 0, akind, restricted); | |
6de9cd9a DN |
1265 | } |
1266 | \f | |
1267 | /* Returns the struct descriptor_dimension type. */ | |
c3e8c6b8 | 1268 | |
6de9cd9a DN |
1269 | static tree |
1270 | gfc_get_desc_dim_type (void) | |
1271 | { | |
1272 | tree type; | |
35151cd5 | 1273 | tree decl, *chain = NULL; |
6de9cd9a DN |
1274 | |
1275 | if (gfc_desc_dim_type) | |
1276 | return gfc_desc_dim_type; | |
1277 | ||
1278 | /* Build the type node. */ | |
1279 | type = make_node (RECORD_TYPE); | |
1280 | ||
1281 | TYPE_NAME (type) = get_identifier ("descriptor_dimension"); | |
1282 | TYPE_PACKED (type) = 1; | |
1283 | ||
1284 | /* Consists of the stride, lbound and ubound members. */ | |
35151cd5 | 1285 | decl = gfc_add_field_to_struct_1 (type, |
dfd6ece2 NF |
1286 | get_identifier ("stride"), |
1287 | gfc_array_index_type, &chain); | |
d8eff1b8 | 1288 | TREE_NO_WARNING (decl) = 1; |
6de9cd9a | 1289 | |
35151cd5 | 1290 | decl = gfc_add_field_to_struct_1 (type, |
dfd6ece2 NF |
1291 | get_identifier ("lbound"), |
1292 | gfc_array_index_type, &chain); | |
d8eff1b8 | 1293 | TREE_NO_WARNING (decl) = 1; |
6de9cd9a | 1294 | |
35151cd5 | 1295 | decl = gfc_add_field_to_struct_1 (type, |
dfd6ece2 NF |
1296 | get_identifier ("ubound"), |
1297 | gfc_array_index_type, &chain); | |
d8eff1b8 | 1298 | TREE_NO_WARNING (decl) = 1; |
6de9cd9a DN |
1299 | |
1300 | /* Finish off the type. */ | |
6de9cd9a | 1301 | gfc_finish_type (type); |
dfcf0b12 | 1302 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type)) = 1; |
6de9cd9a DN |
1303 | |
1304 | gfc_desc_dim_type = type; | |
1305 | return type; | |
1306 | } | |
1307 | ||
40b026d8 | 1308 | |
43a5ef69 | 1309 | /* Return the DTYPE for an array. This describes the type and type parameters |
40b026d8 PB |
1310 | of the array. */ |
1311 | /* TODO: Only call this when the value is actually used, and make all the | |
1312 | unknown cases abort. */ | |
1313 | ||
1314 | tree | |
1315 | gfc_get_dtype (tree type) | |
6de9cd9a DN |
1316 | { |
1317 | tree size; | |
1318 | int n; | |
1319 | HOST_WIDE_INT i; | |
1320 | tree tmp; | |
1321 | tree dtype; | |
40b026d8 PB |
1322 | tree etype; |
1323 | int rank; | |
1324 | ||
1325 | gcc_assert (GFC_DESCRIPTOR_TYPE_P (type) || GFC_ARRAY_TYPE_P (type)); | |
1326 | ||
1327 | if (GFC_TYPE_ARRAY_DTYPE (type)) | |
1328 | return GFC_TYPE_ARRAY_DTYPE (type); | |
6de9cd9a | 1329 | |
40b026d8 PB |
1330 | rank = GFC_TYPE_ARRAY_RANK (type); |
1331 | etype = gfc_get_element_type (type); | |
6de9cd9a | 1332 | |
40b026d8 | 1333 | switch (TREE_CODE (etype)) |
6de9cd9a DN |
1334 | { |
1335 | case INTEGER_TYPE: | |
a11930ba | 1336 | n = BT_INTEGER; |
6de9cd9a DN |
1337 | break; |
1338 | ||
1339 | case BOOLEAN_TYPE: | |
a11930ba | 1340 | n = BT_LOGICAL; |
6de9cd9a DN |
1341 | break; |
1342 | ||
1343 | case REAL_TYPE: | |
a11930ba | 1344 | n = BT_REAL; |
6de9cd9a DN |
1345 | break; |
1346 | ||
1347 | case COMPLEX_TYPE: | |
a11930ba | 1348 | n = BT_COMPLEX; |
6de9cd9a DN |
1349 | break; |
1350 | ||
40b026d8 | 1351 | /* We will never have arrays of arrays. */ |
6de9cd9a | 1352 | case RECORD_TYPE: |
a11930ba | 1353 | n = BT_DERIVED; |
6de9cd9a DN |
1354 | break; |
1355 | ||
1356 | case ARRAY_TYPE: | |
a11930ba | 1357 | n = BT_CHARACTER; |
6de9cd9a DN |
1358 | break; |
1359 | ||
1360 | default: | |
40f20186 PB |
1361 | /* TODO: Don't do dtype for temporary descriptorless arrays. */ |
1362 | /* We can strange array types for temporary arrays. */ | |
1363 | return gfc_index_zero_node; | |
6de9cd9a DN |
1364 | } |
1365 | ||
6e45f57b | 1366 | gcc_assert (rank <= GFC_DTYPE_RANK_MASK); |
40b026d8 | 1367 | size = TYPE_SIZE_UNIT (etype); |
f676971a | 1368 | |
6de9cd9a DN |
1369 | i = rank | (n << GFC_DTYPE_TYPE_SHIFT); |
1370 | if (size && INTEGER_CST_P (size)) | |
1371 | { | |
1372 | if (tree_int_cst_lt (gfc_max_array_element_size, size)) | |
1373 | internal_error ("Array element size too big"); | |
1374 | ||
1375 | i += TREE_INT_CST_LOW (size) << GFC_DTYPE_SIZE_SHIFT; | |
1376 | } | |
7d60be94 | 1377 | dtype = build_int_cst (gfc_array_index_type, i); |
6de9cd9a DN |
1378 | |
1379 | if (size && !INTEGER_CST_P (size)) | |
1380 | { | |
7d60be94 | 1381 | tmp = build_int_cst (gfc_array_index_type, GFC_DTYPE_SIZE_SHIFT); |
bc98ed60 TB |
1382 | tmp = fold_build2_loc (input_location, LSHIFT_EXPR, |
1383 | gfc_array_index_type, | |
1384 | fold_convert (gfc_array_index_type, size), tmp); | |
1385 | dtype = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type, | |
1386 | tmp, dtype); | |
6de9cd9a DN |
1387 | } |
1388 | /* If we don't know the size we leave it as zero. This should never happen | |
1389 | for anything that is actually used. */ | |
1390 | /* TODO: Check this is actually true, particularly when repacking | |
1391 | assumed size parameters. */ | |
1392 | ||
40b026d8 | 1393 | GFC_TYPE_ARRAY_DTYPE (type) = dtype; |
6de9cd9a DN |
1394 | return dtype; |
1395 | } | |
1396 | ||
1397 | ||
dcfef7d4 TS |
1398 | /* Build an array type for use without a descriptor, packed according |
1399 | to the value of PACKED. */ | |
6de9cd9a DN |
1400 | |
1401 | tree | |
10174ddf MM |
1402 | gfc_get_nodesc_array_type (tree etype, gfc_array_spec * as, gfc_packed packed, |
1403 | bool restricted) | |
6de9cd9a DN |
1404 | { |
1405 | tree range; | |
1406 | tree type; | |
1407 | tree tmp; | |
1408 | int n; | |
1409 | int known_stride; | |
1410 | int known_offset; | |
1411 | mpz_t offset; | |
1412 | mpz_t stride; | |
1413 | mpz_t delta; | |
1414 | gfc_expr *expr; | |
1415 | ||
1416 | mpz_init_set_ui (offset, 0); | |
1417 | mpz_init_set_ui (stride, 1); | |
1418 | mpz_init (delta); | |
1419 | ||
1420 | /* We don't use build_array_type because this does not include include | |
13795658 | 1421 | lang-specific information (i.e. the bounds of the array) when checking |
6de9cd9a | 1422 | for duplicates. */ |
4409de24 TB |
1423 | if (as->rank) |
1424 | type = make_node (ARRAY_TYPE); | |
1425 | else | |
8a5c4899 | 1426 | type = build_variant_type_copy (etype); |
6de9cd9a DN |
1427 | |
1428 | GFC_ARRAY_TYPE_P (type) = 1; | |
a9429e29 LB |
1429 | TYPE_LANG_SPECIFIC (type) |
1430 | = ggc_alloc_cleared_lang_type (sizeof (struct lang_type)); | |
6de9cd9a | 1431 | |
dcfef7d4 | 1432 | known_stride = (packed != PACKED_NO); |
6de9cd9a DN |
1433 | known_offset = 1; |
1434 | for (n = 0; n < as->rank; n++) | |
1435 | { | |
1436 | /* Fill in the stride and bound components of the type. */ | |
1437 | if (known_stride) | |
08789087 | 1438 | tmp = gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind); |
6de9cd9a DN |
1439 | else |
1440 | tmp = NULL_TREE; | |
1441 | GFC_TYPE_ARRAY_STRIDE (type, n) = tmp; | |
1442 | ||
1443 | expr = as->lower[n]; | |
1444 | if (expr->expr_type == EXPR_CONSTANT) | |
1445 | { | |
1446 | tmp = gfc_conv_mpz_to_tree (expr->value.integer, | |
fad0afd7 | 1447 | gfc_index_integer_kind); |
6de9cd9a DN |
1448 | } |
1449 | else | |
1450 | { | |
1451 | known_stride = 0; | |
1452 | tmp = NULL_TREE; | |
1453 | } | |
1454 | GFC_TYPE_ARRAY_LBOUND (type, n) = tmp; | |
1455 | ||
1456 | if (known_stride) | |
1457 | { | |
1458 | /* Calculate the offset. */ | |
1459 | mpz_mul (delta, stride, as->lower[n]->value.integer); | |
1460 | mpz_sub (offset, offset, delta); | |
1461 | } | |
1462 | else | |
1463 | known_offset = 0; | |
1464 | ||
1465 | expr = as->upper[n]; | |
1466 | if (expr && expr->expr_type == EXPR_CONSTANT) | |
1467 | { | |
1468 | tmp = gfc_conv_mpz_to_tree (expr->value.integer, | |
1469 | gfc_index_integer_kind); | |
1470 | } | |
1471 | else | |
1472 | { | |
1473 | tmp = NULL_TREE; | |
1474 | known_stride = 0; | |
1475 | } | |
1476 | GFC_TYPE_ARRAY_UBOUND (type, n) = tmp; | |
1477 | ||
1478 | if (known_stride) | |
1479 | { | |
1480 | /* Calculate the stride. */ | |
1481 | mpz_sub (delta, as->upper[n]->value.integer, | |
1482 | as->lower[n]->value.integer); | |
1483 | mpz_add_ui (delta, delta, 1); | |
1484 | mpz_mul (stride, stride, delta); | |
1485 | } | |
1486 | ||
1487 | /* Only the first stride is known for partial packed arrays. */ | |
dcfef7d4 | 1488 | if (packed == PACKED_NO || packed == PACKED_PARTIAL) |
6de9cd9a DN |
1489 | known_stride = 0; |
1490 | } | |
a3935ffc TB |
1491 | for (n = as->rank; n < as->rank + as->corank; n++) |
1492 | { | |
1493 | expr = as->lower[n]; | |
1494 | if (expr->expr_type == EXPR_CONSTANT) | |
1495 | tmp = gfc_conv_mpz_to_tree (expr->value.integer, | |
1496 | gfc_index_integer_kind); | |
1497 | else | |
1498 | tmp = NULL_TREE; | |
1499 | GFC_TYPE_ARRAY_LBOUND (type, n) = tmp; | |
1500 | ||
1501 | expr = as->upper[n]; | |
1502 | if (expr && expr->expr_type == EXPR_CONSTANT) | |
1503 | tmp = gfc_conv_mpz_to_tree (expr->value.integer, | |
1504 | gfc_index_integer_kind); | |
1505 | else | |
1506 | tmp = NULL_TREE; | |
1507 | if (n < as->rank + as->corank - 1) | |
1508 | GFC_TYPE_ARRAY_UBOUND (type, n) = tmp; | |
1509 | } | |
6de9cd9a DN |
1510 | |
1511 | if (known_offset) | |
1512 | { | |
1513 | GFC_TYPE_ARRAY_OFFSET (type) = | |
1514 | gfc_conv_mpz_to_tree (offset, gfc_index_integer_kind); | |
1515 | } | |
1516 | else | |
1517 | GFC_TYPE_ARRAY_OFFSET (type) = NULL_TREE; | |
1518 | ||
1519 | if (known_stride) | |
1520 | { | |
1521 | GFC_TYPE_ARRAY_SIZE (type) = | |
1522 | gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind); | |
1523 | } | |
1524 | else | |
1525 | GFC_TYPE_ARRAY_SIZE (type) = NULL_TREE; | |
1526 | ||
6de9cd9a | 1527 | GFC_TYPE_ARRAY_RANK (type) = as->rank; |
a3935ffc | 1528 | GFC_TYPE_ARRAY_CORANK (type) = as->corank; |
40b026d8 | 1529 | GFC_TYPE_ARRAY_DTYPE (type) = NULL_TREE; |
7ab92584 | 1530 | range = build_range_type (gfc_array_index_type, gfc_index_zero_node, |
6de9cd9a DN |
1531 | NULL_TREE); |
1532 | /* TODO: use main type if it is unbounded. */ | |
1533 | GFC_TYPE_ARRAY_DATAPTR_TYPE (type) = | |
1534 | build_pointer_type (build_array_type (etype, range)); | |
10174ddf MM |
1535 | if (restricted) |
1536 | GFC_TYPE_ARRAY_DATAPTR_TYPE (type) = | |
1537 | build_qualified_type (GFC_TYPE_ARRAY_DATAPTR_TYPE (type), | |
1538 | TYPE_QUAL_RESTRICT); | |
6de9cd9a | 1539 | |
4409de24 TB |
1540 | if (as->rank == 0) |
1541 | { | |
b8ff4e88 | 1542 | if (packed != PACKED_STATIC || gfc_option.coarray == GFC_FCOARRAY_LIB) |
5aacb11e TB |
1543 | { |
1544 | type = build_pointer_type (type); | |
4409de24 | 1545 | |
5aacb11e TB |
1546 | if (restricted) |
1547 | type = build_qualified_type (type, TYPE_QUAL_RESTRICT); | |
4409de24 | 1548 | |
4409de24 TB |
1549 | GFC_ARRAY_TYPE_P (type) = 1; |
1550 | TYPE_LANG_SPECIFIC (type) = TYPE_LANG_SPECIFIC (TREE_TYPE (type)); | |
1551 | } | |
1552 | ||
1553 | return type; | |
1554 | } | |
1555 | ||
6de9cd9a DN |
1556 | if (known_stride) |
1557 | { | |
1558 | mpz_sub_ui (stride, stride, 1); | |
1559 | range = gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind); | |
1560 | } | |
1561 | else | |
1562 | range = NULL_TREE; | |
1563 | ||
7ab92584 | 1564 | range = build_range_type (gfc_array_index_type, gfc_index_zero_node, range); |
6de9cd9a DN |
1565 | TYPE_DOMAIN (type) = range; |
1566 | ||
1567 | build_pointer_type (etype); | |
1568 | TREE_TYPE (type) = etype; | |
1569 | ||
1570 | layout_type (type); | |
1571 | ||
1572 | mpz_clear (offset); | |
1573 | mpz_clear (stride); | |
1574 | mpz_clear (delta); | |
1575 | ||
09775c40 AO |
1576 | /* Represent packed arrays as multi-dimensional if they have rank > |
1577 | 1 and with proper bounds, instead of flat arrays. This makes for | |
1578 | better debug info. */ | |
1579 | if (known_offset) | |
08789087 JJ |
1580 | { |
1581 | tree gtype = etype, rtype, type_decl; | |
1582 | ||
1583 | for (n = as->rank - 1; n >= 0; n--) | |
1584 | { | |
1585 | rtype = build_range_type (gfc_array_index_type, | |
1586 | GFC_TYPE_ARRAY_LBOUND (type, n), | |
1587 | GFC_TYPE_ARRAY_UBOUND (type, n)); | |
1588 | gtype = build_array_type (gtype, rtype); | |
1589 | } | |
c2255bc4 AH |
1590 | TYPE_NAME (type) = type_decl = build_decl (input_location, |
1591 | TYPE_DECL, NULL, gtype); | |
08789087 JJ |
1592 | DECL_ORIGINAL_TYPE (type_decl) = gtype; |
1593 | } | |
1594 | ||
b8ff4e88 TB |
1595 | if (packed != PACKED_STATIC || !known_stride |
1596 | || (as->corank && gfc_option.coarray == GFC_FCOARRAY_LIB)) | |
6de9cd9a | 1597 | { |
841b0c1f PB |
1598 | /* For dummy arrays and automatic (heap allocated) arrays we |
1599 | want a pointer to the array. */ | |
6de9cd9a | 1600 | type = build_pointer_type (type); |
10174ddf MM |
1601 | if (restricted) |
1602 | type = build_qualified_type (type, TYPE_QUAL_RESTRICT); | |
6de9cd9a DN |
1603 | GFC_ARRAY_TYPE_P (type) = 1; |
1604 | TYPE_LANG_SPECIFIC (type) = TYPE_LANG_SPECIFIC (TREE_TYPE (type)); | |
1605 | } | |
1606 | return type; | |
1607 | } | |
1608 | ||
4c73896d RH |
1609 | /* Return or create the base type for an array descriptor. */ |
1610 | ||
1611 | static tree | |
f33beee9 | 1612 | gfc_get_array_descriptor_base (int dimen, int codimen, bool restricted) |
4c73896d | 1613 | { |
35151cd5 | 1614 | tree fat_type, decl, arraytype, *chain = NULL; |
f33beee9 | 1615 | char name[16 + 2*GFC_RANK_DIGITS + 1 + 1]; |
bf65e4b1 | 1616 | int idx = 2 * (codimen + dimen - 1) + restricted; |
4c73896d | 1617 | |
c81e79b5 | 1618 | gcc_assert (codimen + dimen >= 1 && codimen + dimen <= GFC_MAX_DIMENSIONS); |
10174ddf MM |
1619 | if (gfc_array_descriptor_base[idx]) |
1620 | return gfc_array_descriptor_base[idx]; | |
4c73896d RH |
1621 | |
1622 | /* Build the type node. */ | |
1623 | fat_type = make_node (RECORD_TYPE); | |
1624 | ||
bf65e4b1 | 1625 | sprintf (name, "array_descriptor" GFC_RANK_PRINTF_FORMAT, dimen + codimen); |
4c73896d | 1626 | TYPE_NAME (fat_type) = get_identifier (name); |
cd3f04c8 | 1627 | TYPE_NAMELESS (fat_type) = 1; |
4c73896d RH |
1628 | |
1629 | /* Add the data member as the first element of the descriptor. */ | |
35151cd5 | 1630 | decl = gfc_add_field_to_struct_1 (fat_type, |
dfd6ece2 NF |
1631 | get_identifier ("data"), |
1632 | (restricted | |
1633 | ? prvoid_type_node | |
1634 | : ptr_type_node), &chain); | |
4c73896d RH |
1635 | |
1636 | /* Add the base component. */ | |
35151cd5 | 1637 | decl = gfc_add_field_to_struct_1 (fat_type, |
dfd6ece2 NF |
1638 | get_identifier ("offset"), |
1639 | gfc_array_index_type, &chain); | |
d8eff1b8 | 1640 | TREE_NO_WARNING (decl) = 1; |
4c73896d RH |
1641 | |
1642 | /* Add the dtype component. */ | |
35151cd5 | 1643 | decl = gfc_add_field_to_struct_1 (fat_type, |
dfd6ece2 NF |
1644 | get_identifier ("dtype"), |
1645 | gfc_array_index_type, &chain); | |
d8eff1b8 | 1646 | TREE_NO_WARNING (decl) = 1; |
4c73896d RH |
1647 | |
1648 | /* Build the array type for the stride and bound components. */ | |
1649 | arraytype = | |
1650 | build_array_type (gfc_get_desc_dim_type (), | |
1651 | build_range_type (gfc_array_index_type, | |
1652 | gfc_index_zero_node, | |
f33beee9 | 1653 | gfc_rank_cst[codimen + dimen - 1])); |
4c73896d | 1654 | |
35151cd5 | 1655 | decl = gfc_add_field_to_struct_1 (fat_type, |
dfd6ece2 NF |
1656 | get_identifier ("dim"), |
1657 | arraytype, &chain); | |
d8eff1b8 | 1658 | TREE_NO_WARNING (decl) = 1; |
4c73896d RH |
1659 | |
1660 | /* Finish off the type. */ | |
4c73896d | 1661 | gfc_finish_type (fat_type); |
dfcf0b12 | 1662 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (fat_type)) = 1; |
4c73896d | 1663 | |
10174ddf | 1664 | gfc_array_descriptor_base[idx] = fat_type; |
4c73896d RH |
1665 | return fat_type; |
1666 | } | |
6de9cd9a DN |
1667 | |
1668 | /* Build an array (descriptor) type with given bounds. */ | |
1669 | ||
1670 | tree | |
f33beee9 | 1671 | gfc_get_array_type_bounds (tree etype, int dimen, int codimen, tree * lbound, |
fad0afd7 | 1672 | tree * ubound, int packed, |
10174ddf | 1673 | enum gfc_array_kind akind, bool restricted) |
6de9cd9a | 1674 | { |
f33beee9 | 1675 | char name[8 + 2*GFC_RANK_DIGITS + 1 + GFC_MAX_SYMBOL_LEN]; |
416a8af4 | 1676 | tree fat_type, base_type, arraytype, lower, upper, stride, tmp, rtype; |
9aa433c2 | 1677 | const char *type_name; |
4c73896d | 1678 | int n; |
6de9cd9a | 1679 | |
f33beee9 | 1680 | base_type = gfc_get_array_descriptor_base (dimen, codimen, restricted); |
9618fb3c | 1681 | fat_type = build_distinct_type_copy (base_type); |
10174ddf MM |
1682 | /* Make sure that nontarget and target array type have the same canonical |
1683 | type (and same stub decl for debug info). */ | |
f33beee9 | 1684 | base_type = gfc_get_array_descriptor_base (dimen, codimen, false); |
9618fb3c RG |
1685 | TYPE_CANONICAL (fat_type) = base_type; |
1686 | TYPE_STUB_DECL (fat_type) = TYPE_STUB_DECL (base_type); | |
6de9cd9a DN |
1687 | |
1688 | tmp = TYPE_NAME (etype); | |
1689 | if (tmp && TREE_CODE (tmp) == TYPE_DECL) | |
1690 | tmp = DECL_NAME (tmp); | |
1691 | if (tmp) | |
9aa433c2 | 1692 | type_name = IDENTIFIER_POINTER (tmp); |
6de9cd9a | 1693 | else |
9aa433c2 | 1694 | type_name = "unknown"; |
bf65e4b1 | 1695 | sprintf (name, "array" GFC_RANK_PRINTF_FORMAT "_%.*s", dimen + codimen, |
9aa433c2 | 1696 | GFC_MAX_SYMBOL_LEN, type_name); |
6de9cd9a | 1697 | TYPE_NAME (fat_type) = get_identifier (name); |
cd3f04c8 | 1698 | TYPE_NAMELESS (fat_type) = 1; |
6de9cd9a | 1699 | |
4c73896d | 1700 | GFC_DESCRIPTOR_TYPE_P (fat_type) = 1; |
a9429e29 LB |
1701 | TYPE_LANG_SPECIFIC (fat_type) |
1702 | = ggc_alloc_cleared_lang_type (sizeof (struct lang_type)); | |
4c73896d RH |
1703 | |
1704 | GFC_TYPE_ARRAY_RANK (fat_type) = dimen; | |
a3935ffc | 1705 | GFC_TYPE_ARRAY_CORANK (fat_type) = codimen; |
4c73896d | 1706 | GFC_TYPE_ARRAY_DTYPE (fat_type) = NULL_TREE; |
fad0afd7 | 1707 | GFC_TYPE_ARRAY_AKIND (fat_type) = akind; |
6de9cd9a DN |
1708 | |
1709 | /* Build an array descriptor record type. */ | |
1710 | if (packed != 0) | |
7ab92584 | 1711 | stride = gfc_index_one_node; |
6de9cd9a DN |
1712 | else |
1713 | stride = NULL_TREE; | |
4ca9939b | 1714 | for (n = 0; n < dimen + codimen; n++) |
6de9cd9a | 1715 | { |
4ca9939b TB |
1716 | if (n < dimen) |
1717 | GFC_TYPE_ARRAY_STRIDE (fat_type, n) = stride; | |
6de9cd9a DN |
1718 | |
1719 | if (lbound) | |
1720 | lower = lbound[n]; | |
1721 | else | |
1722 | lower = NULL_TREE; | |
1723 | ||
1724 | if (lower != NULL_TREE) | |
1725 | { | |
1726 | if (INTEGER_CST_P (lower)) | |
1727 | GFC_TYPE_ARRAY_LBOUND (fat_type, n) = lower; | |
1728 | else | |
1729 | lower = NULL_TREE; | |
1730 | } | |
1731 | ||
4ca9939b TB |
1732 | if (codimen && n == dimen + codimen - 1) |
1733 | break; | |
1734 | ||
6de9cd9a DN |
1735 | upper = ubound[n]; |
1736 | if (upper != NULL_TREE) | |
1737 | { | |
1738 | if (INTEGER_CST_P (upper)) | |
1739 | GFC_TYPE_ARRAY_UBOUND (fat_type, n) = upper; | |
1740 | else | |
1741 | upper = NULL_TREE; | |
1742 | } | |
1743 | ||
4ca9939b TB |
1744 | if (n >= dimen) |
1745 | continue; | |
1746 | ||
6de9cd9a DN |
1747 | if (upper != NULL_TREE && lower != NULL_TREE && stride != NULL_TREE) |
1748 | { | |
bc98ed60 TB |
1749 | tmp = fold_build2_loc (input_location, MINUS_EXPR, |
1750 | gfc_array_index_type, upper, lower); | |
1751 | tmp = fold_build2_loc (input_location, PLUS_EXPR, | |
1752 | gfc_array_index_type, tmp, | |
1753 | gfc_index_one_node); | |
1754 | stride = fold_build2_loc (input_location, MULT_EXPR, | |
1755 | gfc_array_index_type, tmp, stride); | |
6de9cd9a | 1756 | /* Check the folding worked. */ |
6e45f57b | 1757 | gcc_assert (INTEGER_CST_P (stride)); |
6de9cd9a DN |
1758 | } |
1759 | else | |
1760 | stride = NULL_TREE; | |
1761 | } | |
1762 | GFC_TYPE_ARRAY_SIZE (fat_type) = stride; | |
4c73896d | 1763 | |
6de9cd9a DN |
1764 | /* TODO: known offsets for descriptors. */ |
1765 | GFC_TYPE_ARRAY_OFFSET (fat_type) = NULL_TREE; | |
1766 | ||
416a8af4 RG |
1767 | /* We define data as an array with the correct size if possible. |
1768 | Much better than doing pointer arithmetic. */ | |
1769 | if (stride) | |
1770 | rtype = build_range_type (gfc_array_index_type, gfc_index_zero_node, | |
1771 | int_const_binop (MINUS_EXPR, stride, | |
d35936ab | 1772 | integer_one_node)); |
416a8af4 RG |
1773 | else |
1774 | rtype = gfc_array_range_type; | |
1775 | arraytype = build_array_type (etype, rtype); | |
6de9cd9a | 1776 | arraytype = build_pointer_type (arraytype); |
10174ddf MM |
1777 | if (restricted) |
1778 | arraytype = build_qualified_type (arraytype, TYPE_QUAL_RESTRICT); | |
6de9cd9a DN |
1779 | GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type) = arraytype; |
1780 | ||
d560566a AO |
1781 | /* This will generate the base declarations we need to emit debug |
1782 | information for this type. FIXME: there must be a better way to | |
1783 | avoid divergence between compilations with and without debug | |
1784 | information. */ | |
1785 | { | |
1786 | struct array_descr_info info; | |
1787 | gfc_get_array_descr_info (fat_type, &info); | |
1788 | gfc_get_array_descr_info (build_pointer_type (fat_type), &info); | |
1789 | } | |
1790 | ||
6de9cd9a DN |
1791 | return fat_type; |
1792 | } | |
1793 | \f | |
1794 | /* Build a pointer type. This function is called from gfc_sym_type(). */ | |
c3e8c6b8 | 1795 | |
6de9cd9a DN |
1796 | static tree |
1797 | gfc_build_pointer_type (gfc_symbol * sym, tree type) | |
1798 | { | |
436529ea | 1799 | /* Array pointer types aren't actually pointers. */ |
6de9cd9a DN |
1800 | if (sym->attr.dimension) |
1801 | return type; | |
1802 | else | |
1803 | return build_pointer_type (type); | |
1804 | } | |
b3c1b8a1 MM |
1805 | |
1806 | static tree gfc_nonrestricted_type (tree t); | |
1807 | /* Given two record or union type nodes TO and FROM, ensure | |
1808 | that all fields in FROM have a corresponding field in TO, | |
1809 | their type being nonrestrict variants. This accepts a TO | |
1810 | node that already has a prefix of the fields in FROM. */ | |
1811 | static void | |
1812 | mirror_fields (tree to, tree from) | |
1813 | { | |
1814 | tree fto, ffrom; | |
1815 | tree *chain; | |
1816 | ||
1817 | /* Forward to the end of TOs fields. */ | |
1818 | fto = TYPE_FIELDS (to); | |
1819 | ffrom = TYPE_FIELDS (from); | |
1820 | chain = &TYPE_FIELDS (to); | |
1821 | while (fto) | |
1822 | { | |
1823 | gcc_assert (ffrom && DECL_NAME (fto) == DECL_NAME (ffrom)); | |
1824 | chain = &DECL_CHAIN (fto); | |
1825 | fto = DECL_CHAIN (fto); | |
1826 | ffrom = DECL_CHAIN (ffrom); | |
1827 | } | |
1828 | ||
1829 | /* Now add all fields remaining in FROM (starting with ffrom). */ | |
1830 | for (; ffrom; ffrom = DECL_CHAIN (ffrom)) | |
1831 | { | |
1832 | tree newfield = copy_node (ffrom); | |
1833 | DECL_CONTEXT (newfield) = to; | |
1834 | /* The store to DECL_CHAIN might seem redundant with the | |
1835 | stores to *chain, but not clearing it here would mean | |
1836 | leaving a chain into the old fields. If ever | |
1837 | our called functions would look at them confusion | |
1838 | will arise. */ | |
1839 | DECL_CHAIN (newfield) = NULL_TREE; | |
1840 | *chain = newfield; | |
1841 | chain = &DECL_CHAIN (newfield); | |
1842 | ||
1843 | if (TREE_CODE (ffrom) == FIELD_DECL) | |
1844 | { | |
1845 | tree elemtype = gfc_nonrestricted_type (TREE_TYPE (ffrom)); | |
1846 | TREE_TYPE (newfield) = elemtype; | |
1847 | } | |
1848 | } | |
1849 | *chain = NULL_TREE; | |
1850 | } | |
1851 | ||
1852 | /* Given a type T, returns a different type of the same structure, | |
1853 | except that all types it refers to (recursively) are always | |
1854 | non-restrict qualified types. */ | |
1855 | static tree | |
1856 | gfc_nonrestricted_type (tree t) | |
1857 | { | |
1858 | tree ret = t; | |
1859 | ||
1860 | /* If the type isn't layed out yet, don't copy it. If something | |
1861 | needs it for real it should wait until the type got finished. */ | |
1862 | if (!TYPE_SIZE (t)) | |
1863 | return t; | |
1864 | ||
1865 | if (!TYPE_LANG_SPECIFIC (t)) | |
1866 | TYPE_LANG_SPECIFIC (t) | |
1867 | = ggc_alloc_cleared_lang_type (sizeof (struct lang_type)); | |
1868 | /* If we're dealing with this very node already further up | |
1869 | the call chain (recursion via pointers and struct members) | |
1870 | we haven't yet determined if we really need a new type node. | |
1871 | Assume we don't, return T itself. */ | |
1872 | if (TYPE_LANG_SPECIFIC (t)->nonrestricted_type == error_mark_node) | |
1873 | return t; | |
1874 | ||
1875 | /* If we have calculated this all already, just return it. */ | |
1876 | if (TYPE_LANG_SPECIFIC (t)->nonrestricted_type) | |
1877 | return TYPE_LANG_SPECIFIC (t)->nonrestricted_type; | |
1878 | ||
1879 | /* Mark this type. */ | |
1880 | TYPE_LANG_SPECIFIC (t)->nonrestricted_type = error_mark_node; | |
1881 | ||
1882 | switch (TREE_CODE (t)) | |
1883 | { | |
1884 | default: | |
1885 | break; | |
1886 | ||
1887 | case POINTER_TYPE: | |
1888 | case REFERENCE_TYPE: | |
1889 | { | |
1890 | tree totype = gfc_nonrestricted_type (TREE_TYPE (t)); | |
1891 | if (totype == TREE_TYPE (t)) | |
1892 | ret = t; | |
1893 | else if (TREE_CODE (t) == POINTER_TYPE) | |
1894 | ret = build_pointer_type (totype); | |
1895 | else | |
1896 | ret = build_reference_type (totype); | |
1897 | ret = build_qualified_type (ret, | |
1898 | TYPE_QUALS (t) & ~TYPE_QUAL_RESTRICT); | |
1899 | } | |
1900 | break; | |
1901 | ||
1902 | case ARRAY_TYPE: | |
1903 | { | |
1904 | tree elemtype = gfc_nonrestricted_type (TREE_TYPE (t)); | |
1905 | if (elemtype == TREE_TYPE (t)) | |
1906 | ret = t; | |
1907 | else | |
1908 | { | |
1909 | ret = build_variant_type_copy (t); | |
1910 | TREE_TYPE (ret) = elemtype; | |
1911 | if (TYPE_LANG_SPECIFIC (t) | |
1912 | && GFC_TYPE_ARRAY_DATAPTR_TYPE (t)) | |
1913 | { | |
1914 | tree dataptr_type = GFC_TYPE_ARRAY_DATAPTR_TYPE (t); | |
1915 | dataptr_type = gfc_nonrestricted_type (dataptr_type); | |
1916 | if (dataptr_type != GFC_TYPE_ARRAY_DATAPTR_TYPE (t)) | |
1917 | { | |
1918 | TYPE_LANG_SPECIFIC (ret) | |
1919 | = ggc_alloc_cleared_lang_type (sizeof (struct | |
1920 | lang_type)); | |
1921 | *TYPE_LANG_SPECIFIC (ret) = *TYPE_LANG_SPECIFIC (t); | |
1922 | GFC_TYPE_ARRAY_DATAPTR_TYPE (ret) = dataptr_type; | |
1923 | } | |
1924 | } | |
1925 | } | |
1926 | } | |
1927 | break; | |
1928 | ||
1929 | case RECORD_TYPE: | |
1930 | case UNION_TYPE: | |
1931 | case QUAL_UNION_TYPE: | |
1932 | { | |
1933 | tree field; | |
1934 | /* First determine if we need a new type at all. | |
1935 | Careful, the two calls to gfc_nonrestricted_type per field | |
1936 | might return different values. That happens exactly when | |
1937 | one of the fields reaches back to this very record type | |
1938 | (via pointers). The first calls will assume that we don't | |
1939 | need to copy T (see the error_mark_node marking). If there | |
1940 | are any reasons for copying T apart from having to copy T, | |
1941 | we'll indeed copy it, and the second calls to | |
1942 | gfc_nonrestricted_type will use that new node if they | |
1943 | reach back to T. */ | |
1944 | for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field)) | |
1945 | if (TREE_CODE (field) == FIELD_DECL) | |
1946 | { | |
1947 | tree elemtype = gfc_nonrestricted_type (TREE_TYPE (field)); | |
1948 | if (elemtype != TREE_TYPE (field)) | |
1949 | break; | |
1950 | } | |
1951 | if (!field) | |
1952 | break; | |
1953 | ret = build_variant_type_copy (t); | |
1954 | TYPE_FIELDS (ret) = NULL_TREE; | |
1955 | ||
1956 | /* Here we make sure that as soon as we know we have to copy | |
1957 | T, that also fields reaching back to us will use the new | |
1958 | copy. It's okay if that copy still contains the old fields, | |
1959 | we won't look at them. */ | |
1960 | TYPE_LANG_SPECIFIC (t)->nonrestricted_type = ret; | |
1961 | mirror_fields (ret, t); | |
1962 | } | |
1963 | break; | |
1964 | } | |
1965 | ||
1966 | TYPE_LANG_SPECIFIC (t)->nonrestricted_type = ret; | |
1967 | return ret; | |
1968 | } | |
1969 | ||
6de9cd9a DN |
1970 | \f |
1971 | /* Return the type for a symbol. Special handling is required for character | |
1972 | types to get the correct level of indirection. | |
1973 | For functions return the return type. | |
ad6e2a18 TS |
1974 | For subroutines return void_type_node. |
1975 | Calling this multiple times for the same symbol should be avoided, | |
1976 | especially for character and array types. */ | |
c3e8c6b8 | 1977 | |
6de9cd9a DN |
1978 | tree |
1979 | gfc_sym_type (gfc_symbol * sym) | |
1980 | { | |
1981 | tree type; | |
1982 | int byref; | |
10174ddf | 1983 | bool restricted; |
6de9cd9a | 1984 | |
3070bab4 JW |
1985 | /* Procedure Pointers inside COMMON blocks. */ |
1986 | if (sym->attr.proc_pointer && sym->attr.in_common) | |
00625fae JW |
1987 | { |
1988 | /* Unset proc_pointer as gfc_get_function_type calls gfc_sym_type. */ | |
1989 | sym->attr.proc_pointer = 0; | |
1990 | type = build_pointer_type (gfc_get_function_type (sym)); | |
1991 | sym->attr.proc_pointer = 1; | |
1992 | return type; | |
1993 | } | |
1994 | ||
6de9cd9a DN |
1995 | if (sym->attr.flavor == FL_PROCEDURE && !sym->attr.function) |
1996 | return void_type_node; | |
1997 | ||
da4c6ed8 TS |
1998 | /* In the case of a function the fake result variable may have a |
1999 | type different from the function type, so don't return early in | |
2000 | that case. */ | |
2001 | if (sym->backend_decl && !sym->attr.function) | |
2002 | return TREE_TYPE (sym->backend_decl); | |
6de9cd9a | 2003 | |
665733c1 JJ |
2004 | if (sym->ts.type == BT_CHARACTER |
2005 | && ((sym->attr.function && sym->attr.is_bind_c) | |
2006 | || (sym->attr.result | |
2007 | && sym->ns->proc_name | |
2008 | && sym->ns->proc_name->attr.is_bind_c))) | |
06a54338 TB |
2009 | type = gfc_character1_type_node; |
2010 | else | |
2011 | type = gfc_typenode_for_spec (&sym->ts); | |
6de9cd9a | 2012 | |
06469efd | 2013 | if (sym->attr.dummy && !sym->attr.function && !sym->attr.value) |
6de9cd9a DN |
2014 | byref = 1; |
2015 | else | |
2016 | byref = 0; | |
2017 | ||
10174ddf | 2018 | restricted = !sym->attr.target && !sym->attr.pointer |
b3aefde2 | 2019 | && !sym->attr.proc_pointer && !sym->attr.cray_pointee; |
b3c1b8a1 MM |
2020 | if (!restricted) |
2021 | type = gfc_nonrestricted_type (type); | |
2022 | ||
c81e79b5 | 2023 | if (sym->attr.dimension || sym->attr.codimension) |
6de9cd9a DN |
2024 | { |
2025 | if (gfc_is_nodesc_array (sym)) | |
2026 | { | |
2027 | /* If this is a character argument of unknown length, just use the | |
2028 | base type. */ | |
2029 | if (sym->ts.type != BT_CHARACTER | |
b49a3de7 | 2030 | || !(sym->attr.dummy || sym->attr.function) |
bc21d315 | 2031 | || sym->ts.u.cl->backend_decl) |
6de9cd9a DN |
2032 | { |
2033 | type = gfc_get_nodesc_array_type (type, sym->as, | |
dcfef7d4 | 2034 | byref ? PACKED_FULL |
10174ddf MM |
2035 | : PACKED_STATIC, |
2036 | restricted); | |
6de9cd9a DN |
2037 | byref = 0; |
2038 | } | |
5e7b92b9 TB |
2039 | |
2040 | if (sym->attr.cray_pointee) | |
2041 | GFC_POINTER_TYPE_P (type) = 1; | |
6de9cd9a DN |
2042 | } |
2043 | else | |
fad0afd7 JJ |
2044 | { |
2045 | enum gfc_array_kind akind = GFC_ARRAY_UNKNOWN; | |
2046 | if (sym->attr.pointer) | |
fe4e525c TB |
2047 | akind = sym->attr.contiguous ? GFC_ARRAY_POINTER_CONT |
2048 | : GFC_ARRAY_POINTER; | |
fad0afd7 JJ |
2049 | else if (sym->attr.allocatable) |
2050 | akind = GFC_ARRAY_ALLOCATABLE; | |
fe4e525c TB |
2051 | type = gfc_build_array_type (type, sym->as, akind, restricted, |
2052 | sym->attr.contiguous); | |
fad0afd7 | 2053 | } |
a8b3b0b6 | 2054 | } |
6de9cd9a DN |
2055 | else |
2056 | { | |
571d54de DK |
2057 | if (sym->attr.allocatable || sym->attr.pointer |
2058 | || gfc_is_associate_pointer (sym)) | |
6de9cd9a | 2059 | type = gfc_build_pointer_type (sym, type); |
5e7b92b9 | 2060 | if (sym->attr.pointer || sym->attr.cray_pointee) |
e1c82219 | 2061 | GFC_POINTER_TYPE_P (type) = 1; |
6de9cd9a DN |
2062 | } |
2063 | ||
2064 | /* We currently pass all parameters by reference. | |
2065 | See f95_get_function_decl. For dummy function parameters return the | |
2066 | function type. */ | |
2067 | if (byref) | |
1619aa6f PB |
2068 | { |
2069 | /* We must use pointer types for potentially absent variables. The | |
2070 | optimizers assume a reference type argument is never NULL. */ | |
2071 | if (sym->attr.optional || sym->ns->proc_name->attr.entry_master) | |
2072 | type = build_pointer_type (type); | |
2073 | else | |
10174ddf MM |
2074 | { |
2075 | type = build_reference_type (type); | |
2076 | if (restricted) | |
2077 | type = build_qualified_type (type, TYPE_QUAL_RESTRICT); | |
2078 | } | |
1619aa6f | 2079 | } |
6de9cd9a DN |
2080 | |
2081 | return (type); | |
2082 | } | |
2083 | \f | |
2084 | /* Layout and output debug info for a record type. */ | |
c3e8c6b8 | 2085 | |
6de9cd9a DN |
2086 | void |
2087 | gfc_finish_type (tree type) | |
2088 | { | |
2089 | tree decl; | |
2090 | ||
c2255bc4 AH |
2091 | decl = build_decl (input_location, |
2092 | TYPE_DECL, NULL_TREE, type); | |
6de9cd9a DN |
2093 | TYPE_STUB_DECL (type) = decl; |
2094 | layout_type (type); | |
2095 | rest_of_type_compilation (type, 1); | |
0e6df31e | 2096 | rest_of_decl_compilation (decl, 1, 0); |
6de9cd9a DN |
2097 | } |
2098 | \f | |
2099 | /* Add a field of given NAME and TYPE to the context of a UNION_TYPE | |
dfd6ece2 | 2100 | or RECORD_TYPE pointed to by CONTEXT. The new field is chained |
35151cd5 | 2101 | to the end of the field list pointed to by *CHAIN. |
6de9cd9a DN |
2102 | |
2103 | Returns a pointer to the new field. */ | |
c3e8c6b8 | 2104 | |
dfd6ece2 | 2105 | static tree |
35151cd5 | 2106 | gfc_add_field_to_struct_1 (tree context, tree name, tree type, tree **chain) |
dfd6ece2 NF |
2107 | { |
2108 | tree decl = build_decl (input_location, FIELD_DECL, name, type); | |
2109 | ||
2110 | DECL_CONTEXT (decl) = context; | |
910ad8de | 2111 | DECL_CHAIN (decl) = NULL_TREE; |
35151cd5 MM |
2112 | if (TYPE_FIELDS (context) == NULL_TREE) |
2113 | TYPE_FIELDS (context) = decl; | |
dfd6ece2 NF |
2114 | if (chain != NULL) |
2115 | { | |
2116 | if (*chain != NULL) | |
2117 | **chain = decl; | |
910ad8de | 2118 | *chain = &DECL_CHAIN (decl); |
dfd6ece2 NF |
2119 | } |
2120 | ||
2121 | return decl; | |
2122 | } | |
2123 | ||
2124 | /* Like `gfc_add_field_to_struct_1', but adds alignment | |
2125 | information. */ | |
2126 | ||
6de9cd9a | 2127 | tree |
35151cd5 | 2128 | gfc_add_field_to_struct (tree context, tree name, tree type, tree **chain) |
6de9cd9a | 2129 | { |
35151cd5 | 2130 | tree decl = gfc_add_field_to_struct_1 (context, name, type, chain); |
6de9cd9a | 2131 | |
6de9cd9a DN |
2132 | DECL_INITIAL (decl) = 0; |
2133 | DECL_ALIGN (decl) = 0; | |
2134 | DECL_USER_ALIGN (decl) = 0; | |
6de9cd9a DN |
2135 | |
2136 | return decl; | |
2137 | } | |
2138 | ||
2139 | ||
6b887797 PT |
2140 | /* Copy the backend_decl and component backend_decls if |
2141 | the two derived type symbols are "equal", as described | |
2142 | in 4.4.2 and resolved by gfc_compare_derived_types. */ | |
2143 | ||
43afc047 TB |
2144 | int |
2145 | gfc_copy_dt_decls_ifequal (gfc_symbol *from, gfc_symbol *to, | |
0101807c | 2146 | bool from_gsym) |
6b887797 PT |
2147 | { |
2148 | gfc_component *to_cm; | |
2149 | gfc_component *from_cm; | |
2150 | ||
2151 | if (from->backend_decl == NULL | |
2152 | || !gfc_compare_derived_types (from, to)) | |
2153 | return 0; | |
2154 | ||
2155 | to->backend_decl = from->backend_decl; | |
2156 | ||
2157 | to_cm = to->components; | |
2158 | from_cm = from->components; | |
2159 | ||
2160 | /* Copy the component declarations. If a component is itself | |
2161 | a derived type, we need a copy of its component declarations. | |
2162 | This is done by recursing into gfc_get_derived_type and | |
2163 | ensures that the component's component declarations have | |
2164 | been built. If it is a character, we need the character | |
2165 | length, as well. */ | |
2166 | for (; to_cm; to_cm = to_cm->next, from_cm = from_cm->next) | |
2167 | { | |
2168 | to_cm->backend_decl = from_cm->backend_decl; | |
78a1d149 JW |
2169 | if (from_cm->ts.type == BT_DERIVED |
2170 | && (!from_cm->attr.pointer || from_gsym)) | |
2171 | gfc_get_derived_type (to_cm->ts.u.derived); | |
2172 | else if (from_cm->ts.type == BT_CLASS | |
2173 | && (!CLASS_DATA (from_cm)->attr.class_pointer || from_gsym)) | |
bc21d315 | 2174 | gfc_get_derived_type (to_cm->ts.u.derived); |
6b887797 | 2175 | else if (from_cm->ts.type == BT_CHARACTER) |
bc21d315 | 2176 | to_cm->ts.u.cl->backend_decl = from_cm->ts.u.cl->backend_decl; |
6b887797 PT |
2177 | } |
2178 | ||
2179 | return 1; | |
2180 | } | |
2181 | ||
2182 | ||
713485cc JW |
2183 | /* Build a tree node for a procedure pointer component. */ |
2184 | ||
2185 | tree | |
2186 | gfc_get_ppc_type (gfc_component* c) | |
2187 | { | |
2188 | tree t; | |
37513ce9 JW |
2189 | |
2190 | /* Explicit interface. */ | |
2191 | if (c->attr.if_source != IFSRC_UNKNOWN && c->ts.interface) | |
2192 | return build_pointer_type (gfc_get_function_type (c->ts.interface)); | |
2193 | ||
2194 | /* Implicit interface (only return value may be known). */ | |
2195 | if (c->attr.function && !c->attr.dimension && c->ts.type != BT_CHARACTER) | |
2196 | t = gfc_typenode_for_spec (&c->ts); | |
713485cc JW |
2197 | else |
2198 | t = void_type_node; | |
37513ce9 | 2199 | |
b64fca63 | 2200 | return build_pointer_type (build_function_type_list (t, NULL_TREE)); |
713485cc JW |
2201 | } |
2202 | ||
2203 | ||
6b887797 PT |
2204 | /* Build a tree node for a derived type. If there are equal |
2205 | derived types, with different local names, these are built | |
2206 | at the same time. If an equal derived type has been built | |
2207 | in a parent namespace, this is used. */ | |
c3e8c6b8 | 2208 | |
7c1dab0d | 2209 | tree |
6de9cd9a DN |
2210 | gfc_get_derived_type (gfc_symbol * derived) |
2211 | { | |
35151cd5 | 2212 | tree typenode = NULL, field = NULL, field_type = NULL; |
3af8d8cb | 2213 | tree canonical = NULL_TREE; |
dfd6ece2 | 2214 | tree *chain = NULL; |
3af8d8cb | 2215 | bool got_canonical = false; |
6de9cd9a | 2216 | gfc_component *c; |
6b887797 | 2217 | gfc_dt_list *dt; |
3af8d8cb | 2218 | gfc_namespace *ns; |
6de9cd9a | 2219 | |
6b887797 | 2220 | gcc_assert (derived && derived->attr.flavor == FL_DERIVED); |
6de9cd9a | 2221 | |
a8b3b0b6 CR |
2222 | /* See if it's one of the iso_c_binding derived types. */ |
2223 | if (derived->attr.is_iso_c == 1) | |
2224 | { | |
9dc35956 CR |
2225 | if (derived->backend_decl) |
2226 | return derived->backend_decl; | |
2227 | ||
089db47d CR |
2228 | if (derived->intmod_sym_id == ISOCBINDING_PTR) |
2229 | derived->backend_decl = ptr_type_node; | |
2230 | else | |
2231 | derived->backend_decl = pfunc_type_node; | |
9dc35956 | 2232 | |
a8b3b0b6 CR |
2233 | derived->ts.kind = gfc_index_integer_kind; |
2234 | derived->ts.type = BT_INTEGER; | |
2235 | /* Set the f90_type to BT_VOID as a way to recognize something of type | |
2236 | BT_INTEGER that needs to fit a void * for the purpose of the | |
2237 | iso_c_binding derived types. */ | |
2238 | derived->ts.f90_type = BT_VOID; | |
9dc35956 | 2239 | |
a8b3b0b6 CR |
2240 | return derived->backend_decl; |
2241 | } | |
3af8d8cb | 2242 | |
0101807c | 2243 | /* If use associated, use the module type for this one. */ |
3af8d8cb PT |
2244 | if (gfc_option.flag_whole_file |
2245 | && derived->backend_decl == NULL | |
2246 | && derived->attr.use_assoc | |
0101807c PT |
2247 | && derived->module |
2248 | && gfc_get_module_backend_decl (derived)) | |
2249 | goto copy_derived_types; | |
3af8d8cb PT |
2250 | |
2251 | /* If a whole file compilation, the derived types from an earlier | |
dd5a833e | 2252 | namespace can be used as the canonical type. */ |
3af8d8cb PT |
2253 | if (gfc_option.flag_whole_file |
2254 | && derived->backend_decl == NULL | |
2255 | && !derived->attr.use_assoc | |
2256 | && gfc_global_ns_list) | |
2257 | { | |
2258 | for (ns = gfc_global_ns_list; | |
2259 | ns->translated && !got_canonical; | |
2260 | ns = ns->sibling) | |
2261 | { | |
2262 | dt = ns->derived_types; | |
2263 | for (; dt && !canonical; dt = dt->next) | |
2264 | { | |
43afc047 | 2265 | gfc_copy_dt_decls_ifequal (dt->derived, derived, true); |
3af8d8cb PT |
2266 | if (derived->backend_decl) |
2267 | got_canonical = true; | |
2268 | } | |
2269 | } | |
2270 | } | |
2271 | ||
2272 | /* Store up the canonical type to be added to this one. */ | |
2273 | if (got_canonical) | |
2274 | { | |
2275 | if (TYPE_CANONICAL (derived->backend_decl)) | |
2276 | canonical = TYPE_CANONICAL (derived->backend_decl); | |
2277 | else | |
2278 | canonical = derived->backend_decl; | |
2279 | ||
2280 | derived->backend_decl = NULL_TREE; | |
2281 | } | |
2282 | ||
6de9cd9a | 2283 | /* derived->backend_decl != 0 means we saw it before, but its |
436529ea | 2284 | components' backend_decl may have not been built. */ |
6de9cd9a | 2285 | if (derived->backend_decl) |
3e6d828d | 2286 | { |
37513ce9 JW |
2287 | /* Its components' backend_decl have been built or we are |
2288 | seeing recursion through the formal arglist of a procedure | |
2289 | pointer component. */ | |
2290 | if (TYPE_FIELDS (derived->backend_decl) | |
2291 | || derived->attr.proc_pointer_comp) | |
3e6d828d JW |
2292 | return derived->backend_decl; |
2293 | else | |
2294 | typenode = derived->backend_decl; | |
2295 | } | |
6de9cd9a DN |
2296 | else |
2297 | { | |
2298 | /* We see this derived type first time, so build the type node. */ | |
2299 | typenode = make_node (RECORD_TYPE); | |
2300 | TYPE_NAME (typenode) = get_identifier (derived->name); | |
2301 | TYPE_PACKED (typenode) = gfc_option.flag_pack_derived; | |
2302 | derived->backend_decl = typenode; | |
2303 | } | |
2304 | ||
bce71376 PT |
2305 | /* Go through the derived type components, building them as |
2306 | necessary. The reason for doing this now is that it is | |
2307 | possible to recurse back to this derived type through a | |
2308 | pointer component (PR24092). If this happens, the fields | |
2309 | will be built and so we can return the type. */ | |
2310 | for (c = derived->components; c; c = c->next) | |
2311 | { | |
cf2b3c22 | 2312 | if (c->ts.type != BT_DERIVED && c->ts.type != BT_CLASS) |
bce71376 PT |
2313 | continue; |
2314 | ||
c4984ab2 | 2315 | if ((!c->attr.pointer && !c->attr.proc_pointer) |
bc21d315 JW |
2316 | || c->ts.u.derived->backend_decl == NULL) |
2317 | c->ts.u.derived->backend_decl = gfc_get_derived_type (c->ts.u.derived); | |
a8b3b0b6 | 2318 | |
bc21d315 | 2319 | if (c->ts.u.derived && c->ts.u.derived->attr.is_iso_c) |
a8b3b0b6 CR |
2320 | { |
2321 | /* Need to copy the modified ts from the derived type. The | |
2322 | typespec was modified because C_PTR/C_FUNPTR are translated | |
2323 | into (void *) from derived types. */ | |
bc21d315 JW |
2324 | c->ts.type = c->ts.u.derived->ts.type; |
2325 | c->ts.kind = c->ts.u.derived->ts.kind; | |
2326 | c->ts.f90_type = c->ts.u.derived->ts.f90_type; | |
9dc35956 CR |
2327 | if (c->initializer) |
2328 | { | |
2329 | c->initializer->ts.type = c->ts.type; | |
2330 | c->initializer->ts.kind = c->ts.kind; | |
2331 | c->initializer->ts.f90_type = c->ts.f90_type; | |
2332 | c->initializer->expr_type = EXPR_NULL; | |
2333 | } | |
a8b3b0b6 | 2334 | } |
bce71376 PT |
2335 | } |
2336 | ||
2337 | if (TYPE_FIELDS (derived->backend_decl)) | |
2338 | return derived->backend_decl; | |
2339 | ||
6de9cd9a DN |
2340 | /* Build the type member list. Install the newly created RECORD_TYPE |
2341 | node as DECL_CONTEXT of each FIELD_DECL. */ | |
6de9cd9a DN |
2342 | for (c = derived->components; c; c = c->next) |
2343 | { | |
c4984ab2 | 2344 | if (c->attr.proc_pointer) |
713485cc | 2345 | field_type = gfc_get_ppc_type (c); |
cf2b3c22 | 2346 | else if (c->ts.type == BT_DERIVED || c->ts.type == BT_CLASS) |
bc21d315 | 2347 | field_type = c->ts.u.derived->backend_decl; |
6de9cd9a DN |
2348 | else |
2349 | { | |
2350 | if (c->ts.type == BT_CHARACTER) | |
2351 | { | |
2352 | /* Evaluate the string length. */ | |
bc21d315 JW |
2353 | gfc_conv_const_charlen (c->ts.u.cl); |
2354 | gcc_assert (c->ts.u.cl->backend_decl); | |
6de9cd9a DN |
2355 | } |
2356 | ||
2357 | field_type = gfc_typenode_for_spec (&c->ts); | |
2358 | } | |
2359 | ||
1f2959f0 | 2360 | /* This returns an array descriptor type. Initialization may be |
6de9cd9a | 2361 | required. */ |
c74b74a8 | 2362 | if (c->attr.dimension && !c->attr.proc_pointer) |
6de9cd9a | 2363 | { |
d4b7d0f0 | 2364 | if (c->attr.pointer || c->attr.allocatable) |
6de9cd9a | 2365 | { |
fad0afd7 | 2366 | enum gfc_array_kind akind; |
d4b7d0f0 | 2367 | if (c->attr.pointer) |
fe4e525c TB |
2368 | akind = c->attr.contiguous ? GFC_ARRAY_POINTER_CONT |
2369 | : GFC_ARRAY_POINTER; | |
fad0afd7 JJ |
2370 | else |
2371 | akind = GFC_ARRAY_ALLOCATABLE; | |
1f2959f0 | 2372 | /* Pointers to arrays aren't actually pointer types. The |
e7dc5b4f | 2373 | descriptors are separate, but the data is common. */ |
10174ddf MM |
2374 | field_type = gfc_build_array_type (field_type, c->as, akind, |
2375 | !c->attr.target | |
fe4e525c TB |
2376 | && !c->attr.pointer, |
2377 | c->attr.contiguous); | |
6de9cd9a DN |
2378 | } |
2379 | else | |
dcfef7d4 | 2380 | field_type = gfc_get_nodesc_array_type (field_type, c->as, |
10174ddf MM |
2381 | PACKED_STATIC, |
2382 | !c->attr.target); | |
6de9cd9a | 2383 | } |
cf2b3c22 TB |
2384 | else if ((c->attr.pointer || c->attr.allocatable) |
2385 | && !c->attr.proc_pointer) | |
6de9cd9a DN |
2386 | field_type = build_pointer_type (field_type); |
2387 | ||
c9dfc414 PT |
2388 | /* vtype fields can point to different types to the base type. */ |
2389 | if (c->ts.type == BT_DERIVED && c->ts.u.derived->attr.vtype) | |
0a8c9a13 PT |
2390 | field_type = build_pointer_type_for_mode (TREE_TYPE (field_type), |
2391 | ptr_mode, true); | |
c9dfc414 | 2392 | |
35151cd5 | 2393 | field = gfc_add_field_to_struct (typenode, |
dfd6ece2 NF |
2394 | get_identifier (c->name), |
2395 | field_type, &chain); | |
dfcf0b12 FXC |
2396 | if (c->loc.lb) |
2397 | gfc_set_decl_location (field, &c->loc); | |
2398 | else if (derived->declared_at.lb) | |
2399 | gfc_set_decl_location (field, &derived->declared_at); | |
6de9cd9a DN |
2400 | |
2401 | DECL_PACKED (field) |= TYPE_PACKED (typenode); | |
2402 | ||
bce71376 PT |
2403 | gcc_assert (field); |
2404 | if (!c->backend_decl) | |
2405 | c->backend_decl = field; | |
6de9cd9a DN |
2406 | } |
2407 | ||
35151cd5 | 2408 | /* Now lay out the derived type, including the fields. */ |
64754ed5 RG |
2409 | if (canonical) |
2410 | TYPE_CANONICAL (typenode) = canonical; | |
6de9cd9a DN |
2411 | |
2412 | gfc_finish_type (typenode); | |
dfcf0b12 | 2413 | gfc_set_decl_location (TYPE_STUB_DECL (typenode), &derived->declared_at); |
96ffc6cd TK |
2414 | if (derived->module && derived->ns->proc_name |
2415 | && derived->ns->proc_name->attr.flavor == FL_MODULE) | |
a64f5186 JJ |
2416 | { |
2417 | if (derived->ns->proc_name->backend_decl | |
2418 | && TREE_CODE (derived->ns->proc_name->backend_decl) | |
2419 | == NAMESPACE_DECL) | |
2420 | { | |
2421 | TYPE_CONTEXT (typenode) = derived->ns->proc_name->backend_decl; | |
2422 | DECL_CONTEXT (TYPE_STUB_DECL (typenode)) | |
2423 | = derived->ns->proc_name->backend_decl; | |
2424 | } | |
2425 | } | |
6de9cd9a DN |
2426 | |
2427 | derived->backend_decl = typenode; | |
2428 | ||
3af8d8cb PT |
2429 | copy_derived_types: |
2430 | ||
a64f5186 | 2431 | for (dt = gfc_derived_types; dt; dt = dt->next) |
43afc047 | 2432 | gfc_copy_dt_decls_ifequal (derived, dt->derived, false); |
6b887797 | 2433 | |
e0e85e06 | 2434 | return derived->backend_decl; |
6de9cd9a | 2435 | } |
e0e85e06 PT |
2436 | |
2437 | ||
6de9cd9a DN |
2438 | int |
2439 | gfc_return_by_reference (gfc_symbol * sym) | |
2440 | { | |
2441 | if (!sym->attr.function) | |
2442 | return 0; | |
2443 | ||
b49a3de7 | 2444 | if (sym->attr.dimension) |
6de9cd9a DN |
2445 | return 1; |
2446 | ||
665733c1 JJ |
2447 | if (sym->ts.type == BT_CHARACTER |
2448 | && !sym->attr.is_bind_c | |
2449 | && (!sym->attr.result | |
2450 | || !sym->ns->proc_name | |
2451 | || !sym->ns->proc_name->attr.is_bind_c)) | |
6de9cd9a DN |
2452 | return 1; |
2453 | ||
973ff4c0 TS |
2454 | /* Possibly return complex numbers by reference for g77 compatibility. |
2455 | We don't do this for calls to intrinsics (as the library uses the | |
2456 | -fno-f2c calling convention), nor for calls to functions which always | |
2457 | require an explicit interface, as no compatibility problems can | |
2458 | arise there. */ | |
2459 | if (gfc_option.flag_f2c | |
b49a3de7 | 2460 | && sym->ts.type == BT_COMPLEX |
973ff4c0 TS |
2461 | && !sym->attr.intrinsic && !sym->attr.always_explicit) |
2462 | return 1; | |
66e4ab31 | 2463 | |
6de9cd9a DN |
2464 | return 0; |
2465 | } | |
2466 | \f | |
d198b59a JJ |
2467 | static tree |
2468 | gfc_get_mixed_entry_union (gfc_namespace *ns) | |
2469 | { | |
2470 | tree type; | |
dfd6ece2 | 2471 | tree *chain = NULL; |
d198b59a JJ |
2472 | char name[GFC_MAX_SYMBOL_LEN + 1]; |
2473 | gfc_entry_list *el, *el2; | |
2474 | ||
2475 | gcc_assert (ns->proc_name->attr.mixed_entry_master); | |
2476 | gcc_assert (memcmp (ns->proc_name->name, "master.", 7) == 0); | |
2477 | ||
2478 | snprintf (name, GFC_MAX_SYMBOL_LEN, "munion.%s", ns->proc_name->name + 7); | |
2479 | ||
2480 | /* Build the type node. */ | |
2481 | type = make_node (UNION_TYPE); | |
2482 | ||
2483 | TYPE_NAME (type) = get_identifier (name); | |
d198b59a JJ |
2484 | |
2485 | for (el = ns->entries; el; el = el->next) | |
2486 | { | |
2487 | /* Search for duplicates. */ | |
2488 | for (el2 = ns->entries; el2 != el; el2 = el2->next) | |
2489 | if (el2->sym->result == el->sym->result) | |
2490 | break; | |
2491 | ||
2492 | if (el == el2) | |
35151cd5 | 2493 | gfc_add_field_to_struct_1 (type, |
dfd6ece2 NF |
2494 | get_identifier (el->sym->result->name), |
2495 | gfc_sym_type (el->sym->result), &chain); | |
d198b59a JJ |
2496 | } |
2497 | ||
2498 | /* Finish off the type. */ | |
d198b59a | 2499 | gfc_finish_type (type); |
dfcf0b12 | 2500 | TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type)) = 1; |
d198b59a JJ |
2501 | return type; |
2502 | } | |
2503 | \f | |
6dfd24f7 TB |
2504 | /* Create a "fn spec" based on the formal arguments; |
2505 | cf. create_function_arglist. */ | |
2506 | ||
2507 | static tree | |
2508 | create_fn_spec (gfc_symbol *sym, tree fntype) | |
2509 | { | |
2510 | char spec[150]; | |
2511 | size_t spec_len; | |
2512 | gfc_formal_arglist *f; | |
2513 | tree tmp; | |
2514 | ||
2515 | memset (&spec, 0, sizeof (spec)); | |
2516 | spec[0] = '.'; | |
2517 | spec_len = 1; | |
2518 | ||
2519 | if (sym->attr.entry_master) | |
2520 | spec[spec_len++] = 'R'; | |
2521 | if (gfc_return_by_reference (sym)) | |
2522 | { | |
2523 | gfc_symbol *result = sym->result ? sym->result : sym; | |
2524 | ||
2525 | if (result->attr.pointer || sym->attr.proc_pointer) | |
2526 | spec[spec_len++] = '.'; | |
2527 | else | |
2528 | spec[spec_len++] = 'w'; | |
2529 | if (sym->ts.type == BT_CHARACTER) | |
2530 | spec[spec_len++] = 'R'; | |
2531 | } | |
2532 | ||
2533 | for (f = sym->formal; f; f = f->next) | |
2534 | if (spec_len < sizeof (spec)) | |
2535 | { | |
2536 | if (!f->sym || f->sym->attr.pointer || f->sym->attr.target | |
39752c6b TB |
2537 | || f->sym->attr.external || f->sym->attr.cray_pointer |
2538 | || (f->sym->ts.type == BT_DERIVED | |
2539 | && (f->sym->ts.u.derived->attr.proc_pointer_comp | |
2540 | || f->sym->ts.u.derived->attr.pointer_comp)) | |
2541 | || (f->sym->ts.type == BT_CLASS | |
2542 | && (CLASS_DATA (f->sym)->ts.u.derived->attr.proc_pointer_comp | |
2543 | || CLASS_DATA (f->sym)->ts.u.derived->attr.pointer_comp))) | |
6dfd24f7 TB |
2544 | spec[spec_len++] = '.'; |
2545 | else if (f->sym->attr.intent == INTENT_IN) | |
2546 | spec[spec_len++] = 'r'; | |
2547 | else if (f->sym) | |
2548 | spec[spec_len++] = 'w'; | |
2549 | } | |
2550 | ||
2551 | tmp = build_tree_list (NULL_TREE, build_string (spec_len, spec)); | |
2552 | tmp = tree_cons (get_identifier ("fn spec"), tmp, TYPE_ATTRIBUTES (fntype)); | |
2553 | return build_type_attribute_variant (fntype, tmp); | |
2554 | } | |
2555 | ||
2556 | ||
6de9cd9a DN |
2557 | tree |
2558 | gfc_get_function_type (gfc_symbol * sym) | |
2559 | { | |
2560 | tree type; | |
6c32445b | 2561 | VEC(tree,gc) *typelist; |
6de9cd9a DN |
2562 | gfc_formal_arglist *f; |
2563 | gfc_symbol *arg; | |
6de9cd9a | 2564 | int alternate_return; |
6c32445b | 2565 | bool is_varargs = true; |
6de9cd9a | 2566 | |
ecf24057 FXC |
2567 | /* Make sure this symbol is a function, a subroutine or the main |
2568 | program. */ | |
2569 | gcc_assert (sym->attr.flavor == FL_PROCEDURE | |
2570 | || sym->attr.flavor == FL_PROGRAM); | |
6de9cd9a DN |
2571 | |
2572 | if (sym->backend_decl) | |
2573 | return TREE_TYPE (sym->backend_decl); | |
2574 | ||
6de9cd9a | 2575 | alternate_return = 0; |
6c32445b | 2576 | typelist = NULL; |
3d79abbd PB |
2577 | |
2578 | if (sym->attr.entry_master) | |
6c32445b NF |
2579 | /* Additional parameter for selecting an entry point. */ |
2580 | VEC_safe_push (tree, gc, typelist, gfc_array_index_type); | |
3d79abbd | 2581 | |
bfd61955 TB |
2582 | if (sym->result) |
2583 | arg = sym->result; | |
2584 | else | |
2585 | arg = sym; | |
2586 | ||
2587 | if (arg->ts.type == BT_CHARACTER) | |
bc21d315 | 2588 | gfc_conv_const_charlen (arg->ts.u.cl); |
bfd61955 | 2589 | |
6de9cd9a DN |
2590 | /* Some functions we use an extra parameter for the return value. */ |
2591 | if (gfc_return_by_reference (sym)) | |
2592 | { | |
6de9cd9a | 2593 | type = gfc_sym_type (arg); |
973ff4c0 | 2594 | if (arg->ts.type == BT_COMPLEX |
6de9cd9a DN |
2595 | || arg->attr.dimension |
2596 | || arg->ts.type == BT_CHARACTER) | |
2597 | type = build_reference_type (type); | |
2598 | ||
6c32445b | 2599 | VEC_safe_push (tree, gc, typelist, type); |
6de9cd9a | 2600 | if (arg->ts.type == BT_CHARACTER) |
8d51f26f PT |
2601 | { |
2602 | if (!arg->ts.deferred) | |
2603 | /* Transfer by value. */ | |
6c32445b | 2604 | VEC_safe_push (tree, gc, typelist, gfc_charlen_type_node); |
8d51f26f PT |
2605 | else |
2606 | /* Deferred character lengths are transferred by reference | |
2607 | so that the value can be returned. */ | |
6c32445b NF |
2608 | VEC_safe_push (tree, gc, typelist, |
2609 | build_pointer_type (gfc_charlen_type_node)); | |
8d51f26f | 2610 | } |
6de9cd9a DN |
2611 | } |
2612 | ||
436529ea | 2613 | /* Build the argument types for the function. */ |
6de9cd9a DN |
2614 | for (f = sym->formal; f; f = f->next) |
2615 | { | |
2616 | arg = f->sym; | |
2617 | if (arg) | |
2618 | { | |
2619 | /* Evaluate constant character lengths here so that they can be | |
2620 | included in the type. */ | |
2621 | if (arg->ts.type == BT_CHARACTER) | |
bc21d315 | 2622 | gfc_conv_const_charlen (arg->ts.u.cl); |
6de9cd9a DN |
2623 | |
2624 | if (arg->attr.flavor == FL_PROCEDURE) | |
2625 | { | |
2626 | type = gfc_get_function_type (arg); | |
2627 | type = build_pointer_type (type); | |
2628 | } | |
2629 | else | |
2630 | type = gfc_sym_type (arg); | |
2631 | ||
2632 | /* Parameter Passing Convention | |
2633 | ||
2634 | We currently pass all parameters by reference. | |
2635 | Parameters with INTENT(IN) could be passed by value. | |
2636 | The problem arises if a function is called via an implicit | |
2637 | prototype. In this situation the INTENT is not known. | |
2638 | For this reason all parameters to global functions must be | |
aa9c57ec | 2639 | passed by reference. Passing by value would potentially |
6de9cd9a | 2640 | generate bad code. Worse there would be no way of telling that |
c3e8c6b8 | 2641 | this code was bad, except that it would give incorrect results. |
6de9cd9a DN |
2642 | |
2643 | Contained procedures could pass by value as these are never | |
e2ae1407 | 2644 | used without an explicit interface, and cannot be passed as |
c3e8c6b8 | 2645 | actual parameters for a dummy procedure. */ |
8d51f26f | 2646 | |
6c32445b | 2647 | VEC_safe_push (tree, gc, typelist, type); |
6de9cd9a DN |
2648 | } |
2649 | else | |
2650 | { | |
2651 | if (sym->attr.subroutine) | |
2652 | alternate_return = 1; | |
2653 | } | |
2654 | } | |
2655 | ||
2656 | /* Add hidden string length parameters. */ | |
8d51f26f PT |
2657 | for (f = sym->formal; f; f = f->next) |
2658 | { | |
2659 | arg = f->sym; | |
2660 | if (arg && arg->ts.type == BT_CHARACTER && !sym->attr.is_bind_c) | |
2661 | { | |
2662 | if (!arg->ts.deferred) | |
2663 | /* Transfer by value. */ | |
2664 | type = gfc_charlen_type_node; | |
2665 | else | |
2666 | /* Deferred character lengths are transferred by reference | |
2667 | so that the value can be returned. */ | |
2668 | type = build_pointer_type (gfc_charlen_type_node); | |
2669 | ||
6c32445b | 2670 | VEC_safe_push (tree, gc, typelist, type); |
8d51f26f PT |
2671 | } |
2672 | } | |
6de9cd9a | 2673 | |
6c32445b NF |
2674 | if (!VEC_empty (tree, typelist) |
2675 | || sym->attr.is_main_program | |
2676 | || sym->attr.if_source != IFSRC_UNKNOWN) | |
2677 | is_varargs = false; | |
6de9cd9a DN |
2678 | |
2679 | if (alternate_return) | |
2680 | type = integer_type_node; | |
2681 | else if (!sym->attr.function || gfc_return_by_reference (sym)) | |
2682 | type = void_type_node; | |
d198b59a JJ |
2683 | else if (sym->attr.mixed_entry_master) |
2684 | type = gfc_get_mixed_entry_union (sym->ns); | |
da4c6ed8 TS |
2685 | else if (gfc_option.flag_f2c |
2686 | && sym->ts.type == BT_REAL | |
2687 | && sym->ts.kind == gfc_default_real_kind | |
2688 | && !sym->attr.always_explicit) | |
2689 | { | |
2690 | /* Special case: f2c calling conventions require that (scalar) | |
2691 | default REAL functions return the C type double instead. f2c | |
2692 | compatibility is only an issue with functions that don't | |
2693 | require an explicit interface, as only these could be | |
2694 | implemented in Fortran 77. */ | |
2695 | sym->ts.kind = gfc_default_double_kind; | |
2696 | type = gfc_typenode_for_spec (&sym->ts); | |
2697 | sym->ts.kind = gfc_default_real_kind; | |
2698 | } | |
726d8566 JW |
2699 | else if (sym->result && sym->result->attr.proc_pointer) |
2700 | /* Procedure pointer return values. */ | |
3070bab4 JW |
2701 | { |
2702 | if (sym->result->attr.result && strcmp (sym->name,"ppr@") != 0) | |
2703 | { | |
2704 | /* Unset proc_pointer as gfc_get_function_type | |
2705 | is called recursively. */ | |
2706 | sym->result->attr.proc_pointer = 0; | |
2707 | type = build_pointer_type (gfc_get_function_type (sym->result)); | |
2708 | sym->result->attr.proc_pointer = 1; | |
2709 | } | |
2710 | else | |
2711 | type = gfc_sym_type (sym->result); | |
2712 | } | |
6de9cd9a DN |
2713 | else |
2714 | type = gfc_sym_type (sym); | |
2715 | ||
6c32445b NF |
2716 | if (is_varargs) |
2717 | type = build_varargs_function_type_vec (type, typelist); | |
2718 | else | |
2719 | type = build_function_type_vec (type, typelist); | |
6dfd24f7 | 2720 | type = create_fn_spec (sym, type); |
6de9cd9a DN |
2721 | |
2722 | return type; | |
2723 | } | |
2724 | \f | |
e2cad04b | 2725 | /* Language hooks for middle-end access to type nodes. */ |
6de9cd9a DN |
2726 | |
2727 | /* Return an integer type with BITS bits of precision, | |
2728 | that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */ | |
2729 | ||
2730 | tree | |
2731 | gfc_type_for_size (unsigned bits, int unsignedp) | |
2732 | { | |
e2cad04b RH |
2733 | if (!unsignedp) |
2734 | { | |
2735 | int i; | |
2736 | for (i = 0; i <= MAX_INT_KINDS; ++i) | |
2737 | { | |
2738 | tree type = gfc_integer_types[i]; | |
2739 | if (type && bits == TYPE_PRECISION (type)) | |
2740 | return type; | |
2741 | } | |
5218394a PB |
2742 | |
2743 | /* Handle TImode as a special case because it is used by some backends | |
df2fba9e | 2744 | (e.g. ARM) even though it is not available for normal use. */ |
5218394a PB |
2745 | #if HOST_BITS_PER_WIDE_INT >= 64 |
2746 | if (bits == TYPE_PRECISION (intTI_type_node)) | |
2747 | return intTI_type_node; | |
2748 | #endif | |
e2cad04b RH |
2749 | } |
2750 | else | |
2751 | { | |
2752 | if (bits == TYPE_PRECISION (unsigned_intQI_type_node)) | |
2753 | return unsigned_intQI_type_node; | |
2754 | if (bits == TYPE_PRECISION (unsigned_intHI_type_node)) | |
2755 | return unsigned_intHI_type_node; | |
2756 | if (bits == TYPE_PRECISION (unsigned_intSI_type_node)) | |
2757 | return unsigned_intSI_type_node; | |
2758 | if (bits == TYPE_PRECISION (unsigned_intDI_type_node)) | |
2759 | return unsigned_intDI_type_node; | |
2760 | if (bits == TYPE_PRECISION (unsigned_intTI_type_node)) | |
2761 | return unsigned_intTI_type_node; | |
2762 | } | |
6de9cd9a | 2763 | |
e2cad04b | 2764 | return NULL_TREE; |
6de9cd9a DN |
2765 | } |
2766 | ||
e2cad04b RH |
2767 | /* Return a data type that has machine mode MODE. If the mode is an |
2768 | integer, then UNSIGNEDP selects between signed and unsigned types. */ | |
6de9cd9a DN |
2769 | |
2770 | tree | |
2771 | gfc_type_for_mode (enum machine_mode mode, int unsignedp) | |
2772 | { | |
e2cad04b RH |
2773 | int i; |
2774 | tree *base; | |
2775 | ||
2776 | if (GET_MODE_CLASS (mode) == MODE_FLOAT) | |
2777 | base = gfc_real_types; | |
2778 | else if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT) | |
2779 | base = gfc_complex_types; | |
2780 | else if (SCALAR_INT_MODE_P (mode)) | |
2781 | return gfc_type_for_size (GET_MODE_PRECISION (mode), unsignedp); | |
2782 | else if (VECTOR_MODE_P (mode)) | |
6de9cd9a | 2783 | { |
f676971a EC |
2784 | enum machine_mode inner_mode = GET_MODE_INNER (mode); |
2785 | tree inner_type = gfc_type_for_mode (inner_mode, unsignedp); | |
2786 | if (inner_type != NULL_TREE) | |
2787 | return build_vector_type_for_mode (inner_type, mode); | |
e2cad04b | 2788 | return NULL_TREE; |
6de9cd9a | 2789 | } |
e2cad04b | 2790 | else |
1a5ffec4 | 2791 | return NULL_TREE; |
6de9cd9a | 2792 | |
e2cad04b RH |
2793 | for (i = 0; i <= MAX_REAL_KINDS; ++i) |
2794 | { | |
2795 | tree type = base[i]; | |
2796 | if (type && mode == TYPE_MODE (type)) | |
2797 | return type; | |
2798 | } | |
2799 | ||
2800 | return NULL_TREE; | |
2801 | } | |
2802 | ||
fad0afd7 JJ |
2803 | /* Return TRUE if TYPE is a type with a hidden descriptor, fill in INFO |
2804 | in that case. */ | |
2805 | ||
2806 | bool | |
2807 | gfc_get_array_descr_info (const_tree type, struct array_descr_info *info) | |
2808 | { | |
2809 | int rank, dim; | |
2810 | bool indirect = false; | |
2811 | tree etype, ptype, field, t, base_decl; | |
c4fae39e | 2812 | tree data_off, dim_off, dim_size, elem_size; |
fad0afd7 JJ |
2813 | tree lower_suboff, upper_suboff, stride_suboff; |
2814 | ||
2815 | if (! GFC_DESCRIPTOR_TYPE_P (type)) | |
2816 | { | |
2817 | if (! POINTER_TYPE_P (type)) | |
2818 | return false; | |
2819 | type = TREE_TYPE (type); | |
2820 | if (! GFC_DESCRIPTOR_TYPE_P (type)) | |
2821 | return false; | |
2822 | indirect = true; | |
2823 | } | |
2824 | ||
2825 | rank = GFC_TYPE_ARRAY_RANK (type); | |
2826 | if (rank >= (int) (sizeof (info->dimen) / sizeof (info->dimen[0]))) | |
2827 | return false; | |
2828 | ||
2829 | etype = GFC_TYPE_ARRAY_DATAPTR_TYPE (type); | |
2830 | gcc_assert (POINTER_TYPE_P (etype)); | |
2831 | etype = TREE_TYPE (etype); | |
2832 | gcc_assert (TREE_CODE (etype) == ARRAY_TYPE); | |
2833 | etype = TREE_TYPE (etype); | |
2834 | /* Can't handle variable sized elements yet. */ | |
2835 | if (int_size_in_bytes (etype) <= 0) | |
2836 | return false; | |
2837 | /* Nor non-constant lower bounds in assumed shape arrays. */ | |
fe4e525c TB |
2838 | if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE |
2839 | || GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE_CONT) | |
fad0afd7 JJ |
2840 | { |
2841 | for (dim = 0; dim < rank; dim++) | |
2842 | if (GFC_TYPE_ARRAY_LBOUND (type, dim) == NULL_TREE | |
2843 | || TREE_CODE (GFC_TYPE_ARRAY_LBOUND (type, dim)) != INTEGER_CST) | |
2844 | return false; | |
2845 | } | |
2846 | ||
2847 | memset (info, '\0', sizeof (*info)); | |
2848 | info->ndimensions = rank; | |
2849 | info->element_type = etype; | |
2850 | ptype = build_pointer_type (gfc_array_index_type); | |
d560566a AO |
2851 | base_decl = GFC_TYPE_ARRAY_BASE_DECL (type, indirect); |
2852 | if (!base_decl) | |
fad0afd7 | 2853 | { |
c2255bc4 | 2854 | base_decl = build_decl (input_location, VAR_DECL, NULL_TREE, |
d560566a AO |
2855 | indirect ? build_pointer_type (ptype) : ptype); |
2856 | GFC_TYPE_ARRAY_BASE_DECL (type, indirect) = base_decl; | |
fad0afd7 | 2857 | } |
d560566a AO |
2858 | info->base_decl = base_decl; |
2859 | if (indirect) | |
2860 | base_decl = build1 (INDIRECT_REF, ptype, base_decl); | |
fad0afd7 | 2861 | |
de870512 JJ |
2862 | if (GFC_TYPE_ARRAY_SPAN (type)) |
2863 | elem_size = GFC_TYPE_ARRAY_SPAN (type); | |
2864 | else | |
2865 | elem_size = fold_convert (gfc_array_index_type, TYPE_SIZE_UNIT (etype)); | |
fad0afd7 JJ |
2866 | field = TYPE_FIELDS (TYPE_MAIN_VARIANT (type)); |
2867 | data_off = byte_position (field); | |
910ad8de NF |
2868 | field = DECL_CHAIN (field); |
2869 | field = DECL_CHAIN (field); | |
2870 | field = DECL_CHAIN (field); | |
fad0afd7 JJ |
2871 | dim_off = byte_position (field); |
2872 | dim_size = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (field))); | |
2873 | field = TYPE_FIELDS (TREE_TYPE (TREE_TYPE (field))); | |
2874 | stride_suboff = byte_position (field); | |
910ad8de | 2875 | field = DECL_CHAIN (field); |
fad0afd7 | 2876 | lower_suboff = byte_position (field); |
910ad8de | 2877 | field = DECL_CHAIN (field); |
fad0afd7 JJ |
2878 | upper_suboff = byte_position (field); |
2879 | ||
2880 | t = base_decl; | |
2881 | if (!integer_zerop (data_off)) | |
2882 | t = build2 (POINTER_PLUS_EXPR, ptype, t, data_off); | |
2883 | t = build1 (NOP_EXPR, build_pointer_type (ptr_type_node), t); | |
2884 | info->data_location = build1 (INDIRECT_REF, ptr_type_node, t); | |
2885 | if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ALLOCATABLE) | |
2886 | info->allocated = build2 (NE_EXPR, boolean_type_node, | |
2887 | info->data_location, null_pointer_node); | |
fe4e525c TB |
2888 | else if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_POINTER |
2889 | || GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_POINTER_CONT) | |
fad0afd7 JJ |
2890 | info->associated = build2 (NE_EXPR, boolean_type_node, |
2891 | info->data_location, null_pointer_node); | |
2892 | ||
2893 | for (dim = 0; dim < rank; dim++) | |
2894 | { | |
2895 | t = build2 (POINTER_PLUS_EXPR, ptype, base_decl, | |
2896 | size_binop (PLUS_EXPR, dim_off, lower_suboff)); | |
2897 | t = build1 (INDIRECT_REF, gfc_array_index_type, t); | |
2898 | info->dimen[dim].lower_bound = t; | |
2899 | t = build2 (POINTER_PLUS_EXPR, ptype, base_decl, | |
2900 | size_binop (PLUS_EXPR, dim_off, upper_suboff)); | |
2901 | t = build1 (INDIRECT_REF, gfc_array_index_type, t); | |
2902 | info->dimen[dim].upper_bound = t; | |
fe4e525c TB |
2903 | if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE |
2904 | || GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE_CONT) | |
fad0afd7 JJ |
2905 | { |
2906 | /* Assumed shape arrays have known lower bounds. */ | |
2907 | info->dimen[dim].upper_bound | |
2908 | = build2 (MINUS_EXPR, gfc_array_index_type, | |
2909 | info->dimen[dim].upper_bound, | |
2910 | info->dimen[dim].lower_bound); | |
2911 | info->dimen[dim].lower_bound | |
2912 | = fold_convert (gfc_array_index_type, | |
2913 | GFC_TYPE_ARRAY_LBOUND (type, dim)); | |
2914 | info->dimen[dim].upper_bound | |
2915 | = build2 (PLUS_EXPR, gfc_array_index_type, | |
2916 | info->dimen[dim].lower_bound, | |
2917 | info->dimen[dim].upper_bound); | |
2918 | } | |
2919 | t = build2 (POINTER_PLUS_EXPR, ptype, base_decl, | |
2920 | size_binop (PLUS_EXPR, dim_off, stride_suboff)); | |
2921 | t = build1 (INDIRECT_REF, gfc_array_index_type, t); | |
2922 | t = build2 (MULT_EXPR, gfc_array_index_type, t, elem_size); | |
2923 | info->dimen[dim].stride = t; | |
2924 | dim_off = size_binop (PLUS_EXPR, dim_off, dim_size); | |
2925 | } | |
2926 | ||
2927 | return true; | |
2928 | } | |
2929 | ||
6de9cd9a | 2930 | #include "gt-fortran-trans-types.h" |