2012-10-01 Arnaud Charlet <charlet@adacore.com>

	* a-catizo.adb, a-stwiun.adb, a-cdlili.adb, a-cihama.adb, a-direct.adb,
	a-coinve.adb, a-calend.adb, a-ciorse.adb, a-coorma.adb, a-cfdlli.adb,
	a-stzunb-shared.adb, a-cfhase.adb, bindgen.adb, ceinfo.adb, a-tags.adb,
	einfo.adb, checks.adb, eval_fat.adb, a-cborma.adb, a-stwifi.adb,
	a-tifiio.adb, a-textio.adb, a-cidlli.adb, a-strunb-shared.adb,
	a-cimutr.adb, a-calcon.adb, a-exexpr-gcc.adb, a-ciormu.adb,
	a-stzunb.adb, a-stzsea.adb, a-ngelfu.adb, a-stzfix.adb,
	a-cihase.adb, a-cohama.adb, a-exetim-posix.adb, a-dirval-vms.adb,
	a-caldel-vms.adb, a-coorse.adb, errout.adb,
	a-except.adb, butil.adb, a-dirval-mingw.adb, a-cforma.adb,
	a-except-2005.adb, a-wtedit.adb, cstand.adb, a-stwiun-shared.adb,
	a-cbhama.adb, a-direio.adb, clean.adb, a-cborse.adb, back_end.adb,
	binde.adb, a-exexda.adb, a-comutr.adb, a-ciorma.adb, a-cobove.adb,
	a-coormu.adb, a-teioed.adb, a-convec.adb, a-wtenau.adb, exp_aggr.adb,
	a-ztedit.adb, a-cohase.adb, a-exetim-mingw.adb, bcheck.adb,
	a-dynpri.adb, a-cfhama.adb, a-calfor.adb, a-cbdlli.adb,
	a-crdlli.adb, a-cbmutr.adb, a-sequio.adb, a-ngcoar.adb, a-cforse.adb,
	a-strunb.adb, a-calend-vms.adb, a-clrefi.adb, a-cofove.adb,
	a-ztenau.adb, a-strfix.adb, a-cbhase.adb, a-stzsup.adb: Minor
	reformatting.



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

1 files changed, 30 insertions, 35 deletions

diff --git a/gcc/ada/a-coormu.adb b/gcc/ada/a-coormu.adb
index 2bfc682ef58..2cc76319747 100644
--- a/gcc/ada/a-coormu.adb
+++ b/gcc/ada/a-coormu.adb
@@ -6,7 +6,7 @@
 --                                                                          --
 --                                 B o d y                                  --
 --                                                                          --
---          Copyright (C) 2004-2011, Free Software Foundation, Inc.         --
+--          Copyright (C) 2004-2012, Free Software Foundation, Inc.         --
 --                                                                          --
 -- GNAT is free software;  you can  redistribute it  and/or modify it under --
 -- terms of the  GNU General Public License as published  by the Free Soft- --
@@ -308,7 +308,7 @@ package body Ada.Containers.Ordered_Multisets is
 
    function Ceiling (Container : Set; Item : Element_Type) return Cursor is
       Node : constant Node_Access :=
-               Element_Keys.Ceiling (Container.Tree, Item);
+        Element_Keys.Ceiling (Container.Tree, Item);
 
    begin
       if Node = null then
@@ -365,11 +365,11 @@ package body Ada.Containers.Ordered_Multisets is
 
    function Copy_Node (Source : Node_Access) return Node_Access is
       Target : constant Node_Access :=
-                 new Node_Type'(Parent  => null,
-                                Left    => null,
-                                Right   => null,
-                                Color   => Source.Color,
-                                Element => Source.Element);
+        new Node_Type'(Parent  => null,
+                       Left    => null,
+                       Right   => null,
+                       Color   => Source.Color,
+                       Element => Source.Element);
    begin
       return Target;
    end Copy_Node;
@@ -464,7 +464,7 @@ package body Ada.Containers.Ordered_Multisets is
 
    function Difference (Left, Right : Set) return Set is
       Tree : constant Tree_Type :=
-               Set_Ops.Difference (Left.Tree, Right.Tree);
+        Set_Ops.Difference (Left.Tree, Right.Tree);
    begin
       return Set'(Controlled with Tree);
    end Difference;
@@ -568,7 +568,7 @@ package body Ada.Containers.Ordered_Multisets is
 
    function Find (Container : Set; Item : Element_Type) return Cursor is
       Node : constant Node_Access :=
-               Element_Keys.Find (Container.Tree, Item);
+        Element_Keys.Find (Container.Tree, Item);
 
    begin
       if Node = null then
@@ -632,7 +632,7 @@ package body Ada.Containers.Ordered_Multisets is
 
    function Floor (Container : Set; Item : Element_Type) return Cursor is
       Node : constant Node_Access :=
-               Element_Keys.Floor (Container.Tree, Item);
+        Element_Keys.Floor (Container.Tree, Item);
 
    begin
       if Node = null then
