merge from gcc

diff --git a/libiberty/ChangeLog b/libiberty/ChangeLog
index 90f51febccfcadd45781def10b2314d744135fad..5498f11215662e8e3f9e4a4461c092418941237d 100644 (file)
--- a/libiberty/ChangeLog
+++ b/libiberty/ChangeLog
@@ -1,3 +1,8 @@
+2003-05-07  Josef Zlomek  <zlomekj@suse.cz>
+
+       * splay-tree.c (splay_tree_predecessor): Fix comment.
+       (splay_tree_successor): Fix comment.
+
 2003-05-07  Jason Merrill  <jason@redhat.com>
 
        * hashtab.c (burtle_hash): New fn.

diff --git a/libiberty/splay-tree.c b/libiberty/splay-tree.c
index 6f90fde05fba2892cafe3a4d1d1f2f800c3fb730..fc98db167f329eaf4083b6c5dd480b1fa75b2959 100644 (file)
--- a/libiberty/splay-tree.c
+++ b/libiberty/splay-tree.c
@@ -472,7 +472,7 @@ splay_tree_predecessor (sp, key)
   if (comparison < 0)
     return sp->root;
 
-  /* Otherwise, find the leftmost element of the right subtree.  */
+  /* Otherwise, find the rightmost element of the left subtree.  */
   node = sp->root->left;
   if (node)
     while (node->right)
@@ -505,7 +505,7 @@ splay_tree_successor (sp, key)
   if (comparison > 0)
     return sp->root;
 
-  /* Otherwise, find the rightmost element of the left subtree.  */
+  /* Otherwise, find the leftmost element of the right subtree.  */
   node = sp->root->right;
   if (node)
     while (node->left)