1 #ifndef _BCACHE_KEYLIST_H
2 #define _BCACHE_KEYLIST_H
4 #include "keylist_types.h"
6 int bch_keylist_realloc(struct keylist *, u64 *, size_t, size_t);
7 void bch_keylist_add_in_order(struct keylist *, struct bkey_i *);
8 void bch_keylist_pop_front(struct keylist *);
10 static inline void bch_keylist_init(struct keylist *l, u64 *inline_keys,
11 size_t nr_inline_u64s)
13 l->top_p = l->keys_p = inline_keys;
16 static inline void bch_keylist_free(struct keylist *l, u64 *inline_keys)
18 if (l->keys_p != inline_keys)
20 memset(l, 0, sizeof(*l));
23 static inline void bch_keylist_push(struct keylist *l)
25 l->top = bkey_next(l->top);
28 static inline void bch_keylist_add(struct keylist *l, const struct bkey_i *k)
34 static inline bool bch_keylist_empty(struct keylist *l)
36 return l->top == l->keys;
39 static inline size_t bch_keylist_u64s(struct keylist *l)
41 return l->top_p - l->keys_p;
44 static inline size_t bch_keylist_bytes(struct keylist *l)
46 return bch_keylist_u64s(l) * sizeof(u64);
49 static inline struct bkey_i *bch_keylist_front(struct keylist *l)
54 #define for_each_keylist_key(_keylist, _k) \
55 for (_k = (_keylist)->keys; \
56 _k != (_keylist)->top; \
59 #define keylist_single(k) \
60 ((struct keylist) { .keys = k, .top = bkey_next(k) })
62 #endif /* _BCACHE_KEYLIST_H */