summaryrefslogtreecommitdiff
path: root/libc/misc/search/tsearch.c
diff options
context:
space:
mode:
Diffstat (limited to 'libc/misc/search/tsearch.c')
-rw-r--r--libc/misc/search/tsearch.c7
1 files changed, 4 insertions, 3 deletions
diff --git a/libc/misc/search/tsearch.c b/libc/misc/search/tsearch.c
index 47d409468..d66a5c422 100644
--- a/libc/misc/search/tsearch.c
+++ b/libc/misc/search/tsearch.c
@@ -32,6 +32,10 @@ Cambridge, MA 02139, USA. */
#include <search.h>
#include <stdlib.h>
+libc_hidden_proto(tsearch)
+libc_hidden_proto(tfind)
+libc_hidden_proto(tdestroy)
+
/* This routine is not very bad. It makes many assumptions about
* the compiler. It assumpts that the first field in node must be
* the "key" field, which points to the datum. It is a very trick
@@ -77,7 +81,6 @@ void *tsearch(__const void *key, void **vrootp, __compar_fn_t compar)
}
return (q);
}
-libc_hidden_proto(tsearch)
libc_hidden_def(tsearch)
#endif
@@ -100,7 +103,6 @@ void *tfind(__const void *key, void * __const *vrootp, __compar_fn_t compar)
}
return NULL;
}
-libc_hidden_proto(tfind)
libc_hidden_def(tfind)
#endif
@@ -215,7 +217,6 @@ void tdestroy (void *vroot, __free_fn_t freefct)
tdestroy_recurse (root, freefct);
}
}
-libc_hidden_proto(tdestroy)
libc_hidden_def(tdestroy)
#endif