diff options
| author | Peter S. Mazinger <ps.m@gmx.net> | 2006-01-14 19:45:02 +0000 |
|---|---|---|
| committer | Peter S. Mazinger <ps.m@gmx.net> | 2006-01-14 19:45:02 +0000 |
| commit | 6f7dc709ed7e403af224b0fbb91e9619629eb2ec (patch) | |
| tree | 349296ed6e3d73f390409bf96fa4269d1ac20ec7 /libc/misc/search | |
| parent | 2d997660372123ab6ac1ee519b22fe015eaa787b (diff) | |
make DODEBUG=y happy, update sysdeps/common/* copyright
Diffstat (limited to 'libc/misc/search')
| -rw-r--r-- | libc/misc/search/hsearch_r.c | 7 | ||||
| -rw-r--r-- | libc/misc/search/tsearch.c | 7 |
2 files changed, 8 insertions, 6 deletions
diff --git a/libc/misc/search/hsearch_r.c b/libc/misc/search/hsearch_r.c index 47ff185d4..e7ded795f 100644 --- a/libc/misc/search/hsearch_r.c +++ b/libc/misc/search/hsearch_r.c @@ -27,6 +27,10 @@ #include <search.h> +libc_hidden_proto(hcreate_r) +libc_hidden_proto(hdestroy_r) +libc_hidden_proto(hsearch_r) + /* [Aho,Sethi,Ullman] Compilers: Principles, Techniques and Tools, 1986 [Knuth] The Art of Computer Programming, part 3 (6.4) */ @@ -96,7 +100,6 @@ int hcreate_r (size_t nel, struct hsearch_data *htab) /* everything went alright */ return 1; } -libc_hidden_proto(hcreate_r) libc_hidden_def(hcreate_r) #endif @@ -119,7 +122,6 @@ void hdestroy_r (struct hsearch_data *htab) /* the sign for an existing table is an value != NULL in htable */ htab->table = NULL; } -libc_hidden_proto(hdestroy_r) libc_hidden_def(hdestroy_r) #endif @@ -230,6 +232,5 @@ int hsearch_r (ENTRY item, ACTION action, ENTRY **retval, *retval = NULL; return 0; } -libc_hidden_proto(hsearch_r) libc_hidden_def(hsearch_r) #endif 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 |