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 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403
|
/*
Copyright (c) 2011, 2012, Simon Howard
Permission to use, copy, modify, and/or distribute this software
for any purpose with or without fee is hereby granted, provided
that the above copyright notice and this permission notice appear
in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR
CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <errno.h>
#include "lha_arch.h"
#include "lha_input_stream.h"
// Maximum length of the self-extractor header.
// If we don't find an LHA file header after this many bytes, give up.
#define MAX_SFX_HEADER_LEN 65536
// Size of the lead-in buffer used to skip the self-extractor.
#define LEADIN_BUFFER_LEN 24
// Magic string to detect an Amiga LhASFX self-extracting file.
// This type of self-extractor is special because the program itself
// contains a mini-LHA file that must be skipped over to get to
// the real one.
#define AMIGA_LHASFX_ID "LhASFX V1.2,"
typedef enum {
LHA_INPUT_STREAM_INIT,
LHA_INPUT_STREAM_READING,
LHA_INPUT_STREAM_FAIL
} LHAInputStreamState;
struct _LHAInputStream {
const LHAInputStreamType *type;
void *handle;
LHAInputStreamState state;
uint8_t leadin[LEADIN_BUFFER_LEN];
size_t leadin_len;
};
LHAInputStream *lha_input_stream_new(const LHAInputStreamType *type,
void *handle)
{
LHAInputStream *result;
result = calloc(1, sizeof(LHAInputStream));
if (result == NULL) {
return NULL;
}
result->type = type;
result->handle = handle;
result->leadin_len = 0;
result->state = LHA_INPUT_STREAM_INIT;
return result;
}
void lha_input_stream_free(LHAInputStream *stream)
{
// Close the input stream.
if (stream->type->close != NULL) {
stream->type->close(stream->handle);
}
free(stream);
}
// Check if the specified buffer is the start of a file header.
static int file_header_match(uint8_t *buf)
{
if (buf[2] != '-' || buf[6] != '-') {
return 0;
}
// LHA algorithm?
if (buf[3] == 'l' && buf[4] == 'h') {
return 1;
}
// LArc algorithm (lz4, lz5, lzs)?
if (buf[3] == 'l' && buf[4] == 'z'
&& (buf[5] == '4' || buf[5] == '5' || buf[5] == 's')) {
return 1;
}
// PMarc algorithm? (pm0, pm2)
// Note: PMarc SFX archives have a -pms- string in them that must
// be ignored.
if (buf[3] == 'p' && buf[4] == 'm' && buf[5] != 's') {
return 1;
}
return 0;
}
// Empty some of the bytes from the start of the lead-in buffer.
static void empty_leadin(LHAInputStream *stream, size_t bytes)
{
memmove(stream->leadin, stream->leadin + bytes,
stream->leadin_len - bytes);
stream->leadin_len -= bytes;
}
// Read bytes from the input stream into the specified buffer.
static int do_read(LHAInputStream *stream, void *buf, size_t buf_len)
{
return stream->type->read(stream->handle, buf, buf_len);
}
// Skip the self-extractor header at the start of the file.
// Returns non-zero if a header was found.
static int skip_sfx(LHAInputStream *stream)
{
size_t filepos;
unsigned int i;
int skip_files;
int read;
filepos = 0;
skip_files = 0;
while (filepos < MAX_SFX_HEADER_LEN) {
// Add some more bytes to the lead-in buffer:
read = do_read(stream, stream->leadin + stream->leadin_len,
LEADIN_BUFFER_LEN - stream->leadin_len);
if (read <= 0) {
break;
}
stream->leadin_len += (unsigned int) read;
// Check the lead-in buffer for a file header.
for (i = 0; i + 12 < stream->leadin_len; ++i) {
if (file_header_match(stream->leadin + i)) {
if (skip_files == 0) {
empty_leadin(stream, i);
return 1;
} else {
--skip_files;
}
}
// Detect Amiga self-extractor.
if (!memcmp(stream->leadin + i, AMIGA_LHASFX_ID,
strlen(AMIGA_LHASFX_ID))) {
skip_files = 1;
}
}
empty_leadin(stream, i);
filepos += i;
}
return 0;
}
int lha_input_stream_read(LHAInputStream *stream, void *buf, size_t buf_len)
{
size_t total_bytes, n;
int result;
// Start of the stream? Skip self-extract header, if there is one.
if (stream->state == LHA_INPUT_STREAM_INIT) {
if (skip_sfx(stream)) {
stream->state = LHA_INPUT_STREAM_READING;
} else {
stream->state = LHA_INPUT_STREAM_FAIL;
}
}
if (stream->state == LHA_INPUT_STREAM_FAIL) {
return 0;
}
// Now fill the result buffer. Start by emptying the lead-in buffer.
total_bytes = 0;
if (stream->leadin_len > 0) {
if (buf_len < stream->leadin_len) {
n = buf_len;
} else {
n = stream->leadin_len;
}
memcpy(buf, stream->leadin, n);
empty_leadin(stream, n);
total_bytes += n;
}
// Read from the input stream.
if (total_bytes < buf_len) {
result = do_read(stream, (uint8_t *) buf + total_bytes,
buf_len - total_bytes);
if (result > 0) {
total_bytes += (unsigned int) result;
}
}
// Only successful if the complete buffer is filled.
return total_bytes == buf_len;
}
int lha_input_stream_skip(LHAInputStream *stream, size_t bytes)
{
// If we have a dedicated skip function, use it; otherwise,
// the read function can be used to perform a skip.
if (stream->type->skip != NULL) {
return stream->type->skip(stream->handle, bytes);
} else {
uint8_t data[32];
unsigned int len;
int result;
while (bytes > 0) {
// Read as many bytes left as possible to fit in
// the buffer:
if (bytes > sizeof(data)) {
len = sizeof(data);
} else {
len = bytes;
}
result = do_read(stream, data, len);
if (result < 0) {
return 0;
}
bytes -= (unsigned int) result;
}
return 1;
}
}
// Read data from a FILE * source.
static int file_source_read(void *handle, void *buf, size_t buf_len)
{
size_t bytes_read;
FILE *fh = handle;
bytes_read = fread(buf, 1, buf_len, fh);
// If an error occurs, zero is returned; however, it may also
// indicate end of file.
if (bytes_read == 0 && !feof(fh)) {
return -1;
}
return (int) bytes_read;
}
// "Fallback" skip for file source that uses fread(), for unseekable
// streams.
static int file_source_skip_fallback(FILE *handle, size_t bytes)
{
uint8_t data[32];
unsigned int len;
int result;
while (bytes > 0) {
if (bytes > sizeof(data)) {
len = sizeof(data);
} else {
len = bytes;
}
result = fread(data, 1, len, handle);
if (result != (int) len) {
return 0;
}
bytes -= len;
}
return 1;
}
// Seek forward in a FILE * input stream.
static int file_source_skip(void *handle, size_t bytes)
{
int result;
// If this is an unseekable stream of some kind, always use the
// fallback behavior, as at least this is guaranteed to work.
// This is to work around problems on Windows, where fseek() can
// seek half-way on a stream and *then* fail, leaving us in an
// unworkable situation.
if (ftell(handle) < 0) {
return file_source_skip_fallback(handle, bytes);
}
result = fseek(handle, (long) bytes, SEEK_CUR);
if (result < 0) {
if (errno == EBADF || errno == ESPIPE) {
return file_source_skip_fallback(handle, bytes);
} else {
return 0;
}
}
return 1;
}
// Close a FILE * input stream.
static void file_source_close(void *handle)
{
fclose(handle);
}
// "Owned" file source - the stream will be closed when the input
// stream is freed.
static const LHAInputStreamType file_source_owned = {
file_source_read,
file_source_skip,
file_source_close
};
// "Unowned" file source - the stream is owned by the calling code.
static const LHAInputStreamType file_source_unowned = {
file_source_read,
file_source_skip,
NULL
};
LHAInputStream *lha_input_stream_from(char *filename)
{
LHAInputStream *result;
FILE *fstream;
fstream = fopen(filename, "rb");
if (fstream == NULL) {
return NULL;
}
result = lha_input_stream_new(&file_source_owned, fstream);
if (result == NULL) {
fclose(fstream);
}
return result;
}
LHAInputStream *lha_input_stream_from_FILE(FILE *stream)
{
lha_arch_set_binary(stream);
return lha_input_stream_new(&file_source_unowned, stream);
}
|