0001
0002 extern struct btree_geo btree_geo128;
0003
0004 struct btree_head128 { struct btree_head h; };
0005
0006 static inline void btree_init_mempool128(struct btree_head128 *head,
0007 mempool_t *mempool)
0008 {
0009 btree_init_mempool(&head->h, mempool);
0010 }
0011
0012 static inline int btree_init128(struct btree_head128 *head)
0013 {
0014 return btree_init(&head->h);
0015 }
0016
0017 static inline void btree_destroy128(struct btree_head128 *head)
0018 {
0019 btree_destroy(&head->h);
0020 }
0021
0022 static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2)
0023 {
0024 u64 key[2] = {k1, k2};
0025 return btree_lookup(&head->h, &btree_geo128, (unsigned long *)&key);
0026 }
0027
0028 static inline void *btree_get_prev128(struct btree_head128 *head,
0029 u64 *k1, u64 *k2)
0030 {
0031 u64 key[2] = {*k1, *k2};
0032 void *val;
0033
0034 val = btree_get_prev(&head->h, &btree_geo128,
0035 (unsigned long *)&key);
0036 *k1 = key[0];
0037 *k2 = key[1];
0038 return val;
0039 }
0040
0041 static inline int btree_insert128(struct btree_head128 *head, u64 k1, u64 k2,
0042 void *val, gfp_t gfp)
0043 {
0044 u64 key[2] = {k1, k2};
0045 return btree_insert(&head->h, &btree_geo128,
0046 (unsigned long *)&key, val, gfp);
0047 }
0048
0049 static inline int btree_update128(struct btree_head128 *head, u64 k1, u64 k2,
0050 void *val)
0051 {
0052 u64 key[2] = {k1, k2};
0053 return btree_update(&head->h, &btree_geo128,
0054 (unsigned long *)&key, val);
0055 }
0056
0057 static inline void *btree_remove128(struct btree_head128 *head, u64 k1, u64 k2)
0058 {
0059 u64 key[2] = {k1, k2};
0060 return btree_remove(&head->h, &btree_geo128, (unsigned long *)&key);
0061 }
0062
0063 static inline void *btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2)
0064 {
0065 u64 key[2];
0066 void *val;
0067
0068 val = btree_last(&head->h, &btree_geo128, (unsigned long *)&key[0]);
0069 if (val) {
0070 *k1 = key[0];
0071 *k2 = key[1];
0072 }
0073
0074 return val;
0075 }
0076
0077 static inline int btree_merge128(struct btree_head128 *target,
0078 struct btree_head128 *victim,
0079 gfp_t gfp)
0080 {
0081 return btree_merge(&target->h, &victim->h, &btree_geo128, gfp);
0082 }
0083
0084 void visitor128(void *elem, unsigned long opaque, unsigned long *__key,
0085 size_t index, void *__func);
0086
0087 typedef void (*visitor128_t)(void *elem, unsigned long opaque,
0088 u64 key1, u64 key2, size_t index);
0089
0090 static inline size_t btree_visitor128(struct btree_head128 *head,
0091 unsigned long opaque,
0092 visitor128_t func2)
0093 {
0094 return btree_visitor(&head->h, &btree_geo128, opaque,
0095 visitor128, func2);
0096 }
0097
0098 static inline size_t btree_grim_visitor128(struct btree_head128 *head,
0099 unsigned long opaque,
0100 visitor128_t func2)
0101 {
0102 return btree_grim_visitor(&head->h, &btree_geo128, opaque,
0103 visitor128, func2);
0104 }
0105
0106 #define btree_for_each_safe128(head, k1, k2, val) \
0107 for (val = btree_last128(head, &k1, &k2); \
0108 val; \
0109 val = btree_get_prev128(head, &k1, &k2))
0110
