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