22 static inline void *btree_lookup128(struct btree_head128 *head, u64 k1, u64 k2)  in btree_lookup128()  argument
24 	u64 key[2] = {k1, k2};  in btree_lookup128()
29 				      u64 *k1, u64 *k2)  in btree_get_prev128()  argument
31 	u64 key[2] = {*k1, *k2};  in btree_get_prev128()
37 	*k2 = key[1];  in btree_get_prev128()
41 static inline int btree_insert128(struct btree_head128 *head, u64 k1, u64 k2,  in btree_insert128()  argument
44 	u64 key[2] = {k1, k2};  in btree_insert128()
49 static inline int btree_update128(struct btree_head128 *head, u64 k1, u64 k2,  in btree_update128()  argument
52 	u64 key[2] = {k1, k2};  in btree_update128()
57 static inline void *btree_remove128(struct btree_head128 *head, u64 k1, u64 k2)  in btree_remove128()  argument
59 	u64 key[2] = {k1, k2};  in btree_remove128()
63 static inline void *btree_last128(struct btree_head128 *head, u64 *k1, u64 *k2)  in btree_last128()  argument
71 		*k2 = key[1];  in btree_last128()
106 #define btree_for_each_safe128(head, k1, k2, val)	\  argument
107 	for (val = btree_last128(head, &k1, &k2);	\
109 	     val = btree_get_prev128(head, &k1, &k2))