]> git.proxmox.com Git - mirror_qemu.git/blame - block/cloop.c
block: Mark bdrv_filter_bs() and callers GRAPH_RDLOCK
[mirror_qemu.git] / block / cloop.c
CommitLineData
3c56521b 1/*
585d0ed9 2 * QEMU Block driver for CLOOP images
5fafdf24 3 *
3c56521b 4 * Copyright (c) 2004 Johannes E. Schindelin
5fafdf24 5 *
3c56521b
FB
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:
12 *
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
15 *
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
22 * THE SOFTWARE.
23 */
80c71a24 24#include "qemu/osdep.h"
da34e65c 25#include "qapi/error.h"
398e6ad0 26#include "qemu/error-report.h"
e2c1c34f 27#include "block/block-io.h"
737e150e 28#include "block/block_int.h"
1de7afc9 29#include "qemu/module.h"
58369e22 30#include "qemu/bswap.h"
3c56521b
FB
31#include <zlib.h>
32
d65f97a8
SH
33/* Maximum compressed block size */
34#define MAX_BLOCK_SIZE (64 * 1024 * 1024)
35
3c56521b 36typedef struct BDRVCloopState {
848c66e8 37 CoMutex lock;
3c56521b
FB
38 uint32_t block_size;
39 uint32_t n_blocks;
5b47b7c3 40 uint64_t *offsets;
3c56521b
FB
41 uint32_t sectors_per_block;
42 uint32_t current_block;
28a5c9c8
FB
43 uint8_t *compressed_block;
44 uint8_t *uncompressed_block;
3c56521b
FB
45 z_stream zstream;
46} BDRVCloopState;
47
48static int cloop_probe(const uint8_t *buf, int buf_size, const char *filename)
49{
5b47b7c3
DXW
50 const char *magic_version_2_0 = "#!/bin/sh\n"
51 "#V2.0 Format\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) {
55 length = buf_size;
56 }
57 if (!memcmp(magic_version_2_0, buf, length)) {
58 return 2;
59 }
3c56521b
FB
60 return 0;
61}
62
015a1036
HR
63static int cloop_open(BlockDriverState *bs, QDict *options, int flags,
64 Error **errp)
3c56521b
FB
65{
66 BDRVCloopState *s = bs->opaque;
5b47b7c3 67 uint32_t offsets_size, max_compressed_block_size = 1, i;
1a60657f 68 int ret;
3c56521b 69
018f9dea 70 bdrv_graph_rdlock_main_loop();
eaa2410f 71 ret = bdrv_apply_auto_read_only(bs, NULL, errp);
018f9dea 72 bdrv_graph_rdunlock_main_loop();
eaa2410f
KW
73 if (ret < 0) {
74 return ret;
75 }
76
83930780
VSO
77 ret = bdrv_open_file_child(NULL, options, "file", bs, errp);
78 if (ret < 0) {
79 return ret;
4e4bf5c4
KW
80 }
81
3c56521b 82 /* read header */
32cc71de 83 ret = bdrv_pread(bs->file, 128, 4, &s->block_size, 0);
1a60657f
KW
84 if (ret < 0) {
85 return ret;
3c56521b 86 }
c94304be 87 s->block_size = be32_to_cpu(s->block_size);
d65f97a8 88 if (s->block_size % 512) {
370e6816 89 error_setg(errp, "block_size %" PRIu32 " must be a multiple of 512",
d65f97a8
SH
90 s->block_size);
91 return -EINVAL;
92 }
93 if (s->block_size == 0) {
94 error_setg(errp, "block_size cannot be zero");
95 return -EINVAL;
96 }
97
98 /* cloop's create_compressed_fs.c warns about block sizes beyond 256 KB but
99 * we can accept more. Prevent ridiculous values like 4 GB - 1 since we
100 * need a buffer this big.
101 */
102 if (s->block_size > MAX_BLOCK_SIZE) {
370e6816 103 error_setg(errp, "block_size %" PRIu32 " must be %u MB or less",
d65f97a8
SH
104 s->block_size,
105 MAX_BLOCK_SIZE / (1024 * 1024));
106 return -EINVAL;
107 }
c94304be 108
32cc71de 109 ret = bdrv_pread(bs->file, 128 + 4, 4, &s->n_blocks, 0);
1a60657f
KW
110 if (ret < 0) {
111 return ret;
c94304be
CH
112 }
113 s->n_blocks = be32_to_cpu(s->n_blocks);
3c56521b
FB
114
115 /* read offsets */
42d43d35 116 if (s->n_blocks > (UINT32_MAX - 1) / sizeof(uint64_t)) {
509a41ba 117 /* Prevent integer overflow */
370e6816 118 error_setg(errp, "n_blocks %" PRIu32 " must be %zu or less",
509a41ba 119 s->n_blocks,
42d43d35 120 (UINT32_MAX - 1) / sizeof(uint64_t));
509a41ba
SH
121 return -EINVAL;
122 }
42d43d35 123 offsets_size = (s->n_blocks + 1) * sizeof(uint64_t);
7b103b36
SH
124 if (offsets_size > 512 * 1024 * 1024) {
125 /* Prevent ridiculous offsets_size which causes memory allocation to
126 * fail or overflows bdrv_pread() size. In practice the 512 MB
127 * offsets[] limit supports 16 TB images at 256 KB block size.
128 */
129 error_setg(errp, "image requires too many offsets, "
130 "try increasing block size");
131 return -EINVAL;
132 }
4ae7a52e
KW
133
134 s->offsets = g_try_malloc(offsets_size);
135 if (s->offsets == NULL) {
136 error_setg(errp, "Could not allocate offsets table");
137 return -ENOMEM;
138 }
1a60657f 139
32cc71de 140 ret = bdrv_pread(bs->file, 128 + 4 + 4, offsets_size, s->offsets, 0);
1a60657f
KW
141 if (ret < 0) {
142 goto fail;
c94304be 143 }
1a60657f 144
42d43d35 145 for (i = 0; i < s->n_blocks + 1; i++) {
f56b9bc3
SH
146 uint64_t size;
147
5b47b7c3 148 s->offsets[i] = be64_to_cpu(s->offsets[i]);
f56b9bc3
SH
149 if (i == 0) {
150 continue;
151 }
152
153 if (s->offsets[i] < s->offsets[i - 1]) {
154 error_setg(errp, "offsets not monotonically increasing at "
370e6816 155 "index %" PRIu32 ", image file is corrupt", i);
f56b9bc3
SH
156 ret = -EINVAL;
157 goto fail;
158 }
159
160 size = s->offsets[i] - s->offsets[i - 1];
161
162 /* Compressed blocks should be smaller than the uncompressed block size
163 * but maybe compression performed poorly so the compressed block is
164 * actually bigger. Clamp down on unrealistic values to prevent
165 * ridiculous s->compressed_block allocation.
166 */
167 if (size > 2 * MAX_BLOCK_SIZE) {
370e6816
SH
168 error_setg(errp, "invalid compressed block size at index %" PRIu32
169 ", image file is corrupt", i);
f56b9bc3
SH
170 ret = -EINVAL;
171 goto fail;
172 }
173
174 if (size > max_compressed_block_size) {
175 max_compressed_block_size = size;
5b47b7c3 176 }
3c56521b
FB
177 }
178
179 /* initialize zlib engine */
4ae7a52e
KW
180 s->compressed_block = g_try_malloc(max_compressed_block_size + 1);
181 if (s->compressed_block == NULL) {
182 error_setg(errp, "Could not allocate compressed_block");
183 ret = -ENOMEM;
184 goto fail;
185 }
186
187 s->uncompressed_block = g_try_malloc(s->block_size);
188 if (s->uncompressed_block == NULL) {
189 error_setg(errp, "Could not allocate uncompressed_block");
190 ret = -ENOMEM;
191 goto fail;
192 }
193
5b47b7c3 194 if (inflateInit(&s->zstream) != Z_OK) {
1a60657f
KW
195 ret = -EINVAL;
196 goto fail;
5b47b7c3
DXW
197 }
198 s->current_block = s->n_blocks;
3b46e624 199
3c56521b 200 s->sectors_per_block = s->block_size/512;
5b47b7c3 201 bs->total_sectors = s->n_blocks * s->sectors_per_block;
848c66e8 202 qemu_co_mutex_init(&s->lock);
3c56521b 203 return 0;
c94304be 204
1a60657f
KW
205fail:
206 g_free(s->offsets);
207 g_free(s->compressed_block);
208 g_free(s->uncompressed_block);
209 return ret;
3c56521b
FB
210}
211
a6506481
EB
212static void cloop_refresh_limits(BlockDriverState *bs, Error **errp)
213{
a5b8dd2c 214 bs->bl.request_alignment = BDRV_SECTOR_SIZE; /* No sub-sector I/O */
a6506481
EB
215}
216
cf8d4c58
PB
217static int coroutine_fn GRAPH_RDLOCK
218cloop_read_block(BlockDriverState *bs, int block_num)
3c56521b 219{
20be49e4
CH
220 BDRVCloopState *s = bs->opaque;
221
5b47b7c3
DXW
222 if (s->current_block != block_num) {
223 int ret;
224 uint32_t bytes = s->offsets[block_num + 1] - s->offsets[block_num];
3b46e624 225
cf8d4c58
PB
226 ret = bdrv_co_pread(bs->file, s->offsets[block_num], bytes,
227 s->compressed_block, 0);
353a5d84 228 if (ret < 0) {
3c56521b 229 return -1;
5b47b7c3
DXW
230 }
231
232 s->zstream.next_in = s->compressed_block;
233 s->zstream.avail_in = bytes;
234 s->zstream.next_out = s->uncompressed_block;
235 s->zstream.avail_out = s->block_size;
236 ret = inflateReset(&s->zstream);
237 if (ret != Z_OK) {
238 return -1;
239 }
240 ret = inflate(&s->zstream, Z_FINISH);
241 if (ret != Z_STREAM_END || s->zstream.total_out != s->block_size) {
242 return -1;
243 }
5fafdf24 244
5b47b7c3 245 s->current_block = block_num;
3c56521b
FB
246 }
247 return 0;
248}
249
cf8d4c58 250static int coroutine_fn GRAPH_RDLOCK
f7ef38dd
VSO
251cloop_co_preadv(BlockDriverState *bs, int64_t offset, int64_t bytes,
252 QEMUIOVector *qiov, BdrvRequestFlags flags)
3c56521b
FB
253{
254 BDRVCloopState *s = bs->opaque;
5cd23081
KW
255 uint64_t sector_num = offset >> BDRV_SECTOR_BITS;
256 int nb_sectors = bytes >> BDRV_SECTOR_BITS;
257 int ret, i;
258
1bbbf32d
NS
259 assert(QEMU_IS_ALIGNED(offset, BDRV_SECTOR_SIZE));
260 assert(QEMU_IS_ALIGNED(bytes, BDRV_SECTOR_SIZE));
5cd23081
KW
261
262 qemu_co_mutex_lock(&s->lock);
3c56521b 263
5b47b7c3 264 for (i = 0; i < nb_sectors; i++) {
5cd23081 265 void *data;
5b47b7c3
DXW
266 uint32_t sector_offset_in_block =
267 ((sector_num + i) % s->sectors_per_block),
268 block_num = (sector_num + i) / s->sectors_per_block;
269 if (cloop_read_block(bs, block_num) != 0) {
5cd23081
KW
270 ret = -EIO;
271 goto fail;
5b47b7c3 272 }
5cd23081
KW
273
274 data = s->uncompressed_block + sector_offset_in_block * 512;
275 qemu_iovec_from_buf(qiov, i * 512, data, 512);
3c56521b 276 }
3c56521b 277
5cd23081
KW
278 ret = 0;
279fail:
2914caa0 280 qemu_co_mutex_unlock(&s->lock);
5cd23081 281
2914caa0
PB
282 return ret;
283}
284
3c56521b
FB
285static void cloop_close(BlockDriverState *bs)
286{
287 BDRVCloopState *s = bs->opaque;
42d43d35 288 g_free(s->offsets);
756f51e4
DXW
289 g_free(s->compressed_block);
290 g_free(s->uncompressed_block);
3c56521b
FB
291 inflateEnd(&s->zstream);
292}
293
5efa9d5a 294static BlockDriver bdrv_cloop = {
5b47b7c3
DXW
295 .format_name = "cloop",
296 .instance_size = sizeof(BDRVCloopState),
297 .bdrv_probe = cloop_probe,
298 .bdrv_open = cloop_open,
69dca43d 299 .bdrv_child_perm = bdrv_default_perms,
a6506481 300 .bdrv_refresh_limits = cloop_refresh_limits,
5cd23081 301 .bdrv_co_preadv = cloop_co_preadv,
5b47b7c3 302 .bdrv_close = cloop_close,
d67066d8 303 .is_format = true,
3c56521b 304};
5efa9d5a
AL
305
306static void bdrv_cloop_init(void)
307{
308 bdrv_register(&bdrv_cloop);
309}
310
311block_init(bdrv_cloop_init);