3 A qcow2 image file is organized in units of constant size, which are called
4 (host) clusters. A cluster is the unit in which all allocations are done,
5 both for actual guest data and for image metadata.
7 Likewise, the virtual disk as seen by the guest is divided into (guest)
8 clusters of the same size.
10 All numbers in qcow2 are stored in Big Endian byte order.
15 The first cluster of a qcow2 image contains the file header:
18 QCOW magic string ("QFI\xfb")
21 Version number (valid values are 2 and 3)
23 8 - 15: backing_file_offset
24 Offset into the image file at which the backing file name
25 is stored (NB: The string is not null terminated). 0 if the
26 image doesn't have a backing file.
28 16 - 19: backing_file_size
29 Length of the backing file name in bytes. Must not be
30 longer than 1023 bytes. Undefined if the image doesn't have
34 Number of bits that are used for addressing an offset
35 within a cluster (1 << cluster_bits is the cluster size).
36 Must not be less than 9 (i.e. 512 byte clusters).
38 Note: qemu as of today has an implementation limit of 2 MB
39 as the maximum cluster size and won't be able to open images
40 with larger cluster sizes.
43 Virtual disk size in bytes
51 Number of entries in the active L1 table
53 40 - 47: l1_table_offset
54 Offset into the image file at which the active L1 table
55 starts. Must be aligned to a cluster boundary.
57 48 - 55: refcount_table_offset
58 Offset into the image file at which the refcount table
59 starts. Must be aligned to a cluster boundary.
61 56 - 59: refcount_table_clusters
62 Number of clusters that the refcount table occupies
65 Number of snapshots contained in the image
67 64 - 71: snapshots_offset
68 Offset into the image file at which the snapshot table
69 starts. Must be aligned to a cluster boundary.
71 If the version is 3 or higher, the header has the following additional fields.
72 For version 2, the values are assumed to be zero, unless specified otherwise
73 in the description of a field.
75 72 - 79: incompatible_features
76 Bitmask of incompatible features. An implementation must
77 fail to open an image if an unknown bit is set.
79 Bit 0: Dirty bit. If this bit is set then refcounts
80 may be inconsistent, make sure to scan L1/L2
81 tables to repair refcounts before accessing the
84 Bit 1: Corrupt bit. If this bit is set then any data
85 structure may be corrupt and the image must not
86 be written to (unless for regaining
89 Bits 2-63: Reserved (set to 0)
91 80 - 87: compatible_features
92 Bitmask of compatible features. An implementation can
93 safely ignore any unknown bits that are set.
95 Bit 0: Lazy refcounts bit. If this bit is set then
96 lazy refcount updates can be used. This means
97 marking the image file dirty and postponing
98 refcount metadata updates.
100 Bits 1-63: Reserved (set to 0)
102 88 - 95: autoclear_features
103 Bitmask of auto-clear features. An implementation may only
104 write to an image with unknown auto-clear features if it
105 clears the respective bits from this field first.
107 Bit 0: Bitmaps extension bit
108 This bit indicates consistency for the bitmaps
111 It is an error if this bit is set without the
112 bitmaps extension present.
114 If the bitmaps extension is present but this
115 bit is unset, the bitmaps extension data must be
116 considered inconsistent.
118 Bits 1-63: Reserved (set to 0)
120 96 - 99: refcount_order
121 Describes the width of a reference count block entry (width
122 in bits: refcount_bits = 1 << refcount_order). For version 2
123 images, the order is always assumed to be 4
124 (i.e. refcount_bits = 16).
125 This value may not exceed 6 (i.e. refcount_bits = 64).
127 100 - 103: header_length
128 Length of the header structure in bytes. For version 2
129 images, the length is always assumed to be 72 bytes.
131 Directly after the image header, optional sections called header extensions can
132 be stored. Each extension has a structure like the following:
134 Byte 0 - 3: Header extension type:
135 0x00000000 - End of the header extension area
136 0xE2792ACA - Backing file format name
137 0x6803f857 - Feature name table
138 0x23852875 - Bitmaps extension
139 0x0537be77 - Full disk encryption header pointer
140 other - Unknown header extension, can be safely
143 4 - 7: Length of the header extension data
145 8 - n: Header extension data
147 n - m: Padding to round up the header extension size to the next
150 Unless stated otherwise, each header extension type shall appear at most once
153 If the image has a backing file then the backing file name should be stored in
154 the remaining space between the end of the header extension area and the end of
155 the first cluster. It is not allowed to store other data here, so that an
156 implementation can safely modify the header and add extensions without harming
157 data of compatible features that it doesn't support. Compatible features that
158 need space for additional data can use a header extension.
161 == Feature name table ==
163 The feature name table is an optional header extension that contains the name
164 for features used by the image. It can be used by applications that don't know
165 the respective feature (e.g. because the feature was introduced only later) to
166 display a useful error message.
168 The number of entries in the feature name table is determined by the length of
169 the header extension data. Each entry look like this:
171 Byte 0: Type of feature (select feature bitmap)
172 0: Incompatible feature
173 1: Compatible feature
176 1: Bit number within the selected feature bitmap (valid
179 2 - 47: Feature name (padded with zeros, but not necessarily null
180 terminated if it has full length)
183 == Bitmaps extension ==
185 The bitmaps extension is an optional header extension. It provides the ability
186 to store bitmaps related to a virtual disk. For now, there is only one bitmap
187 type: the dirty tracking bitmap, which tracks virtual disk changes from some
190 The data of the extension should be considered consistent only if the
191 corresponding auto-clear feature bit is set, see autoclear_features above.
193 The fields of the bitmaps extension are:
195 Byte 0 - 3: nb_bitmaps
196 The number of bitmaps contained in the image. Must be
197 greater than or equal to 1.
199 Note: Qemu currently only supports up to 65535 bitmaps per
202 4 - 7: Reserved, must be zero.
204 8 - 15: bitmap_directory_size
205 Size of the bitmap directory in bytes. It is the cumulative
206 size of all (nb_bitmaps) bitmap directory entries.
208 16 - 23: bitmap_directory_offset
209 Offset into the image file at which the bitmap directory
210 starts. Must be aligned to a cluster boundary.
212 == Full disk encryption header pointer ==
214 The full disk encryption header must be present if, and only if, the
215 'crypt_method' header requires metadata. Currently this is only true
216 of the 'LUKS' crypt method. The header extension must be absent for
219 This header provides the offset at which the crypt method can store
220 its additional data, as well as the length of such data.
222 Byte 0 - 7: Offset into the image file at which the encryption
223 header starts in bytes. Must be aligned to a cluster
225 Byte 8 - 15: Length of the written encryption header in bytes.
226 Note actual space allocated in the qcow2 file may
227 be larger than this value, since it will be rounded
228 to the nearest multiple of the cluster size. Any
229 unused bytes in the allocated space will be initialized
232 For the LUKS crypt method, the encryption header works as follows.
234 The first 592 bytes of the header clusters will contain the LUKS
235 partition header. This is then followed by the key material data areas.
236 The size of the key material data areas is determined by the number of
237 stripes in the key slot and key size. Refer to the LUKS format
238 specification ('docs/on-disk-format.pdf' in the cryptsetup source
239 package) for details of the LUKS partition header format.
241 In the LUKS partition header, the "payload-offset" field will be
242 calculated as normal for the LUKS spec. ie the size of the LUKS
243 header, plus key material regions, plus padding, relative to the
244 start of the LUKS header. This offset value is not required to be
245 qcow2 cluster aligned. Its value is currently never used in the
246 context of qcow2, since the qcow2 file format itself defines where
247 the real payload offset is, but none the less a valid payload offset
248 should always be present.
250 In the LUKS key slots header, the "key-material-offset" is relative
251 to the start of the LUKS header clusters in the qcow2 container,
252 not the start of the qcow2 file.
254 Logically the layout looks like
256 +-----------------------------+
258 | QCow2 header extension X |
259 | QCow2 header extension FDE |
260 | QCow2 header extension ... |
261 | QCow2 header extension Z |
262 +-----------------------------+
263 | ....other QCow2 tables.... |
266 +-----------------------------+
267 | +-------------------------+ |
268 | | LUKS partition header | |
269 | +-------------------------+ |
270 | | LUKS key material 1 | |
271 | +-------------------------+ |
272 | | LUKS key material 2 | |
273 | +-------------------------+ |
274 | | LUKS key material ... | |
275 | +-------------------------+ |
276 | | LUKS key material 8 | |
277 | +-------------------------+ |
278 +-----------------------------+
279 | QCow2 cluster payload |
284 +-----------------------------+
286 == Data encryption ==
288 When an encryption method is requested in the header, the image payload
289 data must be encrypted/decrypted on every write/read. The image headers
290 and metadata are never encrypted.
292 The algorithms used for encryption vary depending on the method
296 The AES cipher, in CBC mode, with 256 bit keys.
298 Initialization vectors generated using plain64 method, with
299 the virtual disk sector as the input tweak.
301 This format is no longer supported in QEMU system emulators, due
302 to a number of design flaws affecting its security. It is only
303 supported in the command line tools for the sake of back compatibility
308 The algorithms are specified in the LUKS header.
310 Initialization vectors generated using the method specified
311 in the LUKS header, with the physical disk sector as the
314 == Host cluster management ==
316 qcow2 manages the allocation of host clusters by maintaining a reference count
317 for each host cluster. A refcount of 0 means that the cluster is free, 1 means
318 that it is used, and >= 2 means that it is used and any write access must
319 perform a COW (copy on write) operation.
321 The refcounts are managed in a two-level table. The first level is called
322 refcount table and has a variable size (which is stored in the header). The
323 refcount table can cover multiple clusters, however it needs to be contiguous
326 It contains pointers to the second level structures which are called refcount
327 blocks and are exactly one cluster in size.
329 Given an offset into the image file, the refcount of its cluster can be
332 refcount_block_entries = (cluster_size * 8 / refcount_bits)
334 refcount_block_index = (offset / cluster_size) % refcount_block_entries
335 refcount_table_index = (offset / cluster_size) / refcount_block_entries
337 refcount_block = load_cluster(refcount_table[refcount_table_index]);
338 return refcount_block[refcount_block_index];
340 Refcount table entry:
342 Bit 0 - 8: Reserved (set to 0)
344 9 - 63: Bits 9-63 of the offset into the image file at which the
345 refcount block starts. Must be aligned to a cluster
348 If this is 0, the corresponding refcount block has not yet
349 been allocated. All refcounts managed by this refcount block
352 Refcount block entry (x = refcount_bits - 1):
354 Bit 0 - x: Reference count of the cluster. If refcount_bits implies a
355 sub-byte width, note that bit 0 means the least significant
359 == Cluster mapping ==
361 Just as for refcounts, qcow2 uses a two-level structure for the mapping of
362 guest clusters to host clusters. They are called L1 and L2 table.
364 The L1 table has a variable size (stored in the header) and may use multiple
365 clusters, however it must be contiguous in the image file. L2 tables are
366 exactly one cluster in size.
368 Given an offset into the virtual disk, the offset into the image file can be
371 l2_entries = (cluster_size / sizeof(uint64_t))
373 l2_index = (offset / cluster_size) % l2_entries
374 l1_index = (offset / cluster_size) / l2_entries
376 l2_table = load_cluster(l1_table[l1_index]);
377 cluster_offset = l2_table[l2_index];
379 return cluster_offset + (offset % cluster_size)
383 Bit 0 - 8: Reserved (set to 0)
385 9 - 55: Bits 9-55 of the offset into the image file at which the L2
386 table starts. Must be aligned to a cluster boundary. If the
387 offset is 0, the L2 table and all clusters described by this
388 L2 table are unallocated.
390 56 - 62: Reserved (set to 0)
392 63: 0 for an L2 table that is unused or requires COW, 1 if its
393 refcount is exactly one. This information is only accurate
394 in the active L1 table.
398 Bit 0 - 61: Cluster descriptor
400 62: 0 for standard clusters
401 1 for compressed clusters
403 63: 0 for clusters that are unused, compressed or require COW.
404 1 for standard clusters whose refcount is exactly one.
405 This information is only accurate in L2 tables
406 that are reachable from the active L1 table.
408 Standard Cluster Descriptor:
410 Bit 0: If set to 1, the cluster reads as all zeros. The host
411 cluster offset can be used to describe a preallocation,
412 but it won't be used for reading data from this cluster,
413 nor is data read from the backing file if the cluster is
416 With version 2, this is always 0.
418 1 - 8: Reserved (set to 0)
420 9 - 55: Bits 9-55 of host cluster offset. Must be aligned to a
421 cluster boundary. If the offset is 0, the cluster is
424 56 - 61: Reserved (set to 0)
427 Compressed Clusters Descriptor (x = 62 - (cluster_bits - 8)):
429 Bit 0 - x-1: Host cluster offset. This is usually _not_ aligned to a
430 cluster or sector boundary!
432 x - 61: Number of additional 512-byte sectors used for the
433 compressed data, beyond the sector containing the offset
434 in the previous field. Some of these sectors may reside
435 in the next contiguous host cluster.
437 Note that the compressed data does not necessarily occupy
438 all of the bytes in the final sector; rather, decompression
439 stops when it has produced a cluster of data.
441 Another compressed cluster may map to the tail of the final
442 sector used by this compressed cluster.
444 If a cluster is unallocated, read requests shall read the data from the backing
445 file (except if bit 0 in the Standard Cluster Descriptor is set). If there is
446 no backing file or the backing file is smaller than the image, they shall read
447 zeros for all parts that are not covered by the backing file.
452 qcow2 supports internal snapshots. Their basic principle of operation is to
453 switch the active L1 table, so that a different set of host clusters are
454 exposed to the guest.
456 When creating a snapshot, the L1 table should be copied and the refcount of all
457 L2 tables and clusters reachable from this L1 table must be increased, so that
458 a write causes a COW and isn't visible in other snapshots.
460 When loading a snapshot, bit 63 of all entries in the new active L1 table and
461 all L2 tables referenced by it must be reconstructed from the refcount table
462 as it doesn't need to be accurate in inactive L1 tables.
464 A directory of all snapshots is stored in the snapshot table, a contiguous area
465 in the image file, whose starting offset and length are given by the header
466 fields snapshots_offset and nb_snapshots. The entries of the snapshot table
467 have variable length, depending on the length of ID, name and extra data.
469 Snapshot table entry:
471 Byte 0 - 7: Offset into the image file at which the L1 table for the
472 snapshot starts. Must be aligned to a cluster boundary.
474 8 - 11: Number of entries in the L1 table of the snapshots
476 12 - 13: Length of the unique ID string describing the snapshot
478 14 - 15: Length of the name of the snapshot
480 16 - 19: Time at which the snapshot was taken in seconds since the
483 20 - 23: Subsecond part of the time at which the snapshot was taken
486 24 - 31: Time that the guest was running until the snapshot was
489 32 - 35: Size of the VM state in bytes. 0 if no VM state is saved.
490 If there is VM state, it starts at the first cluster
491 described by first L1 table entry that doesn't describe a
492 regular guest cluster (i.e. VM state is stored like guest
493 disk content, except that it is stored at offsets that are
494 larger than the virtual disk presented to the guest)
496 36 - 39: Size of extra data in the table entry (used for future
497 extensions of the format)
499 variable: Extra data for future extensions. Unknown fields must be
500 ignored. Currently defined are (offset relative to snapshot
503 Byte 40 - 47: Size of the VM state in bytes. 0 if no VM
504 state is saved. If this field is present,
505 the 32-bit value in bytes 32-35 is ignored.
507 Byte 48 - 55: Virtual disk size of the snapshot in bytes
509 Version 3 images must include extra data at least up to
512 variable: Unique ID string for the snapshot (not null terminated)
514 variable: Name of the snapshot (not null terminated)
516 variable: Padding to round up the snapshot table entry size to the
522 As mentioned above, the bitmaps extension provides the ability to store bitmaps
523 related to a virtual disk. This section describes how these bitmaps are stored.
525 All stored bitmaps are related to the virtual disk stored in the same image, so
526 each bitmap size is equal to the virtual disk size.
528 Each bit of the bitmap is responsible for strictly defined range of the virtual
529 disk. For bit number bit_nr the corresponding range (in bytes) will be:
531 [bit_nr * bitmap_granularity .. (bit_nr + 1) * bitmap_granularity - 1]
533 Granularity is a property of the concrete bitmap, see below.
536 === Bitmap directory ===
538 Each bitmap saved in the image is described in a bitmap directory entry. The
539 bitmap directory is a contiguous area in the image file, whose starting offset
540 and length are given by the header extension fields bitmap_directory_offset and
541 bitmap_directory_size. The entries of the bitmap directory have variable
542 length, depending on the lengths of the bitmap name and extra data.
544 Structure of a bitmap directory entry:
546 Byte 0 - 7: bitmap_table_offset
547 Offset into the image file at which the bitmap table
548 (described below) for the bitmap starts. Must be aligned to
551 8 - 11: bitmap_table_size
552 Number of entries in the bitmap table of the bitmap.
557 The bitmap was not saved correctly and may be
561 The bitmap must reflect all changes of the virtual
562 disk by any application that would write to this qcow2
563 file (including writes, snapshot switching, etc.). The
564 type of this bitmap must be 'dirty tracking bitmap'.
566 2: extra_data_compatible
567 This flags is meaningful when the extra data is
568 unknown to the software (currently any extra data is
570 If it is set, the bitmap may be used as expected, extra
571 data must be left as is.
572 If it is not set, the bitmap must not be used, but
573 both it and its extra data be left as is.
575 Bits 3 - 31 are reserved and must be 0.
578 This field describes the sort of the bitmap.
580 1: Dirty tracking bitmap
582 Values 0, 2 - 255 are reserved.
585 Granularity bits. Valid values: 0 - 63.
587 Note: Qemu currently supports only values 9 - 31.
589 Granularity is calculated as
590 granularity = 1 << granularity_bits
592 A bitmap's granularity is how many bytes of the image
593 accounts for one bit of the bitmap.
596 Size of the bitmap name. Must be non-zero.
598 Note: Qemu currently doesn't support values greater than
601 20 - 23: extra_data_size
602 Size of type-specific extra data.
604 For now, as no extra data is defined, extra_data_size is
605 reserved and should be zero. If it is non-zero the
606 behavior is defined by extra_data_compatible flag.
609 Extra data for the bitmap, occupying extra_data_size bytes.
610 Extra data must never contain references to clusters or in
611 some other way allocate additional clusters.
614 The name of the bitmap (not null terminated), occupying
615 name_size bytes. Must be unique among all bitmap names
616 within the bitmaps extension.
618 variable: Padding to round up the bitmap directory entry size to the
619 next multiple of 8. All bytes of the padding must be zero.
624 Each bitmap is stored using a one-level structure (as opposed to two-level
625 structures like for refcounts and guest clusters mapping) for the mapping of
626 bitmap data to host clusters. This structure is called the bitmap table.
628 Each bitmap table has a variable size (stored in the bitmap directory entry)
629 and may use multiple clusters, however, it must be contiguous in the image
632 Structure of a bitmap table entry:
634 Bit 0: Reserved and must be zero if bits 9 - 55 are non-zero.
635 If bits 9 - 55 are zero:
636 0: Cluster should be read as all zeros.
637 1: Cluster should be read as all ones.
639 1 - 8: Reserved and must be zero.
641 9 - 55: Bits 9 - 55 of the host cluster offset. Must be aligned to
642 a cluster boundary. If the offset is 0, the cluster is
643 unallocated; in that case, bit 0 determines how this
644 cluster should be treated during reads.
646 56 - 63: Reserved and must be zero.
651 As noted above, bitmap data is stored in separate clusters, described by the
652 bitmap table. Given an offset (in bytes) into the bitmap data, the offset into
653 the image file can be obtained as follows:
655 image_offset(bitmap_data_offset) =
656 bitmap_table[bitmap_data_offset / cluster_size] +
657 (bitmap_data_offset % cluster_size)
659 This offset is not defined if bits 9 - 55 of bitmap table entry are zero (see
662 Given an offset byte_nr into the virtual disk and the bitmap's granularity, the
663 bit offset into the image file to the corresponding bit of the bitmap can be
664 calculated like this:
666 bit_offset(byte_nr) =
667 image_offset(byte_nr / granularity / 8) * 8 +
668 (byte_nr / granularity) % 8
670 If the size of the bitmap data is not a multiple of the cluster size then the
671 last cluster of the bitmap data contains some unused tail bits. These bits must
675 === Dirty tracking bitmaps ===
677 Bitmaps with 'type' field equal to one are dirty tracking bitmaps.
679 When the virtual disk is in use dirty tracking bitmap may be 'enabled' or
680 'disabled'. While the bitmap is 'enabled', all writes to the virtual disk
681 should be reflected in the bitmap. A set bit in the bitmap means that the
682 corresponding range of the virtual disk (see above) was written to while the
683 bitmap was 'enabled'. An unset bit means that this range was not written to.
685 The software doesn't have to sync the bitmap in the image file with its
686 representation in RAM after each write. Flag 'in_use' should be set while the
687 bitmap is not synced.
689 In the image file the 'enabled' state is reflected by the 'auto' flag. If this
690 flag is set, the software must consider the bitmap as 'enabled' and start
691 tracking virtual disk changes to this bitmap from the first write to the
692 virtual disk. If this flag is not set then the bitmap is disabled.