1*4882a593Smuzhiyun /* SPDX-License-Identifier: GPL-2.0 */
2*4882a593Smuzhiyun extern struct btree_geo btree_geo128;
3*4882a593Smuzhiyun
4*4882a593Smuzhiyun struct btree_head128 { struct btree_head h; };
5*4882a593Smuzhiyun
btree_init_mempool128(struct btree_head128 * head,mempool_t * mempool)6*4882a593Smuzhiyun static inline void btree_init_mempool128(struct btree_head128 *head,
7*4882a593Smuzhiyun mempool_t *mempool)
8*4882a593Smuzhiyun {
9*4882a593Smuzhiyun btree_init_mempool(&head->h, mempool);
10*4882a593Smuzhiyun }
11*4882a593Smuzhiyun
btree_init128(struct btree_head128 * head)12*4882a593Smuzhiyun static inline int btree_init128(struct btree_head128 *head)
13*4882a593Smuzhiyun {
14*4882a593Smuzhiyun return btree_init(&head->h);
15*4882a593Smuzhiyun }
16*4882a593Smuzhiyun
btree_destroy128(struct btree_head128 * head)17*4882a593Smuzhiyun static inline void btree_destroy128(struct btree_head128 *head)
18*4882a593Smuzhiyun {
19*4882a593Smuzhiyun btree_destroy(&head->h);
20*4882a593Smuzhiyun }
21*4882a593Smuzhiyun
btree_lookup128(struct btree_head128 * head,u64 k1,u64 k2)22*4882a593Smuzhiyun static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2)
23*4882a593Smuzhiyun {
24*4882a593Smuzhiyun u64 key[2] = {k1, k2};
25*4882a593Smuzhiyun return btree_lookup(&head->h, &btree_geo128, (unsigned long *)&key);
26*4882a593Smuzhiyun }
27*4882a593Smuzhiyun
btree_get_prev128(struct btree_head128 * head,u64 * k1,u64 * k2)28*4882a593Smuzhiyun static inline void *btree_get_prev128(struct btree_head128 *head,
29*4882a593Smuzhiyun u64 *k1, u64 *k2)
30*4882a593Smuzhiyun {
31*4882a593Smuzhiyun u64 key[2] = {*k1, *k2};
32*4882a593Smuzhiyun void *val;
33*4882a593Smuzhiyun
34*4882a593Smuzhiyun val = btree_get_prev(&head->h, &btree_geo128,
35*4882a593Smuzhiyun (unsigned long *)&key);
36*4882a593Smuzhiyun *k1 = key[0];
37*4882a593Smuzhiyun *k2 = key[1];
38*4882a593Smuzhiyun return val;
39*4882a593Smuzhiyun }
40*4882a593Smuzhiyun
btree_insert128(struct btree_head128 * head,u64 k1,u64 k2,void * val,gfp_t gfp)41*4882a593Smuzhiyun static inline int btree_insert128(struct btree_head128 *head, u64 k1, u64 k2,
42*4882a593Smuzhiyun void *val, gfp_t gfp)
43*4882a593Smuzhiyun {
44*4882a593Smuzhiyun u64 key[2] = {k1, k2};
45*4882a593Smuzhiyun return btree_insert(&head->h, &btree_geo128,
46*4882a593Smuzhiyun (unsigned long *)&key, val, gfp);
47*4882a593Smuzhiyun }
48*4882a593Smuzhiyun
btree_update128(struct btree_head128 * head,u64 k1,u64 k2,void * val)49*4882a593Smuzhiyun static inline int btree_update128(struct btree_head128 *head, u64 k1, u64 k2,
50*4882a593Smuzhiyun void *val)
51*4882a593Smuzhiyun {
52*4882a593Smuzhiyun u64 key[2] = {k1, k2};
53*4882a593Smuzhiyun return btree_update(&head->h, &btree_geo128,
54*4882a593Smuzhiyun (unsigned long *)&key, val);
55*4882a593Smuzhiyun }
56*4882a593Smuzhiyun
btree_remove128(struct btree_head128 * head,u64 k1,u64 k2)57*4882a593Smuzhiyun static inline void *btree_remove128(struct btree_head128 *head, u64 k1, u64 k2)
58*4882a593Smuzhiyun {
59*4882a593Smuzhiyun u64 key[2] = {k1, k2};
60*4882a593Smuzhiyun return btree_remove(&head->h, &btree_geo128, (unsigned long *)&key);
61*4882a593Smuzhiyun }
62*4882a593Smuzhiyun
btree_last128(struct btree_head128 * head,u64 * k1,u64 * k2)63*4882a593Smuzhiyun static inline void *btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2)
64*4882a593Smuzhiyun {
65*4882a593Smuzhiyun u64 key[2];
66*4882a593Smuzhiyun void *val;
67*4882a593Smuzhiyun
68*4882a593Smuzhiyun val = btree_last(&head->h, &btree_geo128, (unsigned long *)&key[0]);
69*4882a593Smuzhiyun if (val) {
70*4882a593Smuzhiyun *k1 = key[0];
71*4882a593Smuzhiyun *k2 = key[1];
72*4882a593Smuzhiyun }
73*4882a593Smuzhiyun
74*4882a593Smuzhiyun return val;
75*4882a593Smuzhiyun }
76*4882a593Smuzhiyun
btree_merge128(struct btree_head128 * target,struct btree_head128 * victim,gfp_t gfp)77*4882a593Smuzhiyun static inline int btree_merge128(struct btree_head128 *target,
78*4882a593Smuzhiyun struct btree_head128 *victim,
79*4882a593Smuzhiyun gfp_t gfp)
80*4882a593Smuzhiyun {
81*4882a593Smuzhiyun return btree_merge(&target->h, &victim->h, &btree_geo128, gfp);
82*4882a593Smuzhiyun }
83*4882a593Smuzhiyun
84*4882a593Smuzhiyun void visitor128(void *elem, unsigned long opaque, unsigned long *__key,
85*4882a593Smuzhiyun size_t index, void *__func);
86*4882a593Smuzhiyun
87*4882a593Smuzhiyun typedef void (*visitor128_t)(void *elem, unsigned long opaque,
88*4882a593Smuzhiyun u64 key1, u64 key2, size_t index);
89*4882a593Smuzhiyun
btree_visitor128(struct btree_head128 * head,unsigned long opaque,visitor128_t func2)90*4882a593Smuzhiyun static inline size_t btree_visitor128(struct btree_head128 *head,
91*4882a593Smuzhiyun unsigned long opaque,
92*4882a593Smuzhiyun visitor128_t func2)
93*4882a593Smuzhiyun {
94*4882a593Smuzhiyun return btree_visitor(&head->h, &btree_geo128, opaque,
95*4882a593Smuzhiyun visitor128, func2);
96*4882a593Smuzhiyun }
97*4882a593Smuzhiyun
btree_grim_visitor128(struct btree_head128 * head,unsigned long opaque,visitor128_t func2)98*4882a593Smuzhiyun static inline size_t btree_grim_visitor128(struct btree_head128 *head,
99*4882a593Smuzhiyun unsigned long opaque,
100*4882a593Smuzhiyun visitor128_t func2)
101*4882a593Smuzhiyun {
102*4882a593Smuzhiyun return btree_grim_visitor(&head->h, &btree_geo128, opaque,
103*4882a593Smuzhiyun visitor128, func2);
104*4882a593Smuzhiyun }
105*4882a593Smuzhiyun
106*4882a593Smuzhiyun #define btree_for_each_safe128(head, k1, k2, val) \
107*4882a593Smuzhiyun for (val = btree_last128(head, &k1, &k2); \
108*4882a593Smuzhiyun val; \
109*4882a593Smuzhiyun val = btree_get_prev128(head, &k1, &k2))
110*4882a593Smuzhiyun
111