]> git.proxmox.com Git - mirror_qemu.git/blame - block/cloop.c
spapr: Refactor spapr_populate_memory() to allow memoryless nodes
[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 */
faf07963 24#include "qemu-common.h"
737e150e 25#include "block/block_int.h"
1de7afc9 26#include "qemu/module.h"
3c56521b
FB
27#include <zlib.h>
28
d65f97a8
SH
29/* Maximum compressed block size */
30#define MAX_BLOCK_SIZE (64 * 1024 * 1024)
31
3c56521b 32typedef struct BDRVCloopState {
848c66e8 33 CoMutex lock;
3c56521b
FB
34 uint32_t block_size;
35 uint32_t n_blocks;
5b47b7c3 36 uint64_t *offsets;
3c56521b
FB
37 uint32_t sectors_per_block;
38 uint32_t current_block;
28a5c9c8
FB
39 uint8_t *compressed_block;
40 uint8_t *uncompressed_block;
3c56521b
FB
41 z_stream zstream;
42} BDRVCloopState;
43
44static int cloop_probe(const uint8_t *buf, int buf_size, const char *filename)
45{
5b47b7c3
DXW
46 const char *magic_version_2_0 = "#!/bin/sh\n"
47 "#V2.0 Format\n"
48 "modprobe cloop file=$0 && mount -r -t iso9660 /dev/cloop $1\n";
49 int length = strlen(magic_version_2_0);
50 if (length > buf_size) {
51 length = buf_size;
52 }
53 if (!memcmp(magic_version_2_0, buf, length)) {
54 return 2;
55 }
3c56521b
FB
56 return 0;
57}
58
015a1036
HR
59static int cloop_open(BlockDriverState *bs, QDict *options, int flags,
60 Error **errp)
3c56521b
FB
61{
62 BDRVCloopState *s = bs->opaque;
5b47b7c3 63 uint32_t offsets_size, max_compressed_block_size = 1, i;
1a60657f 64 int ret;
3c56521b 65
3c56521b
FB
66 bs->read_only = 1;
67
68 /* read header */
1a60657f
KW
69 ret = bdrv_pread(bs->file, 128, &s->block_size, 4);
70 if (ret < 0) {
71 return ret;
3c56521b 72 }
c94304be 73 s->block_size = be32_to_cpu(s->block_size);
d65f97a8 74 if (s->block_size % 512) {
370e6816 75 error_setg(errp, "block_size %" PRIu32 " must be a multiple of 512",
d65f97a8
SH
76 s->block_size);
77 return -EINVAL;
78 }
79 if (s->block_size == 0) {
80 error_setg(errp, "block_size cannot be zero");
81 return -EINVAL;
82 }
83
84 /* cloop's create_compressed_fs.c warns about block sizes beyond 256 KB but
85 * we can accept more. Prevent ridiculous values like 4 GB - 1 since we
86 * need a buffer this big.
87 */
88 if (s->block_size > MAX_BLOCK_SIZE) {
370e6816 89 error_setg(errp, "block_size %" PRIu32 " must be %u MB or less",
d65f97a8
SH
90 s->block_size,
91 MAX_BLOCK_SIZE / (1024 * 1024));
92 return -EINVAL;
93 }
c94304be 94
1a60657f
KW
95 ret = bdrv_pread(bs->file, 128 + 4, &s->n_blocks, 4);
96 if (ret < 0) {
97 return ret;
c94304be
CH
98 }
99 s->n_blocks = be32_to_cpu(s->n_blocks);
3c56521b
FB
100
101 /* read offsets */
42d43d35 102 if (s->n_blocks > (UINT32_MAX - 1) / sizeof(uint64_t)) {
509a41ba 103 /* Prevent integer overflow */
370e6816 104 error_setg(errp, "n_blocks %" PRIu32 " must be %zu or less",
509a41ba 105 s->n_blocks,
42d43d35 106 (UINT32_MAX - 1) / sizeof(uint64_t));
509a41ba
SH
107 return -EINVAL;
108 }
42d43d35 109 offsets_size = (s->n_blocks + 1) * sizeof(uint64_t);
7b103b36
SH
110 if (offsets_size > 512 * 1024 * 1024) {
111 /* Prevent ridiculous offsets_size which causes memory allocation to
112 * fail or overflows bdrv_pread() size. In practice the 512 MB
113 * offsets[] limit supports 16 TB images at 256 KB block size.
114 */
115 error_setg(errp, "image requires too many offsets, "
116 "try increasing block size");
117 return -EINVAL;
118 }
4ae7a52e
KW
119
120 s->offsets = g_try_malloc(offsets_size);
121 if (s->offsets == NULL) {
122 error_setg(errp, "Could not allocate offsets table");
123 return -ENOMEM;
124 }
1a60657f
KW
125
126 ret = bdrv_pread(bs->file, 128 + 4 + 4, s->offsets, offsets_size);
127 if (ret < 0) {
128 goto fail;
c94304be 129 }
1a60657f 130
42d43d35 131 for (i = 0; i < s->n_blocks + 1; i++) {
f56b9bc3
SH
132 uint64_t size;
133
5b47b7c3 134 s->offsets[i] = be64_to_cpu(s->offsets[i]);
f56b9bc3
SH
135 if (i == 0) {
136 continue;
137 }
138
139 if (s->offsets[i] < s->offsets[i - 1]) {
140 error_setg(errp, "offsets not monotonically increasing at "
370e6816 141 "index %" PRIu32 ", image file is corrupt", i);
f56b9bc3
SH
142 ret = -EINVAL;
143 goto fail;
144 }
145
146 size = s->offsets[i] - s->offsets[i - 1];
147
148 /* Compressed blocks should be smaller than the uncompressed block size
149 * but maybe compression performed poorly so the compressed block is
150 * actually bigger. Clamp down on unrealistic values to prevent
151 * ridiculous s->compressed_block allocation.
152 */
153 if (size > 2 * MAX_BLOCK_SIZE) {
370e6816
SH
154 error_setg(errp, "invalid compressed block size at index %" PRIu32
155 ", image file is corrupt", i);
f56b9bc3
SH
156 ret = -EINVAL;
157 goto fail;
158 }
159
160 if (size > max_compressed_block_size) {
161 max_compressed_block_size = size;
5b47b7c3 162 }
3c56521b
FB
163 }
164
165 /* initialize zlib engine */
4ae7a52e
KW
166 s->compressed_block = g_try_malloc(max_compressed_block_size + 1);
167 if (s->compressed_block == NULL) {
168 error_setg(errp, "Could not allocate compressed_block");
169 ret = -ENOMEM;
170 goto fail;
171 }
172
173 s->uncompressed_block = g_try_malloc(s->block_size);
174 if (s->uncompressed_block == NULL) {
175 error_setg(errp, "Could not allocate uncompressed_block");
176 ret = -ENOMEM;
177 goto fail;
178 }
179
5b47b7c3 180 if (inflateInit(&s->zstream) != Z_OK) {
1a60657f
KW
181 ret = -EINVAL;
182 goto fail;
5b47b7c3
DXW
183 }
184 s->current_block = s->n_blocks;
3b46e624 185
3c56521b 186 s->sectors_per_block = s->block_size/512;
5b47b7c3 187 bs->total_sectors = s->n_blocks * s->sectors_per_block;
848c66e8 188 qemu_co_mutex_init(&s->lock);
3c56521b 189 return 0;
c94304be 190
1a60657f
KW
191fail:
192 g_free(s->offsets);
193 g_free(s->compressed_block);
194 g_free(s->uncompressed_block);
195 return ret;
3c56521b
FB
196}
197
20be49e4 198static inline int cloop_read_block(BlockDriverState *bs, int block_num)
3c56521b 199{
20be49e4
CH
200 BDRVCloopState *s = bs->opaque;
201
5b47b7c3
DXW
202 if (s->current_block != block_num) {
203 int ret;
204 uint32_t bytes = s->offsets[block_num + 1] - s->offsets[block_num];
3b46e624 205
20be49e4
CH
206 ret = bdrv_pread(bs->file, s->offsets[block_num], s->compressed_block,
207 bytes);
5b47b7c3 208 if (ret != bytes) {
3c56521b 209 return -1;
5b47b7c3
DXW
210 }
211
212 s->zstream.next_in = s->compressed_block;
213 s->zstream.avail_in = bytes;
214 s->zstream.next_out = s->uncompressed_block;
215 s->zstream.avail_out = s->block_size;
216 ret = inflateReset(&s->zstream);
217 if (ret != Z_OK) {
218 return -1;
219 }
220 ret = inflate(&s->zstream, Z_FINISH);
221 if (ret != Z_STREAM_END || s->zstream.total_out != s->block_size) {
222 return -1;
223 }
5fafdf24 224
5b47b7c3 225 s->current_block = block_num;
3c56521b
FB
226 }
227 return 0;
228}
229
5fafdf24 230static int cloop_read(BlockDriverState *bs, int64_t sector_num,
3c56521b
FB
231 uint8_t *buf, int nb_sectors)
232{
233 BDRVCloopState *s = bs->opaque;
234 int i;
235
5b47b7c3
DXW
236 for (i = 0; i < nb_sectors; i++) {
237 uint32_t sector_offset_in_block =
238 ((sector_num + i) % s->sectors_per_block),
239 block_num = (sector_num + i) / s->sectors_per_block;
240 if (cloop_read_block(bs, block_num) != 0) {
241 return -1;
242 }
243 memcpy(buf + i * 512,
244 s->uncompressed_block + sector_offset_in_block * 512, 512);
3c56521b
FB
245 }
246 return 0;
247}
248
2914caa0
PB
249static coroutine_fn int cloop_co_read(BlockDriverState *bs, int64_t sector_num,
250 uint8_t *buf, int nb_sectors)
251{
252 int ret;
253 BDRVCloopState *s = bs->opaque;
254 qemu_co_mutex_lock(&s->lock);
255 ret = cloop_read(bs, sector_num, buf, nb_sectors);
256 qemu_co_mutex_unlock(&s->lock);
257 return ret;
258}
259
3c56521b
FB
260static void cloop_close(BlockDriverState *bs)
261{
262 BDRVCloopState *s = bs->opaque;
42d43d35 263 g_free(s->offsets);
756f51e4
DXW
264 g_free(s->compressed_block);
265 g_free(s->uncompressed_block);
3c56521b
FB
266 inflateEnd(&s->zstream);
267}
268
5efa9d5a 269static BlockDriver bdrv_cloop = {
5b47b7c3
DXW
270 .format_name = "cloop",
271 .instance_size = sizeof(BDRVCloopState),
272 .bdrv_probe = cloop_probe,
273 .bdrv_open = cloop_open,
274 .bdrv_read = cloop_co_read,
275 .bdrv_close = cloop_close,
3c56521b 276};
5efa9d5a
AL
277
278static void bdrv_cloop_init(void)
279{
280 bdrv_register(&bdrv_cloop);
281}
282
283block_init(bdrv_cloop_init);