55 	struct btree_cache *bc = container_of(list, struct btree_cache, live[list->idx]);  in btree_cache_can_free()
230 		list_move(&b->list, &bc->live[1].list);  in bch2_node_pin()
231 		bc->live[0].nr--;  in bch2_node_pin()
232 		bc->live[1].nr++;  in bch2_node_pin()
246 	list_for_each_entry_safe(b, n, &bc->live[1].list, list) {  in bch2_btree_cache_unpin()
248 		list_move(&b->list, &bc->live[0].list);  in bch2_btree_cache_unpin()
249 		bc->live[0].nr++;  in bch2_btree_cache_unpin()
250 		bc->live[1].nr--;  in bch2_btree_cache_unpin()
270 	--bc->live[btree_node_pinned(b)].nr;  in __bch2_btree_node_hash_remove()
297 	list_add_tail(&b->list, &bc->live[p].list);  in __bch2_btree_node_hash_insert()
298 	bc->live[p].nr++;  in __bch2_btree_node_hash_insert()
468 	struct btree_cache *bc = container_of(list, struct btree_cache, live[list->idx]);  in bch2_btree_cache_scan()
584 	shrinker_free(bc->live[1].shrink);  in bch2_fs_btree_cache_exit()
585 	shrinker_free(bc->live[0].shrink);  in bch2_fs_btree_cache_exit()
592 		list_move(&c->verify_data->list, &bc->live[0].list);  in bch2_fs_btree_cache_exit()
600 			list_add(&r->b->list, &bc->live[0].list);  in bch2_fs_btree_cache_exit()
603 	list_for_each_entry_safe(b, t, &bc->live[1].list, list)  in bch2_fs_btree_cache_exit()
605 	list_for_each_entry_safe(b, t, &bc->live[0].list, list)  in bch2_fs_btree_cache_exit()
631 	BUG_ON(bc->live[0].nr);  in bch2_fs_btree_cache_exit()
632 	BUG_ON(bc->live[1].nr);  in bch2_fs_btree_cache_exit()
658 	list_splice_init(&bc->live[0].list, &bc->freeable);  in bch2_fs_btree_cache_init()
665 	bc->live[0].shrink	= shrink;  in bch2_fs_btree_cache_init()
669 	shrink->private_data	= &bc->live[0];  in bch2_fs_btree_cache_init()
675 	bc->live[1].shrink	= shrink;  in bch2_fs_btree_cache_init()
679 	shrink->private_data	= &bc->live[1];  in bch2_fs_btree_cache_init()
690 	for (unsigned i = 0; i < ARRAY_SIZE(bc->live); i++) {  in bch2_fs_btree_cache_init_early()
691 		bc->live[i].idx = i;  in bch2_fs_btree_cache_init_early()
692 		INIT_LIST_HEAD(&bc->live[i].list);  in bch2_fs_btree_cache_init_early()
755 	for (unsigned i = 0; i < ARRAY_SIZE(bc->live); i++)  in btree_node_cannibalize()
756 		list_for_each_entry_reverse(b, &bc->live[i].list, list)  in btree_node_cannibalize()
761 		for (unsigned i = 0; i < ARRAY_SIZE(bc->live); i++)  in btree_node_cannibalize()
762 			list_for_each_entry_reverse(b, &bc->live[i].list, list)  in btree_node_cannibalize()
1493 	prt_btree_cache_line(out, c, "live:",		bc->live[0].nr);  in bch2_btree_cache_to_text()
1494 	prt_btree_cache_line(out, c, "pinned:",		bc->live[1].nr);  in bch2_btree_cache_to_text()