Searched refs:key (Results 1 – 7 of 7) sorted by relevance
| /misc/ |
| A D | lsearch.c | 24 lsearch (const void *key, void *base, size_t *nmemb, size_t size, in lsearch() argument
30 result = lfind (key, base, nmemb, size, compar); in lsearch()
34 result = memcpy (base + (*nmemb) * size, key, size); in lsearch()
43 lfind (const void *key, const void *base, size_t *nmemb, size_t size, in lfind() argument
49 while (cnt < *nmemb && (*compar) (key, result) != 0) in lfind()
|
| A D | bug-hsearch1.c | 13 e.key = (char *) "a"; in do_test()
21 s.key = (char *) "c"; in do_test()
|
| A D | tst-hsearch.c | 18 i.key = (char *) "one"; in do_test()
23 i.key = (char *) "one"; in do_test()
|
| A D | hsearch_r.c | 149 unsigned int len = strlen (item.key); in weak_alias()
158 hval += item.key[count]; in weak_alias()
170 && strcmp (item.key, htab->table[idx].entry.key) == 0) in weak_alias()
195 && strcmp (item.key, htab->table[idx].entry.key) == 0) in weak_alias()
|
| A D | tsearch.c | 105 const void *key; member
129 const void *key; member
290 __tsearch (const void *key, void **vrootp, __compar_fn_t compar) in __tsearch() argument
316 r = (*compar) (key, root->key); in __tsearch()
350 q->key = key; /* initialize new node */ in __tsearch()
371 __tfind (const void *key, void *const *vrootp, __compar_fn_t compar) in weak_alias()
387 r = (*compar) (key, root->key); in weak_alias()
403 __tdelete (const void *key, void **vrootp, __compar_fn_t compar) in weak_alias()
425 while ((cmp = (*compar) (key, root->key)) != 0) in weak_alias()
507 root->key = unchained->key; in weak_alias()
[all …]
|
| A D | tst-tsearch.c | 81 const void *key; member
163 int key = **(int **) nodep; in walk_action() local
175 ++z[key]; in walk_action()
176 depths[key] = depth; in walk_action()
180 if (depths[key] != depth) in walk_action()
236 TEST_VERIFY (first_list[i].key == walk_trace_at (&walk_trace, i)->key); in walk_tree()
|
| A D | search.h | 71 char *key; member
|
Completed in 12 milliseconds