2 * Copyright (C) 2011 Red Hat, Inc.
4 * This file is released under the GPL.
7 #ifndef DM_SPACE_MAP_COMMON_H
8 #define DM_SPACE_MAP_COMMON_H
12 /*----------------------------------------------------------------*/
15 * Low level disk format
20 * Each value stored in the btree is an index_entry. This points to a
21 * block that is used as a bitmap. Within the bitmap hold 2 bits per
22 * entry, which represent UNUSED = 0, REF_COUNT = 1, REF_COUNT = 2 and
28 * Any entry that has a ref count higher than 2 gets entered in the ref
29 * count tree. The leaf values for this tree is the 32-bit ref count.
32 struct disk_index_entry {
35 __le32 none_free_before;
39 #define MAX_METADATA_BITMAPS 255
40 struct disk_metadata_index {
45 struct disk_index_entry index[MAX_METADATA_BITMAPS];
50 typedef int (*load_ie_fn)(struct ll_disk *ll, dm_block_t index, struct disk_index_entry *result);
51 typedef int (*save_ie_fn)(struct ll_disk *ll, dm_block_t index, struct disk_index_entry *ie);
52 typedef int (*init_index_fn)(struct ll_disk *ll);
53 typedef int (*open_index_fn)(struct ll_disk *ll);
54 typedef dm_block_t (*max_index_entries_fn)(struct ll_disk *ll);
55 typedef int (*commit_fn)(struct ll_disk *ll);
58 struct dm_transaction_manager *tm;
59 struct dm_btree_info bitmap_info;
60 struct dm_btree_info ref_count_info;
63 uint32_t entries_per_block;
65 dm_block_t nr_allocated;
68 * bitmap_root may be a btree root or a simple index.
70 dm_block_t bitmap_root;
72 dm_block_t ref_count_root;
74 struct disk_metadata_index mi_le;
77 init_index_fn init_index;
78 open_index_fn open_index;
79 max_index_entries_fn max_entries;
81 bool bitmap_index_changed:1;
88 __le64 ref_count_root;
91 #define ENTRIES_PER_BYTE 4
93 struct disk_bitmap_header {
99 enum allocation_event {
105 /*----------------------------------------------------------------*/
107 int sm_ll_extend(struct ll_disk *ll, dm_block_t extra_blocks);
108 int sm_ll_lookup_bitmap(struct ll_disk *ll, dm_block_t b, uint32_t *result);
109 int sm_ll_lookup(struct ll_disk *ll, dm_block_t b, uint32_t *result);
110 int sm_ll_find_free_block(struct ll_disk *ll, dm_block_t begin,
111 dm_block_t end, dm_block_t *result);
112 int sm_ll_find_common_free_block(struct ll_disk *old_ll, struct ll_disk *new_ll,
113 dm_block_t begin, dm_block_t end, dm_block_t *result);
114 int sm_ll_insert(struct ll_disk *ll, dm_block_t b, uint32_t ref_count, enum allocation_event *ev);
115 int sm_ll_inc(struct ll_disk *ll, dm_block_t b, enum allocation_event *ev);
116 int sm_ll_dec(struct ll_disk *ll, dm_block_t b, enum allocation_event *ev);
117 int sm_ll_commit(struct ll_disk *ll);
119 int sm_ll_new_metadata(struct ll_disk *ll, struct dm_transaction_manager *tm);
120 int sm_ll_open_metadata(struct ll_disk *ll, struct dm_transaction_manager *tm,
121 void *root_le, size_t len);
123 int sm_ll_new_disk(struct ll_disk *ll, struct dm_transaction_manager *tm);
124 int sm_ll_open_disk(struct ll_disk *ll, struct dm_transaction_manager *tm,
125 void *root_le, size_t len);
127 /*----------------------------------------------------------------*/
129 #endif /* DM_SPACE_MAP_COMMON_H */