[Ada] Efficiency improvement in bounded ordered containers

[thirdparty/gcc.git] / gcc / ada / ChangeLog

diff --git a/gcc/ada/ChangeLog b/gcc/ada/ChangeLog
index 558d5e072d2c4493daefca3a8cc9c82cf313a0c3..f8f43c00441c2913b77ec35b15aefef12ea00cc0 100644 (file)
--- a/gcc/ada/ChangeLog
+++ b/gcc/ada/ChangeLog
@@ -1,3 +1,25 @@
+2019-08-20  Bob Duff  <duff@adacore.com>
+
+       * libgnat/a-cborma.adb, libgnat/a-cborse.adb (Clear): Repeatedly
+       call Delete. This avoids clearing the free list, which
+       substantially speeds up future Delete operations.
+
+2019-08-20  Bob Duff  <duff@adacore.com>
+
+       * sem_ch13.adb (Component_Order_Check): New procedure to check
+       for out-of-order clauses.
+       * warnsw.ads, warnsw.adb: New -gnatw_r switch.
+       * doc/gnat_ugn/building_executable_programs_with_gnat.rst:
+       Document new switch.
+       * gnat_ugn.texi: Regenerate.
+
+2019-08-20  Bob Duff  <duff@adacore.com>
+
+       * sem_ch13.adb (Object_Size): Give an error for zero. It really
+       rubs me the wrong way that we don't honor "for T'Object_Size use
+       0;", but it's not important enough to fix. In any case, if we're
+       not going to obey the clause, we should give an error.
+
 2019-08-20  Bob Duff  <duff@adacore.com>
 
        * errout.adb (Error_Msg_Internal): Set Warn_Err in case of