1 /* Backend support for Fortran 95 basic types and derived types.
2 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
3 Free Software Foundation, Inc.
4 Contributed by Paul Brook <paul@nowt.org>
5 and Steven Bosscher <s.bosscher@student.tudelft.nl>
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* trans-types.c -- gfortran backend types */
27 #include "coretypes.h"
29 #include "langhooks.h"
36 #include "trans-types.h"
37 #include "trans-const.h"
40 #include "dwarf2out.h"
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 static tree gfc_get_derived_type (gfc_symbol * derived);
58 tree gfc_array_index_type;
59 tree gfc_array_range_type;
60 tree gfc_character1_type_node;
62 tree prvoid_type_node;
63 tree ppvoid_type_node;
67 tree gfc_charlen_type_node;
69 static GTY(()) tree gfc_desc_dim_type;
70 static GTY(()) tree gfc_max_array_element_size;
71 static GTY(()) tree gfc_array_descriptor_base[2 * GFC_MAX_DIMENSIONS];
73 /* Arrays for all integral and real kinds. We'll fill this in at runtime
74 after the target has a chance to process command-line options. */
76 #define MAX_INT_KINDS 5
77 gfc_integer_info gfc_integer_kinds[MAX_INT_KINDS + 1];
78 gfc_logical_info gfc_logical_kinds[MAX_INT_KINDS + 1];
79 static GTY(()) tree gfc_integer_types[MAX_INT_KINDS + 1];
80 static GTY(()) tree gfc_logical_types[MAX_INT_KINDS + 1];
82 #define MAX_REAL_KINDS 5
83 gfc_real_info gfc_real_kinds[MAX_REAL_KINDS + 1];
84 static GTY(()) tree gfc_real_types[MAX_REAL_KINDS + 1];
85 static GTY(()) tree gfc_complex_types[MAX_REAL_KINDS + 1];
87 #define MAX_CHARACTER_KINDS 2
88 gfc_character_info gfc_character_kinds[MAX_CHARACTER_KINDS + 1];
89 static GTY(()) tree gfc_character_types[MAX_CHARACTER_KINDS + 1];
90 static GTY(()) tree gfc_pcharacter_types[MAX_CHARACTER_KINDS + 1];
93 /* The integer kind to use for array indices. This will be set to the
94 proper value based on target information from the backend. */
96 int gfc_index_integer_kind;
98 /* The default kinds of the various types. */
100 int gfc_default_integer_kind;
101 int gfc_max_integer_kind;
102 int gfc_default_real_kind;
103 int gfc_default_double_kind;
104 int gfc_default_character_kind;
105 int gfc_default_logical_kind;
106 int gfc_default_complex_kind;
109 /* The kind size used for record offsets. If the target system supports
110 kind=8, this will be set to 8, otherwise it is set to 4. */
113 /* The integer kind used to store character lengths. */
114 int gfc_charlen_int_kind;
116 /* The size of the numeric storage unit and character storage unit. */
117 int gfc_numeric_storage_size;
118 int gfc_character_storage_size;
122 gfc_check_any_c_kind (gfc_typespec *ts)
126 for (i = 0; i < ISOCBINDING_NUMBER; i++)
128 /* Check for any C interoperable kind for the given type/kind in ts.
129 This can be used after verify_c_interop to make sure that the
130 Fortran kind being used exists in at least some form for C. */
131 if (c_interop_kinds_table[i].f90_type == ts->type &&
132 c_interop_kinds_table[i].value == ts->kind)
141 get_real_kind_from_node (tree type)
145 for (i = 0; gfc_real_kinds[i].kind != 0; i++)
146 if (gfc_real_kinds[i].mode_precision == TYPE_PRECISION (type))
147 return gfc_real_kinds[i].kind;
153 get_int_kind_from_node (tree type)
160 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
161 if (gfc_integer_kinds[i].bit_size == TYPE_PRECISION (type))
162 return gfc_integer_kinds[i].kind;
167 /* Return a typenode for the "standard" C type with a given name. */
169 get_typenode_from_name (const char *name)
171 if (name == NULL || *name == '\0')
174 if (strcmp (name, "char") == 0)
175 return char_type_node;
176 if (strcmp (name, "unsigned char") == 0)
177 return unsigned_char_type_node;
178 if (strcmp (name, "signed char") == 0)
179 return signed_char_type_node;
181 if (strcmp (name, "short int") == 0)
182 return short_integer_type_node;
183 if (strcmp (name, "short unsigned int") == 0)
184 return short_unsigned_type_node;
186 if (strcmp (name, "int") == 0)
187 return integer_type_node;
188 if (strcmp (name, "unsigned int") == 0)
189 return unsigned_type_node;
191 if (strcmp (name, "long int") == 0)
192 return long_integer_type_node;
193 if (strcmp (name, "long unsigned int") == 0)
194 return long_unsigned_type_node;
196 if (strcmp (name, "long long int") == 0)
197 return long_long_integer_type_node;
198 if (strcmp (name, "long long unsigned int") == 0)
199 return long_long_unsigned_type_node;
205 get_int_kind_from_name (const char *name)
207 return get_int_kind_from_node (get_typenode_from_name (name));
211 /* Get the kind number corresponding to an integer of given size,
212 following the required return values for ISO_FORTRAN_ENV INT* constants:
213 -2 is returned if we support a kind of larger size, -1 otherwise. */
215 gfc_get_int_kind_from_width_isofortranenv (int size)
219 /* Look for a kind with matching storage size. */
220 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
221 if (gfc_integer_kinds[i].bit_size == size)
222 return gfc_integer_kinds[i].kind;
224 /* Look for a kind with larger storage size. */
225 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
226 if (gfc_integer_kinds[i].bit_size > size)
232 /* Get the kind number corresponding to a real of given storage size,
233 following the required return values for ISO_FORTRAN_ENV REAL* constants:
234 -2 is returned if we support a kind of larger size, -1 otherwise. */
236 gfc_get_real_kind_from_width_isofortranenv (int size)
242 /* Look for a kind with matching storage size. */
243 for (i = 0; gfc_real_kinds[i].kind != 0; i++)
244 if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) == size)
245 return gfc_real_kinds[i].kind;
247 /* Look for a kind with larger storage size. */
248 for (i = 0; gfc_real_kinds[i].kind != 0; i++)
249 if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) > size)
258 get_int_kind_from_width (int size)
262 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
263 if (gfc_integer_kinds[i].bit_size == size)
264 return gfc_integer_kinds[i].kind;
270 get_int_kind_from_minimal_width (int size)
274 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
275 if (gfc_integer_kinds[i].bit_size >= size)
276 return gfc_integer_kinds[i].kind;
282 /* Generate the CInteropKind_t objects for the C interoperable
286 void init_c_interop_kinds (void)
290 /* init all pointers in the list to NULL */
291 for (i = 0; i < ISOCBINDING_NUMBER; i++)
293 /* Initialize the name and value fields. */
294 c_interop_kinds_table[i].name[0] = '\0';
295 c_interop_kinds_table[i].value = -100;
296 c_interop_kinds_table[i].f90_type = BT_UNKNOWN;
299 #define NAMED_INTCST(a,b,c,d) \
300 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
301 c_interop_kinds_table[a].f90_type = BT_INTEGER; \
302 c_interop_kinds_table[a].value = c;
303 #define NAMED_REALCST(a,b,c) \
304 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
305 c_interop_kinds_table[a].f90_type = BT_REAL; \
306 c_interop_kinds_table[a].value = c;
307 #define NAMED_CMPXCST(a,b,c) \
308 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
309 c_interop_kinds_table[a].f90_type = BT_COMPLEX; \
310 c_interop_kinds_table[a].value = c;
311 #define NAMED_LOGCST(a,b,c) \
312 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
313 c_interop_kinds_table[a].f90_type = BT_LOGICAL; \
314 c_interop_kinds_table[a].value = c;
315 #define NAMED_CHARKNDCST(a,b,c) \
316 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
317 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
318 c_interop_kinds_table[a].value = c;
319 #define NAMED_CHARCST(a,b,c) \
320 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
321 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
322 c_interop_kinds_table[a].value = c;
323 #define DERIVED_TYPE(a,b,c) \
324 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
325 c_interop_kinds_table[a].f90_type = BT_DERIVED; \
326 c_interop_kinds_table[a].value = c;
327 #define PROCEDURE(a,b) \
328 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
329 c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
330 c_interop_kinds_table[a].value = 0;
331 #include "iso-c-binding.def"
335 /* Query the target to determine which machine modes are available for
336 computation. Choose KIND numbers for them. */
339 gfc_init_kinds (void)
342 int i_index, r_index, kind;
343 bool saw_i4 = false, saw_i8 = false;
344 bool saw_r4 = false, saw_r8 = false, saw_r16 = false;
346 for (i_index = 0, mode = MIN_MODE_INT; mode <= MAX_MODE_INT; mode++)
350 if (!targetm.scalar_mode_supported_p ((enum machine_mode) mode))
353 /* The middle end doesn't support constants larger than 2*HWI.
354 Perhaps the target hook shouldn't have accepted these either,
355 but just to be safe... */
356 bitsize = GET_MODE_BITSIZE (mode);
357 if (bitsize > 2*HOST_BITS_PER_WIDE_INT)
360 gcc_assert (i_index != MAX_INT_KINDS);
362 /* Let the kind equal the bit size divided by 8. This insulates the
363 programmer from the underlying byte size. */
371 gfc_integer_kinds[i_index].kind = kind;
372 gfc_integer_kinds[i_index].radix = 2;
373 gfc_integer_kinds[i_index].digits = bitsize - 1;
374 gfc_integer_kinds[i_index].bit_size = bitsize;
376 gfc_logical_kinds[i_index].kind = kind;
377 gfc_logical_kinds[i_index].bit_size = bitsize;
382 /* Set the kind used to match GFC_INT_IO in libgfortran. This is
383 used for large file access. */
390 /* If we do not at least have kind = 4, everything is pointless. */
393 /* Set the maximum integer kind. Used with at least BOZ constants. */
394 gfc_max_integer_kind = gfc_integer_kinds[i_index - 1].kind;
396 for (r_index = 0, mode = MIN_MODE_FLOAT; mode <= MAX_MODE_FLOAT; mode++)
398 const struct real_format *fmt =
399 REAL_MODE_FORMAT ((enum machine_mode) mode);
404 if (!targetm.scalar_mode_supported_p ((enum machine_mode) mode))
407 /* Only let float/double/long double go through because the fortran
408 library assumes these are the only floating point types. */
410 if (mode != TYPE_MODE (float_type_node)
411 && (mode != TYPE_MODE (double_type_node))
412 && (mode != TYPE_MODE (long_double_type_node)))
415 /* Let the kind equal the precision divided by 8, rounding up. Again,
416 this insulates the programmer from the underlying byte size.
418 Also, it effectively deals with IEEE extended formats. There, the
419 total size of the type may equal 16, but it's got 6 bytes of padding
420 and the increased size can get in the way of a real IEEE quad format
421 which may also be supported by the target.
423 We round up so as to handle IA-64 __floatreg (RFmode), which is an
424 82 bit type. Not to be confused with __float80 (XFmode), which is
425 an 80 bit type also supported by IA-64. So XFmode should come out
426 to be kind=10, and RFmode should come out to be kind=11. Egads. */
428 kind = (GET_MODE_PRECISION (mode) + 7) / 8;
437 /* Careful we don't stumble a weird internal mode. */
438 gcc_assert (r_index <= 0 || gfc_real_kinds[r_index-1].kind != kind);
439 /* Or have too many modes for the allocated space. */
440 gcc_assert (r_index != MAX_REAL_KINDS);
442 gfc_real_kinds[r_index].kind = kind;
443 gfc_real_kinds[r_index].radix = fmt->b;
444 gfc_real_kinds[r_index].digits = fmt->p;
445 gfc_real_kinds[r_index].min_exponent = fmt->emin;
446 gfc_real_kinds[r_index].max_exponent = fmt->emax;
447 if (fmt->pnan < fmt->p)
448 /* This is an IBM extended double format (or the MIPS variant)
449 made up of two IEEE doubles. The value of the long double is
450 the sum of the values of the two parts. The most significant
451 part is required to be the value of the long double rounded
452 to the nearest double. If we use emax of 1024 then we can't
453 represent huge(x) = (1 - b**(-p)) * b**(emax-1) * b, because
454 rounding will make the most significant part overflow. */
455 gfc_real_kinds[r_index].max_exponent = fmt->emax - 1;
456 gfc_real_kinds[r_index].mode_precision = GET_MODE_PRECISION (mode);
460 /* Choose the default integer kind. We choose 4 unless the user
461 directs us otherwise. */
462 if (gfc_option.flag_default_integer)
465 fatal_error ("integer kind=8 not available for -fdefault-integer-8 option");
466 gfc_default_integer_kind = 8;
468 /* Even if the user specified that the default integer kind be 8,
469 the numeric storage size isn't 64. In this case, a warning will
470 be issued when NUMERIC_STORAGE_SIZE is used. */
471 gfc_numeric_storage_size = 4 * 8;
475 gfc_default_integer_kind = 4;
476 gfc_numeric_storage_size = 4 * 8;
480 gfc_default_integer_kind = gfc_integer_kinds[i_index - 1].kind;
481 gfc_numeric_storage_size = gfc_integer_kinds[i_index - 1].bit_size;
484 /* Choose the default real kind. Again, we choose 4 when possible. */
485 if (gfc_option.flag_default_real)
488 fatal_error ("real kind=8 not available for -fdefault-real-8 option");
489 gfc_default_real_kind = 8;
492 gfc_default_real_kind = 4;
494 gfc_default_real_kind = gfc_real_kinds[0].kind;
496 /* Choose the default double kind. If -fdefault-real and -fdefault-double
497 are specified, we use kind=8, if it's available. If -fdefault-real is
498 specified without -fdefault-double, we use kind=16, if it's available.
499 Otherwise we do not change anything. */
500 if (gfc_option.flag_default_double && !gfc_option.flag_default_real)
501 fatal_error ("Use of -fdefault-double-8 requires -fdefault-real-8");
503 if (gfc_option.flag_default_real && gfc_option.flag_default_double && saw_r8)
504 gfc_default_double_kind = 8;
505 else if (gfc_option.flag_default_real && saw_r16)
506 gfc_default_double_kind = 16;
507 else if (saw_r4 && saw_r8)
508 gfc_default_double_kind = 8;
511 /* F95 14.6.3.1: A nonpointer scalar object of type double precision
512 real ... occupies two contiguous numeric storage units.
514 Therefore we must be supplied a kind twice as large as we chose
515 for single precision. There are loopholes, in that double
516 precision must *occupy* two storage units, though it doesn't have
517 to *use* two storage units. Which means that you can make this
518 kind artificially wide by padding it. But at present there are
519 no GCC targets for which a two-word type does not exist, so we
520 just let gfc_validate_kind abort and tell us if something breaks. */
522 gfc_default_double_kind
523 = gfc_validate_kind (BT_REAL, gfc_default_real_kind * 2, false);
526 /* The default logical kind is constrained to be the same as the
527 default integer kind. Similarly with complex and real. */
528 gfc_default_logical_kind = gfc_default_integer_kind;
529 gfc_default_complex_kind = gfc_default_real_kind;
531 /* We only have two character kinds: ASCII and UCS-4.
532 ASCII corresponds to a 8-bit integer type, if one is available.
533 UCS-4 corresponds to a 32-bit integer type, if one is available. */
535 if ((kind = get_int_kind_from_width (8)) > 0)
537 gfc_character_kinds[i_index].kind = kind;
538 gfc_character_kinds[i_index].bit_size = 8;
539 gfc_character_kinds[i_index].name = "ascii";
542 if ((kind = get_int_kind_from_width (32)) > 0)
544 gfc_character_kinds[i_index].kind = kind;
545 gfc_character_kinds[i_index].bit_size = 32;
546 gfc_character_kinds[i_index].name = "iso_10646";
550 /* Choose the smallest integer kind for our default character. */
551 gfc_default_character_kind = gfc_character_kinds[0].kind;
552 gfc_character_storage_size = gfc_default_character_kind * 8;
554 /* Choose the integer kind the same size as "void*" for our index kind. */
555 gfc_index_integer_kind = POINTER_SIZE / 8;
556 /* Pick a kind the same size as the C "int" type. */
557 gfc_c_int_kind = INT_TYPE_SIZE / 8;
559 /* initialize the C interoperable kinds */
560 init_c_interop_kinds();
563 /* Make sure that a valid kind is present. Returns an index into the
564 associated kinds array, -1 if the kind is not present. */
567 validate_integer (int kind)
571 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
572 if (gfc_integer_kinds[i].kind == kind)
579 validate_real (int kind)
583 for (i = 0; gfc_real_kinds[i].kind != 0; i++)
584 if (gfc_real_kinds[i].kind == kind)
591 validate_logical (int kind)
595 for (i = 0; gfc_logical_kinds[i].kind; i++)
596 if (gfc_logical_kinds[i].kind == kind)
603 validate_character (int kind)
607 for (i = 0; gfc_character_kinds[i].kind; i++)
608 if (gfc_character_kinds[i].kind == kind)
614 /* Validate a kind given a basic type. The return value is the same
615 for the child functions, with -1 indicating nonexistence of the
616 type. If MAY_FAIL is false, then -1 is never returned, and we ICE. */
619 gfc_validate_kind (bt type, int kind, bool may_fail)
625 case BT_REAL: /* Fall through */
627 rc = validate_real (kind);
630 rc = validate_integer (kind);
633 rc = validate_logical (kind);
636 rc = validate_character (kind);
640 gfc_internal_error ("gfc_validate_kind(): Got bad type");
643 if (rc < 0 && !may_fail)
644 gfc_internal_error ("gfc_validate_kind(): Got bad kind");
650 /* Four subroutines of gfc_init_types. Create type nodes for the given kind.
651 Reuse common type nodes where possible. Recognize if the kind matches up
652 with a C type. This will be used later in determining which routines may
653 be scarfed from libm. */
656 gfc_build_int_type (gfc_integer_info *info)
658 int mode_precision = info->bit_size;
660 if (mode_precision == CHAR_TYPE_SIZE)
662 if (mode_precision == SHORT_TYPE_SIZE)
664 if (mode_precision == INT_TYPE_SIZE)
666 if (mode_precision == LONG_TYPE_SIZE)
668 if (mode_precision == LONG_LONG_TYPE_SIZE)
669 info->c_long_long = 1;
671 if (TYPE_PRECISION (intQI_type_node) == mode_precision)
672 return intQI_type_node;
673 if (TYPE_PRECISION (intHI_type_node) == mode_precision)
674 return intHI_type_node;
675 if (TYPE_PRECISION (intSI_type_node) == mode_precision)
676 return intSI_type_node;
677 if (TYPE_PRECISION (intDI_type_node) == mode_precision)
678 return intDI_type_node;
679 if (TYPE_PRECISION (intTI_type_node) == mode_precision)
680 return intTI_type_node;
682 return make_signed_type (mode_precision);
686 gfc_build_uint_type (int size)
688 if (size == CHAR_TYPE_SIZE)
689 return unsigned_char_type_node;
690 if (size == SHORT_TYPE_SIZE)
691 return short_unsigned_type_node;
692 if (size == INT_TYPE_SIZE)
693 return unsigned_type_node;
694 if (size == LONG_TYPE_SIZE)
695 return long_unsigned_type_node;
696 if (size == LONG_LONG_TYPE_SIZE)
697 return long_long_unsigned_type_node;
699 return make_unsigned_type (size);
704 gfc_build_real_type (gfc_real_info *info)
706 int mode_precision = info->mode_precision;
709 if (mode_precision == FLOAT_TYPE_SIZE)
711 if (mode_precision == DOUBLE_TYPE_SIZE)
713 if (mode_precision == LONG_DOUBLE_TYPE_SIZE)
714 info->c_long_double = 1;
716 if (TYPE_PRECISION (float_type_node) == mode_precision)
717 return float_type_node;
718 if (TYPE_PRECISION (double_type_node) == mode_precision)
719 return double_type_node;
720 if (TYPE_PRECISION (long_double_type_node) == mode_precision)
721 return long_double_type_node;
723 new_type = make_node (REAL_TYPE);
724 TYPE_PRECISION (new_type) = mode_precision;
725 layout_type (new_type);
730 gfc_build_complex_type (tree scalar_type)
734 if (scalar_type == NULL)
736 if (scalar_type == float_type_node)
737 return complex_float_type_node;
738 if (scalar_type == double_type_node)
739 return complex_double_type_node;
740 if (scalar_type == long_double_type_node)
741 return complex_long_double_type_node;
743 new_type = make_node (COMPLEX_TYPE);
744 TREE_TYPE (new_type) = scalar_type;
745 layout_type (new_type);
750 gfc_build_logical_type (gfc_logical_info *info)
752 int bit_size = info->bit_size;
755 if (bit_size == BOOL_TYPE_SIZE)
758 return boolean_type_node;
761 new_type = make_unsigned_type (bit_size);
762 TREE_SET_CODE (new_type, BOOLEAN_TYPE);
763 TYPE_MAX_VALUE (new_type) = build_int_cst (new_type, 1);
764 TYPE_PRECISION (new_type) = 1;
771 /* Return the bit size of the C "size_t". */
777 if (strcmp (SIZE_TYPE, "unsigned int") == 0)
778 return INT_TYPE_SIZE;
779 if (strcmp (SIZE_TYPE, "long unsigned int") == 0)
780 return LONG_TYPE_SIZE;
781 if (strcmp (SIZE_TYPE, "short unsigned int") == 0)
782 return SHORT_TYPE_SIZE;
785 return LONG_TYPE_SIZE;
790 /* Create the backend type nodes. We map them to their
791 equivalent C type, at least for now. We also give
792 names to the types here, and we push them in the
793 global binding level context.*/
796 gfc_init_types (void)
802 unsigned HOST_WIDE_INT hi;
803 unsigned HOST_WIDE_INT lo;
805 /* Create and name the types. */
806 #define PUSH_TYPE(name, node) \
807 pushdecl (build_decl (input_location, \
808 TYPE_DECL, get_identifier (name), node))
810 for (index = 0; gfc_integer_kinds[index].kind != 0; ++index)
812 type = gfc_build_int_type (&gfc_integer_kinds[index]);
813 /* Ensure integer(kind=1) doesn't have TYPE_STRING_FLAG set. */
814 if (TYPE_STRING_FLAG (type))
815 type = make_signed_type (gfc_integer_kinds[index].bit_size);
816 gfc_integer_types[index] = type;
817 snprintf (name_buf, sizeof(name_buf), "integer(kind=%d)",
818 gfc_integer_kinds[index].kind);
819 PUSH_TYPE (name_buf, type);
822 for (index = 0; gfc_logical_kinds[index].kind != 0; ++index)
824 type = gfc_build_logical_type (&gfc_logical_kinds[index]);
825 gfc_logical_types[index] = type;
826 snprintf (name_buf, sizeof(name_buf), "logical(kind=%d)",
827 gfc_logical_kinds[index].kind);
828 PUSH_TYPE (name_buf, type);
831 for (index = 0; gfc_real_kinds[index].kind != 0; index++)
833 type = gfc_build_real_type (&gfc_real_kinds[index]);
834 gfc_real_types[index] = type;
835 snprintf (name_buf, sizeof(name_buf), "real(kind=%d)",
836 gfc_real_kinds[index].kind);
837 PUSH_TYPE (name_buf, type);
839 type = gfc_build_complex_type (type);
840 gfc_complex_types[index] = type;
841 snprintf (name_buf, sizeof(name_buf), "complex(kind=%d)",
842 gfc_real_kinds[index].kind);
843 PUSH_TYPE (name_buf, type);
846 for (index = 0; gfc_character_kinds[index].kind != 0; ++index)
848 type = gfc_build_uint_type (gfc_character_kinds[index].bit_size);
849 type = build_qualified_type (type, TYPE_UNQUALIFIED);
850 snprintf (name_buf, sizeof(name_buf), "character(kind=%d)",
851 gfc_character_kinds[index].kind);
852 PUSH_TYPE (name_buf, type);
853 gfc_character_types[index] = type;
854 gfc_pcharacter_types[index] = build_pointer_type (type);
856 gfc_character1_type_node = gfc_character_types[0];
858 PUSH_TYPE ("byte", unsigned_char_type_node);
859 PUSH_TYPE ("void", void_type_node);
861 /* DBX debugging output gets upset if these aren't set. */
862 if (!TYPE_NAME (integer_type_node))
863 PUSH_TYPE ("c_integer", integer_type_node);
864 if (!TYPE_NAME (char_type_node))
865 PUSH_TYPE ("c_char", char_type_node);
869 pvoid_type_node = build_pointer_type (void_type_node);
870 prvoid_type_node = build_qualified_type (pvoid_type_node, TYPE_QUAL_RESTRICT);
871 ppvoid_type_node = build_pointer_type (pvoid_type_node);
872 pchar_type_node = build_pointer_type (gfc_character1_type_node);
874 = build_pointer_type (build_function_type (void_type_node, NULL_TREE));
876 gfc_array_index_type = gfc_get_int_type (gfc_index_integer_kind);
877 /* We cannot use gfc_index_zero_node in definition of gfc_array_range_type,
878 since this function is called before gfc_init_constants. */
880 = build_range_type (gfc_array_index_type,
881 build_int_cst (gfc_array_index_type, 0),
884 /* The maximum array element size that can be handled is determined
885 by the number of bits available to store this field in the array
888 n = TYPE_PRECISION (gfc_array_index_type) - GFC_DTYPE_SIZE_SHIFT;
889 lo = ~ (unsigned HOST_WIDE_INT) 0;
890 if (n > HOST_BITS_PER_WIDE_INT)
891 hi = lo >> (2*HOST_BITS_PER_WIDE_INT - n);
893 hi = 0, lo >>= HOST_BITS_PER_WIDE_INT - n;
894 gfc_max_array_element_size
895 = build_int_cst_wide (long_unsigned_type_node, lo, hi);
897 size_type_node = gfc_array_index_type;
899 boolean_type_node = gfc_get_logical_type (gfc_default_logical_kind);
900 boolean_true_node = build_int_cst (boolean_type_node, 1);
901 boolean_false_node = build_int_cst (boolean_type_node, 0);
903 /* ??? Shouldn't this be based on gfc_index_integer_kind or so? */
904 gfc_charlen_int_kind = 4;
905 gfc_charlen_type_node = gfc_get_int_type (gfc_charlen_int_kind);
908 /* Get the type node for the given type and kind. */
911 gfc_get_int_type (int kind)
913 int index = gfc_validate_kind (BT_INTEGER, kind, true);
914 return index < 0 ? 0 : gfc_integer_types[index];
918 gfc_get_real_type (int kind)
920 int index = gfc_validate_kind (BT_REAL, kind, true);
921 return index < 0 ? 0 : gfc_real_types[index];
925 gfc_get_complex_type (int kind)
927 int index = gfc_validate_kind (BT_COMPLEX, kind, true);
928 return index < 0 ? 0 : gfc_complex_types[index];
932 gfc_get_logical_type (int kind)
934 int index = gfc_validate_kind (BT_LOGICAL, kind, true);
935 return index < 0 ? 0 : gfc_logical_types[index];
939 gfc_get_char_type (int kind)
941 int index = gfc_validate_kind (BT_CHARACTER, kind, true);
942 return index < 0 ? 0 : gfc_character_types[index];
946 gfc_get_pchar_type (int kind)
948 int index = gfc_validate_kind (BT_CHARACTER, kind, true);
949 return index < 0 ? 0 : gfc_pcharacter_types[index];
953 /* Create a character type with the given kind and length. */
956 gfc_get_character_type_len_for_eltype (tree eltype, tree len)
960 bounds = build_range_type (gfc_charlen_type_node, gfc_index_one_node, len);
961 type = build_array_type (eltype, bounds);
962 TYPE_STRING_FLAG (type) = 1;
968 gfc_get_character_type_len (int kind, tree len)
970 gfc_validate_kind (BT_CHARACTER, kind, false);
971 return gfc_get_character_type_len_for_eltype (gfc_get_char_type (kind), len);
975 /* Get a type node for a character kind. */
978 gfc_get_character_type (int kind, gfc_charlen * cl)
982 len = (cl == NULL) ? NULL_TREE : cl->backend_decl;
984 return gfc_get_character_type_len (kind, len);
987 /* Covert a basic type. This will be an array for character types. */
990 gfc_typenode_for_spec (gfc_typespec * spec)
1000 /* We use INTEGER(c_intptr_t) for C_PTR and C_FUNPTR once the symbol
1001 has been resolved. This is done so we can convert C_PTR and
1002 C_FUNPTR to simple variables that get translated to (void *). */
1003 if (spec->f90_type == BT_VOID)
1006 && spec->u.derived->intmod_sym_id == ISOCBINDING_PTR)
1007 basetype = ptr_type_node;
1009 basetype = pfunc_type_node;
1012 basetype = gfc_get_int_type (spec->kind);
1016 basetype = gfc_get_real_type (spec->kind);
1020 basetype = gfc_get_complex_type (spec->kind);
1024 basetype = gfc_get_logical_type (spec->kind);
1028 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);
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)
1209 tree lbound[GFC_MAX_DIMENSIONS];
1210 tree ubound[GFC_MAX_DIMENSIONS];
1213 for (n = 0; n < as->rank; n++)
1215 /* Create expressions for the known bounds of the array. */
1216 if (as->type == AS_ASSUMED_SHAPE && as->lower[n] == NULL)
1217 lbound[n] = gfc_index_one_node;
1219 lbound[n] = gfc_conv_array_bound (as->lower[n]);
1220 ubound[n] = gfc_conv_array_bound (as->upper[n]);
1223 if (as->type == AS_ASSUMED_SHAPE)
1224 akind = GFC_ARRAY_ASSUMED_SHAPE;
1225 return gfc_get_array_type_bounds (type, as->rank, lbound, ubound, 0, akind,
1229 /* Returns the struct descriptor_dimension type. */
1232 gfc_get_desc_dim_type (void)
1238 if (gfc_desc_dim_type)
1239 return gfc_desc_dim_type;
1241 /* Build the type node. */
1242 type = make_node (RECORD_TYPE);
1244 TYPE_NAME (type) = get_identifier ("descriptor_dimension");
1245 TYPE_PACKED (type) = 1;
1247 /* Consists of the stride, lbound and ubound members. */
1248 decl = build_decl (input_location,
1250 get_identifier ("stride"), gfc_array_index_type);
1251 DECL_CONTEXT (decl) = type;
1252 TREE_NO_WARNING (decl) = 1;
1255 decl = build_decl (input_location,
1257 get_identifier ("lbound"), gfc_array_index_type);
1258 DECL_CONTEXT (decl) = type;
1259 TREE_NO_WARNING (decl) = 1;
1260 fieldlist = chainon (fieldlist, decl);
1262 decl = build_decl (input_location,
1264 get_identifier ("ubound"), gfc_array_index_type);
1265 DECL_CONTEXT (decl) = type;
1266 TREE_NO_WARNING (decl) = 1;
1267 fieldlist = chainon (fieldlist, decl);
1269 /* Finish off the type. */
1270 TYPE_FIELDS (type) = fieldlist;
1272 gfc_finish_type (type);
1273 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type)) = 1;
1275 gfc_desc_dim_type = type;
1280 /* Return the DTYPE for an array. This describes the type and type parameters
1282 /* TODO: Only call this when the value is actually used, and make all the
1283 unknown cases abort. */
1286 gfc_get_dtype (tree type)
1296 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type) || GFC_ARRAY_TYPE_P (type));
1298 if (GFC_TYPE_ARRAY_DTYPE (type))
1299 return GFC_TYPE_ARRAY_DTYPE (type);
1301 rank = GFC_TYPE_ARRAY_RANK (type);
1302 etype = gfc_get_element_type (type);
1304 switch (TREE_CODE (etype))
1307 n = GFC_DTYPE_INTEGER;
1311 n = GFC_DTYPE_LOGICAL;
1319 n = GFC_DTYPE_COMPLEX;
1322 /* We will never have arrays of arrays. */
1324 n = GFC_DTYPE_DERIVED;
1328 n = GFC_DTYPE_CHARACTER;
1332 /* TODO: Don't do dtype for temporary descriptorless arrays. */
1333 /* We can strange array types for temporary arrays. */
1334 return gfc_index_zero_node;
1337 gcc_assert (rank <= GFC_DTYPE_RANK_MASK);
1338 size = TYPE_SIZE_UNIT (etype);
1340 i = rank | (n << GFC_DTYPE_TYPE_SHIFT);
1341 if (size && INTEGER_CST_P (size))
1343 if (tree_int_cst_lt (gfc_max_array_element_size, size))
1344 internal_error ("Array element size too big");
1346 i += TREE_INT_CST_LOW (size) << GFC_DTYPE_SIZE_SHIFT;
1348 dtype = build_int_cst (gfc_array_index_type, i);
1350 if (size && !INTEGER_CST_P (size))
1352 tmp = build_int_cst (gfc_array_index_type, GFC_DTYPE_SIZE_SHIFT);
1353 tmp = fold_build2 (LSHIFT_EXPR, gfc_array_index_type,
1354 fold_convert (gfc_array_index_type, size), tmp);
1355 dtype = fold_build2 (PLUS_EXPR, gfc_array_index_type, tmp, dtype);
1357 /* If we don't know the size we leave it as zero. This should never happen
1358 for anything that is actually used. */
1359 /* TODO: Check this is actually true, particularly when repacking
1360 assumed size parameters. */
1362 GFC_TYPE_ARRAY_DTYPE (type) = dtype;
1367 /* Build an array type for use without a descriptor, packed according
1368 to the value of PACKED. */
1371 gfc_get_nodesc_array_type (tree etype, gfc_array_spec * as, gfc_packed packed,
1385 mpz_init_set_ui (offset, 0);
1386 mpz_init_set_ui (stride, 1);
1389 /* We don't use build_array_type because this does not include include
1390 lang-specific information (i.e. the bounds of the array) when checking
1392 type = make_node (ARRAY_TYPE);
1394 GFC_ARRAY_TYPE_P (type) = 1;
1395 TYPE_LANG_SPECIFIC (type) = (struct lang_type *)
1396 ggc_alloc_cleared (sizeof (struct lang_type));
1398 known_stride = (packed != PACKED_NO);
1400 for (n = 0; n < as->rank; n++)
1402 /* Fill in the stride and bound components of the type. */
1404 tmp = gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
1407 GFC_TYPE_ARRAY_STRIDE (type, n) = tmp;
1409 expr = as->lower[n];
1410 if (expr->expr_type == EXPR_CONSTANT)
1412 tmp = gfc_conv_mpz_to_tree (expr->value.integer,
1413 gfc_index_integer_kind);
1420 GFC_TYPE_ARRAY_LBOUND (type, n) = tmp;
1424 /* Calculate the offset. */
1425 mpz_mul (delta, stride, as->lower[n]->value.integer);
1426 mpz_sub (offset, offset, delta);
1431 expr = as->upper[n];
1432 if (expr && expr->expr_type == EXPR_CONSTANT)
1434 tmp = gfc_conv_mpz_to_tree (expr->value.integer,
1435 gfc_index_integer_kind);
1442 GFC_TYPE_ARRAY_UBOUND (type, n) = tmp;
1446 /* Calculate the stride. */
1447 mpz_sub (delta, as->upper[n]->value.integer,
1448 as->lower[n]->value.integer);
1449 mpz_add_ui (delta, delta, 1);
1450 mpz_mul (stride, stride, delta);
1453 /* Only the first stride is known for partial packed arrays. */
1454 if (packed == PACKED_NO || packed == PACKED_PARTIAL)
1460 GFC_TYPE_ARRAY_OFFSET (type) =
1461 gfc_conv_mpz_to_tree (offset, gfc_index_integer_kind);
1464 GFC_TYPE_ARRAY_OFFSET (type) = NULL_TREE;
1468 GFC_TYPE_ARRAY_SIZE (type) =
1469 gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
1472 GFC_TYPE_ARRAY_SIZE (type) = NULL_TREE;
1474 GFC_TYPE_ARRAY_RANK (type) = as->rank;
1475 GFC_TYPE_ARRAY_DTYPE (type) = NULL_TREE;
1476 range = build_range_type (gfc_array_index_type, gfc_index_zero_node,
1478 /* TODO: use main type if it is unbounded. */
1479 GFC_TYPE_ARRAY_DATAPTR_TYPE (type) =
1480 build_pointer_type (build_array_type (etype, range));
1482 GFC_TYPE_ARRAY_DATAPTR_TYPE (type) =
1483 build_qualified_type (GFC_TYPE_ARRAY_DATAPTR_TYPE (type),
1484 TYPE_QUAL_RESTRICT);
1488 mpz_sub_ui (stride, stride, 1);
1489 range = gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
1494 range = build_range_type (gfc_array_index_type, gfc_index_zero_node, range);
1495 TYPE_DOMAIN (type) = range;
1497 build_pointer_type (etype);
1498 TREE_TYPE (type) = etype;
1506 /* Represent packed arrays as multi-dimensional if they have rank >
1507 1 and with proper bounds, instead of flat arrays. This makes for
1508 better debug info. */
1511 tree gtype = etype, rtype, type_decl;
1513 for (n = as->rank - 1; n >= 0; n--)
1515 rtype = build_range_type (gfc_array_index_type,
1516 GFC_TYPE_ARRAY_LBOUND (type, n),
1517 GFC_TYPE_ARRAY_UBOUND (type, n));
1518 gtype = build_array_type (gtype, rtype);
1520 TYPE_NAME (type) = type_decl = build_decl (input_location,
1521 TYPE_DECL, NULL, gtype);
1522 DECL_ORIGINAL_TYPE (type_decl) = gtype;
1525 if (packed != PACKED_STATIC || !known_stride)
1527 /* For dummy arrays and automatic (heap allocated) arrays we
1528 want a pointer to the array. */
1529 type = build_pointer_type (type);
1531 type = build_qualified_type (type, TYPE_QUAL_RESTRICT);
1532 GFC_ARRAY_TYPE_P (type) = 1;
1533 TYPE_LANG_SPECIFIC (type) = TYPE_LANG_SPECIFIC (TREE_TYPE (type));
1538 /* Return or create the base type for an array descriptor. */
1541 gfc_get_array_descriptor_base (int dimen, bool restricted)
1543 tree fat_type, fieldlist, decl, arraytype;
1544 char name[16 + GFC_RANK_DIGITS + 1];
1545 int idx = 2 * (dimen - 1) + restricted;
1547 gcc_assert (dimen >= 1 && dimen <= GFC_MAX_DIMENSIONS);
1548 if (gfc_array_descriptor_base[idx])
1549 return gfc_array_descriptor_base[idx];
1551 /* Build the type node. */
1552 fat_type = make_node (RECORD_TYPE);
1554 sprintf (name, "array_descriptor" GFC_RANK_PRINTF_FORMAT, dimen);
1555 TYPE_NAME (fat_type) = get_identifier (name);
1557 /* Add the data member as the first element of the descriptor. */
1558 decl = build_decl (input_location,
1559 FIELD_DECL, get_identifier ("data"),
1560 restricted ? prvoid_type_node : ptr_type_node);
1562 DECL_CONTEXT (decl) = fat_type;
1565 /* Add the base component. */
1566 decl = build_decl (input_location,
1567 FIELD_DECL, get_identifier ("offset"),
1568 gfc_array_index_type);
1569 DECL_CONTEXT (decl) = fat_type;
1570 TREE_NO_WARNING (decl) = 1;
1571 fieldlist = chainon (fieldlist, decl);
1573 /* Add the dtype component. */
1574 decl = build_decl (input_location,
1575 FIELD_DECL, get_identifier ("dtype"),
1576 gfc_array_index_type);
1577 DECL_CONTEXT (decl) = fat_type;
1578 TREE_NO_WARNING (decl) = 1;
1579 fieldlist = chainon (fieldlist, decl);
1581 /* Build the array type for the stride and bound components. */
1583 build_array_type (gfc_get_desc_dim_type (),
1584 build_range_type (gfc_array_index_type,
1585 gfc_index_zero_node,
1586 gfc_rank_cst[dimen - 1]));
1588 decl = build_decl (input_location,
1589 FIELD_DECL, get_identifier ("dim"), arraytype);
1590 DECL_CONTEXT (decl) = fat_type;
1591 TREE_NO_WARNING (decl) = 1;
1592 fieldlist = chainon (fieldlist, decl);
1594 /* Finish off the type. */
1595 TYPE_FIELDS (fat_type) = fieldlist;
1597 gfc_finish_type (fat_type);
1598 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (fat_type)) = 1;
1600 gfc_array_descriptor_base[idx] = fat_type;
1604 /* Build an array (descriptor) type with given bounds. */
1607 gfc_get_array_type_bounds (tree etype, int dimen, tree * lbound,
1608 tree * ubound, int packed,
1609 enum gfc_array_kind akind, bool restricted)
1611 char name[8 + GFC_RANK_DIGITS + GFC_MAX_SYMBOL_LEN];
1612 tree fat_type, base_type, arraytype, lower, upper, stride, tmp, rtype;
1613 const char *type_name;
1616 base_type = gfc_get_array_descriptor_base (dimen, restricted);
1617 fat_type = build_distinct_type_copy (base_type);
1618 /* Make sure that nontarget and target array type have the same canonical
1619 type (and same stub decl for debug info). */
1620 base_type = gfc_get_array_descriptor_base (dimen, false);
1621 TYPE_CANONICAL (fat_type) = base_type;
1622 TYPE_STUB_DECL (fat_type) = TYPE_STUB_DECL (base_type);
1624 tmp = TYPE_NAME (etype);
1625 if (tmp && TREE_CODE (tmp) == TYPE_DECL)
1626 tmp = DECL_NAME (tmp);
1628 type_name = IDENTIFIER_POINTER (tmp);
1630 type_name = "unknown";
1631 sprintf (name, "array" GFC_RANK_PRINTF_FORMAT "_%.*s", dimen,
1632 GFC_MAX_SYMBOL_LEN, type_name);
1633 TYPE_NAME (fat_type) = get_identifier (name);
1635 GFC_DESCRIPTOR_TYPE_P (fat_type) = 1;
1636 TYPE_LANG_SPECIFIC (fat_type) = (struct lang_type *)
1637 ggc_alloc_cleared (sizeof (struct lang_type));
1639 GFC_TYPE_ARRAY_RANK (fat_type) = dimen;
1640 GFC_TYPE_ARRAY_DTYPE (fat_type) = NULL_TREE;
1641 GFC_TYPE_ARRAY_AKIND (fat_type) = akind;
1643 /* Build an array descriptor record type. */
1645 stride = gfc_index_one_node;
1648 for (n = 0; n < dimen; n++)
1650 GFC_TYPE_ARRAY_STRIDE (fat_type, n) = stride;
1657 if (lower != NULL_TREE)
1659 if (INTEGER_CST_P (lower))
1660 GFC_TYPE_ARRAY_LBOUND (fat_type, n) = lower;
1666 if (upper != NULL_TREE)
1668 if (INTEGER_CST_P (upper))
1669 GFC_TYPE_ARRAY_UBOUND (fat_type, n) = upper;
1674 if (upper != NULL_TREE && lower != NULL_TREE && stride != NULL_TREE)
1676 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, upper, lower);
1677 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type, tmp,
1678 gfc_index_one_node);
1680 fold_build2 (MULT_EXPR, gfc_array_index_type, tmp, stride);
1681 /* Check the folding worked. */
1682 gcc_assert (INTEGER_CST_P (stride));
1687 GFC_TYPE_ARRAY_SIZE (fat_type) = stride;
1689 /* TODO: known offsets for descriptors. */
1690 GFC_TYPE_ARRAY_OFFSET (fat_type) = NULL_TREE;
1692 /* We define data as an array with the correct size if possible.
1693 Much better than doing pointer arithmetic. */
1695 rtype = build_range_type (gfc_array_index_type, gfc_index_zero_node,
1696 int_const_binop (MINUS_EXPR, stride,
1697 integer_one_node, 0));
1699 rtype = gfc_array_range_type;
1700 arraytype = build_array_type (etype, rtype);
1701 arraytype = build_pointer_type (arraytype);
1703 arraytype = build_qualified_type (arraytype, TYPE_QUAL_RESTRICT);
1704 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type) = arraytype;
1706 /* This will generate the base declarations we need to emit debug
1707 information for this type. FIXME: there must be a better way to
1708 avoid divergence between compilations with and without debug
1711 struct array_descr_info info;
1712 gfc_get_array_descr_info (fat_type, &info);
1713 gfc_get_array_descr_info (build_pointer_type (fat_type), &info);
1719 /* Build a pointer type. This function is called from gfc_sym_type(). */
1722 gfc_build_pointer_type (gfc_symbol * sym, tree type)
1724 /* Array pointer types aren't actually pointers. */
1725 if (sym->attr.dimension)
1728 return build_pointer_type (type);
1731 /* Return the type for a symbol. Special handling is required for character
1732 types to get the correct level of indirection.
1733 For functions return the return type.
1734 For subroutines return void_type_node.
1735 Calling this multiple times for the same symbol should be avoided,
1736 especially for character and array types. */
1739 gfc_sym_type (gfc_symbol * sym)
1745 /* Procedure Pointers inside COMMON blocks. */
1746 if (sym->attr.proc_pointer && sym->attr.in_common)
1748 /* Unset proc_pointer as gfc_get_function_type calls gfc_sym_type. */
1749 sym->attr.proc_pointer = 0;
1750 type = build_pointer_type (gfc_get_function_type (sym));
1751 sym->attr.proc_pointer = 1;
1755 if (sym->attr.flavor == FL_PROCEDURE && !sym->attr.function)
1756 return void_type_node;
1758 /* In the case of a function the fake result variable may have a
1759 type different from the function type, so don't return early in
1761 if (sym->backend_decl && !sym->attr.function)
1762 return TREE_TYPE (sym->backend_decl);
1764 if (sym->ts.type == BT_CHARACTER
1765 && ((sym->attr.function && sym->attr.is_bind_c)
1766 || (sym->attr.result
1767 && sym->ns->proc_name
1768 && sym->ns->proc_name->attr.is_bind_c)))
1769 type = gfc_character1_type_node;
1771 type = gfc_typenode_for_spec (&sym->ts);
1773 if (sym->attr.dummy && !sym->attr.function && !sym->attr.value)
1778 restricted = !sym->attr.target && !sym->attr.pointer
1779 && !sym->attr.proc_pointer;
1780 if (sym->attr.dimension)
1782 if (gfc_is_nodesc_array (sym))
1784 /* If this is a character argument of unknown length, just use the
1786 if (sym->ts.type != BT_CHARACTER
1787 || !(sym->attr.dummy || sym->attr.function)
1788 || sym->ts.u.cl->backend_decl)
1790 type = gfc_get_nodesc_array_type (type, sym->as,
1799 enum gfc_array_kind akind = GFC_ARRAY_UNKNOWN;
1800 if (sym->attr.pointer)
1801 akind = GFC_ARRAY_POINTER;
1802 else if (sym->attr.allocatable)
1803 akind = GFC_ARRAY_ALLOCATABLE;
1804 type = gfc_build_array_type (type, sym->as, akind, restricted);
1809 if (sym->attr.allocatable || sym->attr.pointer)
1810 type = gfc_build_pointer_type (sym, type);
1811 if (sym->attr.pointer)
1812 GFC_POINTER_TYPE_P (type) = 1;
1815 /* We currently pass all parameters by reference.
1816 See f95_get_function_decl. For dummy function parameters return the
1820 /* We must use pointer types for potentially absent variables. The
1821 optimizers assume a reference type argument is never NULL. */
1822 if (sym->attr.optional || sym->ns->proc_name->attr.entry_master)
1823 type = build_pointer_type (type);
1826 type = build_reference_type (type);
1828 type = build_qualified_type (type, TYPE_QUAL_RESTRICT);
1835 /* Layout and output debug info for a record type. */
1838 gfc_finish_type (tree type)
1842 decl = build_decl (input_location,
1843 TYPE_DECL, NULL_TREE, type);
1844 TYPE_STUB_DECL (type) = decl;
1846 rest_of_type_compilation (type, 1);
1847 rest_of_decl_compilation (decl, 1, 0);
1850 /* Add a field of given NAME and TYPE to the context of a UNION_TYPE
1851 or RECORD_TYPE pointed to by STYPE. The new field is chained
1852 to the fieldlist pointed to by FIELDLIST.
1854 Returns a pointer to the new field. */
1857 gfc_add_field_to_struct (tree *fieldlist, tree context,
1858 tree name, tree type)
1862 decl = build_decl (input_location,
1863 FIELD_DECL, name, type);
1865 DECL_CONTEXT (decl) = context;
1866 DECL_INITIAL (decl) = 0;
1867 DECL_ALIGN (decl) = 0;
1868 DECL_USER_ALIGN (decl) = 0;
1869 TREE_CHAIN (decl) = NULL_TREE;
1870 *fieldlist = chainon (*fieldlist, decl);
1876 /* Copy the backend_decl and component backend_decls if
1877 the two derived type symbols are "equal", as described
1878 in 4.4.2 and resolved by gfc_compare_derived_types. */
1881 copy_dt_decls_ifequal (gfc_symbol *from, gfc_symbol *to,
1884 gfc_component *to_cm;
1885 gfc_component *from_cm;
1887 if (from->backend_decl == NULL
1888 || !gfc_compare_derived_types (from, to))
1891 to->backend_decl = from->backend_decl;
1893 to_cm = to->components;
1894 from_cm = from->components;
1896 /* Copy the component declarations. If a component is itself
1897 a derived type, we need a copy of its component declarations.
1898 This is done by recursing into gfc_get_derived_type and
1899 ensures that the component's component declarations have
1900 been built. If it is a character, we need the character
1902 for (; to_cm; to_cm = to_cm->next, from_cm = from_cm->next)
1904 to_cm->backend_decl = from_cm->backend_decl;
1905 if ((!from_cm->attr.pointer || from_gsym)
1906 && from_cm->ts.type == BT_DERIVED)
1907 gfc_get_derived_type (to_cm->ts.u.derived);
1909 else if (from_cm->ts.type == BT_CHARACTER)
1910 to_cm->ts.u.cl->backend_decl = from_cm->ts.u.cl->backend_decl;
1917 /* Build a tree node for a procedure pointer component. */
1920 gfc_get_ppc_type (gfc_component* c)
1924 /* Explicit interface. */
1925 if (c->attr.if_source != IFSRC_UNKNOWN && c->ts.interface)
1926 return build_pointer_type (gfc_get_function_type (c->ts.interface));
1928 /* Implicit interface (only return value may be known). */
1929 if (c->attr.function && !c->attr.dimension && c->ts.type != BT_CHARACTER)
1930 t = gfc_typenode_for_spec (&c->ts);
1934 return build_pointer_type (build_function_type (t, NULL_TREE));
1938 /* Build a tree node for a derived type. If there are equal
1939 derived types, with different local names, these are built
1940 at the same time. If an equal derived type has been built
1941 in a parent namespace, this is used. */
1944 gfc_get_derived_type (gfc_symbol * derived)
1946 tree typenode = NULL, field = NULL, field_type = NULL, fieldlist = NULL;
1947 tree canonical = NULL_TREE;
1948 bool got_canonical = false;
1954 gcc_assert (derived && derived->attr.flavor == FL_DERIVED);
1956 /* See if it's one of the iso_c_binding derived types. */
1957 if (derived->attr.is_iso_c == 1)
1959 if (derived->backend_decl)
1960 return derived->backend_decl;
1962 if (derived->intmod_sym_id == ISOCBINDING_PTR)
1963 derived->backend_decl = ptr_type_node;
1965 derived->backend_decl = pfunc_type_node;
1967 /* Create a backend_decl for the __c_ptr_c_address field. */
1968 derived->components->backend_decl =
1969 gfc_add_field_to_struct (&(derived->backend_decl->type.values),
1970 derived->backend_decl,
1971 get_identifier (derived->components->name),
1972 gfc_typenode_for_spec (
1973 &(derived->components->ts)));
1975 derived->ts.kind = gfc_index_integer_kind;
1976 derived->ts.type = BT_INTEGER;
1977 /* Set the f90_type to BT_VOID as a way to recognize something of type
1978 BT_INTEGER that needs to fit a void * for the purpose of the
1979 iso_c_binding derived types. */
1980 derived->ts.f90_type = BT_VOID;
1982 return derived->backend_decl;
1985 /* If use associated, use the module type for this one. */
1986 if (gfc_option.flag_whole_file
1987 && derived->backend_decl == NULL
1988 && derived->attr.use_assoc
1991 gsym = gfc_find_gsymbol (gfc_gsym_root, derived->module);
1992 if (gsym && gsym->ns && gsym->type == GSYM_MODULE)
1996 gfc_find_symbol (derived->name, gsym->ns, 0, &s);
1997 if (s && s->backend_decl)
1999 copy_dt_decls_ifequal (s, derived, true);
2000 goto copy_derived_types;
2005 /* If a whole file compilation, the derived types from an earlier
2006 namespace can be used as the the canonical type. */
2007 if (gfc_option.flag_whole_file
2008 && derived->backend_decl == NULL
2009 && !derived->attr.use_assoc
2010 && gfc_global_ns_list)
2012 for (ns = gfc_global_ns_list;
2013 ns->translated && !got_canonical;
2016 dt = ns->derived_types;
2017 for (; dt && !canonical; dt = dt->next)
2019 copy_dt_decls_ifequal (dt->derived, derived, true);
2020 if (derived->backend_decl)
2021 got_canonical = true;
2026 /* Store up the canonical type to be added to this one. */
2029 if (TYPE_CANONICAL (derived->backend_decl))
2030 canonical = TYPE_CANONICAL (derived->backend_decl);
2032 canonical = derived->backend_decl;
2034 derived->backend_decl = NULL_TREE;
2037 /* derived->backend_decl != 0 means we saw it before, but its
2038 components' backend_decl may have not been built. */
2039 if (derived->backend_decl)
2041 /* Its components' backend_decl have been built or we are
2042 seeing recursion through the formal arglist of a procedure
2043 pointer component. */
2044 if (TYPE_FIELDS (derived->backend_decl)
2045 || derived->attr.proc_pointer_comp)
2046 return derived->backend_decl;
2048 typenode = derived->backend_decl;
2052 /* We see this derived type first time, so build the type node. */
2053 typenode = make_node (RECORD_TYPE);
2054 TYPE_NAME (typenode) = get_identifier (derived->name);
2055 TYPE_PACKED (typenode) = gfc_option.flag_pack_derived;
2056 derived->backend_decl = typenode;
2059 /* Go through the derived type components, building them as
2060 necessary. The reason for doing this now is that it is
2061 possible to recurse back to this derived type through a
2062 pointer component (PR24092). If this happens, the fields
2063 will be built and so we can return the type. */
2064 for (c = derived->components; c; c = c->next)
2066 if (c->ts.type != BT_DERIVED)
2069 if ((!c->attr.pointer && !c->attr.proc_pointer)
2070 || c->ts.u.derived->backend_decl == NULL)
2071 c->ts.u.derived->backend_decl = gfc_get_derived_type (c->ts.u.derived);
2073 if (c->ts.u.derived && c->ts.u.derived->attr.is_iso_c)
2075 /* Need to copy the modified ts from the derived type. The
2076 typespec was modified because C_PTR/C_FUNPTR are translated
2077 into (void *) from derived types. */
2078 c->ts.type = c->ts.u.derived->ts.type;
2079 c->ts.kind = c->ts.u.derived->ts.kind;
2080 c->ts.f90_type = c->ts.u.derived->ts.f90_type;
2083 c->initializer->ts.type = c->ts.type;
2084 c->initializer->ts.kind = c->ts.kind;
2085 c->initializer->ts.f90_type = c->ts.f90_type;
2086 c->initializer->expr_type = EXPR_NULL;
2091 if (TYPE_FIELDS (derived->backend_decl))
2092 return derived->backend_decl;
2094 /* Build the type member list. Install the newly created RECORD_TYPE
2095 node as DECL_CONTEXT of each FIELD_DECL. */
2096 fieldlist = NULL_TREE;
2097 for (c = derived->components; c; c = c->next)
2099 if (c->attr.proc_pointer)
2100 field_type = gfc_get_ppc_type (c);
2101 else if (c->ts.type == BT_DERIVED)
2102 field_type = c->ts.u.derived->backend_decl;
2105 if (c->ts.type == BT_CHARACTER)
2107 /* Evaluate the string length. */
2108 gfc_conv_const_charlen (c->ts.u.cl);
2109 gcc_assert (c->ts.u.cl->backend_decl);
2112 field_type = gfc_typenode_for_spec (&c->ts);
2115 /* This returns an array descriptor type. Initialization may be
2117 if (c->attr.dimension && !c->attr.proc_pointer)
2119 if (c->attr.pointer || c->attr.allocatable)
2121 enum gfc_array_kind akind;
2122 if (c->attr.pointer)
2123 akind = GFC_ARRAY_POINTER;
2125 akind = GFC_ARRAY_ALLOCATABLE;
2126 /* Pointers to arrays aren't actually pointer types. The
2127 descriptors are separate, but the data is common. */
2128 field_type = gfc_build_array_type (field_type, c->as, akind,
2130 && !c->attr.pointer);
2133 field_type = gfc_get_nodesc_array_type (field_type, c->as,
2137 else if (c->attr.pointer)
2138 field_type = build_pointer_type (field_type);
2140 field = gfc_add_field_to_struct (&fieldlist, typenode,
2141 get_identifier (c->name),
2144 gfc_set_decl_location (field, &c->loc);
2145 else if (derived->declared_at.lb)
2146 gfc_set_decl_location (field, &derived->declared_at);
2148 DECL_PACKED (field) |= TYPE_PACKED (typenode);
2151 if (!c->backend_decl)
2152 c->backend_decl = field;
2155 /* Now we have the final fieldlist. Record it, then lay out the
2156 derived type, including the fields. */
2157 TYPE_FIELDS (typenode) = fieldlist;
2159 TYPE_CANONICAL (typenode) = canonical;
2161 gfc_finish_type (typenode);
2162 gfc_set_decl_location (TYPE_STUB_DECL (typenode), &derived->declared_at);
2163 if (derived->module && derived->ns->proc_name
2164 && derived->ns->proc_name->attr.flavor == FL_MODULE)
2166 if (derived->ns->proc_name->backend_decl
2167 && TREE_CODE (derived->ns->proc_name->backend_decl)
2170 TYPE_CONTEXT (typenode) = derived->ns->proc_name->backend_decl;
2171 DECL_CONTEXT (TYPE_STUB_DECL (typenode))
2172 = derived->ns->proc_name->backend_decl;
2176 derived->backend_decl = typenode;
2180 for (dt = gfc_derived_types; dt; dt = dt->next)
2181 copy_dt_decls_ifequal (derived, dt->derived, false);
2183 return derived->backend_decl;
2188 gfc_return_by_reference (gfc_symbol * sym)
2190 if (!sym->attr.function)
2193 if (sym->attr.dimension)
2196 if (sym->ts.type == BT_CHARACTER
2197 && !sym->attr.is_bind_c
2198 && (!sym->attr.result
2199 || !sym->ns->proc_name
2200 || !sym->ns->proc_name->attr.is_bind_c))
2203 /* Possibly return complex numbers by reference for g77 compatibility.
2204 We don't do this for calls to intrinsics (as the library uses the
2205 -fno-f2c calling convention), nor for calls to functions which always
2206 require an explicit interface, as no compatibility problems can
2208 if (gfc_option.flag_f2c
2209 && sym->ts.type == BT_COMPLEX
2210 && !sym->attr.intrinsic && !sym->attr.always_explicit)
2217 gfc_get_mixed_entry_union (gfc_namespace *ns)
2222 char name[GFC_MAX_SYMBOL_LEN + 1];
2223 gfc_entry_list *el, *el2;
2225 gcc_assert (ns->proc_name->attr.mixed_entry_master);
2226 gcc_assert (memcmp (ns->proc_name->name, "master.", 7) == 0);
2228 snprintf (name, GFC_MAX_SYMBOL_LEN, "munion.%s", ns->proc_name->name + 7);
2230 /* Build the type node. */
2231 type = make_node (UNION_TYPE);
2233 TYPE_NAME (type) = get_identifier (name);
2236 for (el = ns->entries; el; el = el->next)
2238 /* Search for duplicates. */
2239 for (el2 = ns->entries; el2 != el; el2 = el2->next)
2240 if (el2->sym->result == el->sym->result)
2245 decl = build_decl (input_location,
2247 get_identifier (el->sym->result->name),
2248 gfc_sym_type (el->sym->result));
2249 DECL_CONTEXT (decl) = type;
2250 fieldlist = chainon (fieldlist, decl);
2254 /* Finish off the type. */
2255 TYPE_FIELDS (type) = fieldlist;
2257 gfc_finish_type (type);
2258 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type)) = 1;
2263 gfc_get_function_type (gfc_symbol * sym)
2267 gfc_formal_arglist *f;
2270 int alternate_return;
2272 /* Make sure this symbol is a function, a subroutine or the main
2274 gcc_assert (sym->attr.flavor == FL_PROCEDURE
2275 || sym->attr.flavor == FL_PROGRAM);
2277 if (sym->backend_decl)
2278 return TREE_TYPE (sym->backend_decl);
2281 alternate_return = 0;
2282 typelist = NULL_TREE;
2284 if (sym->attr.entry_master)
2286 /* Additional parameter for selecting an entry point. */
2287 typelist = gfc_chainon_list (typelist, gfc_array_index_type);
2295 if (arg->ts.type == BT_CHARACTER)
2296 gfc_conv_const_charlen (arg->ts.u.cl);
2298 /* Some functions we use an extra parameter for the return value. */
2299 if (gfc_return_by_reference (sym))
2301 type = gfc_sym_type (arg);
2302 if (arg->ts.type == BT_COMPLEX
2303 || arg->attr.dimension
2304 || arg->ts.type == BT_CHARACTER)
2305 type = build_reference_type (type);
2307 typelist = gfc_chainon_list (typelist, type);
2308 if (arg->ts.type == BT_CHARACTER)
2309 typelist = gfc_chainon_list (typelist, gfc_charlen_type_node);
2312 /* Build the argument types for the function. */
2313 for (f = sym->formal; f; f = f->next)
2318 /* Evaluate constant character lengths here so that they can be
2319 included in the type. */
2320 if (arg->ts.type == BT_CHARACTER)
2321 gfc_conv_const_charlen (arg->ts.u.cl);
2323 if (arg->attr.flavor == FL_PROCEDURE)
2325 type = gfc_get_function_type (arg);
2326 type = build_pointer_type (type);
2329 type = gfc_sym_type (arg);
2331 /* Parameter Passing Convention
2333 We currently pass all parameters by reference.
2334 Parameters with INTENT(IN) could be passed by value.
2335 The problem arises if a function is called via an implicit
2336 prototype. In this situation the INTENT is not known.
2337 For this reason all parameters to global functions must be
2338 passed by reference. Passing by value would potentially
2339 generate bad code. Worse there would be no way of telling that
2340 this code was bad, except that it would give incorrect results.
2342 Contained procedures could pass by value as these are never
2343 used without an explicit interface, and cannot be passed as
2344 actual parameters for a dummy procedure. */
2345 if (arg->ts.type == BT_CHARACTER && !sym->attr.is_bind_c)
2347 typelist = gfc_chainon_list (typelist, type);
2351 if (sym->attr.subroutine)
2352 alternate_return = 1;
2356 /* Add hidden string length parameters. */
2358 typelist = gfc_chainon_list (typelist, gfc_charlen_type_node);
2361 typelist = gfc_chainon_list (typelist, void_type_node);
2363 if (alternate_return)
2364 type = integer_type_node;
2365 else if (!sym->attr.function || gfc_return_by_reference (sym))
2366 type = void_type_node;
2367 else if (sym->attr.mixed_entry_master)
2368 type = gfc_get_mixed_entry_union (sym->ns);
2369 else if (gfc_option.flag_f2c
2370 && sym->ts.type == BT_REAL
2371 && sym->ts.kind == gfc_default_real_kind
2372 && !sym->attr.always_explicit)
2374 /* Special case: f2c calling conventions require that (scalar)
2375 default REAL functions return the C type double instead. f2c
2376 compatibility is only an issue with functions that don't
2377 require an explicit interface, as only these could be
2378 implemented in Fortran 77. */
2379 sym->ts.kind = gfc_default_double_kind;
2380 type = gfc_typenode_for_spec (&sym->ts);
2381 sym->ts.kind = gfc_default_real_kind;
2383 else if (sym->result && sym->result->attr.proc_pointer)
2384 /* Procedure pointer return values. */
2386 if (sym->result->attr.result && strcmp (sym->name,"ppr@") != 0)
2388 /* Unset proc_pointer as gfc_get_function_type
2389 is called recursively. */
2390 sym->result->attr.proc_pointer = 0;
2391 type = build_pointer_type (gfc_get_function_type (sym->result));
2392 sym->result->attr.proc_pointer = 1;
2395 type = gfc_sym_type (sym->result);
2398 type = gfc_sym_type (sym);
2400 type = build_function_type (type, typelist);
2405 /* Language hooks for middle-end access to type nodes. */
2407 /* Return an integer type with BITS bits of precision,
2408 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2411 gfc_type_for_size (unsigned bits, int unsignedp)
2416 for (i = 0; i <= MAX_INT_KINDS; ++i)
2418 tree type = gfc_integer_types[i];
2419 if (type && bits == TYPE_PRECISION (type))
2423 /* Handle TImode as a special case because it is used by some backends
2424 (e.g. ARM) even though it is not available for normal use. */
2425 #if HOST_BITS_PER_WIDE_INT >= 64
2426 if (bits == TYPE_PRECISION (intTI_type_node))
2427 return intTI_type_node;
2432 if (bits == TYPE_PRECISION (unsigned_intQI_type_node))
2433 return unsigned_intQI_type_node;
2434 if (bits == TYPE_PRECISION (unsigned_intHI_type_node))
2435 return unsigned_intHI_type_node;
2436 if (bits == TYPE_PRECISION (unsigned_intSI_type_node))
2437 return unsigned_intSI_type_node;
2438 if (bits == TYPE_PRECISION (unsigned_intDI_type_node))
2439 return unsigned_intDI_type_node;
2440 if (bits == TYPE_PRECISION (unsigned_intTI_type_node))
2441 return unsigned_intTI_type_node;
2447 /* Return a data type that has machine mode MODE. If the mode is an
2448 integer, then UNSIGNEDP selects between signed and unsigned types. */
2451 gfc_type_for_mode (enum machine_mode mode, int unsignedp)
2456 if (GET_MODE_CLASS (mode) == MODE_FLOAT)
2457 base = gfc_real_types;
2458 else if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT)
2459 base = gfc_complex_types;
2460 else if (SCALAR_INT_MODE_P (mode))
2461 return gfc_type_for_size (GET_MODE_PRECISION (mode), unsignedp);
2462 else if (VECTOR_MODE_P (mode))
2464 enum machine_mode inner_mode = GET_MODE_INNER (mode);
2465 tree inner_type = gfc_type_for_mode (inner_mode, unsignedp);
2466 if (inner_type != NULL_TREE)
2467 return build_vector_type_for_mode (inner_type, mode);
2473 for (i = 0; i <= MAX_REAL_KINDS; ++i)
2475 tree type = base[i];
2476 if (type && mode == TYPE_MODE (type))
2483 /* Return TRUE if TYPE is a type with a hidden descriptor, fill in INFO
2487 gfc_get_array_descr_info (const_tree type, struct array_descr_info *info)
2490 bool indirect = false;
2491 tree etype, ptype, field, t, base_decl;
2492 tree data_off, offset_off, dim_off, dim_size, elem_size;
2493 tree lower_suboff, upper_suboff, stride_suboff;
2495 if (! GFC_DESCRIPTOR_TYPE_P (type))
2497 if (! POINTER_TYPE_P (type))
2499 type = TREE_TYPE (type);
2500 if (! GFC_DESCRIPTOR_TYPE_P (type))
2505 rank = GFC_TYPE_ARRAY_RANK (type);
2506 if (rank >= (int) (sizeof (info->dimen) / sizeof (info->dimen[0])))
2509 etype = GFC_TYPE_ARRAY_DATAPTR_TYPE (type);
2510 gcc_assert (POINTER_TYPE_P (etype));
2511 etype = TREE_TYPE (etype);
2512 gcc_assert (TREE_CODE (etype) == ARRAY_TYPE);
2513 etype = TREE_TYPE (etype);
2514 /* Can't handle variable sized elements yet. */
2515 if (int_size_in_bytes (etype) <= 0)
2517 /* Nor non-constant lower bounds in assumed shape arrays. */
2518 if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE)
2520 for (dim = 0; dim < rank; dim++)
2521 if (GFC_TYPE_ARRAY_LBOUND (type, dim) == NULL_TREE
2522 || TREE_CODE (GFC_TYPE_ARRAY_LBOUND (type, dim)) != INTEGER_CST)
2526 memset (info, '\0', sizeof (*info));
2527 info->ndimensions = rank;
2528 info->element_type = etype;
2529 ptype = build_pointer_type (gfc_array_index_type);
2530 base_decl = GFC_TYPE_ARRAY_BASE_DECL (type, indirect);
2533 base_decl = build_decl (input_location, VAR_DECL, NULL_TREE,
2534 indirect ? build_pointer_type (ptype) : ptype);
2535 GFC_TYPE_ARRAY_BASE_DECL (type, indirect) = base_decl;
2537 info->base_decl = base_decl;
2539 base_decl = build1 (INDIRECT_REF, ptype, base_decl);
2541 if (GFC_TYPE_ARRAY_SPAN (type))
2542 elem_size = GFC_TYPE_ARRAY_SPAN (type);
2544 elem_size = fold_convert (gfc_array_index_type, TYPE_SIZE_UNIT (etype));
2545 field = TYPE_FIELDS (TYPE_MAIN_VARIANT (type));
2546 data_off = byte_position (field);
2547 field = TREE_CHAIN (field);
2548 offset_off = byte_position (field);
2549 field = TREE_CHAIN (field);
2550 field = TREE_CHAIN (field);
2551 dim_off = byte_position (field);
2552 dim_size = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (field)));
2553 field = TYPE_FIELDS (TREE_TYPE (TREE_TYPE (field)));
2554 stride_suboff = byte_position (field);
2555 field = TREE_CHAIN (field);
2556 lower_suboff = byte_position (field);
2557 field = TREE_CHAIN (field);
2558 upper_suboff = byte_position (field);
2561 if (!integer_zerop (data_off))
2562 t = build2 (POINTER_PLUS_EXPR, ptype, t, data_off);
2563 t = build1 (NOP_EXPR, build_pointer_type (ptr_type_node), t);
2564 info->data_location = build1 (INDIRECT_REF, ptr_type_node, t);
2565 if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ALLOCATABLE)
2566 info->allocated = build2 (NE_EXPR, boolean_type_node,
2567 info->data_location, null_pointer_node);
2568 else if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_POINTER)
2569 info->associated = build2 (NE_EXPR, boolean_type_node,
2570 info->data_location, null_pointer_node);
2572 for (dim = 0; dim < rank; dim++)
2574 t = build2 (POINTER_PLUS_EXPR, ptype, base_decl,
2575 size_binop (PLUS_EXPR, dim_off, lower_suboff));
2576 t = build1 (INDIRECT_REF, gfc_array_index_type, t);
2577 info->dimen[dim].lower_bound = t;
2578 t = build2 (POINTER_PLUS_EXPR, ptype, base_decl,
2579 size_binop (PLUS_EXPR, dim_off, upper_suboff));
2580 t = build1 (INDIRECT_REF, gfc_array_index_type, t);
2581 info->dimen[dim].upper_bound = t;
2582 if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE)
2584 /* Assumed shape arrays have known lower bounds. */
2585 info->dimen[dim].upper_bound
2586 = build2 (MINUS_EXPR, gfc_array_index_type,
2587 info->dimen[dim].upper_bound,
2588 info->dimen[dim].lower_bound);
2589 info->dimen[dim].lower_bound
2590 = fold_convert (gfc_array_index_type,
2591 GFC_TYPE_ARRAY_LBOUND (type, dim));
2592 info->dimen[dim].upper_bound
2593 = build2 (PLUS_EXPR, gfc_array_index_type,
2594 info->dimen[dim].lower_bound,
2595 info->dimen[dim].upper_bound);
2597 t = build2 (POINTER_PLUS_EXPR, ptype, base_decl,
2598 size_binop (PLUS_EXPR, dim_off, stride_suboff));
2599 t = build1 (INDIRECT_REF, gfc_array_index_type, t);
2600 t = build2 (MULT_EXPR, gfc_array_index_type, t, elem_size);
2601 info->dimen[dim].stride = t;
2602 dim_off = size_binop (PLUS_EXPR, dim_off, dim_size);
2608 #include "gt-fortran-trans-types.h"