1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322
|
/*
* Copyright (c) 2012 Dave Vasilevsky <dave@vasilevsky.ca>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "file.h"
#include "fs.h"
#include "swap.h"
#include "table.h"
#include <stdlib.h>
#include <string.h>
#include <sys/stat.h>
sqfs_err sqfs_frag_entry(sqfs *fs, struct squashfs_fragment_entry *frag,
uint32_t idx) {
sqfs_err err = SQFS_OK;
if (idx == SQUASHFS_INVALID_FRAG)
return SQFS_ERR;
err = sqfs_table_get(&fs->frag_table, fs, idx, frag);
sqfs_swapin_fragment_entry(frag);
return err;
}
sqfs_err sqfs_frag_block(sqfs *fs, sqfs_inode *inode,
size_t *offset, size_t *size, sqfs_block **block) {
struct squashfs_fragment_entry frag;
sqfs_err err = SQFS_OK;
if (!S_ISREG(inode->base.mode))
return SQFS_ERR;
err = sqfs_frag_entry(fs, &frag, inode->xtra.reg.frag_idx);
if (err)
return err;
err = sqfs_data_cache(fs, &fs->frag_cache, frag.start_block,
frag.size, block);
if (err)
return SQFS_ERR;
*offset = inode->xtra.reg.frag_off;
*size = inode->xtra.reg.file_size % fs->sb.block_size;
return SQFS_OK;
}
size_t sqfs_blocklist_count(sqfs *fs, sqfs_inode *inode) {
uint64_t size = inode->xtra.reg.file_size;
size_t block = fs->sb.block_size;
if (inode->xtra.reg.frag_idx == SQUASHFS_INVALID_FRAG) {
return sqfs_divceil(size, block);
} else {
return (size_t)(size / block);
}
}
void sqfs_blocklist_init(sqfs *fs, sqfs_inode *inode, sqfs_blocklist *bl) {
bl->fs = fs;
bl->remain = sqfs_blocklist_count(fs, inode);
bl->cur = inode->next;
bl->started = false;
bl->pos = 0;
bl->block = inode->xtra.reg.start_block;
bl->input_size = 0;
}
sqfs_err sqfs_blocklist_next(sqfs_blocklist *bl) {
sqfs_err err = SQFS_OK;
bool compressed;
if (bl->remain == 0)
return SQFS_ERR;
--(bl->remain);
err = sqfs_md_read(bl->fs, &bl->cur, &bl->header,
sizeof(bl->header));
if (err)
return err;
sqfs_swapin32(&bl->header);
bl->block += bl->input_size;
sqfs_data_header(bl->header, &compressed, &bl->input_size);
if (bl->started)
bl->pos += bl->fs->sb.block_size;
bl->started = true;
return SQFS_OK;
}
sqfs_err sqfs_read_range(sqfs *fs, sqfs_inode *inode, sqfs_off_t start,
sqfs_off_t *size, void *buf) {
sqfs_err err = SQFS_OK;
sqfs_off_t file_size;
size_t block_size;
sqfs_blocklist bl;
size_t read_off;
char *buf_orig;
if (!S_ISREG(inode->base.mode))
return SQFS_ERR;
file_size = inode->xtra.reg.file_size;
block_size = fs->sb.block_size;
if (*size < 0 || start > file_size)
return SQFS_ERR;
if (start == file_size) {
*size = 0;
return SQFS_OK;
}
err = sqfs_blockidx_blocklist(fs, inode, &bl, start);
if (err)
return err;
read_off = start % block_size;
buf_orig = buf;
while (*size > 0) {
sqfs_block *block = NULL;
size_t data_off, data_size;
size_t take;
bool fragment = (bl.remain == 0);
if (fragment) { /* fragment */
if (inode->xtra.reg.frag_idx == SQUASHFS_INVALID_FRAG)
break;
err = sqfs_frag_block(fs, inode, &data_off, &data_size, &block);
if (err)
return err;
} else {
if ((err = sqfs_blocklist_next(&bl)))
return err;
if (bl.pos + block_size <= start)
continue;
data_off = 0;
if (bl.input_size == 0) { /* Hole! */
data_size = (size_t)(file_size - bl.pos);
if (data_size > block_size)
data_size = block_size;
} else {
err = sqfs_data_cache(fs, &fs->data_cache, bl.block,
bl.header, &block);
if (err)
return err;
data_size = block->size;
}
}
take = data_size - read_off;
if (take > *size)
take = (size_t)(*size);
if (block) {
memcpy(buf, (char*)block->data + data_off + read_off, take);
sqfs_block_dispose(block);
} else {
memset(buf, 0, take);
}
read_off = 0;
*size -= take;
buf = (char*)buf + take;
if (fragment)
break;
}
*size = (char*)buf - buf_orig;
return *size ? SQFS_OK : SQFS_ERR;
}
/*
To read block N of a M-block file, we have to read N blocksizes from the,
metadata. This is a lot of work for large files! So for those files, we use
an index to speed it up.
The M blocksizes are split between M / SQUASHFS_METADATA_SIZE MD-blocks.
For each of these blocks, we maintain in the index the location of the
MD-block, and the location of the data block corresponding to the start
of that MD-block.
Then to read block N, we just calculate which metadata block index
("metablock") we want, and get that block-index entry. Then we
only need to read that one MD-block to seek within the file.
*/
/* Is a file worth indexing? */
static bool sqfs_blockidx_indexable(sqfs *fs, sqfs_inode *inode) {
size_t blocks = sqfs_blocklist_count(fs, inode);
size_t md_size = blocks * sizeof(sqfs_blocklist_entry);
return md_size >= SQUASHFS_METADATA_SIZE;
}
static void sqfs_blockidx_dispose(void *data) {
free(*(sqfs_blockidx_entry**)data);
}
sqfs_err sqfs_blockidx_init(sqfs_cache *cache) {
return sqfs_cache_init(cache, sizeof(sqfs_blockidx_entry**),
SQUASHFS_META_SLOTS, &sqfs_blockidx_dispose);
}
sqfs_err sqfs_blockidx_add(sqfs *fs, sqfs_inode *inode,
sqfs_blockidx_entry **out, sqfs_blockidx_entry **cachep) {
size_t blocks; /* Number of blocks in the file */
size_t md_size; /* Amount of metadata necessary to hold the blocksizes */
size_t count; /* Number of block-index entries necessary */
sqfs_blockidx_entry *blockidx;
sqfs_blocklist bl;
size_t i = 0;
bool first = true;
*out = NULL;
blocks = sqfs_blocklist_count(fs, inode);
md_size = blocks * sizeof(sqfs_blocklist_entry);
count = (inode->next.offset + md_size - 1)
/ SQUASHFS_METADATA_SIZE;
blockidx = malloc(count * sizeof(sqfs_blockidx_entry));
if (!blockidx)
return SQFS_ERR;
sqfs_blocklist_init(fs, inode, &bl);
while (bl.remain && i < count) {
sqfs_err err = SQFS_OK;
/* If the MD cursor offset is small, we found a new MD-block.
* Skip the first MD-block, because we already know where it is:
* inode->next.offset */
if (bl.cur.offset < sizeof(sqfs_blocklist_entry) && !first) {
blockidx[i].data_block = bl.block + bl.input_size;
blockidx[i++].md_block = (uint32_t)(bl.cur.block - fs->sb.inode_table_start);
}
first = false;
err = sqfs_blocklist_next(&bl);
if (err) {
free(blockidx);
return SQFS_ERR;
}
}
*out = *cachep = blockidx;
return SQFS_OK;
}
sqfs_err sqfs_blockidx_blocklist(sqfs *fs, sqfs_inode *inode,
sqfs_blocklist *bl, sqfs_off_t start) {
size_t block, metablock, skipped;
sqfs_blockidx_entry *blockidx, **bp;
sqfs_cache_idx idx;
sqfs_blocklist_init(fs, inode, bl);
block = (size_t)(start / fs->sb.block_size);
if (block > bl->remain) { /* fragment */
bl->remain = 0;
return SQFS_OK;
}
/* How many MD-blocks do we want to skip? */
metablock = (bl->cur.offset + block * sizeof(sqfs_blocklist_entry))
/ SQUASHFS_METADATA_SIZE;
if (metablock == 0)
return SQFS_OK; /* no skip needed, don't want an index */
if (!sqfs_blockidx_indexable(fs, inode))
return SQFS_OK; /* too small to index */
/* Get the index, creating it if necessary */
idx = inode->base.inode_number + 1; /* zero means invalid index */
bp = sqfs_cache_get(&fs->blockidx, idx);
if (sqfs_cache_entry_valid(&fs->blockidx, bp)) {
blockidx = *bp;
} else {
sqfs_err err = sqfs_blockidx_add(fs, inode, &blockidx, bp);
if (err) {
sqfs_cache_put(&fs->blockidx, bp);
return err;
}
sqfs_cache_entry_mark_valid(&fs->blockidx, bp);
}
skipped = (metablock * SQUASHFS_METADATA_SIZE / sizeof(sqfs_blocklist_entry))
- (bl->cur.offset / sizeof(sqfs_blocklist_entry));
blockidx += metablock - 1;
bl->cur.block = blockidx->md_block + fs->sb.inode_table_start;
bl->cur.offset %= sizeof(sqfs_blocklist_entry);
bl->remain -= skipped;
bl->pos = (uint64_t)skipped * fs->sb.block_size;
bl->block = blockidx->data_block;
sqfs_cache_put(&fs->blockidx, bp);
return SQFS_OK;
}
|