File: xhash.h

package info (click to toggle)
jabberd2 2.7.0-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, sid
  • size: 4,016 kB
  • sloc: ansic: 37,099; sh: 1,108; perl: 656; xml: 561; makefile: 511; python: 238; ruby: 145; sql: 55
file content (79 lines) | stat: -rw-r--r-- 2,499 bytes parent folder | download | duplicates (5)
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
/*
 * jabberd - Jabber Open Source Server
 * Copyright (c) 2002-2004 Jeremie Miller, Thomas Muldowney,
 *                         Ryan Eatmon, Robert Norris
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA02111-1307USA
 */

/** @file util/xhash.h
  * @brief hashtables
  * $Date: 2004/04/30 00:53:55 $
  * $Revision: 1.1 $
  */

#ifndef INCL_UTIL_XHASH_H
#define INCL_UTIL_XHASH_H 1

#ifdef HAVE_CONFIG_H
# include <config.h>
#endif

#include "pool.h"

typedef struct xhn_struct
{
    struct xhn_struct *next;
    struct xhn_struct *prev;
    const char *key;
    int keylen;
    void *val;
} *xhn, _xhn;

typedef struct xht_struct
{
    pool_t p;
    int prime;
    int dirty;
    int count;
    struct xhn_struct *zen;
    struct xhn_struct *free_list; // list of zaped elements to be reused.
    int iter_bucket;
    xhn iter_node;
    int *stat;
} *xht, _xht;

JABBERD2_API xht xhash_new(int prime);
JABBERD2_API void xhash_put(xht h, const char *key, void *val);
JABBERD2_API void xhash_putx(xht h, const char *key, int len, void *val);
JABBERD2_API void *xhash_get(xht h, const char *key);
JABBERD2_API void *xhash_getx(xht h, const char *key, int len);
JABBERD2_API void xhash_zap(xht h, const char *key);
JABBERD2_API void xhash_zapx(xht h, const char *key, int len);
JABBERD2_API void xhash_stat(xht h);
JABBERD2_API void xhash_free(xht h);
typedef void (*xhash_walker)(const char *key, int keylen, void *val, void *arg);
JABBERD2_API void xhash_walk(xht h, xhash_walker w, void *arg);
JABBERD2_API int xhash_dirty(xht h);
JABBERD2_API int xhash_count(xht h);
JABBERD2_API pool_t xhash_pool(xht h);

/* iteration functions */
JABBERD2_API int xhash_iter_first(xht h);
JABBERD2_API int xhash_iter_next(xht h);
JABBERD2_API void xhash_iter_zap(xht h);
JABBERD2_API int xhash_iter_get(xht h, const char **key, int *keylen, void **val);

#endif