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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
|
/*
* Copyright (C) NGINX, Inc.
*/
#ifndef _NJS_FLATHSH_H_INCLUDED_
#define _NJS_FLATHSH_H_INCLUDED_
typedef struct {
void *slot;
} njs_flathsh_t;
typedef struct {
/* next_elt + property descriptor : 32 bits */
uint32_t next_elt:26;
uint32_t type:3;
uint32_t writable:1;
uint32_t enumerable:1;
uint32_t configurable:1;
uint32_t key_hash;
void *value[16 / sizeof(void *)];
} njs_flathsh_elt_t;
typedef struct {
uint32_t hash_mask;
uint32_t elts_size; /* allocated properties */
uint32_t elts_count; /* include deleted properties */
uint32_t elts_deleted_count;
} njs_flathsh_descr_t;
typedef struct njs_flathsh_query_s njs_flathsh_query_t;
typedef njs_int_t (*njs_flathsh_test_t)(njs_flathsh_query_t *fhq, void *data);
typedef void *(*njs_flathsh_alloc_t)(void *ctx, size_t size);
typedef void (*njs_flathsh_free_t)(void *ctx, void *p, size_t size);
typedef struct njs_flathsh_proto_s njs_flathsh_proto_t;
struct njs_flathsh_proto_s {
uint32_t not_used;
njs_flathsh_test_t test;
njs_flathsh_alloc_t alloc;
njs_flathsh_free_t free;
};
struct njs_flathsh_query_s {
uint32_t key_hash;
njs_str_t key;
uint8_t replace; /* 1 bit */
void *value;
const njs_flathsh_proto_t *proto;
void *pool;
/* Opaque data passed for the test function. */
void *data;
};
#define njs_flathsh_is_empty(fh) \
((fh)->slot == NULL)
#define njs_flathsh_init(fh) \
(fh)->slot = NULL
#define njs_flathsh_eq(fhl, fhr) \
((fhl)->slot == (fhr)->slot)
#define njs_hash_elts(h) \
((njs_flathsh_elt_t *) ((char *) (h) + sizeof(njs_flathsh_descr_t)))
/*
* njs_flathsh_find() finds a hash element. If the element has been
* found then it is stored in the fhq->value and njs_flathsh_find()
* returns NJS_OK. Otherwise NJS_DECLINED is returned.
*
* The required njs_flathsh_query_t fields: key_hash, key, proto.
*/
NJS_EXPORT njs_int_t njs_flathsh_find(const njs_flathsh_t *fh,
njs_flathsh_query_t *fhq);
/*
* The same as njs_flathsh_find(), but for hashes with unique keys.
*/
NJS_EXPORT njs_int_t njs_flathsh_unique_find(const njs_flathsh_t *fh,
njs_flathsh_query_t *fhq);
/*
* njs_flathsh_insert() adds a hash element. If the element is already present
* in flathsh and the fhq->replace flag is zero, then NJS_DECLINED is returned.
* If the element is already present in flathsh and the fhq->replace flag is
* non-zero, then the old element is replaced with the new element and NJS_OK is
* returned.
* If the element is not present in flathsh, then it is inserted and
* NJS_OK is returned.
* On memory allocation failure NJS_ERROR is returned.
*
* The required njs_flathsh_query_t fields: key_hash, key, proto, replace,
* value.
* The optional njs_flathsh_query_t fields: pool.
*/
NJS_EXPORT njs_int_t njs_flathsh_insert(njs_flathsh_t *fh,
njs_flathsh_query_t *fhq);
/*
* The same as njs_flathsh_insert(), but for hashes with unique keys.
*/
NJS_EXPORT njs_int_t njs_flathsh_unique_insert(njs_flathsh_t *fh,
njs_flathsh_query_t *fhq);
/*
* njs_flathsh_delete() deletes a hash element. If the element has been
* found then it is removed from flathsh and is stored in the fhq->value,
* and NJS_OK is returned. Otherwise NJS_DECLINED is returned.
*
* The required njs_flathsh_query_t fields: key_hash, key, proto.
* The optional njs_flathsh_query_t fields: pool.
*/
NJS_EXPORT njs_int_t njs_flathsh_delete(njs_flathsh_t *fh,
njs_flathsh_query_t *fhq);
/*
* The same as njs_flathsh_delete(), but for hashes with unique keys.
*/
NJS_EXPORT njs_int_t njs_flathsh_unique_delete(njs_flathsh_t *fh,
njs_flathsh_query_t *fhq);
typedef struct {
uint32_t cp;
} njs_flathsh_each_t;
#define njs_flathsh_each_init(lhe, _proto) \
do { \
njs_memzero(lhe, sizeof(njs_flathsh_each_t)); \
} while (0)
NJS_EXPORT njs_flathsh_elt_t *njs_flathsh_each(const njs_flathsh_t *fh,
njs_flathsh_each_t *fhe);
/*
* Add element into hash.
* The element value is not initialized.
* Returns NULL if memory error in hash expand.
*/
NJS_EXPORT njs_flathsh_elt_t *njs_flathsh_add_elt(njs_flathsh_t *fh,
njs_flathsh_query_t *fhq);
NJS_EXPORT njs_flathsh_descr_t *njs_flathsh_new(njs_flathsh_query_t *fhq);
NJS_EXPORT void njs_flathsh_destroy(njs_flathsh_t *fh, njs_flathsh_query_t *fhq);
/* Temporary backward compatibility .*/
typedef struct njs_flathsh_query_s njs_lvlhsh_query_t;
#define NJS_LVLHSH_DEFAULT 0
#define NJS_LVLHSH_LARGE_SLAB 0
typedef struct njs_flathsh_proto_s njs_lvlhsh_proto_t;
#define njs_lvlhsh_is_empty njs_flathsh_is_empty
#define njs_lvlhsh_init njs_flathsh_init
#define njs_lvlhsh_eq njs_flathsh_eq
#define njs_lvlhsh_t njs_flathsh_t
#define njs_lvlhsh_each_t njs_flathsh_each_t
#define njs_lvlhsh_find(lh, lhq) njs_flathsh_find(lh, lhq)
#define njs_lvlhsh_insert(lh, lhq) njs_flathsh_insert(lh, lhq)
#define njs_lvlhsh_delete(lh, lhq) njs_flathsh_delete(lh, lhq)
#define njs_lvlhsh_each_init(lhe, _proto) njs_flathsh_each_init(lhe, _proto)
njs_inline njs_flathsh_elt_t *
njs_lvlhsh_each(const njs_flathsh_t *lh, njs_flathsh_each_t *lhe)
{
njs_flathsh_elt_t *e;
e = njs_flathsh_each(lh, lhe);
if (e == NULL) {
return NULL;
}
return e;
}
#endif /* _NJS_FLATHSH_H_INCLUDED_ */
|
