diff options
| author | Piotr Trojanek <trojanek@adacore.com> | 2019-08-21 08:30:32 +0000 |
|---|---|---|
| committer | Pierre-Marie de Rodat <pmderodat@gcc.gnu.org> | 2019-08-21 08:30:32 +0000 |
| commit | a1fda1e8752ecbf3b109d851e4a7d7d04159170e (patch) | |
| tree | 61db3dd8109a68c8d2efca22dbe76b7588ea8474 | |
| parent | 830c5948106c441435731ada9084cba8595bb407 (diff) | |
| download | gcc-a1fda1e8752ecbf3b109d851e4a7d7d04159170e.zip gcc-a1fda1e8752ecbf3b109d851e4a7d7d04159170e.tar.gz gcc-a1fda1e8752ecbf3b109d851e4a7d7d04159170e.tar.bz2 | |
[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.
From-SVN: r274784
| -rw-r--r-- | gcc/ada/ChangeLog | 6 | ||||
| -rw-r--r-- | gcc/ada/bindo-graphs.adb | 2 | ||||
| -rw-r--r-- | gcc/ada/bindo-graphs.ads | 2 |
3 files changed, 8 insertions, 2 deletions
diff --git a/gcc/ada/ChangeLog b/gcc/ada/ChangeLog index 29617b0..2aceec1 100644 --- 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 c2f9d6c..e7585e2 100644 --- 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 f376801..339c7f8 100644 --- 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. |