Searched refs:corank (Results 1 - 17 of 17) sorted by relevance

/haiku-buildtools/gcc/gcc/fortran/
H A Darray.c155 int corank)
217 if (corank == 0)
232 if (ar->codimen < corank)
235 corank, ar->codimen);
238 if (ar->codimen > corank)
241 corank, ar->codimen);
251 ar->codimen + 1, corank);
259 ar->codimen + 1, corank);
263 if (ar->codimen >= corank)
266 ar->codimen + 1, corank);
154 gfc_match_array_ref(gfc_array_ref *ar, gfc_array_spec *as, int init, int corank) argument
[all...]
H A Ddump-parse-tree.c167 fprintf (dumpfile, "(%d [%d]", as->rank, as->corank);
169 if (as->rank + as->corank > 0 || as->rank == -1)
184 for (i = 0; i < as->rank + as->corank; i++)
H A Dtrans-types.c1332 int n, corank;
1336 corank = as->corank;
1339 corank = 0;
1358 for (n = as->rank; n < as->rank + corank; n++)
1365 if (n < as->rank + corank - 1)
1377 corank, lbound,
1619 for (n = as->rank; n < as->rank + as->corank; n++)
1635 if (n < as->rank + as->corank - 1)
1656 GFC_TYPE_ARRAY_CORANK (type) = as->corank;
1326 int n, corank; local
[all...]
H A Dinterface.c1212 if (s1->as->corank != s2->as->corank)
1215 s1->name, s1->as->corank, s2->as->corank);
1220 for (i = 0; i < s1->as->rank + MAX (0, s1->as->corank-1); i++)
1385 for (i = 0; i < r1->as->rank + r1->as->corank; i++)
2106 if ((last && last->u.c.component->as->corank != formal->as->corank)
2108 && actual->symtree->n.sym->as->corank != formal->as->corank))
[all...]
H A Dtrans-intrinsic.c1446 int rank, corank; local
1479 corank = gfc_get_corank (expr->value.function.actual->expr);
1494 gcc_assert (corank > 0);
1542 if (corank == 1)
1544 sub(1) = m + lcobound(corank)
1548 min_var = min (rank + corank - 2, rank + dim_arg - 1)
1559 sub(dim_arg) = (dim_arg < corank) ? ml - m*extent + lcobound(dim_arg)
1560 : m + lcobound(corank)
1568 if (corank == 1)
1570 /* sub(1) = m + lcobound(corank)
1674 int rank, corank, codim; local
2054 int corank; local
[all...]
H A Dtrans.h858 int rank, corank; variable
931 #define GFC_TYPE_ARRAY_CORANK(node) (TYPE_LANG_SPECIFIC(node)->corank)
H A Dcheck.c210 && CLASS_DATA (e)->as->corank)
572 zero and less than or equal to the corank of the given array. */
577 int corank; local
587 corank = gfc_get_corank (array);
590 || mpz_cmp_ui (dim->value.integer, corank) > 0)
3333 "must have the same corank %d/%d", &to->where,
4966 int corank = gfc_get_corank (coarray); local
4968 if (mpz_cmp_ui (nelems, corank) != 0)
4971 "IMAGE_INDEX at %L shall be %d (corank) not %d",
4972 &sub->where, corank, (in
[all...]
H A Ddecl.c625 if ((from->type == AS_ASSUMED_RANK && to->corank)
626 || (to->type == AS_ASSUMED_RANK && from->corank))
639 for (i = 0; i < to->corank; i++)
658 else if (to->corank == 0 && from->corank > 0)
660 to->corank = from->corank;
663 for (i = 0; i < from->corank; i++)
1657 if (c->as->corank)
H A Dexpr.c4259 + ref->u.c.component->as->corank; i++)
4454 /* Coarrays are variables with a corank but not being coindexed. However, also
4528 int corank; local
4535 corank = e->ts.u.derived->components->as
4536 ? e->ts.u.derived->components->as->corank : 0;
4538 corank = e->symtree->n.sym->as ? e->symtree->n.sym->as->corank : 0;
4543 corank = ref->u.ar.as->corank;
4547 return corank;
[all...]
H A Ddata.c258 gcc_assert (ref->u.ar.as->corank > 0);
H A Dprimary.c1896 as ? as->corank : 0);
2046 component->as->corank);
2058 CLASS_DATA (component)->as->corank);
H A Dsimplify.c3324 || (coarray && d == as->rank + as->corank
3546 if (ref->u.ar.as->corank > 0)
3597 for (d = 0; d < as->corank; d++)
3629 mpz_init_set_ui (e->shape[0], as->corank);
3632 for (d = 0; d < as->corank; d++)
3645 if (d < 1 || d > as->corank)
6468 for (d = 1; d <= as->corank; d++)
6508 if (d < as->corank)
H A Dtrans-array.c2049 for (i = 0; i < as.rank + as.corank; i++)
4921 gfc_conv_descriptor_cosize (tree desc, int rank, int corank) argument
4923 return gfc_conv_descriptor_size_1 (desc, rank, rank + corank - 1);
4946 for (n = rank; n < rank+corank; n++)
4959 gfc_array_init_size (tree descriptor, int rank, int corank, tree * poffset, argument
5094 for (n = rank; n < rank + corank; n++)
5102 gcc_assert (n == rank + corank - 1);
5107 if (ubound || n == rank + corank - 1)
5121 if (n < rank + corank - 1)
5310 ref->u.ar.as->corank,
[all...]
H A Dresolve.c4158 if (as->corank != ar->codimen && ar->codimen != 0)
4161 &ar->where, ar->codimen, as->corank);
4171 for (i = as->rank; i < as->rank + as->corank; i++)
4446 if (ar->as->corank && ar->codimen == 0)
4449 ar->codimen = ar->as->corank;
8057 sym->as->corank = gfc_get_corank (target);
8688 symtree->n.sym->as->corank = 1;
10788 for (i = 0; i < sym->as->rank + sym->as->corank; i++)
11330 int corank = sym->as->corank; local
[all...]
H A Dmodule.c2464 mio_integer (&as->corank);
2469 if (iomode == IO_INPUT && as->corank)
2472 if (as->rank + as->corank > 0)
2473 for (i = 0; i < as->rank + as->corank; i++)
H A Dclass.c634 sprintf (name, "__class_%s_%d_%da", tname, rank, (*as)->corank);
636 sprintf (name, "__class_%s_%d_%dp", tname, rank, (*as)->corank);
638 sprintf (name, "__class_%s_%d_%dt", tname, rank, (*as)->corank);
H A Dgfortran.h997 int corank; member in struct:__anon102

Completed in 506 milliseconds