From 21730caa6647f645974e132ca8afec79b4eeab2b Mon Sep 17 00:00:00 2001 From: Bernhard Reutner-Fischer Date: Fri, 18 Sep 2009 20:57:40 +0200 Subject: trim Experimentally off and uncommented hidden sed -i -e '/Experimentally off - /d' $(grep -rl "Experimentally off - " *) sed -i -e '/^\/\*[[:space:]]*libc_hidden_proto(/d' $(grep -rl "libc_hidden_proto" *) should be a nop Signed-off-by: Bernhard Reutner-Fischer --- libc/misc/search/_hsearch_r.c | 5 ----- libc/misc/search/_lsearch.c | 2 -- libc/misc/search/_tsearch.c | 3 --- libc/misc/search/hsearch.c | 3 --- 4 files changed, 13 deletions(-) (limited to 'libc/misc/search') diff --git a/libc/misc/search/_hsearch_r.c b/libc/misc/search/_hsearch_r.c index 85475cf5e..aef12e61b 100644 --- a/libc/misc/search/_hsearch_r.c +++ b/libc/misc/search/_hsearch_r.c @@ -64,7 +64,6 @@ static int isprime (unsigned int number) indexing as explained in the comment for the hsearch function. The contents of the table is zeroed, especially the field used becomes zero. */ -/* libc_hidden_proto(hcreate_r) */ int hcreate_r (size_t nel, struct hsearch_data *htab) { /* Test for correct arguments. */ @@ -100,7 +99,6 @@ libc_hidden_def(hcreate_r) #ifdef L_hdestroy_r /* After using the hash table it has to be destroyed. The used memory can be freed and the local static variable can be marked as not used. */ -/* libc_hidden_proto(hdestroy_r) */ void hdestroy_r (struct hsearch_data *htab) { /* Test for correct arguments. */ @@ -134,10 +132,7 @@ libc_hidden_def(hdestroy_r) equality of the stored and the parameter value. This helps to prevent unnecessary expensive calls of strcmp. */ -/* Experimentally off - libc_hidden_proto(strcmp) */ -/* Experimentally off - libc_hidden_proto(strlen) */ -/* libc_hidden_proto(hsearch_r) */ int hsearch_r (ENTRY item, ACTION action, ENTRY **retval, struct hsearch_data *htab) { diff --git a/libc/misc/search/_lsearch.c b/libc/misc/search/_lsearch.c index da737bab4..0cf496e26 100644 --- a/libc/misc/search/_lsearch.c +++ b/libc/misc/search/_lsearch.c @@ -12,7 +12,6 @@ #include #include -/* libc_hidden_proto(lfind) */ #ifdef L_lfind @@ -34,7 +33,6 @@ libc_hidden_def(lfind) #ifdef L_lsearch -/* Experimentally off - libc_hidden_proto(memcpy) */ void *lsearch(const void *key, void *base, size_t *nmemb, size_t size, int (*compar)(const void *, const void *)) diff --git a/libc/misc/search/_tsearch.c b/libc/misc/search/_tsearch.c index 5f3706d64..20b04af78 100644 --- a/libc/misc/search/_tsearch.c +++ b/libc/misc/search/_tsearch.c @@ -50,7 +50,6 @@ register node **rootp; address of tree root int (*compar)(); ordering function */ -/* libc_hidden_proto(tsearch) */ void *tsearch(__const void *key, void **vrootp, __compar_fn_t compar) { register node *q; @@ -81,7 +80,6 @@ libc_hidden_def(tsearch) #endif #ifdef L_tfind -/* libc_hidden_proto(tfind) */ void *tfind(__const void *key, void * __const *vrootp, __compar_fn_t compar) { register node **rootp = (node **) vrootp; @@ -208,7 +206,6 @@ tdestroy_recurse (node *root, __free_fn_t freefct) free (root); } -/* libc_hidden_proto(tdestroy) */ void tdestroy (void *vroot, __free_fn_t freefct) { node *root = (node *) vroot; diff --git a/libc/misc/search/hsearch.c b/libc/misc/search/hsearch.c index 3ecc42567..d011997bb 100644 --- a/libc/misc/search/hsearch.c +++ b/libc/misc/search/hsearch.c @@ -19,9 +19,6 @@ #include -/* libc_hidden_proto(hdestroy_r) */ -/* libc_hidden_proto(hsearch_r) */ -/* libc_hidden_proto(hcreate_r) */ /* The non-reentrant version use a global space for storing the table. */ static struct hsearch_data htab; -- cgit v1.2.3