2007-12-08 23:42:33 +01:00
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
//
|
2008-08-28 21:53:15 +02:00
|
|
|
/// \file common.h
|
|
|
|
/// \brief Common functions needed in many places in liblzma
|
2007-12-08 23:42:33 +01:00
|
|
|
//
|
2008-08-28 21:53:15 +02:00
|
|
|
// Copyright (C) 2007-2008 Lasse Collin
|
2007-12-08 23:42:33 +01:00
|
|
|
//
|
|
|
|
// This library is free software; you can redistribute it and/or
|
|
|
|
// modify it 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 (at your option) any later version.
|
|
|
|
//
|
|
|
|
// This library 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
|
|
|
|
// Lesser General Public License for more details.
|
|
|
|
//
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
#include "common.h"
|
|
|
|
|
|
|
|
|
2008-08-28 21:53:15 +02:00
|
|
|
/////////////
|
|
|
|
// Version //
|
|
|
|
/////////////
|
|
|
|
|
|
|
|
extern LZMA_API uint32_t
|
|
|
|
lzma_version_number(void)
|
|
|
|
{
|
|
|
|
return LZMA_VERSION;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
extern LZMA_API const char *
|
|
|
|
lzma_version_string(void)
|
|
|
|
{
|
|
|
|
return PACKAGE_VERSION;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
///////////////////////
|
|
|
|
// Memory allocation //
|
|
|
|
///////////////////////
|
|
|
|
|
|
|
|
extern void * lzma_attribute((malloc))
|
|
|
|
lzma_alloc(size_t size, lzma_allocator *allocator)
|
|
|
|
{
|
|
|
|
// Some malloc() variants return NULL if called with size == 0.
|
|
|
|
if (size == 0)
|
|
|
|
size = 1;
|
|
|
|
|
|
|
|
void *ptr;
|
|
|
|
|
|
|
|
if (allocator != NULL && allocator->alloc != NULL)
|
|
|
|
ptr = allocator->alloc(allocator->opaque, 1, size);
|
|
|
|
else
|
|
|
|
ptr = malloc(size);
|
|
|
|
|
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
extern void
|
|
|
|
lzma_free(void *ptr, lzma_allocator *allocator)
|
|
|
|
{
|
|
|
|
if (allocator != NULL && allocator->free != NULL)
|
|
|
|
allocator->free(allocator->opaque, ptr);
|
|
|
|
else
|
|
|
|
free(ptr);
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//////////
|
|
|
|
// Misc //
|
|
|
|
//////////
|
|
|
|
|
|
|
|
extern size_t
|
|
|
|
lzma_bufcpy(const uint8_t *restrict in, size_t *restrict in_pos,
|
|
|
|
size_t in_size, uint8_t *restrict out,
|
|
|
|
size_t *restrict out_pos, size_t out_size)
|
|
|
|
{
|
|
|
|
const size_t in_avail = in_size - *in_pos;
|
|
|
|
const size_t out_avail = out_size - *out_pos;
|
|
|
|
const size_t copy_size = MIN(in_avail, out_avail);
|
|
|
|
|
|
|
|
memcpy(out + *out_pos, in + *in_pos, copy_size);
|
|
|
|
|
|
|
|
*in_pos += copy_size;
|
|
|
|
*out_pos += copy_size;
|
|
|
|
|
|
|
|
return copy_size;
|
|
|
|
}
|
2007-12-08 23:42:33 +01:00
|
|
|
|
|
|
|
|
2008-08-28 21:53:15 +02:00
|
|
|
extern lzma_ret
|
|
|
|
lzma_next_filter_init(lzma_next_coder *next, lzma_allocator *allocator,
|
|
|
|
const lzma_filter_info *filters)
|
|
|
|
{
|
|
|
|
lzma_next_coder_init(filters[0].init, next, allocator);
|
|
|
|
|
|
|
|
return filters[0].init == NULL
|
|
|
|
? LZMA_OK : filters[0].init(next, allocator, filters);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
extern void
|
|
|
|
lzma_next_end(lzma_next_coder *next, lzma_allocator *allocator)
|
|
|
|
{
|
|
|
|
if (next->init != (uintptr_t)(NULL)) {
|
|
|
|
// To avoid tiny end functions that simply call
|
|
|
|
// lzma_free(coder, allocator), we allow leaving next->end
|
|
|
|
// NULL and call lzma_free() here.
|
|
|
|
if (next->end != NULL)
|
|
|
|
next->end(next->coder, allocator);
|
|
|
|
else
|
|
|
|
lzma_free(next->coder, allocator);
|
|
|
|
|
|
|
|
// Reset the variables so the we don't accidentally think
|
|
|
|
// that it is an already initialized coder.
|
|
|
|
*next = LZMA_NEXT_CODER_INIT;
|
|
|
|
}
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//////////////////////////////////////
|
|
|
|
// External to internal API wrapper //
|
|
|
|
//////////////////////////////////////
|
|
|
|
|
2007-12-08 23:42:33 +01:00
|
|
|
extern lzma_ret
|
|
|
|
lzma_strm_init(lzma_stream *strm)
|
|
|
|
{
|
|
|
|
if (strm == NULL)
|
|
|
|
return LZMA_PROG_ERROR;
|
|
|
|
|
|
|
|
if (strm->internal == NULL) {
|
|
|
|
strm->internal = lzma_alloc(sizeof(lzma_internal),
|
|
|
|
strm->allocator);
|
|
|
|
if (strm->internal == NULL)
|
|
|
|
return LZMA_MEM_ERROR;
|
|
|
|
|
|
|
|
strm->internal->next = LZMA_NEXT_CODER_INIT;
|
|
|
|
}
|
|
|
|
|
|
|
|
strm->internal->supported_actions[LZMA_RUN] = false;
|
|
|
|
strm->internal->supported_actions[LZMA_SYNC_FLUSH] = false;
|
|
|
|
strm->internal->supported_actions[LZMA_FULL_FLUSH] = false;
|
|
|
|
strm->internal->supported_actions[LZMA_FINISH] = false;
|
|
|
|
strm->internal->sequence = ISEQ_RUN;
|
|
|
|
|
|
|
|
strm->total_in = 0;
|
|
|
|
strm->total_out = 0;
|
|
|
|
|
|
|
|
return LZMA_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
extern LZMA_API lzma_ret
|
|
|
|
lzma_code(lzma_stream *strm, lzma_action action)
|
|
|
|
{
|
|
|
|
// Sanity checks
|
|
|
|
if ((strm->next_in == NULL && strm->avail_in != 0)
|
|
|
|
|| (strm->next_out == NULL && strm->avail_out != 0)
|
|
|
|
|| strm->internal == NULL
|
|
|
|
|| strm->internal->next.code == NULL
|
|
|
|
|| (unsigned int)(action) > LZMA_FINISH
|
|
|
|
|| !strm->internal->supported_actions[action])
|
|
|
|
return LZMA_PROG_ERROR;
|
|
|
|
|
|
|
|
switch (strm->internal->sequence) {
|
|
|
|
case ISEQ_RUN:
|
|
|
|
switch (action) {
|
|
|
|
case LZMA_RUN:
|
|
|
|
break;
|
|
|
|
|
|
|
|
case LZMA_SYNC_FLUSH:
|
|
|
|
strm->internal->sequence = ISEQ_SYNC_FLUSH;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case LZMA_FULL_FLUSH:
|
|
|
|
strm->internal->sequence = ISEQ_FULL_FLUSH;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case LZMA_FINISH:
|
|
|
|
strm->internal->sequence = ISEQ_FINISH;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ISEQ_SYNC_FLUSH:
|
|
|
|
if (action != LZMA_SYNC_FLUSH)
|
|
|
|
return LZMA_PROG_ERROR;
|
|
|
|
|
|
|
|
// Check that application doesn't change avail_in once
|
|
|
|
// LZMA_SYNC_FLUSH has been used.
|
|
|
|
if (strm->internal->avail_in != strm->avail_in)
|
|
|
|
return LZMA_DATA_ERROR;
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ISEQ_FULL_FLUSH:
|
|
|
|
if (action != LZMA_FULL_FLUSH)
|
|
|
|
return LZMA_PROG_ERROR;
|
|
|
|
|
|
|
|
// Check that application doesn't change avail_in once
|
|
|
|
// LZMA_FULL_FLUSH has been used.
|
|
|
|
if (strm->internal->avail_in != strm->avail_in)
|
|
|
|
return LZMA_DATA_ERROR;
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ISEQ_FINISH:
|
|
|
|
if (action != LZMA_FINISH)
|
|
|
|
return LZMA_PROG_ERROR;
|
|
|
|
|
|
|
|
if (strm->internal->avail_in != strm->avail_in)
|
|
|
|
return LZMA_DATA_ERROR;
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ISEQ_END:
|
|
|
|
return LZMA_STREAM_END;
|
|
|
|
|
|
|
|
case ISEQ_ERROR:
|
|
|
|
default:
|
|
|
|
return LZMA_PROG_ERROR;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t in_pos = 0;
|
|
|
|
size_t out_pos = 0;
|
|
|
|
lzma_ret ret = strm->internal->next.code(
|
|
|
|
strm->internal->next.coder, strm->allocator,
|
|
|
|
strm->next_in, &in_pos, strm->avail_in,
|
|
|
|
strm->next_out, &out_pos, strm->avail_out, action);
|
|
|
|
|
|
|
|
strm->next_in += in_pos;
|
|
|
|
strm->avail_in -= in_pos;
|
|
|
|
strm->total_in += in_pos;
|
|
|
|
|
|
|
|
strm->next_out += out_pos;
|
|
|
|
strm->avail_out -= out_pos;
|
|
|
|
strm->total_out += out_pos;
|
|
|
|
|
|
|
|
strm->internal->avail_in = strm->avail_in;
|
|
|
|
|
|
|
|
switch (ret) {
|
|
|
|
case LZMA_OK:
|
|
|
|
// Don't return LZMA_BUF_ERROR when it happens the first time.
|
|
|
|
// This is to avoid returning LZMA_BUF_ERROR when avail_out
|
|
|
|
// was zero but still there was no more data left to written
|
|
|
|
// to next_out.
|
|
|
|
if (out_pos == 0 && in_pos == 0) {
|
|
|
|
if (strm->internal->allow_buf_error)
|
|
|
|
ret = LZMA_BUF_ERROR;
|
|
|
|
else
|
|
|
|
strm->internal->allow_buf_error = true;
|
|
|
|
} else {
|
|
|
|
strm->internal->allow_buf_error = false;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case LZMA_STREAM_END:
|
|
|
|
if (strm->internal->sequence == ISEQ_SYNC_FLUSH
|
|
|
|
|| strm->internal->sequence == ISEQ_FULL_FLUSH)
|
|
|
|
strm->internal->sequence = ISEQ_RUN;
|
|
|
|
else
|
|
|
|
strm->internal->sequence = ISEQ_END;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case LZMA_UNSUPPORTED_CHECK:
|
|
|
|
strm->internal->allow_buf_error = false;
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
// All the other errors are fatal; coding cannot be continued.
|
|
|
|
strm->internal->sequence = ISEQ_ERROR;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
extern LZMA_API void
|
|
|
|
lzma_end(lzma_stream *strm)
|
|
|
|
{
|
|
|
|
if (strm != NULL && strm->internal != NULL) {
|
2008-08-28 21:53:15 +02:00
|
|
|
lzma_next_end(&strm->internal->next, strm->allocator);
|
2007-12-08 23:42:33 +01:00
|
|
|
lzma_free(strm->internal, strm->allocator);
|
|
|
|
strm->internal = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|