]>
git.proxmox.com Git - mirror_ubuntu-eoan-kernel.git/blob - include/linux/btree-128.h
1 /* SPDX-License-Identifier: GPL-2.0 */
2 extern struct btree_geo btree_geo128
;
4 struct btree_head128
{ struct btree_head h
; };
6 static inline void btree_init_mempool128(struct btree_head128
*head
,
9 btree_init_mempool(&head
->h
, mempool
);
12 static inline int btree_init128(struct btree_head128
*head
)
14 return btree_init(&head
->h
);
17 static inline void btree_destroy128(struct btree_head128
*head
)
19 btree_destroy(&head
->h
);
22 static inline void *btree_lookup128(struct btree_head128
*head
, u64 k1
, u64 k2
)
24 u64 key
[2] = {k1
, k2
};
25 return btree_lookup(&head
->h
, &btree_geo128
, (unsigned long *)&key
);
28 static inline void *btree_get_prev128(struct btree_head128
*head
,
31 u64 key
[2] = {*k1
, *k2
};
34 val
= btree_get_prev(&head
->h
, &btree_geo128
,
35 (unsigned long *)&key
);
41 static inline int btree_insert128(struct btree_head128
*head
, u64 k1
, u64 k2
,
44 u64 key
[2] = {k1
, k2
};
45 return btree_insert(&head
->h
, &btree_geo128
,
46 (unsigned long *)&key
, val
, gfp
);
49 static inline int btree_update128(struct btree_head128
*head
, u64 k1
, u64 k2
,
52 u64 key
[2] = {k1
, k2
};
53 return btree_update(&head
->h
, &btree_geo128
,
54 (unsigned long *)&key
, val
);
57 static inline void *btree_remove128(struct btree_head128
*head
, u64 k1
, u64 k2
)
59 u64 key
[2] = {k1
, k2
};
60 return btree_remove(&head
->h
, &btree_geo128
, (unsigned long *)&key
);
63 static inline void *btree_last128(struct btree_head128
*head
, u64
*k1
, u64
*k2
)
68 val
= btree_last(&head
->h
, &btree_geo128
, (unsigned long *)&key
[0]);
77 static inline int btree_merge128(struct btree_head128
*target
,
78 struct btree_head128
*victim
,
81 return btree_merge(&target
->h
, &victim
->h
, &btree_geo128
, gfp
);
84 void visitor128(void *elem
, unsigned long opaque
, unsigned long *__key
,
85 size_t index
, void *__func
);
87 typedef void (*visitor128_t
)(void *elem
, unsigned long opaque
,
88 u64 key1
, u64 key2
, size_t index
);
90 static inline size_t btree_visitor128(struct btree_head128
*head
,
94 return btree_visitor(&head
->h
, &btree_geo128
, opaque
,
98 static inline size_t btree_grim_visitor128(struct btree_head128
*head
,
102 return btree_grim_visitor(&head
->h
, &btree_geo128
, opaque
,
106 #define btree_for_each_safe128(head, k1, k2, val) \
107 for (val = btree_last128(head, &k1, &k2); \
109 val = btree_get_prev128(head, &k1, &k2))