1 /* Backend support for Fortran 95 basic types and derived types.
2 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
4 Free Software Foundation, Inc.
5 Contributed by Paul Brook <paul@nowt.org>
6 and Steven Bosscher <s.bosscher@student.tudelft.nl>
8 This file is part of GCC.
10 GCC is free software; you can redistribute it and/or modify it under
11 the terms of the GNU General Public License as published by the Free
12 Software Foundation; either version 3, or (at your option) any later
15 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
16 WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 You should have received a copy of the GNU General Public License
21 along with GCC; see the file COPYING3. If not see
22 <http://www.gnu.org/licenses/>. */
24 /* trans-types.c -- gfortran backend types */
28 #include "coretypes.h"
30 #include "langhooks.h" /* For iso-c-bindings.def. */
33 #include "diagnostic-core.h" /* For fatal_error. */
34 #include "toplev.h" /* For rest_of_decl_compilation. */
37 #include "trans-types.h"
38 #include "trans-const.h"
40 #include "dwarf2out.h" /* For struct array_descr_info. */
43 #if (GFC_MAX_DIMENSIONS < 10)
44 #define GFC_RANK_DIGITS 1
45 #define GFC_RANK_PRINTF_FORMAT "%01d"
46 #elif (GFC_MAX_DIMENSIONS < 100)
47 #define GFC_RANK_DIGITS 2
48 #define GFC_RANK_PRINTF_FORMAT "%02d"
50 #error If you really need >99 dimensions, continue the sequence above...
53 /* array of structs so we don't have to worry about xmalloc or free */
54 CInteropKind_t c_interop_kinds_table
[ISOCBINDING_NUMBER
];
56 tree gfc_array_index_type
;
57 tree gfc_array_range_type
;
58 tree gfc_character1_type_node
;
60 tree prvoid_type_node
;
61 tree ppvoid_type_node
;
65 tree gfc_charlen_type_node
;
67 static GTY(()) tree gfc_desc_dim_type
;
68 static GTY(()) tree gfc_max_array_element_size
;
69 static GTY(()) tree gfc_array_descriptor_base
[2 * GFC_MAX_DIMENSIONS
];
71 /* Arrays for all integral and real kinds. We'll fill this in at runtime
72 after the target has a chance to process command-line options. */
74 #define MAX_INT_KINDS 5
75 gfc_integer_info gfc_integer_kinds
[MAX_INT_KINDS
+ 1];
76 gfc_logical_info gfc_logical_kinds
[MAX_INT_KINDS
+ 1];
77 static GTY(()) tree gfc_integer_types
[MAX_INT_KINDS
+ 1];
78 static GTY(()) tree gfc_logical_types
[MAX_INT_KINDS
+ 1];
80 #define MAX_REAL_KINDS 5
81 gfc_real_info gfc_real_kinds
[MAX_REAL_KINDS
+ 1];
82 static GTY(()) tree gfc_real_types
[MAX_REAL_KINDS
+ 1];
83 static GTY(()) tree gfc_complex_types
[MAX_REAL_KINDS
+ 1];
85 #define MAX_CHARACTER_KINDS 2
86 gfc_character_info gfc_character_kinds
[MAX_CHARACTER_KINDS
+ 1];
87 static GTY(()) tree gfc_character_types
[MAX_CHARACTER_KINDS
+ 1];
88 static GTY(()) tree gfc_pcharacter_types
[MAX_CHARACTER_KINDS
+ 1];
90 static tree
gfc_add_field_to_struct_1 (tree
*, tree
, tree
, tree
, tree
**);
92 /* The integer kind to use for array indices. This will be set to the
93 proper value based on target information from the backend. */
95 int gfc_index_integer_kind
;
97 /* The default kinds of the various types. */
99 int gfc_default_integer_kind
;
100 int gfc_max_integer_kind
;
101 int gfc_default_real_kind
;
102 int gfc_default_double_kind
;
103 int gfc_default_character_kind
;
104 int gfc_default_logical_kind
;
105 int gfc_default_complex_kind
;
108 /* The kind size used for record offsets. If the target system supports
109 kind=8, this will be set to 8, otherwise it is set to 4. */
112 /* The integer kind used to store character lengths. */
113 int gfc_charlen_int_kind
;
115 /* The size of the numeric storage unit and character storage unit. */
116 int gfc_numeric_storage_size
;
117 int gfc_character_storage_size
;
121 gfc_check_any_c_kind (gfc_typespec
*ts
)
125 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
127 /* Check for any C interoperable kind for the given type/kind in ts.
128 This can be used after verify_c_interop to make sure that the
129 Fortran kind being used exists in at least some form for C. */
130 if (c_interop_kinds_table
[i
].f90_type
== ts
->type
&&
131 c_interop_kinds_table
[i
].value
== ts
->kind
)
140 get_real_kind_from_node (tree type
)
144 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
145 if (gfc_real_kinds
[i
].mode_precision
== TYPE_PRECISION (type
))
146 return gfc_real_kinds
[i
].kind
;
152 get_int_kind_from_node (tree type
)
159 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
160 if (gfc_integer_kinds
[i
].bit_size
== TYPE_PRECISION (type
))
161 return gfc_integer_kinds
[i
].kind
;
166 /* Return a typenode for the "standard" C type with a given name. */
168 get_typenode_from_name (const char *name
)
170 if (name
== NULL
|| *name
== '\0')
173 if (strcmp (name
, "char") == 0)
174 return char_type_node
;
175 if (strcmp (name
, "unsigned char") == 0)
176 return unsigned_char_type_node
;
177 if (strcmp (name
, "signed char") == 0)
178 return signed_char_type_node
;
180 if (strcmp (name
, "short int") == 0)
181 return short_integer_type_node
;
182 if (strcmp (name
, "short unsigned int") == 0)
183 return short_unsigned_type_node
;
185 if (strcmp (name
, "int") == 0)
186 return integer_type_node
;
187 if (strcmp (name
, "unsigned int") == 0)
188 return unsigned_type_node
;
190 if (strcmp (name
, "long int") == 0)
191 return long_integer_type_node
;
192 if (strcmp (name
, "long unsigned int") == 0)
193 return long_unsigned_type_node
;
195 if (strcmp (name
, "long long int") == 0)
196 return long_long_integer_type_node
;
197 if (strcmp (name
, "long long unsigned int") == 0)
198 return long_long_unsigned_type_node
;
204 get_int_kind_from_name (const char *name
)
206 return get_int_kind_from_node (get_typenode_from_name (name
));
210 /* Get the kind number corresponding to an integer of given size,
211 following the required return values for ISO_FORTRAN_ENV INT* constants:
212 -2 is returned if we support a kind of larger size, -1 otherwise. */
214 gfc_get_int_kind_from_width_isofortranenv (int size
)
218 /* Look for a kind with matching storage size. */
219 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
220 if (gfc_integer_kinds
[i
].bit_size
== size
)
221 return gfc_integer_kinds
[i
].kind
;
223 /* Look for a kind with larger storage size. */
224 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
225 if (gfc_integer_kinds
[i
].bit_size
> size
)
231 /* Get the kind number corresponding to a real of given storage size,
232 following the required return values for ISO_FORTRAN_ENV REAL* constants:
233 -2 is returned if we support a kind of larger size, -1 otherwise. */
235 gfc_get_real_kind_from_width_isofortranenv (int size
)
241 /* Look for a kind with matching storage size. */
242 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
243 if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds
[i
].kind
)) == size
)
244 return gfc_real_kinds
[i
].kind
;
246 /* Look for a kind with larger storage size. */
247 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
248 if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds
[i
].kind
)) > size
)
257 get_int_kind_from_width (int size
)
261 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
262 if (gfc_integer_kinds
[i
].bit_size
== size
)
263 return gfc_integer_kinds
[i
].kind
;
269 get_int_kind_from_minimal_width (int size
)
273 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
274 if (gfc_integer_kinds
[i
].bit_size
>= size
)
275 return gfc_integer_kinds
[i
].kind
;
281 /* Generate the CInteropKind_t objects for the C interoperable
285 void init_c_interop_kinds (void)
289 /* init all pointers in the list to NULL */
290 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
292 /* Initialize the name and value fields. */
293 c_interop_kinds_table
[i
].name
[0] = '\0';
294 c_interop_kinds_table
[i
].value
= -100;
295 c_interop_kinds_table
[i
].f90_type
= BT_UNKNOWN
;
298 #define NAMED_INTCST(a,b,c,d) \
299 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
300 c_interop_kinds_table[a].f90_type = BT_INTEGER; \
301 c_interop_kinds_table[a].value = c;
302 #define NAMED_REALCST(a,b,c) \
303 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
304 c_interop_kinds_table[a].f90_type = BT_REAL; \
305 c_interop_kinds_table[a].value = c;
306 #define NAMED_CMPXCST(a,b,c) \
307 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
308 c_interop_kinds_table[a].f90_type = BT_COMPLEX; \
309 c_interop_kinds_table[a].value = c;
310 #define NAMED_LOGCST(a,b,c) \
311 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
312 c_interop_kinds_table[a].f90_type = BT_LOGICAL; \
313 c_interop_kinds_table[a].value = c;
314 #define NAMED_CHARKNDCST(a,b,c) \
315 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
316 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
317 c_interop_kinds_table[a].value = c;
318 #define NAMED_CHARCST(a,b,c) \
319 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
320 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
321 c_interop_kinds_table[a].value = c;
322 #define DERIVED_TYPE(a,b,c) \
323 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
324 c_interop_kinds_table[a].f90_type = BT_DERIVED; \
325 c_interop_kinds_table[a].value = c;
326 #define PROCEDURE(a,b) \
327 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
328 c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
329 c_interop_kinds_table[a].value = 0;
330 #include "iso-c-binding.def"
334 /* Query the target to determine which machine modes are available for
335 computation. Choose KIND numbers for them. */
338 gfc_init_kinds (void)
341 int i_index
, r_index
, kind
;
342 bool saw_i4
= false, saw_i8
= false;
343 bool saw_r4
= false, saw_r8
= false, saw_r16
= false;
345 for (i_index
= 0, mode
= MIN_MODE_INT
; mode
<= MAX_MODE_INT
; mode
++)
349 if (!targetm
.scalar_mode_supported_p ((enum machine_mode
) mode
))
352 /* The middle end doesn't support constants larger than 2*HWI.
353 Perhaps the target hook shouldn't have accepted these either,
354 but just to be safe... */
355 bitsize
= GET_MODE_BITSIZE (mode
);
356 if (bitsize
> 2*HOST_BITS_PER_WIDE_INT
)
359 gcc_assert (i_index
!= MAX_INT_KINDS
);
361 /* Let the kind equal the bit size divided by 8. This insulates the
362 programmer from the underlying byte size. */
370 gfc_integer_kinds
[i_index
].kind
= kind
;
371 gfc_integer_kinds
[i_index
].radix
= 2;
372 gfc_integer_kinds
[i_index
].digits
= bitsize
- 1;
373 gfc_integer_kinds
[i_index
].bit_size
= bitsize
;
375 gfc_logical_kinds
[i_index
].kind
= kind
;
376 gfc_logical_kinds
[i_index
].bit_size
= bitsize
;
381 /* Set the kind used to match GFC_INT_IO in libgfortran. This is
382 used for large file access. */
389 /* If we do not at least have kind = 4, everything is pointless. */
392 /* Set the maximum integer kind. Used with at least BOZ constants. */
393 gfc_max_integer_kind
= gfc_integer_kinds
[i_index
- 1].kind
;
395 for (r_index
= 0, mode
= MIN_MODE_FLOAT
; mode
<= MAX_MODE_FLOAT
; mode
++)
397 const struct real_format
*fmt
=
398 REAL_MODE_FORMAT ((enum machine_mode
) mode
);
403 if (!targetm
.scalar_mode_supported_p ((enum machine_mode
) mode
))
406 /* Only let float/double/long double go through because the fortran
407 library assumes these are the only floating point types. */
409 if (mode
!= TYPE_MODE (float_type_node
)
410 && (mode
!= TYPE_MODE (double_type_node
))
411 && (mode
!= TYPE_MODE (long_double_type_node
)))
414 /* Let the kind equal the precision divided by 8, rounding up. Again,
415 this insulates the programmer from the underlying byte size.
417 Also, it effectively deals with IEEE extended formats. There, the
418 total size of the type may equal 16, but it's got 6 bytes of padding
419 and the increased size can get in the way of a real IEEE quad format
420 which may also be supported by the target.
422 We round up so as to handle IA-64 __floatreg (RFmode), which is an
423 82 bit type. Not to be confused with __float80 (XFmode), which is
424 an 80 bit type also supported by IA-64. So XFmode should come out
425 to be kind=10, and RFmode should come out to be kind=11. Egads. */
427 kind
= (GET_MODE_PRECISION (mode
) + 7) / 8;
436 /* Careful we don't stumble a weird internal mode. */
437 gcc_assert (r_index
<= 0 || gfc_real_kinds
[r_index
-1].kind
!= kind
);
438 /* Or have too many modes for the allocated space. */
439 gcc_assert (r_index
!= MAX_REAL_KINDS
);
441 gfc_real_kinds
[r_index
].kind
= kind
;
442 gfc_real_kinds
[r_index
].radix
= fmt
->b
;
443 gfc_real_kinds
[r_index
].digits
= fmt
->p
;
444 gfc_real_kinds
[r_index
].min_exponent
= fmt
->emin
;
445 gfc_real_kinds
[r_index
].max_exponent
= fmt
->emax
;
446 if (fmt
->pnan
< fmt
->p
)
447 /* This is an IBM extended double format (or the MIPS variant)
448 made up of two IEEE doubles. The value of the long double is
449 the sum of the values of the two parts. The most significant
450 part is required to be the value of the long double rounded
451 to the nearest double. If we use emax of 1024 then we can't
452 represent huge(x) = (1 - b**(-p)) * b**(emax-1) * b, because
453 rounding will make the most significant part overflow. */
454 gfc_real_kinds
[r_index
].max_exponent
= fmt
->emax
- 1;
455 gfc_real_kinds
[r_index
].mode_precision
= GET_MODE_PRECISION (mode
);
459 /* Choose the default integer kind. We choose 4 unless the user
460 directs us otherwise. */
461 if (gfc_option
.flag_default_integer
)
464 fatal_error ("integer kind=8 not available for -fdefault-integer-8 option");
465 gfc_default_integer_kind
= 8;
467 /* Even if the user specified that the default integer kind be 8,
468 the numeric storage size isn't 64. In this case, a warning will
469 be issued when NUMERIC_STORAGE_SIZE is used. */
470 gfc_numeric_storage_size
= 4 * 8;
474 gfc_default_integer_kind
= 4;
475 gfc_numeric_storage_size
= 4 * 8;
479 gfc_default_integer_kind
= gfc_integer_kinds
[i_index
- 1].kind
;
480 gfc_numeric_storage_size
= gfc_integer_kinds
[i_index
- 1].bit_size
;
483 /* Choose the default real kind. Again, we choose 4 when possible. */
484 if (gfc_option
.flag_default_real
)
487 fatal_error ("real kind=8 not available for -fdefault-real-8 option");
488 gfc_default_real_kind
= 8;
491 gfc_default_real_kind
= 4;
493 gfc_default_real_kind
= gfc_real_kinds
[0].kind
;
495 /* Choose the default double kind. If -fdefault-real and -fdefault-double
496 are specified, we use kind=8, if it's available. If -fdefault-real is
497 specified without -fdefault-double, we use kind=16, if it's available.
498 Otherwise we do not change anything. */
499 if (gfc_option
.flag_default_double
&& !gfc_option
.flag_default_real
)
500 fatal_error ("Use of -fdefault-double-8 requires -fdefault-real-8");
502 if (gfc_option
.flag_default_real
&& gfc_option
.flag_default_double
&& saw_r8
)
503 gfc_default_double_kind
= 8;
504 else if (gfc_option
.flag_default_real
&& saw_r16
)
505 gfc_default_double_kind
= 16;
506 else if (saw_r4
&& saw_r8
)
507 gfc_default_double_kind
= 8;
510 /* F95 14.6.3.1: A nonpointer scalar object of type double precision
511 real ... occupies two contiguous numeric storage units.
513 Therefore we must be supplied a kind twice as large as we chose
514 for single precision. There are loopholes, in that double
515 precision must *occupy* two storage units, though it doesn't have
516 to *use* two storage units. Which means that you can make this
517 kind artificially wide by padding it. But at present there are
518 no GCC targets for which a two-word type does not exist, so we
519 just let gfc_validate_kind abort and tell us if something breaks. */
521 gfc_default_double_kind
522 = gfc_validate_kind (BT_REAL
, gfc_default_real_kind
* 2, false);
525 /* The default logical kind is constrained to be the same as the
526 default integer kind. Similarly with complex and real. */
527 gfc_default_logical_kind
= gfc_default_integer_kind
;
528 gfc_default_complex_kind
= gfc_default_real_kind
;
530 /* We only have two character kinds: ASCII and UCS-4.
531 ASCII corresponds to a 8-bit integer type, if one is available.
532 UCS-4 corresponds to a 32-bit integer type, if one is available. */
534 if ((kind
= get_int_kind_from_width (8)) > 0)
536 gfc_character_kinds
[i_index
].kind
= kind
;
537 gfc_character_kinds
[i_index
].bit_size
= 8;
538 gfc_character_kinds
[i_index
].name
= "ascii";
541 if ((kind
= get_int_kind_from_width (32)) > 0)
543 gfc_character_kinds
[i_index
].kind
= kind
;
544 gfc_character_kinds
[i_index
].bit_size
= 32;
545 gfc_character_kinds
[i_index
].name
= "iso_10646";
549 /* Choose the smallest integer kind for our default character. */
550 gfc_default_character_kind
= gfc_character_kinds
[0].kind
;
551 gfc_character_storage_size
= gfc_default_character_kind
* 8;
553 /* Choose the integer kind the same size as "void*" for our index kind. */
554 gfc_index_integer_kind
= POINTER_SIZE
/ 8;
555 /* Pick a kind the same size as the C "int" type. */
556 gfc_c_int_kind
= INT_TYPE_SIZE
/ 8;
558 /* initialize the C interoperable kinds */
559 init_c_interop_kinds();
562 /* Make sure that a valid kind is present. Returns an index into the
563 associated kinds array, -1 if the kind is not present. */
566 validate_integer (int kind
)
570 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
571 if (gfc_integer_kinds
[i
].kind
== kind
)
578 validate_real (int kind
)
582 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
583 if (gfc_real_kinds
[i
].kind
== kind
)
590 validate_logical (int kind
)
594 for (i
= 0; gfc_logical_kinds
[i
].kind
; i
++)
595 if (gfc_logical_kinds
[i
].kind
== kind
)
602 validate_character (int kind
)
606 for (i
= 0; gfc_character_kinds
[i
].kind
; i
++)
607 if (gfc_character_kinds
[i
].kind
== kind
)
613 /* Validate a kind given a basic type. The return value is the same
614 for the child functions, with -1 indicating nonexistence of the
615 type. If MAY_FAIL is false, then -1 is never returned, and we ICE. */
618 gfc_validate_kind (bt type
, int kind
, bool may_fail
)
624 case BT_REAL
: /* Fall through */
626 rc
= validate_real (kind
);
629 rc
= validate_integer (kind
);
632 rc
= validate_logical (kind
);
635 rc
= validate_character (kind
);
639 gfc_internal_error ("gfc_validate_kind(): Got bad type");
642 if (rc
< 0 && !may_fail
)
643 gfc_internal_error ("gfc_validate_kind(): Got bad kind");
649 /* Four subroutines of gfc_init_types. Create type nodes for the given kind.
650 Reuse common type nodes where possible. Recognize if the kind matches up
651 with a C type. This will be used later in determining which routines may
652 be scarfed from libm. */
655 gfc_build_int_type (gfc_integer_info
*info
)
657 int mode_precision
= info
->bit_size
;
659 if (mode_precision
== CHAR_TYPE_SIZE
)
661 if (mode_precision
== SHORT_TYPE_SIZE
)
663 if (mode_precision
== INT_TYPE_SIZE
)
665 if (mode_precision
== LONG_TYPE_SIZE
)
667 if (mode_precision
== LONG_LONG_TYPE_SIZE
)
668 info
->c_long_long
= 1;
670 if (TYPE_PRECISION (intQI_type_node
) == mode_precision
)
671 return intQI_type_node
;
672 if (TYPE_PRECISION (intHI_type_node
) == mode_precision
)
673 return intHI_type_node
;
674 if (TYPE_PRECISION (intSI_type_node
) == mode_precision
)
675 return intSI_type_node
;
676 if (TYPE_PRECISION (intDI_type_node
) == mode_precision
)
677 return intDI_type_node
;
678 if (TYPE_PRECISION (intTI_type_node
) == mode_precision
)
679 return intTI_type_node
;
681 return make_signed_type (mode_precision
);
685 gfc_build_uint_type (int size
)
687 if (size
== CHAR_TYPE_SIZE
)
688 return unsigned_char_type_node
;
689 if (size
== SHORT_TYPE_SIZE
)
690 return short_unsigned_type_node
;
691 if (size
== INT_TYPE_SIZE
)
692 return unsigned_type_node
;
693 if (size
== LONG_TYPE_SIZE
)
694 return long_unsigned_type_node
;
695 if (size
== LONG_LONG_TYPE_SIZE
)
696 return long_long_unsigned_type_node
;
698 return make_unsigned_type (size
);
703 gfc_build_real_type (gfc_real_info
*info
)
705 int mode_precision
= info
->mode_precision
;
708 if (mode_precision
== FLOAT_TYPE_SIZE
)
710 if (mode_precision
== DOUBLE_TYPE_SIZE
)
712 if (mode_precision
== LONG_DOUBLE_TYPE_SIZE
)
713 info
->c_long_double
= 1;
715 if (TYPE_PRECISION (float_type_node
) == mode_precision
)
716 return float_type_node
;
717 if (TYPE_PRECISION (double_type_node
) == mode_precision
)
718 return double_type_node
;
719 if (TYPE_PRECISION (long_double_type_node
) == mode_precision
)
720 return long_double_type_node
;
722 new_type
= make_node (REAL_TYPE
);
723 TYPE_PRECISION (new_type
) = mode_precision
;
724 layout_type (new_type
);
729 gfc_build_complex_type (tree scalar_type
)
733 if (scalar_type
== NULL
)
735 if (scalar_type
== float_type_node
)
736 return complex_float_type_node
;
737 if (scalar_type
== double_type_node
)
738 return complex_double_type_node
;
739 if (scalar_type
== long_double_type_node
)
740 return complex_long_double_type_node
;
742 new_type
= make_node (COMPLEX_TYPE
);
743 TREE_TYPE (new_type
) = scalar_type
;
744 layout_type (new_type
);
749 gfc_build_logical_type (gfc_logical_info
*info
)
751 int bit_size
= info
->bit_size
;
754 if (bit_size
== BOOL_TYPE_SIZE
)
757 return boolean_type_node
;
760 new_type
= make_unsigned_type (bit_size
);
761 TREE_SET_CODE (new_type
, BOOLEAN_TYPE
);
762 TYPE_MAX_VALUE (new_type
) = build_int_cst (new_type
, 1);
763 TYPE_PRECISION (new_type
) = 1;
770 /* Return the bit size of the C "size_t". */
776 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
777 return INT_TYPE_SIZE
;
778 if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
779 return LONG_TYPE_SIZE
;
780 if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
781 return SHORT_TYPE_SIZE
;
784 return LONG_TYPE_SIZE
;
789 /* Create the backend type nodes. We map them to their
790 equivalent C type, at least for now. We also give
791 names to the types here, and we push them in the
792 global binding level context.*/
795 gfc_init_types (void)
801 unsigned HOST_WIDE_INT hi
;
802 unsigned HOST_WIDE_INT lo
;
804 /* Create and name the types. */
805 #define PUSH_TYPE(name, node) \
806 pushdecl (build_decl (input_location, \
807 TYPE_DECL, get_identifier (name), node))
809 for (index
= 0; gfc_integer_kinds
[index
].kind
!= 0; ++index
)
811 type
= gfc_build_int_type (&gfc_integer_kinds
[index
]);
812 /* Ensure integer(kind=1) doesn't have TYPE_STRING_FLAG set. */
813 if (TYPE_STRING_FLAG (type
))
814 type
= make_signed_type (gfc_integer_kinds
[index
].bit_size
);
815 gfc_integer_types
[index
] = type
;
816 snprintf (name_buf
, sizeof(name_buf
), "integer(kind=%d)",
817 gfc_integer_kinds
[index
].kind
);
818 PUSH_TYPE (name_buf
, type
);
821 for (index
= 0; gfc_logical_kinds
[index
].kind
!= 0; ++index
)
823 type
= gfc_build_logical_type (&gfc_logical_kinds
[index
]);
824 gfc_logical_types
[index
] = type
;
825 snprintf (name_buf
, sizeof(name_buf
), "logical(kind=%d)",
826 gfc_logical_kinds
[index
].kind
);
827 PUSH_TYPE (name_buf
, type
);
830 for (index
= 0; gfc_real_kinds
[index
].kind
!= 0; index
++)
832 type
= gfc_build_real_type (&gfc_real_kinds
[index
]);
833 gfc_real_types
[index
] = type
;
834 snprintf (name_buf
, sizeof(name_buf
), "real(kind=%d)",
835 gfc_real_kinds
[index
].kind
);
836 PUSH_TYPE (name_buf
, type
);
838 type
= gfc_build_complex_type (type
);
839 gfc_complex_types
[index
] = type
;
840 snprintf (name_buf
, sizeof(name_buf
), "complex(kind=%d)",
841 gfc_real_kinds
[index
].kind
);
842 PUSH_TYPE (name_buf
, type
);
845 for (index
= 0; gfc_character_kinds
[index
].kind
!= 0; ++index
)
847 type
= gfc_build_uint_type (gfc_character_kinds
[index
].bit_size
);
848 type
= build_qualified_type (type
, TYPE_UNQUALIFIED
);
849 snprintf (name_buf
, sizeof(name_buf
), "character(kind=%d)",
850 gfc_character_kinds
[index
].kind
);
851 PUSH_TYPE (name_buf
, type
);
852 gfc_character_types
[index
] = type
;
853 gfc_pcharacter_types
[index
] = build_pointer_type (type
);
855 gfc_character1_type_node
= gfc_character_types
[0];
857 PUSH_TYPE ("byte", unsigned_char_type_node
);
858 PUSH_TYPE ("void", void_type_node
);
860 /* DBX debugging output gets upset if these aren't set. */
861 if (!TYPE_NAME (integer_type_node
))
862 PUSH_TYPE ("c_integer", integer_type_node
);
863 if (!TYPE_NAME (char_type_node
))
864 PUSH_TYPE ("c_char", char_type_node
);
868 pvoid_type_node
= build_pointer_type (void_type_node
);
869 prvoid_type_node
= build_qualified_type (pvoid_type_node
, TYPE_QUAL_RESTRICT
);
870 ppvoid_type_node
= build_pointer_type (pvoid_type_node
);
871 pchar_type_node
= build_pointer_type (gfc_character1_type_node
);
873 = build_pointer_type (build_function_type_list (void_type_node
, NULL_TREE
));
875 gfc_array_index_type
= gfc_get_int_type (gfc_index_integer_kind
);
876 /* We cannot use gfc_index_zero_node in definition of gfc_array_range_type,
877 since this function is called before gfc_init_constants. */
879 = build_range_type (gfc_array_index_type
,
880 build_int_cst (gfc_array_index_type
, 0),
883 /* The maximum array element size that can be handled is determined
884 by the number of bits available to store this field in the array
887 n
= TYPE_PRECISION (gfc_array_index_type
) - GFC_DTYPE_SIZE_SHIFT
;
888 lo
= ~ (unsigned HOST_WIDE_INT
) 0;
889 if (n
> HOST_BITS_PER_WIDE_INT
)
890 hi
= lo
>> (2*HOST_BITS_PER_WIDE_INT
- n
);
892 hi
= 0, lo
>>= HOST_BITS_PER_WIDE_INT
- n
;
893 gfc_max_array_element_size
894 = build_int_cst_wide (long_unsigned_type_node
, lo
, hi
);
896 size_type_node
= gfc_array_index_type
;
898 boolean_type_node
= gfc_get_logical_type (gfc_default_logical_kind
);
899 boolean_true_node
= build_int_cst (boolean_type_node
, 1);
900 boolean_false_node
= build_int_cst (boolean_type_node
, 0);
902 /* ??? Shouldn't this be based on gfc_index_integer_kind or so? */
903 gfc_charlen_int_kind
= 4;
904 gfc_charlen_type_node
= gfc_get_int_type (gfc_charlen_int_kind
);
907 /* Get the type node for the given type and kind. */
910 gfc_get_int_type (int kind
)
912 int index
= gfc_validate_kind (BT_INTEGER
, kind
, true);
913 return index
< 0 ? 0 : gfc_integer_types
[index
];
917 gfc_get_real_type (int kind
)
919 int index
= gfc_validate_kind (BT_REAL
, kind
, true);
920 return index
< 0 ? 0 : gfc_real_types
[index
];
924 gfc_get_complex_type (int kind
)
926 int index
= gfc_validate_kind (BT_COMPLEX
, kind
, true);
927 return index
< 0 ? 0 : gfc_complex_types
[index
];
931 gfc_get_logical_type (int kind
)
933 int index
= gfc_validate_kind (BT_LOGICAL
, kind
, true);
934 return index
< 0 ? 0 : gfc_logical_types
[index
];
938 gfc_get_char_type (int kind
)
940 int index
= gfc_validate_kind (BT_CHARACTER
, kind
, true);
941 return index
< 0 ? 0 : gfc_character_types
[index
];
945 gfc_get_pchar_type (int kind
)
947 int index
= gfc_validate_kind (BT_CHARACTER
, kind
, true);
948 return index
< 0 ? 0 : gfc_pcharacter_types
[index
];
952 /* Create a character type with the given kind and length. */
955 gfc_get_character_type_len_for_eltype (tree eltype
, tree len
)
959 bounds
= build_range_type (gfc_charlen_type_node
, gfc_index_one_node
, len
);
960 type
= build_array_type (eltype
, bounds
);
961 TYPE_STRING_FLAG (type
) = 1;
967 gfc_get_character_type_len (int kind
, tree len
)
969 gfc_validate_kind (BT_CHARACTER
, kind
, false);
970 return gfc_get_character_type_len_for_eltype (gfc_get_char_type (kind
), len
);
974 /* Get a type node for a character kind. */
977 gfc_get_character_type (int kind
, gfc_charlen
* cl
)
981 len
= (cl
== NULL
) ? NULL_TREE
: cl
->backend_decl
;
983 return gfc_get_character_type_len (kind
, len
);
986 /* Covert a basic type. This will be an array for character types. */
989 gfc_typenode_for_spec (gfc_typespec
* spec
)
999 /* We use INTEGER(c_intptr_t) for C_PTR and C_FUNPTR once the symbol
1000 has been resolved. This is done so we can convert C_PTR and
1001 C_FUNPTR to simple variables that get translated to (void *). */
1002 if (spec
->f90_type
== BT_VOID
)
1005 && spec
->u
.derived
->intmod_sym_id
== ISOCBINDING_PTR
)
1006 basetype
= ptr_type_node
;
1008 basetype
= pfunc_type_node
;
1011 basetype
= gfc_get_int_type (spec
->kind
);
1015 basetype
= gfc_get_real_type (spec
->kind
);
1019 basetype
= gfc_get_complex_type (spec
->kind
);
1023 basetype
= gfc_get_logical_type (spec
->kind
);
1027 basetype
= gfc_get_character_type (spec
->kind
, spec
->u
.cl
);
1032 basetype
= gfc_get_derived_type (spec
->u
.derived
);
1034 /* If we're dealing with either C_PTR or C_FUNPTR, we modified the
1035 type and kind to fit a (void *) and the basetype returned was a
1036 ptr_type_node. We need to pass up this new information to the
1037 symbol that was declared of type C_PTR or C_FUNPTR. */
1038 if (spec
->u
.derived
->attr
.is_iso_c
)
1040 spec
->type
= spec
->u
.derived
->ts
.type
;
1041 spec
->kind
= spec
->u
.derived
->ts
.kind
;
1042 spec
->f90_type
= spec
->u
.derived
->ts
.f90_type
;
1046 /* This is for the second arg to c_f_pointer and c_f_procpointer
1047 of the iso_c_binding module, to accept any ptr type. */
1048 basetype
= ptr_type_node
;
1049 if (spec
->f90_type
== BT_VOID
)
1052 && spec
->u
.derived
->intmod_sym_id
== ISOCBINDING_PTR
)
1053 basetype
= ptr_type_node
;
1055 basetype
= pfunc_type_node
;
1064 /* Build an INT_CST for constant expressions, otherwise return NULL_TREE. */
1067 gfc_conv_array_bound (gfc_expr
* expr
)
1069 /* If expr is an integer constant, return that. */
1070 if (expr
!= NULL
&& expr
->expr_type
== EXPR_CONSTANT
)
1071 return gfc_conv_mpz_to_tree (expr
->value
.integer
, gfc_index_integer_kind
);
1073 /* Otherwise return NULL. */
1078 gfc_get_element_type (tree type
)
1082 if (GFC_ARRAY_TYPE_P (type
))
1084 if (TREE_CODE (type
) == POINTER_TYPE
)
1085 type
= TREE_TYPE (type
);
1086 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
1087 element
= TREE_TYPE (type
);
1091 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type
));
1092 element
= GFC_TYPE_ARRAY_DATAPTR_TYPE (type
);
1094 gcc_assert (TREE_CODE (element
) == POINTER_TYPE
);
1095 element
= TREE_TYPE (element
);
1097 gcc_assert (TREE_CODE (element
) == ARRAY_TYPE
);
1098 element
= TREE_TYPE (element
);
1104 /* Build an array. This function is called from gfc_sym_type().
1105 Actually returns array descriptor type.
1107 Format of array descriptors is as follows:
1109 struct gfc_array_descriptor
1114 struct descriptor_dimension dimension[N_DIM];
1117 struct descriptor_dimension
1124 Translation code should use gfc_conv_descriptor_* rather than
1125 accessing the descriptor directly. Any changes to the array
1126 descriptor type will require changes in gfc_conv_descriptor_* and
1127 gfc_build_array_initializer.
1129 This is represented internally as a RECORD_TYPE. The index nodes
1130 are gfc_array_index_type and the data node is a pointer to the
1131 data. See below for the handling of character types.
1133 The dtype member is formatted as follows:
1134 rank = dtype & GFC_DTYPE_RANK_MASK // 3 bits
1135 type = (dtype & GFC_DTYPE_TYPE_MASK) >> GFC_DTYPE_TYPE_SHIFT // 3 bits
1136 size = dtype >> GFC_DTYPE_SIZE_SHIFT
1138 I originally used nested ARRAY_TYPE nodes to represent arrays, but
1139 this generated poor code for assumed/deferred size arrays. These
1140 require use of PLACEHOLDER_EXPR/WITH_RECORD_EXPR, which isn't part
1141 of the GENERIC grammar. Also, there is no way to explicitly set
1142 the array stride, so all data must be packed(1). I've tried to
1143 mark all the functions which would require modification with a GCC
1146 The data component points to the first element in the array. The
1147 offset field is the position of the origin of the array (i.e. element
1148 (0, 0 ...)). This may be outside the bounds of the array.
1150 An element is accessed by
1151 data[offset + index0*stride0 + index1*stride1 + index2*stride2]
1152 This gives good performance as the computation does not involve the
1153 bounds of the array. For packed arrays, this is optimized further
1154 by substituting the known strides.
1156 This system has one problem: all array bounds must be within 2^31
1157 elements of the origin (2^63 on 64-bit machines). For example
1158 integer, dimension (80000:90000, 80000:90000, 2) :: array
1159 may not work properly on 32-bit machines because 80000*80000 >
1160 2^31, so the calculation for stride2 would overflow. This may
1161 still work, but I haven't checked, and it relies on the overflow
1162 doing the right thing.
1164 The way to fix this problem is to access elements as follows:
1165 data[(index0-lbound0)*stride0 + (index1-lbound1)*stride1]
1166 Obviously this is much slower. I will make this a compile time
1167 option, something like -fsmall-array-offsets. Mixing code compiled
1168 with and without this switch will work.
1170 (1) This can be worked around by modifying the upper bound of the
1171 previous dimension. This requires extra fields in the descriptor
1172 (both real_ubound and fake_ubound). */
1175 /* Returns true if the array sym does not require a descriptor. */
1178 gfc_is_nodesc_array (gfc_symbol
* sym
)
1180 gcc_assert (sym
->attr
.dimension
);
1182 /* We only want local arrays. */
1183 if (sym
->attr
.pointer
|| sym
->attr
.allocatable
)
1186 if (sym
->attr
.dummy
)
1188 if (sym
->as
->type
!= AS_ASSUMED_SHAPE
)
1194 if (sym
->attr
.result
|| sym
->attr
.function
)
1197 gcc_assert (sym
->as
->type
== AS_EXPLICIT
|| sym
->as
->cp_was_assumed
);
1203 /* Create an array descriptor type. */
1206 gfc_build_array_type (tree type
, gfc_array_spec
* as
,
1207 enum gfc_array_kind akind
, bool restricted
,
1210 tree lbound
[GFC_MAX_DIMENSIONS
];
1211 tree ubound
[GFC_MAX_DIMENSIONS
];
1214 for (n
= 0; n
< as
->rank
; n
++)
1216 /* Create expressions for the known bounds of the array. */
1217 if (as
->type
== AS_ASSUMED_SHAPE
&& as
->lower
[n
] == NULL
)
1218 lbound
[n
] = gfc_index_one_node
;
1220 lbound
[n
] = gfc_conv_array_bound (as
->lower
[n
]);
1221 ubound
[n
] = gfc_conv_array_bound (as
->upper
[n
]);
1224 if (as
->type
== AS_ASSUMED_SHAPE
)
1225 akind
= contiguous
? GFC_ARRAY_ASSUMED_SHAPE_CONT
1226 : GFC_ARRAY_ASSUMED_SHAPE
;
1227 return gfc_get_array_type_bounds (type
, as
->rank
, as
->corank
, lbound
,
1228 ubound
, 0, akind
, restricted
);
1231 /* Returns the struct descriptor_dimension type. */
1234 gfc_get_desc_dim_type (void)
1237 tree fieldlist
= NULL_TREE
, decl
, *chain
= NULL
;
1239 if (gfc_desc_dim_type
)
1240 return gfc_desc_dim_type
;
1242 /* Build the type node. */
1243 type
= make_node (RECORD_TYPE
);
1245 TYPE_NAME (type
) = get_identifier ("descriptor_dimension");
1246 TYPE_PACKED (type
) = 1;
1248 /* Consists of the stride, lbound and ubound members. */
1249 decl
= gfc_add_field_to_struct_1 (&fieldlist
, type
,
1250 get_identifier ("stride"),
1251 gfc_array_index_type
, &chain
);
1252 TREE_NO_WARNING (decl
) = 1;
1254 decl
= gfc_add_field_to_struct_1 (&fieldlist
, type
,
1255 get_identifier ("lbound"),
1256 gfc_array_index_type
, &chain
);
1257 TREE_NO_WARNING (decl
) = 1;
1259 decl
= gfc_add_field_to_struct_1 (&fieldlist
, type
,
1260 get_identifier ("ubound"),
1261 gfc_array_index_type
, &chain
);
1262 TREE_NO_WARNING (decl
) = 1;
1264 /* Finish off the type. */
1265 TYPE_FIELDS (type
) = fieldlist
;
1267 gfc_finish_type (type
);
1268 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
)) = 1;
1270 gfc_desc_dim_type
= type
;
1275 /* Return the DTYPE for an array. This describes the type and type parameters
1277 /* TODO: Only call this when the value is actually used, and make all the
1278 unknown cases abort. */
1281 gfc_get_dtype (tree type
)
1291 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type
) || GFC_ARRAY_TYPE_P (type
));
1293 if (GFC_TYPE_ARRAY_DTYPE (type
))
1294 return GFC_TYPE_ARRAY_DTYPE (type
);
1296 rank
= GFC_TYPE_ARRAY_RANK (type
);
1297 etype
= gfc_get_element_type (type
);
1299 switch (TREE_CODE (etype
))
1302 n
= GFC_DTYPE_INTEGER
;
1306 n
= GFC_DTYPE_LOGICAL
;
1314 n
= GFC_DTYPE_COMPLEX
;
1317 /* We will never have arrays of arrays. */
1319 n
= GFC_DTYPE_DERIVED
;
1323 n
= GFC_DTYPE_CHARACTER
;
1327 /* TODO: Don't do dtype for temporary descriptorless arrays. */
1328 /* We can strange array types for temporary arrays. */
1329 return gfc_index_zero_node
;
1332 gcc_assert (rank
<= GFC_DTYPE_RANK_MASK
);
1333 size
= TYPE_SIZE_UNIT (etype
);
1335 i
= rank
| (n
<< GFC_DTYPE_TYPE_SHIFT
);
1336 if (size
&& INTEGER_CST_P (size
))
1338 if (tree_int_cst_lt (gfc_max_array_element_size
, size
))
1339 internal_error ("Array element size too big");
1341 i
+= TREE_INT_CST_LOW (size
) << GFC_DTYPE_SIZE_SHIFT
;
1343 dtype
= build_int_cst (gfc_array_index_type
, i
);
1345 if (size
&& !INTEGER_CST_P (size
))
1347 tmp
= build_int_cst (gfc_array_index_type
, GFC_DTYPE_SIZE_SHIFT
);
1348 tmp
= fold_build2 (LSHIFT_EXPR
, gfc_array_index_type
,
1349 fold_convert (gfc_array_index_type
, size
), tmp
);
1350 dtype
= fold_build2 (PLUS_EXPR
, gfc_array_index_type
, tmp
, dtype
);
1352 /* If we don't know the size we leave it as zero. This should never happen
1353 for anything that is actually used. */
1354 /* TODO: Check this is actually true, particularly when repacking
1355 assumed size parameters. */
1357 GFC_TYPE_ARRAY_DTYPE (type
) = dtype
;
1362 /* Build an array type for use without a descriptor, packed according
1363 to the value of PACKED. */
1366 gfc_get_nodesc_array_type (tree etype
, gfc_array_spec
* as
, gfc_packed packed
,
1380 mpz_init_set_ui (offset
, 0);
1381 mpz_init_set_ui (stride
, 1);
1384 /* We don't use build_array_type because this does not include include
1385 lang-specific information (i.e. the bounds of the array) when checking
1387 type
= make_node (ARRAY_TYPE
);
1389 GFC_ARRAY_TYPE_P (type
) = 1;
1390 TYPE_LANG_SPECIFIC (type
)
1391 = ggc_alloc_cleared_lang_type (sizeof (struct lang_type
));
1393 known_stride
= (packed
!= PACKED_NO
);
1395 for (n
= 0; n
< as
->rank
; n
++)
1397 /* Fill in the stride and bound components of the type. */
1399 tmp
= gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1402 GFC_TYPE_ARRAY_STRIDE (type
, n
) = tmp
;
1404 expr
= as
->lower
[n
];
1405 if (expr
->expr_type
== EXPR_CONSTANT
)
1407 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1408 gfc_index_integer_kind
);
1415 GFC_TYPE_ARRAY_LBOUND (type
, n
) = tmp
;
1419 /* Calculate the offset. */
1420 mpz_mul (delta
, stride
, as
->lower
[n
]->value
.integer
);
1421 mpz_sub (offset
, offset
, delta
);
1426 expr
= as
->upper
[n
];
1427 if (expr
&& expr
->expr_type
== EXPR_CONSTANT
)
1429 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1430 gfc_index_integer_kind
);
1437 GFC_TYPE_ARRAY_UBOUND (type
, n
) = tmp
;
1441 /* Calculate the stride. */
1442 mpz_sub (delta
, as
->upper
[n
]->value
.integer
,
1443 as
->lower
[n
]->value
.integer
);
1444 mpz_add_ui (delta
, delta
, 1);
1445 mpz_mul (stride
, stride
, delta
);
1448 /* Only the first stride is known for partial packed arrays. */
1449 if (packed
== PACKED_NO
|| packed
== PACKED_PARTIAL
)
1455 GFC_TYPE_ARRAY_OFFSET (type
) =
1456 gfc_conv_mpz_to_tree (offset
, gfc_index_integer_kind
);
1459 GFC_TYPE_ARRAY_OFFSET (type
) = NULL_TREE
;
1463 GFC_TYPE_ARRAY_SIZE (type
) =
1464 gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1467 GFC_TYPE_ARRAY_SIZE (type
) = NULL_TREE
;
1469 GFC_TYPE_ARRAY_RANK (type
) = as
->rank
;
1470 GFC_TYPE_ARRAY_DTYPE (type
) = NULL_TREE
;
1471 range
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
1473 /* TODO: use main type if it is unbounded. */
1474 GFC_TYPE_ARRAY_DATAPTR_TYPE (type
) =
1475 build_pointer_type (build_array_type (etype
, range
));
1477 GFC_TYPE_ARRAY_DATAPTR_TYPE (type
) =
1478 build_qualified_type (GFC_TYPE_ARRAY_DATAPTR_TYPE (type
),
1479 TYPE_QUAL_RESTRICT
);
1483 mpz_sub_ui (stride
, stride
, 1);
1484 range
= gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1489 range
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
, range
);
1490 TYPE_DOMAIN (type
) = range
;
1492 build_pointer_type (etype
);
1493 TREE_TYPE (type
) = etype
;
1501 /* Represent packed arrays as multi-dimensional if they have rank >
1502 1 and with proper bounds, instead of flat arrays. This makes for
1503 better debug info. */
1506 tree gtype
= etype
, rtype
, type_decl
;
1508 for (n
= as
->rank
- 1; n
>= 0; n
--)
1510 rtype
= build_range_type (gfc_array_index_type
,
1511 GFC_TYPE_ARRAY_LBOUND (type
, n
),
1512 GFC_TYPE_ARRAY_UBOUND (type
, n
));
1513 gtype
= build_array_type (gtype
, rtype
);
1515 TYPE_NAME (type
) = type_decl
= build_decl (input_location
,
1516 TYPE_DECL
, NULL
, gtype
);
1517 DECL_ORIGINAL_TYPE (type_decl
) = gtype
;
1520 if (packed
!= PACKED_STATIC
|| !known_stride
)
1522 /* For dummy arrays and automatic (heap allocated) arrays we
1523 want a pointer to the array. */
1524 type
= build_pointer_type (type
);
1526 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
1527 GFC_ARRAY_TYPE_P (type
) = 1;
1528 TYPE_LANG_SPECIFIC (type
) = TYPE_LANG_SPECIFIC (TREE_TYPE (type
));
1533 /* Return or create the base type for an array descriptor. */
1536 gfc_get_array_descriptor_base (int dimen
, int codimen
, bool restricted
)
1538 tree fat_type
, fieldlist
= NULL_TREE
, decl
, arraytype
, *chain
= NULL
;
1539 char name
[16 + 2*GFC_RANK_DIGITS
+ 1 + 1];
1540 int idx
= 2 * (codimen
+ dimen
- 1) + restricted
;
1542 gcc_assert (dimen
>= 1 && codimen
+ dimen
<= GFC_MAX_DIMENSIONS
);
1543 if (gfc_array_descriptor_base
[idx
])
1544 return gfc_array_descriptor_base
[idx
];
1546 /* Build the type node. */
1547 fat_type
= make_node (RECORD_TYPE
);
1549 sprintf (name
, "array_descriptor" GFC_RANK_PRINTF_FORMAT
, dimen
+ codimen
);
1550 TYPE_NAME (fat_type
) = get_identifier (name
);
1552 /* Add the data member as the first element of the descriptor. */
1553 decl
= gfc_add_field_to_struct_1 (&fieldlist
, fat_type
,
1554 get_identifier ("data"),
1557 : ptr_type_node
), &chain
);
1559 /* Add the base component. */
1560 decl
= gfc_add_field_to_struct_1 (&fieldlist
, fat_type
,
1561 get_identifier ("offset"),
1562 gfc_array_index_type
, &chain
);
1563 TREE_NO_WARNING (decl
) = 1;
1565 /* Add the dtype component. */
1566 decl
= gfc_add_field_to_struct_1 (&fieldlist
, fat_type
,
1567 get_identifier ("dtype"),
1568 gfc_array_index_type
, &chain
);
1569 TREE_NO_WARNING (decl
) = 1;
1571 /* Build the array type for the stride and bound components. */
1573 build_array_type (gfc_get_desc_dim_type (),
1574 build_range_type (gfc_array_index_type
,
1575 gfc_index_zero_node
,
1576 gfc_rank_cst
[codimen
+ dimen
- 1]));
1578 decl
= gfc_add_field_to_struct_1 (&fieldlist
, fat_type
,
1579 get_identifier ("dim"),
1581 TREE_NO_WARNING (decl
) = 1;
1583 /* Finish off the type. */
1584 TYPE_FIELDS (fat_type
) = fieldlist
;
1586 gfc_finish_type (fat_type
);
1587 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (fat_type
)) = 1;
1589 gfc_array_descriptor_base
[idx
] = fat_type
;
1593 /* Build an array (descriptor) type with given bounds. */
1596 gfc_get_array_type_bounds (tree etype
, int dimen
, int codimen
, tree
* lbound
,
1597 tree
* ubound
, int packed
,
1598 enum gfc_array_kind akind
, bool restricted
)
1600 char name
[8 + 2*GFC_RANK_DIGITS
+ 1 + GFC_MAX_SYMBOL_LEN
];
1601 tree fat_type
, base_type
, arraytype
, lower
, upper
, stride
, tmp
, rtype
;
1602 const char *type_name
;
1605 base_type
= gfc_get_array_descriptor_base (dimen
, codimen
, restricted
);
1606 fat_type
= build_distinct_type_copy (base_type
);
1607 /* Make sure that nontarget and target array type have the same canonical
1608 type (and same stub decl for debug info). */
1609 base_type
= gfc_get_array_descriptor_base (dimen
, codimen
, false);
1610 TYPE_CANONICAL (fat_type
) = base_type
;
1611 TYPE_STUB_DECL (fat_type
) = TYPE_STUB_DECL (base_type
);
1613 tmp
= TYPE_NAME (etype
);
1614 if (tmp
&& TREE_CODE (tmp
) == TYPE_DECL
)
1615 tmp
= DECL_NAME (tmp
);
1617 type_name
= IDENTIFIER_POINTER (tmp
);
1619 type_name
= "unknown";
1620 sprintf (name
, "array" GFC_RANK_PRINTF_FORMAT
"_%.*s", dimen
+ codimen
,
1621 GFC_MAX_SYMBOL_LEN
, type_name
);
1622 TYPE_NAME (fat_type
) = get_identifier (name
);
1624 GFC_DESCRIPTOR_TYPE_P (fat_type
) = 1;
1625 TYPE_LANG_SPECIFIC (fat_type
)
1626 = ggc_alloc_cleared_lang_type (sizeof (struct lang_type
));
1628 GFC_TYPE_ARRAY_RANK (fat_type
) = dimen
;
1629 GFC_TYPE_ARRAY_DTYPE (fat_type
) = NULL_TREE
;
1630 GFC_TYPE_ARRAY_AKIND (fat_type
) = akind
;
1632 /* Build an array descriptor record type. */
1634 stride
= gfc_index_one_node
;
1637 for (n
= 0; n
< dimen
; n
++)
1639 GFC_TYPE_ARRAY_STRIDE (fat_type
, n
) = stride
;
1646 if (lower
!= NULL_TREE
)
1648 if (INTEGER_CST_P (lower
))
1649 GFC_TYPE_ARRAY_LBOUND (fat_type
, n
) = lower
;
1655 if (upper
!= NULL_TREE
)
1657 if (INTEGER_CST_P (upper
))
1658 GFC_TYPE_ARRAY_UBOUND (fat_type
, n
) = upper
;
1663 if (upper
!= NULL_TREE
&& lower
!= NULL_TREE
&& stride
!= NULL_TREE
)
1665 tmp
= fold_build2 (MINUS_EXPR
, gfc_array_index_type
, upper
, lower
);
1666 tmp
= fold_build2 (PLUS_EXPR
, gfc_array_index_type
, tmp
,
1667 gfc_index_one_node
);
1669 fold_build2 (MULT_EXPR
, gfc_array_index_type
, tmp
, stride
);
1670 /* Check the folding worked. */
1671 gcc_assert (INTEGER_CST_P (stride
));
1676 GFC_TYPE_ARRAY_SIZE (fat_type
) = stride
;
1678 /* TODO: known offsets for descriptors. */
1679 GFC_TYPE_ARRAY_OFFSET (fat_type
) = NULL_TREE
;
1681 /* We define data as an array with the correct size if possible.
1682 Much better than doing pointer arithmetic. */
1684 rtype
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
1685 int_const_binop (MINUS_EXPR
, stride
,
1686 integer_one_node
, 0));
1688 rtype
= gfc_array_range_type
;
1689 arraytype
= build_array_type (etype
, rtype
);
1690 arraytype
= build_pointer_type (arraytype
);
1692 arraytype
= build_qualified_type (arraytype
, TYPE_QUAL_RESTRICT
);
1693 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type
) = arraytype
;
1695 /* This will generate the base declarations we need to emit debug
1696 information for this type. FIXME: there must be a better way to
1697 avoid divergence between compilations with and without debug
1700 struct array_descr_info info
;
1701 gfc_get_array_descr_info (fat_type
, &info
);
1702 gfc_get_array_descr_info (build_pointer_type (fat_type
), &info
);
1708 /* Build a pointer type. This function is called from gfc_sym_type(). */
1711 gfc_build_pointer_type (gfc_symbol
* sym
, tree type
)
1713 /* Array pointer types aren't actually pointers. */
1714 if (sym
->attr
.dimension
)
1717 return build_pointer_type (type
);
1720 /* Return the type for a symbol. Special handling is required for character
1721 types to get the correct level of indirection.
1722 For functions return the return type.
1723 For subroutines return void_type_node.
1724 Calling this multiple times for the same symbol should be avoided,
1725 especially for character and array types. */
1728 gfc_sym_type (gfc_symbol
* sym
)
1734 /* Procedure Pointers inside COMMON blocks. */
1735 if (sym
->attr
.proc_pointer
&& sym
->attr
.in_common
)
1737 /* Unset proc_pointer as gfc_get_function_type calls gfc_sym_type. */
1738 sym
->attr
.proc_pointer
= 0;
1739 type
= build_pointer_type (gfc_get_function_type (sym
));
1740 sym
->attr
.proc_pointer
= 1;
1744 if (sym
->attr
.flavor
== FL_PROCEDURE
&& !sym
->attr
.function
)
1745 return void_type_node
;
1747 /* In the case of a function the fake result variable may have a
1748 type different from the function type, so don't return early in
1750 if (sym
->backend_decl
&& !sym
->attr
.function
)
1751 return TREE_TYPE (sym
->backend_decl
);
1753 if (sym
->ts
.type
== BT_CHARACTER
1754 && ((sym
->attr
.function
&& sym
->attr
.is_bind_c
)
1755 || (sym
->attr
.result
1756 && sym
->ns
->proc_name
1757 && sym
->ns
->proc_name
->attr
.is_bind_c
)))
1758 type
= gfc_character1_type_node
;
1760 type
= gfc_typenode_for_spec (&sym
->ts
);
1762 if (sym
->attr
.dummy
&& !sym
->attr
.function
&& !sym
->attr
.value
)
1767 restricted
= !sym
->attr
.target
&& !sym
->attr
.pointer
1768 && !sym
->attr
.proc_pointer
&& !sym
->attr
.cray_pointee
;
1769 if (sym
->attr
.dimension
)
1771 if (gfc_is_nodesc_array (sym
))
1773 /* If this is a character argument of unknown length, just use the
1775 if (sym
->ts
.type
!= BT_CHARACTER
1776 || !(sym
->attr
.dummy
|| sym
->attr
.function
)
1777 || sym
->ts
.u
.cl
->backend_decl
)
1779 type
= gfc_get_nodesc_array_type (type
, sym
->as
,
1786 if (sym
->attr
.cray_pointee
)
1787 GFC_POINTER_TYPE_P (type
) = 1;
1791 enum gfc_array_kind akind
= GFC_ARRAY_UNKNOWN
;
1792 if (sym
->attr
.pointer
)
1793 akind
= sym
->attr
.contiguous
? GFC_ARRAY_POINTER_CONT
1794 : GFC_ARRAY_POINTER
;
1795 else if (sym
->attr
.allocatable
)
1796 akind
= GFC_ARRAY_ALLOCATABLE
;
1797 type
= gfc_build_array_type (type
, sym
->as
, akind
, restricted
,
1798 sym
->attr
.contiguous
);
1803 if (sym
->attr
.allocatable
|| sym
->attr
.pointer
)
1804 type
= gfc_build_pointer_type (sym
, type
);
1805 if (sym
->attr
.pointer
|| sym
->attr
.cray_pointee
)
1806 GFC_POINTER_TYPE_P (type
) = 1;
1809 /* We currently pass all parameters by reference.
1810 See f95_get_function_decl. For dummy function parameters return the
1814 /* We must use pointer types for potentially absent variables. The
1815 optimizers assume a reference type argument is never NULL. */
1816 if (sym
->attr
.optional
|| sym
->ns
->proc_name
->attr
.entry_master
)
1817 type
= build_pointer_type (type
);
1820 type
= build_reference_type (type
);
1822 type
= build_qualified_type (type
, TYPE_QUAL_RESTRICT
);
1829 /* Layout and output debug info for a record type. */
1832 gfc_finish_type (tree type
)
1836 decl
= build_decl (input_location
,
1837 TYPE_DECL
, NULL_TREE
, type
);
1838 TYPE_STUB_DECL (type
) = decl
;
1840 rest_of_type_compilation (type
, 1);
1841 rest_of_decl_compilation (decl
, 1, 0);
1844 /* Add a field of given NAME and TYPE to the context of a UNION_TYPE
1845 or RECORD_TYPE pointed to by CONTEXT. The new field is chained
1846 to the fieldlist pointed to by FIELDLIST through *CHAIN.
1848 Returns a pointer to the new field. */
1851 gfc_add_field_to_struct_1 (tree
*fieldlist
, tree context
,
1852 tree name
, tree type
, tree
**chain
)
1854 tree decl
= build_decl (input_location
, FIELD_DECL
, name
, type
);
1856 DECL_CONTEXT (decl
) = context
;
1857 TREE_CHAIN (decl
) = NULL_TREE
;
1858 if (*fieldlist
== NULL_TREE
)
1864 *chain
= &TREE_CHAIN (decl
);
1870 /* Like `gfc_add_field_to_struct_1', but adds alignment
1874 gfc_add_field_to_struct (tree
*fieldlist
, tree context
,
1875 tree name
, tree type
, tree
**chain
)
1877 tree decl
= gfc_add_field_to_struct_1 (fieldlist
, context
,
1880 DECL_INITIAL (decl
) = 0;
1881 DECL_ALIGN (decl
) = 0;
1882 DECL_USER_ALIGN (decl
) = 0;
1888 /* Copy the backend_decl and component backend_decls if
1889 the two derived type symbols are "equal", as described
1890 in 4.4.2 and resolved by gfc_compare_derived_types. */
1893 copy_dt_decls_ifequal (gfc_symbol
*from
, gfc_symbol
*to
,
1896 gfc_component
*to_cm
;
1897 gfc_component
*from_cm
;
1899 if (from
->backend_decl
== NULL
1900 || !gfc_compare_derived_types (from
, to
))
1903 to
->backend_decl
= from
->backend_decl
;
1905 to_cm
= to
->components
;
1906 from_cm
= from
->components
;
1908 /* Copy the component declarations. If a component is itself
1909 a derived type, we need a copy of its component declarations.
1910 This is done by recursing into gfc_get_derived_type and
1911 ensures that the component's component declarations have
1912 been built. If it is a character, we need the character
1914 for (; to_cm
; to_cm
= to_cm
->next
, from_cm
= from_cm
->next
)
1916 to_cm
->backend_decl
= from_cm
->backend_decl
;
1917 if ((!from_cm
->attr
.pointer
|| from_gsym
)
1918 && from_cm
->ts
.type
== BT_DERIVED
)
1919 gfc_get_derived_type (to_cm
->ts
.u
.derived
);
1921 else if (from_cm
->ts
.type
== BT_CHARACTER
)
1922 to_cm
->ts
.u
.cl
->backend_decl
= from_cm
->ts
.u
.cl
->backend_decl
;
1929 /* Build a tree node for a procedure pointer component. */
1932 gfc_get_ppc_type (gfc_component
* c
)
1936 /* Explicit interface. */
1937 if (c
->attr
.if_source
!= IFSRC_UNKNOWN
&& c
->ts
.interface
)
1938 return build_pointer_type (gfc_get_function_type (c
->ts
.interface
));
1940 /* Implicit interface (only return value may be known). */
1941 if (c
->attr
.function
&& !c
->attr
.dimension
&& c
->ts
.type
!= BT_CHARACTER
)
1942 t
= gfc_typenode_for_spec (&c
->ts
);
1946 return build_pointer_type (build_function_type_list (t
, NULL_TREE
));
1950 /* Build a tree node for a derived type. If there are equal
1951 derived types, with different local names, these are built
1952 at the same time. If an equal derived type has been built
1953 in a parent namespace, this is used. */
1956 gfc_get_derived_type (gfc_symbol
* derived
)
1958 tree typenode
= NULL
, field
= NULL
, field_type
= NULL
, fieldlist
= NULL
;
1959 tree canonical
= NULL_TREE
;
1961 bool got_canonical
= false;
1967 gcc_assert (derived
&& derived
->attr
.flavor
== FL_DERIVED
);
1969 /* See if it's one of the iso_c_binding derived types. */
1970 if (derived
->attr
.is_iso_c
== 1)
1972 if (derived
->backend_decl
)
1973 return derived
->backend_decl
;
1975 if (derived
->intmod_sym_id
== ISOCBINDING_PTR
)
1976 derived
->backend_decl
= ptr_type_node
;
1978 derived
->backend_decl
= pfunc_type_node
;
1980 /* Create a backend_decl for the __c_ptr_c_address field. */
1981 derived
->components
->backend_decl
=
1982 gfc_add_field_to_struct (&(derived
->backend_decl
->type
.values
),
1983 derived
->backend_decl
,
1984 get_identifier (derived
->components
->name
),
1985 gfc_typenode_for_spec (
1986 &(derived
->components
->ts
)), NULL
);
1988 derived
->ts
.kind
= gfc_index_integer_kind
;
1989 derived
->ts
.type
= BT_INTEGER
;
1990 /* Set the f90_type to BT_VOID as a way to recognize something of type
1991 BT_INTEGER that needs to fit a void * for the purpose of the
1992 iso_c_binding derived types. */
1993 derived
->ts
.f90_type
= BT_VOID
;
1995 return derived
->backend_decl
;
1998 /* If use associated, use the module type for this one. */
1999 if (gfc_option
.flag_whole_file
2000 && derived
->backend_decl
== NULL
2001 && derived
->attr
.use_assoc
2004 gsym
= gfc_find_gsymbol (gfc_gsym_root
, derived
->module
);
2005 if (gsym
&& gsym
->ns
&& gsym
->type
== GSYM_MODULE
)
2009 gfc_find_symbol (derived
->name
, gsym
->ns
, 0, &s
);
2010 if (s
&& s
->backend_decl
)
2012 copy_dt_decls_ifequal (s
, derived
, true);
2013 goto copy_derived_types
;
2018 /* If a whole file compilation, the derived types from an earlier
2019 namespace can be used as the the canonical type. */
2020 if (gfc_option
.flag_whole_file
2021 && derived
->backend_decl
== NULL
2022 && !derived
->attr
.use_assoc
2023 && gfc_global_ns_list
)
2025 for (ns
= gfc_global_ns_list
;
2026 ns
->translated
&& !got_canonical
;
2029 dt
= ns
->derived_types
;
2030 for (; dt
&& !canonical
; dt
= dt
->next
)
2032 copy_dt_decls_ifequal (dt
->derived
, derived
, true);
2033 if (derived
->backend_decl
)
2034 got_canonical
= true;
2039 /* Store up the canonical type to be added to this one. */
2042 if (TYPE_CANONICAL (derived
->backend_decl
))
2043 canonical
= TYPE_CANONICAL (derived
->backend_decl
);
2045 canonical
= derived
->backend_decl
;
2047 derived
->backend_decl
= NULL_TREE
;
2050 /* derived->backend_decl != 0 means we saw it before, but its
2051 components' backend_decl may have not been built. */
2052 if (derived
->backend_decl
)
2054 /* Its components' backend_decl have been built or we are
2055 seeing recursion through the formal arglist of a procedure
2056 pointer component. */
2057 if (TYPE_FIELDS (derived
->backend_decl
)
2058 || derived
->attr
.proc_pointer_comp
)
2059 return derived
->backend_decl
;
2061 typenode
= derived
->backend_decl
;
2065 /* We see this derived type first time, so build the type node. */
2066 typenode
= make_node (RECORD_TYPE
);
2067 TYPE_NAME (typenode
) = get_identifier (derived
->name
);
2068 TYPE_PACKED (typenode
) = gfc_option
.flag_pack_derived
;
2069 derived
->backend_decl
= typenode
;
2072 /* Go through the derived type components, building them as
2073 necessary. The reason for doing this now is that it is
2074 possible to recurse back to this derived type through a
2075 pointer component (PR24092). If this happens, the fields
2076 will be built and so we can return the type. */
2077 for (c
= derived
->components
; c
; c
= c
->next
)
2079 if (c
->ts
.type
!= BT_DERIVED
&& c
->ts
.type
!= BT_CLASS
)
2082 if ((!c
->attr
.pointer
&& !c
->attr
.proc_pointer
)
2083 || c
->ts
.u
.derived
->backend_decl
== NULL
)
2084 c
->ts
.u
.derived
->backend_decl
= gfc_get_derived_type (c
->ts
.u
.derived
);
2086 if (c
->ts
.u
.derived
&& c
->ts
.u
.derived
->attr
.is_iso_c
)
2088 /* Need to copy the modified ts from the derived type. The
2089 typespec was modified because C_PTR/C_FUNPTR are translated
2090 into (void *) from derived types. */
2091 c
->ts
.type
= c
->ts
.u
.derived
->ts
.type
;
2092 c
->ts
.kind
= c
->ts
.u
.derived
->ts
.kind
;
2093 c
->ts
.f90_type
= c
->ts
.u
.derived
->ts
.f90_type
;
2096 c
->initializer
->ts
.type
= c
->ts
.type
;
2097 c
->initializer
->ts
.kind
= c
->ts
.kind
;
2098 c
->initializer
->ts
.f90_type
= c
->ts
.f90_type
;
2099 c
->initializer
->expr_type
= EXPR_NULL
;
2104 if (TYPE_FIELDS (derived
->backend_decl
))
2105 return derived
->backend_decl
;
2107 /* Build the type member list. Install the newly created RECORD_TYPE
2108 node as DECL_CONTEXT of each FIELD_DECL. */
2109 fieldlist
= NULL_TREE
;
2110 for (c
= derived
->components
; c
; c
= c
->next
)
2112 if (c
->attr
.proc_pointer
)
2113 field_type
= gfc_get_ppc_type (c
);
2114 else if (c
->ts
.type
== BT_DERIVED
|| c
->ts
.type
== BT_CLASS
)
2115 field_type
= c
->ts
.u
.derived
->backend_decl
;
2118 if (c
->ts
.type
== BT_CHARACTER
)
2120 /* Evaluate the string length. */
2121 gfc_conv_const_charlen (c
->ts
.u
.cl
);
2122 gcc_assert (c
->ts
.u
.cl
->backend_decl
);
2125 field_type
= gfc_typenode_for_spec (&c
->ts
);
2128 /* This returns an array descriptor type. Initialization may be
2130 if (c
->attr
.dimension
&& !c
->attr
.proc_pointer
)
2132 if (c
->attr
.pointer
|| c
->attr
.allocatable
)
2134 enum gfc_array_kind akind
;
2135 if (c
->attr
.pointer
)
2136 akind
= c
->attr
.contiguous
? GFC_ARRAY_POINTER_CONT
2137 : GFC_ARRAY_POINTER
;
2139 akind
= GFC_ARRAY_ALLOCATABLE
;
2140 /* Pointers to arrays aren't actually pointer types. The
2141 descriptors are separate, but the data is common. */
2142 field_type
= gfc_build_array_type (field_type
, c
->as
, akind
,
2144 && !c
->attr
.pointer
,
2145 c
->attr
.contiguous
);
2148 field_type
= gfc_get_nodesc_array_type (field_type
, c
->as
,
2152 else if ((c
->attr
.pointer
|| c
->attr
.allocatable
)
2153 && !c
->attr
.proc_pointer
)
2154 field_type
= build_pointer_type (field_type
);
2156 /* vtype fields can point to different types to the base type. */
2157 if (c
->ts
.type
== BT_DERIVED
&& c
->ts
.u
.derived
->attr
.vtype
)
2158 field_type
= build_pointer_type_for_mode (TREE_TYPE (field_type
),
2161 field
= gfc_add_field_to_struct (&fieldlist
, typenode
,
2162 get_identifier (c
->name
),
2163 field_type
, &chain
);
2165 gfc_set_decl_location (field
, &c
->loc
);
2166 else if (derived
->declared_at
.lb
)
2167 gfc_set_decl_location (field
, &derived
->declared_at
);
2169 DECL_PACKED (field
) |= TYPE_PACKED (typenode
);
2172 if (!c
->backend_decl
)
2173 c
->backend_decl
= field
;
2176 /* Now we have the final fieldlist. Record it, then lay out the
2177 derived type, including the fields. */
2178 TYPE_FIELDS (typenode
) = fieldlist
;
2180 TYPE_CANONICAL (typenode
) = canonical
;
2182 gfc_finish_type (typenode
);
2183 gfc_set_decl_location (TYPE_STUB_DECL (typenode
), &derived
->declared_at
);
2184 if (derived
->module
&& derived
->ns
->proc_name
2185 && derived
->ns
->proc_name
->attr
.flavor
== FL_MODULE
)
2187 if (derived
->ns
->proc_name
->backend_decl
2188 && TREE_CODE (derived
->ns
->proc_name
->backend_decl
)
2191 TYPE_CONTEXT (typenode
) = derived
->ns
->proc_name
->backend_decl
;
2192 DECL_CONTEXT (TYPE_STUB_DECL (typenode
))
2193 = derived
->ns
->proc_name
->backend_decl
;
2197 derived
->backend_decl
= typenode
;
2201 for (dt
= gfc_derived_types
; dt
; dt
= dt
->next
)
2202 copy_dt_decls_ifequal (derived
, dt
->derived
, false);
2204 return derived
->backend_decl
;
2209 gfc_return_by_reference (gfc_symbol
* sym
)
2211 if (!sym
->attr
.function
)
2214 if (sym
->attr
.dimension
)
2217 if (sym
->ts
.type
== BT_CHARACTER
2218 && !sym
->attr
.is_bind_c
2219 && (!sym
->attr
.result
2220 || !sym
->ns
->proc_name
2221 || !sym
->ns
->proc_name
->attr
.is_bind_c
))
2224 /* Possibly return complex numbers by reference for g77 compatibility.
2225 We don't do this for calls to intrinsics (as the library uses the
2226 -fno-f2c calling convention), nor for calls to functions which always
2227 require an explicit interface, as no compatibility problems can
2229 if (gfc_option
.flag_f2c
2230 && sym
->ts
.type
== BT_COMPLEX
2231 && !sym
->attr
.intrinsic
&& !sym
->attr
.always_explicit
)
2238 gfc_get_mixed_entry_union (gfc_namespace
*ns
)
2243 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2244 gfc_entry_list
*el
, *el2
;
2246 gcc_assert (ns
->proc_name
->attr
.mixed_entry_master
);
2247 gcc_assert (memcmp (ns
->proc_name
->name
, "master.", 7) == 0);
2249 snprintf (name
, GFC_MAX_SYMBOL_LEN
, "munion.%s", ns
->proc_name
->name
+ 7);
2251 /* Build the type node. */
2252 type
= make_node (UNION_TYPE
);
2254 TYPE_NAME (type
) = get_identifier (name
);
2257 for (el
= ns
->entries
; el
; el
= el
->next
)
2259 /* Search for duplicates. */
2260 for (el2
= ns
->entries
; el2
!= el
; el2
= el2
->next
)
2261 if (el2
->sym
->result
== el
->sym
->result
)
2265 gfc_add_field_to_struct_1 (&fieldlist
, type
,
2266 get_identifier (el
->sym
->result
->name
),
2267 gfc_sym_type (el
->sym
->result
), &chain
);
2270 /* Finish off the type. */
2271 TYPE_FIELDS (type
) = fieldlist
;
2273 gfc_finish_type (type
);
2274 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
)) = 1;
2279 gfc_get_function_type (gfc_symbol
* sym
)
2283 gfc_formal_arglist
*f
;
2286 int alternate_return
;
2288 /* Make sure this symbol is a function, a subroutine or the main
2290 gcc_assert (sym
->attr
.flavor
== FL_PROCEDURE
2291 || sym
->attr
.flavor
== FL_PROGRAM
);
2293 if (sym
->backend_decl
)
2294 return TREE_TYPE (sym
->backend_decl
);
2297 alternate_return
= 0;
2298 typelist
= NULL_TREE
;
2300 if (sym
->attr
.entry_master
)
2302 /* Additional parameter for selecting an entry point. */
2303 typelist
= gfc_chainon_list (typelist
, gfc_array_index_type
);
2311 if (arg
->ts
.type
== BT_CHARACTER
)
2312 gfc_conv_const_charlen (arg
->ts
.u
.cl
);
2314 /* Some functions we use an extra parameter for the return value. */
2315 if (gfc_return_by_reference (sym
))
2317 type
= gfc_sym_type (arg
);
2318 if (arg
->ts
.type
== BT_COMPLEX
2319 || arg
->attr
.dimension
2320 || arg
->ts
.type
== BT_CHARACTER
)
2321 type
= build_reference_type (type
);
2323 typelist
= gfc_chainon_list (typelist
, type
);
2324 if (arg
->ts
.type
== BT_CHARACTER
)
2325 typelist
= gfc_chainon_list (typelist
, gfc_charlen_type_node
);
2328 /* Build the argument types for the function. */
2329 for (f
= sym
->formal
; f
; f
= f
->next
)
2334 /* Evaluate constant character lengths here so that they can be
2335 included in the type. */
2336 if (arg
->ts
.type
== BT_CHARACTER
)
2337 gfc_conv_const_charlen (arg
->ts
.u
.cl
);
2339 if (arg
->attr
.flavor
== FL_PROCEDURE
)
2341 type
= gfc_get_function_type (arg
);
2342 type
= build_pointer_type (type
);
2345 type
= gfc_sym_type (arg
);
2347 /* Parameter Passing Convention
2349 We currently pass all parameters by reference.
2350 Parameters with INTENT(IN) could be passed by value.
2351 The problem arises if a function is called via an implicit
2352 prototype. In this situation the INTENT is not known.
2353 For this reason all parameters to global functions must be
2354 passed by reference. Passing by value would potentially
2355 generate bad code. Worse there would be no way of telling that
2356 this code was bad, except that it would give incorrect results.
2358 Contained procedures could pass by value as these are never
2359 used without an explicit interface, and cannot be passed as
2360 actual parameters for a dummy procedure. */
2361 if (arg
->ts
.type
== BT_CHARACTER
&& !sym
->attr
.is_bind_c
)
2363 typelist
= gfc_chainon_list (typelist
, type
);
2367 if (sym
->attr
.subroutine
)
2368 alternate_return
= 1;
2372 /* Add hidden string length parameters. */
2374 typelist
= gfc_chainon_list (typelist
, gfc_charlen_type_node
);
2377 typelist
= gfc_chainon_list (typelist
, void_type_node
);
2379 if (alternate_return
)
2380 type
= integer_type_node
;
2381 else if (!sym
->attr
.function
|| gfc_return_by_reference (sym
))
2382 type
= void_type_node
;
2383 else if (sym
->attr
.mixed_entry_master
)
2384 type
= gfc_get_mixed_entry_union (sym
->ns
);
2385 else if (gfc_option
.flag_f2c
2386 && sym
->ts
.type
== BT_REAL
2387 && sym
->ts
.kind
== gfc_default_real_kind
2388 && !sym
->attr
.always_explicit
)
2390 /* Special case: f2c calling conventions require that (scalar)
2391 default REAL functions return the C type double instead. f2c
2392 compatibility is only an issue with functions that don't
2393 require an explicit interface, as only these could be
2394 implemented in Fortran 77. */
2395 sym
->ts
.kind
= gfc_default_double_kind
;
2396 type
= gfc_typenode_for_spec (&sym
->ts
);
2397 sym
->ts
.kind
= gfc_default_real_kind
;
2399 else if (sym
->result
&& sym
->result
->attr
.proc_pointer
)
2400 /* Procedure pointer return values. */
2402 if (sym
->result
->attr
.result
&& strcmp (sym
->name
,"ppr@") != 0)
2404 /* Unset proc_pointer as gfc_get_function_type
2405 is called recursively. */
2406 sym
->result
->attr
.proc_pointer
= 0;
2407 type
= build_pointer_type (gfc_get_function_type (sym
->result
));
2408 sym
->result
->attr
.proc_pointer
= 1;
2411 type
= gfc_sym_type (sym
->result
);
2414 type
= gfc_sym_type (sym
);
2416 type
= build_function_type (type
, typelist
);
2421 /* Language hooks for middle-end access to type nodes. */
2423 /* Return an integer type with BITS bits of precision,
2424 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2427 gfc_type_for_size (unsigned bits
, int unsignedp
)
2432 for (i
= 0; i
<= MAX_INT_KINDS
; ++i
)
2434 tree type
= gfc_integer_types
[i
];
2435 if (type
&& bits
== TYPE_PRECISION (type
))
2439 /* Handle TImode as a special case because it is used by some backends
2440 (e.g. ARM) even though it is not available for normal use. */
2441 #if HOST_BITS_PER_WIDE_INT >= 64
2442 if (bits
== TYPE_PRECISION (intTI_type_node
))
2443 return intTI_type_node
;
2448 if (bits
== TYPE_PRECISION (unsigned_intQI_type_node
))
2449 return unsigned_intQI_type_node
;
2450 if (bits
== TYPE_PRECISION (unsigned_intHI_type_node
))
2451 return unsigned_intHI_type_node
;
2452 if (bits
== TYPE_PRECISION (unsigned_intSI_type_node
))
2453 return unsigned_intSI_type_node
;
2454 if (bits
== TYPE_PRECISION (unsigned_intDI_type_node
))
2455 return unsigned_intDI_type_node
;
2456 if (bits
== TYPE_PRECISION (unsigned_intTI_type_node
))
2457 return unsigned_intTI_type_node
;
2463 /* Return a data type that has machine mode MODE. If the mode is an
2464 integer, then UNSIGNEDP selects between signed and unsigned types. */
2467 gfc_type_for_mode (enum machine_mode mode
, int unsignedp
)
2472 if (GET_MODE_CLASS (mode
) == MODE_FLOAT
)
2473 base
= gfc_real_types
;
2474 else if (GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
)
2475 base
= gfc_complex_types
;
2476 else if (SCALAR_INT_MODE_P (mode
))
2477 return gfc_type_for_size (GET_MODE_PRECISION (mode
), unsignedp
);
2478 else if (VECTOR_MODE_P (mode
))
2480 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2481 tree inner_type
= gfc_type_for_mode (inner_mode
, unsignedp
);
2482 if (inner_type
!= NULL_TREE
)
2483 return build_vector_type_for_mode (inner_type
, mode
);
2489 for (i
= 0; i
<= MAX_REAL_KINDS
; ++i
)
2491 tree type
= base
[i
];
2492 if (type
&& mode
== TYPE_MODE (type
))
2499 /* Return TRUE if TYPE is a type with a hidden descriptor, fill in INFO
2503 gfc_get_array_descr_info (const_tree type
, struct array_descr_info
*info
)
2506 bool indirect
= false;
2507 tree etype
, ptype
, field
, t
, base_decl
;
2508 tree data_off
, dim_off
, dim_size
, elem_size
;
2509 tree lower_suboff
, upper_suboff
, stride_suboff
;
2511 if (! GFC_DESCRIPTOR_TYPE_P (type
))
2513 if (! POINTER_TYPE_P (type
))
2515 type
= TREE_TYPE (type
);
2516 if (! GFC_DESCRIPTOR_TYPE_P (type
))
2521 rank
= GFC_TYPE_ARRAY_RANK (type
);
2522 if (rank
>= (int) (sizeof (info
->dimen
) / sizeof (info
->dimen
[0])))
2525 etype
= GFC_TYPE_ARRAY_DATAPTR_TYPE (type
);
2526 gcc_assert (POINTER_TYPE_P (etype
));
2527 etype
= TREE_TYPE (etype
);
2528 gcc_assert (TREE_CODE (etype
) == ARRAY_TYPE
);
2529 etype
= TREE_TYPE (etype
);
2530 /* Can't handle variable sized elements yet. */
2531 if (int_size_in_bytes (etype
) <= 0)
2533 /* Nor non-constant lower bounds in assumed shape arrays. */
2534 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE
2535 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE_CONT
)
2537 for (dim
= 0; dim
< rank
; dim
++)
2538 if (GFC_TYPE_ARRAY_LBOUND (type
, dim
) == NULL_TREE
2539 || TREE_CODE (GFC_TYPE_ARRAY_LBOUND (type
, dim
)) != INTEGER_CST
)
2543 memset (info
, '\0', sizeof (*info
));
2544 info
->ndimensions
= rank
;
2545 info
->element_type
= etype
;
2546 ptype
= build_pointer_type (gfc_array_index_type
);
2547 base_decl
= GFC_TYPE_ARRAY_BASE_DECL (type
, indirect
);
2550 base_decl
= build_decl (input_location
, VAR_DECL
, NULL_TREE
,
2551 indirect
? build_pointer_type (ptype
) : ptype
);
2552 GFC_TYPE_ARRAY_BASE_DECL (type
, indirect
) = base_decl
;
2554 info
->base_decl
= base_decl
;
2556 base_decl
= build1 (INDIRECT_REF
, ptype
, base_decl
);
2558 if (GFC_TYPE_ARRAY_SPAN (type
))
2559 elem_size
= GFC_TYPE_ARRAY_SPAN (type
);
2561 elem_size
= fold_convert (gfc_array_index_type
, TYPE_SIZE_UNIT (etype
));
2562 field
= TYPE_FIELDS (TYPE_MAIN_VARIANT (type
));
2563 data_off
= byte_position (field
);
2564 field
= TREE_CHAIN (field
);
2565 field
= TREE_CHAIN (field
);
2566 field
= TREE_CHAIN (field
);
2567 dim_off
= byte_position (field
);
2568 dim_size
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (field
)));
2569 field
= TYPE_FIELDS (TREE_TYPE (TREE_TYPE (field
)));
2570 stride_suboff
= byte_position (field
);
2571 field
= TREE_CHAIN (field
);
2572 lower_suboff
= byte_position (field
);
2573 field
= TREE_CHAIN (field
);
2574 upper_suboff
= byte_position (field
);
2577 if (!integer_zerop (data_off
))
2578 t
= build2 (POINTER_PLUS_EXPR
, ptype
, t
, data_off
);
2579 t
= build1 (NOP_EXPR
, build_pointer_type (ptr_type_node
), t
);
2580 info
->data_location
= build1 (INDIRECT_REF
, ptr_type_node
, t
);
2581 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ALLOCATABLE
)
2582 info
->allocated
= build2 (NE_EXPR
, boolean_type_node
,
2583 info
->data_location
, null_pointer_node
);
2584 else if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_POINTER
2585 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_POINTER_CONT
)
2586 info
->associated
= build2 (NE_EXPR
, boolean_type_node
,
2587 info
->data_location
, null_pointer_node
);
2589 for (dim
= 0; dim
< rank
; dim
++)
2591 t
= build2 (POINTER_PLUS_EXPR
, ptype
, base_decl
,
2592 size_binop (PLUS_EXPR
, dim_off
, lower_suboff
));
2593 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
2594 info
->dimen
[dim
].lower_bound
= t
;
2595 t
= build2 (POINTER_PLUS_EXPR
, ptype
, base_decl
,
2596 size_binop (PLUS_EXPR
, dim_off
, upper_suboff
));
2597 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
2598 info
->dimen
[dim
].upper_bound
= t
;
2599 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE
2600 || GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE_CONT
)
2602 /* Assumed shape arrays have known lower bounds. */
2603 info
->dimen
[dim
].upper_bound
2604 = build2 (MINUS_EXPR
, gfc_array_index_type
,
2605 info
->dimen
[dim
].upper_bound
,
2606 info
->dimen
[dim
].lower_bound
);
2607 info
->dimen
[dim
].lower_bound
2608 = fold_convert (gfc_array_index_type
,
2609 GFC_TYPE_ARRAY_LBOUND (type
, dim
));
2610 info
->dimen
[dim
].upper_bound
2611 = build2 (PLUS_EXPR
, gfc_array_index_type
,
2612 info
->dimen
[dim
].lower_bound
,
2613 info
->dimen
[dim
].upper_bound
);
2615 t
= build2 (POINTER_PLUS_EXPR
, ptype
, base_decl
,
2616 size_binop (PLUS_EXPR
, dim_off
, stride_suboff
));
2617 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
2618 t
= build2 (MULT_EXPR
, gfc_array_index_type
, t
, elem_size
);
2619 info
->dimen
[dim
].stride
= t
;
2620 dim_off
= size_binop (PLUS_EXPR
, dim_off
, dim_size
);
2626 #include "gt-fortran-trans-types.h"