Go to the source code of this file.
|
#define | QHASH_LOG2_KEYS_PER_BUCKET 2 |
|
#define | QHASH_KEYS_PER_BUCKET (1 << QHASH_LOG2_KEYS_PER_BUCKET) |
|
#define | qhash_resize(v, n) (v) = _qhash_resize ((v), (n), sizeof ((v)[0])) |
|
#define | qhash_foreach(var, v, body) |
|
#define | qhash_set_multiple(v, keys, n, results) (v) = _qhash_set_multiple ((v), sizeof ((v)[0]), (keys), (n), (results)) |
|
#define | qhash_unset_multiple(v, keys, n, results) _qhash_unset_multiple ((v), sizeof ((v)[0]), (keys), (n), (results)) |
|
#define | qhash_get(v, key) |
|
#define | qhash_set(v, k) |
|
#define | qhash_unset(v, k) |
|
#define qhash_foreach |
( |
|
var, |
|
|
|
v, |
|
|
|
body |
|
) |
| |
#define qhash_get |
( |
|
v, |
|
|
|
key |
|
) |
| |
Value:})
u32 qhash_get_first_match(void *v, uword *search_keys, uword n_search_keys, uword *matching_key)
Definition at line 109 of file qhash.h.
#define QHASH_LOG2_KEYS_PER_BUCKET 2 |
#define qhash_resize |
( |
|
v, |
|
|
|
n |
|
) |
| (v) = _qhash_resize ((v), (n), sizeof ((v)[0])) |
#define qhash_set |
( |
|
v, |
|
|
|
k |
|
) |
| |
Value: _qhash_set_k; \
})
#define qhash_set_multiple(v, keys, n, results)
Definition at line 115 of file qhash.h.
#define qhash_set_multiple |
( |
|
v, |
|
|
|
keys, |
|
|
|
n, |
|
|
|
results |
|
) |
| (v) = _qhash_set_multiple ((v), sizeof ((v)[0]), (keys), (n), (results)) |
#define qhash_unset |
( |
|
v, |
|
|
|
k |
|
) |
| |
Value: _qhash_unset_k; \
})
#define qhash_unset_multiple(v, keys, n, results)
Definition at line 122 of file qhash.h.
#define qhash_unset_multiple |
( |
|
v, |
|
|
|
keys, |
|
|
|
n, |
|
|
|
results |
|
) |
| _qhash_unset_multiple ((v), sizeof ((v)[0]), (keys), (n), (results)) |