312 struct rw_aux_tree {  struct
329 			DIV_ROUND_UP(sizeof(struct rw_aux_tree) * t->size, 8);  in bset_aux_tree_buf_end()  argument
468 static struct rw_aux_tree *rw_aux_tree(const struct btree *b,  in rw_aux_tree()  function
484 	return __btree_node_offset_to_key(b, rw_aux_tree(b, t)[j].offset);  in rw_aux_to_bkey()
492 	rw_aux_tree(b, t)[j] = (struct rw_aux_tree) {  in rw_aux_tree_set()
518 			BUG_ON(!bpos_eq(rw_aux_tree(b, t)[j].k,  in bch2_bset_verify_rw_aux_tree()
524 			BUG_ON(rw_aux_tree(b, t)[j].offset <=  in bch2_bset_verify_rw_aux_tree()
525 			       rw_aux_tree(b, t)[j - 1].offset);  in bch2_bset_verify_rw_aux_tree()
547 	       rw_aux_tree(b, t)[idx].offset < offset)  in rw_aux_tree_bsearch()
551 	       rw_aux_tree(b, t)[idx - 1].offset >= offset)  in rw_aux_tree_bsearch()
555 		rw_aux_tree(b, t)[idx].offset < offset);  in rw_aux_tree_bsearch()
556 	EBUG_ON(idx && rw_aux_tree(b, t)[idx - 1].offset >= offset);  in rw_aux_tree_bsearch()
558 		rw_aux_tree(b, t)[idx].offset ==  in rw_aux_tree_bsearch()
559 		rw_aux_tree(b, t)[idx + 1].offset);  in rw_aux_tree_bsearch()
674 	return __bset_tree_capacity(b, t) / sizeof(struct rw_aux_tree);  in bset_rw_tree_capacity()
683 	rw_aux_tree(b, t)[0].offset =  in __build_rw_aux_tree()
908 				memmove(&rw_aux_tree(b, t)[idx + 1],  in rw_aux_tree_insert_entry()
909 					&rw_aux_tree(b, t)[idx],  in rw_aux_tree_insert_entry()
910 					(void *) &rw_aux_tree(b, t)[t->size] -  in rw_aux_tree_insert_entry()
911 					(void *) &rw_aux_tree(b, t)[idx]);  in rw_aux_tree_insert_entry()
934 	if (where > rw_aux_tree(b, t)[t->size - 1].offset) {  in bch2_bset_fix_lookup_table()
942 	if (rw_aux_tree(b, t)[idx].offset == where) {  in bch2_bset_fix_lookup_table()
954 	EBUG_ON(idx < t->size && rw_aux_tree(b, t)[idx].offset <= where);  in bch2_bset_fix_lookup_table()
956 	    rw_aux_tree(b, t)[idx].offset + shift ==  in bch2_bset_fix_lookup_table()
957 	    rw_aux_tree(b, t)[idx - 1].offset) {  in bch2_bset_fix_lookup_table()
958 		memmove(&rw_aux_tree(b, t)[idx],  in bch2_bset_fix_lookup_table()
959 			&rw_aux_tree(b, t)[idx + 1],  in bch2_bset_fix_lookup_table()
960 			(void *) &rw_aux_tree(b, t)[t->size] -  in bch2_bset_fix_lookup_table()
961 			(void *) &rw_aux_tree(b, t)[idx + 1]);  in bch2_bset_fix_lookup_table()
966 		rw_aux_tree(b, t)[j].offset += shift;  in bch2_bset_fix_lookup_table()
969 		rw_aux_tree(b, t)[idx].offset ==  in bch2_bset_fix_lookup_table()
970 		rw_aux_tree(b, t)[idx - 1].offset);  in bch2_bset_fix_lookup_table()
1051 		if (bpos_lt(rw_aux_tree(b, t)[m].k, *search))  in bset_search_write_set()