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"
29 #include "tm.h" /* For INTMAX_TYPE, INT8_TYPE, INT16_TYPE, INT32_TYPE,
30 INT64_TYPE, INT_LEAST8_TYPE, INT_LEAST16_TYPE,
31 INT_LEAST32_TYPE, INT_LEAST64_TYPE, INT_FAST8_TYPE,
32 INT_FAST16_TYPE, INT_FAST32_TYPE, INT_FAST64_TYPE,
33 BOOL_TYPE_SIZE, BITS_PER_UNIT, POINTER_SIZE,
34 INT_TYPE_SIZE, CHAR_TYPE_SIZE, SHORT_TYPE_SIZE,
35 LONG_TYPE_SIZE, LONG_LONG_TYPE_SIZE,
36 FLOAT_TYPE_SIZE, DOUBLE_TYPE_SIZE,
37 LONG_DOUBLE_TYPE_SIZE and LIBGCC2_HAS_TF_MODE. */
39 #include "langhooks.h" /* For iso-c-bindings.def. */
42 #include "diagnostic-core.h" /* For fatal_error. */
43 #include "toplev.h" /* For rest_of_decl_compilation. */
46 #include "trans-types.h"
47 #include "trans-const.h"
49 #include "dwarf2out.h" /* For struct array_descr_info. */
52 #if (GFC_MAX_DIMENSIONS < 10)
53 #define GFC_RANK_DIGITS 1
54 #define GFC_RANK_PRINTF_FORMAT "%01d"
55 #elif (GFC_MAX_DIMENSIONS < 100)
56 #define GFC_RANK_DIGITS 2
57 #define GFC_RANK_PRINTF_FORMAT "%02d"
59 #error If you really need >99 dimensions, continue the sequence above...
62 /* array of structs so we don't have to worry about xmalloc or free */
63 CInteropKind_t c_interop_kinds_table[ISOCBINDING_NUMBER];
65 tree gfc_array_index_type;
66 tree gfc_array_range_type;
67 tree gfc_character1_type_node;
69 tree prvoid_type_node;
70 tree ppvoid_type_node;
74 tree gfc_charlen_type_node;
76 tree float128_type_node = NULL_TREE;
77 tree complex_float128_type_node = NULL_TREE;
79 bool gfc_real16_is_float128 = false;
81 static GTY(()) tree gfc_desc_dim_type;
82 static GTY(()) tree gfc_max_array_element_size;
83 static GTY(()) tree gfc_array_descriptor_base[2 * GFC_MAX_DIMENSIONS];
84 static GTY(()) tree gfc_array_descriptor_base_caf[2 * GFC_MAX_DIMENSIONS];
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 void 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) \
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) \
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 PROCEDURE(a,b) \
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 = 0;
347 #include "iso-c-binding.def"
348 #define NAMED_FUNCTION(a,b,c,d) \
349 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
350 c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
351 c_interop_kinds_table[a].value = c;
352 #include "iso-c-binding.def"
356 /* Query the target to determine which machine modes are available for
357 computation. Choose KIND numbers for them. */
360 gfc_init_kinds (void)
363 int i_index, r_index, kind;
364 bool saw_i4 = false, saw_i8 = false;
365 bool saw_r4 = false, saw_r8 = false, saw_r16 = false;
367 for (i_index = 0, mode = MIN_MODE_INT; mode <= MAX_MODE_INT; mode++)
371 if (!targetm.scalar_mode_supported_p ((enum machine_mode) mode))
374 /* The middle end doesn't support constants larger than 2*HWI.
375 Perhaps the target hook shouldn't have accepted these either,
376 but just to be safe... */
377 bitsize = GET_MODE_BITSIZE (mode);
378 if (bitsize > 2*HOST_BITS_PER_WIDE_INT)
381 gcc_assert (i_index != MAX_INT_KINDS);
383 /* Let the kind equal the bit size divided by 8. This insulates the
384 programmer from the underlying byte size. */
392 gfc_integer_kinds[i_index].kind = kind;
393 gfc_integer_kinds[i_index].radix = 2;
394 gfc_integer_kinds[i_index].digits = bitsize - 1;
395 gfc_integer_kinds[i_index].bit_size = bitsize;
397 gfc_logical_kinds[i_index].kind = kind;
398 gfc_logical_kinds[i_index].bit_size = bitsize;
403 /* Set the kind used to match GFC_INT_IO in libgfortran. This is
404 used for large file access. */
411 /* If we do not at least have kind = 4, everything is pointless. */
414 /* Set the maximum integer kind. Used with at least BOZ constants. */
415 gfc_max_integer_kind = gfc_integer_kinds[i_index - 1].kind;
417 for (r_index = 0, mode = MIN_MODE_FLOAT; mode <= MAX_MODE_FLOAT; mode++)
419 const struct real_format *fmt =
420 REAL_MODE_FORMAT ((enum machine_mode) mode);
425 if (!targetm.scalar_mode_supported_p ((enum machine_mode) mode))
428 /* Only let float, double, long double and __float128 go through.
429 Runtime support for others is not provided, so they would be
431 if (mode != TYPE_MODE (float_type_node)
432 && (mode != TYPE_MODE (double_type_node))
433 && (mode != TYPE_MODE (long_double_type_node))
434 #if defined(LIBGCC2_HAS_TF_MODE) && defined(ENABLE_LIBQUADMATH_SUPPORT)
440 /* Let the kind equal the precision divided by 8, rounding up. Again,
441 this insulates the programmer from the underlying byte size.
443 Also, it effectively deals with IEEE extended formats. There, the
444 total size of the type may equal 16, but it's got 6 bytes of padding
445 and the increased size can get in the way of a real IEEE quad format
446 which may also be supported by the target.
448 We round up so as to handle IA-64 __floatreg (RFmode), which is an
449 82 bit type. Not to be confused with __float80 (XFmode), which is
450 an 80 bit type also supported by IA-64. So XFmode should come out
451 to be kind=10, and RFmode should come out to be kind=11. Egads. */
453 kind = (GET_MODE_PRECISION (mode) + 7) / 8;
462 /* Careful we don't stumble a weird internal mode. */
463 gcc_assert (r_index <= 0 || gfc_real_kinds[r_index-1].kind != kind);
464 /* Or have too many modes for the allocated space. */
465 gcc_assert (r_index != MAX_REAL_KINDS);
467 gfc_real_kinds[r_index].kind = kind;
468 gfc_real_kinds[r_index].radix = fmt->b;
469 gfc_real_kinds[r_index].digits = fmt->p;
470 gfc_real_kinds[r_index].min_exponent = fmt->emin;
471 gfc_real_kinds[r_index].max_exponent = fmt->emax;
472 if (fmt->pnan < fmt->p)
473 /* This is an IBM extended double format (or the MIPS variant)
474 made up of two IEEE doubles. The value of the long double is
475 the sum of the values of the two parts. The most significant
476 part is required to be the value of the long double rounded
477 to the nearest double. If we use emax of 1024 then we can't
478 represent huge(x) = (1 - b**(-p)) * b**(emax-1) * b, because
479 rounding will make the most significant part overflow. */
480 gfc_real_kinds[r_index].max_exponent = fmt->emax - 1;
481 gfc_real_kinds[r_index].mode_precision = GET_MODE_PRECISION (mode);
485 /* Choose the default integer kind. We choose 4 unless the user
486 directs us otherwise. */
487 if (gfc_option.flag_default_integer)
490 fatal_error ("integer kind=8 not available for -fdefault-integer-8 option");
491 gfc_default_integer_kind = 8;
493 /* Even if the user specified that the default integer kind be 8,
494 the numeric storage size isn't 64. In this case, a warning will
495 be issued when NUMERIC_STORAGE_SIZE is used. */
496 gfc_numeric_storage_size = 4 * 8;
500 gfc_default_integer_kind = 4;
501 gfc_numeric_storage_size = 4 * 8;
505 gfc_default_integer_kind = gfc_integer_kinds[i_index - 1].kind;
506 gfc_numeric_storage_size = gfc_integer_kinds[i_index - 1].bit_size;
509 /* Choose the default real kind. Again, we choose 4 when possible. */
510 if (gfc_option.flag_default_real)
513 fatal_error ("real kind=8 not available for -fdefault-real-8 option");
514 gfc_default_real_kind = 8;
517 gfc_default_real_kind = 4;
519 gfc_default_real_kind = gfc_real_kinds[0].kind;
521 /* Choose the default double kind. If -fdefault-real and -fdefault-double
522 are specified, we use kind=8, if it's available. If -fdefault-real is
523 specified without -fdefault-double, we use kind=16, if it's available.
524 Otherwise we do not change anything. */
525 if (gfc_option.flag_default_double && !gfc_option.flag_default_real)
526 fatal_error ("Use of -fdefault-double-8 requires -fdefault-real-8");
528 if (gfc_option.flag_default_real && gfc_option.flag_default_double && saw_r8)
529 gfc_default_double_kind = 8;
530 else if (gfc_option.flag_default_real && saw_r16)
531 gfc_default_double_kind = 16;
532 else if (saw_r4 && saw_r8)
533 gfc_default_double_kind = 8;
536 /* F95 14.6.3.1: A nonpointer scalar object of type double precision
537 real ... occupies two contiguous numeric storage units.
539 Therefore we must be supplied a kind twice as large as we chose
540 for single precision. There are loopholes, in that double
541 precision must *occupy* two storage units, though it doesn't have
542 to *use* two storage units. Which means that you can make this
543 kind artificially wide by padding it. But at present there are
544 no GCC targets for which a two-word type does not exist, so we
545 just let gfc_validate_kind abort and tell us if something breaks. */
547 gfc_default_double_kind
548 = gfc_validate_kind (BT_REAL, gfc_default_real_kind * 2, false);
551 /* The default logical kind is constrained to be the same as the
552 default integer kind. Similarly with complex and real. */
553 gfc_default_logical_kind = gfc_default_integer_kind;
554 gfc_default_complex_kind = gfc_default_real_kind;
556 /* We only have two character kinds: ASCII and UCS-4.
557 ASCII corresponds to a 8-bit integer type, if one is available.
558 UCS-4 corresponds to a 32-bit integer type, if one is available. */
560 if ((kind = get_int_kind_from_width (8)) > 0)
562 gfc_character_kinds[i_index].kind = kind;
563 gfc_character_kinds[i_index].bit_size = 8;
564 gfc_character_kinds[i_index].name = "ascii";
567 if ((kind = get_int_kind_from_width (32)) > 0)
569 gfc_character_kinds[i_index].kind = kind;
570 gfc_character_kinds[i_index].bit_size = 32;
571 gfc_character_kinds[i_index].name = "iso_10646";
575 /* Choose the smallest integer kind for our default character. */
576 gfc_default_character_kind = gfc_character_kinds[0].kind;
577 gfc_character_storage_size = gfc_default_character_kind * 8;
579 /* Choose the integer kind the same size as "void*" for our index kind. */
580 gfc_index_integer_kind = POINTER_SIZE / 8;
581 /* Pick a kind the same size as the C "int" type. */
582 gfc_c_int_kind = INT_TYPE_SIZE / 8;
584 /* Choose atomic kinds to match C's int. */
585 gfc_atomic_int_kind = gfc_c_int_kind;
586 gfc_atomic_logical_kind = gfc_c_int_kind;
588 /* initialize the C interoperable kinds */
589 init_c_interop_kinds();
592 /* Make sure that a valid kind is present. Returns an index into the
593 associated kinds array, -1 if the kind is not present. */
596 validate_integer (int kind)
600 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
601 if (gfc_integer_kinds[i].kind == kind)
608 validate_real (int kind)
612 for (i = 0; gfc_real_kinds[i].kind != 0; i++)
613 if (gfc_real_kinds[i].kind == kind)
620 validate_logical (int kind)
624 for (i = 0; gfc_logical_kinds[i].kind; i++)
625 if (gfc_logical_kinds[i].kind == kind)
632 validate_character (int kind)
636 for (i = 0; gfc_character_kinds[i].kind; i++)
637 if (gfc_character_kinds[i].kind == kind)
643 /* Validate a kind given a basic type. The return value is the same
644 for the child functions, with -1 indicating nonexistence of the
645 type. If MAY_FAIL is false, then -1 is never returned, and we ICE. */
648 gfc_validate_kind (bt type, int kind, bool may_fail)
654 case BT_REAL: /* Fall through */
656 rc = validate_real (kind);
659 rc = validate_integer (kind);
662 rc = validate_logical (kind);
665 rc = validate_character (kind);
669 gfc_internal_error ("gfc_validate_kind(): Got bad type");
672 if (rc < 0 && !may_fail)
673 gfc_internal_error ("gfc_validate_kind(): Got bad kind");
679 /* Four subroutines of gfc_init_types. Create type nodes for the given kind.
680 Reuse common type nodes where possible. Recognize if the kind matches up
681 with a C type. This will be used later in determining which routines may
682 be scarfed from libm. */
685 gfc_build_int_type (gfc_integer_info *info)
687 int mode_precision = info->bit_size;
689 if (mode_precision == CHAR_TYPE_SIZE)
691 if (mode_precision == SHORT_TYPE_SIZE)
693 if (mode_precision == INT_TYPE_SIZE)
695 if (mode_precision == LONG_TYPE_SIZE)
697 if (mode_precision == LONG_LONG_TYPE_SIZE)
698 info->c_long_long = 1;
700 if (TYPE_PRECISION (intQI_type_node) == mode_precision)
701 return intQI_type_node;
702 if (TYPE_PRECISION (intHI_type_node) == mode_precision)
703 return intHI_type_node;
704 if (TYPE_PRECISION (intSI_type_node) == mode_precision)
705 return intSI_type_node;
706 if (TYPE_PRECISION (intDI_type_node) == mode_precision)
707 return intDI_type_node;
708 if (TYPE_PRECISION (intTI_type_node) == mode_precision)
709 return intTI_type_node;
711 return make_signed_type (mode_precision);
715 gfc_build_uint_type (int size)
717 if (size == CHAR_TYPE_SIZE)
718 return unsigned_char_type_node;
719 if (size == SHORT_TYPE_SIZE)
720 return short_unsigned_type_node;
721 if (size == INT_TYPE_SIZE)
722 return unsigned_type_node;
723 if (size == LONG_TYPE_SIZE)
724 return long_unsigned_type_node;
725 if (size == LONG_LONG_TYPE_SIZE)
726 return long_long_unsigned_type_node;
728 return make_unsigned_type (size);
733 gfc_build_real_type (gfc_real_info *info)
735 int mode_precision = info->mode_precision;
738 if (mode_precision == FLOAT_TYPE_SIZE)
740 if (mode_precision == DOUBLE_TYPE_SIZE)
742 if (mode_precision == LONG_DOUBLE_TYPE_SIZE)
743 info->c_long_double = 1;
744 if (mode_precision != LONG_DOUBLE_TYPE_SIZE && mode_precision == 128)
746 info->c_float128 = 1;
747 gfc_real16_is_float128 = true;
750 if (TYPE_PRECISION (float_type_node) == mode_precision)
751 return float_type_node;
752 if (TYPE_PRECISION (double_type_node) == mode_precision)
753 return double_type_node;
754 if (TYPE_PRECISION (long_double_type_node) == mode_precision)
755 return long_double_type_node;
757 new_type = make_node (REAL_TYPE);
758 TYPE_PRECISION (new_type) = mode_precision;
759 layout_type (new_type);
764 gfc_build_complex_type (tree scalar_type)
768 if (scalar_type == NULL)
770 if (scalar_type == float_type_node)
771 return complex_float_type_node;
772 if (scalar_type == double_type_node)
773 return complex_double_type_node;
774 if (scalar_type == long_double_type_node)
775 return complex_long_double_type_node;
777 new_type = make_node (COMPLEX_TYPE);
778 TREE_TYPE (new_type) = scalar_type;
779 layout_type (new_type);
784 gfc_build_logical_type (gfc_logical_info *info)
786 int bit_size = info->bit_size;
789 if (bit_size == BOOL_TYPE_SIZE)
792 return boolean_type_node;
795 new_type = make_unsigned_type (bit_size);
796 TREE_SET_CODE (new_type, BOOLEAN_TYPE);
797 TYPE_MAX_VALUE (new_type) = build_int_cst (new_type, 1);
798 TYPE_PRECISION (new_type) = 1;
804 /* Create the backend type nodes. We map them to their
805 equivalent C type, at least for now. We also give
806 names to the types here, and we push them in the
807 global binding level context.*/
810 gfc_init_types (void)
816 unsigned HOST_WIDE_INT hi;
817 unsigned HOST_WIDE_INT lo;
819 /* Create and name the types. */
820 #define PUSH_TYPE(name, node) \
821 pushdecl (build_decl (input_location, \
822 TYPE_DECL, get_identifier (name), node))
824 for (index = 0; gfc_integer_kinds[index].kind != 0; ++index)
826 type = gfc_build_int_type (&gfc_integer_kinds[index]);
827 /* Ensure integer(kind=1) doesn't have TYPE_STRING_FLAG set. */
828 if (TYPE_STRING_FLAG (type))
829 type = make_signed_type (gfc_integer_kinds[index].bit_size);
830 gfc_integer_types[index] = type;
831 snprintf (name_buf, sizeof(name_buf), "integer(kind=%d)",
832 gfc_integer_kinds[index].kind);
833 PUSH_TYPE (name_buf, type);
836 for (index = 0; gfc_logical_kinds[index].kind != 0; ++index)
838 type = gfc_build_logical_type (&gfc_logical_kinds[index]);
839 gfc_logical_types[index] = type;
840 snprintf (name_buf, sizeof(name_buf), "logical(kind=%d)",
841 gfc_logical_kinds[index].kind);
842 PUSH_TYPE (name_buf, type);
845 for (index = 0; gfc_real_kinds[index].kind != 0; index++)
847 type = gfc_build_real_type (&gfc_real_kinds[index]);
848 gfc_real_types[index] = type;
849 snprintf (name_buf, sizeof(name_buf), "real(kind=%d)",
850 gfc_real_kinds[index].kind);
851 PUSH_TYPE (name_buf, type);
853 if (gfc_real_kinds[index].c_float128)
854 float128_type_node = type;
856 type = gfc_build_complex_type (type);
857 gfc_complex_types[index] = type;
858 snprintf (name_buf, sizeof(name_buf), "complex(kind=%d)",
859 gfc_real_kinds[index].kind);
860 PUSH_TYPE (name_buf, type);
862 if (gfc_real_kinds[index].c_float128)
863 complex_float128_type_node = type;
866 for (index = 0; gfc_character_kinds[index].kind != 0; ++index)
868 type = gfc_build_uint_type (gfc_character_kinds[index].bit_size);
869 type = build_qualified_type (type, TYPE_UNQUALIFIED);
870 snprintf (name_buf, sizeof(name_buf), "character(kind=%d)",
871 gfc_character_kinds[index].kind);
872 PUSH_TYPE (name_buf, type);
873 gfc_character_types[index] = type;
874 gfc_pcharacter_types[index] = build_pointer_type (type);
876 gfc_character1_type_node = gfc_character_types[0];
878 PUSH_TYPE ("byte", unsigned_char_type_node);
879 PUSH_TYPE ("void", void_type_node);
881 /* DBX debugging output gets upset if these aren't set. */
882 if (!TYPE_NAME (integer_type_node))
883 PUSH_TYPE ("c_integer", integer_type_node);
884 if (!TYPE_NAME (char_type_node))
885 PUSH_TYPE ("c_char", char_type_node);
889 pvoid_type_node = build_pointer_type (void_type_node);
890 prvoid_type_node = build_qualified_type (pvoid_type_node, TYPE_QUAL_RESTRICT);
891 ppvoid_type_node = build_pointer_type (pvoid_type_node);
892 pchar_type_node = build_pointer_type (gfc_character1_type_node);
894 = build_pointer_type (build_function_type_list (void_type_node, NULL_TREE));
896 gfc_array_index_type = gfc_get_int_type (gfc_index_integer_kind);
897 /* We cannot use gfc_index_zero_node in definition of gfc_array_range_type,
898 since this function is called before gfc_init_constants. */
900 = build_range_type (gfc_array_index_type,
901 build_int_cst (gfc_array_index_type, 0),
904 /* The maximum array element size that can be handled is determined
905 by the number of bits available to store this field in the array
908 n = TYPE_PRECISION (gfc_array_index_type) - GFC_DTYPE_SIZE_SHIFT;
909 lo = ~ (unsigned HOST_WIDE_INT) 0;
910 if (n > HOST_BITS_PER_WIDE_INT)
911 hi = lo >> (2*HOST_BITS_PER_WIDE_INT - n);
913 hi = 0, lo >>= HOST_BITS_PER_WIDE_INT - n;
914 gfc_max_array_element_size
915 = build_int_cst_wide (long_unsigned_type_node, lo, hi);
917 boolean_type_node = gfc_get_logical_type (gfc_default_logical_kind);
918 boolean_true_node = build_int_cst (boolean_type_node, 1);
919 boolean_false_node = build_int_cst (boolean_type_node, 0);
921 /* ??? Shouldn't this be based on gfc_index_integer_kind or so? */
922 gfc_charlen_int_kind = 4;
923 gfc_charlen_type_node = gfc_get_int_type (gfc_charlen_int_kind);
926 /* Get the type node for the given type and kind. */
929 gfc_get_int_type (int kind)
931 int index = gfc_validate_kind (BT_INTEGER, kind, true);
932 return index < 0 ? 0 : gfc_integer_types[index];
936 gfc_get_real_type (int kind)
938 int index = gfc_validate_kind (BT_REAL, kind, true);
939 return index < 0 ? 0 : gfc_real_types[index];
943 gfc_get_complex_type (int kind)
945 int index = gfc_validate_kind (BT_COMPLEX, kind, true);
946 return index < 0 ? 0 : gfc_complex_types[index];
950 gfc_get_logical_type (int kind)
952 int index = gfc_validate_kind (BT_LOGICAL, kind, true);
953 return index < 0 ? 0 : gfc_logical_types[index];
957 gfc_get_char_type (int kind)
959 int index = gfc_validate_kind (BT_CHARACTER, kind, true);
960 return index < 0 ? 0 : gfc_character_types[index];
964 gfc_get_pchar_type (int kind)
966 int index = gfc_validate_kind (BT_CHARACTER, kind, true);
967 return index < 0 ? 0 : gfc_pcharacter_types[index];
971 /* Create a character type with the given kind and length. */
974 gfc_get_character_type_len_for_eltype (tree eltype, tree len)
978 bounds = build_range_type (gfc_charlen_type_node, gfc_index_one_node, len);
979 type = build_array_type (eltype, bounds);
980 TYPE_STRING_FLAG (type) = 1;
986 gfc_get_character_type_len (int kind, tree len)
988 gfc_validate_kind (BT_CHARACTER, kind, false);
989 return gfc_get_character_type_len_for_eltype (gfc_get_char_type (kind), len);
993 /* Get a type node for a character kind. */
996 gfc_get_character_type (int kind, gfc_charlen * cl)
1000 len = (cl == NULL) ? NULL_TREE : cl->backend_decl;
1002 return gfc_get_character_type_len (kind, len);
1005 /* Covert a basic type. This will be an array for character types. */
1008 gfc_typenode_for_spec (gfc_typespec * spec)
1018 /* We use INTEGER(c_intptr_t) for C_PTR and C_FUNPTR once the symbol
1019 has been resolved. This is done so we can convert C_PTR and
1020 C_FUNPTR to simple variables that get translated to (void *). */
1021 if (spec->f90_type == BT_VOID)
1024 && spec->u.derived->intmod_sym_id == ISOCBINDING_PTR)
1025 basetype = ptr_type_node;
1027 basetype = pfunc_type_node;
1030 basetype = gfc_get_int_type (spec->kind);
1034 basetype = gfc_get_real_type (spec->kind);
1038 basetype = gfc_get_complex_type (spec->kind);
1042 basetype = gfc_get_logical_type (spec->kind);
1048 basetype = gfc_get_character_type (spec->kind, NULL);
1051 basetype = gfc_get_character_type (spec->kind, spec->u.cl);
1056 basetype = gfc_get_derived_type (spec->u.derived);
1058 /* If we're dealing with either C_PTR or C_FUNPTR, we modified the
1059 type and kind to fit a (void *) and the basetype returned was a
1060 ptr_type_node. We need to pass up this new information to the
1061 symbol that was declared of type C_PTR or C_FUNPTR. */
1062 if (spec->u.derived->attr.is_iso_c)
1064 spec->type = spec->u.derived->ts.type;
1065 spec->kind = spec->u.derived->ts.kind;
1066 spec->f90_type = spec->u.derived->ts.f90_type;
1070 /* This is for the second arg to c_f_pointer and c_f_procpointer
1071 of the iso_c_binding module, to accept any ptr type. */
1072 basetype = ptr_type_node;
1073 if (spec->f90_type == BT_VOID)
1076 && spec->u.derived->intmod_sym_id == ISOCBINDING_PTR)
1077 basetype = ptr_type_node;
1079 basetype = pfunc_type_node;
1088 /* Build an INT_CST for constant expressions, otherwise return NULL_TREE. */
1091 gfc_conv_array_bound (gfc_expr * expr)
1093 /* If expr is an integer constant, return that. */
1094 if (expr != NULL && expr->expr_type == EXPR_CONSTANT)
1095 return gfc_conv_mpz_to_tree (expr->value.integer, gfc_index_integer_kind);
1097 /* Otherwise return NULL. */
1102 gfc_get_element_type (tree type)
1106 if (GFC_ARRAY_TYPE_P (type))
1108 if (TREE_CODE (type) == POINTER_TYPE)
1109 type = TREE_TYPE (type);
1110 if (GFC_TYPE_ARRAY_RANK (type) == 0)
1112 gcc_assert (GFC_TYPE_ARRAY_CORANK (type) > 0);
1117 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1118 element = TREE_TYPE (type);
1123 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
1124 element = GFC_TYPE_ARRAY_DATAPTR_TYPE (type);
1126 gcc_assert (TREE_CODE (element) == POINTER_TYPE);
1127 element = TREE_TYPE (element);
1129 /* For arrays, which are not scalar coarrays. */
1130 if (TREE_CODE (element) == ARRAY_TYPE)
1131 element = TREE_TYPE (element);
1137 /* Build an array. This function is called from gfc_sym_type().
1138 Actually returns array descriptor type.
1140 Format of array descriptors is as follows:
1142 struct gfc_array_descriptor
1147 struct descriptor_dimension dimension[N_DIM];
1150 struct descriptor_dimension
1157 Translation code should use gfc_conv_descriptor_* rather than
1158 accessing the descriptor directly. Any changes to the array
1159 descriptor type will require changes in gfc_conv_descriptor_* and
1160 gfc_build_array_initializer.
1162 This is represented internally as a RECORD_TYPE. The index nodes
1163 are gfc_array_index_type and the data node is a pointer to the
1164 data. See below for the handling of character types.
1166 The dtype member is formatted as follows:
1167 rank = dtype & GFC_DTYPE_RANK_MASK // 3 bits
1168 type = (dtype & GFC_DTYPE_TYPE_MASK) >> GFC_DTYPE_TYPE_SHIFT // 3 bits
1169 size = dtype >> GFC_DTYPE_SIZE_SHIFT
1171 I originally used nested ARRAY_TYPE nodes to represent arrays, but
1172 this generated poor code for assumed/deferred size arrays. These
1173 require use of PLACEHOLDER_EXPR/WITH_RECORD_EXPR, which isn't part
1174 of the GENERIC grammar. Also, there is no way to explicitly set
1175 the array stride, so all data must be packed(1). I've tried to
1176 mark all the functions which would require modification with a GCC
1179 The data component points to the first element in the array. The
1180 offset field is the position of the origin of the array (i.e. element
1181 (0, 0 ...)). This may be outside the bounds of the array.
1183 An element is accessed by
1184 data[offset + index0*stride0 + index1*stride1 + index2*stride2]
1185 This gives good performance as the computation does not involve the
1186 bounds of the array. For packed arrays, this is optimized further
1187 by substituting the known strides.
1189 This system has one problem: all array bounds must be within 2^31
1190 elements of the origin (2^63 on 64-bit machines). For example
1191 integer, dimension (80000:90000, 80000:90000, 2) :: array
1192 may not work properly on 32-bit machines because 80000*80000 >
1193 2^31, so the calculation for stride2 would overflow. This may
1194 still work, but I haven't checked, and it relies on the overflow
1195 doing the right thing.
1197 The way to fix this problem is to access elements as follows:
1198 data[(index0-lbound0)*stride0 + (index1-lbound1)*stride1]
1199 Obviously this is much slower. I will make this a compile time
1200 option, something like -fsmall-array-offsets. Mixing code compiled
1201 with and without this switch will work.
1203 (1) This can be worked around by modifying the upper bound of the
1204 previous dimension. This requires extra fields in the descriptor
1205 (both real_ubound and fake_ubound). */
1208 /* Returns true if the array sym does not require a descriptor. */
1211 gfc_is_nodesc_array (gfc_symbol * sym)
1213 gcc_assert (sym->attr.dimension || sym->attr.codimension);
1215 /* We only want local arrays. */
1216 if (sym->attr.pointer || sym->attr.allocatable)
1219 /* We want a descriptor for associate-name arrays that do not have an
1220 explicitely known shape already. */
1221 if (sym->assoc && sym->as->type != AS_EXPLICIT)
1224 if (sym->attr.dummy)
1225 return sym->as->type != AS_ASSUMED_SHAPE;
1227 if (sym->attr.result || sym->attr.function)
1230 gcc_assert (sym->as->type == AS_EXPLICIT || sym->as->cp_was_assumed);
1236 /* Create an array descriptor type. */
1239 gfc_build_array_type (tree type, gfc_array_spec * as,
1240 enum gfc_array_kind akind, bool restricted,
1243 tree lbound[GFC_MAX_DIMENSIONS];
1244 tree ubound[GFC_MAX_DIMENSIONS];
1247 for (n = 0; n < as->rank; n++)
1249 /* Create expressions for the known bounds of the array. */
1250 if (as->type == AS_ASSUMED_SHAPE && as->lower[n] == NULL)
1251 lbound[n] = gfc_index_one_node;
1253 lbound[n] = gfc_conv_array_bound (as->lower[n]);
1254 ubound[n] = gfc_conv_array_bound (as->upper[n]);
1257 for (n = as->rank; n < as->rank + as->corank; n++)
1259 if (as->lower[n] == NULL)
1260 lbound[n] = gfc_index_one_node;
1262 lbound[n] = gfc_conv_array_bound (as->lower[n]);
1264 if (n < as->rank + as->corank - 1)
1265 ubound[n] = gfc_conv_array_bound (as->upper[n]);
1268 if (as->type == AS_ASSUMED_SHAPE)
1269 akind = contiguous ? GFC_ARRAY_ASSUMED_SHAPE_CONT
1270 : GFC_ARRAY_ASSUMED_SHAPE;
1271 return gfc_get_array_type_bounds (type, as->rank, as->corank, lbound,
1272 ubound, 0, akind, restricted);
1275 /* Returns the struct descriptor_dimension type. */
1278 gfc_get_desc_dim_type (void)
1281 tree decl, *chain = NULL;
1283 if (gfc_desc_dim_type)
1284 return gfc_desc_dim_type;
1286 /* Build the type node. */
1287 type = make_node (RECORD_TYPE);
1289 TYPE_NAME (type) = get_identifier ("descriptor_dimension");
1290 TYPE_PACKED (type) = 1;
1292 /* Consists of the stride, lbound and ubound members. */
1293 decl = gfc_add_field_to_struct_1 (type,
1294 get_identifier ("stride"),
1295 gfc_array_index_type, &chain);
1296 TREE_NO_WARNING (decl) = 1;
1298 decl = gfc_add_field_to_struct_1 (type,
1299 get_identifier ("lbound"),
1300 gfc_array_index_type, &chain);
1301 TREE_NO_WARNING (decl) = 1;
1303 decl = gfc_add_field_to_struct_1 (type,
1304 get_identifier ("ubound"),
1305 gfc_array_index_type, &chain);
1306 TREE_NO_WARNING (decl) = 1;
1308 /* Finish off the type. */
1309 gfc_finish_type (type);
1310 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type)) = 1;
1312 gfc_desc_dim_type = type;
1317 /* Return the DTYPE for an array. This describes the type and type parameters
1319 /* TODO: Only call this when the value is actually used, and make all the
1320 unknown cases abort. */
1323 gfc_get_dtype (tree type)
1333 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type) || GFC_ARRAY_TYPE_P (type));
1335 if (GFC_TYPE_ARRAY_DTYPE (type))
1336 return GFC_TYPE_ARRAY_DTYPE (type);
1338 rank = GFC_TYPE_ARRAY_RANK (type);
1339 etype = gfc_get_element_type (type);
1341 switch (TREE_CODE (etype))
1359 /* We will never have arrays of arrays. */
1369 /* TODO: Don't do dtype for temporary descriptorless arrays. */
1370 /* We can strange array types for temporary arrays. */
1371 return gfc_index_zero_node;
1374 gcc_assert (rank <= GFC_DTYPE_RANK_MASK);
1375 size = TYPE_SIZE_UNIT (etype);
1377 i = rank | (n << GFC_DTYPE_TYPE_SHIFT);
1378 if (size && INTEGER_CST_P (size))
1380 if (tree_int_cst_lt (gfc_max_array_element_size, size))
1381 internal_error ("Array element size too big");
1383 i += TREE_INT_CST_LOW (size) << GFC_DTYPE_SIZE_SHIFT;
1385 dtype = build_int_cst (gfc_array_index_type, i);
1387 if (size && !INTEGER_CST_P (size))
1389 tmp = build_int_cst (gfc_array_index_type, GFC_DTYPE_SIZE_SHIFT);
1390 tmp = fold_build2_loc (input_location, LSHIFT_EXPR,
1391 gfc_array_index_type,
1392 fold_convert (gfc_array_index_type, size), tmp);
1393 dtype = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
1396 /* If we don't know the size we leave it as zero. This should never happen
1397 for anything that is actually used. */
1398 /* TODO: Check this is actually true, particularly when repacking
1399 assumed size parameters. */
1401 GFC_TYPE_ARRAY_DTYPE (type) = dtype;
1406 /* Build an array type for use without a descriptor, packed according
1407 to the value of PACKED. */
1410 gfc_get_nodesc_array_type (tree etype, gfc_array_spec * as, gfc_packed packed,
1424 mpz_init_set_ui (offset, 0);
1425 mpz_init_set_ui (stride, 1);
1428 /* We don't use build_array_type because this does not include include
1429 lang-specific information (i.e. the bounds of the array) when checking
1432 type = make_node (ARRAY_TYPE);
1434 type = build_variant_type_copy (etype);
1436 GFC_ARRAY_TYPE_P (type) = 1;
1437 TYPE_LANG_SPECIFIC (type)
1438 = ggc_alloc_cleared_lang_type (sizeof (struct lang_type));
1440 known_stride = (packed != PACKED_NO);
1442 for (n = 0; n < as->rank; n++)
1444 /* Fill in the stride and bound components of the type. */
1446 tmp = gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
1449 GFC_TYPE_ARRAY_STRIDE (type, n) = tmp;
1451 expr = as->lower[n];
1452 if (expr->expr_type == EXPR_CONSTANT)
1454 tmp = gfc_conv_mpz_to_tree (expr->value.integer,
1455 gfc_index_integer_kind);
1462 GFC_TYPE_ARRAY_LBOUND (type, n) = tmp;
1466 /* Calculate the offset. */
1467 mpz_mul (delta, stride, as->lower[n]->value.integer);
1468 mpz_sub (offset, offset, delta);
1473 expr = as->upper[n];
1474 if (expr && expr->expr_type == EXPR_CONSTANT)
1476 tmp = gfc_conv_mpz_to_tree (expr->value.integer,
1477 gfc_index_integer_kind);
1484 GFC_TYPE_ARRAY_UBOUND (type, n) = tmp;
1488 /* Calculate the stride. */
1489 mpz_sub (delta, as->upper[n]->value.integer,
1490 as->lower[n]->value.integer);
1491 mpz_add_ui (delta, delta, 1);
1492 mpz_mul (stride, stride, delta);
1495 /* Only the first stride is known for partial packed arrays. */
1496 if (packed == PACKED_NO || packed == PACKED_PARTIAL)
1499 for (n = as->rank; n < as->rank + as->corank; n++)
1501 expr = as->lower[n];
1502 if (expr->expr_type == EXPR_CONSTANT)
1503 tmp = gfc_conv_mpz_to_tree (expr->value.integer,
1504 gfc_index_integer_kind);
1507 GFC_TYPE_ARRAY_LBOUND (type, n) = tmp;
1509 expr = as->upper[n];
1510 if (expr && expr->expr_type == EXPR_CONSTANT)
1511 tmp = gfc_conv_mpz_to_tree (expr->value.integer,
1512 gfc_index_integer_kind);
1515 if (n < as->rank + as->corank - 1)
1516 GFC_TYPE_ARRAY_UBOUND (type, n) = tmp;
1521 GFC_TYPE_ARRAY_OFFSET (type) =
1522 gfc_conv_mpz_to_tree (offset, gfc_index_integer_kind);
1525 GFC_TYPE_ARRAY_OFFSET (type) = NULL_TREE;
1529 GFC_TYPE_ARRAY_SIZE (type) =
1530 gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
1533 GFC_TYPE_ARRAY_SIZE (type) = NULL_TREE;
1535 GFC_TYPE_ARRAY_RANK (type) = as->rank;
1536 GFC_TYPE_ARRAY_CORANK (type) = as->corank;
1537 GFC_TYPE_ARRAY_DTYPE (type) = NULL_TREE;
1538 range = build_range_type (gfc_array_index_type, gfc_index_zero_node,
1540 /* TODO: use main type if it is unbounded. */
1541 GFC_TYPE_ARRAY_DATAPTR_TYPE (type) =
1542 build_pointer_type (build_array_type (etype, range));
1544 GFC_TYPE_ARRAY_DATAPTR_TYPE (type) =
1545 build_qualified_type (GFC_TYPE_ARRAY_DATAPTR_TYPE (type),
1546 TYPE_QUAL_RESTRICT);
1550 if (packed != PACKED_STATIC || gfc_option.coarray == GFC_FCOARRAY_LIB)
1552 type = build_pointer_type (type);
1555 type = build_qualified_type (type, TYPE_QUAL_RESTRICT);
1557 GFC_ARRAY_TYPE_P (type) = 1;
1558 TYPE_LANG_SPECIFIC (type) = TYPE_LANG_SPECIFIC (TREE_TYPE (type));
1566 mpz_sub_ui (stride, stride, 1);
1567 range = gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
1572 range = build_range_type (gfc_array_index_type, gfc_index_zero_node, range);
1573 TYPE_DOMAIN (type) = range;
1575 build_pointer_type (etype);
1576 TREE_TYPE (type) = etype;
1584 /* Represent packed arrays as multi-dimensional if they have rank >
1585 1 and with proper bounds, instead of flat arrays. This makes for
1586 better debug info. */
1589 tree gtype = etype, rtype, type_decl;
1591 for (n = as->rank - 1; n >= 0; n--)
1593 rtype = build_range_type (gfc_array_index_type,
1594 GFC_TYPE_ARRAY_LBOUND (type, n),
1595 GFC_TYPE_ARRAY_UBOUND (type, n));
1596 gtype = build_array_type (gtype, rtype);
1598 TYPE_NAME (type) = type_decl = build_decl (input_location,
1599 TYPE_DECL, NULL, gtype);
1600 DECL_ORIGINAL_TYPE (type_decl) = gtype;
1603 if (packed != PACKED_STATIC || !known_stride
1604 || (as->corank && gfc_option.coarray == GFC_FCOARRAY_LIB))
1606 /* For dummy arrays and automatic (heap allocated) arrays we
1607 want a pointer to the array. */
1608 type = build_pointer_type (type);
1610 type = build_qualified_type (type, TYPE_QUAL_RESTRICT);
1611 GFC_ARRAY_TYPE_P (type) = 1;
1612 TYPE_LANG_SPECIFIC (type) = TYPE_LANG_SPECIFIC (TREE_TYPE (type));
1617 /* Return or create the base type for an array descriptor. */
1620 gfc_get_array_descriptor_base (int dimen, int codimen, bool restricted)
1622 tree fat_type, decl, arraytype, *chain = NULL;
1623 char name[16 + 2*GFC_RANK_DIGITS + 1 + 1];
1624 int idx = 2 * (codimen + dimen - 1) + restricted;
1626 gcc_assert (codimen + dimen >= 1 && codimen + dimen <= GFC_MAX_DIMENSIONS);
1628 if (gfc_option.coarray == GFC_FCOARRAY_LIB && codimen)
1630 if (gfc_array_descriptor_base_caf[idx])
1631 return gfc_array_descriptor_base_caf[idx];
1633 else if (gfc_array_descriptor_base[idx])
1634 return gfc_array_descriptor_base[idx];
1636 /* Build the type node. */
1637 fat_type = make_node (RECORD_TYPE);
1639 sprintf (name, "array_descriptor" GFC_RANK_PRINTF_FORMAT, dimen + codimen);
1640 TYPE_NAME (fat_type) = get_identifier (name);
1641 TYPE_NAMELESS (fat_type) = 1;
1643 /* Add the data member as the first element of the descriptor. */
1644 decl = gfc_add_field_to_struct_1 (fat_type,
1645 get_identifier ("data"),
1648 : ptr_type_node), &chain);
1650 /* Add the base component. */
1651 decl = gfc_add_field_to_struct_1 (fat_type,
1652 get_identifier ("offset"),
1653 gfc_array_index_type, &chain);
1654 TREE_NO_WARNING (decl) = 1;
1656 /* Add the dtype component. */
1657 decl = gfc_add_field_to_struct_1 (fat_type,
1658 get_identifier ("dtype"),
1659 gfc_array_index_type, &chain);
1660 TREE_NO_WARNING (decl) = 1;
1662 /* Build the array type for the stride and bound components. */
1664 build_array_type (gfc_get_desc_dim_type (),
1665 build_range_type (gfc_array_index_type,
1666 gfc_index_zero_node,
1667 gfc_rank_cst[codimen + dimen - 1]));
1669 decl = gfc_add_field_to_struct_1 (fat_type,
1670 get_identifier ("dim"),
1672 TREE_NO_WARNING (decl) = 1;
1674 if (gfc_option.coarray == GFC_FCOARRAY_LIB && codimen)
1676 decl = gfc_add_field_to_struct_1 (fat_type,
1677 get_identifier ("token"),
1678 prvoid_type_node, &chain);
1679 TREE_NO_WARNING (decl) = 1;
1682 /* Finish off the type. */
1683 gfc_finish_type (fat_type);
1684 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (fat_type)) = 1;
1686 if (gfc_option.coarray == GFC_FCOARRAY_LIB && codimen)
1687 gfc_array_descriptor_base_caf[idx] = fat_type;
1689 gfc_array_descriptor_base[idx] = fat_type;
1694 /* Build an array (descriptor) type with given bounds. */
1697 gfc_get_array_type_bounds (tree etype, int dimen, int codimen, tree * lbound,
1698 tree * ubound, int packed,
1699 enum gfc_array_kind akind, bool restricted)
1701 char name[8 + 2*GFC_RANK_DIGITS + 1 + GFC_MAX_SYMBOL_LEN];
1702 tree fat_type, base_type, arraytype, lower, upper, stride, tmp, rtype;
1703 const char *type_name;
1706 base_type = gfc_get_array_descriptor_base (dimen, codimen, restricted);
1707 fat_type = build_distinct_type_copy (base_type);
1708 /* Make sure that nontarget and target array type have the same canonical
1709 type (and same stub decl for debug info). */
1710 base_type = gfc_get_array_descriptor_base (dimen, codimen, false);
1711 TYPE_CANONICAL (fat_type) = base_type;
1712 TYPE_STUB_DECL (fat_type) = TYPE_STUB_DECL (base_type);
1714 tmp = TYPE_NAME (etype);
1715 if (tmp && TREE_CODE (tmp) == TYPE_DECL)
1716 tmp = DECL_NAME (tmp);
1718 type_name = IDENTIFIER_POINTER (tmp);
1720 type_name = "unknown";
1721 sprintf (name, "array" GFC_RANK_PRINTF_FORMAT "_%.*s", dimen + codimen,
1722 GFC_MAX_SYMBOL_LEN, type_name);
1723 TYPE_NAME (fat_type) = get_identifier (name);
1724 TYPE_NAMELESS (fat_type) = 1;
1726 GFC_DESCRIPTOR_TYPE_P (fat_type) = 1;
1727 TYPE_LANG_SPECIFIC (fat_type)
1728 = ggc_alloc_cleared_lang_type (sizeof (struct lang_type));
1730 GFC_TYPE_ARRAY_RANK (fat_type) = dimen;
1731 GFC_TYPE_ARRAY_CORANK (fat_type) = codimen;
1732 GFC_TYPE_ARRAY_DTYPE (fat_type) = NULL_TREE;
1733 GFC_TYPE_ARRAY_AKIND (fat_type) = akind;
1735 /* Build an array descriptor record type. */
1737 stride = gfc_index_one_node;
1740 for (n = 0; n < dimen + codimen; n++)
1743 GFC_TYPE_ARRAY_STRIDE (fat_type, n) = stride;
1750 if (lower != NULL_TREE)
1752 if (INTEGER_CST_P (lower))
1753 GFC_TYPE_ARRAY_LBOUND (fat_type, n) = lower;
1758 if (codimen && n == dimen + codimen - 1)
1762 if (upper != NULL_TREE)
1764 if (INTEGER_CST_P (upper))
1765 GFC_TYPE_ARRAY_UBOUND (fat_type, n) = upper;
1773 if (upper != NULL_TREE && lower != NULL_TREE && stride != NULL_TREE)
1775 tmp = fold_build2_loc (input_location, MINUS_EXPR,
1776 gfc_array_index_type, upper, lower);
1777 tmp = fold_build2_loc (input_location, PLUS_EXPR,
1778 gfc_array_index_type, tmp,
1779 gfc_index_one_node);
1780 stride = fold_build2_loc (input_location, MULT_EXPR,
1781 gfc_array_index_type, tmp, stride);
1782 /* Check the folding worked. */
1783 gcc_assert (INTEGER_CST_P (stride));
1788 GFC_TYPE_ARRAY_SIZE (fat_type) = stride;
1790 /* TODO: known offsets for descriptors. */
1791 GFC_TYPE_ARRAY_OFFSET (fat_type) = NULL_TREE;
1795 arraytype = build_pointer_type (etype);
1797 arraytype = build_qualified_type (arraytype, TYPE_QUAL_RESTRICT);
1799 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type) = arraytype;
1803 /* We define data as an array with the correct size if possible.
1804 Much better than doing pointer arithmetic. */
1806 rtype = build_range_type (gfc_array_index_type, gfc_index_zero_node,
1807 int_const_binop (MINUS_EXPR, stride,
1810 rtype = gfc_array_range_type;
1811 arraytype = build_array_type (etype, rtype);
1812 arraytype = build_pointer_type (arraytype);
1814 arraytype = build_qualified_type (arraytype, TYPE_QUAL_RESTRICT);
1815 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type) = arraytype;
1817 /* This will generate the base declarations we need to emit debug
1818 information for this type. FIXME: there must be a better way to
1819 avoid divergence between compilations with and without debug
1822 struct array_descr_info info;
1823 gfc_get_array_descr_info (fat_type, &info);
1824 gfc_get_array_descr_info (build_pointer_type (fat_type), &info);
1830 /* Build a pointer type. This function is called from gfc_sym_type(). */
1833 gfc_build_pointer_type (gfc_symbol * sym, tree type)
1835 /* Array pointer types aren't actually pointers. */
1836 if (sym->attr.dimension)
1839 return build_pointer_type (type);
1842 static tree gfc_nonrestricted_type (tree t);
1843 /* Given two record or union type nodes TO and FROM, ensure
1844 that all fields in FROM have a corresponding field in TO,
1845 their type being nonrestrict variants. This accepts a TO
1846 node that already has a prefix of the fields in FROM. */
1848 mirror_fields (tree to, tree from)
1853 /* Forward to the end of TOs fields. */
1854 fto = TYPE_FIELDS (to);
1855 ffrom = TYPE_FIELDS (from);
1856 chain = &TYPE_FIELDS (to);
1859 gcc_assert (ffrom && DECL_NAME (fto) == DECL_NAME (ffrom));
1860 chain = &DECL_CHAIN (fto);
1861 fto = DECL_CHAIN (fto);
1862 ffrom = DECL_CHAIN (ffrom);
1865 /* Now add all fields remaining in FROM (starting with ffrom). */
1866 for (; ffrom; ffrom = DECL_CHAIN (ffrom))
1868 tree newfield = copy_node (ffrom);
1869 DECL_CONTEXT (newfield) = to;
1870 /* The store to DECL_CHAIN might seem redundant with the
1871 stores to *chain, but not clearing it here would mean
1872 leaving a chain into the old fields. If ever
1873 our called functions would look at them confusion
1875 DECL_CHAIN (newfield) = NULL_TREE;
1877 chain = &DECL_CHAIN (newfield);
1879 if (TREE_CODE (ffrom) == FIELD_DECL)
1881 tree elemtype = gfc_nonrestricted_type (TREE_TYPE (ffrom));
1882 TREE_TYPE (newfield) = elemtype;
1888 /* Given a type T, returns a different type of the same structure,
1889 except that all types it refers to (recursively) are always
1890 non-restrict qualified types. */
1892 gfc_nonrestricted_type (tree t)
1896 /* If the type isn't layed out yet, don't copy it. If something
1897 needs it for real it should wait until the type got finished. */
1901 if (!TYPE_LANG_SPECIFIC (t))
1902 TYPE_LANG_SPECIFIC (t)
1903 = ggc_alloc_cleared_lang_type (sizeof (struct lang_type));
1904 /* If we're dealing with this very node already further up
1905 the call chain (recursion via pointers and struct members)
1906 we haven't yet determined if we really need a new type node.
1907 Assume we don't, return T itself. */
1908 if (TYPE_LANG_SPECIFIC (t)->nonrestricted_type == error_mark_node)
1911 /* If we have calculated this all already, just return it. */
1912 if (TYPE_LANG_SPECIFIC (t)->nonrestricted_type)
1913 return TYPE_LANG_SPECIFIC (t)->nonrestricted_type;
1915 /* Mark this type. */
1916 TYPE_LANG_SPECIFIC (t)->nonrestricted_type = error_mark_node;
1918 switch (TREE_CODE (t))
1924 case REFERENCE_TYPE:
1926 tree totype = gfc_nonrestricted_type (TREE_TYPE (t));
1927 if (totype == TREE_TYPE (t))
1929 else if (TREE_CODE (t) == POINTER_TYPE)
1930 ret = build_pointer_type (totype);
1932 ret = build_reference_type (totype);
1933 ret = build_qualified_type (ret,
1934 TYPE_QUALS (t) & ~TYPE_QUAL_RESTRICT);
1940 tree elemtype = gfc_nonrestricted_type (TREE_TYPE (t));
1941 if (elemtype == TREE_TYPE (t))
1945 ret = build_variant_type_copy (t);
1946 TREE_TYPE (ret) = elemtype;
1947 if (TYPE_LANG_SPECIFIC (t)
1948 && GFC_TYPE_ARRAY_DATAPTR_TYPE (t))
1950 tree dataptr_type = GFC_TYPE_ARRAY_DATAPTR_TYPE (t);
1951 dataptr_type = gfc_nonrestricted_type (dataptr_type);
1952 if (dataptr_type != GFC_TYPE_ARRAY_DATAPTR_TYPE (t))
1954 TYPE_LANG_SPECIFIC (ret)
1955 = ggc_alloc_cleared_lang_type (sizeof (struct
1957 *TYPE_LANG_SPECIFIC (ret) = *TYPE_LANG_SPECIFIC (t);
1958 GFC_TYPE_ARRAY_DATAPTR_TYPE (ret) = dataptr_type;
1967 case QUAL_UNION_TYPE:
1970 /* First determine if we need a new type at all.
1971 Careful, the two calls to gfc_nonrestricted_type per field
1972 might return different values. That happens exactly when
1973 one of the fields reaches back to this very record type
1974 (via pointers). The first calls will assume that we don't
1975 need to copy T (see the error_mark_node marking). If there
1976 are any reasons for copying T apart from having to copy T,
1977 we'll indeed copy it, and the second calls to
1978 gfc_nonrestricted_type will use that new node if they
1980 for (field = TYPE_FIELDS (t); field; field = DECL_CHAIN (field))
1981 if (TREE_CODE (field) == FIELD_DECL)
1983 tree elemtype = gfc_nonrestricted_type (TREE_TYPE (field));
1984 if (elemtype != TREE_TYPE (field))
1989 ret = build_variant_type_copy (t);
1990 TYPE_FIELDS (ret) = NULL_TREE;
1992 /* Here we make sure that as soon as we know we have to copy
1993 T, that also fields reaching back to us will use the new
1994 copy. It's okay if that copy still contains the old fields,
1995 we won't look at them. */
1996 TYPE_LANG_SPECIFIC (t)->nonrestricted_type = ret;
1997 mirror_fields (ret, t);
2002 TYPE_LANG_SPECIFIC (t)->nonrestricted_type = ret;
2007 /* Return the type for a symbol. Special handling is required for character
2008 types to get the correct level of indirection.
2009 For functions return the return type.
2010 For subroutines return void_type_node.
2011 Calling this multiple times for the same symbol should be avoided,
2012 especially for character and array types. */
2015 gfc_sym_type (gfc_symbol * sym)
2021 /* Procedure Pointers inside COMMON blocks. */
2022 if (sym->attr.proc_pointer && sym->attr.in_common)
2024 /* Unset proc_pointer as gfc_get_function_type calls gfc_sym_type. */
2025 sym->attr.proc_pointer = 0;
2026 type = build_pointer_type (gfc_get_function_type (sym));
2027 sym->attr.proc_pointer = 1;
2031 if (sym->attr.flavor == FL_PROCEDURE && !sym->attr.function)
2032 return void_type_node;
2034 /* In the case of a function the fake result variable may have a
2035 type different from the function type, so don't return early in
2037 if (sym->backend_decl && !sym->attr.function)
2038 return TREE_TYPE (sym->backend_decl);
2040 if (sym->ts.type == BT_CHARACTER
2041 && ((sym->attr.function && sym->attr.is_bind_c)
2042 || (sym->attr.result
2043 && sym->ns->proc_name
2044 && sym->ns->proc_name->attr.is_bind_c)))
2045 type = gfc_character1_type_node;
2047 type = gfc_typenode_for_spec (&sym->ts);
2049 if (sym->attr.dummy && !sym->attr.function && !sym->attr.value)
2054 restricted = !sym->attr.target && !sym->attr.pointer
2055 && !sym->attr.proc_pointer && !sym->attr.cray_pointee;
2057 type = gfc_nonrestricted_type (type);
2059 if (sym->attr.dimension || sym->attr.codimension)
2061 if (gfc_is_nodesc_array (sym))
2063 /* If this is a character argument of unknown length, just use the
2065 if (sym->ts.type != BT_CHARACTER
2066 || !(sym->attr.dummy || sym->attr.function)
2067 || sym->ts.u.cl->backend_decl)
2069 type = gfc_get_nodesc_array_type (type, sym->as,
2076 if (sym->attr.cray_pointee)
2077 GFC_POINTER_TYPE_P (type) = 1;
2081 enum gfc_array_kind akind = GFC_ARRAY_UNKNOWN;
2082 if (sym->attr.pointer)
2083 akind = sym->attr.contiguous ? GFC_ARRAY_POINTER_CONT
2084 : GFC_ARRAY_POINTER;
2085 else if (sym->attr.allocatable)
2086 akind = GFC_ARRAY_ALLOCATABLE;
2087 type = gfc_build_array_type (type, sym->as, akind, restricted,
2088 sym->attr.contiguous);
2093 if (sym->attr.allocatable || sym->attr.pointer
2094 || gfc_is_associate_pointer (sym))
2095 type = gfc_build_pointer_type (sym, type);
2096 if (sym->attr.pointer || sym->attr.cray_pointee)
2097 GFC_POINTER_TYPE_P (type) = 1;
2100 /* We currently pass all parameters by reference.
2101 See f95_get_function_decl. For dummy function parameters return the
2105 /* We must use pointer types for potentially absent variables. The
2106 optimizers assume a reference type argument is never NULL. */
2107 if (sym->attr.optional || sym->ns->proc_name->attr.entry_master)
2108 type = build_pointer_type (type);
2111 type = build_reference_type (type);
2113 type = build_qualified_type (type, TYPE_QUAL_RESTRICT);
2120 /* Layout and output debug info for a record type. */
2123 gfc_finish_type (tree type)
2127 decl = build_decl (input_location,
2128 TYPE_DECL, NULL_TREE, type);
2129 TYPE_STUB_DECL (type) = decl;
2131 rest_of_type_compilation (type, 1);
2132 rest_of_decl_compilation (decl, 1, 0);
2135 /* Add a field of given NAME and TYPE to the context of a UNION_TYPE
2136 or RECORD_TYPE pointed to by CONTEXT. The new field is chained
2137 to the end of the field list pointed to by *CHAIN.
2139 Returns a pointer to the new field. */
2142 gfc_add_field_to_struct_1 (tree context, tree name, tree type, tree **chain)
2144 tree decl = build_decl (input_location, FIELD_DECL, name, type);
2146 DECL_CONTEXT (decl) = context;
2147 DECL_CHAIN (decl) = NULL_TREE;
2148 if (TYPE_FIELDS (context) == NULL_TREE)
2149 TYPE_FIELDS (context) = decl;
2154 *chain = &DECL_CHAIN (decl);
2160 /* Like `gfc_add_field_to_struct_1', but adds alignment
2164 gfc_add_field_to_struct (tree context, tree name, tree type, tree **chain)
2166 tree decl = gfc_add_field_to_struct_1 (context, name, type, chain);
2168 DECL_INITIAL (decl) = 0;
2169 DECL_ALIGN (decl) = 0;
2170 DECL_USER_ALIGN (decl) = 0;
2176 /* Copy the backend_decl and component backend_decls if
2177 the two derived type symbols are "equal", as described
2178 in 4.4.2 and resolved by gfc_compare_derived_types. */
2181 gfc_copy_dt_decls_ifequal (gfc_symbol *from, gfc_symbol *to,
2184 gfc_component *to_cm;
2185 gfc_component *from_cm;
2187 if (from->backend_decl == NULL
2188 || !gfc_compare_derived_types (from, to))
2191 to->backend_decl = from->backend_decl;
2193 to_cm = to->components;
2194 from_cm = from->components;
2196 /* Copy the component declarations. If a component is itself
2197 a derived type, we need a copy of its component declarations.
2198 This is done by recursing into gfc_get_derived_type and
2199 ensures that the component's component declarations have
2200 been built. If it is a character, we need the character
2202 for (; to_cm; to_cm = to_cm->next, from_cm = from_cm->next)
2204 to_cm->backend_decl = from_cm->backend_decl;
2205 if (from_cm->ts.type == BT_DERIVED
2206 && (!from_cm->attr.pointer || from_gsym))
2207 gfc_get_derived_type (to_cm->ts.u.derived);
2208 else if (from_cm->ts.type == BT_CLASS
2209 && (!CLASS_DATA (from_cm)->attr.class_pointer || from_gsym))
2210 gfc_get_derived_type (to_cm->ts.u.derived);
2211 else if (from_cm->ts.type == BT_CHARACTER)
2212 to_cm->ts.u.cl->backend_decl = from_cm->ts.u.cl->backend_decl;
2219 /* Build a tree node for a procedure pointer component. */
2222 gfc_get_ppc_type (gfc_component* c)
2226 /* Explicit interface. */
2227 if (c->attr.if_source != IFSRC_UNKNOWN && c->ts.interface)
2228 return build_pointer_type (gfc_get_function_type (c->ts.interface));
2230 /* Implicit interface (only return value may be known). */
2231 if (c->attr.function && !c->attr.dimension && c->ts.type != BT_CHARACTER)
2232 t = gfc_typenode_for_spec (&c->ts);
2236 return build_pointer_type (build_function_type_list (t, NULL_TREE));
2240 /* Build a tree node for a derived type. If there are equal
2241 derived types, with different local names, these are built
2242 at the same time. If an equal derived type has been built
2243 in a parent namespace, this is used. */
2246 gfc_get_derived_type (gfc_symbol * derived)
2248 tree typenode = NULL, field = NULL, field_type = NULL;
2249 tree canonical = NULL_TREE;
2251 bool got_canonical = false;
2256 gcc_assert (derived && derived->attr.flavor == FL_DERIVED);
2258 /* See if it's one of the iso_c_binding derived types. */
2259 if (derived->attr.is_iso_c == 1)
2261 if (derived->backend_decl)
2262 return derived->backend_decl;
2264 if (derived->intmod_sym_id == ISOCBINDING_PTR)
2265 derived->backend_decl = ptr_type_node;
2267 derived->backend_decl = pfunc_type_node;
2269 derived->ts.kind = gfc_index_integer_kind;
2270 derived->ts.type = BT_INTEGER;
2271 /* Set the f90_type to BT_VOID as a way to recognize something of type
2272 BT_INTEGER that needs to fit a void * for the purpose of the
2273 iso_c_binding derived types. */
2274 derived->ts.f90_type = BT_VOID;
2276 return derived->backend_decl;
2279 /* If use associated, use the module type for this one. */
2280 if (gfc_option.flag_whole_file
2281 && derived->backend_decl == NULL
2282 && derived->attr.use_assoc
2284 && gfc_get_module_backend_decl (derived))
2285 goto copy_derived_types;
2287 /* If a whole file compilation, the derived types from an earlier
2288 namespace can be used as the canonical type. */
2289 if (gfc_option.flag_whole_file
2290 && derived->backend_decl == NULL
2291 && !derived->attr.use_assoc
2292 && gfc_global_ns_list)
2294 for (ns = gfc_global_ns_list;
2295 ns->translated && !got_canonical;
2298 dt = ns->derived_types;
2299 for (; dt && !canonical; dt = dt->next)
2301 gfc_copy_dt_decls_ifequal (dt->derived, derived, true);
2302 if (derived->backend_decl)
2303 got_canonical = true;
2308 /* Store up the canonical type to be added to this one. */
2311 if (TYPE_CANONICAL (derived->backend_decl))
2312 canonical = TYPE_CANONICAL (derived->backend_decl);
2314 canonical = derived->backend_decl;
2316 derived->backend_decl = NULL_TREE;
2319 /* derived->backend_decl != 0 means we saw it before, but its
2320 components' backend_decl may have not been built. */
2321 if (derived->backend_decl)
2323 /* Its components' backend_decl have been built or we are
2324 seeing recursion through the formal arglist of a procedure
2325 pointer component. */
2326 if (TYPE_FIELDS (derived->backend_decl)
2327 || derived->attr.proc_pointer_comp)
2328 return derived->backend_decl;
2330 typenode = derived->backend_decl;
2334 /* We see this derived type first time, so build the type node. */
2335 typenode = make_node (RECORD_TYPE);
2336 TYPE_NAME (typenode) = get_identifier (derived->name);
2337 TYPE_PACKED (typenode) = gfc_option.flag_pack_derived;
2338 derived->backend_decl = typenode;
2341 /* Go through the derived type components, building them as
2342 necessary. The reason for doing this now is that it is
2343 possible to recurse back to this derived type through a
2344 pointer component (PR24092). If this happens, the fields
2345 will be built and so we can return the type. */
2346 for (c = derived->components; c; c = c->next)
2348 if (c->ts.type != BT_DERIVED && c->ts.type != BT_CLASS)
2351 if ((!c->attr.pointer && !c->attr.proc_pointer)
2352 || c->ts.u.derived->backend_decl == NULL)
2353 c->ts.u.derived->backend_decl = gfc_get_derived_type (c->ts.u.derived);
2355 if (c->ts.u.derived && c->ts.u.derived->attr.is_iso_c)
2357 /* Need to copy the modified ts from the derived type. The
2358 typespec was modified because C_PTR/C_FUNPTR are translated
2359 into (void *) from derived types. */
2360 c->ts.type = c->ts.u.derived->ts.type;
2361 c->ts.kind = c->ts.u.derived->ts.kind;
2362 c->ts.f90_type = c->ts.u.derived->ts.f90_type;
2365 c->initializer->ts.type = c->ts.type;
2366 c->initializer->ts.kind = c->ts.kind;
2367 c->initializer->ts.f90_type = c->ts.f90_type;
2368 c->initializer->expr_type = EXPR_NULL;
2373 if (TYPE_FIELDS (derived->backend_decl))
2374 return derived->backend_decl;
2376 /* Build the type member list. Install the newly created RECORD_TYPE
2377 node as DECL_CONTEXT of each FIELD_DECL. */
2378 for (c = derived->components; c; c = c->next)
2380 if (c->attr.proc_pointer)
2381 field_type = gfc_get_ppc_type (c);
2382 else if (c->ts.type == BT_DERIVED || c->ts.type == BT_CLASS)
2383 field_type = c->ts.u.derived->backend_decl;
2386 if (c->ts.type == BT_CHARACTER)
2388 /* Evaluate the string length. */
2389 gfc_conv_const_charlen (c->ts.u.cl);
2390 gcc_assert (c->ts.u.cl->backend_decl);
2393 field_type = gfc_typenode_for_spec (&c->ts);
2396 /* This returns an array descriptor type. Initialization may be
2398 if (c->attr.dimension && !c->attr.proc_pointer)
2400 if (c->attr.pointer || c->attr.allocatable)
2402 enum gfc_array_kind akind;
2403 if (c->attr.pointer)
2404 akind = c->attr.contiguous ? GFC_ARRAY_POINTER_CONT
2405 : GFC_ARRAY_POINTER;
2407 akind = GFC_ARRAY_ALLOCATABLE;
2408 /* Pointers to arrays aren't actually pointer types. The
2409 descriptors are separate, but the data is common. */
2410 field_type = gfc_build_array_type (field_type, c->as, akind,
2412 && !c->attr.pointer,
2413 c->attr.contiguous);
2416 field_type = gfc_get_nodesc_array_type (field_type, c->as,
2420 else if ((c->attr.pointer || c->attr.allocatable)
2421 && !c->attr.proc_pointer)
2422 field_type = build_pointer_type (field_type);
2424 if (c->attr.pointer)
2425 field_type = gfc_nonrestricted_type (field_type);
2427 /* vtype fields can point to different types to the base type. */
2428 if (c->ts.type == BT_DERIVED && c->ts.u.derived->attr.vtype)
2429 field_type = build_pointer_type_for_mode (TREE_TYPE (field_type),
2432 field = gfc_add_field_to_struct (typenode,
2433 get_identifier (c->name),
2434 field_type, &chain);
2436 gfc_set_decl_location (field, &c->loc);
2437 else if (derived->declared_at.lb)
2438 gfc_set_decl_location (field, &derived->declared_at);
2440 DECL_PACKED (field) |= TYPE_PACKED (typenode);
2443 if (!c->backend_decl)
2444 c->backend_decl = field;
2447 /* Now lay out the derived type, including the fields. */
2449 TYPE_CANONICAL (typenode) = canonical;
2451 gfc_finish_type (typenode);
2452 gfc_set_decl_location (TYPE_STUB_DECL (typenode), &derived->declared_at);
2453 if (derived->module && derived->ns->proc_name
2454 && derived->ns->proc_name->attr.flavor == FL_MODULE)
2456 if (derived->ns->proc_name->backend_decl
2457 && TREE_CODE (derived->ns->proc_name->backend_decl)
2460 TYPE_CONTEXT (typenode) = derived->ns->proc_name->backend_decl;
2461 DECL_CONTEXT (TYPE_STUB_DECL (typenode))
2462 = derived->ns->proc_name->backend_decl;
2466 derived->backend_decl = typenode;
2470 for (dt = gfc_derived_types; dt; dt = dt->next)
2471 gfc_copy_dt_decls_ifequal (derived, dt->derived, false);
2473 return derived->backend_decl;
2478 gfc_return_by_reference (gfc_symbol * sym)
2480 if (!sym->attr.function)
2483 if (sym->attr.dimension)
2486 if (sym->ts.type == BT_CHARACTER
2487 && !sym->attr.is_bind_c
2488 && (!sym->attr.result
2489 || !sym->ns->proc_name
2490 || !sym->ns->proc_name->attr.is_bind_c))
2493 /* Possibly return complex numbers by reference for g77 compatibility.
2494 We don't do this for calls to intrinsics (as the library uses the
2495 -fno-f2c calling convention), nor for calls to functions which always
2496 require an explicit interface, as no compatibility problems can
2498 if (gfc_option.flag_f2c
2499 && sym->ts.type == BT_COMPLEX
2500 && !sym->attr.intrinsic && !sym->attr.always_explicit)
2507 gfc_get_mixed_entry_union (gfc_namespace *ns)
2511 char name[GFC_MAX_SYMBOL_LEN + 1];
2512 gfc_entry_list *el, *el2;
2514 gcc_assert (ns->proc_name->attr.mixed_entry_master);
2515 gcc_assert (memcmp (ns->proc_name->name, "master.", 7) == 0);
2517 snprintf (name, GFC_MAX_SYMBOL_LEN, "munion.%s", ns->proc_name->name + 7);
2519 /* Build the type node. */
2520 type = make_node (UNION_TYPE);
2522 TYPE_NAME (type) = get_identifier (name);
2524 for (el = ns->entries; el; el = el->next)
2526 /* Search for duplicates. */
2527 for (el2 = ns->entries; el2 != el; el2 = el2->next)
2528 if (el2->sym->result == el->sym->result)
2532 gfc_add_field_to_struct_1 (type,
2533 get_identifier (el->sym->result->name),
2534 gfc_sym_type (el->sym->result), &chain);
2537 /* Finish off the type. */
2538 gfc_finish_type (type);
2539 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type)) = 1;
2543 /* Create a "fn spec" based on the formal arguments;
2544 cf. create_function_arglist. */
2547 create_fn_spec (gfc_symbol *sym, tree fntype)
2551 gfc_formal_arglist *f;
2554 memset (&spec, 0, sizeof (spec));
2558 if (sym->attr.entry_master)
2559 spec[spec_len++] = 'R';
2560 if (gfc_return_by_reference (sym))
2562 gfc_symbol *result = sym->result ? sym->result : sym;
2564 if (result->attr.pointer || sym->attr.proc_pointer)
2565 spec[spec_len++] = '.';
2567 spec[spec_len++] = 'w';
2568 if (sym->ts.type == BT_CHARACTER)
2569 spec[spec_len++] = 'R';
2572 for (f = sym->formal; f; f = f->next)
2573 if (spec_len < sizeof (spec))
2575 if (!f->sym || f->sym->attr.pointer || f->sym->attr.target
2576 || f->sym->attr.external || f->sym->attr.cray_pointer
2577 || (f->sym->ts.type == BT_DERIVED
2578 && (f->sym->ts.u.derived->attr.proc_pointer_comp
2579 || f->sym->ts.u.derived->attr.pointer_comp))
2580 || (f->sym->ts.type == BT_CLASS
2581 && (CLASS_DATA (f->sym)->ts.u.derived->attr.proc_pointer_comp
2582 || CLASS_DATA (f->sym)->ts.u.derived->attr.pointer_comp)))
2583 spec[spec_len++] = '.';
2584 else if (f->sym->attr.intent == INTENT_IN)
2585 spec[spec_len++] = 'r';
2587 spec[spec_len++] = 'w';
2590 tmp = build_tree_list (NULL_TREE, build_string (spec_len, spec));
2591 tmp = tree_cons (get_identifier ("fn spec"), tmp, TYPE_ATTRIBUTES (fntype));
2592 return build_type_attribute_variant (fntype, tmp);
2597 gfc_get_function_type (gfc_symbol * sym)
2600 VEC(tree,gc) *typelist;
2601 gfc_formal_arglist *f;
2603 int alternate_return;
2604 bool is_varargs = true;
2606 /* Make sure this symbol is a function, a subroutine or the main
2608 gcc_assert (sym->attr.flavor == FL_PROCEDURE
2609 || sym->attr.flavor == FL_PROGRAM);
2611 if (sym->backend_decl)
2612 return TREE_TYPE (sym->backend_decl);
2614 alternate_return = 0;
2617 if (sym->attr.entry_master)
2618 /* Additional parameter for selecting an entry point. */
2619 VEC_safe_push (tree, gc, typelist, gfc_array_index_type);
2626 if (arg->ts.type == BT_CHARACTER)
2627 gfc_conv_const_charlen (arg->ts.u.cl);
2629 /* Some functions we use an extra parameter for the return value. */
2630 if (gfc_return_by_reference (sym))
2632 type = gfc_sym_type (arg);
2633 if (arg->ts.type == BT_COMPLEX
2634 || arg->attr.dimension
2635 || arg->ts.type == BT_CHARACTER)
2636 type = build_reference_type (type);
2638 VEC_safe_push (tree, gc, typelist, type);
2639 if (arg->ts.type == BT_CHARACTER)
2641 if (!arg->ts.deferred)
2642 /* Transfer by value. */
2643 VEC_safe_push (tree, gc, typelist, gfc_charlen_type_node);
2645 /* Deferred character lengths are transferred by reference
2646 so that the value can be returned. */
2647 VEC_safe_push (tree, gc, typelist,
2648 build_pointer_type (gfc_charlen_type_node));
2652 /* Build the argument types for the function. */
2653 for (f = sym->formal; f; f = f->next)
2658 /* Evaluate constant character lengths here so that they can be
2659 included in the type. */
2660 if (arg->ts.type == BT_CHARACTER)
2661 gfc_conv_const_charlen (arg->ts.u.cl);
2663 if (arg->attr.flavor == FL_PROCEDURE)
2665 type = gfc_get_function_type (arg);
2666 type = build_pointer_type (type);
2669 type = gfc_sym_type (arg);
2671 /* Parameter Passing Convention
2673 We currently pass all parameters by reference.
2674 Parameters with INTENT(IN) could be passed by value.
2675 The problem arises if a function is called via an implicit
2676 prototype. In this situation the INTENT is not known.
2677 For this reason all parameters to global functions must be
2678 passed by reference. Passing by value would potentially
2679 generate bad code. Worse there would be no way of telling that
2680 this code was bad, except that it would give incorrect results.
2682 Contained procedures could pass by value as these are never
2683 used without an explicit interface, and cannot be passed as
2684 actual parameters for a dummy procedure. */
2686 VEC_safe_push (tree, gc, typelist, type);
2690 if (sym->attr.subroutine)
2691 alternate_return = 1;
2695 /* Add hidden string length parameters. */
2696 for (f = sym->formal; f; f = f->next)
2699 if (arg && arg->ts.type == BT_CHARACTER && !sym->attr.is_bind_c)
2701 if (!arg->ts.deferred)
2702 /* Transfer by value. */
2703 type = gfc_charlen_type_node;
2705 /* Deferred character lengths are transferred by reference
2706 so that the value can be returned. */
2707 type = build_pointer_type (gfc_charlen_type_node);
2709 VEC_safe_push (tree, gc, typelist, type);
2713 if (!VEC_empty (tree, typelist)
2714 || sym->attr.is_main_program
2715 || sym->attr.if_source != IFSRC_UNKNOWN)
2718 if (alternate_return)
2719 type = integer_type_node;
2720 else if (!sym->attr.function || gfc_return_by_reference (sym))
2721 type = void_type_node;
2722 else if (sym->attr.mixed_entry_master)
2723 type = gfc_get_mixed_entry_union (sym->ns);
2724 else if (gfc_option.flag_f2c
2725 && sym->ts.type == BT_REAL
2726 && sym->ts.kind == gfc_default_real_kind
2727 && !sym->attr.always_explicit)
2729 /* Special case: f2c calling conventions require that (scalar)
2730 default REAL functions return the C type double instead. f2c
2731 compatibility is only an issue with functions that don't
2732 require an explicit interface, as only these could be
2733 implemented in Fortran 77. */
2734 sym->ts.kind = gfc_default_double_kind;
2735 type = gfc_typenode_for_spec (&sym->ts);
2736 sym->ts.kind = gfc_default_real_kind;
2738 else if (sym->result && sym->result->attr.proc_pointer)
2739 /* Procedure pointer return values. */
2741 if (sym->result->attr.result && strcmp (sym->name,"ppr@") != 0)
2743 /* Unset proc_pointer as gfc_get_function_type
2744 is called recursively. */
2745 sym->result->attr.proc_pointer = 0;
2746 type = build_pointer_type (gfc_get_function_type (sym->result));
2747 sym->result->attr.proc_pointer = 1;
2750 type = gfc_sym_type (sym->result);
2753 type = gfc_sym_type (sym);
2756 type = build_varargs_function_type_vec (type, typelist);
2758 type = build_function_type_vec (type, typelist);
2759 type = create_fn_spec (sym, type);
2764 /* Language hooks for middle-end access to type nodes. */
2766 /* Return an integer type with BITS bits of precision,
2767 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2770 gfc_type_for_size (unsigned bits, int unsignedp)
2775 for (i = 0; i <= MAX_INT_KINDS; ++i)
2777 tree type = gfc_integer_types[i];
2778 if (type && bits == TYPE_PRECISION (type))
2782 /* Handle TImode as a special case because it is used by some backends
2783 (e.g. ARM) even though it is not available for normal use. */
2784 #if HOST_BITS_PER_WIDE_INT >= 64
2785 if (bits == TYPE_PRECISION (intTI_type_node))
2786 return intTI_type_node;
2791 if (bits == TYPE_PRECISION (unsigned_intQI_type_node))
2792 return unsigned_intQI_type_node;
2793 if (bits == TYPE_PRECISION (unsigned_intHI_type_node))
2794 return unsigned_intHI_type_node;
2795 if (bits == TYPE_PRECISION (unsigned_intSI_type_node))
2796 return unsigned_intSI_type_node;
2797 if (bits == TYPE_PRECISION (unsigned_intDI_type_node))
2798 return unsigned_intDI_type_node;
2799 if (bits == TYPE_PRECISION (unsigned_intTI_type_node))
2800 return unsigned_intTI_type_node;
2806 /* Return a data type that has machine mode MODE. If the mode is an
2807 integer, then UNSIGNEDP selects between signed and unsigned types. */
2810 gfc_type_for_mode (enum machine_mode mode, int unsignedp)
2815 if (GET_MODE_CLASS (mode) == MODE_FLOAT)
2816 base = gfc_real_types;
2817 else if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT)
2818 base = gfc_complex_types;
2819 else if (SCALAR_INT_MODE_P (mode))
2820 return gfc_type_for_size (GET_MODE_PRECISION (mode), unsignedp);
2821 else if (VECTOR_MODE_P (mode))
2823 enum machine_mode inner_mode = GET_MODE_INNER (mode);
2824 tree inner_type = gfc_type_for_mode (inner_mode, unsignedp);
2825 if (inner_type != NULL_TREE)
2826 return build_vector_type_for_mode (inner_type, mode);
2832 for (i = 0; i <= MAX_REAL_KINDS; ++i)
2834 tree type = base[i];
2835 if (type && mode == TYPE_MODE (type))
2842 /* Return TRUE if TYPE is a type with a hidden descriptor, fill in INFO
2846 gfc_get_array_descr_info (const_tree type, struct array_descr_info *info)
2849 bool indirect = false;
2850 tree etype, ptype, field, t, base_decl;
2851 tree data_off, dim_off, dim_size, elem_size;
2852 tree lower_suboff, upper_suboff, stride_suboff;
2854 if (! GFC_DESCRIPTOR_TYPE_P (type))
2856 if (! POINTER_TYPE_P (type))
2858 type = TREE_TYPE (type);
2859 if (! GFC_DESCRIPTOR_TYPE_P (type))
2864 rank = GFC_TYPE_ARRAY_RANK (type);
2865 if (rank >= (int) (sizeof (info->dimen) / sizeof (info->dimen[0])))
2868 etype = GFC_TYPE_ARRAY_DATAPTR_TYPE (type);
2869 gcc_assert (POINTER_TYPE_P (etype));
2870 etype = TREE_TYPE (etype);
2872 /* If the type is not a scalar coarray. */
2873 if (TREE_CODE (etype) == ARRAY_TYPE)
2874 etype = TREE_TYPE (etype);
2876 /* Can't handle variable sized elements yet. */
2877 if (int_size_in_bytes (etype) <= 0)
2879 /* Nor non-constant lower bounds in assumed shape arrays. */
2880 if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE
2881 || GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE_CONT)
2883 for (dim = 0; dim < rank; dim++)
2884 if (GFC_TYPE_ARRAY_LBOUND (type, dim) == NULL_TREE
2885 || TREE_CODE (GFC_TYPE_ARRAY_LBOUND (type, dim)) != INTEGER_CST)
2889 memset (info, '\0', sizeof (*info));
2890 info->ndimensions = rank;
2891 info->element_type = etype;
2892 ptype = build_pointer_type (gfc_array_index_type);
2893 base_decl = GFC_TYPE_ARRAY_BASE_DECL (type, indirect);
2896 base_decl = build_decl (input_location, VAR_DECL, NULL_TREE,
2897 indirect ? build_pointer_type (ptype) : ptype);
2898 GFC_TYPE_ARRAY_BASE_DECL (type, indirect) = base_decl;
2900 info->base_decl = base_decl;
2902 base_decl = build1 (INDIRECT_REF, ptype, base_decl);
2904 if (GFC_TYPE_ARRAY_SPAN (type))
2905 elem_size = GFC_TYPE_ARRAY_SPAN (type);
2907 elem_size = fold_convert (gfc_array_index_type, TYPE_SIZE_UNIT (etype));
2908 field = TYPE_FIELDS (TYPE_MAIN_VARIANT (type));
2909 data_off = byte_position (field);
2910 field = DECL_CHAIN (field);
2911 field = DECL_CHAIN (field);
2912 field = DECL_CHAIN (field);
2913 dim_off = byte_position (field);
2914 dim_size = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (field)));
2915 field = TYPE_FIELDS (TREE_TYPE (TREE_TYPE (field)));
2916 stride_suboff = byte_position (field);
2917 field = DECL_CHAIN (field);
2918 lower_suboff = byte_position (field);
2919 field = DECL_CHAIN (field);
2920 upper_suboff = byte_position (field);
2923 if (!integer_zerop (data_off))
2924 t = fold_build_pointer_plus (t, data_off);
2925 t = build1 (NOP_EXPR, build_pointer_type (ptr_type_node), t);
2926 info->data_location = build1 (INDIRECT_REF, ptr_type_node, t);
2927 if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ALLOCATABLE)
2928 info->allocated = build2 (NE_EXPR, boolean_type_node,
2929 info->data_location, null_pointer_node);
2930 else if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_POINTER
2931 || GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_POINTER_CONT)
2932 info->associated = build2 (NE_EXPR, boolean_type_node,
2933 info->data_location, null_pointer_node);
2935 for (dim = 0; dim < rank; dim++)
2937 t = fold_build_pointer_plus (base_decl,
2938 size_binop (PLUS_EXPR,
2939 dim_off, lower_suboff));
2940 t = build1 (INDIRECT_REF, gfc_array_index_type, t);
2941 info->dimen[dim].lower_bound = t;
2942 t = fold_build_pointer_plus (base_decl,
2943 size_binop (PLUS_EXPR,
2944 dim_off, upper_suboff));
2945 t = build1 (INDIRECT_REF, gfc_array_index_type, t);
2946 info->dimen[dim].upper_bound = t;
2947 if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE
2948 || GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE_CONT)
2950 /* Assumed shape arrays have known lower bounds. */
2951 info->dimen[dim].upper_bound
2952 = build2 (MINUS_EXPR, gfc_array_index_type,
2953 info->dimen[dim].upper_bound,
2954 info->dimen[dim].lower_bound);
2955 info->dimen[dim].lower_bound
2956 = fold_convert (gfc_array_index_type,
2957 GFC_TYPE_ARRAY_LBOUND (type, dim));
2958 info->dimen[dim].upper_bound
2959 = build2 (PLUS_EXPR, gfc_array_index_type,
2960 info->dimen[dim].lower_bound,
2961 info->dimen[dim].upper_bound);
2963 t = fold_build_pointer_plus (base_decl,
2964 size_binop (PLUS_EXPR,
2965 dim_off, stride_suboff));
2966 t = build1 (INDIRECT_REF, gfc_array_index_type, t);
2967 t = build2 (MULT_EXPR, gfc_array_index_type, t, elem_size);
2968 info->dimen[dim].stride = t;
2969 dim_off = size_binop (PLUS_EXPR, dim_off, dim_size);
2975 #include "gt-fortran-trans-types.h"