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