]>
Commit | Line | Data |
---|---|---|
4ee9c684 | 1 | /* Expression translation |
cfaf579d | 2 | Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 |
ea94d76d | 3 | Free Software Foundation, Inc. |
4ee9c684 | 4 | Contributed by Paul Brook <paul@nowt.org> |
5 | and Steven Bosscher <s.bosscher@student.tudelft.nl> | |
6 | ||
c84b470d | 7 | This file is part of GCC. |
4ee9c684 | 8 | |
c84b470d | 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 | |
bdabe786 | 11 | Software Foundation; either version 3, or (at your option) any later |
c84b470d | 12 | version. |
4ee9c684 | 13 | |
c84b470d | 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 | |
17 | for more details. | |
4ee9c684 | 18 | |
19 | You should have received a copy of the GNU General Public License | |
bdabe786 | 20 | along with GCC; see the file COPYING3. If not see |
21 | <http://www.gnu.org/licenses/>. */ | |
4ee9c684 | 22 | |
23 | /* trans-expr.c-- generate GENERIC trees for gfc_expr. */ | |
24 | ||
25 | #include "config.h" | |
26 | #include "system.h" | |
27 | #include "coretypes.h" | |
28 | #include "tree.h" | |
29 | #include "convert.h" | |
4ee9c684 | 30 | #include "ggc.h" |
31 | #include "toplev.h" | |
32 | #include "real.h" | |
75a70cf9 | 33 | #include "gimple.h" |
59b9dcbd | 34 | #include "langhooks.h" |
4ee9c684 | 35 | #include "flags.h" |
4ee9c684 | 36 | #include "gfortran.h" |
fd149f95 | 37 | #include "arith.h" |
4ee9c684 | 38 | #include "trans.h" |
39 | #include "trans-const.h" | |
40 | #include "trans-types.h" | |
41 | #include "trans-array.h" | |
42 | /* Only for gfc_trans_assign and gfc_trans_pointer_assign. */ | |
43 | #include "trans-stmt.h" | |
c99d633f | 44 | #include "dependency.h" |
4ee9c684 | 45 | |
9a0aec1d | 46 | static tree gfc_trans_structure_assign (tree dest, gfc_expr * expr); |
fd149f95 | 47 | static void gfc_apply_interface_mapping_to_expr (gfc_interface_mapping *, |
f45a476e | 48 | gfc_expr *); |
4ee9c684 | 49 | |
50 | /* Copy the scalarization loop variables. */ | |
51 | ||
52 | static void | |
53 | gfc_copy_se_loopvars (gfc_se * dest, gfc_se * src) | |
54 | { | |
55 | dest->ss = src->ss; | |
56 | dest->loop = src->loop; | |
57 | } | |
58 | ||
59 | ||
f888a3fb | 60 | /* Initialize a simple expression holder. |
4ee9c684 | 61 | |
62 | Care must be taken when multiple se are created with the same parent. | |
63 | The child se must be kept in sync. The easiest way is to delay creation | |
64 | of a child se until after after the previous se has been translated. */ | |
65 | ||
66 | void | |
67 | gfc_init_se (gfc_se * se, gfc_se * parent) | |
68 | { | |
69 | memset (se, 0, sizeof (gfc_se)); | |
70 | gfc_init_block (&se->pre); | |
71 | gfc_init_block (&se->post); | |
72 | ||
73 | se->parent = parent; | |
74 | ||
75 | if (parent) | |
76 | gfc_copy_se_loopvars (se, parent); | |
77 | } | |
78 | ||
79 | ||
80 | /* Advances to the next SS in the chain. Use this rather than setting | |
f888a3fb | 81 | se->ss = se->ss->next because all the parents needs to be kept in sync. |
4ee9c684 | 82 | See gfc_init_se. */ |
83 | ||
84 | void | |
85 | gfc_advance_se_ss_chain (gfc_se * se) | |
86 | { | |
87 | gfc_se *p; | |
88 | ||
22d678e8 | 89 | gcc_assert (se != NULL && se->ss != NULL && se->ss != gfc_ss_terminator); |
4ee9c684 | 90 | |
91 | p = se; | |
92 | /* Walk down the parent chain. */ | |
93 | while (p != NULL) | |
94 | { | |
f888a3fb | 95 | /* Simple consistency check. */ |
22d678e8 | 96 | gcc_assert (p->parent == NULL || p->parent->ss == p->ss); |
4ee9c684 | 97 | |
98 | p->ss = p->ss->next; | |
99 | ||
100 | p = p->parent; | |
101 | } | |
102 | } | |
103 | ||
104 | ||
105 | /* Ensures the result of the expression as either a temporary variable | |
106 | or a constant so that it can be used repeatedly. */ | |
107 | ||
108 | void | |
109 | gfc_make_safe_expr (gfc_se * se) | |
110 | { | |
111 | tree var; | |
112 | ||
ce45a448 | 113 | if (CONSTANT_CLASS_P (se->expr)) |
4ee9c684 | 114 | return; |
115 | ||
f888a3fb | 116 | /* We need a temporary for this result. */ |
4ee9c684 | 117 | var = gfc_create_var (TREE_TYPE (se->expr), NULL); |
75a70cf9 | 118 | gfc_add_modify (&se->pre, var, se->expr); |
4ee9c684 | 119 | se->expr = var; |
120 | } | |
121 | ||
122 | ||
5cb9d0d8 | 123 | /* Return an expression which determines if a dummy parameter is present. |
124 | Also used for arguments to procedures with multiple entry points. */ | |
4ee9c684 | 125 | |
126 | tree | |
127 | gfc_conv_expr_present (gfc_symbol * sym) | |
128 | { | |
129 | tree decl; | |
130 | ||
5cb9d0d8 | 131 | gcc_assert (sym->attr.dummy); |
4ee9c684 | 132 | |
133 | decl = gfc_get_symbol_decl (sym); | |
134 | if (TREE_CODE (decl) != PARM_DECL) | |
135 | { | |
136 | /* Array parameters use a temporary descriptor, we want the real | |
137 | parameter. */ | |
22d678e8 | 138 | gcc_assert (GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (decl)) |
4ee9c684 | 139 | || GFC_ARRAY_TYPE_P (TREE_TYPE (decl))); |
140 | decl = GFC_DECL_SAVED_DESCRIPTOR (decl); | |
141 | } | |
f75d6b8a | 142 | return fold_build2 (NE_EXPR, boolean_type_node, decl, |
143 | fold_convert (TREE_TYPE (decl), null_pointer_node)); | |
4ee9c684 | 144 | } |
145 | ||
146 | ||
bd24f178 | 147 | /* Converts a missing, dummy argument into a null or zero. */ |
148 | ||
149 | void | |
2abe085f | 150 | gfc_conv_missing_dummy (gfc_se * se, gfc_expr * arg, gfc_typespec ts, int kind) |
bd24f178 | 151 | { |
152 | tree present; | |
153 | tree tmp; | |
154 | ||
155 | present = gfc_conv_expr_present (arg->symtree->n.sym); | |
24146844 | 156 | |
2abe085f | 157 | if (kind > 0) |
158 | { | |
52c2abc3 | 159 | /* Create a temporary and convert it to the correct type. */ |
2abe085f | 160 | tmp = gfc_get_int_type (kind); |
389dd41b | 161 | tmp = fold_convert (tmp, build_fold_indirect_ref_loc (input_location, |
162 | se->expr)); | |
52c2abc3 | 163 | |
164 | /* Test for a NULL value. */ | |
55f62e9d | 165 | tmp = build3 (COND_EXPR, TREE_TYPE (tmp), present, tmp, |
166 | fold_convert (TREE_TYPE (tmp), integer_one_node)); | |
52c2abc3 | 167 | tmp = gfc_evaluate_now (tmp, &se->pre); |
86f2ad37 | 168 | se->expr = gfc_build_addr_expr (NULL_TREE, tmp); |
52c2abc3 | 169 | } |
170 | else | |
171 | { | |
172 | tmp = build3 (COND_EXPR, TREE_TYPE (se->expr), present, se->expr, | |
173 | fold_convert (TREE_TYPE (se->expr), integer_zero_node)); | |
174 | tmp = gfc_evaluate_now (tmp, &se->pre); | |
175 | se->expr = tmp; | |
2abe085f | 176 | } |
24146844 | 177 | |
bd24f178 | 178 | if (ts.type == BT_CHARACTER) |
179 | { | |
7d3075f6 | 180 | tmp = build_int_cst (gfc_charlen_type_node, 0); |
f75d6b8a | 181 | tmp = fold_build3 (COND_EXPR, gfc_charlen_type_node, |
182 | present, se->string_length, tmp); | |
bd24f178 | 183 | tmp = gfc_evaluate_now (tmp, &se->pre); |
184 | se->string_length = tmp; | |
185 | } | |
186 | return; | |
187 | } | |
188 | ||
189 | ||
6bf678b8 | 190 | /* Get the character length of an expression, looking through gfc_refs |
191 | if necessary. */ | |
192 | ||
193 | tree | |
194 | gfc_get_expr_charlen (gfc_expr *e) | |
195 | { | |
196 | gfc_ref *r; | |
197 | tree length; | |
198 | ||
199 | gcc_assert (e->expr_type == EXPR_VARIABLE | |
200 | && e->ts.type == BT_CHARACTER); | |
201 | ||
202 | length = NULL; /* To silence compiler warning. */ | |
203 | ||
eeebe20b | 204 | if (is_subref_array (e) && e->ts.u.cl->length) |
1033248c | 205 | { |
206 | gfc_se tmpse; | |
207 | gfc_init_se (&tmpse, NULL); | |
eeebe20b | 208 | gfc_conv_expr_type (&tmpse, e->ts.u.cl->length, gfc_charlen_type_node); |
209 | e->ts.u.cl->backend_decl = tmpse.expr; | |
1033248c | 210 | return tmpse.expr; |
211 | } | |
212 | ||
6bf678b8 | 213 | /* First candidate: if the variable is of type CHARACTER, the |
214 | expression's length could be the length of the character | |
b14e2757 | 215 | variable. */ |
6bf678b8 | 216 | if (e->symtree->n.sym->ts.type == BT_CHARACTER) |
eeebe20b | 217 | length = e->symtree->n.sym->ts.u.cl->backend_decl; |
6bf678b8 | 218 | |
219 | /* Look through the reference chain for component references. */ | |
220 | for (r = e->ref; r; r = r->next) | |
221 | { | |
222 | switch (r->type) | |
223 | { | |
224 | case REF_COMPONENT: | |
225 | if (r->u.c.component->ts.type == BT_CHARACTER) | |
eeebe20b | 226 | length = r->u.c.component->ts.u.cl->backend_decl; |
6bf678b8 | 227 | break; |
228 | ||
229 | case REF_ARRAY: | |
230 | /* Do nothing. */ | |
231 | break; | |
232 | ||
233 | default: | |
234 | /* We should never got substring references here. These will be | |
235 | broken down by the scalarizer. */ | |
236 | gcc_unreachable (); | |
1033248c | 237 | break; |
6bf678b8 | 238 | } |
239 | } | |
240 | ||
241 | gcc_assert (length != NULL); | |
242 | return length; | |
243 | } | |
244 | ||
d778204a | 245 | |
eeebe20b | 246 | /* For each character array constructor subexpression without a ts.u.cl->length, |
d778204a | 247 | replace it by its first element (if there aren't any elements, the length |
248 | should already be set to zero). */ | |
249 | ||
250 | static void | |
251 | flatten_array_ctors_without_strlen (gfc_expr* e) | |
252 | { | |
253 | gfc_actual_arglist* arg; | |
254 | gfc_constructor* c; | |
255 | ||
256 | if (!e) | |
257 | return; | |
258 | ||
259 | switch (e->expr_type) | |
260 | { | |
261 | ||
262 | case EXPR_OP: | |
263 | flatten_array_ctors_without_strlen (e->value.op.op1); | |
264 | flatten_array_ctors_without_strlen (e->value.op.op2); | |
265 | break; | |
266 | ||
267 | case EXPR_COMPCALL: | |
268 | /* TODO: Implement as with EXPR_FUNCTION when needed. */ | |
269 | gcc_unreachable (); | |
270 | ||
271 | case EXPR_FUNCTION: | |
272 | for (arg = e->value.function.actual; arg; arg = arg->next) | |
273 | flatten_array_ctors_without_strlen (arg->expr); | |
274 | break; | |
275 | ||
276 | case EXPR_ARRAY: | |
277 | ||
278 | /* We've found what we're looking for. */ | |
eeebe20b | 279 | if (e->ts.type == BT_CHARACTER && !e->ts.u.cl->length) |
d778204a | 280 | { |
281 | gfc_expr* new_expr; | |
282 | gcc_assert (e->value.constructor); | |
283 | ||
284 | new_expr = e->value.constructor->expr; | |
285 | e->value.constructor->expr = NULL; | |
286 | ||
287 | flatten_array_ctors_without_strlen (new_expr); | |
288 | gfc_replace_expr (e, new_expr); | |
289 | break; | |
290 | } | |
291 | ||
292 | /* Otherwise, fall through to handle constructor elements. */ | |
293 | case EXPR_STRUCTURE: | |
294 | for (c = e->value.constructor; c; c = c->next) | |
295 | flatten_array_ctors_without_strlen (c->expr); | |
296 | break; | |
297 | ||
298 | default: | |
299 | break; | |
300 | ||
301 | } | |
302 | } | |
303 | ||
6bf678b8 | 304 | |
4ee9c684 | 305 | /* Generate code to initialize a string length variable. Returns the |
d778204a | 306 | value. For array constructors, cl->length might be NULL and in this case, |
307 | the first element of the constructor is needed. expr is the original | |
308 | expression so we can access it but can be NULL if this is not needed. */ | |
4ee9c684 | 309 | |
310 | void | |
d778204a | 311 | gfc_conv_string_length (gfc_charlen * cl, gfc_expr * expr, stmtblock_t * pblock) |
4ee9c684 | 312 | { |
313 | gfc_se se; | |
4ee9c684 | 314 | |
315 | gfc_init_se (&se, NULL); | |
d778204a | 316 | |
317 | /* If cl->length is NULL, use gfc_conv_expr to obtain the string length but | |
318 | "flatten" array constructors by taking their first element; all elements | |
319 | should be the same length or a cl->length should be present. */ | |
320 | if (!cl->length) | |
321 | { | |
322 | gfc_expr* expr_flat; | |
323 | gcc_assert (expr); | |
324 | ||
325 | expr_flat = gfc_copy_expr (expr); | |
326 | flatten_array_ctors_without_strlen (expr_flat); | |
327 | gfc_resolve_expr (expr_flat); | |
328 | ||
329 | gfc_conv_expr (&se, expr_flat); | |
330 | gfc_add_block_to_block (pblock, &se.pre); | |
331 | cl->backend_decl = convert (gfc_charlen_type_node, se.string_length); | |
332 | ||
333 | gfc_free_expr (expr_flat); | |
334 | return; | |
335 | } | |
336 | ||
337 | /* Convert cl->length. */ | |
338 | ||
339 | gcc_assert (cl->length); | |
340 | ||
9ad09405 | 341 | gfc_conv_expr_type (&se, cl->length, gfc_charlen_type_node); |
a0ab480a | 342 | se.expr = fold_build2 (MAX_EXPR, gfc_charlen_type_node, se.expr, |
343 | build_int_cst (gfc_charlen_type_node, 0)); | |
4ee9c684 | 344 | gfc_add_block_to_block (pblock, &se.pre); |
345 | ||
0ff77f4e | 346 | if (cl->backend_decl) |
75a70cf9 | 347 | gfc_add_modify (pblock, cl->backend_decl, se.expr); |
0ff77f4e | 348 | else |
349 | cl->backend_decl = gfc_evaluate_now (se.expr, pblock); | |
4ee9c684 | 350 | } |
351 | ||
f888a3fb | 352 | |
4ee9c684 | 353 | static void |
ee3729de | 354 | gfc_conv_substring (gfc_se * se, gfc_ref * ref, int kind, |
355 | const char *name, locus *where) | |
4ee9c684 | 356 | { |
357 | tree tmp; | |
358 | tree type; | |
359 | tree var; | |
ee3729de | 360 | tree fault; |
4ee9c684 | 361 | gfc_se start; |
362 | gfc_se end; | |
ee3729de | 363 | char *msg; |
4ee9c684 | 364 | |
365 | type = gfc_get_character_type (kind, ref->u.ss.length); | |
366 | type = build_pointer_type (type); | |
367 | ||
368 | var = NULL_TREE; | |
369 | gfc_init_se (&start, se); | |
9ad09405 | 370 | gfc_conv_expr_type (&start, ref->u.ss.start, gfc_charlen_type_node); |
4ee9c684 | 371 | gfc_add_block_to_block (&se->pre, &start.pre); |
372 | ||
373 | if (integer_onep (start.expr)) | |
260abd71 | 374 | gfc_conv_string_parameter (se); |
4ee9c684 | 375 | else |
376 | { | |
1bfb5669 | 377 | /* Avoid multiple evaluation of substring start. */ |
378 | if (!CONSTANT_CLASS_P (start.expr) && !DECL_P (start.expr)) | |
379 | start.expr = gfc_evaluate_now (start.expr, &se->pre); | |
380 | ||
4ee9c684 | 381 | /* Change the start of the string. */ |
382 | if (TYPE_STRING_FLAG (TREE_TYPE (se->expr))) | |
383 | tmp = se->expr; | |
384 | else | |
389dd41b | 385 | tmp = build_fold_indirect_ref_loc (input_location, |
386 | se->expr); | |
1033248c | 387 | tmp = gfc_build_array_ref (tmp, start.expr, NULL); |
4ee9c684 | 388 | se->expr = gfc_build_addr_expr (type, tmp); |
389 | } | |
390 | ||
391 | /* Length = end + 1 - start. */ | |
392 | gfc_init_se (&end, se); | |
393 | if (ref->u.ss.end == NULL) | |
394 | end.expr = se->string_length; | |
395 | else | |
396 | { | |
9ad09405 | 397 | gfc_conv_expr_type (&end, ref->u.ss.end, gfc_charlen_type_node); |
4ee9c684 | 398 | gfc_add_block_to_block (&se->pre, &end.pre); |
399 | } | |
1bfb5669 | 400 | if (!CONSTANT_CLASS_P (end.expr) && !DECL_P (end.expr)) |
401 | end.expr = gfc_evaluate_now (end.expr, &se->pre); | |
402 | ||
ad8ed98e | 403 | if (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS) |
ee3729de | 404 | { |
53e60566 | 405 | tree nonempty = fold_build2 (LE_EXPR, boolean_type_node, |
406 | start.expr, end.expr); | |
407 | ||
ee3729de | 408 | /* Check lower bound. */ |
409 | fault = fold_build2 (LT_EXPR, boolean_type_node, start.expr, | |
410 | build_int_cst (gfc_charlen_type_node, 1)); | |
53e60566 | 411 | fault = fold_build2 (TRUTH_ANDIF_EXPR, boolean_type_node, |
412 | nonempty, fault); | |
ee3729de | 413 | if (name) |
399aecc1 | 414 | asprintf (&msg, "Substring out of bounds: lower bound (%%ld) of '%s' " |
ee3729de | 415 | "is less than one", name); |
416 | else | |
399aecc1 | 417 | asprintf (&msg, "Substring out of bounds: lower bound (%%ld)" |
ee3729de | 418 | "is less than one"); |
da6ffc6d | 419 | gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg, |
399aecc1 | 420 | fold_convert (long_integer_type_node, |
421 | start.expr)); | |
ee3729de | 422 | gfc_free (msg); |
423 | ||
424 | /* Check upper bound. */ | |
425 | fault = fold_build2 (GT_EXPR, boolean_type_node, end.expr, | |
426 | se->string_length); | |
53e60566 | 427 | fault = fold_build2 (TRUTH_ANDIF_EXPR, boolean_type_node, |
428 | nonempty, fault); | |
ee3729de | 429 | if (name) |
399aecc1 | 430 | asprintf (&msg, "Substring out of bounds: upper bound (%%ld) of '%s' " |
431 | "exceeds string length (%%ld)", name); | |
ee3729de | 432 | else |
399aecc1 | 433 | asprintf (&msg, "Substring out of bounds: upper bound (%%ld) " |
434 | "exceeds string length (%%ld)"); | |
da6ffc6d | 435 | gfc_trans_runtime_check (true, false, fault, &se->pre, where, msg, |
399aecc1 | 436 | fold_convert (long_integer_type_node, end.expr), |
437 | fold_convert (long_integer_type_node, | |
438 | se->string_length)); | |
ee3729de | 439 | gfc_free (msg); |
440 | } | |
441 | ||
ce825331 | 442 | tmp = fold_build2 (MINUS_EXPR, gfc_charlen_type_node, |
443 | build_int_cst (gfc_charlen_type_node, 1), | |
444 | start.expr); | |
445 | tmp = fold_build2 (PLUS_EXPR, gfc_charlen_type_node, end.expr, tmp); | |
2810b378 | 446 | tmp = fold_build2 (MAX_EXPR, gfc_charlen_type_node, tmp, |
447 | build_int_cst (gfc_charlen_type_node, 0)); | |
ce825331 | 448 | se->string_length = tmp; |
4ee9c684 | 449 | } |
450 | ||
451 | ||
452 | /* Convert a derived type component reference. */ | |
453 | ||
454 | static void | |
455 | gfc_conv_component_ref (gfc_se * se, gfc_ref * ref) | |
456 | { | |
457 | gfc_component *c; | |
458 | tree tmp; | |
459 | tree decl; | |
460 | tree field; | |
461 | ||
462 | c = ref->u.c.component; | |
463 | ||
22d678e8 | 464 | gcc_assert (c->backend_decl); |
4ee9c684 | 465 | |
466 | field = c->backend_decl; | |
22d678e8 | 467 | gcc_assert (TREE_CODE (field) == FIELD_DECL); |
4ee9c684 | 468 | decl = se->expr; |
f75d6b8a | 469 | tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field), decl, field, NULL_TREE); |
4ee9c684 | 470 | |
471 | se->expr = tmp; | |
472 | ||
473 | if (c->ts.type == BT_CHARACTER) | |
474 | { | |
eeebe20b | 475 | tmp = c->ts.u.cl->backend_decl; |
7949cb07 | 476 | /* Components must always be constant length. */ |
22d678e8 | 477 | gcc_assert (tmp && INTEGER_CST_P (tmp)); |
4ee9c684 | 478 | se->string_length = tmp; |
479 | } | |
480 | ||
85d1c108 | 481 | if ((c->attr.pointer && c->attr.dimension == 0 && c->ts.type != BT_CHARACTER) |
482 | || c->attr.proc_pointer) | |
389dd41b | 483 | se->expr = build_fold_indirect_ref_loc (input_location, |
484 | se->expr); | |
4ee9c684 | 485 | } |
486 | ||
487 | ||
ea94d76d | 488 | /* This function deals with component references to components of the |
489 | parent type for derived type extensons. */ | |
490 | static void | |
491 | conv_parent_component_references (gfc_se * se, gfc_ref * ref) | |
492 | { | |
493 | gfc_component *c; | |
494 | gfc_component *cmp; | |
495 | gfc_symbol *dt; | |
496 | gfc_ref parent; | |
497 | ||
498 | dt = ref->u.c.sym; | |
499 | c = ref->u.c.component; | |
500 | ||
501 | /* Build a gfc_ref to recursively call gfc_conv_component_ref. */ | |
502 | parent.type = REF_COMPONENT; | |
503 | parent.next = NULL; | |
504 | parent.u.c.sym = dt; | |
505 | parent.u.c.component = dt->components; | |
506 | ||
507 | if (dt->attr.extension && dt->components) | |
508 | { | |
509 | /* Return if the component is not in the parent type. */ | |
510 | for (cmp = dt->components->next; cmp; cmp = cmp->next) | |
511 | if (strcmp (c->name, cmp->name) == 0) | |
512 | return; | |
513 | ||
514 | /* Otherwise build the reference and call self. */ | |
515 | gfc_conv_component_ref (se, &parent); | |
eeebe20b | 516 | parent.u.c.sym = dt->components->ts.u.derived; |
ea94d76d | 517 | parent.u.c.component = c; |
518 | conv_parent_component_references (se, &parent); | |
519 | } | |
520 | } | |
521 | ||
4ee9c684 | 522 | /* Return the contents of a variable. Also handles reference/pointer |
523 | variables (all Fortran pointer references are implicit). */ | |
524 | ||
525 | static void | |
526 | gfc_conv_variable (gfc_se * se, gfc_expr * expr) | |
527 | { | |
528 | gfc_ref *ref; | |
529 | gfc_symbol *sym; | |
c750cc52 | 530 | tree parent_decl; |
531 | int parent_flag; | |
532 | bool return_value; | |
533 | bool alternate_entry; | |
534 | bool entry_master; | |
4ee9c684 | 535 | |
536 | sym = expr->symtree->n.sym; | |
537 | if (se->ss != NULL) | |
538 | { | |
539 | /* Check that something hasn't gone horribly wrong. */ | |
22d678e8 | 540 | gcc_assert (se->ss != gfc_ss_terminator); |
541 | gcc_assert (se->ss->expr == expr); | |
4ee9c684 | 542 | |
543 | /* A scalarized term. We already know the descriptor. */ | |
544 | se->expr = se->ss->data.info.descriptor; | |
7949cb07 | 545 | se->string_length = se->ss->string_length; |
598d8efb | 546 | for (ref = se->ss->data.info.ref; ref; ref = ref->next) |
547 | if (ref->type == REF_ARRAY && ref->u.ar.type != AR_ELEMENT) | |
548 | break; | |
4ee9c684 | 549 | } |
550 | else | |
551 | { | |
c6871095 | 552 | tree se_expr = NULL_TREE; |
553 | ||
b7bf3f81 | 554 | se->expr = gfc_get_symbol_decl (sym); |
4ee9c684 | 555 | |
c750cc52 | 556 | /* Deal with references to a parent results or entries by storing |
557 | the current_function_decl and moving to the parent_decl. */ | |
c750cc52 | 558 | return_value = sym->attr.function && sym->result == sym; |
559 | alternate_entry = sym->attr.function && sym->attr.entry | |
b01f72f3 | 560 | && sym->result == sym; |
c750cc52 | 561 | entry_master = sym->attr.result |
b01f72f3 | 562 | && sym->ns->proc_name->attr.entry_master |
563 | && !gfc_return_by_reference (sym->ns->proc_name); | |
c750cc52 | 564 | parent_decl = DECL_CONTEXT (current_function_decl); |
565 | ||
566 | if ((se->expr == parent_decl && return_value) | |
b01f72f3 | 567 | || (sym->ns && sym->ns->proc_name |
d77f260f | 568 | && parent_decl |
b01f72f3 | 569 | && sym->ns->proc_name->backend_decl == parent_decl |
570 | && (alternate_entry || entry_master))) | |
c750cc52 | 571 | parent_flag = 1; |
572 | else | |
573 | parent_flag = 0; | |
574 | ||
c6871095 | 575 | /* Special case for assigning the return value of a function. |
576 | Self recursive functions must have an explicit return value. */ | |
b01f72f3 | 577 | if (return_value && (se->expr == current_function_decl || parent_flag)) |
c750cc52 | 578 | se_expr = gfc_get_fake_result_decl (sym, parent_flag); |
c6871095 | 579 | |
580 | /* Similarly for alternate entry points. */ | |
c750cc52 | 581 | else if (alternate_entry |
b01f72f3 | 582 | && (sym->ns->proc_name->backend_decl == current_function_decl |
583 | || parent_flag)) | |
c6871095 | 584 | { |
585 | gfc_entry_list *el = NULL; | |
586 | ||
587 | for (el = sym->ns->entries; el; el = el->next) | |
588 | if (sym == el->sym) | |
589 | { | |
c750cc52 | 590 | se_expr = gfc_get_fake_result_decl (sym, parent_flag); |
c6871095 | 591 | break; |
592 | } | |
593 | } | |
594 | ||
c750cc52 | 595 | else if (entry_master |
b01f72f3 | 596 | && (sym->ns->proc_name->backend_decl == current_function_decl |
597 | || parent_flag)) | |
c750cc52 | 598 | se_expr = gfc_get_fake_result_decl (sym, parent_flag); |
c6871095 | 599 | |
600 | if (se_expr) | |
601 | se->expr = se_expr; | |
602 | ||
4ee9c684 | 603 | /* Procedure actual arguments. */ |
c6871095 | 604 | else if (sym->attr.flavor == FL_PROCEDURE |
605 | && se->expr != current_function_decl) | |
4ee9c684 | 606 | { |
cad0ddcf | 607 | if (!sym->attr.dummy && !sym->attr.proc_pointer) |
4ee9c684 | 608 | { |
22d678e8 | 609 | gcc_assert (TREE_CODE (se->expr) == FUNCTION_DECL); |
86f2ad37 | 610 | se->expr = gfc_build_addr_expr (NULL_TREE, se->expr); |
4ee9c684 | 611 | } |
612 | return; | |
544c333b | 613 | } |
614 | ||
615 | ||
616 | /* Dereference the expression, where needed. Since characters | |
617 | are entirely different from other types, they are treated | |
618 | separately. */ | |
619 | if (sym->ts.type == BT_CHARACTER) | |
620 | { | |
8f6339b6 | 621 | /* Dereference character pointer dummy arguments |
bf7e666b | 622 | or results. */ |
544c333b | 623 | if ((sym->attr.pointer || sym->attr.allocatable) |
4442ee19 | 624 | && (sym->attr.dummy |
625 | || sym->attr.function | |
626 | || sym->attr.result)) | |
389dd41b | 627 | se->expr = build_fold_indirect_ref_loc (input_location, |
628 | se->expr); | |
8f6339b6 | 629 | |
544c333b | 630 | } |
8f6339b6 | 631 | else if (!sym->attr.value) |
544c333b | 632 | { |
747a9f62 | 633 | /* Dereference non-character scalar dummy arguments. */ |
4442ee19 | 634 | if (sym->attr.dummy && !sym->attr.dimension) |
389dd41b | 635 | se->expr = build_fold_indirect_ref_loc (input_location, |
636 | se->expr); | |
544c333b | 637 | |
bf7e666b | 638 | /* Dereference scalar hidden result. */ |
4442ee19 | 639 | if (gfc_option.flag_f2c && sym->ts.type == BT_COMPLEX |
544c333b | 640 | && (sym->attr.function || sym->attr.result) |
36efa756 | 641 | && !sym->attr.dimension && !sym->attr.pointer |
642 | && !sym->attr.always_explicit) | |
389dd41b | 643 | se->expr = build_fold_indirect_ref_loc (input_location, |
644 | se->expr); | |
544c333b | 645 | |
646 | /* Dereference non-character pointer variables. | |
747a9f62 | 647 | These must be dummies, results, or scalars. */ |
544c333b | 648 | if ((sym->attr.pointer || sym->attr.allocatable) |
4442ee19 | 649 | && (sym->attr.dummy |
650 | || sym->attr.function | |
651 | || sym->attr.result | |
652 | || !sym->attr.dimension)) | |
389dd41b | 653 | se->expr = build_fold_indirect_ref_loc (input_location, |
654 | se->expr); | |
544c333b | 655 | } |
656 | ||
4ee9c684 | 657 | ref = expr->ref; |
658 | } | |
659 | ||
660 | /* For character variables, also get the length. */ | |
661 | if (sym->ts.type == BT_CHARACTER) | |
662 | { | |
7af6a4af | 663 | /* If the character length of an entry isn't set, get the length from |
664 | the master function instead. */ | |
eeebe20b | 665 | if (sym->attr.entry && !sym->ts.u.cl->backend_decl) |
666 | se->string_length = sym->ns->proc_name->ts.u.cl->backend_decl; | |
7af6a4af | 667 | else |
eeebe20b | 668 | se->string_length = sym->ts.u.cl->backend_decl; |
22d678e8 | 669 | gcc_assert (se->string_length); |
4ee9c684 | 670 | } |
671 | ||
672 | while (ref) | |
673 | { | |
674 | switch (ref->type) | |
675 | { | |
676 | case REF_ARRAY: | |
677 | /* Return the descriptor if that's what we want and this is an array | |
678 | section reference. */ | |
679 | if (se->descriptor_only && ref->u.ar.type != AR_ELEMENT) | |
680 | return; | |
681 | /* TODO: Pointers to single elements of array sections, eg elemental subs. */ | |
682 | /* Return the descriptor for array pointers and allocations. */ | |
683 | if (se->want_pointer | |
684 | && ref->next == NULL && (se->descriptor_only)) | |
685 | return; | |
686 | ||
97c2a00c | 687 | gfc_conv_array_ref (se, &ref->u.ar, sym, &expr->where); |
4ee9c684 | 688 | /* Return a pointer to an element. */ |
689 | break; | |
690 | ||
691 | case REF_COMPONENT: | |
ea94d76d | 692 | if (ref->u.c.sym->attr.extension) |
693 | conv_parent_component_references (se, ref); | |
694 | ||
4ee9c684 | 695 | gfc_conv_component_ref (se, ref); |
696 | break; | |
697 | ||
698 | case REF_SUBSTRING: | |
ee3729de | 699 | gfc_conv_substring (se, ref, expr->ts.kind, |
700 | expr->symtree->name, &expr->where); | |
4ee9c684 | 701 | break; |
702 | ||
703 | default: | |
22d678e8 | 704 | gcc_unreachable (); |
4ee9c684 | 705 | break; |
706 | } | |
707 | ref = ref->next; | |
708 | } | |
709 | /* Pointer assignment, allocation or pass by reference. Arrays are handled | |
f888a3fb | 710 | separately. */ |
4ee9c684 | 711 | if (se->want_pointer) |
712 | { | |
713 | if (expr->ts.type == BT_CHARACTER) | |
714 | gfc_conv_string_parameter (se); | |
715 | else | |
86f2ad37 | 716 | se->expr = gfc_build_addr_expr (NULL_TREE, se->expr); |
4ee9c684 | 717 | } |
4ee9c684 | 718 | } |
719 | ||
720 | ||
721 | /* Unary ops are easy... Or they would be if ! was a valid op. */ | |
722 | ||
723 | static void | |
724 | gfc_conv_unary_op (enum tree_code code, gfc_se * se, gfc_expr * expr) | |
725 | { | |
726 | gfc_se operand; | |
727 | tree type; | |
728 | ||
22d678e8 | 729 | gcc_assert (expr->ts.type != BT_CHARACTER); |
4ee9c684 | 730 | /* Initialize the operand. */ |
731 | gfc_init_se (&operand, se); | |
9b773341 | 732 | gfc_conv_expr_val (&operand, expr->value.op.op1); |
4ee9c684 | 733 | gfc_add_block_to_block (&se->pre, &operand.pre); |
734 | ||
735 | type = gfc_typenode_for_spec (&expr->ts); | |
736 | ||
737 | /* TRUTH_NOT_EXPR is not a "true" unary operator in GCC. | |
738 | We must convert it to a compare to 0 (e.g. EQ_EXPR (op1, 0)). | |
f888a3fb | 739 | All other unary operators have an equivalent GIMPLE unary operator. */ |
4ee9c684 | 740 | if (code == TRUTH_NOT_EXPR) |
751ff693 | 741 | se->expr = fold_build2 (EQ_EXPR, type, operand.expr, |
742 | build_int_cst (type, 0)); | |
4ee9c684 | 743 | else |
751ff693 | 744 | se->expr = fold_build1 (code, type, operand.expr); |
4ee9c684 | 745 | |
746 | } | |
747 | ||
76834664 | 748 | /* Expand power operator to optimal multiplications when a value is raised |
f888a3fb | 749 | to a constant integer n. See section 4.6.3, "Evaluation of Powers" of |
76834664 | 750 | Donald E. Knuth, "Seminumerical Algorithms", Vol. 2, "The Art of Computer |
751 | Programming", 3rd Edition, 1998. */ | |
752 | ||
753 | /* This code is mostly duplicated from expand_powi in the backend. | |
754 | We establish the "optimal power tree" lookup table with the defined size. | |
755 | The items in the table are the exponents used to calculate the index | |
756 | exponents. Any integer n less than the value can get an "addition chain", | |
757 | with the first node being one. */ | |
758 | #define POWI_TABLE_SIZE 256 | |
759 | ||
f888a3fb | 760 | /* The table is from builtins.c. */ |
76834664 | 761 | static const unsigned char powi_table[POWI_TABLE_SIZE] = |
762 | { | |
763 | 0, 1, 1, 2, 2, 3, 3, 4, /* 0 - 7 */ | |
764 | 4, 6, 5, 6, 6, 10, 7, 9, /* 8 - 15 */ | |
765 | 8, 16, 9, 16, 10, 12, 11, 13, /* 16 - 23 */ | |
766 | 12, 17, 13, 18, 14, 24, 15, 26, /* 24 - 31 */ | |
767 | 16, 17, 17, 19, 18, 33, 19, 26, /* 32 - 39 */ | |
768 | 20, 25, 21, 40, 22, 27, 23, 44, /* 40 - 47 */ | |
769 | 24, 32, 25, 34, 26, 29, 27, 44, /* 48 - 55 */ | |
770 | 28, 31, 29, 34, 30, 60, 31, 36, /* 56 - 63 */ | |
771 | 32, 64, 33, 34, 34, 46, 35, 37, /* 64 - 71 */ | |
772 | 36, 65, 37, 50, 38, 48, 39, 69, /* 72 - 79 */ | |
773 | 40, 49, 41, 43, 42, 51, 43, 58, /* 80 - 87 */ | |
774 | 44, 64, 45, 47, 46, 59, 47, 76, /* 88 - 95 */ | |
775 | 48, 65, 49, 66, 50, 67, 51, 66, /* 96 - 103 */ | |
776 | 52, 70, 53, 74, 54, 104, 55, 74, /* 104 - 111 */ | |
777 | 56, 64, 57, 69, 58, 78, 59, 68, /* 112 - 119 */ | |
778 | 60, 61, 61, 80, 62, 75, 63, 68, /* 120 - 127 */ | |
779 | 64, 65, 65, 128, 66, 129, 67, 90, /* 128 - 135 */ | |
780 | 68, 73, 69, 131, 70, 94, 71, 88, /* 136 - 143 */ | |
781 | 72, 128, 73, 98, 74, 132, 75, 121, /* 144 - 151 */ | |
782 | 76, 102, 77, 124, 78, 132, 79, 106, /* 152 - 159 */ | |
783 | 80, 97, 81, 160, 82, 99, 83, 134, /* 160 - 167 */ | |
784 | 84, 86, 85, 95, 86, 160, 87, 100, /* 168 - 175 */ | |
785 | 88, 113, 89, 98, 90, 107, 91, 122, /* 176 - 183 */ | |
786 | 92, 111, 93, 102, 94, 126, 95, 150, /* 184 - 191 */ | |
787 | 96, 128, 97, 130, 98, 133, 99, 195, /* 192 - 199 */ | |
788 | 100, 128, 101, 123, 102, 164, 103, 138, /* 200 - 207 */ | |
789 | 104, 145, 105, 146, 106, 109, 107, 149, /* 208 - 215 */ | |
790 | 108, 200, 109, 146, 110, 170, 111, 157, /* 216 - 223 */ | |
791 | 112, 128, 113, 130, 114, 182, 115, 132, /* 224 - 231 */ | |
792 | 116, 200, 117, 132, 118, 158, 119, 206, /* 232 - 239 */ | |
793 | 120, 240, 121, 162, 122, 147, 123, 152, /* 240 - 247 */ | |
794 | 124, 166, 125, 214, 126, 138, 127, 153, /* 248 - 255 */ | |
795 | }; | |
796 | ||
f888a3fb | 797 | /* If n is larger than lookup table's max index, we use the "window |
798 | method". */ | |
76834664 | 799 | #define POWI_WINDOW_SIZE 3 |
800 | ||
f888a3fb | 801 | /* Recursive function to expand the power operator. The temporary |
802 | values are put in tmpvar. The function returns tmpvar[1] ** n. */ | |
76834664 | 803 | static tree |
6929935b | 804 | gfc_conv_powi (gfc_se * se, unsigned HOST_WIDE_INT n, tree * tmpvar) |
4ee9c684 | 805 | { |
76834664 | 806 | tree op0; |
807 | tree op1; | |
4ee9c684 | 808 | tree tmp; |
76834664 | 809 | int digit; |
4ee9c684 | 810 | |
76834664 | 811 | if (n < POWI_TABLE_SIZE) |
4ee9c684 | 812 | { |
76834664 | 813 | if (tmpvar[n]) |
814 | return tmpvar[n]; | |
4ee9c684 | 815 | |
76834664 | 816 | op0 = gfc_conv_powi (se, n - powi_table[n], tmpvar); |
817 | op1 = gfc_conv_powi (se, powi_table[n], tmpvar); | |
818 | } | |
819 | else if (n & 1) | |
820 | { | |
821 | digit = n & ((1 << POWI_WINDOW_SIZE) - 1); | |
822 | op0 = gfc_conv_powi (se, n - digit, tmpvar); | |
823 | op1 = gfc_conv_powi (se, digit, tmpvar); | |
4ee9c684 | 824 | } |
825 | else | |
826 | { | |
76834664 | 827 | op0 = gfc_conv_powi (se, n >> 1, tmpvar); |
828 | op1 = op0; | |
4ee9c684 | 829 | } |
830 | ||
318c9b27 | 831 | tmp = fold_build2 (MULT_EXPR, TREE_TYPE (op0), op0, op1); |
76834664 | 832 | tmp = gfc_evaluate_now (tmp, &se->pre); |
4ee9c684 | 833 | |
76834664 | 834 | if (n < POWI_TABLE_SIZE) |
835 | tmpvar[n] = tmp; | |
4ee9c684 | 836 | |
76834664 | 837 | return tmp; |
838 | } | |
4ee9c684 | 839 | |
f888a3fb | 840 | |
841 | /* Expand lhs ** rhs. rhs is a constant integer. If it expands successfully, | |
842 | return 1. Else return 0 and a call to runtime library functions | |
843 | will have to be built. */ | |
76834664 | 844 | static int |
845 | gfc_conv_cst_int_power (gfc_se * se, tree lhs, tree rhs) | |
846 | { | |
847 | tree cond; | |
848 | tree tmp; | |
849 | tree type; | |
850 | tree vartmp[POWI_TABLE_SIZE]; | |
6929935b | 851 | HOST_WIDE_INT m; |
852 | unsigned HOST_WIDE_INT n; | |
76834664 | 853 | int sgn; |
4ee9c684 | 854 | |
6929935b | 855 | /* If exponent is too large, we won't expand it anyway, so don't bother |
856 | with large integer values. */ | |
857 | if (!double_int_fits_in_shwi_p (TREE_INT_CST (rhs))) | |
858 | return 0; | |
859 | ||
860 | m = double_int_to_shwi (TREE_INT_CST (rhs)); | |
861 | /* There's no ABS for HOST_WIDE_INT, so here we go. It also takes care | |
862 | of the asymmetric range of the integer type. */ | |
863 | n = (unsigned HOST_WIDE_INT) (m < 0 ? -m : m); | |
864 | ||
76834664 | 865 | type = TREE_TYPE (lhs); |
76834664 | 866 | sgn = tree_int_cst_sgn (rhs); |
4ee9c684 | 867 | |
6929935b | 868 | if (((FLOAT_TYPE_P (type) && !flag_unsafe_math_optimizations) |
869 | || optimize_size) && (m > 2 || m < -1)) | |
76834664 | 870 | return 0; |
4ee9c684 | 871 | |
76834664 | 872 | /* rhs == 0 */ |
873 | if (sgn == 0) | |
874 | { | |
875 | se->expr = gfc_build_const (type, integer_one_node); | |
876 | return 1; | |
877 | } | |
6929935b | 878 | |
76834664 | 879 | /* If rhs < 0 and lhs is an integer, the result is -1, 0 or 1. */ |
880 | if ((sgn == -1) && (TREE_CODE (type) == INTEGER_TYPE)) | |
881 | { | |
f75d6b8a | 882 | tmp = fold_build2 (EQ_EXPR, boolean_type_node, |
883 | lhs, build_int_cst (TREE_TYPE (lhs), -1)); | |
884 | cond = fold_build2 (EQ_EXPR, boolean_type_node, | |
885 | lhs, build_int_cst (TREE_TYPE (lhs), 1)); | |
76834664 | 886 | |
f888a3fb | 887 | /* If rhs is even, |
260abd71 | 888 | result = (lhs == 1 || lhs == -1) ? 1 : 0. */ |
76834664 | 889 | if ((n & 1) == 0) |
890 | { | |
f75d6b8a | 891 | tmp = fold_build2 (TRUTH_OR_EXPR, boolean_type_node, tmp, cond); |
892 | se->expr = fold_build3 (COND_EXPR, type, | |
893 | tmp, build_int_cst (type, 1), | |
894 | build_int_cst (type, 0)); | |
76834664 | 895 | return 1; |
896 | } | |
f888a3fb | 897 | /* If rhs is odd, |
76834664 | 898 | result = (lhs == 1) ? 1 : (lhs == -1) ? -1 : 0. */ |
f75d6b8a | 899 | tmp = fold_build3 (COND_EXPR, type, tmp, build_int_cst (type, -1), |
900 | build_int_cst (type, 0)); | |
901 | se->expr = fold_build3 (COND_EXPR, type, | |
902 | cond, build_int_cst (type, 1), tmp); | |
76834664 | 903 | return 1; |
904 | } | |
4ee9c684 | 905 | |
76834664 | 906 | memset (vartmp, 0, sizeof (vartmp)); |
907 | vartmp[1] = lhs; | |
76834664 | 908 | if (sgn == -1) |
909 | { | |
910 | tmp = gfc_build_const (type, integer_one_node); | |
f75d6b8a | 911 | vartmp[1] = fold_build2 (RDIV_EXPR, type, tmp, vartmp[1]); |
76834664 | 912 | } |
f5efe504 | 913 | |
914 | se->expr = gfc_conv_powi (se, n, vartmp); | |
915 | ||
76834664 | 916 | return 1; |
4ee9c684 | 917 | } |
918 | ||
919 | ||
76834664 | 920 | /* Power op (**). Constant integer exponent has special handling. */ |
4ee9c684 | 921 | |
922 | static void | |
923 | gfc_conv_power_op (gfc_se * se, gfc_expr * expr) | |
924 | { | |
90ba9145 | 925 | tree gfc_int4_type_node; |
4ee9c684 | 926 | int kind; |
76834664 | 927 | int ikind; |
4ee9c684 | 928 | gfc_se lse; |
929 | gfc_se rse; | |
930 | tree fndecl; | |
4ee9c684 | 931 | |
932 | gfc_init_se (&lse, se); | |
9b773341 | 933 | gfc_conv_expr_val (&lse, expr->value.op.op1); |
7f0345dc | 934 | lse.expr = gfc_evaluate_now (lse.expr, &lse.pre); |
4ee9c684 | 935 | gfc_add_block_to_block (&se->pre, &lse.pre); |
936 | ||
937 | gfc_init_se (&rse, se); | |
9b773341 | 938 | gfc_conv_expr_val (&rse, expr->value.op.op2); |
4ee9c684 | 939 | gfc_add_block_to_block (&se->pre, &rse.pre); |
940 | ||
9b773341 | 941 | if (expr->value.op.op2->ts.type == BT_INTEGER |
150c0c39 | 942 | && expr->value.op.op2->expr_type == EXPR_CONSTANT) |
76834664 | 943 | if (gfc_conv_cst_int_power (se, lse.expr, rse.expr)) |
150c0c39 | 944 | return; |
4ee9c684 | 945 | |
90ba9145 | 946 | gfc_int4_type_node = gfc_get_int_type (4); |
947 | ||
9b773341 | 948 | kind = expr->value.op.op1->ts.kind; |
949 | switch (expr->value.op.op2->ts.type) | |
4ee9c684 | 950 | { |
951 | case BT_INTEGER: | |
9b773341 | 952 | ikind = expr->value.op.op2->ts.kind; |
76834664 | 953 | switch (ikind) |
954 | { | |
955 | case 1: | |
956 | case 2: | |
957 | rse.expr = convert (gfc_int4_type_node, rse.expr); | |
958 | /* Fall through. */ | |
959 | ||
960 | case 4: | |
961 | ikind = 0; | |
962 | break; | |
963 | ||
964 | case 8: | |
965 | ikind = 1; | |
966 | break; | |
967 | ||
920e54ef | 968 | case 16: |
969 | ikind = 2; | |
970 | break; | |
971 | ||
76834664 | 972 | default: |
22d678e8 | 973 | gcc_unreachable (); |
76834664 | 974 | } |
975 | switch (kind) | |
976 | { | |
977 | case 1: | |
978 | case 2: | |
9b773341 | 979 | if (expr->value.op.op1->ts.type == BT_INTEGER) |
76834664 | 980 | lse.expr = convert (gfc_int4_type_node, lse.expr); |
981 | else | |
22d678e8 | 982 | gcc_unreachable (); |
76834664 | 983 | /* Fall through. */ |
984 | ||
985 | case 4: | |
986 | kind = 0; | |
987 | break; | |
988 | ||
989 | case 8: | |
990 | kind = 1; | |
991 | break; | |
992 | ||
920e54ef | 993 | case 10: |
994 | kind = 2; | |
995 | break; | |
996 | ||
997 | case 16: | |
998 | kind = 3; | |
999 | break; | |
1000 | ||
76834664 | 1001 | default: |
22d678e8 | 1002 | gcc_unreachable (); |
76834664 | 1003 | } |
1004 | ||
9b773341 | 1005 | switch (expr->value.op.op1->ts.type) |
76834664 | 1006 | { |
1007 | case BT_INTEGER: | |
920e54ef | 1008 | if (kind == 3) /* Case 16 was not handled properly above. */ |
1009 | kind = 2; | |
76834664 | 1010 | fndecl = gfor_fndecl_math_powi[kind][ikind].integer; |
1011 | break; | |
1012 | ||
1013 | case BT_REAL: | |
150c0c39 | 1014 | /* Use builtins for real ** int4. */ |
1015 | if (ikind == 0) | |
1016 | { | |
1017 | switch (kind) | |
1018 | { | |
1019 | case 0: | |
1020 | fndecl = built_in_decls[BUILT_IN_POWIF]; | |
1021 | break; | |
1022 | ||
1023 | case 1: | |
1024 | fndecl = built_in_decls[BUILT_IN_POWI]; | |
1025 | break; | |
1026 | ||
1027 | case 2: | |
1028 | case 3: | |
1029 | fndecl = built_in_decls[BUILT_IN_POWIL]; | |
1030 | break; | |
1031 | ||
1032 | default: | |
1033 | gcc_unreachable (); | |
1034 | } | |
1035 | } | |
1036 | else | |
1037 | fndecl = gfor_fndecl_math_powi[kind][ikind].real; | |
76834664 | 1038 | break; |
1039 | ||
1040 | case BT_COMPLEX: | |
1041 | fndecl = gfor_fndecl_math_powi[kind][ikind].cmplx; | |
1042 | break; | |
1043 | ||
1044 | default: | |
22d678e8 | 1045 | gcc_unreachable (); |
76834664 | 1046 | } |
1047 | break; | |
4ee9c684 | 1048 | |
1049 | case BT_REAL: | |
1050 | switch (kind) | |
1051 | { | |
1052 | case 4: | |
76834664 | 1053 | fndecl = built_in_decls[BUILT_IN_POWF]; |
4ee9c684 | 1054 | break; |
1055 | case 8: | |
76834664 | 1056 | fndecl = built_in_decls[BUILT_IN_POW]; |
4ee9c684 | 1057 | break; |
920e54ef | 1058 | case 10: |
1059 | case 16: | |
1060 | fndecl = built_in_decls[BUILT_IN_POWL]; | |
1061 | break; | |
4ee9c684 | 1062 | default: |
22d678e8 | 1063 | gcc_unreachable (); |
4ee9c684 | 1064 | } |
1065 | break; | |
1066 | ||
1067 | case BT_COMPLEX: | |
1068 | switch (kind) | |
1069 | { | |
1070 | case 4: | |
6aee6ac8 | 1071 | fndecl = built_in_decls[BUILT_IN_CPOWF]; |
4ee9c684 | 1072 | break; |
1073 | case 8: | |
6aee6ac8 | 1074 | fndecl = built_in_decls[BUILT_IN_CPOW]; |
4ee9c684 | 1075 | break; |
920e54ef | 1076 | case 10: |
920e54ef | 1077 | case 16: |
6aee6ac8 | 1078 | fndecl = built_in_decls[BUILT_IN_CPOWL]; |
920e54ef | 1079 | break; |
4ee9c684 | 1080 | default: |
22d678e8 | 1081 | gcc_unreachable (); |
4ee9c684 | 1082 | } |
1083 | break; | |
1084 | ||
1085 | default: | |
22d678e8 | 1086 | gcc_unreachable (); |
4ee9c684 | 1087 | break; |
1088 | } | |
1089 | ||
389dd41b | 1090 | se->expr = build_call_expr_loc (input_location, |
1091 | fndecl, 2, lse.expr, rse.expr); | |
4ee9c684 | 1092 | } |
1093 | ||
1094 | ||
1095 | /* Generate code to allocate a string temporary. */ | |
1096 | ||
1097 | tree | |
1098 | gfc_conv_string_tmp (gfc_se * se, tree type, tree len) | |
1099 | { | |
1100 | tree var; | |
1101 | tree tmp; | |
4ee9c684 | 1102 | |
22d678e8 | 1103 | gcc_assert (TREE_TYPE (len) == gfc_charlen_type_node); |
260abd71 | 1104 | |
4ee9c684 | 1105 | if (gfc_can_put_var_on_stack (len)) |
1106 | { | |
1107 | /* Create a temporary variable to hold the result. */ | |
318c9b27 | 1108 | tmp = fold_build2 (MINUS_EXPR, gfc_charlen_type_node, len, |
7d3075f6 | 1109 | build_int_cst (gfc_charlen_type_node, 1)); |
260abd71 | 1110 | tmp = build_range_type (gfc_array_index_type, gfc_index_zero_node, tmp); |
51bd6479 | 1111 | |
1112 | if (TREE_CODE (TREE_TYPE (type)) == ARRAY_TYPE) | |
1113 | tmp = build_array_type (TREE_TYPE (TREE_TYPE (type)), tmp); | |
1114 | else | |
1115 | tmp = build_array_type (TREE_TYPE (type), tmp); | |
1116 | ||
4ee9c684 | 1117 | var = gfc_create_var (tmp, "str"); |
1118 | var = gfc_build_addr_expr (type, var); | |
1119 | } | |
1120 | else | |
1121 | { | |
1122 | /* Allocate a temporary to hold the result. */ | |
1123 | var = gfc_create_var (type, "pstr"); | |
b44437b9 | 1124 | tmp = gfc_call_malloc (&se->pre, type, |
1125 | fold_build2 (MULT_EXPR, TREE_TYPE (len), len, | |
1126 | fold_convert (TREE_TYPE (len), | |
1127 | TYPE_SIZE (type)))); | |
75a70cf9 | 1128 | gfc_add_modify (&se->pre, var, tmp); |
4ee9c684 | 1129 | |
1130 | /* Free the temporary afterwards. */ | |
6a2a96d6 | 1131 | tmp = gfc_call_free (convert (pvoid_type_node, var)); |
4ee9c684 | 1132 | gfc_add_expr_to_block (&se->post, tmp); |
1133 | } | |
1134 | ||
1135 | return var; | |
1136 | } | |
1137 | ||
1138 | ||
1139 | /* Handle a string concatenation operation. A temporary will be allocated to | |
1140 | hold the result. */ | |
1141 | ||
1142 | static void | |
1143 | gfc_conv_concat_op (gfc_se * se, gfc_expr * expr) | |
1144 | { | |
40b806de | 1145 | gfc_se lse, rse; |
1146 | tree len, type, var, tmp, fndecl; | |
4ee9c684 | 1147 | |
9b773341 | 1148 | gcc_assert (expr->value.op.op1->ts.type == BT_CHARACTER |
40b806de | 1149 | && expr->value.op.op2->ts.type == BT_CHARACTER); |
b44437b9 | 1150 | gcc_assert (expr->value.op.op1->ts.kind == expr->value.op.op2->ts.kind); |
4ee9c684 | 1151 | |
1152 | gfc_init_se (&lse, se); | |
9b773341 | 1153 | gfc_conv_expr (&lse, expr->value.op.op1); |
4ee9c684 | 1154 | gfc_conv_string_parameter (&lse); |
1155 | gfc_init_se (&rse, se); | |
9b773341 | 1156 | gfc_conv_expr (&rse, expr->value.op.op2); |
4ee9c684 | 1157 | gfc_conv_string_parameter (&rse); |
1158 | ||
1159 | gfc_add_block_to_block (&se->pre, &lse.pre); | |
1160 | gfc_add_block_to_block (&se->pre, &rse.pre); | |
1161 | ||
eeebe20b | 1162 | type = gfc_get_character_type (expr->ts.kind, expr->ts.u.cl); |
4ee9c684 | 1163 | len = TYPE_MAX_VALUE (TYPE_DOMAIN (type)); |
1164 | if (len == NULL_TREE) | |
1165 | { | |
318c9b27 | 1166 | len = fold_build2 (PLUS_EXPR, TREE_TYPE (lse.string_length), |
1167 | lse.string_length, rse.string_length); | |
4ee9c684 | 1168 | } |
1169 | ||
1170 | type = build_pointer_type (type); | |
1171 | ||
1172 | var = gfc_conv_string_tmp (se, type, len); | |
1173 | ||
1174 | /* Do the actual concatenation. */ | |
40b806de | 1175 | if (expr->ts.kind == 1) |
1176 | fndecl = gfor_fndecl_concat_string; | |
1177 | else if (expr->ts.kind == 4) | |
1178 | fndecl = gfor_fndecl_concat_string_char4; | |
1179 | else | |
1180 | gcc_unreachable (); | |
1181 | ||
389dd41b | 1182 | tmp = build_call_expr_loc (input_location, |
1183 | fndecl, 6, len, var, lse.string_length, lse.expr, | |
c2f47e15 | 1184 | rse.string_length, rse.expr); |
4ee9c684 | 1185 | gfc_add_expr_to_block (&se->pre, tmp); |
1186 | ||
1187 | /* Add the cleanup for the operands. */ | |
1188 | gfc_add_block_to_block (&se->pre, &rse.post); | |
1189 | gfc_add_block_to_block (&se->pre, &lse.post); | |
1190 | ||
1191 | se->expr = var; | |
1192 | se->string_length = len; | |
1193 | } | |
1194 | ||
4ee9c684 | 1195 | /* Translates an op expression. Common (binary) cases are handled by this |
1196 | function, others are passed on. Recursion is used in either case. | |
1197 | We use the fact that (op1.ts == op2.ts) (except for the power | |
f888a3fb | 1198 | operator **). |
4ee9c684 | 1199 | Operators need no special handling for scalarized expressions as long as |
f888a3fb | 1200 | they call gfc_conv_simple_val to get their operands. |
4ee9c684 | 1201 | Character strings get special handling. */ |
1202 | ||
1203 | static void | |
1204 | gfc_conv_expr_op (gfc_se * se, gfc_expr * expr) | |
1205 | { | |
1206 | enum tree_code code; | |
1207 | gfc_se lse; | |
1208 | gfc_se rse; | |
f20cadb1 | 1209 | tree tmp, type; |
4ee9c684 | 1210 | int lop; |
1211 | int checkstring; | |
1212 | ||
1213 | checkstring = 0; | |
1214 | lop = 0; | |
dcb1b019 | 1215 | switch (expr->value.op.op) |
4ee9c684 | 1216 | { |
42b215cc | 1217 | case INTRINSIC_PARENTHESES: |
751ff693 | 1218 | if (expr->ts.type == BT_REAL |
1219 | || expr->ts.type == BT_COMPLEX) | |
1220 | { | |
1221 | gfc_conv_unary_op (PAREN_EXPR, se, expr); | |
1222 | gcc_assert (FLOAT_TYPE_P (TREE_TYPE (se->expr))); | |
1223 | return; | |
1224 | } | |
1225 | ||
1226 | /* Fallthrough. */ | |
1227 | case INTRINSIC_UPLUS: | |
9b773341 | 1228 | gfc_conv_expr (se, expr->value.op.op1); |
4ee9c684 | 1229 | return; |
1230 | ||
1231 | case INTRINSIC_UMINUS: | |
1232 | gfc_conv_unary_op (NEGATE_EXPR, se, expr); | |
1233 | return; | |
1234 | ||
1235 | case INTRINSIC_NOT: | |
1236 | gfc_conv_unary_op (TRUTH_NOT_EXPR, se, expr); | |
1237 | return; | |
1238 | ||
1239 | case INTRINSIC_PLUS: | |
1240 | code = PLUS_EXPR; | |
1241 | break; | |
1242 | ||
1243 | case INTRINSIC_MINUS: | |
1244 | code = MINUS_EXPR; | |
1245 | break; | |
1246 | ||
1247 | case INTRINSIC_TIMES: | |
1248 | code = MULT_EXPR; | |
1249 | break; | |
1250 | ||
1251 | case INTRINSIC_DIVIDE: | |
1252 | /* If expr is a real or complex expr, use an RDIV_EXPR. If op1 is | |
1253 | an integer, we must round towards zero, so we use a | |
1254 | TRUNC_DIV_EXPR. */ | |
1255 | if (expr->ts.type == BT_INTEGER) | |
1256 | code = TRUNC_DIV_EXPR; | |
1257 | else | |
1258 | code = RDIV_EXPR; | |
1259 | break; | |
1260 | ||
1261 | case INTRINSIC_POWER: | |
1262 | gfc_conv_power_op (se, expr); | |
1263 | return; | |
1264 | ||
1265 | case INTRINSIC_CONCAT: | |
1266 | gfc_conv_concat_op (se, expr); | |
1267 | return; | |
1268 | ||
1269 | case INTRINSIC_AND: | |
1270 | code = TRUTH_ANDIF_EXPR; | |
1271 | lop = 1; | |
1272 | break; | |
1273 | ||
1274 | case INTRINSIC_OR: | |
1275 | code = TRUTH_ORIF_EXPR; | |
1276 | lop = 1; | |
1277 | break; | |
1278 | ||
1279 | /* EQV and NEQV only work on logicals, but since we represent them | |
88bce636 | 1280 | as integers, we can use EQ_EXPR and NE_EXPR for them in GIMPLE. */ |
4ee9c684 | 1281 | case INTRINSIC_EQ: |
f47957c7 | 1282 | case INTRINSIC_EQ_OS: |
4ee9c684 | 1283 | case INTRINSIC_EQV: |
1284 | code = EQ_EXPR; | |
1285 | checkstring = 1; | |
1286 | lop = 1; | |
1287 | break; | |
1288 | ||
1289 | case INTRINSIC_NE: | |
f47957c7 | 1290 | case INTRINSIC_NE_OS: |
4ee9c684 | 1291 | case INTRINSIC_NEQV: |
1292 | code = NE_EXPR; | |
1293 | checkstring = 1; | |
1294 | lop = 1; | |
1295 | break; | |
1296 | ||
1297 | case INTRINSIC_GT: | |
f47957c7 | 1298 | case INTRINSIC_GT_OS: |
4ee9c684 | 1299 | code = GT_EXPR; |
1300 | checkstring = 1; | |
1301 | lop = 1; | |
1302 | break; | |
1303 | ||
1304 | case INTRINSIC_GE: | |
f47957c7 | 1305 | case INTRINSIC_GE_OS: |
4ee9c684 | 1306 | code = GE_EXPR; |
1307 | checkstring = 1; | |
1308 | lop = 1; | |
1309 | break; | |
1310 | ||
1311 | case INTRINSIC_LT: | |
f47957c7 | 1312 | case INTRINSIC_LT_OS: |
4ee9c684 | 1313 | code = LT_EXPR; |
1314 | checkstring = 1; | |
1315 | lop = 1; | |
1316 | break; | |
1317 | ||
1318 | case INTRINSIC_LE: | |
f47957c7 | 1319 | case INTRINSIC_LE_OS: |
4ee9c684 | 1320 | code = LE_EXPR; |
1321 | checkstring = 1; | |
1322 | lop = 1; | |
1323 | break; | |
1324 | ||
1325 | case INTRINSIC_USER: | |
1326 | case INTRINSIC_ASSIGN: | |
1327 | /* These should be converted into function calls by the frontend. */ | |
22d678e8 | 1328 | gcc_unreachable (); |
4ee9c684 | 1329 | |
1330 | default: | |
1331 | fatal_error ("Unknown intrinsic op"); | |
1332 | return; | |
1333 | } | |
1334 | ||
f888a3fb | 1335 | /* The only exception to this is **, which is handled separately anyway. */ |
9b773341 | 1336 | gcc_assert (expr->value.op.op1->ts.type == expr->value.op.op2->ts.type); |
4ee9c684 | 1337 | |
9b773341 | 1338 | if (checkstring && expr->value.op.op1->ts.type != BT_CHARACTER) |
4ee9c684 | 1339 | checkstring = 0; |
1340 | ||
1341 | /* lhs */ | |
1342 | gfc_init_se (&lse, se); | |
9b773341 | 1343 | gfc_conv_expr (&lse, expr->value.op.op1); |
4ee9c684 | 1344 | gfc_add_block_to_block (&se->pre, &lse.pre); |
1345 | ||
1346 | /* rhs */ | |
1347 | gfc_init_se (&rse, se); | |
9b773341 | 1348 | gfc_conv_expr (&rse, expr->value.op.op2); |
4ee9c684 | 1349 | gfc_add_block_to_block (&se->pre, &rse.pre); |
1350 | ||
4ee9c684 | 1351 | if (checkstring) |
1352 | { | |
1353 | gfc_conv_string_parameter (&lse); | |
1354 | gfc_conv_string_parameter (&rse); | |
4ee9c684 | 1355 | |
77100724 | 1356 | lse.expr = gfc_build_compare_string (lse.string_length, lse.expr, |
40b806de | 1357 | rse.string_length, rse.expr, |
1358 | expr->value.op.op1->ts.kind); | |
57e3c827 | 1359 | rse.expr = build_int_cst (TREE_TYPE (lse.expr), 0); |
77100724 | 1360 | gfc_add_block_to_block (&lse.post, &rse.post); |
4ee9c684 | 1361 | } |
1362 | ||
1363 | type = gfc_typenode_for_spec (&expr->ts); | |
1364 | ||
1365 | if (lop) | |
1366 | { | |
1367 | /* The result of logical ops is always boolean_type_node. */ | |
f20cadb1 | 1368 | tmp = fold_build2 (code, boolean_type_node, lse.expr, rse.expr); |
4ee9c684 | 1369 | se->expr = convert (type, tmp); |
1370 | } | |
1371 | else | |
318c9b27 | 1372 | se->expr = fold_build2 (code, type, lse.expr, rse.expr); |
4ee9c684 | 1373 | |
4ee9c684 | 1374 | /* Add the post blocks. */ |
1375 | gfc_add_block_to_block (&se->post, &rse.post); | |
1376 | gfc_add_block_to_block (&se->post, &lse.post); | |
1377 | } | |
1378 | ||
77100724 | 1379 | /* If a string's length is one, we convert it to a single character. */ |
1380 | ||
1381 | static tree | |
b44437b9 | 1382 | string_to_single_character (tree len, tree str, int kind) |
77100724 | 1383 | { |
1384 | gcc_assert (POINTER_TYPE_P (TREE_TYPE (str))); | |
1385 | ||
1386 | if (INTEGER_CST_P (len) && TREE_INT_CST_LOW (len) == 1 | |
b44437b9 | 1387 | && TREE_INT_CST_HIGH (len) == 0) |
77100724 | 1388 | { |
b44437b9 | 1389 | str = fold_convert (gfc_get_pchar_type (kind), str); |
389dd41b | 1390 | return build_fold_indirect_ref_loc (input_location, |
1391 | str); | |
77100724 | 1392 | } |
1393 | ||
1394 | return NULL_TREE; | |
1395 | } | |
1396 | ||
4c47c8b7 | 1397 | |
1398 | void | |
1399 | gfc_conv_scalar_char_value (gfc_symbol *sym, gfc_se *se, gfc_expr **expr) | |
1400 | { | |
1401 | ||
1402 | if (sym->backend_decl) | |
1403 | { | |
1404 | /* This becomes the nominal_type in | |
1405 | function.c:assign_parm_find_data_types. */ | |
1406 | TREE_TYPE (sym->backend_decl) = unsigned_char_type_node; | |
1407 | /* This becomes the passed_type in | |
1408 | function.c:assign_parm_find_data_types. C promotes char to | |
1409 | integer for argument passing. */ | |
1410 | DECL_ARG_TYPE (sym->backend_decl) = unsigned_type_node; | |
1411 | ||
1412 | DECL_BY_REFERENCE (sym->backend_decl) = 0; | |
1413 | } | |
1414 | ||
1415 | if (expr != NULL) | |
1416 | { | |
1417 | /* If we have a constant character expression, make it into an | |
1418 | integer. */ | |
1419 | if ((*expr)->expr_type == EXPR_CONSTANT) | |
1420 | { | |
1421 | gfc_typespec ts; | |
52179f31 | 1422 | gfc_clear_ts (&ts); |
4c47c8b7 | 1423 | |
1424 | *expr = gfc_int_expr ((int)(*expr)->value.character.string[0]); | |
1425 | if ((*expr)->ts.kind != gfc_c_int_kind) | |
1426 | { | |
1427 | /* The expr needs to be compatible with a C int. If the | |
1428 | conversion fails, then the 2 causes an ICE. */ | |
1429 | ts.type = BT_INTEGER; | |
1430 | ts.kind = gfc_c_int_kind; | |
1431 | gfc_convert_type (*expr, &ts, 2); | |
1432 | } | |
1433 | } | |
1434 | else if (se != NULL && (*expr)->expr_type == EXPR_VARIABLE) | |
1435 | { | |
1436 | if ((*expr)->ref == NULL) | |
1437 | { | |
b44437b9 | 1438 | se->expr = string_to_single_character |
4c47c8b7 | 1439 | (build_int_cst (integer_type_node, 1), |
b44437b9 | 1440 | gfc_build_addr_expr (gfc_get_pchar_type ((*expr)->ts.kind), |
4c47c8b7 | 1441 | gfc_get_symbol_decl |
b44437b9 | 1442 | ((*expr)->symtree->n.sym)), |
1443 | (*expr)->ts.kind); | |
4c47c8b7 | 1444 | } |
1445 | else | |
1446 | { | |
1447 | gfc_conv_variable (se, *expr); | |
b44437b9 | 1448 | se->expr = string_to_single_character |
4c47c8b7 | 1449 | (build_int_cst (integer_type_node, 1), |
b44437b9 | 1450 | gfc_build_addr_expr (gfc_get_pchar_type ((*expr)->ts.kind), |
1451 | se->expr), | |
1452 | (*expr)->ts.kind); | |
4c47c8b7 | 1453 | } |
1454 | } | |
1455 | } | |
1456 | } | |
1457 | ||
1458 | ||
77100724 | 1459 | /* Compare two strings. If they are all single characters, the result is the |
1460 | subtraction of them. Otherwise, we build a library call. */ | |
1461 | ||
1462 | tree | |
40b806de | 1463 | gfc_build_compare_string (tree len1, tree str1, tree len2, tree str2, int kind) |
77100724 | 1464 | { |
1465 | tree sc1; | |
1466 | tree sc2; | |
77100724 | 1467 | tree tmp; |
1468 | ||
1469 | gcc_assert (POINTER_TYPE_P (TREE_TYPE (str1))); | |
1470 | gcc_assert (POINTER_TYPE_P (TREE_TYPE (str2))); | |
1471 | ||
b44437b9 | 1472 | sc1 = string_to_single_character (len1, str1, kind); |
1473 | sc2 = string_to_single_character (len2, str2, kind); | |
77100724 | 1474 | |
77100724 | 1475 | if (sc1 != NULL_TREE && sc2 != NULL_TREE) |
1476 | { | |
40b806de | 1477 | /* Deal with single character specially. */ |
f20cadb1 | 1478 | sc1 = fold_convert (integer_type_node, sc1); |
1479 | sc2 = fold_convert (integer_type_node, sc2); | |
1480 | tmp = fold_build2 (MINUS_EXPR, integer_type_node, sc1, sc2); | |
77100724 | 1481 | } |
40b806de | 1482 | else |
1483 | { | |
1484 | /* Build a call for the comparison. */ | |
1485 | tree fndecl; | |
1486 | ||
1487 | if (kind == 1) | |
1488 | fndecl = gfor_fndecl_compare_string; | |
1489 | else if (kind == 4) | |
1490 | fndecl = gfor_fndecl_compare_string_char4; | |
1491 | else | |
1492 | gcc_unreachable (); | |
1493 | ||
389dd41b | 1494 | tmp = build_call_expr_loc (input_location, |
1495 | fndecl, 4, len1, str1, len2, str2); | |
40b806de | 1496 | } |
1497 | ||
77100724 | 1498 | return tmp; |
1499 | } | |
f888a3fb | 1500 | |
4ee9c684 | 1501 | static void |
64e93293 | 1502 | conv_function_val (gfc_se * se, gfc_symbol * sym, gfc_expr * expr) |
4ee9c684 | 1503 | { |
1504 | tree tmp; | |
1505 | ||
ff70e443 | 1506 | if (gfc_is_proc_ptr_comp (expr, NULL)) |
64e93293 | 1507 | tmp = gfc_get_proc_ptr_comp (se, expr); |
1508 | else if (sym->attr.dummy) | |
4ee9c684 | 1509 | { |
1510 | tmp = gfc_get_symbol_decl (sym); | |
cad0ddcf | 1511 | if (sym->attr.proc_pointer) |
389dd41b | 1512 | tmp = build_fold_indirect_ref_loc (input_location, |
1513 | tmp); | |
22d678e8 | 1514 | gcc_assert (TREE_CODE (TREE_TYPE (tmp)) == POINTER_TYPE |
4ee9c684 | 1515 | && TREE_CODE (TREE_TYPE (TREE_TYPE (tmp))) == FUNCTION_TYPE); |
4ee9c684 | 1516 | } |
1517 | else | |
1518 | { | |
1519 | if (!sym->backend_decl) | |
1520 | sym->backend_decl = gfc_get_extern_function_decl (sym); | |
1521 | ||
1522 | tmp = sym->backend_decl; | |
623416e8 | 1523 | |
a7c1e504 | 1524 | if (sym->attr.cray_pointee) |
623416e8 | 1525 | { |
1526 | /* TODO - make the cray pointee a pointer to a procedure, | |
1527 | assign the pointer to it and use it for the call. This | |
1528 | will do for now! */ | |
1529 | tmp = convert (build_pointer_type (TREE_TYPE (tmp)), | |
1530 | gfc_get_symbol_decl (sym->cp_pointer)); | |
1531 | tmp = gfc_evaluate_now (tmp, &se->pre); | |
1532 | } | |
1533 | ||
08569428 | 1534 | if (!POINTER_TYPE_P (TREE_TYPE (tmp))) |
1535 | { | |
1536 | gcc_assert (TREE_CODE (tmp) == FUNCTION_DECL); | |
86f2ad37 | 1537 | tmp = gfc_build_addr_expr (NULL_TREE, tmp); |
08569428 | 1538 | } |
1539 | } | |
1540 | se->expr = tmp; | |
1541 | } | |
1542 | ||
1543 | ||
08569428 | 1544 | /* Initialize MAPPING. */ |
1545 | ||
f45a476e | 1546 | void |
08569428 | 1547 | gfc_init_interface_mapping (gfc_interface_mapping * mapping) |
1548 | { | |
1549 | mapping->syms = NULL; | |
1550 | mapping->charlens = NULL; | |
1551 | } | |
1552 | ||
1553 | ||
1554 | /* Free all memory held by MAPPING (but not MAPPING itself). */ | |
1555 | ||
f45a476e | 1556 | void |
08569428 | 1557 | gfc_free_interface_mapping (gfc_interface_mapping * mapping) |
1558 | { | |
1559 | gfc_interface_sym_mapping *sym; | |
1560 | gfc_interface_sym_mapping *nextsym; | |
1561 | gfc_charlen *cl; | |
1562 | gfc_charlen *nextcl; | |
1563 | ||
1564 | for (sym = mapping->syms; sym; sym = nextsym) | |
1565 | { | |
1566 | nextsym = sym->next; | |
c71c6bca | 1567 | sym->new_sym->n.sym->formal = NULL; |
c1977dbe | 1568 | gfc_free_symbol (sym->new_sym->n.sym); |
fd149f95 | 1569 | gfc_free_expr (sym->expr); |
c1977dbe | 1570 | gfc_free (sym->new_sym); |
08569428 | 1571 | gfc_free (sym); |
1572 | } | |
1573 | for (cl = mapping->charlens; cl; cl = nextcl) | |
1574 | { | |
1575 | nextcl = cl->next; | |
1576 | gfc_free_expr (cl->length); | |
1577 | gfc_free (cl); | |
4ee9c684 | 1578 | } |
1579 | } | |
1580 | ||
1581 | ||
08569428 | 1582 | /* Return a copy of gfc_charlen CL. Add the returned structure to |
1583 | MAPPING so that it will be freed by gfc_free_interface_mapping. */ | |
1584 | ||
1585 | static gfc_charlen * | |
1586 | gfc_get_interface_mapping_charlen (gfc_interface_mapping * mapping, | |
1587 | gfc_charlen * cl) | |
1588 | { | |
c1977dbe | 1589 | gfc_charlen *new_charlen; |
08569428 | 1590 | |
c1977dbe | 1591 | new_charlen = gfc_get_charlen (); |
1592 | new_charlen->next = mapping->charlens; | |
1593 | new_charlen->length = gfc_copy_expr (cl->length); | |
08569428 | 1594 | |
c1977dbe | 1595 | mapping->charlens = new_charlen; |
1596 | return new_charlen; | |
08569428 | 1597 | } |
1598 | ||
1599 | ||
1600 | /* A subroutine of gfc_add_interface_mapping. Return a descriptorless | |
1601 | array variable that can be used as the actual argument for dummy | |
1602 | argument SYM. Add any initialization code to BLOCK. PACKED is as | |
1603 | for gfc_get_nodesc_array_type and DATA points to the first element | |
1604 | in the passed array. */ | |
1605 | ||
1606 | static tree | |
1607 | gfc_get_interface_mapping_array (stmtblock_t * block, gfc_symbol * sym, | |
3d8dea5a | 1608 | gfc_packed packed, tree data) |
08569428 | 1609 | { |
1610 | tree type; | |
1611 | tree var; | |
1612 | ||
1613 | type = gfc_typenode_for_spec (&sym->ts); | |
1614 | type = gfc_get_nodesc_array_type (type, sym->as, packed); | |
1615 | ||
5e8cd291 | 1616 | var = gfc_create_var (type, "ifm"); |
75a70cf9 | 1617 | gfc_add_modify (block, var, fold_convert (type, data)); |
08569428 | 1618 | |
1619 | return var; | |
1620 | } | |
1621 | ||
1622 | ||
1623 | /* A subroutine of gfc_add_interface_mapping. Set the stride, upper bounds | |
1624 | and offset of descriptorless array type TYPE given that it has the same | |
1625 | size as DESC. Add any set-up code to BLOCK. */ | |
1626 | ||
1627 | static void | |
1628 | gfc_set_interface_mapping_bounds (stmtblock_t * block, tree type, tree desc) | |
1629 | { | |
1630 | int n; | |
1631 | tree dim; | |
1632 | tree offset; | |
1633 | tree tmp; | |
1634 | ||
1635 | offset = gfc_index_zero_node; | |
1636 | for (n = 0; n < GFC_TYPE_ARRAY_RANK (type); n++) | |
1637 | { | |
926b9532 | 1638 | dim = gfc_rank_cst[n]; |
08569428 | 1639 | GFC_TYPE_ARRAY_STRIDE (type, n) = gfc_conv_array_stride (desc, n); |
926b9532 | 1640 | if (GFC_TYPE_ARRAY_LBOUND (type, n) == NULL_TREE) |
1641 | { | |
1642 | GFC_TYPE_ARRAY_LBOUND (type, n) | |
6b1a9af3 | 1643 | = gfc_conv_descriptor_lbound_get (desc, dim); |
926b9532 | 1644 | GFC_TYPE_ARRAY_UBOUND (type, n) |
6b1a9af3 | 1645 | = gfc_conv_descriptor_ubound_get (desc, dim); |
926b9532 | 1646 | } |
1647 | else if (GFC_TYPE_ARRAY_UBOUND (type, n) == NULL_TREE) | |
08569428 | 1648 | { |
08569428 | 1649 | tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, |
6b1a9af3 | 1650 | gfc_conv_descriptor_ubound_get (desc, dim), |
1651 | gfc_conv_descriptor_lbound_get (desc, dim)); | |
08569428 | 1652 | tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type, |
1653 | GFC_TYPE_ARRAY_LBOUND (type, n), | |
1654 | tmp); | |
1655 | tmp = gfc_evaluate_now (tmp, block); | |
1656 | GFC_TYPE_ARRAY_UBOUND (type, n) = tmp; | |
1657 | } | |
1658 | tmp = fold_build2 (MULT_EXPR, gfc_array_index_type, | |
1659 | GFC_TYPE_ARRAY_LBOUND (type, n), | |
1660 | GFC_TYPE_ARRAY_STRIDE (type, n)); | |
1661 | offset = fold_build2 (MINUS_EXPR, gfc_array_index_type, offset, tmp); | |
1662 | } | |
1663 | offset = gfc_evaluate_now (offset, block); | |
1664 | GFC_TYPE_ARRAY_OFFSET (type) = offset; | |
1665 | } | |
1666 | ||
1667 | ||
1668 | /* Extend MAPPING so that it maps dummy argument SYM to the value stored | |
1669 | in SE. The caller may still use se->expr and se->string_length after | |
1670 | calling this function. */ | |
1671 | ||
f45a476e | 1672 | void |
08569428 | 1673 | gfc_add_interface_mapping (gfc_interface_mapping * mapping, |
fd149f95 | 1674 | gfc_symbol * sym, gfc_se * se, |
1675 | gfc_expr *expr) | |
08569428 | 1676 | { |
1677 | gfc_interface_sym_mapping *sm; | |
1678 | tree desc; | |
1679 | tree tmp; | |
1680 | tree value; | |
1681 | gfc_symbol *new_sym; | |
1682 | gfc_symtree *root; | |
1683 | gfc_symtree *new_symtree; | |
1684 | ||
1685 | /* Create a new symbol to represent the actual argument. */ | |
1686 | new_sym = gfc_new_symbol (sym->name, NULL); | |
1687 | new_sym->ts = sym->ts; | |
079aab8b | 1688 | new_sym->as = gfc_copy_array_spec (sym->as); |
08569428 | 1689 | new_sym->attr.referenced = 1; |
1690 | new_sym->attr.dimension = sym->attr.dimension; | |
1691 | new_sym->attr.pointer = sym->attr.pointer; | |
76845580 | 1692 | new_sym->attr.allocatable = sym->attr.allocatable; |
08569428 | 1693 | new_sym->attr.flavor = sym->attr.flavor; |
fd149f95 | 1694 | new_sym->attr.function = sym->attr.function; |
08569428 | 1695 | |
dc1a7e64 | 1696 | /* Ensure that the interface is available and that |
1697 | descriptors are passed for array actual arguments. */ | |
1698 | if (sym->attr.flavor == FL_PROCEDURE) | |
1699 | { | |
c71c6bca | 1700 | new_sym->formal = expr->symtree->n.sym->formal; |
dc1a7e64 | 1701 | new_sym->attr.always_explicit |
1702 | = expr->symtree->n.sym->attr.always_explicit; | |
1703 | } | |
1704 | ||
08569428 | 1705 | /* Create a fake symtree for it. */ |
1706 | root = NULL; | |
1707 | new_symtree = gfc_new_symtree (&root, sym->name); | |
1708 | new_symtree->n.sym = new_sym; | |
1709 | gcc_assert (new_symtree == root); | |
1710 | ||
1711 | /* Create a dummy->actual mapping. */ | |
48d8ad5a | 1712 | sm = XCNEW (gfc_interface_sym_mapping); |
08569428 | 1713 | sm->next = mapping->syms; |
1714 | sm->old = sym; | |
c1977dbe | 1715 | sm->new_sym = new_symtree; |
fd149f95 | 1716 | sm->expr = gfc_copy_expr (expr); |
08569428 | 1717 | mapping->syms = sm; |
1718 | ||
1719 | /* Stabilize the argument's value. */ | |
fd149f95 | 1720 | if (!sym->attr.function && se) |
1721 | se->expr = gfc_evaluate_now (se->expr, &se->pre); | |
08569428 | 1722 | |
1723 | if (sym->ts.type == BT_CHARACTER) | |
1724 | { | |
1725 | /* Create a copy of the dummy argument's length. */ | |
eeebe20b | 1726 | new_sym->ts.u.cl = gfc_get_interface_mapping_charlen (mapping, sym->ts.u.cl); |
1727 | sm->expr->ts.u.cl = new_sym->ts.u.cl; | |
08569428 | 1728 | |
1729 | /* If the length is specified as "*", record the length that | |
1730 | the caller is passing. We should use the callee's length | |
1731 | in all other cases. */ | |
eeebe20b | 1732 | if (!new_sym->ts.u.cl->length && se) |
08569428 | 1733 | { |
1734 | se->string_length = gfc_evaluate_now (se->string_length, &se->pre); | |
eeebe20b | 1735 | new_sym->ts.u.cl->backend_decl = se->string_length; |
08569428 | 1736 | } |
1737 | } | |
1738 | ||
fd149f95 | 1739 | if (!se) |
1740 | return; | |
1741 | ||
08569428 | 1742 | /* Use the passed value as-is if the argument is a function. */ |
1743 | if (sym->attr.flavor == FL_PROCEDURE) | |
1744 | value = se->expr; | |
1745 | ||
1746 | /* If the argument is either a string or a pointer to a string, | |
1747 | convert it to a boundless character type. */ | |
1748 | else if (!sym->attr.dimension && sym->ts.type == BT_CHARACTER) | |
1749 | { | |
1750 | tmp = gfc_get_character_type_len (sym->ts.kind, NULL); | |
1751 | tmp = build_pointer_type (tmp); | |
1752 | if (sym->attr.pointer) | |
389dd41b | 1753 | value = build_fold_indirect_ref_loc (input_location, |
1754 | se->expr); | |
e042ae37 | 1755 | else |
1756 | value = se->expr; | |
1757 | value = fold_convert (tmp, value); | |
08569428 | 1758 | } |
1759 | ||
76845580 | 1760 | /* If the argument is a scalar, a pointer to an array or an allocatable, |
1761 | dereference it. */ | |
1762 | else if (!sym->attr.dimension || sym->attr.pointer || sym->attr.allocatable) | |
389dd41b | 1763 | value = build_fold_indirect_ref_loc (input_location, |
1764 | se->expr); | |
e3071e62 | 1765 | |
1766 | /* For character(*), use the actual argument's descriptor. */ | |
eeebe20b | 1767 | else if (sym->ts.type == BT_CHARACTER && !new_sym->ts.u.cl->length) |
389dd41b | 1768 | value = build_fold_indirect_ref_loc (input_location, |
1769 | se->expr); | |
08569428 | 1770 | |
1771 | /* If the argument is an array descriptor, use it to determine | |
1772 | information about the actual argument's shape. */ | |
1773 | else if (POINTER_TYPE_P (TREE_TYPE (se->expr)) | |
1774 | && GFC_DESCRIPTOR_TYPE_P (TREE_TYPE (TREE_TYPE (se->expr)))) | |
1775 | { | |
1776 | /* Get the actual argument's descriptor. */ | |
389dd41b | 1777 | desc = build_fold_indirect_ref_loc (input_location, |
1778 | se->expr); | |
08569428 | 1779 | |
1780 | /* Create the replacement variable. */ | |
1781 | tmp = gfc_conv_descriptor_data_get (desc); | |
3d8dea5a | 1782 | value = gfc_get_interface_mapping_array (&se->pre, sym, |
1783 | PACKED_NO, tmp); | |
08569428 | 1784 | |
1785 | /* Use DESC to work out the upper bounds, strides and offset. */ | |
1786 | gfc_set_interface_mapping_bounds (&se->pre, TREE_TYPE (value), desc); | |
1787 | } | |
1788 | else | |
1789 | /* Otherwise we have a packed array. */ | |
3d8dea5a | 1790 | value = gfc_get_interface_mapping_array (&se->pre, sym, |
1791 | PACKED_FULL, se->expr); | |
08569428 | 1792 | |
1793 | new_sym->backend_decl = value; | |
1794 | } | |
1795 | ||
1796 | ||
1797 | /* Called once all dummy argument mappings have been added to MAPPING, | |
1798 | but before the mapping is used to evaluate expressions. Pre-evaluate | |
1799 | the length of each argument, adding any initialization code to PRE and | |
1800 | any finalization code to POST. */ | |
1801 | ||
f45a476e | 1802 | void |
08569428 | 1803 | gfc_finish_interface_mapping (gfc_interface_mapping * mapping, |
1804 | stmtblock_t * pre, stmtblock_t * post) | |
1805 | { | |
1806 | gfc_interface_sym_mapping *sym; | |
1807 | gfc_expr *expr; | |
1808 | gfc_se se; | |
1809 | ||
1810 | for (sym = mapping->syms; sym; sym = sym->next) | |
c1977dbe | 1811 | if (sym->new_sym->n.sym->ts.type == BT_CHARACTER |
eeebe20b | 1812 | && !sym->new_sym->n.sym->ts.u.cl->backend_decl) |
08569428 | 1813 | { |
eeebe20b | 1814 | expr = sym->new_sym->n.sym->ts.u.cl->length; |
08569428 | 1815 | gfc_apply_interface_mapping_to_expr (mapping, expr); |
1816 | gfc_init_se (&se, NULL); | |
1817 | gfc_conv_expr (&se, expr); | |
12f4af3f | 1818 | se.expr = fold_convert (gfc_charlen_type_node, se.expr); |
08569428 | 1819 | se.expr = gfc_evaluate_now (se.expr, &se.pre); |
1820 | gfc_add_block_to_block (pre, &se.pre); | |
1821 | gfc_add_block_to_block (post, &se.post); | |
1822 | ||
eeebe20b | 1823 | sym->new_sym->n.sym->ts.u.cl->backend_decl = se.expr; |
08569428 | 1824 | } |
1825 | } | |
1826 | ||
1827 | ||
1828 | /* Like gfc_apply_interface_mapping_to_expr, but applied to | |
1829 | constructor C. */ | |
1830 | ||
1831 | static void | |
1832 | gfc_apply_interface_mapping_to_cons (gfc_interface_mapping * mapping, | |
1833 | gfc_constructor * c) | |
1834 | { | |
1835 | for (; c; c = c->next) | |
1836 | { | |
1837 | gfc_apply_interface_mapping_to_expr (mapping, c->expr); | |
1838 | if (c->iterator) | |
1839 | { | |
1840 | gfc_apply_interface_mapping_to_expr (mapping, c->iterator->start); | |
1841 | gfc_apply_interface_mapping_to_expr (mapping, c->iterator->end); | |
1842 | gfc_apply_interface_mapping_to_expr (mapping, c->iterator->step); | |
1843 | } | |
1844 | } | |
1845 | } | |
1846 | ||
1847 | ||
1848 | /* Like gfc_apply_interface_mapping_to_expr, but applied to | |
1849 | reference REF. */ | |
1850 | ||
1851 | static void | |
1852 | gfc_apply_interface_mapping_to_ref (gfc_interface_mapping * mapping, | |
1853 | gfc_ref * ref) | |
1854 | { | |
1855 | int n; | |
1856 | ||
1857 | for (; ref; ref = ref->next) | |
1858 | switch (ref->type) | |
1859 | { | |
1860 | case REF_ARRAY: | |
1861 | for (n = 0; n < ref->u.ar.dimen; n++) | |
1862 | { | |
1863 | gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.start[n]); | |
1864 | gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.end[n]); | |
1865 | gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.stride[n]); | |
1866 | } | |
1867 | gfc_apply_interface_mapping_to_expr (mapping, ref->u.ar.offset); | |
1868 | break; | |
1869 | ||
1870 | case REF_COMPONENT: | |
1871 | break; | |
1872 | ||
1873 | case REF_SUBSTRING: | |
1874 | gfc_apply_interface_mapping_to_expr (mapping, ref->u.ss.start); | |
1875 | gfc_apply_interface_mapping_to_expr (mapping, ref->u.ss.end); | |
1876 | break; | |
1877 | } | |
1878 | } | |
1879 | ||
1880 | ||
fd149f95 | 1881 | /* Convert intrinsic function calls into result expressions. */ |
079aab8b | 1882 | |
fd149f95 | 1883 | static bool |
079aab8b | 1884 | gfc_map_intrinsic_function (gfc_expr *expr, gfc_interface_mapping *mapping) |
fd149f95 | 1885 | { |
1886 | gfc_symbol *sym; | |
1887 | gfc_expr *new_expr; | |
1888 | gfc_expr *arg1; | |
1889 | gfc_expr *arg2; | |
1890 | int d, dup; | |
1891 | ||
1892 | arg1 = expr->value.function.actual->expr; | |
1893 | if (expr->value.function.actual->next) | |
1894 | arg2 = expr->value.function.actual->next->expr; | |
1895 | else | |
1896 | arg2 = NULL; | |
1897 | ||
079aab8b | 1898 | sym = arg1->symtree->n.sym; |
fd149f95 | 1899 | |
1900 | if (sym->attr.dummy) | |
1901 | return false; | |
1902 | ||
1903 | new_expr = NULL; | |
1904 | ||
1905 | switch (expr->value.function.isym->id) | |
1906 | { | |
1907 | case GFC_ISYM_LEN: | |
1908 | /* TODO figure out why this condition is necessary. */ | |
1909 | if (sym->attr.function | |
eeebe20b | 1910 | && (arg1->ts.u.cl->length == NULL |
1911 | || (arg1->ts.u.cl->length->expr_type != EXPR_CONSTANT | |
1912 | && arg1->ts.u.cl->length->expr_type != EXPR_VARIABLE))) | |
fd149f95 | 1913 | return false; |
1914 | ||
eeebe20b | 1915 | new_expr = gfc_copy_expr (arg1->ts.u.cl->length); |
fd149f95 | 1916 | break; |
1917 | ||
1918 | case GFC_ISYM_SIZE: | |
1919 | if (!sym->as) | |
1920 | return false; | |
1921 | ||
1922 | if (arg2 && arg2->expr_type == EXPR_CONSTANT) | |
1923 | { | |
1924 | dup = mpz_get_si (arg2->value.integer); | |
1925 | d = dup - 1; | |
1926 | } | |
1927 | else | |
1928 | { | |
1929 | dup = sym->as->rank; | |
1930 | d = 0; | |
1931 | } | |
1932 | ||
1933 | for (; d < dup; d++) | |
1934 | { | |
1935 | gfc_expr *tmp; | |
079aab8b | 1936 | |
1937 | if (!sym->as->upper[d] || !sym->as->lower[d]) | |
1938 | { | |
1939 | gfc_free_expr (new_expr); | |
1940 | return false; | |
1941 | } | |
1942 | ||
fd149f95 | 1943 | tmp = gfc_add (gfc_copy_expr (sym->as->upper[d]), gfc_int_expr (1)); |
1944 | tmp = gfc_subtract (tmp, gfc_copy_expr (sym->as->lower[d])); | |
1945 | if (new_expr) | |
1946 | new_expr = gfc_multiply (new_expr, tmp); | |
1947 | else | |
1948 | new_expr = tmp; | |
1949 | } | |
1950 | break; | |
1951 | ||
1952 | case GFC_ISYM_LBOUND: | |
1953 | case GFC_ISYM_UBOUND: | |
1954 | /* TODO These implementations of lbound and ubound do not limit if | |
1955 | the size < 0, according to F95's 13.14.53 and 13.14.113. */ | |
1956 | ||
1957 | if (!sym->as) | |
1958 | return false; | |
1959 | ||
1960 | if (arg2 && arg2->expr_type == EXPR_CONSTANT) | |
1961 | d = mpz_get_si (arg2->value.integer) - 1; | |
1962 | else | |
1963 | /* TODO: If the need arises, this could produce an array of | |
1964 | ubound/lbounds. */ | |
1965 | gcc_unreachable (); | |
1966 | ||
1967 | if (expr->value.function.isym->id == GFC_ISYM_LBOUND) | |
079aab8b | 1968 | { |
1969 | if (sym->as->lower[d]) | |
1970 | new_expr = gfc_copy_expr (sym->as->lower[d]); | |
1971 | } | |
fd149f95 | 1972 | else |
079aab8b | 1973 | { |
1974 | if (sym->as->upper[d]) | |
1975 | new_expr = gfc_copy_expr (sym->as->upper[d]); | |
1976 | } | |
fd149f95 | 1977 | break; |
1978 | ||
1979 | default: | |
1980 | break; | |
1981 | } | |
1982 | ||
1983 | gfc_apply_interface_mapping_to_expr (mapping, new_expr); | |
1984 | if (!new_expr) | |
1985 | return false; | |
1986 | ||
1987 | gfc_replace_expr (expr, new_expr); | |
1988 | return true; | |
1989 | } | |
1990 | ||
1991 | ||
1992 | static void | |
1993 | gfc_map_fcn_formal_to_actual (gfc_expr *expr, gfc_expr *map_expr, | |
1994 | gfc_interface_mapping * mapping) | |
1995 | { | |
1996 | gfc_formal_arglist *f; | |
1997 | gfc_actual_arglist *actual; | |
1998 | ||
1999 | actual = expr->value.function.actual; | |
2000 | f = map_expr->symtree->n.sym->formal; | |
2001 | ||
2002 | for (; f && actual; f = f->next, actual = actual->next) | |
2003 | { | |
2004 | if (!actual->expr) | |
2005 | continue; | |
2006 | ||
2007 | gfc_add_interface_mapping (mapping, f->sym, NULL, actual->expr); | |
2008 | } | |
2009 | ||
2010 | if (map_expr->symtree->n.sym->attr.dimension) | |
2011 | { | |
2012 | int d; | |
2013 | gfc_array_spec *as; | |
2014 | ||
2015 | as = gfc_copy_array_spec (map_expr->symtree->n.sym->as); | |
2016 | ||
2017 | for (d = 0; d < as->rank; d++) | |
2018 | { | |
2019 | gfc_apply_interface_mapping_to_expr (mapping, as->lower[d]); | |
2020 | gfc_apply_interface_mapping_to_expr (mapping, as->upper[d]); | |
2021 | } | |
2022 | ||
2023 | expr->value.function.esym->as = as; | |
2024 | } | |
2025 | ||
2026 | if (map_expr->symtree->n.sym->ts.type == BT_CHARACTER) | |
2027 | { | |
eeebe20b | 2028 | expr->value.function.esym->ts.u.cl->length |
2029 | = gfc_copy_expr (map_expr->symtree->n.sym->ts.u.cl->length); | |
fd149f95 | 2030 | |
2031 | gfc_apply_interface_mapping_to_expr (mapping, | |
eeebe20b | 2032 | expr->value.function.esym->ts.u.cl->length); |
fd149f95 | 2033 | } |
2034 | } | |
2035 | ||
2036 | ||
08569428 | 2037 | /* EXPR is a copy of an expression that appeared in the interface |
2038 | associated with MAPPING. Walk it recursively looking for references to | |
2039 | dummy arguments that MAPPING maps to actual arguments. Replace each such | |
2040 | reference with a reference to the associated actual argument. */ | |
2041 | ||
fd149f95 | 2042 | static void |
08569428 | 2043 | gfc_apply_interface_mapping_to_expr (gfc_interface_mapping * mapping, |
2044 | gfc_expr * expr) | |
2045 | { | |
2046 | gfc_interface_sym_mapping *sym; | |
2047 | gfc_actual_arglist *actual; | |
2048 | ||
2049 | if (!expr) | |
fd149f95 | 2050 | return; |
08569428 | 2051 | |
2052 | /* Copying an expression does not copy its length, so do that here. */ | |
eeebe20b | 2053 | if (expr->ts.type == BT_CHARACTER && expr->ts.u.cl) |
08569428 | 2054 | { |
eeebe20b | 2055 | expr->ts.u.cl = gfc_get_interface_mapping_charlen (mapping, expr->ts.u.cl); |
2056 | gfc_apply_interface_mapping_to_expr (mapping, expr->ts.u.cl->length); | |
08569428 | 2057 | } |
2058 | ||
2059 | /* Apply the mapping to any references. */ | |
2060 | gfc_apply_interface_mapping_to_ref (mapping, expr->ref); | |
2061 | ||
2062 | /* ...and to the expression's symbol, if it has one. */ | |
fd149f95 | 2063 | /* TODO Find out why the condition on expr->symtree had to be moved into |
69b1505f | 2064 | the loop rather than being outside it, as originally. */ |
fd149f95 | 2065 | for (sym = mapping->syms; sym; sym = sym->next) |
2066 | if (expr->symtree && sym->old == expr->symtree->n.sym) | |
2067 | { | |
c1977dbe | 2068 | if (sym->new_sym->n.sym->backend_decl) |
2069 | expr->symtree = sym->new_sym; | |
fd149f95 | 2070 | else if (sym->expr) |
2071 | gfc_replace_expr (expr, gfc_copy_expr (sym->expr)); | |
2072 | } | |
08569428 | 2073 | |
fd149f95 | 2074 | /* ...and to subexpressions in expr->value. */ |
08569428 | 2075 | switch (expr->expr_type) |
2076 | { | |
2077 | case EXPR_VARIABLE: | |
2078 | case EXPR_CONSTANT: | |
2079 | case EXPR_NULL: | |
2080 | case EXPR_SUBSTRING: | |
2081 | break; | |
2082 | ||
2083 | case EXPR_OP: | |
2084 | gfc_apply_interface_mapping_to_expr (mapping, expr->value.op.op1); | |
2085 | gfc_apply_interface_mapping_to_expr (mapping, expr->value.op.op2); | |
2086 | break; | |
2087 | ||
2088 | case EXPR_FUNCTION: | |
fd149f95 | 2089 | for (actual = expr->value.function.actual; actual; actual = actual->next) |
2090 | gfc_apply_interface_mapping_to_expr (mapping, actual->expr); | |
2091 | ||
7f8c8ede | 2092 | if (expr->value.function.esym == NULL |
7f7ca309 | 2093 | && expr->value.function.isym != NULL |
fd149f95 | 2094 | && expr->value.function.actual->expr->symtree |
2095 | && gfc_map_intrinsic_function (expr, mapping)) | |
2096 | break; | |
7f7ca309 | 2097 | |
08569428 | 2098 | for (sym = mapping->syms; sym; sym = sym->next) |
2099 | if (sym->old == expr->value.function.esym) | |
fd149f95 | 2100 | { |
c1977dbe | 2101 | expr->value.function.esym = sym->new_sym->n.sym; |
fd149f95 | 2102 | gfc_map_fcn_formal_to_actual (expr, sym->expr, mapping); |
c1977dbe | 2103 | expr->value.function.esym->result = sym->new_sym->n.sym; |
fd149f95 | 2104 | } |
08569428 | 2105 | break; |
2106 | ||
2107 | case EXPR_ARRAY: | |
2108 | case EXPR_STRUCTURE: | |
2109 | gfc_apply_interface_mapping_to_cons (mapping, expr->value.constructor); | |
2110 | break; | |
930fe1de | 2111 | |
2112 | case EXPR_COMPCALL: | |
64e93293 | 2113 | case EXPR_PPC: |
930fe1de | 2114 | gcc_unreachable (); |
2115 | break; | |
08569428 | 2116 | } |
fd149f95 | 2117 | |
2118 | return; | |
08569428 | 2119 | } |
2120 | ||
2121 | ||
2122 | /* Evaluate interface expression EXPR using MAPPING. Store the result | |
2123 | in SE. */ | |
2124 | ||
f45a476e | 2125 | void |
08569428 | 2126 | gfc_apply_interface_mapping (gfc_interface_mapping * mapping, |
2127 | gfc_se * se, gfc_expr * expr) | |
2128 | { | |
2129 | expr = gfc_copy_expr (expr); | |
2130 | gfc_apply_interface_mapping_to_expr (mapping, expr); | |
2131 | gfc_conv_expr (se, expr); | |
2132 | se->expr = gfc_evaluate_now (se->expr, &se->pre); | |
2133 | gfc_free_expr (expr); | |
2134 | } | |
2135 | ||
1033248c | 2136 | |
858f9894 | 2137 | /* Returns a reference to a temporary array into which a component of |
2138 | an actual argument derived type array is copied and then returned | |
1033248c | 2139 | after the function call. */ |
2ecf364f | 2140 | void |
1033248c | 2141 | gfc_conv_subref_array_arg (gfc_se * parmse, gfc_expr * expr, |
2142 | int g77, sym_intent intent) | |
858f9894 | 2143 | { |
2144 | gfc_se lse; | |
2145 | gfc_se rse; | |
2146 | gfc_ss *lss; | |
2147 | gfc_ss *rss; | |
2148 | gfc_loopinfo loop; | |
2149 | gfc_loopinfo loop2; | |
2150 | gfc_ss_info *info; | |
2151 | tree offset; | |
2152 | tree tmp_index; | |
2153 | tree tmp; | |
2154 | tree base_type; | |
2155 | stmtblock_t body; | |
2156 | int n; | |
2157 | ||
2158 | gcc_assert (expr->expr_type == EXPR_VARIABLE); | |
2159 | ||
2160 | gfc_init_se (&lse, NULL); | |
2161 | gfc_init_se (&rse, NULL); | |
2162 | ||
2163 | /* Walk the argument expression. */ | |
2164 | rss = gfc_walk_expr (expr); | |
2165 | ||
2166 | gcc_assert (rss != gfc_ss_terminator); | |
2167 | ||
2168 | /* Initialize the scalarizer. */ | |
2169 | gfc_init_loopinfo (&loop); | |
2170 | gfc_add_ss_to_loop (&loop, rss); | |
2171 | ||
2172 | /* Calculate the bounds of the scalarization. */ | |
2173 | gfc_conv_ss_startstride (&loop); | |
2174 | ||
2175 | /* Build an ss for the temporary. */ | |
eeebe20b | 2176 | if (expr->ts.type == BT_CHARACTER && !expr->ts.u.cl->backend_decl) |
2177 | gfc_conv_string_length (expr->ts.u.cl, expr, &parmse->pre); | |
0ff77f4e | 2178 | |
858f9894 | 2179 | base_type = gfc_typenode_for_spec (&expr->ts); |
2180 | if (GFC_ARRAY_TYPE_P (base_type) | |
2181 | || GFC_DESCRIPTOR_TYPE_P (base_type)) | |
2182 | base_type = gfc_get_element_type (base_type); | |
2183 | ||
2184 | loop.temp_ss = gfc_get_ss ();; | |
2185 | loop.temp_ss->type = GFC_SS_TEMP; | |
2186 | loop.temp_ss->data.temp.type = base_type; | |
2187 | ||
2188 | if (expr->ts.type == BT_CHARACTER) | |
eeebe20b | 2189 | loop.temp_ss->string_length = expr->ts.u.cl->backend_decl; |
0ff77f4e | 2190 | else |
2191 | loop.temp_ss->string_length = NULL; | |
858f9894 | 2192 | |
0ff77f4e | 2193 | parmse->string_length = loop.temp_ss->string_length; |
858f9894 | 2194 | loop.temp_ss->data.temp.dimen = loop.dimen; |
2195 | loop.temp_ss->next = gfc_ss_terminator; | |
2196 | ||
2197 | /* Associate the SS with the loop. */ | |
2198 | gfc_add_ss_to_loop (&loop, loop.temp_ss); | |
2199 | ||
2200 | /* Setup the scalarizing loops. */ | |
92f4d1c4 | 2201 | gfc_conv_loop_setup (&loop, &expr->where); |
858f9894 | 2202 | |
2203 | /* Pass the temporary descriptor back to the caller. */ | |
2204 | info = &loop.temp_ss->data.info; | |
2205 | parmse->expr = info->descriptor; | |
2206 | ||
2207 | /* Setup the gfc_se structures. */ | |
2208 | gfc_copy_loopinfo_to_se (&lse, &loop); | |
2209 | gfc_copy_loopinfo_to_se (&rse, &loop); | |
2210 | ||
2211 | rse.ss = rss; | |
2212 | lse.ss = loop.temp_ss; | |
2213 | gfc_mark_ss_chain_used (rss, 1); | |
2214 | gfc_mark_ss_chain_used (loop.temp_ss, 1); | |
2215 | ||
2216 | /* Start the scalarized loop body. */ | |
2217 | gfc_start_scalarized_body (&loop, &body); | |
2218 | ||
2219 | /* Translate the expression. */ | |
2220 | gfc_conv_expr (&rse, expr); | |
2221 | ||
2222 | gfc_conv_tmp_array_ref (&lse); | |
2223 | gfc_advance_se_ss_chain (&lse); | |
2224 | ||
35d9c496 | 2225 | if (intent != INTENT_OUT) |
2226 | { | |
2294b616 | 2227 | tmp = gfc_trans_scalar_assign (&lse, &rse, expr->ts, true, false); |
35d9c496 | 2228 | gfc_add_expr_to_block (&body, tmp); |
2229 | gcc_assert (rse.ss == gfc_ss_terminator); | |
2230 | gfc_trans_scalarizing_loops (&loop, &body); | |
2231 | } | |
e8325fb3 | 2232 | else |
2233 | { | |
54ad1b4d | 2234 | /* Make sure that the temporary declaration survives by merging |
2235 | all the loop declarations into the current context. */ | |
2236 | for (n = 0; n < loop.dimen; n++) | |
2237 | { | |
2238 | gfc_merge_block_scope (&body); | |
2239 | body = loop.code[loop.order[n]]; | |
2240 | } | |
2241 | gfc_merge_block_scope (&body); | |
e8325fb3 | 2242 | } |
858f9894 | 2243 | |
2244 | /* Add the post block after the second loop, so that any | |
2245 | freeing of allocated memory is done at the right time. */ | |
2246 | gfc_add_block_to_block (&parmse->pre, &loop.pre); | |
2247 | ||
2248 | /**********Copy the temporary back again.*********/ | |
2249 | ||
2250 | gfc_init_se (&lse, NULL); | |
2251 | gfc_init_se (&rse, NULL); | |
2252 | ||
2253 | /* Walk the argument expression. */ | |
2254 | lss = gfc_walk_expr (expr); | |
2255 | rse.ss = loop.temp_ss; | |
2256 | lse.ss = lss; | |
2257 | ||
2258 | /* Initialize the scalarizer. */ | |
2259 | gfc_init_loopinfo (&loop2); | |
2260 | gfc_add_ss_to_loop (&loop2, lss); | |
2261 | ||
2262 | /* Calculate the bounds of the scalarization. */ | |
2263 | gfc_conv_ss_startstride (&loop2); | |
2264 | ||
2265 | /* Setup the scalarizing loops. */ | |
92f4d1c4 | 2266 | gfc_conv_loop_setup (&loop2, &expr->where); |
858f9894 | 2267 | |
2268 | gfc_copy_loopinfo_to_se (&lse, &loop2); | |
2269 | gfc_copy_loopinfo_to_se (&rse, &loop2); | |
2270 | ||
2271 | gfc_mark_ss_chain_used (lss, 1); | |
2272 | gfc_mark_ss_chain_used (loop.temp_ss, 1); | |
2273 | ||
2274 | /* Declare the variable to hold the temporary offset and start the | |
2275 | scalarized loop body. */ | |
2276 | offset = gfc_create_var (gfc_array_index_type, NULL); | |
2277 | gfc_start_scalarized_body (&loop2, &body); | |
2278 | ||
2279 | /* Build the offsets for the temporary from the loop variables. The | |
2280 | temporary array has lbounds of zero and strides of one in all | |
2281 | dimensions, so this is very simple. The offset is only computed | |
2282 | outside the innermost loop, so the overall transfer could be | |
179eba08 | 2283 | optimized further. */ |
858f9894 | 2284 | info = &rse.ss->data.info; |
2285 | ||
2286 | tmp_index = gfc_index_zero_node; | |
2287 | for (n = info->dimen - 1; n > 0; n--) | |
2288 | { | |
2289 | tree tmp_str; | |
2290 | tmp = rse.loop->loopvar[n]; | |
2291 | tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, | |
2292 | tmp, rse.loop->from[n]); | |
2293 | tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type, | |
2294 | tmp, tmp_index); | |
2295 | ||
2296 | tmp_str = fold_build2 (MINUS_EXPR, gfc_array_index_type, | |
2297 | rse.loop->to[n-1], rse.loop->from[n-1]); | |
2298 | tmp_str = fold_build2 (PLUS_EXPR, gfc_array_index_type, | |
2299 | tmp_str, gfc_index_one_node); | |
2300 | ||
2301 | tmp_index = fold_build2 (MULT_EXPR, gfc_array_index_type, | |
2302 | tmp, tmp_str); | |
2303 | } | |
2304 | ||
2305 | tmp_index = fold_build2 (MINUS_EXPR, gfc_array_index_type, | |
2306 | tmp_index, rse.loop->from[0]); | |
75a70cf9 | 2307 | gfc_add_modify (&rse.loop->code[0], offset, tmp_index); |
858f9894 | 2308 | |
2309 | tmp_index = fold_build2 (PLUS_EXPR, gfc_array_index_type, | |
2310 | rse.loop->loopvar[0], offset); | |
2311 | ||
2312 | /* Now use the offset for the reference. */ | |
389dd41b | 2313 | tmp = build_fold_indirect_ref_loc (input_location, |
2314 | info->data); | |
1033248c | 2315 | rse.expr = gfc_build_array_ref (tmp, tmp_index, NULL); |
858f9894 | 2316 | |
2317 | if (expr->ts.type == BT_CHARACTER) | |
eeebe20b | 2318 | rse.string_length = expr->ts.u.cl->backend_decl; |
858f9894 | 2319 | |
2320 | gfc_conv_expr (&lse, expr); | |
2321 | ||
2322 | gcc_assert (lse.ss == gfc_ss_terminator); | |
2323 | ||
2294b616 | 2324 | tmp = gfc_trans_scalar_assign (&lse, &rse, expr->ts, false, false); |
858f9894 | 2325 | gfc_add_expr_to_block (&body, tmp); |
2326 | ||
2327 | /* Generate the copying loops. */ | |
2328 | gfc_trans_scalarizing_loops (&loop2, &body); | |
2329 | ||
2330 | /* Wrap the whole thing up by adding the second loop to the post-block | |
35d9c496 | 2331 | and following it by the post-block of the first loop. In this way, |
858f9894 | 2332 | if the temporary needs freeing, it is done after use! */ |
35d9c496 | 2333 | if (intent != INTENT_IN) |
2334 | { | |
2335 | gfc_add_block_to_block (&parmse->post, &loop2.pre); | |
2336 | gfc_add_block_to_block (&parmse->post, &loop2.post); | |
2337 | } | |
858f9894 | 2338 | |
2339 | gfc_add_block_to_block (&parmse->post, &loop.post); | |
2340 | ||
2341 | gfc_cleanup_loop (&loop); | |
2342 | gfc_cleanup_loop (&loop2); | |
2343 | ||
2344 | /* Pass the string length to the argument expression. */ | |
2345 | if (expr->ts.type == BT_CHARACTER) | |
eeebe20b | 2346 | parmse->string_length = expr->ts.u.cl->backend_decl; |
858f9894 | 2347 | |
2348 | /* We want either the address for the data or the address of the descriptor, | |
2349 | depending on the mode of passing array arguments. */ | |
2350 | if (g77) | |
2351 | parmse->expr = gfc_conv_descriptor_data_get (parmse->expr); | |
2352 | else | |
86f2ad37 | 2353 | parmse->expr = gfc_build_addr_expr (NULL_TREE, parmse->expr); |
858f9894 | 2354 | |
2355 | return; | |
2356 | } | |
2357 | ||
08569428 | 2358 | |
8d7cdc4d | 2359 | /* Generate the code for argument list functions. */ |
2360 | ||
2361 | static void | |
2362 | conv_arglist_function (gfc_se *se, gfc_expr *expr, const char *name) | |
2363 | { | |
8d7cdc4d | 2364 | /* Pass by value for g77 %VAL(arg), pass the address |
2365 | indirectly for %LOC, else by reference. Thus %REF | |
2366 | is a "do-nothing" and %LOC is the same as an F95 | |
2367 | pointer. */ | |
2368 | if (strncmp (name, "%VAL", 4) == 0) | |
b8128c7b | 2369 | gfc_conv_expr (se, expr); |
8d7cdc4d | 2370 | else if (strncmp (name, "%LOC", 4) == 0) |
2371 | { | |
2372 | gfc_conv_expr_reference (se, expr); | |
2373 | se->expr = gfc_build_addr_expr (NULL, se->expr); | |
2374 | } | |
2375 | else if (strncmp (name, "%REF", 4) == 0) | |
2376 | gfc_conv_expr_reference (se, expr); | |
2377 | else | |
2378 | gfc_error ("Unknown argument list function at %L", &expr->where); | |
2379 | } | |
2380 | ||
2381 | ||
4ee9c684 | 2382 | /* Generate code for a procedure call. Note can return se->post != NULL. |
079d21d5 | 2383 | If se->direct_byref is set then se->expr contains the return parameter. |
64e93293 | 2384 | Return nonzero, if the call has alternate specifiers. |
2385 | 'expr' is only needed for procedure pointer components. */ | |
4ee9c684 | 2386 | |
079d21d5 | 2387 | int |
64e93293 | 2388 | gfc_conv_procedure_call (gfc_se * se, gfc_symbol * sym, |
2389 | gfc_actual_arglist * arg, gfc_expr * expr, | |
2390 | tree append_args) | |
4ee9c684 | 2391 | { |
08569428 | 2392 | gfc_interface_mapping mapping; |
4ee9c684 | 2393 | tree arglist; |
08569428 | 2394 | tree retargs; |
4ee9c684 | 2395 | tree tmp; |
2396 | tree fntype; | |
2397 | gfc_se parmse; | |
2398 | gfc_ss *argss; | |
2399 | gfc_ss_info *info; | |
2400 | int byref; | |
2294b616 | 2401 | int parm_kind; |
4ee9c684 | 2402 | tree type; |
2403 | tree var; | |
2404 | tree len; | |
2405 | tree stringargs; | |
2406 | gfc_formal_arglist *formal; | |
079d21d5 | 2407 | int has_alternate_specifier = 0; |
08569428 | 2408 | bool need_interface_mapping; |
d4ef6f9d | 2409 | bool callee_alloc; |
08569428 | 2410 | gfc_typespec ts; |
2411 | gfc_charlen cl; | |
bd24f178 | 2412 | gfc_expr *e; |
2413 | gfc_symbol *fsym; | |
10b07432 | 2414 | stmtblock_t post; |
2294b616 | 2415 | enum {MISSING = 0, ELEMENTAL, SCALAR, SCALAR_POINTER, ARRAY}; |
85d1c108 | 2416 | gfc_component *comp = NULL; |
4ee9c684 | 2417 | |
2418 | arglist = NULL_TREE; | |
08569428 | 2419 | retargs = NULL_TREE; |
4ee9c684 | 2420 | stringargs = NULL_TREE; |
2421 | var = NULL_TREE; | |
2422 | len = NULL_TREE; | |
52179f31 | 2423 | gfc_clear_ts (&ts); |
4ee9c684 | 2424 | |
513a2ff6 | 2425 | if (sym->from_intmod == INTMOD_ISO_C_BINDING) |
43c61a0d | 2426 | { |
513a2ff6 | 2427 | if (sym->intmod_sym_id == ISOCBINDING_LOC) |
43c61a0d | 2428 | { |
513a2ff6 | 2429 | if (arg->expr->rank == 0) |
2430 | gfc_conv_expr_reference (se, arg->expr); | |
2431 | else | |
2432 | { | |
2433 | int f; | |
2434 | /* This is really the actual arg because no formal arglist is | |
2435 | created for C_LOC. */ | |
2436 | fsym = arg->expr->symtree->n.sym; | |
2437 | ||
2438 | /* We should want it to do g77 calling convention. */ | |
2439 | f = (fsym != NULL) | |
2440 | && !(fsym->attr.pointer || fsym->attr.allocatable) | |
2441 | && fsym->as->type != AS_ASSUMED_SHAPE; | |
2442 | f = f || !sym->attr.always_explicit; | |
2443 | ||
2444 | argss = gfc_walk_expr (arg->expr); | |
bc56d052 | 2445 | gfc_conv_array_parameter (se, arg->expr, argss, f, |
2446 | NULL, NULL, NULL); | |
513a2ff6 | 2447 | } |
2448 | ||
6b956f99 | 2449 | /* TODO -- the following two lines shouldn't be necessary, but |
2450 | they're removed a bug is exposed later in the codepath. | |
2451 | This is workaround was thus introduced, but will have to be | |
2452 | removed; please see PR 35150 for details about the issue. */ | |
2453 | se->expr = convert (pvoid_type_node, se->expr); | |
2454 | se->expr = gfc_evaluate_now (se->expr, &se->pre); | |
2455 | ||
513a2ff6 | 2456 | return 0; |
43c61a0d | 2457 | } |
513a2ff6 | 2458 | else if (sym->intmod_sym_id == ISOCBINDING_FUNLOC) |
43c61a0d | 2459 | { |
eeebe20b | 2460 | arg->expr->ts.type = sym->ts.u.derived->ts.type; |
2461 | arg->expr->ts.f90_type = sym->ts.u.derived->ts.f90_type; | |
2462 | arg->expr->ts.kind = sym->ts.u.derived->ts.kind; | |
513a2ff6 | 2463 | gfc_conv_expr_reference (se, arg->expr); |
2464 | ||
2cbaf336 | 2465 | return 0; |
2466 | } | |
2467 | else if ((sym->intmod_sym_id == ISOCBINDING_F_POINTER | |
2468 | && arg->next->expr->rank == 0) | |
2469 | || sym->intmod_sym_id == ISOCBINDING_F_PROCPOINTER) | |
2470 | { | |
2471 | /* Convert c_f_pointer if fptr is a scalar | |
2472 | and convert c_f_procpointer. */ | |
2473 | gfc_se cptrse; | |
2474 | gfc_se fptrse; | |
2475 | ||
2476 | gfc_init_se (&cptrse, NULL); | |
2477 | gfc_conv_expr (&cptrse, arg->expr); | |
2478 | gfc_add_block_to_block (&se->pre, &cptrse.pre); | |
2479 | gfc_add_block_to_block (&se->post, &cptrse.post); | |
2480 | ||
2481 | gfc_init_se (&fptrse, NULL); | |
64e93293 | 2482 | if (sym->intmod_sym_id == ISOCBINDING_F_POINTER |
ff70e443 | 2483 | || gfc_is_proc_ptr_comp (arg->next->expr, NULL)) |
64e93293 | 2484 | fptrse.want_pointer = 1; |
2cbaf336 | 2485 | |
2486 | gfc_conv_expr (&fptrse, arg->next->expr); | |
2487 | gfc_add_block_to_block (&se->pre, &fptrse.pre); | |
2488 | gfc_add_block_to_block (&se->post, &fptrse.post); | |
2489 | ||
ff70e443 | 2490 | if (gfc_is_proc_ptr_comp (arg->next->expr, NULL)) |
64e93293 | 2491 | tmp = gfc_get_ppc_type (arg->next->expr->ref->u.c.component); |
2492 | else | |
2493 | tmp = TREE_TYPE (arg->next->expr->symtree->n.sym->backend_decl); | |
2494 | se->expr = fold_build2 (MODIFY_EXPR, tmp, fptrse.expr, | |
2495 | fold_convert (tmp, cptrse.expr)); | |
2cbaf336 | 2496 | |
32e8ed46 | 2497 | return 0; |
2498 | } | |
2499 | else if (sym->intmod_sym_id == ISOCBINDING_ASSOCIATED) | |
2500 | { | |
2501 | gfc_se arg1se; | |
2502 | gfc_se arg2se; | |
2503 | ||
2504 | /* Build the addr_expr for the first argument. The argument is | |
2505 | already an *address* so we don't need to set want_pointer in | |
2506 | the gfc_se. */ | |
2507 | gfc_init_se (&arg1se, NULL); | |
2508 | gfc_conv_expr (&arg1se, arg->expr); | |
2509 | gfc_add_block_to_block (&se->pre, &arg1se.pre); | |
2510 | gfc_add_block_to_block (&se->post, &arg1se.post); | |
2511 | ||
2512 | /* See if we were given two arguments. */ | |
2513 | if (arg->next == NULL) | |
2514 | /* Only given one arg so generate a null and do a | |
2515 | not-equal comparison against the first arg. */ | |
f75d6b8a | 2516 | se->expr = fold_build2 (NE_EXPR, boolean_type_node, arg1se.expr, |
2517 | fold_convert (TREE_TYPE (arg1se.expr), | |
2518 | null_pointer_node)); | |
32e8ed46 | 2519 | else |
2520 | { | |
2521 | tree eq_expr; | |
2522 | tree not_null_expr; | |
2523 | ||
2524 | /* Given two arguments so build the arg2se from second arg. */ | |
2525 | gfc_init_se (&arg2se, NULL); | |
2526 | gfc_conv_expr (&arg2se, arg->next->expr); | |
2527 | gfc_add_block_to_block (&se->pre, &arg2se.pre); | |
2528 | gfc_add_block_to_block (&se->post, &arg2se.post); | |
2529 | ||
2530 | /* Generate test to compare that the two args are equal. */ | |
f75d6b8a | 2531 | eq_expr = fold_build2 (EQ_EXPR, boolean_type_node, |
2532 | arg1se.expr, arg2se.expr); | |
32e8ed46 | 2533 | /* Generate test to ensure that the first arg is not null. */ |
f75d6b8a | 2534 | not_null_expr = fold_build2 (NE_EXPR, boolean_type_node, |
2535 | arg1se.expr, null_pointer_node); | |
32e8ed46 | 2536 | |
2537 | /* Finally, the generated test must check that both arg1 is not | |
2538 | NULL and that it is equal to the second arg. */ | |
f75d6b8a | 2539 | se->expr = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, |
2540 | not_null_expr, eq_expr); | |
32e8ed46 | 2541 | } |
2542 | ||
513a2ff6 | 2543 | return 0; |
43c61a0d | 2544 | } |
43c61a0d | 2545 | } |
ff70e443 | 2546 | |
2547 | gfc_is_proc_ptr_comp (expr, &comp); | |
2548 | ||
4ee9c684 | 2549 | if (se->ss != NULL) |
2550 | { | |
2551 | if (!sym->attr.elemental) | |
2552 | { | |
22d678e8 | 2553 | gcc_assert (se->ss->type == GFC_SS_FUNCTION); |
4ee9c684 | 2554 | if (se->ss->useflags) |
2555 | { | |
ff70e443 | 2556 | gcc_assert ((!comp && gfc_return_by_reference (sym) |
2557 | && sym->result->attr.dimension) | |
2558 | || (comp && comp->attr.dimension)); | |
22d678e8 | 2559 | gcc_assert (se->loop != NULL); |
4ee9c684 | 2560 | |
2561 | /* Access the previously obtained result. */ | |
2562 | gfc_conv_tmp_array_ref (se); | |
2563 | gfc_advance_se_ss_chain (se); | |
079d21d5 | 2564 | return 0; |
4ee9c684 | 2565 | } |
2566 | } | |
2567 | info = &se->ss->data.info; | |
2568 | } | |
2569 | else | |
2570 | info = NULL; | |
2571 | ||
10b07432 | 2572 | gfc_init_block (&post); |
08569428 | 2573 | gfc_init_interface_mapping (&mapping); |
f45a476e | 2574 | need_interface_mapping = ((sym->ts.type == BT_CHARACTER |
eeebe20b | 2575 | && sym->ts.u.cl->length |
2576 | && sym->ts.u.cl->length->expr_type | |
5e8cd291 | 2577 | != EXPR_CONSTANT) |
85d1c108 | 2578 | || (comp && comp->attr.dimension) |
2579 | || (!comp && sym->attr.dimension)); | |
452a3743 | 2580 | if (comp) |
2581 | formal = comp->formal; | |
2582 | else | |
2583 | formal = sym->formal; | |
4ee9c684 | 2584 | /* Evaluate the arguments. */ |
2585 | for (; arg != NULL; arg = arg->next, formal = formal ? formal->next : NULL) | |
2586 | { | |
bd24f178 | 2587 | e = arg->expr; |
2588 | fsym = formal ? formal->sym : NULL; | |
2294b616 | 2589 | parm_kind = MISSING; |
bd24f178 | 2590 | if (e == NULL) |
4ee9c684 | 2591 | { |
2592 | ||
2593 | if (se->ignore_optional) | |
2594 | { | |
2595 | /* Some intrinsics have already been resolved to the correct | |
2596 | parameters. */ | |
2597 | continue; | |
2598 | } | |
2599 | else if (arg->label) | |
2600 | { | |
2601 | has_alternate_specifier = 1; | |
2602 | continue; | |
2603 | } | |
2604 | else | |
2605 | { | |
2606 | /* Pass a NULL pointer for an absent arg. */ | |
2607 | gfc_init_se (&parmse, NULL); | |
2608 | parmse.expr = null_pointer_node; | |
0fe9e56f | 2609 | if (arg->missing_arg_type == BT_CHARACTER) |
7d3075f6 | 2610 | parmse.string_length = build_int_cst (gfc_charlen_type_node, 0); |
4ee9c684 | 2611 | } |
2612 | } | |
2613 | else if (se->ss && se->ss->useflags) | |
2614 | { | |
2615 | /* An elemental function inside a scalarized loop. */ | |
2616 | gfc_init_se (&parmse, se); | |
bd24f178 | 2617 | gfc_conv_expr_reference (&parmse, e); |
2294b616 | 2618 | parm_kind = ELEMENTAL; |
4ee9c684 | 2619 | } |
2620 | else | |
2621 | { | |
2622 | /* A scalar or transformational function. */ | |
2623 | gfc_init_se (&parmse, NULL); | |
bd24f178 | 2624 | argss = gfc_walk_expr (e); |
4ee9c684 | 2625 | |
2626 | if (argss == gfc_ss_terminator) | |
c5d33754 | 2627 | { |
623416e8 | 2628 | if (e->expr_type == EXPR_VARIABLE |
2629 | && e->symtree->n.sym->attr.cray_pointee | |
2630 | && fsym && fsym->attr.flavor == FL_PROCEDURE) | |
2631 | { | |
2632 | /* The Cray pointer needs to be converted to a pointer to | |
2633 | a type given by the expression. */ | |
2634 | gfc_conv_expr (&parmse, e); | |
2635 | type = build_pointer_type (TREE_TYPE (parmse.expr)); | |
2636 | tmp = gfc_get_symbol_decl (e->symtree->n.sym->cp_pointer); | |
2637 | parmse.expr = convert (type, tmp); | |
2638 | } | |
2639 | else if (fsym && fsym->attr.value) | |
8f6339b6 | 2640 | { |
4c47c8b7 | 2641 | if (fsym->ts.type == BT_CHARACTER |
2642 | && fsym->ts.is_c_interop | |
2643 | && fsym->ns->proc_name != NULL | |
2644 | && fsym->ns->proc_name->attr.is_bind_c) | |
2645 | { | |
2646 | parmse.expr = NULL; | |
2647 | gfc_conv_scalar_char_value (fsym, &parmse, &e); | |
2648 | if (parmse.expr == NULL) | |
2649 | gfc_conv_expr (&parmse, e); | |
2650 | } | |
2651 | else | |
2652 | gfc_conv_expr (&parmse, e); | |
8f6339b6 | 2653 | } |
8d7cdc4d | 2654 | else if (arg->name && arg->name[0] == '%') |
2655 | /* Argument list functions %VAL, %LOC and %REF are signalled | |
2656 | through arg->name. */ | |
2657 | conv_arglist_function (&parmse, arg->expr, arg->name); | |
7f7ca309 | 2658 | else if ((e->expr_type == EXPR_FUNCTION) |
2659 | && e->symtree->n.sym->attr.pointer | |
2660 | && fsym && fsym->attr.target) | |
2661 | { | |
2662 | gfc_conv_expr (&parmse, e); | |
86f2ad37 | 2663 | parmse.expr = gfc_build_addr_expr (NULL_TREE, parmse.expr); |
7f7ca309 | 2664 | } |
eee4a6d8 | 2665 | else if (e->expr_type == EXPR_FUNCTION |
2666 | && e->symtree->n.sym->result | |
2667 | && e->symtree->n.sym->result->attr.proc_pointer) | |
2668 | { | |
2669 | /* Functions returning procedure pointers. */ | |
2670 | gfc_conv_expr (&parmse, e); | |
2671 | if (fsym && fsym->attr.proc_pointer) | |
2672 | parmse.expr = gfc_build_addr_expr (NULL_TREE, parmse.expr); | |
2673 | } | |
8f6339b6 | 2674 | else |
2675 | { | |
2676 | gfc_conv_expr_reference (&parmse, e); | |
cad0ddcf | 2677 | if (fsym && e->expr_type != EXPR_NULL |
2678 | && ((fsym->attr.pointer | |
2679 | && fsym->attr.flavor != FL_PROCEDURE) | |
4651cfdd | 2680 | || (fsym->attr.proc_pointer |
2681 | && !(e->expr_type == EXPR_VARIABLE | |
cf046737 | 2682 | && e->symtree->n.sym->attr.dummy)) |
2683 | || gfc_is_proc_ptr_comp (e, NULL))) | |
8f6339b6 | 2684 | { |
2685 | /* Scalar pointer dummy args require an extra level of | |
2686 | indirection. The null pointer already contains | |
2687 | this level of indirection. */ | |
2688 | parm_kind = SCALAR_POINTER; | |
86f2ad37 | 2689 | parmse.expr = gfc_build_addr_expr (NULL_TREE, parmse.expr); |
8f6339b6 | 2690 | } |
2691 | } | |
2692 | } | |
4ee9c684 | 2693 | else |
2694 | { | |
7d19e94d | 2695 | /* If the procedure requires an explicit interface, the actual |
2696 | argument is passed according to the corresponding formal | |
2697 | argument. If the corresponding formal argument is a POINTER, | |
2698 | ALLOCATABLE or assumed shape, we do not use g77's calling | |
2699 | convention, and pass the address of the array descriptor | |
2700 | instead. Otherwise we use g77's calling convention. */ | |
4ee9c684 | 2701 | int f; |
bd24f178 | 2702 | f = (fsym != NULL) |
2703 | && !(fsym->attr.pointer || fsym->attr.allocatable) | |
2704 | && fsym->as->type != AS_ASSUMED_SHAPE; | |
4ee9c684 | 2705 | f = f || !sym->attr.always_explicit; |
35d9c496 | 2706 | |
bd24f178 | 2707 | if (e->expr_type == EXPR_VARIABLE |
1033248c | 2708 | && is_subref_array (e)) |
858f9894 | 2709 | /* The actual argument is a component reference to an |
2710 | array of derived types. In this case, the argument | |
2711 | is converted to a temporary, which is passed and then | |
2712 | written back after the procedure call. */ | |
1033248c | 2713 | gfc_conv_subref_array_arg (&parmse, e, f, |
b8a51d79 | 2714 | fsym ? fsym->attr.intent : INTENT_INOUT); |
858f9894 | 2715 | else |
da6ffc6d | 2716 | gfc_conv_array_parameter (&parmse, e, argss, f, fsym, |
bc56d052 | 2717 | sym->name, NULL); |
ab19f982 | 2718 | |
2719 | /* If an ALLOCATABLE dummy argument has INTENT(OUT) and is | |
2720 | allocated on entry, it must be deallocated. */ | |
bd24f178 | 2721 | if (fsym && fsym->attr.allocatable |
2722 | && fsym->attr.intent == INTENT_OUT) | |
ab19f982 | 2723 | { |
389dd41b | 2724 | tmp = build_fold_indirect_ref_loc (input_location, |
2725 | parmse.expr); | |
f135d1ce | 2726 | tmp = gfc_trans_dealloc_allocated (tmp); |
ab19f982 | 2727 | gfc_add_expr_to_block (&se->pre, tmp); |
2728 | } | |
2729 | ||
4ee9c684 | 2730 | } |
2731 | } | |
2732 | ||
3d3b790d | 2733 | /* The case with fsym->attr.optional is that of a user subroutine |
2734 | with an interface indicating an optional argument. When we call | |
2735 | an intrinsic subroutine, however, fsym is NULL, but we might still | |
2736 | have an optional argument, so we proceed to the substitution | |
2737 | just in case. */ | |
2738 | if (e && (fsym == NULL || fsym->attr.optional)) | |
d45fced7 | 2739 | { |
3d3b790d | 2740 | /* If an optional argument is itself an optional dummy argument, |
2741 | check its presence and substitute a null if absent. */ | |
2742 | if (e->expr_type == EXPR_VARIABLE | |
2743 | && e->symtree->n.sym->attr.optional) | |
2abe085f | 2744 | gfc_conv_missing_dummy (&parmse, e, fsym ? fsym->ts : e->ts, |
2745 | e->representation.length); | |
3d3b790d | 2746 | } |
2747 | ||
2748 | if (fsym && e) | |
2749 | { | |
2750 | /* Obtain the character length of an assumed character length | |
2751 | length procedure from the typespec. */ | |
2752 | if (fsym->ts.type == BT_CHARACTER | |
2753 | && parmse.string_length == NULL_TREE | |
2754 | && e->ts.type == BT_PROCEDURE | |
2755 | && e->symtree->n.sym->ts.type == BT_CHARACTER | |
eeebe20b | 2756 | && e->symtree->n.sym->ts.u.cl->length != NULL |
2757 | && e->symtree->n.sym->ts.u.cl->length->expr_type == EXPR_CONSTANT) | |
d45fced7 | 2758 | { |
eeebe20b | 2759 | gfc_conv_const_charlen (e->symtree->n.sym->ts.u.cl); |
2760 | parmse.string_length = e->symtree->n.sym->ts.u.cl->backend_decl; | |
d45fced7 | 2761 | } |
d45fced7 | 2762 | } |
08569428 | 2763 | |
079d3acc | 2764 | if (fsym && need_interface_mapping && e) |
fd149f95 | 2765 | gfc_add_interface_mapping (&mapping, fsym, &parmse, e); |
3d3b790d | 2766 | |
4ee9c684 | 2767 | gfc_add_block_to_block (&se->pre, &parmse.pre); |
10b07432 | 2768 | gfc_add_block_to_block (&post, &parmse.post); |
4ee9c684 | 2769 | |
2294b616 | 2770 | /* Allocated allocatable components of derived types must be |
8714fc76 | 2771 | deallocated for non-variable scalars. Non-variable arrays are |
2772 | dealt with in trans-array.c(gfc_conv_array_parameter). */ | |
2294b616 | 2773 | if (e && e->ts.type == BT_DERIVED |
eeebe20b | 2774 | && e->ts.u.derived->attr.alloc_comp |
cc2f46ba | 2775 | && !(e->symtree && e->symtree->n.sym->attr.pointer) |
8714fc76 | 2776 | && (e->expr_type != EXPR_VARIABLE && !e->rank)) |
2294b616 | 2777 | { |
2778 | int parm_rank; | |
389dd41b | 2779 | tmp = build_fold_indirect_ref_loc (input_location, |
2780 | parmse.expr); | |
2294b616 | 2781 | parm_rank = e->rank; |
2782 | switch (parm_kind) | |
2783 | { | |
2784 | case (ELEMENTAL): | |
2785 | case (SCALAR): | |
2786 | parm_rank = 0; | |
2787 | break; | |
2788 | ||
2789 | case (SCALAR_POINTER): | |
389dd41b | 2790 | tmp = build_fold_indirect_ref_loc (input_location, |
2791 | tmp); | |
2294b616 | 2792 | break; |
2294b616 | 2793 | } |
2794 | ||
e5387fb9 | 2795 | if (e->expr_type == EXPR_OP |
2796 | && e->value.op.op == INTRINSIC_PARENTHESES | |
2797 | && e->value.op.op1->expr_type == EXPR_VARIABLE) | |
2798 | { | |
2799 | tree local_tmp; | |
2800 | local_tmp = gfc_evaluate_now (tmp, &se->pre); | |
eeebe20b | 2801 | local_tmp = gfc_copy_alloc_comp (e->ts.u.derived, local_tmp, tmp, parm_rank); |
e5387fb9 | 2802 | gfc_add_expr_to_block (&se->post, local_tmp); |
2803 | } | |
2804 | ||
eeebe20b | 2805 | tmp = gfc_deallocate_alloc_comp (e->ts.u.derived, tmp, parm_rank); |
e5387fb9 | 2806 | |
8714fc76 | 2807 | gfc_add_expr_to_block (&se->post, tmp); |
2294b616 | 2808 | } |
2809 | ||
91cf6ba3 | 2810 | /* Add argument checking of passing an unallocated/NULL actual to |
2811 | a nonallocatable/nonpointer dummy. */ | |
2812 | ||
40474135 | 2813 | if (gfc_option.rtcheck & GFC_RTCHECK_POINTER && e != NULL) |
91cf6ba3 | 2814 | { |
40474135 | 2815 | symbol_attribute *attr; |
91cf6ba3 | 2816 | char *msg; |
2817 | tree cond; | |
2818 | ||
2819 | if (e->expr_type == EXPR_VARIABLE) | |
40474135 | 2820 | attr = &e->symtree->n.sym->attr; |
91cf6ba3 | 2821 | else if (e->expr_type == EXPR_FUNCTION) |
40474135 | 2822 | { |
2823 | /* For intrinsic functions, the gfc_attr are not available. */ | |
2824 | if (e->symtree->n.sym->attr.generic && e->value.function.isym) | |
2825 | goto end_pointer_check; | |
91cf6ba3 | 2826 | |
40474135 | 2827 | if (e->symtree->n.sym->attr.generic) |
2828 | attr = &e->value.function.esym->attr; | |
2829 | else | |
2830 | attr = &e->symtree->n.sym->result->attr; | |
2831 | } | |
91cf6ba3 | 2832 | else |
2833 | goto end_pointer_check; | |
2834 | ||
40474135 | 2835 | if (attr->optional) |
2836 | { | |
2837 | /* If the actual argument is an optional pointer/allocatable and | |
2838 | the formal argument takes an nonpointer optional value, | |
2839 | it is invalid to pass a non-present argument on, even | |
2840 | though there is no technical reason for this in gfortran. | |
2841 | See Fortran 2003, Section 12.4.1.6 item (7)+(8). */ | |
2842 | tree present, nullptr, type; | |
2843 | ||
2844 | if (attr->allocatable | |
2845 | && (fsym == NULL || !fsym->attr.allocatable)) | |
2846 | asprintf (&msg, "Allocatable actual argument '%s' is not " | |
2847 | "allocated or not present", e->symtree->n.sym->name); | |
2848 | else if (attr->pointer | |
2849 | && (fsym == NULL || !fsym->attr.pointer)) | |
2850 | asprintf (&msg, "Pointer actual argument '%s' is not " | |
2851 | "associated or not present", | |
2852 | e->symtree->n.sym->name); | |
2853 | else if (attr->proc_pointer | |
2854 | && (fsym == NULL || !fsym->attr.proc_pointer)) | |
2855 | asprintf (&msg, "Proc-pointer actual argument '%s' is not " | |
2856 | "associated or not present", | |
2857 | e->symtree->n.sym->name); | |
2858 | else | |
2859 | goto end_pointer_check; | |
2860 | ||
2861 | present = gfc_conv_expr_present (e->symtree->n.sym); | |
2862 | type = TREE_TYPE (present); | |
2863 | present = fold_build2 (EQ_EXPR, boolean_type_node, present, | |
2864 | fold_convert (type, null_pointer_node)); | |
2865 | type = TREE_TYPE (parmse.expr); | |
2866 | nullptr = fold_build2 (EQ_EXPR, boolean_type_node, parmse.expr, | |
2867 | fold_convert (type, null_pointer_node)); | |
2868 | cond = fold_build2 (TRUTH_ORIF_EXPR, boolean_type_node, | |
2869 | present, nullptr); | |
2870 | } | |
2871 | else | |
2872 | { | |
2873 | if (attr->allocatable | |
2874 | && (fsym == NULL || !fsym->attr.allocatable)) | |
2875 | asprintf (&msg, "Allocatable actual argument '%s' is not " | |
2876 | "allocated", e->symtree->n.sym->name); | |
2877 | else if (attr->pointer | |
2878 | && (fsym == NULL || !fsym->attr.pointer)) | |
2879 | asprintf (&msg, "Pointer actual argument '%s' is not " | |
2880 | "associated", e->symtree->n.sym->name); | |
2881 | else if (attr->proc_pointer | |
2882 | && (fsym == NULL || !fsym->attr.proc_pointer)) | |
2883 | asprintf (&msg, "Proc-pointer actual argument '%s' is not " | |
2884 | "associated", e->symtree->n.sym->name); | |
2885 | else | |
2886 | goto end_pointer_check; | |
2887 | ||
2888 | ||
2889 | cond = fold_build2 (EQ_EXPR, boolean_type_node, parmse.expr, | |
2890 | fold_convert (TREE_TYPE (parmse.expr), | |
2891 | null_pointer_node)); | |
2892 | } | |
91cf6ba3 | 2893 | |
2894 | gfc_trans_runtime_check (true, false, cond, &se->pre, &e->where, | |
2895 | msg); | |
2896 | gfc_free (msg); | |
2897 | } | |
2898 | end_pointer_check: | |
2899 | ||
2900 | ||
7b3423b9 | 2901 | /* Character strings are passed as two parameters, a length and a |
465e4a95 | 2902 | pointer - except for Bind(c) which only passes the pointer. */ |
2903 | if (parmse.string_length != NULL_TREE && !sym->attr.is_bind_c) | |
4ee9c684 | 2904 | stringargs = gfc_chainon_list (stringargs, parmse.string_length); |
2905 | ||
2906 | arglist = gfc_chainon_list (arglist, parmse.expr); | |
2907 | } | |
08569428 | 2908 | gfc_finish_interface_mapping (&mapping, &se->pre, &se->post); |
2909 | ||
2910 | ts = sym->ts; | |
ff2093c8 | 2911 | if (ts.type == BT_CHARACTER && sym->attr.is_bind_c) |
2912 | se->string_length = build_int_cst (gfc_charlen_type_node, 1); | |
2913 | else if (ts.type == BT_CHARACTER) | |
08569428 | 2914 | { |
eeebe20b | 2915 | if (sym->ts.u.cl->length == NULL) |
5e8cd291 | 2916 | { |
2917 | /* Assumed character length results are not allowed by 5.1.1.5 of the | |
2918 | standard and are trapped in resolve.c; except in the case of SPREAD | |
cce7ac71 | 2919 | (and other intrinsics?) and dummy functions. In the case of SPREAD, |
2920 | we take the character length of the first argument for the result. | |
2921 | For dummies, we have to look through the formal argument list for | |
2922 | this function and use the character length found there.*/ | |
2923 | if (!sym->attr.dummy) | |
2924 | cl.backend_decl = TREE_VALUE (stringargs); | |
2925 | else | |
2926 | { | |
2927 | formal = sym->ns->proc_name->formal; | |
2928 | for (; formal; formal = formal->next) | |
2929 | if (strcmp (formal->sym->name, sym->name) == 0) | |
eeebe20b | 2930 | cl.backend_decl = formal->sym->ts.u.cl->backend_decl; |
cce7ac71 | 2931 | } |
2932 | } | |
2933 | else | |
2934 | { | |
a0ab480a | 2935 | tree tmp; |
2936 | ||
5e8cd291 | 2937 | /* Calculate the length of the returned string. */ |
2938 | gfc_init_se (&parmse, NULL); | |
2939 | if (need_interface_mapping) | |
eeebe20b | 2940 | gfc_apply_interface_mapping (&mapping, &parmse, sym->ts.u.cl->length); |
5e8cd291 | 2941 | else |
eeebe20b | 2942 | gfc_conv_expr (&parmse, sym->ts.u.cl->length); |
5e8cd291 | 2943 | gfc_add_block_to_block (&se->pre, &parmse.pre); |
2944 | gfc_add_block_to_block (&se->post, &parmse.post); | |
a0ab480a | 2945 | |
2946 | tmp = fold_convert (gfc_charlen_type_node, parmse.expr); | |
2947 | tmp = fold_build2 (MAX_EXPR, gfc_charlen_type_node, tmp, | |
2948 | build_int_cst (gfc_charlen_type_node, 0)); | |
2949 | cl.backend_decl = tmp; | |
5e8cd291 | 2950 | } |
08569428 | 2951 | |
2952 | /* Set up a charlen structure for it. */ | |
2953 | cl.next = NULL; | |
2954 | cl.length = NULL; | |
eeebe20b | 2955 | ts.u.cl = &cl; |
08569428 | 2956 | |
2957 | len = cl.backend_decl; | |
2958 | } | |
08569428 | 2959 | |
85d1c108 | 2960 | byref = (comp && comp->attr.dimension) |
2961 | || (!comp && gfc_return_by_reference (sym)); | |
08569428 | 2962 | if (byref) |
2963 | { | |
2964 | if (se->direct_byref) | |
67135eee | 2965 | { |
69b1505f | 2966 | /* Sometimes, too much indirection can be applied; e.g. for |
67135eee | 2967 | function_result = array_valued_recursive_function. */ |
2968 | if (TREE_TYPE (TREE_TYPE (se->expr)) | |
2969 | && TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr))) | |
2970 | && GFC_DESCRIPTOR_TYPE_P | |
2971 | (TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr))))) | |
389dd41b | 2972 | se->expr = build_fold_indirect_ref_loc (input_location, |
2973 | se->expr); | |
67135eee | 2974 | |
2975 | retargs = gfc_chainon_list (retargs, se->expr); | |
2976 | } | |
ff70e443 | 2977 | else if (comp && comp->attr.dimension) |
2978 | { | |
2979 | gcc_assert (se->loop && info); | |
2980 | ||
2981 | /* Set the type of the array. */ | |
2982 | tmp = gfc_typenode_for_spec (&comp->ts); | |
2983 | info->dimen = se->loop->dimen; | |
2984 | ||
2985 | /* Evaluate the bounds of the result, if known. */ | |
2986 | gfc_set_loop_bounds_from_array_spec (&mapping, se, comp->as); | |
2987 | ||
2988 | /* Create a temporary to store the result. In case the function | |
2989 | returns a pointer, the temporary will be a shallow copy and | |
2990 | mustn't be deallocated. */ | |
2991 | callee_alloc = comp->attr.allocatable || comp->attr.pointer; | |
2992 | gfc_trans_create_temp_array (&se->pre, &se->post, se->loop, info, tmp, | |
2993 | NULL_TREE, false, !comp->attr.pointer, | |
2994 | callee_alloc, &se->ss->expr->where); | |
2995 | ||
2996 | /* Pass the temporary as the first argument. */ | |
2997 | tmp = info->descriptor; | |
2998 | tmp = gfc_build_addr_expr (NULL_TREE, tmp); | |
2999 | retargs = gfc_chainon_list (retargs, tmp); | |
3000 | } | |
08569428 | 3001 | else if (sym->result->attr.dimension) |
3002 | { | |
3003 | gcc_assert (se->loop && info); | |
3004 | ||
3005 | /* Set the type of the array. */ | |
3006 | tmp = gfc_typenode_for_spec (&ts); | |
3007 | info->dimen = se->loop->dimen; | |
3008 | ||
f45a476e | 3009 | /* Evaluate the bounds of the result, if known. */ |
3010 | gfc_set_loop_bounds_from_array_spec (&mapping, se, sym->result->as); | |
3011 | ||
d4ef6f9d | 3012 | /* Create a temporary to store the result. In case the function |
3013 | returns a pointer, the temporary will be a shallow copy and | |
3014 | mustn't be deallocated. */ | |
3015 | callee_alloc = sym->attr.allocatable || sym->attr.pointer; | |
3016 | gfc_trans_create_temp_array (&se->pre, &se->post, se->loop, info, tmp, | |
7a2a9daf | 3017 | NULL_TREE, false, !sym->attr.pointer, |
3018 | callee_alloc, &se->ss->expr->where); | |
08569428 | 3019 | |
08569428 | 3020 | /* Pass the temporary as the first argument. */ |
3021 | tmp = info->descriptor; | |
86f2ad37 | 3022 | tmp = gfc_build_addr_expr (NULL_TREE, tmp); |
08569428 | 3023 | retargs = gfc_chainon_list (retargs, tmp); |
3024 | } | |
3025 | else if (ts.type == BT_CHARACTER) | |
3026 | { | |
3027 | /* Pass the string length. */ | |
eeebe20b | 3028 | type = gfc_get_character_type (ts.kind, ts.u.cl); |
08569428 | 3029 | type = build_pointer_type (type); |
3030 | ||
3031 | /* Return an address to a char[0:len-1]* temporary for | |
3032 | character pointers. */ | |
3033 | if (sym->attr.pointer || sym->attr.allocatable) | |
3034 | { | |
eeaa887f | 3035 | var = gfc_create_var (type, "pstr"); |
08569428 | 3036 | |
3037 | /* Provide an address expression for the function arguments. */ | |
86f2ad37 | 3038 | var = gfc_build_addr_expr (NULL_TREE, var); |
08569428 | 3039 | } |
3040 | else | |
3041 | var = gfc_conv_string_tmp (se, type, len); | |
3042 | ||
3043 | retargs = gfc_chainon_list (retargs, var); | |
3044 | } | |
3045 | else | |
3046 | { | |
3047 | gcc_assert (gfc_option.flag_f2c && ts.type == BT_COMPLEX); | |
3048 | ||
3049 | type = gfc_get_complex_type (ts.kind); | |
86f2ad37 | 3050 | var = gfc_build_addr_expr (NULL_TREE, gfc_create_var (type, "cmplx")); |
08569428 | 3051 | retargs = gfc_chainon_list (retargs, var); |
3052 | } | |
3053 | ||
3054 | /* Add the string length to the argument list. */ | |
3055 | if (ts.type == BT_CHARACTER) | |
3056 | retargs = gfc_chainon_list (retargs, len); | |
3057 | } | |
f45a476e | 3058 | gfc_free_interface_mapping (&mapping); |
08569428 | 3059 | |
3060 | /* Add the return arguments. */ | |
3061 | arglist = chainon (retargs, arglist); | |
4ee9c684 | 3062 | |
3063 | /* Add the hidden string length parameters to the arguments. */ | |
3064 | arglist = chainon (arglist, stringargs); | |
3065 | ||
4e8e57b0 | 3066 | /* We may want to append extra arguments here. This is used e.g. for |
3067 | calls to libgfortran_matmul_??, which need extra information. */ | |
3068 | if (append_args != NULL_TREE) | |
3069 | arglist = chainon (arglist, append_args); | |
3070 | ||
4ee9c684 | 3071 | /* Generate the actual call. */ |
64e93293 | 3072 | conv_function_val (se, sym, expr); |
57dd95f2 | 3073 | |
4ee9c684 | 3074 | /* If there are alternate return labels, function type should be |
079d21d5 | 3075 | integer. Can't modify the type in place though, since it can be shared |
57dd95f2 | 3076 | with other functions. For dummy arguments, the typing is done to |
3077 | to this result, even if it has to be repeated for each call. */ | |
079d21d5 | 3078 | if (has_alternate_specifier |
3079 | && TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr))) != integer_type_node) | |
3080 | { | |
57dd95f2 | 3081 | if (!sym->attr.dummy) |
3082 | { | |
3083 | TREE_TYPE (sym->backend_decl) | |
3084 | = build_function_type (integer_type_node, | |
3085 | TYPE_ARG_TYPES (TREE_TYPE (sym->backend_decl))); | |
86f2ad37 | 3086 | se->expr = gfc_build_addr_expr (NULL_TREE, sym->backend_decl); |
57dd95f2 | 3087 | } |
3088 | else | |
3089 | TREE_TYPE (TREE_TYPE (TREE_TYPE (se->expr))) = integer_type_node; | |
079d21d5 | 3090 | } |
4ee9c684 | 3091 | |
3092 | fntype = TREE_TYPE (TREE_TYPE (se->expr)); | |
c2f47e15 | 3093 | se->expr = build_call_list (TREE_TYPE (fntype), se->expr, arglist); |
4ee9c684 | 3094 | |
fa069004 | 3095 | /* If we have a pointer function, but we don't want a pointer, e.g. |
3096 | something like | |
3097 | x = f() | |
3098 | where f is pointer valued, we have to dereference the result. */ | |
64e93293 | 3099 | if (!se->want_pointer && !byref && sym->attr.pointer |
ff70e443 | 3100 | && !gfc_is_proc_ptr_comp (expr, NULL)) |
389dd41b | 3101 | se->expr = build_fold_indirect_ref_loc (input_location, |
3102 | se->expr); | |
fa069004 | 3103 | |
bdaed7d2 | 3104 | /* f2c calling conventions require a scalar default real function to |
3105 | return a double precision result. Convert this back to default | |
3106 | real. We only care about the cases that can happen in Fortran 77. | |
3107 | */ | |
3108 | if (gfc_option.flag_f2c && sym->ts.type == BT_REAL | |
3109 | && sym->ts.kind == gfc_default_real_kind | |
3110 | && !sym->attr.always_explicit) | |
3111 | se->expr = fold_convert (gfc_get_real_type (sym->ts.kind), se->expr); | |
3112 | ||
f888a3fb | 3113 | /* A pure function may still have side-effects - it may modify its |
3114 | parameters. */ | |
4ee9c684 | 3115 | TREE_SIDE_EFFECTS (se->expr) = 1; |
3116 | #if 0 | |
3117 | if (!sym->attr.pure) | |
3118 | TREE_SIDE_EFFECTS (se->expr) = 1; | |
3119 | #endif | |
3120 | ||
4396343e | 3121 | if (byref) |
4ee9c684 | 3122 | { |
4396343e | 3123 | /* Add the function call to the pre chain. There is no expression. */ |
4ee9c684 | 3124 | gfc_add_expr_to_block (&se->pre, se->expr); |
4396343e | 3125 | se->expr = NULL_TREE; |
4ee9c684 | 3126 | |
4396343e | 3127 | if (!se->direct_byref) |
4ee9c684 | 3128 | { |
ff70e443 | 3129 | if (sym->attr.dimension || (comp && comp->attr.dimension)) |
4ee9c684 | 3130 | { |
ad8ed98e | 3131 | if (gfc_option.rtcheck & GFC_RTCHECK_BOUNDS) |
4396343e | 3132 | { |
3133 | /* Check the data pointer hasn't been modified. This would | |
3134 | happen in a function returning a pointer. */ | |
94be45c9 | 3135 | tmp = gfc_conv_descriptor_data_get (info->descriptor); |
0eed5ee7 | 3136 | tmp = fold_build2 (NE_EXPR, boolean_type_node, |
3137 | tmp, info->data); | |
da6ffc6d | 3138 | gfc_trans_runtime_check (true, false, tmp, &se->pre, NULL, |
3139 | gfc_msg_fault); | |
4396343e | 3140 | } |
3141 | se->expr = info->descriptor; | |
bf7e666b | 3142 | /* Bundle in the string length. */ |
3143 | se->string_length = len; | |
4ee9c684 | 3144 | } |
4396343e | 3145 | else if (sym->ts.type == BT_CHARACTER) |
544c333b | 3146 | { |
bf7e666b | 3147 | /* Dereference for character pointer results. */ |
3148 | if (sym->attr.pointer || sym->attr.allocatable) | |
389dd41b | 3149 | se->expr = build_fold_indirect_ref_loc (input_location, |
3150 | var); | |
544c333b | 3151 | else |
bf7e666b | 3152 | se->expr = var; |
3153 | ||
4396343e | 3154 | se->string_length = len; |
3155 | } | |
3156 | else | |
bdaed7d2 | 3157 | { |
3158 | gcc_assert (sym->ts.type == BT_COMPLEX && gfc_option.flag_f2c); | |
389dd41b | 3159 | se->expr = build_fold_indirect_ref_loc (input_location, |
3160 | var); | |
bdaed7d2 | 3161 | } |
4ee9c684 | 3162 | } |
4ee9c684 | 3163 | } |
079d21d5 | 3164 | |
10b07432 | 3165 | /* Follow the function call with the argument post block. */ |
3166 | if (byref) | |
3167 | gfc_add_block_to_block (&se->pre, &post); | |
3168 | else | |
3169 | gfc_add_block_to_block (&se->post, &post); | |
3170 | ||
079d21d5 | 3171 | return has_alternate_specifier; |
4ee9c684 | 3172 | } |
3173 | ||
3174 | ||
b44437b9 | 3175 | /* Fill a character string with spaces. */ |
3176 | ||
3177 | static tree | |
3178 | fill_with_spaces (tree start, tree type, tree size) | |
3179 | { | |
3180 | stmtblock_t block, loop; | |
3181 | tree i, el, exit_label, cond, tmp; | |
3182 | ||
3183 | /* For a simple char type, we can call memset(). */ | |
3184 | if (compare_tree_int (TYPE_SIZE_UNIT (type), 1) == 0) | |
389dd41b | 3185 | return build_call_expr_loc (input_location, |
3186 | built_in_decls[BUILT_IN_MEMSET], 3, start, | |
b44437b9 | 3187 | build_int_cst (gfc_get_int_type (gfc_c_int_kind), |
3188 | lang_hooks.to_target_charset (' ')), | |
3189 | size); | |
3190 | ||
3191 | /* Otherwise, we use a loop: | |
3192 | for (el = start, i = size; i > 0; el--, i+= TYPE_SIZE_UNIT (type)) | |
3193 | *el = (type) ' '; | |
3194 | */ | |
3195 | ||
3196 | /* Initialize variables. */ | |
3197 | gfc_init_block (&block); | |
3198 | i = gfc_create_var (sizetype, "i"); | |
75a70cf9 | 3199 | gfc_add_modify (&block, i, fold_convert (sizetype, size)); |
b44437b9 | 3200 | el = gfc_create_var (build_pointer_type (type), "el"); |
75a70cf9 | 3201 | gfc_add_modify (&block, el, fold_convert (TREE_TYPE (el), start)); |
b44437b9 | 3202 | exit_label = gfc_build_label_decl (NULL_TREE); |
3203 | TREE_USED (exit_label) = 1; | |
3204 | ||
3205 | ||
3206 | /* Loop body. */ | |
3207 | gfc_init_block (&loop); | |
3208 | ||
3209 | /* Exit condition. */ | |
3210 | cond = fold_build2 (LE_EXPR, boolean_type_node, i, | |
3211 | fold_convert (sizetype, integer_zero_node)); | |
3212 | tmp = build1_v (GOTO_EXPR, exit_label); | |
e60a6f7b | 3213 | tmp = fold_build3 (COND_EXPR, void_type_node, cond, tmp, |
3214 | build_empty_stmt (input_location)); | |
b44437b9 | 3215 | gfc_add_expr_to_block (&loop, tmp); |
3216 | ||
3217 | /* Assignment. */ | |
75a70cf9 | 3218 | gfc_add_modify (&loop, fold_build1 (INDIRECT_REF, type, el), |
b44437b9 | 3219 | build_int_cst (type, |
3220 | lang_hooks.to_target_charset (' '))); | |
3221 | ||
3222 | /* Increment loop variables. */ | |
75a70cf9 | 3223 | gfc_add_modify (&loop, i, fold_build2 (MINUS_EXPR, sizetype, i, |
b44437b9 | 3224 | TYPE_SIZE_UNIT (type))); |
75a70cf9 | 3225 | gfc_add_modify (&loop, el, fold_build2 (POINTER_PLUS_EXPR, |
b44437b9 | 3226 | TREE_TYPE (el), el, |
3227 | TYPE_SIZE_UNIT (type))); | |
3228 | ||
3229 | /* Making the loop... actually loop! */ | |
3230 | tmp = gfc_finish_block (&loop); | |
3231 | tmp = build1_v (LOOP_EXPR, tmp); | |
3232 | gfc_add_expr_to_block (&block, tmp); | |
3233 | ||
3234 | /* The exit label. */ | |
3235 | tmp = build1_v (LABEL_EXPR, exit_label); | |
3236 | gfc_add_expr_to_block (&block, tmp); | |
3237 | ||
3238 | ||
3239 | return gfc_finish_block (&block); | |
3240 | } | |
3241 | ||
3242 | ||
dbe60343 | 3243 | /* Generate code to copy a string. */ |
3244 | ||
88137677 | 3245 | void |
72038310 | 3246 | gfc_trans_string_copy (stmtblock_t * block, tree dlength, tree dest, |
b44437b9 | 3247 | int dkind, tree slength, tree src, int skind) |
dbe60343 | 3248 | { |
72038310 | 3249 | tree tmp, dlen, slen; |
77100724 | 3250 | tree dsc; |
3251 | tree ssc; | |
2810b378 | 3252 | tree cond; |
59b9dcbd | 3253 | tree cond2; |
3254 | tree tmp2; | |
3255 | tree tmp3; | |
3256 | tree tmp4; | |
b44437b9 | 3257 | tree chartype; |
59b9dcbd | 3258 | stmtblock_t tempblock; |
77100724 | 3259 | |
b44437b9 | 3260 | gcc_assert (dkind == skind); |
3261 | ||
891beb95 | 3262 | if (slength != NULL_TREE) |
3263 | { | |
3264 | slen = fold_convert (size_type_node, gfc_evaluate_now (slength, block)); | |
b44437b9 | 3265 | ssc = string_to_single_character (slen, src, skind); |
891beb95 | 3266 | } |
3267 | else | |
3268 | { | |
3269 | slen = build_int_cst (size_type_node, 1); | |
3270 | ssc = src; | |
3271 | } | |
3272 | ||
3273 | if (dlength != NULL_TREE) | |
3274 | { | |
3275 | dlen = fold_convert (size_type_node, gfc_evaluate_now (dlength, block)); | |
b44437b9 | 3276 | dsc = string_to_single_character (slen, dest, dkind); |
891beb95 | 3277 | } |
3278 | else | |
3279 | { | |
3280 | dlen = build_int_cst (size_type_node, 1); | |
3281 | dsc = dest; | |
3282 | } | |
3283 | ||
3284 | if (slength != NULL_TREE && POINTER_TYPE_P (TREE_TYPE (src))) | |
b44437b9 | 3285 | ssc = string_to_single_character (slen, src, skind); |
891beb95 | 3286 | if (dlength != NULL_TREE && POINTER_TYPE_P (TREE_TYPE (dest))) |
b44437b9 | 3287 | dsc = string_to_single_character (dlen, dest, dkind); |
891beb95 | 3288 | |
72038310 | 3289 | |
680e3123 | 3290 | /* Assign directly if the types are compatible. */ |
3291 | if (dsc != NULL_TREE && ssc != NULL_TREE | |
b44437b9 | 3292 | && TREE_TYPE (dsc) == TREE_TYPE (ssc)) |
77100724 | 3293 | { |
75a70cf9 | 3294 | gfc_add_modify (block, dsc, ssc); |
77100724 | 3295 | return; |
3296 | } | |
dbe60343 | 3297 | |
59b9dcbd | 3298 | /* Do nothing if the destination length is zero. */ |
2810b378 | 3299 | cond = fold_build2 (GT_EXPR, boolean_type_node, dlen, |
57e3c827 | 3300 | build_int_cst (size_type_node, 0)); |
2810b378 | 3301 | |
59b9dcbd | 3302 | /* The following code was previously in _gfortran_copy_string: |
3303 | ||
3304 | // The two strings may overlap so we use memmove. | |
3305 | void | |
3306 | copy_string (GFC_INTEGER_4 destlen, char * dest, | |
3307 | GFC_INTEGER_4 srclen, const char * src) | |
3308 | { | |
3309 | if (srclen >= destlen) | |
3310 | { | |
3311 | // This will truncate if too long. | |
3312 | memmove (dest, src, destlen); | |
3313 | } | |
3314 | else | |
3315 | { | |
3316 | memmove (dest, src, srclen); | |
3317 | // Pad with spaces. | |
3318 | memset (&dest[srclen], ' ', destlen - srclen); | |
3319 | } | |
3320 | } | |
3321 | ||
3322 | We're now doing it here for better optimization, but the logic | |
3323 | is the same. */ | |
ceeda734 | 3324 | |
b44437b9 | 3325 | /* For non-default character kinds, we have to multiply the string |
3326 | length by the base type size. */ | |
3327 | chartype = gfc_get_char_type (dkind); | |
abb1d33a | 3328 | slen = fold_build2 (MULT_EXPR, size_type_node, |
3329 | fold_convert (size_type_node, slen), | |
3330 | fold_convert (size_type_node, TYPE_SIZE_UNIT (chartype))); | |
3331 | dlen = fold_build2 (MULT_EXPR, size_type_node, | |
3332 | fold_convert (size_type_node, dlen), | |
3333 | fold_convert (size_type_node, TYPE_SIZE_UNIT (chartype))); | |
b44437b9 | 3334 | |
891beb95 | 3335 | if (dlength) |
3336 | dest = fold_convert (pvoid_type_node, dest); | |
3337 | else | |
3338 | dest = gfc_build_addr_expr (pvoid_type_node, dest); | |
3339 | ||
3340 | if (slength) | |
3341 | src = fold_convert (pvoid_type_node, src); | |
3342 | else | |
3343 | src = gfc_build_addr_expr (pvoid_type_node, src); | |
ceeda734 | 3344 | |
59b9dcbd | 3345 | /* Truncate string if source is too long. */ |
3346 | cond2 = fold_build2 (GE_EXPR, boolean_type_node, slen, dlen); | |
389dd41b | 3347 | tmp2 = build_call_expr_loc (input_location, |
3348 | built_in_decls[BUILT_IN_MEMMOVE], | |
c2f47e15 | 3349 | 3, dest, src, dlen); |
59b9dcbd | 3350 | |
3351 | /* Else copy and pad with spaces. */ | |
389dd41b | 3352 | tmp3 = build_call_expr_loc (input_location, |
3353 | built_in_decls[BUILT_IN_MEMMOVE], | |
c2f47e15 | 3354 | 3, dest, src, slen); |
59b9dcbd | 3355 | |
f6313358 | 3356 | tmp4 = fold_build2 (POINTER_PLUS_EXPR, TREE_TYPE (dest), dest, |
0de36bdb | 3357 | fold_convert (sizetype, slen)); |
b44437b9 | 3358 | tmp4 = fill_with_spaces (tmp4, chartype, |
3359 | fold_build2 (MINUS_EXPR, TREE_TYPE(dlen), | |
3360 | dlen, slen)); | |
59b9dcbd | 3361 | |
3362 | gfc_init_block (&tempblock); | |
3363 | gfc_add_expr_to_block (&tempblock, tmp3); | |
3364 | gfc_add_expr_to_block (&tempblock, tmp4); | |
3365 | tmp3 = gfc_finish_block (&tempblock); | |
3366 | ||
3367 | /* The whole copy_string function is there. */ | |
3368 | tmp = fold_build3 (COND_EXPR, void_type_node, cond2, tmp2, tmp3); | |
e60a6f7b | 3369 | tmp = fold_build3 (COND_EXPR, void_type_node, cond, tmp, |
3370 | build_empty_stmt (input_location)); | |
dbe60343 | 3371 | gfc_add_expr_to_block (block, tmp); |
3372 | } | |
3373 | ||
3374 | ||
4ee9c684 | 3375 | /* Translate a statement function. |
3376 | The value of a statement function reference is obtained by evaluating the | |
3377 | expression using the values of the actual arguments for the values of the | |
3378 | corresponding dummy arguments. */ | |
3379 | ||
3380 | static void | |
3381 | gfc_conv_statement_function (gfc_se * se, gfc_expr * expr) | |
3382 | { | |
3383 | gfc_symbol *sym; | |
3384 | gfc_symbol *fsym; | |
3385 | gfc_formal_arglist *fargs; | |
3386 | gfc_actual_arglist *args; | |
3387 | gfc_se lse; | |
3388 | gfc_se rse; | |
dbe60343 | 3389 | gfc_saved_var *saved_vars; |
3390 | tree *temp_vars; | |
3391 | tree type; | |
3392 | tree tmp; | |
3393 | int n; | |
4ee9c684 | 3394 | |
3395 | sym = expr->symtree->n.sym; | |
3396 | args = expr->value.function.actual; | |
3397 | gfc_init_se (&lse, NULL); | |
3398 | gfc_init_se (&rse, NULL); | |
3399 | ||
dbe60343 | 3400 | n = 0; |
4ee9c684 | 3401 | for (fargs = sym->formal; fargs; fargs = fargs->next) |
dbe60343 | 3402 | n++; |
3403 | saved_vars = (gfc_saved_var *)gfc_getmem (n * sizeof (gfc_saved_var)); | |
3404 | temp_vars = (tree *)gfc_getmem (n * sizeof (tree)); | |
3405 | ||
3406 | for (fargs = sym->formal, n = 0; fargs; fargs = fargs->next, n++) | |
4ee9c684 | 3407 | { |
3408 | /* Each dummy shall be specified, explicitly or implicitly, to be | |
3409 | scalar. */ | |
22d678e8 | 3410 | gcc_assert (fargs->sym->attr.dimension == 0); |
4ee9c684 | 3411 | fsym = fargs->sym; |
4ee9c684 | 3412 | |
dbe60343 | 3413 | /* Create a temporary to hold the value. */ |
3414 | type = gfc_typenode_for_spec (&fsym->ts); | |
3415 | temp_vars[n] = gfc_create_var (type, fsym->name); | |
3416 | ||
3417 | if (fsym->ts.type == BT_CHARACTER) | |
4ee9c684 | 3418 | { |
dbe60343 | 3419 | /* Copy string arguments. */ |
3420 | tree arglen; | |
4ee9c684 | 3421 | |
eeebe20b | 3422 | gcc_assert (fsym->ts.u.cl && fsym->ts.u.cl->length |
3423 | && fsym->ts.u.cl->length->expr_type == EXPR_CONSTANT); | |
4ee9c684 | 3424 | |
dbe60343 | 3425 | arglen = TYPE_MAX_VALUE (TYPE_DOMAIN (type)); |
3426 | tmp = gfc_build_addr_expr (build_pointer_type (type), | |
3427 | temp_vars[n]); | |
4ee9c684 | 3428 | |
3429 | gfc_conv_expr (&rse, args->expr); | |
3430 | gfc_conv_string_parameter (&rse); | |
4ee9c684 | 3431 | gfc_add_block_to_block (&se->pre, &lse.pre); |
3432 | gfc_add_block_to_block (&se->pre, &rse.pre); | |
3433 | ||
b44437b9 | 3434 | gfc_trans_string_copy (&se->pre, arglen, tmp, fsym->ts.kind, |
3435 | rse.string_length, rse.expr, fsym->ts.kind); | |
4ee9c684 | 3436 | gfc_add_block_to_block (&se->pre, &lse.post); |
3437 | gfc_add_block_to_block (&se->pre, &rse.post); | |
3438 | } | |
3439 | else | |
3440 | { | |
3441 | /* For everything else, just evaluate the expression. */ | |
4ee9c684 | 3442 | gfc_conv_expr (&lse, args->expr); |
3443 | ||
3444 | gfc_add_block_to_block (&se->pre, &lse.pre); | |
75a70cf9 | 3445 | gfc_add_modify (&se->pre, temp_vars[n], lse.expr); |
4ee9c684 | 3446 | gfc_add_block_to_block (&se->pre, &lse.post); |
3447 | } | |
dbe60343 | 3448 | |
4ee9c684 | 3449 | args = args->next; |
3450 | } | |
dbe60343 | 3451 | |
3452 | /* Use the temporary variables in place of the real ones. */ | |
3453 | for (fargs = sym->formal, n = 0; fargs; fargs = fargs->next, n++) | |
3454 | gfc_shadow_sym (fargs->sym, temp_vars[n], &saved_vars[n]); | |
3455 | ||
4ee9c684 | 3456 | gfc_conv_expr (se, sym->value); |
dbe60343 | 3457 | |
3458 | if (sym->ts.type == BT_CHARACTER) | |
3459 | { | |
eeebe20b | 3460 | gfc_conv_const_charlen (sym->ts.u.cl); |
dbe60343 | 3461 | |
3462 | /* Force the expression to the correct length. */ | |
3463 | if (!INTEGER_CST_P (se->string_length) | |
3464 | || tree_int_cst_lt (se->string_length, | |
eeebe20b | 3465 | sym->ts.u.cl->backend_decl)) |
dbe60343 | 3466 | { |
eeebe20b | 3467 | type = gfc_get_character_type (sym->ts.kind, sym->ts.u.cl); |
dbe60343 | 3468 | tmp = gfc_create_var (type, sym->name); |
3469 | tmp = gfc_build_addr_expr (build_pointer_type (type), tmp); | |
eeebe20b | 3470 | gfc_trans_string_copy (&se->pre, sym->ts.u.cl->backend_decl, tmp, |
b44437b9 | 3471 | sym->ts.kind, se->string_length, se->expr, |
3472 | sym->ts.kind); | |
dbe60343 | 3473 | se->expr = tmp; |
3474 | } | |
eeebe20b | 3475 | se->string_length = sym->ts.u.cl->backend_decl; |
dbe60343 | 3476 | } |
3477 | ||
f888a3fb | 3478 | /* Restore the original variables. */ |
dbe60343 | 3479 | for (fargs = sym->formal, n = 0; fargs; fargs = fargs->next, n++) |
3480 | gfc_restore_sym (fargs->sym, &saved_vars[n]); | |
3481 | gfc_free (saved_vars); | |
4ee9c684 | 3482 | } |
3483 | ||
3484 | ||
64e93293 | 3485 | /* Return the backend_decl for a procedure pointer component. */ |
3486 | ||
3487 | tree | |
3488 | gfc_get_proc_ptr_comp (gfc_se *se, gfc_expr *e) | |
3489 | { | |
3490 | gfc_se comp_se; | |
ff70e443 | 3491 | gfc_expr *e2; |
64e93293 | 3492 | gfc_init_se (&comp_se, NULL); |
ff70e443 | 3493 | e2 = gfc_copy_expr (e); |
3494 | e2->expr_type = EXPR_VARIABLE; | |
3495 | gfc_conv_expr (&comp_se, e2); | |
389dd41b | 3496 | comp_se.expr = build_fold_addr_expr_loc (input_location, comp_se.expr); |
64e93293 | 3497 | return gfc_evaluate_now (comp_se.expr, &se->pre); |
3498 | } | |
3499 | ||
3500 | ||
4ee9c684 | 3501 | /* Translate a function expression. */ |
3502 | ||
3503 | static void | |
3504 | gfc_conv_function_expr (gfc_se * se, gfc_expr * expr) | |
3505 | { | |
3506 | gfc_symbol *sym; | |
3507 | ||
3508 | if (expr->value.function.isym) | |
3509 | { | |
3510 | gfc_conv_intrinsic_function (se, expr); | |
3511 | return; | |
3512 | } | |
3513 | ||
f888a3fb | 3514 | /* We distinguish statement functions from general functions to improve |
4ee9c684 | 3515 | runtime performance. */ |
3516 | if (expr->symtree->n.sym->attr.proc == PROC_ST_FUNCTION) | |
3517 | { | |
3518 | gfc_conv_statement_function (se, expr); | |
3519 | return; | |
3520 | } | |
3521 | ||
3522 | /* expr.value.function.esym is the resolved (specific) function symbol for | |
3523 | most functions. However this isn't set for dummy procedures. */ | |
3524 | sym = expr->value.function.esym; | |
3525 | if (!sym) | |
3526 | sym = expr->symtree->n.sym; | |
64e93293 | 3527 | |
3528 | gfc_conv_procedure_call (se, sym, expr->value.function.actual, expr, | |
3529 | NULL_TREE); | |
4ee9c684 | 3530 | } |
3531 | ||
f888a3fb | 3532 | |
4ee9c684 | 3533 | static void |
3534 | gfc_conv_array_constructor_expr (gfc_se * se, gfc_expr * expr) | |
3535 | { | |
22d678e8 | 3536 | gcc_assert (se->ss != NULL && se->ss != gfc_ss_terminator); |
3537 | gcc_assert (se->ss->expr == expr && se->ss->type == GFC_SS_CONSTRUCTOR); | |
4ee9c684 | 3538 | |
3539 | gfc_conv_tmp_array_ref (se); | |
3540 | gfc_advance_se_ss_chain (se); | |
3541 | } | |
3542 | ||
3543 | ||
bda1f152 | 3544 | /* Build a static initializer. EXPR is the expression for the initial value. |
f888a3fb | 3545 | The other parameters describe the variable of the component being |
3546 | initialized. EXPR may be null. */ | |
4ee9c684 | 3547 | |
bda1f152 | 3548 | tree |
3549 | gfc_conv_initializer (gfc_expr * expr, gfc_typespec * ts, tree type, | |
3550 | bool array, bool pointer) | |
3551 | { | |
3552 | gfc_se se; | |
3553 | ||
3554 | if (!(expr || pointer)) | |
3555 | return NULL_TREE; | |
3556 | ||
cf65c534 | 3557 | /* Check if we have ISOCBINDING_NULL_PTR or ISOCBINDING_NULL_FUNPTR |
3558 | (these are the only two iso_c_binding derived types that can be | |
3559 | used as initialization expressions). If so, we need to modify | |
3560 | the 'expr' to be that for a (void *). */ | |
3e77b51f | 3561 | if (expr != NULL && expr->ts.type == BT_DERIVED |
eeebe20b | 3562 | && expr->ts.is_iso_c && expr->ts.u.derived) |
cf65c534 | 3563 | { |
eeebe20b | 3564 | gfc_symbol *derived = expr->ts.u.derived; |
cf65c534 | 3565 | |
c5d33754 | 3566 | expr = gfc_int_expr (0); |
cf65c534 | 3567 | |
3568 | /* The derived symbol has already been converted to a (void *). Use | |
3569 | its kind. */ | |
3570 | expr->ts.f90_type = derived->ts.f90_type; | |
3571 | expr->ts.kind = derived->ts.kind; | |
3572 | } | |
c5d33754 | 3573 | |
bda1f152 | 3574 | if (array) |
3575 | { | |
3576 | /* Arrays need special handling. */ | |
3577 | if (pointer) | |
3578 | return gfc_build_null_descriptor (type); | |
3579 | else | |
3580 | return gfc_conv_array_initializer (type, expr); | |
3581 | } | |
3582 | else if (pointer) | |
3583 | return fold_convert (type, null_pointer_node); | |
3584 | else | |
3585 | { | |
3586 | switch (ts->type) | |
3587 | { | |
3588 | case BT_DERIVED: | |
3589 | gfc_init_se (&se, NULL); | |
3590 | gfc_conv_structure (&se, expr, 1); | |
3591 | return se.expr; | |
3592 | ||
3593 | case BT_CHARACTER: | |
eeebe20b | 3594 | return gfc_conv_string_init (ts->u.cl->backend_decl,expr); |
bda1f152 | 3595 | |
3596 | default: | |
3597 | gfc_init_se (&se, NULL); | |
3598 | gfc_conv_constant (&se, expr); | |
3599 | return se.expr; | |
3600 | } | |
3601 | } | |
3602 | } | |
3603 | ||
9a0aec1d | 3604 | static tree |
3605 | gfc_trans_subarray_assign (tree dest, gfc_component * cm, gfc_expr * expr) | |
3606 | { | |
3607 | gfc_se rse; | |
3608 | gfc_se lse; | |
3609 | gfc_ss *rss; | |
3610 | gfc_ss *lss; | |
3611 | stmtblock_t body; | |
3612 | stmtblock_t block; | |
3613 | gfc_loopinfo loop; | |
3614 | int n; | |
3615 | tree tmp; | |
3616 | ||
3617 | gfc_start_block (&block); | |
3618 | ||
3619 | /* Initialize the scalarizer. */ | |
3620 | gfc_init_loopinfo (&loop); | |
3621 | ||
3622 | gfc_init_se (&lse, NULL); | |
3623 | gfc_init_se (&rse, NULL); | |
3624 | ||
3625 | /* Walk the rhs. */ | |
3626 | rss = gfc_walk_expr (expr); | |
3627 | if (rss == gfc_ss_terminator) | |
3628 | { | |
3629 | /* The rhs is scalar. Add a ss for the expression. */ | |
3630 | rss = gfc_get_ss (); | |
3631 | rss->next = gfc_ss_terminator; | |
3632 | rss->type = GFC_SS_SCALAR; | |
3633 | rss->expr = expr; | |
3634 | } | |
3635 | ||
3636 | /* Create a SS for the destination. */ | |
3637 | lss = gfc_get_ss (); | |
3638 | lss->type = GFC_SS_COMPONENT; | |
3639 | lss->expr = NULL; | |
3640 | lss->shape = gfc_get_shape (cm->as->rank); | |
3641 | lss->next = gfc_ss_terminator; | |
3642 | lss->data.info.dimen = cm->as->rank; | |
3643 | lss->data.info.descriptor = dest; | |
3644 | lss->data.info.data = gfc_conv_array_data (dest); | |
3645 | lss->data.info.offset = gfc_conv_array_offset (dest); | |
3646 | for (n = 0; n < cm->as->rank; n++) | |
3647 | { | |
3648 | lss->data.info.dim[n] = n; | |
3649 | lss->data.info.start[n] = gfc_conv_array_lbound (dest, n); | |
3650 | lss->data.info.stride[n] = gfc_index_one_node; | |
3651 | ||
3652 | mpz_init (lss->shape[n]); | |
3653 | mpz_sub (lss->shape[n], cm->as->upper[n]->value.integer, | |
3654 | cm->as->lower[n]->value.integer); | |
3655 | mpz_add_ui (lss->shape[n], lss->shape[n], 1); | |
3656 | } | |
3657 | ||
3658 | /* Associate the SS with the loop. */ | |
3659 | gfc_add_ss_to_loop (&loop, lss); | |
3660 | gfc_add_ss_to_loop (&loop, rss); | |
3661 | ||
3662 | /* Calculate the bounds of the scalarization. */ | |
3663 | gfc_conv_ss_startstride (&loop); | |
3664 | ||
3665 | /* Setup the scalarizing loops. */ | |
92f4d1c4 | 3666 | gfc_conv_loop_setup (&loop, &expr->where); |
9a0aec1d | 3667 | |
3668 | /* Setup the gfc_se structures. */ | |
3669 | gfc_copy_loopinfo_to_se (&lse, &loop); | |
3670 | gfc_copy_loopinfo_to_se (&rse, &loop); | |
3671 | ||
3672 | rse.ss = rss; | |
3673 | gfc_mark_ss_chain_used (rss, 1); | |
3674 | lse.ss = lss; | |
3675 | gfc_mark_ss_chain_used (lss, 1); | |
3676 | ||
3677 | /* Start the scalarized loop body. */ | |
3678 | gfc_start_scalarized_body (&loop, &body); | |
3679 | ||
3680 | gfc_conv_tmp_array_ref (&lse); | |
dc5fe211 | 3681 | if (cm->ts.type == BT_CHARACTER) |
eeebe20b | 3682 | lse.string_length = cm->ts.u.cl->backend_decl; |
dc5fe211 | 3683 | |
9a0aec1d | 3684 | gfc_conv_expr (&rse, expr); |
3685 | ||
2294b616 | 3686 | tmp = gfc_trans_scalar_assign (&lse, &rse, cm->ts, true, false); |
9a0aec1d | 3687 | gfc_add_expr_to_block (&body, tmp); |
3688 | ||
22d678e8 | 3689 | gcc_assert (rse.ss == gfc_ss_terminator); |
9a0aec1d | 3690 | |
3691 | /* Generate the copying loops. */ | |
3692 | gfc_trans_scalarizing_loops (&loop, &body); | |
3693 | ||
3694 | /* Wrap the whole thing up. */ | |
3695 | gfc_add_block_to_block (&block, &loop.pre); | |
3696 | gfc_add_block_to_block (&block, &loop.post); | |
3697 | ||
9a0aec1d | 3698 | for (n = 0; n < cm->as->rank; n++) |
3699 | mpz_clear (lss->shape[n]); | |
3700 | gfc_free (lss->shape); | |
3701 | ||
6cf06ccd | 3702 | gfc_cleanup_loop (&loop); |
3703 | ||
9a0aec1d | 3704 | return gfc_finish_block (&block); |
3705 | } | |
3706 | ||
2294b616 | 3707 | |
9a0aec1d | 3708 | /* Assign a single component of a derived type constructor. */ |
3709 | ||
3710 | static tree | |
3711 | gfc_trans_subcomponent_assign (tree dest, gfc_component * cm, gfc_expr * expr) | |
3712 | { | |
3713 | gfc_se se; | |
2294b616 | 3714 | gfc_se lse; |
9a0aec1d | 3715 | gfc_ss *rss; |
3716 | stmtblock_t block; | |
3717 | tree tmp; | |
2294b616 | 3718 | tree offset; |
3719 | int n; | |
9a0aec1d | 3720 | |
3721 | gfc_start_block (&block); | |
2294b616 | 3722 | |
3be2b8d5 | 3723 | if (cm->attr.pointer) |
9a0aec1d | 3724 | { |
3725 | gfc_init_se (&se, NULL); | |
3726 | /* Pointer component. */ | |
3be2b8d5 | 3727 | if (cm->attr.dimension) |
9a0aec1d | 3728 | { |
3729 | /* Array pointer. */ | |
3730 | if (expr->expr_type == EXPR_NULL) | |
94be45c9 | 3731 | gfc_conv_descriptor_data_set (&block, dest, null_pointer_node); |
9a0aec1d | 3732 | else |
3733 | { | |
3734 | rss = gfc_walk_expr (expr); | |
3735 | se.direct_byref = 1; | |
3736 | se.expr = dest; | |
3737 | gfc_conv_expr_descriptor (&se, expr, rss); | |
3738 | gfc_add_block_to_block (&block, &se.pre); | |
3739 | gfc_add_block_to_block (&block, &se.post); | |
3740 | } | |
3741 | } | |
3742 | else | |
3743 | { | |
3744 | /* Scalar pointers. */ | |
3745 | se.want_pointer = 1; | |
3746 | gfc_conv_expr (&se, expr); | |
3747 | gfc_add_block_to_block (&block, &se.pre); | |
75a70cf9 | 3748 | gfc_add_modify (&block, dest, |
9a0aec1d | 3749 | fold_convert (TREE_TYPE (dest), se.expr)); |
3750 | gfc_add_block_to_block (&block, &se.post); | |
3751 | } | |
3752 | } | |
3be2b8d5 | 3753 | else if (cm->attr.dimension) |
9a0aec1d | 3754 | { |
3be2b8d5 | 3755 | if (cm->attr.allocatable && expr->expr_type == EXPR_NULL) |
2294b616 | 3756 | gfc_conv_descriptor_data_set (&block, dest, null_pointer_node); |
3be2b8d5 | 3757 | else if (cm->attr.allocatable) |
6826be54 | 3758 | { |
3759 | tree tmp2; | |
2294b616 | 3760 | |
3761 | gfc_init_se (&se, NULL); | |
3762 | ||
3763 | rss = gfc_walk_expr (expr); | |
6826be54 | 3764 | se.want_pointer = 0; |
3765 | gfc_conv_expr_descriptor (&se, expr, rss); | |
2294b616 | 3766 | gfc_add_block_to_block (&block, &se.pre); |
bb982f66 | 3767 | gfc_add_modify (&block, dest, se.expr); |
2294b616 | 3768 | |
eeebe20b | 3769 | if (cm->ts.type == BT_DERIVED && cm->ts.u.derived->attr.alloc_comp) |
3770 | tmp = gfc_copy_alloc_comp (cm->ts.u.derived, se.expr, dest, | |
2294b616 | 3771 | cm->as->rank); |
3772 | else | |
6826be54 | 3773 | tmp = gfc_duplicate_allocatable (dest, se.expr, |
2294b616 | 3774 | TREE_TYPE(cm->backend_decl), |
3775 | cm->as->rank); | |
3776 | ||
6826be54 | 3777 | gfc_add_expr_to_block (&block, tmp); |
6826be54 | 3778 | gfc_add_block_to_block (&block, &se.post); |
8714fc76 | 3779 | |
3780 | if (expr->expr_type != EXPR_VARIABLE) | |
3781 | gfc_conv_descriptor_data_set (&block, se.expr, null_pointer_node); | |
6826be54 | 3782 | |
3783 | /* Shift the lbound and ubound of temporaries to being unity, rather | |
3784 | than zero, based. Calculate the offset for all cases. */ | |
6b1a9af3 | 3785 | offset = gfc_conv_descriptor_offset_get (dest); |
75a70cf9 | 3786 | gfc_add_modify (&block, offset, gfc_index_zero_node); |
6826be54 | 3787 | tmp2 =gfc_create_var (gfc_array_index_type, NULL); |
3788 | for (n = 0; n < expr->rank; n++) | |
3789 | { | |
3790 | if (expr->expr_type != EXPR_VARIABLE | |
3791 | && expr->expr_type != EXPR_CONSTANT) | |
3792 | { | |
3793 | tree span; | |
6b1a9af3 | 3794 | tmp = gfc_conv_descriptor_ubound_get (dest, gfc_rank_cst[n]); |
6826be54 | 3795 | span = fold_build2 (MINUS_EXPR, gfc_array_index_type, tmp, |
6b1a9af3 | 3796 | gfc_conv_descriptor_lbound_get (dest, gfc_rank_cst[n])); |
3797 | tmp = fold_build2 (PLUS_EXPR, gfc_array_index_type, | |
3798 | span, gfc_index_one_node); | |
3799 | gfc_conv_descriptor_ubound_set (&block, dest, gfc_rank_cst[n], | |
3800 | tmp); | |
3801 | gfc_conv_descriptor_lbound_set (&block, dest, gfc_rank_cst[n], | |
3802 | gfc_index_one_node); | |
6826be54 | 3803 | } |
3804 | tmp = fold_build2 (MULT_EXPR, gfc_array_index_type, | |
6b1a9af3 | 3805 | gfc_conv_descriptor_lbound_get (dest, |
2294b616 | 3806 | gfc_rank_cst[n]), |
6b1a9af3 | 3807 | gfc_conv_descriptor_stride_get (dest, |
2294b616 | 3808 | gfc_rank_cst[n])); |
75a70cf9 | 3809 | gfc_add_modify (&block, tmp2, tmp); |
6826be54 | 3810 | tmp = fold_build2 (MINUS_EXPR, gfc_array_index_type, offset, tmp2); |
6b1a9af3 | 3811 | gfc_conv_descriptor_offset_set (&block, dest, tmp); |
6826be54 | 3812 | } |
8714fc76 | 3813 | |
3814 | if (expr->expr_type == EXPR_FUNCTION | |
3815 | && expr->value.function.isym | |
3816 | && expr->value.function.isym->conversion | |
3817 | && expr->value.function.actual->expr | |
3818 | && expr->value.function.actual->expr->expr_type | |
3819 | == EXPR_VARIABLE) | |
3820 | { | |
3821 | /* If a conversion expression has a null data pointer | |
3822 | argument, nullify the allocatable component. */ | |
3823 | gfc_symbol *s; | |
3824 | tree non_null_expr; | |
3825 | tree null_expr; | |
3826 | s = expr->value.function.actual->expr->symtree->n.sym; | |
3827 | if (s->attr.allocatable || s->attr.pointer) | |
3828 | { | |
3829 | non_null_expr = gfc_finish_block (&block); | |
3830 | gfc_start_block (&block); | |
3831 | gfc_conv_descriptor_data_set (&block, dest, | |
3832 | null_pointer_node); | |
3833 | null_expr = gfc_finish_block (&block); | |
3834 | tmp = gfc_conv_descriptor_data_get (s->backend_decl); | |
3835 | tmp = build2 (EQ_EXPR, boolean_type_node, tmp, | |
3836 | fold_convert (TREE_TYPE (tmp), | |
3837 | null_pointer_node)); | |
3838 | return build3_v (COND_EXPR, tmp, null_expr, | |
3839 | non_null_expr); | |
3840 | } | |
3841 | } | |
6826be54 | 3842 | } |
2294b616 | 3843 | else |
6826be54 | 3844 | { |
2294b616 | 3845 | tmp = gfc_trans_subarray_assign (dest, cm, expr); |
3846 | gfc_add_expr_to_block (&block, tmp); | |
6826be54 | 3847 | } |
9a0aec1d | 3848 | } |
3849 | else if (expr->ts.type == BT_DERIVED) | |
3850 | { | |
d95efb59 | 3851 | if (expr->expr_type != EXPR_STRUCTURE) |
3852 | { | |
3853 | gfc_init_se (&se, NULL); | |
3854 | gfc_conv_expr (&se, expr); | |
0029c45c | 3855 | gfc_add_block_to_block (&block, &se.pre); |
75a70cf9 | 3856 | gfc_add_modify (&block, dest, |
d95efb59 | 3857 | fold_convert (TREE_TYPE (dest), se.expr)); |
0029c45c | 3858 | gfc_add_block_to_block (&block, &se.post); |
d95efb59 | 3859 | } |
3860 | else | |
3861 | { | |
3862 | /* Nested constructors. */ | |
3863 | tmp = gfc_trans_structure_assign (dest, expr); | |
3864 | gfc_add_expr_to_block (&block, tmp); | |
3865 | } | |
9a0aec1d | 3866 | } |
3867 | else | |
3868 | { | |
3869 | /* Scalar component. */ | |
9a0aec1d | 3870 | gfc_init_se (&se, NULL); |
3871 | gfc_init_se (&lse, NULL); | |
3872 | ||
3873 | gfc_conv_expr (&se, expr); | |
3874 | if (cm->ts.type == BT_CHARACTER) | |
eeebe20b | 3875 | lse.string_length = cm->ts.u.cl->backend_decl; |
9a0aec1d | 3876 | lse.expr = dest; |
2294b616 | 3877 | tmp = gfc_trans_scalar_assign (&lse, &se, cm->ts, true, false); |
9a0aec1d | 3878 | gfc_add_expr_to_block (&block, tmp); |
3879 | } | |
3880 | return gfc_finish_block (&block); | |
3881 | } | |
3882 | ||
39fca56b | 3883 | /* Assign a derived type constructor to a variable. */ |
9a0aec1d | 3884 | |
3885 | static tree | |
3886 | gfc_trans_structure_assign (tree dest, gfc_expr * expr) | |
3887 | { | |
3888 | gfc_constructor *c; | |
3889 | gfc_component *cm; | |
3890 | stmtblock_t block; | |
3891 | tree field; | |
3892 | tree tmp; | |
3893 | ||
3894 | gfc_start_block (&block); | |
eeebe20b | 3895 | cm = expr->ts.u.derived->components; |
9a0aec1d | 3896 | for (c = expr->value.constructor; c; c = c->next, cm = cm->next) |
3897 | { | |
3898 | /* Skip absent members in default initializers. */ | |
3899 | if (!c->expr) | |
0029c45c | 3900 | continue; |
3901 | ||
9a0aec1d | 3902 | field = cm->backend_decl; |
f75d6b8a | 3903 | tmp = fold_build3 (COMPONENT_REF, TREE_TYPE (field), |
3904 | dest, field, NULL_TREE); | |
9a0aec1d | 3905 | tmp = gfc_trans_subcomponent_assign (tmp, cm, c->expr); |
3906 | gfc_add_expr_to_block (&block, tmp); | |
3907 | } | |
3908 | return gfc_finish_block (&block); | |
3909 | } | |
3910 | ||
4ee9c684 | 3911 | /* Build an expression for a constructor. If init is nonzero then |
3912 | this is part of a static variable initializer. */ | |
3913 | ||
3914 | void | |
3915 | gfc_conv_structure (gfc_se * se, gfc_expr * expr, int init) | |
3916 | { | |
3917 | gfc_constructor *c; | |
3918 | gfc_component *cm; | |
4ee9c684 | 3919 | tree val; |
4ee9c684 | 3920 | tree type; |
9a0aec1d | 3921 | tree tmp; |
c75b4594 | 3922 | VEC(constructor_elt,gc) *v = NULL; |
4ee9c684 | 3923 | |
22d678e8 | 3924 | gcc_assert (se->ss == NULL); |
3925 | gcc_assert (expr->expr_type == EXPR_STRUCTURE); | |
4ee9c684 | 3926 | type = gfc_typenode_for_spec (&expr->ts); |
9a0aec1d | 3927 | |
3928 | if (!init) | |
3929 | { | |
3930 | /* Create a temporary variable and fill it in. */ | |
eeebe20b | 3931 | se->expr = gfc_create_var (type, expr->ts.u.derived->name); |
9a0aec1d | 3932 | tmp = gfc_trans_structure_assign (se->expr, expr); |
3933 | gfc_add_expr_to_block (&se->pre, tmp); | |
3934 | return; | |
3935 | } | |
3936 | ||
eeebe20b | 3937 | cm = expr->ts.u.derived->components; |
2294b616 | 3938 | |
4ee9c684 | 3939 | for (c = expr->value.constructor; c; c = c->next, cm = cm->next) |
3940 | { | |
2294b616 | 3941 | /* Skip absent members in default initializers and allocatable |
3942 | components. Although the latter have a default initializer | |
3943 | of EXPR_NULL,... by default, the static nullify is not needed | |
3944 | since this is done every time we come into scope. */ | |
3be2b8d5 | 3945 | if (!c->expr || cm->attr.allocatable) |
4ee9c684 | 3946 | continue; |
3947 | ||
9a0aec1d | 3948 | val = gfc_conv_initializer (c->expr, &cm->ts, |
64e93293 | 3949 | TREE_TYPE (cm->backend_decl), cm->attr.dimension, |
3950 | cm->attr.pointer || cm->attr.proc_pointer); | |
4ee9c684 | 3951 | |
c75b4594 | 3952 | /* Append it to the constructor list. */ |
3953 | CONSTRUCTOR_APPEND_ELT (v, cm->backend_decl, val); | |
4ee9c684 | 3954 | } |
c75b4594 | 3955 | se->expr = build_constructor (type, v); |
8b8484b4 | 3956 | if (init) |
c7d4e749 | 3957 | TREE_CONSTANT (se->expr) = 1; |
4ee9c684 | 3958 | } |
3959 | ||
3960 | ||
f888a3fb | 3961 | /* Translate a substring expression. */ |
4ee9c684 | 3962 | |
3963 | static void | |
3964 | gfc_conv_substring_expr (gfc_se * se, gfc_expr * expr) | |
3965 | { | |
3966 | gfc_ref *ref; | |
3967 | ||
3968 | ref = expr->ref; | |
3969 | ||
24756408 | 3970 | gcc_assert (ref == NULL || ref->type == REF_SUBSTRING); |
4ee9c684 | 3971 | |
b44437b9 | 3972 | se->expr = gfc_build_wide_string_const (expr->ts.kind, |
3973 | expr->value.character.length, | |
3974 | expr->value.character.string); | |
c32f863c | 3975 | |
4ee9c684 | 3976 | se->string_length = TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (se->expr))); |
24756408 | 3977 | TYPE_STRING_FLAG (TREE_TYPE (se->expr)) = 1; |
4ee9c684 | 3978 | |
24756408 | 3979 | if (ref) |
3980 | gfc_conv_substring (se, ref, expr->ts.kind, NULL, &expr->where); | |
4ee9c684 | 3981 | } |
3982 | ||
3983 | ||
7b7afa03 | 3984 | /* Entry point for expression translation. Evaluates a scalar quantity. |
3985 | EXPR is the expression to be translated, and SE is the state structure if | |
3986 | called from within the scalarized. */ | |
4ee9c684 | 3987 | |
3988 | void | |
3989 | gfc_conv_expr (gfc_se * se, gfc_expr * expr) | |
3990 | { | |
3991 | if (se->ss && se->ss->expr == expr | |
3992 | && (se->ss->type == GFC_SS_SCALAR || se->ss->type == GFC_SS_REFERENCE)) | |
3993 | { | |
9a0aec1d | 3994 | /* Substitute a scalar expression evaluated outside the scalarization |
4ee9c684 | 3995 | loop. */ |
3996 | se->expr = se->ss->data.scalar.expr; | |
7949cb07 | 3997 | se->string_length = se->ss->string_length; |
4ee9c684 | 3998 | gfc_advance_se_ss_chain (se); |
3999 | return; | |
4000 | } | |
4001 | ||
c5d33754 | 4002 | /* We need to convert the expressions for the iso_c_binding derived types. |
4003 | C_NULL_PTR and C_NULL_FUNPTR will be made EXPR_NULL, which evaluates to | |
4004 | null_pointer_node. C_PTR and C_FUNPTR are converted to match the | |
4005 | typespec for the C_PTR and C_FUNPTR symbols, which has already been | |
4006 | updated to be an integer with a kind equal to the size of a (void *). */ | |
eeebe20b | 4007 | if (expr->ts.type == BT_DERIVED && expr->ts.u.derived |
4008 | && expr->ts.u.derived->attr.is_iso_c) | |
c5d33754 | 4009 | { |
4010 | if (expr->symtree->n.sym->intmod_sym_id == ISOCBINDING_NULL_PTR | |
4011 | || expr->symtree->n.sym->intmod_sym_id == ISOCBINDING_NULL_FUNPTR) | |
4012 | { | |
4013 | /* Set expr_type to EXPR_NULL, which will result in | |
4014 | null_pointer_node being used below. */ | |
4015 | expr->expr_type = EXPR_NULL; | |
4016 | } | |
4017 | else | |
4018 | { | |
4019 | /* Update the type/kind of the expression to be what the new | |
4020 | type/kind are for the updated symbols of C_PTR/C_FUNPTR. */ | |
eeebe20b | 4021 | expr->ts.type = expr->ts.u.derived->ts.type; |
4022 | expr->ts.f90_type = expr->ts.u.derived->ts.f90_type; | |
4023 | expr->ts.kind = expr->ts.u.derived->ts.kind; | |
c5d33754 | 4024 | } |
4025 | } | |
4026 | ||
4ee9c684 | 4027 | switch (expr->expr_type) |
4028 | { | |
4029 | case EXPR_OP: | |
4030 | gfc_conv_expr_op (se, expr); | |
4031 | break; | |
4032 | ||
4033 | case EXPR_FUNCTION: | |
4034 | gfc_conv_function_expr (se, expr); | |
4035 | break; | |
4036 | ||
4037 | case EXPR_CONSTANT: | |
4038 | gfc_conv_constant (se, expr); | |
4039 | break; | |
4040 | ||
4041 | case EXPR_VARIABLE: | |
4042 | gfc_conv_variable (se, expr); | |
4043 | break; | |
4044 | ||
4045 | case EXPR_NULL: | |
4046 | se->expr = null_pointer_node; | |
4047 | break; | |
4048 | ||
4049 | case EXPR_SUBSTRING: | |
4050 | gfc_conv_substring_expr (se, expr); | |
4051 | break; | |
4052 | ||
4053 | case EXPR_STRUCTURE: | |
4054 | gfc_conv_structure (se, expr, 0); | |
4055 | break; | |
4056 | ||
4057 | case EXPR_ARRAY: | |
4058 | gfc_conv_array_constructor_expr (se, expr); | |
4059 | break; | |
4060 | ||
4061 | default: | |
22d678e8 | 4062 | gcc_unreachable (); |
4ee9c684 | 4063 | break; |
4064 | } | |
4065 | } | |
4066 | ||
7b7afa03 | 4067 | /* Like gfc_conv_expr_val, but the value is also suitable for use in the lhs |
4068 | of an assignment. */ | |
4ee9c684 | 4069 | void |
4070 | gfc_conv_expr_lhs (gfc_se * se, gfc_expr * expr) | |
4071 | { | |
4072 | gfc_conv_expr (se, expr); | |
7b7afa03 | 4073 | /* All numeric lvalues should have empty post chains. If not we need to |
4ee9c684 | 4074 | figure out a way of rewriting an lvalue so that it has no post chain. */ |
7b7afa03 | 4075 | gcc_assert (expr->ts.type == BT_CHARACTER || !se->post.head); |
4ee9c684 | 4076 | } |
4077 | ||
7b7afa03 | 4078 | /* Like gfc_conv_expr, but the POST block is guaranteed to be empty for |
d4163395 | 4079 | numeric expressions. Used for scalar values where inserting cleanup code |
7b7afa03 | 4080 | is inconvenient. */ |
4ee9c684 | 4081 | void |
4082 | gfc_conv_expr_val (gfc_se * se, gfc_expr * expr) | |
4083 | { | |
4084 | tree val; | |
4085 | ||
22d678e8 | 4086 | gcc_assert (expr->ts.type != BT_CHARACTER); |
4ee9c684 | 4087 | gfc_conv_expr (se, expr); |
4088 | if (se->post.head) | |
4089 | { | |
4090 | val = gfc_create_var (TREE_TYPE (se->expr), NULL); | |
75a70cf9 | 4091 | gfc_add_modify (&se->pre, val, se->expr); |
7b7afa03 | 4092 | se->expr = val; |
4093 | gfc_add_block_to_block (&se->pre, &se->post); | |
4ee9c684 | 4094 | } |
4095 | } | |
4096 | ||
24146844 | 4097 | /* Helper to translate an expression and convert it to a particular type. */ |
4ee9c684 | 4098 | void |
4099 | gfc_conv_expr_type (gfc_se * se, gfc_expr * expr, tree type) | |
4100 | { | |
4101 | gfc_conv_expr_val (se, expr); | |
4102 | se->expr = convert (type, se->expr); | |
4103 | } | |
4104 | ||
4105 | ||
f888a3fb | 4106 | /* Converts an expression so that it can be passed by reference. Scalar |
4ee9c684 | 4107 | values only. */ |
4108 | ||
4109 | void | |
4110 | gfc_conv_expr_reference (gfc_se * se, gfc_expr * expr) | |
4111 | { | |
4112 | tree var; | |
4113 | ||
4114 | if (se->ss && se->ss->expr == expr | |
4115 | && se->ss->type == GFC_SS_REFERENCE) | |
4116 | { | |
4117 | se->expr = se->ss->data.scalar.expr; | |
7949cb07 | 4118 | se->string_length = se->ss->string_length; |
4ee9c684 | 4119 | gfc_advance_se_ss_chain (se); |
4120 | return; | |
4121 | } | |
4122 | ||
4123 | if (expr->ts.type == BT_CHARACTER) | |
4124 | { | |
4125 | gfc_conv_expr (se, expr); | |
4126 | gfc_conv_string_parameter (se); | |
4127 | return; | |
4128 | } | |
4129 | ||
4130 | if (expr->expr_type == EXPR_VARIABLE) | |
4131 | { | |
4132 | se->want_pointer = 1; | |
4133 | gfc_conv_expr (se, expr); | |
4134 | if (se->post.head) | |
4135 | { | |
4136 | var = gfc_create_var (TREE_TYPE (se->expr), NULL); | |
75a70cf9 | 4137 | gfc_add_modify (&se->pre, var, se->expr); |
4ee9c684 | 4138 | gfc_add_block_to_block (&se->pre, &se->post); |
4139 | se->expr = var; | |
4140 | } | |
4141 | return; | |
4142 | } | |
4143 | ||
4047f0ad | 4144 | if (expr->expr_type == EXPR_FUNCTION |
4145 | && expr->symtree->n.sym->attr.pointer | |
4146 | && !expr->symtree->n.sym->attr.dimension) | |
4147 | { | |
4148 | se->want_pointer = 1; | |
4149 | gfc_conv_expr (se, expr); | |
4150 | var = gfc_create_var (TREE_TYPE (se->expr), NULL); | |
75a70cf9 | 4151 | gfc_add_modify (&se->pre, var, se->expr); |
4047f0ad | 4152 | se->expr = var; |
4153 | return; | |
4154 | } | |
4155 | ||
4156 | ||
4ee9c684 | 4157 | gfc_conv_expr (se, expr); |
4158 | ||
4159 | /* Create a temporary var to hold the value. */ | |
e67e5e1f | 4160 | if (TREE_CONSTANT (se->expr)) |
4161 | { | |
0f9dc66f | 4162 | tree tmp = se->expr; |
4163 | STRIP_TYPE_NOPS (tmp); | |
e60a6f7b | 4164 | var = build_decl (input_location, |
4165 | CONST_DECL, NULL, TREE_TYPE (tmp)); | |
0f9dc66f | 4166 | DECL_INITIAL (var) = tmp; |
f79c8ea7 | 4167 | TREE_STATIC (var) = 1; |
e67e5e1f | 4168 | pushdecl (var); |
4169 | } | |
4170 | else | |
4171 | { | |
4172 | var = gfc_create_var (TREE_TYPE (se->expr), NULL); | |
75a70cf9 | 4173 | gfc_add_modify (&se->pre, var, se->expr); |
e67e5e1f | 4174 | } |
4ee9c684 | 4175 | gfc_add_block_to_block (&se->pre, &se->post); |
4176 | ||
4177 | /* Take the address of that value. */ | |
86f2ad37 | 4178 | se->expr = gfc_build_addr_expr (NULL_TREE, var); |
4ee9c684 | 4179 | } |
4180 | ||
4181 | ||
4182 | tree | |
4183 | gfc_trans_pointer_assign (gfc_code * code) | |
4184 | { | |
578d3f19 | 4185 | return gfc_trans_pointer_assignment (code->expr1, code->expr2); |
4ee9c684 | 4186 | } |
4187 | ||
4188 | ||
4396343e | 4189 | /* Generate code for a pointer assignment. */ |
4190 | ||
4ee9c684 | 4191 | tree |
4192 | gfc_trans_pointer_assignment (gfc_expr * expr1, gfc_expr * expr2) | |
4193 | { | |
4194 | gfc_se lse; | |
4195 | gfc_se rse; | |
4196 | gfc_ss *lss; | |
4197 | gfc_ss *rss; | |
4198 | stmtblock_t block; | |
7853829d | 4199 | tree desc; |
4200 | tree tmp; | |
1033248c | 4201 | tree decl; |
4202 | ||
4ee9c684 | 4203 | gfc_start_block (&block); |
4204 | ||
4205 | gfc_init_se (&lse, NULL); | |
4206 | ||
4207 | lss = gfc_walk_expr (expr1); | |
4208 | rss = gfc_walk_expr (expr2); | |
4209 | if (lss == gfc_ss_terminator) | |
4210 | { | |
4396343e | 4211 | /* Scalar pointers. */ |
4ee9c684 | 4212 | lse.want_pointer = 1; |
4213 | gfc_conv_expr (&lse, expr1); | |
22d678e8 | 4214 | gcc_assert (rss == gfc_ss_terminator); |
4ee9c684 | 4215 | gfc_init_se (&rse, NULL); |
4216 | rse.want_pointer = 1; | |
4217 | gfc_conv_expr (&rse, expr2); | |
cad0ddcf | 4218 | |
4219 | if (expr1->symtree->n.sym->attr.proc_pointer | |
4220 | && expr1->symtree->n.sym->attr.dummy) | |
389dd41b | 4221 | lse.expr = build_fold_indirect_ref_loc (input_location, |
4222 | lse.expr); | |
cad0ddcf | 4223 | |
85d1c108 | 4224 | if (expr2->symtree && expr2->symtree->n.sym->attr.proc_pointer |
4225 | && expr2->symtree->n.sym->attr.dummy) | |
389dd41b | 4226 | rse.expr = build_fold_indirect_ref_loc (input_location, |
4227 | rse.expr); | |
85d1c108 | 4228 | |
4ee9c684 | 4229 | gfc_add_block_to_block (&block, &lse.pre); |
4230 | gfc_add_block_to_block (&block, &rse.pre); | |
9c5786bd | 4231 | |
4232 | /* Check character lengths if character expression. The test is only | |
4233 | really added if -fbounds-check is enabled. */ | |
4234 | if (expr1->ts.type == BT_CHARACTER && expr2->expr_type != EXPR_NULL) | |
4235 | { | |
4236 | gcc_assert (expr2->ts.type == BT_CHARACTER); | |
4237 | gcc_assert (lse.string_length && rse.string_length); | |
4238 | gfc_trans_same_strlen_check ("pointer assignment", &expr1->where, | |
4239 | lse.string_length, rse.string_length, | |
4240 | &block); | |
4241 | } | |
4242 | ||
75a70cf9 | 4243 | gfc_add_modify (&block, lse.expr, |
260abd71 | 4244 | fold_convert (TREE_TYPE (lse.expr), rse.expr)); |
9c5786bd | 4245 | |
4ee9c684 | 4246 | gfc_add_block_to_block (&block, &rse.post); |
4247 | gfc_add_block_to_block (&block, &lse.post); | |
4248 | } | |
4249 | else | |
4250 | { | |
9c5786bd | 4251 | tree strlen_lhs; |
4252 | tree strlen_rhs = NULL_TREE; | |
4253 | ||
4396343e | 4254 | /* Array pointer. */ |
4ee9c684 | 4255 | gfc_conv_expr_descriptor (&lse, expr1, lss); |
9c5786bd | 4256 | strlen_lhs = lse.string_length; |
7853829d | 4257 | switch (expr2->expr_type) |
4258 | { | |
4259 | case EXPR_NULL: | |
4260 | /* Just set the data pointer to null. */ | |
ca122904 | 4261 | gfc_conv_descriptor_data_set (&lse.pre, lse.expr, null_pointer_node); |
7853829d | 4262 | break; |
4263 | ||
4264 | case EXPR_VARIABLE: | |
4265 | /* Assign directly to the pointer's descriptor. */ | |
9c5786bd | 4266 | lse.direct_byref = 1; |
7853829d | 4267 | gfc_conv_expr_descriptor (&lse, expr2, rss); |
9c5786bd | 4268 | strlen_rhs = lse.string_length; |
1033248c | 4269 | |
4270 | /* If this is a subreference array pointer assignment, use the rhs | |
8192caf4 | 4271 | descriptor element size for the lhs span. */ |
1033248c | 4272 | if (expr1->symtree->n.sym->attr.subref_array_pointer) |
4273 | { | |
4274 | decl = expr1->symtree->n.sym->backend_decl; | |
8192caf4 | 4275 | gfc_init_se (&rse, NULL); |
4276 | rse.descriptor_only = 1; | |
4277 | gfc_conv_expr (&rse, expr2); | |
4278 | tmp = gfc_get_element_type (TREE_TYPE (rse.expr)); | |
4279 | tmp = fold_convert (gfc_array_index_type, size_in_bytes (tmp)); | |
4280 | if (!INTEGER_CST_P (tmp)) | |
9c5786bd | 4281 | gfc_add_block_to_block (&lse.post, &rse.pre); |
75a70cf9 | 4282 | gfc_add_modify (&lse.post, GFC_DECL_SPAN(decl), tmp); |
1033248c | 4283 | } |
4284 | ||
7853829d | 4285 | break; |
4286 | ||
4287 | default: | |
4288 | /* Assign to a temporary descriptor and then copy that | |
4289 | temporary to the pointer. */ | |
4290 | desc = lse.expr; | |
4291 | tmp = gfc_create_var (TREE_TYPE (desc), "ptrtemp"); | |
4292 | ||
4293 | lse.expr = tmp; | |
4294 | lse.direct_byref = 1; | |
4295 | gfc_conv_expr_descriptor (&lse, expr2, rss); | |
9c5786bd | 4296 | strlen_rhs = lse.string_length; |
75a70cf9 | 4297 | gfc_add_modify (&lse.pre, desc, tmp); |
7853829d | 4298 | break; |
9c5786bd | 4299 | } |
4300 | ||
4ee9c684 | 4301 | gfc_add_block_to_block (&block, &lse.pre); |
9c5786bd | 4302 | |
4303 | /* Check string lengths if applicable. The check is only really added | |
4304 | to the output code if -fbounds-check is enabled. */ | |
4305 | if (expr1->ts.type == BT_CHARACTER && expr2->expr_type != EXPR_NULL) | |
4306 | { | |
4307 | gcc_assert (expr2->ts.type == BT_CHARACTER); | |
4308 | gcc_assert (strlen_lhs && strlen_rhs); | |
4309 | gfc_trans_same_strlen_check ("pointer assignment", &expr1->where, | |
4310 | strlen_lhs, strlen_rhs, &block); | |
4311 | } | |
4312 | ||
4ee9c684 | 4313 | gfc_add_block_to_block (&block, &lse.post); |
4314 | } | |
4315 | return gfc_finish_block (&block); | |
4316 | } | |
4317 | ||
4318 | ||
4319 | /* Makes sure se is suitable for passing as a function string parameter. */ | |
69b1505f | 4320 | /* TODO: Need to check all callers of this function. It may be abused. */ |
4ee9c684 | 4321 | |
4322 | void | |
4323 | gfc_conv_string_parameter (gfc_se * se) | |
4324 | { | |
4325 | tree type; | |
4326 | ||
4327 | if (TREE_CODE (se->expr) == STRING_CST) | |
4328 | { | |
b44437b9 | 4329 | type = TREE_TYPE (TREE_TYPE (se->expr)); |
4330 | se->expr = gfc_build_addr_expr (build_pointer_type (type), se->expr); | |
4ee9c684 | 4331 | return; |
4332 | } | |
4333 | ||
b44437b9 | 4334 | if (TYPE_STRING_FLAG (TREE_TYPE (se->expr))) |
4ee9c684 | 4335 | { |
230c8f37 | 4336 | if (TREE_CODE (se->expr) != INDIRECT_REF) |
b44437b9 | 4337 | { |
4338 | type = TREE_TYPE (se->expr); | |
4339 | se->expr = gfc_build_addr_expr (build_pointer_type (type), se->expr); | |
4340 | } | |
230c8f37 | 4341 | else |
4342 | { | |
4343 | type = gfc_get_character_type_len (gfc_default_character_kind, | |
4344 | se->string_length); | |
4345 | type = build_pointer_type (type); | |
4346 | se->expr = gfc_build_addr_expr (type, se->expr); | |
4347 | } | |
4ee9c684 | 4348 | } |
4349 | ||
22d678e8 | 4350 | gcc_assert (POINTER_TYPE_P (TREE_TYPE (se->expr))); |
4351 | gcc_assert (se->string_length | |
4ee9c684 | 4352 | && TREE_CODE (TREE_TYPE (se->string_length)) == INTEGER_TYPE); |
4353 | } | |
4354 | ||
4355 | ||
4356 | /* Generate code for assignment of scalar variables. Includes character | |
2294b616 | 4357 | strings and derived types with allocatable components. */ |
4ee9c684 | 4358 | |
4359 | tree | |
2294b616 | 4360 | gfc_trans_scalar_assign (gfc_se * lse, gfc_se * rse, gfc_typespec ts, |
4361 | bool l_is_temp, bool r_is_var) | |
4ee9c684 | 4362 | { |
4ee9c684 | 4363 | stmtblock_t block; |
2294b616 | 4364 | tree tmp; |
4365 | tree cond; | |
4ee9c684 | 4366 | |
4367 | gfc_init_block (&block); | |
4368 | ||
2294b616 | 4369 | if (ts.type == BT_CHARACTER) |
4ee9c684 | 4370 | { |
891beb95 | 4371 | tree rlen = NULL; |
4372 | tree llen = NULL; | |
4ee9c684 | 4373 | |
891beb95 | 4374 | if (lse->string_length != NULL_TREE) |
4375 | { | |
4376 | gfc_conv_string_parameter (lse); | |
4377 | gfc_add_block_to_block (&block, &lse->pre); | |
4378 | llen = lse->string_length; | |
4379 | } | |
4ee9c684 | 4380 | |
891beb95 | 4381 | if (rse->string_length != NULL_TREE) |
4382 | { | |
4383 | gcc_assert (rse->string_length != NULL_TREE); | |
4384 | gfc_conv_string_parameter (rse); | |
4385 | gfc_add_block_to_block (&block, &rse->pre); | |
4386 | rlen = rse->string_length; | |
4387 | } | |
4ee9c684 | 4388 | |
b44437b9 | 4389 | gfc_trans_string_copy (&block, llen, lse->expr, ts.kind, rlen, |
4390 | rse->expr, ts.kind); | |
4ee9c684 | 4391 | } |
eeebe20b | 4392 | else if (ts.type == BT_DERIVED && ts.u.derived->attr.alloc_comp) |
2294b616 | 4393 | { |
4394 | cond = NULL_TREE; | |
4395 | ||
4396 | /* Are the rhs and the lhs the same? */ | |
4397 | if (r_is_var) | |
4398 | { | |
4399 | cond = fold_build2 (EQ_EXPR, boolean_type_node, | |
86f2ad37 | 4400 | gfc_build_addr_expr (NULL_TREE, lse->expr), |
4401 | gfc_build_addr_expr (NULL_TREE, rse->expr)); | |
2294b616 | 4402 | cond = gfc_evaluate_now (cond, &lse->pre); |
4403 | } | |
4404 | ||
4405 | /* Deallocate the lhs allocated components as long as it is not | |
89032e9a | 4406 | the same as the rhs. This must be done following the assignment |
4407 | to prevent deallocating data that could be used in the rhs | |
4408 | expression. */ | |
2294b616 | 4409 | if (!l_is_temp) |
4410 | { | |
89032e9a | 4411 | tmp = gfc_evaluate_now (lse->expr, &lse->pre); |
eeebe20b | 4412 | tmp = gfc_deallocate_alloc_comp (ts.u.derived, tmp, 0); |
2294b616 | 4413 | if (r_is_var) |
e60a6f7b | 4414 | tmp = build3_v (COND_EXPR, cond, build_empty_stmt (input_location), |
4415 | tmp); | |
89032e9a | 4416 | gfc_add_expr_to_block (&lse->post, tmp); |
2294b616 | 4417 | } |
6826be54 | 4418 | |
89032e9a | 4419 | gfc_add_block_to_block (&block, &rse->pre); |
4420 | gfc_add_block_to_block (&block, &lse->pre); | |
2294b616 | 4421 | |
75a70cf9 | 4422 | gfc_add_modify (&block, lse->expr, |
2294b616 | 4423 | fold_convert (TREE_TYPE (lse->expr), rse->expr)); |
4424 | ||
4425 | /* Do a deep copy if the rhs is a variable, if it is not the | |
540338c6 | 4426 | same as the lhs. */ |
2294b616 | 4427 | if (r_is_var) |
4428 | { | |
eeebe20b | 4429 | tmp = gfc_copy_alloc_comp (ts.u.derived, rse->expr, lse->expr, 0); |
e60a6f7b | 4430 | tmp = build3_v (COND_EXPR, cond, build_empty_stmt (input_location), |
4431 | tmp); | |
2294b616 | 4432 | gfc_add_expr_to_block (&block, tmp); |
4433 | } | |
2294b616 | 4434 | } |
816767a6 | 4435 | else if (ts.type == BT_DERIVED) |
4436 | { | |
4437 | gfc_add_block_to_block (&block, &lse->pre); | |
4438 | gfc_add_block_to_block (&block, &rse->pre); | |
4439 | tmp = gfc_evaluate_now (rse->expr, &block); | |
4440 | tmp = fold_build1 (VIEW_CONVERT_EXPR, TREE_TYPE (lse->expr), rse->expr); | |
4441 | gfc_add_modify (&block, lse->expr, tmp); | |
4442 | } | |
4ee9c684 | 4443 | else |
4444 | { | |
4445 | gfc_add_block_to_block (&block, &lse->pre); | |
4446 | gfc_add_block_to_block (&block, &rse->pre); | |
4447 | ||
75a70cf9 | 4448 | gfc_add_modify (&block, lse->expr, |
816767a6 | 4449 | fold_convert (TREE_TYPE (lse->expr), rse->expr)); |
4ee9c684 | 4450 | } |
4451 | ||
4452 | gfc_add_block_to_block (&block, &lse->post); | |
4453 | gfc_add_block_to_block (&block, &rse->post); | |
4454 | ||
4455 | return gfc_finish_block (&block); | |
4456 | } | |
4457 | ||
4458 | ||
4459 | /* Try to translate array(:) = func (...), where func is a transformational | |
4460 | array function, without using a temporary. Returns NULL is this isn't the | |
4461 | case. */ | |
4462 | ||
4463 | static tree | |
4464 | gfc_trans_arrayfunc_assign (gfc_expr * expr1, gfc_expr * expr2) | |
4465 | { | |
4466 | gfc_se se; | |
4467 | gfc_ss *ss; | |
70464f87 | 4468 | gfc_ref * ref; |
4469 | bool seen_array_ref; | |
8d60cc46 | 4470 | bool c = false; |
85d1c108 | 4471 | gfc_component *comp = NULL; |
4ee9c684 | 4472 | |
4473 | /* The caller has already checked rank>0 and expr_type == EXPR_FUNCTION. */ | |
4474 | if (expr2->value.function.isym && !gfc_is_intrinsic_libcall (expr2)) | |
4475 | return NULL; | |
4476 | ||
4477 | /* Elemental functions don't need a temporary anyway. */ | |
08349c53 | 4478 | if (expr2->value.function.esym != NULL |
4479 | && expr2->value.function.esym->attr.elemental) | |
4ee9c684 | 4480 | return NULL; |
4481 | ||
8d60cc46 | 4482 | /* Fail if rhs is not FULL or a contiguous section. */ |
4483 | if (expr1->ref && !(gfc_full_array_ref_p (expr1->ref, &c) || c)) | |
4484 | return NULL; | |
4485 | ||
c99d633f | 4486 | /* Fail if EXPR1 can't be expressed as a descriptor. */ |
4487 | if (gfc_ref_needs_temporary_p (expr1->ref)) | |
4488 | return NULL; | |
4489 | ||
34da51b6 | 4490 | /* Functions returning pointers need temporaries. */ |
d4ef6f9d | 4491 | if (expr2->symtree->n.sym->attr.pointer |
4492 | || expr2->symtree->n.sym->attr.allocatable) | |
34da51b6 | 4493 | return NULL; |
4494 | ||
5065911e | 4495 | /* Character array functions need temporaries unless the |
4496 | character lengths are the same. */ | |
4497 | if (expr2->ts.type == BT_CHARACTER && expr2->rank > 0) | |
4498 | { | |
eeebe20b | 4499 | if (expr1->ts.u.cl->length == NULL |
4500 | || expr1->ts.u.cl->length->expr_type != EXPR_CONSTANT) | |
5065911e | 4501 | return NULL; |
4502 | ||
eeebe20b | 4503 | if (expr2->ts.u.cl->length == NULL |
4504 | || expr2->ts.u.cl->length->expr_type != EXPR_CONSTANT) | |
5065911e | 4505 | return NULL; |
4506 | ||
eeebe20b | 4507 | if (mpz_cmp (expr1->ts.u.cl->length->value.integer, |
4508 | expr2->ts.u.cl->length->value.integer) != 0) | |
5065911e | 4509 | return NULL; |
4510 | } | |
4511 | ||
70464f87 | 4512 | /* Check that no LHS component references appear during an array |
4513 | reference. This is needed because we do not have the means to | |
4514 | span any arbitrary stride with an array descriptor. This check | |
4515 | is not needed for the rhs because the function result has to be | |
4516 | a complete type. */ | |
4517 | seen_array_ref = false; | |
4518 | for (ref = expr1->ref; ref; ref = ref->next) | |
4519 | { | |
4520 | if (ref->type == REF_ARRAY) | |
4521 | seen_array_ref= true; | |
4522 | else if (ref->type == REF_COMPONENT && seen_array_ref) | |
4523 | return NULL; | |
4524 | } | |
4525 | ||
4ee9c684 | 4526 | /* Check for a dependency. */ |
018ef8b8 | 4527 | if (gfc_check_fncall_dependency (expr1, INTENT_OUT, |
4528 | expr2->value.function.esym, | |
74e83bb9 | 4529 | expr2->value.function.actual, |
4530 | NOT_ELEMENTAL)) | |
4ee9c684 | 4531 | return NULL; |
4532 | ||
4533 | /* The frontend doesn't seem to bother filling in expr->symtree for intrinsic | |
4534 | functions. */ | |
22d678e8 | 4535 | gcc_assert (expr2->value.function.isym |
ff70e443 | 4536 | || (gfc_is_proc_ptr_comp (expr2, &comp) |
88a37d69 | 4537 | && comp && comp->attr.dimension) |
85d1c108 | 4538 | || (!comp && gfc_return_by_reference (expr2->value.function.esym) |
88a37d69 | 4539 | && expr2->value.function.esym->result->attr.dimension)); |
4ee9c684 | 4540 | |
4541 | ss = gfc_walk_expr (expr1); | |
22d678e8 | 4542 | gcc_assert (ss != gfc_ss_terminator); |
4ee9c684 | 4543 | gfc_init_se (&se, NULL); |
4544 | gfc_start_block (&se.pre); | |
4545 | se.want_pointer = 1; | |
4546 | ||
bc56d052 | 4547 | gfc_conv_array_parameter (&se, expr1, ss, 0, NULL, NULL, NULL); |
4ee9c684 | 4548 | |
4549 | se.direct_byref = 1; | |
4550 | se.ss = gfc_walk_expr (expr2); | |
22d678e8 | 4551 | gcc_assert (se.ss != gfc_ss_terminator); |
4ee9c684 | 4552 | gfc_conv_function_expr (&se, expr2); |
4ee9c684 | 4553 | gfc_add_block_to_block (&se.pre, &se.post); |
4554 | ||
4555 | return gfc_finish_block (&se.pre); | |
4556 | } | |
4557 | ||
67313c34 | 4558 | /* Determine whether the given EXPR_CONSTANT is a zero initializer. */ |
4559 | ||
4560 | static bool | |
4561 | is_zero_initializer_p (gfc_expr * expr) | |
4562 | { | |
4563 | if (expr->expr_type != EXPR_CONSTANT) | |
4564 | return false; | |
667787ce | 4565 | |
4566 | /* We ignore constants with prescribed memory representations for now. */ | |
4567 | if (expr->representation.string) | |
67313c34 | 4568 | return false; |
4569 | ||
4570 | switch (expr->ts.type) | |
4571 | { | |
4572 | case BT_INTEGER: | |
4573 | return mpz_cmp_si (expr->value.integer, 0) == 0; | |
4574 | ||
4575 | case BT_REAL: | |
4576 | return mpfr_zero_p (expr->value.real) | |
4577 | && MPFR_SIGN (expr->value.real) >= 0; | |
4578 | ||
4579 | case BT_LOGICAL: | |
4580 | return expr->value.logical == 0; | |
4581 | ||
4582 | case BT_COMPLEX: | |
f8e9f06c | 4583 | return mpfr_zero_p (mpc_realref (expr->value.complex)) |
4584 | && MPFR_SIGN (mpc_realref (expr->value.complex)) >= 0 | |
4585 | && mpfr_zero_p (mpc_imagref (expr->value.complex)) | |
4586 | && MPFR_SIGN (mpc_imagref (expr->value.complex)) >= 0; | |
67313c34 | 4587 | |
4588 | default: | |
4589 | break; | |
4590 | } | |
4591 | return false; | |
4592 | } | |
4593 | ||
4594 | /* Try to efficiently translate array(:) = 0. Return NULL if this | |
4595 | can't be done. */ | |
4596 | ||
4597 | static tree | |
4598 | gfc_trans_zero_assign (gfc_expr * expr) | |
4599 | { | |
4600 | tree dest, len, type; | |
c2f47e15 | 4601 | tree tmp; |
67313c34 | 4602 | gfc_symbol *sym; |
4603 | ||
4604 | sym = expr->symtree->n.sym; | |
4605 | dest = gfc_get_symbol_decl (sym); | |
4606 | ||
4607 | type = TREE_TYPE (dest); | |
4608 | if (POINTER_TYPE_P (type)) | |
4609 | type = TREE_TYPE (type); | |
4610 | if (!GFC_ARRAY_TYPE_P (type)) | |
4611 | return NULL_TREE; | |
4612 | ||
4613 | /* Determine the length of the array. */ | |
4614 | len = GFC_TYPE_ARRAY_SIZE (type); | |
4615 | if (!len || TREE_CODE (len) != INTEGER_CST) | |
4616 | return NULL_TREE; | |
4617 | ||
db867224 | 4618 | tmp = TYPE_SIZE_UNIT (gfc_get_element_type (type)); |
67313c34 | 4619 | len = fold_build2 (MULT_EXPR, gfc_array_index_type, len, |
db867224 | 4620 | fold_convert (gfc_array_index_type, tmp)); |
67313c34 | 4621 | |
1d9f9adc | 4622 | /* If we are zeroing a local array avoid taking its address by emitting |
4623 | a = {} instead. */ | |
67313c34 | 4624 | if (!POINTER_TYPE_P (TREE_TYPE (dest))) |
1d9f9adc | 4625 | return build2 (MODIFY_EXPR, void_type_node, |
4626 | dest, build_constructor (TREE_TYPE (dest), NULL)); | |
4627 | ||
4628 | /* Convert arguments to the correct types. */ | |
4629 | dest = fold_convert (pvoid_type_node, dest); | |
67313c34 | 4630 | len = fold_convert (size_type_node, len); |
4631 | ||
4632 | /* Construct call to __builtin_memset. */ | |
389dd41b | 4633 | tmp = build_call_expr_loc (input_location, |
4634 | built_in_decls[BUILT_IN_MEMSET], | |
c2f47e15 | 4635 | 3, dest, integer_zero_node, len); |
67313c34 | 4636 | return fold_convert (void_type_node, tmp); |
4637 | } | |
4ee9c684 | 4638 | |
538374c5 | 4639 | |
4640 | /* Helper for gfc_trans_array_copy and gfc_trans_array_constructor_copy | |
4641 | that constructs the call to __builtin_memcpy. */ | |
4642 | ||
7a2a9daf | 4643 | tree |
538374c5 | 4644 | gfc_build_memcpy_call (tree dst, tree src, tree len) |
4645 | { | |
c2f47e15 | 4646 | tree tmp; |
538374c5 | 4647 | |
4648 | /* Convert arguments to the correct types. */ | |
4649 | if (!POINTER_TYPE_P (TREE_TYPE (dst))) | |
4650 | dst = gfc_build_addr_expr (pvoid_type_node, dst); | |
4651 | else | |
4652 | dst = fold_convert (pvoid_type_node, dst); | |
4653 | ||
4654 | if (!POINTER_TYPE_P (TREE_TYPE (src))) | |
4655 | src = gfc_build_addr_expr (pvoid_type_node, src); | |
4656 | else | |
4657 | src = fold_convert (pvoid_type_node, src); | |
4658 | ||
4659 | len = fold_convert (size_type_node, len); | |
4660 | ||
4661 | /* Construct call to __builtin_memcpy. */ | |
389dd41b | 4662 | tmp = build_call_expr_loc (input_location, |
4663 | built_in_decls[BUILT_IN_MEMCPY], 3, dst, src, len); | |
538374c5 | 4664 | return fold_convert (void_type_node, tmp); |
4665 | } | |
4666 | ||
4667 | ||
1372ec9a | 4668 | /* Try to efficiently translate dst(:) = src(:). Return NULL if this |
4669 | can't be done. EXPR1 is the destination/lhs and EXPR2 is the | |
4670 | source/rhs, both are gfc_full_array_ref_p which have been checked for | |
4671 | dependencies. */ | |
4ee9c684 | 4672 | |
1372ec9a | 4673 | static tree |
4674 | gfc_trans_array_copy (gfc_expr * expr1, gfc_expr * expr2) | |
4675 | { | |
4676 | tree dst, dlen, dtype; | |
4677 | tree src, slen, stype; | |
db867224 | 4678 | tree tmp; |
1372ec9a | 4679 | |
4680 | dst = gfc_get_symbol_decl (expr1->symtree->n.sym); | |
4681 | src = gfc_get_symbol_decl (expr2->symtree->n.sym); | |
4682 | ||
4683 | dtype = TREE_TYPE (dst); | |
4684 | if (POINTER_TYPE_P (dtype)) | |
4685 | dtype = TREE_TYPE (dtype); | |
4686 | stype = TREE_TYPE (src); | |
4687 | if (POINTER_TYPE_P (stype)) | |
4688 | stype = TREE_TYPE (stype); | |
4689 | ||
4690 | if (!GFC_ARRAY_TYPE_P (dtype) || !GFC_ARRAY_TYPE_P (stype)) | |
4691 | return NULL_TREE; | |
4692 | ||
4693 | /* Determine the lengths of the arrays. */ | |
4694 | dlen = GFC_TYPE_ARRAY_SIZE (dtype); | |
4695 | if (!dlen || TREE_CODE (dlen) != INTEGER_CST) | |
4696 | return NULL_TREE; | |
db867224 | 4697 | tmp = TYPE_SIZE_UNIT (gfc_get_element_type (dtype)); |
1372ec9a | 4698 | dlen = fold_build2 (MULT_EXPR, gfc_array_index_type, dlen, |
db867224 | 4699 | fold_convert (gfc_array_index_type, tmp)); |
1372ec9a | 4700 | |
4701 | slen = GFC_TYPE_ARRAY_SIZE (stype); | |
4702 | if (!slen || TREE_CODE (slen) != INTEGER_CST) | |
4703 | return NULL_TREE; | |
db867224 | 4704 | tmp = TYPE_SIZE_UNIT (gfc_get_element_type (stype)); |
1372ec9a | 4705 | slen = fold_build2 (MULT_EXPR, gfc_array_index_type, slen, |
db867224 | 4706 | fold_convert (gfc_array_index_type, tmp)); |
1372ec9a | 4707 | |
4708 | /* Sanity check that they are the same. This should always be | |
4709 | the case, as we should already have checked for conformance. */ | |
4710 | if (!tree_int_cst_equal (slen, dlen)) | |
4711 | return NULL_TREE; | |
4712 | ||
538374c5 | 4713 | return gfc_build_memcpy_call (dst, src, dlen); |
4714 | } | |
1372ec9a | 4715 | |
1372ec9a | 4716 | |
538374c5 | 4717 | /* Try to efficiently translate array(:) = (/ ... /). Return NULL if |
4718 | this can't be done. EXPR1 is the destination/lhs for which | |
4719 | gfc_full_array_ref_p is true, and EXPR2 is the source/rhs. */ | |
1372ec9a | 4720 | |
538374c5 | 4721 | static tree |
4722 | gfc_trans_array_constructor_copy (gfc_expr * expr1, gfc_expr * expr2) | |
4723 | { | |
4724 | unsigned HOST_WIDE_INT nelem; | |
4725 | tree dst, dtype; | |
4726 | tree src, stype; | |
4727 | tree len; | |
db867224 | 4728 | tree tmp; |
538374c5 | 4729 | |
4730 | nelem = gfc_constant_array_constructor_p (expr2->value.constructor); | |
4731 | if (nelem == 0) | |
4732 | return NULL_TREE; | |
4733 | ||
4734 | dst = gfc_get_symbol_decl (expr1->symtree->n.sym); | |
4735 | dtype = TREE_TYPE (dst); | |
4736 | if (POINTER_TYPE_P (dtype)) | |
4737 | dtype = TREE_TYPE (dtype); | |
4738 | if (!GFC_ARRAY_TYPE_P (dtype)) | |
4739 | return NULL_TREE; | |
4740 | ||
4741 | /* Determine the lengths of the array. */ | |
4742 | len = GFC_TYPE_ARRAY_SIZE (dtype); | |
4743 | if (!len || TREE_CODE (len) != INTEGER_CST) | |
4744 | return NULL_TREE; | |
4745 | ||
4746 | /* Confirm that the constructor is the same size. */ | |
4747 | if (compare_tree_int (len, nelem) != 0) | |
4748 | return NULL_TREE; | |
4749 | ||
db867224 | 4750 | tmp = TYPE_SIZE_UNIT (gfc_get_element_type (dtype)); |
538374c5 | 4751 | len = fold_build2 (MULT_EXPR, gfc_array_index_type, len, |
db867224 | 4752 | fold_convert (gfc_array_index_type, tmp)); |
538374c5 | 4753 | |
4754 | stype = gfc_typenode_for_spec (&expr2->ts); | |
4755 | src = gfc_build_constant_array_constructor (expr2, stype); | |
4756 | ||
4757 | stype = TREE_TYPE (src); | |
4758 | if (POINTER_TYPE_P (stype)) | |
4759 | stype = TREE_TYPE (stype); | |
4760 | ||
4761 | return gfc_build_memcpy_call (dst, src, len); | |
1372ec9a | 4762 | } |
4763 | ||
4764 | ||
4765 | /* Subroutine of gfc_trans_assignment that actually scalarizes the | |
4766 | assignment. EXPR1 is the destination/RHS and EXPR2 is the source/LHS. */ | |
4767 | ||
4768 | static tree | |
4769 | gfc_trans_assignment_1 (gfc_expr * expr1, gfc_expr * expr2, bool init_flag) | |
4ee9c684 | 4770 | { |
4771 | gfc_se lse; | |
4772 | gfc_se rse; | |
4773 | gfc_ss *lss; | |
4774 | gfc_ss *lss_section; | |
4775 | gfc_ss *rss; | |
4776 | gfc_loopinfo loop; | |
4777 | tree tmp; | |
4778 | stmtblock_t block; | |
4779 | stmtblock_t body; | |
2294b616 | 4780 | bool l_is_temp; |
8714fc76 | 4781 | bool scalar_to_array; |
bd619047 | 4782 | tree string_length; |
4ee9c684 | 4783 | |
4ee9c684 | 4784 | /* Assignment of the form lhs = rhs. */ |
4785 | gfc_start_block (&block); | |
4786 | ||
4787 | gfc_init_se (&lse, NULL); | |
4788 | gfc_init_se (&rse, NULL); | |
4789 | ||
4790 | /* Walk the lhs. */ | |
4791 | lss = gfc_walk_expr (expr1); | |
4792 | rss = NULL; | |
4793 | if (lss != gfc_ss_terminator) | |
4794 | { | |
e2720a06 | 4795 | /* Allow the scalarizer to workshare array assignments. */ |
4796 | if (ompws_flags & OMPWS_WORKSHARE_FLAG) | |
4797 | ompws_flags |= OMPWS_SCALARIZER_WS; | |
4798 | ||
4ee9c684 | 4799 | /* The assignment needs scalarization. */ |
4800 | lss_section = lss; | |
4801 | ||
4802 | /* Find a non-scalar SS from the lhs. */ | |
4803 | while (lss_section != gfc_ss_terminator | |
4804 | && lss_section->type != GFC_SS_SECTION) | |
4805 | lss_section = lss_section->next; | |
4806 | ||
22d678e8 | 4807 | gcc_assert (lss_section != gfc_ss_terminator); |
4ee9c684 | 4808 | |
4809 | /* Initialize the scalarizer. */ | |
4810 | gfc_init_loopinfo (&loop); | |
4811 | ||
4812 | /* Walk the rhs. */ | |
4813 | rss = gfc_walk_expr (expr2); | |
4814 | if (rss == gfc_ss_terminator) | |
4815 | { | |
4816 | /* The rhs is scalar. Add a ss for the expression. */ | |
4817 | rss = gfc_get_ss (); | |
4818 | rss->next = gfc_ss_terminator; | |
4819 | rss->type = GFC_SS_SCALAR; | |
4820 | rss->expr = expr2; | |
4821 | } | |
4822 | /* Associate the SS with the loop. */ | |
4823 | gfc_add_ss_to_loop (&loop, lss); | |
4824 | gfc_add_ss_to_loop (&loop, rss); | |
4825 | ||
4826 | /* Calculate the bounds of the scalarization. */ | |
4827 | gfc_conv_ss_startstride (&loop); | |
4828 | /* Resolve any data dependencies in the statement. */ | |
376a3611 | 4829 | gfc_conv_resolve_dependencies (&loop, lss, rss); |
4ee9c684 | 4830 | /* Setup the scalarizing loops. */ |
92f4d1c4 | 4831 | gfc_conv_loop_setup (&loop, &expr2->where); |
4ee9c684 | 4832 | |
4833 | /* Setup the gfc_se structures. */ | |
4834 | gfc_copy_loopinfo_to_se (&lse, &loop); | |
4835 | gfc_copy_loopinfo_to_se (&rse, &loop); | |
4836 | ||
4837 | rse.ss = rss; | |
4838 | gfc_mark_ss_chain_used (rss, 1); | |
4839 | if (loop.temp_ss == NULL) | |
4840 | { | |
4841 | lse.ss = lss; | |
4842 | gfc_mark_ss_chain_used (lss, 1); | |
4843 | } | |
4844 | else | |
4845 | { | |
4846 | lse.ss = loop.temp_ss; | |
4847 | gfc_mark_ss_chain_used (lss, 3); | |
4848 | gfc_mark_ss_chain_used (loop.temp_ss, 3); | |
4849 | } | |
4850 | ||
4851 | /* Start the scalarized loop body. */ | |
4852 | gfc_start_scalarized_body (&loop, &body); | |
4853 | } | |
4854 | else | |
4855 | gfc_init_block (&body); | |
4856 | ||
2294b616 | 4857 | l_is_temp = (lss != gfc_ss_terminator && loop.temp_ss != NULL); |
4858 | ||
4ee9c684 | 4859 | /* Translate the expression. */ |
4860 | gfc_conv_expr (&rse, expr2); | |
4861 | ||
bd619047 | 4862 | /* Stabilize a string length for temporaries. */ |
4863 | if (expr2->ts.type == BT_CHARACTER) | |
4864 | string_length = gfc_evaluate_now (rse.string_length, &rse.pre); | |
4865 | else | |
4866 | string_length = NULL_TREE; | |
4867 | ||
2294b616 | 4868 | if (l_is_temp) |
4ee9c684 | 4869 | { |
4870 | gfc_conv_tmp_array_ref (&lse); | |
4871 | gfc_advance_se_ss_chain (&lse); | |
bd619047 | 4872 | if (expr2->ts.type == BT_CHARACTER) |
4873 | lse.string_length = string_length; | |
4ee9c684 | 4874 | } |
4875 | else | |
4876 | gfc_conv_expr (&lse, expr1); | |
544c333b | 4877 | |
8714fc76 | 4878 | /* Assignments of scalar derived types with allocatable components |
4879 | to arrays must be done with a deep copy and the rhs temporary | |
4880 | must have its components deallocated afterwards. */ | |
4881 | scalar_to_array = (expr2->ts.type == BT_DERIVED | |
eeebe20b | 4882 | && expr2->ts.u.derived->attr.alloc_comp |
8714fc76 | 4883 | && expr2->expr_type != EXPR_VARIABLE |
4884 | && !gfc_is_constant_expr (expr2) | |
4885 | && expr1->rank && !expr2->rank); | |
4886 | if (scalar_to_array) | |
4887 | { | |
eeebe20b | 4888 | tmp = gfc_deallocate_alloc_comp (expr2->ts.u.derived, rse.expr, 0); |
8714fc76 | 4889 | gfc_add_expr_to_block (&loop.post, tmp); |
4890 | } | |
4891 | ||
b9cd8c56 | 4892 | tmp = gfc_trans_scalar_assign (&lse, &rse, expr1->ts, |
4893 | l_is_temp || init_flag, | |
8714fc76 | 4894 | (expr2->expr_type == EXPR_VARIABLE) |
4895 | || scalar_to_array); | |
4ee9c684 | 4896 | gfc_add_expr_to_block (&body, tmp); |
4897 | ||
4898 | if (lss == gfc_ss_terminator) | |
4899 | { | |
4900 | /* Use the scalar assignment as is. */ | |
4901 | gfc_add_block_to_block (&block, &body); | |
4902 | } | |
4903 | else | |
4904 | { | |
22d678e8 | 4905 | gcc_assert (lse.ss == gfc_ss_terminator |
4906 | && rse.ss == gfc_ss_terminator); | |
4ee9c684 | 4907 | |
2294b616 | 4908 | if (l_is_temp) |
4ee9c684 | 4909 | { |
4910 | gfc_trans_scalarized_loop_boundary (&loop, &body); | |
4911 | ||
4912 | /* We need to copy the temporary to the actual lhs. */ | |
4913 | gfc_init_se (&lse, NULL); | |
4914 | gfc_init_se (&rse, NULL); | |
4915 | gfc_copy_loopinfo_to_se (&lse, &loop); | |
4916 | gfc_copy_loopinfo_to_se (&rse, &loop); | |
4917 | ||
4918 | rse.ss = loop.temp_ss; | |
4919 | lse.ss = lss; | |
4920 | ||
4921 | gfc_conv_tmp_array_ref (&rse); | |
4922 | gfc_advance_se_ss_chain (&rse); | |
4923 | gfc_conv_expr (&lse, expr1); | |
4924 | ||
22d678e8 | 4925 | gcc_assert (lse.ss == gfc_ss_terminator |
4926 | && rse.ss == gfc_ss_terminator); | |
4ee9c684 | 4927 | |
bd619047 | 4928 | if (expr2->ts.type == BT_CHARACTER) |
4929 | rse.string_length = string_length; | |
4930 | ||
b9cd8c56 | 4931 | tmp = gfc_trans_scalar_assign (&lse, &rse, expr1->ts, |
4932 | false, false); | |
4ee9c684 | 4933 | gfc_add_expr_to_block (&body, tmp); |
4934 | } | |
2294b616 | 4935 | |
4ee9c684 | 4936 | /* Generate the copying loops. */ |
4937 | gfc_trans_scalarizing_loops (&loop, &body); | |
4938 | ||
4939 | /* Wrap the whole thing up. */ | |
4940 | gfc_add_block_to_block (&block, &loop.pre); | |
4941 | gfc_add_block_to_block (&block, &loop.post); | |
4942 | ||
4943 | gfc_cleanup_loop (&loop); | |
4944 | } | |
4945 | ||
4946 | return gfc_finish_block (&block); | |
4947 | } | |
4948 | ||
1372ec9a | 4949 | |
62e711cd | 4950 | /* Check whether EXPR is a copyable array. */ |
1372ec9a | 4951 | |
4952 | static bool | |
4953 | copyable_array_p (gfc_expr * expr) | |
4954 | { | |
62e711cd | 4955 | if (expr->expr_type != EXPR_VARIABLE) |
4956 | return false; | |
4957 | ||
1372ec9a | 4958 | /* First check it's an array. */ |
62e711cd | 4959 | if (expr->rank < 1 || !expr->ref || expr->ref->next) |
4960 | return false; | |
4961 | ||
8d60cc46 | 4962 | if (!gfc_full_array_ref_p (expr->ref, NULL)) |
1372ec9a | 4963 | return false; |
4964 | ||
4965 | /* Next check that it's of a simple enough type. */ | |
4966 | switch (expr->ts.type) | |
4967 | { | |
4968 | case BT_INTEGER: | |
4969 | case BT_REAL: | |
4970 | case BT_COMPLEX: | |
4971 | case BT_LOGICAL: | |
4972 | return true; | |
4973 | ||
6fc8b651 | 4974 | case BT_CHARACTER: |
4975 | return false; | |
4976 | ||
4977 | case BT_DERIVED: | |
eeebe20b | 4978 | return !expr->ts.u.derived->attr.alloc_comp; |
6fc8b651 | 4979 | |
1372ec9a | 4980 | default: |
4981 | break; | |
4982 | } | |
4983 | ||
4984 | return false; | |
4985 | } | |
4986 | ||
4987 | /* Translate an assignment. */ | |
4988 | ||
4989 | tree | |
4990 | gfc_trans_assignment (gfc_expr * expr1, gfc_expr * expr2, bool init_flag) | |
4991 | { | |
4992 | tree tmp; | |
4993 | ||
4994 | /* Special case a single function returning an array. */ | |
4995 | if (expr2->expr_type == EXPR_FUNCTION && expr2->rank > 0) | |
4996 | { | |
4997 | tmp = gfc_trans_arrayfunc_assign (expr1, expr2); | |
4998 | if (tmp) | |
4999 | return tmp; | |
5000 | } | |
5001 | ||
5002 | /* Special case assigning an array to zero. */ | |
62e711cd | 5003 | if (copyable_array_p (expr1) |
1372ec9a | 5004 | && is_zero_initializer_p (expr2)) |
5005 | { | |
5006 | tmp = gfc_trans_zero_assign (expr1); | |
5007 | if (tmp) | |
5008 | return tmp; | |
5009 | } | |
5010 | ||
5011 | /* Special case copying one array to another. */ | |
62e711cd | 5012 | if (copyable_array_p (expr1) |
1372ec9a | 5013 | && copyable_array_p (expr2) |
1372ec9a | 5014 | && gfc_compare_types (&expr1->ts, &expr2->ts) |
5015 | && !gfc_check_dependency (expr1, expr2, 0)) | |
5016 | { | |
5017 | tmp = gfc_trans_array_copy (expr1, expr2); | |
5018 | if (tmp) | |
5019 | return tmp; | |
5020 | } | |
5021 | ||
538374c5 | 5022 | /* Special case initializing an array from a constant array constructor. */ |
62e711cd | 5023 | if (copyable_array_p (expr1) |
538374c5 | 5024 | && expr2->expr_type == EXPR_ARRAY |
5025 | && gfc_compare_types (&expr1->ts, &expr2->ts)) | |
5026 | { | |
5027 | tmp = gfc_trans_array_constructor_copy (expr1, expr2); | |
5028 | if (tmp) | |
5029 | return tmp; | |
5030 | } | |
5031 | ||
1372ec9a | 5032 | /* Fallback to the scalarizer to generate explicit loops. */ |
5033 | return gfc_trans_assignment_1 (expr1, expr2, init_flag); | |
5034 | } | |
5035 | ||
b9cd8c56 | 5036 | tree |
5037 | gfc_trans_init_assign (gfc_code * code) | |
5038 | { | |
578d3f19 | 5039 | return gfc_trans_assignment (code->expr1, code->expr2, true); |
b9cd8c56 | 5040 | } |
5041 | ||
4ee9c684 | 5042 | tree |
5043 | gfc_trans_assign (gfc_code * code) | |
5044 | { | |
578d3f19 | 5045 | return gfc_trans_assignment (code->expr1, code->expr2, false); |
4ee9c684 | 5046 | } |