2013-04-11 Eric Botcazou <ebotcazou@adacore.com>

	* init.c (RETURN_ADDR_OFFSET): Delete as unused.

2013-04-11  Robert Dewar  <dewar@adacore.com>

	* a-crbtgk.adb, a-ciorse.adb, a-crbtgo.adb, a-coorse.adb, a-rbtgbo.adb,
	a-cborse.adb, a-rbtgso.adb, exp_ch3.adb: Minor reformatting.

2013-04-11  Yannick Moy  <moy@adacore.com>

	* exp_ch4.adb (Expand_N_Selected_Component): Do not expand
	discriminant check for Unchecked_Union.
	* sem_res.adb (Resolve_Selected_Component): Set flag
	Do_Discriminant_Check even when expansion is not performed.
	* sinfo.ads (Do_Discriminant_Check): Update documentation for the case
	of Unchecked_Union.

2013-04-11  Thomas Quinot  <quinot@adacore.com>

	* sem_ch13.adb (Same_Representation): Two types with different scalar
	storage order never have the same representation.

2013-04-11  Arnaud Charlet  <charlet@adacore.com>

	* xgnatugn.adb (Push_Conditional): Simplify handling,
	no longer need to keep track of "excluding" sections.
	(Currently_Excluding): Removed.
	(Process_Source_File):
	Set unw/vms flag so that texinfo can do the whole handling of
	@ifset/@ifclear sections.  Fix handling of nested @ifset/@ifclear
	sections.
	* gnat_ugn.texi: Add a section on performing unassisted install
	on Windows.



git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@197785 138bc75d-0d04-0410-961f-82ee72b054a4

1 files changed, 7 insertions, 1 deletions

diff --git a/gcc/ada/a-cborse.adb b/gcc/ada/a-cborse.adb
index ed34b69195a..64220f91ef2 100644
--- a/gcc/ada/a-cborse.adb
+++ b/gcc/ada/a-cborse.adb
@@ -1768,6 +1768,7 @@ package body Ada.Containers.Bounded_Ordered_Sets is
 
          L := L - 1;
          B := B - 1;
+
       exception
          when others =>
             L := L - 1;
@@ -1776,6 +1777,7 @@ package body Ada.Containers.Bounded_Ordered_Sets is
       end;
 
       if Compare then
+
          --  Item is equivalent to the node's element, so we will not have to
          --  move the node.
 
@@ -1808,6 +1810,7 @@ package body Ada.Containers.Bounded_Ordered_Sets is
 
             L := L - 1;
             B := B - 1;
+
          exception
             when others =>
                L := L - 1;
@@ -1815,7 +1818,10 @@ package body Ada.Containers.Bounded_Ordered_Sets is
                raise;
          end;
 
-         if not Compare then  -- Item is equivalent to Nodes (Hint).Element
+         --  Item is equivalent to Nodes (Hint).Element
+
+         if not Compare then
+
             --  Ceiling returns an element that is equivalent or greater than
             --  Item. If Item is "not less than" the element, then by
             --  elimination we know that Item is equivalent to the element.