Lines Matching defs:ubound
550 specified. This also updates ubound and offset accordingly. */
556 tree offs, ubound, lbound, stride;
563 ubound = gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[dim]);
570 /* Shift ubound and offset accordingly. This has to be done before
572 ubound = fold_build2_loc (input_location, PLUS_EXPR, gfc_array_index_type,
573 ubound, diff);
574 gfc_conv_descriptor_ubound_set (block, desc, gfc_rank_cst[dim], ubound);
1622 delta = ubound[n] + 1 - lbound[n];
1749 tree ubound;
1754 ubound = gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[0]);
1758 ubound, extra);
1767 ubound, gfc_index_one_node);
4579 /* As usual, lbound and ubound are exceptions!. */
4707 tree lbound, ubound;
4778 ubound = gfc_conv_array_ubound (desc, dim);
4780 ubound = NULL;
4818 info->start[dim], ubound);
4829 fold_convert (long_integer_type_node, ubound));
4834 fold_convert (long_integer_type_node, ubound));
4873 logical_type_node, tmp, ubound);
4882 fold_convert (long_integer_type_node, ubound),
4887 fold_convert (long_integer_type_node, ubound),
5603 is simply (ubound - lbound + 1) if this expression is positive
5608 gfc_conv_array_extent_dim (tree lbound, tree ubound, tree* or_expr)
5613 /* Calculate (ubound - lbound + 1). */
5615 ubound, lbound);
5648 tree ubound;
5652 ubound = gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[dim]);
5654 extent = gfc_conv_array_extent_dim (lbound, ubound, NULL);
5694 a.ubound[n] = specified_upper_bound;
5696 size = size >= 0 ? ubound + size : 0; //size = ubound + 1 - lbound
5732 gfc_expr *ubound;
5787 lower == NULL => lbound = 1, ubound = upper[n]
5788 upper[n] = NULL => lbound = 1, ubound = lower[n]
5789 upper[n] != NULL => lbound = lower[n], ubound = upper[n] */
5790 ubound = upper[n];
5811 if (ubound)
5819 ubound = lower[n];
5842 (desc.ubound - desc.lbound) + 1. */
5860 gcc_assert (ubound);
5861 gfc_conv_expr_type (&se, ubound, gfc_array_index_type);
5863 if (ubound->expr_type == EXPR_FUNCTION)
5911 ubound = upper[n];
5922 if (ubound || n == rank + corank - 1)
5930 ubound = lower[n];
5939 gcc_assert (ubound);
5940 gfc_conv_expr_type (&se, ubound, gfc_array_index_type);
6479 tree ubound;
6497 ubound = GFC_TYPE_ARRAY_UBOUND (type, dim);
6498 if (as->upper[dim] && !INTEGER_CST_P (ubound))
6503 gfc_add_modify (pblock, ubound, se.expr);
6520 tree ubound;
6542 ubound = GFC_TYPE_ARRAY_UBOUND (type, dim);
6543 if (as->upper[dim] && !INTEGER_CST_P (ubound))
6548 gfc_add_modify (pblock, ubound, se.expr);
6562 if (ubound != NULL_TREE && !(stride && INTEGER_CST_P (stride)))
6564 /* Calculate stride = size * (ubound + 1 - lbound). */
6569 gfc_array_index_type, ubound, tmp);
6814 tree ubound;
6970 ubound = GFC_TYPE_ARRAY_UBOUND (type, n);
6975 if (!INTEGER_CST_P (ubound))
6981 gfc_add_modify (&init, ubound, se.expr);
6987 /* Check (ubound(a) - lbound(a) == ubound(b) - lbound(b)). */
6992 gfc_array_index_type, ubound, lbound);
7022 gfc_add_modify (&init, ubound, tmp);
7046 /* Calculate stride = size * (ubound + 1 - lbound). */
7051 gfc_array_index_type, ubound, tmp);
7073 /* Calculate size = stride * (ubound + 1 - lbound). */
7079 ubound, tmp);
8165 tree ubound = gfc_conv_descriptor_ubound_get (desc, dim);
8169 gfc_array_index_type, ubound, lbound);
8173 size = (idx == rank && ubound[rank-1] == -1 ? -1 : size;
8211 if (idx == rank - 1 && dim[idx].ubound == -1)
8215 extent = gfc->dim[i].ubound - gfc->dim[i].lbound + 1
9166 tree ubound;
9226 ubound = GFC_TYPE_ARRAY_SIZE (TREE_TYPE (comp));
9228 ubound = gfc_full_array_size (&tmpblock, comp,
9236 ubound = build_int_cst (gfc_array_index_type, 1);
9244 &ubound, 1,
9259 gfc_index_zero_node, ubound);
9412 tree ubound;
9424 ubound = gfc_full_array_size (&dealloc_block, comp,
9432 ubound = build_int_cst (gfc_array_index_type, 1);
9436 &ubound, 1,
9451 gfc_index_zero_node, ubound);
10329 tree ubound;
10339 ubound = gfc_conv_descriptor_ubound_get (desc, tmp);
10342 ubound, lbound);
10555 tree ubound;
10812 ubound = gfc_conv_descriptor_ubound_get (desc, gfc_rank_cst[n]);
10821 tmp, ubound);
10920 ubound = tmp;
10926 ubound = fold_build2_loc (input_location,
10929 ubound, lbound);
10930 ubound = fold_build2_loc (input_location,
10933 ubound, lbd);
10942 ubound);