aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-vect-loop-manip.c
diff options
context:
space:
mode:
authorPiotr Trojanek <trojanek@adacore.com>2020-03-07 22:59:24 +0100
committerPierre-Marie de Rodat <derodat@adacore.com>2020-06-11 05:53:43 -0400
commitfc4c73488f8254c0d787a4ec06c135a4ce029b33 (patch)
tree6794a16ba3da9f53bd376d4b78746d0bb3d7b80f /gcc/tree-vect-loop-manip.c
parentf715a5bd3fb6bb70c11b29dc2b54f2459ed36bfb (diff)
downloadgcc-fc4c73488f8254c0d787a4ec06c135a4ce029b33.zip
gcc-fc4c73488f8254c0d787a4ec06c135a4ce029b33.tar.gz
gcc-fc4c73488f8254c0d787a4ec06c135a4ce029b33.tar.bz2
[Ada] Create constrained itypes for nested record aggregates
2020-06-11 Piotr Trojanek <trojanek@adacore.com> gcc/ada/ * sem_aggr.adb (Build_Constrained_Itype): Previously a declare block, now a separate procedure; the only change is that now New_Assoc_List might include components and an others clause, which we ignore (while we deal with discriminants exactly as we did before); extend a ??? comment about how this routine is different from the Build_Subtype (Resolve_Record_Aggregate): Create a constrained itype not just for the outermost record aggregate, but for its inner record aggregates as well.
Diffstat (limited to 'gcc/tree-vect-loop-manip.c')
0 files changed, 0 insertions, 0 deletions