hash.h 5.49 KB
Newer Older
Ondřej Zajíček's avatar
Ondřej Zajíček committed
1 2 3 4 5 6 7 8 9 10 11
/*
 *	BIRD Library -- Generic Hash Table
 *
 *	(c) 2013 Ondrej Zajicek <santiago@crfreenet.org>
 *	(c) 2013 CZ.NIC z.s.p.o.
 *
 *	Can be freely distributed and used under the terms of the GNU GPL.
 */

#ifndef _BIRD_HASH_H_
#define _BIRD_HASH_H_
12

13
#define HASH(type)		struct { type **data; uint count, order; }
14
#define HASH_TYPE(v)		typeof(** (v).data)
15
#define HASH_SIZE(v)		(1U << (v).order)
Ondřej Zajíček's avatar
Ondřej Zajíček committed
16 17 18

#define HASH_EQ(v,id,k1,k2...)	(id##_EQ(k1, k2))
#define HASH_FN(v,id,key...)	((u32) (id##_FN(key)) >> (32 - (v).order))
19

20 21

#define HASH_INIT(v,pool,init_order)					\
22
  ({									\
23 24 25
    (v).count = 0;							\
    (v).order = (init_order);						\
    (v).data = mb_allocz(pool, HASH_SIZE(v) * sizeof(* (v).data));	\
26 27
  })

