2010-01-13 03:16:25 +00:00
|
|
|
#include "pixz.h"
|
2010-01-12 22:00:37 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
#include <archive.h>
|
|
|
|
#include <archive_entry.h>
|
2010-01-12 22:00:37 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
|
|
|
|
#pragma mark DECLARE WANTED
|
|
|
|
|
|
|
|
typedef struct wanted_t wanted_t;
|
|
|
|
struct wanted_t {
|
|
|
|
wanted_t *next;
|
|
|
|
char *name;
|
|
|
|
off_t start, end;
|
|
|
|
size_t size;
|
|
|
|
};
|
|
|
|
|
|
|
|
static wanted_t *gWantedFiles = NULL;
|
|
|
|
|
|
|
|
static bool spec_match(char *spec, char *name);
|
|
|
|
static void wanted_files(size_t count, char **specs);
|
|
|
|
static void wanted_free(wanted_t *w);
|
|
|
|
|
|
|
|
|
|
|
|
#pragma mark DECLARE PIPELINE
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
uint8_t *input, *output;
|
|
|
|
size_t insize, outsize;
|
|
|
|
off_t uoffset; // uncompressed offset
|
|
|
|
} io_block_t;
|
|
|
|
|
|
|
|
static void *block_create(void);
|
|
|
|
static void block_free(void *data);
|
|
|
|
static void read_thread(void);
|
|
|
|
static void decode_thread(size_t thnum);
|
|
|
|
|
|
|
|
|
|
|
|
#pragma mark DECLARE ARCHIVE
|
|
|
|
|
|
|
|
static pipeline_item_t *gArItem = NULL, *gArLastItem = NULL;
|
|
|
|
static off_t gArLastOffset;
|
|
|
|
static size_t gArLastSize;
|
|
|
|
static wanted_t *gArWanted = NULL;
|
|
|
|
static bool gArNextItem = false;
|
|
|
|
|
|
|
|
static int tar_ok(struct archive *ar, void *ref);
|
|
|
|
static ssize_t tar_read(struct archive *ar, void *ref, const void **bufp);
|
|
|
|
static bool tar_next_block(void);
|
2010-10-14 04:39:43 +00:00
|
|
|
static void tar_write_last(void);
|
2010-10-14 04:27:50 +00:00
|
|
|
|
|
|
|
|
|
|
|
#pragma mark DECLARE UTILS
|
|
|
|
|
|
|
|
static lzma_vli gFileIndexOffset = 0;
|
|
|
|
static size_t gBlockInSize = 0, gBlockOutSize = 0;
|
|
|
|
|
|
|
|
static void set_block_sizes(void);
|
2010-10-14 04:56:26 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
|
|
|
|
#pragma mark MAIN
|
2010-01-12 22:00:37 +00:00
|
|
|
|
2010-10-14 04:56:26 +00:00
|
|
|
void pixz_read(bool verify, size_t nspecs, char **specs) {
|
2010-10-14 04:27:50 +00:00
|
|
|
decode_index();
|
|
|
|
if (verify)
|
|
|
|
gFileIndexOffset = read_file_index(0);
|
2010-10-14 04:39:43 +00:00
|
|
|
wanted_files(nspecs, specs);
|
|
|
|
set_block_sizes();
|
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
#if DEBUG
|
|
|
|
for (wanted_t *w = gWantedFiles; w; w = w->next)
|
|
|
|
debug("want: %s", w->name);
|
|
|
|
#endif
|
2010-01-12 22:00:37 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
pipeline_create(block_create, block_free, read_thread, decode_thread);
|
|
|
|
if (verify && gFileIndexOffset) {
|
|
|
|
gArWanted = gWantedFiles;
|
|
|
|
wanted_t *w = gWantedFiles, *wlast = NULL;
|
|
|
|
bool lastmulti = false;
|
|
|
|
off_t lastoff = 0;
|
|
|
|
|
|
|
|
struct archive *ar = archive_read_new();
|
|
|
|
archive_read_support_compression_none(ar);
|
|
|
|
archive_read_support_format_tar(ar);
|
|
|
|
archive_read_open(ar, NULL, tar_ok, tar_read, tar_ok);
|
|
|
|
struct archive_entry *entry;
|
|
|
|
while (true) {
|
|
|
|
int aerr = archive_read_next_header(ar, &entry);
|
|
|
|
if (aerr == ARCHIVE_EOF) {
|
|
|
|
break;
|
|
|
|
} else if (aerr != ARCHIVE_OK && aerr != ARCHIVE_WARN) {
|
|
|
|
fprintf(stderr, "%s\n", archive_error_string(ar));
|
|
|
|
die("Error reading archive entry");
|
|
|
|
}
|
|
|
|
|
|
|
|
off_t off = archive_read_header_position(ar);
|
|
|
|
const char *path = archive_entry_pathname(entry);
|
|
|
|
if (!lastmulti) {
|
|
|
|
if (wlast && wlast->size != off - lastoff)
|
|
|
|
die("Index and archive show differing sizes for %s: %d vs %d",
|
|
|
|
wlast->name, wlast->size, off - lastoff);
|
|
|
|
lastoff = off;
|
|
|
|
}
|
|
|
|
|
|
|
|
lastmulti = is_multi_header(path);
|
|
|
|
if (lastmulti)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (!w)
|
|
|
|
die("File %s missing in index", path);
|
|
|
|
if (strcmp(path, w->name) != 0)
|
|
|
|
die("Index and archive differ as to next file: %s vs %s",
|
|
|
|
w->name, path);
|
|
|
|
|
|
|
|
wlast = w;
|
|
|
|
w = w->next;
|
|
|
|
}
|
|
|
|
if (w && w->name)
|
|
|
|
die("File %s missing in archive", w->name);
|
2010-10-14 04:39:43 +00:00
|
|
|
tar_write_last(); // write whatever's left
|
2010-10-14 04:27:50 +00:00
|
|
|
} else {
|
|
|
|
pipeline_item_t *pi;
|
|
|
|
while ((pi = pipeline_merged())) {
|
|
|
|
io_block_t *ib = (io_block_t*)(pi->data);
|
|
|
|
fwrite(ib->output, ib->outsize, 1, gOutFile);
|
|
|
|
queue_push(gPipelineStartQ, PIPELINE_ITEM, pi);
|
|
|
|
}
|
|
|
|
}
|
2010-01-12 23:19:45 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
pipeline_destroy();
|
|
|
|
wanted_free(gWantedFiles);
|
2010-01-12 22:00:37 +00:00
|
|
|
}
|
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
|
|
|
|
#pragma mark BLOCKS
|
|
|
|
|
|
|
|
static void *block_create(void) {
|
|
|
|
io_block_t *ib = malloc(sizeof(io_block_t));
|
|
|
|
ib->input = malloc(gBlockInSize);
|
|
|
|
ib->output = malloc(gBlockOutSize);
|
|
|
|
return ib;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void block_free(void* data) {
|
|
|
|
io_block_t *ib = (io_block_t*)data;
|
|
|
|
free(ib->input);
|
|
|
|
free(ib->output);
|
|
|
|
free(ib);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#pragma mark SETUP
|
|
|
|
|
|
|
|
static void set_block_sizes() {
|
|
|
|
lzma_index_iter iter;
|
|
|
|
lzma_index_iter_init(&iter, gIndex);
|
|
|
|
while (!lzma_index_iter_next(&iter, LZMA_INDEX_ITER_BLOCK)) {
|
|
|
|
// exclude the file index block
|
|
|
|
lzma_vli off = iter.block.compressed_file_offset;
|
|
|
|
if (gFileIndexOffset && off == gFileIndexOffset)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
size_t in = iter.block.total_size,
|
|
|
|
out = iter.block.uncompressed_size;
|
|
|
|
if (out > gBlockOutSize)
|
|
|
|
gBlockOutSize = out;
|
|
|
|
if (in > gBlockInSize)
|
|
|
|
gBlockInSize = in;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void wanted_free(wanted_t *w) {
|
|
|
|
for (wanted_t *w = gWantedFiles; w; ) {
|
|
|
|
wanted_t *tmp = w->next;
|
|
|
|
free(w);
|
|
|
|
w = tmp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool spec_match(char *spec, char *name) {
|
|
|
|
bool match = true;
|
|
|
|
for (; *spec; ++spec, ++name) {
|
|
|
|
if (!*name || *spec != *name) { // spec must be equal or prefix
|
|
|
|
match = false;
|
2010-01-12 23:19:45 +00:00
|
|
|
break;
|
2010-10-14 04:27:50 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
// If spec's a prefix of the file name, it must be a dir name
|
|
|
|
return match && (!*name || *name == '/');
|
|
|
|
}
|
|
|
|
|
|
|
|
static void wanted_files(size_t count, char **specs) {
|
|
|
|
if (!gFileIndexOffset) {
|
|
|
|
if (count)
|
|
|
|
die("Can't filter non-tarball");
|
|
|
|
gWantedFiles = NULL;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Remove trailing slashes from specs
|
|
|
|
for (char **spec = specs; spec < specs + count; ++spec) {
|
|
|
|
char *c = *spec;
|
|
|
|
while (*c++) ; // forward to end
|
|
|
|
while (--c >= *spec && *c == '/')
|
|
|
|
*c = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
bool matched[count]; // for each spec, does it match?
|
|
|
|
memset(matched, 0, sizeof(matched));
|
|
|
|
wanted_t *last = NULL;
|
|
|
|
|
|
|
|
// Check each file in order, to see if we want it
|
|
|
|
for (file_index_t *f = gFileIndex; f->name; f = f->next) {
|
|
|
|
bool match = !count;
|
|
|
|
for (char **spec = specs; spec < specs + count; ++spec) {
|
|
|
|
if (spec_match(*spec, f->name)) {
|
|
|
|
match = true;
|
|
|
|
matched[spec - specs] = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (match) {
|
|
|
|
wanted_t *w = malloc(sizeof(wanted_t));
|
|
|
|
*w = (wanted_t){ .name = f->name, .start = f->offset,
|
|
|
|
.end = f->next->offset, .next = NULL };
|
|
|
|
w->size = w->end - w->start;
|
|
|
|
if (last) {
|
|
|
|
last->next = w;
|
|
|
|
} else {
|
|
|
|
gWantedFiles = w;
|
|
|
|
}
|
|
|
|
last = w;
|
|
|
|
}
|
2010-01-12 23:19:45 +00:00
|
|
|
}
|
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
// Make sure each spec matched
|
|
|
|
for (size_t i = 0; i < count; ++i) {
|
|
|
|
if (!matched[i])
|
|
|
|
die("\"%s\" not found in archive", *(specs + i));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#pragma mark THREADS
|
|
|
|
|
|
|
|
static void read_thread(void) {
|
|
|
|
off_t offset = ftello(gInFile);
|
|
|
|
wanted_t *w = gWantedFiles;
|
|
|
|
|
2010-10-11 00:07:13 +00:00
|
|
|
lzma_index_iter iter;
|
|
|
|
lzma_index_iter_init(&iter, gIndex);
|
2010-10-14 04:27:50 +00:00
|
|
|
while (!lzma_index_iter_next(&iter, LZMA_INDEX_ITER_BLOCK)) {
|
|
|
|
// Don't decode the file-index
|
|
|
|
off_t boffset = iter.block.compressed_file_offset;
|
|
|
|
size_t bsize = iter.block.total_size;
|
|
|
|
if (gFileIndexOffset && boffset == gFileIndexOffset)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Do we need this block?
|
|
|
|
if (gWantedFiles) {
|
|
|
|
off_t uend = iter.block.uncompressed_file_offset +
|
|
|
|
iter.block.uncompressed_size;
|
|
|
|
if (!w || w->start >= uend) {
|
|
|
|
debug("read: skip %llu", iter.block.number_in_file);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
for ( ; w && w->end < uend; w = w->next) ;
|
|
|
|
}
|
|
|
|
debug("read: want %llu", iter.block.number_in_file);
|
|
|
|
|
|
|
|
// Get a block to work with
|
|
|
|
pipeline_item_t *pi;
|
|
|
|
queue_pop(gPipelineStartQ, (void**)&pi);
|
|
|
|
io_block_t *ib = (io_block_t*)(pi->data);
|
2010-01-12 23:19:45 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
// Seek if needed, and get the data
|
|
|
|
if (offset != boffset) {
|
|
|
|
fseeko(gInFile, boffset, SEEK_SET);
|
|
|
|
offset = boffset;
|
|
|
|
}
|
|
|
|
ib->insize = fread(ib->input, 1, bsize, gInFile);
|
|
|
|
if (ib->insize < bsize)
|
|
|
|
die("Error reading block contents");
|
|
|
|
offset += bsize;
|
|
|
|
ib->uoffset = iter.block.uncompressed_file_offset;
|
|
|
|
|
|
|
|
pipeline_split(pi);
|
|
|
|
}
|
|
|
|
|
|
|
|
pipeline_stop();
|
2010-01-12 23:19:45 +00:00
|
|
|
}
|
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
static void decode_thread(size_t thnum) {
|
|
|
|
lzma_stream stream = LZMA_STREAM_INIT;
|
|
|
|
lzma_filter filters[LZMA_FILTERS_MAX + 1];
|
|
|
|
lzma_block block = { .filters = filters, .check = gCheck, .version = 0 };
|
2010-01-12 23:19:45 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
pipeline_item_t *pi;
|
|
|
|
io_block_t *ib;
|
|
|
|
|
|
|
|
while (PIPELINE_STOP != queue_pop(gPipelineSplitQ, (void**)&pi)) {
|
|
|
|
ib = (io_block_t*)(pi->data);
|
2010-01-12 23:19:45 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
block.header_size = lzma_block_header_size_decode(*(ib->input));
|
|
|
|
if (lzma_block_header_decode(&block, NULL, ib->input) != LZMA_OK)
|
|
|
|
die("Error decoding block header");
|
|
|
|
if (lzma_block_decoder(&stream, &block) != LZMA_OK)
|
|
|
|
die("Error initializing block decode");
|
2010-01-12 23:19:45 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
stream.avail_in = ib->insize - block.header_size;
|
|
|
|
stream.next_in = ib->input + block.header_size;
|
|
|
|
stream.avail_out = gBlockOutSize;
|
|
|
|
stream.next_out = ib->output;
|
2010-01-12 23:19:45 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
lzma_ret err = LZMA_OK;
|
|
|
|
while (err != LZMA_STREAM_END) {
|
|
|
|
if (err != LZMA_OK)
|
|
|
|
die("Error decoding block");
|
|
|
|
err = lzma_code(&stream, LZMA_FINISH);
|
2010-01-12 23:19:45 +00:00
|
|
|
}
|
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
ib->outsize = stream.next_out - ib->output;
|
|
|
|
queue_push(gPipelineMergeQ, PIPELINE_ITEM, pi);
|
|
|
|
}
|
|
|
|
lzma_end(&stream);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#pragma mark ARCHIVE
|
|
|
|
|
|
|
|
static int tar_ok(struct archive *ar, void *ref) {
|
|
|
|
return ARCHIVE_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool tar_next_block(void) {
|
|
|
|
if (gArItem && !gArNextItem && gArWanted) {
|
|
|
|
io_block_t *ib = (io_block_t*)(gArItem->data);
|
|
|
|
if (gArWanted->start < ib->uoffset + ib->outsize)
|
|
|
|
return true; // No need
|
|
|
|
}
|
|
|
|
|
|
|
|
if (gArLastItem)
|
|
|
|
queue_push(gPipelineStartQ, PIPELINE_ITEM, gArLastItem);
|
|
|
|
gArLastItem = gArItem;
|
|
|
|
gArItem = pipeline_merged();
|
|
|
|
gArNextItem = false;
|
|
|
|
return gArItem;
|
|
|
|
}
|
|
|
|
|
2010-10-14 04:39:43 +00:00
|
|
|
static void tar_write_last(void) {
|
2010-10-14 04:27:50 +00:00
|
|
|
if (gArItem) {
|
|
|
|
io_block_t *ib = (io_block_t*)(gArItem->data);
|
|
|
|
fwrite(ib->output + gArLastOffset, gArLastSize, 1, gOutFile);
|
|
|
|
gArLastSize = 0;
|
|
|
|
}
|
2010-10-14 04:39:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t tar_read(struct archive *ar, void *ref, const void **bufp) {
|
|
|
|
// If we got here, the last bit of archive is ok to write
|
|
|
|
tar_write_last();
|
2010-01-12 23:19:45 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
// Write the first wanted file
|
|
|
|
if (!tar_next_block())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
off_t off;
|
|
|
|
size_t size;
|
|
|
|
io_block_t *ib = (io_block_t*)(gArItem->data);
|
|
|
|
if (gWantedFiles) {
|
|
|
|
debug("tar want: %s", gArWanted->name);
|
|
|
|
off = gArWanted->start - ib->uoffset;
|
|
|
|
size = gArWanted->size;
|
|
|
|
if (off < 0) {
|
|
|
|
size += off;
|
|
|
|
off = 0;
|
|
|
|
}
|
2010-11-12 03:00:18 +00:00
|
|
|
if (off + size > ib->outsize) {
|
2010-10-14 04:27:50 +00:00
|
|
|
size = ib->outsize - off;
|
|
|
|
gArNextItem = true; // force the end of this block
|
|
|
|
} else {
|
|
|
|
gArWanted = gArWanted->next;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
off = 0;
|
|
|
|
size = ib->outsize;
|
2010-01-12 23:19:45 +00:00
|
|
|
}
|
2010-10-14 04:56:26 +00:00
|
|
|
debug("tar off = %llu, size = %zu", (unsigned long long)off, size);
|
2010-01-12 23:19:45 +00:00
|
|
|
|
2010-10-14 04:27:50 +00:00
|
|
|
gArLastOffset = off;
|
|
|
|
gArLastSize = size;
|
|
|
|
if (bufp)
|
|
|
|
*bufp = ib->output + off;
|
|
|
|
return size;
|
2010-01-12 23:19:45 +00:00
|
|
|
}
|