2 * QEMU Block driver for CLOOP images
4 * Copyright (c) 2004 Johannes E. Schindelin
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
24 #include "qemu/osdep.h"
25 #include "qapi/error.h"
26 #include "qemu/error-report.h"
27 #include "block/block-io.h"
28 #include "block/block_int.h"
29 #include "qemu/module.h"
30 #include "qemu/bswap.h"
33 /* Maximum compressed block size */
34 #define MAX_BLOCK_SIZE (64 * 1024 * 1024)
36 typedef struct BDRVCloopState
{
41 uint32_t sectors_per_block
;
42 uint32_t current_block
;
43 uint8_t *compressed_block
;
44 uint8_t *uncompressed_block
;
48 static int cloop_probe(const uint8_t *buf
, int buf_size
, const char *filename
)
50 const char *magic_version_2_0
= "#!/bin/sh\n"
52 "modprobe cloop file=$0 && mount -r -t iso9660 /dev/cloop $1\n";
53 int length
= strlen(magic_version_2_0
);
54 if (length
> buf_size
) {
57 if (!memcmp(magic_version_2_0
, buf
, length
)) {
63 static int cloop_open(BlockDriverState
*bs
, QDict
*options
, int flags
,
66 BDRVCloopState
*s
= bs
->opaque
;
67 uint32_t offsets_size
, max_compressed_block_size
= 1, i
;
72 bdrv_graph_rdlock_main_loop();
73 ret
= bdrv_apply_auto_read_only(bs
, NULL
, errp
);
74 bdrv_graph_rdunlock_main_loop();
79 ret
= bdrv_open_file_child(NULL
, options
, "file", bs
, errp
);
84 GRAPH_RDLOCK_GUARD_MAINLOOP();
87 ret
= bdrv_pread(bs
->file
, 128, 4, &s
->block_size
, 0);
91 s
->block_size
= be32_to_cpu(s
->block_size
);
92 if (s
->block_size
% 512) {
93 error_setg(errp
, "block_size %" PRIu32
" must be a multiple of 512",
97 if (s
->block_size
== 0) {
98 error_setg(errp
, "block_size cannot be zero");
102 /* cloop's create_compressed_fs.c warns about block sizes beyond 256 KB but
103 * we can accept more. Prevent ridiculous values like 4 GB - 1 since we
104 * need a buffer this big.
106 if (s
->block_size
> MAX_BLOCK_SIZE
) {
107 error_setg(errp
, "block_size %" PRIu32
" must be %u MB or less",
109 MAX_BLOCK_SIZE
/ (1024 * 1024));
113 ret
= bdrv_pread(bs
->file
, 128 + 4, 4, &s
->n_blocks
, 0);
117 s
->n_blocks
= be32_to_cpu(s
->n_blocks
);
120 if (s
->n_blocks
> (UINT32_MAX
- 1) / sizeof(uint64_t)) {
121 /* Prevent integer overflow */
122 error_setg(errp
, "n_blocks %" PRIu32
" must be %zu or less",
124 (UINT32_MAX
- 1) / sizeof(uint64_t));
127 offsets_size
= (s
->n_blocks
+ 1) * sizeof(uint64_t);
128 if (offsets_size
> 512 * 1024 * 1024) {
129 /* Prevent ridiculous offsets_size which causes memory allocation to
130 * fail or overflows bdrv_pread() size. In practice the 512 MB
131 * offsets[] limit supports 16 TB images at 256 KB block size.
133 error_setg(errp
, "image requires too many offsets, "
134 "try increasing block size");
138 s
->offsets
= g_try_malloc(offsets_size
);
139 if (s
->offsets
== NULL
) {
140 error_setg(errp
, "Could not allocate offsets table");
144 ret
= bdrv_pread(bs
->file
, 128 + 4 + 4, offsets_size
, s
->offsets
, 0);
149 for (i
= 0; i
< s
->n_blocks
+ 1; i
++) {
152 s
->offsets
[i
] = be64_to_cpu(s
->offsets
[i
]);
157 if (s
->offsets
[i
] < s
->offsets
[i
- 1]) {
158 error_setg(errp
, "offsets not monotonically increasing at "
159 "index %" PRIu32
", image file is corrupt", i
);
164 size
= s
->offsets
[i
] - s
->offsets
[i
- 1];
166 /* Compressed blocks should be smaller than the uncompressed block size
167 * but maybe compression performed poorly so the compressed block is
168 * actually bigger. Clamp down on unrealistic values to prevent
169 * ridiculous s->compressed_block allocation.
171 if (size
> 2 * MAX_BLOCK_SIZE
) {
172 error_setg(errp
, "invalid compressed block size at index %" PRIu32
173 ", image file is corrupt", i
);
178 if (size
> max_compressed_block_size
) {
179 max_compressed_block_size
= size
;
183 /* initialize zlib engine */
184 s
->compressed_block
= g_try_malloc(max_compressed_block_size
+ 1);
185 if (s
->compressed_block
== NULL
) {
186 error_setg(errp
, "Could not allocate compressed_block");
191 s
->uncompressed_block
= g_try_malloc(s
->block_size
);
192 if (s
->uncompressed_block
== NULL
) {
193 error_setg(errp
, "Could not allocate uncompressed_block");
198 if (inflateInit(&s
->zstream
) != Z_OK
) {
202 s
->current_block
= s
->n_blocks
;
204 s
->sectors_per_block
= s
->block_size
/512;
205 bs
->total_sectors
= s
->n_blocks
* s
->sectors_per_block
;
206 qemu_co_mutex_init(&s
->lock
);
211 g_free(s
->compressed_block
);
212 g_free(s
->uncompressed_block
);
216 static void cloop_refresh_limits(BlockDriverState
*bs
, Error
**errp
)
218 bs
->bl
.request_alignment
= BDRV_SECTOR_SIZE
; /* No sub-sector I/O */
221 static int coroutine_fn GRAPH_RDLOCK
222 cloop_read_block(BlockDriverState
*bs
, int block_num
)
224 BDRVCloopState
*s
= bs
->opaque
;
226 if (s
->current_block
!= block_num
) {
228 uint32_t bytes
= s
->offsets
[block_num
+ 1] - s
->offsets
[block_num
];
230 ret
= bdrv_co_pread(bs
->file
, s
->offsets
[block_num
], bytes
,
231 s
->compressed_block
, 0);
236 s
->zstream
.next_in
= s
->compressed_block
;
237 s
->zstream
.avail_in
= bytes
;
238 s
->zstream
.next_out
= s
->uncompressed_block
;
239 s
->zstream
.avail_out
= s
->block_size
;
240 ret
= inflateReset(&s
->zstream
);
244 ret
= inflate(&s
->zstream
, Z_FINISH
);
245 if (ret
!= Z_STREAM_END
|| s
->zstream
.total_out
!= s
->block_size
) {
249 s
->current_block
= block_num
;
254 static int coroutine_fn GRAPH_RDLOCK
255 cloop_co_preadv(BlockDriverState
*bs
, int64_t offset
, int64_t bytes
,
256 QEMUIOVector
*qiov
, BdrvRequestFlags flags
)
258 BDRVCloopState
*s
= bs
->opaque
;
259 uint64_t sector_num
= offset
>> BDRV_SECTOR_BITS
;
260 int nb_sectors
= bytes
>> BDRV_SECTOR_BITS
;
263 assert(QEMU_IS_ALIGNED(offset
, BDRV_SECTOR_SIZE
));
264 assert(QEMU_IS_ALIGNED(bytes
, BDRV_SECTOR_SIZE
));
266 qemu_co_mutex_lock(&s
->lock
);
268 for (i
= 0; i
< nb_sectors
; i
++) {
270 uint32_t sector_offset_in_block
=
271 ((sector_num
+ i
) % s
->sectors_per_block
),
272 block_num
= (sector_num
+ i
) / s
->sectors_per_block
;
273 if (cloop_read_block(bs
, block_num
) != 0) {
278 data
= s
->uncompressed_block
+ sector_offset_in_block
* 512;
279 qemu_iovec_from_buf(qiov
, i
* 512, data
, 512);
284 qemu_co_mutex_unlock(&s
->lock
);
289 static void cloop_close(BlockDriverState
*bs
)
291 BDRVCloopState
*s
= bs
->opaque
;
293 g_free(s
->compressed_block
);
294 g_free(s
->uncompressed_block
);
295 inflateEnd(&s
->zstream
);
298 static BlockDriver bdrv_cloop
= {
299 .format_name
= "cloop",
300 .instance_size
= sizeof(BDRVCloopState
),
301 .bdrv_probe
= cloop_probe
,
302 .bdrv_open
= cloop_open
,
303 .bdrv_child_perm
= bdrv_default_perms
,
304 .bdrv_refresh_limits
= cloop_refresh_limits
,
305 .bdrv_co_preadv
= cloop_co_preadv
,
306 .bdrv_close
= cloop_close
,
310 static void bdrv_cloop_init(void)
312 bdrv_register(&bdrv_cloop
);
315 block_init(bdrv_cloop_init
);