2 Copyright (C) 2000, 2001, 2002, 2004, 2005, 2006, 2007
3 Free Software Foundation, Inc.
4 Contributed by Andy Vaught
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
27 /* This parameter is the size of the largest array constructor that we
28 will expand to an array constructor without iterators.
29 Constructors larger than this will remain in the iterator form. */
31 #define GFC_MAX_AC_EXPAND 65535
34 /**************** Array reference matching subroutines *****************/
36 /* Copy an array reference structure. */
39 gfc_copy_array_ref (gfc_array_ref *src)
47 dest = gfc_get_array_ref ();
51 for (i = 0; i < GFC_MAX_DIMENSIONS; i++)
53 dest->start[i] = gfc_copy_expr (src->start[i]);
54 dest->end[i] = gfc_copy_expr (src->end[i]);
55 dest->stride[i] = gfc_copy_expr (src->stride[i]);
58 dest->offset = gfc_copy_expr (src->offset);
64 /* Match a single dimension of an array reference. This can be a
65 single element or an array section. Any modifications we've made
66 to the ar structure are cleaned up by the caller. If the init
67 is set, we require the subscript to be a valid initialization
71 match_subscript (gfc_array_ref *ar, int init)
78 ar->c_where[i] = gfc_current_locus;
79 ar->start[i] = ar->end[i] = ar->stride[i] = NULL;
81 /* We can't be sure of the difference between DIMEN_ELEMENT and
82 DIMEN_VECTOR until we know the type of the element itself at
85 ar->dimen_type[i] = DIMEN_UNKNOWN;
87 if (gfc_match_char (':') == MATCH_YES)
90 /* Get start element. */
92 m = gfc_match_init_expr (&ar->start[i]);
94 m = gfc_match_expr (&ar->start[i]);
97 gfc_error ("Expected array subscript at %C");
101 if (gfc_match_char (':') == MATCH_NO)
104 /* Get an optional end element. Because we've seen the colon, we
105 definitely have a range along this dimension. */
107 ar->dimen_type[i] = DIMEN_RANGE;
110 m = gfc_match_init_expr (&ar->end[i]);
112 m = gfc_match_expr (&ar->end[i]);
114 if (m == MATCH_ERROR)
117 /* See if we have an optional stride. */
118 if (gfc_match_char (':') == MATCH_YES)
120 m = init ? gfc_match_init_expr (&ar->stride[i])
121 : gfc_match_expr (&ar->stride[i]);
124 gfc_error ("Expected array subscript stride at %C");
133 /* Match an array reference, whether it is the whole array or a
134 particular elements or a section. If init is set, the reference has
135 to consist of init expressions. */
138 gfc_match_array_ref (gfc_array_ref *ar, gfc_array_spec *as, int init)
142 memset (ar, '\0', sizeof (ar));
144 ar->where = gfc_current_locus;
147 if (gfc_match_char ('(') != MATCH_YES)
154 ar->type = AR_UNKNOWN;
156 for (ar->dimen = 0; ar->dimen < GFC_MAX_DIMENSIONS; ar->dimen++)
158 m = match_subscript (ar, init);
159 if (m == MATCH_ERROR)
162 if (gfc_match_char (')') == MATCH_YES)
165 if (gfc_match_char (',') != MATCH_YES)
167 gfc_error ("Invalid form of array reference at %C");
172 gfc_error ("Array reference at %C cannot have more than %d dimensions",
185 /************** Array specification matching subroutines ***************/
187 /* Free all of the expressions associated with array bounds
191 gfc_free_array_spec (gfc_array_spec *as)
198 for (i = 0; i < as->rank; i++)
200 gfc_free_expr (as->lower[i]);
201 gfc_free_expr (as->upper[i]);
208 /* Take an array bound, resolves the expression, that make up the
209 shape and check associated constraints. */
212 resolve_array_bound (gfc_expr *e, int check_constant)
217 if (gfc_resolve_expr (e) == FAILURE
218 || gfc_specification_expr (e) == FAILURE)
221 if (check_constant && gfc_is_constant_expr (e) == 0)
223 gfc_error ("Variable '%s' at %L in this context must be constant",
224 e->symtree->n.sym->name, &e->where);
232 /* Takes an array specification, resolves the expressions that make up
233 the shape and make sure everything is integral. */
236 gfc_resolve_array_spec (gfc_array_spec *as, int check_constant)
244 for (i = 0; i < as->rank; i++)
247 if (resolve_array_bound (e, check_constant) == FAILURE)
251 if (resolve_array_bound (e, check_constant) == FAILURE)
254 if ((as->lower[i] == NULL) || (as->upper[i] == NULL))
257 /* If the size is negative in this dimension, set it to zero. */
258 if (as->lower[i]->expr_type == EXPR_CONSTANT
259 && as->upper[i]->expr_type == EXPR_CONSTANT
260 && mpz_cmp (as->upper[i]->value.integer,
261 as->lower[i]->value.integer) < 0)
263 gfc_free_expr (as->upper[i]);
264 as->upper[i] = gfc_copy_expr (as->lower[i]);
265 mpz_sub_ui (as->upper[i]->value.integer,
266 as->upper[i]->value.integer, 1);
274 /* Match a single array element specification. The return values as
275 well as the upper and lower bounds of the array spec are filled
276 in according to what we see on the input. The caller makes sure
277 individual specifications make sense as a whole.
280 Parsed Lower Upper Returned
281 ------------------------------------
282 : NULL NULL AS_DEFERRED (*)
284 x: x NULL AS_ASSUMED_SHAPE
286 x:* x NULL AS_ASSUMED_SIZE
287 * 1 NULL AS_ASSUMED_SIZE
289 (*) For non-pointer dummy arrays this is AS_ASSUMED_SHAPE. This
290 is fixed during the resolution of formal interfaces.
292 Anything else AS_UNKNOWN. */
295 match_array_element_spec (gfc_array_spec *as)
297 gfc_expr **upper, **lower;
300 lower = &as->lower[as->rank - 1];
301 upper = &as->upper[as->rank - 1];
303 if (gfc_match_char ('*') == MATCH_YES)
305 *lower = gfc_int_expr (1);
306 return AS_ASSUMED_SIZE;
309 if (gfc_match_char (':') == MATCH_YES)
312 m = gfc_match_expr (upper);
314 gfc_error ("Expected expression in array specification at %C");
318 if (gfc_match_char (':') == MATCH_NO)
320 *lower = gfc_int_expr (1);
327 if (gfc_match_char ('*') == MATCH_YES)
328 return AS_ASSUMED_SIZE;
330 m = gfc_match_expr (upper);
331 if (m == MATCH_ERROR)
334 return AS_ASSUMED_SHAPE;
340 /* Matches an array specification, incidentally figuring out what sort
344 gfc_match_array_spec (gfc_array_spec **asp)
346 array_type current_type;
350 if (gfc_match_char ('(') != MATCH_YES)
356 as = gfc_get_array_spec ();
358 for (i = 0; i < GFC_MAX_DIMENSIONS; i++)
368 current_type = match_array_element_spec (as);
372 if (current_type == AS_UNKNOWN)
374 as->type = current_type;
378 { /* See how current spec meshes with the existing. */
383 if (current_type == AS_ASSUMED_SIZE)
385 as->type = AS_ASSUMED_SIZE;
389 if (current_type == AS_EXPLICIT)
392 gfc_error ("Bad array specification for an explicitly shaped "
397 case AS_ASSUMED_SHAPE:
398 if ((current_type == AS_ASSUMED_SHAPE)
399 || (current_type == AS_DEFERRED))
402 gfc_error ("Bad array specification for assumed shape "
407 if (current_type == AS_DEFERRED)
410 if (current_type == AS_ASSUMED_SHAPE)
412 as->type = AS_ASSUMED_SHAPE;
416 gfc_error ("Bad specification for deferred shape array at %C");
419 case AS_ASSUMED_SIZE:
420 gfc_error ("Bad specification for assumed size array at %C");
424 if (gfc_match_char (')') == MATCH_YES)
427 if (gfc_match_char (',') != MATCH_YES)
429 gfc_error ("Expected another dimension in array declaration at %C");
433 if (as->rank >= GFC_MAX_DIMENSIONS)
435 gfc_error ("Array specification at %C has more than %d dimensions",
443 /* If a lower bounds of an assumed shape array is blank, put in one. */
444 if (as->type == AS_ASSUMED_SHAPE)
446 for (i = 0; i < as->rank; i++)
448 if (as->lower[i] == NULL)
449 as->lower[i] = gfc_int_expr (1);
456 /* Something went wrong. */
457 gfc_free_array_spec (as);
462 /* Given a symbol and an array specification, modify the symbol to
463 have that array specification. The error locus is needed in case
464 something goes wrong. On failure, the caller must free the spec. */
467 gfc_set_array_spec (gfc_symbol *sym, gfc_array_spec *as, locus *error_loc)
472 if (gfc_add_dimension (&sym->attr, sym->name, error_loc) == FAILURE)
481 /* Copy an array specification. */
484 gfc_copy_array_spec (gfc_array_spec *src)
486 gfc_array_spec *dest;
492 dest = gfc_get_array_spec ();
496 for (i = 0; i < dest->rank; i++)
498 dest->lower[i] = gfc_copy_expr (dest->lower[i]);
499 dest->upper[i] = gfc_copy_expr (dest->upper[i]);
506 /* Returns nonzero if the two expressions are equal. Only handles integer
510 compare_bounds (gfc_expr *bound1, gfc_expr *bound2)
512 if (bound1 == NULL || bound2 == NULL
513 || bound1->expr_type != EXPR_CONSTANT
514 || bound2->expr_type != EXPR_CONSTANT
515 || bound1->ts.type != BT_INTEGER
516 || bound2->ts.type != BT_INTEGER)
517 gfc_internal_error ("gfc_compare_array_spec(): Array spec clobbered");
519 if (mpz_cmp (bound1->value.integer, bound2->value.integer) == 0)
526 /* Compares two array specifications. They must be constant or deferred
530 gfc_compare_array_spec (gfc_array_spec *as1, gfc_array_spec *as2)
534 if (as1 == NULL && as2 == NULL)
537 if (as1 == NULL || as2 == NULL)
540 if (as1->rank != as2->rank)
546 if (as1->type != as2->type)
549 if (as1->type == AS_EXPLICIT)
550 for (i = 0; i < as1->rank; i++)
552 if (compare_bounds (as1->lower[i], as2->lower[i]) == 0)
555 if (compare_bounds (as1->upper[i], as2->upper[i]) == 0)
563 /****************** Array constructor functions ******************/
565 /* Start an array constructor. The constructor starts with zero
566 elements and should be appended to by gfc_append_constructor(). */
569 gfc_start_constructor (bt type, int kind, locus *where)
573 result = gfc_get_expr ();
575 result->expr_type = EXPR_ARRAY;
578 result->ts.type = type;
579 result->ts.kind = kind;
580 result->where = *where;
585 /* Given an array constructor expression, append the new expression
586 node onto the constructor. */
589 gfc_append_constructor (gfc_expr *base, gfc_expr *new)
593 if (base->value.constructor == NULL)
594 base->value.constructor = c = gfc_get_constructor ();
597 c = base->value.constructor;
601 c->next = gfc_get_constructor ();
607 if (new->ts.type != base->ts.type || new->ts.kind != base->ts.kind)
608 gfc_internal_error ("gfc_append_constructor(): New node has wrong kind");
612 /* Given an array constructor expression, insert the new expression's
613 constructor onto the base's one according to the offset. */
616 gfc_insert_constructor (gfc_expr *base, gfc_constructor *c1)
618 gfc_constructor *c, *pre;
622 type = base->expr_type;
624 if (base->value.constructor == NULL)
625 base->value.constructor = c1;
628 c = pre = base->value.constructor;
631 if (type == EXPR_ARRAY)
633 t = mpz_cmp (c->n.offset, c1->n.offset);
641 gfc_error ("duplicated initializer");
662 base->value.constructor = c1;
668 /* Get a new constructor. */
671 gfc_get_constructor (void)
675 c = gfc_getmem (sizeof(gfc_constructor));
679 mpz_init_set_si (c->n.offset, 0);
680 mpz_init_set_si (c->repeat, 0);
685 /* Free chains of gfc_constructor structures. */
688 gfc_free_constructor (gfc_constructor *p)
690 gfc_constructor *next;
700 gfc_free_expr (p->expr);
701 if (p->iterator != NULL)
702 gfc_free_iterator (p->iterator, 1);
703 mpz_clear (p->n.offset);
704 mpz_clear (p->repeat);
710 /* Given an expression node that might be an array constructor and a
711 symbol, make sure that no iterators in this or child constructors
712 use the symbol as an implied-DO iterator. Returns nonzero if a
713 duplicate was found. */
716 check_duplicate_iterator (gfc_constructor *c, gfc_symbol *master)
720 for (; c; c = c->next)
724 if (e->expr_type == EXPR_ARRAY
725 && check_duplicate_iterator (e->value.constructor, master))
728 if (c->iterator == NULL)
731 if (c->iterator->var->symtree->n.sym == master)
733 gfc_error ("DO-iterator '%s' at %L is inside iterator of the "
734 "same name", master->name, &c->where);
744 /* Forward declaration because these functions are mutually recursive. */
745 static match match_array_cons_element (gfc_constructor **);
747 /* Match a list of array elements. */
750 match_array_list (gfc_constructor **result)
752 gfc_constructor *p, *head, *tail, *new;
759 old_loc = gfc_current_locus;
761 if (gfc_match_char ('(') == MATCH_NO)
764 memset (&iter, '\0', sizeof (gfc_iterator));
767 m = match_array_cons_element (&head);
773 if (gfc_match_char (',') != MATCH_YES)
781 m = gfc_match_iterator (&iter, 0);
784 if (m == MATCH_ERROR)
787 m = match_array_cons_element (&new);
788 if (m == MATCH_ERROR)
795 goto cleanup; /* Could be a complex constant */
801 if (gfc_match_char (',') != MATCH_YES)
810 if (gfc_match_char (')') != MATCH_YES)
813 if (check_duplicate_iterator (head, iter.var->symtree->n.sym))
820 e->expr_type = EXPR_ARRAY;
822 e->value.constructor = head;
824 p = gfc_get_constructor ();
825 p->where = gfc_current_locus;
826 p->iterator = gfc_get_iterator ();
835 gfc_error ("Syntax error in array constructor at %C");
839 gfc_free_constructor (head);
840 gfc_free_iterator (&iter, 0);
841 gfc_current_locus = old_loc;
846 /* Match a single element of an array constructor, which can be a
847 single expression or a list of elements. */
850 match_array_cons_element (gfc_constructor **result)
856 m = match_array_list (result);
860 m = gfc_match_expr (&expr);
864 p = gfc_get_constructor ();
865 p->where = gfc_current_locus;
873 /* Match an array constructor. */
876 gfc_match_array_constructor (gfc_expr **result)
878 gfc_constructor *head, *tail, *new;
882 const char *end_delim;
884 if (gfc_match (" (/") == MATCH_NO)
886 if (gfc_match (" [") == MATCH_NO)
890 if (gfc_notify_std (GFC_STD_F2003, "Fortran 2003: [...] "
891 "style array constructors at %C") == FAILURE)
899 where = gfc_current_locus;
902 if (gfc_match (end_delim) == MATCH_YES)
904 gfc_error ("Empty array constructor at %C is not allowed");
910 m = match_array_cons_element (&new);
911 if (m == MATCH_ERROR)
923 if (gfc_match_char (',') == MATCH_NO)
927 if (gfc_match (end_delim) == MATCH_NO)
930 expr = gfc_get_expr ();
932 expr->expr_type = EXPR_ARRAY;
934 expr->value.constructor = head;
935 /* Size must be calculated at resolution time. */
944 gfc_error ("Syntax error in array constructor at %C");
947 gfc_free_constructor (head);
953 /************** Check array constructors for correctness **************/
955 /* Given an expression, compare it's type with the type of the current
956 constructor. Returns nonzero if an error was issued. The
957 cons_state variable keeps track of whether the type of the
958 constructor being read or resolved is known to be good, bad or just
961 static gfc_typespec constructor_ts;
963 { CONS_START, CONS_GOOD, CONS_BAD }
967 check_element_type (gfc_expr *expr)
969 if (cons_state == CONS_BAD)
970 return 0; /* Suppress further errors */
972 if (cons_state == CONS_START)
974 if (expr->ts.type == BT_UNKNOWN)
975 cons_state = CONS_BAD;
978 cons_state = CONS_GOOD;
979 constructor_ts = expr->ts;
985 if (gfc_compare_types (&constructor_ts, &expr->ts))
988 gfc_error ("Element in %s array constructor at %L is %s",
989 gfc_typename (&constructor_ts), &expr->where,
990 gfc_typename (&expr->ts));
992 cons_state = CONS_BAD;
997 /* Recursive work function for gfc_check_constructor_type(). */
1000 check_constructor_type (gfc_constructor *c)
1004 for (; c; c = c->next)
1008 if (e->expr_type == EXPR_ARRAY)
1010 if (check_constructor_type (e->value.constructor) == FAILURE)
1016 if (check_element_type (e))
1024 /* Check that all elements of an array constructor are the same type.
1025 On FAILURE, an error has been generated. */
1028 gfc_check_constructor_type (gfc_expr *e)
1032 cons_state = CONS_START;
1033 gfc_clear_ts (&constructor_ts);
1035 t = check_constructor_type (e->value.constructor);
1036 if (t == SUCCESS && e->ts.type == BT_UNKNOWN)
1037 e->ts = constructor_ts;
1044 typedef struct cons_stack
1046 gfc_iterator *iterator;
1047 struct cons_stack *previous;
1051 static cons_stack *base;
1053 static try check_constructor (gfc_constructor *, try (*) (gfc_expr *));
1055 /* Check an EXPR_VARIABLE expression in a constructor to make sure
1056 that that variable is an iteration variables. */
1059 gfc_check_iter_variable (gfc_expr *expr)
1064 sym = expr->symtree->n.sym;
1066 for (c = base; c; c = c->previous)
1067 if (sym == c->iterator->var->symtree->n.sym)
1074 /* Recursive work function for gfc_check_constructor(). This amounts
1075 to calling the check function for each expression in the
1076 constructor, giving variables with the names of iterators a pass. */
1079 check_constructor (gfc_constructor *c, try (*check_function) (gfc_expr *))
1085 for (; c; c = c->next)
1089 if (e->expr_type != EXPR_ARRAY)
1091 if ((*check_function) (e) == FAILURE)
1096 element.previous = base;
1097 element.iterator = c->iterator;
1100 t = check_constructor (e->value.constructor, check_function);
1101 base = element.previous;
1107 /* Nothing went wrong, so all OK. */
1112 /* Checks a constructor to see if it is a particular kind of
1113 expression -- specification, restricted, or initialization as
1114 determined by the check_function. */
1117 gfc_check_constructor (gfc_expr *expr, try (*check_function) (gfc_expr *))
1119 cons_stack *base_save;
1125 t = check_constructor (expr->value.constructor, check_function);
1133 /**************** Simplification of array constructors ****************/
1135 iterator_stack *iter_stack;
1139 gfc_constructor *new_head, *new_tail;
1140 int extract_count, extract_n;
1141 gfc_expr *extracted;
1145 gfc_component *component;
1148 try (*expand_work_function) (gfc_expr *);
1152 static expand_info current_expand;
1154 static try expand_constructor (gfc_constructor *);
1157 /* Work function that counts the number of elements present in a
1161 count_elements (gfc_expr *e)
1166 mpz_add_ui (*current_expand.count, *current_expand.count, 1);
1169 if (gfc_array_size (e, &result) == FAILURE)
1175 mpz_add (*current_expand.count, *current_expand.count, result);
1184 /* Work function that extracts a particular element from an array
1185 constructor, freeing the rest. */
1188 extract_element (gfc_expr *e)
1192 { /* Something unextractable */
1197 if (current_expand.extract_count == current_expand.extract_n)
1198 current_expand.extracted = e;
1202 current_expand.extract_count++;
1207 /* Work function that constructs a new constructor out of the old one,
1208 stringing new elements together. */
1211 expand (gfc_expr *e)
1213 if (current_expand.new_head == NULL)
1214 current_expand.new_head = current_expand.new_tail =
1215 gfc_get_constructor ();
1218 current_expand.new_tail->next = gfc_get_constructor ();
1219 current_expand.new_tail = current_expand.new_tail->next;
1222 current_expand.new_tail->where = e->where;
1223 current_expand.new_tail->expr = e;
1225 mpz_set (current_expand.new_tail->n.offset, *current_expand.offset);
1226 current_expand.new_tail->n.component = current_expand.component;
1227 mpz_set (current_expand.new_tail->repeat, *current_expand.repeat);
1232 /* Given an initialization expression that is a variable reference,
1233 substitute the current value of the iteration variable. */
1236 gfc_simplify_iterator_var (gfc_expr *e)
1240 for (p = iter_stack; p; p = p->prev)
1241 if (e->symtree == p->variable)
1245 return; /* Variable not found */
1247 gfc_replace_expr (e, gfc_int_expr (0));
1249 mpz_set (e->value.integer, p->value);
1255 /* Expand an expression with that is inside of a constructor,
1256 recursing into other constructors if present. */
1259 expand_expr (gfc_expr *e)
1261 if (e->expr_type == EXPR_ARRAY)
1262 return expand_constructor (e->value.constructor);
1264 e = gfc_copy_expr (e);
1266 if (gfc_simplify_expr (e, 1) == FAILURE)
1272 return current_expand.expand_work_function (e);
1277 expand_iterator (gfc_constructor *c)
1279 gfc_expr *start, *end, *step;
1280 iterator_stack frame;
1289 mpz_init (frame.value);
1292 start = gfc_copy_expr (c->iterator->start);
1293 if (gfc_simplify_expr (start, 1) == FAILURE)
1296 if (start->expr_type != EXPR_CONSTANT || start->ts.type != BT_INTEGER)
1299 end = gfc_copy_expr (c->iterator->end);
1300 if (gfc_simplify_expr (end, 1) == FAILURE)
1303 if (end->expr_type != EXPR_CONSTANT || end->ts.type != BT_INTEGER)
1306 step = gfc_copy_expr (c->iterator->step);
1307 if (gfc_simplify_expr (step, 1) == FAILURE)
1310 if (step->expr_type != EXPR_CONSTANT || step->ts.type != BT_INTEGER)
1313 if (mpz_sgn (step->value.integer) == 0)
1315 gfc_error ("Iterator step at %L cannot be zero", &step->where);
1319 /* Calculate the trip count of the loop. */
1320 mpz_sub (trip, end->value.integer, start->value.integer);
1321 mpz_add (trip, trip, step->value.integer);
1322 mpz_tdiv_q (trip, trip, step->value.integer);
1324 mpz_set (frame.value, start->value.integer);
1326 frame.prev = iter_stack;
1327 frame.variable = c->iterator->var->symtree;
1328 iter_stack = &frame;
1330 while (mpz_sgn (trip) > 0)
1332 if (expand_expr (c->expr) == FAILURE)
1335 mpz_add (frame.value, frame.value, step->value.integer);
1336 mpz_sub_ui (trip, trip, 1);
1342 gfc_free_expr (start);
1343 gfc_free_expr (end);
1344 gfc_free_expr (step);
1347 mpz_clear (frame.value);
1349 iter_stack = frame.prev;
1355 /* Expand a constructor into constant constructors without any
1356 iterators, calling the work function for each of the expanded
1357 expressions. The work function needs to either save or free the
1358 passed expression. */
1361 expand_constructor (gfc_constructor *c)
1365 for (; c; c = c->next)
1367 if (c->iterator != NULL)
1369 if (expand_iterator (c) == FAILURE)
1376 if (e->expr_type == EXPR_ARRAY)
1378 if (expand_constructor (e->value.constructor) == FAILURE)
1384 e = gfc_copy_expr (e);
1385 if (gfc_simplify_expr (e, 1) == FAILURE)
1390 current_expand.offset = &c->n.offset;
1391 current_expand.component = c->n.component;
1392 current_expand.repeat = &c->repeat;
1393 if (current_expand.expand_work_function (e) == FAILURE)
1400 /* Top level subroutine for expanding constructors. We only expand
1401 constructor if they are small enough. */
1404 gfc_expand_constructor (gfc_expr *e)
1406 expand_info expand_save;
1410 f = gfc_get_array_element (e, GFC_MAX_AC_EXPAND);
1417 expand_save = current_expand;
1418 current_expand.new_head = current_expand.new_tail = NULL;
1422 current_expand.expand_work_function = expand;
1424 if (expand_constructor (e->value.constructor) == FAILURE)
1426 gfc_free_constructor (current_expand.new_head);
1431 gfc_free_constructor (e->value.constructor);
1432 e->value.constructor = current_expand.new_head;
1437 current_expand = expand_save;
1443 /* Work function for checking that an element of a constructor is a
1444 constant, after removal of any iteration variables. We return
1445 FAILURE if not so. */
1448 constant_element (gfc_expr *e)
1452 rv = gfc_is_constant_expr (e);
1455 return rv ? SUCCESS : FAILURE;
1459 /* Given an array constructor, determine if the constructor is
1460 constant or not by expanding it and making sure that all elements
1461 are constants. This is a bit of a hack since something like (/ (i,
1462 i=1,100000000) /) will take a while as* opposed to a more clever
1463 function that traverses the expression tree. FIXME. */
1466 gfc_constant_ac (gfc_expr *e)
1468 expand_info expand_save;
1472 expand_save = current_expand;
1473 current_expand.expand_work_function = constant_element;
1475 rc = expand_constructor (e->value.constructor);
1477 current_expand = expand_save;
1485 /* Returns nonzero if an array constructor has been completely
1486 expanded (no iterators) and zero if iterators are present. */
1489 gfc_expanded_ac (gfc_expr *e)
1493 if (e->expr_type == EXPR_ARRAY)
1494 for (p = e->value.constructor; p; p = p->next)
1495 if (p->iterator != NULL || !gfc_expanded_ac (p->expr))
1502 /*************** Type resolution of array constructors ***************/
1504 /* Recursive array list resolution function. All of the elements must
1505 be of the same type. */
1508 resolve_array_list (gfc_constructor *p)
1514 for (; p; p = p->next)
1516 if (p->iterator != NULL
1517 && gfc_resolve_iterator (p->iterator, false) == FAILURE)
1520 if (gfc_resolve_expr (p->expr) == FAILURE)
1527 /* Resolve character array constructor. If it is a constant character array and
1528 not specified character length, update character length to the maximum of
1529 its element constructors' length. */
1532 gfc_resolve_character_array_constructor (gfc_expr *expr)
1537 gcc_assert (expr->expr_type == EXPR_ARRAY);
1538 gcc_assert (expr->ts.type == BT_CHARACTER);
1542 if (expr->ts.cl == NULL)
1544 for (p = expr->value.constructor; p; p = p->next)
1545 if (p->expr->ts.cl != NULL)
1547 /* Ensure that if there is a char_len around that it is
1548 used; otherwise the middle-end confuses them! */
1549 expr->ts.cl = p->expr->ts.cl;
1553 expr->ts.cl = gfc_get_charlen ();
1554 expr->ts.cl->next = gfc_current_ns->cl_list;
1555 gfc_current_ns->cl_list = expr->ts.cl;
1560 if (expr->ts.cl->length == NULL)
1562 /* Find the maximum length of the elements. Do nothing for variable
1563 array constructor, unless the character length is constant or
1564 there is a constant substring reference. */
1566 for (p = expr->value.constructor; p; p = p->next)
1569 for (ref = p->expr->ref; ref; ref = ref->next)
1570 if (ref->type == REF_SUBSTRING
1571 && ref->u.ss.start->expr_type == EXPR_CONSTANT
1572 && ref->u.ss.end->expr_type == EXPR_CONSTANT)
1575 if (p->expr->expr_type == EXPR_CONSTANT)
1576 max_length = MAX (p->expr->value.character.length, max_length);
1580 j = mpz_get_ui (ref->u.ss.end->value.integer)
1581 - mpz_get_ui (ref->u.ss.start->value.integer) + 1;
1582 max_length = MAX ((int) j, max_length);
1584 else if (p->expr->ts.cl && p->expr->ts.cl->length
1585 && p->expr->ts.cl->length->expr_type == EXPR_CONSTANT)
1588 j = mpz_get_si (p->expr->ts.cl->length->value.integer);
1589 max_length = MAX ((int) j, max_length);
1595 if (max_length != -1)
1597 /* Update the character length of the array constructor. */
1598 expr->ts.cl->length = gfc_int_expr (max_length);
1599 /* Update the element constructors. */
1600 for (p = expr->value.constructor; p; p = p->next)
1601 if (p->expr->expr_type == EXPR_CONSTANT)
1602 gfc_set_constant_character_len (max_length, p->expr, true);
1608 /* Resolve all of the expressions in an array list. */
1611 gfc_resolve_array_constructor (gfc_expr *expr)
1615 t = resolve_array_list (expr->value.constructor);
1617 t = gfc_check_constructor_type (expr);
1618 if (t == SUCCESS && expr->ts.type == BT_CHARACTER)
1619 gfc_resolve_character_array_constructor (expr);
1625 /* Copy an iterator structure. */
1627 static gfc_iterator *
1628 copy_iterator (gfc_iterator *src)
1635 dest = gfc_get_iterator ();
1637 dest->var = gfc_copy_expr (src->var);
1638 dest->start = gfc_copy_expr (src->start);
1639 dest->end = gfc_copy_expr (src->end);
1640 dest->step = gfc_copy_expr (src->step);
1646 /* Copy a constructor structure. */
1649 gfc_copy_constructor (gfc_constructor *src)
1651 gfc_constructor *dest;
1652 gfc_constructor *tail;
1661 dest = tail = gfc_get_constructor ();
1664 tail->next = gfc_get_constructor ();
1667 tail->where = src->where;
1668 tail->expr = gfc_copy_expr (src->expr);
1669 tail->iterator = copy_iterator (src->iterator);
1670 mpz_set (tail->n.offset, src->n.offset);
1671 tail->n.component = src->n.component;
1672 mpz_set (tail->repeat, src->repeat);
1680 /* Given an array expression and an element number (starting at zero),
1681 return a pointer to the array element. NULL is returned if the
1682 size of the array has been exceeded. The expression node returned
1683 remains a part of the array and should not be freed. Access is not
1684 efficient at all, but this is another place where things do not
1685 have to be particularly fast. */
1688 gfc_get_array_element (gfc_expr *array, int element)
1690 expand_info expand_save;
1694 expand_save = current_expand;
1695 current_expand.extract_n = element;
1696 current_expand.expand_work_function = extract_element;
1697 current_expand.extracted = NULL;
1698 current_expand.extract_count = 0;
1702 rc = expand_constructor (array->value.constructor);
1703 e = current_expand.extracted;
1704 current_expand = expand_save;
1713 /********* Subroutines for determining the size of an array *********/
1715 /* These are needed just to accommodate RESHAPE(). There are no
1716 diagnostics here, we just return a negative number if something
1720 /* Get the size of single dimension of an array specification. The
1721 array is guaranteed to be one dimensional. */
1724 spec_dimen_size (gfc_array_spec *as, int dimen, mpz_t *result)
1729 if (dimen < 0 || dimen > as->rank - 1)
1730 gfc_internal_error ("spec_dimen_size(): Bad dimension");
1732 if (as->type != AS_EXPLICIT
1733 || as->lower[dimen]->expr_type != EXPR_CONSTANT
1734 || as->upper[dimen]->expr_type != EXPR_CONSTANT
1735 || as->lower[dimen]->ts.type != BT_INTEGER
1736 || as->upper[dimen]->ts.type != BT_INTEGER)
1741 mpz_sub (*result, as->upper[dimen]->value.integer,
1742 as->lower[dimen]->value.integer);
1744 mpz_add_ui (*result, *result, 1);
1751 spec_size (gfc_array_spec *as, mpz_t *result)
1756 mpz_init_set_ui (*result, 1);
1758 for (d = 0; d < as->rank; d++)
1760 if (spec_dimen_size (as, d, &size) == FAILURE)
1762 mpz_clear (*result);
1766 mpz_mul (*result, *result, size);
1774 /* Get the number of elements in an array section. */
1777 ref_dimen_size (gfc_array_ref *ar, int dimen, mpz_t *result)
1779 mpz_t upper, lower, stride;
1782 if (dimen < 0 || ar == NULL || dimen > ar->dimen - 1)
1783 gfc_internal_error ("ref_dimen_size(): Bad dimension");
1785 switch (ar->dimen_type[dimen])
1789 mpz_set_ui (*result, 1);
1794 t = gfc_array_size (ar->start[dimen], result); /* Recurse! */
1803 if (ar->start[dimen] == NULL)
1805 if (ar->as->lower[dimen] == NULL
1806 || ar->as->lower[dimen]->expr_type != EXPR_CONSTANT)
1808 mpz_set (lower, ar->as->lower[dimen]->value.integer);
1812 if (ar->start[dimen]->expr_type != EXPR_CONSTANT)
1814 mpz_set (lower, ar->start[dimen]->value.integer);
1817 if (ar->end[dimen] == NULL)
1819 if (ar->as->upper[dimen] == NULL
1820 || ar->as->upper[dimen]->expr_type != EXPR_CONSTANT)
1822 mpz_set (upper, ar->as->upper[dimen]->value.integer);
1826 if (ar->end[dimen]->expr_type != EXPR_CONSTANT)
1828 mpz_set (upper, ar->end[dimen]->value.integer);
1831 if (ar->stride[dimen] == NULL)
1832 mpz_set_ui (stride, 1);
1835 if (ar->stride[dimen]->expr_type != EXPR_CONSTANT)
1837 mpz_set (stride, ar->stride[dimen]->value.integer);
1841 mpz_sub (*result, upper, lower);
1842 mpz_add (*result, *result, stride);
1843 mpz_div (*result, *result, stride);
1845 /* Zero stride caught earlier. */
1846 if (mpz_cmp_ui (*result, 0) < 0)
1847 mpz_set_ui (*result, 0);
1857 gfc_internal_error ("ref_dimen_size(): Bad dimen_type");
1865 ref_size (gfc_array_ref *ar, mpz_t *result)
1870 mpz_init_set_ui (*result, 1);
1872 for (d = 0; d < ar->dimen; d++)
1874 if (ref_dimen_size (ar, d, &size) == FAILURE)
1876 mpz_clear (*result);
1880 mpz_mul (*result, *result, size);
1888 /* Given an array expression and a dimension, figure out how many
1889 elements it has along that dimension. Returns SUCCESS if we were
1890 able to return a result in the 'result' variable, FAILURE
1894 gfc_array_dimen_size (gfc_expr *array, int dimen, mpz_t *result)
1899 if (dimen < 0 || array == NULL || dimen > array->rank - 1)
1900 gfc_internal_error ("gfc_array_dimen_size(): Bad dimension");
1902 switch (array->expr_type)
1906 for (ref = array->ref; ref; ref = ref->next)
1908 if (ref->type != REF_ARRAY)
1911 if (ref->u.ar.type == AR_FULL)
1912 return spec_dimen_size (ref->u.ar.as, dimen, result);
1914 if (ref->u.ar.type == AR_SECTION)
1916 for (i = 0; dimen >= 0; i++)
1917 if (ref->u.ar.dimen_type[i] != DIMEN_ELEMENT)
1920 return ref_dimen_size (&ref->u.ar, i - 1, result);
1924 if (array->shape && array->shape[dimen])
1926 mpz_init_set (*result, array->shape[dimen]);
1930 if (spec_dimen_size (array->symtree->n.sym->as, dimen, result) == FAILURE)
1936 if (array->shape == NULL) {
1937 /* Expressions with rank > 1 should have "shape" properly set */
1938 if ( array->rank != 1 )
1939 gfc_internal_error ("gfc_array_dimen_size(): Bad EXPR_ARRAY expr");
1940 return gfc_array_size(array, result);
1945 if (array->shape == NULL)
1948 mpz_init_set (*result, array->shape[dimen]);
1957 /* Given an array expression, figure out how many elements are in the
1958 array. Returns SUCCESS if this is possible, and sets the 'result'
1959 variable. Otherwise returns FAILURE. */
1962 gfc_array_size (gfc_expr *array, mpz_t *result)
1964 expand_info expand_save;
1969 switch (array->expr_type)
1972 flag = gfc_suppress_error;
1973 gfc_suppress_error = 1;
1975 expand_save = current_expand;
1977 current_expand.count = result;
1978 mpz_init_set_ui (*result, 0);
1980 current_expand.expand_work_function = count_elements;
1983 t = expand_constructor (array->value.constructor);
1984 gfc_suppress_error = flag;
1987 mpz_clear (*result);
1988 current_expand = expand_save;
1992 for (ref = array->ref; ref; ref = ref->next)
1994 if (ref->type != REF_ARRAY)
1997 if (ref->u.ar.type == AR_FULL)
1998 return spec_size (ref->u.ar.as, result);
2000 if (ref->u.ar.type == AR_SECTION)
2001 return ref_size (&ref->u.ar, result);
2004 return spec_size (array->symtree->n.sym->as, result);
2008 if (array->rank == 0 || array->shape == NULL)
2011 mpz_init_set_ui (*result, 1);
2013 for (i = 0; i < array->rank; i++)
2014 mpz_mul (*result, *result, array->shape[i]);
2023 /* Given an array reference, return the shape of the reference in an
2024 array of mpz_t integers. */
2027 gfc_array_ref_shape (gfc_array_ref *ar, mpz_t *shape)
2037 for (; d < ar->as->rank; d++)
2038 if (spec_dimen_size (ar->as, d, &shape[d]) == FAILURE)
2044 for (i = 0; i < ar->dimen; i++)
2046 if (ar->dimen_type[i] != DIMEN_ELEMENT)
2048 if (ref_dimen_size (ar, i, &shape[d]) == FAILURE)
2061 for (d--; d >= 0; d--)
2062 mpz_clear (shape[d]);
2068 /* Given an array expression, find the array reference structure that
2069 characterizes the reference. */
2072 gfc_find_array_ref (gfc_expr *e)
2076 for (ref = e->ref; ref; ref = ref->next)
2077 if (ref->type == REF_ARRAY
2078 && (ref->u.ar.type == AR_FULL || ref->u.ar.type == AR_SECTION))
2082 gfc_internal_error ("gfc_find_array_ref(): No ref found");
2088 /* Find out if an array shape is known at compile time. */
2091 gfc_is_compile_time_shape (gfc_array_spec *as)
2095 if (as->type != AS_EXPLICIT)
2098 for (i = 0; i < as->rank; i++)
2099 if (!gfc_is_constant_expr (as->lower[i])
2100 || !gfc_is_constant_expr (as->upper[i]))