28
#define HASH_FIND(v,id,key...)						\
29
  ({									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
30
    u32 _h = HASH_FN(v, id, key);					\
31
    HASH_TYPE(v) *_n = (v).data[_h];					\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
32
    while (_n && !HASH_EQ(v, id, id##_KEY(_n), key))			\
33
      _n = id##_NEXT(_n);						\
34 35 36
    _n;									\
  })

37
#define HASH_INSERT(v,id,node)						\
38
  ({									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
39
    u32 _h = HASH_FN(v, id, id##_KEY((node)));				\
40 41
    HASH_TYPE(v) **_nn = (v).data + _h;					\
    id##_NEXT(node) = *_nn;						\
42
    *_nn = node;							\
43
    (v).count++;							\
44 45
  })

46
#define HASH_DO_REMOVE(v,id,_nn)					\
47
  ({									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
48 49
    *_nn = id##_NEXT((*_nn));						\
    (v).count--;							\
50 51
  })

52 53
#define HASH_DELETE(v,id,key...)					\
  ({									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
54 55
    u32 _h = HASH_FN(v, id, key);					\
    HASH_TYPE(v) *_n, **_nn = (v).data + _h;				\
56
									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
57
    while ((*_nn) && !HASH_EQ(v, id, id##_KEY((*_nn)), key))		\
58 59
      _nn = &(id##_NEXT((*_nn)));					\
									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
60 61 62
    if (_n = *_nn)							\
      HASH_DO_REMOVE(v,id,_nn);						\
    _n;									\
63 64
  })

65 66
#define HASH_REMOVE(v,id,node)						\
  ({									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
67 68
    u32 _h = HASH_FN(v, id, id##_KEY((node)));				\
    HASH_TYPE(v) *_n, **_nn = (v).data + _h;				\
69
									\
70
    while ((*_nn) && (*_nn != (node)))					\
71
      _nn = &(id##_NEXT((*_nn)));					\
72
									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
73 74 75
    if (_n = *_nn)							\
      HASH_DO_REMOVE(v,id,_nn);						\
    _n;									\
76 77 78
  })


79 80 81
#define HASH_REHASH(v,id,pool,step)					\
  ({									\
    HASH_TYPE(v) *_n, *_n2, **_od;					\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
82
    uint _i, _os;							\
83
									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
84
    _os = HASH_SIZE(v);							\
85 86 87 88 89
    _od = (v).data;							\
    (v).count = 0;							\
    (v).order += (step);						\
    (v).data = mb_allocz(pool, HASH_SIZE(v) * sizeof(* (v).data));	\
									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
90
    for (_i = 0; _i < _os; _i++)					\
91 92 93 94 95 96
      for (_n = _od[_i]; _n && (_n2 = id##_NEXT(_n), 1); _n = _n2)	\
	HASH_INSERT(v, id, _n);						\
									\
    mb_free(_od);							\
  })

Ondřej Zajíček's avatar
Ondřej Zajíček committed
97 98 99 100 101 102 103 104 105
#define REHASH_LO_MARK(a,b,c,d,e,f)	a
#define REHASH_HI_MARK(a,b,c,d,e,f)	b
#define REHASH_LO_STEP(a,b,c,d,e,f)	c
#define REHASH_HI_STEP(a,b,c,d,e,f)	d
#define REHASH_LO_BOUND(a,b,c,d,e,f)	e
#define REHASH_HI_BOUND(a,b,c,d,e,f)	f

#define HASH_DEFINE_REHASH_FN(id,type)					\
  static void id##_REHASH(void *v, pool *p, int step)			\
106 107
  { HASH_REHASH(* (HASH(type) *) v, id, p, step); }

Ondřej Zajíček's avatar
Ondřej Zajíček committed
108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128

#define HASH_MAY_STEP_UP(v,id,pool)	HASH_MAY_STEP_UP_(v,pool, id##_REHASH, id##_PARAMS)
#define HASH_MAY_STEP_DOWN(v,id,pool)	HASH_MAY_STEP_DOWN_(v,pool, id##_REHASH, id##_PARAMS)
#define HASH_MAY_RESIZE_DOWN(v,id,pool)	HASH_MAY_RESIZE_DOWN_(v,pool, id##_REHASH, id##_PARAMS)

#define HASH_MAY_STEP_UP_(v,pool,rehash_fn,args)			\
  ({                                                                    \
    if (((v).count > (HASH_SIZE(v) REHASH_HI_MARK(args))) &&		\
	((v).order < (REHASH_HI_BOUND(args))))				\
      rehash_fn(&(v), pool, REHASH_HI_STEP(args));			\
  })

#define HASH_MAY_STEP_DOWN_(v,pool,rehash_fn,args)			\
  ({                                                                    \
    if (((v).count < (HASH_SIZE(v) REHASH_LO_MARK(args))) &&		\
	((v).order > (REHASH_LO_BOUND(args))))				\
      rehash_fn(&(v), pool, -(REHASH_LO_STEP(args)));			\
  })

#define HASH_MAY_RESIZE_DOWN_(v,pool,rehash_fn,args)			\
  ({                                                                    \
129 130
    uint _o = (v).order;							\
    while (((v).count < ((1U << _o) REHASH_LO_MARK(args))) &&		\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
131 132 133
	   (_o > (REHASH_LO_BOUND(args))))				\
      _o -= (REHASH_LO_STEP(args));					\
    if (_o < (v).order)							\
134
      rehash_fn(&(v), pool, _o - (v).order);				\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
135 136 137 138
  })


#define HASH_INSERT2(v,id,pool,node)					\
139
  ({									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
140 141
    HASH_INSERT(v, id, node);						\
    HASH_MAY_STEP_UP(v, id, pool);					\
142 143
  })

Ondřej Zajíček's avatar
Ondřej Zajíček committed
144
#define HASH_DELETE2(v,id,pool,key...)					\
145
  ({									\
Ondřej Zajíček's avatar
Ondřej Zajíček committed
146 147 148 149 150 151 152 153 154 155
    HASH_TYPE(v) *_n = HASH_DELETE(v, id, key);				\
    if (_n) HASH_MAY_STEP_DOWN(v, id, pool);				\
    _n;									\
  })

#define HASH_REMOVE2(v,id,pool,node)					\
  ({									\
    HASH_TYPE(v) *_n = HASH_REMOVE(v, id, node);			\
    if (_n) HASH_MAY_STEP_DOWN(v, id, pool);				\
    _n;									\
156
  })
157

Ondřej Zajíček's avatar
Ondřej Zajíček committed
158

159 160 161 162
#define HASH_WALK(v,next,n)						\
  do {									\
    HASH_TYPE(v) *n;							\
    uint _i;								\
163 164
    uint _s = HASH_SIZE(v);						\
    for (_i = 0; _i < _s; _i++)						\
165 166 167 168 169 170 171 172 173
      for (n = (v).data[_i]; n; n = n->next)

#define HASH_WALK_END } while (0)


#define HASH_WALK_DELSAFE(v,next,n)					\
  do {									\
    HASH_TYPE(v) *n, *_next;						\
    uint _i;								\
174 175
    uint _s = HASH_SIZE(v);						\
    for (_i = 0; _i < _s; _i++)						\
176 177 178 179 180
      for (n = (v).data[_i]; n && (_next = n->next, 1); n = _next)

#define HASH_WALK_DELSAFE_END } while (0)


Ondřej Zajíček's avatar
Ondřej Zajíček committed
181 182 183 184 185 186 187 188 189 190
#define HASH_WALK_FILTER(v,next,n,nn)					\
  do {									\
    HASH_TYPE(v) *n, **nn;						\
    uint _i;								\
    uint _s = HASH_SIZE(v);						\
    for (_i = 0; _i < _s; _i++)						\
      for (nn = (v).data + _i; n = *nn; (*nn == n) ? (nn = &n->next) : NULL)

#define HASH_WALK_FILTER_END } while (0)

Ondřej Zajíček's avatar
Ondřej Zajíček committed
191
#endif