]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | /* Translation of constants |
8d9254fc | 2 | Copyright (C) 2002-2020 Free Software Foundation, Inc. |
6de9cd9a DN |
3 | Contributed by Paul Brook |
4 | ||
9fc4d79b | 5 | This file is part of GCC. |
6de9cd9a | 6 | |
9fc4d79b TS |
7 | GCC is free software; you can redistribute it and/or modify it under |
8 | the terms of the GNU General Public License as published by the Free | |
d234d788 | 9 | Software Foundation; either version 3, or (at your option) any later |
9fc4d79b | 10 | version. |
6de9cd9a | 11 | |
9fc4d79b TS |
12 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
13 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
14 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
15 | for more details. | |
6de9cd9a DN |
16 | |
17 | You should have received a copy of the GNU General Public License | |
d234d788 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
6de9cd9a DN |
20 | |
21 | /* trans-const.c -- convert constant values */ | |
22 | ||
23 | #include "config.h" | |
24 | #include "system.h" | |
25 | #include "coretypes.h" | |
2adfab87 | 26 | #include "tree.h" |
8e54f6d3 | 27 | #include "gfortran.h" |
2afeb1ca | 28 | #include "options.h" |
2adfab87 | 29 | #include "trans.h" |
40e23961 | 30 | #include "fold-const.h" |
d8a2d370 | 31 | #include "stor-layout.h" |
d49b6e1e | 32 | #include "realmpfr.h" |
6de9cd9a DN |
33 | #include "trans-const.h" |
34 | #include "trans-types.h" | |
d393bbd7 | 35 | #include "target-memory.h" |
6de9cd9a | 36 | |
6de9cd9a DN |
37 | tree gfc_rank_cst[GFC_MAX_DIMENSIONS + 1]; |
38 | ||
39 | /* Build a constant with given type from an int_cst. */ | |
f8d0aee5 | 40 | |
6de9cd9a DN |
41 | tree |
42 | gfc_build_const (tree type, tree intval) | |
43 | { | |
44 | tree val; | |
45 | tree zero; | |
46 | ||
47 | switch (TREE_CODE (type)) | |
48 | { | |
49 | case INTEGER_TYPE: | |
50 | val = convert (type, intval); | |
51 | break; | |
52 | ||
53 | case REAL_TYPE: | |
54 | val = build_real_from_int_cst (type, intval); | |
55 | break; | |
56 | ||
57 | case COMPLEX_TYPE: | |
58 | val = build_real_from_int_cst (TREE_TYPE (type), intval); | |
59 | zero = build_real_from_int_cst (TREE_TYPE (type), integer_zero_node); | |
60 | val = build_complex (type, val, zero); | |
61 | break; | |
62 | ||
63 | default: | |
6e45f57b | 64 | gcc_unreachable (); |
6de9cd9a DN |
65 | } |
66 | return val; | |
67 | } | |
68 | ||
d393bbd7 FXC |
69 | /* Build a string constant with C char type. */ |
70 | ||
6de9cd9a | 71 | tree |
6b271a2e | 72 | gfc_build_string_const (size_t length, const char *s) |
6de9cd9a DN |
73 | { |
74 | tree str; | |
75 | tree len; | |
76 | ||
77 | str = build_string (length, s); | |
df09d1d5 | 78 | len = size_int (length); |
6de9cd9a DN |
79 | TREE_TYPE (str) = |
80 | build_array_type (gfc_character1_type_node, | |
d7177ab2 | 81 | build_range_type (gfc_charlen_type_node, |
df09d1d5 | 82 | size_one_node, len)); |
b5116268 | 83 | TYPE_STRING_FLAG (TREE_TYPE (str)) = 1; |
6de9cd9a DN |
84 | return str; |
85 | } | |
86 | ||
d393bbd7 FXC |
87 | |
88 | /* Build a string constant with a type given by its kind; take care of | |
89 | non-default character kinds. */ | |
90 | ||
91 | tree | |
6b271a2e | 92 | gfc_build_wide_string_const (int kind, size_t length, const gfc_char_t *string) |
d393bbd7 FXC |
93 | { |
94 | int i; | |
95 | tree str, len; | |
96 | size_t size; | |
97 | char *s; | |
98 | ||
99 | i = gfc_validate_kind (BT_CHARACTER, kind, false); | |
100 | size = length * gfc_character_kinds[i].bit_size / 8; | |
101 | ||
ece3f663 | 102 | s = XCNEWVAR (char, size); |
d393bbd7 FXC |
103 | gfc_encode_character (kind, length, string, (unsigned char *) s, size); |
104 | ||
105 | str = build_string (size, s); | |
cede9502 | 106 | free (s); |
d393bbd7 | 107 | |
df09d1d5 | 108 | len = size_int (length); |
d393bbd7 FXC |
109 | TREE_TYPE (str) = |
110 | build_array_type (gfc_get_char_type (kind), | |
111 | build_range_type (gfc_charlen_type_node, | |
df09d1d5 | 112 | size_one_node, len)); |
b5116268 | 113 | TYPE_STRING_FLAG (TREE_TYPE (str)) = 1; |
d393bbd7 FXC |
114 | return str; |
115 | } | |
116 | ||
117 | ||
31043f6c | 118 | /* Build a Fortran character constant from a zero-terminated string. |
ee37d2f5 FXC |
119 | There a two version of this function, one that translates the string |
120 | and one that doesn't. */ | |
95638988 | 121 | tree |
ee37d2f5 | 122 | gfc_build_cstring_const (const char *string) |
95638988 | 123 | { |
ee37d2f5 | 124 | return gfc_build_string_const (strlen (string) + 1, string); |
95638988 TS |
125 | } |
126 | ||
ee37d2f5 FXC |
127 | tree |
128 | gfc_build_localized_cstring_const (const char *msgid) | |
129 | { | |
130 | const char *localized = _(msgid); | |
131 | return gfc_build_string_const (strlen (localized) + 1, localized); | |
132 | } | |
133 | ||
134 | ||
6de9cd9a | 135 | /* Return a string constant with the given length. Used for static |
c287dea0 | 136 | initializers. The constant will be padded or truncated to match |
94716287 TS |
137 | length. */ |
138 | ||
6de9cd9a DN |
139 | tree |
140 | gfc_conv_string_init (tree length, gfc_expr * expr) | |
141 | { | |
00660189 | 142 | gfc_char_t *s; |
6de9cd9a | 143 | HOST_WIDE_INT len; |
949b40a4 | 144 | gfc_charlen_t slen; |
6de9cd9a | 145 | tree str; |
d393bbd7 | 146 | bool free_s = false; |
6de9cd9a | 147 | |
6e45f57b | 148 | gcc_assert (expr->expr_type == EXPR_CONSTANT); |
d393bbd7 | 149 | gcc_assert (expr->ts.type == BT_CHARACTER); |
807e902e | 150 | gcc_assert (tree_fits_uhwi_p (length)); |
6de9cd9a DN |
151 | |
152 | len = TREE_INT_CST_LOW (length); | |
153 | slen = expr->value.character.length; | |
94716287 TS |
154 | |
155 | if (len > slen) | |
6de9cd9a | 156 | { |
00660189 FXC |
157 | s = gfc_get_wide_string (len); |
158 | memcpy (s, expr->value.character.string, slen * sizeof (gfc_char_t)); | |
159 | gfc_wide_memset (&s[slen], ' ', len - slen); | |
d393bbd7 | 160 | free_s = true; |
6de9cd9a DN |
161 | } |
162 | else | |
d393bbd7 | 163 | s = expr->value.character.string; |
00660189 | 164 | |
d393bbd7 FXC |
165 | str = gfc_build_wide_string_const (expr->ts.kind, len, s); |
166 | ||
167 | if (free_s) | |
cede9502 | 168 | free (s); |
6de9cd9a DN |
169 | |
170 | return str; | |
171 | } | |
172 | ||
173 | ||
174 | /* Create a tree node for the string length if it is constant. */ | |
175 | ||
176 | void | |
177 | gfc_conv_const_charlen (gfc_charlen * cl) | |
178 | { | |
c73b6478 | 179 | if (!cl || cl->backend_decl) |
6de9cd9a DN |
180 | return; |
181 | ||
182 | if (cl->length && cl->length->expr_type == EXPR_CONSTANT) | |
183 | { | |
184 | cl->backend_decl = gfc_conv_mpz_to_tree (cl->length->value.integer, | |
185 | cl->length->ts.kind); | |
1e7d0a64 FW |
186 | cl->backend_decl = fold_convert (gfc_charlen_type_node, |
187 | cl->backend_decl); | |
6de9cd9a DN |
188 | } |
189 | } | |
190 | ||
191 | void | |
192 | gfc_init_constants (void) | |
193 | { | |
194 | int n; | |
195 | ||
196 | for (n = 0; n <= GFC_MAX_DIMENSIONS; n++) | |
7d60be94 | 197 | gfc_rank_cst[n] = build_int_cst (gfc_array_index_type, n); |
6de9cd9a DN |
198 | } |
199 | ||
6de9cd9a | 200 | /* Converts a GMP integer into a backend tree node. */ |
18452a7d | 201 | |
6de9cd9a DN |
202 | tree |
203 | gfc_conv_mpz_to_tree (mpz_t i, int kind) | |
204 | { | |
807e902e KZ |
205 | wide_int val = wi::from_mpz (gfc_get_int_type (kind), i, true); |
206 | return wide_int_to_tree (gfc_get_int_type (kind), val); | |
18452a7d | 207 | } |
6de9cd9a | 208 | |
f622221a JB |
209 | |
210 | /* Convert a GMP integer into a tree node of type given by the type | |
211 | argument. */ | |
212 | ||
213 | tree | |
214 | gfc_conv_mpz_to_tree_type (mpz_t i, const tree type) | |
215 | { | |
216 | const wide_int val = wi::from_mpz (type, i, true); | |
217 | return wide_int_to_tree (type, val); | |
218 | } | |
219 | ||
220 | ||
18452a7d | 221 | /* Converts a backend tree into a GMP integer. */ |
6de9cd9a | 222 | |
18452a7d BM |
223 | void |
224 | gfc_conv_tree_to_mpz (mpz_t i, tree source) | |
225 | { | |
8e6cdc90 | 226 | wi::to_mpz (wi::to_wide (source), i, TYPE_SIGN (TREE_TYPE (source))); |
6de9cd9a DN |
227 | } |
228 | ||
18452a7d | 229 | /* Converts a real constant into backend form. */ |
f8d0aee5 | 230 | |
6de9cd9a | 231 | tree |
346a77d1 | 232 | gfc_conv_mpfr_to_tree (mpfr_t f, int kind, int is_snan) |
6de9cd9a | 233 | { |
6de9cd9a | 234 | tree type; |
6de9cd9a | 235 | int n; |
54554825 | 236 | REAL_VALUE_TYPE real; |
6de9cd9a | 237 | |
855a145c | 238 | n = gfc_validate_kind (BT_REAL, kind, false); |
855a145c TS |
239 | gcc_assert (gfc_real_kinds[n].radix == 2); |
240 | ||
54554825 | 241 | type = gfc_get_real_type (kind); |
346a77d1 TB |
242 | if (mpfr_nan_p (f) && is_snan) |
243 | real_from_string (&real, "SNaN"); | |
244 | else | |
245 | real_from_mpfr (&real, f, type, GFC_RND_MODE); | |
246 | ||
18452a7d BM |
247 | return build_real (type, real); |
248 | } | |
54554825 | 249 | |
a67189d4 FXC |
250 | /* Returns a real constant that is +Infinity if the target |
251 | supports infinities for this floating-point mode, and | |
252 | +HUGE_VAL otherwise (the largest representable number). */ | |
253 | ||
254 | tree | |
255 | gfc_build_inf_or_huge (tree type, int kind) | |
256 | { | |
257 | if (HONOR_INFINITIES (TYPE_MODE (type))) | |
258 | { | |
259 | REAL_VALUE_TYPE real; | |
260 | real_inf (&real); | |
261 | return build_real (type, real); | |
262 | } | |
263 | else | |
264 | { | |
265 | int k = gfc_validate_kind (BT_REAL, kind, false); | |
266 | return gfc_conv_mpfr_to_tree (gfc_real_kinds[k].huge, kind, 0); | |
267 | } | |
268 | } | |
269 | ||
565fad70 FXC |
270 | /* Returns a floating-point NaN of a given type. */ |
271 | ||
272 | tree | |
273 | gfc_build_nan (tree type, const char *str) | |
274 | { | |
275 | REAL_VALUE_TYPE real; | |
276 | real_nan (&real, str, 1, TYPE_MODE (type)); | |
277 | return build_real (type, real); | |
278 | } | |
279 | ||
18452a7d | 280 | /* Converts a backend tree into a real constant. */ |
6de9cd9a | 281 | |
18452a7d BM |
282 | void |
283 | gfc_conv_tree_to_mpfr (mpfr_ptr f, tree source) | |
284 | { | |
285 | mpfr_from_real (f, TREE_REAL_CST_PTR (source), GFC_RND_MODE); | |
6de9cd9a DN |
286 | } |
287 | ||
6de9cd9a DN |
288 | /* Translate any literal constant to a tree. Constants never have |
289 | pre or post chains. Character literal constants are special | |
290 | special because they have a value and a length, so they cannot be | |
291 | returned as a single tree. It is up to the caller to set the | |
292 | length somewhere if necessary. | |
293 | ||
294 | Returns the translated constant, or aborts if it gets a type it | |
295 | can't handle. */ | |
296 | ||
297 | tree | |
298 | gfc_conv_constant_to_tree (gfc_expr * expr) | |
299 | { | |
00660189 | 300 | tree res; |
00660189 | 301 | |
6e45f57b | 302 | gcc_assert (expr->expr_type == EXPR_CONSTANT); |
6de9cd9a | 303 | |
20585ad6 BM |
304 | /* If it is has a prescribed memory representation, we build a string |
305 | constant and VIEW_CONVERT to its type. */ | |
c287dea0 | 306 | |
6de9cd9a DN |
307 | switch (expr->ts.type) |
308 | { | |
309 | case BT_INTEGER: | |
20585ad6 | 310 | if (expr->representation.string) |
bc98ed60 TB |
311 | return fold_build1_loc (input_location, VIEW_CONVERT_EXPR, |
312 | gfc_get_int_type (expr->ts.kind), | |
313 | gfc_build_string_const (expr->representation.length, | |
314 | expr->representation.string)); | |
d3642f89 FW |
315 | else |
316 | return gfc_conv_mpz_to_tree (expr->value.integer, expr->ts.kind); | |
6de9cd9a DN |
317 | |
318 | case BT_REAL: | |
20585ad6 | 319 | if (expr->representation.string) |
bc98ed60 TB |
320 | return fold_build1_loc (input_location, VIEW_CONVERT_EXPR, |
321 | gfc_get_real_type (expr->ts.kind), | |
322 | gfc_build_string_const (expr->representation.length, | |
323 | expr->representation.string)); | |
d3642f89 | 324 | else |
346a77d1 | 325 | return gfc_conv_mpfr_to_tree (expr->value.real, expr->ts.kind, expr->is_snan); |
6de9cd9a DN |
326 | |
327 | case BT_LOGICAL: | |
20585ad6 | 328 | if (expr->representation.string) |
27a4e072 | 329 | { |
bc98ed60 TB |
330 | tree tmp = fold_build1_loc (input_location, VIEW_CONVERT_EXPR, |
331 | gfc_get_int_type (expr->ts.kind), | |
332 | gfc_build_string_const (expr->representation.length, | |
333 | expr->representation.string)); | |
27a4e072 | 334 | if (!integer_zerop (tmp) && !integer_onep (tmp)) |
2afeb1ca ME |
335 | gfc_warning (flag_dec_char_conversions ? OPT_Wsurprising : 0, |
336 | "Assigning value other than 0 or 1 to LOGICAL has " | |
337 | "undefined result at %L", &expr->where); | |
27a4e072 JJ |
338 | return fold_convert (gfc_get_logical_type (expr->ts.kind), tmp); |
339 | } | |
d3642f89 FW |
340 | else |
341 | return build_int_cst (gfc_get_logical_type (expr->ts.kind), | |
27a4e072 | 342 | expr->value.logical); |
6de9cd9a DN |
343 | |
344 | case BT_COMPLEX: | |
20585ad6 | 345 | if (expr->representation.string) |
bc98ed60 TB |
346 | return fold_build1_loc (input_location, VIEW_CONVERT_EXPR, |
347 | gfc_get_complex_type (expr->ts.kind), | |
348 | gfc_build_string_const (expr->representation.length, | |
349 | expr->representation.string)); | |
d3642f89 FW |
350 | else |
351 | { | |
eb6f9a86 | 352 | tree real = gfc_conv_mpfr_to_tree (mpc_realref (expr->value.complex), |
346a77d1 | 353 | expr->ts.kind, expr->is_snan); |
eb6f9a86 | 354 | tree imag = gfc_conv_mpfr_to_tree (mpc_imagref (expr->value.complex), |
346a77d1 | 355 | expr->ts.kind, expr->is_snan); |
6de9cd9a | 356 | |
d3642f89 FW |
357 | return build_complex (gfc_typenode_for_spec (&expr->ts), |
358 | real, imag); | |
359 | } | |
6de9cd9a DN |
360 | |
361 | case BT_CHARACTER: | |
d393bbd7 FXC |
362 | res = gfc_build_wide_string_const (expr->ts.kind, |
363 | expr->value.character.length, | |
364 | expr->value.character.string); | |
00660189 | 365 | return res; |
6de9cd9a | 366 | |
20585ad6 BM |
367 | case BT_HOLLERITH: |
368 | return gfc_build_string_const (expr->representation.length, | |
369 | expr->representation.string); | |
370 | ||
6de9cd9a | 371 | default: |
dcdae924 | 372 | gcc_unreachable (); |
6de9cd9a DN |
373 | } |
374 | } | |
375 | ||
376 | ||
f8d0aee5 | 377 | /* Like gfc_conv_constant_to_tree, but for a simplified expression. |
6de9cd9a DN |
378 | We can handle character literal constants here as well. */ |
379 | ||
380 | void | |
381 | gfc_conv_constant (gfc_se * se, gfc_expr * expr) | |
382 | { | |
bcc4d4e0 MM |
383 | gfc_ss *ss; |
384 | ||
a8b3b0b6 | 385 | /* We may be receiving an expression for C_NULL_PTR or C_NULL_FUNPTR. If |
9d3d3f10 | 386 | so, the expr_type will not yet be an EXPR_CONSTANT. We need to make |
a8b3b0b6 | 387 | it so here. */ |
bc21d315 JW |
388 | if (expr->ts.type == BT_DERIVED && expr->ts.u.derived |
389 | && expr->ts.u.derived->attr.is_iso_c) | |
a8b3b0b6 | 390 | { |
c287dea0 PT |
391 | if (expr->symtree->n.sym->intmod_sym_id == ISOCBINDING_NULL_PTR |
392 | || expr->symtree->n.sym->intmod_sym_id == ISOCBINDING_NULL_FUNPTR) | |
393 | { | |
394 | /* Create a new EXPR_CONSTANT expression for our local uses. */ | |
395 | expr = gfc_get_int_expr (gfc_default_integer_kind, NULL, 0); | |
396 | } | |
a8b3b0b6 CR |
397 | } |
398 | ||
9d3d3f10 JD |
399 | if (expr->expr_type != EXPR_CONSTANT) |
400 | { | |
b7e75771 | 401 | gfc_expr *e = gfc_get_int_expr (gfc_default_integer_kind, NULL, 0); |
9d3d3f10 | 402 | gfc_error ("non-constant initialization expression at %L", &expr->where); |
b7e75771 | 403 | se->expr = gfc_conv_constant_to_tree (e); |
9d3d3f10 JD |
404 | return; |
405 | } | |
6de9cd9a | 406 | |
bcc4d4e0 MM |
407 | ss = se->ss; |
408 | if (ss != NULL) | |
6de9cd9a | 409 | { |
f98cfd3c MM |
410 | gfc_ss_info *ss_info; |
411 | ||
412 | ss_info = ss->info; | |
bcc4d4e0 | 413 | gcc_assert (ss != gfc_ss_terminator); |
f98cfd3c MM |
414 | gcc_assert (ss_info->type == GFC_SS_SCALAR); |
415 | gcc_assert (ss_info->expr == expr); | |
6de9cd9a | 416 | |
99dd5a29 | 417 | se->expr = ss_info->data.scalar.value; |
a0add3be | 418 | se->string_length = ss_info->string_length; |
6de9cd9a DN |
419 | gfc_advance_se_ss_chain (se); |
420 | return; | |
421 | } | |
422 | ||
423 | /* Translate the constant and put it in the simplifier structure. */ | |
424 | se->expr = gfc_conv_constant_to_tree (expr); | |
425 | ||
f8d0aee5 | 426 | /* If this is a CHARACTER string, set its length in the simplifier |
6de9cd9a DN |
427 | structure, too. */ |
428 | if (expr->ts.type == BT_CHARACTER) | |
429 | se->string_length = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (se->expr))); | |
430 | } |