diff --git a/ebtree/eb32tree.c b/ebtree/eb32tree.c
index 84a47e8..f504105 100644
--- a/ebtree/eb32tree.c
+++ b/ebtree/eb32tree.c
@@ -1,6 +1,7 @@
 /*
  * Elastic Binary Trees - exported functions for operations on 32bit nodes.
- * (C) 2002-2009 - Willy Tarreau <w@1wt.eu>
+ * Version 6.0
+ * (C) 2002-2010 - Willy Tarreau <w@1wt.eu>
  *
  * This program is free software; you can redistribute it and/or modify
  * it under the terms of the GNU General Public License as published by
@@ -97,7 +98,7 @@
 			 * small and we need to get its highest value, or it is
 			 * too large, and we need to get the prev value.
 			 */
-			if ((node->key >> node->node.bit) > (x >> node->node.bit)) {
+			if ((node->key >> node->node.bit) < (x >> node->node.bit)) {
 				troot = node->node.branches.b[EB_RGHT];
 				return eb32_entry(eb_walk_down(troot, EB_RGHT), struct eb32_node, node);
 			}