@@ -697,7 +697,7 @@ package body Ada.Containers.Ordered_Multisets is
 
       function Ceiling (Container : Set; Key : Key_Type) return Cursor is
          Node : constant Node_Access :=
-                  Key_Keys.Ceiling (Container.Tree, Key);
+           Key_Keys.Ceiling (Container.Tree, Key);
 
       begin
          if Node = null then
@@ -746,8 +746,7 @@ package body Ada.Containers.Ordered_Multisets is
       -------------
 
       function Element (Container : Set; Key : Key_Type) return Element_Type is
-         Node : constant Node_Access :=
-                  Key_Keys.Find (Container.Tree, Key);
+         Node : constant Node_Access := Key_Keys.Find (Container.Tree, Key);
       begin
          if Node = null then
             raise Constraint_Error with "key not in set";
@@ -795,8 +794,7 @@ package body Ada.Containers.Ordered_Multisets is
       ----------
 
       function Find (Container : Set; Key : Key_Type) return Cursor is
-         Node : constant Node_Access :=
-                  Key_Keys.Find (Container.Tree, Key);
+         Node : constant Node_Access := Key_Keys.Find (Container.Tree, Key);
 
       begin
          if Node = null then
@@ -811,8 +809,7 @@ package body Ada.Containers.Ordered_Multisets is
       -----------
 
       function Floor (Container : Set; Key : Key_Type) return Cursor is
-         Node : constant Node_Access :=
-                  Key_Keys.Floor (Container.Tree, Key);
+         Node : constant Node_Access := Key_Keys.Floor (Container.Tree, Key);
 
       begin
          if Node = null then
@@ -1099,11 +1096,11 @@ package body Ada.Containers.Ordered_Multisets is
 
       function New_Node return Node_Access is
          Node : constant Node_Access :=
-                  new Node_Type'(Parent  => null,
-                                 Left    => null,
-                                 Right   => null,
-                                 Color   => Red_Black_Trees.Red,
-                                 Element => New_Item);
+           new Node_Type'(Parent  => null,
+                          Left    => null,
+                          Right   => null,
+                          Color   => Red_Black_Trees.Red,
+                          Element => New_Item);
       begin
          return Node;
       end New_Node;
@@ -1144,11 +1141,11 @@ package body Ada.Containers.Ordered_Multisets is
 
       function New_Node return Node_Access is
          Node : constant Node_Access :=
-                  new Node_Type'(Parent  => null,
-                                 Left    => null,
-                                 Right   => null,
-                                 Color   => Red,
-                                 Element => Src_Node.Element);
+           new Node_Type'(Parent  => null,
+                          Left    => null,
+                          Right   => null,
+                          Color   => Red,
+                          Element => Src_Node.Element);
       begin
          return Node;
       end New_Node;
@@ -1174,7 +1171,7 @@ package body Ada.Containers.Ordered_Multisets is
 
    function Intersection (Left, Right : Set) return Set is
       Tree : constant Tree_Type :=
-               Set_Ops.Intersection (Left.Tree, Right.Tree);
+        Set_Ops.Intersection (Left.Tree, Right.Tree);
    begin
       return Set'(Controlled with Tree);
    end Intersection;
@@ -1385,7 +1382,7 @@ package body Ada.Containers.Ordered_Multisets is
       --  a forward or reverse iteration.
 
       return It : constant Iterator :=
-                    (Limited_Controlled with S, Start.Node)
+        (Limited_Controlled with S, Start.Node)
       do
          B := B + 1;
       end return;
@@ -1489,8 +1486,7 @@ package body Ada.Containers.Ordered_Multisets is
                      "bad cursor in Next");
 
       declare
-         Node : constant Node_Access :=
-                  Tree_Operations.Next (Position.Node);
+         Node : constant Node_Access := Tree_Operations.Next (Position.Node);
       begin
          if Node = null then
             return No_Element;
@@ -1553,7 +1549,7 @@ package body Ada.Containers.Ordered_Multisets is
 
       declare
          Node : constant Node_Access :=
-                  Tree_Operations.Previous (Position.Node);
+           Tree_Operations.Previous (Position.Node);
       begin
          return (if Node = null then No_Element
                  else Cursor'(Position.Container, Node));
@@ -1884,7 +1880,7 @@ package body Ada.Containers.Ordered_Multisets is
 
    function Symmetric_Difference (Left, Right : Set) return Set is
       Tree : constant Tree_Type :=
-               Set_Ops.Symmetric_Difference (Left.Tree, Right.Tree);
+        Set_Ops.Symmetric_Difference (Left.Tree, Right.Tree);
    begin
       return Set'(Controlled with Tree);
    end Symmetric_Difference;
@@ -1912,8 +1908,7 @@ package body Ada.Containers.Ordered_Multisets is
    end Union;
 
    function Union (Left, Right : Set) return Set is
-      Tree : constant Tree_Type :=
-               Set_Ops.Union (Left.Tree, Right.Tree);
+      Tree : constant Tree_Type := Set_Ops.Union (Left.Tree, Right.Tree);
    begin
       return Set'(Controlled with Tree);
    end Union;