1 /* Backend support for Fortran 95 basic types and derived types.
2 Copyright (C) 2002-2015 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 and
35 LONG_DOUBLE_TYPE_SIZE. */
38 #include "fold-const.h"
39 #include "stor-layout.h"
40 #include "stringpool.h"
41 #include "langhooks.h" /* For iso-c-bindings.def. */
44 #include "diagnostic-core.h" /* For fatal_error. */
45 #include "toplev.h" /* For rest_of_decl_compilation. */
47 #include "trans-types.h"
48 #include "trans-const.h"
50 #include "dwarf2out.h" /* For struct array_descr_info. */
53 #if (GFC_MAX_DIMENSIONS < 10)
54 #define GFC_RANK_DIGITS 1
55 #define GFC_RANK_PRINTF_FORMAT "%01d"
56 #elif (GFC_MAX_DIMENSIONS < 100)
57 #define GFC_RANK_DIGITS 2
58 #define GFC_RANK_PRINTF_FORMAT "%02d"
60 #error If you really need >99 dimensions, continue the sequence above...
63 /* array of structs so we don't have to worry about xmalloc or free */
64 CInteropKind_t c_interop_kinds_table
[ISOCBINDING_NUMBER
];
66 tree gfc_array_index_type
;
67 tree gfc_array_range_type
;
68 tree gfc_character1_type_node
;
70 tree prvoid_type_node
;
71 tree ppvoid_type_node
;
75 tree gfc_charlen_type_node
;
77 tree float128_type_node
= NULL_TREE
;
78 tree complex_float128_type_node
= NULL_TREE
;
80 bool gfc_real16_is_float128
= false;
82 static GTY(()) tree gfc_desc_dim_type
;
83 static GTY(()) tree gfc_max_array_element_size
;
84 static GTY(()) tree gfc_array_descriptor_base
[2 * (GFC_MAX_DIMENSIONS
+1)];
85 static GTY(()) tree gfc_array_descriptor_base_caf
[2 * (GFC_MAX_DIMENSIONS
+1)];
87 /* Arrays for all integral and real kinds. We'll fill this in at runtime
88 after the target has a chance to process command-line options. */
90 #define MAX_INT_KINDS 5
91 gfc_integer_info gfc_integer_kinds
[MAX_INT_KINDS
+ 1];
92 gfc_logical_info gfc_logical_kinds
[MAX_INT_KINDS
+ 1];
93 static GTY(()) tree gfc_integer_types
[MAX_INT_KINDS
+ 1];
94 static GTY(()) tree gfc_logical_types
[MAX_INT_KINDS
+ 1];
96 #define MAX_REAL_KINDS 5
97 gfc_real_info gfc_real_kinds
[MAX_REAL_KINDS
+ 1];
98 static GTY(()) tree gfc_real_types
[MAX_REAL_KINDS
+ 1];
99 static GTY(()) tree gfc_complex_types
[MAX_REAL_KINDS
+ 1];
101 #define MAX_CHARACTER_KINDS 2
102 gfc_character_info gfc_character_kinds
[MAX_CHARACTER_KINDS
+ 1];
103 static GTY(()) tree gfc_character_types
[MAX_CHARACTER_KINDS
+ 1];
104 static GTY(()) tree gfc_pcharacter_types
[MAX_CHARACTER_KINDS
+ 1];
106 static tree
gfc_add_field_to_struct_1 (tree
, tree
, tree
, tree
**);
108 /* The integer kind to use for array indices. This will be set to the
109 proper value based on target information from the backend. */
111 int gfc_index_integer_kind
;
113 /* The default kinds of the various types. */
115 int gfc_default_integer_kind
;
116 int gfc_max_integer_kind
;
117 int gfc_default_real_kind
;
118 int gfc_default_double_kind
;
119 int gfc_default_character_kind
;
120 int gfc_default_logical_kind
;
121 int gfc_default_complex_kind
;
123 int gfc_atomic_int_kind
;
124 int gfc_atomic_logical_kind
;
126 /* The kind size used for record offsets. If the target system supports
127 kind=8, this will be set to 8, otherwise it is set to 4. */
130 /* The integer kind used to store character lengths. */
131 int gfc_charlen_int_kind
;
133 /* The size of the numeric storage unit and character storage unit. */
134 int gfc_numeric_storage_size
;
135 int gfc_character_storage_size
;
139 gfc_check_any_c_kind (gfc_typespec
*ts
)
143 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
145 /* Check for any C interoperable kind for the given type/kind in ts.
146 This can be used after verify_c_interop to make sure that the
147 Fortran kind being used exists in at least some form for C. */
148 if (c_interop_kinds_table
[i
].f90_type
== ts
->type
&&
149 c_interop_kinds_table
[i
].value
== ts
->kind
)
158 get_real_kind_from_node (tree type
)
162 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
163 if (gfc_real_kinds
[i
].mode_precision
== TYPE_PRECISION (type
))
164 return gfc_real_kinds
[i
].kind
;
170 get_int_kind_from_node (tree type
)
177 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
178 if (gfc_integer_kinds
[i
].bit_size
== TYPE_PRECISION (type
))
179 return gfc_integer_kinds
[i
].kind
;
184 /* Return a typenode for the "standard" C type with a given name. */
186 get_typenode_from_name (const char *name
)
188 if (name
== NULL
|| *name
== '\0')
191 if (strcmp (name
, "char") == 0)
192 return char_type_node
;
193 if (strcmp (name
, "unsigned char") == 0)
194 return unsigned_char_type_node
;
195 if (strcmp (name
, "signed char") == 0)
196 return signed_char_type_node
;
198 if (strcmp (name
, "short int") == 0)
199 return short_integer_type_node
;
200 if (strcmp (name
, "short unsigned int") == 0)
201 return short_unsigned_type_node
;
203 if (strcmp (name
, "int") == 0)
204 return integer_type_node
;
205 if (strcmp (name
, "unsigned int") == 0)
206 return unsigned_type_node
;
208 if (strcmp (name
, "long int") == 0)
209 return long_integer_type_node
;
210 if (strcmp (name
, "long unsigned int") == 0)
211 return long_unsigned_type_node
;
213 if (strcmp (name
, "long long int") == 0)
214 return long_long_integer_type_node
;
215 if (strcmp (name
, "long long unsigned int") == 0)
216 return long_long_unsigned_type_node
;
222 get_int_kind_from_name (const char *name
)
224 return get_int_kind_from_node (get_typenode_from_name (name
));
228 /* Get the kind number corresponding to an integer of given size,
229 following the required return values for ISO_FORTRAN_ENV INT* constants:
230 -2 is returned if we support a kind of larger size, -1 otherwise. */
232 gfc_get_int_kind_from_width_isofortranenv (int size
)
236 /* Look for a kind with matching storage size. */
237 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
238 if (gfc_integer_kinds
[i
].bit_size
== size
)
239 return gfc_integer_kinds
[i
].kind
;
241 /* Look for a kind with larger storage size. */
242 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
243 if (gfc_integer_kinds
[i
].bit_size
> size
)
249 /* Get the kind number corresponding to a real of given storage size,
250 following the required return values for ISO_FORTRAN_ENV REAL* constants:
251 -2 is returned if we support a kind of larger size, -1 otherwise. */
253 gfc_get_real_kind_from_width_isofortranenv (int size
)
259 /* Look for a kind with matching storage size. */
260 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
261 if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds
[i
].kind
)) == size
)
262 return gfc_real_kinds
[i
].kind
;
264 /* Look for a kind with larger storage size. */
265 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
266 if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds
[i
].kind
)) > size
)
275 get_int_kind_from_width (int size
)
279 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
280 if (gfc_integer_kinds
[i
].bit_size
== size
)
281 return gfc_integer_kinds
[i
].kind
;
287 get_int_kind_from_minimal_width (int size
)
291 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
292 if (gfc_integer_kinds
[i
].bit_size
>= size
)
293 return gfc_integer_kinds
[i
].kind
;
299 /* Generate the CInteropKind_t objects for the C interoperable
303 gfc_init_c_interop_kinds (void)
307 /* init all pointers in the list to NULL */
308 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
310 /* Initialize the name and value fields. */
311 c_interop_kinds_table
[i
].name
[0] = '\0';
312 c_interop_kinds_table
[i
].value
= -100;
313 c_interop_kinds_table
[i
].f90_type
= BT_UNKNOWN
;
316 #define NAMED_INTCST(a,b,c,d) \
317 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
318 c_interop_kinds_table[a].f90_type = BT_INTEGER; \
319 c_interop_kinds_table[a].value = c;
320 #define NAMED_REALCST(a,b,c,d) \
321 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
322 c_interop_kinds_table[a].f90_type = BT_REAL; \
323 c_interop_kinds_table[a].value = c;
324 #define NAMED_CMPXCST(a,b,c,d) \
325 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
326 c_interop_kinds_table[a].f90_type = BT_COMPLEX; \
327 c_interop_kinds_table[a].value = c;
328 #define NAMED_LOGCST(a,b,c) \
329 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
330 c_interop_kinds_table[a].f90_type = BT_LOGICAL; \
331 c_interop_kinds_table[a].value = c;
332 #define NAMED_CHARKNDCST(a,b,c) \
333 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
334 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
335 c_interop_kinds_table[a].value = c;
336 #define NAMED_CHARCST(a,b,c) \
337 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
338 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
339 c_interop_kinds_table[a].value = c;
340 #define DERIVED_TYPE(a,b,c) \
341 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
342 c_interop_kinds_table[a].f90_type = BT_DERIVED; \
343 c_interop_kinds_table[a].value = c;
344 #define NAMED_FUNCTION(a,b,c,d) \
345 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
346 c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
347 c_interop_kinds_table[a].value = c;
348 #define NAMED_SUBROUTINE(a,b,c,d) \
349 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
350 c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
351 c_interop_kinds_table[a].value = c;
352 #include "iso-c-binding.def"
356 /* Query the target to determine which machine modes are available for
357 computation. Choose KIND numbers for them. */
360 gfc_init_kinds (void)
363 int i_index
, r_index
, kind
;
364 bool saw_i4
= false, saw_i8
= false;
365 bool saw_r4
= false, saw_r8
= false, saw_r10
= false, saw_r16
= false;
367 for (i_index
= 0, mode
= MIN_MODE_INT
; mode
<= MAX_MODE_INT
; mode
++)
371 if (!targetm
.scalar_mode_supported_p ((machine_mode
) mode
))
374 /* The middle end doesn't support constants larger than 2*HWI.
375 Perhaps the target hook shouldn't have accepted these either,
376 but just to be safe... */
377 bitsize
= GET_MODE_BITSIZE ((machine_mode
) mode
);
378 if (bitsize
> 2*HOST_BITS_PER_WIDE_INT
)
381 gcc_assert (i_index
!= MAX_INT_KINDS
);
383 /* Let the kind equal the bit size divided by 8. This insulates the
384 programmer from the underlying byte size. */
392 gfc_integer_kinds
[i_index
].kind
= kind
;
393 gfc_integer_kinds
[i_index
].radix
= 2;
394 gfc_integer_kinds
[i_index
].digits
= bitsize
- 1;
395 gfc_integer_kinds
[i_index
].bit_size
= bitsize
;
397 gfc_logical_kinds
[i_index
].kind
= kind
;
398 gfc_logical_kinds
[i_index
].bit_size
= bitsize
;
403 /* Set the kind used to match GFC_INT_IO in libgfortran. This is
404 used for large file access. */
411 /* If we do not at least have kind = 4, everything is pointless. */
414 /* Set the maximum integer kind. Used with at least BOZ constants. */
415 gfc_max_integer_kind
= gfc_integer_kinds
[i_index
- 1].kind
;
417 for (r_index
= 0, mode
= MIN_MODE_FLOAT
; mode
<= MAX_MODE_FLOAT
; mode
++)
419 const struct real_format
*fmt
=
420 REAL_MODE_FORMAT ((machine_mode
) mode
);
425 if (!targetm
.scalar_mode_supported_p ((machine_mode
) mode
))
428 /* Only let float, double, long double and __float128 go through.
429 Runtime support for others is not provided, so they would be
431 if (!targetm
.libgcc_floating_mode_supported_p ((machine_mode
)
434 if (mode
!= TYPE_MODE (float_type_node
)
435 && (mode
!= TYPE_MODE (double_type_node
))
436 && (mode
!= TYPE_MODE (long_double_type_node
))
437 #if defined(HAVE_TFmode) && defined(ENABLE_LIBQUADMATH_SUPPORT)
443 /* Let the kind equal the precision divided by 8, rounding up. Again,
444 this insulates the programmer from the underlying byte size.
446 Also, it effectively deals with IEEE extended formats. There, the
447 total size of the type may equal 16, but it's got 6 bytes of padding
448 and the increased size can get in the way of a real IEEE quad format
449 which may also be supported by the target.
451 We round up so as to handle IA-64 __floatreg (RFmode), which is an
452 82 bit type. Not to be confused with __float80 (XFmode), which is
453 an 80 bit type also supported by IA-64. So XFmode should come out
454 to be kind=10, and RFmode should come out to be kind=11. Egads. */
456 kind
= (GET_MODE_PRECISION (mode
) + 7) / 8;
467 /* Careful we don't stumble a weird internal mode. */
468 gcc_assert (r_index
<= 0 || gfc_real_kinds
[r_index
-1].kind
!= kind
);
469 /* Or have too many modes for the allocated space. */
470 gcc_assert (r_index
!= MAX_REAL_KINDS
);
472 gfc_real_kinds
[r_index
].kind
= kind
;
473 gfc_real_kinds
[r_index
].radix
= fmt
->b
;
474 gfc_real_kinds
[r_index
].digits
= fmt
->p
;
475 gfc_real_kinds
[r_index
].min_exponent
= fmt
->emin
;
476 gfc_real_kinds
[r_index
].max_exponent
= fmt
->emax
;
477 if (fmt
->pnan
< fmt
->p
)
478 /* This is an IBM extended double format (or the MIPS variant)
479 made up of two IEEE doubles. The value of the long double is
480 the sum of the values of the two parts. The most significant
481 part is required to be the value of the long double rounded
482 to the nearest double. If we use emax of 1024 then we can't
483 represent huge(x) = (1 - b**(-p)) * b**(emax-1) * b, because
484 rounding will make the most significant part overflow. */
485 gfc_real_kinds
[r_index
].max_exponent
= fmt
->emax
- 1;
486 gfc_real_kinds
[r_index
].mode_precision
= GET_MODE_PRECISION (mode
);
490 /* Choose the default integer kind. We choose 4 unless the user directs us
491 otherwise. Even if the user specified that the default integer kind is 8,
492 the numeric storage size is not 64 bits. In this case, a warning will be
493 issued when NUMERIC_STORAGE_SIZE is used. Set NUMERIC_STORAGE_SIZE to 32. */
495 gfc_numeric_storage_size
= 4 * 8;
497 if (flag_default_integer
)
500 gfc_fatal_error ("INTEGER(KIND=8) is not available for "
501 "%<-fdefault-integer-8%> option");
503 gfc_default_integer_kind
= 8;
506 else if (flag_integer4_kind
== 8)
509 gfc_fatal_error ("INTEGER(KIND=8) is not available for "
510 "%<-finteger-4-integer-8%> option");
512 gfc_default_integer_kind
= 8;
516 gfc_default_integer_kind
= 4;
520 gfc_default_integer_kind
= gfc_integer_kinds
[i_index
- 1].kind
;
521 gfc_numeric_storage_size
= gfc_integer_kinds
[i_index
- 1].bit_size
;
524 /* Choose the default real kind. Again, we choose 4 when possible. */
525 if (flag_default_real
)
528 gfc_fatal_error ("REAL(KIND=8) is not available for "
529 "%<-fdefault-real-8%> option");
531 gfc_default_real_kind
= 8;
533 else if (flag_real4_kind
== 8)
536 gfc_fatal_error ("REAL(KIND=8) is not available for %<-freal-4-real-8%> "
539 gfc_default_real_kind
= 8;
541 else if (flag_real4_kind
== 10)
544 gfc_fatal_error ("REAL(KIND=10) is not available for "
545 "%<-freal-4-real-10%> option");
547 gfc_default_real_kind
= 10;
549 else if (flag_real4_kind
== 16)
552 gfc_fatal_error ("REAL(KIND=16) is not available for "
553 "%<-freal-4-real-16%> option");
555 gfc_default_real_kind
= 16;
558 gfc_default_real_kind
= 4;
560 gfc_default_real_kind
= gfc_real_kinds
[0].kind
;
562 /* Choose the default double kind. If -fdefault-real and -fdefault-double
563 are specified, we use kind=8, if it's available. If -fdefault-real is
564 specified without -fdefault-double, we use kind=16, if it's available.
565 Otherwise we do not change anything. */
566 if (flag_default_double
&& !flag_default_real
)
567 gfc_fatal_error ("Use of %<-fdefault-double-8%> requires "
568 "%<-fdefault-real-8%>");
570 if (flag_default_real
&& flag_default_double
&& saw_r8
)
571 gfc_default_double_kind
= 8;
572 else if (flag_default_real
&& saw_r16
)
573 gfc_default_double_kind
= 16;
574 else if (flag_real8_kind
== 4)
577 gfc_fatal_error ("REAL(KIND=4) is not available for "
578 "%<-freal-8-real-4%> option");
580 gfc_default_double_kind
= 4;
582 else if (flag_real8_kind
== 10 )
585 gfc_fatal_error ("REAL(KIND=10) is not available for "
586 "%<-freal-8-real-10%> option");
588 gfc_default_double_kind
= 10;
590 else if (flag_real8_kind
== 16 )
593 gfc_fatal_error ("REAL(KIND=10) is not available for "
594 "%<-freal-8-real-16%> option");
596 gfc_default_double_kind
= 16;
598 else if (saw_r4
&& saw_r8
)
599 gfc_default_double_kind
= 8;
602 /* F95 14.6.3.1: A nonpointer scalar object of type double precision
603 real ... occupies two contiguous numeric storage units.
605 Therefore we must be supplied a kind twice as large as we chose
606 for single precision. There are loopholes, in that double
607 precision must *occupy* two storage units, though it doesn't have
608 to *use* two storage units. Which means that you can make this
609 kind artificially wide by padding it. But at present there are
610 no GCC targets for which a two-word type does not exist, so we
611 just let gfc_validate_kind abort and tell us if something breaks. */
613 gfc_default_double_kind
614 = gfc_validate_kind (BT_REAL
, gfc_default_real_kind
* 2, false);
617 /* The default logical kind is constrained to be the same as the
618 default integer kind. Similarly with complex and real. */
619 gfc_default_logical_kind
= gfc_default_integer_kind
;
620 gfc_default_complex_kind
= gfc_default_real_kind
;
622 /* We only have two character kinds: ASCII and UCS-4.
623 ASCII corresponds to a 8-bit integer type, if one is available.
624 UCS-4 corresponds to a 32-bit integer type, if one is available. */
626 if ((kind
= get_int_kind_from_width (8)) > 0)
628 gfc_character_kinds
[i_index
].kind
= kind
;
629 gfc_character_kinds
[i_index
].bit_size
= 8;
630 gfc_character_kinds
[i_index
].name
= "ascii";
633 if ((kind
= get_int_kind_from_width (32)) > 0)
635 gfc_character_kinds
[i_index
].kind
= kind
;
636 gfc_character_kinds
[i_index
].bit_size
= 32;
637 gfc_character_kinds
[i_index
].name
= "iso_10646";
641 /* Choose the smallest integer kind for our default character. */
642 gfc_default_character_kind
= gfc_character_kinds
[0].kind
;
643 gfc_character_storage_size
= gfc_default_character_kind
* 8;
645 gfc_index_integer_kind
= get_int_kind_from_name (PTRDIFF_TYPE
);
647 /* Pick a kind the same size as the C "int" type. */
648 gfc_c_int_kind
= INT_TYPE_SIZE
/ 8;
650 /* Choose atomic kinds to match C's int. */
651 gfc_atomic_int_kind
= gfc_c_int_kind
;
652 gfc_atomic_logical_kind
= gfc_c_int_kind
;
656 /* Make sure that a valid kind is present. Returns an index into the
657 associated kinds array, -1 if the kind is not present. */
660 validate_integer (int kind
)
664 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
665 if (gfc_integer_kinds
[i
].kind
== kind
)
672 validate_real (int kind
)
676 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
677 if (gfc_real_kinds
[i
].kind
== kind
)
684 validate_logical (int kind
)
688 for (i
= 0; gfc_logical_kinds
[i
].kind
; i
++)
689 if (gfc_logical_kinds
[i
].kind
== kind
)
696 validate_character (int kind
)
700 for (i
= 0; gfc_character_kinds
[i
].kind
; i
++)
701 if (gfc_character_kinds
[i
].kind
== kind
)
707 /* Validate a kind given a basic type. The return value is the same
708 for the child functions, with -1 indicating nonexistence of the
709 type. If MAY_FAIL is false, then -1 is never returned, and we ICE. */
712 gfc_validate_kind (bt type
, int kind
, bool may_fail
)
718 case BT_REAL
: /* Fall through */
720 rc
= validate_real (kind
);
723 rc
= validate_integer (kind
);
726 rc
= validate_logical (kind
);
729 rc
= validate_character (kind
);
733 gfc_internal_error ("gfc_validate_kind(): Got bad type");
736 if (rc
< 0 && !may_fail
)
737 gfc_internal_error ("gfc_validate_kind(): Got bad kind");
743 /* Four subroutines of gfc_init_types. Create type nodes for the given kind.
744 Reuse common type nodes where possible. Recognize if the kind matches up
745 with a C type. This will be used later in determining which routines may
746 be scarfed from libm. */
749 gfc_build_int_type (gfc_integer_info
*info
)
751 int mode_precision
= info
->bit_size
;
753 if (mode_precision
== CHAR_TYPE_SIZE
)
755 if (mode_precision
== SHORT_TYPE_SIZE
)
757 if (mode_precision
== INT_TYPE_SIZE
)
759 if (mode_precision
== LONG_TYPE_SIZE
)
761 if (mode_precision
== LONG_LONG_TYPE_SIZE
)
762 info
->c_long_long
= 1;
764 if (TYPE_PRECISION (intQI_type_node
) == mode_precision
)
765 return intQI_type_node
;
766 if (TYPE_PRECISION (intHI_type_node
) == mode_precision
)
767 return intHI_type_node
;
768 if (TYPE_PRECISION (intSI_type_node
) == mode_precision
)
769 return intSI_type_node
;
770 if (TYPE_PRECISION (intDI_type_node
) == mode_precision
)
771 return intDI_type_node
;
772 if (TYPE_PRECISION (intTI_type_node
) == mode_precision
)
773 return intTI_type_node
;
775 return make_signed_type (mode_precision
);
779 gfc_build_uint_type (int size
)
781 if (size
== CHAR_TYPE_SIZE
)
782 return unsigned_char_type_node
;
783 if (size
== SHORT_TYPE_SIZE
)
784 return short_unsigned_type_node
;
785 if (size
== INT_TYPE_SIZE
)
786 return unsigned_type_node
;
787 if (size
== LONG_TYPE_SIZE
)
788 return long_unsigned_type_node
;
789 if (size
== LONG_LONG_TYPE_SIZE
)
790 return long_long_unsigned_type_node
;
792 return make_unsigned_type (size
);
797 gfc_build_real_type (gfc_real_info
*info
)
799 int mode_precision
= info
->mode_precision
;
802 if (mode_precision
== FLOAT_TYPE_SIZE
)
804 if (mode_precision
== DOUBLE_TYPE_SIZE
)
806 if (mode_precision
== LONG_DOUBLE_TYPE_SIZE
)
807 info
->c_long_double
= 1;
808 if (mode_precision
!= LONG_DOUBLE_TYPE_SIZE
&& mode_precision
== 128)
810 info
->c_float128
= 1;
811 gfc_real16_is_float128
= true;
814 if (TYPE_PRECISION (float_type_node
) == mode_precision
)
815 return float_type_node
;
816 if (TYPE_PRECISION (double_type_node
) == mode_precision
)
817 return double_type_node
;
818 if (TYPE_PRECISION (long_double_type_node
) == mode_precision
)
819 return long_double_type_node
;
821 new_type
= make_node (REAL_TYPE
);
822 TYPE_PRECISION (new_type
) = mode_precision
;
823 layout_type (new_type
);
828 gfc_build_complex_type (tree scalar_type
)
832 if (scalar_type
== NULL
)
834 if (scalar_type
== float_type_node
)
835 return complex_float_type_node
;
836 if (scalar_type
== double_type_node
)
837 return complex_double_type_node
;
838 if (scalar_type
== long_double_type_node
)
839 return complex_long_double_type_node
;
841 new_type
= make_node (COMPLEX_TYPE
);
842 TREE_TYPE (new_type
) = scalar_type
;
843 layout_type (new_type
);
848 gfc_build_logical_type (gfc_logical_info
*info
)
850 int bit_size
= info
->bit_size
;
853 if (bit_size
== BOOL_TYPE_SIZE
)
856 return boolean_type_node
;
859 new_type
= make_unsigned_type (bit_size
);
860 TREE_SET_CODE (new_type
, BOOLEAN_TYPE
);
861 TYPE_MAX_VALUE (new_type
) = build_int_cst (new_type
, 1);
862 TYPE_PRECISION (new_type
) = 1;
868 /* Create the backend type nodes. We map them to their
869 equivalent C type, at least for now. We also give
870 names to the types here, and we push them in the
871 global binding level context.*/
874 gfc_init_types (void)
881 /* Create and name the types. */
882 #define PUSH_TYPE(name, node) \
883 pushdecl (build_decl (input_location, \
884 TYPE_DECL, get_identifier (name), node))
886 for (index
= 0; gfc_integer_kinds
[index
].kind
!= 0; ++index
)
888 type
= gfc_build_int_type (&gfc_integer_kinds
[index
]);
889 /* Ensure integer(kind=1) doesn't have TYPE_STRING_FLAG set. */
890 if (TYPE_STRING_FLAG (type
))
891 type
= make_signed_type (gfc_integer_kinds
[index
].bit_size
);
892 gfc_integer_types
[index
] = type
;
893 snprintf (name_buf
, sizeof(name_buf
), "integer(kind=%d)",
894 gfc_integer_kinds
[index
].kind
);
895 PUSH_TYPE (name_buf
, type
);
898 for (index
= 0; gfc_logical_kinds
[index
].kind
!= 0; ++index
)
900 type
= gfc_build_logical_type (&gfc_logical_kinds
[index
]);
901 gfc_logical_types
[index
] = type
;
902 snprintf (name_buf
, sizeof(name_buf
), "logical(kind=%d)",
903 gfc_logical_kinds
[index
].kind
);
904 PUSH_TYPE (name_buf
, type
);
907 for (index
= 0; gfc_real_kinds
[index
].kind
!= 0; index
++)
909 type
= gfc_build_real_type (&gfc_real_kinds
[index
]);
910 gfc_real_types
[index
] = type
;
911 snprintf (name_buf
, sizeof(name_buf
), "real(kind=%d)",
912 gfc_real_kinds
[index
].kind
);
913 PUSH_TYPE (name_buf
, type
);
915 if (gfc_real_kinds
[index
].c_float128
)
916 float128_type_node
= type
;
918 type
= gfc_build_complex_type (type
);
919 gfc_complex_types
[index
] = type
;
920 snprintf (name_buf
, sizeof(name_buf
), "complex(kind=%d)",
921 gfc_real_kinds
[index
].kind
);
922 PUSH_TYPE (name_buf
, type
);
924 if (gfc_real_kinds
[index
].c_float128
)
925 complex_float128_type_node
= type
;
928 for (index
= 0; gfc_character_kinds
[index
].kind
!= 0; ++index
)
930 type
= gfc_build_uint_type (gfc_character_kinds
[index
].bit_size
);
931 type
= build_qualified_type (type
, TYPE_UNQUALIFIED
);
932 snprintf (name_buf
, sizeof(name_buf
), "character(kind=%d)",
933 gfc_character_kinds
[index
].kind
);
934 PUSH_TYPE (name_buf
, type
);
935 gfc_character_types
[index
] = type
;
936 gfc_pcharacter_types
[index
] = build_pointer_type (type
);
938 gfc_character1_type_node
= gfc_character_types
[0];
940 PUSH_TYPE ("byte", unsigned_char_type_node
);
941 PUSH_TYPE ("void", void_type_node
);
943 /* DBX debugging output gets upset if these aren't set. */
944 if (!TYPE_NAME (integer_type_node
))
945 PUSH_TYPE ("c_integer", integer_type_node
);
946 if (!TYPE_NAME (char_type_node
))
947 PUSH_TYPE ("c_char", char_type_node
);
951 pvoid_type_node
= build_pointer_type (void_type_node
);
952 prvoid_type_node
= build_qualified_type (pvoid_type_node
, TYPE_QUAL_RESTRICT
);
953 ppvoid_type_node
= build_pointer_type (pvoid_type_node
);
954 pchar_type_node
= build_pointer_type (gfc_character1_type_node
);
956 = build_pointer_type (build_function_type_list (void_type_node
, NULL_TREE
));
958 gfc_array_index_type
= gfc_get_int_type (gfc_index_integer_kind
);
959 /* We cannot use gfc_index_zero_node in definition of gfc_array_range_type,
960 since this function is called before gfc_init_constants. */
962 = build_range_type (gfc_array_index_type
,
963 build_int_cst (gfc_array_index_type
, 0),
966 /* The maximum array element size that can be handled is determined
967 by the number of bits available to store this field in the array
970 n
= TYPE_PRECISION (gfc_array_index_type
) - GFC_DTYPE_SIZE_SHIFT
;
971 gfc_max_array_element_size
972 = wide_int_to_tree (size_type_node
,
973 wi::mask (n
, UNSIGNED
,
974 TYPE_PRECISION (size_type_node
)));
976 boolean_type_node
= gfc_get_logical_type (gfc_default_logical_kind
);
977 boolean_true_node
= build_int_cst (boolean_type_node
, 1);
978 boolean_false_node
= build_int_cst (boolean_type_node
, 0);
980 /* ??? Shouldn't this be based on gfc_index_integer_kind or so? */
981 gfc_charlen_int_kind
= 4;
982 gfc_charlen_type_node
= gfc_get_int_type (gfc_charlen_int_kind
);
985 /* Get the type node for the given type and kind. */
988 gfc_get_int_type (int kind
)
990 int index
= gfc_validate_kind (BT_INTEGER
, kind
, true);
991 return index
< 0 ? 0 : gfc_integer_types
[index
];
995 gfc_get_real_type (int kind
)
997 int index
= gfc_validate_kind (BT_REAL
, kind
, true);
998 return index
< 0 ? 0 : gfc_real_types
[index
];
1002 gfc_get_complex_type (int kind
)
1004 int index
= gfc_validate_kind (BT_COMPLEX
, kind
, true);
1005 return index
< 0 ? 0 : gfc_complex_types
[index
];
1009 gfc_get_logical_type (int kind
)
1011 int index
= gfc_validate_kind (BT_LOGICAL
, kind
, true);
1012 return index
< 0 ? 0 : gfc_logical_types
[index
];
1016 gfc_get_char_type (int kind
)
1018 int index
= gfc_validate_kind (BT_CHARACTER
, kind
, true);
1019 return index
< 0 ? 0 : gfc_character_types
[index
];
1023 gfc_get_pchar_type (int kind
)
1025 int index
= gfc_validate_kind (BT_CHARACTER
, kind
, true);
1026 return index
< 0 ? 0 : gfc_pcharacter_types
[index
];
1030 /* Create a character type with the given kind and length. */
1033 gfc_get_character_type_len_for_eltype (tree eltype
, tree len
)
1037 bounds
= build_range_type (gfc_charlen_type_node
, gfc_index_one_node
, len
);
1038 type
= build_array_type (eltype
, bounds
);
1039 TYPE_STRING_FLAG (type
) = 1;
1045 gfc_get_character_type_len (int kind
, tree len
)
1047 gfc_validate_kind (BT_CHARACTER
, kind
, false);
1048 return gfc_get_character_type_len_for_eltype (gfc_get_char_type (kind
), len
);
1052 /* Get a type node for a character kind. */
1055 gfc_get_character_type (int kind
, gfc_charlen
* cl
)
1059 len
= (cl
== NULL
) ? NULL_TREE
: cl
->backend_decl
;
1061 return gfc_get_character_type_len (kind
, len
);
1064 /* Covert a basic type. This will be an array for character types. */
1067 gfc_typenode_for_spec (gfc_typespec
* spec
)
1077 /* We use INTEGER(c_intptr_t) for C_PTR and C_FUNPTR once the symbol
1078 has been resolved. This is done so we can convert C_PTR and
1079 C_FUNPTR to simple variables that get translated to (void *). */
1080 if (spec
->f90_type
== BT_VOID
)
1083 && spec
->u
.derived
->intmod_sym_id
== ISOCBINDING_PTR
)
1084 basetype
= ptr_type_node
;
1086 basetype
= pfunc_type_node
;
1089 basetype
= gfc_get_int_type (spec
->kind
);
1093 basetype
= gfc_get_real_type (spec
->kind
);
1097 basetype
= gfc_get_complex_type (spec
->kind
);
1101 basetype
= gfc_get_logical_type (spec
->kind
);
1105 basetype
= gfc_get_character_type (spec
->kind
, spec
->u
.cl
);
1109 /* Since this cannot be used, return a length one character. */
1110 basetype
= gfc_get_character_type_len (gfc_default_character_kind
,
1111 gfc_index_one_node
);
1116 basetype
= gfc_get_derived_type (spec
->u
.derived
);
1118 if (spec
->type
== BT_CLASS
)
1119 GFC_CLASS_TYPE_P (basetype
) = 1;
1121 /* If we're dealing with either C_PTR or C_FUNPTR, we modified the
1122 type and kind to fit a (void *) and the basetype returned was a
1123 ptr_type_node. We need to pass up this new information to the
1124 symbol that was declared of type C_PTR or C_FUNPTR. */
1125 if (spec
->u
.derived
->ts
.f90_type
== BT_VOID
)
1127 spec
->type
= BT_INTEGER
;
1128 spec
->kind
= gfc_index_integer_kind
;
1129 spec
->f90_type
= BT_VOID
;
1134 /* This is for the second arg to c_f_pointer and c_f_procpointer
1135 of the iso_c_binding module, to accept any ptr type. */
1136 basetype
= ptr_type_node
;
1137 if (spec
->f90_type
== BT_VOID
)
1140 && spec
->u
.derived
->intmod_sym_id
== ISOCBINDING_PTR
)
1141 basetype
= ptr_type_node
;
1143 basetype
= pfunc_type_node
;
1152 /* Build an INT_CST for constant expressions, otherwise return NULL_TREE. */
1155 gfc_conv_array_bound (gfc_expr
* expr
)
1157 /* If expr is an integer constant, return that. */
1158 if (expr
!= NULL
&& expr
->expr_type
== EXPR_CONSTANT
)
1159 return gfc_conv_mpz_to_tree (expr
->value
.integer
, gfc_index_integer_kind
);
1161 /* Otherwise return NULL. */
1165 /* Return the type of an element of the array. Note that scalar coarrays
1166 are special. In particular, for GFC_ARRAY_TYPE_P, the original argument
1167 (with POINTER_TYPE stripped) is returned. */
1170 gfc_get_element_type (tree type
)
1174 if (GFC_ARRAY_TYPE_P (type
))
1176 if (TREE_CODE (type
) == POINTER_TYPE
)
1177 type
= TREE_TYPE (type
);
1178 if (GFC_TYPE_ARRAY_RANK (type
) == 0)
1180 gcc_assert (GFC_TYPE_ARRAY_CORANK (type
) > 0);
1185 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
1186 element
= TREE_TYPE (type
);
1191 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type
));
1192 element
= GFC_TYPE_ARRAY_DATAPTR_TYPE (type
);
1194 gcc_assert (TREE_CODE (element
) == POINTER_TYPE
);
1195 element
= TREE_TYPE (element
);
1197 /* For arrays, which are not scalar coarrays. */
1198 if (TREE_CODE (element
) == ARRAY_TYPE
&& !TYPE_STRING_FLAG (element
))
1199 element
= TREE_TYPE (element
);
1205 /* Build an array. This function is called from gfc_sym_type().
1206 Actually returns array descriptor type.
1208 Format of array descriptors is as follows:
1210 struct gfc_array_descriptor
1215 struct descriptor_dimension dimension[N_DIM];
1218 struct descriptor_dimension
1225 Translation code should use gfc_conv_descriptor_* rather than
1226 accessing the descriptor directly. Any changes to the array
1227 descriptor type will require changes in gfc_conv_descriptor_* and
1228 gfc_build_array_initializer.
1230 This is represented internally as a RECORD_TYPE. The index nodes
1231 are gfc_array_index_type and the data node is a pointer to the
1232 data. See below for the handling of character types.
1234 The dtype member is formatted as follows:
1235 rank = dtype & GFC_DTYPE_RANK_MASK // 3 bits
1236 type = (dtype & GFC_DTYPE_TYPE_MASK) >> GFC_DTYPE_TYPE_SHIFT // 3 bits
1237 size = dtype >> GFC_DTYPE_SIZE_SHIFT
1239 I originally used nested ARRAY_TYPE nodes to represent arrays, but
1240 this generated poor code for assumed/deferred size arrays. These
1241 require use of PLACEHOLDER_EXPR/WITH_RECORD_EXPR, which isn't part
1242 of the GENERIC grammar. Also, there is no way to explicitly set
1243 the array stride, so all data must be packed(1). I've tried to
1244 mark all the functions which would require modification with a GCC
1247 The data component points to the first element in the array. The
1248 offset field is the position of the origin of the array (i.e. element
1249 (0, 0 ...)). This may be outside the bounds of the array.
1251 An element is accessed by
1252 data[offset + index0*stride0 + index1*stride1 + index2*stride2]
1253 This gives good performance as the computation does not involve the
1254 bounds of the array. For packed arrays, this is optimized further
1255 by substituting the known strides.
1257 This system has one problem: all array bounds must be within 2^31
1258 elements of the origin (2^63 on 64-bit machines). For example
1259 integer, dimension (80000:90000, 80000:90000, 2) :: array
1260 may not work properly on 32-bit machines because 80000*80000 >
1261 2^31, so the calculation for stride2 would overflow. This may
1262 still work, but I haven't checked, and it relies on the overflow
1263 doing the right thing.
1265 The way to fix this problem is to access elements as follows:
1266 data[(index0-lbound0)*stride0 + (index1-lbound1)*stride1]
1267 Obviously this is much slower. I will make this a compile time
1268 option, something like -fsmall-array-offsets. Mixing code compiled
1269 with and without this switch will work.
1271 (1) This can be worked around by modifying the upper bound of the
1272 previous dimension. This requires extra fields in the descriptor
1273 (both real_ubound and fake_ubound). */
1276 /* Returns true if the array sym does not require a descriptor. */
1279 gfc_is_nodesc_array (gfc_symbol
* sym
)
1281 symbol_attribute
*array_attr
;
1283 bool is_classarray
= IS_CLASS_ARRAY (sym
);
1285 array_attr
= is_classarray
? &CLASS_DATA (sym
)->attr
: &sym
->attr
;
1286 as
= is_classarray
? CLASS_DATA (sym
)->as
: sym
->as
;
1288 gcc_assert (array_attr
->dimension
|| array_attr
->codimension
);
1290 /* We only want local arrays. */
1291 if ((sym
->ts
.type
!= BT_CLASS
&& sym
->attr
.pointer
)
1292 || (sym
->ts
.type
== BT_CLASS
&& CLASS_DATA (sym
)->attr
.class_pointer
)
1293 || array_attr
->allocatable
)
1296 /* We want a descriptor for associate-name arrays that do not have an
1297 explicitly known shape already. */
1298 if (sym
->assoc
&& as
->type
!= AS_EXPLICIT
)
1301 /* The dummy is stored in sym and not in the component. */
1302 if (sym
->attr
.dummy
)
1303 return as
->type
!= AS_ASSUMED_SHAPE
1304 && as
->type
!= AS_ASSUMED_RANK
;
1306 if (sym
->attr
.result
|| sym
->attr
.function
)
1309 gcc_assert (as
->type
== AS_EXPLICIT
|| as
->cp_was_assumed
);
1315 /* Create an array descriptor type. */
1318 gfc_build_array_type (tree type
, gfc_array_spec
* as
,
1319 enum gfc_array_kind akind
, bool restricted
,
1322 tree lbound
[GFC_MAX_DIMENSIONS
];
1323 tree ubound
[GFC_MAX_DIMENSIONS
];
1326 /* Assumed-shape arrays do not have codimension information stored in the
1328 corank
= as
->corank
;
1329 if (as
->type
== AS_ASSUMED_SHAPE
||
1330 (as
->type
== AS_ASSUMED_RANK
&& akind
== GFC_ARRAY_ALLOCATABLE
))
1333 if (as
->type
== AS_ASSUMED_RANK
)
1334 for (n
= 0; n
< GFC_MAX_DIMENSIONS
; n
++)
1336 lbound
[n
] = NULL_TREE
;
1337 ubound
[n
] = NULL_TREE
;
1340 for (n
= 0; n
< as
->rank
; n
++)
1342 /* Create expressions for the known bounds of the array. */
1343 if (as
->type
== AS_ASSUMED_SHAPE
&& as
->lower
[n
] == NULL
)
1344 lbound
[n
] = gfc_index_one_node
;
1346 lbound
[n
] = gfc_conv_array_bound (as
->lower
[n
]);
1347 ubound
[n
] = gfc_conv_array_bound (as
->upper
[n
]);
1350 for (n
= as
->rank
; n
< as
->rank
+ corank
; n
++)
1352 if (as
->type
!= AS_DEFERRED
&& as
->lower
[n
] == NULL
)
1353 lbound
[n
] = gfc_index_one_node
;
1355 lbound
[n
] = gfc_conv_array_bound (as
->lower
[n
]);
1357 if (n
< as
->rank
+ corank
- 1)
1358 ubound
[n
] = gfc_conv_array_bound (as
->upper
[n
]);
1361 if (as
->type
== AS_ASSUMED_SHAPE
)
1362 akind
= contiguous
? GFC_ARRAY_ASSUMED_SHAPE_CONT
1363 : GFC_ARRAY_ASSUMED_SHAPE
;
1364 else if (as
->type
== AS_ASSUMED_RANK
)
1365 akind
= contiguous
? GFC_ARRAY_ASSUMED_RANK_CONT
1366 : GFC_ARRAY_ASSUMED_RANK
;
1367 return gfc_get_array_type_bounds (type
, as
->rank
== -1
1368 ? GFC_MAX_DIMENSIONS
: as
->rank
,
1370 ubound
, 0, akind
, restricted
);
1373 /* Returns the struct descriptor_dimension type. */
1376 gfc_get_desc_dim_type (void)
1379 tree decl
, *chain
= NULL
;
1381 if (gfc_desc_dim_type
)
1382 return gfc_desc_dim_type
;
1384 /* Build the type node. */
1385 type
= make_node (RECORD_TYPE
);
1387 TYPE_NAME (type
) = get_identifier ("descriptor_dimension");
1388 TYPE_PACKED (type
) = 1;
1390 /* Consists of the stride, lbound and ubound members. */
1391 decl
= gfc_add_field_to_struct_1 (type
,
1392 get_identifier ("stride"),
1393 gfc_array_index_type
, &chain
);
1394 TREE_NO_WARNING (decl
) = 1;
1396 decl
= gfc_add_field_to_struct_1 (type
,
1397 get_identifier ("lbound"),
1398 gfc_array_index_type
, &chain
);
1399 TREE_NO_WARNING (decl
) = 1;
1401 decl
= gfc_add_field_to_struct_1 (type
,
1402 get_identifier ("ubound"),
1403 gfc_array_index_type
, &chain
);
1404 TREE_NO_WARNING (decl
) = 1;
1406 /* Finish off the type. */
1407 gfc_finish_type (type
);
1408 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
)) = 1;
1410 gfc_desc_dim_type
= type
;
1415 /* Return the DTYPE for an array. This describes the type and type parameters
1417 /* TODO: Only call this when the value is actually used, and make all the
1418 unknown cases abort. */
1421 gfc_get_dtype_rank_type (int rank
, tree etype
)
1429 switch (TREE_CODE (etype
))
1447 /* We will never have arrays of arrays. */
1461 /* TODO: Don't do dtype for temporary descriptorless arrays. */
1462 /* We can strange array types for temporary arrays. */
1463 return gfc_index_zero_node
;
1466 gcc_assert (rank
<= GFC_DTYPE_RANK_MASK
);
1467 size
= TYPE_SIZE_UNIT (etype
);
1469 i
= rank
| (n
<< GFC_DTYPE_TYPE_SHIFT
);
1470 if (size
&& INTEGER_CST_P (size
))
1472 if (tree_int_cst_lt (gfc_max_array_element_size
, size
))
1473 gfc_fatal_error ("Array element size too big at %C");
1475 i
+= TREE_INT_CST_LOW (size
) << GFC_DTYPE_SIZE_SHIFT
;
1477 dtype
= build_int_cst (gfc_array_index_type
, i
);
1479 if (size
&& !INTEGER_CST_P (size
))
1481 tmp
= build_int_cst (gfc_array_index_type
, GFC_DTYPE_SIZE_SHIFT
);
1482 tmp
= fold_build2_loc (input_location
, LSHIFT_EXPR
,
1483 gfc_array_index_type
,
1484 fold_convert (gfc_array_index_type
, size
), tmp
);
1485 dtype
= fold_build2_loc (input_location
, PLUS_EXPR
, gfc_array_index_type
,
1488 /* If we don't know the size we leave it as zero. This should never happen
1489 for anything that is actually used. */
1490 /* TODO: Check this is actually true, particularly when repacking
1491 assumed size parameters. */
1498 gfc_get_dtype (tree type
)
1504 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type
) || GFC_ARRAY_TYPE_P (type
));
1506 if (GFC_TYPE_ARRAY_DTYPE (type
))
1507 return GFC_TYPE_ARRAY_DTYPE (type
);
1509 rank
= GFC_TYPE_ARRAY_RANK (type
);
1510 etype
= gfc_get_element_type (type
);
1511 dtype
= gfc_get_dtype_rank_type (rank
, etype
);
1513 GFC_TYPE_ARRAY_DTYPE (type
) = dtype
;
1518 /* Build an array type for use without a descriptor, packed according
1519 to the value of PACKED. */
1522 gfc_get_nodesc_array_type (tree etype
, gfc_array_spec
* as
, gfc_packed packed
,
1536 mpz_init_set_ui (offset
, 0);
1537 mpz_init_set_ui (stride
, 1);
1540 /* We don't use build_array_type because this does not include include
1541 lang-specific information (i.e. the bounds of the array) when checking
1544 type
= make_node (ARRAY_TYPE
);
1546 type
= build_variant_type_copy (etype
);
1548 GFC_ARRAY_TYPE_P (type
) = 1;
1549 TYPE_LANG_SPECIFIC (type
) = ggc_cleared_alloc
<struct lang_type
> ();
1551 known_stride
= (packed
!= PACKED_NO
);
1553 for (n
= 0; n
< as
->rank
; n
++)
1555 /* Fill in the stride and bound components of the type. */
1557 tmp
= gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1560 GFC_TYPE_ARRAY_STRIDE (type
, n
) = tmp
;
1562 expr
= as
->lower
[n
];
1563 if (expr
->expr_type
== EXPR_CONSTANT
)
1565 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1566 gfc_index_integer_kind
);
1573 GFC_TYPE_ARRAY_LBOUND (type
, n
) = tmp
;
1577 /* Calculate the offset. */
1578 mpz_mul (delta
, stride
, as
->lower
[n
]->value
.integer
);
1579 mpz_sub (offset
, offset
, delta
);
1584 expr
= as
->upper
[n
];
1585 if (expr
&& expr
->expr_type
== EXPR_CONSTANT
)
1587 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1588 gfc_index_integer_kind
);
1595 GFC_TYPE_ARRAY_UBOUND (type
, n
) = tmp
;
1599 /* Calculate the stride. */
1600 mpz_sub (delta
, as
->upper
[n
]->value
.integer
,
1601 as
->lower
[n
]->value
.integer
);
1602 mpz_add_ui (delta
, delta
, 1);
1603 mpz_mul (stride
, stride
, delta
);
1606 /* Only the first stride is known for partial packed arrays. */
1607 if (packed
== PACKED_NO
|| packed
== PACKED_PARTIAL
)
1610 for (n
= as
->rank
; n
< as
->rank
+ as
->corank
; n
++)
1612 expr
= as
->lower
[n
];
1613 if (expr
->expr_type
== EXPR_CONSTANT
)
1614 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1615 gfc_index_integer_kind
);
1618 GFC_TYPE_ARRAY_LBOUND (type
, n
) = tmp
;
1620 expr
= as
->upper
[n
];
1621 if (expr
&& expr
->expr_type
== EXPR_CONSTANT
)
1622 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1623 gfc_index_integer_kind
);
1626 if (n
< as
->rank
+ as
->corank
- 1)
1627 GFC_TYPE_ARRAY_UBOUND (type
, n
) = tmp
;
1632 GFC_TYPE_ARRAY_OFFSET (type
) =
1633 gfc_conv_mpz_to_tree (offset
, gfc_index_integer_kind
);
1636 GFC_TYPE_ARRAY_OFFSET (type
) = NULL_TREE
;
1640 GFC_TYPE_ARRAY_SIZE (type
) =
1641 gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1644 GFC_TYPE_ARRAY_SIZE (type
) = NULL_TREE
;
1646 GFC_TYPE_ARRAY_RANK (type
) = as
->rank
;
1647 GFC_TYPE_ARRAY_CORANK (type
) = as
->corank
;
1648 GFC_TYPE_ARRAY_DTYPE (type
) = NULL_TREE
;
1649 range
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
1651 /* TODO: use main type if it is unbounded. */
1652 GFC_TYPE_ARRAY_DATAPTR_TYPE (type
) =
1653 build_pointer_type (build_array_type (etype
, range
));
1655 GFC_TYPE_ARRAY_DATAPTR_TYPE (type
) =
1656 build_qualified_type (GFC_TYPE_ARRAY_DATAPTR_TYPE (type
),
1657 TYPE_QUAL_RESTRICT
);
1661 if (packed
!= PACKED_STATIC
|| flag_coarray
== GFC_FCOARRAY_LIB
)
1663 type
= build_pointer_type (type
);
1666 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
1668 GFC_ARRAY_TYPE_P (type
) = 1;
1669 TYPE_LANG_SPECIFIC (type
) = TYPE_LANG_SPECIFIC (TREE_TYPE (type
));
1677 mpz_sub_ui (stride
, stride
, 1);
1678 range
= gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1683 range
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
, range
);
1684 TYPE_DOMAIN (type
) = range
;
1686 build_pointer_type (etype
);
1687 TREE_TYPE (type
) = etype
;
1695 /* Represent packed arrays as multi-dimensional if they have rank >
1696 1 and with proper bounds, instead of flat arrays. This makes for
1697 better debug info. */
1700 tree gtype
= etype
, rtype
, type_decl
;
1702 for (n
= as
->rank
- 1; n
>= 0; n
--)
1704 rtype
= build_range_type (gfc_array_index_type
,
1705 GFC_TYPE_ARRAY_LBOUND (type
, n
),
1706 GFC_TYPE_ARRAY_UBOUND (type
, n
));
1707 gtype
= build_array_type (gtype
, rtype
);
1709 TYPE_NAME (type
) = type_decl
= build_decl (input_location
,
1710 TYPE_DECL
, NULL
, gtype
);
1711 DECL_ORIGINAL_TYPE (type_decl
) = gtype
;
1714 if (packed
!= PACKED_STATIC
|| !known_stride
1715 || (as
->corank
&& flag_coarray
== GFC_FCOARRAY_LIB
))
1717 /* For dummy arrays and automatic (heap allocated) arrays we
1718 want a pointer to the array. */
1719 type
= build_pointer_type (type
);
1721 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
1722 GFC_ARRAY_TYPE_P (type
) = 1;
1723 TYPE_LANG_SPECIFIC (type
) = TYPE_LANG_SPECIFIC (TREE_TYPE (type
));
1729 /* Return or create the base type for an array descriptor. */
1732 gfc_get_array_descriptor_base (int dimen
, int codimen
, bool restricted
,
1733 enum gfc_array_kind akind
)
1735 tree fat_type
, decl
, arraytype
, *chain
= NULL
;
1736 char name
[16 + 2*GFC_RANK_DIGITS
+ 1 + 1];
1739 /* Assumed-rank array. */
1741 dimen
= GFC_MAX_DIMENSIONS
;
1743 idx
= 2 * (codimen
+ dimen
) + restricted
;
1745 gcc_assert (codimen
+ dimen
>= 0 && codimen
+ dimen
<= GFC_MAX_DIMENSIONS
);
1747 if (flag_coarray
== GFC_FCOARRAY_LIB
&& codimen
)
1749 if (gfc_array_descriptor_base_caf
[idx
])
1750 return gfc_array_descriptor_base_caf
[idx
];
1752 else if (gfc_array_descriptor_base
[idx
])
1753 return gfc_array_descriptor_base
[idx
];
1755 /* Build the type node. */
1756 fat_type
= make_node (RECORD_TYPE
);
1758 sprintf (name
, "array_descriptor" GFC_RANK_PRINTF_FORMAT
, dimen
+ codimen
);
1759 TYPE_NAME (fat_type
) = get_identifier (name
);
1760 TYPE_NAMELESS (fat_type
) = 1;
1762 /* Add the data member as the first element of the descriptor. */
1763 decl
= gfc_add_field_to_struct_1 (fat_type
,
1764 get_identifier ("data"),
1767 : ptr_type_node
), &chain
);
1769 /* Add the base component. */
1770 decl
= gfc_add_field_to_struct_1 (fat_type
,
1771 get_identifier ("offset"),
1772 gfc_array_index_type
, &chain
);
1773 TREE_NO_WARNING (decl
) = 1;
1775 /* Add the dtype component. */
1776 decl
= gfc_add_field_to_struct_1 (fat_type
,
1777 get_identifier ("dtype"),
1778 gfc_array_index_type
, &chain
);
1779 TREE_NO_WARNING (decl
) = 1;
1781 /* Build the array type for the stride and bound components. */
1782 if (dimen
+ codimen
> 0)
1785 build_array_type (gfc_get_desc_dim_type (),
1786 build_range_type (gfc_array_index_type
,
1787 gfc_index_zero_node
,
1788 gfc_rank_cst
[codimen
+ dimen
- 1]));
1790 decl
= gfc_add_field_to_struct_1 (fat_type
, get_identifier ("dim"),
1792 TREE_NO_WARNING (decl
) = 1;
1795 if (flag_coarray
== GFC_FCOARRAY_LIB
&& codimen
1796 && akind
== GFC_ARRAY_ALLOCATABLE
)
1798 decl
= gfc_add_field_to_struct_1 (fat_type
,
1799 get_identifier ("token"),
1800 prvoid_type_node
, &chain
);
1801 TREE_NO_WARNING (decl
) = 1;
1804 /* Finish off the type. */
1805 gfc_finish_type (fat_type
);
1806 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (fat_type
)) = 1;
1808 if (flag_coarray
== GFC_FCOARRAY_LIB
&& codimen
1809 && akind
== GFC_ARRAY_ALLOCATABLE
)
1810 gfc_array_descriptor_base_caf
[idx
] = fat_type
;
1812 gfc_array_descriptor_base
[idx
] = fat_type
;
1818 /* Build an array (descriptor) type with given bounds. */
1821 gfc_get_array_type_bounds (tree etype
, int dimen
, int codimen
, tree
* lbound
,
1822 tree
* ubound
, int packed
,
1823 enum gfc_array_kind akind
, bool restricted
)
1825 char name
[8 + 2*GFC_RANK_DIGITS
+ 1 + GFC_MAX_SYMBOL_LEN
];
1826 tree fat_type
, base_type
, arraytype
, lower
, upper
, stride
, tmp
, rtype
;
1827 const char *type_name
;
1830 base_type
= gfc_get_array_descriptor_base (dimen
, codimen
, restricted
, akind
);
1831 fat_type
= build_distinct_type_copy (base_type
);
1832 /* Make sure that nontarget and target array type have the same canonical
1833 type (and same stub decl for debug info). */
1834 base_type
= gfc_get_array_descriptor_base (dimen
, codimen
, false, akind
);
1835 TYPE_CANONICAL (fat_type
) = base_type
;
1836 TYPE_STUB_DECL (fat_type
) = TYPE_STUB_DECL (base_type
);
1838 tmp
= TYPE_NAME (etype
);
1839 if (tmp
&& TREE_CODE (tmp
) == TYPE_DECL
)
1840 tmp
= DECL_NAME (tmp
);
1842 type_name
= IDENTIFIER_POINTER (tmp
);
1844 type_name
= "unknown";
1845 sprintf (name
, "array" GFC_RANK_PRINTF_FORMAT
"_%.*s", dimen
+ codimen
,
1846 GFC_MAX_SYMBOL_LEN
, type_name
);
1847 TYPE_NAME (fat_type
) = get_identifier (name
);
1848 TYPE_NAMELESS (fat_type
) = 1;
1850 GFC_DESCRIPTOR_TYPE_P (fat_type
) = 1;
1851 TYPE_LANG_SPECIFIC (fat_type
) = ggc_cleared_alloc
<struct lang_type
> ();
1853 GFC_TYPE_ARRAY_RANK (fat_type
) = dimen
;
1854 GFC_TYPE_ARRAY_CORANK (fat_type
) = codimen
;
1855 GFC_TYPE_ARRAY_DTYPE (fat_type
) = NULL_TREE
;
1856 GFC_TYPE_ARRAY_AKIND (fat_type
) = akind
;
1858 /* Build an array descriptor record type. */
1860 stride
= gfc_index_one_node
;
1863 for (n
= 0; n
< dimen
+ codimen
; n
++)
1866 GFC_TYPE_ARRAY_STRIDE (fat_type
, n
) = stride
;
1873 if (lower
!= NULL_TREE
)
1875 if (INTEGER_CST_P (lower
))
1876 GFC_TYPE_ARRAY_LBOUND (fat_type
, n
) = lower
;
1881 if (codimen
&& n
== dimen
+ codimen
- 1)
1885 if (upper
!= NULL_TREE
)
1887 if (INTEGER_CST_P (upper
))
1888 GFC_TYPE_ARRAY_UBOUND (fat_type
, n
) = upper
;
1896 if (upper
!= NULL_TREE
&& lower
!= NULL_TREE
&& stride
!= NULL_TREE
)
1898 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
1899 gfc_array_index_type
, upper
, lower
);
1900 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
,
1901 gfc_array_index_type
, tmp
,
1902 gfc_index_one_node
);
1903 stride
= fold_build2_loc (input_location
, MULT_EXPR
,
1904 gfc_array_index_type
, tmp
, stride
);
1905 /* Check the folding worked. */
1906 gcc_assert (INTEGER_CST_P (stride
));
1911 GFC_TYPE_ARRAY_SIZE (fat_type
) = stride
;
1913 /* TODO: known offsets for descriptors. */
1914 GFC_TYPE_ARRAY_OFFSET (fat_type
) = NULL_TREE
;
1918 arraytype
= build_pointer_type (etype
);
1920 arraytype
= build_qualified_type (arraytype
, TYPE_QUAL_RESTRICT
);
1922 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type
) = arraytype
;
1926 /* We define data as an array with the correct size if possible.
1927 Much better than doing pointer arithmetic. */
1929 rtype
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
1930 int_const_binop (MINUS_EXPR
, stride
,
1931 build_int_cst (TREE_TYPE (stride
), 1)));
1933 rtype
= gfc_array_range_type
;
1934 arraytype
= build_array_type (etype
, rtype
);
1935 arraytype
= build_pointer_type (arraytype
);
1937 arraytype
= build_qualified_type (arraytype
, TYPE_QUAL_RESTRICT
);
1938 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type
) = arraytype
;
1940 /* This will generate the base declarations we need to emit debug
1941 information for this type. FIXME: there must be a better way to
1942 avoid divergence between compilations with and without debug
1945 struct array_descr_info info
;
1946 gfc_get_array_descr_info (fat_type
, &info
);
1947 gfc_get_array_descr_info (build_pointer_type (fat_type
), &info
);
1953 /* Build a pointer type. This function is called from gfc_sym_type(). */
1956 gfc_build_pointer_type (gfc_symbol
* sym
, tree type
)
1958 /* Array pointer types aren't actually pointers. */
1959 if (sym
->attr
.dimension
)
1962 return build_pointer_type (type
);
1965 static tree
gfc_nonrestricted_type (tree t
);
1966 /* Given two record or union type nodes TO and FROM, ensure
1967 that all fields in FROM have a corresponding field in TO,
1968 their type being nonrestrict variants. This accepts a TO
1969 node that already has a prefix of the fields in FROM. */
1971 mirror_fields (tree to
, tree from
)
1976 /* Forward to the end of TOs fields. */
1977 fto
= TYPE_FIELDS (to
);
1978 ffrom
= TYPE_FIELDS (from
);
1979 chain
= &TYPE_FIELDS (to
);
1982 gcc_assert (ffrom
&& DECL_NAME (fto
) == DECL_NAME (ffrom
));
1983 chain
= &DECL_CHAIN (fto
);
1984 fto
= DECL_CHAIN (fto
);
1985 ffrom
= DECL_CHAIN (ffrom
);
1988 /* Now add all fields remaining in FROM (starting with ffrom). */
1989 for (; ffrom
; ffrom
= DECL_CHAIN (ffrom
))
1991 tree newfield
= copy_node (ffrom
);
1992 DECL_CONTEXT (newfield
) = to
;
1993 /* The store to DECL_CHAIN might seem redundant with the
1994 stores to *chain, but not clearing it here would mean
1995 leaving a chain into the old fields. If ever
1996 our called functions would look at them confusion
1998 DECL_CHAIN (newfield
) = NULL_TREE
;
2000 chain
= &DECL_CHAIN (newfield
);
2002 if (TREE_CODE (ffrom
) == FIELD_DECL
)
2004 tree elemtype
= gfc_nonrestricted_type (TREE_TYPE (ffrom
));
2005 TREE_TYPE (newfield
) = elemtype
;
2011 /* Given a type T, returns a different type of the same structure,
2012 except that all types it refers to (recursively) are always
2013 non-restrict qualified types. */
2015 gfc_nonrestricted_type (tree t
)
2019 /* If the type isn't laid out yet, don't copy it. If something
2020 needs it for real it should wait until the type got finished. */
2024 if (!TYPE_LANG_SPECIFIC (t
))
2025 TYPE_LANG_SPECIFIC (t
) = ggc_cleared_alloc
<struct lang_type
> ();
2026 /* If we're dealing with this very node already further up
2027 the call chain (recursion via pointers and struct members)
2028 we haven't yet determined if we really need a new type node.
2029 Assume we don't, return T itself. */
2030 if (TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
== error_mark_node
)
2033 /* If we have calculated this all already, just return it. */
2034 if (TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
)
2035 return TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
;
2037 /* Mark this type. */
2038 TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
= error_mark_node
;
2040 switch (TREE_CODE (t
))
2046 case REFERENCE_TYPE
:
2048 tree totype
= gfc_nonrestricted_type (TREE_TYPE (t
));
2049 if (totype
== TREE_TYPE (t
))
2051 else if (TREE_CODE (t
) == POINTER_TYPE
)
2052 ret
= build_pointer_type (totype
);
2054 ret
= build_reference_type (totype
);
2055 ret
= build_qualified_type (ret
,
2056 TYPE_QUALS (t
) & ~TYPE_QUAL_RESTRICT
);
2062 tree elemtype
= gfc_nonrestricted_type (TREE_TYPE (t
));
2063 if (elemtype
== TREE_TYPE (t
))
2067 ret
= build_variant_type_copy (t
);
2068 TREE_TYPE (ret
) = elemtype
;
2069 if (TYPE_LANG_SPECIFIC (t
)
2070 && GFC_TYPE_ARRAY_DATAPTR_TYPE (t
))
2072 tree dataptr_type
= GFC_TYPE_ARRAY_DATAPTR_TYPE (t
);
2073 dataptr_type
= gfc_nonrestricted_type (dataptr_type
);
2074 if (dataptr_type
!= GFC_TYPE_ARRAY_DATAPTR_TYPE (t
))
2076 TYPE_LANG_SPECIFIC (ret
)
2077 = ggc_cleared_alloc
<struct lang_type
> ();
2078 *TYPE_LANG_SPECIFIC (ret
) = *TYPE_LANG_SPECIFIC (t
);
2079 GFC_TYPE_ARRAY_DATAPTR_TYPE (ret
) = dataptr_type
;
2088 case QUAL_UNION_TYPE
:
2091 /* First determine if we need a new type at all.
2092 Careful, the two calls to gfc_nonrestricted_type per field
2093 might return different values. That happens exactly when
2094 one of the fields reaches back to this very record type
2095 (via pointers). The first calls will assume that we don't
2096 need to copy T (see the error_mark_node marking). If there
2097 are any reasons for copying T apart from having to copy T,
2098 we'll indeed copy it, and the second calls to
2099 gfc_nonrestricted_type will use that new node if they
2101 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2102 if (TREE_CODE (field
) == FIELD_DECL
)
2104 tree elemtype
= gfc_nonrestricted_type (TREE_TYPE (field
));
2105 if (elemtype
!= TREE_TYPE (field
))
2110 ret
= build_variant_type_copy (t
);
2111 TYPE_FIELDS (ret
) = NULL_TREE
;
2113 /* Here we make sure that as soon as we know we have to copy
2114 T, that also fields reaching back to us will use the new
2115 copy. It's okay if that copy still contains the old fields,
2116 we won't look at them. */
2117 TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
= ret
;
2118 mirror_fields (ret
, t
);
2123 TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
= ret
;
2128 /* Return the type for a symbol. Special handling is required for character
2129 types to get the correct level of indirection.
2130 For functions return the return type.
2131 For subroutines return void_type_node.
2132 Calling this multiple times for the same symbol should be avoided,
2133 especially for character and array types. */
2136 gfc_sym_type (gfc_symbol
* sym
)
2142 /* Procedure Pointers inside COMMON blocks. */
2143 if (sym
->attr
.proc_pointer
&& sym
->attr
.in_common
)
2145 /* Unset proc_pointer as gfc_get_function_type calls gfc_sym_type. */
2146 sym
->attr
.proc_pointer
= 0;
2147 type
= build_pointer_type (gfc_get_function_type (sym
));
2148 sym
->attr
.proc_pointer
= 1;
2152 if (sym
->attr
.flavor
== FL_PROCEDURE
&& !sym
->attr
.function
)
2153 return void_type_node
;
2155 /* In the case of a function the fake result variable may have a
2156 type different from the function type, so don't return early in
2158 if (sym
->backend_decl
&& !sym
->attr
.function
)
2159 return TREE_TYPE (sym
->backend_decl
);
2161 if (sym
->ts
.type
== BT_CHARACTER
2162 && ((sym
->attr
.function
&& sym
->attr
.is_bind_c
)
2163 || (sym
->attr
.result
2164 && sym
->ns
->proc_name
2165 && sym
->ns
->proc_name
->attr
.is_bind_c
)
2166 || (sym
->ts
.deferred
&& (!sym
->ts
.u
.cl
2167 || !sym
->ts
.u
.cl
->backend_decl
))))
2168 type
= gfc_character1_type_node
;
2170 type
= gfc_typenode_for_spec (&sym
->ts
);
2172 if (sym
->attr
.dummy
&& !sym
->attr
.function
&& !sym
->attr
.value
)
2177 restricted
= !sym
->attr
.target
&& !sym
->attr
.pointer
2178 && !sym
->attr
.proc_pointer
&& !sym
->attr
.cray_pointee
;
2180 type
= gfc_nonrestricted_type (type
);
2182 if (sym
->attr
.dimension
|| sym
->attr
.codimension
)
2184 if (gfc_is_nodesc_array (sym
))
2186 /* If this is a character argument of unknown length, just use the
2188 if (sym
->ts
.type
!= BT_CHARACTER
2189 || !(sym
->attr
.dummy
|| sym
->attr
.function
)
2190 || sym
->ts
.u
.cl
->backend_decl
)
2192 type
= gfc_get_nodesc_array_type (type
, sym
->as
,
2201 enum gfc_array_kind akind
= GFC_ARRAY_UNKNOWN
;
2202 if (sym
->attr
.pointer
)
2203 akind
= sym
->attr
.contiguous
? GFC_ARRAY_POINTER_CONT
2204 : GFC_ARRAY_POINTER
;
2205 else if (sym
->attr
.allocatable
)
2206 akind
= GFC_ARRAY_ALLOCATABLE
;
2207 type
= gfc_build_array_type (type
, sym
->as
, akind
, restricted
,
2208 sym
->attr
.contiguous
);
2213 if (sym
->attr
.allocatable
|| sym
->attr
.pointer
2214 || gfc_is_associate_pointer (sym
))
2215 type
= gfc_build_pointer_type (sym
, type
);
2218 /* We currently pass all parameters by reference.
2219 See f95_get_function_decl. For dummy function parameters return the
2223 /* We must use pointer types for potentially absent variables. The
2224 optimizers assume a reference type argument is never NULL. */
2225 if (sym
->attr
.optional
2226 || (sym
->ns
->proc_name
&& sym
->ns
->proc_name
->attr
.entry_master
))
2227 type
= build_pointer_type (type
);
2230 type
= build_reference_type (type
);
2232 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
2239 /* Layout and output debug info for a record type. */
2242 gfc_finish_type (tree type
)
2246 decl
= build_decl (input_location
,
2247 TYPE_DECL
, NULL_TREE
, type
);
2248 TYPE_STUB_DECL (type
) = decl
;
2250 rest_of_type_compilation (type
, 1);
2251 rest_of_decl_compilation (decl
, 1, 0);
2254 /* Add a field of given NAME and TYPE to the context of a UNION_TYPE
2255 or RECORD_TYPE pointed to by CONTEXT. The new field is chained
2256 to the end of the field list pointed to by *CHAIN.
2258 Returns a pointer to the new field. */
2261 gfc_add_field_to_struct_1 (tree context
, tree name
, tree type
, tree
**chain
)
2263 tree decl
= build_decl (input_location
, FIELD_DECL
, name
, type
);
2265 DECL_CONTEXT (decl
) = context
;
2266 DECL_CHAIN (decl
) = NULL_TREE
;
2267 if (TYPE_FIELDS (context
) == NULL_TREE
)
2268 TYPE_FIELDS (context
) = decl
;
2273 *chain
= &DECL_CHAIN (decl
);
2279 /* Like `gfc_add_field_to_struct_1', but adds alignment
2283 gfc_add_field_to_struct (tree context
, tree name
, tree type
, tree
**chain
)
2285 tree decl
= gfc_add_field_to_struct_1 (context
, name
, type
, chain
);
2287 DECL_INITIAL (decl
) = 0;
2288 DECL_ALIGN (decl
) = 0;
2289 DECL_USER_ALIGN (decl
) = 0;
2295 /* Copy the backend_decl and component backend_decls if
2296 the two derived type symbols are "equal", as described
2297 in 4.4.2 and resolved by gfc_compare_derived_types. */
2300 gfc_copy_dt_decls_ifequal (gfc_symbol
*from
, gfc_symbol
*to
,
2303 gfc_component
*to_cm
;
2304 gfc_component
*from_cm
;
2309 if (from
->backend_decl
== NULL
2310 || !gfc_compare_derived_types (from
, to
))
2313 to
->backend_decl
= from
->backend_decl
;
2315 to_cm
= to
->components
;
2316 from_cm
= from
->components
;
2318 /* Copy the component declarations. If a component is itself
2319 a derived type, we need a copy of its component declarations.
2320 This is done by recursing into gfc_get_derived_type and
2321 ensures that the component's component declarations have
2322 been built. If it is a character, we need the character
2324 for (; to_cm
; to_cm
= to_cm
->next
, from_cm
= from_cm
->next
)
2326 to_cm
->backend_decl
= from_cm
->backend_decl
;
2327 if (from_cm
->ts
.type
== BT_DERIVED
2328 && (!from_cm
->attr
.pointer
|| from_gsym
))
2329 gfc_get_derived_type (to_cm
->ts
.u
.derived
);
2330 else if (from_cm
->ts
.type
== BT_CLASS
2331 && (!CLASS_DATA (from_cm
)->attr
.class_pointer
|| from_gsym
))
2332 gfc_get_derived_type (to_cm
->ts
.u
.derived
);
2333 else if (from_cm
->ts
.type
== BT_CHARACTER
)
2334 to_cm
->ts
.u
.cl
->backend_decl
= from_cm
->ts
.u
.cl
->backend_decl
;
2341 /* Build a tree node for a procedure pointer component. */
2344 gfc_get_ppc_type (gfc_component
* c
)
2348 /* Explicit interface. */
2349 if (c
->attr
.if_source
!= IFSRC_UNKNOWN
&& c
->ts
.interface
)
2350 return build_pointer_type (gfc_get_function_type (c
->ts
.interface
));
2352 /* Implicit interface (only return value may be known). */
2353 if (c
->attr
.function
&& !c
->attr
.dimension
&& c
->ts
.type
!= BT_CHARACTER
)
2354 t
= gfc_typenode_for_spec (&c
->ts
);
2358 return build_pointer_type (build_function_type_list (t
, NULL_TREE
));
2362 /* Build a tree node for a derived type. If there are equal
2363 derived types, with different local names, these are built
2364 at the same time. If an equal derived type has been built
2365 in a parent namespace, this is used. */
2368 gfc_get_derived_type (gfc_symbol
* derived
)
2370 tree typenode
= NULL
, field
= NULL
, field_type
= NULL
;
2371 tree canonical
= NULL_TREE
;
2373 bool got_canonical
= false;
2374 bool unlimited_entity
= false;
2379 if (derived
->attr
.unlimited_polymorphic
2380 || (flag_coarray
== GFC_FCOARRAY_LIB
2381 && derived
->from_intmod
== INTMOD_ISO_FORTRAN_ENV
2382 && derived
->intmod_sym_id
== ISOFORTRAN_LOCK_TYPE
))
2383 return ptr_type_node
;
2385 if (derived
&& derived
->attr
.flavor
== FL_PROCEDURE
2386 && derived
->attr
.generic
)
2387 derived
= gfc_find_dt_in_generic (derived
);
2389 /* See if it's one of the iso_c_binding derived types. */
2390 if (derived
->attr
.is_iso_c
== 1 || derived
->ts
.f90_type
== BT_VOID
)
2392 if (derived
->backend_decl
)
2393 return derived
->backend_decl
;
2395 if (derived
->intmod_sym_id
== ISOCBINDING_PTR
)
2396 derived
->backend_decl
= ptr_type_node
;
2398 derived
->backend_decl
= pfunc_type_node
;
2400 derived
->ts
.kind
= gfc_index_integer_kind
;
2401 derived
->ts
.type
= BT_INTEGER
;
2402 /* Set the f90_type to BT_VOID as a way to recognize something of type
2403 BT_INTEGER that needs to fit a void * for the purpose of the
2404 iso_c_binding derived types. */
2405 derived
->ts
.f90_type
= BT_VOID
;
2407 return derived
->backend_decl
;
2410 /* If use associated, use the module type for this one. */
2411 if (derived
->backend_decl
== NULL
2412 && derived
->attr
.use_assoc
2414 && gfc_get_module_backend_decl (derived
))
2415 goto copy_derived_types
;
2417 /* The derived types from an earlier namespace can be used as the
2419 if (derived
->backend_decl
== NULL
&& !derived
->attr
.use_assoc
2420 && gfc_global_ns_list
)
2422 for (ns
= gfc_global_ns_list
;
2423 ns
->translated
&& !got_canonical
;
2426 dt
= ns
->derived_types
;
2427 for (; dt
&& !canonical
; dt
= dt
->next
)
2429 gfc_copy_dt_decls_ifequal (dt
->derived
, derived
, true);
2430 if (derived
->backend_decl
)
2431 got_canonical
= true;
2436 /* Store up the canonical type to be added to this one. */
2439 if (TYPE_CANONICAL (derived
->backend_decl
))
2440 canonical
= TYPE_CANONICAL (derived
->backend_decl
);
2442 canonical
= derived
->backend_decl
;
2444 derived
->backend_decl
= NULL_TREE
;
2447 /* derived->backend_decl != 0 means we saw it before, but its
2448 components' backend_decl may have not been built. */
2449 if (derived
->backend_decl
)
2451 /* Its components' backend_decl have been built or we are
2452 seeing recursion through the formal arglist of a procedure
2453 pointer component. */
2454 if (TYPE_FIELDS (derived
->backend_decl
))
2455 return derived
->backend_decl
;
2456 else if (derived
->attr
.abstract
2457 && derived
->attr
.proc_pointer_comp
)
2459 /* If an abstract derived type with procedure pointer
2460 components has no other type of component, return the
2461 backend_decl. Otherwise build the components if any of the
2462 non-procedure pointer components have no backend_decl. */
2463 for (c
= derived
->components
; c
; c
= c
->next
)
2465 if (!c
->attr
.proc_pointer
&& c
->backend_decl
== NULL
)
2467 else if (c
->next
== NULL
)
2468 return derived
->backend_decl
;
2470 typenode
= derived
->backend_decl
;
2473 typenode
= derived
->backend_decl
;
2477 /* We see this derived type first time, so build the type node. */
2478 typenode
= make_node (RECORD_TYPE
);
2479 TYPE_NAME (typenode
) = get_identifier (derived
->name
);
2480 TYPE_PACKED (typenode
) = flag_pack_derived
;
2481 derived
->backend_decl
= typenode
;
2484 if (derived
->components
2485 && derived
->components
->ts
.type
== BT_DERIVED
2486 && strcmp (derived
->components
->name
, "_data") == 0
2487 && derived
->components
->ts
.u
.derived
->attr
.unlimited_polymorphic
)
2488 unlimited_entity
= true;
2490 /* Go through the derived type components, building them as
2491 necessary. The reason for doing this now is that it is
2492 possible to recurse back to this derived type through a
2493 pointer component (PR24092). If this happens, the fields
2494 will be built and so we can return the type. */
2495 for (c
= derived
->components
; c
; c
= c
->next
)
2497 if (c
->ts
.type
!= BT_DERIVED
&& c
->ts
.type
!= BT_CLASS
)
2500 if ((!c
->attr
.pointer
&& !c
->attr
.proc_pointer
)
2501 || c
->ts
.u
.derived
->backend_decl
== NULL
)
2502 c
->ts
.u
.derived
->backend_decl
= gfc_get_derived_type (c
->ts
.u
.derived
);
2504 if (c
->ts
.u
.derived
->attr
.is_iso_c
)
2506 /* Need to copy the modified ts from the derived type. The
2507 typespec was modified because C_PTR/C_FUNPTR are translated
2508 into (void *) from derived types. */
2509 c
->ts
.type
= c
->ts
.u
.derived
->ts
.type
;
2510 c
->ts
.kind
= c
->ts
.u
.derived
->ts
.kind
;
2511 c
->ts
.f90_type
= c
->ts
.u
.derived
->ts
.f90_type
;
2514 c
->initializer
->ts
.type
= c
->ts
.type
;
2515 c
->initializer
->ts
.kind
= c
->ts
.kind
;
2516 c
->initializer
->ts
.f90_type
= c
->ts
.f90_type
;
2517 c
->initializer
->expr_type
= EXPR_NULL
;
2522 if (TYPE_FIELDS (derived
->backend_decl
))
2523 return derived
->backend_decl
;
2525 /* Build the type member list. Install the newly created RECORD_TYPE
2526 node as DECL_CONTEXT of each FIELD_DECL. */
2527 for (c
= derived
->components
; c
; c
= c
->next
)
2529 if (c
->attr
.proc_pointer
)
2530 field_type
= gfc_get_ppc_type (c
);
2531 else if (c
->ts
.type
== BT_DERIVED
|| c
->ts
.type
== BT_CLASS
)
2532 field_type
= c
->ts
.u
.derived
->backend_decl
;
2535 if (c
->ts
.type
== BT_CHARACTER
&& !c
->ts
.deferred
)
2537 /* Evaluate the string length. */
2538 gfc_conv_const_charlen (c
->ts
.u
.cl
);
2539 gcc_assert (c
->ts
.u
.cl
->backend_decl
);
2541 else if (c
->ts
.type
== BT_CHARACTER
)
2542 c
->ts
.u
.cl
->backend_decl
2543 = build_int_cst (gfc_charlen_type_node
, 0);
2545 field_type
= gfc_typenode_for_spec (&c
->ts
);
2548 /* This returns an array descriptor type. Initialization may be
2550 if ((c
->attr
.dimension
|| c
->attr
.codimension
) && !c
->attr
.proc_pointer
)
2552 if (c
->attr
.pointer
|| c
->attr
.allocatable
)
2554 enum gfc_array_kind akind
;
2555 if (c
->attr
.pointer
)
2556 akind
= c
->attr
.contiguous
? GFC_ARRAY_POINTER_CONT
2557 : GFC_ARRAY_POINTER
;
2559 akind
= GFC_ARRAY_ALLOCATABLE
;
2560 /* Pointers to arrays aren't actually pointer types. The
2561 descriptors are separate, but the data is common. */
2562 field_type
= gfc_build_array_type (field_type
, c
->as
, akind
,
2564 && !c
->attr
.pointer
,
2565 c
->attr
.contiguous
);
2568 field_type
= gfc_get_nodesc_array_type (field_type
, c
->as
,
2572 else if ((c
->attr
.pointer
|| c
->attr
.allocatable
)
2573 && !c
->attr
.proc_pointer
2574 && !(unlimited_entity
&& c
== derived
->components
))
2575 field_type
= build_pointer_type (field_type
);
2577 if (c
->attr
.pointer
)
2578 field_type
= gfc_nonrestricted_type (field_type
);
2580 /* vtype fields can point to different types to the base type. */
2581 if (c
->ts
.type
== BT_DERIVED
2582 && c
->ts
.u
.derived
&& c
->ts
.u
.derived
->attr
.vtype
)
2583 field_type
= build_pointer_type_for_mode (TREE_TYPE (field_type
),
2586 /* Ensure that the CLASS language specific flag is set. */
2587 if (c
->ts
.type
== BT_CLASS
)
2589 if (POINTER_TYPE_P (field_type
))
2590 GFC_CLASS_TYPE_P (TREE_TYPE (field_type
)) = 1;
2592 GFC_CLASS_TYPE_P (field_type
) = 1;
2595 field
= gfc_add_field_to_struct (typenode
,
2596 get_identifier (c
->name
),
2597 field_type
, &chain
);
2599 gfc_set_decl_location (field
, &c
->loc
);
2600 else if (derived
->declared_at
.lb
)
2601 gfc_set_decl_location (field
, &derived
->declared_at
);
2603 gfc_finish_decl_attrs (field
, &c
->attr
);
2605 DECL_PACKED (field
) |= TYPE_PACKED (typenode
);
2608 if (!c
->backend_decl
)
2609 c
->backend_decl
= field
;
2612 /* Now lay out the derived type, including the fields. */
2614 TYPE_CANONICAL (typenode
) = canonical
;
2616 gfc_finish_type (typenode
);
2617 gfc_set_decl_location (TYPE_STUB_DECL (typenode
), &derived
->declared_at
);
2618 if (derived
->module
&& derived
->ns
->proc_name
2619 && derived
->ns
->proc_name
->attr
.flavor
== FL_MODULE
)
2621 if (derived
->ns
->proc_name
->backend_decl
2622 && TREE_CODE (derived
->ns
->proc_name
->backend_decl
)
2625 TYPE_CONTEXT (typenode
) = derived
->ns
->proc_name
->backend_decl
;
2626 DECL_CONTEXT (TYPE_STUB_DECL (typenode
))
2627 = derived
->ns
->proc_name
->backend_decl
;
2631 derived
->backend_decl
= typenode
;
2635 for (dt
= gfc_derived_types
; dt
; dt
= dt
->next
)
2636 gfc_copy_dt_decls_ifequal (derived
, dt
->derived
, false);
2638 return derived
->backend_decl
;
2643 gfc_return_by_reference (gfc_symbol
* sym
)
2645 if (!sym
->attr
.function
)
2648 if (sym
->attr
.dimension
)
2651 if (sym
->ts
.type
== BT_CHARACTER
2652 && !sym
->attr
.is_bind_c
2653 && (!sym
->attr
.result
2654 || !sym
->ns
->proc_name
2655 || !sym
->ns
->proc_name
->attr
.is_bind_c
))
2658 /* Possibly return complex numbers by reference for g77 compatibility.
2659 We don't do this for calls to intrinsics (as the library uses the
2660 -fno-f2c calling convention), nor for calls to functions which always
2661 require an explicit interface, as no compatibility problems can
2663 if (flag_f2c
&& sym
->ts
.type
== BT_COMPLEX
2664 && !sym
->attr
.intrinsic
&& !sym
->attr
.always_explicit
)
2671 gfc_get_mixed_entry_union (gfc_namespace
*ns
)
2675 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2676 gfc_entry_list
*el
, *el2
;
2678 gcc_assert (ns
->proc_name
->attr
.mixed_entry_master
);
2679 gcc_assert (memcmp (ns
->proc_name
->name
, "master.", 7) == 0);
2681 snprintf (name
, GFC_MAX_SYMBOL_LEN
, "munion.%s", ns
->proc_name
->name
+ 7);
2683 /* Build the type node. */
2684 type
= make_node (UNION_TYPE
);
2686 TYPE_NAME (type
) = get_identifier (name
);
2688 for (el
= ns
->entries
; el
; el
= el
->next
)
2690 /* Search for duplicates. */
2691 for (el2
= ns
->entries
; el2
!= el
; el2
= el2
->next
)
2692 if (el2
->sym
->result
== el
->sym
->result
)
2696 gfc_add_field_to_struct_1 (type
,
2697 get_identifier (el
->sym
->result
->name
),
2698 gfc_sym_type (el
->sym
->result
), &chain
);
2701 /* Finish off the type. */
2702 gfc_finish_type (type
);
2703 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
)) = 1;
2707 /* Create a "fn spec" based on the formal arguments;
2708 cf. create_function_arglist. */
2711 create_fn_spec (gfc_symbol
*sym
, tree fntype
)
2715 gfc_formal_arglist
*f
;
2718 memset (&spec
, 0, sizeof (spec
));
2722 if (sym
->attr
.entry_master
)
2723 spec
[spec_len
++] = 'R';
2724 if (gfc_return_by_reference (sym
))
2726 gfc_symbol
*result
= sym
->result
? sym
->result
: sym
;
2728 if (result
->attr
.pointer
|| sym
->attr
.proc_pointer
)
2729 spec
[spec_len
++] = '.';
2731 spec
[spec_len
++] = 'w';
2732 if (sym
->ts
.type
== BT_CHARACTER
)
2733 spec
[spec_len
++] = 'R';
2736 for (f
= gfc_sym_get_dummy_args (sym
); f
; f
= f
->next
)
2737 if (spec_len
< sizeof (spec
))
2739 if (!f
->sym
|| f
->sym
->attr
.pointer
|| f
->sym
->attr
.target
2740 || f
->sym
->attr
.external
|| f
->sym
->attr
.cray_pointer
2741 || (f
->sym
->ts
.type
== BT_DERIVED
2742 && (f
->sym
->ts
.u
.derived
->attr
.proc_pointer_comp
2743 || f
->sym
->ts
.u
.derived
->attr
.pointer_comp
))
2744 || (f
->sym
->ts
.type
== BT_CLASS
2745 && (CLASS_DATA (f
->sym
)->ts
.u
.derived
->attr
.proc_pointer_comp
2746 || CLASS_DATA (f
->sym
)->ts
.u
.derived
->attr
.pointer_comp
)))
2747 spec
[spec_len
++] = '.';
2748 else if (f
->sym
->attr
.intent
== INTENT_IN
)
2749 spec
[spec_len
++] = 'r';
2751 spec
[spec_len
++] = 'w';
2754 tmp
= build_tree_list (NULL_TREE
, build_string (spec_len
, spec
));
2755 tmp
= tree_cons (get_identifier ("fn spec"), tmp
, TYPE_ATTRIBUTES (fntype
));
2756 return build_type_attribute_variant (fntype
, tmp
);
2761 gfc_get_function_type (gfc_symbol
* sym
)
2764 vec
<tree
, va_gc
> *typelist
= NULL
;
2765 gfc_formal_arglist
*f
;
2767 int alternate_return
= 0;
2768 bool is_varargs
= true;
2770 /* Make sure this symbol is a function, a subroutine or the main
2772 gcc_assert (sym
->attr
.flavor
== FL_PROCEDURE
2773 || sym
->attr
.flavor
== FL_PROGRAM
);
2775 /* To avoid recursing infinitely on recursive types, we use error_mark_node
2776 so that they can be detected here and handled further down. */
2777 if (sym
->backend_decl
== NULL
)
2778 sym
->backend_decl
= error_mark_node
;
2779 else if (sym
->backend_decl
== error_mark_node
)
2780 goto arg_type_list_done
;
2781 else if (sym
->attr
.proc_pointer
)
2782 return TREE_TYPE (TREE_TYPE (sym
->backend_decl
));
2784 return TREE_TYPE (sym
->backend_decl
);
2786 if (sym
->attr
.entry_master
)
2787 /* Additional parameter for selecting an entry point. */
2788 vec_safe_push (typelist
, gfc_array_index_type
);
2795 if (arg
->ts
.type
== BT_CHARACTER
)
2796 gfc_conv_const_charlen (arg
->ts
.u
.cl
);
2798 /* Some functions we use an extra parameter for the return value. */
2799 if (gfc_return_by_reference (sym
))
2801 type
= gfc_sym_type (arg
);
2802 if (arg
->ts
.type
== BT_COMPLEX
2803 || arg
->attr
.dimension
2804 || arg
->ts
.type
== BT_CHARACTER
)
2805 type
= build_reference_type (type
);
2807 vec_safe_push (typelist
, type
);
2808 if (arg
->ts
.type
== BT_CHARACTER
)
2810 if (!arg
->ts
.deferred
)
2811 /* Transfer by value. */
2812 vec_safe_push (typelist
, gfc_charlen_type_node
);
2814 /* Deferred character lengths are transferred by reference
2815 so that the value can be returned. */
2816 vec_safe_push (typelist
, build_pointer_type(gfc_charlen_type_node
));
2820 /* Build the argument types for the function. */
2821 for (f
= gfc_sym_get_dummy_args (sym
); f
; f
= f
->next
)
2826 /* Evaluate constant character lengths here so that they can be
2827 included in the type. */
2828 if (arg
->ts
.type
== BT_CHARACTER
)
2829 gfc_conv_const_charlen (arg
->ts
.u
.cl
);
2831 if (arg
->attr
.flavor
== FL_PROCEDURE
)
2833 type
= gfc_get_function_type (arg
);
2834 type
= build_pointer_type (type
);
2837 type
= gfc_sym_type (arg
);
2839 /* Parameter Passing Convention
2841 We currently pass all parameters by reference.
2842 Parameters with INTENT(IN) could be passed by value.
2843 The problem arises if a function is called via an implicit
2844 prototype. In this situation the INTENT is not known.
2845 For this reason all parameters to global functions must be
2846 passed by reference. Passing by value would potentially
2847 generate bad code. Worse there would be no way of telling that
2848 this code was bad, except that it would give incorrect results.
2850 Contained procedures could pass by value as these are never
2851 used without an explicit interface, and cannot be passed as
2852 actual parameters for a dummy procedure. */
2854 vec_safe_push (typelist
, type
);
2858 if (sym
->attr
.subroutine
)
2859 alternate_return
= 1;
2863 /* Add hidden string length parameters. */
2864 for (f
= gfc_sym_get_dummy_args (sym
); f
; f
= f
->next
)
2867 if (arg
&& arg
->ts
.type
== BT_CHARACTER
&& !sym
->attr
.is_bind_c
)
2869 if (!arg
->ts
.deferred
)
2870 /* Transfer by value. */
2871 type
= gfc_charlen_type_node
;
2873 /* Deferred character lengths are transferred by reference
2874 so that the value can be returned. */
2875 type
= build_pointer_type (gfc_charlen_type_node
);
2877 vec_safe_push (typelist
, type
);
2881 if (!vec_safe_is_empty (typelist
)
2882 || sym
->attr
.is_main_program
2883 || sym
->attr
.if_source
!= IFSRC_UNKNOWN
)
2886 if (sym
->backend_decl
== error_mark_node
)
2887 sym
->backend_decl
= NULL_TREE
;
2891 if (alternate_return
)
2892 type
= integer_type_node
;
2893 else if (!sym
->attr
.function
|| gfc_return_by_reference (sym
))
2894 type
= void_type_node
;
2895 else if (sym
->attr
.mixed_entry_master
)
2896 type
= gfc_get_mixed_entry_union (sym
->ns
);
2897 else if (flag_f2c
&& sym
->ts
.type
== BT_REAL
2898 && sym
->ts
.kind
== gfc_default_real_kind
2899 && !sym
->attr
.always_explicit
)
2901 /* Special case: f2c calling conventions require that (scalar)
2902 default REAL functions return the C type double instead. f2c
2903 compatibility is only an issue with functions that don't
2904 require an explicit interface, as only these could be
2905 implemented in Fortran 77. */
2906 sym
->ts
.kind
= gfc_default_double_kind
;
2907 type
= gfc_typenode_for_spec (&sym
->ts
);
2908 sym
->ts
.kind
= gfc_default_real_kind
;
2910 else if (sym
->result
&& sym
->result
->attr
.proc_pointer
)
2911 /* Procedure pointer return values. */
2913 if (sym
->result
->attr
.result
&& strcmp (sym
->name
,"ppr@") != 0)
2915 /* Unset proc_pointer as gfc_get_function_type
2916 is called recursively. */
2917 sym
->result
->attr
.proc_pointer
= 0;
2918 type
= build_pointer_type (gfc_get_function_type (sym
->result
));
2919 sym
->result
->attr
.proc_pointer
= 1;
2922 type
= gfc_sym_type (sym
->result
);
2925 type
= gfc_sym_type (sym
);
2928 type
= build_varargs_function_type_vec (type
, typelist
);
2930 type
= build_function_type_vec (type
, typelist
);
2931 type
= create_fn_spec (sym
, type
);
2936 /* Language hooks for middle-end access to type nodes. */
2938 /* Return an integer type with BITS bits of precision,
2939 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2942 gfc_type_for_size (unsigned bits
, int unsignedp
)
2947 for (i
= 0; i
<= MAX_INT_KINDS
; ++i
)
2949 tree type
= gfc_integer_types
[i
];
2950 if (type
&& bits
== TYPE_PRECISION (type
))
2954 /* Handle TImode as a special case because it is used by some backends
2955 (e.g. ARM) even though it is not available for normal use. */
2956 #if HOST_BITS_PER_WIDE_INT >= 64
2957 if (bits
== TYPE_PRECISION (intTI_type_node
))
2958 return intTI_type_node
;
2961 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2962 return intQI_type_node
;
2963 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2964 return intHI_type_node
;
2965 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2966 return intSI_type_node
;
2967 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2968 return intDI_type_node
;
2969 if (bits
<= TYPE_PRECISION (intTI_type_node
))
2970 return intTI_type_node
;
2974 if (bits
<= TYPE_PRECISION (unsigned_intQI_type_node
))
2975 return unsigned_intQI_type_node
;
2976 if (bits
<= TYPE_PRECISION (unsigned_intHI_type_node
))
2977 return unsigned_intHI_type_node
;
2978 if (bits
<= TYPE_PRECISION (unsigned_intSI_type_node
))
2979 return unsigned_intSI_type_node
;
2980 if (bits
<= TYPE_PRECISION (unsigned_intDI_type_node
))
2981 return unsigned_intDI_type_node
;
2982 if (bits
<= TYPE_PRECISION (unsigned_intTI_type_node
))
2983 return unsigned_intTI_type_node
;
2989 /* Return a data type that has machine mode MODE. If the mode is an
2990 integer, then UNSIGNEDP selects between signed and unsigned types. */
2993 gfc_type_for_mode (machine_mode mode
, int unsignedp
)
2998 if (GET_MODE_CLASS (mode
) == MODE_FLOAT
)
2999 base
= gfc_real_types
;
3000 else if (GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
)
3001 base
= gfc_complex_types
;
3002 else if (SCALAR_INT_MODE_P (mode
))
3004 tree type
= gfc_type_for_size (GET_MODE_PRECISION (mode
), unsignedp
);
3005 return type
!= NULL_TREE
&& mode
== TYPE_MODE (type
) ? type
: NULL_TREE
;
3007 else if (VECTOR_MODE_P (mode
))
3009 machine_mode inner_mode
= GET_MODE_INNER (mode
);
3010 tree inner_type
= gfc_type_for_mode (inner_mode
, unsignedp
);
3011 if (inner_type
!= NULL_TREE
)
3012 return build_vector_type_for_mode (inner_type
, mode
);
3018 for (i
= 0; i
<= MAX_REAL_KINDS
; ++i
)
3020 tree type
= base
[i
];
3021 if (type
&& mode
== TYPE_MODE (type
))
3028 /* Return TRUE if TYPE is a type with a hidden descriptor, fill in INFO
3032 gfc_get_array_descr_info (const_tree type
, struct array_descr_info
*info
)
3035 bool indirect
= false;
3036 tree etype
, ptype
, field
, t
, base_decl
;
3037 tree data_off
, dim_off
, dim_size
, elem_size
;
3038 tree lower_suboff
, upper_suboff
, stride_suboff
;
3040 if (! GFC_DESCRIPTOR_TYPE_P (type
))
3042 if (! POINTER_TYPE_P (type
))
3044 type
= TREE_TYPE (type
);
3045 if (! GFC_DESCRIPTOR_TYPE_P (type
))
3050 rank
= GFC_TYPE_ARRAY_RANK (type
);
3051 if (rank
>= (int) (sizeof (info
->dimen
) / sizeof (info
->dimen
[0])))
3054 etype
= GFC_TYPE_ARRAY_DATAPTR_TYPE (type
);
3055 gcc_assert (POINTER_TYPE_P (etype
));
3056 etype
= TREE_TYPE (etype
);
3058 /* If the type is not a scalar coarray. */
3059 if (TREE_CODE (etype
) == ARRAY_TYPE
)
3060 etype
= TREE_TYPE (etype
);
3062 /* Can't handle variable sized elements yet. */
3063 if (int_size_in_bytes (etype
) <= 0)
3065 /* Nor non-constant lower bounds in assumed shape arrays. */
3066 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE
3067 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE_CONT
)
3069 for (dim
= 0; dim
< rank
; dim
++)
3070 if (GFC_TYPE_ARRAY_LBOUND (type
, dim
) == NULL_TREE
3071 || TREE_CODE (GFC_TYPE_ARRAY_LBOUND (type
, dim
)) != INTEGER_CST
)
3075 memset (info
, '\0', sizeof (*info
));
3076 info
->ndimensions
= rank
;
3077 info
->ordering
= array_descr_ordering_column_major
;
3078 info
->element_type
= etype
;
3079 ptype
= build_pointer_type (gfc_array_index_type
);
3080 base_decl
= GFC_TYPE_ARRAY_BASE_DECL (type
, indirect
);
3083 base_decl
= make_node (DEBUG_EXPR_DECL
);
3084 DECL_ARTIFICIAL (base_decl
) = 1;
3085 TREE_TYPE (base_decl
) = indirect
? build_pointer_type (ptype
) : ptype
;
3086 DECL_MODE (base_decl
) = TYPE_MODE (TREE_TYPE (base_decl
));
3087 GFC_TYPE_ARRAY_BASE_DECL (type
, indirect
) = base_decl
;
3089 info
->base_decl
= base_decl
;
3091 base_decl
= build1 (INDIRECT_REF
, ptype
, base_decl
);
3093 if (GFC_TYPE_ARRAY_SPAN (type
))
3094 elem_size
= GFC_TYPE_ARRAY_SPAN (type
);
3096 elem_size
= fold_convert (gfc_array_index_type
, TYPE_SIZE_UNIT (etype
));
3097 field
= TYPE_FIELDS (TYPE_MAIN_VARIANT (type
));
3098 data_off
= byte_position (field
);
3099 field
= DECL_CHAIN (field
);
3100 field
= DECL_CHAIN (field
);
3101 field
= DECL_CHAIN (field
);
3102 dim_off
= byte_position (field
);
3103 dim_size
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (field
)));
3104 field
= TYPE_FIELDS (TREE_TYPE (TREE_TYPE (field
)));
3105 stride_suboff
= byte_position (field
);
3106 field
= DECL_CHAIN (field
);
3107 lower_suboff
= byte_position (field
);
3108 field
= DECL_CHAIN (field
);
3109 upper_suboff
= byte_position (field
);
3112 if (!integer_zerop (data_off
))
3113 t
= fold_build_pointer_plus (t
, data_off
);
3114 t
= build1 (NOP_EXPR
, build_pointer_type (ptr_type_node
), t
);
3115 info
->data_location
= build1 (INDIRECT_REF
, ptr_type_node
, t
);
3116 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ALLOCATABLE
)
3117 info
->allocated
= build2 (NE_EXPR
, boolean_type_node
,
3118 info
->data_location
, null_pointer_node
);
3119 else if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_POINTER
3120 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_POINTER_CONT
)
3121 info
->associated
= build2 (NE_EXPR
, boolean_type_node
,
3122 info
->data_location
, null_pointer_node
);
3124 for (dim
= 0; dim
< rank
; dim
++)
3126 t
= fold_build_pointer_plus (base_decl
,
3127 size_binop (PLUS_EXPR
,
3128 dim_off
, lower_suboff
));
3129 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
3130 info
->dimen
[dim
].lower_bound
= t
;
3131 t
= fold_build_pointer_plus (base_decl
,
3132 size_binop (PLUS_EXPR
,
3133 dim_off
, upper_suboff
));
3134 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
3135 info
->dimen
[dim
].upper_bound
= t
;
3136 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE
3137 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE_CONT
)
3139 /* Assumed shape arrays have known lower bounds. */
3140 info
->dimen
[dim
].upper_bound
3141 = build2 (MINUS_EXPR
, gfc_array_index_type
,
3142 info
->dimen
[dim
].upper_bound
,
3143 info
->dimen
[dim
].lower_bound
);
3144 info
->dimen
[dim
].lower_bound
3145 = fold_convert (gfc_array_index_type
,
3146 GFC_TYPE_ARRAY_LBOUND (type
, dim
));
3147 info
->dimen
[dim
].upper_bound
3148 = build2 (PLUS_EXPR
, gfc_array_index_type
,
3149 info
->dimen
[dim
].lower_bound
,
3150 info
->dimen
[dim
].upper_bound
);
3152 t
= fold_build_pointer_plus (base_decl
,
3153 size_binop (PLUS_EXPR
,
3154 dim_off
, stride_suboff
));
3155 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
3156 t
= build2 (MULT_EXPR
, gfc_array_index_type
, t
, elem_size
);
3157 info
->dimen
[dim
].stride
= t
;
3158 dim_off
= size_binop (PLUS_EXPR
, dim_off
, dim_size
);
3165 /* Create a type to handle vector subscripts for coarray library calls. It
3167 struct caf_vector_t {
3168 size_t nvec; // size of the vector
3175 ptrdiff_t lower_bound;
3176 ptrdiff_t upper_bound;
3181 where nvec == 0 for DIMEN_ELEMENT or DIMEN_RANGE and nvec being the vector
3182 size in case of DIMEN_VECTOR, where kind is the integer type of the vector. */
3185 gfc_get_caf_vector_type (int dim
)
3187 static tree vector_types
[GFC_MAX_DIMENSIONS
];
3188 static tree vec_type
= NULL_TREE
;
3189 tree triplet_struct_type
, vect_struct_type
, union_type
, tmp
, *chain
;
3191 if (vector_types
[dim
-1] != NULL_TREE
)
3192 return vector_types
[dim
-1];
3194 if (vec_type
== NULL_TREE
)
3197 vect_struct_type
= make_node (RECORD_TYPE
);
3198 tmp
= gfc_add_field_to_struct_1 (vect_struct_type
,
3199 get_identifier ("vector"),
3200 pvoid_type_node
, &chain
);
3201 TREE_NO_WARNING (tmp
) = 1;
3202 tmp
= gfc_add_field_to_struct_1 (vect_struct_type
,
3203 get_identifier ("kind"),
3204 integer_type_node
, &chain
);
3205 TREE_NO_WARNING (tmp
) = 1;
3206 gfc_finish_type (vect_struct_type
);
3209 triplet_struct_type
= make_node (RECORD_TYPE
);
3210 tmp
= gfc_add_field_to_struct_1 (triplet_struct_type
,
3211 get_identifier ("lower_bound"),
3212 gfc_array_index_type
, &chain
);
3213 TREE_NO_WARNING (tmp
) = 1;
3214 tmp
= gfc_add_field_to_struct_1 (triplet_struct_type
,
3215 get_identifier ("upper_bound"),
3216 gfc_array_index_type
, &chain
);
3217 TREE_NO_WARNING (tmp
) = 1;
3218 tmp
= gfc_add_field_to_struct_1 (triplet_struct_type
, get_identifier ("stride"),
3219 gfc_array_index_type
, &chain
);
3220 TREE_NO_WARNING (tmp
) = 1;
3221 gfc_finish_type (triplet_struct_type
);
3224 union_type
= make_node (UNION_TYPE
);
3225 tmp
= gfc_add_field_to_struct_1 (union_type
, get_identifier ("v"),
3226 vect_struct_type
, &chain
);
3227 TREE_NO_WARNING (tmp
) = 1;
3228 tmp
= gfc_add_field_to_struct_1 (union_type
, get_identifier ("triplet"),
3229 triplet_struct_type
, &chain
);
3230 TREE_NO_WARNING (tmp
) = 1;
3231 gfc_finish_type (union_type
);
3234 vec_type
= make_node (RECORD_TYPE
);
3235 tmp
= gfc_add_field_to_struct_1 (vec_type
, get_identifier ("nvec"),
3236 size_type_node
, &chain
);
3237 TREE_NO_WARNING (tmp
) = 1;
3238 tmp
= gfc_add_field_to_struct_1 (vec_type
, get_identifier ("u"),
3239 union_type
, &chain
);
3240 TREE_NO_WARNING (tmp
) = 1;
3241 gfc_finish_type (vec_type
);
3242 TYPE_NAME (vec_type
) = get_identifier ("caf_vector_t");
3245 tmp
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
3246 gfc_rank_cst
[dim
-1]);
3247 vector_types
[dim
-1] = build_array_type (vec_type
, tmp
);
3248 return vector_types
[dim
-1];
3251 #include "gt-fortran-trans-types.h"