1 /* Pass manager for Fortran front end.
2 Copyright (C) 2010, 2011 Free Software Foundation, Inc.
3 Contributed by Thomas König.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
26 #include "dependency.h"
27 #include "constructor.h"
30 /* Forward declarations. */
32 static void strip_function_call (gfc_expr *);
33 static void optimize_namespace (gfc_namespace *);
34 static void optimize_assignment (gfc_code *);
35 static bool optimize_op (gfc_expr *);
36 static bool optimize_comparison (gfc_expr *, gfc_intrinsic_op);
37 static bool optimize_trim (gfc_expr *);
38 static bool optimize_lexical_comparison (gfc_expr *);
39 static void optimize_minmaxloc (gfc_expr **);
41 /* How deep we are inside an argument list. */
43 static int count_arglist;
45 /* Pointer to an array of gfc_expr ** we operate on, plus its size
48 static gfc_expr ***expr_array;
49 static int expr_size, expr_count;
51 /* Pointer to the gfc_code we currently work on - to be able to insert
52 a block before the statement. */
54 static gfc_code **current_code;
56 /* Pointer to the block to be inserted, and the statement we are
57 changing within the block. */
59 static gfc_code *inserted_block, **changed_statement;
61 /* The namespace we are currently dealing with. */
63 static gfc_namespace *current_ns;
65 /* If we are within any forall loop. */
67 static int forall_level;
69 /* Keep track of whether we are within an OMP workshare. */
71 static bool in_omp_workshare;
73 /* Entry point - run all passes for a namespace. So far, only an
74 optimization pass is run. */
77 gfc_run_passes (gfc_namespace *ns)
79 if (gfc_option.flag_frontend_optimize)
82 expr_array = XNEWVEC(gfc_expr **, expr_size);
84 optimize_namespace (ns);
85 if (gfc_option.dump_fortran_optimized)
86 gfc_dump_parse_tree (ns, stdout);
88 XDELETEVEC (expr_array);
92 /* Callback for each gfc_code node invoked through gfc_code_walker
93 from optimize_namespace. */
96 optimize_code (gfc_code **c, int *walk_subtrees ATTRIBUTE_UNUSED,
97 void *data ATTRIBUTE_UNUSED)
104 if (op == EXEC_CALL || op == EXEC_COMPCALL || op == EXEC_ASSIGN_CALL
105 || op == EXEC_CALL_PPC)
110 if (op == EXEC_ASSIGN)
111 optimize_assignment (*c);
115 /* Callback for each gfc_expr node invoked through gfc_code_walker
116 from optimize_namespace. */
119 optimize_expr (gfc_expr **e, int *walk_subtrees ATTRIBUTE_UNUSED,
120 void *data ATTRIBUTE_UNUSED)
124 if ((*e)->expr_type == EXPR_FUNCTION)
127 function_expr = true;
130 function_expr = false;
132 if (optimize_trim (*e))
133 gfc_simplify_expr (*e, 0);
135 if (optimize_lexical_comparison (*e))
136 gfc_simplify_expr (*e, 0);
138 if ((*e)->expr_type == EXPR_OP && optimize_op (*e))
139 gfc_simplify_expr (*e, 0);
141 if ((*e)->expr_type == EXPR_FUNCTION && (*e)->value.function.isym)
142 switch ((*e)->value.function.isym->id)
144 case GFC_ISYM_MINLOC:
145 case GFC_ISYM_MAXLOC:
146 optimize_minmaxloc (e);
159 /* Callback function for common function elimination, called from cfe_expr_0.
160 Put all eligible function expressions into expr_array. */
163 cfe_register_funcs (gfc_expr **e, int *walk_subtrees ATTRIBUTE_UNUSED,
164 void *data ATTRIBUTE_UNUSED)
167 if ((*e)->expr_type != EXPR_FUNCTION)
170 /* We don't do character functions with unknown charlens. */
171 if ((*e)->ts.type == BT_CHARACTER
172 && ((*e)->ts.u.cl == NULL || (*e)->ts.u.cl->length == NULL
173 || (*e)->ts.u.cl->length->expr_type != EXPR_CONSTANT))
176 /* We don't do function elimination within FORALL statements, it can
177 lead to wrong-code in certain circumstances. */
179 if (forall_level > 0)
182 /* If we don't know the shape at compile time, we create an allocatable
183 temporary variable to hold the intermediate result, but only if
184 allocation on assignment is active. */
186 if ((*e)->rank > 0 && (*e)->shape == NULL && !gfc_option.flag_realloc_lhs)
189 /* Skip the test for pure functions if -faggressive-function-elimination
191 if ((*e)->value.function.esym)
193 /* Don't create an array temporary for elemental functions. */
194 if ((*e)->value.function.esym->attr.elemental && (*e)->rank > 0)
197 /* Only eliminate potentially impure functions if the
198 user specifically requested it. */
199 if (!gfc_option.flag_aggressive_function_elimination
200 && !(*e)->value.function.esym->attr.pure
201 && !(*e)->value.function.esym->attr.implicit_pure)
205 if ((*e)->value.function.isym)
207 /* Conversions are handled on the fly by the middle end,
208 transpose during trans-* stages and TRANSFER by the middle end. */
209 if ((*e)->value.function.isym->id == GFC_ISYM_CONVERSION
210 || (*e)->value.function.isym->id == GFC_ISYM_TRANSFER
211 || gfc_inline_intrinsic_function_p (*e))
214 /* Don't create an array temporary for elemental functions,
215 as this would be wasteful of memory.
216 FIXME: Create a scalar temporary during scalarization. */
217 if ((*e)->value.function.isym->elemental && (*e)->rank > 0)
220 if (!(*e)->value.function.isym->pure)
224 if (expr_count >= expr_size)
226 expr_size += expr_size;
227 expr_array = XRESIZEVEC(gfc_expr **, expr_array, expr_size);
229 expr_array[expr_count] = e;
234 /* Returns a new expression (a variable) to be used in place of the old one,
235 with an an assignment statement before the current statement to set
236 the value of the variable. Creates a new BLOCK for the statement if
237 that hasn't already been done and puts the statement, plus the
238 newly created variables, in that block. */
241 create_var (gfc_expr * e)
243 char name[GFC_MAX_SYMBOL_LEN +1];
245 gfc_symtree *symtree;
252 /* If the block hasn't already been created, do so. */
253 if (inserted_block == NULL)
255 inserted_block = XCNEW (gfc_code);
256 inserted_block->op = EXEC_BLOCK;
257 inserted_block->loc = (*current_code)->loc;
258 ns = gfc_build_block_ns (current_ns);
259 inserted_block->ext.block.ns = ns;
260 inserted_block->ext.block.assoc = NULL;
262 ns->code = *current_code;
263 inserted_block->next = (*current_code)->next;
264 changed_statement = &(inserted_block->ext.block.ns->code);
265 (*current_code)->next = NULL;
266 /* Insert the BLOCK at the right position. */
267 *current_code = inserted_block;
268 ns->parent = current_ns;
271 ns = inserted_block->ext.block.ns;
273 sprintf(name, "__var_%d",num++);
274 if (gfc_get_sym_tree (name, ns, &symtree, false) != 0)
277 symbol = symtree->n.sym;
282 symbol->as = gfc_get_array_spec ();
283 symbol->as->rank = e->rank;
285 if (e->shape == NULL)
287 /* We don't know the shape at compile time, so we use an
289 symbol->as->type = AS_DEFERRED;
290 symbol->attr.allocatable = 1;
294 symbol->as->type = AS_EXPLICIT;
295 /* Copy the shape. */
296 for (i=0; i<e->rank; i++)
300 p = gfc_get_constant_expr (BT_INTEGER, gfc_default_integer_kind,
302 mpz_set_si (p->value.integer, 1);
303 symbol->as->lower[i] = p;
305 q = gfc_get_constant_expr (BT_INTEGER, gfc_index_integer_kind,
307 mpz_set (q->value.integer, e->shape[i]);
308 symbol->as->upper[i] = q;
313 symbol->attr.flavor = FL_VARIABLE;
314 symbol->attr.referenced = 1;
315 symbol->attr.dimension = e->rank > 0;
316 gfc_commit_symbol (symbol);
318 result = gfc_get_expr ();
319 result->expr_type = EXPR_VARIABLE;
321 result->rank = e->rank;
322 result->shape = gfc_copy_shape (e->shape, e->rank);
323 result->symtree = symtree;
324 result->where = e->where;
327 result->ref = gfc_get_ref ();
328 result->ref->type = REF_ARRAY;
329 result->ref->u.ar.type = AR_FULL;
330 result->ref->u.ar.where = e->where;
331 result->ref->u.ar.as = symbol->as;
332 if (gfc_option.warn_array_temp)
333 gfc_warning ("Creating array temporary at %L", &(e->where));
336 /* Generate the new assignment. */
337 n = XCNEW (gfc_code);
339 n->loc = (*current_code)->loc;
340 n->next = *changed_statement;
341 n->expr1 = gfc_copy_expr (result);
343 *changed_statement = n;
348 /* Warn about function elimination. */
351 warn_function_elimination (gfc_expr *e)
353 if (e->expr_type != EXPR_FUNCTION)
355 if (e->value.function.esym)
356 gfc_warning ("Removing call to function '%s' at %L",
357 e->value.function.esym->name, &(e->where));
358 else if (e->value.function.isym)
359 gfc_warning ("Removing call to function '%s' at %L",
360 e->value.function.isym->name, &(e->where));
362 /* Callback function for the code walker for doing common function
363 elimination. This builds up the list of functions in the expression
364 and goes through them to detect duplicates, which it then replaces
368 cfe_expr_0 (gfc_expr **e, int *walk_subtrees,
369 void *data ATTRIBUTE_UNUSED)
374 /* Don't do this optimization within OMP workshare. */
376 if (in_omp_workshare)
384 gfc_expr_walker (e, cfe_register_funcs, NULL);
386 /* Walk through all the functions. */
388 for (i=1; i<expr_count; i++)
390 /* Skip if the function has been replaced by a variable already. */
391 if ((*(expr_array[i]))->expr_type == EXPR_VARIABLE)
397 if (gfc_dep_compare_functions(*(expr_array[i]),
398 *(expr_array[j]), true) == 0)
401 newvar = create_var (*(expr_array[i]));
403 if (gfc_option.warn_function_elimination)
404 warn_function_elimination (*(expr_array[j]));
406 free (*(expr_array[j]));
407 *(expr_array[j]) = gfc_copy_expr (newvar);
411 *(expr_array[i]) = newvar;
414 /* We did all the necessary walking in this function. */
419 /* Callback function for common function elimination, called from
420 gfc_code_walker. This keeps track of the current code, in order
421 to insert statements as needed. */
424 cfe_code (gfc_code **c, int *walk_subtrees ATTRIBUTE_UNUSED,
425 void *data ATTRIBUTE_UNUSED)
428 inserted_block = NULL;
429 changed_statement = NULL;
433 /* Dummy function for expression call back, for use when we
434 really don't want to do any walking. */
437 dummy_expr_callback (gfc_expr **e ATTRIBUTE_UNUSED, int *walk_subtrees,
438 void *data ATTRIBUTE_UNUSED)
444 /* Code callback function for converting
451 This is because common function elimination would otherwise place the
452 temporary variables outside the loop. */
455 convert_do_while (gfc_code **c, int *walk_subtrees ATTRIBUTE_UNUSED,
456 void *data ATTRIBUTE_UNUSED)
459 gfc_code *c_if1, *c_if2, *c_exit;
461 gfc_expr *e_not, *e_cond;
463 if (co->op != EXEC_DO_WHILE)
466 if (co->expr1 == NULL || co->expr1->expr_type == EXPR_CONSTANT)
471 /* Generate the condition of the if statement, which is .not. the original
473 e_not = gfc_get_expr ();
474 e_not->ts = e_cond->ts;
475 e_not->where = e_cond->where;
476 e_not->expr_type = EXPR_OP;
477 e_not->value.op.op = INTRINSIC_NOT;
478 e_not->value.op.op1 = e_cond;
480 /* Generate the EXIT statement. */
481 c_exit = XCNEW (gfc_code);
482 c_exit->op = EXEC_EXIT;
483 c_exit->ext.which_construct = co;
484 c_exit->loc = co->loc;
486 /* Generate the IF statement. */
487 c_if2 = XCNEW (gfc_code);
489 c_if2->expr1 = e_not;
490 c_if2->next = c_exit;
491 c_if2->loc = co->loc;
493 /* ... plus the one to chain it to. */
494 c_if1 = XCNEW (gfc_code);
496 c_if1->block = c_if2;
497 c_if1->loc = co->loc;
499 /* Make the DO WHILE loop into a DO block by replacing the condition
500 with a true constant. */
501 co->expr1 = gfc_get_logical_expr (gfc_default_integer_kind, &co->loc, true);
503 /* Hang the generated if statement into the loop body. */
505 loopblock = co->block->next;
506 co->block->next = c_if1;
507 c_if1->next = loopblock;
512 /* Optimize a namespace, including all contained namespaces. */
515 optimize_namespace (gfc_namespace *ns)
520 in_omp_workshare = false;
522 gfc_code_walker (&ns->code, convert_do_while, dummy_expr_callback, NULL);
523 gfc_code_walker (&ns->code, cfe_code, cfe_expr_0, NULL);
524 gfc_code_walker (&ns->code, optimize_code, optimize_expr, NULL);
526 /* BLOCKs are handled in the expression walker below. */
527 for (ns = ns->contained; ns; ns = ns->sibling)
529 if (ns->code == NULL || ns->code->op != EXEC_BLOCK)
530 optimize_namespace (ns);
537 a = matmul(b,c) ; a = a + d
538 where the array function is not elemental and not allocatable
539 and does not depend on the left-hand side.
543 optimize_binop_array_assignment (gfc_code *c, gfc_expr **rhs, bool seen_op)
548 if (e->expr_type == EXPR_OP)
550 switch (e->value.op.op)
552 /* Unary operators and exponentiation: Only look at a single
555 case INTRINSIC_UPLUS:
556 case INTRINSIC_UMINUS:
557 case INTRINSIC_PARENTHESES:
558 case INTRINSIC_POWER:
559 if (optimize_binop_array_assignment (c, &e->value.op.op1, seen_op))
564 /* Binary operators. */
565 if (optimize_binop_array_assignment (c, &e->value.op.op1, true))
568 if (optimize_binop_array_assignment (c, &e->value.op.op2, true))
574 else if (seen_op && e->expr_type == EXPR_FUNCTION && e->rank > 0
575 && ! (e->value.function.esym
576 && (e->value.function.esym->attr.elemental
577 || e->value.function.esym->attr.allocatable
578 || e->value.function.esym->ts.type != c->expr1->ts.type
579 || e->value.function.esym->ts.kind != c->expr1->ts.kind))
580 && ! (e->value.function.isym
581 && (e->value.function.isym->elemental
582 || e->ts.type != c->expr1->ts.type
583 || e->ts.kind != c->expr1->ts.kind))
584 && ! gfc_inline_intrinsic_function_p (e))
590 /* Insert a new assignment statement after the current one. */
591 n = XCNEW (gfc_code);
597 n->expr1 = gfc_copy_expr (c->expr1);
599 new_expr = gfc_copy_expr (c->expr1);
607 /* Nothing to optimize. */
611 /* Remove unneeded TRIMs at the end of expressions. */
614 remove_trim (gfc_expr *rhs)
620 /* Check for a // b // trim(c). Looping is probably not
621 necessary because the parser usually generates
622 (// (// a b ) trim(c) ) , but better safe than sorry. */
624 while (rhs->expr_type == EXPR_OP
625 && rhs->value.op.op == INTRINSIC_CONCAT)
626 rhs = rhs->value.op.op2;
628 while (rhs->expr_type == EXPR_FUNCTION && rhs->value.function.isym
629 && rhs->value.function.isym->id == GFC_ISYM_TRIM)
631 strip_function_call (rhs);
632 /* Recursive call to catch silly stuff like trim ( a // trim(b)). */
640 /* Optimizations for an assignment. */
643 optimize_assignment (gfc_code * c)
650 /* Optimize away a = trim(b), where a is a character variable. */
652 if (lhs->ts.type == BT_CHARACTER)
655 if (lhs->rank > 0 && gfc_check_dependency (lhs, rhs, true) == 0)
656 optimize_binop_array_assignment (c, &rhs, false);
660 /* Remove an unneeded function call, modifying the expression.
661 This replaces the function call with the value of its
662 first argument. The rest of the argument list is freed. */
665 strip_function_call (gfc_expr *e)
668 gfc_actual_arglist *a;
670 a = e->value.function.actual;
672 /* We should have at least one argument. */
673 gcc_assert (a->expr != NULL);
677 /* Free the remaining arglist, if any. */
679 gfc_free_actual_arglist (a->next);
681 /* Graft the argument expression onto the original function. */
687 /* Optimization of lexical comparison functions. */
690 optimize_lexical_comparison (gfc_expr *e)
692 if (e->expr_type != EXPR_FUNCTION || e->value.function.isym == NULL)
695 switch (e->value.function.isym->id)
698 return optimize_comparison (e, INTRINSIC_LE);
701 return optimize_comparison (e, INTRINSIC_GE);
704 return optimize_comparison (e, INTRINSIC_GT);
707 return optimize_comparison (e, INTRINSIC_LT);
715 /* Recursive optimization of operators. */
718 optimize_op (gfc_expr *e)
720 gfc_intrinsic_op op = e->value.op.op;
725 case INTRINSIC_EQ_OS:
727 case INTRINSIC_GE_OS:
729 case INTRINSIC_LE_OS:
731 case INTRINSIC_NE_OS:
733 case INTRINSIC_GT_OS:
735 case INTRINSIC_LT_OS:
736 return optimize_comparison (e, op);
745 /* Optimize expressions for equality. */
748 optimize_comparison (gfc_expr *e, gfc_intrinsic_op op)
754 gfc_actual_arglist *firstarg, *secondarg;
756 if (e->expr_type == EXPR_OP)
760 op1 = e->value.op.op1;
761 op2 = e->value.op.op2;
763 else if (e->expr_type == EXPR_FUNCTION)
765 /* One of the lexical comparision functions. */
766 firstarg = e->value.function.actual;
767 secondarg = firstarg->next;
768 op1 = firstarg->expr;
769 op2 = secondarg->expr;
774 /* Strip off unneeded TRIM calls from string comparisons. */
776 change = remove_trim (op1);
778 if (remove_trim (op2))
781 /* An expression of type EXPR_CONSTANT is only valid for scalars. */
782 /* TODO: A scalar constant may be acceptable in some cases (the scalarizer
783 handles them well). However, there are also cases that need a non-scalar
784 argument. For example the any intrinsic. See PR 45380. */
788 /* Don't compare REAL or COMPLEX expressions when honoring NaNs. */
790 if (flag_finite_math_only
791 || (op1->ts.type != BT_REAL && op2->ts.type != BT_REAL
792 && op1->ts.type != BT_COMPLEX && op2->ts.type != BT_COMPLEX))
794 eq = gfc_dep_compare_expr (op1, op2);
797 /* Replace A // B < A // C with B < C, and A // B < C // B
799 if (op1->ts.type == BT_CHARACTER && op2->ts.type == BT_CHARACTER
800 && op1->value.op.op == INTRINSIC_CONCAT
801 && op2->value.op.op == INTRINSIC_CONCAT)
803 gfc_expr *op1_left = op1->value.op.op1;
804 gfc_expr *op2_left = op2->value.op.op1;
805 gfc_expr *op1_right = op1->value.op.op2;
806 gfc_expr *op2_right = op2->value.op.op2;
808 if (gfc_dep_compare_expr (op1_left, op2_left) == 0)
810 /* Watch out for 'A ' // x vs. 'A' // x. */
812 if (op1_left->expr_type == EXPR_CONSTANT
813 && op2_left->expr_type == EXPR_CONSTANT
814 && op1_left->value.character.length
815 != op2_left->value.character.length)
823 firstarg->expr = op1_right;
824 secondarg->expr = op2_right;
828 e->value.op.op1 = op1_right;
829 e->value.op.op2 = op2_right;
831 optimize_comparison (e, op);
835 if (gfc_dep_compare_expr (op1_right, op2_right) == 0)
841 firstarg->expr = op1_left;
842 secondarg->expr = op2_left;
846 e->value.op.op1 = op1_left;
847 e->value.op.op2 = op2_left;
850 optimize_comparison (e, op);
857 /* eq can only be -1, 0 or 1 at this point. */
861 case INTRINSIC_EQ_OS:
866 case INTRINSIC_GE_OS:
871 case INTRINSIC_LE_OS:
876 case INTRINSIC_NE_OS:
881 case INTRINSIC_GT_OS:
886 case INTRINSIC_LT_OS:
891 gfc_internal_error ("illegal OP in optimize_comparison");
895 /* Replace the expression by a constant expression. The typespec
896 and where remains the way it is. */
899 e->expr_type = EXPR_CONSTANT;
900 e->value.logical = result;
908 /* Optimize a trim function by replacing it with an equivalent substring
909 involving a call to len_trim. This only works for expressions where
910 variables are trimmed. Return true if anything was modified. */
913 optimize_trim (gfc_expr *e)
918 gfc_actual_arglist *actual_arglist, *next;
921 /* Don't do this optimization within an argument list, because
922 otherwise aliasing issues may occur. */
924 if (count_arglist != 1)
927 if (e->ts.type != BT_CHARACTER || e->expr_type != EXPR_FUNCTION
928 || e->value.function.isym == NULL
929 || e->value.function.isym->id != GFC_ISYM_TRIM)
932 a = e->value.function.actual->expr;
934 if (a->expr_type != EXPR_VARIABLE)
937 /* Follow all references to find the correct place to put the newly
938 created reference. FIXME: Also handle substring references and
939 array references. Array references cause strange regressions at
944 for (rr = &(a->ref); *rr; rr = &((*rr)->next))
946 if ((*rr)->type == REF_SUBSTRING || (*rr)->type == REF_ARRAY)
951 strip_function_call (e);
956 /* Create the reference. */
958 ref = gfc_get_ref ();
959 ref->type = REF_SUBSTRING;
961 /* Set the start of the reference. */
963 ref->u.ss.start = gfc_get_int_expr (gfc_default_integer_kind, NULL, 1);
965 /* Build the function call to len_trim(x, gfc_defaul_integer_kind). */
967 fcn = gfc_get_expr ();
968 fcn->expr_type = EXPR_FUNCTION;
969 fcn->value.function.isym =
970 gfc_intrinsic_function_by_id (GFC_ISYM_LEN_TRIM);
971 actual_arglist = gfc_get_actual_arglist ();
972 actual_arglist->expr = gfc_copy_expr (e);
973 next = gfc_get_actual_arglist ();
974 next->expr = gfc_get_int_expr (gfc_default_integer_kind, NULL,
975 gfc_default_integer_kind);
976 actual_arglist->next = next;
977 fcn->value.function.actual = actual_arglist;
979 /* Set the end of the reference to the call to len_trim. */
982 gcc_assert (*rr == NULL);
987 /* Optimize minloc(b), where b is rank 1 array, into
988 (/ minloc(b, dim=1) /), and similarly for maxloc,
989 as the latter forms are expanded inline. */
992 optimize_minmaxloc (gfc_expr **e)
995 gfc_actual_arglist *a;
999 || fn->value.function.actual == NULL
1000 || fn->value.function.actual->expr == NULL
1001 || fn->value.function.actual->expr->rank != 1)
1004 *e = gfc_get_array_expr (fn->ts.type, fn->ts.kind, &fn->where);
1005 (*e)->shape = fn->shape;
1008 gfc_constructor_append_expr (&(*e)->value.constructor, fn, &fn->where);
1010 name = XALLOCAVEC (char, strlen (fn->value.function.name) + 1);
1011 strcpy (name, fn->value.function.name);
1012 p = strstr (name, "loc0");
1014 fn->value.function.name = gfc_get_string (name);
1015 if (fn->value.function.actual->next)
1017 a = fn->value.function.actual->next;
1018 gcc_assert (a->expr == NULL);
1022 a = gfc_get_actual_arglist ();
1023 fn->value.function.actual->next = a;
1025 a->expr = gfc_get_constant_expr (BT_INTEGER, gfc_default_integer_kind,
1027 mpz_set_ui (a->expr->value.integer, 1);
1030 #define WALK_SUBEXPR(NODE) \
1033 result = gfc_expr_walker (&(NODE), exprfn, data); \
1038 #define WALK_SUBEXPR_TAIL(NODE) e = &(NODE); continue
1040 /* Walk expression *E, calling EXPRFN on each expression in it. */
1043 gfc_expr_walker (gfc_expr **e, walk_expr_fn_t exprfn, void *data)
1047 int walk_subtrees = 1;
1048 gfc_actual_arglist *a;
1052 int result = exprfn (e, &walk_subtrees, data);
1056 switch ((*e)->expr_type)
1059 WALK_SUBEXPR ((*e)->value.op.op1);
1060 WALK_SUBEXPR_TAIL ((*e)->value.op.op2);
1063 for (a = (*e)->value.function.actual; a; a = a->next)
1064 WALK_SUBEXPR (a->expr);
1068 WALK_SUBEXPR ((*e)->value.compcall.base_object);
1069 for (a = (*e)->value.compcall.actual; a; a = a->next)
1070 WALK_SUBEXPR (a->expr);
1073 case EXPR_STRUCTURE:
1075 for (c = gfc_constructor_first ((*e)->value.constructor); c;
1076 c = gfc_constructor_next (c))
1078 WALK_SUBEXPR (c->expr);
1079 if (c->iterator != NULL)
1081 WALK_SUBEXPR (c->iterator->var);
1082 WALK_SUBEXPR (c->iterator->start);
1083 WALK_SUBEXPR (c->iterator->end);
1084 WALK_SUBEXPR (c->iterator->step);
1088 if ((*e)->expr_type != EXPR_ARRAY)
1091 /* Fall through to the variable case in order to walk the
1094 case EXPR_SUBSTRING:
1096 for (r = (*e)->ref; r; r = r->next)
1105 if (ar->type == AR_SECTION || ar->type == AR_ELEMENT)
1107 for (i=0; i< ar->dimen; i++)
1109 WALK_SUBEXPR (ar->start[i]);
1110 WALK_SUBEXPR (ar->end[i]);
1111 WALK_SUBEXPR (ar->stride[i]);
1118 WALK_SUBEXPR (r->u.ss.start);
1119 WALK_SUBEXPR (r->u.ss.end);
1135 #define WALK_SUBCODE(NODE) \
1138 result = gfc_code_walker (&(NODE), codefn, exprfn, data); \
1144 /* Walk code *C, calling CODEFN on each gfc_code node in it and calling EXPRFN
1145 on each expression in it. If any of the hooks returns non-zero, that
1146 value is immediately returned. If the hook sets *WALK_SUBTREES to 0,
1147 no subcodes or subexpressions are traversed. */
1150 gfc_code_walker (gfc_code **c, walk_code_fn_t codefn, walk_expr_fn_t exprfn,
1153 for (; *c; c = &(*c)->next)
1155 int walk_subtrees = 1;
1156 int result = codefn (c, &walk_subtrees, data);
1163 gfc_actual_arglist *a;
1165 gfc_association_list *alist;
1166 bool saved_in_omp_workshare;
1168 /* There might be statement insertions before the current code,
1169 which must not affect the expression walker. */
1172 saved_in_omp_workshare = in_omp_workshare;
1178 WALK_SUBCODE (co->ext.block.ns->code);
1179 for (alist = co->ext.block.assoc; alist; alist = alist->next)
1180 WALK_SUBEXPR (alist->target);
1184 WALK_SUBEXPR (co->ext.iterator->var);
1185 WALK_SUBEXPR (co->ext.iterator->start);
1186 WALK_SUBEXPR (co->ext.iterator->end);
1187 WALK_SUBEXPR (co->ext.iterator->step);
1191 case EXEC_ASSIGN_CALL:
1192 for (a = co->ext.actual; a; a = a->next)
1193 WALK_SUBEXPR (a->expr);
1197 WALK_SUBEXPR (co->expr1);
1198 for (a = co->ext.actual; a; a = a->next)
1199 WALK_SUBEXPR (a->expr);
1203 WALK_SUBEXPR (co->expr1);
1204 for (b = co->block; b; b = b->block)
1207 for (cp = b->ext.block.case_list; cp; cp = cp->next)
1209 WALK_SUBEXPR (cp->low);
1210 WALK_SUBEXPR (cp->high);
1212 WALK_SUBCODE (b->next);
1217 case EXEC_DEALLOCATE:
1220 for (a = co->ext.alloc.list; a; a = a->next)
1221 WALK_SUBEXPR (a->expr);
1226 case EXEC_DO_CONCURRENT:
1228 gfc_forall_iterator *fa;
1229 for (fa = co->ext.forall_iterator; fa; fa = fa->next)
1231 WALK_SUBEXPR (fa->var);
1232 WALK_SUBEXPR (fa->start);
1233 WALK_SUBEXPR (fa->end);
1234 WALK_SUBEXPR (fa->stride);
1236 if (co->op == EXEC_FORALL)
1242 WALK_SUBEXPR (co->ext.open->unit);
1243 WALK_SUBEXPR (co->ext.open->file);
1244 WALK_SUBEXPR (co->ext.open->status);
1245 WALK_SUBEXPR (co->ext.open->access);
1246 WALK_SUBEXPR (co->ext.open->form);
1247 WALK_SUBEXPR (co->ext.open->recl);
1248 WALK_SUBEXPR (co->ext.open->blank);
1249 WALK_SUBEXPR (co->ext.open->position);
1250 WALK_SUBEXPR (co->ext.open->action);
1251 WALK_SUBEXPR (co->ext.open->delim);
1252 WALK_SUBEXPR (co->ext.open->pad);
1253 WALK_SUBEXPR (co->ext.open->iostat);
1254 WALK_SUBEXPR (co->ext.open->iomsg);
1255 WALK_SUBEXPR (co->ext.open->convert);
1256 WALK_SUBEXPR (co->ext.open->decimal);
1257 WALK_SUBEXPR (co->ext.open->encoding);
1258 WALK_SUBEXPR (co->ext.open->round);
1259 WALK_SUBEXPR (co->ext.open->sign);
1260 WALK_SUBEXPR (co->ext.open->asynchronous);
1261 WALK_SUBEXPR (co->ext.open->id);
1262 WALK_SUBEXPR (co->ext.open->newunit);
1266 WALK_SUBEXPR (co->ext.close->unit);
1267 WALK_SUBEXPR (co->ext.close->status);
1268 WALK_SUBEXPR (co->ext.close->iostat);
1269 WALK_SUBEXPR (co->ext.close->iomsg);
1272 case EXEC_BACKSPACE:
1276 WALK_SUBEXPR (co->ext.filepos->unit);
1277 WALK_SUBEXPR (co->ext.filepos->iostat);
1278 WALK_SUBEXPR (co->ext.filepos->iomsg);
1282 WALK_SUBEXPR (co->ext.inquire->unit);
1283 WALK_SUBEXPR (co->ext.inquire->file);
1284 WALK_SUBEXPR (co->ext.inquire->iomsg);
1285 WALK_SUBEXPR (co->ext.inquire->iostat);
1286 WALK_SUBEXPR (co->ext.inquire->exist);
1287 WALK_SUBEXPR (co->ext.inquire->opened);
1288 WALK_SUBEXPR (co->ext.inquire->number);
1289 WALK_SUBEXPR (co->ext.inquire->named);
1290 WALK_SUBEXPR (co->ext.inquire->name);
1291 WALK_SUBEXPR (co->ext.inquire->access);
1292 WALK_SUBEXPR (co->ext.inquire->sequential);
1293 WALK_SUBEXPR (co->ext.inquire->direct);
1294 WALK_SUBEXPR (co->ext.inquire->form);
1295 WALK_SUBEXPR (co->ext.inquire->formatted);
1296 WALK_SUBEXPR (co->ext.inquire->unformatted);
1297 WALK_SUBEXPR (co->ext.inquire->recl);
1298 WALK_SUBEXPR (co->ext.inquire->nextrec);
1299 WALK_SUBEXPR (co->ext.inquire->blank);
1300 WALK_SUBEXPR (co->ext.inquire->position);
1301 WALK_SUBEXPR (co->ext.inquire->action);
1302 WALK_SUBEXPR (co->ext.inquire->read);
1303 WALK_SUBEXPR (co->ext.inquire->write);
1304 WALK_SUBEXPR (co->ext.inquire->readwrite);
1305 WALK_SUBEXPR (co->ext.inquire->delim);
1306 WALK_SUBEXPR (co->ext.inquire->encoding);
1307 WALK_SUBEXPR (co->ext.inquire->pad);
1308 WALK_SUBEXPR (co->ext.inquire->iolength);
1309 WALK_SUBEXPR (co->ext.inquire->convert);
1310 WALK_SUBEXPR (co->ext.inquire->strm_pos);
1311 WALK_SUBEXPR (co->ext.inquire->asynchronous);
1312 WALK_SUBEXPR (co->ext.inquire->decimal);
1313 WALK_SUBEXPR (co->ext.inquire->pending);
1314 WALK_SUBEXPR (co->ext.inquire->id);
1315 WALK_SUBEXPR (co->ext.inquire->sign);
1316 WALK_SUBEXPR (co->ext.inquire->size);
1317 WALK_SUBEXPR (co->ext.inquire->round);
1321 WALK_SUBEXPR (co->ext.wait->unit);
1322 WALK_SUBEXPR (co->ext.wait->iostat);
1323 WALK_SUBEXPR (co->ext.wait->iomsg);
1324 WALK_SUBEXPR (co->ext.wait->id);
1329 WALK_SUBEXPR (co->ext.dt->io_unit);
1330 WALK_SUBEXPR (co->ext.dt->format_expr);
1331 WALK_SUBEXPR (co->ext.dt->rec);
1332 WALK_SUBEXPR (co->ext.dt->advance);
1333 WALK_SUBEXPR (co->ext.dt->iostat);
1334 WALK_SUBEXPR (co->ext.dt->size);
1335 WALK_SUBEXPR (co->ext.dt->iomsg);
1336 WALK_SUBEXPR (co->ext.dt->id);
1337 WALK_SUBEXPR (co->ext.dt->pos);
1338 WALK_SUBEXPR (co->ext.dt->asynchronous);
1339 WALK_SUBEXPR (co->ext.dt->blank);
1340 WALK_SUBEXPR (co->ext.dt->decimal);
1341 WALK_SUBEXPR (co->ext.dt->delim);
1342 WALK_SUBEXPR (co->ext.dt->pad);
1343 WALK_SUBEXPR (co->ext.dt->round);
1344 WALK_SUBEXPR (co->ext.dt->sign);
1345 WALK_SUBEXPR (co->ext.dt->extra_comma);
1348 case EXEC_OMP_PARALLEL:
1349 case EXEC_OMP_PARALLEL_DO:
1350 case EXEC_OMP_PARALLEL_SECTIONS:
1352 in_omp_workshare = false;
1354 /* This goto serves as a shortcut to avoid code
1355 duplication or a larger if or switch statement. */
1356 goto check_omp_clauses;
1358 case EXEC_OMP_WORKSHARE:
1359 case EXEC_OMP_PARALLEL_WORKSHARE:
1361 in_omp_workshare = true;
1366 case EXEC_OMP_SECTIONS:
1367 case EXEC_OMP_SINGLE:
1368 case EXEC_OMP_END_SINGLE:
1371 /* Come to this label only from the
1372 EXEC_OMP_PARALLEL_* cases above. */
1376 if (co->ext.omp_clauses)
1378 WALK_SUBEXPR (co->ext.omp_clauses->if_expr);
1379 WALK_SUBEXPR (co->ext.omp_clauses->final_expr);
1380 WALK_SUBEXPR (co->ext.omp_clauses->num_threads);
1381 WALK_SUBEXPR (co->ext.omp_clauses->chunk_size);
1388 WALK_SUBEXPR (co->expr1);
1389 WALK_SUBEXPR (co->expr2);
1390 WALK_SUBEXPR (co->expr3);
1391 WALK_SUBEXPR (co->expr4);
1392 for (b = co->block; b; b = b->block)
1394 WALK_SUBEXPR (b->expr1);
1395 WALK_SUBEXPR (b->expr2);
1396 WALK_SUBCODE (b->next);
1399 if (co->op == EXEC_FORALL)
1402 in_omp_workshare = saved_in_omp_workshare;