Blame view
include/linux/btree-128.h
2.63 KB
5db53f3e8 [LogFS] add new f... |
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 |
extern struct btree_geo btree_geo128; struct btree_head128 { struct btree_head h; }; static inline void btree_init_mempool128(struct btree_head128 *head, mempool_t *mempool) { btree_init_mempool(&head->h, mempool); } static inline int btree_init128(struct btree_head128 *head) { return btree_init(&head->h); } static inline void btree_destroy128(struct btree_head128 *head) { btree_destroy(&head->h); } static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2) { u64 key[2] = {k1, k2}; return btree_lookup(&head->h, &btree_geo128, (unsigned long *)&key); } static inline void *btree_get_prev128(struct btree_head128 *head, u64 *k1, u64 *k2) { u64 key[2] = {*k1, *k2}; void *val; val = btree_get_prev(&head->h, &btree_geo128, (unsigned long *)&key); *k1 = key[0]; *k2 = key[1]; return val; } static inline int btree_insert128(struct btree_head128 *head, u64 k1, u64 k2, void *val, gfp_t gfp) { u64 key[2] = {k1, k2}; return btree_insert(&head->h, &btree_geo128, (unsigned long *)&key, val, gfp); } static inline int btree_update128(struct btree_head128 *head, u64 k1, u64 k2, void *val) { u64 key[2] = {k1, k2}; return btree_update(&head->h, &btree_geo128, (unsigned long *)&key, val); } static inline void *btree_remove128(struct btree_head128 *head, u64 k1, u64 k2) { u64 key[2] = {k1, k2}; return btree_remove(&head->h, &btree_geo128, (unsigned long *)&key); } static inline void *btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2) { u64 key[2]; void *val; val = btree_last(&head->h, &btree_geo128, (unsigned long *)&key[0]); if (val) { *k1 = key[0]; *k2 = key[1]; } return val; } static inline int btree_merge128(struct btree_head128 *target, struct btree_head128 *victim, gfp_t gfp) { return btree_merge(&target->h, &victim->h, &btree_geo128, gfp); } void visitor128(void *elem, unsigned long opaque, unsigned long *__key, size_t index, void *__func); typedef void (*visitor128_t)(void *elem, unsigned long opaque, u64 key1, u64 key2, size_t index); static inline size_t btree_visitor128(struct btree_head128 *head, unsigned long opaque, visitor128_t func2) { return btree_visitor(&head->h, &btree_geo128, opaque, visitor128, func2); } static inline size_t btree_grim_visitor128(struct btree_head128 *head, unsigned long opaque, visitor128_t func2) { return btree_grim_visitor(&head->h, &btree_geo128, opaque, visitor128, func2); } #define btree_for_each_safe128(head, k1, k2, val) \ for (val = btree_last128(head, &k1, &k2); \ val; \ val = btree_get_prev128(head, &k1, &k2)) |