1 /* Backend support for Fortran 95 basic types and derived types.
2 Copyright (C) 2002-2014 Free Software Foundation, Inc.
3 Contributed by Paul Brook <paul@nowt.org>
4 and Steven Bosscher <s.bosscher@student.tudelft.nl>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* trans-types.c -- gfortran backend types */
26 #include "coretypes.h"
27 #include "tm.h" /* For INTMAX_TYPE, INT8_TYPE, INT16_TYPE, INT32_TYPE,
28 INT64_TYPE, INT_LEAST8_TYPE, INT_LEAST16_TYPE,
29 INT_LEAST32_TYPE, INT_LEAST64_TYPE, INT_FAST8_TYPE,
30 INT_FAST16_TYPE, INT_FAST32_TYPE, INT_FAST64_TYPE,
31 BOOL_TYPE_SIZE, BITS_PER_UNIT, POINTER_SIZE,
32 INT_TYPE_SIZE, CHAR_TYPE_SIZE, SHORT_TYPE_SIZE,
33 LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE,
34 FLOAT_TYPE_SIZE, DOUBLE_TYPE_SIZE,
35 LONG_DOUBLE_TYPE_SIZE and LIBGCC2_HAS_TF_MODE. */
37 #include "stor-layout.h"
38 #include "stringpool.h"
39 #include "langhooks.h" /* For iso-c-bindings.def. */
42 #include "diagnostic-core.h" /* For fatal_error. */
43 #include "toplev.h" /* For rest_of_decl_compilation. */
46 #include "trans-types.h"
47 #include "trans-const.h"
49 #include "dwarf2out.h" /* For struct array_descr_info. */
52 #if (GFC_MAX_DIMENSIONS < 10)
53 #define GFC_RANK_DIGITS 1
54 #define GFC_RANK_PRINTF_FORMAT "%01d"
55 #elif (GFC_MAX_DIMENSIONS < 100)
56 #define GFC_RANK_DIGITS 2
57 #define GFC_RANK_PRINTF_FORMAT "%02d"
59 #error If you really need >99 dimensions, continue the sequence above...
62 /* array of structs so we don't have to worry about xmalloc or free */
63 CInteropKind_t c_interop_kinds_table
[ISOCBINDING_NUMBER
];
65 tree gfc_array_index_type
;
66 tree gfc_array_range_type
;
67 tree gfc_character1_type_node
;
69 tree prvoid_type_node
;
70 tree ppvoid_type_node
;
74 tree gfc_charlen_type_node
;
76 tree float128_type_node
= NULL_TREE
;
77 tree complex_float128_type_node
= NULL_TREE
;
79 bool gfc_real16_is_float128
= false;
81 static GTY(()) tree gfc_desc_dim_type
;
82 static GTY(()) tree gfc_max_array_element_size
;
83 static GTY(()) tree gfc_array_descriptor_base
[2 * (GFC_MAX_DIMENSIONS
+1)];
84 static GTY(()) tree gfc_array_descriptor_base_caf
[2 * (GFC_MAX_DIMENSIONS
+1)];
86 /* Arrays for all integral and real kinds. We'll fill this in at runtime
87 after the target has a chance to process command-line options. */
89 #define MAX_INT_KINDS 5
90 gfc_integer_info gfc_integer_kinds
[MAX_INT_KINDS
+ 1];
91 gfc_logical_info gfc_logical_kinds
[MAX_INT_KINDS
+ 1];
92 static GTY(()) tree gfc_integer_types
[MAX_INT_KINDS
+ 1];
93 static GTY(()) tree gfc_logical_types
[MAX_INT_KINDS
+ 1];
95 #define MAX_REAL_KINDS 5
96 gfc_real_info gfc_real_kinds
[MAX_REAL_KINDS
+ 1];
97 static GTY(()) tree gfc_real_types
[MAX_REAL_KINDS
+ 1];
98 static GTY(()) tree gfc_complex_types
[MAX_REAL_KINDS
+ 1];
100 #define MAX_CHARACTER_KINDS 2
101 gfc_character_info gfc_character_kinds
[MAX_CHARACTER_KINDS
+ 1];
102 static GTY(()) tree gfc_character_types
[MAX_CHARACTER_KINDS
+ 1];
103 static GTY(()) tree gfc_pcharacter_types
[MAX_CHARACTER_KINDS
+ 1];
105 static tree
gfc_add_field_to_struct_1 (tree
, tree
, tree
, tree
**);
107 /* The integer kind to use for array indices. This will be set to the
108 proper value based on target information from the backend. */
110 int gfc_index_integer_kind
;
112 /* The default kinds of the various types. */
114 int gfc_default_integer_kind
;
115 int gfc_max_integer_kind
;
116 int gfc_default_real_kind
;
117 int gfc_default_double_kind
;
118 int gfc_default_character_kind
;
119 int gfc_default_logical_kind
;
120 int gfc_default_complex_kind
;
122 int gfc_atomic_int_kind
;
123 int gfc_atomic_logical_kind
;
125 /* The kind size used for record offsets. If the target system supports
126 kind=8, this will be set to 8, otherwise it is set to 4. */
129 /* The integer kind used to store character lengths. */
130 int gfc_charlen_int_kind
;
132 /* The size of the numeric storage unit and character storage unit. */
133 int gfc_numeric_storage_size
;
134 int gfc_character_storage_size
;
138 gfc_check_any_c_kind (gfc_typespec
*ts
)
142 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
144 /* Check for any C interoperable kind for the given type/kind in ts.
145 This can be used after verify_c_interop to make sure that the
146 Fortran kind being used exists in at least some form for C. */
147 if (c_interop_kinds_table
[i
].f90_type
== ts
->type
&&
148 c_interop_kinds_table
[i
].value
== ts
->kind
)
157 get_real_kind_from_node (tree type
)
161 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
162 if (gfc_real_kinds
[i
].mode_precision
== TYPE_PRECISION (type
))
163 return gfc_real_kinds
[i
].kind
;
169 get_int_kind_from_node (tree type
)
176 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
177 if (gfc_integer_kinds
[i
].bit_size
== TYPE_PRECISION (type
))
178 return gfc_integer_kinds
[i
].kind
;
183 /* Return a typenode for the "standard" C type with a given name. */
185 get_typenode_from_name (const char *name
)
187 if (name
== NULL
|| *name
== '\0')
190 if (strcmp (name
, "char") == 0)
191 return char_type_node
;
192 if (strcmp (name
, "unsigned char") == 0)
193 return unsigned_char_type_node
;
194 if (strcmp (name
, "signed char") == 0)
195 return signed_char_type_node
;
197 if (strcmp (name
, "short int") == 0)
198 return short_integer_type_node
;
199 if (strcmp (name
, "short unsigned int") == 0)
200 return short_unsigned_type_node
;
202 if (strcmp (name
, "int") == 0)
203 return integer_type_node
;
204 if (strcmp (name
, "unsigned int") == 0)
205 return unsigned_type_node
;
207 if (strcmp (name
, "long int") == 0)
208 return long_integer_type_node
;
209 if (strcmp (name
, "long unsigned int") == 0)
210 return long_unsigned_type_node
;
212 if (strcmp (name
, "long long int") == 0)
213 return long_long_integer_type_node
;
214 if (strcmp (name
, "long long unsigned int") == 0)
215 return long_long_unsigned_type_node
;
221 get_int_kind_from_name (const char *name
)
223 return get_int_kind_from_node (get_typenode_from_name (name
));
227 /* Get the kind number corresponding to an integer of given size,
228 following the required return values for ISO_FORTRAN_ENV INT* constants:
229 -2 is returned if we support a kind of larger size, -1 otherwise. */
231 gfc_get_int_kind_from_width_isofortranenv (int size
)
235 /* Look for a kind with matching storage size. */
236 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
237 if (gfc_integer_kinds
[i
].bit_size
== size
)
238 return gfc_integer_kinds
[i
].kind
;
240 /* Look for a kind with larger storage size. */
241 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
242 if (gfc_integer_kinds
[i
].bit_size
> size
)
248 /* Get the kind number corresponding to a real of given storage size,
249 following the required return values for ISO_FORTRAN_ENV REAL* constants:
250 -2 is returned if we support a kind of larger size, -1 otherwise. */
252 gfc_get_real_kind_from_width_isofortranenv (int size
)
258 /* Look for a kind with matching storage size. */
259 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
260 if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds
[i
].kind
)) == size
)
261 return gfc_real_kinds
[i
].kind
;
263 /* Look for a kind with larger storage size. */
264 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
265 if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds
[i
].kind
)) > size
)
274 get_int_kind_from_width (int size
)
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
;
286 get_int_kind_from_minimal_width (int size
)
290 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
291 if (gfc_integer_kinds
[i
].bit_size
>= size
)
292 return gfc_integer_kinds
[i
].kind
;
298 /* Generate the CInteropKind_t objects for the C interoperable
302 gfc_init_c_interop_kinds (void)
306 /* init all pointers in the list to NULL */
307 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
309 /* Initialize the name and value fields. */
310 c_interop_kinds_table
[i
].name
[0] = '\0';
311 c_interop_kinds_table
[i
].value
= -100;
312 c_interop_kinds_table
[i
].f90_type
= BT_UNKNOWN
;
315 #define NAMED_INTCST(a,b,c,d) \
316 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
317 c_interop_kinds_table[a].f90_type = BT_INTEGER; \
318 c_interop_kinds_table[a].value = c;
319 #define NAMED_REALCST(a,b,c,d) \
320 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
321 c_interop_kinds_table[a].f90_type = BT_REAL; \
322 c_interop_kinds_table[a].value = c;
323 #define NAMED_CMPXCST(a,b,c,d) \
324 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
325 c_interop_kinds_table[a].f90_type = BT_COMPLEX; \
326 c_interop_kinds_table[a].value = c;
327 #define NAMED_LOGCST(a,b,c) \
328 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
329 c_interop_kinds_table[a].f90_type = BT_LOGICAL; \
330 c_interop_kinds_table[a].value = c;
331 #define NAMED_CHARKNDCST(a,b,c) \
332 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
333 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
334 c_interop_kinds_table[a].value = c;
335 #define NAMED_CHARCST(a,b,c) \
336 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
337 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
338 c_interop_kinds_table[a].value = c;
339 #define DERIVED_TYPE(a,b,c) \
340 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
341 c_interop_kinds_table[a].f90_type = BT_DERIVED; \
342 c_interop_kinds_table[a].value = c;
343 #define NAMED_FUNCTION(a,b,c,d) \
344 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
345 c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
346 c_interop_kinds_table[a].value = c;
347 #define NAMED_SUBROUTINE(a,b,c,d) \
348 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
349 c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
350 c_interop_kinds_table[a].value = c;
351 #include "iso-c-binding.def"
355 /* Query the target to determine which machine modes are available for
356 computation. Choose KIND numbers for them. */
359 gfc_init_kinds (void)
362 int i_index
, r_index
, kind
;
363 bool saw_i4
= false, saw_i8
= false;
364 bool saw_r4
= false, saw_r8
= false, saw_r10
= false, saw_r16
= false;
366 for (i_index
= 0, mode
= MIN_MODE_INT
; mode
<= MAX_MODE_INT
; mode
++)
370 if (!targetm
.scalar_mode_supported_p ((enum machine_mode
) mode
))
373 /* The middle end doesn't support constants larger than 2*HWI.
374 Perhaps the target hook shouldn't have accepted these either,
375 but just to be safe... */
376 bitsize
= GET_MODE_BITSIZE ((enum machine_mode
) mode
);
377 if (bitsize
> 2*HOST_BITS_PER_WIDE_INT
)
380 gcc_assert (i_index
!= MAX_INT_KINDS
);
382 /* Let the kind equal the bit size divided by 8. This insulates the
383 programmer from the underlying byte size. */
391 gfc_integer_kinds
[i_index
].kind
= kind
;
392 gfc_integer_kinds
[i_index
].radix
= 2;
393 gfc_integer_kinds
[i_index
].digits
= bitsize
- 1;
394 gfc_integer_kinds
[i_index
].bit_size
= bitsize
;
396 gfc_logical_kinds
[i_index
].kind
= kind
;
397 gfc_logical_kinds
[i_index
].bit_size
= bitsize
;
402 /* Set the kind used to match GFC_INT_IO in libgfortran. This is
403 used for large file access. */
410 /* If we do not at least have kind = 4, everything is pointless. */
413 /* Set the maximum integer kind. Used with at least BOZ constants. */
414 gfc_max_integer_kind
= gfc_integer_kinds
[i_index
- 1].kind
;
416 for (r_index
= 0, mode
= MIN_MODE_FLOAT
; mode
<= MAX_MODE_FLOAT
; mode
++)
418 const struct real_format
*fmt
=
419 REAL_MODE_FORMAT ((enum machine_mode
) mode
);
424 if (!targetm
.scalar_mode_supported_p ((enum machine_mode
) mode
))
427 /* Only let float, double, long double and __float128 go through.
428 Runtime support for others is not provided, so they would be
430 if (mode
!= TYPE_MODE (float_type_node
)
431 && (mode
!= TYPE_MODE (double_type_node
))
432 && (mode
!= TYPE_MODE (long_double_type_node
))
433 #if defined(LIBGCC2_HAS_TF_MODE) && defined(ENABLE_LIBQUADMATH_SUPPORT)
439 /* Let the kind equal the precision divided by 8, rounding up. Again,
440 this insulates the programmer from the underlying byte size.
442 Also, it effectively deals with IEEE extended formats. There, the
443 total size of the type may equal 16, but it's got 6 bytes of padding
444 and the increased size can get in the way of a real IEEE quad format
445 which may also be supported by the target.
447 We round up so as to handle IA-64 __floatreg (RFmode), which is an
448 82 bit type. Not to be confused with __float80 (XFmode), which is
449 an 80 bit type also supported by IA-64. So XFmode should come out
450 to be kind=10, and RFmode should come out to be kind=11. Egads. */
452 kind
= (GET_MODE_PRECISION (mode
) + 7) / 8;
463 /* Careful we don't stumble a weird internal mode. */
464 gcc_assert (r_index
<= 0 || gfc_real_kinds
[r_index
-1].kind
!= kind
);
465 /* Or have too many modes for the allocated space. */
466 gcc_assert (r_index
!= MAX_REAL_KINDS
);
468 gfc_real_kinds
[r_index
].kind
= kind
;
469 gfc_real_kinds
[r_index
].radix
= fmt
->b
;
470 gfc_real_kinds
[r_index
].digits
= fmt
->p
;
471 gfc_real_kinds
[r_index
].min_exponent
= fmt
->emin
;
472 gfc_real_kinds
[r_index
].max_exponent
= fmt
->emax
;
473 if (fmt
->pnan
< fmt
->p
)
474 /* This is an IBM extended double format (or the MIPS variant)
475 made up of two IEEE doubles. The value of the long double is
476 the sum of the values of the two parts. The most significant
477 part is required to be the value of the long double rounded
478 to the nearest double. If we use emax of 1024 then we can't
479 represent huge(x) = (1 - b**(-p)) * b**(emax-1) * b, because
480 rounding will make the most significant part overflow. */
481 gfc_real_kinds
[r_index
].max_exponent
= fmt
->emax
- 1;
482 gfc_real_kinds
[r_index
].mode_precision
= GET_MODE_PRECISION (mode
);
486 /* Choose the default integer kind. We choose 4 unless the user directs us
487 otherwise. Even if the user specified that the default integer kind is 8,
488 the numeric storage size is not 64 bits. In this case, a warning will be
489 issued when NUMERIC_STORAGE_SIZE is used. Set NUMERIC_STORAGE_SIZE to 32. */
491 gfc_numeric_storage_size
= 4 * 8;
493 if (gfc_option
.flag_default_integer
)
496 fatal_error ("INTEGER(KIND=8) is not available for -fdefault-integer-8 option");
498 gfc_default_integer_kind
= 8;
501 else if (gfc_option
.flag_integer4_kind
== 8)
504 fatal_error ("INTEGER(KIND=8) is not available for -finteger-4-integer-8 option");
506 gfc_default_integer_kind
= 8;
510 gfc_default_integer_kind
= 4;
514 gfc_default_integer_kind
= gfc_integer_kinds
[i_index
- 1].kind
;
515 gfc_numeric_storage_size
= gfc_integer_kinds
[i_index
- 1].bit_size
;
518 /* Choose the default real kind. Again, we choose 4 when possible. */
519 if (gfc_option
.flag_default_real
)
522 fatal_error ("REAL(KIND=8) is not available for -fdefault-real-8 option");
524 gfc_default_real_kind
= 8;
526 else if (gfc_option
.flag_real4_kind
== 8)
529 fatal_error ("REAL(KIND=8) is not available for -freal-4-real-8 option");
531 gfc_default_real_kind
= 8;
533 else if (gfc_option
.flag_real4_kind
== 10)
536 fatal_error ("REAL(KIND=10) is not available for -freal-4-real-10 option");
538 gfc_default_real_kind
= 10;
540 else if (gfc_option
.flag_real4_kind
== 16)
543 fatal_error ("REAL(KIND=16) is not available for -freal-4-real-16 option");
545 gfc_default_real_kind
= 16;
548 gfc_default_real_kind
= 4;
550 gfc_default_real_kind
= gfc_real_kinds
[0].kind
;
552 /* Choose the default double kind. If -fdefault-real and -fdefault-double
553 are specified, we use kind=8, if it's available. If -fdefault-real is
554 specified without -fdefault-double, we use kind=16, if it's available.
555 Otherwise we do not change anything. */
556 if (gfc_option
.flag_default_double
&& !gfc_option
.flag_default_real
)
557 fatal_error ("Use of -fdefault-double-8 requires -fdefault-real-8");
559 if (gfc_option
.flag_default_real
&& gfc_option
.flag_default_double
&& saw_r8
)
560 gfc_default_double_kind
= 8;
561 else if (gfc_option
.flag_default_real
&& saw_r16
)
562 gfc_default_double_kind
= 16;
563 else if (gfc_option
.flag_real8_kind
== 4)
566 fatal_error ("REAL(KIND=4) is not available for -freal-8-real-4 option");
568 gfc_default_double_kind
= 4;
570 else if (gfc_option
.flag_real8_kind
== 10 )
573 fatal_error ("REAL(KIND=10) is not available for -freal-8-real-10 option");
575 gfc_default_double_kind
= 10;
577 else if (gfc_option
.flag_real8_kind
== 16 )
580 fatal_error ("REAL(KIND=10) is not available for -freal-8-real-16 option");
582 gfc_default_double_kind
= 16;
584 else if (saw_r4
&& saw_r8
)
585 gfc_default_double_kind
= 8;
588 /* F95 14.6.3.1: A nonpointer scalar object of type double precision
589 real ... occupies two contiguous numeric storage units.
591 Therefore we must be supplied a kind twice as large as we chose
592 for single precision. There are loopholes, in that double
593 precision must *occupy* two storage units, though it doesn't have
594 to *use* two storage units. Which means that you can make this
595 kind artificially wide by padding it. But at present there are
596 no GCC targets for which a two-word type does not exist, so we
597 just let gfc_validate_kind abort and tell us if something breaks. */
599 gfc_default_double_kind
600 = gfc_validate_kind (BT_REAL
, gfc_default_real_kind
* 2, false);
603 /* The default logical kind is constrained to be the same as the
604 default integer kind. Similarly with complex and real. */
605 gfc_default_logical_kind
= gfc_default_integer_kind
;
606 gfc_default_complex_kind
= gfc_default_real_kind
;
608 /* We only have two character kinds: ASCII and UCS-4.
609 ASCII corresponds to a 8-bit integer type, if one is available.
610 UCS-4 corresponds to a 32-bit integer type, if one is available. */
612 if ((kind
= get_int_kind_from_width (8)) > 0)
614 gfc_character_kinds
[i_index
].kind
= kind
;
615 gfc_character_kinds
[i_index
].bit_size
= 8;
616 gfc_character_kinds
[i_index
].name
= "ascii";
619 if ((kind
= get_int_kind_from_width (32)) > 0)
621 gfc_character_kinds
[i_index
].kind
= kind
;
622 gfc_character_kinds
[i_index
].bit_size
= 32;
623 gfc_character_kinds
[i_index
].name
= "iso_10646";
627 /* Choose the smallest integer kind for our default character. */
628 gfc_default_character_kind
= gfc_character_kinds
[0].kind
;
629 gfc_character_storage_size
= gfc_default_character_kind
* 8;
631 gfc_index_integer_kind
= get_int_kind_from_name (PTRDIFF_TYPE
);
633 /* Pick a kind the same size as the C "int" type. */
634 gfc_c_int_kind
= INT_TYPE_SIZE
/ 8;
636 /* Choose atomic kinds to match C's int. */
637 gfc_atomic_int_kind
= gfc_c_int_kind
;
638 gfc_atomic_logical_kind
= gfc_c_int_kind
;
642 /* Make sure that a valid kind is present. Returns an index into the
643 associated kinds array, -1 if the kind is not present. */
646 validate_integer (int kind
)
650 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
651 if (gfc_integer_kinds
[i
].kind
== kind
)
658 validate_real (int kind
)
662 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
663 if (gfc_real_kinds
[i
].kind
== kind
)
670 validate_logical (int kind
)
674 for (i
= 0; gfc_logical_kinds
[i
].kind
; i
++)
675 if (gfc_logical_kinds
[i
].kind
== kind
)
682 validate_character (int kind
)
686 for (i
= 0; gfc_character_kinds
[i
].kind
; i
++)
687 if (gfc_character_kinds
[i
].kind
== kind
)
693 /* Validate a kind given a basic type. The return value is the same
694 for the child functions, with -1 indicating nonexistence of the
695 type. If MAY_FAIL is false, then -1 is never returned, and we ICE. */
698 gfc_validate_kind (bt type
, int kind
, bool may_fail
)
704 case BT_REAL
: /* Fall through */
706 rc
= validate_real (kind
);
709 rc
= validate_integer (kind
);
712 rc
= validate_logical (kind
);
715 rc
= validate_character (kind
);
719 gfc_internal_error ("gfc_validate_kind(): Got bad type");
722 if (rc
< 0 && !may_fail
)
723 gfc_internal_error ("gfc_validate_kind(): Got bad kind");
729 /* Four subroutines of gfc_init_types. Create type nodes for the given kind.
730 Reuse common type nodes where possible. Recognize if the kind matches up
731 with a C type. This will be used later in determining which routines may
732 be scarfed from libm. */
735 gfc_build_int_type (gfc_integer_info
*info
)
737 int mode_precision
= info
->bit_size
;
739 if (mode_precision
== CHAR_TYPE_SIZE
)
741 if (mode_precision
== SHORT_TYPE_SIZE
)
743 if (mode_precision
== INT_TYPE_SIZE
)
745 if (mode_precision
== LONG_TYPE_SIZE
)
747 if (mode_precision
== LONG_LONG_TYPE_SIZE
)
748 info
->c_long_long
= 1;
750 if (TYPE_PRECISION (intQI_type_node
) == mode_precision
)
751 return intQI_type_node
;
752 if (TYPE_PRECISION (intHI_type_node
) == mode_precision
)
753 return intHI_type_node
;
754 if (TYPE_PRECISION (intSI_type_node
) == mode_precision
)
755 return intSI_type_node
;
756 if (TYPE_PRECISION (intDI_type_node
) == mode_precision
)
757 return intDI_type_node
;
758 if (TYPE_PRECISION (intTI_type_node
) == mode_precision
)
759 return intTI_type_node
;
761 return make_signed_type (mode_precision
);
765 gfc_build_uint_type (int size
)
767 if (size
== CHAR_TYPE_SIZE
)
768 return unsigned_char_type_node
;
769 if (size
== SHORT_TYPE_SIZE
)
770 return short_unsigned_type_node
;
771 if (size
== INT_TYPE_SIZE
)
772 return unsigned_type_node
;
773 if (size
== LONG_TYPE_SIZE
)
774 return long_unsigned_type_node
;
775 if (size
== LONG_LONG_TYPE_SIZE
)
776 return long_long_unsigned_type_node
;
778 return make_unsigned_type (size
);
783 gfc_build_real_type (gfc_real_info
*info
)
785 int mode_precision
= info
->mode_precision
;
788 if (mode_precision
== FLOAT_TYPE_SIZE
)
790 if (mode_precision
== DOUBLE_TYPE_SIZE
)
792 if (mode_precision
== LONG_DOUBLE_TYPE_SIZE
)
793 info
->c_long_double
= 1;
794 if (mode_precision
!= LONG_DOUBLE_TYPE_SIZE
&& mode_precision
== 128)
796 info
->c_float128
= 1;
797 gfc_real16_is_float128
= true;
800 if (TYPE_PRECISION (float_type_node
) == mode_precision
)
801 return float_type_node
;
802 if (TYPE_PRECISION (double_type_node
) == mode_precision
)
803 return double_type_node
;
804 if (TYPE_PRECISION (long_double_type_node
) == mode_precision
)
805 return long_double_type_node
;
807 new_type
= make_node (REAL_TYPE
);
808 TYPE_PRECISION (new_type
) = mode_precision
;
809 layout_type (new_type
);
814 gfc_build_complex_type (tree scalar_type
)
818 if (scalar_type
== NULL
)
820 if (scalar_type
== float_type_node
)
821 return complex_float_type_node
;
822 if (scalar_type
== double_type_node
)
823 return complex_double_type_node
;
824 if (scalar_type
== long_double_type_node
)
825 return complex_long_double_type_node
;
827 new_type
= make_node (COMPLEX_TYPE
);
828 TREE_TYPE (new_type
) = scalar_type
;
829 layout_type (new_type
);
834 gfc_build_logical_type (gfc_logical_info
*info
)
836 int bit_size
= info
->bit_size
;
839 if (bit_size
== BOOL_TYPE_SIZE
)
842 return boolean_type_node
;
845 new_type
= make_unsigned_type (bit_size
);
846 TREE_SET_CODE (new_type
, BOOLEAN_TYPE
);
847 TYPE_MAX_VALUE (new_type
) = build_int_cst (new_type
, 1);
848 TYPE_PRECISION (new_type
) = 1;
854 /* Create the backend type nodes. We map them to their
855 equivalent C type, at least for now. We also give
856 names to the types here, and we push them in the
857 global binding level context.*/
860 gfc_init_types (void)
867 /* Create and name the types. */
868 #define PUSH_TYPE(name, node) \
869 pushdecl (build_decl (input_location, \
870 TYPE_DECL, get_identifier (name), node))
872 for (index
= 0; gfc_integer_kinds
[index
].kind
!= 0; ++index
)
874 type
= gfc_build_int_type (&gfc_integer_kinds
[index
]);
875 /* Ensure integer(kind=1) doesn't have TYPE_STRING_FLAG set. */
876 if (TYPE_STRING_FLAG (type
))
877 type
= make_signed_type (gfc_integer_kinds
[index
].bit_size
);
878 gfc_integer_types
[index
] = type
;
879 snprintf (name_buf
, sizeof(name_buf
), "integer(kind=%d)",
880 gfc_integer_kinds
[index
].kind
);
881 PUSH_TYPE (name_buf
, type
);
884 for (index
= 0; gfc_logical_kinds
[index
].kind
!= 0; ++index
)
886 type
= gfc_build_logical_type (&gfc_logical_kinds
[index
]);
887 gfc_logical_types
[index
] = type
;
888 snprintf (name_buf
, sizeof(name_buf
), "logical(kind=%d)",
889 gfc_logical_kinds
[index
].kind
);
890 PUSH_TYPE (name_buf
, type
);
893 for (index
= 0; gfc_real_kinds
[index
].kind
!= 0; index
++)
895 type
= gfc_build_real_type (&gfc_real_kinds
[index
]);
896 gfc_real_types
[index
] = type
;
897 snprintf (name_buf
, sizeof(name_buf
), "real(kind=%d)",
898 gfc_real_kinds
[index
].kind
);
899 PUSH_TYPE (name_buf
, type
);
901 if (gfc_real_kinds
[index
].c_float128
)
902 float128_type_node
= type
;
904 type
= gfc_build_complex_type (type
);
905 gfc_complex_types
[index
] = type
;
906 snprintf (name_buf
, sizeof(name_buf
), "complex(kind=%d)",
907 gfc_real_kinds
[index
].kind
);
908 PUSH_TYPE (name_buf
, type
);
910 if (gfc_real_kinds
[index
].c_float128
)
911 complex_float128_type_node
= type
;
914 for (index
= 0; gfc_character_kinds
[index
].kind
!= 0; ++index
)
916 type
= gfc_build_uint_type (gfc_character_kinds
[index
].bit_size
);
917 type
= build_qualified_type (type
, TYPE_UNQUALIFIED
);
918 snprintf (name_buf
, sizeof(name_buf
), "character(kind=%d)",
919 gfc_character_kinds
[index
].kind
);
920 PUSH_TYPE (name_buf
, type
);
921 gfc_character_types
[index
] = type
;
922 gfc_pcharacter_types
[index
] = build_pointer_type (type
);
924 gfc_character1_type_node
= gfc_character_types
[0];
926 PUSH_TYPE ("byte", unsigned_char_type_node
);
927 PUSH_TYPE ("void", void_type_node
);
929 /* DBX debugging output gets upset if these aren't set. */
930 if (!TYPE_NAME (integer_type_node
))
931 PUSH_TYPE ("c_integer", integer_type_node
);
932 if (!TYPE_NAME (char_type_node
))
933 PUSH_TYPE ("c_char", char_type_node
);
937 pvoid_type_node
= build_pointer_type (void_type_node
);
938 prvoid_type_node
= build_qualified_type (pvoid_type_node
, TYPE_QUAL_RESTRICT
);
939 ppvoid_type_node
= build_pointer_type (pvoid_type_node
);
940 pchar_type_node
= build_pointer_type (gfc_character1_type_node
);
942 = build_pointer_type (build_function_type_list (void_type_node
, NULL_TREE
));
944 gfc_array_index_type
= gfc_get_int_type (gfc_index_integer_kind
);
945 /* We cannot use gfc_index_zero_node in definition of gfc_array_range_type,
946 since this function is called before gfc_init_constants. */
948 = build_range_type (gfc_array_index_type
,
949 build_int_cst (gfc_array_index_type
, 0),
952 /* The maximum array element size that can be handled is determined
953 by the number of bits available to store this field in the array
956 n
= TYPE_PRECISION (gfc_array_index_type
) - GFC_DTYPE_SIZE_SHIFT
;
957 gfc_max_array_element_size
958 = wide_int_to_tree (long_unsigned_type_node
,
959 wi::mask (n
, UNSIGNED
,
960 TYPE_PRECISION (long_unsigned_type_node
)));
962 boolean_type_node
= gfc_get_logical_type (gfc_default_logical_kind
);
963 boolean_true_node
= build_int_cst (boolean_type_node
, 1);
964 boolean_false_node
= build_int_cst (boolean_type_node
, 0);
966 /* ??? Shouldn't this be based on gfc_index_integer_kind or so? */
967 gfc_charlen_int_kind
= 4;
968 gfc_charlen_type_node
= gfc_get_int_type (gfc_charlen_int_kind
);
971 /* Get the type node for the given type and kind. */
974 gfc_get_int_type (int kind
)
976 int index
= gfc_validate_kind (BT_INTEGER
, kind
, true);
977 return index
< 0 ? 0 : gfc_integer_types
[index
];
981 gfc_get_real_type (int kind
)
983 int index
= gfc_validate_kind (BT_REAL
, kind
, true);
984 return index
< 0 ? 0 : gfc_real_types
[index
];
988 gfc_get_complex_type (int kind
)
990 int index
= gfc_validate_kind (BT_COMPLEX
, kind
, true);
991 return index
< 0 ? 0 : gfc_complex_types
[index
];
995 gfc_get_logical_type (int kind
)
997 int index
= gfc_validate_kind (BT_LOGICAL
, kind
, true);
998 return index
< 0 ? 0 : gfc_logical_types
[index
];
1002 gfc_get_char_type (int kind
)
1004 int index
= gfc_validate_kind (BT_CHARACTER
, kind
, true);
1005 return index
< 0 ? 0 : gfc_character_types
[index
];
1009 gfc_get_pchar_type (int kind
)
1011 int index
= gfc_validate_kind (BT_CHARACTER
, kind
, true);
1012 return index
< 0 ? 0 : gfc_pcharacter_types
[index
];
1016 /* Create a character type with the given kind and length. */
1019 gfc_get_character_type_len_for_eltype (tree eltype
, tree len
)
1023 bounds
= build_range_type (gfc_charlen_type_node
, gfc_index_one_node
, len
);
1024 type
= build_array_type (eltype
, bounds
);
1025 TYPE_STRING_FLAG (type
) = 1;
1031 gfc_get_character_type_len (int kind
, tree len
)
1033 gfc_validate_kind (BT_CHARACTER
, kind
, false);
1034 return gfc_get_character_type_len_for_eltype (gfc_get_char_type (kind
), len
);
1038 /* Get a type node for a character kind. */
1041 gfc_get_character_type (int kind
, gfc_charlen
* cl
)
1045 len
= (cl
== NULL
) ? NULL_TREE
: cl
->backend_decl
;
1047 return gfc_get_character_type_len (kind
, len
);
1050 /* Covert a basic type. This will be an array for character types. */
1053 gfc_typenode_for_spec (gfc_typespec
* spec
)
1063 /* We use INTEGER(c_intptr_t) for C_PTR and C_FUNPTR once the symbol
1064 has been resolved. This is done so we can convert C_PTR and
1065 C_FUNPTR to simple variables that get translated to (void *). */
1066 if (spec
->f90_type
== BT_VOID
)
1069 && spec
->u
.derived
->intmod_sym_id
== ISOCBINDING_PTR
)
1070 basetype
= ptr_type_node
;
1072 basetype
= pfunc_type_node
;
1075 basetype
= gfc_get_int_type (spec
->kind
);
1079 basetype
= gfc_get_real_type (spec
->kind
);
1083 basetype
= gfc_get_complex_type (spec
->kind
);
1087 basetype
= gfc_get_logical_type (spec
->kind
);
1093 basetype
= gfc_get_character_type (spec
->kind
, NULL
);
1096 basetype
= gfc_get_character_type (spec
->kind
, spec
->u
.cl
);
1100 /* Since this cannot be used, return a length one character. */
1101 basetype
= gfc_get_character_type_len (gfc_default_character_kind
,
1102 gfc_index_one_node
);
1107 basetype
= gfc_get_derived_type (spec
->u
.derived
);
1109 if (spec
->type
== BT_CLASS
)
1110 GFC_CLASS_TYPE_P (basetype
) = 1;
1112 /* If we're dealing with either C_PTR or C_FUNPTR, we modified the
1113 type and kind to fit a (void *) and the basetype returned was a
1114 ptr_type_node. We need to pass up this new information to the
1115 symbol that was declared of type C_PTR or C_FUNPTR. */
1116 if (spec
->u
.derived
->ts
.f90_type
== BT_VOID
)
1118 spec
->type
= BT_INTEGER
;
1119 spec
->kind
= gfc_index_integer_kind
;
1120 spec
->f90_type
= BT_VOID
;
1125 /* This is for the second arg to c_f_pointer and c_f_procpointer
1126 of the iso_c_binding module, to accept any ptr type. */
1127 basetype
= ptr_type_node
;
1128 if (spec
->f90_type
== BT_VOID
)
1131 && spec
->u
.derived
->intmod_sym_id
== ISOCBINDING_PTR
)
1132 basetype
= ptr_type_node
;
1134 basetype
= pfunc_type_node
;
1143 /* Build an INT_CST for constant expressions, otherwise return NULL_TREE. */
1146 gfc_conv_array_bound (gfc_expr
* expr
)
1148 /* If expr is an integer constant, return that. */
1149 if (expr
!= NULL
&& expr
->expr_type
== EXPR_CONSTANT
)
1150 return gfc_conv_mpz_to_tree (expr
->value
.integer
, gfc_index_integer_kind
);
1152 /* Otherwise return NULL. */
1157 gfc_get_element_type (tree type
)
1161 if (GFC_ARRAY_TYPE_P (type
))
1163 if (TREE_CODE (type
) == POINTER_TYPE
)
1164 type
= TREE_TYPE (type
);
1165 if (GFC_TYPE_ARRAY_RANK (type
) == 0)
1167 gcc_assert (GFC_TYPE_ARRAY_CORANK (type
) > 0);
1172 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
1173 element
= TREE_TYPE (type
);
1178 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type
));
1179 element
= GFC_TYPE_ARRAY_DATAPTR_TYPE (type
);
1181 gcc_assert (TREE_CODE (element
) == POINTER_TYPE
);
1182 element
= TREE_TYPE (element
);
1184 /* For arrays, which are not scalar coarrays. */
1185 if (TREE_CODE (element
) == ARRAY_TYPE
&& !TYPE_STRING_FLAG (element
))
1186 element
= TREE_TYPE (element
);
1192 /* Build an array. This function is called from gfc_sym_type().
1193 Actually returns array descriptor type.
1195 Format of array descriptors is as follows:
1197 struct gfc_array_descriptor
1202 struct descriptor_dimension dimension[N_DIM];
1205 struct descriptor_dimension
1212 Translation code should use gfc_conv_descriptor_* rather than
1213 accessing the descriptor directly. Any changes to the array
1214 descriptor type will require changes in gfc_conv_descriptor_* and
1215 gfc_build_array_initializer.
1217 This is represented internally as a RECORD_TYPE. The index nodes
1218 are gfc_array_index_type and the data node is a pointer to the
1219 data. See below for the handling of character types.
1221 The dtype member is formatted as follows:
1222 rank = dtype & GFC_DTYPE_RANK_MASK // 3 bits
1223 type = (dtype & GFC_DTYPE_TYPE_MASK) >> GFC_DTYPE_TYPE_SHIFT // 3 bits
1224 size = dtype >> GFC_DTYPE_SIZE_SHIFT
1226 I originally used nested ARRAY_TYPE nodes to represent arrays, but
1227 this generated poor code for assumed/deferred size arrays. These
1228 require use of PLACEHOLDER_EXPR/WITH_RECORD_EXPR, which isn't part
1229 of the GENERIC grammar. Also, there is no way to explicitly set
1230 the array stride, so all data must be packed(1). I've tried to
1231 mark all the functions which would require modification with a GCC
1234 The data component points to the first element in the array. The
1235 offset field is the position of the origin of the array (i.e. element
1236 (0, 0 ...)). This may be outside the bounds of the array.
1238 An element is accessed by
1239 data[offset + index0*stride0 + index1*stride1 + index2*stride2]
1240 This gives good performance as the computation does not involve the
1241 bounds of the array. For packed arrays, this is optimized further
1242 by substituting the known strides.
1244 This system has one problem: all array bounds must be within 2^31
1245 elements of the origin (2^63 on 64-bit machines). For example
1246 integer, dimension (80000:90000, 80000:90000, 2) :: array
1247 may not work properly on 32-bit machines because 80000*80000 >
1248 2^31, so the calculation for stride2 would overflow. This may
1249 still work, but I haven't checked, and it relies on the overflow
1250 doing the right thing.
1252 The way to fix this problem is to access elements as follows:
1253 data[(index0-lbound0)*stride0 + (index1-lbound1)*stride1]
1254 Obviously this is much slower. I will make this a compile time
1255 option, something like -fsmall-array-offsets. Mixing code compiled
1256 with and without this switch will work.
1258 (1) This can be worked around by modifying the upper bound of the
1259 previous dimension. This requires extra fields in the descriptor
1260 (both real_ubound and fake_ubound). */
1263 /* Returns true if the array sym does not require a descriptor. */
1266 gfc_is_nodesc_array (gfc_symbol
* sym
)
1268 gcc_assert (sym
->attr
.dimension
|| sym
->attr
.codimension
);
1270 /* We only want local arrays. */
1271 if (sym
->attr
.pointer
|| sym
->attr
.allocatable
)
1274 /* We want a descriptor for associate-name arrays that do not have an
1275 explicitly known shape already. */
1276 if (sym
->assoc
&& sym
->as
->type
!= AS_EXPLICIT
)
1279 if (sym
->attr
.dummy
)
1280 return sym
->as
->type
!= AS_ASSUMED_SHAPE
1281 && sym
->as
->type
!= AS_ASSUMED_RANK
;
1283 if (sym
->attr
.result
|| sym
->attr
.function
)
1286 gcc_assert (sym
->as
->type
== AS_EXPLICIT
|| sym
->as
->cp_was_assumed
);
1292 /* Create an array descriptor type. */
1295 gfc_build_array_type (tree type
, gfc_array_spec
* as
,
1296 enum gfc_array_kind akind
, bool restricted
,
1299 tree lbound
[GFC_MAX_DIMENSIONS
];
1300 tree ubound
[GFC_MAX_DIMENSIONS
];
1303 /* Assumed-shape arrays do not have codimension information stored in the
1305 corank
= as
->corank
;
1306 if (as
->type
== AS_ASSUMED_SHAPE
||
1307 (as
->type
== AS_ASSUMED_RANK
&& akind
== GFC_ARRAY_ALLOCATABLE
))
1310 if (as
->type
== AS_ASSUMED_RANK
)
1311 for (n
= 0; n
< GFC_MAX_DIMENSIONS
; n
++)
1313 lbound
[n
] = NULL_TREE
;
1314 ubound
[n
] = NULL_TREE
;
1317 for (n
= 0; n
< as
->rank
; n
++)
1319 /* Create expressions for the known bounds of the array. */
1320 if (as
->type
== AS_ASSUMED_SHAPE
&& as
->lower
[n
] == NULL
)
1321 lbound
[n
] = gfc_index_one_node
;
1323 lbound
[n
] = gfc_conv_array_bound (as
->lower
[n
]);
1324 ubound
[n
] = gfc_conv_array_bound (as
->upper
[n
]);
1327 for (n
= as
->rank
; n
< as
->rank
+ corank
; n
++)
1329 if (as
->type
!= AS_DEFERRED
&& as
->lower
[n
] == NULL
)
1330 lbound
[n
] = gfc_index_one_node
;
1332 lbound
[n
] = gfc_conv_array_bound (as
->lower
[n
]);
1334 if (n
< as
->rank
+ corank
- 1)
1335 ubound
[n
] = gfc_conv_array_bound (as
->upper
[n
]);
1338 if (as
->type
== AS_ASSUMED_SHAPE
)
1339 akind
= contiguous
? GFC_ARRAY_ASSUMED_SHAPE_CONT
1340 : GFC_ARRAY_ASSUMED_SHAPE
;
1341 else if (as
->type
== AS_ASSUMED_RANK
)
1342 akind
= contiguous
? GFC_ARRAY_ASSUMED_RANK_CONT
1343 : GFC_ARRAY_ASSUMED_RANK
;
1344 return gfc_get_array_type_bounds (type
, as
->rank
== -1
1345 ? GFC_MAX_DIMENSIONS
: as
->rank
,
1347 ubound
, 0, akind
, restricted
);
1350 /* Returns the struct descriptor_dimension type. */
1353 gfc_get_desc_dim_type (void)
1356 tree decl
, *chain
= NULL
;
1358 if (gfc_desc_dim_type
)
1359 return gfc_desc_dim_type
;
1361 /* Build the type node. */
1362 type
= make_node (RECORD_TYPE
);
1364 TYPE_NAME (type
) = get_identifier ("descriptor_dimension");
1365 TYPE_PACKED (type
) = 1;
1367 /* Consists of the stride, lbound and ubound members. */
1368 decl
= gfc_add_field_to_struct_1 (type
,
1369 get_identifier ("stride"),
1370 gfc_array_index_type
, &chain
);
1371 TREE_NO_WARNING (decl
) = 1;
1373 decl
= gfc_add_field_to_struct_1 (type
,
1374 get_identifier ("lbound"),
1375 gfc_array_index_type
, &chain
);
1376 TREE_NO_WARNING (decl
) = 1;
1378 decl
= gfc_add_field_to_struct_1 (type
,
1379 get_identifier ("ubound"),
1380 gfc_array_index_type
, &chain
);
1381 TREE_NO_WARNING (decl
) = 1;
1383 /* Finish off the type. */
1384 gfc_finish_type (type
);
1385 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
)) = 1;
1387 gfc_desc_dim_type
= type
;
1392 /* Return the DTYPE for an array. This describes the type and type parameters
1394 /* TODO: Only call this when the value is actually used, and make all the
1395 unknown cases abort. */
1398 gfc_get_dtype_rank_type (int rank
, tree etype
)
1406 switch (TREE_CODE (etype
))
1424 /* We will never have arrays of arrays. */
1438 /* TODO: Don't do dtype for temporary descriptorless arrays. */
1439 /* We can strange array types for temporary arrays. */
1440 return gfc_index_zero_node
;
1443 gcc_assert (rank
<= GFC_DTYPE_RANK_MASK
);
1444 size
= TYPE_SIZE_UNIT (etype
);
1446 i
= rank
| (n
<< GFC_DTYPE_TYPE_SHIFT
);
1447 if (size
&& INTEGER_CST_P (size
))
1449 if (tree_int_cst_lt (gfc_max_array_element_size
, size
))
1450 gfc_fatal_error ("Array element size too big at %C");
1452 i
+= TREE_INT_CST_LOW (size
) << GFC_DTYPE_SIZE_SHIFT
;
1454 dtype
= build_int_cst (gfc_array_index_type
, i
);
1456 if (size
&& !INTEGER_CST_P (size
))
1458 tmp
= build_int_cst (gfc_array_index_type
, GFC_DTYPE_SIZE_SHIFT
);
1459 tmp
= fold_build2_loc (input_location
, LSHIFT_EXPR
,
1460 gfc_array_index_type
,
1461 fold_convert (gfc_array_index_type
, size
), tmp
);
1462 dtype
= fold_build2_loc (input_location
, PLUS_EXPR
, gfc_array_index_type
,
1465 /* If we don't know the size we leave it as zero. This should never happen
1466 for anything that is actually used. */
1467 /* TODO: Check this is actually true, particularly when repacking
1468 assumed size parameters. */
1475 gfc_get_dtype (tree type
)
1481 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type
) || GFC_ARRAY_TYPE_P (type
));
1483 if (GFC_TYPE_ARRAY_DTYPE (type
))
1484 return GFC_TYPE_ARRAY_DTYPE (type
);
1486 rank
= GFC_TYPE_ARRAY_RANK (type
);
1487 etype
= gfc_get_element_type (type
);
1488 dtype
= gfc_get_dtype_rank_type (rank
, etype
);
1490 GFC_TYPE_ARRAY_DTYPE (type
) = dtype
;
1495 /* Build an array type for use without a descriptor, packed according
1496 to the value of PACKED. */
1499 gfc_get_nodesc_array_type (tree etype
, gfc_array_spec
* as
, gfc_packed packed
,
1513 mpz_init_set_ui (offset
, 0);
1514 mpz_init_set_ui (stride
, 1);
1517 /* We don't use build_array_type because this does not include include
1518 lang-specific information (i.e. the bounds of the array) when checking
1521 type
= make_node (ARRAY_TYPE
);
1523 type
= build_variant_type_copy (etype
);
1525 GFC_ARRAY_TYPE_P (type
) = 1;
1526 TYPE_LANG_SPECIFIC (type
) = ggc_cleared_alloc
<struct lang_type
> ();
1528 known_stride
= (packed
!= PACKED_NO
);
1530 for (n
= 0; n
< as
->rank
; n
++)
1532 /* Fill in the stride and bound components of the type. */
1534 tmp
= gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1537 GFC_TYPE_ARRAY_STRIDE (type
, n
) = tmp
;
1539 expr
= as
->lower
[n
];
1540 if (expr
->expr_type
== EXPR_CONSTANT
)
1542 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1543 gfc_index_integer_kind
);
1550 GFC_TYPE_ARRAY_LBOUND (type
, n
) = tmp
;
1554 /* Calculate the offset. */
1555 mpz_mul (delta
, stride
, as
->lower
[n
]->value
.integer
);
1556 mpz_sub (offset
, offset
, delta
);
1561 expr
= as
->upper
[n
];
1562 if (expr
&& expr
->expr_type
== EXPR_CONSTANT
)
1564 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1565 gfc_index_integer_kind
);
1572 GFC_TYPE_ARRAY_UBOUND (type
, n
) = tmp
;
1576 /* Calculate the stride. */
1577 mpz_sub (delta
, as
->upper
[n
]->value
.integer
,
1578 as
->lower
[n
]->value
.integer
);
1579 mpz_add_ui (delta
, delta
, 1);
1580 mpz_mul (stride
, stride
, delta
);
1583 /* Only the first stride is known for partial packed arrays. */
1584 if (packed
== PACKED_NO
|| packed
== PACKED_PARTIAL
)
1587 for (n
= as
->rank
; n
< as
->rank
+ as
->corank
; n
++)
1589 expr
= as
->lower
[n
];
1590 if (expr
->expr_type
== EXPR_CONSTANT
)
1591 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1592 gfc_index_integer_kind
);
1595 GFC_TYPE_ARRAY_LBOUND (type
, n
) = tmp
;
1597 expr
= as
->upper
[n
];
1598 if (expr
&& expr
->expr_type
== EXPR_CONSTANT
)
1599 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1600 gfc_index_integer_kind
);
1603 if (n
< as
->rank
+ as
->corank
- 1)
1604 GFC_TYPE_ARRAY_UBOUND (type
, n
) = tmp
;
1609 GFC_TYPE_ARRAY_OFFSET (type
) =
1610 gfc_conv_mpz_to_tree (offset
, gfc_index_integer_kind
);
1613 GFC_TYPE_ARRAY_OFFSET (type
) = NULL_TREE
;
1617 GFC_TYPE_ARRAY_SIZE (type
) =
1618 gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1621 GFC_TYPE_ARRAY_SIZE (type
) = NULL_TREE
;
1623 GFC_TYPE_ARRAY_RANK (type
) = as
->rank
;
1624 GFC_TYPE_ARRAY_CORANK (type
) = as
->corank
;
1625 GFC_TYPE_ARRAY_DTYPE (type
) = NULL_TREE
;
1626 range
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
1628 /* TODO: use main type if it is unbounded. */
1629 GFC_TYPE_ARRAY_DATAPTR_TYPE (type
) =
1630 build_pointer_type (build_array_type (etype
, range
));
1632 GFC_TYPE_ARRAY_DATAPTR_TYPE (type
) =
1633 build_qualified_type (GFC_TYPE_ARRAY_DATAPTR_TYPE (type
),
1634 TYPE_QUAL_RESTRICT
);
1638 if (packed
!= PACKED_STATIC
|| gfc_option
.coarray
== GFC_FCOARRAY_LIB
)
1640 type
= build_pointer_type (type
);
1643 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
1645 GFC_ARRAY_TYPE_P (type
) = 1;
1646 TYPE_LANG_SPECIFIC (type
) = TYPE_LANG_SPECIFIC (TREE_TYPE (type
));
1654 mpz_sub_ui (stride
, stride
, 1);
1655 range
= gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1660 range
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
, range
);
1661 TYPE_DOMAIN (type
) = range
;
1663 build_pointer_type (etype
);
1664 TREE_TYPE (type
) = etype
;
1672 /* Represent packed arrays as multi-dimensional if they have rank >
1673 1 and with proper bounds, instead of flat arrays. This makes for
1674 better debug info. */
1677 tree gtype
= etype
, rtype
, type_decl
;
1679 for (n
= as
->rank
- 1; n
>= 0; n
--)
1681 rtype
= build_range_type (gfc_array_index_type
,
1682 GFC_TYPE_ARRAY_LBOUND (type
, n
),
1683 GFC_TYPE_ARRAY_UBOUND (type
, n
));
1684 gtype
= build_array_type (gtype
, rtype
);
1686 TYPE_NAME (type
) = type_decl
= build_decl (input_location
,
1687 TYPE_DECL
, NULL
, gtype
);
1688 DECL_ORIGINAL_TYPE (type_decl
) = gtype
;
1691 if (packed
!= PACKED_STATIC
|| !known_stride
1692 || (as
->corank
&& gfc_option
.coarray
== GFC_FCOARRAY_LIB
))
1694 /* For dummy arrays and automatic (heap allocated) arrays we
1695 want a pointer to the array. */
1696 type
= build_pointer_type (type
);
1698 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
1699 GFC_ARRAY_TYPE_P (type
) = 1;
1700 TYPE_LANG_SPECIFIC (type
) = TYPE_LANG_SPECIFIC (TREE_TYPE (type
));
1706 /* Return or create the base type for an array descriptor. */
1709 gfc_get_array_descriptor_base (int dimen
, int codimen
, bool restricted
,
1710 enum gfc_array_kind akind
)
1712 tree fat_type
, decl
, arraytype
, *chain
= NULL
;
1713 char name
[16 + 2*GFC_RANK_DIGITS
+ 1 + 1];
1716 /* Assumed-rank array. */
1718 dimen
= GFC_MAX_DIMENSIONS
;
1720 idx
= 2 * (codimen
+ dimen
) + restricted
;
1722 gcc_assert (codimen
+ dimen
>= 0 && codimen
+ dimen
<= GFC_MAX_DIMENSIONS
);
1724 if (gfc_option
.coarray
== GFC_FCOARRAY_LIB
&& codimen
)
1726 if (gfc_array_descriptor_base_caf
[idx
])
1727 return gfc_array_descriptor_base_caf
[idx
];
1729 else if (gfc_array_descriptor_base
[idx
])
1730 return gfc_array_descriptor_base
[idx
];
1732 /* Build the type node. */
1733 fat_type
= make_node (RECORD_TYPE
);
1735 sprintf (name
, "array_descriptor" GFC_RANK_PRINTF_FORMAT
, dimen
+ codimen
);
1736 TYPE_NAME (fat_type
) = get_identifier (name
);
1737 TYPE_NAMELESS (fat_type
) = 1;
1739 /* Add the data member as the first element of the descriptor. */
1740 decl
= gfc_add_field_to_struct_1 (fat_type
,
1741 get_identifier ("data"),
1744 : ptr_type_node
), &chain
);
1746 /* Add the base component. */
1747 decl
= gfc_add_field_to_struct_1 (fat_type
,
1748 get_identifier ("offset"),
1749 gfc_array_index_type
, &chain
);
1750 TREE_NO_WARNING (decl
) = 1;
1752 /* Add the dtype component. */
1753 decl
= gfc_add_field_to_struct_1 (fat_type
,
1754 get_identifier ("dtype"),
1755 gfc_array_index_type
, &chain
);
1756 TREE_NO_WARNING (decl
) = 1;
1758 /* Build the array type for the stride and bound components. */
1759 if (dimen
+ codimen
> 0)
1762 build_array_type (gfc_get_desc_dim_type (),
1763 build_range_type (gfc_array_index_type
,
1764 gfc_index_zero_node
,
1765 gfc_rank_cst
[codimen
+ dimen
- 1]));
1767 decl
= gfc_add_field_to_struct_1 (fat_type
, get_identifier ("dim"),
1769 TREE_NO_WARNING (decl
) = 1;
1772 if (gfc_option
.coarray
== GFC_FCOARRAY_LIB
&& codimen
1773 && akind
== GFC_ARRAY_ALLOCATABLE
)
1775 decl
= gfc_add_field_to_struct_1 (fat_type
,
1776 get_identifier ("token"),
1777 prvoid_type_node
, &chain
);
1778 TREE_NO_WARNING (decl
) = 1;
1781 /* Finish off the type. */
1782 gfc_finish_type (fat_type
);
1783 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (fat_type
)) = 1;
1785 if (gfc_option
.coarray
== GFC_FCOARRAY_LIB
&& codimen
1786 && akind
== GFC_ARRAY_ALLOCATABLE
)
1787 gfc_array_descriptor_base_caf
[idx
] = fat_type
;
1789 gfc_array_descriptor_base
[idx
] = fat_type
;
1795 /* Build an array (descriptor) type with given bounds. */
1798 gfc_get_array_type_bounds (tree etype
, int dimen
, int codimen
, tree
* lbound
,
1799 tree
* ubound
, int packed
,
1800 enum gfc_array_kind akind
, bool restricted
)
1802 char name
[8 + 2*GFC_RANK_DIGITS
+ 1 + GFC_MAX_SYMBOL_LEN
];
1803 tree fat_type
, base_type
, arraytype
, lower
, upper
, stride
, tmp
, rtype
;
1804 const char *type_name
;
1807 base_type
= gfc_get_array_descriptor_base (dimen
, codimen
, restricted
, akind
);
1808 fat_type
= build_distinct_type_copy (base_type
);
1809 /* Make sure that nontarget and target array type have the same canonical
1810 type (and same stub decl for debug info). */
1811 base_type
= gfc_get_array_descriptor_base (dimen
, codimen
, false, akind
);
1812 TYPE_CANONICAL (fat_type
) = base_type
;
1813 TYPE_STUB_DECL (fat_type
) = TYPE_STUB_DECL (base_type
);
1815 tmp
= TYPE_NAME (etype
);
1816 if (tmp
&& TREE_CODE (tmp
) == TYPE_DECL
)
1817 tmp
= DECL_NAME (tmp
);
1819 type_name
= IDENTIFIER_POINTER (tmp
);
1821 type_name
= "unknown";
1822 sprintf (name
, "array" GFC_RANK_PRINTF_FORMAT
"_%.*s", dimen
+ codimen
,
1823 GFC_MAX_SYMBOL_LEN
, type_name
);
1824 TYPE_NAME (fat_type
) = get_identifier (name
);
1825 TYPE_NAMELESS (fat_type
) = 1;
1827 GFC_DESCRIPTOR_TYPE_P (fat_type
) = 1;
1828 TYPE_LANG_SPECIFIC (fat_type
) = ggc_cleared_alloc
<struct lang_type
> ();
1830 GFC_TYPE_ARRAY_RANK (fat_type
) = dimen
;
1831 GFC_TYPE_ARRAY_CORANK (fat_type
) = codimen
;
1832 GFC_TYPE_ARRAY_DTYPE (fat_type
) = NULL_TREE
;
1833 GFC_TYPE_ARRAY_AKIND (fat_type
) = akind
;
1835 /* Build an array descriptor record type. */
1837 stride
= gfc_index_one_node
;
1840 for (n
= 0; n
< dimen
+ codimen
; n
++)
1843 GFC_TYPE_ARRAY_STRIDE (fat_type
, n
) = stride
;
1850 if (lower
!= NULL_TREE
)
1852 if (INTEGER_CST_P (lower
))
1853 GFC_TYPE_ARRAY_LBOUND (fat_type
, n
) = lower
;
1858 if (codimen
&& n
== dimen
+ codimen
- 1)
1862 if (upper
!= NULL_TREE
)
1864 if (INTEGER_CST_P (upper
))
1865 GFC_TYPE_ARRAY_UBOUND (fat_type
, n
) = upper
;
1873 if (upper
!= NULL_TREE
&& lower
!= NULL_TREE
&& stride
!= NULL_TREE
)
1875 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
1876 gfc_array_index_type
, upper
, lower
);
1877 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
,
1878 gfc_array_index_type
, tmp
,
1879 gfc_index_one_node
);
1880 stride
= fold_build2_loc (input_location
, MULT_EXPR
,
1881 gfc_array_index_type
, tmp
, stride
);
1882 /* Check the folding worked. */
1883 gcc_assert (INTEGER_CST_P (stride
));
1888 GFC_TYPE_ARRAY_SIZE (fat_type
) = stride
;
1890 /* TODO: known offsets for descriptors. */
1891 GFC_TYPE_ARRAY_OFFSET (fat_type
) = NULL_TREE
;
1895 arraytype
= build_pointer_type (etype
);
1897 arraytype
= build_qualified_type (arraytype
, TYPE_QUAL_RESTRICT
);
1899 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type
) = arraytype
;
1903 /* We define data as an array with the correct size if possible.
1904 Much better than doing pointer arithmetic. */
1906 rtype
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
1907 int_const_binop (MINUS_EXPR
, stride
,
1908 build_int_cst (TREE_TYPE (stride
), 1)));
1910 rtype
= gfc_array_range_type
;
1911 arraytype
= build_array_type (etype
, rtype
);
1912 arraytype
= build_pointer_type (arraytype
);
1914 arraytype
= build_qualified_type (arraytype
, TYPE_QUAL_RESTRICT
);
1915 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type
) = arraytype
;
1917 /* This will generate the base declarations we need to emit debug
1918 information for this type. FIXME: there must be a better way to
1919 avoid divergence between compilations with and without debug
1922 struct array_descr_info info
;
1923 gfc_get_array_descr_info (fat_type
, &info
);
1924 gfc_get_array_descr_info (build_pointer_type (fat_type
), &info
);
1930 /* Build a pointer type. This function is called from gfc_sym_type(). */
1933 gfc_build_pointer_type (gfc_symbol
* sym
, tree type
)
1935 /* Array pointer types aren't actually pointers. */
1936 if (sym
->attr
.dimension
)
1939 return build_pointer_type (type
);
1942 static tree
gfc_nonrestricted_type (tree t
);
1943 /* Given two record or union type nodes TO and FROM, ensure
1944 that all fields in FROM have a corresponding field in TO,
1945 their type being nonrestrict variants. This accepts a TO
1946 node that already has a prefix of the fields in FROM. */
1948 mirror_fields (tree to
, tree from
)
1953 /* Forward to the end of TOs fields. */
1954 fto
= TYPE_FIELDS (to
);
1955 ffrom
= TYPE_FIELDS (from
);
1956 chain
= &TYPE_FIELDS (to
);
1959 gcc_assert (ffrom
&& DECL_NAME (fto
) == DECL_NAME (ffrom
));
1960 chain
= &DECL_CHAIN (fto
);
1961 fto
= DECL_CHAIN (fto
);
1962 ffrom
= DECL_CHAIN (ffrom
);
1965 /* Now add all fields remaining in FROM (starting with ffrom). */
1966 for (; ffrom
; ffrom
= DECL_CHAIN (ffrom
))
1968 tree newfield
= copy_node (ffrom
);
1969 DECL_CONTEXT (newfield
) = to
;
1970 /* The store to DECL_CHAIN might seem redundant with the
1971 stores to *chain, but not clearing it here would mean
1972 leaving a chain into the old fields. If ever
1973 our called functions would look at them confusion
1975 DECL_CHAIN (newfield
) = NULL_TREE
;
1977 chain
= &DECL_CHAIN (newfield
);
1979 if (TREE_CODE (ffrom
) == FIELD_DECL
)
1981 tree elemtype
= gfc_nonrestricted_type (TREE_TYPE (ffrom
));
1982 TREE_TYPE (newfield
) = elemtype
;
1988 /* Given a type T, returns a different type of the same structure,
1989 except that all types it refers to (recursively) are always
1990 non-restrict qualified types. */
1992 gfc_nonrestricted_type (tree t
)
1996 /* If the type isn't laid out yet, don't copy it. If something
1997 needs it for real it should wait until the type got finished. */
2001 if (!TYPE_LANG_SPECIFIC (t
))
2002 TYPE_LANG_SPECIFIC (t
) = ggc_cleared_alloc
<struct lang_type
> ();
2003 /* If we're dealing with this very node already further up
2004 the call chain (recursion via pointers and struct members)
2005 we haven't yet determined if we really need a new type node.
2006 Assume we don't, return T itself. */
2007 if (TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
== error_mark_node
)
2010 /* If we have calculated this all already, just return it. */
2011 if (TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
)
2012 return TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
;
2014 /* Mark this type. */
2015 TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
= error_mark_node
;
2017 switch (TREE_CODE (t
))
2023 case REFERENCE_TYPE
:
2025 tree totype
= gfc_nonrestricted_type (TREE_TYPE (t
));
2026 if (totype
== TREE_TYPE (t
))
2028 else if (TREE_CODE (t
) == POINTER_TYPE
)
2029 ret
= build_pointer_type (totype
);
2031 ret
= build_reference_type (totype
);
2032 ret
= build_qualified_type (ret
,
2033 TYPE_QUALS (t
) & ~TYPE_QUAL_RESTRICT
);
2039 tree elemtype
= gfc_nonrestricted_type (TREE_TYPE (t
));
2040 if (elemtype
== TREE_TYPE (t
))
2044 ret
= build_variant_type_copy (t
);
2045 TREE_TYPE (ret
) = elemtype
;
2046 if (TYPE_LANG_SPECIFIC (t
)
2047 && GFC_TYPE_ARRAY_DATAPTR_TYPE (t
))
2049 tree dataptr_type
= GFC_TYPE_ARRAY_DATAPTR_TYPE (t
);
2050 dataptr_type
= gfc_nonrestricted_type (dataptr_type
);
2051 if (dataptr_type
!= GFC_TYPE_ARRAY_DATAPTR_TYPE (t
))
2053 TYPE_LANG_SPECIFIC (ret
)
2054 = ggc_cleared_alloc
<struct lang_type
> ();
2055 *TYPE_LANG_SPECIFIC (ret
) = *TYPE_LANG_SPECIFIC (t
);
2056 GFC_TYPE_ARRAY_DATAPTR_TYPE (ret
) = dataptr_type
;
2065 case QUAL_UNION_TYPE
:
2068 /* First determine if we need a new type at all.
2069 Careful, the two calls to gfc_nonrestricted_type per field
2070 might return different values. That happens exactly when
2071 one of the fields reaches back to this very record type
2072 (via pointers). The first calls will assume that we don't
2073 need to copy T (see the error_mark_node marking). If there
2074 are any reasons for copying T apart from having to copy T,
2075 we'll indeed copy it, and the second calls to
2076 gfc_nonrestricted_type will use that new node if they
2078 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2079 if (TREE_CODE (field
) == FIELD_DECL
)
2081 tree elemtype
= gfc_nonrestricted_type (TREE_TYPE (field
));
2082 if (elemtype
!= TREE_TYPE (field
))
2087 ret
= build_variant_type_copy (t
);
2088 TYPE_FIELDS (ret
) = NULL_TREE
;
2090 /* Here we make sure that as soon as we know we have to copy
2091 T, that also fields reaching back to us will use the new
2092 copy. It's okay if that copy still contains the old fields,
2093 we won't look at them. */
2094 TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
= ret
;
2095 mirror_fields (ret
, t
);
2100 TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
= ret
;
2105 /* Return the type for a symbol. Special handling is required for character
2106 types to get the correct level of indirection.
2107 For functions return the return type.
2108 For subroutines return void_type_node.
2109 Calling this multiple times for the same symbol should be avoided,
2110 especially for character and array types. */
2113 gfc_sym_type (gfc_symbol
* sym
)
2119 /* Procedure Pointers inside COMMON blocks. */
2120 if (sym
->attr
.proc_pointer
&& sym
->attr
.in_common
)
2122 /* Unset proc_pointer as gfc_get_function_type calls gfc_sym_type. */
2123 sym
->attr
.proc_pointer
= 0;
2124 type
= build_pointer_type (gfc_get_function_type (sym
));
2125 sym
->attr
.proc_pointer
= 1;
2129 if (sym
->attr
.flavor
== FL_PROCEDURE
&& !sym
->attr
.function
)
2130 return void_type_node
;
2132 /* In the case of a function the fake result variable may have a
2133 type different from the function type, so don't return early in
2135 if (sym
->backend_decl
&& !sym
->attr
.function
)
2136 return TREE_TYPE (sym
->backend_decl
);
2138 if (sym
->ts
.type
== BT_CHARACTER
2139 && ((sym
->attr
.function
&& sym
->attr
.is_bind_c
)
2140 || (sym
->attr
.result
2141 && sym
->ns
->proc_name
2142 && sym
->ns
->proc_name
->attr
.is_bind_c
)))
2143 type
= gfc_character1_type_node
;
2145 type
= gfc_typenode_for_spec (&sym
->ts
);
2147 if (sym
->attr
.dummy
&& !sym
->attr
.function
&& !sym
->attr
.value
)
2152 restricted
= !sym
->attr
.target
&& !sym
->attr
.pointer
2153 && !sym
->attr
.proc_pointer
&& !sym
->attr
.cray_pointee
;
2155 type
= gfc_nonrestricted_type (type
);
2157 if (sym
->attr
.dimension
|| sym
->attr
.codimension
)
2159 if (gfc_is_nodesc_array (sym
))
2161 /* If this is a character argument of unknown length, just use the
2163 if (sym
->ts
.type
!= BT_CHARACTER
2164 || !(sym
->attr
.dummy
|| sym
->attr
.function
)
2165 || sym
->ts
.u
.cl
->backend_decl
)
2167 type
= gfc_get_nodesc_array_type (type
, sym
->as
,
2176 enum gfc_array_kind akind
= GFC_ARRAY_UNKNOWN
;
2177 if (sym
->attr
.pointer
)
2178 akind
= sym
->attr
.contiguous
? GFC_ARRAY_POINTER_CONT
2179 : GFC_ARRAY_POINTER
;
2180 else if (sym
->attr
.allocatable
)
2181 akind
= GFC_ARRAY_ALLOCATABLE
;
2182 type
= gfc_build_array_type (type
, sym
->as
, akind
, restricted
,
2183 sym
->attr
.contiguous
);
2188 if (sym
->attr
.allocatable
|| sym
->attr
.pointer
2189 || gfc_is_associate_pointer (sym
))
2190 type
= gfc_build_pointer_type (sym
, type
);
2193 /* We currently pass all parameters by reference.
2194 See f95_get_function_decl. For dummy function parameters return the
2198 /* We must use pointer types for potentially absent variables. The
2199 optimizers assume a reference type argument is never NULL. */
2200 if (sym
->attr
.optional
2201 || (sym
->ns
->proc_name
&& sym
->ns
->proc_name
->attr
.entry_master
))
2202 type
= build_pointer_type (type
);
2205 type
= build_reference_type (type
);
2207 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
2214 /* Layout and output debug info for a record type. */
2217 gfc_finish_type (tree type
)
2221 decl
= build_decl (input_location
,
2222 TYPE_DECL
, NULL_TREE
, type
);
2223 TYPE_STUB_DECL (type
) = decl
;
2225 rest_of_type_compilation (type
, 1);
2226 rest_of_decl_compilation (decl
, 1, 0);
2229 /* Add a field of given NAME and TYPE to the context of a UNION_TYPE
2230 or RECORD_TYPE pointed to by CONTEXT. The new field is chained
2231 to the end of the field list pointed to by *CHAIN.
2233 Returns a pointer to the new field. */
2236 gfc_add_field_to_struct_1 (tree context
, tree name
, tree type
, tree
**chain
)
2238 tree decl
= build_decl (input_location
, FIELD_DECL
, name
, type
);
2240 DECL_CONTEXT (decl
) = context
;
2241 DECL_CHAIN (decl
) = NULL_TREE
;
2242 if (TYPE_FIELDS (context
) == NULL_TREE
)
2243 TYPE_FIELDS (context
) = decl
;
2248 *chain
= &DECL_CHAIN (decl
);
2254 /* Like `gfc_add_field_to_struct_1', but adds alignment
2258 gfc_add_field_to_struct (tree context
, tree name
, tree type
, tree
**chain
)
2260 tree decl
= gfc_add_field_to_struct_1 (context
, name
, type
, chain
);
2262 DECL_INITIAL (decl
) = 0;
2263 DECL_ALIGN (decl
) = 0;
2264 DECL_USER_ALIGN (decl
) = 0;
2270 /* Copy the backend_decl and component backend_decls if
2271 the two derived type symbols are "equal", as described
2272 in 4.4.2 and resolved by gfc_compare_derived_types. */
2275 gfc_copy_dt_decls_ifequal (gfc_symbol
*from
, gfc_symbol
*to
,
2278 gfc_component
*to_cm
;
2279 gfc_component
*from_cm
;
2284 if (from
->backend_decl
== NULL
2285 || !gfc_compare_derived_types (from
, to
))
2288 to
->backend_decl
= from
->backend_decl
;
2290 to_cm
= to
->components
;
2291 from_cm
= from
->components
;
2293 /* Copy the component declarations. If a component is itself
2294 a derived type, we need a copy of its component declarations.
2295 This is done by recursing into gfc_get_derived_type and
2296 ensures that the component's component declarations have
2297 been built. If it is a character, we need the character
2299 for (; to_cm
; to_cm
= to_cm
->next
, from_cm
= from_cm
->next
)
2301 to_cm
->backend_decl
= from_cm
->backend_decl
;
2302 if (from_cm
->ts
.type
== BT_DERIVED
2303 && (!from_cm
->attr
.pointer
|| from_gsym
))
2304 gfc_get_derived_type (to_cm
->ts
.u
.derived
);
2305 else if (from_cm
->ts
.type
== BT_CLASS
2306 && (!CLASS_DATA (from_cm
)->attr
.class_pointer
|| from_gsym
))
2307 gfc_get_derived_type (to_cm
->ts
.u
.derived
);
2308 else if (from_cm
->ts
.type
== BT_CHARACTER
)
2309 to_cm
->ts
.u
.cl
->backend_decl
= from_cm
->ts
.u
.cl
->backend_decl
;
2316 /* Build a tree node for a procedure pointer component. */
2319 gfc_get_ppc_type (gfc_component
* c
)
2323 /* Explicit interface. */
2324 if (c
->attr
.if_source
!= IFSRC_UNKNOWN
&& c
->ts
.interface
)
2325 return build_pointer_type (gfc_get_function_type (c
->ts
.interface
));
2327 /* Implicit interface (only return value may be known). */
2328 if (c
->attr
.function
&& !c
->attr
.dimension
&& c
->ts
.type
!= BT_CHARACTER
)
2329 t
= gfc_typenode_for_spec (&c
->ts
);
2333 return build_pointer_type (build_function_type_list (t
, NULL_TREE
));
2337 /* Build a tree node for a derived type. If there are equal
2338 derived types, with different local names, these are built
2339 at the same time. If an equal derived type has been built
2340 in a parent namespace, this is used. */
2343 gfc_get_derived_type (gfc_symbol
* derived
)
2345 tree typenode
= NULL
, field
= NULL
, field_type
= NULL
;
2346 tree canonical
= NULL_TREE
;
2348 bool got_canonical
= false;
2349 bool unlimited_entity
= false;
2354 if (derived
->attr
.unlimited_polymorphic
)
2355 return ptr_type_node
;
2357 if (derived
&& derived
->attr
.flavor
== FL_PROCEDURE
2358 && derived
->attr
.generic
)
2359 derived
= gfc_find_dt_in_generic (derived
);
2361 /* See if it's one of the iso_c_binding derived types. */
2362 if (derived
->attr
.is_iso_c
== 1 || derived
->ts
.f90_type
== BT_VOID
)
2364 if (derived
->backend_decl
)
2365 return derived
->backend_decl
;
2367 if (derived
->intmod_sym_id
== ISOCBINDING_PTR
)
2368 derived
->backend_decl
= ptr_type_node
;
2370 derived
->backend_decl
= pfunc_type_node
;
2372 derived
->ts
.kind
= gfc_index_integer_kind
;
2373 derived
->ts
.type
= BT_INTEGER
;
2374 /* Set the f90_type to BT_VOID as a way to recognize something of type
2375 BT_INTEGER that needs to fit a void * for the purpose of the
2376 iso_c_binding derived types. */
2377 derived
->ts
.f90_type
= BT_VOID
;
2379 return derived
->backend_decl
;
2382 /* If use associated, use the module type for this one. */
2383 if (derived
->backend_decl
== NULL
2384 && derived
->attr
.use_assoc
2386 && gfc_get_module_backend_decl (derived
))
2387 goto copy_derived_types
;
2389 /* The derived types from an earlier namespace can be used as the
2391 if (derived
->backend_decl
== NULL
&& !derived
->attr
.use_assoc
2392 && gfc_global_ns_list
)
2394 for (ns
= gfc_global_ns_list
;
2395 ns
->translated
&& !got_canonical
;
2398 dt
= ns
->derived_types
;
2399 for (; dt
&& !canonical
; dt
= dt
->next
)
2401 gfc_copy_dt_decls_ifequal (dt
->derived
, derived
, true);
2402 if (derived
->backend_decl
)
2403 got_canonical
= true;
2408 /* Store up the canonical type to be added to this one. */
2411 if (TYPE_CANONICAL (derived
->backend_decl
))
2412 canonical
= TYPE_CANONICAL (derived
->backend_decl
);
2414 canonical
= derived
->backend_decl
;
2416 derived
->backend_decl
= NULL_TREE
;
2419 /* derived->backend_decl != 0 means we saw it before, but its
2420 components' backend_decl may have not been built. */
2421 if (derived
->backend_decl
)
2423 /* Its components' backend_decl have been built or we are
2424 seeing recursion through the formal arglist of a procedure
2425 pointer component. */
2426 if (TYPE_FIELDS (derived
->backend_decl
)
2427 || derived
->attr
.proc_pointer_comp
)
2428 return derived
->backend_decl
;
2430 typenode
= derived
->backend_decl
;
2434 /* We see this derived type first time, so build the type node. */
2435 typenode
= make_node (RECORD_TYPE
);
2436 TYPE_NAME (typenode
) = get_identifier (derived
->name
);
2437 TYPE_PACKED (typenode
) = gfc_option
.flag_pack_derived
;
2438 derived
->backend_decl
= typenode
;
2441 if (derived
->components
2442 && derived
->components
->ts
.type
== BT_DERIVED
2443 && strcmp (derived
->components
->name
, "_data") == 0
2444 && derived
->components
->ts
.u
.derived
->attr
.unlimited_polymorphic
)
2445 unlimited_entity
= true;
2447 /* Go through the derived type components, building them as
2448 necessary. The reason for doing this now is that it is
2449 possible to recurse back to this derived type through a
2450 pointer component (PR24092). If this happens, the fields
2451 will be built and so we can return the type. */
2452 for (c
= derived
->components
; c
; c
= c
->next
)
2454 if (c
->ts
.type
!= BT_DERIVED
&& c
->ts
.type
!= BT_CLASS
)
2457 if ((!c
->attr
.pointer
&& !c
->attr
.proc_pointer
)
2458 || c
->ts
.u
.derived
->backend_decl
== NULL
)
2459 c
->ts
.u
.derived
->backend_decl
= gfc_get_derived_type (c
->ts
.u
.derived
);
2461 if (c
->ts
.u
.derived
->attr
.is_iso_c
)
2463 /* Need to copy the modified ts from the derived type. The
2464 typespec was modified because C_PTR/C_FUNPTR are translated
2465 into (void *) from derived types. */
2466 c
->ts
.type
= c
->ts
.u
.derived
->ts
.type
;
2467 c
->ts
.kind
= c
->ts
.u
.derived
->ts
.kind
;
2468 c
->ts
.f90_type
= c
->ts
.u
.derived
->ts
.f90_type
;
2471 c
->initializer
->ts
.type
= c
->ts
.type
;
2472 c
->initializer
->ts
.kind
= c
->ts
.kind
;
2473 c
->initializer
->ts
.f90_type
= c
->ts
.f90_type
;
2474 c
->initializer
->expr_type
= EXPR_NULL
;
2479 if (TYPE_FIELDS (derived
->backend_decl
))
2480 return derived
->backend_decl
;
2482 /* Build the type member list. Install the newly created RECORD_TYPE
2483 node as DECL_CONTEXT of each FIELD_DECL. */
2484 for (c
= derived
->components
; c
; c
= c
->next
)
2486 if (c
->attr
.proc_pointer
)
2487 field_type
= gfc_get_ppc_type (c
);
2488 else if (c
->ts
.type
== BT_DERIVED
|| c
->ts
.type
== BT_CLASS
)
2489 field_type
= c
->ts
.u
.derived
->backend_decl
;
2492 if (c
->ts
.type
== BT_CHARACTER
&& !c
->ts
.deferred
)
2494 /* Evaluate the string length. */
2495 gfc_conv_const_charlen (c
->ts
.u
.cl
);
2496 gcc_assert (c
->ts
.u
.cl
->backend_decl
);
2498 else if (c
->ts
.type
== BT_CHARACTER
)
2499 c
->ts
.u
.cl
->backend_decl
2500 = build_int_cst (gfc_charlen_type_node
, 0);
2502 field_type
= gfc_typenode_for_spec (&c
->ts
);
2505 /* This returns an array descriptor type. Initialization may be
2507 if ((c
->attr
.dimension
|| c
->attr
.codimension
) && !c
->attr
.proc_pointer
)
2509 if (c
->attr
.pointer
|| c
->attr
.allocatable
)
2511 enum gfc_array_kind akind
;
2512 if (c
->attr
.pointer
)
2513 akind
= c
->attr
.contiguous
? GFC_ARRAY_POINTER_CONT
2514 : GFC_ARRAY_POINTER
;
2516 akind
= GFC_ARRAY_ALLOCATABLE
;
2517 /* Pointers to arrays aren't actually pointer types. The
2518 descriptors are separate, but the data is common. */
2519 field_type
= gfc_build_array_type (field_type
, c
->as
, akind
,
2521 && !c
->attr
.pointer
,
2522 c
->attr
.contiguous
);
2525 field_type
= gfc_get_nodesc_array_type (field_type
, c
->as
,
2529 else if ((c
->attr
.pointer
|| c
->attr
.allocatable
)
2530 && !c
->attr
.proc_pointer
2531 && !(unlimited_entity
&& c
== derived
->components
))
2532 field_type
= build_pointer_type (field_type
);
2534 if (c
->attr
.pointer
)
2535 field_type
= gfc_nonrestricted_type (field_type
);
2537 /* vtype fields can point to different types to the base type. */
2538 if (c
->ts
.type
== BT_DERIVED
2539 && c
->ts
.u
.derived
&& c
->ts
.u
.derived
->attr
.vtype
)
2540 field_type
= build_pointer_type_for_mode (TREE_TYPE (field_type
),
2543 /* Ensure that the CLASS language specific flag is set. */
2544 if (c
->ts
.type
== BT_CLASS
)
2546 if (POINTER_TYPE_P (field_type
))
2547 GFC_CLASS_TYPE_P (TREE_TYPE (field_type
)) = 1;
2549 GFC_CLASS_TYPE_P (field_type
) = 1;
2552 field
= gfc_add_field_to_struct (typenode
,
2553 get_identifier (c
->name
),
2554 field_type
, &chain
);
2556 gfc_set_decl_location (field
, &c
->loc
);
2557 else if (derived
->declared_at
.lb
)
2558 gfc_set_decl_location (field
, &derived
->declared_at
);
2560 gfc_finish_decl_attrs (field
, &c
->attr
);
2562 DECL_PACKED (field
) |= TYPE_PACKED (typenode
);
2565 if (!c
->backend_decl
)
2566 c
->backend_decl
= field
;
2569 /* Now lay out the derived type, including the fields. */
2571 TYPE_CANONICAL (typenode
) = canonical
;
2573 gfc_finish_type (typenode
);
2574 gfc_set_decl_location (TYPE_STUB_DECL (typenode
), &derived
->declared_at
);
2575 if (derived
->module
&& derived
->ns
->proc_name
2576 && derived
->ns
->proc_name
->attr
.flavor
== FL_MODULE
)
2578 if (derived
->ns
->proc_name
->backend_decl
2579 && TREE_CODE (derived
->ns
->proc_name
->backend_decl
)
2582 TYPE_CONTEXT (typenode
) = derived
->ns
->proc_name
->backend_decl
;
2583 DECL_CONTEXT (TYPE_STUB_DECL (typenode
))
2584 = derived
->ns
->proc_name
->backend_decl
;
2588 derived
->backend_decl
= typenode
;
2592 for (dt
= gfc_derived_types
; dt
; dt
= dt
->next
)
2593 gfc_copy_dt_decls_ifequal (derived
, dt
->derived
, false);
2595 return derived
->backend_decl
;
2600 gfc_return_by_reference (gfc_symbol
* sym
)
2602 if (!sym
->attr
.function
)
2605 if (sym
->attr
.dimension
)
2608 if (sym
->ts
.type
== BT_CHARACTER
2609 && !sym
->attr
.is_bind_c
2610 && (!sym
->attr
.result
2611 || !sym
->ns
->proc_name
2612 || !sym
->ns
->proc_name
->attr
.is_bind_c
))
2615 /* Possibly return complex numbers by reference for g77 compatibility.
2616 We don't do this for calls to intrinsics (as the library uses the
2617 -fno-f2c calling convention), nor for calls to functions which always
2618 require an explicit interface, as no compatibility problems can
2620 if (gfc_option
.flag_f2c
2621 && sym
->ts
.type
== BT_COMPLEX
2622 && !sym
->attr
.intrinsic
&& !sym
->attr
.always_explicit
)
2629 gfc_get_mixed_entry_union (gfc_namespace
*ns
)
2633 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2634 gfc_entry_list
*el
, *el2
;
2636 gcc_assert (ns
->proc_name
->attr
.mixed_entry_master
);
2637 gcc_assert (memcmp (ns
->proc_name
->name
, "master.", 7) == 0);
2639 snprintf (name
, GFC_MAX_SYMBOL_LEN
, "munion.%s", ns
->proc_name
->name
+ 7);
2641 /* Build the type node. */
2642 type
= make_node (UNION_TYPE
);
2644 TYPE_NAME (type
) = get_identifier (name
);
2646 for (el
= ns
->entries
; el
; el
= el
->next
)
2648 /* Search for duplicates. */
2649 for (el2
= ns
->entries
; el2
!= el
; el2
= el2
->next
)
2650 if (el2
->sym
->result
== el
->sym
->result
)
2654 gfc_add_field_to_struct_1 (type
,
2655 get_identifier (el
->sym
->result
->name
),
2656 gfc_sym_type (el
->sym
->result
), &chain
);
2659 /* Finish off the type. */
2660 gfc_finish_type (type
);
2661 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
)) = 1;
2665 /* Create a "fn spec" based on the formal arguments;
2666 cf. create_function_arglist. */
2669 create_fn_spec (gfc_symbol
*sym
, tree fntype
)
2673 gfc_formal_arglist
*f
;
2676 memset (&spec
, 0, sizeof (spec
));
2680 if (sym
->attr
.entry_master
)
2681 spec
[spec_len
++] = 'R';
2682 if (gfc_return_by_reference (sym
))
2684 gfc_symbol
*result
= sym
->result
? sym
->result
: sym
;
2686 if (result
->attr
.pointer
|| sym
->attr
.proc_pointer
)
2687 spec
[spec_len
++] = '.';
2689 spec
[spec_len
++] = 'w';
2690 if (sym
->ts
.type
== BT_CHARACTER
)
2691 spec
[spec_len
++] = 'R';
2694 for (f
= gfc_sym_get_dummy_args (sym
); f
; f
= f
->next
)
2695 if (spec_len
< sizeof (spec
))
2697 if (!f
->sym
|| f
->sym
->attr
.pointer
|| f
->sym
->attr
.target
2698 || f
->sym
->attr
.external
|| f
->sym
->attr
.cray_pointer
2699 || (f
->sym
->ts
.type
== BT_DERIVED
2700 && (f
->sym
->ts
.u
.derived
->attr
.proc_pointer_comp
2701 || f
->sym
->ts
.u
.derived
->attr
.pointer_comp
))
2702 || (f
->sym
->ts
.type
== BT_CLASS
2703 && (CLASS_DATA (f
->sym
)->ts
.u
.derived
->attr
.proc_pointer_comp
2704 || CLASS_DATA (f
->sym
)->ts
.u
.derived
->attr
.pointer_comp
)))
2705 spec
[spec_len
++] = '.';
2706 else if (f
->sym
->attr
.intent
== INTENT_IN
)
2707 spec
[spec_len
++] = 'r';
2709 spec
[spec_len
++] = 'w';
2712 tmp
= build_tree_list (NULL_TREE
, build_string (spec_len
, spec
));
2713 tmp
= tree_cons (get_identifier ("fn spec"), tmp
, TYPE_ATTRIBUTES (fntype
));
2714 return build_type_attribute_variant (fntype
, tmp
);
2719 gfc_get_function_type (gfc_symbol
* sym
)
2722 vec
<tree
, va_gc
> *typelist
= NULL
;
2723 gfc_formal_arglist
*f
;
2725 int alternate_return
= 0;
2726 bool is_varargs
= true;
2728 /* Make sure this symbol is a function, a subroutine or the main
2730 gcc_assert (sym
->attr
.flavor
== FL_PROCEDURE
2731 || sym
->attr
.flavor
== FL_PROGRAM
);
2733 /* To avoid recursing infinitely on recursive types, we use error_mark_node
2734 so that they can be detected here and handled further down. */
2735 if (sym
->backend_decl
== NULL
)
2736 sym
->backend_decl
= error_mark_node
;
2737 else if (sym
->backend_decl
== error_mark_node
)
2738 goto arg_type_list_done
;
2739 else if (sym
->attr
.proc_pointer
)
2740 return TREE_TYPE (TREE_TYPE (sym
->backend_decl
));
2742 return TREE_TYPE (sym
->backend_decl
);
2744 if (sym
->attr
.entry_master
)
2745 /* Additional parameter for selecting an entry point. */
2746 vec_safe_push (typelist
, gfc_array_index_type
);
2753 if (arg
->ts
.type
== BT_CHARACTER
)
2754 gfc_conv_const_charlen (arg
->ts
.u
.cl
);
2756 /* Some functions we use an extra parameter for the return value. */
2757 if (gfc_return_by_reference (sym
))
2759 type
= gfc_sym_type (arg
);
2760 if (arg
->ts
.type
== BT_COMPLEX
2761 || arg
->attr
.dimension
2762 || arg
->ts
.type
== BT_CHARACTER
)
2763 type
= build_reference_type (type
);
2765 vec_safe_push (typelist
, type
);
2766 if (arg
->ts
.type
== BT_CHARACTER
)
2768 if (!arg
->ts
.deferred
)
2769 /* Transfer by value. */
2770 vec_safe_push (typelist
, gfc_charlen_type_node
);
2772 /* Deferred character lengths are transferred by reference
2773 so that the value can be returned. */
2774 vec_safe_push (typelist
, build_pointer_type(gfc_charlen_type_node
));
2778 /* Build the argument types for the function. */
2779 for (f
= gfc_sym_get_dummy_args (sym
); f
; f
= f
->next
)
2784 /* Evaluate constant character lengths here so that they can be
2785 included in the type. */
2786 if (arg
->ts
.type
== BT_CHARACTER
)
2787 gfc_conv_const_charlen (arg
->ts
.u
.cl
);
2789 if (arg
->attr
.flavor
== FL_PROCEDURE
)
2791 type
= gfc_get_function_type (arg
);
2792 type
= build_pointer_type (type
);
2795 type
= gfc_sym_type (arg
);
2797 /* Parameter Passing Convention
2799 We currently pass all parameters by reference.
2800 Parameters with INTENT(IN) could be passed by value.
2801 The problem arises if a function is called via an implicit
2802 prototype. In this situation the INTENT is not known.
2803 For this reason all parameters to global functions must be
2804 passed by reference. Passing by value would potentially
2805 generate bad code. Worse there would be no way of telling that
2806 this code was bad, except that it would give incorrect results.
2808 Contained procedures could pass by value as these are never
2809 used without an explicit interface, and cannot be passed as
2810 actual parameters for a dummy procedure. */
2812 vec_safe_push (typelist
, type
);
2816 if (sym
->attr
.subroutine
)
2817 alternate_return
= 1;
2821 /* Add hidden string length parameters. */
2822 for (f
= gfc_sym_get_dummy_args (sym
); f
; f
= f
->next
)
2825 if (arg
&& arg
->ts
.type
== BT_CHARACTER
&& !sym
->attr
.is_bind_c
)
2827 if (!arg
->ts
.deferred
)
2828 /* Transfer by value. */
2829 type
= gfc_charlen_type_node
;
2831 /* Deferred character lengths are transferred by reference
2832 so that the value can be returned. */
2833 type
= build_pointer_type (gfc_charlen_type_node
);
2835 vec_safe_push (typelist
, type
);
2839 if (!vec_safe_is_empty (typelist
)
2840 || sym
->attr
.is_main_program
2841 || sym
->attr
.if_source
!= IFSRC_UNKNOWN
)
2844 if (sym
->backend_decl
== error_mark_node
)
2845 sym
->backend_decl
= NULL_TREE
;
2849 if (alternate_return
)
2850 type
= integer_type_node
;
2851 else if (!sym
->attr
.function
|| gfc_return_by_reference (sym
))
2852 type
= void_type_node
;
2853 else if (sym
->attr
.mixed_entry_master
)
2854 type
= gfc_get_mixed_entry_union (sym
->ns
);
2855 else if (gfc_option
.flag_f2c
2856 && sym
->ts
.type
== BT_REAL
2857 && sym
->ts
.kind
== gfc_default_real_kind
2858 && !sym
->attr
.always_explicit
)
2860 /* Special case: f2c calling conventions require that (scalar)
2861 default REAL functions return the C type double instead. f2c
2862 compatibility is only an issue with functions that don't
2863 require an explicit interface, as only these could be
2864 implemented in Fortran 77. */
2865 sym
->ts
.kind
= gfc_default_double_kind
;
2866 type
= gfc_typenode_for_spec (&sym
->ts
);
2867 sym
->ts
.kind
= gfc_default_real_kind
;
2869 else if (sym
->result
&& sym
->result
->attr
.proc_pointer
)
2870 /* Procedure pointer return values. */
2872 if (sym
->result
->attr
.result
&& strcmp (sym
->name
,"ppr@") != 0)
2874 /* Unset proc_pointer as gfc_get_function_type
2875 is called recursively. */
2876 sym
->result
->attr
.proc_pointer
= 0;
2877 type
= build_pointer_type (gfc_get_function_type (sym
->result
));
2878 sym
->result
->attr
.proc_pointer
= 1;
2881 type
= gfc_sym_type (sym
->result
);
2884 type
= gfc_sym_type (sym
);
2887 type
= build_varargs_function_type_vec (type
, typelist
);
2889 type
= build_function_type_vec (type
, typelist
);
2890 type
= create_fn_spec (sym
, type
);
2895 /* Language hooks for middle-end access to type nodes. */
2897 /* Return an integer type with BITS bits of precision,
2898 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2901 gfc_type_for_size (unsigned bits
, int unsignedp
)
2906 for (i
= 0; i
<= MAX_INT_KINDS
; ++i
)
2908 tree type
= gfc_integer_types
[i
];
2909 if (type
&& bits
== TYPE_PRECISION (type
))
2913 /* Handle TImode as a special case because it is used by some backends
2914 (e.g. ARM) even though it is not available for normal use. */
2915 #if HOST_BITS_PER_WIDE_INT >= 64
2916 if (bits
== TYPE_PRECISION (intTI_type_node
))
2917 return intTI_type_node
;
2920 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2921 return intQI_type_node
;
2922 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2923 return intHI_type_node
;
2924 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2925 return intSI_type_node
;
2926 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2927 return intDI_type_node
;
2928 if (bits
<= TYPE_PRECISION (intTI_type_node
))
2929 return intTI_type_node
;
2933 if (bits
<= TYPE_PRECISION (unsigned_intQI_type_node
))
2934 return unsigned_intQI_type_node
;
2935 if (bits
<= TYPE_PRECISION (unsigned_intHI_type_node
))
2936 return unsigned_intHI_type_node
;
2937 if (bits
<= TYPE_PRECISION (unsigned_intSI_type_node
))
2938 return unsigned_intSI_type_node
;
2939 if (bits
<= TYPE_PRECISION (unsigned_intDI_type_node
))
2940 return unsigned_intDI_type_node
;
2941 if (bits
<= TYPE_PRECISION (unsigned_intTI_type_node
))
2942 return unsigned_intTI_type_node
;
2948 /* Return a data type that has machine mode MODE. If the mode is an
2949 integer, then UNSIGNEDP selects between signed and unsigned types. */
2952 gfc_type_for_mode (enum machine_mode mode
, int unsignedp
)
2957 if (GET_MODE_CLASS (mode
) == MODE_FLOAT
)
2958 base
= gfc_real_types
;
2959 else if (GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
)
2960 base
= gfc_complex_types
;
2961 else if (SCALAR_INT_MODE_P (mode
))
2963 tree type
= gfc_type_for_size (GET_MODE_PRECISION (mode
), unsignedp
);
2964 return type
!= NULL_TREE
&& mode
== TYPE_MODE (type
) ? type
: NULL_TREE
;
2966 else if (VECTOR_MODE_P (mode
))
2968 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2969 tree inner_type
= gfc_type_for_mode (inner_mode
, unsignedp
);
2970 if (inner_type
!= NULL_TREE
)
2971 return build_vector_type_for_mode (inner_type
, mode
);
2977 for (i
= 0; i
<= MAX_REAL_KINDS
; ++i
)
2979 tree type
= base
[i
];
2980 if (type
&& mode
== TYPE_MODE (type
))
2987 /* Return TRUE if TYPE is a type with a hidden descriptor, fill in INFO
2991 gfc_get_array_descr_info (const_tree type
, struct array_descr_info
*info
)
2994 bool indirect
= false;
2995 tree etype
, ptype
, field
, t
, base_decl
;
2996 tree data_off
, dim_off
, dim_size
, elem_size
;
2997 tree lower_suboff
, upper_suboff
, stride_suboff
;
2999 if (! GFC_DESCRIPTOR_TYPE_P (type
))
3001 if (! POINTER_TYPE_P (type
))
3003 type
= TREE_TYPE (type
);
3004 if (! GFC_DESCRIPTOR_TYPE_P (type
))
3009 rank
= GFC_TYPE_ARRAY_RANK (type
);
3010 if (rank
>= (int) (sizeof (info
->dimen
) / sizeof (info
->dimen
[0])))
3013 etype
= GFC_TYPE_ARRAY_DATAPTR_TYPE (type
);
3014 gcc_assert (POINTER_TYPE_P (etype
));
3015 etype
= TREE_TYPE (etype
);
3017 /* If the type is not a scalar coarray. */
3018 if (TREE_CODE (etype
) == ARRAY_TYPE
)
3019 etype
= TREE_TYPE (etype
);
3021 /* Can't handle variable sized elements yet. */
3022 if (int_size_in_bytes (etype
) <= 0)
3024 /* Nor non-constant lower bounds in assumed shape arrays. */
3025 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE
3026 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE_CONT
)
3028 for (dim
= 0; dim
< rank
; dim
++)
3029 if (GFC_TYPE_ARRAY_LBOUND (type
, dim
) == NULL_TREE
3030 || TREE_CODE (GFC_TYPE_ARRAY_LBOUND (type
, dim
)) != INTEGER_CST
)
3034 memset (info
, '\0', sizeof (*info
));
3035 info
->ndimensions
= rank
;
3036 info
->element_type
= etype
;
3037 ptype
= build_pointer_type (gfc_array_index_type
);
3038 base_decl
= GFC_TYPE_ARRAY_BASE_DECL (type
, indirect
);
3041 base_decl
= build_decl (input_location
, VAR_DECL
, NULL_TREE
,
3042 indirect
? build_pointer_type (ptype
) : ptype
);
3043 GFC_TYPE_ARRAY_BASE_DECL (type
, indirect
) = base_decl
;
3045 info
->base_decl
= base_decl
;
3047 base_decl
= build1 (INDIRECT_REF
, ptype
, base_decl
);
3049 if (GFC_TYPE_ARRAY_SPAN (type
))
3050 elem_size
= GFC_TYPE_ARRAY_SPAN (type
);
3052 elem_size
= fold_convert (gfc_array_index_type
, TYPE_SIZE_UNIT (etype
));
3053 field
= TYPE_FIELDS (TYPE_MAIN_VARIANT (type
));
3054 data_off
= byte_position (field
);
3055 field
= DECL_CHAIN (field
);
3056 field
= DECL_CHAIN (field
);
3057 field
= DECL_CHAIN (field
);
3058 dim_off
= byte_position (field
);
3059 dim_size
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (field
)));
3060 field
= TYPE_FIELDS (TREE_TYPE (TREE_TYPE (field
)));
3061 stride_suboff
= byte_position (field
);
3062 field
= DECL_CHAIN (field
);
3063 lower_suboff
= byte_position (field
);
3064 field
= DECL_CHAIN (field
);
3065 upper_suboff
= byte_position (field
);
3068 if (!integer_zerop (data_off
))
3069 t
= fold_build_pointer_plus (t
, data_off
);
3070 t
= build1 (NOP_EXPR
, build_pointer_type (ptr_type_node
), t
);
3071 info
->data_location
= build1 (INDIRECT_REF
, ptr_type_node
, t
);
3072 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ALLOCATABLE
)
3073 info
->allocated
= build2 (NE_EXPR
, boolean_type_node
,
3074 info
->data_location
, null_pointer_node
);
3075 else if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_POINTER
3076 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_POINTER_CONT
)
3077 info
->associated
= build2 (NE_EXPR
, boolean_type_node
,
3078 info
->data_location
, null_pointer_node
);
3080 for (dim
= 0; dim
< rank
; dim
++)
3082 t
= fold_build_pointer_plus (base_decl
,
3083 size_binop (PLUS_EXPR
,
3084 dim_off
, lower_suboff
));
3085 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
3086 info
->dimen
[dim
].lower_bound
= t
;
3087 t
= fold_build_pointer_plus (base_decl
,
3088 size_binop (PLUS_EXPR
,
3089 dim_off
, upper_suboff
));
3090 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
3091 info
->dimen
[dim
].upper_bound
= t
;
3092 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE
3093 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE_CONT
)
3095 /* Assumed shape arrays have known lower bounds. */
3096 info
->dimen
[dim
].upper_bound
3097 = build2 (MINUS_EXPR
, gfc_array_index_type
,
3098 info
->dimen
[dim
].upper_bound
,
3099 info
->dimen
[dim
].lower_bound
);
3100 info
->dimen
[dim
].lower_bound
3101 = fold_convert (gfc_array_index_type
,
3102 GFC_TYPE_ARRAY_LBOUND (type
, dim
));
3103 info
->dimen
[dim
].upper_bound
3104 = build2 (PLUS_EXPR
, gfc_array_index_type
,
3105 info
->dimen
[dim
].lower_bound
,
3106 info
->dimen
[dim
].upper_bound
);
3108 t
= fold_build_pointer_plus (base_decl
,
3109 size_binop (PLUS_EXPR
,
3110 dim_off
, stride_suboff
));
3111 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
3112 t
= build2 (MULT_EXPR
, gfc_array_index_type
, t
, elem_size
);
3113 info
->dimen
[dim
].stride
= t
;
3114 dim_off
= size_binop (PLUS_EXPR
, dim_off
, dim_size
);
3121 /* Create a type to handle vector subscripts for coarray library calls. It
3123 struct caf_vector_t {
3124 size_t nvec; // size of the vector
3131 ptrdiff_t lower_bound;
3132 ptrdiff_t upper_bound;
3137 where nvec == 0 for DIMEN_ELEMENT or DIMEN_RANGE and nvec being the vector
3138 size in case of DIMEN_VECTOR, where kind is the integer type of the vector. */
3141 gfc_get_caf_vector_type (int dim
)
3143 static tree vector_types
[GFC_MAX_DIMENSIONS
];
3144 static tree vec_type
= NULL_TREE
;
3145 tree triplet_struct_type
, vect_struct_type
, union_type
, tmp
, *chain
;
3147 if (vector_types
[dim
-1] != NULL_TREE
)
3148 return vector_types
[dim
-1];
3150 if (vec_type
== NULL_TREE
)
3153 vect_struct_type
= make_node (RECORD_TYPE
);
3154 tmp
= gfc_add_field_to_struct_1 (vect_struct_type
,
3155 get_identifier ("vector"),
3156 pvoid_type_node
, &chain
);
3157 TREE_NO_WARNING (tmp
) = 1;
3158 tmp
= gfc_add_field_to_struct_1 (vect_struct_type
,
3159 get_identifier ("kind"),
3160 integer_type_node
, &chain
);
3161 TREE_NO_WARNING (tmp
) = 1;
3162 gfc_finish_type (vect_struct_type
);
3165 triplet_struct_type
= make_node (RECORD_TYPE
);
3166 tmp
= gfc_add_field_to_struct_1 (triplet_struct_type
,
3167 get_identifier ("lower_bound"),
3168 gfc_array_index_type
, &chain
);
3169 TREE_NO_WARNING (tmp
) = 1;
3170 tmp
= gfc_add_field_to_struct_1 (triplet_struct_type
,
3171 get_identifier ("upper_bound"),
3172 gfc_array_index_type
, &chain
);
3173 TREE_NO_WARNING (tmp
) = 1;
3174 tmp
= gfc_add_field_to_struct_1 (triplet_struct_type
, get_identifier ("stride"),
3175 gfc_array_index_type
, &chain
);
3176 TREE_NO_WARNING (tmp
) = 1;
3177 gfc_finish_type (triplet_struct_type
);
3180 union_type
= make_node (UNION_TYPE
);
3181 tmp
= gfc_add_field_to_struct_1 (union_type
, get_identifier ("v"),
3182 vect_struct_type
, &chain
);
3183 TREE_NO_WARNING (tmp
) = 1;
3184 tmp
= gfc_add_field_to_struct_1 (union_type
, get_identifier ("triplet"),
3185 triplet_struct_type
, &chain
);
3186 TREE_NO_WARNING (tmp
) = 1;
3187 gfc_finish_type (union_type
);
3190 vec_type
= make_node (RECORD_TYPE
);
3191 tmp
= gfc_add_field_to_struct_1 (vec_type
, get_identifier ("nvec"),
3192 size_type_node
, &chain
);
3193 TREE_NO_WARNING (tmp
) = 1;
3194 tmp
= gfc_add_field_to_struct_1 (vec_type
, get_identifier ("u"),
3195 union_type
, &chain
);
3196 TREE_NO_WARNING (tmp
) = 1;
3197 gfc_finish_type (vec_type
);
3198 TYPE_NAME (vec_type
) = get_identifier ("caf_vector_t");
3201 tmp
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
3202 gfc_rank_cst
[dim
-1]);
3203 vector_types
[dim
-1] = build_array_type (vec_type
, tmp
);
3204 return vector_types
[dim
-1];
3207 #include "gt-fortran-trans-types.h"