676 	LIST_HEAD(bitmaps);  in __load_free_space_cache()
807 			list_add_tail(&e->list, &bitmaps);  in __load_free_space_cache()
816 	 * We add the bitmaps at the end of the entries in order that  in __load_free_space_cache()
819 	list_for_each_entry_safe(e, n, &bitmaps, list) {  in __load_free_space_cache()
945 			      int *entries, int *bitmaps,  in write_cache_extent_entries()  argument
982 			*bitmaps += 1;  in write_cache_extent_entries()
1023 		  int entries, int bitmaps)  in update_cache_item()  argument
1060 	btrfs_set_free_space_bitmaps(leaf, header, bitmaps);  in update_cache_item()
1128 	/* Write out the bitmaps */  in write_bitmap_entries()
1189 				io_ctl->entries, io_ctl->bitmaps);  in __btrfs_wait_cache_io()
1265 	int bitmaps = 0;  in __btrfs_write_out_cache()  local
1306 					 block_group, &entries, &bitmaps,  in __btrfs_write_out_cache()
1324 	 * At last, we write out all the bitmaps and keep cache_writeout_mutex  in __btrfs_write_out_cache()
1362 	io_ctl->bitmaps = bitmaps;  in __btrfs_write_out_cache()
1698 	 * bitmaps, we may end up using more memory than this.  in recalculate_thresholds()
2103 	/* This is a way to reclaim large regions from the bitmaps. */  in use_bitmap()
2167 	 * Since we link bitmaps right into the cluster we need to see if we  in insert_into_bitmap()
2272  *  3) Always pull neighboring regions from bitmaps
2433  * there is, migrate that space from the bitmaps to the extent.
2503 	 * Only steal free space from adjacent bitmaps if we're sure we're not  in __btrfs_add_free_space()
2506 	 * attempt to steal space from bitmaps if we're adding an extent entry.  in __btrfs_add_free_space()
2698 	 * start converting things over to using bitmaps  in btrfs_init_free_space_ctl()
3160 			struct list_head *bitmaps, u64 offset, u64 bytes,  in setup_cluster_no_bitmap()  argument
3177 	 * We don't want bitmaps, so just move along until we find a normal  in setup_cluster_no_bitmap()
3182 			list_add_tail(&entry->list, bitmaps);  in setup_cluster_no_bitmap()
3200 				list_add_tail(&entry->list, bitmaps);  in setup_cluster_no_bitmap()
3245  * This specifically looks for bitmaps that may work in the cluster, we assume
3251 		     struct list_head *bitmaps, u64 offset, u64 bytes,  in setup_cluster_bitmap()  argument
3266 	if (!list_empty(bitmaps))  in setup_cluster_bitmap()
3267 		entry = list_first_entry(bitmaps, struct btrfs_free_space, list);  in setup_cluster_bitmap()
3272 			list_add(&entry->list, bitmaps);  in setup_cluster_bitmap()
3275 	list_for_each_entry(entry, bitmaps, list) {  in setup_cluster_bitmap()
3285 	 * The bitmaps list has all the bitmaps that record free space  in setup_cluster_bitmap()
3306 	LIST_HEAD(bitmaps);  in btrfs_find_space_cluster()
3349 	ret = setup_cluster_no_bitmap(block_group, cluster, &bitmaps, offset,  in btrfs_find_space_cluster()
3353 		ret = setup_cluster_bitmap(block_group, cluster, &bitmaps,  in btrfs_find_space_cluster()
3358 	list_for_each_entry_safe(entry, tmp, &bitmaps, list)  in btrfs_find_space_cluster()
3480 		/* Skip bitmaps and if async, already trimmed entries */  in trim_no_bitmap()
3648 		 * Bitmaps are marked trimmed lossily now to prevent constant  in trim_bitmaps()
3650 		 * by the filters).  So, retrim the block group bitmaps when we  in trim_bitmaps()