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
;
167 get_int_kind_from_width (int size
)
171 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
172 if (gfc_integer_kinds
[i
].bit_size
== size
)
173 return gfc_integer_kinds
[i
].kind
;
179 get_int_kind_from_minimal_width (int size
)
183 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
184 if (gfc_integer_kinds
[i
].bit_size
>= size
)
185 return gfc_integer_kinds
[i
].kind
;
191 /* Generate the CInteropKind_t objects for the C interoperable
195 void init_c_interop_kinds (void)
198 tree intmax_type_node
= INT_TYPE_SIZE
== LONG_LONG_TYPE_SIZE
?
200 (LONG_TYPE_SIZE
== LONG_LONG_TYPE_SIZE
?
201 long_integer_type_node
:
202 long_long_integer_type_node
);
204 /* init all pointers in the list to NULL */
205 for (i
= 0; i
< ISOCBINDING_NUMBER
; i
++)
207 /* Initialize the name and value fields. */
208 c_interop_kinds_table
[i
].name
[0] = '\0';
209 c_interop_kinds_table
[i
].value
= -100;
210 c_interop_kinds_table
[i
].f90_type
= BT_UNKNOWN
;
213 #define NAMED_INTCST(a,b,c,d) \
214 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
215 c_interop_kinds_table[a].f90_type = BT_INTEGER; \
216 c_interop_kinds_table[a].value = c;
217 #define NAMED_REALCST(a,b,c) \
218 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
219 c_interop_kinds_table[a].f90_type = BT_REAL; \
220 c_interop_kinds_table[a].value = c;
221 #define NAMED_CMPXCST(a,b,c) \
222 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
223 c_interop_kinds_table[a].f90_type = BT_COMPLEX; \
224 c_interop_kinds_table[a].value = c;
225 #define NAMED_LOGCST(a,b,c) \
226 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
227 c_interop_kinds_table[a].f90_type = BT_LOGICAL; \
228 c_interop_kinds_table[a].value = c;
229 #define NAMED_CHARKNDCST(a,b,c) \
230 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
231 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
232 c_interop_kinds_table[a].value = c;
233 #define NAMED_CHARCST(a,b,c) \
234 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
235 c_interop_kinds_table[a].f90_type = BT_CHARACTER; \
236 c_interop_kinds_table[a].value = c;
237 #define DERIVED_TYPE(a,b,c) \
238 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
239 c_interop_kinds_table[a].f90_type = BT_DERIVED; \
240 c_interop_kinds_table[a].value = c;
241 #define PROCEDURE(a,b) \
242 strncpy (c_interop_kinds_table[a].name, b, strlen(b) + 1); \
243 c_interop_kinds_table[a].f90_type = BT_PROCEDURE; \
244 c_interop_kinds_table[a].value = 0;
245 #include "iso-c-binding.def"
249 /* Query the target to determine which machine modes are available for
250 computation. Choose KIND numbers for them. */
253 gfc_init_kinds (void)
256 int i_index
, r_index
, kind
;
257 bool saw_i4
= false, saw_i8
= false;
258 bool saw_r4
= false, saw_r8
= false, saw_r16
= false;
260 for (i_index
= 0, mode
= MIN_MODE_INT
; mode
<= MAX_MODE_INT
; mode
++)
264 if (!targetm
.scalar_mode_supported_p ((enum machine_mode
) mode
))
267 /* The middle end doesn't support constants larger than 2*HWI.
268 Perhaps the target hook shouldn't have accepted these either,
269 but just to be safe... */
270 bitsize
= GET_MODE_BITSIZE (mode
);
271 if (bitsize
> 2*HOST_BITS_PER_WIDE_INT
)
274 gcc_assert (i_index
!= MAX_INT_KINDS
);
276 /* Let the kind equal the bit size divided by 8. This insulates the
277 programmer from the underlying byte size. */
285 gfc_integer_kinds
[i_index
].kind
= kind
;
286 gfc_integer_kinds
[i_index
].radix
= 2;
287 gfc_integer_kinds
[i_index
].digits
= bitsize
- 1;
288 gfc_integer_kinds
[i_index
].bit_size
= bitsize
;
290 gfc_logical_kinds
[i_index
].kind
= kind
;
291 gfc_logical_kinds
[i_index
].bit_size
= bitsize
;
296 /* Set the kind used to match GFC_INT_IO in libgfortran. This is
297 used for large file access. */
304 /* If we do not at least have kind = 4, everything is pointless. */
307 /* Set the maximum integer kind. Used with at least BOZ constants. */
308 gfc_max_integer_kind
= gfc_integer_kinds
[i_index
- 1].kind
;
310 for (r_index
= 0, mode
= MIN_MODE_FLOAT
; mode
<= MAX_MODE_FLOAT
; mode
++)
312 const struct real_format
*fmt
=
313 REAL_MODE_FORMAT ((enum machine_mode
) mode
);
318 if (!targetm
.scalar_mode_supported_p ((enum machine_mode
) mode
))
321 /* Only let float/double/long double go through because the fortran
322 library assumes these are the only floating point types. */
324 if (mode
!= TYPE_MODE (float_type_node
)
325 && (mode
!= TYPE_MODE (double_type_node
))
326 && (mode
!= TYPE_MODE (long_double_type_node
)))
329 /* Let the kind equal the precision divided by 8, rounding up. Again,
330 this insulates the programmer from the underlying byte size.
332 Also, it effectively deals with IEEE extended formats. There, the
333 total size of the type may equal 16, but it's got 6 bytes of padding
334 and the increased size can get in the way of a real IEEE quad format
335 which may also be supported by the target.
337 We round up so as to handle IA-64 __floatreg (RFmode), which is an
338 82 bit type. Not to be confused with __float80 (XFmode), which is
339 an 80 bit type also supported by IA-64. So XFmode should come out
340 to be kind=10, and RFmode should come out to be kind=11. Egads. */
342 kind
= (GET_MODE_PRECISION (mode
) + 7) / 8;
351 /* Careful we don't stumble a weird internal mode. */
352 gcc_assert (r_index
<= 0 || gfc_real_kinds
[r_index
-1].kind
!= kind
);
353 /* Or have too many modes for the allocated space. */
354 gcc_assert (r_index
!= MAX_REAL_KINDS
);
356 gfc_real_kinds
[r_index
].kind
= kind
;
357 gfc_real_kinds
[r_index
].radix
= fmt
->b
;
358 gfc_real_kinds
[r_index
].digits
= fmt
->p
;
359 gfc_real_kinds
[r_index
].min_exponent
= fmt
->emin
;
360 gfc_real_kinds
[r_index
].max_exponent
= fmt
->emax
;
361 if (fmt
->pnan
< fmt
->p
)
362 /* This is an IBM extended double format (or the MIPS variant)
363 made up of two IEEE doubles. The value of the long double is
364 the sum of the values of the two parts. The most significant
365 part is required to be the value of the long double rounded
366 to the nearest double. If we use emax of 1024 then we can't
367 represent huge(x) = (1 - b**(-p)) * b**(emax-1) * b, because
368 rounding will make the most significant part overflow. */
369 gfc_real_kinds
[r_index
].max_exponent
= fmt
->emax
- 1;
370 gfc_real_kinds
[r_index
].mode_precision
= GET_MODE_PRECISION (mode
);
374 /* Choose the default integer kind. We choose 4 unless the user
375 directs us otherwise. */
376 if (gfc_option
.flag_default_integer
)
379 fatal_error ("integer kind=8 not available for -fdefault-integer-8 option");
380 gfc_default_integer_kind
= 8;
382 /* Even if the user specified that the default integer kind be 8,
383 the numeric storage size isn't 64. In this case, a warning will
384 be issued when NUMERIC_STORAGE_SIZE is used. */
385 gfc_numeric_storage_size
= 4 * 8;
389 gfc_default_integer_kind
= 4;
390 gfc_numeric_storage_size
= 4 * 8;
394 gfc_default_integer_kind
= gfc_integer_kinds
[i_index
- 1].kind
;
395 gfc_numeric_storage_size
= gfc_integer_kinds
[i_index
- 1].bit_size
;
398 /* Choose the default real kind. Again, we choose 4 when possible. */
399 if (gfc_option
.flag_default_real
)
402 fatal_error ("real kind=8 not available for -fdefault-real-8 option");
403 gfc_default_real_kind
= 8;
406 gfc_default_real_kind
= 4;
408 gfc_default_real_kind
= gfc_real_kinds
[0].kind
;
410 /* Choose the default double kind. If -fdefault-real and -fdefault-double
411 are specified, we use kind=8, if it's available. If -fdefault-real is
412 specified without -fdefault-double, we use kind=16, if it's available.
413 Otherwise we do not change anything. */
414 if (gfc_option
.flag_default_double
&& !gfc_option
.flag_default_real
)
415 fatal_error ("Use of -fdefault-double-8 requires -fdefault-real-8");
417 if (gfc_option
.flag_default_real
&& gfc_option
.flag_default_double
&& saw_r8
)
418 gfc_default_double_kind
= 8;
419 else if (gfc_option
.flag_default_real
&& saw_r16
)
420 gfc_default_double_kind
= 16;
421 else if (saw_r4
&& saw_r8
)
422 gfc_default_double_kind
= 8;
425 /* F95 14.6.3.1: A nonpointer scalar object of type double precision
426 real ... occupies two contiguous numeric storage units.
428 Therefore we must be supplied a kind twice as large as we chose
429 for single precision. There are loopholes, in that double
430 precision must *occupy* two storage units, though it doesn't have
431 to *use* two storage units. Which means that you can make this
432 kind artificially wide by padding it. But at present there are
433 no GCC targets for which a two-word type does not exist, so we
434 just let gfc_validate_kind abort and tell us if something breaks. */
436 gfc_default_double_kind
437 = gfc_validate_kind (BT_REAL
, gfc_default_real_kind
* 2, false);
440 /* The default logical kind is constrained to be the same as the
441 default integer kind. Similarly with complex and real. */
442 gfc_default_logical_kind
= gfc_default_integer_kind
;
443 gfc_default_complex_kind
= gfc_default_real_kind
;
445 /* We only have two character kinds: ASCII and UCS-4.
446 ASCII corresponds to a 8-bit integer type, if one is available.
447 UCS-4 corresponds to a 32-bit integer type, if one is available. */
449 if ((kind
= get_int_kind_from_width (8)) > 0)
451 gfc_character_kinds
[i_index
].kind
= kind
;
452 gfc_character_kinds
[i_index
].bit_size
= 8;
453 gfc_character_kinds
[i_index
].name
= "ascii";
456 if ((kind
= get_int_kind_from_width (32)) > 0)
458 gfc_character_kinds
[i_index
].kind
= kind
;
459 gfc_character_kinds
[i_index
].bit_size
= 32;
460 gfc_character_kinds
[i_index
].name
= "iso_10646";
464 /* Choose the smallest integer kind for our default character. */
465 gfc_default_character_kind
= gfc_character_kinds
[0].kind
;
466 gfc_character_storage_size
= gfc_default_character_kind
* 8;
468 /* Choose the integer kind the same size as "void*" for our index kind. */
469 gfc_index_integer_kind
= POINTER_SIZE
/ 8;
470 /* Pick a kind the same size as the C "int" type. */
471 gfc_c_int_kind
= INT_TYPE_SIZE
/ 8;
473 /* initialize the C interoperable kinds */
474 init_c_interop_kinds();
477 /* Make sure that a valid kind is present. Returns an index into the
478 associated kinds array, -1 if the kind is not present. */
481 validate_integer (int kind
)
485 for (i
= 0; gfc_integer_kinds
[i
].kind
!= 0; i
++)
486 if (gfc_integer_kinds
[i
].kind
== kind
)
493 validate_real (int kind
)
497 for (i
= 0; gfc_real_kinds
[i
].kind
!= 0; i
++)
498 if (gfc_real_kinds
[i
].kind
== kind
)
505 validate_logical (int kind
)
509 for (i
= 0; gfc_logical_kinds
[i
].kind
; i
++)
510 if (gfc_logical_kinds
[i
].kind
== kind
)
517 validate_character (int kind
)
521 for (i
= 0; gfc_character_kinds
[i
].kind
; i
++)
522 if (gfc_character_kinds
[i
].kind
== kind
)
528 /* Validate a kind given a basic type. The return value is the same
529 for the child functions, with -1 indicating nonexistence of the
530 type. If MAY_FAIL is false, then -1 is never returned, and we ICE. */
533 gfc_validate_kind (bt type
, int kind
, bool may_fail
)
539 case BT_REAL
: /* Fall through */
541 rc
= validate_real (kind
);
544 rc
= validate_integer (kind
);
547 rc
= validate_logical (kind
);
550 rc
= validate_character (kind
);
554 gfc_internal_error ("gfc_validate_kind(): Got bad type");
557 if (rc
< 0 && !may_fail
)
558 gfc_internal_error ("gfc_validate_kind(): Got bad kind");
564 /* Four subroutines of gfc_init_types. Create type nodes for the given kind.
565 Reuse common type nodes where possible. Recognize if the kind matches up
566 with a C type. This will be used later in determining which routines may
567 be scarfed from libm. */
570 gfc_build_int_type (gfc_integer_info
*info
)
572 int mode_precision
= info
->bit_size
;
574 if (mode_precision
== CHAR_TYPE_SIZE
)
576 if (mode_precision
== SHORT_TYPE_SIZE
)
578 if (mode_precision
== INT_TYPE_SIZE
)
580 if (mode_precision
== LONG_TYPE_SIZE
)
582 if (mode_precision
== LONG_LONG_TYPE_SIZE
)
583 info
->c_long_long
= 1;
585 if (TYPE_PRECISION (intQI_type_node
) == mode_precision
)
586 return intQI_type_node
;
587 if (TYPE_PRECISION (intHI_type_node
) == mode_precision
)
588 return intHI_type_node
;
589 if (TYPE_PRECISION (intSI_type_node
) == mode_precision
)
590 return intSI_type_node
;
591 if (TYPE_PRECISION (intDI_type_node
) == mode_precision
)
592 return intDI_type_node
;
593 if (TYPE_PRECISION (intTI_type_node
) == mode_precision
)
594 return intTI_type_node
;
596 return make_signed_type (mode_precision
);
600 gfc_build_uint_type (int size
)
602 if (size
== CHAR_TYPE_SIZE
)
603 return unsigned_char_type_node
;
604 if (size
== SHORT_TYPE_SIZE
)
605 return short_unsigned_type_node
;
606 if (size
== INT_TYPE_SIZE
)
607 return unsigned_type_node
;
608 if (size
== LONG_TYPE_SIZE
)
609 return long_unsigned_type_node
;
610 if (size
== LONG_LONG_TYPE_SIZE
)
611 return long_long_unsigned_type_node
;
613 return make_unsigned_type (size
);
618 gfc_build_real_type (gfc_real_info
*info
)
620 int mode_precision
= info
->mode_precision
;
623 if (mode_precision
== FLOAT_TYPE_SIZE
)
625 if (mode_precision
== DOUBLE_TYPE_SIZE
)
627 if (mode_precision
== LONG_DOUBLE_TYPE_SIZE
)
628 info
->c_long_double
= 1;
630 if (TYPE_PRECISION (float_type_node
) == mode_precision
)
631 return float_type_node
;
632 if (TYPE_PRECISION (double_type_node
) == mode_precision
)
633 return double_type_node
;
634 if (TYPE_PRECISION (long_double_type_node
) == mode_precision
)
635 return long_double_type_node
;
637 new_type
= make_node (REAL_TYPE
);
638 TYPE_PRECISION (new_type
) = mode_precision
;
639 layout_type (new_type
);
644 gfc_build_complex_type (tree scalar_type
)
648 if (scalar_type
== NULL
)
650 if (scalar_type
== float_type_node
)
651 return complex_float_type_node
;
652 if (scalar_type
== double_type_node
)
653 return complex_double_type_node
;
654 if (scalar_type
== long_double_type_node
)
655 return complex_long_double_type_node
;
657 new_type
= make_node (COMPLEX_TYPE
);
658 TREE_TYPE (new_type
) = scalar_type
;
659 layout_type (new_type
);
664 gfc_build_logical_type (gfc_logical_info
*info
)
666 int bit_size
= info
->bit_size
;
669 if (bit_size
== BOOL_TYPE_SIZE
)
672 return boolean_type_node
;
675 new_type
= make_unsigned_type (bit_size
);
676 TREE_SET_CODE (new_type
, BOOLEAN_TYPE
);
677 TYPE_MAX_VALUE (new_type
) = build_int_cst (new_type
, 1);
678 TYPE_PRECISION (new_type
) = 1;
684 /* Return the bit size of the C "size_t". */
690 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
691 return INT_TYPE_SIZE
;
692 if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
693 return LONG_TYPE_SIZE
;
694 if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
695 return SHORT_TYPE_SIZE
;
698 return LONG_TYPE_SIZE
;
703 /* Create the backend type nodes. We map them to their
704 equivalent C type, at least for now. We also give
705 names to the types here, and we push them in the
706 global binding level context.*/
709 gfc_init_types (void)
715 unsigned HOST_WIDE_INT hi
;
716 unsigned HOST_WIDE_INT lo
;
718 /* Create and name the types. */
719 #define PUSH_TYPE(name, node) \
720 pushdecl (build_decl (TYPE_DECL, get_identifier (name), node))
722 for (index
= 0; gfc_integer_kinds
[index
].kind
!= 0; ++index
)
724 type
= gfc_build_int_type (&gfc_integer_kinds
[index
]);
725 /* Ensure integer(kind=1) doesn't have TYPE_STRING_FLAG set. */
726 if (TYPE_STRING_FLAG (type
))
727 type
= make_signed_type (gfc_integer_kinds
[index
].bit_size
);
728 gfc_integer_types
[index
] = type
;
729 snprintf (name_buf
, sizeof(name_buf
), "integer(kind=%d)",
730 gfc_integer_kinds
[index
].kind
);
731 PUSH_TYPE (name_buf
, type
);
734 for (index
= 0; gfc_logical_kinds
[index
].kind
!= 0; ++index
)
736 type
= gfc_build_logical_type (&gfc_logical_kinds
[index
]);
737 gfc_logical_types
[index
] = type
;
738 snprintf (name_buf
, sizeof(name_buf
), "logical(kind=%d)",
739 gfc_logical_kinds
[index
].kind
);
740 PUSH_TYPE (name_buf
, type
);
743 for (index
= 0; gfc_real_kinds
[index
].kind
!= 0; index
++)
745 type
= gfc_build_real_type (&gfc_real_kinds
[index
]);
746 gfc_real_types
[index
] = type
;
747 snprintf (name_buf
, sizeof(name_buf
), "real(kind=%d)",
748 gfc_real_kinds
[index
].kind
);
749 PUSH_TYPE (name_buf
, type
);
751 type
= gfc_build_complex_type (type
);
752 gfc_complex_types
[index
] = type
;
753 snprintf (name_buf
, sizeof(name_buf
), "complex(kind=%d)",
754 gfc_real_kinds
[index
].kind
);
755 PUSH_TYPE (name_buf
, type
);
758 for (index
= 0; gfc_character_kinds
[index
].kind
!= 0; ++index
)
760 type
= gfc_build_uint_type (gfc_character_kinds
[index
].bit_size
);
761 type
= build_qualified_type (type
, TYPE_UNQUALIFIED
);
762 snprintf (name_buf
, sizeof(name_buf
), "character(kind=%d)",
763 gfc_character_kinds
[index
].kind
);
764 PUSH_TYPE (name_buf
, type
);
765 gfc_character_types
[index
] = type
;
766 gfc_pcharacter_types
[index
] = build_pointer_type (type
);
768 gfc_character1_type_node
= gfc_character_types
[0];
770 PUSH_TYPE ("byte", unsigned_char_type_node
);
771 PUSH_TYPE ("void", void_type_node
);
773 /* DBX debugging output gets upset if these aren't set. */
774 if (!TYPE_NAME (integer_type_node
))
775 PUSH_TYPE ("c_integer", integer_type_node
);
776 if (!TYPE_NAME (char_type_node
))
777 PUSH_TYPE ("c_char", char_type_node
);
781 pvoid_type_node
= build_pointer_type (void_type_node
);
782 ppvoid_type_node
= build_pointer_type (pvoid_type_node
);
783 pchar_type_node
= build_pointer_type (gfc_character1_type_node
);
785 = build_pointer_type (build_function_type (void_type_node
, NULL_TREE
));
787 gfc_array_index_type
= gfc_get_int_type (gfc_index_integer_kind
);
788 /* We cannot use gfc_index_zero_node in definition of gfc_array_range_type,
789 since this function is called before gfc_init_constants. */
791 = build_range_type (gfc_array_index_type
,
792 build_int_cst (gfc_array_index_type
, 0),
795 /* The maximum array element size that can be handled is determined
796 by the number of bits available to store this field in the array
799 n
= TYPE_PRECISION (gfc_array_index_type
) - GFC_DTYPE_SIZE_SHIFT
;
800 lo
= ~ (unsigned HOST_WIDE_INT
) 0;
801 if (n
> HOST_BITS_PER_WIDE_INT
)
802 hi
= lo
>> (2*HOST_BITS_PER_WIDE_INT
- n
);
804 hi
= 0, lo
>>= HOST_BITS_PER_WIDE_INT
- n
;
805 gfc_max_array_element_size
806 = build_int_cst_wide (long_unsigned_type_node
, lo
, hi
);
808 size_type_node
= gfc_array_index_type
;
810 boolean_type_node
= gfc_get_logical_type (gfc_default_logical_kind
);
811 boolean_true_node
= build_int_cst (boolean_type_node
, 1);
812 boolean_false_node
= build_int_cst (boolean_type_node
, 0);
814 /* ??? Shouldn't this be based on gfc_index_integer_kind or so? */
815 gfc_charlen_int_kind
= 4;
816 gfc_charlen_type_node
= gfc_get_int_type (gfc_charlen_int_kind
);
819 /* Get the type node for the given type and kind. */
822 gfc_get_int_type (int kind
)
824 int index
= gfc_validate_kind (BT_INTEGER
, kind
, true);
825 return index
< 0 ? 0 : gfc_integer_types
[index
];
829 gfc_get_real_type (int kind
)
831 int index
= gfc_validate_kind (BT_REAL
, kind
, true);
832 return index
< 0 ? 0 : gfc_real_types
[index
];
836 gfc_get_complex_type (int kind
)
838 int index
= gfc_validate_kind (BT_COMPLEX
, kind
, true);
839 return index
< 0 ? 0 : gfc_complex_types
[index
];
843 gfc_get_logical_type (int kind
)
845 int index
= gfc_validate_kind (BT_LOGICAL
, kind
, true);
846 return index
< 0 ? 0 : gfc_logical_types
[index
];
850 gfc_get_char_type (int kind
)
852 int index
= gfc_validate_kind (BT_CHARACTER
, kind
, true);
853 return index
< 0 ? 0 : gfc_character_types
[index
];
857 gfc_get_pchar_type (int kind
)
859 int index
= gfc_validate_kind (BT_CHARACTER
, kind
, true);
860 return index
< 0 ? 0 : gfc_pcharacter_types
[index
];
864 /* Create a character type with the given kind and length. */
867 gfc_get_character_type_len_for_eltype (tree eltype
, tree len
)
871 bounds
= build_range_type (gfc_charlen_type_node
, gfc_index_one_node
, len
);
872 type
= build_array_type (eltype
, bounds
);
873 TYPE_STRING_FLAG (type
) = 1;
879 gfc_get_character_type_len (int kind
, tree len
)
881 gfc_validate_kind (BT_CHARACTER
, kind
, false);
882 return gfc_get_character_type_len_for_eltype (gfc_get_char_type (kind
), len
);
886 /* Get a type node for a character kind. */
889 gfc_get_character_type (int kind
, gfc_charlen
* cl
)
893 len
= (cl
== NULL
) ? NULL_TREE
: cl
->backend_decl
;
895 return gfc_get_character_type_len (kind
, len
);
898 /* Covert a basic type. This will be an array for character types. */
901 gfc_typenode_for_spec (gfc_typespec
* spec
)
911 /* We use INTEGER(c_intptr_t) for C_PTR and C_FUNPTR once the symbol
912 has been resolved. This is done so we can convert C_PTR and
913 C_FUNPTR to simple variables that get translated to (void *). */
914 if (spec
->f90_type
== BT_VOID
)
917 && spec
->derived
->intmod_sym_id
== ISOCBINDING_PTR
)
918 basetype
= ptr_type_node
;
920 basetype
= pfunc_type_node
;
923 basetype
= gfc_get_int_type (spec
->kind
);
927 basetype
= gfc_get_real_type (spec
->kind
);
931 basetype
= gfc_get_complex_type (spec
->kind
);
935 basetype
= gfc_get_logical_type (spec
->kind
);
939 basetype
= gfc_get_character_type (spec
->kind
, spec
->cl
);
943 basetype
= gfc_get_derived_type (spec
->derived
);
945 /* If we're dealing with either C_PTR or C_FUNPTR, we modified the
946 type and kind to fit a (void *) and the basetype returned was a
947 ptr_type_node. We need to pass up this new information to the
948 symbol that was declared of type C_PTR or C_FUNPTR. */
949 if (spec
->derived
->attr
.is_iso_c
)
951 spec
->type
= spec
->derived
->ts
.type
;
952 spec
->kind
= spec
->derived
->ts
.kind
;
953 spec
->f90_type
= spec
->derived
->ts
.f90_type
;
957 /* This is for the second arg to c_f_pointer and c_f_procpointer
958 of the iso_c_binding module, to accept any ptr type. */
959 basetype
= ptr_type_node
;
960 if (spec
->f90_type
== BT_VOID
)
963 && spec
->derived
->intmod_sym_id
== ISOCBINDING_PTR
)
964 basetype
= ptr_type_node
;
966 basetype
= pfunc_type_node
;
975 /* Build an INT_CST for constant expressions, otherwise return NULL_TREE. */
978 gfc_conv_array_bound (gfc_expr
* expr
)
980 /* If expr is an integer constant, return that. */
981 if (expr
!= NULL
&& expr
->expr_type
== EXPR_CONSTANT
)
982 return gfc_conv_mpz_to_tree (expr
->value
.integer
, gfc_index_integer_kind
);
984 /* Otherwise return NULL. */
989 gfc_get_element_type (tree type
)
993 if (GFC_ARRAY_TYPE_P (type
))
995 if (TREE_CODE (type
) == POINTER_TYPE
)
996 type
= TREE_TYPE (type
);
997 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
998 element
= TREE_TYPE (type
);
1002 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type
));
1003 element
= GFC_TYPE_ARRAY_DATAPTR_TYPE (type
);
1005 gcc_assert (TREE_CODE (element
) == POINTER_TYPE
);
1006 element
= TREE_TYPE (element
);
1008 gcc_assert (TREE_CODE (element
) == ARRAY_TYPE
);
1009 element
= TREE_TYPE (element
);
1015 /* Build an array. This function is called from gfc_sym_type().
1016 Actually returns array descriptor type.
1018 Format of array descriptors is as follows:
1020 struct gfc_array_descriptor
1025 struct descriptor_dimension dimension[N_DIM];
1028 struct descriptor_dimension
1035 Translation code should use gfc_conv_descriptor_* rather than
1036 accessing the descriptor directly. Any changes to the array
1037 descriptor type will require changes in gfc_conv_descriptor_* and
1038 gfc_build_array_initializer.
1040 This is represented internally as a RECORD_TYPE. The index nodes
1041 are gfc_array_index_type and the data node is a pointer to the
1042 data. See below for the handling of character types.
1044 The dtype member is formatted as follows:
1045 rank = dtype & GFC_DTYPE_RANK_MASK // 3 bits
1046 type = (dtype & GFC_DTYPE_TYPE_MASK) >> GFC_DTYPE_TYPE_SHIFT // 3 bits
1047 size = dtype >> GFC_DTYPE_SIZE_SHIFT
1049 I originally used nested ARRAY_TYPE nodes to represent arrays, but
1050 this generated poor code for assumed/deferred size arrays. These
1051 require use of PLACEHOLDER_EXPR/WITH_RECORD_EXPR, which isn't part
1052 of the GENERIC grammar. Also, there is no way to explicitly set
1053 the array stride, so all data must be packed(1). I've tried to
1054 mark all the functions which would require modification with a GCC
1057 The data component points to the first element in the array. The
1058 offset field is the position of the origin of the array (i.e. element
1059 (0, 0 ...)). This may be outside the bounds of the array.
1061 An element is accessed by
1062 data[offset + index0*stride0 + index1*stride1 + index2*stride2]
1063 This gives good performance as the computation does not involve the
1064 bounds of the array. For packed arrays, this is optimized further
1065 by substituting the known strides.
1067 This system has one problem: all array bounds must be within 2^31
1068 elements of the origin (2^63 on 64-bit machines). For example
1069 integer, dimension (80000:90000, 80000:90000, 2) :: array
1070 may not work properly on 32-bit machines because 80000*80000 >
1071 2^31, so the calculation for stride2 would overflow. This may
1072 still work, but I haven't checked, and it relies on the overflow
1073 doing the right thing.
1075 The way to fix this problem is to access elements as follows:
1076 data[(index0-lbound0)*stride0 + (index1-lbound1)*stride1]
1077 Obviously this is much slower. I will make this a compile time
1078 option, something like -fsmall-array-offsets. Mixing code compiled
1079 with and without this switch will work.
1081 (1) This can be worked around by modifying the upper bound of the
1082 previous dimension. This requires extra fields in the descriptor
1083 (both real_ubound and fake_ubound). */
1086 /* Returns true if the array sym does not require a descriptor. */
1089 gfc_is_nodesc_array (gfc_symbol
* sym
)
1091 gcc_assert (sym
->attr
.dimension
);
1093 /* We only want local arrays. */
1094 if (sym
->attr
.pointer
|| sym
->attr
.allocatable
)
1097 if (sym
->attr
.dummy
)
1099 if (sym
->as
->type
!= AS_ASSUMED_SHAPE
)
1105 if (sym
->attr
.result
|| sym
->attr
.function
)
1108 gcc_assert (sym
->as
->type
== AS_EXPLICIT
);
1114 /* Create an array descriptor type. */
1117 gfc_build_array_type (tree type
, gfc_array_spec
* as
,
1118 enum gfc_array_kind akind
)
1120 tree lbound
[GFC_MAX_DIMENSIONS
];
1121 tree ubound
[GFC_MAX_DIMENSIONS
];
1124 for (n
= 0; n
< as
->rank
; n
++)
1126 /* Create expressions for the known bounds of the array. */
1127 if (as
->type
== AS_ASSUMED_SHAPE
&& as
->lower
[n
] == NULL
)
1128 lbound
[n
] = gfc_index_one_node
;
1130 lbound
[n
] = gfc_conv_array_bound (as
->lower
[n
]);
1131 ubound
[n
] = gfc_conv_array_bound (as
->upper
[n
]);
1134 if (as
->type
== AS_ASSUMED_SHAPE
)
1135 akind
= GFC_ARRAY_ASSUMED_SHAPE
;
1136 return gfc_get_array_type_bounds (type
, as
->rank
, lbound
, ubound
, 0, akind
);
1139 /* Returns the struct descriptor_dimension type. */
1142 gfc_get_desc_dim_type (void)
1148 if (gfc_desc_dim_type
)
1149 return gfc_desc_dim_type
;
1151 /* Build the type node. */
1152 type
= make_node (RECORD_TYPE
);
1154 TYPE_NAME (type
) = get_identifier ("descriptor_dimension");
1155 TYPE_PACKED (type
) = 1;
1157 /* Consists of the stride, lbound and ubound members. */
1158 decl
= build_decl (FIELD_DECL
,
1159 get_identifier ("stride"), gfc_array_index_type
);
1160 DECL_CONTEXT (decl
) = type
;
1161 TREE_NO_WARNING (decl
) = 1;
1164 decl
= build_decl (FIELD_DECL
,
1165 get_identifier ("lbound"), gfc_array_index_type
);
1166 DECL_CONTEXT (decl
) = type
;
1167 TREE_NO_WARNING (decl
) = 1;
1168 fieldlist
= chainon (fieldlist
, decl
);
1170 decl
= build_decl (FIELD_DECL
,
1171 get_identifier ("ubound"), gfc_array_index_type
);
1172 DECL_CONTEXT (decl
) = type
;
1173 TREE_NO_WARNING (decl
) = 1;
1174 fieldlist
= chainon (fieldlist
, decl
);
1176 /* Finish off the type. */
1177 TYPE_FIELDS (type
) = fieldlist
;
1179 gfc_finish_type (type
);
1180 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
)) = 1;
1182 gfc_desc_dim_type
= type
;
1187 /* Return the DTYPE for an array. This describes the type and type parameters
1189 /* TODO: Only call this when the value is actually used, and make all the
1190 unknown cases abort. */
1193 gfc_get_dtype (tree type
)
1203 gcc_assert (GFC_DESCRIPTOR_TYPE_P (type
) || GFC_ARRAY_TYPE_P (type
));
1205 if (GFC_TYPE_ARRAY_DTYPE (type
))
1206 return GFC_TYPE_ARRAY_DTYPE (type
);
1208 rank
= GFC_TYPE_ARRAY_RANK (type
);
1209 etype
= gfc_get_element_type (type
);
1211 switch (TREE_CODE (etype
))
1214 n
= GFC_DTYPE_INTEGER
;
1218 n
= GFC_DTYPE_LOGICAL
;
1226 n
= GFC_DTYPE_COMPLEX
;
1229 /* We will never have arrays of arrays. */
1231 n
= GFC_DTYPE_DERIVED
;
1235 n
= GFC_DTYPE_CHARACTER
;
1239 /* TODO: Don't do dtype for temporary descriptorless arrays. */
1240 /* We can strange array types for temporary arrays. */
1241 return gfc_index_zero_node
;
1244 gcc_assert (rank
<= GFC_DTYPE_RANK_MASK
);
1245 size
= TYPE_SIZE_UNIT (etype
);
1247 i
= rank
| (n
<< GFC_DTYPE_TYPE_SHIFT
);
1248 if (size
&& INTEGER_CST_P (size
))
1250 if (tree_int_cst_lt (gfc_max_array_element_size
, size
))
1251 internal_error ("Array element size too big");
1253 i
+= TREE_INT_CST_LOW (size
) << GFC_DTYPE_SIZE_SHIFT
;
1255 dtype
= build_int_cst (gfc_array_index_type
, i
);
1257 if (size
&& !INTEGER_CST_P (size
))
1259 tmp
= build_int_cst (gfc_array_index_type
, GFC_DTYPE_SIZE_SHIFT
);
1260 tmp
= fold_build2 (LSHIFT_EXPR
, gfc_array_index_type
,
1261 fold_convert (gfc_array_index_type
, size
), tmp
);
1262 dtype
= fold_build2 (PLUS_EXPR
, gfc_array_index_type
, tmp
, dtype
);
1264 /* If we don't know the size we leave it as zero. This should never happen
1265 for anything that is actually used. */
1266 /* TODO: Check this is actually true, particularly when repacking
1267 assumed size parameters. */
1269 GFC_TYPE_ARRAY_DTYPE (type
) = dtype
;
1274 /* Build an array type for use without a descriptor, packed according
1275 to the value of PACKED. */
1278 gfc_get_nodesc_array_type (tree etype
, gfc_array_spec
* as
, gfc_packed packed
)
1291 mpz_init_set_ui (offset
, 0);
1292 mpz_init_set_ui (stride
, 1);
1295 /* We don't use build_array_type because this does not include include
1296 lang-specific information (i.e. the bounds of the array) when checking
1298 type
= make_node (ARRAY_TYPE
);
1300 GFC_ARRAY_TYPE_P (type
) = 1;
1301 TYPE_LANG_SPECIFIC (type
) = (struct lang_type
*)
1302 ggc_alloc_cleared (sizeof (struct lang_type
));
1304 known_stride
= (packed
!= PACKED_NO
);
1306 for (n
= 0; n
< as
->rank
; n
++)
1308 /* Fill in the stride and bound components of the type. */
1310 tmp
= gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1313 GFC_TYPE_ARRAY_STRIDE (type
, n
) = tmp
;
1315 expr
= as
->lower
[n
];
1316 if (expr
->expr_type
== EXPR_CONSTANT
)
1318 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1319 gfc_index_integer_kind
);
1326 GFC_TYPE_ARRAY_LBOUND (type
, n
) = tmp
;
1330 /* Calculate the offset. */
1331 mpz_mul (delta
, stride
, as
->lower
[n
]->value
.integer
);
1332 mpz_sub (offset
, offset
, delta
);
1337 expr
= as
->upper
[n
];
1338 if (expr
&& expr
->expr_type
== EXPR_CONSTANT
)
1340 tmp
= gfc_conv_mpz_to_tree (expr
->value
.integer
,
1341 gfc_index_integer_kind
);
1348 GFC_TYPE_ARRAY_UBOUND (type
, n
) = tmp
;
1352 /* Calculate the stride. */
1353 mpz_sub (delta
, as
->upper
[n
]->value
.integer
,
1354 as
->lower
[n
]->value
.integer
);
1355 mpz_add_ui (delta
, delta
, 1);
1356 mpz_mul (stride
, stride
, delta
);
1359 /* Only the first stride is known for partial packed arrays. */
1360 if (packed
== PACKED_NO
|| packed
== PACKED_PARTIAL
)
1366 GFC_TYPE_ARRAY_OFFSET (type
) =
1367 gfc_conv_mpz_to_tree (offset
, gfc_index_integer_kind
);
1370 GFC_TYPE_ARRAY_OFFSET (type
) = NULL_TREE
;
1374 GFC_TYPE_ARRAY_SIZE (type
) =
1375 gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1378 GFC_TYPE_ARRAY_SIZE (type
) = NULL_TREE
;
1380 GFC_TYPE_ARRAY_RANK (type
) = as
->rank
;
1381 GFC_TYPE_ARRAY_DTYPE (type
) = NULL_TREE
;
1382 range
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
1384 /* TODO: use main type if it is unbounded. */
1385 GFC_TYPE_ARRAY_DATAPTR_TYPE (type
) =
1386 build_pointer_type (build_array_type (etype
, range
));
1390 mpz_sub_ui (stride
, stride
, 1);
1391 range
= gfc_conv_mpz_to_tree (stride
, gfc_index_integer_kind
);
1396 range
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
, range
);
1397 TYPE_DOMAIN (type
) = range
;
1399 build_pointer_type (etype
);
1400 TREE_TYPE (type
) = etype
;
1408 /* Represent packed arrays as multi-dimensional if they have rank >
1409 1 and with proper bounds, instead of flat arrays. This makes for
1410 better debug info. */
1413 tree gtype
= etype
, rtype
, type_decl
;
1415 for (n
= as
->rank
- 1; n
>= 0; n
--)
1417 rtype
= build_range_type (gfc_array_index_type
,
1418 GFC_TYPE_ARRAY_LBOUND (type
, n
),
1419 GFC_TYPE_ARRAY_UBOUND (type
, n
));
1420 gtype
= build_array_type (gtype
, rtype
);
1422 TYPE_NAME (type
) = type_decl
= build_decl (TYPE_DECL
, NULL
, gtype
);
1423 DECL_ORIGINAL_TYPE (type_decl
) = gtype
;
1426 if (packed
!= PACKED_STATIC
|| !known_stride
)
1428 /* For dummy arrays and automatic (heap allocated) arrays we
1429 want a pointer to the array. */
1430 type
= build_pointer_type (type
);
1431 GFC_ARRAY_TYPE_P (type
) = 1;
1432 TYPE_LANG_SPECIFIC (type
) = TYPE_LANG_SPECIFIC (TREE_TYPE (type
));
1437 /* Return or create the base type for an array descriptor. */
1440 gfc_get_array_descriptor_base (int dimen
)
1442 tree fat_type
, fieldlist
, decl
, arraytype
;
1443 char name
[16 + GFC_RANK_DIGITS
+ 1];
1445 gcc_assert (dimen
>= 1 && dimen
<= GFC_MAX_DIMENSIONS
);
1446 if (gfc_array_descriptor_base
[dimen
- 1])
1447 return gfc_array_descriptor_base
[dimen
- 1];
1449 /* Build the type node. */
1450 fat_type
= make_node (RECORD_TYPE
);
1452 sprintf (name
, "array_descriptor" GFC_RANK_PRINTF_FORMAT
, dimen
);
1453 TYPE_NAME (fat_type
) = get_identifier (name
);
1455 /* Add the data member as the first element of the descriptor. */
1456 decl
= build_decl (FIELD_DECL
, get_identifier ("data"), ptr_type_node
);
1458 DECL_CONTEXT (decl
) = fat_type
;
1461 /* Add the base component. */
1462 decl
= build_decl (FIELD_DECL
, get_identifier ("offset"),
1463 gfc_array_index_type
);
1464 DECL_CONTEXT (decl
) = fat_type
;
1465 TREE_NO_WARNING (decl
) = 1;
1466 fieldlist
= chainon (fieldlist
, decl
);
1468 /* Add the dtype component. */
1469 decl
= build_decl (FIELD_DECL
, get_identifier ("dtype"),
1470 gfc_array_index_type
);
1471 DECL_CONTEXT (decl
) = fat_type
;
1472 TREE_NO_WARNING (decl
) = 1;
1473 fieldlist
= chainon (fieldlist
, decl
);
1475 /* Build the array type for the stride and bound components. */
1477 build_array_type (gfc_get_desc_dim_type (),
1478 build_range_type (gfc_array_index_type
,
1479 gfc_index_zero_node
,
1480 gfc_rank_cst
[dimen
- 1]));
1482 decl
= build_decl (FIELD_DECL
, get_identifier ("dim"), arraytype
);
1483 DECL_CONTEXT (decl
) = fat_type
;
1484 TREE_NO_WARNING (decl
) = 1;
1485 fieldlist
= chainon (fieldlist
, decl
);
1487 /* Finish off the type. */
1488 TYPE_FIELDS (fat_type
) = fieldlist
;
1490 gfc_finish_type (fat_type
);
1491 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (fat_type
)) = 1;
1493 gfc_array_descriptor_base
[dimen
- 1] = fat_type
;
1497 /* Build an array (descriptor) type with given bounds. */
1500 gfc_get_array_type_bounds (tree etype
, int dimen
, tree
* lbound
,
1501 tree
* ubound
, int packed
,
1502 enum gfc_array_kind akind
)
1504 char name
[8 + GFC_RANK_DIGITS
+ GFC_MAX_SYMBOL_LEN
];
1505 tree fat_type
, base_type
, arraytype
, lower
, upper
, stride
, tmp
, rtype
;
1506 const char *type_name
;
1509 base_type
= gfc_get_array_descriptor_base (dimen
);
1510 fat_type
= build_variant_type_copy (base_type
);
1512 tmp
= TYPE_NAME (etype
);
1513 if (tmp
&& TREE_CODE (tmp
) == TYPE_DECL
)
1514 tmp
= DECL_NAME (tmp
);
1516 type_name
= IDENTIFIER_POINTER (tmp
);
1518 type_name
= "unknown";
1519 sprintf (name
, "array" GFC_RANK_PRINTF_FORMAT
"_%.*s", dimen
,
1520 GFC_MAX_SYMBOL_LEN
, type_name
);
1521 TYPE_NAME (fat_type
) = get_identifier (name
);
1523 GFC_DESCRIPTOR_TYPE_P (fat_type
) = 1;
1524 TYPE_LANG_SPECIFIC (fat_type
) = (struct lang_type
*)
1525 ggc_alloc_cleared (sizeof (struct lang_type
));
1527 GFC_TYPE_ARRAY_RANK (fat_type
) = dimen
;
1528 GFC_TYPE_ARRAY_DTYPE (fat_type
) = NULL_TREE
;
1529 GFC_TYPE_ARRAY_AKIND (fat_type
) = akind
;
1531 /* Build an array descriptor record type. */
1533 stride
= gfc_index_one_node
;
1536 for (n
= 0; n
< dimen
; n
++)
1538 GFC_TYPE_ARRAY_STRIDE (fat_type
, n
) = stride
;
1545 if (lower
!= NULL_TREE
)
1547 if (INTEGER_CST_P (lower
))
1548 GFC_TYPE_ARRAY_LBOUND (fat_type
, n
) = lower
;
1554 if (upper
!= NULL_TREE
)
1556 if (INTEGER_CST_P (upper
))
1557 GFC_TYPE_ARRAY_UBOUND (fat_type
, n
) = upper
;
1562 if (upper
!= NULL_TREE
&& lower
!= NULL_TREE
&& stride
!= NULL_TREE
)
1564 tmp
= fold_build2 (MINUS_EXPR
, gfc_array_index_type
, upper
, lower
);
1565 tmp
= fold_build2 (PLUS_EXPR
, gfc_array_index_type
, tmp
,
1566 gfc_index_one_node
);
1568 fold_build2 (MULT_EXPR
, gfc_array_index_type
, tmp
, stride
);
1569 /* Check the folding worked. */
1570 gcc_assert (INTEGER_CST_P (stride
));
1575 GFC_TYPE_ARRAY_SIZE (fat_type
) = stride
;
1577 /* TODO: known offsets for descriptors. */
1578 GFC_TYPE_ARRAY_OFFSET (fat_type
) = NULL_TREE
;
1580 /* We define data as an array with the correct size if possible.
1581 Much better than doing pointer arithmetic. */
1583 rtype
= build_range_type (gfc_array_index_type
, gfc_index_zero_node
,
1584 int_const_binop (MINUS_EXPR
, stride
,
1585 integer_one_node
, 0));
1587 rtype
= gfc_array_range_type
;
1588 arraytype
= build_array_type (etype
, rtype
);
1589 arraytype
= build_pointer_type (arraytype
);
1590 GFC_TYPE_ARRAY_DATAPTR_TYPE (fat_type
) = arraytype
;
1595 /* Build a pointer type. This function is called from gfc_sym_type(). */
1598 gfc_build_pointer_type (gfc_symbol
* sym
, tree type
)
1600 /* Array pointer types aren't actually pointers. */
1601 if (sym
->attr
.dimension
)
1604 return build_pointer_type (type
);
1607 /* Return the type for a symbol. Special handling is required for character
1608 types to get the correct level of indirection.
1609 For functions return the return type.
1610 For subroutines return void_type_node.
1611 Calling this multiple times for the same symbol should be avoided,
1612 especially for character and array types. */
1615 gfc_sym_type (gfc_symbol
* sym
)
1620 /* Procedure Pointers inside COMMON blocks. */
1621 if (sym
->attr
.proc_pointer
&& sym
->attr
.in_common
)
1623 /* Unset proc_pointer as gfc_get_function_type calls gfc_sym_type. */
1624 sym
->attr
.proc_pointer
= 0;
1625 type
= build_pointer_type (gfc_get_function_type (sym
));
1626 sym
->attr
.proc_pointer
= 1;
1630 if (sym
->attr
.flavor
== FL_PROCEDURE
&& !sym
->attr
.function
)
1631 return void_type_node
;
1633 /* In the case of a function the fake result variable may have a
1634 type different from the function type, so don't return early in
1636 if (sym
->backend_decl
&& !sym
->attr
.function
)
1637 return TREE_TYPE (sym
->backend_decl
);
1639 if (sym
->ts
.type
== BT_CHARACTER
1640 && ((sym
->attr
.function
&& sym
->attr
.is_bind_c
)
1641 || (sym
->attr
.result
1642 && sym
->ns
->proc_name
1643 && sym
->ns
->proc_name
->attr
.is_bind_c
)))
1644 type
= gfc_character1_type_node
;
1646 type
= gfc_typenode_for_spec (&sym
->ts
);
1648 if (sym
->attr
.dummy
&& !sym
->attr
.function
&& !sym
->attr
.value
)
1653 if (sym
->attr
.dimension
)
1655 if (gfc_is_nodesc_array (sym
))
1657 /* If this is a character argument of unknown length, just use the
1659 if (sym
->ts
.type
!= BT_CHARACTER
1660 || !(sym
->attr
.dummy
|| sym
->attr
.function
)
1661 || sym
->ts
.cl
->backend_decl
)
1663 type
= gfc_get_nodesc_array_type (type
, sym
->as
,
1671 enum gfc_array_kind akind
= GFC_ARRAY_UNKNOWN
;
1672 if (sym
->attr
.pointer
)
1673 akind
= GFC_ARRAY_POINTER
;
1674 else if (sym
->attr
.allocatable
)
1675 akind
= GFC_ARRAY_ALLOCATABLE
;
1676 type
= gfc_build_array_type (type
, sym
->as
, akind
);
1681 if (sym
->attr
.allocatable
|| sym
->attr
.pointer
)
1682 type
= gfc_build_pointer_type (sym
, type
);
1683 if (sym
->attr
.pointer
)
1684 GFC_POINTER_TYPE_P (type
) = 1;
1687 /* We currently pass all parameters by reference.
1688 See f95_get_function_decl. For dummy function parameters return the
1692 /* We must use pointer types for potentially absent variables. The
1693 optimizers assume a reference type argument is never NULL. */
1694 if (sym
->attr
.optional
|| sym
->ns
->proc_name
->attr
.entry_master
)
1695 type
= build_pointer_type (type
);
1697 type
= build_reference_type (type
);
1703 /* Layout and output debug info for a record type. */
1706 gfc_finish_type (tree type
)
1710 decl
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
1711 TYPE_STUB_DECL (type
) = decl
;
1713 rest_of_type_compilation (type
, 1);
1714 rest_of_decl_compilation (decl
, 1, 0);
1717 /* Add a field of given NAME and TYPE to the context of a UNION_TYPE
1718 or RECORD_TYPE pointed to by STYPE. The new field is chained
1719 to the fieldlist pointed to by FIELDLIST.
1721 Returns a pointer to the new field. */
1724 gfc_add_field_to_struct (tree
*fieldlist
, tree context
,
1725 tree name
, tree type
)
1729 decl
= build_decl (FIELD_DECL
, name
, type
);
1731 DECL_CONTEXT (decl
) = context
;
1732 DECL_INITIAL (decl
) = 0;
1733 DECL_ALIGN (decl
) = 0;
1734 DECL_USER_ALIGN (decl
) = 0;
1735 TREE_CHAIN (decl
) = NULL_TREE
;
1736 *fieldlist
= chainon (*fieldlist
, decl
);
1742 /* Copy the backend_decl and component backend_decls if
1743 the two derived type symbols are "equal", as described
1744 in 4.4.2 and resolved by gfc_compare_derived_types. */
1747 copy_dt_decls_ifequal (gfc_symbol
*from
, gfc_symbol
*to
)
1749 gfc_component
*to_cm
;
1750 gfc_component
*from_cm
;
1752 if (from
->backend_decl
== NULL
1753 || !gfc_compare_derived_types (from
, to
))
1756 to
->backend_decl
= from
->backend_decl
;
1758 to_cm
= to
->components
;
1759 from_cm
= from
->components
;
1761 /* Copy the component declarations. If a component is itself
1762 a derived type, we need a copy of its component declarations.
1763 This is done by recursing into gfc_get_derived_type and
1764 ensures that the component's component declarations have
1765 been built. If it is a character, we need the character
1767 for (; to_cm
; to_cm
= to_cm
->next
, from_cm
= from_cm
->next
)
1769 to_cm
->backend_decl
= from_cm
->backend_decl
;
1770 if (!from_cm
->attr
.pointer
&& from_cm
->ts
.type
== BT_DERIVED
)
1771 gfc_get_derived_type (to_cm
->ts
.derived
);
1773 else if (from_cm
->ts
.type
== BT_CHARACTER
)
1774 to_cm
->ts
.cl
->backend_decl
= from_cm
->ts
.cl
->backend_decl
;
1781 /* Build a tree node for a procedure pointer component. */
1784 gfc_get_ppc_type (gfc_component
* c
)
1787 if (c
->attr
.function
)
1788 t
= gfc_typenode_for_spec (&c
->ts
);
1791 /* TODO: Build argument list. */
1792 return build_pointer_type (build_function_type (t
, NULL_TREE
));
1796 /* Build a tree node for a derived type. If there are equal
1797 derived types, with different local names, these are built
1798 at the same time. If an equal derived type has been built
1799 in a parent namespace, this is used. */
1802 gfc_get_derived_type (gfc_symbol
* derived
)
1804 tree typenode
= NULL
, field
= NULL
, field_type
= NULL
, fieldlist
= NULL
;
1808 gcc_assert (derived
&& derived
->attr
.flavor
== FL_DERIVED
);
1810 /* See if it's one of the iso_c_binding derived types. */
1811 if (derived
->attr
.is_iso_c
== 1)
1813 if (derived
->backend_decl
)
1814 return derived
->backend_decl
;
1816 if (derived
->intmod_sym_id
== ISOCBINDING_PTR
)
1817 derived
->backend_decl
= ptr_type_node
;
1819 derived
->backend_decl
= pfunc_type_node
;
1821 /* Create a backend_decl for the __c_ptr_c_address field. */
1822 derived
->components
->backend_decl
=
1823 gfc_add_field_to_struct (&(derived
->backend_decl
->type
.values
),
1824 derived
->backend_decl
,
1825 get_identifier (derived
->components
->name
),
1826 gfc_typenode_for_spec (
1827 &(derived
->components
->ts
)));
1829 derived
->ts
.kind
= gfc_index_integer_kind
;
1830 derived
->ts
.type
= BT_INTEGER
;
1831 /* Set the f90_type to BT_VOID as a way to recognize something of type
1832 BT_INTEGER that needs to fit a void * for the purpose of the
1833 iso_c_binding derived types. */
1834 derived
->ts
.f90_type
= BT_VOID
;
1836 return derived
->backend_decl
;
1839 /* derived->backend_decl != 0 means we saw it before, but its
1840 components' backend_decl may have not been built. */
1841 if (derived
->backend_decl
)
1842 return derived
->backend_decl
;
1845 /* We see this derived type first time, so build the type node. */
1846 typenode
= make_node (RECORD_TYPE
);
1847 TYPE_NAME (typenode
) = get_identifier (derived
->name
);
1848 TYPE_PACKED (typenode
) = gfc_option
.flag_pack_derived
;
1849 derived
->backend_decl
= typenode
;
1852 /* Go through the derived type components, building them as
1853 necessary. The reason for doing this now is that it is
1854 possible to recurse back to this derived type through a
1855 pointer component (PR24092). If this happens, the fields
1856 will be built and so we can return the type. */
1857 for (c
= derived
->components
; c
; c
= c
->next
)
1859 if (c
->ts
.type
!= BT_DERIVED
)
1862 if (!c
->attr
.pointer
|| c
->ts
.derived
->backend_decl
== NULL
)
1863 c
->ts
.derived
->backend_decl
= gfc_get_derived_type (c
->ts
.derived
);
1865 if (c
->ts
.derived
&& c
->ts
.derived
->attr
.is_iso_c
)
1867 /* Need to copy the modified ts from the derived type. The
1868 typespec was modified because C_PTR/C_FUNPTR are translated
1869 into (void *) from derived types. */
1870 c
->ts
.type
= c
->ts
.derived
->ts
.type
;
1871 c
->ts
.kind
= c
->ts
.derived
->ts
.kind
;
1872 c
->ts
.f90_type
= c
->ts
.derived
->ts
.f90_type
;
1875 c
->initializer
->ts
.type
= c
->ts
.type
;
1876 c
->initializer
->ts
.kind
= c
->ts
.kind
;
1877 c
->initializer
->ts
.f90_type
= c
->ts
.f90_type
;
1878 c
->initializer
->expr_type
= EXPR_NULL
;
1883 if (TYPE_FIELDS (derived
->backend_decl
))
1884 return derived
->backend_decl
;
1886 /* Build the type member list. Install the newly created RECORD_TYPE
1887 node as DECL_CONTEXT of each FIELD_DECL. */
1888 fieldlist
= NULL_TREE
;
1889 for (c
= derived
->components
; c
; c
= c
->next
)
1891 if (c
->ts
.type
== BT_DERIVED
)
1892 field_type
= c
->ts
.derived
->backend_decl
;
1893 else if (c
->attr
.proc_pointer
)
1894 field_type
= gfc_get_ppc_type (c
);
1897 if (c
->ts
.type
== BT_CHARACTER
)
1899 /* Evaluate the string length. */
1900 gfc_conv_const_charlen (c
->ts
.cl
);
1901 gcc_assert (c
->ts
.cl
->backend_decl
);
1904 field_type
= gfc_typenode_for_spec (&c
->ts
);
1907 /* This returns an array descriptor type. Initialization may be
1909 if (c
->attr
.dimension
)
1911 if (c
->attr
.pointer
|| c
->attr
.allocatable
)
1913 enum gfc_array_kind akind
;
1914 if (c
->attr
.pointer
)
1915 akind
= GFC_ARRAY_POINTER
;
1917 akind
= GFC_ARRAY_ALLOCATABLE
;
1918 /* Pointers to arrays aren't actually pointer types. The
1919 descriptors are separate, but the data is common. */
1920 field_type
= gfc_build_array_type (field_type
, c
->as
, akind
);
1923 field_type
= gfc_get_nodesc_array_type (field_type
, c
->as
,
1926 else if (c
->attr
.pointer
)
1927 field_type
= build_pointer_type (field_type
);
1929 field
= gfc_add_field_to_struct (&fieldlist
, typenode
,
1930 get_identifier (c
->name
),
1933 gfc_set_decl_location (field
, &c
->loc
);
1934 else if (derived
->declared_at
.lb
)
1935 gfc_set_decl_location (field
, &derived
->declared_at
);
1937 DECL_PACKED (field
) |= TYPE_PACKED (typenode
);
1940 if (!c
->backend_decl
)
1941 c
->backend_decl
= field
;
1944 /* Now we have the final fieldlist. Record it, then lay out the
1945 derived type, including the fields. */
1946 TYPE_FIELDS (typenode
) = fieldlist
;
1948 gfc_finish_type (typenode
);
1949 gfc_set_decl_location (TYPE_STUB_DECL (typenode
), &derived
->declared_at
);
1950 if (derived
->module
&& derived
->ns
->proc_name
1951 && derived
->ns
->proc_name
->attr
.flavor
== FL_MODULE
)
1953 if (derived
->ns
->proc_name
->backend_decl
1954 && TREE_CODE (derived
->ns
->proc_name
->backend_decl
)
1957 TYPE_CONTEXT (typenode
) = derived
->ns
->proc_name
->backend_decl
;
1958 DECL_CONTEXT (TYPE_STUB_DECL (typenode
))
1959 = derived
->ns
->proc_name
->backend_decl
;
1963 derived
->backend_decl
= typenode
;
1965 /* Add this backend_decl to all the other, equal derived types. */
1966 for (dt
= gfc_derived_types
; dt
; dt
= dt
->next
)
1967 copy_dt_decls_ifequal (derived
, dt
->derived
);
1969 return derived
->backend_decl
;
1974 gfc_return_by_reference (gfc_symbol
* sym
)
1976 if (!sym
->attr
.function
)
1979 if (sym
->attr
.dimension
)
1982 if (sym
->ts
.type
== BT_CHARACTER
1983 && !sym
->attr
.is_bind_c
1984 && (!sym
->attr
.result
1985 || !sym
->ns
->proc_name
1986 || !sym
->ns
->proc_name
->attr
.is_bind_c
))
1989 /* Possibly return complex numbers by reference for g77 compatibility.
1990 We don't do this for calls to intrinsics (as the library uses the
1991 -fno-f2c calling convention), nor for calls to functions which always
1992 require an explicit interface, as no compatibility problems can
1994 if (gfc_option
.flag_f2c
1995 && sym
->ts
.type
== BT_COMPLEX
1996 && !sym
->attr
.intrinsic
&& !sym
->attr
.always_explicit
)
2003 gfc_get_mixed_entry_union (gfc_namespace
*ns
)
2008 char name
[GFC_MAX_SYMBOL_LEN
+ 1];
2009 gfc_entry_list
*el
, *el2
;
2011 gcc_assert (ns
->proc_name
->attr
.mixed_entry_master
);
2012 gcc_assert (memcmp (ns
->proc_name
->name
, "master.", 7) == 0);
2014 snprintf (name
, GFC_MAX_SYMBOL_LEN
, "munion.%s", ns
->proc_name
->name
+ 7);
2016 /* Build the type node. */
2017 type
= make_node (UNION_TYPE
);
2019 TYPE_NAME (type
) = get_identifier (name
);
2022 for (el
= ns
->entries
; el
; el
= el
->next
)
2024 /* Search for duplicates. */
2025 for (el2
= ns
->entries
; el2
!= el
; el2
= el2
->next
)
2026 if (el2
->sym
->result
== el
->sym
->result
)
2031 decl
= build_decl (FIELD_DECL
,
2032 get_identifier (el
->sym
->result
->name
),
2033 gfc_sym_type (el
->sym
->result
));
2034 DECL_CONTEXT (decl
) = type
;
2035 fieldlist
= chainon (fieldlist
, decl
);
2039 /* Finish off the type. */
2040 TYPE_FIELDS (type
) = fieldlist
;
2042 gfc_finish_type (type
);
2043 TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
)) = 1;
2048 gfc_get_function_type (gfc_symbol
* sym
)
2052 gfc_formal_arglist
*f
;
2055 int alternate_return
;
2057 /* Make sure this symbol is a function, a subroutine or the main
2059 gcc_assert (sym
->attr
.flavor
== FL_PROCEDURE
2060 || sym
->attr
.flavor
== FL_PROGRAM
);
2062 if (sym
->backend_decl
)
2063 return TREE_TYPE (sym
->backend_decl
);
2066 alternate_return
= 0;
2067 typelist
= NULL_TREE
;
2069 if (sym
->attr
.entry_master
)
2071 /* Additional parameter for selecting an entry point. */
2072 typelist
= gfc_chainon_list (typelist
, gfc_array_index_type
);
2080 if (arg
->ts
.type
== BT_CHARACTER
)
2081 gfc_conv_const_charlen (arg
->ts
.cl
);
2083 /* Some functions we use an extra parameter for the return value. */
2084 if (gfc_return_by_reference (sym
))
2086 type
= gfc_sym_type (arg
);
2087 if (arg
->ts
.type
== BT_COMPLEX
2088 || arg
->attr
.dimension
2089 || arg
->ts
.type
== BT_CHARACTER
)
2090 type
= build_reference_type (type
);
2092 typelist
= gfc_chainon_list (typelist
, type
);
2093 if (arg
->ts
.type
== BT_CHARACTER
)
2094 typelist
= gfc_chainon_list (typelist
, gfc_charlen_type_node
);
2097 /* Build the argument types for the function. */
2098 for (f
= sym
->formal
; f
; f
= f
->next
)
2103 /* Evaluate constant character lengths here so that they can be
2104 included in the type. */
2105 if (arg
->ts
.type
== BT_CHARACTER
)
2106 gfc_conv_const_charlen (arg
->ts
.cl
);
2108 if (arg
->attr
.flavor
== FL_PROCEDURE
)
2110 type
= gfc_get_function_type (arg
);
2111 type
= build_pointer_type (type
);
2114 type
= gfc_sym_type (arg
);
2116 /* Parameter Passing Convention
2118 We currently pass all parameters by reference.
2119 Parameters with INTENT(IN) could be passed by value.
2120 The problem arises if a function is called via an implicit
2121 prototype. In this situation the INTENT is not known.
2122 For this reason all parameters to global functions must be
2123 passed by reference. Passing by value would potentially
2124 generate bad code. Worse there would be no way of telling that
2125 this code was bad, except that it would give incorrect results.
2127 Contained procedures could pass by value as these are never
2128 used without an explicit interface, and cannot be passed as
2129 actual parameters for a dummy procedure. */
2130 if (arg
->ts
.type
== BT_CHARACTER
)
2132 typelist
= gfc_chainon_list (typelist
, type
);
2136 if (sym
->attr
.subroutine
)
2137 alternate_return
= 1;
2141 /* Add hidden string length parameters. */
2143 typelist
= gfc_chainon_list (typelist
, gfc_charlen_type_node
);
2146 typelist
= gfc_chainon_list (typelist
, void_type_node
);
2148 if (alternate_return
)
2149 type
= integer_type_node
;
2150 else if (!sym
->attr
.function
|| gfc_return_by_reference (sym
))
2151 type
= void_type_node
;
2152 else if (sym
->attr
.mixed_entry_master
)
2153 type
= gfc_get_mixed_entry_union (sym
->ns
);
2154 else if (gfc_option
.flag_f2c
2155 && sym
->ts
.type
== BT_REAL
2156 && sym
->ts
.kind
== gfc_default_real_kind
2157 && !sym
->attr
.always_explicit
)
2159 /* Special case: f2c calling conventions require that (scalar)
2160 default REAL functions return the C type double instead. f2c
2161 compatibility is only an issue with functions that don't
2162 require an explicit interface, as only these could be
2163 implemented in Fortran 77. */
2164 sym
->ts
.kind
= gfc_default_double_kind
;
2165 type
= gfc_typenode_for_spec (&sym
->ts
);
2166 sym
->ts
.kind
= gfc_default_real_kind
;
2168 else if (sym
->result
&& sym
->result
->attr
.proc_pointer
)
2169 /* Procedure pointer return values. */
2171 if (sym
->result
->attr
.result
&& strcmp (sym
->name
,"ppr@") != 0)
2173 /* Unset proc_pointer as gfc_get_function_type
2174 is called recursively. */
2175 sym
->result
->attr
.proc_pointer
= 0;
2176 type
= build_pointer_type (gfc_get_function_type (sym
->result
));
2177 sym
->result
->attr
.proc_pointer
= 1;
2180 type
= gfc_sym_type (sym
->result
);
2183 type
= gfc_sym_type (sym
);
2185 type
= build_function_type (type
, typelist
);
2190 /* Language hooks for middle-end access to type nodes. */
2192 /* Return an integer type with BITS bits of precision,
2193 that is unsigned if UNSIGNEDP is nonzero, otherwise signed. */
2196 gfc_type_for_size (unsigned bits
, int unsignedp
)
2201 for (i
= 0; i
<= MAX_INT_KINDS
; ++i
)
2203 tree type
= gfc_integer_types
[i
];
2204 if (type
&& bits
== TYPE_PRECISION (type
))
2208 /* Handle TImode as a special case because it is used by some backends
2209 (e.g. ARM) even though it is not available for normal use. */
2210 #if HOST_BITS_PER_WIDE_INT >= 64
2211 if (bits
== TYPE_PRECISION (intTI_type_node
))
2212 return intTI_type_node
;
2217 if (bits
== TYPE_PRECISION (unsigned_intQI_type_node
))
2218 return unsigned_intQI_type_node
;
2219 if (bits
== TYPE_PRECISION (unsigned_intHI_type_node
))
2220 return unsigned_intHI_type_node
;
2221 if (bits
== TYPE_PRECISION (unsigned_intSI_type_node
))
2222 return unsigned_intSI_type_node
;
2223 if (bits
== TYPE_PRECISION (unsigned_intDI_type_node
))
2224 return unsigned_intDI_type_node
;
2225 if (bits
== TYPE_PRECISION (unsigned_intTI_type_node
))
2226 return unsigned_intTI_type_node
;
2232 /* Return a data type that has machine mode MODE. If the mode is an
2233 integer, then UNSIGNEDP selects between signed and unsigned types. */
2236 gfc_type_for_mode (enum machine_mode mode
, int unsignedp
)
2241 if (GET_MODE_CLASS (mode
) == MODE_FLOAT
)
2242 base
= gfc_real_types
;
2243 else if (GET_MODE_CLASS (mode
) == MODE_COMPLEX_FLOAT
)
2244 base
= gfc_complex_types
;
2245 else if (SCALAR_INT_MODE_P (mode
))
2246 return gfc_type_for_size (GET_MODE_PRECISION (mode
), unsignedp
);
2247 else if (VECTOR_MODE_P (mode
))
2249 enum machine_mode inner_mode
= GET_MODE_INNER (mode
);
2250 tree inner_type
= gfc_type_for_mode (inner_mode
, unsignedp
);
2251 if (inner_type
!= NULL_TREE
)
2252 return build_vector_type_for_mode (inner_type
, mode
);
2258 for (i
= 0; i
<= MAX_REAL_KINDS
; ++i
)
2260 tree type
= base
[i
];
2261 if (type
&& mode
== TYPE_MODE (type
))
2268 /* Return TRUE if TYPE is a type with a hidden descriptor, fill in INFO
2272 gfc_get_array_descr_info (const_tree type
, struct array_descr_info
*info
)
2275 bool indirect
= false;
2276 tree etype
, ptype
, field
, t
, base_decl
;
2277 tree data_off
, offset_off
, dim_off
, dim_size
, elem_size
;
2278 tree lower_suboff
, upper_suboff
, stride_suboff
;
2280 if (! GFC_DESCRIPTOR_TYPE_P (type
))
2282 if (! POINTER_TYPE_P (type
))
2284 type
= TREE_TYPE (type
);
2285 if (! GFC_DESCRIPTOR_TYPE_P (type
))
2290 rank
= GFC_TYPE_ARRAY_RANK (type
);
2291 if (rank
>= (int) (sizeof (info
->dimen
) / sizeof (info
->dimen
[0])))
2294 etype
= GFC_TYPE_ARRAY_DATAPTR_TYPE (type
);
2295 gcc_assert (POINTER_TYPE_P (etype
));
2296 etype
= TREE_TYPE (etype
);
2297 gcc_assert (TREE_CODE (etype
) == ARRAY_TYPE
);
2298 etype
= TREE_TYPE (etype
);
2299 /* Can't handle variable sized elements yet. */
2300 if (int_size_in_bytes (etype
) <= 0)
2302 /* Nor non-constant lower bounds in assumed shape arrays. */
2303 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE
)
2305 for (dim
= 0; dim
< rank
; dim
++)
2306 if (GFC_TYPE_ARRAY_LBOUND (type
, dim
) == NULL_TREE
2307 || TREE_CODE (GFC_TYPE_ARRAY_LBOUND (type
, dim
)) != INTEGER_CST
)
2311 memset (info
, '\0', sizeof (*info
));
2312 info
->ndimensions
= rank
;
2313 info
->element_type
= etype
;
2314 ptype
= build_pointer_type (gfc_array_index_type
);
2317 info
->base_decl
= build_decl (VAR_DECL
, NULL_TREE
,
2318 build_pointer_type (ptype
));
2319 base_decl
= build1 (INDIRECT_REF
, ptype
, info
->base_decl
);
2322 info
->base_decl
= base_decl
= build_decl (VAR_DECL
, NULL_TREE
, ptype
);
2324 if (GFC_TYPE_ARRAY_SPAN (type
))
2325 elem_size
= GFC_TYPE_ARRAY_SPAN (type
);
2327 elem_size
= fold_convert (gfc_array_index_type
, TYPE_SIZE_UNIT (etype
));
2328 field
= TYPE_FIELDS (TYPE_MAIN_VARIANT (type
));
2329 data_off
= byte_position (field
);
2330 field
= TREE_CHAIN (field
);
2331 offset_off
= byte_position (field
);
2332 field
= TREE_CHAIN (field
);
2333 field
= TREE_CHAIN (field
);
2334 dim_off
= byte_position (field
);
2335 dim_size
= TYPE_SIZE_UNIT (TREE_TYPE (TREE_TYPE (field
)));
2336 field
= TYPE_FIELDS (TREE_TYPE (TREE_TYPE (field
)));
2337 stride_suboff
= byte_position (field
);
2338 field
= TREE_CHAIN (field
);
2339 lower_suboff
= byte_position (field
);
2340 field
= TREE_CHAIN (field
);
2341 upper_suboff
= byte_position (field
);
2344 if (!integer_zerop (data_off
))
2345 t
= build2 (POINTER_PLUS_EXPR
, ptype
, t
, data_off
);
2346 t
= build1 (NOP_EXPR
, build_pointer_type (ptr_type_node
), t
);
2347 info
->data_location
= build1 (INDIRECT_REF
, ptr_type_node
, t
);
2348 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ALLOCATABLE
)
2349 info
->allocated
= build2 (NE_EXPR
, boolean_type_node
,
2350 info
->data_location
, null_pointer_node
);
2351 else if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_POINTER
)
2352 info
->associated
= build2 (NE_EXPR
, boolean_type_node
,
2353 info
->data_location
, null_pointer_node
);
2355 for (dim
= 0; dim
< rank
; dim
++)
2357 t
= build2 (POINTER_PLUS_EXPR
, ptype
, base_decl
,
2358 size_binop (PLUS_EXPR
, dim_off
, lower_suboff
));
2359 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
2360 info
->dimen
[dim
].lower_bound
= t
;
2361 t
= build2 (POINTER_PLUS_EXPR
, ptype
, base_decl
,
2362 size_binop (PLUS_EXPR
, dim_off
, upper_suboff
));
2363 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
2364 info
->dimen
[dim
].upper_bound
= t
;
2365 if (GFC_TYPE_ARRAY_AKIND (type
) == GFC_ARRAY_ASSUMED_SHAPE
)
2367 /* Assumed shape arrays have known lower bounds. */
2368 info
->dimen
[dim
].upper_bound
2369 = build2 (MINUS_EXPR
, gfc_array_index_type
,
2370 info
->dimen
[dim
].upper_bound
,
2371 info
->dimen
[dim
].lower_bound
);
2372 info
->dimen
[dim
].lower_bound
2373 = fold_convert (gfc_array_index_type
,
2374 GFC_TYPE_ARRAY_LBOUND (type
, dim
));
2375 info
->dimen
[dim
].upper_bound
2376 = build2 (PLUS_EXPR
, gfc_array_index_type
,
2377 info
->dimen
[dim
].lower_bound
,
2378 info
->dimen
[dim
].upper_bound
);
2380 t
= build2 (POINTER_PLUS_EXPR
, ptype
, base_decl
,
2381 size_binop (PLUS_EXPR
, dim_off
, stride_suboff
));
2382 t
= build1 (INDIRECT_REF
, gfc_array_index_type
, t
);
2383 t
= build2 (MULT_EXPR
, gfc_array_index_type
, t
, elem_size
);
2384 info
->dimen
[dim
].stride
= t
;
2385 dim_off
= size_binop (PLUS_EXPR
, dim_off
, dim_size
);
2391 #include "gt-fortran-trans-types.h"