2011-12-21 19:00:10 +01:00
|
|
|
/*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
|
|
|
|
|
|
|
|
/***
|
|
|
|
This file is part of systemd.
|
|
|
|
|
|
|
|
Copyright 2011 Lennart Poettering
|
|
|
|
|
|
|
|
systemd is free software; you can redistribute it and/or modify it
|
2012-04-12 00:20:58 +02:00
|
|
|
under the terms of the GNU Lesser General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2.1 of the License, or
|
2011-12-21 19:00:10 +01:00
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
systemd is distributed in the hope that it will be useful, but
|
|
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
2012-04-12 00:20:58 +02:00
|
|
|
Lesser General Public License for more details.
|
2011-12-21 19:00:10 +01:00
|
|
|
|
2012-04-12 00:20:58 +02:00
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
2011-12-21 19:00:10 +01:00
|
|
|
along with systemd; If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
***/
|
|
|
|
|
|
|
|
#include <assert.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <lzma.h>
|
|
|
|
|
2012-11-21 00:28:00 +01:00
|
|
|
#include "macro.h"
|
2011-12-21 19:00:10 +01:00
|
|
|
#include "compress.h"
|
|
|
|
|
|
|
|
bool compress_blob(const void *src, uint64_t src_size, void *dst, uint64_t *dst_size) {
|
|
|
|
lzma_ret ret;
|
2014-06-25 03:24:09 +02:00
|
|
|
size_t out_pos = 0;
|
2011-12-21 19:00:10 +01:00
|
|
|
|
|
|
|
assert(src);
|
|
|
|
assert(src_size > 0);
|
|
|
|
assert(dst);
|
|
|
|
assert(dst_size);
|
|
|
|
|
|
|
|
/* Returns false if we couldn't compress the data or the
|
|
|
|
* compressed result is longer than the original */
|
|
|
|
|
2014-06-25 03:24:09 +02:00
|
|
|
ret = lzma_easy_buffer_encode(LZMA_PRESET_DEFAULT, LZMA_CHECK_NONE, NULL,
|
|
|
|
src, src_size, dst, &out_pos, *dst_size);
|
2011-12-21 19:00:10 +01:00
|
|
|
if (ret != LZMA_OK)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
/* Is it actually shorter? */
|
2014-06-25 03:24:09 +02:00
|
|
|
if (out_pos == *dst_size)
|
|
|
|
return false;
|
2011-12-21 19:00:10 +01:00
|
|
|
|
2014-06-25 03:24:09 +02:00
|
|
|
*dst_size = out_pos;
|
|
|
|
return true;
|
2011-12-21 19:00:10 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool uncompress_blob(const void *src, uint64_t src_size,
|
2012-11-21 00:28:00 +01:00
|
|
|
void **dst, uint64_t *dst_alloc_size, uint64_t* dst_size, uint64_t dst_max) {
|
2011-12-21 19:00:10 +01:00
|
|
|
|
|
|
|
lzma_stream s = LZMA_STREAM_INIT;
|
|
|
|
lzma_ret ret;
|
2012-11-21 00:28:00 +01:00
|
|
|
uint64_t space;
|
2011-12-21 19:00:10 +01:00
|
|
|
bool b = false;
|
|
|
|
|
|
|
|
assert(src);
|
|
|
|
assert(src_size > 0);
|
|
|
|
assert(dst);
|
|
|
|
assert(dst_alloc_size);
|
|
|
|
assert(dst_size);
|
|
|
|
assert(*dst_alloc_size == 0 || *dst);
|
|
|
|
|
|
|
|
ret = lzma_stream_decoder(&s, UINT64_MAX, 0);
|
|
|
|
if (ret != LZMA_OK)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (*dst_alloc_size <= src_size) {
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
p = realloc(*dst, src_size*2);
|
|
|
|
if (!p)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
*dst = p;
|
|
|
|
*dst_alloc_size = src_size*2;
|
|
|
|
}
|
|
|
|
|
|
|
|
s.next_in = src;
|
|
|
|
s.avail_in = src_size;
|
|
|
|
|
|
|
|
s.next_out = *dst;
|
2012-11-21 00:28:00 +01:00
|
|
|
space = dst_max > 0 ? MIN(*dst_alloc_size, dst_max) : *dst_alloc_size;
|
|
|
|
s.avail_out = space;
|
2011-12-21 19:00:10 +01:00
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
ret = lzma_code(&s, LZMA_FINISH);
|
|
|
|
|
|
|
|
if (ret == LZMA_STREAM_END)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (ret != LZMA_OK)
|
|
|
|
goto fail;
|
|
|
|
|
2012-11-21 00:28:00 +01:00
|
|
|
if (dst_max > 0 && (space - s.avail_out) >= dst_max)
|
|
|
|
break;
|
|
|
|
|
|
|
|
p = realloc(*dst, space*2);
|
2011-12-21 19:00:10 +01:00
|
|
|
if (!p)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
s.next_out = (uint8_t*) p + ((uint8_t*) s.next_out - (uint8_t*) *dst);
|
2012-11-21 00:28:00 +01:00
|
|
|
s.avail_out += space;
|
|
|
|
|
|
|
|
space *= 2;
|
2011-12-21 19:00:10 +01:00
|
|
|
|
|
|
|
*dst = p;
|
2012-11-21 00:28:00 +01:00
|
|
|
*dst_alloc_size = space;
|
2011-12-21 19:00:10 +01:00
|
|
|
}
|
|
|
|
|
2012-11-21 00:28:00 +01:00
|
|
|
*dst_size = space - s.avail_out;
|
2011-12-21 19:00:10 +01:00
|
|
|
b = true;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
lzma_end(&s);
|
|
|
|
|
|
|
|
return b;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool uncompress_startswith(const void *src, uint64_t src_size,
|
|
|
|
void **buffer, uint64_t *buffer_size,
|
|
|
|
const void *prefix, uint64_t prefix_len,
|
|
|
|
uint8_t extra) {
|
|
|
|
|
|
|
|
lzma_stream s = LZMA_STREAM_INIT;
|
|
|
|
lzma_ret ret;
|
|
|
|
bool b = false;
|
|
|
|
|
|
|
|
/* Checks whether the uncompressed blob starts with the
|
|
|
|
* mentioned prefix. The byte extra needs to follow the
|
|
|
|
* prefix */
|
|
|
|
|
|
|
|
assert(src);
|
|
|
|
assert(src_size > 0);
|
|
|
|
assert(buffer);
|
|
|
|
assert(buffer_size);
|
|
|
|
assert(prefix);
|
|
|
|
assert(*buffer_size == 0 || *buffer);
|
|
|
|
|
|
|
|
ret = lzma_stream_decoder(&s, UINT64_MAX, 0);
|
|
|
|
if (ret != LZMA_OK)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (*buffer_size <= prefix_len) {
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
p = realloc(*buffer, prefix_len*2);
|
|
|
|
if (!p)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
*buffer = p;
|
|
|
|
*buffer_size = prefix_len*2;
|
|
|
|
}
|
|
|
|
|
|
|
|
s.next_in = src;
|
|
|
|
s.avail_in = src_size;
|
|
|
|
|
|
|
|
s.next_out = *buffer;
|
|
|
|
s.avail_out = *buffer_size;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
ret = lzma_code(&s, LZMA_FINISH);
|
|
|
|
|
|
|
|
if (ret != LZMA_STREAM_END && ret != LZMA_OK)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
if ((*buffer_size - s.avail_out > prefix_len) &&
|
|
|
|
memcmp(*buffer, prefix, prefix_len) == 0 &&
|
|
|
|
((const uint8_t*) *buffer)[prefix_len] == extra)
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (ret == LZMA_STREAM_END)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
p = realloc(*buffer, *buffer_size*2);
|
|
|
|
if (!p)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
s.next_out = (uint8_t*) p + ((uint8_t*) s.next_out - (uint8_t*) *buffer);
|
|
|
|
s.avail_out += *buffer_size;
|
|
|
|
|
|
|
|
*buffer = p;
|
|
|
|
*buffer_size *= 2;
|
|
|
|
}
|
|
|
|
|
|
|
|
b = true;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
lzma_end(&s);
|
|
|
|
|
|
|
|
return b;
|
|
|
|
}
|