21 static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2)  in btree_lookup128()  argument
23 	u64 key[2] = {k1, k2};  in btree_lookup128()
28 				      u64 *k1, u64 *k2)  in btree_get_prev128()  argument
30 	u64 key[2] = {*k1, *k2};  in btree_get_prev128()
35 	*k1 = key[0];  in btree_get_prev128()
40 static inline int btree_insert128(struct btree_head128 *head, u64 k1, u64 k2,  in btree_insert128()  argument
43 	u64 key[2] = {k1, k2};  in btree_insert128()
48 static inline int btree_update128(struct btree_head128 *head, u64 k1, u64 k2,  in btree_update128()  argument
51 	u64 key[2] = {k1, k2};  in btree_update128()
56 static inline void *btree_remove128(struct btree_head128 *head, u64 k1, u64 k2)  in btree_remove128()  argument
58 	u64 key[2] = {k1, k2};  in btree_remove128()
62 static inline void *btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2)  in btree_last128()  argument
69 		*k1 = key[0];  in btree_last128()
105 #define btree_for_each_safe128(head, k1, k2, val)	\  argument
106 	for (val = btree_last128(head, &k1, &k2);	\
108 	     val = btree_get_prev128(head, &k1, &k2))