[Ada] Bindo.Graphs: Minor typo fixes

2019-08-21  Piotr Trojanek  <trojanek@adacore.com>

gcc/ada/

	* bindo-graphs.ads (Iterate_Edges_To_Successors): Fix typo in
	pragma Inline.
	* bindo-graphs.adb (Delete_Edge): Fix layout in parameter list.

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

diff --git a/gcc/ada/ChangeLog b/gcc/ada/ChangeLog
index 29617b0c7ba9e5788dbe77cb3a8e0d090598ef9d..2aceec161b66646f859ccd4d4e3b981bda75abd9 100644 (file)
--- a/gcc/ada/ChangeLog
+++ b/gcc/ada/ChangeLog
@@ -1,3 +1,9 @@
+2019-08-21  Piotr Trojanek  <trojanek@adacore.com>
+
+       * bindo-graphs.ads (Iterate_Edges_To_Successors): Fix typo in
+       pragma Inline.
+       * bindo-graphs.adb (Delete_Edge): Fix layout in parameter list.
+
 2019-08-21  Gary Dismukes  <dismukes@adacore.com>
 
        * exp_ch3.adb (Build_Master): Suppress call to

diff --git a/gcc/ada/bindo-graphs.adb b/gcc/ada/bindo-graphs.adb
index c2f9d6cac5cee978ded83e2cf63d73bc44ff6596..e7585e2f2f192d7c28746a97bcc357663d2f8144 100644 (file)
--- a/gcc/ada/bindo-graphs.adb
+++ b/gcc/ada/bindo-graphs.adb
@@ -1144,7 +1144,7 @@ package body Bindo.Graphs is
       --  successor.
 
       procedure Delete_Edge
-        (G      : Library_Graph;
+        (G    : Library_Graph;
          Edge : Library_Graph_Edge_Id);
       pragma Inline (Delete_Edge);
       --  Delete edge Edge from library graph G

diff --git a/gcc/ada/bindo-graphs.ads b/gcc/ada/bindo-graphs.ads
index f376801cb3c0f0c5b4cd90ee08517539722df71f..339c7f80691ee7bda8cbc8c7520fbce128ba65f4 100644 (file)
--- a/gcc/ada/bindo-graphs.ads
+++ b/gcc/ada/bindo-graphs.ads
@@ -1406,7 +1406,7 @@ package Bindo.Graphs is
       function Iterate_Edges_To_Successors
         (G      : Library_Graph;
          Vertex : Library_Graph_Vertex_Id) return Edges_To_Successors_Iterator;
-      pragma Inline (Iterate_Components);
+      pragma Inline (Iterate_Edges_To_Successors);
       --  Obtain an iterator over all edges to successors with predecessor
       --  vertex Vertex of library graph G.