diff --git a/ebtree/ebmbtree.c b/ebtree/ebmbtree.c
index 5fbef20..ceedefc 100644
--- a/ebtree/ebmbtree.c
+++ b/ebtree/ebmbtree.c
@@ -25,7 +25,7 @@
 /* Find the first occurrence of a key of <len> bytes in the tree <root>.
  * If none can be found, return NULL.
  */
-REGPRM3 struct ebmb_node *
+struct ebmb_node *
 ebmb_lookup(struct eb_root *root, const void *x, unsigned int len)
 {
 	return __ebmb_lookup(root, x, len);
@@ -36,7 +36,7 @@
  * If root->b[EB_RGHT]==1, the tree may only contain unique keys. The
  * len is specified in bytes.
  */
-REGPRM3 struct ebmb_node *
+struct ebmb_node *
 ebmb_insert(struct eb_root *root, struct ebmb_node *new, unsigned int len)
 {
 	return __ebmb_insert(root, new, len);
@@ -46,7 +46,7 @@
  * tree <root>. It's the caller's responsibility to ensure that key <x> is at
  * least as long as the keys in the tree. If none can be found, return NULL.
  */
-REGPRM2 struct ebmb_node *
+struct ebmb_node *
 ebmb_lookup_longest(struct eb_root *root, const void *x)
 {
 	return __ebmb_lookup_longest(root, x);
@@ -55,7 +55,7 @@
 /* Find the first occurrence of a prefix matching a key <x> of <pfx> BITS in the
  * tree <root>. If none can be found, return NULL.
  */
-REGPRM3 struct ebmb_node *
+struct ebmb_node *
 ebmb_lookup_prefix(struct eb_root *root, const void *x, unsigned int pfx)
 {
 	return __ebmb_lookup_prefix(root, x, pfx);
@@ -70,7 +70,7 @@
  * If root->b[EB_RGHT]==1, the tree may only contain unique keys. The
  * len is specified in bytes.
  */
-REGPRM3 struct ebmb_node *
+struct ebmb_node *
 ebmb_insert_prefix(struct eb_root *root, struct ebmb_node *new, unsigned int len)
 {
 	return __ebmb_insert_prefix(root, new, len);