diff options
author | charlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4> | 2012-01-30 10:24:17 +0000 |
---|---|---|
committer | charlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4> | 2012-01-30 10:24:17 +0000 |
commit | 14cf7fa74a95f3bf6fe4808dfaa24f1676e1ecd0 (patch) | |
tree | 9d6cf6a29c0a1bdac65791a5798295c1f978b73b /gcc/ada/a-cbdlli.adb | |
parent | 7e7baeb5751f0ed6bcd4f750fa5ccd9398206baa (diff) | |
download | gcc-14cf7fa74a95f3bf6fe4808dfaa24f1676e1ecd0.tar.gz |
2012-01-30 Robert Dewar <dewar@adacore.com>
* a-cdlili.adb, a-cidlli.adb, a-cbdlli.adb: Minor reformatting.
2012-01-30 Olivier Hainque <hainque@adacore.com>
* sigtramp-ppcvxw.c (CFI_COMMON_REGS): Add rule for r1 back +
comments.
2012-01-30 Thomas Quinot <quinot@adacore.com>
* gnat_rm.texi, sem_dist.adb, sem_dist.ads, einfo.ads, sem_prag.adb,
sem_ch12.adb, sem_attr.adb, aspects.adb, aspects.ads, par-prag.adb,
sem_cat.adb, snames.ads-tmpl (Sem_Dist.Is_Valid_Remote_Object_Type):
New subprogram (extracted from
Sem_Cat.Validate_Remote_Access_Object_Type_Declaration).
(Einfo.Is_Remote_Types): Now applies to generic types. Update
documentation accordingly.
(Sem_Ch12.Analyze_Associations): A RACW type is acceptable as
actual for a formal type to which a pragma Remote_Access_Type
applies.
(Aspects, Par.Prag, Sem_Prag): Support for new pramga/aspect
Remote_Access_Type.
(Sem_Attr.Analyze_Attribute, case Stub_Type): Attribute can
be applied to a generic type if pragma Remote_Access_Type
applies, in which case the type of the attribute is
System.Partition_Interface.RACW_Stub_Type.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@183698 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ada/a-cbdlli.adb')
-rw-r--r-- | gcc/ada/a-cbdlli.adb | 8 |
1 files changed, 6 insertions, 2 deletions
diff --git a/gcc/ada/a-cbdlli.adb b/gcc/ada/a-cbdlli.adb index 28c9622ff70..df9bf2242fb 100644 --- a/gcc/ada/a-cbdlli.adb +++ b/gcc/ada/a-cbdlli.adb @@ -2275,13 +2275,17 @@ package body Ada.Containers.Bounded_Doubly_Linked_Lists is return False; end if; - if Position.Node = L.First then -- eliminates earlier disjunct + -- Eliminate earlier possibility + + if Position.Node = L.First then return True; end if; pragma Assert (N (Position.Node).Prev /= 0); - if Position.Node = L.Last then -- eliminates earlier disjunct + -- ELiminate another possibility + + if Position.Node = L.Last then return True; end if; |