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. */
37 #include "stor-layout.h"
38 #include "stringpool.h"
39 #include "langhooks.h" /* For iso-c-bindings.def. */
43 #include "diagnostic-core.h" /* For fatal_error. */
44 #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 ((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 ((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 ((machine_mode
) mode
);
424 if (!targetm
.scalar_mode_supported_p ((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 (!targetm
.libgcc_floating_mode_supported_p ((machine_mode
)
433 if (mode
!= TYPE_MODE (float_type_node
)
434 && (mode
!= TYPE_MODE (double_type_node
))
435 && (mode
!= TYPE_MODE (long_double_type_node
))
436 #if defined(HAVE_TFmode) && defined(ENABLE_LIBQUADMATH_SUPPORT)
442 /* Let the kind equal the precision divided by 8, rounding up. Again,
443 this insulates the programmer from the underlying byte size.
445 Also, it effectively deals with IEEE extended formats. There, the
446 total size of the type may equal 16, but it's got 6 bytes of padding
447 and the increased size can get in the way of a real IEEE quad format
448 which may also be supported by the target.
450 We round up so as to handle IA-64 __floatreg (RFmode), which is an
451 82 bit type. Not to be confused with __float80 (XFmode), which is
452 an 80 bit type also supported by IA-64. So XFmode should come out
453 to be kind=10, and RFmode should come out to be kind=11. Egads. */
455 kind
= (GET_MODE_PRECISION (mode
) + 7) / 8;
466 /* Careful we don't stumble a weird internal mode. */
467 gcc_assert (r_index
<= 0 || gfc_real_kinds
[r_index
-1].kind
!= kind
);
468 /* Or have too many modes for the allocated space. */
469 gcc_assert (r_index
!= MAX_REAL_KINDS
);
471 gfc_real_kinds
[r_index
].kind
= kind
;
472 gfc_real_kinds
[r_index
].radix
= fmt
->b
;
473 gfc_real_kinds
[r_index
].digits
= fmt
->p
;
474 gfc_real_kinds
[r_index
].min_exponent
= fmt
->emin
;
475 gfc_real_kinds
[r_index
].max_exponent
= fmt
->emax
;
476 if (fmt
->pnan
< fmt
->p
)
477 /* This is an IBM extended double format (or the MIPS variant)
478 made up of two IEEE doubles. The value of the long double is
479 the sum of the values of the two parts. The most significant
480 part is required to be the value of the long double rounded
481 to the nearest double. If we use emax of 1024 then we can't
482 represent huge(x) = (1 - b**(-p)) * b**(emax-1) * b, because
483 rounding will make the most significant part overflow. */
484 gfc_real_kinds
[r_index
].max_exponent
= fmt
->emax
- 1;
485 gfc_real_kinds
[r_index
].mode_precision
= GET_MODE_PRECISION (mode
);
489 /* Choose the default integer kind. We choose 4 unless the user directs us
490 otherwise. Even if the user specified that the default integer kind is 8,
491 the numeric storage size is not 64 bits. In this case, a warning will be
492 issued when NUMERIC_STORAGE_SIZE is used. Set NUMERIC_STORAGE_SIZE to 32. */
494 gfc_numeric_storage_size
= 4 * 8;
496 if (flag_default_integer
)
499 gfc_fatal_error ("INTEGER(KIND=8) is not available for "
500 "%<-fdefault-integer-8%> option");
502 gfc_default_integer_kind
= 8;
505 else if (flag_integer4_kind
== 8)
508 gfc_fatal_error ("INTEGER(KIND=8) is not available for "
509 "%<-finteger-4-integer-8%> option");
511 gfc_default_integer_kind
= 8;
515 gfc_default_integer_kind
= 4;
519 gfc_default_integer_kind
= gfc_integer_kinds
[i_index
- 1].kind
;
520 gfc_numeric_storage_size
= gfc_integer_kinds
[i_index
- 1].bit_size
;
523 /* Choose the default real kind. Again, we choose 4 when possible. */
524 if (flag_default_real
)
527 gfc_fatal_error ("REAL(KIND=8) is not available for "
528 "%<-fdefault-real-8%> option");
530 gfc_default_real_kind
= 8;
532 else if (flag_real4_kind
== 8)
535 gfc_fatal_error ("REAL(KIND=8) is not available for %<-freal-4-real-8%> "
538 gfc_default_real_kind
= 8;
540 else if (flag_real4_kind
== 10)
543 gfc_fatal_error ("REAL(KIND=10) is not available for "
544 "%<-freal-4-real-10%> option");
546 gfc_default_real_kind
= 10;
548 else if (flag_real4_kind
== 16)
551 gfc_fatal_error ("REAL(KIND=16) is not available for "
552 "%<-freal-4-real-16%> option");
554 gfc_default_real_kind
= 16;
557 gfc_default_real_kind
= 4;
559 gfc_default_real_kind
= gfc_real_kinds
[0].kind
;
561 /* Choose the default double kind. If -fdefault-real and -fdefault-double
562 are specified, we use kind=8, if it's available. If -fdefault-real is
563 specified without -fdefault-double, we use kind=16, if it's available.
564 Otherwise we do not change anything. */
565 if (flag_default_double
&& !flag_default_real
)
566 gfc_fatal_error ("Use of %<-fdefault-double-8%> requires "
567 "%<-fdefault-real-8%>");
569 if (flag_default_real
&& flag_default_double
&& saw_r8
)
570 gfc_default_double_kind
= 8;
571 else if (flag_default_real
&& saw_r16
)
572 gfc_default_double_kind
= 16;
573 else if (flag_real8_kind
== 4)
576 gfc_fatal_error ("REAL(KIND=4) is not available for "
577 "%<-freal-8-real-4%> option");
579 gfc_default_double_kind
= 4;
581 else if (flag_real8_kind
== 10 )
584 gfc_fatal_error ("REAL(KIND=10) is not available for "
585 "%<-freal-8-real-10%> option");
587 gfc_default_double_kind
= 10;
589 else if (flag_real8_kind
== 16 )
592 gfc_fatal_error ("REAL(KIND=10) is not available for "
593 "%<-freal-8-real-16%> option");
595 gfc_default_double_kind
= 16;
597 else if (saw_r4
&& saw_r8
)
598 gfc_default_double_kind
= 8;
601 /* F95 14.6.3.1: A nonpointer scalar object of type double precision
602 real ... occupies two contiguous numeric storage units.
604 Therefore we must be supplied a kind twice as large as we chose
605 for single precision. There are loopholes, in that double
606 precision must *occupy* two storage units, though it doesn't have
607 to *use* two storage units. Which means that you can make this
608 kind artificially wide by padding it. But at present there are
609 no GCC targets for which a two-word type does not exist, so we
610 just let gfc_validate_kind abort and tell us if something breaks. */
612 gfc_default_double_kind
613 = gfc_validate_kind (BT_REAL
, gfc_default_real_kind
* 2, false);
616 /* The default logical kind is constrained to be the same as the
617 default integer kind. Similarly with complex and real. */
618 gfc_default_logical_kind
= gfc_default_integer_kind
;
619 gfc_default_complex_kind
= gfc_default_real_kind
;
621 /* We only have two character kinds: ASCII and UCS-4.
622 ASCII corresponds to a 8-bit integer type, if one is available.
623 UCS-4 corresponds to a 32-bit integer type, if one is available. */
625 if ((kind
= get_int_kind_from_width (8)) > 0)
627 gfc_character_kinds
[i_index
].kind
= kind
;
628 gfc_character_kinds
[i_index
].bit_size
= 8;
629 gfc_character_kinds
[i_index
].name
= "ascii";
632 if ((kind
= get_int_kind_from_width (32)) > 0)
634 gfc_character_kinds
[i_index
].kind
= kind
;
635 gfc_character_kinds
[i_index
].bit_size
= 32;
636 gfc_character_kinds
[i_index
].name
= "iso_10646";
640 /* Choose the smallest integer kind for our default character. */
641 gfc_default_character_kind
= gfc_character_kinds
[0].kind
;
642 gfc_character_storage_size
= gfc_default_character_kind
* 8;
644 gfc_index_integer_kind
= get_int_kind_from_name (PTRDIFF_TYPE
);
646 /* Pick a kind the same size as the C "int" type. */
647 gfc_c_int_kind
= INT_TYPE_SIZE
/ 8;
649 /* Choose atomic kinds to match C's int. */
650 gfc_atomic_int_kind
= gfc_c_int_kind
;
651 gfc_atomic_logical_kind
= gfc_c_int_kind
;
655 /* Make sure that a valid kind is present. Returns an index into the
656 associated kinds array, -1 if the kind is not present. */
659 validate_integer (int kind
)
663 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
664 if (gfc_integer_kinds
[i
].kind
== kind
)
671 validate_real (int kind
)
675 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
676 if (gfc_real_kinds
[i
].kind
== kind
)
683 validate_logical (int kind
)
687 for (i
= 0; gfc_logical_kinds
[i
].kind
; i
++)
688 if (gfc_logical_kinds
[i
].kind
== kind
)
695 validate_character (int kind
)
699 for (i
= 0; gfc_character_kinds
[i
].kind
; i
++)
700 if (gfc_character_kinds
[i
].kind
== kind
)
706 /* Validate a kind given a basic type. The return value is the same
707 for the child functions, with -1 indicating nonexistence of the
708 type. If MAY_FAIL is false, then -1 is never returned, and we ICE. */
711 gfc_validate_kind (bt type
, int kind
, bool may_fail
)
717 case BT_REAL
: /* Fall through */
719 rc
= validate_real (kind
);
722 rc
= validate_integer (kind
);
725 rc
= validate_logical (kind
);
728 rc
= validate_character (kind
);
732 gfc_internal_error ("gfc_validate_kind(): Got bad type");
735 if (rc
< 0 && !may_fail
)
736 gfc_internal_error ("gfc_validate_kind(): Got bad kind");
742 /* Four subroutines of gfc_init_types. Create type nodes for the given kind.
743 Reuse common type nodes where possible. Recognize if the kind matches up
744 with a C type. This will be used later in determining which routines may
745 be scarfed from libm. */
748 gfc_build_int_type (gfc_integer_info
*info
)
750 int mode_precision
= info
->bit_size
;
752 if (mode_precision
== CHAR_TYPE_SIZE
)
754 if (mode_precision
== SHORT_TYPE_SIZE
)
756 if (mode_precision
== INT_TYPE_SIZE
)
758 if (mode_precision
== LONG_TYPE_SIZE
)
760 if (mode_precision
== LONG_LONG_TYPE_SIZE
)
761 info
->c_long_long
= 1;
763 if (TYPE_PRECISION (intQI_type_node
) == mode_precision
)
764 return intQI_type_node
;
765 if (TYPE_PRECISION (intHI_type_node
) == mode_precision
)
766 return intHI_type_node
;
767 if (TYPE_PRECISION (intSI_type_node
) == mode_precision
)
768 return intSI_type_node
;
769 if (TYPE_PRECISION (intDI_type_node
) == mode_precision
)
770 return intDI_type_node
;
771 if (TYPE_PRECISION (intTI_type_node
) == mode_precision
)
772 return intTI_type_node
;
774 return make_signed_type (mode_precision
);
778 gfc_build_uint_type (int size
)
780 if (size
== CHAR_TYPE_SIZE
)
781 return unsigned_char_type_node
;
782 if (size
== SHORT_TYPE_SIZE
)
783 return short_unsigned_type_node
;
784 if (size
== INT_TYPE_SIZE
)
785 return unsigned_type_node
;
786 if (size
== LONG_TYPE_SIZE
)
787 return long_unsigned_type_node
;
788 if (size
== LONG_LONG_TYPE_SIZE
)
789 return long_long_unsigned_type_node
;
791 return make_unsigned_type (size
);
796 gfc_build_real_type (gfc_real_info
*info
)
798 int mode_precision
= info
->mode_precision
;
801 if (mode_precision
== FLOAT_TYPE_SIZE
)
803 if (mode_precision
== DOUBLE_TYPE_SIZE
)
805 if (mode_precision
== LONG_DOUBLE_TYPE_SIZE
)
806 info
->c_long_double
= 1;
807 if (mode_precision
!= LONG_DOUBLE_TYPE_SIZE
&& mode_precision
== 128)
809 info
->c_float128
= 1;
810 gfc_real16_is_float128
= true;
813 if (TYPE_PRECISION (float_type_node
) == mode_precision
)
814 return float_type_node
;
815 if (TYPE_PRECISION (double_type_node
) == mode_precision
)
816 return double_type_node
;
817 if (TYPE_PRECISION (long_double_type_node
) == mode_precision
)
818 return long_double_type_node
;
820 new_type
= make_node (REAL_TYPE
);
821 TYPE_PRECISION (new_type
) = mode_precision
;
822 layout_type (new_type
);
827 gfc_build_complex_type (tree scalar_type
)
831 if (scalar_type
== NULL
)
833 if (scalar_type
== float_type_node
)
834 return complex_float_type_node
;
835 if (scalar_type
== double_type_node
)
836 return complex_double_type_node
;
837 if (scalar_type
== long_double_type_node
)
838 return complex_long_double_type_node
;
840 new_type
= make_node (COMPLEX_TYPE
);
841 TREE_TYPE (new_type
) = scalar_type
;
842 layout_type (new_type
);
847 gfc_build_logical_type (gfc_logical_info
*info
)
849 int bit_size
= info
->bit_size
;
852 if (bit_size
== BOOL_TYPE_SIZE
)
855 return boolean_type_node
;
858 new_type
= make_unsigned_type (bit_size
);
859 TREE_SET_CODE (new_type
, BOOLEAN_TYPE
);
860 TYPE_MAX_VALUE (new_type
) = build_int_cst (new_type
, 1);
861 TYPE_PRECISION (new_type
) = 1;
867 /* Create the backend type nodes. We map them to their
868 equivalent C type, at least for now. We also give
869 names to the types here, and we push them in the
870 global binding level context.*/
873 gfc_init_types (void)
880 /* Create and name the types. */
881 #define PUSH_TYPE(name, node) \
882 pushdecl (build_decl (input_location, \
883 TYPE_DECL, get_identifier (name), node))
885 for (index
= 0; gfc_integer_kinds
[index
].kind
!= 0; ++index
)
887 type
= gfc_build_int_type (&gfc_integer_kinds
[index
]);
888 /* Ensure integer(kind=1) doesn't have TYPE_STRING_FLAG set. */
889 if (TYPE_STRING_FLAG (type
))
890 type
= make_signed_type (gfc_integer_kinds
[index
].bit_size
);
891 gfc_integer_types
[index
] = type
;
892 snprintf (name_buf
, sizeof(name_buf
), "integer(kind=%d)",
893 gfc_integer_kinds
[index
].kind
);
894 PUSH_TYPE (name_buf
, type
);
897 for (index
= 0; gfc_logical_kinds
[index
].kind
!= 0; ++index
)
899 type
= gfc_build_logical_type (&gfc_logical_kinds
[index
]);
900 gfc_logical_types
[index
] = type
;
901 snprintf (name_buf
, sizeof(name_buf
), "logical(kind=%d)",
902 gfc_logical_kinds
[index
].kind
);
903 PUSH_TYPE (name_buf
, type
);
906 for (index
= 0; gfc_real_kinds
[index
].kind
!= 0; index
++)
908 type
= gfc_build_real_type (&gfc_real_kinds
[index
]);
909 gfc_real_types
[index
] = type
;
910 snprintf (name_buf
, sizeof(name_buf
), "real(kind=%d)",
911 gfc_real_kinds
[index
].kind
);
912 PUSH_TYPE (name_buf
, type
);
914 if (gfc_real_kinds
[index
].c_float128
)
915 float128_type_node
= type
;
917 type
= gfc_build_complex_type (type
);
918 gfc_complex_types
[index
] = type
;
919 snprintf (name_buf
, sizeof(name_buf
), "complex(kind=%d)",
920 gfc_real_kinds
[index
].kind
);
921 PUSH_TYPE (name_buf
, type
);
923 if (gfc_real_kinds
[index
].c_float128
)
924 complex_float128_type_node
= type
;
927 for (index
= 0; gfc_character_kinds
[index
].kind
!= 0; ++index
)
929 type
= gfc_build_uint_type (gfc_character_kinds
[index
].bit_size
);
930 type
= build_qualified_type (type
, TYPE_UNQUALIFIED
);
931 snprintf (name_buf
, sizeof(name_buf
), "character(kind=%d)",
932 gfc_character_kinds
[index
].kind
);
933 PUSH_TYPE (name_buf
, type
);
934 gfc_character_types
[index
] = type
;
935 gfc_pcharacter_types
[index
] = build_pointer_type (type
);
937 gfc_character1_type_node
= gfc_character_types
[0];
939 PUSH_TYPE ("byte", unsigned_char_type_node
);
940 PUSH_TYPE ("void", void_type_node
);
942 /* DBX debugging output gets upset if these aren't set. */
943 if (!TYPE_NAME (integer_type_node
))
944 PUSH_TYPE ("c_integer", integer_type_node
);
945 if (!TYPE_NAME (char_type_node
))
946 PUSH_TYPE ("c_char", char_type_node
);
950 pvoid_type_node
= build_pointer_type (void_type_node
);
951 prvoid_type_node
= build_qualified_type (pvoid_type_node
, TYPE_QUAL_RESTRICT
);
952 ppvoid_type_node
= build_pointer_type (pvoid_type_node
);
953 pchar_type_node
= build_pointer_type (gfc_character1_type_node
);
955 = build_pointer_type (build_function_type_list (void_type_node
, NULL_TREE
));
957 gfc_array_index_type
= gfc_get_int_type (gfc_index_integer_kind
);
958 /* We cannot use gfc_index_zero_node in definition of gfc_array_range_type,
959 since this function is called before gfc_init_constants. */
961 = build_range_type (gfc_array_index_type
,
962 build_int_cst (gfc_array_index_type
, 0),
965 /* The maximum array element size that can be handled is determined
966 by the number of bits available to store this field in the array
969 n
= TYPE_PRECISION (gfc_array_index_type
) - GFC_DTYPE_SIZE_SHIFT
;
970 gfc_max_array_element_size
971 = wide_int_to_tree (size_type_node
,
972 wi::mask (n
, UNSIGNED
,
973 TYPE_PRECISION (size_type_node
)));
975 boolean_type_node
= gfc_get_logical_type (gfc_default_logical_kind
);
976 boolean_true_node
= build_int_cst (boolean_type_node
, 1);
977 boolean_false_node
= build_int_cst (boolean_type_node
, 0);
979 /* ??? Shouldn't this be based on gfc_index_integer_kind or so? */
980 gfc_charlen_int_kind
= 4;
981 gfc_charlen_type_node
= gfc_get_int_type (gfc_charlen_int_kind
);
984 /* Get the type node for the given type and kind. */
987 gfc_get_int_type (int kind
)
989 int index
= gfc_validate_kind (BT_INTEGER
, kind
, true);
990 return index
< 0 ? 0 : gfc_integer_types
[index
];
994 gfc_get_real_type (int kind
)
996 int index
= gfc_validate_kind (BT_REAL
, kind
, true);
997 return index
< 0 ? 0 : gfc_real_types
[index
];
1001 gfc_get_complex_type (int kind
)
1003 int index
= gfc_validate_kind (BT_COMPLEX
, kind
, true);
1004 return index
< 0 ? 0 : gfc_complex_types
[index
];
1008 gfc_get_logical_type (int kind
)
1010 int index
= gfc_validate_kind (BT_LOGICAL
, kind
, true);
1011 return index
< 0 ? 0 : gfc_logical_types
[index
];
1015 gfc_get_char_type (int kind
)
1017 int index
= gfc_validate_kind (BT_CHARACTER
, kind
, true);
1018 return index
< 0 ? 0 : gfc_character_types
[index
];
1022 gfc_get_pchar_type (int kind
)
1024 int index
= gfc_validate_kind (BT_CHARACTER
, kind
, true);
1025 return index
< 0 ? 0 : gfc_pcharacter_types
[index
];
1029 /* Create a character type with the given kind and length. */
1032 gfc_get_character_type_len_for_eltype (tree eltype
, tree len
)
1036 bounds
= build_range_type (gfc_charlen_type_node
, gfc_index_one_node
, len
);
1037 type
= build_array_type (eltype
, bounds
);
1038 TYPE_STRING_FLAG (type
) = 1;
1044 gfc_get_character_type_len (int kind
, tree len
)
1046 gfc_validate_kind (BT_CHARACTER
, kind
, false);
1047 return gfc_get_character_type_len_for_eltype (gfc_get_char_type (kind
), len
);
1051 /* Get a type node for a character kind. */
1054 gfc_get_character_type (int kind
, gfc_charlen
* cl
)
1058 len
= (cl
== NULL
) ? NULL_TREE
: cl
->backend_decl
;
1060 return gfc_get_character_type_len (kind
, len
);
1063 /* Covert a basic type. This will be an array for character types. */
1066 gfc_typenode_for_spec (gfc_typespec
* spec
)
1076 /* We use INTEGER(c_intptr_t) for C_PTR and C_FUNPTR once the symbol
1077 has been resolved. This is done so we can convert C_PTR and
1078 C_FUNPTR to simple variables that get translated to (void *). */
1079 if (spec
->f90_type
== BT_VOID
)
1082 && spec
->u
.derived
->intmod_sym_id
== ISOCBINDING_PTR
)
1083 basetype
= ptr_type_node
;
1085 basetype
= pfunc_type_node
;
1088 basetype
= gfc_get_int_type (spec
->kind
);
1092 basetype
= gfc_get_real_type (spec
->kind
);
1096 basetype
= gfc_get_complex_type (spec
->kind
);
1100 basetype
= gfc_get_logical_type (spec
->kind
);
1106 basetype
= gfc_get_character_type (spec
->kind
, NULL
);
1109 basetype
= gfc_get_character_type (spec
->kind
, spec
->u
.cl
);
1113 /* Since this cannot be used, return a length one character. */
1114 basetype
= gfc_get_character_type_len (gfc_default_character_kind
,
1115 gfc_index_one_node
);
1120 basetype
= gfc_get_derived_type (spec
->u
.derived
);
1122 if (spec
->type
== BT_CLASS
)
1123 GFC_CLASS_TYPE_P (basetype
) = 1;
1125 /* If we're dealing with either C_PTR or C_FUNPTR, we modified the
1126 type and kind to fit a (void *) and the basetype returned was a
1127 ptr_type_node. We need to pass up this new information to the
1128 symbol that was declared of type C_PTR or C_FUNPTR. */
1129 if (spec
->u
.derived
->ts
.f90_type
== BT_VOID
)
1131 spec
->type
= BT_INTEGER
;
1132 spec
->kind
= gfc_index_integer_kind
;
1133 spec
->f90_type
= BT_VOID
;
1138 /* This is for the second arg to c_f_pointer and c_f_procpointer
1139 of the iso_c_binding module, to accept any ptr type. */
1140 basetype
= ptr_type_node
;
1141 if (spec
->f90_type
== BT_VOID
)
1144 && spec
->u
.derived
->intmod_sym_id
== ISOCBINDING_PTR
)
1145 basetype
= ptr_type_node
;
1147 basetype
= pfunc_type_node
;
1156 /* Build an INT_CST for constant expressions, otherwise return NULL_TREE. */
1159 gfc_conv_array_bound (gfc_expr
* expr
)
1161 /* If expr is an integer constant, return that. */
1162 if (expr
!= NULL
&& expr
->expr_type
== EXPR_CONSTANT
)
1163 return gfc_conv_mpz_to_tree (expr
->value
.integer
, gfc_index_integer_kind
);
1165 /* Otherwise return NULL. */
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 gcc_assert (sym
->attr
.dimension
|| sym
->attr
.codimension
);
1283 /* We only want local arrays. */
1284 if (sym
->attr
.pointer
|| sym
->attr
.allocatable
)
1287 /* We want a descriptor for associate-name arrays that do not have an
1288 explicitly known shape already. */
1289 if (sym
->assoc
&& sym
->as
->type
!= AS_EXPLICIT
)
1292 if (sym
->attr
.dummy
)
1293 return sym
->as
->type
!= AS_ASSUMED_SHAPE
1294 && sym
->as
->type
!= AS_ASSUMED_RANK
;
1296 if (sym
->attr
.result
|| sym
->attr
.function
)
1299 gcc_assert (sym
->as
->type
== AS_EXPLICIT
|| sym
->as
->cp_was_assumed
);
1305 /* Create an array descriptor type. */
1308 gfc_build_array_type (tree type
, gfc_array_spec
* as
,
1309 enum gfc_array_kind akind
, bool restricted
,
1312 tree lbound
[GFC_MAX_DIMENSIONS
];
1313 tree ubound
[GFC_MAX_DIMENSIONS
];
1316 /* Assumed-shape arrays do not have codimension information stored in the
1318 corank
= as
->corank
;
1319 if (as
->type
== AS_ASSUMED_SHAPE
||
1320 (as
->type
== AS_ASSUMED_RANK
&& akind
== GFC_ARRAY_ALLOCATABLE
))
1323 if (as
->type
== AS_ASSUMED_RANK
)
1324 for (n
= 0; n
< GFC_MAX_DIMENSIONS
; n
++)
1326 lbound
[n
] = NULL_TREE
;
1327 ubound
[n
] = NULL_TREE
;
1330 for (n
= 0; n
< as
->rank
; n
++)
1332 /* Create expressions for the known bounds of the array. */
1333 if (as
->type
== AS_ASSUMED_SHAPE
&& as
->lower
[n
] == NULL
)
1334 lbound
[n
] = gfc_index_one_node
;
1336 lbound
[n
] = gfc_conv_array_bound (as
->lower
[n
]);
1337 ubound
[n
] = gfc_conv_array_bound (as
->upper
[n
]);
1340 for (n
= as
->rank
; n
< as
->rank
+ corank
; n
++)
1342 if (as
->type
!= AS_DEFERRED
&& as
->lower
[n
] == NULL
)
1343 lbound
[n
] = gfc_index_one_node
;
1345 lbound
[n
] = gfc_conv_array_bound (as
->lower
[n
]);
1347 if (n
< as
->rank
+ corank
- 1)
1348 ubound
[n
] = gfc_conv_array_bound (as
->upper
[n
]);
1351 if (as
->type
== AS_ASSUMED_SHAPE
)
1352 akind
= contiguous
? GFC_ARRAY_ASSUMED_SHAPE_CONT
1353 : GFC_ARRAY_ASSUMED_SHAPE
;
1354 else if (as
->type
== AS_ASSUMED_RANK
)
1355 akind
= contiguous
? GFC_ARRAY_ASSUMED_RANK_CONT
1356 : GFC_ARRAY_ASSUMED_RANK
;
1357 return gfc_get_array_type_bounds (type
, as
->rank
== -1
1358 ? GFC_MAX_DIMENSIONS
: as
->rank
,
1360 ubound
, 0, akind
, restricted
);
1363 /* Returns the struct descriptor_dimension type. */
1366 gfc_get_desc_dim_type (void)
1369 tree decl
, *chain
= NULL
;
1371 if (gfc_desc_dim_type
)
1372 return gfc_desc_dim_type
;
1374 /* Build the type node. */
1375 type
= make_node (RECORD_TYPE
);
1377 TYPE_NAME (type
) = get_identifier ("descriptor_dimension");
1378 TYPE_PACKED (type
) = 1;
1380 /* Consists of the stride, lbound and ubound members. */
1381 decl
= gfc_add_field_to_struct_1 (type
,
1382 get_identifier ("stride"),
1383 gfc_array_index_type
, &chain
);
1384 TREE_NO_WARNING (decl
) = 1;
1386 decl
= gfc_add_field_to_struct_1 (type
,
1387 get_identifier ("lbound"),
1388 gfc_array_index_type
, &chain
);
1389 TREE_NO_WARNING (decl
) = 1;
1391 decl
= gfc_add_field_to_struct_1 (type
,
1392 get_identifier ("ubound"),
1393 gfc_array_index_type
, &chain
);
1394 TREE_NO_WARNING (decl
) = 1;
1396 /* Finish off the type. */
1397 gfc_finish_type (type
);
1398 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
)) = 1;
1400 gfc_desc_dim_type
= type
;
1405 /* Return the DTYPE for an array. This describes the type and type parameters
1407 /* TODO: Only call this when the value is actually used, and make all the
1408 unknown cases abort. */
1411 gfc_get_dtype_rank_type (int rank
, tree etype
)
1419 switch (TREE_CODE (etype
))
1437 /* We will never have arrays of arrays. */
1451 /* TODO: Don't do dtype for temporary descriptorless arrays. */
1452 /* We can strange array types for temporary arrays. */
1453 return gfc_index_zero_node
;
1456 gcc_assert (rank
<= GFC_DTYPE_RANK_MASK
);
1457 size
= TYPE_SIZE_UNIT (etype
);
1459 i
= rank
| (n
<< GFC_DTYPE_TYPE_SHIFT
);
1460 if (size
&& INTEGER_CST_P (size
))
1462 if (tree_int_cst_lt (gfc_max_array_element_size
, size
))
1463 gfc_fatal_error ("Array element size too big at %C");
1465 i
+= TREE_INT_CST_LOW (size
) << GFC_DTYPE_SIZE_SHIFT
;
1467 dtype
= build_int_cst (gfc_array_index_type
, i
);
1469 if (size
&& !INTEGER_CST_P (size
))
1471 tmp
= build_int_cst (gfc_array_index_type
, GFC_DTYPE_SIZE_SHIFT
);
1472 tmp
= fold_build2_loc (input_location
, LSHIFT_EXPR
,
1473 gfc_array_index_type
,
1474 fold_convert (gfc_array_index_type
, size
), tmp
);
1475 dtype
= fold_build2_loc (input_location
, PLUS_EXPR
, gfc_array_index_type
,
1478 /* If we don't know the size we leave it as zero. This should never happen
1479 for anything that is actually used. */
1480 /* TODO: Check this is actually true, particularly when repacking
1481 assumed size parameters. */
1488 gfc_get_dtype (tree type
)
1494 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type
) || GFC_ARRAY_TYPE_P (type
));
1496 if (GFC_TYPE_ARRAY_DTYPE (type
))
1497 return GFC_TYPE_ARRAY_DTYPE (type
);
1499 rank
= GFC_TYPE_ARRAY_RANK (type
);
1500 etype
= gfc_get_element_type (type
);
1501 dtype
= gfc_get_dtype_rank_type (rank
, etype
);
1503 GFC_TYPE_ARRAY_DTYPE (type
) = dtype
;
1508 /* Build an array type for use without a descriptor, packed according
1509 to the value of PACKED. */
1512 gfc_get_nodesc_array_type (tree etype
, gfc_array_spec
* as
, gfc_packed packed
,
1526 mpz_init_set_ui (offset
, 0);
1527 mpz_init_set_ui (stride
, 1);
1530 /* We don't use build_array_type because this does not include include
1531 lang-specific information (i.e. the bounds of the array) when checking
1534 type
= make_node (ARRAY_TYPE
);
1536 type
= build_variant_type_copy (etype
);
1538 GFC_ARRAY_TYPE_P (type
) = 1;
1539 TYPE_LANG_SPECIFIC (type
) = ggc_cleared_alloc
<struct lang_type
> ();
1541 known_stride
= (packed
!= PACKED_NO
);
1543 for (n
= 0; n
< as
->rank
; n
++)
1545 /* Fill in the stride and bound components of the type. */
1547 tmp
= gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1550 GFC_TYPE_ARRAY_STRIDE (type
, n
) = tmp
;
1552 expr
= as
->lower
[n
];
1553 if (expr
->expr_type
== EXPR_CONSTANT
)
1555 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1556 gfc_index_integer_kind
);
1563 GFC_TYPE_ARRAY_LBOUND (type
, n
) = tmp
;
1567 /* Calculate the offset. */
1568 mpz_mul (delta
, stride
, as
->lower
[n
]->value
.integer
);
1569 mpz_sub (offset
, offset
, delta
);
1574 expr
= as
->upper
[n
];
1575 if (expr
&& expr
->expr_type
== EXPR_CONSTANT
)
1577 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1578 gfc_index_integer_kind
);
1585 GFC_TYPE_ARRAY_UBOUND (type
, n
) = tmp
;
1589 /* Calculate the stride. */
1590 mpz_sub (delta
, as
->upper
[n
]->value
.integer
,
1591 as
->lower
[n
]->value
.integer
);
1592 mpz_add_ui (delta
, delta
, 1);
1593 mpz_mul (stride
, stride
, delta
);
1596 /* Only the first stride is known for partial packed arrays. */
1597 if (packed
== PACKED_NO
|| packed
== PACKED_PARTIAL
)
1600 for (n
= as
->rank
; n
< as
->rank
+ as
->corank
; n
++)
1602 expr
= as
->lower
[n
];
1603 if (expr
->expr_type
== EXPR_CONSTANT
)
1604 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1605 gfc_index_integer_kind
);
1608 GFC_TYPE_ARRAY_LBOUND (type
, n
) = tmp
;
1610 expr
= as
->upper
[n
];
1611 if (expr
&& expr
->expr_type
== EXPR_CONSTANT
)
1612 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1613 gfc_index_integer_kind
);
1616 if (n
< as
->rank
+ as
->corank
- 1)
1617 GFC_TYPE_ARRAY_UBOUND (type
, n
) = tmp
;
1622 GFC_TYPE_ARRAY_OFFSET (type
) =
1623 gfc_conv_mpz_to_tree (offset
, gfc_index_integer_kind
);
1626 GFC_TYPE_ARRAY_OFFSET (type
) = NULL_TREE
;
1630 GFC_TYPE_ARRAY_SIZE (type
) =
1631 gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1634 GFC_TYPE_ARRAY_SIZE (type
) = NULL_TREE
;
1636 GFC_TYPE_ARRAY_RANK (type
) = as
->rank
;
1637 GFC_TYPE_ARRAY_CORANK (type
) = as
->corank
;
1638 GFC_TYPE_ARRAY_DTYPE (type
) = NULL_TREE
;
1639 range
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
1641 /* TODO: use main type if it is unbounded. */
1642 GFC_TYPE_ARRAY_DATAPTR_TYPE (type
) =
1643 build_pointer_type (build_array_type (etype
, range
));
1645 GFC_TYPE_ARRAY_DATAPTR_TYPE (type
) =
1646 build_qualified_type (GFC_TYPE_ARRAY_DATAPTR_TYPE (type
),
1647 TYPE_QUAL_RESTRICT
);
1651 if (packed
!= PACKED_STATIC
|| flag_coarray
== GFC_FCOARRAY_LIB
)
1653 type
= build_pointer_type (type
);
1656 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
1658 GFC_ARRAY_TYPE_P (type
) = 1;
1659 TYPE_LANG_SPECIFIC (type
) = TYPE_LANG_SPECIFIC (TREE_TYPE (type
));
1667 mpz_sub_ui (stride
, stride
, 1);
1668 range
= gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1673 range
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
, range
);
1674 TYPE_DOMAIN (type
) = range
;
1676 build_pointer_type (etype
);
1677 TREE_TYPE (type
) = etype
;
1685 /* Represent packed arrays as multi-dimensional if they have rank >
1686 1 and with proper bounds, instead of flat arrays. This makes for
1687 better debug info. */
1690 tree gtype
= etype
, rtype
, type_decl
;
1692 for (n
= as
->rank
- 1; n
>= 0; n
--)
1694 rtype
= build_range_type (gfc_array_index_type
,
1695 GFC_TYPE_ARRAY_LBOUND (type
, n
),
1696 GFC_TYPE_ARRAY_UBOUND (type
, n
));
1697 gtype
= build_array_type (gtype
, rtype
);
1699 TYPE_NAME (type
) = type_decl
= build_decl (input_location
,
1700 TYPE_DECL
, NULL
, gtype
);
1701 DECL_ORIGINAL_TYPE (type_decl
) = gtype
;
1704 if (packed
!= PACKED_STATIC
|| !known_stride
1705 || (as
->corank
&& flag_coarray
== GFC_FCOARRAY_LIB
))
1707 /* For dummy arrays and automatic (heap allocated) arrays we
1708 want a pointer to the array. */
1709 type
= build_pointer_type (type
);
1711 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
1712 GFC_ARRAY_TYPE_P (type
) = 1;
1713 TYPE_LANG_SPECIFIC (type
) = TYPE_LANG_SPECIFIC (TREE_TYPE (type
));
1719 /* Return or create the base type for an array descriptor. */
1722 gfc_get_array_descriptor_base (int dimen
, int codimen
, bool restricted
,
1723 enum gfc_array_kind akind
)
1725 tree fat_type
, decl
, arraytype
, *chain
= NULL
;
1726 char name
[16 + 2*GFC_RANK_DIGITS
+ 1 + 1];
1729 /* Assumed-rank array. */
1731 dimen
= GFC_MAX_DIMENSIONS
;
1733 idx
= 2 * (codimen
+ dimen
) + restricted
;
1735 gcc_assert (codimen
+ dimen
>= 0 && codimen
+ dimen
<= GFC_MAX_DIMENSIONS
);
1737 if (flag_coarray
== GFC_FCOARRAY_LIB
&& codimen
)
1739 if (gfc_array_descriptor_base_caf
[idx
])
1740 return gfc_array_descriptor_base_caf
[idx
];
1742 else if (gfc_array_descriptor_base
[idx
])
1743 return gfc_array_descriptor_base
[idx
];
1745 /* Build the type node. */
1746 fat_type
= make_node (RECORD_TYPE
);
1748 sprintf (name
, "array_descriptor" GFC_RANK_PRINTF_FORMAT
, dimen
+ codimen
);
1749 TYPE_NAME (fat_type
) = get_identifier (name
);
1750 TYPE_NAMELESS (fat_type
) = 1;
1752 /* Add the data member as the first element of the descriptor. */
1753 decl
= gfc_add_field_to_struct_1 (fat_type
,
1754 get_identifier ("data"),
1757 : ptr_type_node
), &chain
);
1759 /* Add the base component. */
1760 decl
= gfc_add_field_to_struct_1 (fat_type
,
1761 get_identifier ("offset"),
1762 gfc_array_index_type
, &chain
);
1763 TREE_NO_WARNING (decl
) = 1;
1765 /* Add the dtype component. */
1766 decl
= gfc_add_field_to_struct_1 (fat_type
,
1767 get_identifier ("dtype"),
1768 gfc_array_index_type
, &chain
);
1769 TREE_NO_WARNING (decl
) = 1;
1771 /* Build the array type for the stride and bound components. */
1772 if (dimen
+ codimen
> 0)
1775 build_array_type (gfc_get_desc_dim_type (),
1776 build_range_type (gfc_array_index_type
,
1777 gfc_index_zero_node
,
1778 gfc_rank_cst
[codimen
+ dimen
- 1]));
1780 decl
= gfc_add_field_to_struct_1 (fat_type
, get_identifier ("dim"),
1782 TREE_NO_WARNING (decl
) = 1;
1785 if (flag_coarray
== GFC_FCOARRAY_LIB
&& codimen
1786 && akind
== GFC_ARRAY_ALLOCATABLE
)
1788 decl
= gfc_add_field_to_struct_1 (fat_type
,
1789 get_identifier ("token"),
1790 prvoid_type_node
, &chain
);
1791 TREE_NO_WARNING (decl
) = 1;
1794 /* Finish off the type. */
1795 gfc_finish_type (fat_type
);
1796 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (fat_type
)) = 1;
1798 if (flag_coarray
== GFC_FCOARRAY_LIB
&& codimen
1799 && akind
== GFC_ARRAY_ALLOCATABLE
)
1800 gfc_array_descriptor_base_caf
[idx
] = fat_type
;
1802 gfc_array_descriptor_base
[idx
] = fat_type
;
1808 /* Build an array (descriptor) type with given bounds. */
1811 gfc_get_array_type_bounds (tree etype
, int dimen
, int codimen
, tree
* lbound
,
1812 tree
* ubound
, int packed
,
1813 enum gfc_array_kind akind
, bool restricted
)
1815 char name
[8 + 2*GFC_RANK_DIGITS
+ 1 + GFC_MAX_SYMBOL_LEN
];
1816 tree fat_type
, base_type
, arraytype
, lower
, upper
, stride
, tmp
, rtype
;
1817 const char *type_name
;
1820 base_type
= gfc_get_array_descriptor_base (dimen
, codimen
, restricted
, akind
);
1821 fat_type
= build_distinct_type_copy (base_type
);
1822 /* Make sure that nontarget and target array type have the same canonical
1823 type (and same stub decl for debug info). */
1824 base_type
= gfc_get_array_descriptor_base (dimen
, codimen
, false, akind
);
1825 TYPE_CANONICAL (fat_type
) = base_type
;
1826 TYPE_STUB_DECL (fat_type
) = TYPE_STUB_DECL (base_type
);
1828 tmp
= TYPE_NAME (etype
);
1829 if (tmp
&& TREE_CODE (tmp
) == TYPE_DECL
)
1830 tmp
= DECL_NAME (tmp
);
1832 type_name
= IDENTIFIER_POINTER (tmp
);
1834 type_name
= "unknown";
1835 sprintf (name
, "array" GFC_RANK_PRINTF_FORMAT
"_%.*s", dimen
+ codimen
,
1836 GFC_MAX_SYMBOL_LEN
, type_name
);
1837 TYPE_NAME (fat_type
) = get_identifier (name
);
1838 TYPE_NAMELESS (fat_type
) = 1;
1840 GFC_DESCRIPTOR_TYPE_P (fat_type
) = 1;
1841 TYPE_LANG_SPECIFIC (fat_type
) = ggc_cleared_alloc
<struct lang_type
> ();
1843 GFC_TYPE_ARRAY_RANK (fat_type
) = dimen
;
1844 GFC_TYPE_ARRAY_CORANK (fat_type
) = codimen
;
1845 GFC_TYPE_ARRAY_DTYPE (fat_type
) = NULL_TREE
;
1846 GFC_TYPE_ARRAY_AKIND (fat_type
) = akind
;
1848 /* Build an array descriptor record type. */
1850 stride
= gfc_index_one_node
;
1853 for (n
= 0; n
< dimen
+ codimen
; n
++)
1856 GFC_TYPE_ARRAY_STRIDE (fat_type
, n
) = stride
;
1863 if (lower
!= NULL_TREE
)
1865 if (INTEGER_CST_P (lower
))
1866 GFC_TYPE_ARRAY_LBOUND (fat_type
, n
) = lower
;
1871 if (codimen
&& n
== dimen
+ codimen
- 1)
1875 if (upper
!= NULL_TREE
)
1877 if (INTEGER_CST_P (upper
))
1878 GFC_TYPE_ARRAY_UBOUND (fat_type
, n
) = upper
;
1886 if (upper
!= NULL_TREE
&& lower
!= NULL_TREE
&& stride
!= NULL_TREE
)
1888 tmp
= fold_build2_loc (input_location
, MINUS_EXPR
,
1889 gfc_array_index_type
, upper
, lower
);
1890 tmp
= fold_build2_loc (input_location
, PLUS_EXPR
,
1891 gfc_array_index_type
, tmp
,
1892 gfc_index_one_node
);
1893 stride
= fold_build2_loc (input_location
, MULT_EXPR
,
1894 gfc_array_index_type
, tmp
, stride
);
1895 /* Check the folding worked. */
1896 gcc_assert (INTEGER_CST_P (stride
));
1901 GFC_TYPE_ARRAY_SIZE (fat_type
) = stride
;
1903 /* TODO: known offsets for descriptors. */
1904 GFC_TYPE_ARRAY_OFFSET (fat_type
) = NULL_TREE
;
1908 arraytype
= build_pointer_type (etype
);
1910 arraytype
= build_qualified_type (arraytype
, TYPE_QUAL_RESTRICT
);
1912 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type
) = arraytype
;
1916 /* We define data as an array with the correct size if possible.
1917 Much better than doing pointer arithmetic. */
1919 rtype
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
1920 int_const_binop (MINUS_EXPR
, stride
,
1921 build_int_cst (TREE_TYPE (stride
), 1)));
1923 rtype
= gfc_array_range_type
;
1924 arraytype
= build_array_type (etype
, rtype
);
1925 arraytype
= build_pointer_type (arraytype
);
1927 arraytype
= build_qualified_type (arraytype
, TYPE_QUAL_RESTRICT
);
1928 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type
) = arraytype
;
1930 /* This will generate the base declarations we need to emit debug
1931 information for this type. FIXME: there must be a better way to
1932 avoid divergence between compilations with and without debug
1935 struct array_descr_info info
;
1936 gfc_get_array_descr_info (fat_type
, &info
);
1937 gfc_get_array_descr_info (build_pointer_type (fat_type
), &info
);
1943 /* Build a pointer type. This function is called from gfc_sym_type(). */
1946 gfc_build_pointer_type (gfc_symbol
* sym
, tree type
)
1948 /* Array pointer types aren't actually pointers. */
1949 if (sym
->attr
.dimension
)
1952 return build_pointer_type (type
);
1955 static tree
gfc_nonrestricted_type (tree t
);
1956 /* Given two record or union type nodes TO and FROM, ensure
1957 that all fields in FROM have a corresponding field in TO,
1958 their type being nonrestrict variants. This accepts a TO
1959 node that already has a prefix of the fields in FROM. */
1961 mirror_fields (tree to
, tree from
)
1966 /* Forward to the end of TOs fields. */
1967 fto
= TYPE_FIELDS (to
);
1968 ffrom
= TYPE_FIELDS (from
);
1969 chain
= &TYPE_FIELDS (to
);
1972 gcc_assert (ffrom
&& DECL_NAME (fto
) == DECL_NAME (ffrom
));
1973 chain
= &DECL_CHAIN (fto
);
1974 fto
= DECL_CHAIN (fto
);
1975 ffrom
= DECL_CHAIN (ffrom
);
1978 /* Now add all fields remaining in FROM (starting with ffrom). */
1979 for (; ffrom
; ffrom
= DECL_CHAIN (ffrom
))
1981 tree newfield
= copy_node (ffrom
);
1982 DECL_CONTEXT (newfield
) = to
;
1983 /* The store to DECL_CHAIN might seem redundant with the
1984 stores to *chain, but not clearing it here would mean
1985 leaving a chain into the old fields. If ever
1986 our called functions would look at them confusion
1988 DECL_CHAIN (newfield
) = NULL_TREE
;
1990 chain
= &DECL_CHAIN (newfield
);
1992 if (TREE_CODE (ffrom
) == FIELD_DECL
)
1994 tree elemtype
= gfc_nonrestricted_type (TREE_TYPE (ffrom
));
1995 TREE_TYPE (newfield
) = elemtype
;
2001 /* Given a type T, returns a different type of the same structure,
2002 except that all types it refers to (recursively) are always
2003 non-restrict qualified types. */
2005 gfc_nonrestricted_type (tree t
)
2009 /* If the type isn't laid out yet, don't copy it. If something
2010 needs it for real it should wait until the type got finished. */
2014 if (!TYPE_LANG_SPECIFIC (t
))
2015 TYPE_LANG_SPECIFIC (t
) = ggc_cleared_alloc
<struct lang_type
> ();
2016 /* If we're dealing with this very node already further up
2017 the call chain (recursion via pointers and struct members)
2018 we haven't yet determined if we really need a new type node.
2019 Assume we don't, return T itself. */
2020 if (TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
== error_mark_node
)
2023 /* If we have calculated this all already, just return it. */
2024 if (TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
)
2025 return TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
;
2027 /* Mark this type. */
2028 TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
= error_mark_node
;
2030 switch (TREE_CODE (t
))
2036 case REFERENCE_TYPE
:
2038 tree totype
= gfc_nonrestricted_type (TREE_TYPE (t
));
2039 if (totype
== TREE_TYPE (t
))
2041 else if (TREE_CODE (t
) == POINTER_TYPE
)
2042 ret
= build_pointer_type (totype
);
2044 ret
= build_reference_type (totype
);
2045 ret
= build_qualified_type (ret
,
2046 TYPE_QUALS (t
) & ~TYPE_QUAL_RESTRICT
);
2052 tree elemtype
= gfc_nonrestricted_type (TREE_TYPE (t
));
2053 if (elemtype
== TREE_TYPE (t
))
2057 ret
= build_variant_type_copy (t
);
2058 TREE_TYPE (ret
) = elemtype
;
2059 if (TYPE_LANG_SPECIFIC (t
)
2060 && GFC_TYPE_ARRAY_DATAPTR_TYPE (t
))
2062 tree dataptr_type
= GFC_TYPE_ARRAY_DATAPTR_TYPE (t
);
2063 dataptr_type
= gfc_nonrestricted_type (dataptr_type
);
2064 if (dataptr_type
!= GFC_TYPE_ARRAY_DATAPTR_TYPE (t
))
2066 TYPE_LANG_SPECIFIC (ret
)
2067 = ggc_cleared_alloc
<struct lang_type
> ();
2068 *TYPE_LANG_SPECIFIC (ret
) = *TYPE_LANG_SPECIFIC (t
);
2069 GFC_TYPE_ARRAY_DATAPTR_TYPE (ret
) = dataptr_type
;
2078 case QUAL_UNION_TYPE
:
2081 /* First determine if we need a new type at all.
2082 Careful, the two calls to gfc_nonrestricted_type per field
2083 might return different values. That happens exactly when
2084 one of the fields reaches back to this very record type
2085 (via pointers). The first calls will assume that we don't
2086 need to copy T (see the error_mark_node marking). If there
2087 are any reasons for copying T apart from having to copy T,
2088 we'll indeed copy it, and the second calls to
2089 gfc_nonrestricted_type will use that new node if they
2091 for (field
= TYPE_FIELDS (t
); field
; field
= DECL_CHAIN (field
))
2092 if (TREE_CODE (field
) == FIELD_DECL
)
2094 tree elemtype
= gfc_nonrestricted_type (TREE_TYPE (field
));
2095 if (elemtype
!= TREE_TYPE (field
))
2100 ret
= build_variant_type_copy (t
);
2101 TYPE_FIELDS (ret
) = NULL_TREE
;
2103 /* Here we make sure that as soon as we know we have to copy
2104 T, that also fields reaching back to us will use the new
2105 copy. It's okay if that copy still contains the old fields,
2106 we won't look at them. */
2107 TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
= ret
;
2108 mirror_fields (ret
, t
);
2113 TYPE_LANG_SPECIFIC (t
)->nonrestricted_type
= ret
;
2118 /* Return the type for a symbol. Special handling is required for character
2119 types to get the correct level of indirection.
2120 For functions return the return type.
2121 For subroutines return void_type_node.
2122 Calling this multiple times for the same symbol should be avoided,
2123 especially for character and array types. */
2126 gfc_sym_type (gfc_symbol
* sym
)
2132 /* Procedure Pointers inside COMMON blocks. */
2133 if (sym
->attr
.proc_pointer
&& sym
->attr
.in_common
)
2135 /* Unset proc_pointer as gfc_get_function_type calls gfc_sym_type. */
2136 sym
->attr
.proc_pointer
= 0;
2137 type
= build_pointer_type (gfc_get_function_type (sym
));
2138 sym
->attr
.proc_pointer
= 1;
2142 if (sym
->attr
.flavor
== FL_PROCEDURE
&& !sym
->attr
.function
)
2143 return void_type_node
;
2145 /* In the case of a function the fake result variable may have a
2146 type different from the function type, so don't return early in
2148 if (sym
->backend_decl
&& !sym
->attr
.function
)
2149 return TREE_TYPE (sym
->backend_decl
);
2151 if (sym
->ts
.type
== BT_CHARACTER
2152 && ((sym
->attr
.function
&& sym
->attr
.is_bind_c
)
2153 || (sym
->attr
.result
2154 && sym
->ns
->proc_name
2155 && sym
->ns
->proc_name
->attr
.is_bind_c
)))
2156 type
= gfc_character1_type_node
;
2158 type
= gfc_typenode_for_spec (&sym
->ts
);
2160 if (sym
->attr
.dummy
&& !sym
->attr
.function
&& !sym
->attr
.value
)
2165 restricted
= !sym
->attr
.target
&& !sym
->attr
.pointer
2166 && !sym
->attr
.proc_pointer
&& !sym
->attr
.cray_pointee
;
2168 type
= gfc_nonrestricted_type (type
);
2170 if (sym
->attr
.dimension
|| sym
->attr
.codimension
)
2172 if (gfc_is_nodesc_array (sym
))
2174 /* If this is a character argument of unknown length, just use the
2176 if (sym
->ts
.type
!= BT_CHARACTER
2177 || !(sym
->attr
.dummy
|| sym
->attr
.function
)
2178 || sym
->ts
.u
.cl
->backend_decl
)
2180 type
= gfc_get_nodesc_array_type (type
, sym
->as
,
2189 enum gfc_array_kind akind
= GFC_ARRAY_UNKNOWN
;
2190 if (sym
->attr
.pointer
)
2191 akind
= sym
->attr
.contiguous
? GFC_ARRAY_POINTER_CONT
2192 : GFC_ARRAY_POINTER
;
2193 else if (sym
->attr
.allocatable
)
2194 akind
= GFC_ARRAY_ALLOCATABLE
;
2195 type
= gfc_build_array_type (type
, sym
->as
, akind
, restricted
,
2196 sym
->attr
.contiguous
);
2201 if (sym
->attr
.allocatable
|| sym
->attr
.pointer
2202 || gfc_is_associate_pointer (sym
))
2203 type
= gfc_build_pointer_type (sym
, type
);
2206 /* We currently pass all parameters by reference.
2207 See f95_get_function_decl. For dummy function parameters return the
2211 /* We must use pointer types for potentially absent variables. The
2212 optimizers assume a reference type argument is never NULL. */
2213 if (sym
->attr
.optional
2214 || (sym
->ns
->proc_name
&& sym
->ns
->proc_name
->attr
.entry_master
))
2215 type
= build_pointer_type (type
);
2218 type
= build_reference_type (type
);
2220 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
2227 /* Layout and output debug info for a record type. */
2230 gfc_finish_type (tree type
)
2234 decl
= build_decl (input_location
,
2235 TYPE_DECL
, NULL_TREE
, type
);
2236 TYPE_STUB_DECL (type
) = decl
;
2238 rest_of_type_compilation (type
, 1);
2239 rest_of_decl_compilation (decl
, 1, 0);
2242 /* Add a field of given NAME and TYPE to the context of a UNION_TYPE
2243 or RECORD_TYPE pointed to by CONTEXT. The new field is chained
2244 to the end of the field list pointed to by *CHAIN.
2246 Returns a pointer to the new field. */
2249 gfc_add_field_to_struct_1 (tree context
, tree name
, tree type
, tree
**chain
)
2251 tree decl
= build_decl (input_location
, FIELD_DECL
, name
, type
);
2253 DECL_CONTEXT (decl
) = context
;
2254 DECL_CHAIN (decl
) = NULL_TREE
;
2255 if (TYPE_FIELDS (context
) == NULL_TREE
)
2256 TYPE_FIELDS (context
) = decl
;
2261 *chain
= &DECL_CHAIN (decl
);
2267 /* Like `gfc_add_field_to_struct_1', but adds alignment
2271 gfc_add_field_to_struct (tree context
, tree name
, tree type
, tree
**chain
)
2273 tree decl
= gfc_add_field_to_struct_1 (context
, name
, type
, chain
);
2275 DECL_INITIAL (decl
) = 0;
2276 DECL_ALIGN (decl
) = 0;
2277 DECL_USER_ALIGN (decl
) = 0;
2283 /* Copy the backend_decl and component backend_decls if
2284 the two derived type symbols are "equal", as described
2285 in 4.4.2 and resolved by gfc_compare_derived_types. */
2288 gfc_copy_dt_decls_ifequal (gfc_symbol
*from
, gfc_symbol
*to
,
2291 gfc_component
*to_cm
;
2292 gfc_component
*from_cm
;
2297 if (from
->backend_decl
== NULL
2298 || !gfc_compare_derived_types (from
, to
))
2301 to
->backend_decl
= from
->backend_decl
;
2303 to_cm
= to
->components
;
2304 from_cm
= from
->components
;
2306 /* Copy the component declarations. If a component is itself
2307 a derived type, we need a copy of its component declarations.
2308 This is done by recursing into gfc_get_derived_type and
2309 ensures that the component's component declarations have
2310 been built. If it is a character, we need the character
2312 for (; to_cm
; to_cm
= to_cm
->next
, from_cm
= from_cm
->next
)
2314 to_cm
->backend_decl
= from_cm
->backend_decl
;
2315 if (from_cm
->ts
.type
== BT_DERIVED
2316 && (!from_cm
->attr
.pointer
|| from_gsym
))
2317 gfc_get_derived_type (to_cm
->ts
.u
.derived
);
2318 else if (from_cm
->ts
.type
== BT_CLASS
2319 && (!CLASS_DATA (from_cm
)->attr
.class_pointer
|| from_gsym
))
2320 gfc_get_derived_type (to_cm
->ts
.u
.derived
);
2321 else if (from_cm
->ts
.type
== BT_CHARACTER
)
2322 to_cm
->ts
.u
.cl
->backend_decl
= from_cm
->ts
.u
.cl
->backend_decl
;
2329 /* Build a tree node for a procedure pointer component. */
2332 gfc_get_ppc_type (gfc_component
* c
)
2336 /* Explicit interface. */
2337 if (c
->attr
.if_source
!= IFSRC_UNKNOWN
&& c
->ts
.interface
)
2338 return build_pointer_type (gfc_get_function_type (c
->ts
.interface
));
2340 /* Implicit interface (only return value may be known). */
2341 if (c
->attr
.function
&& !c
->attr
.dimension
&& c
->ts
.type
!= BT_CHARACTER
)
2342 t
= gfc_typenode_for_spec (&c
->ts
);
2346 return build_pointer_type (build_function_type_list (t
, NULL_TREE
));
2350 /* Build a tree node for a derived type. If there are equal
2351 derived types, with different local names, these are built
2352 at the same time. If an equal derived type has been built
2353 in a parent namespace, this is used. */
2356 gfc_get_derived_type (gfc_symbol
* derived
)
2358 tree typenode
= NULL
, field
= NULL
, field_type
= NULL
;
2359 tree canonical
= NULL_TREE
;
2361 bool got_canonical
= false;
2362 bool unlimited_entity
= false;
2367 if (derived
->attr
.unlimited_polymorphic
)
2368 return ptr_type_node
;
2370 if (derived
&& derived
->attr
.flavor
== FL_PROCEDURE
2371 && derived
->attr
.generic
)
2372 derived
= gfc_find_dt_in_generic (derived
);
2374 /* See if it's one of the iso_c_binding derived types. */
2375 if (derived
->attr
.is_iso_c
== 1 || derived
->ts
.f90_type
== BT_VOID
)
2377 if (derived
->backend_decl
)
2378 return derived
->backend_decl
;
2380 if (derived
->intmod_sym_id
== ISOCBINDING_PTR
)
2381 derived
->backend_decl
= ptr_type_node
;
2383 derived
->backend_decl
= pfunc_type_node
;
2385 derived
->ts
.kind
= gfc_index_integer_kind
;
2386 derived
->ts
.type
= BT_INTEGER
;
2387 /* Set the f90_type to BT_VOID as a way to recognize something of type
2388 BT_INTEGER that needs to fit a void * for the purpose of the
2389 iso_c_binding derived types. */
2390 derived
->ts
.f90_type
= BT_VOID
;
2392 return derived
->backend_decl
;
2395 /* If use associated, use the module type for this one. */
2396 if (derived
->backend_decl
== NULL
2397 && derived
->attr
.use_assoc
2399 && gfc_get_module_backend_decl (derived
))
2400 goto copy_derived_types
;
2402 /* The derived types from an earlier namespace can be used as the
2404 if (derived
->backend_decl
== NULL
&& !derived
->attr
.use_assoc
2405 && gfc_global_ns_list
)
2407 for (ns
= gfc_global_ns_list
;
2408 ns
->translated
&& !got_canonical
;
2411 dt
= ns
->derived_types
;
2412 for (; dt
&& !canonical
; dt
= dt
->next
)
2414 gfc_copy_dt_decls_ifequal (dt
->derived
, derived
, true);
2415 if (derived
->backend_decl
)
2416 got_canonical
= true;
2421 /* Store up the canonical type to be added to this one. */
2424 if (TYPE_CANONICAL (derived
->backend_decl
))
2425 canonical
= TYPE_CANONICAL (derived
->backend_decl
);
2427 canonical
= derived
->backend_decl
;
2429 derived
->backend_decl
= NULL_TREE
;
2432 /* derived->backend_decl != 0 means we saw it before, but its
2433 components' backend_decl may have not been built. */
2434 if (derived
->backend_decl
)
2436 /* Its components' backend_decl have been built or we are
2437 seeing recursion through the formal arglist of a procedure
2438 pointer component. */
2439 if (TYPE_FIELDS (derived
->backend_decl
)
2440 || derived
->attr
.proc_pointer_comp
)
2441 return derived
->backend_decl
;
2443 typenode
= derived
->backend_decl
;
2447 /* We see this derived type first time, so build the type node. */
2448 typenode
= make_node (RECORD_TYPE
);
2449 TYPE_NAME (typenode
) = get_identifier (derived
->name
);
2450 TYPE_PACKED (typenode
) = flag_pack_derived
;
2451 derived
->backend_decl
= typenode
;
2454 if (derived
->components
2455 && derived
->components
->ts
.type
== BT_DERIVED
2456 && strcmp (derived
->components
->name
, "_data") == 0
2457 && derived
->components
->ts
.u
.derived
->attr
.unlimited_polymorphic
)
2458 unlimited_entity
= true;
2460 /* Go through the derived type components, building them as
2461 necessary. The reason for doing this now is that it is
2462 possible to recurse back to this derived type through a
2463 pointer component (PR24092). If this happens, the fields
2464 will be built and so we can return the type. */
2465 for (c
= derived
->components
; c
; c
= c
->next
)
2467 if (c
->ts
.type
!= BT_DERIVED
&& c
->ts
.type
!= BT_CLASS
)
2470 if ((!c
->attr
.pointer
&& !c
->attr
.proc_pointer
)
2471 || c
->ts
.u
.derived
->backend_decl
== NULL
)
2472 c
->ts
.u
.derived
->backend_decl
= gfc_get_derived_type (c
->ts
.u
.derived
);
2474 if (c
->ts
.u
.derived
->attr
.is_iso_c
)
2476 /* Need to copy the modified ts from the derived type. The
2477 typespec was modified because C_PTR/C_FUNPTR are translated
2478 into (void *) from derived types. */
2479 c
->ts
.type
= c
->ts
.u
.derived
->ts
.type
;
2480 c
->ts
.kind
= c
->ts
.u
.derived
->ts
.kind
;
2481 c
->ts
.f90_type
= c
->ts
.u
.derived
->ts
.f90_type
;
2484 c
->initializer
->ts
.type
= c
->ts
.type
;
2485 c
->initializer
->ts
.kind
= c
->ts
.kind
;
2486 c
->initializer
->ts
.f90_type
= c
->ts
.f90_type
;
2487 c
->initializer
->expr_type
= EXPR_NULL
;
2492 if (TYPE_FIELDS (derived
->backend_decl
))
2493 return derived
->backend_decl
;
2495 /* Build the type member list. Install the newly created RECORD_TYPE
2496 node as DECL_CONTEXT of each FIELD_DECL. */
2497 for (c
= derived
->components
; c
; c
= c
->next
)
2499 if (c
->attr
.proc_pointer
)
2500 field_type
= gfc_get_ppc_type (c
);
2501 else if (c
->ts
.type
== BT_DERIVED
|| c
->ts
.type
== BT_CLASS
)
2502 field_type
= c
->ts
.u
.derived
->backend_decl
;
2505 if (c
->ts
.type
== BT_CHARACTER
&& !c
->ts
.deferred
)
2507 /* Evaluate the string length. */
2508 gfc_conv_const_charlen (c
->ts
.u
.cl
);
2509 gcc_assert (c
->ts
.u
.cl
->backend_decl
);
2511 else if (c
->ts
.type
== BT_CHARACTER
)
2512 c
->ts
.u
.cl
->backend_decl
2513 = build_int_cst (gfc_charlen_type_node
, 0);
2515 field_type
= gfc_typenode_for_spec (&c
->ts
);
2518 /* This returns an array descriptor type. Initialization may be
2520 if ((c
->attr
.dimension
|| c
->attr
.codimension
) && !c
->attr
.proc_pointer
)
2522 if (c
->attr
.pointer
|| c
->attr
.allocatable
)
2524 enum gfc_array_kind akind
;
2525 if (c
->attr
.pointer
)
2526 akind
= c
->attr
.contiguous
? GFC_ARRAY_POINTER_CONT
2527 : GFC_ARRAY_POINTER
;
2529 akind
= GFC_ARRAY_ALLOCATABLE
;
2530 /* Pointers to arrays aren't actually pointer types. The
2531 descriptors are separate, but the data is common. */
2532 field_type
= gfc_build_array_type (field_type
, c
->as
, akind
,
2534 && !c
->attr
.pointer
,
2535 c
->attr
.contiguous
);
2538 field_type
= gfc_get_nodesc_array_type (field_type
, c
->as
,
2542 else if ((c
->attr
.pointer
|| c
->attr
.allocatable
)
2543 && !c
->attr
.proc_pointer
2544 && !(unlimited_entity
&& c
== derived
->components
))
2545 field_type
= build_pointer_type (field_type
);
2547 if (c
->attr
.pointer
)
2548 field_type
= gfc_nonrestricted_type (field_type
);
2550 /* vtype fields can point to different types to the base type. */
2551 if (c
->ts
.type
== BT_DERIVED
2552 && c
->ts
.u
.derived
&& c
->ts
.u
.derived
->attr
.vtype
)
2553 field_type
= build_pointer_type_for_mode (TREE_TYPE (field_type
),
2556 /* Ensure that the CLASS language specific flag is set. */
2557 if (c
->ts
.type
== BT_CLASS
)
2559 if (POINTER_TYPE_P (field_type
))
2560 GFC_CLASS_TYPE_P (TREE_TYPE (field_type
)) = 1;
2562 GFC_CLASS_TYPE_P (field_type
) = 1;
2565 field
= gfc_add_field_to_struct (typenode
,
2566 get_identifier (c
->name
),
2567 field_type
, &chain
);
2569 gfc_set_decl_location (field
, &c
->loc
);
2570 else if (derived
->declared_at
.lb
)
2571 gfc_set_decl_location (field
, &derived
->declared_at
);
2573 gfc_finish_decl_attrs (field
, &c
->attr
);
2575 DECL_PACKED (field
) |= TYPE_PACKED (typenode
);
2578 if (!c
->backend_decl
)
2579 c
->backend_decl
= field
;
2582 /* Now lay out the derived type, including the fields. */
2584 TYPE_CANONICAL (typenode
) = canonical
;
2586 gfc_finish_type (typenode
);
2587 gfc_set_decl_location (TYPE_STUB_DECL (typenode
), &derived
->declared_at
);
2588 if (derived
->module
&& derived
->ns
->proc_name
2589 && derived
->ns
->proc_name
->attr
.flavor
== FL_MODULE
)
2591 if (derived
->ns
->proc_name
->backend_decl
2592 && TREE_CODE (derived
->ns
->proc_name
->backend_decl
)
2595 TYPE_CONTEXT (typenode
) = derived
->ns
->proc_name
->backend_decl
;
2596 DECL_CONTEXT (TYPE_STUB_DECL (typenode
))
2597 = derived
->ns
->proc_name
->backend_decl
;
2601 derived
->backend_decl
= typenode
;
2605 for (dt
= gfc_derived_types
; dt
; dt
= dt
->next
)
2606 gfc_copy_dt_decls_ifequal (derived
, dt
->derived
, false);
2608 return derived
->backend_decl
;
2613 gfc_return_by_reference (gfc_symbol
* sym
)
2615 if (!sym
->attr
.function
)
2618 if (sym
->attr
.dimension
)
2621 if (sym
->ts
.type
== BT_CHARACTER
2622 && !sym
->attr
.is_bind_c
2623 && (!sym
->attr
.result
2624 || !sym
->ns
->proc_name
2625 || !sym
->ns
->proc_name
->attr
.is_bind_c
))
2628 /* Possibly return complex numbers by reference for g77 compatibility.
2629 We don't do this for calls to intrinsics (as the library uses the
2630 -fno-f2c calling convention), nor for calls to functions which always
2631 require an explicit interface, as no compatibility problems can
2633 if (flag_f2c
&& sym
->ts
.type
== BT_COMPLEX
2634 && !sym
->attr
.intrinsic
&& !sym
->attr
.always_explicit
)
2641 gfc_get_mixed_entry_union (gfc_namespace
*ns
)
2645 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2646 gfc_entry_list
*el
, *el2
;
2648 gcc_assert (ns
->proc_name
->attr
.mixed_entry_master
);
2649 gcc_assert (memcmp (ns
->proc_name
->name
, "master.", 7) == 0);
2651 snprintf (name
, GFC_MAX_SYMBOL_LEN
, "munion.%s", ns
->proc_name
->name
+ 7);
2653 /* Build the type node. */
2654 type
= make_node (UNION_TYPE
);
2656 TYPE_NAME (type
) = get_identifier (name
);
2658 for (el
= ns
->entries
; el
; el
= el
->next
)
2660 /* Search for duplicates. */
2661 for (el2
= ns
->entries
; el2
!= el
; el2
= el2
->next
)
2662 if (el2
->sym
->result
== el
->sym
->result
)
2666 gfc_add_field_to_struct_1 (type
,
2667 get_identifier (el
->sym
->result
->name
),
2668 gfc_sym_type (el
->sym
->result
), &chain
);
2671 /* Finish off the type. */
2672 gfc_finish_type (type
);
2673 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
)) = 1;
2677 /* Create a "fn spec" based on the formal arguments;
2678 cf. create_function_arglist. */
2681 create_fn_spec (gfc_symbol
*sym
, tree fntype
)
2685 gfc_formal_arglist
*f
;
2688 memset (&spec
, 0, sizeof (spec
));
2692 if (sym
->attr
.entry_master
)
2693 spec
[spec_len
++] = 'R';
2694 if (gfc_return_by_reference (sym
))
2696 gfc_symbol
*result
= sym
->result
? sym
->result
: sym
;
2698 if (result
->attr
.pointer
|| sym
->attr
.proc_pointer
)
2699 spec
[spec_len
++] = '.';
2701 spec
[spec_len
++] = 'w';
2702 if (sym
->ts
.type
== BT_CHARACTER
)
2703 spec
[spec_len
++] = 'R';
2706 for (f
= gfc_sym_get_dummy_args (sym
); f
; f
= f
->next
)
2707 if (spec_len
< sizeof (spec
))
2709 if (!f
->sym
|| f
->sym
->attr
.pointer
|| f
->sym
->attr
.target
2710 || f
->sym
->attr
.external
|| f
->sym
->attr
.cray_pointer
2711 || (f
->sym
->ts
.type
== BT_DERIVED
2712 && (f
->sym
->ts
.u
.derived
->attr
.proc_pointer_comp
2713 || f
->sym
->ts
.u
.derived
->attr
.pointer_comp
))
2714 || (f
->sym
->ts
.type
== BT_CLASS
2715 && (CLASS_DATA (f
->sym
)->ts
.u
.derived
->attr
.proc_pointer_comp
2716 || CLASS_DATA (f
->sym
)->ts
.u
.derived
->attr
.pointer_comp
)))
2717 spec
[spec_len
++] = '.';
2718 else if (f
->sym
->attr
.intent
== INTENT_IN
)
2719 spec
[spec_len
++] = 'r';
2721 spec
[spec_len
++] = 'w';
2724 tmp
= build_tree_list (NULL_TREE
, build_string (spec_len
, spec
));
2725 tmp
= tree_cons (get_identifier ("fn spec"), tmp
, TYPE_ATTRIBUTES (fntype
));
2726 return build_type_attribute_variant (fntype
, tmp
);
2731 gfc_get_function_type (gfc_symbol
* sym
)
2734 vec
<tree
, va_gc
> *typelist
= NULL
;
2735 gfc_formal_arglist
*f
;
2737 int alternate_return
= 0;
2738 bool is_varargs
= true;
2740 /* Make sure this symbol is a function, a subroutine or the main
2742 gcc_assert (sym
->attr
.flavor
== FL_PROCEDURE
2743 || sym
->attr
.flavor
== FL_PROGRAM
);
2745 /* To avoid recursing infinitely on recursive types, we use error_mark_node
2746 so that they can be detected here and handled further down. */
2747 if (sym
->backend_decl
== NULL
)
2748 sym
->backend_decl
= error_mark_node
;
2749 else if (sym
->backend_decl
== error_mark_node
)
2750 goto arg_type_list_done
;
2751 else if (sym
->attr
.proc_pointer
)
2752 return TREE_TYPE (TREE_TYPE (sym
->backend_decl
));
2754 return TREE_TYPE (sym
->backend_decl
);
2756 if (sym
->attr
.entry_master
)
2757 /* Additional parameter for selecting an entry point. */
2758 vec_safe_push (typelist
, gfc_array_index_type
);
2765 if (arg
->ts
.type
== BT_CHARACTER
)
2766 gfc_conv_const_charlen (arg
->ts
.u
.cl
);
2768 /* Some functions we use an extra parameter for the return value. */
2769 if (gfc_return_by_reference (sym
))
2771 type
= gfc_sym_type (arg
);
2772 if (arg
->ts
.type
== BT_COMPLEX
2773 || arg
->attr
.dimension
2774 || arg
->ts
.type
== BT_CHARACTER
)
2775 type
= build_reference_type (type
);
2777 vec_safe_push (typelist
, type
);
2778 if (arg
->ts
.type
== BT_CHARACTER
)
2780 if (!arg
->ts
.deferred
)
2781 /* Transfer by value. */
2782 vec_safe_push (typelist
, gfc_charlen_type_node
);
2784 /* Deferred character lengths are transferred by reference
2785 so that the value can be returned. */
2786 vec_safe_push (typelist
, build_pointer_type(gfc_charlen_type_node
));
2790 /* Build the argument types for the function. */
2791 for (f
= gfc_sym_get_dummy_args (sym
); f
; f
= f
->next
)
2796 /* Evaluate constant character lengths here so that they can be
2797 included in the type. */
2798 if (arg
->ts
.type
== BT_CHARACTER
)
2799 gfc_conv_const_charlen (arg
->ts
.u
.cl
);
2801 if (arg
->attr
.flavor
== FL_PROCEDURE
)
2803 type
= gfc_get_function_type (arg
);
2804 type
= build_pointer_type (type
);
2807 type
= gfc_sym_type (arg
);
2809 /* Parameter Passing Convention
2811 We currently pass all parameters by reference.
2812 Parameters with INTENT(IN) could be passed by value.
2813 The problem arises if a function is called via an implicit
2814 prototype. In this situation the INTENT is not known.
2815 For this reason all parameters to global functions must be
2816 passed by reference. Passing by value would potentially
2817 generate bad code. Worse there would be no way of telling that
2818 this code was bad, except that it would give incorrect results.
2820 Contained procedures could pass by value as these are never
2821 used without an explicit interface, and cannot be passed as
2822 actual parameters for a dummy procedure. */
2824 vec_safe_push (typelist
, type
);
2828 if (sym
->attr
.subroutine
)
2829 alternate_return
= 1;
2833 /* Add hidden string length parameters. */
2834 for (f
= gfc_sym_get_dummy_args (sym
); f
; f
= f
->next
)
2837 if (arg
&& arg
->ts
.type
== BT_CHARACTER
&& !sym
->attr
.is_bind_c
)
2839 if (!arg
->ts
.deferred
)
2840 /* Transfer by value. */
2841 type
= gfc_charlen_type_node
;
2843 /* Deferred character lengths are transferred by reference
2844 so that the value can be returned. */
2845 type
= build_pointer_type (gfc_charlen_type_node
);
2847 vec_safe_push (typelist
, type
);
2851 if (!vec_safe_is_empty (typelist
)
2852 || sym
->attr
.is_main_program
2853 || sym
->attr
.if_source
!= IFSRC_UNKNOWN
)
2856 if (sym
->backend_decl
== error_mark_node
)
2857 sym
->backend_decl
= NULL_TREE
;
2861 if (alternate_return
)
2862 type
= integer_type_node
;
2863 else if (!sym
->attr
.function
|| gfc_return_by_reference (sym
))
2864 type
= void_type_node
;
2865 else if (sym
->attr
.mixed_entry_master
)
2866 type
= gfc_get_mixed_entry_union (sym
->ns
);
2867 else if (flag_f2c
&& sym
->ts
.type
== BT_REAL
2868 && sym
->ts
.kind
== gfc_default_real_kind
2869 && !sym
->attr
.always_explicit
)
2871 /* Special case: f2c calling conventions require that (scalar)
2872 default REAL functions return the C type double instead. f2c
2873 compatibility is only an issue with functions that don't
2874 require an explicit interface, as only these could be
2875 implemented in Fortran 77. */
2876 sym
->ts
.kind
= gfc_default_double_kind
;
2877 type
= gfc_typenode_for_spec (&sym
->ts
);
2878 sym
->ts
.kind
= gfc_default_real_kind
;
2880 else if (sym
->result
&& sym
->result
->attr
.proc_pointer
)
2881 /* Procedure pointer return values. */
2883 if (sym
->result
->attr
.result
&& strcmp (sym
->name
,"ppr@") != 0)
2885 /* Unset proc_pointer as gfc_get_function_type
2886 is called recursively. */
2887 sym
->result
->attr
.proc_pointer
= 0;
2888 type
= build_pointer_type (gfc_get_function_type (sym
->result
));
2889 sym
->result
->attr
.proc_pointer
= 1;
2892 type
= gfc_sym_type (sym
->result
);
2895 type
= gfc_sym_type (sym
);
2898 type
= build_varargs_function_type_vec (type
, typelist
);
2900 type
= build_function_type_vec (type
, typelist
);
2901 type
= create_fn_spec (sym
, type
);
2906 /* Language hooks for middle-end access to type nodes. */
2908 /* Return an integer type with BITS bits of precision,
2909 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2912 gfc_type_for_size (unsigned bits
, int unsignedp
)
2917 for (i
= 0; i
<= MAX_INT_KINDS
; ++i
)
2919 tree type
= gfc_integer_types
[i
];
2920 if (type
&& bits
== TYPE_PRECISION (type
))
2924 /* Handle TImode as a special case because it is used by some backends
2925 (e.g. ARM) even though it is not available for normal use. */
2926 #if HOST_BITS_PER_WIDE_INT >= 64
2927 if (bits
== TYPE_PRECISION (intTI_type_node
))
2928 return intTI_type_node
;
2931 if (bits
<= TYPE_PRECISION (intQI_type_node
))
2932 return intQI_type_node
;
2933 if (bits
<= TYPE_PRECISION (intHI_type_node
))
2934 return intHI_type_node
;
2935 if (bits
<= TYPE_PRECISION (intSI_type_node
))
2936 return intSI_type_node
;
2937 if (bits
<= TYPE_PRECISION (intDI_type_node
))
2938 return intDI_type_node
;
2939 if (bits
<= TYPE_PRECISION (intTI_type_node
))
2940 return intTI_type_node
;
2944 if (bits
<= TYPE_PRECISION (unsigned_intQI_type_node
))
2945 return unsigned_intQI_type_node
;
2946 if (bits
<= TYPE_PRECISION (unsigned_intHI_type_node
))
2947 return unsigned_intHI_type_node
;
2948 if (bits
<= TYPE_PRECISION (unsigned_intSI_type_node
))
2949 return unsigned_intSI_type_node
;
2950 if (bits
<= TYPE_PRECISION (unsigned_intDI_type_node
))
2951 return unsigned_intDI_type_node
;
2952 if (bits
<= TYPE_PRECISION (unsigned_intTI_type_node
))
2953 return unsigned_intTI_type_node
;
2959 /* Return a data type that has machine mode MODE. If the mode is an
2960 integer, then UNSIGNEDP selects between signed and unsigned types. */
2963 gfc_type_for_mode (machine_mode mode
, int unsignedp
)
2968 if (GET_MODE_CLASS (mode
) == MODE_FLOAT
)
2969 base
= gfc_real_types
;
2970 else if (GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
)
2971 base
= gfc_complex_types
;
2972 else if (SCALAR_INT_MODE_P (mode
))
2974 tree type
= gfc_type_for_size (GET_MODE_PRECISION (mode
), unsignedp
);
2975 return type
!= NULL_TREE
&& mode
== TYPE_MODE (type
) ? type
: NULL_TREE
;
2977 else if (VECTOR_MODE_P (mode
))
2979 machine_mode inner_mode
= GET_MODE_INNER (mode
);
2980 tree inner_type
= gfc_type_for_mode (inner_mode
, unsignedp
);
2981 if (inner_type
!= NULL_TREE
)
2982 return build_vector_type_for_mode (inner_type
, mode
);
2988 for (i
= 0; i
<= MAX_REAL_KINDS
; ++i
)
2990 tree type
= base
[i
];
2991 if (type
&& mode
== TYPE_MODE (type
))
2998 /* Return TRUE if TYPE is a type with a hidden descriptor, fill in INFO
3002 gfc_get_array_descr_info (const_tree type
, struct array_descr_info
*info
)
3005 bool indirect
= false;
3006 tree etype
, ptype
, field
, t
, base_decl
;
3007 tree data_off
, dim_off
, dim_size
, elem_size
;
3008 tree lower_suboff
, upper_suboff
, stride_suboff
;
3010 if (! GFC_DESCRIPTOR_TYPE_P (type
))
3012 if (! POINTER_TYPE_P (type
))
3014 type
= TREE_TYPE (type
);
3015 if (! GFC_DESCRIPTOR_TYPE_P (type
))
3020 rank
= GFC_TYPE_ARRAY_RANK (type
);
3021 if (rank
>= (int) (sizeof (info
->dimen
) / sizeof (info
->dimen
[0])))
3024 etype
= GFC_TYPE_ARRAY_DATAPTR_TYPE (type
);
3025 gcc_assert (POINTER_TYPE_P (etype
));
3026 etype
= TREE_TYPE (etype
);
3028 /* If the type is not a scalar coarray. */
3029 if (TREE_CODE (etype
) == ARRAY_TYPE
)
3030 etype
= TREE_TYPE (etype
);
3032 /* Can't handle variable sized elements yet. */
3033 if (int_size_in_bytes (etype
) <= 0)
3035 /* Nor non-constant lower bounds in assumed shape arrays. */
3036 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE
3037 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE_CONT
)
3039 for (dim
= 0; dim
< rank
; dim
++)
3040 if (GFC_TYPE_ARRAY_LBOUND (type
, dim
) == NULL_TREE
3041 || TREE_CODE (GFC_TYPE_ARRAY_LBOUND (type
, dim
)) != INTEGER_CST
)
3045 memset (info
, '\0', sizeof (*info
));
3046 info
->ndimensions
= rank
;
3047 info
->ordering
= array_descr_ordering_column_major
;
3048 info
->element_type
= etype
;
3049 ptype
= build_pointer_type (gfc_array_index_type
);
3050 base_decl
= GFC_TYPE_ARRAY_BASE_DECL (type
, indirect
);
3053 base_decl
= make_node (DEBUG_EXPR_DECL
);
3054 DECL_ARTIFICIAL (base_decl
) = 1;
3055 TREE_TYPE (base_decl
) = indirect
? build_pointer_type (ptype
) : ptype
;
3056 DECL_MODE (base_decl
) = TYPE_MODE (TREE_TYPE (base_decl
));
3057 GFC_TYPE_ARRAY_BASE_DECL (type
, indirect
) = base_decl
;
3059 info
->base_decl
= base_decl
;
3061 base_decl
= build1 (INDIRECT_REF
, ptype
, base_decl
);
3063 if (GFC_TYPE_ARRAY_SPAN (type
))
3064 elem_size
= GFC_TYPE_ARRAY_SPAN (type
);
3066 elem_size
= fold_convert (gfc_array_index_type
, TYPE_SIZE_UNIT (etype
));
3067 field
= TYPE_FIELDS (TYPE_MAIN_VARIANT (type
));
3068 data_off
= byte_position (field
);
3069 field
= DECL_CHAIN (field
);
3070 field
= DECL_CHAIN (field
);
3071 field
= DECL_CHAIN (field
);
3072 dim_off
= byte_position (field
);
3073 dim_size
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (field
)));
3074 field
= TYPE_FIELDS (TREE_TYPE (TREE_TYPE (field
)));
3075 stride_suboff
= byte_position (field
);
3076 field
= DECL_CHAIN (field
);
3077 lower_suboff
= byte_position (field
);
3078 field
= DECL_CHAIN (field
);
3079 upper_suboff
= byte_position (field
);
3082 if (!integer_zerop (data_off
))
3083 t
= fold_build_pointer_plus (t
, data_off
);
3084 t
= build1 (NOP_EXPR
, build_pointer_type (ptr_type_node
), t
);
3085 info
->data_location
= build1 (INDIRECT_REF
, ptr_type_node
, t
);
3086 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ALLOCATABLE
)
3087 info
->allocated
= build2 (NE_EXPR
, boolean_type_node
,
3088 info
->data_location
, null_pointer_node
);
3089 else if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_POINTER
3090 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_POINTER_CONT
)
3091 info
->associated
= build2 (NE_EXPR
, boolean_type_node
,
3092 info
->data_location
, null_pointer_node
);
3094 for (dim
= 0; dim
< rank
; dim
++)
3096 t
= fold_build_pointer_plus (base_decl
,
3097 size_binop (PLUS_EXPR
,
3098 dim_off
, lower_suboff
));
3099 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
3100 info
->dimen
[dim
].lower_bound
= t
;
3101 t
= fold_build_pointer_plus (base_decl
,
3102 size_binop (PLUS_EXPR
,
3103 dim_off
, upper_suboff
));
3104 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
3105 info
->dimen
[dim
].upper_bound
= t
;
3106 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE
3107 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE_CONT
)
3109 /* Assumed shape arrays have known lower bounds. */
3110 info
->dimen
[dim
].upper_bound
3111 = build2 (MINUS_EXPR
, gfc_array_index_type
,
3112 info
->dimen
[dim
].upper_bound
,
3113 info
->dimen
[dim
].lower_bound
);
3114 info
->dimen
[dim
].lower_bound
3115 = fold_convert (gfc_array_index_type
,
3116 GFC_TYPE_ARRAY_LBOUND (type
, dim
));
3117 info
->dimen
[dim
].upper_bound
3118 = build2 (PLUS_EXPR
, gfc_array_index_type
,
3119 info
->dimen
[dim
].lower_bound
,
3120 info
->dimen
[dim
].upper_bound
);
3122 t
= fold_build_pointer_plus (base_decl
,
3123 size_binop (PLUS_EXPR
,
3124 dim_off
, stride_suboff
));
3125 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
3126 t
= build2 (MULT_EXPR
, gfc_array_index_type
, t
, elem_size
);
3127 info
->dimen
[dim
].stride
= t
;
3128 dim_off
= size_binop (PLUS_EXPR
, dim_off
, dim_size
);
3135 /* Create a type to handle vector subscripts for coarray library calls. It
3137 struct caf_vector_t {
3138 size_t nvec; // size of the vector
3145 ptrdiff_t lower_bound;
3146 ptrdiff_t upper_bound;
3151 where nvec == 0 for DIMEN_ELEMENT or DIMEN_RANGE and nvec being the vector
3152 size in case of DIMEN_VECTOR, where kind is the integer type of the vector. */
3155 gfc_get_caf_vector_type (int dim
)
3157 static tree vector_types
[GFC_MAX_DIMENSIONS
];
3158 static tree vec_type
= NULL_TREE
;
3159 tree triplet_struct_type
, vect_struct_type
, union_type
, tmp
, *chain
;
3161 if (vector_types
[dim
-1] != NULL_TREE
)
3162 return vector_types
[dim
-1];
3164 if (vec_type
== NULL_TREE
)
3167 vect_struct_type
= make_node (RECORD_TYPE
);
3168 tmp
= gfc_add_field_to_struct_1 (vect_struct_type
,
3169 get_identifier ("vector"),
3170 pvoid_type_node
, &chain
);
3171 TREE_NO_WARNING (tmp
) = 1;
3172 tmp
= gfc_add_field_to_struct_1 (vect_struct_type
,
3173 get_identifier ("kind"),
3174 integer_type_node
, &chain
);
3175 TREE_NO_WARNING (tmp
) = 1;
3176 gfc_finish_type (vect_struct_type
);
3179 triplet_struct_type
= make_node (RECORD_TYPE
);
3180 tmp
= gfc_add_field_to_struct_1 (triplet_struct_type
,
3181 get_identifier ("lower_bound"),
3182 gfc_array_index_type
, &chain
);
3183 TREE_NO_WARNING (tmp
) = 1;
3184 tmp
= gfc_add_field_to_struct_1 (triplet_struct_type
,
3185 get_identifier ("upper_bound"),
3186 gfc_array_index_type
, &chain
);
3187 TREE_NO_WARNING (tmp
) = 1;
3188 tmp
= gfc_add_field_to_struct_1 (triplet_struct_type
, get_identifier ("stride"),
3189 gfc_array_index_type
, &chain
);
3190 TREE_NO_WARNING (tmp
) = 1;
3191 gfc_finish_type (triplet_struct_type
);
3194 union_type
= make_node (UNION_TYPE
);
3195 tmp
= gfc_add_field_to_struct_1 (union_type
, get_identifier ("v"),
3196 vect_struct_type
, &chain
);
3197 TREE_NO_WARNING (tmp
) = 1;
3198 tmp
= gfc_add_field_to_struct_1 (union_type
, get_identifier ("triplet"),
3199 triplet_struct_type
, &chain
);
3200 TREE_NO_WARNING (tmp
) = 1;
3201 gfc_finish_type (union_type
);
3204 vec_type
= make_node (RECORD_TYPE
);
3205 tmp
= gfc_add_field_to_struct_1 (vec_type
, get_identifier ("nvec"),
3206 size_type_node
, &chain
);
3207 TREE_NO_WARNING (tmp
) = 1;
3208 tmp
= gfc_add_field_to_struct_1 (vec_type
, get_identifier ("u"),
3209 union_type
, &chain
);
3210 TREE_NO_WARNING (tmp
) = 1;
3211 gfc_finish_type (vec_type
);
3212 TYPE_NAME (vec_type
) = get_identifier ("caf_vector_t");
3215 tmp
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
3216 gfc_rank_cst
[dim
-1]);
3217 vector_types
[dim
-1] = build_array_type (vec_type
, tmp
);
3218 return vector_types
[dim
-1];
3221 #include "gt-fortran-trans-types.h"