diff options
author | Arnaud Charlet <charlet@gcc.gnu.org> | 2013-10-17 16:02:49 +0200 |
---|---|---|
committer | Arnaud Charlet <charlet@gcc.gnu.org> | 2013-10-17 16:02:49 +0200 |
commit | 72d1b27a2ae4676e5604c6200b07bcbfb6b5ad31 (patch) | |
tree | c4e24a50bbfeb879ea8d177433e14b3d5ae6b2fb /gcc/ada/sem_aux.ads | |
parent | 8b58a060443a7a04f2e1fa854ec2f9fac1a7ff1c (diff) | |
download | gcc-72d1b27a2ae4676e5604c6200b07bcbfb6b5ad31.zip gcc-72d1b27a2ae4676e5604c6200b07bcbfb6b5ad31.tar.gz gcc-72d1b27a2ae4676e5604c6200b07bcbfb6b5ad31.tar.bz2 |
[multiple changes]
2013-10-17 Hristian Kirtchev <kirtchev@adacore.com>
* sem_prag.adb (Is_Matching_Input): Account
for the case where a state with a null refinement appears as
the last input of a refinement clause.
2013-10-17 Robert Dewar <dewar@adacore.com>
* sem_aux.ads, sem_aux.adb: Minor reformatting.
From-SVN: r203766
Diffstat (limited to 'gcc/ada/sem_aux.ads')
-rw-r--r-- | gcc/ada/sem_aux.ads | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/ada/sem_aux.ads b/gcc/ada/sem_aux.ads index 0e2818e..49d75ac 100644 --- a/gcc/ada/sem_aux.ads +++ b/gcc/ada/sem_aux.ads @@ -283,7 +283,7 @@ package Sem_Aux is function Is_Immutably_Limited_Type (Ent : Entity_Id) return Boolean; -- Implements definition in Ada 2012 RM-7.5 (8.1/3). This differs from the -- following predicate in that an untagged record with immutably limited - -- components is NOT by itself immutably limited. This matters, eg. when + -- components is NOT by itself immutably limited. This matters, e.g. when -- checking the legality of an access to the current instance. function Is_Limited_View (Ent : Entity_Id) return Boolean; @@ -301,7 +301,7 @@ package Sem_Aux is -- private type, limited interface type, task type, protected type, -- composite containing a limited component, or a subtype of any of -- these types). This older routine overlaps with the previous one, this - -- should be cleaned up? + -- should be cleaned up??? function Nearest_Ancestor (Typ : Entity_Id) return Entity_Id; -- Given a subtype Typ, this function finds out the nearest ancestor from |