blob: 5d401555d86ddb9e7b6dee7562109b8d8287a5ed (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
/*
* %CopyrightBegin%
*
* Copyright Ericsson AB 1998-2009. All Rights Reserved.
*
* The contents of this file are subject to the Erlang Public License,
* Version 1.1, (the "License"); you may not use this file except in
* compliance with the License. You should have received a copy of the
* Erlang Public License along with this software. If not, it can be
* retrieved online at http://www.erlang.org/.
*
* Software distributed under the License is distributed on an "AS IS"
* basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
* the License for the specific language governing rights and limitations
* under the License.
*
* %CopyrightEnd%
*
*/
#include <stdlib.h>
#include "hash.h"
/* this function does a reverse lookup and returns the first key whose
* value matches value. This operation may be lengthy! Also, there is
* no guarantee that the *values* are unique in the hash table, so the
* returned key might not be the one you expect.
*/
const char *ei_hash_rlookup(ei_hash *tab, const void *value)
{
ei_bucket *b;
int i;
for (i=0; i<tab->size; i++) {
b=tab->tab[i];
while (b) {
if (b->value == value) return b->key;
b = b->next;
}
}
return NULL;
}
|
