Lines Matching refs:freemap

11     freemap.
13     The freemap only uses blocks from these reserved areas.  In order to
15     (in case some are found to be corrupted), each freemap block in the
16     logical freemap topology will iterate through up to 8 copies whos
21       volume headers is handed a consistent freemap topology.
24       the state of the freemap topology pointed to by older volume headers
25       which are still valid.  Note that the freemap for volume headers
26       indexed after the mount point being recovered may lose freemap
39     For the moment we use a simple calculation for the freemap block.  In
47     headers will lose freemap consistency as the freemap code rotates into
48     freemap blocks that might have been used by the topology pointed to by
61     The freemap topology contains 4 levels of meta-data (blockref arrays),
64     which use a variable-radix, the freemap topology uses a fixed radix to
65     simplify the algorithm and to ensure freemap locality to the blocks
69     The leafs represent data in the zone.  Higher levels in the freemap
70     topology will cover more area but the physical freemap meta-data blocks
72     of almost any size can be formatted and the related freemap blocks
89     Since we use block 0 for the volume header, the first freemap reserved
108     The freemap does not have to be flushed by fsync/sync, but should probably
110     reason it does not have to be flushed with fsync is that freemap recovery
111     is executed on-mount and will use the last fully flushed freemap TID
120     The freemap granularity is 16KB (radix of 14) but the minimum
126     The freemap keeps track of partial allocations in-memory but not
167     some of the check area (a 24-byte area) for freemap-specific meta-data.
176     The freemap allocator uses a cylinder-group-like abstraction using
194     newfs_hammer2 does not need to format the freemap.  Instead, newfs_hammer2
197     leaves it to the live filesystem to initialize the freemap as more space
200     The freemap does NOT use a fixed 5-level radix tree.  It uses the same
203     smaller freemap depths.  2 layers (and not counting the volume header as
208     The H2 freemap leaf bitmap operates in 16KB chunks, but the leaf also
215     NOTE!  All operations on the freemap occur on the current live version
216 	   of the freemap, including bulkfree operations.
231 	     the temporary freemap.
233 	     Any allocated blocks in the live freemap are then transitioned
241 	     live filesystem while the freemap scan was running. It also
242 	     allows the freemap scans to run asynchronously from any flush,
247 	     topology is scanned and a freemap is built in-memory and then
248 	     compared against the live freemap.  Instead transitioning from
273     do not have to clean up the freemap and thus do not have to recurse
306     freemap that normal files use, with a few special cases added to force
307     specific radix values and to 'allocate' the freemap-related blocks
315     reserved block numbers can be trivially calculated.  As the freemap