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 ppvoid_type_node;
66 tree gfc_charlen_type_node;
68 static GTY(()) tree gfc_desc_dim_type;
69 static GTY(()) tree gfc_max_array_element_size;
70 static GTY(()) tree gfc_array_descriptor_base[GFC_MAX_DIMENSIONS];
72 /* Arrays for all integral and real kinds. We'll fill this in at runtime
73 after the target has a chance to process command-line options. */
75 #define MAX_INT_KINDS 5
76 gfc_integer_info gfc_integer_kinds[MAX_INT_KINDS + 1];
77 gfc_logical_info gfc_logical_kinds[MAX_INT_KINDS + 1];
78 static GTY(()) tree gfc_integer_types[MAX_INT_KINDS + 1];
79 static GTY(()) tree gfc_logical_types[MAX_INT_KINDS + 1];
81 #define MAX_REAL_KINDS 5
82 gfc_real_info gfc_real_kinds[MAX_REAL_KINDS + 1];
83 static GTY(()) tree gfc_real_types[MAX_REAL_KINDS + 1];
84 static GTY(()) tree gfc_complex_types[MAX_REAL_KINDS + 1];
86 #define MAX_CHARACTER_KINDS 2
87 gfc_character_info gfc_character_kinds[MAX_CHARACTER_KINDS + 1];
88 static GTY(()) tree gfc_character_types[MAX_CHARACTER_KINDS + 1];
89 static GTY(()) tree gfc_pcharacter_types[MAX_CHARACTER_KINDS + 1];
92 /* The integer kind to use for array indices. This will be set to the
93 proper value based on target information from the backend. */
95 int gfc_index_integer_kind;
97 /* The default kinds of the various types. */
99 int gfc_default_integer_kind;
100 int gfc_max_integer_kind;
101 int gfc_default_real_kind;
102 int gfc_default_double_kind;
103 int gfc_default_character_kind;
104 int gfc_default_logical_kind;
105 int gfc_default_complex_kind;
108 /* The kind size used for record offsets. If the target system supports
109 kind=8, this will be set to 8, otherwise it is set to 4. */
112 /* The integer kind used to store character lengths. */
113 int gfc_charlen_int_kind;
115 /* The size of the numeric storage unit and character storage unit. */
116 int gfc_numeric_storage_size;
117 int gfc_character_storage_size;
121 gfc_check_any_c_kind (gfc_typespec *ts)
125 for (i = 0; i < ISOCBINDING_NUMBER; i++)
127 /* Check for any C interoperable kind for the given type/kind in ts.
128 This can be used after verify_c_interop to make sure that the
129 Fortran kind being used exists in at least some form for C. */
130 if (c_interop_kinds_table[i].f90_type == ts->type &&
131 c_interop_kinds_table[i].value == ts->kind)
140 get_real_kind_from_node (tree type)
144 for (i = 0; gfc_real_kinds[i].kind != 0; i++)
145 if (gfc_real_kinds[i].mode_precision == TYPE_PRECISION (type))
146 return gfc_real_kinds[i].kind;
152 get_int_kind_from_node (tree type)
159 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
160 if (gfc_integer_kinds[i].bit_size == TYPE_PRECISION (type))
161 return gfc_integer_kinds[i].kind;
166 /* Return a typenode for the "standard" C type with a given name. */
168 get_typenode_from_name (const char *name)
170 if (name == NULL || *name == '\0')
173 if (strcmp (name, "char") == 0)
174 return char_type_node;
175 if (strcmp (name, "unsigned char") == 0)
176 return unsigned_char_type_node;
177 if (strcmp (name, "signed char") == 0)
178 return signed_char_type_node;
180 if (strcmp (name, "short int") == 0)
181 return short_integer_type_node;
182 if (strcmp (name, "short unsigned int") == 0)
183 return short_unsigned_type_node;
185 if (strcmp (name, "int") == 0)
186 return integer_type_node;
187 if (strcmp (name, "unsigned int") == 0)
188 return unsigned_type_node;
190 if (strcmp (name, "long int") == 0)
191 return long_integer_type_node;
192 if (strcmp (name, "long unsigned int") == 0)
193 return long_unsigned_type_node;
195 if (strcmp (name, "long long int") == 0)
196 return long_long_integer_type_node;
197 if (strcmp (name, "long long unsigned int") == 0)
198 return long_long_unsigned_type_node;
204 get_int_kind_from_name (const char *name)
206 return get_int_kind_from_node (get_typenode_from_name (name));
210 /* Get the kind number corresponding to an integer of given size,
211 following the required return values for ISO_FORTRAN_ENV INT* constants:
212 -2 is returned if we support a kind of larger size, -1 otherwise. */
214 gfc_get_int_kind_from_width_isofortranenv (int size)
218 /* Look for a kind with matching storage size. */
219 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
220 if (gfc_integer_kinds[i].bit_size == size)
221 return gfc_integer_kinds[i].kind;
223 /* Look for a kind with larger storage size. */
224 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
225 if (gfc_integer_kinds[i].bit_size > size)
231 /* Get the kind number corresponding to a real of given storage size,
232 following the required return values for ISO_FORTRAN_ENV REAL* constants:
233 -2 is returned if we support a kind of larger size, -1 otherwise. */
235 gfc_get_real_kind_from_width_isofortranenv (int size)
241 /* Look for a kind with matching storage size. */
242 for (i = 0; gfc_real_kinds[i].kind != 0; i++)
243 if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) == size)
244 return gfc_real_kinds[i].kind;
246 /* Look for a kind with larger storage size. */
247 for (i = 0; gfc_real_kinds[i].kind != 0; i++)
248 if (int_size_in_bytes (gfc_get_real_type (gfc_real_kinds[i].kind)) > size)
257 get_int_kind_from_width (int size)
261 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
262 if (gfc_integer_kinds[i].bit_size == size)
263 return gfc_integer_kinds[i].kind;
269 get_int_kind_from_minimal_width (int size)
273 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
274 if (gfc_integer_kinds[i].bit_size >= size)
275 return gfc_integer_kinds[i].kind;
281 /* Generate the CInteropKind_t objects for the C interoperable
285 void init_c_interop_kinds (void)
289 /* init all pointers in the list to NULL */
290 for (i = 0; i < ISOCBINDING_NUMBER; i++)
292 /* Initialize the name and value fields. */
293 c_interop_kinds_table[i].name[0] = '\0';
294 c_interop_kinds_table[i].value = -100;
295 c_interop_kinds_table[i].f90_type = BT_UNKNOWN;
298 #define NAMED_INTCST(a,b,c,d) \
299 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
300 c_interop_kinds_table[a].f90_type = BT_INTEGER; \
301 c_interop_kinds_table[a].value = c;
302 #define NAMED_REALCST(a,b,c) \
303 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
304 c_interop_kinds_table[a].f90_type = BT_REAL; \
305 c_interop_kinds_table[a].value = c;
306 #define NAMED_CMPXCST(a,b,c) \
307 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
308 c_interop_kinds_table[a].f90_type = BT_COMPLEX; \
309 c_interop_kinds_table[a].value = c;
310 #define NAMED_LOGCST(a,b,c) \
311 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
312 c_interop_kinds_table[a].f90_type = BT_LOGICAL; \
313 c_interop_kinds_table[a].value = c;
314 #define NAMED_CHARKNDCST(a,b,c) \
315 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
316 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
317 c_interop_kinds_table[a].value = c;
318 #define NAMED_CHARCST(a,b,c) \
319 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
320 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
321 c_interop_kinds_table[a].value = c;
322 #define DERIVED_TYPE(a,b,c) \
323 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
324 c_interop_kinds_table[a].f90_type = BT_DERIVED; \
325 c_interop_kinds_table[a].value = c;
326 #define PROCEDURE(a,b) \
327 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
328 c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
329 c_interop_kinds_table[a].value = 0;
330 #include "iso-c-binding.def"
334 /* Query the target to determine which machine modes are available for
335 computation. Choose KIND numbers for them. */
338 gfc_init_kinds (void)
341 int i_index, r_index, kind;
342 bool saw_i4 = false, saw_i8 = false;
343 bool saw_r4 = false, saw_r8 = false, saw_r16 = false;
345 for (i_index = 0, mode = MIN_MODE_INT; mode <= MAX_MODE_INT; mode++)
349 if (!targetm.scalar_mode_supported_p ((enum machine_mode) mode))
352 /* The middle end doesn't support constants larger than 2*HWI.
353 Perhaps the target hook shouldn't have accepted these either,
354 but just to be safe... */
355 bitsize = GET_MODE_BITSIZE (mode);
356 if (bitsize > 2*HOST_BITS_PER_WIDE_INT)
359 gcc_assert (i_index != MAX_INT_KINDS);
361 /* Let the kind equal the bit size divided by 8. This insulates the
362 programmer from the underlying byte size. */
370 gfc_integer_kinds[i_index].kind = kind;
371 gfc_integer_kinds[i_index].radix = 2;
372 gfc_integer_kinds[i_index].digits = bitsize - 1;
373 gfc_integer_kinds[i_index].bit_size = bitsize;
375 gfc_logical_kinds[i_index].kind = kind;
376 gfc_logical_kinds[i_index].bit_size = bitsize;
381 /* Set the kind used to match GFC_INT_IO in libgfortran. This is
382 used for large file access. */
389 /* If we do not at least have kind = 4, everything is pointless. */
392 /* Set the maximum integer kind. Used with at least BOZ constants. */
393 gfc_max_integer_kind = gfc_integer_kinds[i_index - 1].kind;
395 for (r_index = 0, mode = MIN_MODE_FLOAT; mode <= MAX_MODE_FLOAT; mode++)
397 const struct real_format *fmt =
398 REAL_MODE_FORMAT ((enum machine_mode) mode);
403 if (!targetm.scalar_mode_supported_p ((enum machine_mode) mode))
406 /* Only let float/double/long double go through because the fortran
407 library assumes these are the only floating point types. */
409 if (mode != TYPE_MODE (float_type_node)
410 && (mode != TYPE_MODE (double_type_node))
411 && (mode != TYPE_MODE (long_double_type_node)))
414 /* Let the kind equal the precision divided by 8, rounding up. Again,
415 this insulates the programmer from the underlying byte size.
417 Also, it effectively deals with IEEE extended formats. There, the
418 total size of the type may equal 16, but it's got 6 bytes of padding
419 and the increased size can get in the way of a real IEEE quad format
420 which may also be supported by the target.
422 We round up so as to handle IA-64 __floatreg (RFmode), which is an
423 82 bit type. Not to be confused with __float80 (XFmode), which is
424 an 80 bit type also supported by IA-64. So XFmode should come out
425 to be kind=10, and RFmode should come out to be kind=11. Egads. */
427 kind = (GET_MODE_PRECISION (mode) + 7) / 8;
436 /* Careful we don't stumble a weird internal mode. */
437 gcc_assert (r_index <= 0 || gfc_real_kinds[r_index-1].kind != kind);
438 /* Or have too many modes for the allocated space. */
439 gcc_assert (r_index != MAX_REAL_KINDS);
441 gfc_real_kinds[r_index].kind = kind;
442 gfc_real_kinds[r_index].radix = fmt->b;
443 gfc_real_kinds[r_index].digits = fmt->p;
444 gfc_real_kinds[r_index].min_exponent = fmt->emin;
445 gfc_real_kinds[r_index].max_exponent = fmt->emax;
446 if (fmt->pnan < fmt->p)
447 /* This is an IBM extended double format (or the MIPS variant)
448 made up of two IEEE doubles. The value of the long double is
449 the sum of the values of the two parts. The most significant
450 part is required to be the value of the long double rounded
451 to the nearest double. If we use emax of 1024 then we can't
452 represent huge(x) = (1 - b**(-p)) * b**(emax-1) * b, because
453 rounding will make the most significant part overflow. */
454 gfc_real_kinds[r_index].max_exponent = fmt->emax - 1;
455 gfc_real_kinds[r_index].mode_precision = GET_MODE_PRECISION (mode);
459 /* Choose the default integer kind. We choose 4 unless the user
460 directs us otherwise. */
461 if (gfc_option.flag_default_integer)
464 fatal_error ("integer kind=8 not available for -fdefault-integer-8 option");
465 gfc_default_integer_kind = 8;
467 /* Even if the user specified that the default integer kind be 8,
468 the numeric storage size isn't 64. In this case, a warning will
469 be issued when NUMERIC_STORAGE_SIZE is used. */
470 gfc_numeric_storage_size = 4 * 8;
474 gfc_default_integer_kind = 4;
475 gfc_numeric_storage_size = 4 * 8;
479 gfc_default_integer_kind = gfc_integer_kinds[i_index - 1].kind;
480 gfc_numeric_storage_size = gfc_integer_kinds[i_index - 1].bit_size;
483 /* Choose the default real kind. Again, we choose 4 when possible. */
484 if (gfc_option.flag_default_real)
487 fatal_error ("real kind=8 not available for -fdefault-real-8 option");
488 gfc_default_real_kind = 8;
491 gfc_default_real_kind = 4;
493 gfc_default_real_kind = gfc_real_kinds[0].kind;
495 /* Choose the default double kind. If -fdefault-real and -fdefault-double
496 are specified, we use kind=8, if it's available. If -fdefault-real is
497 specified without -fdefault-double, we use kind=16, if it's available.
498 Otherwise we do not change anything. */
499 if (gfc_option.flag_default_double && !gfc_option.flag_default_real)
500 fatal_error ("Use of -fdefault-double-8 requires -fdefault-real-8");
502 if (gfc_option.flag_default_real && gfc_option.flag_default_double && saw_r8)
503 gfc_default_double_kind = 8;
504 else if (gfc_option.flag_default_real && saw_r16)
505 gfc_default_double_kind = 16;
506 else if (saw_r4 && saw_r8)
507 gfc_default_double_kind = 8;
510 /* F95 14.6.3.1: A nonpointer scalar object of type double precision
511 real ... occupies two contiguous numeric storage units.
513 Therefore we must be supplied a kind twice as large as we chose
514 for single precision. There are loopholes, in that double
515 precision must *occupy* two storage units, though it doesn't have
516 to *use* two storage units. Which means that you can make this
517 kind artificially wide by padding it. But at present there are
518 no GCC targets for which a two-word type does not exist, so we
519 just let gfc_validate_kind abort and tell us if something breaks. */
521 gfc_default_double_kind
522 = gfc_validate_kind (BT_REAL, gfc_default_real_kind * 2, false);
525 /* The default logical kind is constrained to be the same as the
526 default integer kind. Similarly with complex and real. */
527 gfc_default_logical_kind = gfc_default_integer_kind;
528 gfc_default_complex_kind = gfc_default_real_kind;
530 /* We only have two character kinds: ASCII and UCS-4.
531 ASCII corresponds to a 8-bit integer type, if one is available.
532 UCS-4 corresponds to a 32-bit integer type, if one is available. */
534 if ((kind = get_int_kind_from_width (8)) > 0)
536 gfc_character_kinds[i_index].kind = kind;
537 gfc_character_kinds[i_index].bit_size = 8;
538 gfc_character_kinds[i_index].name = "ascii";
541 if ((kind = get_int_kind_from_width (32)) > 0)
543 gfc_character_kinds[i_index].kind = kind;
544 gfc_character_kinds[i_index].bit_size = 32;
545 gfc_character_kinds[i_index].name = "iso_10646";
549 /* Choose the smallest integer kind for our default character. */
550 gfc_default_character_kind = gfc_character_kinds[0].kind;
551 gfc_character_storage_size = gfc_default_character_kind * 8;
553 /* Choose the integer kind the same size as "void*" for our index kind. */
554 gfc_index_integer_kind = POINTER_SIZE / 8;
555 /* Pick a kind the same size as the C "int" type. */
556 gfc_c_int_kind = INT_TYPE_SIZE / 8;
558 /* initialize the C interoperable kinds */
559 init_c_interop_kinds();
562 /* Make sure that a valid kind is present. Returns an index into the
563 associated kinds array, -1 if the kind is not present. */
566 validate_integer (int kind)
570 for (i = 0; gfc_integer_kinds[i].kind != 0; i++)
571 if (gfc_integer_kinds[i].kind == kind)
578 validate_real (int kind)
582 for (i = 0; gfc_real_kinds[i].kind != 0; i++)
583 if (gfc_real_kinds[i].kind == kind)
590 validate_logical (int kind)
594 for (i = 0; gfc_logical_kinds[i].kind; i++)
595 if (gfc_logical_kinds[i].kind == kind)
602 validate_character (int kind)
606 for (i = 0; gfc_character_kinds[i].kind; i++)
607 if (gfc_character_kinds[i].kind == kind)
613 /* Validate a kind given a basic type. The return value is the same
614 for the child functions, with -1 indicating nonexistence of the
615 type. If MAY_FAIL is false, then -1 is never returned, and we ICE. */
618 gfc_validate_kind (bt type, int kind, bool may_fail)
624 case BT_REAL: /* Fall through */
626 rc = validate_real (kind);
629 rc = validate_integer (kind);
632 rc = validate_logical (kind);
635 rc = validate_character (kind);
639 gfc_internal_error ("gfc_validate_kind(): Got bad type");
642 if (rc < 0 && !may_fail)
643 gfc_internal_error ("gfc_validate_kind(): Got bad kind");
649 /* Four subroutines of gfc_init_types. Create type nodes for the given kind.
650 Reuse common type nodes where possible. Recognize if the kind matches up
651 with a C type. This will be used later in determining which routines may
652 be scarfed from libm. */
655 gfc_build_int_type (gfc_integer_info *info)
657 int mode_precision = info->bit_size;
659 if (mode_precision == CHAR_TYPE_SIZE)
661 if (mode_precision == SHORT_TYPE_SIZE)
663 if (mode_precision == INT_TYPE_SIZE)
665 if (mode_precision == LONG_TYPE_SIZE)
667 if (mode_precision == LONG_LONG_TYPE_SIZE)
668 info->c_long_long = 1;
670 if (TYPE_PRECISION (intQI_type_node) == mode_precision)
671 return intQI_type_node;
672 if (TYPE_PRECISION (intHI_type_node) == mode_precision)
673 return intHI_type_node;
674 if (TYPE_PRECISION (intSI_type_node) == mode_precision)
675 return intSI_type_node;
676 if (TYPE_PRECISION (intDI_type_node) == mode_precision)
677 return intDI_type_node;
678 if (TYPE_PRECISION (intTI_type_node) == mode_precision)
679 return intTI_type_node;
681 return make_signed_type (mode_precision);
685 gfc_build_uint_type (int size)
687 if (size == CHAR_TYPE_SIZE)
688 return unsigned_char_type_node;
689 if (size == SHORT_TYPE_SIZE)
690 return short_unsigned_type_node;
691 if (size == INT_TYPE_SIZE)
692 return unsigned_type_node;
693 if (size == LONG_TYPE_SIZE)
694 return long_unsigned_type_node;
695 if (size == LONG_LONG_TYPE_SIZE)
696 return long_long_unsigned_type_node;
698 return make_unsigned_type (size);
703 gfc_build_real_type (gfc_real_info *info)
705 int mode_precision = info->mode_precision;
708 if (mode_precision == FLOAT_TYPE_SIZE)
710 if (mode_precision == DOUBLE_TYPE_SIZE)
712 if (mode_precision == LONG_DOUBLE_TYPE_SIZE)
713 info->c_long_double = 1;
715 if (TYPE_PRECISION (float_type_node) == mode_precision)
716 return float_type_node;
717 if (TYPE_PRECISION (double_type_node) == mode_precision)
718 return double_type_node;
719 if (TYPE_PRECISION (long_double_type_node) == mode_precision)
720 return long_double_type_node;
722 new_type = make_node (REAL_TYPE);
723 TYPE_PRECISION (new_type) = mode_precision;
724 layout_type (new_type);
729 gfc_build_complex_type (tree scalar_type)
733 if (scalar_type == NULL)
735 if (scalar_type == float_type_node)
736 return complex_float_type_node;
737 if (scalar_type == double_type_node)
738 return complex_double_type_node;
739 if (scalar_type == long_double_type_node)
740 return complex_long_double_type_node;
742 new_type = make_node (COMPLEX_TYPE);
743 TREE_TYPE (new_type) = scalar_type;
744 layout_type (new_type);
749 gfc_build_logical_type (gfc_logical_info *info)
751 int bit_size = info->bit_size;
754 if (bit_size == BOOL_TYPE_SIZE)
757 return boolean_type_node;
760 new_type = make_unsigned_type (bit_size);
761 TREE_SET_CODE (new_type, BOOLEAN_TYPE);
762 TYPE_MAX_VALUE (new_type) = build_int_cst (new_type, 1);
763 TYPE_PRECISION (new_type) = 1;
770 /* Return the bit size of the C "size_t". */
776 if (strcmp (SIZE_TYPE, "unsigned int") == 0)
777 return INT_TYPE_SIZE;
778 if (strcmp (SIZE_TYPE, "long unsigned int") == 0)
779 return LONG_TYPE_SIZE;
780 if (strcmp (SIZE_TYPE, "short unsigned int") == 0)
781 return SHORT_TYPE_SIZE;
784 return LONG_TYPE_SIZE;
789 /* Create the backend type nodes. We map them to their
790 equivalent C type, at least for now. We also give
791 names to the types here, and we push them in the
792 global binding level context.*/
795 gfc_init_types (void)
801 unsigned HOST_WIDE_INT hi;
802 unsigned HOST_WIDE_INT lo;
804 /* Create and name the types. */
805 #define PUSH_TYPE(name, node) \
806 pushdecl (build_decl (TYPE_DECL, get_identifier (name), node))
808 for (index = 0; gfc_integer_kinds[index].kind != 0; ++index)
810 type = gfc_build_int_type (&gfc_integer_kinds[index]);
811 /* Ensure integer(kind=1) doesn't have TYPE_STRING_FLAG set. */
812 if (TYPE_STRING_FLAG (type))
813 type = make_signed_type (gfc_integer_kinds[index].bit_size);
814 gfc_integer_types[index] = type;
815 snprintf (name_buf, sizeof(name_buf), "integer(kind=%d)",
816 gfc_integer_kinds[index].kind);
817 PUSH_TYPE (name_buf, type);
820 for (index = 0; gfc_logical_kinds[index].kind != 0; ++index)
822 type = gfc_build_logical_type (&gfc_logical_kinds[index]);
823 gfc_logical_types[index] = type;
824 snprintf (name_buf, sizeof(name_buf), "logical(kind=%d)",
825 gfc_logical_kinds[index].kind);
826 PUSH_TYPE (name_buf, type);
829 for (index = 0; gfc_real_kinds[index].kind != 0; index++)
831 type = gfc_build_real_type (&gfc_real_kinds[index]);
832 gfc_real_types[index] = type;
833 snprintf (name_buf, sizeof(name_buf), "real(kind=%d)",
834 gfc_real_kinds[index].kind);
835 PUSH_TYPE (name_buf, type);
837 type = gfc_build_complex_type (type);
838 gfc_complex_types[index] = type;
839 snprintf (name_buf, sizeof(name_buf), "complex(kind=%d)",
840 gfc_real_kinds[index].kind);
841 PUSH_TYPE (name_buf, type);
844 for (index = 0; gfc_character_kinds[index].kind != 0; ++index)
846 type = gfc_build_uint_type (gfc_character_kinds[index].bit_size);
847 type = build_qualified_type (type, TYPE_UNQUALIFIED);
848 snprintf (name_buf, sizeof(name_buf), "character(kind=%d)",
849 gfc_character_kinds[index].kind);
850 PUSH_TYPE (name_buf, type);
851 gfc_character_types[index] = type;
852 gfc_pcharacter_types[index] = build_pointer_type (type);
854 gfc_character1_type_node = gfc_character_types[0];
856 PUSH_TYPE ("byte", unsigned_char_type_node);
857 PUSH_TYPE ("void", void_type_node);
859 /* DBX debugging output gets upset if these aren't set. */
860 if (!TYPE_NAME (integer_type_node))
861 PUSH_TYPE ("c_integer", integer_type_node);
862 if (!TYPE_NAME (char_type_node))
863 PUSH_TYPE ("c_char", char_type_node);
867 pvoid_type_node = build_pointer_type (void_type_node);
868 ppvoid_type_node = build_pointer_type (pvoid_type_node);
869 pchar_type_node = build_pointer_type (gfc_character1_type_node);
871 = build_pointer_type (build_function_type (void_type_node, NULL_TREE));
873 gfc_array_index_type = gfc_get_int_type (gfc_index_integer_kind);
874 /* We cannot use gfc_index_zero_node in definition of gfc_array_range_type,
875 since this function is called before gfc_init_constants. */
877 = build_range_type (gfc_array_index_type,
878 build_int_cst (gfc_array_index_type, 0),
881 /* The maximum array element size that can be handled is determined
882 by the number of bits available to store this field in the array
885 n = TYPE_PRECISION (gfc_array_index_type) - GFC_DTYPE_SIZE_SHIFT;
886 lo = ~ (unsigned HOST_WIDE_INT) 0;
887 if (n > HOST_BITS_PER_WIDE_INT)
888 hi = lo >> (2*HOST_BITS_PER_WIDE_INT - n);
890 hi = 0, lo >>= HOST_BITS_PER_WIDE_INT - n;
891 gfc_max_array_element_size
892 = build_int_cst_wide (long_unsigned_type_node, lo, hi);
894 size_type_node = gfc_array_index_type;
896 boolean_type_node = gfc_get_logical_type (gfc_default_logical_kind);
897 boolean_true_node = build_int_cst (boolean_type_node, 1);
898 boolean_false_node = build_int_cst (boolean_type_node, 0);
900 /* ??? Shouldn't this be based on gfc_index_integer_kind or so? */
901 gfc_charlen_int_kind = 4;
902 gfc_charlen_type_node = gfc_get_int_type (gfc_charlen_int_kind);
905 /* Get the type node for the given type and kind. */
908 gfc_get_int_type (int kind)
910 int index = gfc_validate_kind (BT_INTEGER, kind, true);
911 return index < 0 ? 0 : gfc_integer_types[index];
915 gfc_get_real_type (int kind)
917 int index = gfc_validate_kind (BT_REAL, kind, true);
918 return index < 0 ? 0 : gfc_real_types[index];
922 gfc_get_complex_type (int kind)
924 int index = gfc_validate_kind (BT_COMPLEX, kind, true);
925 return index < 0 ? 0 : gfc_complex_types[index];
929 gfc_get_logical_type (int kind)
931 int index = gfc_validate_kind (BT_LOGICAL, kind, true);
932 return index < 0 ? 0 : gfc_logical_types[index];
936 gfc_get_char_type (int kind)
938 int index = gfc_validate_kind (BT_CHARACTER, kind, true);
939 return index < 0 ? 0 : gfc_character_types[index];
943 gfc_get_pchar_type (int kind)
945 int index = gfc_validate_kind (BT_CHARACTER, kind, true);
946 return index < 0 ? 0 : gfc_pcharacter_types[index];
950 /* Create a character type with the given kind and length. */
953 gfc_get_character_type_len_for_eltype (tree eltype, tree len)
957 bounds = build_range_type (gfc_charlen_type_node, gfc_index_one_node, len);
958 type = build_array_type (eltype, bounds);
959 TYPE_STRING_FLAG (type) = 1;
965 gfc_get_character_type_len (int kind, tree len)
967 gfc_validate_kind (BT_CHARACTER, kind, false);
968 return gfc_get_character_type_len_for_eltype (gfc_get_char_type (kind), len);
972 /* Get a type node for a character kind. */
975 gfc_get_character_type (int kind, gfc_charlen * cl)
979 len = (cl == NULL) ? NULL_TREE : cl->backend_decl;
981 return gfc_get_character_type_len (kind, len);
984 /* Covert a basic type. This will be an array for character types. */
987 gfc_typenode_for_spec (gfc_typespec * spec)
997 /* We use INTEGER(c_intptr_t) for C_PTR and C_FUNPTR once the symbol
998 has been resolved. This is done so we can convert C_PTR and
999 C_FUNPTR to simple variables that get translated to (void *). */
1000 if (spec->f90_type == BT_VOID)
1003 && spec->derived->intmod_sym_id == ISOCBINDING_PTR)
1004 basetype = ptr_type_node;
1006 basetype = pfunc_type_node;
1009 basetype = gfc_get_int_type (spec->kind);
1013 basetype = gfc_get_real_type (spec->kind);
1017 basetype = gfc_get_complex_type (spec->kind);
1021 basetype = gfc_get_logical_type (spec->kind);
1025 basetype = gfc_get_character_type (spec->kind, spec->cl);
1029 basetype = gfc_get_derived_type (spec->derived);
1031 /* If we're dealing with either C_PTR or C_FUNPTR, we modified the
1032 type and kind to fit a (void *) and the basetype returned was a
1033 ptr_type_node. We need to pass up this new information to the
1034 symbol that was declared of type C_PTR or C_FUNPTR. */
1035 if (spec->derived->attr.is_iso_c)
1037 spec->type = spec->derived->ts.type;
1038 spec->kind = spec->derived->ts.kind;
1039 spec->f90_type = spec->derived->ts.f90_type;
1043 /* This is for the second arg to c_f_pointer and c_f_procpointer
1044 of the iso_c_binding module, to accept any ptr type. */
1045 basetype = ptr_type_node;
1046 if (spec->f90_type == BT_VOID)
1049 && spec->derived->intmod_sym_id == ISOCBINDING_PTR)
1050 basetype = ptr_type_node;
1052 basetype = pfunc_type_node;
1061 /* Build an INT_CST for constant expressions, otherwise return NULL_TREE. */
1064 gfc_conv_array_bound (gfc_expr * expr)
1066 /* If expr is an integer constant, return that. */
1067 if (expr != NULL && expr->expr_type == EXPR_CONSTANT)
1068 return gfc_conv_mpz_to_tree (expr->value.integer, gfc_index_integer_kind);
1070 /* Otherwise return NULL. */
1075 gfc_get_element_type (tree type)
1079 if (GFC_ARRAY_TYPE_P (type))
1081 if (TREE_CODE (type) == POINTER_TYPE)
1082 type = TREE_TYPE (type);
1083 gcc_assert (TREE_CODE (type) == ARRAY_TYPE);
1084 element = TREE_TYPE (type);
1088 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type));
1089 element = GFC_TYPE_ARRAY_DATAPTR_TYPE (type);
1091 gcc_assert (TREE_CODE (element) == POINTER_TYPE);
1092 element = TREE_TYPE (element);
1094 gcc_assert (TREE_CODE (element) == ARRAY_TYPE);
1095 element = TREE_TYPE (element);
1101 /* Build an array. This function is called from gfc_sym_type().
1102 Actually returns array descriptor type.
1104 Format of array descriptors is as follows:
1106 struct gfc_array_descriptor
1111 struct descriptor_dimension dimension[N_DIM];
1114 struct descriptor_dimension
1121 Translation code should use gfc_conv_descriptor_* rather than
1122 accessing the descriptor directly. Any changes to the array
1123 descriptor type will require changes in gfc_conv_descriptor_* and
1124 gfc_build_array_initializer.
1126 This is represented internally as a RECORD_TYPE. The index nodes
1127 are gfc_array_index_type and the data node is a pointer to the
1128 data. See below for the handling of character types.
1130 The dtype member is formatted as follows:
1131 rank = dtype & GFC_DTYPE_RANK_MASK // 3 bits
1132 type = (dtype & GFC_DTYPE_TYPE_MASK) >> GFC_DTYPE_TYPE_SHIFT // 3 bits
1133 size = dtype >> GFC_DTYPE_SIZE_SHIFT
1135 I originally used nested ARRAY_TYPE nodes to represent arrays, but
1136 this generated poor code for assumed/deferred size arrays. These
1137 require use of PLACEHOLDER_EXPR/WITH_RECORD_EXPR, which isn't part
1138 of the GENERIC grammar. Also, there is no way to explicitly set
1139 the array stride, so all data must be packed(1). I've tried to
1140 mark all the functions which would require modification with a GCC
1143 The data component points to the first element in the array. The
1144 offset field is the position of the origin of the array (i.e. element
1145 (0, 0 ...)). This may be outside the bounds of the array.
1147 An element is accessed by
1148 data[offset + index0*stride0 + index1*stride1 + index2*stride2]
1149 This gives good performance as the computation does not involve the
1150 bounds of the array. For packed arrays, this is optimized further
1151 by substituting the known strides.
1153 This system has one problem: all array bounds must be within 2^31
1154 elements of the origin (2^63 on 64-bit machines). For example
1155 integer, dimension (80000:90000, 80000:90000, 2) :: array
1156 may not work properly on 32-bit machines because 80000*80000 >
1157 2^31, so the calculation for stride2 would overflow. This may
1158 still work, but I haven't checked, and it relies on the overflow
1159 doing the right thing.
1161 The way to fix this problem is to access elements as follows:
1162 data[(index0-lbound0)*stride0 + (index1-lbound1)*stride1]
1163 Obviously this is much slower. I will make this a compile time
1164 option, something like -fsmall-array-offsets. Mixing code compiled
1165 with and without this switch will work.
1167 (1) This can be worked around by modifying the upper bound of the
1168 previous dimension. This requires extra fields in the descriptor
1169 (both real_ubound and fake_ubound). */
1172 /* Returns true if the array sym does not require a descriptor. */
1175 gfc_is_nodesc_array (gfc_symbol * sym)
1177 gcc_assert (sym->attr.dimension);
1179 /* We only want local arrays. */
1180 if (sym->attr.pointer || sym->attr.allocatable)
1183 if (sym->attr.dummy)
1185 if (sym->as->type != AS_ASSUMED_SHAPE)
1191 if (sym->attr.result || sym->attr.function)
1194 gcc_assert (sym->as->type == AS_EXPLICIT);
1200 /* Create an array descriptor type. */
1203 gfc_build_array_type (tree type, gfc_array_spec * as,
1204 enum gfc_array_kind akind)
1206 tree lbound[GFC_MAX_DIMENSIONS];
1207 tree ubound[GFC_MAX_DIMENSIONS];
1210 for (n = 0; n < as->rank; n++)
1212 /* Create expressions for the known bounds of the array. */
1213 if (as->type == AS_ASSUMED_SHAPE && as->lower[n] == NULL)
1214 lbound[n] = gfc_index_one_node;
1216 lbound[n] = gfc_conv_array_bound (as->lower[n]);
1217 ubound[n] = gfc_conv_array_bound (as->upper[n]);
1220 if (as->type == AS_ASSUMED_SHAPE)
1221 akind = GFC_ARRAY_ASSUMED_SHAPE;
1222 return gfc_get_array_type_bounds (type, as->rank, lbound, ubound, 0, akind);
1225 /* Returns the struct descriptor_dimension type. */
1228 gfc_get_desc_dim_type (void)
1234 if (gfc_desc_dim_type)
1235 return gfc_desc_dim_type;
1237 /* Build the type node. */
1238 type = make_node (RECORD_TYPE);
1240 TYPE_NAME (type) = get_identifier ("descriptor_dimension");
1241 TYPE_PACKED (type) = 1;
1243 /* Consists of the stride, lbound and ubound members. */
1244 decl = build_decl (FIELD_DECL,
1245 get_identifier ("stride"), gfc_array_index_type);
1246 DECL_CONTEXT (decl) = type;
1247 TREE_NO_WARNING (decl) = 1;
1250 decl = build_decl (FIELD_DECL,
1251 get_identifier ("lbound"), gfc_array_index_type);
1252 DECL_CONTEXT (decl) = type;
1253 TREE_NO_WARNING (decl) = 1;
1254 fieldlist = chainon (fieldlist, decl);
1256 decl = build_decl (FIELD_DECL,
1257 get_identifier ("ubound"), gfc_array_index_type);
1258 DECL_CONTEXT (decl) = type;
1259 TREE_NO_WARNING (decl) = 1;
1260 fieldlist = chainon (fieldlist, decl);
1262 /* Finish off the type. */
1263 TYPE_FIELDS (type) = fieldlist;
1265 gfc_finish_type (type);
1266 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type)) = 1;
1268 gfc_desc_dim_type = type;
1273 /* Return the DTYPE for an array. This describes the type and type parameters
1275 /* TODO: Only call this when the value is actually used, and make all the
1276 unknown cases abort. */
1279 gfc_get_dtype (tree type)
1289 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type) || GFC_ARRAY_TYPE_P (type));
1291 if (GFC_TYPE_ARRAY_DTYPE (type))
1292 return GFC_TYPE_ARRAY_DTYPE (type);
1294 rank = GFC_TYPE_ARRAY_RANK (type);
1295 etype = gfc_get_element_type (type);
1297 switch (TREE_CODE (etype))
1300 n = GFC_DTYPE_INTEGER;
1304 n = GFC_DTYPE_LOGICAL;
1312 n = GFC_DTYPE_COMPLEX;
1315 /* We will never have arrays of arrays. */
1317 n = GFC_DTYPE_DERIVED;
1321 n = GFC_DTYPE_CHARACTER;
1325 /* TODO: Don't do dtype for temporary descriptorless arrays. */
1326 /* We can strange array types for temporary arrays. */
1327 return gfc_index_zero_node;
1330 gcc_assert (rank <= GFC_DTYPE_RANK_MASK);
1331 size = TYPE_SIZE_UNIT (etype);
1333 i = rank | (n << GFC_DTYPE_TYPE_SHIFT);
1334 if (size && INTEGER_CST_P (size))
1336 if (tree_int_cst_lt (gfc_max_array_element_size, size))
1337 internal_error ("Array element size too big");
1339 i += TREE_INT_CST_LOW (size) << GFC_DTYPE_SIZE_SHIFT;
1341 dtype = build_int_cst (gfc_array_index_type, i);
1343 if (size && !INTEGER_CST_P (size))
1345 tmp = build_int_cst (gfc_array_index_type, GFC_DTYPE_SIZE_SHIFT);
1346 tmp = fold_build2 (LSHIFT_EXPR, gfc_array_index_type,
1347 fold_convert (gfc_array_index_type, size), tmp);
1348 dtype = fold_build2 (PLUS_EXPR, gfc_array_index_type, tmp, dtype);
1350 /* If we don't know the size we leave it as zero. This should never happen
1351 for anything that is actually used. */
1352 /* TODO: Check this is actually true, particularly when repacking
1353 assumed size parameters. */
1355 GFC_TYPE_ARRAY_DTYPE (type) = dtype;
1360 /* Build an array type for use without a descriptor, packed according
1361 to the value of PACKED. */
1364 gfc_get_nodesc_array_type (tree etype, gfc_array_spec * as, gfc_packed packed)
1377 mpz_init_set_ui (offset, 0);
1378 mpz_init_set_ui (stride, 1);
1381 /* We don't use build_array_type because this does not include include
1382 lang-specific information (i.e. the bounds of the array) when checking
1384 type = make_node (ARRAY_TYPE);
1386 GFC_ARRAY_TYPE_P (type) = 1;
1387 TYPE_LANG_SPECIFIC (type) = (struct lang_type *)
1388 ggc_alloc_cleared (sizeof (struct lang_type));
1390 known_stride = (packed != PACKED_NO);
1392 for (n = 0; n < as->rank; n++)
1394 /* Fill in the stride and bound components of the type. */
1396 tmp = gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
1399 GFC_TYPE_ARRAY_STRIDE (type, n) = tmp;
1401 expr = as->lower[n];
1402 if (expr->expr_type == EXPR_CONSTANT)
1404 tmp = gfc_conv_mpz_to_tree (expr->value.integer,
1405 gfc_index_integer_kind);
1412 GFC_TYPE_ARRAY_LBOUND (type, n) = tmp;
1416 /* Calculate the offset. */
1417 mpz_mul (delta, stride, as->lower[n]->value.integer);
1418 mpz_sub (offset, offset, delta);
1423 expr = as->upper[n];
1424 if (expr && expr->expr_type == EXPR_CONSTANT)
1426 tmp = gfc_conv_mpz_to_tree (expr->value.integer,
1427 gfc_index_integer_kind);
1434 GFC_TYPE_ARRAY_UBOUND (type, n) = tmp;
1438 /* Calculate the stride. */
1439 mpz_sub (delta, as->upper[n]->value.integer,
1440 as->lower[n]->value.integer);
1441 mpz_add_ui (delta, delta, 1);
1442 mpz_mul (stride, stride, delta);
1445 /* Only the first stride is known for partial packed arrays. */
1446 if (packed == PACKED_NO || packed == PACKED_PARTIAL)
1452 GFC_TYPE_ARRAY_OFFSET (type) =
1453 gfc_conv_mpz_to_tree (offset, gfc_index_integer_kind);
1456 GFC_TYPE_ARRAY_OFFSET (type) = NULL_TREE;
1460 GFC_TYPE_ARRAY_SIZE (type) =
1461 gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
1464 GFC_TYPE_ARRAY_SIZE (type) = NULL_TREE;
1466 GFC_TYPE_ARRAY_RANK (type) = as->rank;
1467 GFC_TYPE_ARRAY_DTYPE (type) = NULL_TREE;
1468 range = build_range_type (gfc_array_index_type, gfc_index_zero_node,
1470 /* TODO: use main type if it is unbounded. */
1471 GFC_TYPE_ARRAY_DATAPTR_TYPE (type) =
1472 build_pointer_type (build_array_type (etype, range));
1476 mpz_sub_ui (stride, stride, 1);
1477 range = gfc_conv_mpz_to_tree (stride, gfc_index_integer_kind);
1482 range = build_range_type (gfc_array_index_type, gfc_index_zero_node, range);
1483 TYPE_DOMAIN (type) = range;
1485 build_pointer_type (etype);
1486 TREE_TYPE (type) = etype;
1494 /* Represent packed arrays as multi-dimensional if they have rank >
1495 1 and with proper bounds, instead of flat arrays. This makes for
1496 better debug info. */
1499 tree gtype = etype, rtype, type_decl;
1501 for (n = as->rank - 1; n >= 0; n--)
1503 rtype = build_range_type (gfc_array_index_type,
1504 GFC_TYPE_ARRAY_LBOUND (type, n),
1505 GFC_TYPE_ARRAY_UBOUND (type, n));
1506 gtype = build_array_type (gtype, rtype);
1508 TYPE_NAME (type) = type_decl = build_decl (TYPE_DECL, NULL, gtype);
1509 DECL_ORIGINAL_TYPE (type_decl) = gtype;
1512 if (packed != PACKED_STATIC || !known_stride)
1514 /* For dummy arrays and automatic (heap allocated) arrays we
1515 want a pointer to the array. */
1516 type = build_pointer_type (type);
1517 GFC_ARRAY_TYPE_P (type) = 1;
1518 TYPE_LANG_SPECIFIC (type) = TYPE_LANG_SPECIFIC (TREE_TYPE (type));
1523 /* Return or create the base type for an array descriptor. */
1526 gfc_get_array_descriptor_base (int dimen)
1528 tree fat_type, fieldlist, decl, arraytype;
1529 char name[16 + GFC_RANK_DIGITS + 1];
1531 gcc_assert (dimen >= 1 && dimen <= GFC_MAX_DIMENSIONS);
1532 if (gfc_array_descriptor_base[dimen - 1])
1533 return gfc_array_descriptor_base[dimen - 1];
1535 /* Build the type node. */
1536 fat_type = make_node (RECORD_TYPE);
1538 sprintf (name, "array_descriptor" GFC_RANK_PRINTF_FORMAT, dimen);
1539 TYPE_NAME (fat_type) = get_identifier (name);
1541 /* Add the data member as the first element of the descriptor. */
1542 decl = build_decl (FIELD_DECL, get_identifier ("data"), ptr_type_node);
1544 DECL_CONTEXT (decl) = fat_type;
1547 /* Add the base component. */
1548 decl = build_decl (FIELD_DECL, get_identifier ("offset"),
1549 gfc_array_index_type);
1550 DECL_CONTEXT (decl) = fat_type;
1551 TREE_NO_WARNING (decl) = 1;
1552 fieldlist = chainon (fieldlist, decl);
1554 /* Add the dtype component. */
1555 decl = build_decl (FIELD_DECL, get_identifier ("dtype"),
1556 gfc_array_index_type);
1557 DECL_CONTEXT (decl) = fat_type;
1558 TREE_NO_WARNING (decl) = 1;
1559 fieldlist = chainon (fieldlist, decl);
1561 /* Build the array type for the stride and bound components. */
1563 build_array_type (gfc_get_desc_dim_type (),
1564 build_range_type (gfc_array_index_type,
1565 gfc_index_zero_node,
1566 gfc_rank_cst[dimen - 1]));
1568 decl = build_decl (FIELD_DECL, get_identifier ("dim"), arraytype);
1569 DECL_CONTEXT (decl) = fat_type;
1570 TREE_NO_WARNING (decl) = 1;
1571 fieldlist = chainon (fieldlist, decl);
1573 /* Finish off the type. */
1574 TYPE_FIELDS (fat_type) = fieldlist;
1576 gfc_finish_type (fat_type);
1577 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (fat_type)) = 1;
1579 gfc_array_descriptor_base[dimen - 1] = fat_type;
1583 /* Build an array (descriptor) type with given bounds. */
1586 gfc_get_array_type_bounds (tree etype, int dimen, tree * lbound,
1587 tree * ubound, int packed,
1588 enum gfc_array_kind akind)
1590 char name[8 + GFC_RANK_DIGITS + GFC_MAX_SYMBOL_LEN];
1591 tree fat_type, base_type, arraytype, lower, upper, stride, tmp, rtype;
1592 const char *type_name;
1595 base_type = gfc_get_array_descriptor_base (dimen);
1596 fat_type = build_variant_type_copy (base_type);
1598 tmp = TYPE_NAME (etype);
1599 if (tmp && TREE_CODE (tmp) == TYPE_DECL)
1600 tmp = DECL_NAME (tmp);
1602 type_name = IDENTIFIER_POINTER (tmp);
1604 type_name = "unknown";
1605 sprintf (name, "array" GFC_RANK_PRINTF_FORMAT "_%.*s", dimen,
1606 GFC_MAX_SYMBOL_LEN, type_name);
1607 TYPE_NAME (fat_type) = get_identifier (name);
1609 GFC_DESCRIPTOR_TYPE_P (fat_type) = 1;
1610 TYPE_LANG_SPECIFIC (fat_type) = (struct lang_type *)
1611 ggc_alloc_cleared (sizeof (struct lang_type));
1613 GFC_TYPE_ARRAY_RANK (fat_type) = dimen;
1614 GFC_TYPE_ARRAY_DTYPE (fat_type) = NULL_TREE;
1615 GFC_TYPE_ARRAY_AKIND (fat_type) = akind;
1617 /* Build an array descriptor record type. */
1619 stride = gfc_index_one_node;
1622 for (n = 0; n < dimen; n++)
1624 GFC_TYPE_ARRAY_STRIDE (fat_type, n) = stride;
1631 if (lower != NULL_TREE)
1633 if (INTEGER_CST_P (lower))
1634 GFC_TYPE_ARRAY_LBOUND (fat_type, n) = lower;
1640 if (upper != NULL_TREE)
1642 if (INTEGER_CST_P (upper))
1643 GFC_TYPE_ARRAY_UBOUND (fat_type, n) = upper;
1648 if (upper != NULL_TREE && lower != NULL_TREE && stride != NULL_TREE)
1650 tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, upper, lower);
1651 tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type, tmp,
1652 gfc_index_one_node);
1654 fold_build2 (MULT_EXPR, gfc_array_index_type, tmp, stride);
1655 /* Check the folding worked. */
1656 gcc_assert (INTEGER_CST_P (stride));
1661 GFC_TYPE_ARRAY_SIZE (fat_type) = stride;
1663 /* TODO: known offsets for descriptors. */
1664 GFC_TYPE_ARRAY_OFFSET (fat_type) = NULL_TREE;
1666 /* We define data as an array with the correct size if possible.
1667 Much better than doing pointer arithmetic. */
1669 rtype = build_range_type (gfc_array_index_type, gfc_index_zero_node,
1670 int_const_binop (MINUS_EXPR, stride,
1671 integer_one_node, 0));
1673 rtype = gfc_array_range_type;
1674 arraytype = build_array_type (etype, rtype);
1675 arraytype = build_pointer_type (arraytype);
1676 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type) = arraytype;
1681 /* Build a pointer type. This function is called from gfc_sym_type(). */
1684 gfc_build_pointer_type (gfc_symbol * sym, tree type)
1686 /* Array pointer types aren't actually pointers. */
1687 if (sym->attr.dimension)
1690 return build_pointer_type (type);
1693 /* Return the type for a symbol. Special handling is required for character
1694 types to get the correct level of indirection.
1695 For functions return the return type.
1696 For subroutines return void_type_node.
1697 Calling this multiple times for the same symbol should be avoided,
1698 especially for character and array types. */
1701 gfc_sym_type (gfc_symbol * sym)
1706 /* Procedure Pointers inside COMMON blocks. */
1707 if (sym->attr.proc_pointer && sym->attr.in_common)
1709 /* Unset proc_pointer as gfc_get_function_type calls gfc_sym_type. */
1710 sym->attr.proc_pointer = 0;
1711 type = build_pointer_type (gfc_get_function_type (sym));
1712 sym->attr.proc_pointer = 1;
1716 if (sym->attr.flavor == FL_PROCEDURE && !sym->attr.function)
1717 return void_type_node;
1719 /* In the case of a function the fake result variable may have a
1720 type different from the function type, so don't return early in
1722 if (sym->backend_decl && !sym->attr.function)
1723 return TREE_TYPE (sym->backend_decl);
1725 if (sym->ts.type == BT_CHARACTER
1726 && ((sym->attr.function && sym->attr.is_bind_c)
1727 || (sym->attr.result
1728 && sym->ns->proc_name
1729 && sym->ns->proc_name->attr.is_bind_c)))
1730 type = gfc_character1_type_node;
1732 type = gfc_typenode_for_spec (&sym->ts);
1734 if (sym->attr.dummy && !sym->attr.function && !sym->attr.value)
1739 if (sym->attr.dimension)
1741 if (gfc_is_nodesc_array (sym))
1743 /* If this is a character argument of unknown length, just use the
1745 if (sym->ts.type != BT_CHARACTER
1746 || !(sym->attr.dummy || sym->attr.function)
1747 || sym->ts.cl->backend_decl)
1749 type = gfc_get_nodesc_array_type (type, sym->as,
1757 enum gfc_array_kind akind = GFC_ARRAY_UNKNOWN;
1758 if (sym->attr.pointer)
1759 akind = GFC_ARRAY_POINTER;
1760 else if (sym->attr.allocatable)
1761 akind = GFC_ARRAY_ALLOCATABLE;
1762 type = gfc_build_array_type (type, sym->as, akind);
1767 if (sym->attr.allocatable || sym->attr.pointer)
1768 type = gfc_build_pointer_type (sym, type);
1769 if (sym->attr.pointer)
1770 GFC_POINTER_TYPE_P (type) = 1;
1773 /* We currently pass all parameters by reference.
1774 See f95_get_function_decl. For dummy function parameters return the
1778 /* We must use pointer types for potentially absent variables. The
1779 optimizers assume a reference type argument is never NULL. */
1780 if (sym->attr.optional || sym->ns->proc_name->attr.entry_master)
1781 type = build_pointer_type (type);
1783 type = build_reference_type (type);
1789 /* Layout and output debug info for a record type. */
1792 gfc_finish_type (tree type)
1796 decl = build_decl (TYPE_DECL, NULL_TREE, type);
1797 TYPE_STUB_DECL (type) = decl;
1799 rest_of_type_compilation (type, 1);
1800 rest_of_decl_compilation (decl, 1, 0);
1803 /* Add a field of given NAME and TYPE to the context of a UNION_TYPE
1804 or RECORD_TYPE pointed to by STYPE. The new field is chained
1805 to the fieldlist pointed to by FIELDLIST.
1807 Returns a pointer to the new field. */
1810 gfc_add_field_to_struct (tree *fieldlist, tree context,
1811 tree name, tree type)
1815 decl = build_decl (FIELD_DECL, name, type);
1817 DECL_CONTEXT (decl) = context;
1818 DECL_INITIAL (decl) = 0;
1819 DECL_ALIGN (decl) = 0;
1820 DECL_USER_ALIGN (decl) = 0;
1821 TREE_CHAIN (decl) = NULL_TREE;
1822 *fieldlist = chainon (*fieldlist, decl);
1828 /* Copy the backend_decl and component backend_decls if
1829 the two derived type symbols are "equal", as described
1830 in 4.4.2 and resolved by gfc_compare_derived_types. */
1833 copy_dt_decls_ifequal (gfc_symbol *from, gfc_symbol *to)
1835 gfc_component *to_cm;
1836 gfc_component *from_cm;
1838 if (from->backend_decl == NULL
1839 || !gfc_compare_derived_types (from, to))
1842 to->backend_decl = from->backend_decl;
1844 to_cm = to->components;
1845 from_cm = from->components;
1847 /* Copy the component declarations. If a component is itself
1848 a derived type, we need a copy of its component declarations.
1849 This is done by recursing into gfc_get_derived_type and
1850 ensures that the component's component declarations have
1851 been built. If it is a character, we need the character
1853 for (; to_cm; to_cm = to_cm->next, from_cm = from_cm->next)
1855 to_cm->backend_decl = from_cm->backend_decl;
1856 if (!from_cm->attr.pointer && from_cm->ts.type == BT_DERIVED)
1857 gfc_get_derived_type (to_cm->ts.derived);
1859 else if (from_cm->ts.type == BT_CHARACTER)
1860 to_cm->ts.cl->backend_decl = from_cm->ts.cl->backend_decl;
1867 /* Build a tree node for a procedure pointer component. */
1870 gfc_get_ppc_type (gfc_component* c)
1873 if (c->attr.function && !c->attr.dimension)
1874 t = gfc_typenode_for_spec (&c->ts);
1877 /* TODO: Build argument list. */
1878 return build_pointer_type (build_function_type (t, NULL_TREE));
1882 /* Build a tree node for a derived type. If there are equal
1883 derived types, with different local names, these are built
1884 at the same time. If an equal derived type has been built
1885 in a parent namespace, this is used. */
1888 gfc_get_derived_type (gfc_symbol * derived)
1890 tree typenode = NULL, field = NULL, field_type = NULL, fieldlist = NULL;
1894 gcc_assert (derived && derived->attr.flavor == FL_DERIVED);
1896 /* See if it's one of the iso_c_binding derived types. */
1897 if (derived->attr.is_iso_c == 1)
1899 if (derived->backend_decl)
1900 return derived->backend_decl;
1902 if (derived->intmod_sym_id == ISOCBINDING_PTR)
1903 derived->backend_decl = ptr_type_node;
1905 derived->backend_decl = pfunc_type_node;
1907 /* Create a backend_decl for the __c_ptr_c_address field. */
1908 derived->components->backend_decl =
1909 gfc_add_field_to_struct (&(derived->backend_decl->type.values),
1910 derived->backend_decl,
1911 get_identifier (derived->components->name),
1912 gfc_typenode_for_spec (
1913 &(derived->components->ts)));
1915 derived->ts.kind = gfc_index_integer_kind;
1916 derived->ts.type = BT_INTEGER;
1917 /* Set the f90_type to BT_VOID as a way to recognize something of type
1918 BT_INTEGER that needs to fit a void * for the purpose of the
1919 iso_c_binding derived types. */
1920 derived->ts.f90_type = BT_VOID;
1922 return derived->backend_decl;
1925 /* derived->backend_decl != 0 means we saw it before, but its
1926 components' backend_decl may have not been built. */
1927 if (derived->backend_decl)
1928 return derived->backend_decl;
1931 /* We see this derived type first time, so build the type node. */
1932 typenode = make_node (RECORD_TYPE);
1933 TYPE_NAME (typenode) = get_identifier (derived->name);
1934 TYPE_PACKED (typenode) = gfc_option.flag_pack_derived;
1935 derived->backend_decl = typenode;
1938 /* Go through the derived type components, building them as
1939 necessary. The reason for doing this now is that it is
1940 possible to recurse back to this derived type through a
1941 pointer component (PR24092). If this happens, the fields
1942 will be built and so we can return the type. */
1943 for (c = derived->components; c; c = c->next)
1945 if (c->ts.type != BT_DERIVED)
1948 if (!c->attr.pointer || c->ts.derived->backend_decl == NULL)
1949 c->ts.derived->backend_decl = gfc_get_derived_type (c->ts.derived);
1951 if (c->ts.derived && c->ts.derived->attr.is_iso_c)
1953 /* Need to copy the modified ts from the derived type. The
1954 typespec was modified because C_PTR/C_FUNPTR are translated
1955 into (void *) from derived types. */
1956 c->ts.type = c->ts.derived->ts.type;
1957 c->ts.kind = c->ts.derived->ts.kind;
1958 c->ts.f90_type = c->ts.derived->ts.f90_type;
1961 c->initializer->ts.type = c->ts.type;
1962 c->initializer->ts.kind = c->ts.kind;
1963 c->initializer->ts.f90_type = c->ts.f90_type;
1964 c->initializer->expr_type = EXPR_NULL;
1969 if (TYPE_FIELDS (derived->backend_decl))
1970 return derived->backend_decl;
1972 /* Build the type member list. Install the newly created RECORD_TYPE
1973 node as DECL_CONTEXT of each FIELD_DECL. */
1974 fieldlist = NULL_TREE;
1975 for (c = derived->components; c; c = c->next)
1977 if (c->ts.type == BT_DERIVED)
1978 field_type = c->ts.derived->backend_decl;
1979 else if (c->attr.proc_pointer)
1980 field_type = gfc_get_ppc_type (c);
1983 if (c->ts.type == BT_CHARACTER)
1985 /* Evaluate the string length. */
1986 gfc_conv_const_charlen (c->ts.cl);
1987 gcc_assert (c->ts.cl->backend_decl);
1990 field_type = gfc_typenode_for_spec (&c->ts);
1993 /* This returns an array descriptor type. Initialization may be
1995 if (c->attr.dimension && !c->attr.proc_pointer)
1997 if (c->attr.pointer || c->attr.allocatable)
1999 enum gfc_array_kind akind;
2000 if (c->attr.pointer)
2001 akind = GFC_ARRAY_POINTER;
2003 akind = GFC_ARRAY_ALLOCATABLE;
2004 /* Pointers to arrays aren't actually pointer types. The
2005 descriptors are separate, but the data is common. */
2006 field_type = gfc_build_array_type (field_type, c->as, akind);
2009 field_type = gfc_get_nodesc_array_type (field_type, c->as,
2012 else if (c->attr.pointer)
2013 field_type = build_pointer_type (field_type);
2015 field = gfc_add_field_to_struct (&fieldlist, typenode,
2016 get_identifier (c->name),
2019 gfc_set_decl_location (field, &c->loc);
2020 else if (derived->declared_at.lb)
2021 gfc_set_decl_location (field, &derived->declared_at);
2023 DECL_PACKED (field) |= TYPE_PACKED (typenode);
2026 if (!c->backend_decl)
2027 c->backend_decl = field;
2030 /* Now we have the final fieldlist. Record it, then lay out the
2031 derived type, including the fields. */
2032 TYPE_FIELDS (typenode) = fieldlist;
2034 gfc_finish_type (typenode);
2035 gfc_set_decl_location (TYPE_STUB_DECL (typenode), &derived->declared_at);
2036 if (derived->module && derived->ns->proc_name
2037 && derived->ns->proc_name->attr.flavor == FL_MODULE)
2039 if (derived->ns->proc_name->backend_decl
2040 && TREE_CODE (derived->ns->proc_name->backend_decl)
2043 TYPE_CONTEXT (typenode) = derived->ns->proc_name->backend_decl;
2044 DECL_CONTEXT (TYPE_STUB_DECL (typenode))
2045 = derived->ns->proc_name->backend_decl;
2049 derived->backend_decl = typenode;
2051 /* Add this backend_decl to all the other, equal derived types. */
2052 for (dt = gfc_derived_types; dt; dt = dt->next)
2053 copy_dt_decls_ifequal (derived, dt->derived);
2055 return derived->backend_decl;
2060 gfc_return_by_reference (gfc_symbol * sym)
2062 if (!sym->attr.function)
2065 if (sym->attr.dimension)
2068 if (sym->ts.type == BT_CHARACTER
2069 && !sym->attr.is_bind_c
2070 && (!sym->attr.result
2071 || !sym->ns->proc_name
2072 || !sym->ns->proc_name->attr.is_bind_c))
2075 /* Possibly return complex numbers by reference for g77 compatibility.
2076 We don't do this for calls to intrinsics (as the library uses the
2077 -fno-f2c calling convention), nor for calls to functions which always
2078 require an explicit interface, as no compatibility problems can
2080 if (gfc_option.flag_f2c
2081 && sym->ts.type == BT_COMPLEX
2082 && !sym->attr.intrinsic && !sym->attr.always_explicit)
2089 gfc_get_mixed_entry_union (gfc_namespace *ns)
2094 char name[GFC_MAX_SYMBOL_LEN + 1];
2095 gfc_entry_list *el, *el2;
2097 gcc_assert (ns->proc_name->attr.mixed_entry_master);
2098 gcc_assert (memcmp (ns->proc_name->name, "master.", 7) == 0);
2100 snprintf (name, GFC_MAX_SYMBOL_LEN, "munion.%s", ns->proc_name->name + 7);
2102 /* Build the type node. */
2103 type = make_node (UNION_TYPE);
2105 TYPE_NAME (type) = get_identifier (name);
2108 for (el = ns->entries; el; el = el->next)
2110 /* Search for duplicates. */
2111 for (el2 = ns->entries; el2 != el; el2 = el2->next)
2112 if (el2->sym->result == el->sym->result)
2117 decl = build_decl (FIELD_DECL,
2118 get_identifier (el->sym->result->name),
2119 gfc_sym_type (el->sym->result));
2120 DECL_CONTEXT (decl) = type;
2121 fieldlist = chainon (fieldlist, decl);
2125 /* Finish off the type. */
2126 TYPE_FIELDS (type) = fieldlist;
2128 gfc_finish_type (type);
2129 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type)) = 1;
2134 gfc_get_function_type (gfc_symbol * sym)
2138 gfc_formal_arglist *f;
2141 int alternate_return;
2143 /* Make sure this symbol is a function, a subroutine or the main
2145 gcc_assert (sym->attr.flavor == FL_PROCEDURE
2146 || sym->attr.flavor == FL_PROGRAM);
2148 if (sym->backend_decl)
2149 return TREE_TYPE (sym->backend_decl);
2152 alternate_return = 0;
2153 typelist = NULL_TREE;
2155 if (sym->attr.entry_master)
2157 /* Additional parameter for selecting an entry point. */
2158 typelist = gfc_chainon_list (typelist, gfc_array_index_type);
2166 if (arg->ts.type == BT_CHARACTER)
2167 gfc_conv_const_charlen (arg->ts.cl);
2169 /* Some functions we use an extra parameter for the return value. */
2170 if (gfc_return_by_reference (sym))
2172 type = gfc_sym_type (arg);
2173 if (arg->ts.type == BT_COMPLEX
2174 || arg->attr.dimension
2175 || arg->ts.type == BT_CHARACTER)
2176 type = build_reference_type (type);
2178 typelist = gfc_chainon_list (typelist, type);
2179 if (arg->ts.type == BT_CHARACTER)
2180 typelist = gfc_chainon_list (typelist, gfc_charlen_type_node);
2183 /* Build the argument types for the function. */
2184 for (f = sym->formal; f; f = f->next)
2189 /* Evaluate constant character lengths here so that they can be
2190 included in the type. */
2191 if (arg->ts.type == BT_CHARACTER)
2192 gfc_conv_const_charlen (arg->ts.cl);
2194 if (arg->attr.flavor == FL_PROCEDURE)
2196 type = gfc_get_function_type (arg);
2197 type = build_pointer_type (type);
2200 type = gfc_sym_type (arg);
2202 /* Parameter Passing Convention
2204 We currently pass all parameters by reference.
2205 Parameters with INTENT(IN) could be passed by value.
2206 The problem arises if a function is called via an implicit
2207 prototype. In this situation the INTENT is not known.
2208 For this reason all parameters to global functions must be
2209 passed by reference. Passing by value would potentially
2210 generate bad code. Worse there would be no way of telling that
2211 this code was bad, except that it would give incorrect results.
2213 Contained procedures could pass by value as these are never
2214 used without an explicit interface, and cannot be passed as
2215 actual parameters for a dummy procedure. */
2216 if (arg->ts.type == BT_CHARACTER)
2218 typelist = gfc_chainon_list (typelist, type);
2222 if (sym->attr.subroutine)
2223 alternate_return = 1;
2227 /* Add hidden string length parameters. */
2229 typelist = gfc_chainon_list (typelist, gfc_charlen_type_node);
2232 typelist = gfc_chainon_list (typelist, void_type_node);
2234 if (alternate_return)
2235 type = integer_type_node;
2236 else if (!sym->attr.function || gfc_return_by_reference (sym))
2237 type = void_type_node;
2238 else if (sym->attr.mixed_entry_master)
2239 type = gfc_get_mixed_entry_union (sym->ns);
2240 else if (gfc_option.flag_f2c
2241 && sym->ts.type == BT_REAL
2242 && sym->ts.kind == gfc_default_real_kind
2243 && !sym->attr.always_explicit)
2245 /* Special case: f2c calling conventions require that (scalar)
2246 default REAL functions return the C type double instead. f2c
2247 compatibility is only an issue with functions that don't
2248 require an explicit interface, as only these could be
2249 implemented in Fortran 77. */
2250 sym->ts.kind = gfc_default_double_kind;
2251 type = gfc_typenode_for_spec (&sym->ts);
2252 sym->ts.kind = gfc_default_real_kind;
2254 else if (sym->result && sym->result->attr.proc_pointer)
2255 /* Procedure pointer return values. */
2257 if (sym->result->attr.result && strcmp (sym->name,"ppr@") != 0)
2259 /* Unset proc_pointer as gfc_get_function_type
2260 is called recursively. */
2261 sym->result->attr.proc_pointer = 0;
2262 type = build_pointer_type (gfc_get_function_type (sym->result));
2263 sym->result->attr.proc_pointer = 1;
2266 type = gfc_sym_type (sym->result);
2269 type = gfc_sym_type (sym);
2271 type = build_function_type (type, typelist);
2276 /* Language hooks for middle-end access to type nodes. */
2278 /* Return an integer type with BITS bits of precision,
2279 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2282 gfc_type_for_size (unsigned bits, int unsignedp)
2287 for (i = 0; i <= MAX_INT_KINDS; ++i)
2289 tree type = gfc_integer_types[i];
2290 if (type && bits == TYPE_PRECISION (type))
2294 /* Handle TImode as a special case because it is used by some backends
2295 (e.g. ARM) even though it is not available for normal use. */
2296 #if HOST_BITS_PER_WIDE_INT >= 64
2297 if (bits == TYPE_PRECISION (intTI_type_node))
2298 return intTI_type_node;
2303 if (bits == TYPE_PRECISION (unsigned_intQI_type_node))
2304 return unsigned_intQI_type_node;
2305 if (bits == TYPE_PRECISION (unsigned_intHI_type_node))
2306 return unsigned_intHI_type_node;
2307 if (bits == TYPE_PRECISION (unsigned_intSI_type_node))
2308 return unsigned_intSI_type_node;
2309 if (bits == TYPE_PRECISION (unsigned_intDI_type_node))
2310 return unsigned_intDI_type_node;
2311 if (bits == TYPE_PRECISION (unsigned_intTI_type_node))
2312 return unsigned_intTI_type_node;
2318 /* Return a data type that has machine mode MODE. If the mode is an
2319 integer, then UNSIGNEDP selects between signed and unsigned types. */
2322 gfc_type_for_mode (enum machine_mode mode, int unsignedp)
2327 if (GET_MODE_CLASS (mode) == MODE_FLOAT)
2328 base = gfc_real_types;
2329 else if (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT)
2330 base = gfc_complex_types;
2331 else if (SCALAR_INT_MODE_P (mode))
2332 return gfc_type_for_size (GET_MODE_PRECISION (mode), unsignedp);
2333 else if (VECTOR_MODE_P (mode))
2335 enum machine_mode inner_mode = GET_MODE_INNER (mode);
2336 tree inner_type = gfc_type_for_mode (inner_mode, unsignedp);
2337 if (inner_type != NULL_TREE)
2338 return build_vector_type_for_mode (inner_type, mode);
2344 for (i = 0; i <= MAX_REAL_KINDS; ++i)
2346 tree type = base[i];
2347 if (type && mode == TYPE_MODE (type))
2354 /* Return TRUE if TYPE is a type with a hidden descriptor, fill in INFO
2358 gfc_get_array_descr_info (const_tree type, struct array_descr_info *info)
2361 bool indirect = false;
2362 tree etype, ptype, field, t, base_decl;
2363 tree data_off, offset_off, dim_off, dim_size, elem_size;
2364 tree lower_suboff, upper_suboff, stride_suboff;
2366 if (! GFC_DESCRIPTOR_TYPE_P (type))
2368 if (! POINTER_TYPE_P (type))
2370 type = TREE_TYPE (type);
2371 if (! GFC_DESCRIPTOR_TYPE_P (type))
2376 rank = GFC_TYPE_ARRAY_RANK (type);
2377 if (rank >= (int) (sizeof (info->dimen) / sizeof (info->dimen[0])))
2380 etype = GFC_TYPE_ARRAY_DATAPTR_TYPE (type);
2381 gcc_assert (POINTER_TYPE_P (etype));
2382 etype = TREE_TYPE (etype);
2383 gcc_assert (TREE_CODE (etype) == ARRAY_TYPE);
2384 etype = TREE_TYPE (etype);
2385 /* Can't handle variable sized elements yet. */
2386 if (int_size_in_bytes (etype) <= 0)
2388 /* Nor non-constant lower bounds in assumed shape arrays. */
2389 if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE)
2391 for (dim = 0; dim < rank; dim++)
2392 if (GFC_TYPE_ARRAY_LBOUND (type, dim) == NULL_TREE
2393 || TREE_CODE (GFC_TYPE_ARRAY_LBOUND (type, dim)) != INTEGER_CST)
2397 memset (info, '\0', sizeof (*info));
2398 info->ndimensions = rank;
2399 info->element_type = etype;
2400 ptype = build_pointer_type (gfc_array_index_type);
2403 info->base_decl = build_decl (VAR_DECL, NULL_TREE,
2404 build_pointer_type (ptype));
2405 base_decl = build1 (INDIRECT_REF, ptype, info->base_decl);
2408 info->base_decl = base_decl = build_decl (VAR_DECL, NULL_TREE, ptype);
2410 if (GFC_TYPE_ARRAY_SPAN (type))
2411 elem_size = GFC_TYPE_ARRAY_SPAN (type);
2413 elem_size = fold_convert (gfc_array_index_type, TYPE_SIZE_UNIT (etype));
2414 field = TYPE_FIELDS (TYPE_MAIN_VARIANT (type));
2415 data_off = byte_position (field);
2416 field = TREE_CHAIN (field);
2417 offset_off = byte_position (field);
2418 field = TREE_CHAIN (field);
2419 field = TREE_CHAIN (field);
2420 dim_off = byte_position (field);
2421 dim_size = TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (field)));
2422 field = TYPE_FIELDS (TREE_TYPE (TREE_TYPE (field)));
2423 stride_suboff = byte_position (field);
2424 field = TREE_CHAIN (field);
2425 lower_suboff = byte_position (field);
2426 field = TREE_CHAIN (field);
2427 upper_suboff = byte_position (field);
2430 if (!integer_zerop (data_off))
2431 t = build2 (POINTER_PLUS_EXPR, ptype, t, data_off);
2432 t = build1 (NOP_EXPR, build_pointer_type (ptr_type_node), t);
2433 info->data_location = build1 (INDIRECT_REF, ptr_type_node, t);
2434 if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ALLOCATABLE)
2435 info->allocated = build2 (NE_EXPR, boolean_type_node,
2436 info->data_location, null_pointer_node);
2437 else if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_POINTER)
2438 info->associated = build2 (NE_EXPR, boolean_type_node,
2439 info->data_location, null_pointer_node);
2441 for (dim = 0; dim < rank; dim++)
2443 t = build2 (POINTER_PLUS_EXPR, ptype, base_decl,
2444 size_binop (PLUS_EXPR, dim_off, lower_suboff));
2445 t = build1 (INDIRECT_REF, gfc_array_index_type, t);
2446 info->dimen[dim].lower_bound = t;
2447 t = build2 (POINTER_PLUS_EXPR, ptype, base_decl,
2448 size_binop (PLUS_EXPR, dim_off, upper_suboff));
2449 t = build1 (INDIRECT_REF, gfc_array_index_type, t);
2450 info->dimen[dim].upper_bound = t;
2451 if (GFC_TYPE_ARRAY_AKIND (type) == GFC_ARRAY_ASSUMED_SHAPE)
2453 /* Assumed shape arrays have known lower bounds. */
2454 info->dimen[dim].upper_bound
2455 = build2 (MINUS_EXPR, gfc_array_index_type,
2456 info->dimen[dim].upper_bound,
2457 info->dimen[dim].lower_bound);
2458 info->dimen[dim].lower_bound
2459 = fold_convert (gfc_array_index_type,
2460 GFC_TYPE_ARRAY_LBOUND (type, dim));
2461 info->dimen[dim].upper_bound
2462 = build2 (PLUS_EXPR, gfc_array_index_type,
2463 info->dimen[dim].lower_bound,
2464 info->dimen[dim].upper_bound);
2466 t = build2 (POINTER_PLUS_EXPR, ptype, base_decl,
2467 size_binop (PLUS_EXPR, dim_off, stride_suboff));
2468 t = build1 (INDIRECT_REF, gfc_array_index_type, t);
2469 t = build2 (MULT_EXPR, gfc_array_index_type, t, elem_size);
2470 info->dimen[dim].stride = t;
2471 dim_off = size_binop (PLUS_EXPR, dim_off, dim_size);
2477 #include "gt-fortran-trans-types.h"