2 * Copyright (c) 2018 Grzegorz Antoniak (http://antoniak.org)
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``AS IS'' AND ANY EXPRESS OR
15 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
16 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
17 * IN NO EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY DIRECT, INDIRECT,
18 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
19 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
20 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
21 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
23 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 #include "archive_platform.h"
33 #include <zlib.h> /* crc32 */
38 #include "archive_crc32.h"
41 #include "archive_entry.h"
42 #include "archive_entry_locale.h"
43 #include "archive_ppmd7_private.h"
44 #include "archive_entry_private.h"
49 #include "archive_blake2.h"
52 /*#define CHECK_CRC_ON_SOLID_SKIP*/
53 /*#define DONT_FAIL_ON_CRC_ERROR*/
56 #define rar5_min(a, b) (((a) > (b)) ? (b) : (a))
57 #define rar5_max(a, b) (((a) > (b)) ? (a) : (b))
58 #define rar5_countof(X) ((const ssize_t) (sizeof(X) / sizeof(*X)))
61 #define DEBUG_CODE if(1)
63 #define DEBUG_CODE if(0)
66 /* Real RAR5 magic number is:
68 * 0x52, 0x61, 0x72, 0x21, 0x1a, 0x07, 0x01, 0x00
71 * It's stored in `rar5_signature` after XOR'ing it with 0xA1, because I don't
72 * want to put this magic sequence in each binary that uses libarchive, so
73 * applications that scan through the file for this marker won't trigger on
76 * The array itself is decrypted in `rar5_init` function. */
78 static unsigned char rar5_signature[] = { 243, 192, 211, 128, 187, 166, 160, 161 };
79 static const ssize_t rar5_signature_size = sizeof(rar5_signature);
80 /* static const size_t g_unpack_buf_chunk_size = 1024; */
81 static const size_t g_unpack_window_size = 0x20000;
84 ssize_t bytes_remaining;
85 ssize_t unpacked_size;
86 int64_t last_offset; /* Used in sanity checks. */
87 int64_t last_size; /* Used in sanity checks. */
89 uint8_t solid : 1; /* Is this a solid stream? */
90 uint8_t service : 1; /* Is this file a service data? */
92 /* Optional time fields. */
98 /* Optional hash fields. */
99 uint32_t stored_crc32;
100 uint32_t calculated_crc32;
101 uint8_t blake2sp[32];
102 blake2sp_state b2state;
107 FILTER_DELTA = 0, /* Generic pattern. */
108 FILTER_E8 = 1, /* Intel x86 code. */
109 FILTER_E8E9 = 2, /* Intel x86 code. */
110 FILTER_ARM = 3, /* ARM code. */
111 FILTER_AUDIO = 4, /* Audio filter, not used in RARv5. */
112 FILTER_RGB = 5, /* Color palette, not used in RARv5. */
113 FILTER_ITANIUM = 6, /* Intel's Itanium, not used in RARv5. */
114 FILTER_PPM = 7, /* Predictive pattern matching, not used in RARv5. */
124 ssize_t block_length;
143 struct decode_table {
145 int32_t decode_len[16];
146 uint32_t decode_pos[16];
148 uint8_t quick_len[1 << 10];
149 uint16_t quick_num[1 << 10];
150 uint16_t decode_num[306];
154 /* Flag used to specify if unpacker needs to reinitialize the uncompression
156 uint8_t initialized : 1;
158 /* Flag used when applying filters. */
159 uint8_t all_filters_applied : 1;
161 /* Flag used to skip file context reinitialization, used when unpacker is
162 * skipping through different multivolume archives. */
163 uint8_t switch_multivolume : 1;
165 /* Flag used to specify if unpacker has processed the whole data block or
166 * just a part of it. */
167 uint8_t block_parsing_finished : 1;
171 int flags; /* Uncompression flags. */
172 int method; /* Uncompression algorithm method. */
173 int version; /* Uncompression algorithm version. */
174 ssize_t window_size; /* Size of window_buf. */
175 uint8_t* window_buf; /* Circular buffer used during
177 uint8_t* filtered_buf; /* Buffer used when applying filters. */
178 const uint8_t* block_buf; /* Buffer used when merging blocks. */
179 size_t window_mask; /* Convinience field; window_size - 1. */
180 int64_t write_ptr; /* This amount of data has been unpacked in
181 the window buffer. */
182 int64_t last_write_ptr; /* This amount of data has been stored in
184 int64_t last_unstore_ptr; /* Counter of bytes extracted during
185 unstoring. This is separate from
186 last_write_ptr because of how SERVICE
187 base blocks are handled during skipping
188 in solid multiarchive archives. */
189 int64_t solid_offset; /* Additional offset inside the window
190 buffer, used in unpacking solid
192 ssize_t cur_block_size; /* Size of current data block. */
193 int last_len; /* Flag used in lzss decompression. */
195 /* Decode tables used during lzss uncompression. */
198 struct decode_table bd; /* huffman bit lengths */
200 struct decode_table ld; /* literals */
202 struct decode_table dd; /* distances */
204 struct decode_table ldd; /* lower bits of distances */
206 struct decode_table rd; /* repeating distances */
207 #define HUFF_TABLE_SIZE (HUFF_NC + HUFF_DC + HUFF_RC + HUFF_LDC)
209 /* Circular deque for storing filters. */
210 struct cdeque filters;
211 int64_t last_block_start; /* Used for sanity checking. */
212 ssize_t last_block_length; /* Used for sanity checking. */
214 /* Distance cache used during lzss uncompression. */
217 /* Data buffer stack. */
218 struct data_ready dready[2];
221 /* Bit reader state. */
223 int8_t bit_addr; /* Current bit pointer inside current byte. */
224 int in_addr; /* Current byte pointer. */
227 /* RARv5 block header structure. */
228 struct compressed_block_header {
231 uint8_t bit_size : 3;
232 uint8_t byte_count : 3;
233 uint8_t is_last_block : 1;
234 uint8_t is_table_present : 1;
236 uint8_t block_flags_u8;
242 /* RARv5 main header structure. */
244 /* Does the archive contain solid streams? */
247 /* If this a multi-file archive? */
255 struct generic_header {
256 uint8_t split_after : 1;
257 uint8_t split_before : 1;
268 /* Main context structure. */
270 int header_initialized;
272 /* Set to 1 if current file is positioned AFTER the magic value
273 * of the archive file. This is used in header reading functions. */
276 /* Set to not zero if we're in skip mode (either by calling rar5_data_skip
277 * function or when skipping over solid streams). Set to 0 when in
278 * extraction mode. This is used during checksum calculation functions. */
281 /* An offset to QuickOpen list. This is not supported by this unpacker,
282 * becuase we're focusing on streaming interface. QuickOpen is designed
283 * to make things quicker for non-stream interfaces, so it's not our
285 uint64_t qlist_offset;
287 /* An offset to additional Recovery data. This is not supported by this
288 * unpacker. Recovery data are additional Reed-Solomon codes that could
289 * be used to calculate bytes that are missing in archive or are
293 /* Various context variables grouped to different structures. */
294 struct generic_header generic;
295 struct main_header main;
296 struct comp_state cstate;
297 struct file_header file;
298 struct bit_reader bits;
299 struct multivolume vol;
301 /* The header of currently processed RARv5 block. Used in main
302 * decompression logic loop. */
303 struct compressed_block_header last_block_hdr;
306 /* Forward function declarations. */
308 static int verify_global_checksums(struct archive_read* a);
309 static int rar5_read_data_skip(struct archive_read *a);
310 static int push_data_ready(struct archive_read* a, struct rar5* rar,
311 const uint8_t* buf, size_t size, int64_t offset);
313 /* CDE_xxx = Circular Double Ended (Queue) return values. */
314 enum CDE_RETURN_VALUES {
315 CDE_OK, CDE_ALLOC, CDE_PARAM, CDE_OUT_OF_BOUNDS,
318 /* Clears the contents of this circular deque. */
319 static void cdeque_clear(struct cdeque* d) {
325 /* Creates a new circular deque object. Capacity must be power of 2: 8, 16, 32,
326 * 64, 256, etc. When the user will add another item above current capacity,
327 * the circular deque will overwrite the oldest entry. */
328 static int cdeque_init(struct cdeque* d, int max_capacity_power_of_2) {
329 if(d == NULL || max_capacity_power_of_2 == 0)
332 d->cap_mask = max_capacity_power_of_2 - 1;
335 if((max_capacity_power_of_2 & d->cap_mask) > 0)
339 d->arr = malloc(sizeof(void*) * max_capacity_power_of_2);
341 return d->arr ? CDE_OK : CDE_ALLOC;
344 /* Return the current size (not capacity) of circular deque `d`. */
345 static size_t cdeque_size(struct cdeque* d) {
349 /* Returns the first element of current circular deque. Note that this function
350 * doesn't perform any bounds checking. If you need bounds checking, use
351 * `cdeque_front()` function instead. */
352 static void cdeque_front_fast(struct cdeque* d, void** value) {
353 *value = (void*) d->arr[d->beg_pos];
356 /* Returns the first element of current circular deque. This function
357 * performs bounds checking. */
358 static int cdeque_front(struct cdeque* d, void** value) {
360 cdeque_front_fast(d, value);
363 return CDE_OUT_OF_BOUNDS;
366 /* Pushes a new element into the end of this circular deque object. If current
367 * size will exceed capacity, the oldest element will be overwritten. */
368 static int cdeque_push_back(struct cdeque* d, void* item) {
372 if(d->size == d->cap_mask + 1)
373 return CDE_OUT_OF_BOUNDS;
375 d->arr[d->end_pos] = (size_t) item;
376 d->end_pos = (d->end_pos + 1) & d->cap_mask;
382 /* Pops a front element of this circular deque object and returns its value.
383 * This function doesn't perform any bounds checking. */
384 static void cdeque_pop_front_fast(struct cdeque* d, void** value) {
385 *value = (void*) d->arr[d->beg_pos];
386 d->beg_pos = (d->beg_pos + 1) & d->cap_mask;
390 /* Pops a front element of this cicrular deque object and returns its value.
391 * This function performs bounds checking. */
392 static int cdeque_pop_front(struct cdeque* d, void** value) {
397 return CDE_OUT_OF_BOUNDS;
399 cdeque_pop_front_fast(d, value);
403 /* Convinience function to cast filter_info** to void **. */
404 static void** cdeque_filter_p(struct filter_info** f) {
405 return (void**) (size_t) f;
408 /* Convinience function to cast filter_info* to void *. */
409 static void* cdeque_filter(struct filter_info* f) {
410 return (void**) (size_t) f;
413 /* Destroys this circular deque object. Dellocates the memory of the collection
414 * buffer, but doesn't deallocate the memory of any pointer passed to this
415 * deque as a value. */
416 static void cdeque_free(struct cdeque* d) {
431 static inline struct rar5* get_context(struct archive_read* a) {
432 return (struct rar5*) a->format->data;
435 // TODO: make sure these functions return a little endian number
437 /* Convinience functions used by filter implementations. */
439 static uint32_t read_filter_data(struct rar5* rar, uint32_t offset) {
440 uint32_t* dptr = (uint32_t*) &rar->cstate.window_buf[offset];
441 // TODO: bswap if big endian
445 static void write_filter_data(struct rar5* rar, uint32_t offset,
448 uint32_t* dptr = (uint32_t*) &rar->cstate.filtered_buf[offset];
449 // TODO: bswap if big endian
453 static void circular_memcpy(uint8_t* dst, uint8_t* window, const int mask,
454 int64_t start, int64_t end)
456 if((start & mask) > (end & mask)) {
457 ssize_t len1 = mask + 1 - (start & mask);
458 ssize_t len2 = end & mask;
460 memcpy(dst, &window[start & mask], len1);
461 memcpy(dst + len1, window, len2);
463 memcpy(dst, &window[start & mask], (size_t) (end - start));
467 /* Allocates a new filter descriptor and adds it to the filter array. */
468 static struct filter_info* add_new_filter(struct rar5* rar) {
469 struct filter_info* f =
470 (struct filter_info*) calloc(1, sizeof(struct filter_info));
476 cdeque_push_back(&rar->cstate.filters, cdeque_filter(f));
480 static int run_delta_filter(struct rar5* rar, struct filter_info* flt) {
482 ssize_t dest_pos, src_pos = 0;
484 for(i = 0; i < flt->channels; i++) {
485 uint8_t prev_byte = 0;
487 dest_pos < flt->block_length;
488 dest_pos += flt->channels)
492 byte = rar->cstate.window_buf[(rar->cstate.solid_offset +
493 flt->block_start + src_pos) & rar->cstate.window_mask];
496 rar->cstate.filtered_buf[dest_pos] = prev_byte;
504 static int run_e8e9_filter(struct rar5* rar, struct filter_info* flt,
507 const uint32_t file_size = 0x1000000;
510 circular_memcpy(rar->cstate.filtered_buf,
511 rar->cstate.window_buf,
512 rar->cstate.window_mask,
513 rar->cstate.solid_offset + flt->block_start,
514 rar->cstate.solid_offset + flt->block_start + flt->block_length);
516 for(i = 0; i < flt->block_length - 4;) {
517 uint8_t b = rar->cstate.window_buf[(rar->cstate.solid_offset +
518 flt->block_start + i++) & rar->cstate.window_mask];
520 /* 0xE8 = x86's call <relative_addr_uint32> (function call)
521 * 0xE9 = x86's jmp <relative_addr_uint32> (unconditional jump) */
522 if(b == 0xE8 || (extended && b == 0xE9)) {
525 uint32_t offset = (i + flt->block_start) % file_size;
527 addr = read_filter_data(rar, (rar->cstate.solid_offset +
528 flt->block_start + i) & rar->cstate.window_mask);
530 if(addr & 0x80000000) {
531 if(((addr + offset) & 0x80000000) == 0) {
532 write_filter_data(rar, i, addr + file_size);
535 if((addr - file_size) & 0x80000000) {
536 uint32_t naddr = addr - offset;
537 write_filter_data(rar, i, naddr);
548 static int run_arm_filter(struct rar5* rar, struct filter_info* flt) {
551 const int mask = rar->cstate.window_mask;
553 circular_memcpy(rar->cstate.filtered_buf,
554 rar->cstate.window_buf,
555 rar->cstate.window_mask,
556 rar->cstate.solid_offset + flt->block_start,
557 rar->cstate.solid_offset + flt->block_start + flt->block_length);
559 for(i = 0; i < flt->block_length - 3; i += 4) {
560 uint8_t* b = &rar->cstate.window_buf[(rar->cstate.solid_offset +
561 flt->block_start + i) & mask];
564 /* 0xEB = ARM's BL (branch + link) instruction. */
565 offset = read_filter_data(rar, (rar->cstate.solid_offset +
566 flt->block_start + i) & mask) & 0x00ffffff;
568 offset -= (uint32_t) ((i + flt->block_start) / 4);
569 offset = (offset & 0x00ffffff) | 0xeb000000;
570 write_filter_data(rar, i, offset);
577 static int run_filter(struct archive_read* a, struct filter_info* flt) {
579 struct rar5* rar = get_context(a);
581 if(rar->cstate.filtered_buf)
582 free(rar->cstate.filtered_buf);
584 rar->cstate.filtered_buf = malloc(flt->block_length);
585 if(!rar->cstate.filtered_buf) {
586 archive_set_error(&a->archive, ENOMEM, "Can't allocate memory for "
588 return ARCHIVE_FATAL;
593 ret = run_delta_filter(rar, flt);
599 ret = run_e8e9_filter(rar, flt, flt->type == FILTER_E8E9);
603 ret = run_arm_filter(rar, flt);
607 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
608 "Unsupported filter type: 0x%02x", flt->type);
609 return ARCHIVE_FATAL;
612 if(ret != ARCHIVE_OK) {
613 /* Filter has failed. */
617 if(ARCHIVE_OK != push_data_ready(a, rar, rar->cstate.filtered_buf,
618 flt->block_length, rar->cstate.last_write_ptr))
620 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER,
621 "Stack overflow when submitting unpacked data");
623 return ARCHIVE_FATAL;
626 rar->cstate.last_write_ptr += flt->block_length;
630 /* The `push_data` function submits the selected data range to the user.
631 * Next call of `use_data` will use the pointer, size and offset arguments
632 * that are specified here. These arguments are pushed to the FIFO stack here,
633 * and popped from the stack by the `use_data` function. */
634 static void push_data(struct archive_read* a, struct rar5* rar,
635 const uint8_t* buf, int64_t idx_begin, int64_t idx_end)
637 const int wmask = rar->cstate.window_mask;
638 const ssize_t solid_write_ptr = (rar->cstate.solid_offset +
639 rar->cstate.last_write_ptr) & wmask;
641 idx_begin += rar->cstate.solid_offset;
642 idx_end += rar->cstate.solid_offset;
644 /* Check if our unpacked data is wrapped inside the window circular buffer.
645 * If it's not wrapped, it can be copied out by using a single memcpy,
646 * but when it's wrapped, we need to copy the first part with one
647 * memcpy, and the second part with another memcpy. */
649 if((idx_begin & wmask) > (idx_end & wmask)) {
650 /* The data is wrapped (begin offset sis bigger than end offset). */
651 const ssize_t frag1_size = rar->cstate.window_size - (idx_begin & wmask);
652 const ssize_t frag2_size = idx_end & wmask;
654 /* Copy the first part of the buffer first. */
655 push_data_ready(a, rar, buf + solid_write_ptr, frag1_size,
656 rar->cstate.last_write_ptr);
658 /* Copy the second part of the buffer. */
659 push_data_ready(a, rar, buf, frag2_size,
660 rar->cstate.last_write_ptr + frag1_size);
662 rar->cstate.last_write_ptr += frag1_size + frag2_size;
664 /* Data is not wrapped, so we can just use one call to copy the
666 push_data_ready(a, rar,
667 buf + solid_write_ptr,
668 (idx_end - idx_begin) & wmask,
669 rar->cstate.last_write_ptr);
671 rar->cstate.last_write_ptr += idx_end - idx_begin;
675 /* Convinience function that submits the data to the user. It uses the
676 * unpack window buffer as a source location. */
677 static void push_window_data(struct archive_read* a, struct rar5* rar,
678 int64_t idx_begin, int64_t idx_end)
680 push_data(a, rar, rar->cstate.window_buf, idx_begin, idx_end);
683 static int apply_filters(struct archive_read* a) {
684 struct filter_info* flt;
685 struct rar5* rar = get_context(a);
688 rar->cstate.all_filters_applied = 0;
690 /* Get the first filter that can be applied to our data. The data needs to
691 * be fully unpacked before the filter can be run. */
693 cdeque_front(&rar->cstate.filters, cdeque_filter_p(&flt)))
695 /* Check if our unpacked data fully covers this filter's range. */
696 if(rar->cstate.write_ptr > flt->block_start &&
697 rar->cstate.write_ptr >= flt->block_start + flt->block_length)
699 /* Check if we have some data pending to be written right before
700 * the filter's start offset. */
701 if(rar->cstate.last_write_ptr == flt->block_start) {
702 /* Run the filter specified by descriptor `flt`. */
703 ret = run_filter(a, flt);
704 if(ret != ARCHIVE_OK) {
705 /* Filter failure, return error. */
709 /* Filter descriptor won't be needed anymore after it's used,
710 * so remove it from the filter list and free its memory. */
711 (void) cdeque_pop_front(&rar->cstate.filters,
712 cdeque_filter_p(&flt));
716 /* We can't run filters yet, dump the memory right before the
718 push_window_data(a, rar, rar->cstate.last_write_ptr,
722 /* Return 'filter applied or not needed' state to the caller. */
723 return ARCHIVE_RETRY;
727 rar->cstate.all_filters_applied = 1;
731 static void dist_cache_push(struct rar5* rar, int value) {
732 int* q = rar->cstate.dist_cache;
740 static int dist_cache_touch(struct rar5* rar, int idx) {
741 int* q = rar->cstate.dist_cache;
742 int i, dist = q[idx];
744 for(i = idx; i > 0; i--)
751 static void free_filters(struct rar5* rar) {
752 struct cdeque* d = &rar->cstate.filters;
754 /* Free any remaining filters. All filters should be naturally consumed by
755 * the unpacking function, so remaining filters after unpacking normally
756 * mean that unpacking wasn't successfull. But still of course we shouldn't
757 * leak memory in such case. */
759 /* cdeque_size() is a fast operation, so we can use it as a loop
761 while(cdeque_size(d) > 0) {
762 struct filter_info* f = NULL;
764 /* Pop_front will also decrease the collection's size. */
765 if(CDE_OK == cdeque_pop_front(d, cdeque_filter_p(&f)) && f != NULL)
771 /* Also clear out the variables needed for sanity checking. */
772 rar->cstate.last_block_start = 0;
773 rar->cstate.last_block_length = 0;
776 static void reset_file_context(struct rar5* rar) {
777 memset(&rar->file, 0, sizeof(rar->file));
778 blake2sp_init(&rar->file.b2state, 32);
780 if(rar->main.solid) {
781 rar->cstate.solid_offset += rar->cstate.write_ptr;
783 rar->cstate.solid_offset = 0;
786 rar->cstate.write_ptr = 0;
787 rar->cstate.last_write_ptr = 0;
788 rar->cstate.last_unstore_ptr = 0;
793 static inline int get_archive_read(struct archive* a,
794 struct archive_read** ar)
796 *ar = (struct archive_read*) a;
797 archive_check_magic(a, ARCHIVE_READ_MAGIC, ARCHIVE_STATE_NEW,
798 "archive_read_support_format_rar5");
803 static int read_ahead(struct archive_read* a, size_t how_many,
810 *ptr = __archive_read_ahead(a, how_many, &avail);
819 static int consume(struct archive_read* a, int64_t how_many) {
823 how_many == __archive_read_consume(a, how_many)
831 * Read a RAR5 variable sized numeric value. This value will be stored in
832 * `pvalue`. The `pvalue_len` argument points to a variable that will receive
833 * the byte count that was consumed in order to decode the `pvalue` value, plus
836 * pvalue_len is optional and can be NULL.
838 * NOTE: if `pvalue_len` is NOT NULL, the caller needs to manually consume
839 * the number of bytes that `pvalue_len` value contains. If the `pvalue_len`
840 * is NULL, this consuming operation is done automatically.
842 * Returns 1 if *pvalue was successfully read.
843 * Returns 0 if there was an error. In this case, *pvalue contains an
847 static int read_var(struct archive_read* a, uint64_t* pvalue,
848 uint64_t* pvalue_len)
855 /* We will read maximum of 8 bytes. We don't have to handle the situation
856 * to read the RAR5 variable-sized value stored at the end of the file,
857 * because such situation will never happen. */
858 if(!read_ahead(a, 8, &p))
861 for(shift = 0, i = 0; i < 8; i++, shift += 7) {
864 /* Strip the MSB from the input byte and add the resulting number
865 * to the `result`. */
866 result += (b & 0x7F) << shift;
868 /* MSB set to 1 means we need to continue decoding process. MSB set
869 * to 0 means we're done.
871 * This conditional checks for the second case. */
872 if((b & 0x80) == 0) {
877 /* If the caller has passed the `pvalue_len` pointer, store the
878 * number of consumed bytes in it and do NOT consume those bytes,
879 * since the caller has all the information it needs to perform
880 * the consuming process itself. */
884 /* If the caller did not provide the `pvalue_len` pointer,
885 * it will not have the possibility to advance the file
886 * pointer, because it will not know how many bytes it needs
887 * to consume. This is why we handle such situation here
889 if(ARCHIVE_OK != consume(a, 1 + i)) {
894 /* End of decoding process, return success. */
899 /* The decoded value takes the maximum number of 8 bytes. It's a maximum
900 * number of bytes, so end decoding process here even if the first bit
901 * of last byte is 1. */
909 if(ARCHIVE_OK != consume(a, 9)) {
917 static int read_var_sized(struct archive_read* a, size_t* pvalue,
923 const int ret = pvalue_len
924 ? read_var(a, &v, &v_size)
925 : read_var(a, &v, NULL);
927 if(ret == 1 && pvalue) {
928 *pvalue = (size_t) v;
932 /* Possible data truncation should be safe. */
933 *pvalue_len = (size_t) v_size;
939 static int read_bits_32(struct rar5* rar, const uint8_t* p, uint32_t* value) {
940 uint32_t bits = p[rar->bits.in_addr] << 24;
941 bits |= p[rar->bits.in_addr + 1] << 16;
942 bits |= p[rar->bits.in_addr + 2] << 8;
943 bits |= p[rar->bits.in_addr + 3];
944 bits <<= rar->bits.bit_addr;
945 bits |= p[rar->bits.in_addr + 4] >> (8 - rar->bits.bit_addr);
950 static int read_bits_16(struct rar5* rar, const uint8_t* p, uint16_t* value) {
951 int bits = (int) p[rar->bits.in_addr] << 16;
952 bits |= (int) p[rar->bits.in_addr + 1] << 8;
953 bits |= (int) p[rar->bits.in_addr + 2];
954 bits >>= (8 - rar->bits.bit_addr);
955 *value = bits & 0xffff;
959 static void skip_bits(struct rar5* rar, int bits) {
960 const int new_bits = rar->bits.bit_addr + bits;
961 rar->bits.in_addr += new_bits >> 3;
962 rar->bits.bit_addr = new_bits & 7;
966 static int read_consume_bits(struct rar5* rar, const uint8_t* p, int n,
972 if(n == 0 || n > 16) {
973 /* This is a programmer error and should never happen in runtime. */
974 return ARCHIVE_FATAL;
977 ret = read_bits_16(rar, p, &v);
978 if(ret != ARCHIVE_OK)
992 static int read_u32(struct archive_read* a, uint32_t* pvalue) {
994 if(!read_ahead(a, 4, &p))
997 *pvalue = *(const uint32_t*)p;
999 return ARCHIVE_OK == consume(a, 4) ? 1 : 0;
1002 static int read_u64(struct archive_read* a, uint64_t* pvalue) {
1004 if(!read_ahead(a, 8, &p))
1007 *pvalue = *(const uint64_t*)p;
1009 return ARCHIVE_OK == consume(a, 8) ? 1 : 0;
1012 static int bid_standard(struct archive_read* a) {
1015 if(!read_ahead(a, rar5_signature_size, &p))
1018 if(!memcmp(rar5_signature, p, rar5_signature_size))
1024 static int rar5_bid(struct archive_read* a, int best_bid) {
1030 my_bid = bid_standard(a);
1038 static int rar5_options(struct archive_read *a, const char *key, const char *val) {
1043 /* No options supported in this version. Return the ARCHIVE_WARN code to
1044 * signal the options supervisor that the unpacker didn't handle setting
1047 return ARCHIVE_WARN;
1050 static void init_header(struct archive_read* a) {
1051 a->archive.archive_format = ARCHIVE_FORMAT_RAR_V5;
1052 a->archive.archive_format_name = "RAR5";
1056 HFL_EXTRA_DATA = 0x0001, HFL_DATA = 0x0002, HFL_SKIP_IF_UNKNOWN = 0x0004,
1057 HFL_SPLIT_BEFORE = 0x0008, HFL_SPLIT_AFTER = 0x0010, HFL_CHILD = 0x0020,
1058 HFL_INHERITED = 0x0040
1061 static int process_main_locator_extra_block(struct archive_read* a,
1064 uint64_t locator_flags;
1066 if(!read_var(a, &locator_flags, NULL)) {
1070 enum LOCATOR_FLAGS {
1071 QLIST = 0x01, RECOVERY = 0x02,
1074 if(locator_flags & QLIST) {
1075 if(!read_var(a, &rar->qlist_offset, NULL)) {
1079 /* qlist is not used */
1082 if(locator_flags & RECOVERY) {
1083 if(!read_var(a, &rar->rr_offset, NULL)) {
1087 /* rr is not used */
1093 static int parse_file_extra_hash(struct archive_read* a, struct rar5* rar,
1094 ssize_t* extra_data_size)
1099 if(!read_var_sized(a, &hash_type, &value_len))
1102 *extra_data_size -= value_len;
1103 if(ARCHIVE_OK != consume(a, value_len)) {
1111 /* The file uses BLAKE2sp checksum algorithm instead of plain old
1113 if(hash_type == BLAKE2sp) {
1115 const int hash_size = sizeof(rar->file.blake2sp);
1117 if(!read_ahead(a, hash_size, &p))
1120 rar->file.has_blake2 = 1;
1121 memcpy(&rar->file.blake2sp, p, hash_size);
1123 if(ARCHIVE_OK != consume(a, hash_size)) {
1127 *extra_data_size -= hash_size;
1129 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1130 "Unsupported hash type (0x%02x)", (int) hash_type);
1131 return ARCHIVE_FATAL;
1137 static uint64_t time_win_to_unix(uint64_t win_time) {
1138 const size_t ns_in_sec = 10000000;
1139 const uint64_t sec_to_unix = 11644473600LL;
1140 return win_time / ns_in_sec - sec_to_unix;
1143 static int parse_htime_item(struct archive_read* a, char unix_time,
1144 uint64_t* where, ssize_t* extra_data_size)
1148 if(!read_u32(a, &time_val))
1151 *extra_data_size -= 4;
1152 *where = (uint64_t) time_val;
1154 uint64_t windows_time;
1155 if(!read_u64(a, &windows_time))
1158 *where = time_win_to_unix(windows_time);
1159 *extra_data_size -= 8;
1165 static int parse_file_extra_htime(struct archive_read* a,
1166 struct archive_entry* e, struct rar5* rar,
1167 ssize_t* extra_data_size)
1181 if(!read_var_sized(a, &flags, &value_len))
1184 *extra_data_size -= value_len;
1185 if(ARCHIVE_OK != consume(a, value_len)) {
1189 unix_time = flags & IS_UNIX;
1191 if(flags & HAS_MTIME) {
1192 parse_htime_item(a, unix_time, &rar->file.e_mtime, extra_data_size);
1193 archive_entry_set_mtime(e, rar->file.e_mtime, 0);
1196 if(flags & HAS_CTIME) {
1197 parse_htime_item(a, unix_time, &rar->file.e_ctime, extra_data_size);
1198 archive_entry_set_ctime(e, rar->file.e_ctime, 0);
1201 if(flags & HAS_ATIME) {
1202 parse_htime_item(a, unix_time, &rar->file.e_atime, extra_data_size);
1203 archive_entry_set_atime(e, rar->file.e_atime, 0);
1206 if(flags & HAS_UNIX_NS) {
1207 if(!read_u32(a, &rar->file.e_unix_ns))
1210 *extra_data_size -= 4;
1216 static int process_head_file_extra(struct archive_read* a,
1217 struct archive_entry* e, struct rar5* rar,
1218 ssize_t extra_data_size)
1220 size_t extra_field_size;
1221 size_t extra_field_id;
1222 int ret = ARCHIVE_FATAL;
1226 CRYPT = 0x01, HASH = 0x02, HTIME = 0x03, VERSION_ = 0x04,
1227 REDIR = 0x05, UOWNER = 0x06, SUBDATA = 0x07
1230 while(extra_data_size > 0) {
1231 if(!read_var_sized(a, &extra_field_size, &var_size))
1234 extra_data_size -= var_size;
1235 if(ARCHIVE_OK != consume(a, var_size)) {
1239 if(!read_var_sized(a, &extra_field_id, &var_size))
1242 extra_data_size -= var_size;
1243 if(ARCHIVE_OK != consume(a, var_size)) {
1247 switch(extra_field_id) {
1249 ret = parse_file_extra_hash(a, rar, &extra_data_size);
1252 ret = parse_file_extra_htime(a, e, rar, &extra_data_size);
1265 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1266 "Unknown extra field in file/service block: 0x%02x",
1267 (int) extra_field_id);
1268 return ARCHIVE_FATAL;
1272 if(ret != ARCHIVE_OK) {
1273 /* Attribute not implemented. */
1280 static int process_head_file(struct archive_read* a, struct rar5* rar,
1281 struct archive_entry* entry, size_t block_flags)
1283 ssize_t extra_data_size = 0;
1284 size_t data_size = 0;
1285 size_t file_flags = 0;
1286 size_t file_attr = 0;
1287 size_t compression_info = 0;
1289 size_t name_size = 0;
1290 uint64_t unpacked_size;
1291 uint32_t mtime = 0, crc;
1292 int c_method = 0, c_version = 0, is_dir;
1293 char name_utf8_buf[2048 * 4];
1296 memset(entry, 0, sizeof(struct archive_entry));
1298 /* Do not reset file context if we're switching archives. */
1299 if(!rar->cstate.switch_multivolume) {
1300 reset_file_context(rar);
1303 if(block_flags & HFL_EXTRA_DATA) {
1304 size_t edata_size = 0;
1305 if(!read_var_sized(a, &edata_size, NULL))
1308 /* Intentional type cast from unsigned to signed. */
1309 extra_data_size = (ssize_t) edata_size;
1312 if(block_flags & HFL_DATA) {
1313 if(!read_var_sized(a, &data_size, NULL))
1316 rar->file.bytes_remaining = data_size;
1318 rar->file.bytes_remaining = 0;
1320 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1321 "no data found in file/service block");
1322 return ARCHIVE_FATAL;
1326 DIRECTORY = 0x0001, UTIME = 0x0002, CRC32 = 0x0004,
1327 UNKNOWN_UNPACKED_SIZE = 0x0008,
1330 enum COMP_INFO_FLAGS {
1334 if(!read_var_sized(a, &file_flags, NULL))
1337 if(!read_var(a, &unpacked_size, NULL))
1340 if(file_flags & UNKNOWN_UNPACKED_SIZE) {
1341 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER,
1342 "Files with unknown unpacked size are not supported");
1343 return ARCHIVE_FATAL;
1346 is_dir = (int) (file_flags & DIRECTORY);
1348 if(!read_var_sized(a, &file_attr, NULL))
1351 if(file_flags & UTIME) {
1352 if(!read_u32(a, &mtime))
1356 if(file_flags & CRC32) {
1357 if(!read_u32(a, &crc))
1361 if(!read_var_sized(a, &compression_info, NULL))
1364 c_method = (int) (compression_info >> 7) & 0x7;
1365 c_version = (int) (compression_info & 0x3f);
1367 rar->cstate.window_size = is_dir ?
1369 g_unpack_window_size << ((compression_info >> 10) & 15);
1370 rar->cstate.method = c_method;
1371 rar->cstate.version = c_version + 50;
1373 rar->file.solid = (compression_info & SOLID) > 0;
1374 rar->file.service = 0;
1376 if(!read_var_sized(a, &host_os, NULL))
1384 if(host_os == HOST_WINDOWS) {
1385 /* Host OS is Windows */
1387 unsigned short mode = 0660;
1394 archive_entry_set_mode(entry, mode);
1395 } else if(host_os == HOST_UNIX) {
1396 /* Host OS is Unix */
1397 archive_entry_set_mode(entry, (unsigned short) file_attr);
1399 /* Unknown host OS */
1400 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1401 "Unsupported Host OS: 0x%02x", (int) host_os);
1403 return ARCHIVE_FATAL;
1406 if(!read_var_sized(a, &name_size, NULL))
1409 if(!read_ahead(a, name_size, &p))
1412 if(name_size > 2047) {
1413 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1414 "Filename is too long");
1416 return ARCHIVE_FATAL;
1419 if(name_size == 0) {
1420 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1421 "No filename specified");
1423 return ARCHIVE_FATAL;
1426 memcpy(name_utf8_buf, p, name_size);
1427 name_utf8_buf[name_size] = 0;
1428 if(ARCHIVE_OK != consume(a, name_size)) {
1432 if(extra_data_size > 0) {
1433 int ret = process_head_file_extra(a, entry, rar, extra_data_size);
1436 if(extra_data_size < 0) {
1437 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER,
1438 "File extra data size is not zero");
1439 return ARCHIVE_FATAL;
1442 if(ret != ARCHIVE_OK)
1446 if((file_flags & UNKNOWN_UNPACKED_SIZE) == 0) {
1447 rar->file.unpacked_size = (ssize_t) unpacked_size;
1448 archive_entry_set_size(entry, unpacked_size);
1451 if(file_flags & UTIME) {
1452 archive_entry_set_mtime(entry, (time_t) mtime, 0);
1455 if(file_flags & CRC32) {
1456 rar->file.stored_crc32 = crc;
1459 archive_entry_update_pathname_utf8(entry, name_utf8_buf);
1461 if(!rar->cstate.switch_multivolume) {
1462 /* Do not reinitialize unpacking state if we're switching archives. */
1463 rar->cstate.block_parsing_finished = 1;
1464 rar->cstate.all_filters_applied = 1;
1465 rar->cstate.initialized = 0;
1468 if(rar->generic.split_before > 0) {
1469 /* If now we're standing on a header that has a 'split before' mark,
1470 * it means we're standing on a 'continuation' file header. Signal
1471 * the caller that if it wants to move to another file, it must call
1472 * rar5_read_header() function again. */
1474 return ARCHIVE_RETRY;
1480 static int process_head_service(struct archive_read* a, struct rar5* rar,
1481 struct archive_entry* entry, size_t block_flags)
1483 /* Process this SERVICE block the same way as FILE blocks. */
1484 int ret = process_head_file(a, rar, entry, block_flags);
1485 if(ret != ARCHIVE_OK)
1488 rar->file.service = 1;
1490 /* But skip the data part automatically. It's no use for the user anyway.
1491 * It contains only service data, not even needed to properly unpack the
1493 ret = rar5_read_data_skip(a);
1494 if(ret != ARCHIVE_OK)
1497 /* After skipping, try parsing another block automatically. */
1498 return ARCHIVE_RETRY;
1501 static int process_head_main(struct archive_read* a, struct rar5* rar,
1502 struct archive_entry* entry, size_t block_flags)
1507 size_t extra_data_size = 0;
1508 size_t extra_field_size = 0;
1509 size_t extra_field_id = 0;
1510 size_t archive_flags = 0;
1512 if(block_flags & HFL_EXTRA_DATA) {
1513 if(!read_var_sized(a, &extra_data_size, NULL))
1516 extra_data_size = 0;
1519 if(!read_var_sized(a, &archive_flags, NULL)) {
1524 VOLUME = 0x0001, /* multi-volume archive */
1525 VOLUME_NUMBER = 0x0002, /* volume number, first vol doesnt have it */
1526 SOLID = 0x0004, /* solid archive */
1527 PROTECT = 0x0008, /* contains Recovery info */
1528 LOCK = 0x0010, /* readonly flag, not used */
1531 rar->main.volume = (archive_flags & VOLUME) > 0;
1532 rar->main.solid = (archive_flags & SOLID) > 0;
1534 if(archive_flags & VOLUME_NUMBER) {
1536 if(!read_var_sized(a, &v, NULL)) {
1540 rar->main.vol_no = (int) v;
1542 rar->main.vol_no = 0;
1545 if(rar->vol.expected_vol_no > 0 &&
1546 rar->main.vol_no != rar->vol.expected_vol_no)
1548 /* Returning EOF instead of FATAL because of strange libarchive
1549 * behavior. When opening multiple files via
1550 * archive_read_open_filenames(), after reading up the whole last file,
1551 * the __archive_read_ahead function wraps up to the first archive
1552 * instead of returning EOF. */
1556 if(extra_data_size == 0) {
1561 if(!read_var_sized(a, &extra_field_size, NULL)) {
1565 if(!read_var_sized(a, &extra_field_id, NULL)) {
1569 if(extra_field_size == 0) {
1570 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1571 "Invalid extra field size");
1572 return ARCHIVE_FATAL;
1576 // Just one attribute here.
1580 switch(extra_field_id) {
1582 ret = process_main_locator_extra_block(a, rar);
1583 if(ret != ARCHIVE_OK) {
1584 /* Error while parsing main locator extra block. */
1590 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1591 "Unsupported extra type (0x%02x)", (int) extra_field_id);
1592 return ARCHIVE_FATAL;
1598 static int scan_for_signature(struct archive_read* a);
1600 /* Base block processing function. A 'base block' is a RARv5 header block
1601 * that tells the reader what kind of data is stored inside the block.
1603 * From the birds-eye view a RAR file looks file this:
1605 * <magic><base_block_1><base_block_2>...<base_block_n>
1607 * There are a few types of base blocks. Those types are specified inside
1608 * the 'switch' statement in this function. For example purposes, I'll write
1609 * how a standard RARv5 file could look like here:
1611 * <magic><MAIN><FILE><FILE><FILE><SERVICE><ENDARC>
1613 * The structure above could describe an archive file with 3 files in it,
1614 * one service "QuickOpen" block (that is ignored by this parser), and an
1615 * end of file base block marker.
1617 * If the file is stored in multiple archive files ("multiarchive"), it might
1620 * .part01.rar: <magic><MAIN><FILE><ENDARC>
1621 * .part02.rar: <magic><MAIN><FILE><ENDARC>
1622 * .part03.rar: <magic><MAIN><FILE><ENDARC>
1624 * This example could describe 3 RAR files that contain ONE archived file.
1625 * Or it could describe 3 RAR files that contain 3 different files. Or 3
1626 * RAR files than contain 2 files. It all depends what metadata is stored in
1627 * the headers of <FILE> blocks.
1629 * Each <FILE> block contains info about its size, the name of the file it's
1630 * storing inside, and whether this FILE block is a continuation block of
1631 * previous archive ('split before'), and is this FILE block should be
1632 * continued in another archive ('split after'). By parsing the 'split before'
1633 * and 'split after' flags, we're able to tell if multiple <FILE> base blocks
1634 * are describing one file, or multiple files (with the same filename, for
1637 * One thing to note is that if we're parsing the first <FILE> block, and
1638 * we see 'split after' flag, then we need to jump over to another <FILE>
1639 * block to be able to decompress rest of the data. To do this, we need
1640 * to skip the <ENDARC> block, then switch to another file, then skip the
1641 * <magic> block, <MAIN> block, and then we're standing on the proper
1645 static int process_base_block(struct archive_read* a,
1646 struct archive_entry* entry)
1648 struct rar5* rar = get_context(a);
1649 uint32_t hdr_crc, computed_crc;
1650 size_t raw_hdr_size, hdr_size_len, hdr_size;
1651 size_t header_id = 0;
1652 size_t header_flags = 0;
1656 /* Skip any unprocessed data for this file. */
1657 if(rar->file.bytes_remaining) {
1658 ret = rar5_read_data_skip(a);
1659 if(ret != ARCHIVE_OK) {
1664 /* Read the expected CRC32 checksum. */
1665 if(!read_u32(a, &hdr_crc)) {
1669 /* Read header size. */
1670 if(!read_var_sized(a, &raw_hdr_size, &hdr_size_len)) {
1674 /* Sanity check, maximum header size for RAR5 is 2MB. */
1675 if(raw_hdr_size > (2 * 1024 * 1024)) {
1676 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1677 "Base block header is too large");
1679 return ARCHIVE_FATAL;
1682 hdr_size = raw_hdr_size + hdr_size_len;
1684 /* Read the whole header data into memory, maximum memory use here is
1686 if(!read_ahead(a, hdr_size, &p)) {
1690 /* Verify the CRC32 of the header data. */
1691 computed_crc = (uint32_t) crc32(0, p, (int) hdr_size);
1692 if(computed_crc != hdr_crc) {
1693 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1694 "Header CRC error");
1696 return ARCHIVE_FATAL;
1699 /* If the checksum is OK, we proceed with parsing. */
1700 if(ARCHIVE_OK != consume(a, hdr_size_len)) {
1704 if(!read_var_sized(a, &header_id, NULL))
1707 if(!read_var_sized(a, &header_flags, NULL))
1710 rar->generic.split_after = (header_flags & HFL_SPLIT_AFTER) > 0;
1711 rar->generic.split_before = (header_flags & HFL_SPLIT_BEFORE) > 0;
1712 rar->generic.size = hdr_size;
1713 rar->generic.last_header_id = header_id;
1714 rar->main.endarc = 0;
1716 /* Those are possible header ids in RARv5. */
1718 HEAD_MARK = 0x00, HEAD_MAIN = 0x01, HEAD_FILE = 0x02,
1719 HEAD_SERVICE = 0x03, HEAD_CRYPT = 0x04, HEAD_ENDARC = 0x05,
1720 HEAD_UNKNOWN = 0xff,
1725 ret = process_head_main(a, rar, entry, header_flags);
1727 /* Main header doesn't have any files in it, so it's pointless
1728 * to return to the caller. Retry to next header, which should be
1729 * HEAD_FILE/HEAD_SERVICE. */
1730 if(ret == ARCHIVE_OK)
1731 return ARCHIVE_RETRY;
1735 ret = process_head_service(a, rar, entry, header_flags);
1738 ret = process_head_file(a, rar, entry, header_flags);
1741 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1742 "Encryption is not supported");
1743 return ARCHIVE_FATAL;
1745 rar->main.endarc = 1;
1747 /* After encountering an end of file marker, we need to take
1748 * into consideration if this archive is continued in another
1749 * file (i.e. is it part01.rar: is there a part02.rar?) */
1750 if(rar->main.volume) {
1751 /* In case there is part02.rar, position the read pointer
1752 * in a proper place, so we can resume parsing. */
1754 ret = scan_for_signature(a);
1755 if(ret == ARCHIVE_FATAL) {
1758 rar->vol.expected_vol_no = rar->main.vol_no + 1;
1767 if((header_flags & HFL_SKIP_IF_UNKNOWN) == 0) {
1768 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
1769 "Header type error");
1770 return ARCHIVE_FATAL;
1772 /* If the block is marked as 'skip if unknown', do as the flag
1773 * says: skip the block instead on failing on it. */
1774 return ARCHIVE_RETRY;
1780 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER,
1781 "Internal unpacker error");
1782 return ARCHIVE_FATAL;
1786 static int skip_base_block(struct archive_read* a) {
1788 struct rar5* rar = get_context(a);
1790 struct archive_entry entry;
1791 ret = process_base_block(a, &entry);
1793 if(rar->generic.last_header_id == 2 && rar->generic.split_before > 0)
1796 if(ret == ARCHIVE_OK)
1797 return ARCHIVE_RETRY;
1802 static int rar5_read_header(struct archive_read *a,
1803 struct archive_entry *entry)
1805 struct rar5* rar = get_context(a);
1808 if(rar->header_initialized == 0) {
1810 rar->header_initialized = 1;
1813 if(rar->skipped_magic == 0) {
1814 if(ARCHIVE_OK != consume(a, rar5_signature_size)) {
1818 rar->skipped_magic = 1;
1822 ret = process_base_block(a, entry);
1823 } while(ret == ARCHIVE_RETRY ||
1824 (rar->main.endarc > 0 && ret == ARCHIVE_OK));
1829 static void init_unpack(struct rar5* rar) {
1830 rar->file.calculated_crc32 = 0;
1831 rar->cstate.window_mask = rar->cstate.window_size - 1;
1833 if(rar->cstate.window_buf)
1834 free(rar->cstate.window_buf);
1836 if(rar->cstate.filtered_buf)
1837 free(rar->cstate.filtered_buf);
1839 rar->cstate.window_buf = calloc(1, rar->cstate.window_size);
1840 rar->cstate.filtered_buf = calloc(1, rar->cstate.window_size);
1842 rar->cstate.write_ptr = 0;
1843 rar->cstate.last_write_ptr = 0;
1845 memset(&rar->cstate.bd, 0, sizeof(rar->cstate.bd));
1846 memset(&rar->cstate.ld, 0, sizeof(rar->cstate.ld));
1847 memset(&rar->cstate.dd, 0, sizeof(rar->cstate.dd));
1848 memset(&rar->cstate.ldd, 0, sizeof(rar->cstate.ldd));
1849 memset(&rar->cstate.rd, 0, sizeof(rar->cstate.rd));
1852 static void update_crc(struct rar5* rar, const uint8_t* p, size_t to_read) {
1855 if(rar->skip_mode) {
1856 #if defined CHECK_CRC_ON_SOLID_SKIP
1865 /* Don't update CRC32 if the file doesn't have the `stored_crc32` info
1867 if(rar->file.stored_crc32 > 0) {
1868 rar->file.calculated_crc32 =
1869 crc32(rar->file.calculated_crc32, p, to_read);
1872 /* Check if the file uses an optional BLAKE2sp checksum algorithm. */
1873 if(rar->file.has_blake2 > 0) {
1874 /* Return value of the `update` function is always 0, so we can
1875 * explicitly ignore it here. */
1876 (void) blake2sp_update(&rar->file.b2state, p, to_read);
1881 static int create_decode_tables(uint8_t* bit_length,
1882 struct decode_table* table,
1885 int code, upper_limit = 0, i, lc[16];
1886 uint32_t decode_pos_clone[rar5_countof(table->decode_pos)];
1887 ssize_t cur_len, quick_data_size;
1889 memset(&lc, 0, sizeof(lc));
1890 memset(table->decode_num, 0, sizeof(table->decode_num));
1892 table->quick_bits = size == HUFF_NC ? 10 : 7;
1894 for(i = 0; i < size; i++) {
1895 lc[bit_length[i] & 15]++;
1899 table->decode_pos[0] = 0;
1900 table->decode_len[0] = 0;
1902 for(i = 1; i < 16; i++) {
1903 upper_limit += lc[i];
1905 table->decode_len[i] = upper_limit << (16 - i);
1906 table->decode_pos[i] = table->decode_pos[i - 1] + lc[i - 1];
1911 memcpy(decode_pos_clone, table->decode_pos, sizeof(decode_pos_clone));
1913 for(i = 0; i < size; i++) {
1914 uint8_t clen = bit_length[i] & 15;
1916 int last_pos = decode_pos_clone[clen];
1917 table->decode_num[last_pos] = i;
1918 decode_pos_clone[clen]++;
1922 quick_data_size = 1 << table->quick_bits;
1924 for(code = 0; code < quick_data_size; code++) {
1925 int bit_field = code << (16 - table->quick_bits);
1928 while(cur_len < rar5_countof(table->decode_len) &&
1929 bit_field >= table->decode_len[cur_len]) {
1933 table->quick_len[code] = (uint8_t) cur_len;
1935 dist = bit_field - table->decode_len[cur_len - 1];
1936 dist >>= (16 - cur_len);
1938 pos = table->decode_pos[cur_len] + dist;
1939 if(cur_len < rar5_countof(table->decode_pos) && pos < size) {
1940 table->quick_num[code] = table->decode_num[pos];
1942 table->quick_num[code] = 0;
1949 static int decode_number(struct archive_read* a, struct decode_table* table,
1950 const uint8_t* p, uint16_t* num)
1955 struct rar5* rar = get_context(a);
1957 if(ARCHIVE_OK != read_bits_16(rar, p, &bitfield)) {
1963 if(bitfield < table->decode_len[table->quick_bits]) {
1964 int code = bitfield >> (16 - table->quick_bits);
1965 skip_bits(rar, table->quick_len[code]);
1966 *num = table->quick_num[code];
1972 for(i = table->quick_bits + 1; i < 15; i++) {
1973 if(bitfield < table->decode_len[i]) {
1979 skip_bits(rar, bits);
1981 dist = bitfield - table->decode_len[bits - 1];
1982 dist >>= (16 - bits);
1983 pos = table->decode_pos[bits] + dist;
1985 if(pos >= table->size)
1988 *num = table->decode_num[pos];
1992 /* Reads and parses Huffman tables from the beginning of the block. */
1993 static int parse_tables(struct archive_read* a, struct rar5* rar,
1996 int ret, value, i, w, idx = 0;
1997 uint8_t bit_length[HUFF_BC],
1998 table[HUFF_TABLE_SIZE],
2002 enum { ESCAPE = 15 };
2004 /* The data for table generation is compressed using a simple RLE-like
2005 * algorithm when storing zeroes, so we need to unpack it first. */
2006 for(w = 0, i = 0; w < HUFF_BC;) {
2007 value = (p[i] & nibble_mask) >> nibble_shift;
2009 if(nibble_mask == 0x0F)
2012 nibble_mask ^= 0xFF;
2015 /* Values smaller than 15 is data, so we write it directly. Value 15
2016 * is a flag telling us that we need to unpack more bytes. */
2017 if(value == ESCAPE) {
2018 value = (p[i] & nibble_mask) >> nibble_shift;
2019 if(nibble_mask == 0x0F)
2021 nibble_mask ^= 0xFF;
2025 /* We sometimes need to write the actual value of 15, so this
2026 * case handles that. */
2027 bit_length[w++] = ESCAPE;
2032 for(k = 0; k < value + 2; k++) {
2033 bit_length[w++] = 0;
2037 bit_length[w++] = value;
2041 rar->bits.in_addr = i;
2042 rar->bits.bit_addr = nibble_shift ^ 4;
2044 ret = create_decode_tables(bit_length, &rar->cstate.bd, HUFF_BC);
2045 if(ret != ARCHIVE_OK) {
2046 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
2047 "Decoding huffman tables failed");
2048 return ARCHIVE_FATAL;
2051 for(i = 0; i < HUFF_TABLE_SIZE;) {
2054 ret = decode_number(a, &rar->cstate.bd, p, &num);
2055 if(ret != ARCHIVE_OK) {
2056 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
2057 "Decoding huffman tables failed");
2058 return ARCHIVE_FATAL;
2062 /* 0..15: store directly */
2063 table[i] = (uint8_t) num;
2069 /* 16..17: repeat previous code */
2071 if(ARCHIVE_OK != read_bits_16(rar, p, &n))
2085 while(n-- > 0 && i < HUFF_TABLE_SIZE) {
2086 table[i] = table[i - 1];
2090 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
2091 "Unexpected error when decoding huffman tables");
2092 return ARCHIVE_FATAL;
2098 /* other codes: fill with zeroes `n` times */
2100 if(ARCHIVE_OK != read_bits_16(rar, p, &n))
2113 while(n-- > 0 && i < HUFF_TABLE_SIZE)
2117 ret = create_decode_tables(&table[idx], &rar->cstate.ld, HUFF_NC);
2118 if(ret != ARCHIVE_OK) {
2119 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
2120 "Failed to create literal table");
2121 return ARCHIVE_FATAL;
2126 ret = create_decode_tables(&table[idx], &rar->cstate.dd, HUFF_DC);
2127 if(ret != ARCHIVE_OK) {
2128 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
2129 "Failed to create distance table");
2130 return ARCHIVE_FATAL;
2135 ret = create_decode_tables(&table[idx], &rar->cstate.ldd, HUFF_LDC);
2136 if(ret != ARCHIVE_OK) {
2137 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
2138 "Failed to create lower bits of distances table");
2139 return ARCHIVE_FATAL;
2144 ret = create_decode_tables(&table[idx], &rar->cstate.rd, HUFF_RC);
2145 if(ret != ARCHIVE_OK) {
2146 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
2147 "Failed to create repeating distances table");
2148 return ARCHIVE_FATAL;
2154 /* Parses the block header, verifies its CRC byte, and saves the header
2155 * fields inside the `hdr` pointer. */
2156 static int parse_block_header(struct archive_read* a, const uint8_t* p,
2157 ssize_t* block_size, struct compressed_block_header* hdr)
2159 memcpy(hdr, p, sizeof(struct compressed_block_header));
2161 if(hdr->block_flags.byte_count > 2) {
2162 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
2163 "Unsupported block header size (was %d, max is 2)",
2164 hdr->block_flags.byte_count);
2165 return ARCHIVE_FATAL;
2168 /* This should probably use bit reader interface in order to be more
2171 switch(hdr->block_flags.byte_count) {
2172 /* 1-byte block size */
2174 *block_size = *(const uint8_t*) &p[2];
2177 /* 2-byte block size */
2179 *block_size = *(const uint16_t*) &p[2];
2182 /* 3-byte block size */
2184 *block_size = *(const uint32_t*) &p[2];
2185 *block_size &= 0x00FFFFFF;
2188 /* Other block sizes are not supported. This case is not reached,
2189 * because we have an 'if' guard before the switch that makes sure
2192 return ARCHIVE_FATAL;
2195 /* Verify the block header checksum. 0x5A is a magic value and is always
2197 uint8_t calculated_cksum = 0x5A
2198 ^ (uint8_t) hdr->block_flags_u8
2199 ^ (uint8_t) *block_size
2200 ^ (uint8_t) (*block_size >> 8)
2201 ^ (uint8_t) (*block_size >> 16);
2203 if(calculated_cksum != hdr->block_cksum) {
2204 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
2205 "Block checksum error: got 0x%02x, expected 0x%02x",
2206 hdr->block_cksum, calculated_cksum);
2208 return ARCHIVE_FATAL;
2214 /* Convinience function used during filter processing. */
2215 static int parse_filter_data(struct rar5* rar, const uint8_t* p,
2216 uint32_t* filter_data)
2221 if(ARCHIVE_OK != read_consume_bits(rar, p, 2, &bytes))
2226 for(i = 0; i < bytes; i++) {
2229 if(ARCHIVE_OK != read_bits_16(rar, p, &byte)) {
2233 data += (byte >> 8) << (i * 8);
2237 *filter_data = data;
2241 /* Function is used during sanity checking. */
2242 static int is_valid_filter_block_start(struct rar5* rar,
2245 const int64_t block_start = (ssize_t) start + rar->cstate.write_ptr;
2246 const int64_t last_bs = rar->cstate.last_block_start;
2247 const ssize_t last_bl = rar->cstate.last_block_length;
2249 if(last_bs == 0 || last_bl == 0) {
2250 /* We didn't have any filters yet, so accept this offset. */
2254 if(block_start >= last_bs + last_bl) {
2255 /* Current offset is bigger than last block's end offset, so
2256 * accept current offset. */
2260 /* Any other case is not a normal situation and we should fail. */
2264 /* The function will create a new filter, read its parameters from the input
2265 * stream and add it to the filter collection. */
2266 static int parse_filter(struct archive_read* ar, const uint8_t* p) {
2267 uint32_t block_start, block_length;
2268 uint16_t filter_type;
2269 struct rar5* rar = get_context(ar);
2271 /* Read the parameters from the input stream. */
2272 if(ARCHIVE_OK != parse_filter_data(rar, p, &block_start))
2275 if(ARCHIVE_OK != parse_filter_data(rar, p, &block_length))
2278 if(ARCHIVE_OK != read_bits_16(rar, p, &filter_type))
2284 /* Perform some sanity checks on this filter parameters. Note that we
2285 * allow only DELTA, E8/E9 and ARM filters here, because rest of filters
2286 * are not used in RARv5. */
2288 if(block_length < 4 ||
2289 block_length > 0x400000 ||
2290 filter_type > FILTER_ARM ||
2291 !is_valid_filter_block_start(rar, block_start))
2293 archive_set_error(&ar->archive, ARCHIVE_ERRNO_FILE_FORMAT, "Invalid "
2294 "filter encountered");
2295 return ARCHIVE_FATAL;
2298 /* Allocate a new filter. */
2299 struct filter_info* filt = add_new_filter(rar);
2301 archive_set_error(&ar->archive, ENOMEM, "Can't allocate memory for a "
2302 "filter descriptor.");
2303 return ARCHIVE_FATAL;
2306 filt->type = filter_type;
2307 filt->block_start = rar->cstate.write_ptr + block_start;
2308 filt->block_length = block_length;
2310 rar->cstate.last_block_start = filt->block_start;
2311 rar->cstate.last_block_length = filt->block_length;
2313 /* Read some more data in case this is a DELTA filter. Other filter types
2314 * don't require any additional data over what was already read. */
2315 if(filter_type == FILTER_DELTA) {
2318 if(ARCHIVE_OK != read_consume_bits(rar, p, 5, &channels))
2321 filt->channels = channels + 1;
2327 static int decode_code_length(struct rar5* rar, const uint8_t* p,
2330 int lbits, length = 2;
2335 lbits = code / 4 - 1;
2336 length += (4 | (code & 3)) << lbits;
2342 if(ARCHIVE_OK != read_consume_bits(rar, p, lbits, &add))
2351 static int copy_string(struct archive_read* a, int len, int dist) {
2352 struct rar5* rar = get_context(a);
2353 const int cmask = rar->cstate.window_mask;
2354 const int64_t write_ptr = rar->cstate.write_ptr + rar->cstate.solid_offset;
2357 /* The unpacker spends most of the time in this function. It would be
2358 * a good idea to introduce some optimizations here.
2360 * Just remember that this loop treats buffers that overlap differently
2361 * than buffers that do not overlap. This is why a simple memcpy(3) call
2362 * will not be enough. */
2364 for(i = 0; i < len; i++) {
2365 const ssize_t write_idx = (write_ptr + i) & cmask;
2366 const ssize_t read_idx = (write_ptr + i - dist) & cmask;
2367 rar->cstate.window_buf[write_idx] = rar->cstate.window_buf[read_idx];
2370 rar->cstate.write_ptr += len;
2374 static int do_uncompress_block(struct archive_read* a, const uint8_t* p) {
2375 struct rar5* rar = get_context(a);
2379 const int cmask = rar->cstate.window_mask;
2380 const struct compressed_block_header* hdr = &rar->last_block_hdr;
2381 const uint8_t bit_size = 1 + hdr->block_flags.bit_size;
2384 if(rar->cstate.write_ptr - rar->cstate.last_write_ptr >
2385 (rar->cstate.window_size >> 1)) {
2387 /* Don't allow growing data by more than half of the window size
2388 * at a time. In such case, break the loop; next call to this
2389 * function will continue processing from this moment. */
2394 if(rar->bits.in_addr > rar->cstate.cur_block_size - 1 ||
2395 (rar->bits.in_addr == rar->cstate.cur_block_size - 1 &&
2396 rar->bits.bit_addr >= bit_size))
2398 /* If the program counter is here, it means the function has
2399 * finished processing the block. */
2400 rar->cstate.block_parsing_finished = 1;
2404 /* Decode the next literal. */
2405 if(ARCHIVE_OK != decode_number(a, &rar->cstate.ld, p, &num)) {
2409 /* Num holds a decompression literal, or 'command code'.
2411 * - Values lower than 256 are just bytes. Those codes can be stored
2412 * in the output buffer directly.
2414 * - Code 256 defines a new filter, which is later used to transform
2415 * the data block accordingly to the filter type. The data block
2416 * needs to be fully uncompressed first.
2418 * - Code bigger than 257 and smaller than 262 define a repetition
2419 * pattern that should be copied from an already uncompressed chunk
2424 /* Directly store the byte. */
2426 int64_t write_idx = rar->cstate.solid_offset +
2427 rar->cstate.write_ptr++;
2429 rar->cstate.window_buf[write_idx & cmask] = (uint8_t) num;
2431 } else if(num >= 262) {
2433 int len = decode_code_length(rar, p, num - 262),
2438 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER,
2439 "Failed to decode the code length");
2441 return ARCHIVE_FATAL;
2444 if(ARCHIVE_OK != decode_number(a, &rar->cstate.dd, p, &dist_slot))
2446 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER,
2447 "Failed to decode the distance slot");
2449 return ARCHIVE_FATAL;
2456 dbits = dist_slot / 2 - 1;
2457 dist += (2 | (dist_slot & 1)) << dbits;
2466 if(ARCHIVE_OK != read_bits_32(rar, p, &add)) {
2467 /* Return EOF if we can't read more data. */
2471 skip_bits(rar, dbits - 4);
2472 add = (add >> (36 - dbits)) << 4;
2476 if(ARCHIVE_OK != decode_number(a, &rar->cstate.ldd, p,
2479 archive_set_error(&a->archive,
2480 ARCHIVE_ERRNO_PROGRAMMER,
2481 "Failed to decode the distance slot");
2483 return ARCHIVE_FATAL;
2488 /* dbits is one of [0,1,2,3] */
2491 if(ARCHIVE_OK != read_consume_bits(rar, p, dbits, &add)) {
2492 /* Return EOF if we can't read more data. */
2506 if(dist > 0x40000) {
2512 dist_cache_push(rar, dist);
2513 rar->cstate.last_len = len;
2515 if(ARCHIVE_OK != copy_string(a, len, dist))
2516 return ARCHIVE_FATAL;
2519 } else if(num == 256) {
2520 /* Create a filter. */
2521 ret = parse_filter(a, p);
2522 if(ret != ARCHIVE_OK)
2526 } else if(num == 257) {
2527 if(rar->cstate.last_len != 0) {
2528 if(ARCHIVE_OK != copy_string(a, rar->cstate.last_len,
2529 rar->cstate.dist_cache[0]))
2531 return ARCHIVE_FATAL;
2536 } else if(num < 262) {
2537 const int idx = num - 258;
2538 const int dist = dist_cache_touch(rar, idx);
2543 if(ARCHIVE_OK != decode_number(a, &rar->cstate.rd, p, &len_slot)) {
2544 return ARCHIVE_FATAL;
2547 len = decode_code_length(rar, p, len_slot);
2548 rar->cstate.last_len = len;
2550 if(ARCHIVE_OK != copy_string(a, len, dist))
2551 return ARCHIVE_FATAL;
2556 /* The program counter shouldn't reach here. */
2557 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
2558 "Unsupported block code: 0x%02x", num);
2560 return ARCHIVE_FATAL;
2566 /* Binary search for the RARv5 signature. */
2567 static int scan_for_signature(struct archive_read* a) {
2569 const int chunk_size = 512;
2572 /* If we're here, it means we're on an 'unknown territory' data.
2573 * There's no indication what kind of data we're reading here. It could be
2574 * some text comment, any kind of binary data, digital sign, dragons, etc.
2576 * We want to find a valid RARv5 magic header inside this unknown data. */
2578 /* Is it possible in libarchive to just skip everything until the
2579 * end of the file? If so, it would be a better approach than the
2580 * current implementation of this function. */
2583 if(!read_ahead(a, chunk_size, &p))
2586 for(i = 0; i < chunk_size - rar5_signature_size; i++) {
2587 if(memcmp(&p[i], rar5_signature, rar5_signature_size) == 0) {
2588 /* Consume the number of bytes we've used to search for the
2589 * signature, as well as the number of bytes used by the
2590 * signature itself. After this we should be standing on a
2591 * valid base block header. */
2592 (void) consume(a, i + rar5_signature_size);
2597 consume(a, chunk_size);
2600 return ARCHIVE_FATAL;
2603 /* This function will switch the multivolume archive file to another file,
2604 * i.e. from part03 to part 04. */
2605 static int advance_multivolume(struct archive_read* a) {
2607 struct rar5* rar = get_context(a);
2609 /* A small state machine that will skip unnecessary data, needed to
2610 * switch from one multivolume to another. Such skipping is needed if
2611 * we want to be an stream-oriented (instead of file-oriented)
2614 * The state machine starts with `rar->main.endarc` == 0. It also
2615 * assumes that current stream pointer points to some base block header.
2617 * The `endarc` field is being set when the base block parsing function
2618 * encounters the 'end of archive' marker.
2622 if(rar->main.endarc == 1) {
2623 rar->main.endarc = 0;
2624 while(ARCHIVE_RETRY == skip_base_block(a));
2627 /* Skip current base block. In order to properly skip it,
2628 * we really need to simply parse it and discard the results. */
2630 lret = skip_base_block(a);
2632 /* The `skip_base_block` function tells us if we should continue
2633 * with skipping, or we should stop skipping. We're trying to skip
2634 * everything up to a base FILE block. */
2636 if(lret != ARCHIVE_RETRY) {
2637 /* If there was an error during skipping, or we have just
2638 * skipped a FILE base block... */
2640 if(rar->main.endarc == 0) {
2652 /* Merges the partial block from the first multivolume archive file, and
2653 * partial block from the second multivolume archive file. The result is
2654 * a chunk of memory containing the whole block, and the stream pointer
2655 * is advanced to the next block in the second multivolume archive file. */
2656 static int merge_block(struct archive_read* a, ssize_t block_size,
2659 struct rar5* rar = get_context(a);
2660 ssize_t cur_block_size, partial_offset = 0;
2664 /* Set a flag that we're in the switching mode. */
2665 rar->cstate.switch_multivolume = 1;
2667 /* Reallocate the memory which will hold the whole block. */
2668 if(rar->vol.push_buf)
2669 free((void*) rar->vol.push_buf);
2671 rar->vol.push_buf = malloc(block_size);
2672 if(!rar->vol.push_buf) {
2673 archive_set_error(&a->archive, ENOMEM, "Can't allocate memory for a "
2674 "merge block buffer.");
2675 return ARCHIVE_FATAL;
2678 /* A single block can span across multiple multivolume archive files,
2679 * so we use a loop here. This loop will consume enough multivolume
2680 * archive files until the whole block is read. */
2683 /* Get the size of current block chunk in this multivolume archive
2684 * file and read it. */
2686 rar5_min(rar->file.bytes_remaining, block_size - partial_offset);
2688 if(!read_ahead(a, cur_block_size, &lp))
2691 /* Sanity check; there should never be a situation where this function
2692 * reads more data than the block's size. */
2693 if(partial_offset + cur_block_size > block_size) {
2694 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER,
2695 "Consumed too much data when merging blocks.");
2696 return ARCHIVE_FATAL;
2699 /* Merge previous block chunk with current block chunk, or create
2700 * first block chunk if this is our first iteration. */
2701 memcpy(&rar->vol.push_buf[partial_offset], lp, cur_block_size);
2703 /* Advance the stream read pointer by this block chunk size. */
2704 if(ARCHIVE_OK != consume(a, cur_block_size))
2707 /* Update the pointers. `partial_offset` contains information about
2708 * the sum of merged block chunks. */
2709 partial_offset += cur_block_size;
2710 rar->file.bytes_remaining -= cur_block_size;
2712 /* If `partial_offset` is the same as `block_size`, this means we've
2713 * merged all block chunks and we have a valid full block. */
2714 if(partial_offset == block_size) {
2718 /* If we don't have any bytes to read, this means we should switch
2719 * to another multivolume archive file. */
2720 if(rar->file.bytes_remaining == 0) {
2721 ret = advance_multivolume(a);
2722 if(ret != ARCHIVE_OK)
2727 *p = rar->vol.push_buf;
2729 /* If we're here, we can resume unpacking by processing the block pointed
2730 * to by the `*p` memory pointer. */
2735 static int process_block(struct archive_read* a) {
2737 struct rar5* rar = get_context(a);
2740 /* If we don't have any data to be processed, this most probably means
2741 * we need to switch to the next volume. */
2742 if(rar->main.volume && rar->file.bytes_remaining == 0) {
2743 ret = advance_multivolume(a);
2744 if(ret != ARCHIVE_OK)
2748 if(rar->cstate.block_parsing_finished) {
2751 rar->cstate.block_parsing_finished = 0;
2753 /* The header size won't be bigger than 6 bytes. */
2754 if(!read_ahead(a, 6, &p)) {
2755 /* Failed to prefetch data block header. */
2760 * Read block_size by parsing block header. Validate the header by
2761 * calculating CRC byte stored inside the header. Size of the header is
2762 * not constant (block size can be stored either in 1 or 2 bytes),
2763 * that's why block size is left out from the `compressed_block_header`
2764 * structure and returned by `parse_block_header` as the second
2767 ret = parse_block_header(a, p, &block_size, &rar->last_block_hdr);
2768 if(ret != ARCHIVE_OK)
2771 /* Skip block header. Next data is huffman tables, if present. */
2772 ssize_t to_skip = sizeof(struct compressed_block_header) +
2773 rar->last_block_hdr.block_flags.byte_count + 1;
2775 if(ARCHIVE_OK != consume(a, to_skip))
2778 rar->file.bytes_remaining -= to_skip;
2780 /* The block size gives information about the whole block size, but
2781 * the block could be stored in split form when using multi-volume
2782 * archives. In this case, the block size will be bigger than the
2783 * actual data stored in this file. Remaining part of the data will
2784 * be in another file. */
2786 ssize_t cur_block_size =
2787 rar5_min(rar->file.bytes_remaining, block_size);
2789 if(block_size > rar->file.bytes_remaining) {
2790 /* If current blocks' size is bigger than our data size, this
2791 * means we have a multivolume archive. In this case, skip
2792 * all base headers until the end of the file, proceed to next
2793 * "partXXX.rar" volume, find its signature, skip all headers up
2794 * to the first FILE base header, and continue from there.
2796 * Note that `merge_block` will update the `rar` context structure
2797 * quite extensively. */
2799 ret = merge_block(a, block_size, &p);
2800 if(ret != ARCHIVE_OK) {
2804 cur_block_size = block_size;
2806 /* Current stream pointer should be now directly *after* the
2807 * block that spanned through multiple archive files. `p` pointer
2808 * should have the data of the *whole* block (merged from
2809 * partial blocks stored in multiple archives files). */
2811 rar->cstate.switch_multivolume = 0;
2813 /* Read the whole block size into memory. This can take up to
2814 * 8 megabytes of memory in theoretical cases. Might be worth to
2815 * optimize this and use a standard chunk of 4kb's. */
2817 if(!read_ahead(a, 4 + cur_block_size, &p)) {
2818 /* Failed to prefetch block data. */
2823 rar->cstate.block_buf = p;
2824 rar->cstate.cur_block_size = cur_block_size;
2826 rar->bits.in_addr = 0;
2827 rar->bits.bit_addr = 0;
2829 if(rar->last_block_hdr.block_flags.is_table_present) {
2830 /* Load Huffman tables. */
2831 ret = parse_tables(a, rar, p);
2832 if(ret != ARCHIVE_OK) {
2833 /* Error during decompression of Huffman tables. */
2838 p = rar->cstate.block_buf;
2841 /* Uncompress the block, or a part of it, depending on how many bytes
2842 * will be generated by uncompressing the block.
2844 * In case too many bytes will be generated, calling this function again
2845 * will resume the uncompression operation. */
2846 ret = do_uncompress_block(a, p);
2847 if(ret != ARCHIVE_OK) {
2851 if(rar->cstate.block_parsing_finished &&
2852 rar->cstate.switch_multivolume == 0 &&
2853 rar->cstate.cur_block_size > 0)
2855 /* If we're processing a normal block, consume the whole block. We
2856 * can do this because we've already read the whole block to memory.
2858 if(ARCHIVE_OK != consume(a, rar->cstate.cur_block_size))
2859 return ARCHIVE_FATAL;
2861 rar->file.bytes_remaining -= rar->cstate.cur_block_size;
2862 } else if(rar->cstate.switch_multivolume) {
2863 /* Don't consume the block if we're doing multivolume processing.
2864 * The volume switching function will consume the proper count of
2867 rar->cstate.switch_multivolume = 0;
2873 /* Pops the `buf`, `size` and `offset` from the "data ready" stack.
2875 * Returns ARCHIVE_OK when those arguments can be used, ARCHIVE_RETRY
2876 * when there is no data on the stack. */
2877 static int use_data(struct rar5* rar, const void** buf, size_t* size,
2882 for(i = 0; i < rar5_countof(rar->cstate.dready); i++) {
2883 struct data_ready *d = &rar->cstate.dready[i];
2886 if(buf) *buf = d->buf;
2887 if(size) *size = d->size;
2888 if(offset) *offset = d->offset;
2895 return ARCHIVE_RETRY;
2898 /* Pushes the `buf`, `size` and `offset` arguments to the rar->cstate.dready
2899 * FIFO stack. Those values will be popped from this stack by the `use_data`
2901 static int push_data_ready(struct archive_read* a, struct rar5* rar,
2902 const uint8_t* buf, size_t size, int64_t offset)
2906 /* Don't push if we're in skip mode. This is needed because solid
2907 * streams need full processing even if we're skipping data. After fully
2908 * processing the stream, we need to discard the generated bytes, because
2909 * we're interested only in the side effect: building up the internal
2910 * window circular buffer. This window buffer will be used later during
2911 * unpacking of requested data. */
2916 if(offset != rar->file.last_offset + rar->file.last_size) {
2917 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER, "Sanity "
2918 "check error: output stream is not continuous");
2919 return ARCHIVE_FATAL;
2922 for(i = 0; i < rar5_countof(rar->cstate.dready); i++) {
2923 struct data_ready* d = &rar->cstate.dready[i];
2930 /* These fields are used only in sanity checking. */
2931 rar->file.last_offset = offset;
2932 rar->file.last_size = size;
2934 /* Calculate the checksum of this new block before submitting
2935 * data to libarchive's engine. */
2936 update_crc(rar, d->buf, d->size);
2942 /* Program counter will reach this code if the `rar->cstate.data_ready`
2943 * stack will be filled up so that no new entries will be allowed. The
2944 * code shouldn't allow such situation to occur. So we treat this case
2945 * as an internal error. */
2947 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER, "Error: "
2948 "premature end of data_ready stack");
2949 return ARCHIVE_FATAL;
2952 /* This function uncompresses the data that is stored in the <FILE> base
2955 * The FILE base block looks like this:
2957 * <header><huffman tables><block_1><block_2>...<block_n>
2959 * The <header> is a block header, that is parsed in parse_block_header().
2960 * It's a "compressed_block_header" structure, containing metadata needed
2961 * to know when we should stop looking for more <block_n> blocks.
2963 * <huffman tables> contain data needed to set up the huffman tables, needed
2964 * for the actual decompression.
2966 * Each <block_n> consists of series of literals:
2968 * <literal><literal><literal>...<literal>
2970 * Those literals generate the uncompression data. They operate on a circular
2971 * buffer, sometimes writing raw data into it, sometimes referencing
2972 * some previous data inside this buffer, and sometimes declaring a filter
2973 * that will need to be executed on the data stored in the circular buffer.
2974 * It all depends on the literal that is used.
2976 * Sometimes blocks produce output data, sometimes they don't. For example, for
2977 * some huge files that use lots of filters, sometimes a block is filled with
2978 * only filter declaration literals. Such blocks won't produce any data in the
2981 * Sometimes blocks will produce 4 bytes of data, and sometimes 1 megabyte,
2982 * because a literal can reference previously decompressed data. For example,
2983 * there can be a literal that says: 'append a byte 0xFE here', and after
2984 * it another literal can say 'append 1 megabyte of data from circular buffer
2985 * offset 0x12345'. This is how RAR format handles compressing repeated
2988 * The RAR compressor creates those literals and the actual efficiency of
2989 * compression depends on what those literals are. The literals can also
2990 * be seen as a kind of a non-turing-complete virtual machine that simply
2991 * tells the decompressor what it should do.
2994 static int do_uncompress_file(struct archive_read* a) {
2995 struct rar5* rar = get_context(a);
2997 int64_t max_end_pos;
2999 if(!rar->cstate.initialized) {
3000 /* Don't perform full context reinitialization if we're processing
3001 * a solid archive. */
3002 if(!rar->main.solid || !rar->cstate.window_buf) {
3006 rar->cstate.initialized = 1;
3009 if(rar->cstate.all_filters_applied == 1) {
3010 /* We use while(1) here, but standard case allows for just 1 iteration.
3011 * The loop will iterate if process_block() didn't generate any data at
3012 * all. This can happen if the block contains only filter definitions
3013 * (this is common in big files). */
3016 ret = process_block(a);
3017 if(ret == ARCHIVE_EOF || ret == ARCHIVE_FATAL)
3020 if(rar->cstate.last_write_ptr == rar->cstate.write_ptr) {
3021 /* The block didn't generate any new data, so just process
3026 /* The block has generated some new data, so break the loop. */
3031 /* Try to run filters. If filters won't be applied, it means that
3032 * insufficient data was generated. */
3033 ret = apply_filters(a);
3034 if(ret == ARCHIVE_RETRY) {
3036 } else if(ret == ARCHIVE_FATAL) {
3037 return ARCHIVE_FATAL;
3040 /* If apply_filters() will return ARCHIVE_OK, we can continue here. */
3042 if(cdeque_size(&rar->cstate.filters) > 0) {
3043 /* Check if we can write something before hitting first filter. */
3044 struct filter_info* flt;
3046 /* Get the block_start offset from the first filter. */
3047 if(CDE_OK != cdeque_front(&rar->cstate.filters, cdeque_filter_p(&flt)))
3049 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER,
3050 "Can't read first filter");
3051 return ARCHIVE_FATAL;
3054 max_end_pos = rar5_min(flt->block_start, rar->cstate.write_ptr);
3056 /* There are no filters defined, or all filters were applied. This
3057 * means we can just store the data without any postprocessing. */
3058 max_end_pos = rar->cstate.write_ptr;
3061 if(max_end_pos == rar->cstate.last_write_ptr) {
3062 /* We can't write anything yet. The block uncompression function did
3063 * not generate enough data, and no filter can be applied. At the same
3064 * time we don't have any data that can be stored without filter
3065 * postprocessing. This means we need to wait for more data to be
3066 * generated, so we can apply the filters.
3068 * Signal the caller that we need more data to be able to do anything.
3070 return ARCHIVE_RETRY;
3072 /* We can write the data before hitting the first filter. So let's
3073 * do it. The push_window_data() function will effectively return
3074 * the selected data block to the user application. */
3075 push_window_data(a, rar, rar->cstate.last_write_ptr, max_end_pos);
3076 rar->cstate.last_write_ptr = max_end_pos;
3082 static int uncompress_file(struct archive_read* a) {
3086 /* Sometimes the uncompression function will return a 'retry' signal.
3087 * If this will happen, we have to retry the function. */
3088 ret = do_uncompress_file(a);
3089 if(ret != ARCHIVE_RETRY)
3095 static int do_unstore_file(struct archive_read* a,
3103 if(rar->file.bytes_remaining == 0 && rar->main.volume > 0 &&
3104 rar->generic.split_after > 0)
3108 rar->cstate.switch_multivolume = 1;
3109 ret = advance_multivolume(a);
3110 rar->cstate.switch_multivolume = 0;
3112 if(ret != ARCHIVE_OK) {
3113 /* Failed to advance to next multivolume archive file. */
3118 size_t to_read = rar5_min(rar->file.bytes_remaining, 64 * 1024);
3120 if(!read_ahead(a, to_read, &p)) {
3121 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT, "I/O error "
3122 "when unstoring file");
3123 return ARCHIVE_FATAL;
3126 if(ARCHIVE_OK != consume(a, to_read)) {
3131 if(size) *size = to_read;
3132 if(offset) *offset = rar->cstate.last_unstore_ptr;
3134 rar->file.bytes_remaining -= to_read;
3135 rar->cstate.last_unstore_ptr += to_read;
3137 update_crc(rar, p, to_read);
3141 static int do_unpack(struct archive_read* a, struct rar5* rar,
3142 const void** buf, size_t* size, int64_t* offset)
3144 enum COMPRESSION_METHOD {
3145 STORE = 0, FASTEST = 1, FAST = 2, NORMAL = 3, GOOD = 4, BEST = 5
3148 if(rar->file.service > 0) {
3149 return do_unstore_file(a, rar, buf, size, offset);
3151 switch(rar->cstate.method) {
3153 return do_unstore_file(a, rar, buf, size, offset);
3163 return uncompress_file(a);
3165 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
3166 "Compression method not supported: 0x%08x",
3167 rar->cstate.method);
3169 return ARCHIVE_FATAL;
3179 static int verify_checksums(struct archive_read* a) {
3181 struct rar5* rar = get_context(a);
3183 /* Check checksums only when actually unpacking the data. There's no need
3184 * to calculate checksum when we're skipping data in solid archives
3185 * (skipping in solid archives is the same thing as unpacking compressed
3186 * data and discarding the result). */
3188 if(!rar->skip_mode) {
3189 /* Always check checkums if we're not in skip mode */
3192 /* We can override the logic above with a compile-time option
3193 * NO_CRC_ON_SOLID_SKIP. This option is used during debugging, and it
3194 * will check checksums of unpacked data even when we're skipping it.
3197 #if defined CHECK_CRC_ON_SOLID_SKIP
3207 /* During unpacking, on each unpacked block we're calling the
3208 * update_crc() function. Since we are here, the unpacking process is
3209 * already over and we can check if calculated checksum (CRC32 or
3210 * BLAKE2sp) is the same as what is stored in the archive.
3212 if(rar->file.stored_crc32 > 0) {
3213 /* Check CRC32 only when the file contains a CRC32 value for this
3216 if(rar->file.calculated_crc32 != rar->file.stored_crc32) {
3217 /* Checksums do not match; the unpacked file is corrupted. */
3220 printf("Checksum error: CRC32 (was: %08x, expected: %08x)\n",
3221 rar->file.calculated_crc32, rar->file.stored_crc32);
3224 #ifndef DONT_FAIL_ON_CRC_ERROR
3225 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
3226 "Checksum error: CRC32");
3227 return ARCHIVE_FATAL;
3231 printf("Checksum OK: CRC32 (%08x/%08x)\n",
3232 rar->file.stored_crc32,
3233 rar->file.calculated_crc32);
3238 if(rar->file.has_blake2 > 0) {
3239 /* BLAKE2sp is an optional checksum algorithm that is added to
3240 * RARv5 archives when using the `-htb` switch during creation of
3243 * We now finalize the hash calculation by calling the `final`
3244 * function. This will generate the final hash value we can use to
3245 * compare it with the BLAKE2sp checksum that is stored in the
3248 * The return value of this `final` function is not very helpful,
3249 * as it guards only against improper use. This is why we're
3250 * explicitly ignoring it. */
3253 (void) blake2sp_final(&rar->file.b2state, b2_buf, 32);
3255 if(memcmp(&rar->file.blake2sp, b2_buf, 32) != 0) {
3256 #ifndef DONT_FAIL_ON_CRC_ERROR
3257 archive_set_error(&a->archive, ARCHIVE_ERRNO_FILE_FORMAT,
3258 "Checksum error: BLAKE2");
3260 return ARCHIVE_FATAL;
3266 /* Finalization for this file has been successfully completed. */
3270 static int verify_global_checksums(struct archive_read* a) {
3271 return verify_checksums(a);
3274 static int rar5_read_data(struct archive_read *a, const void **buff,
3275 size_t *size, int64_t *offset) {
3277 struct rar5* rar = get_context(a);
3279 if(!rar->skip_mode && (rar->cstate.last_write_ptr > rar->file.unpacked_size)) {
3280 archive_set_error(&a->archive, ARCHIVE_ERRNO_PROGRAMMER,
3281 "Unpacker has written too many bytes");
3282 return ARCHIVE_FATAL;
3285 ret = use_data(rar, buff, size, offset);
3286 if(ret == ARCHIVE_OK)
3289 ret = do_unpack(a, rar, buff, size, offset);
3290 if(ret != ARCHIVE_OK) {
3294 if(rar->file.bytes_remaining == 0 &&
3295 rar->cstate.last_write_ptr == rar->file.unpacked_size)
3297 /* If all bytes of current file were processed, run finalization.
3299 * Finalization will check checksum against proper values. If
3300 * some of the checksums will not match, we'll return an error
3301 * value in the last `archive_read_data` call to signal an error
3304 return verify_global_checksums(a);
3310 static int rar5_read_data_skip(struct archive_read *a) {
3311 struct rar5* rar = get_context(a);
3313 if(rar->main.solid) {
3314 /* In solid archives, instead of skipping the data, we need to extract
3315 * it, and dispose the result. The side effect of this operation will
3316 * be setting up the initial window buffer state needed to be able to
3317 * extract the selected file. */
3321 /* Make sure to process all blocks in the compressed stream. */
3322 while(rar->file.bytes_remaining > 0) {
3323 /* Setting the "skip mode" will allow us to skip checksum checks
3324 * during data skipping. Checking the checksum of skipped data
3325 * isn't really necessary and it's only slowing things down.
3327 * This is incremented instead of setting to 1 because this data
3328 * skipping function can be called recursively. */
3331 /* We're disposing 1 block of data, so we use triple NULLs in
3334 ret = rar5_read_data(a, NULL, NULL, NULL);
3336 /* Turn off "skip mode". */
3340 /* Propagate any potential error conditions to the caller. */
3345 /* In standard archives, we can just jump over the compressed stream.
3346 * Each file in non-solid archives starts from an empty window buffer.
3349 if(ARCHIVE_OK != consume(a, rar->file.bytes_remaining)) {
3350 return ARCHIVE_FATAL;
3353 rar->file.bytes_remaining = 0;
3359 static int64_t rar5_seek_data(struct archive_read *a, int64_t offset,
3366 /* We're a streaming unpacker, and we don't support seeking. */
3368 return ARCHIVE_FATAL;
3371 static int rar5_cleanup(struct archive_read *a) {
3372 struct rar5* rar = get_context(a);
3374 if(rar->cstate.window_buf)
3375 free(rar->cstate.window_buf);
3377 if(rar->cstate.filtered_buf)
3378 free(rar->cstate.filtered_buf);
3380 if(rar->vol.push_buf)
3381 free(rar->vol.push_buf);
3384 cdeque_free(&rar->cstate.filters);
3387 a->format->data = NULL;
3392 static int rar5_capabilities(struct archive_read * a) {
3397 static int rar5_has_encrypted_entries(struct archive_read *_a) {
3400 /* Unsupported for now. */
3401 return ARCHIVE_READ_FORMAT_ENCRYPTION_UNSUPPORTED;
3404 static int rar5_init(struct rar5* rar) {
3407 memset(rar, 0, sizeof(struct rar5));
3409 /* Decrypt the magic signature pattern. Check the comment near the
3410 * `rar5_signature` symbol to read the rationale behind this. */
3412 if(rar5_signature[0] == 243) {
3413 for(i = 0; i < rar5_signature_size; i++) {
3414 rar5_signature[i] ^= 0xA1;
3418 if(CDE_OK != cdeque_init(&rar->cstate.filters, 8192))
3419 return ARCHIVE_FATAL;
3424 int archive_read_support_format_rar5(struct archive *_a) {
3425 struct archive_read* ar;
3429 if(ARCHIVE_OK != (ret = get_archive_read(_a, &ar)))
3432 rar = malloc(sizeof(*rar));
3434 archive_set_error(&ar->archive, ENOMEM, "Can't allocate rar5 data");
3435 return ARCHIVE_FATAL;
3438 if(ARCHIVE_OK != rar5_init(rar)) {
3439 archive_set_error(&ar->archive, ENOMEM, "Can't allocate rar5 filter "
3441 return ARCHIVE_FATAL;
3444 ret = __archive_read_register_format(ar,
3451 rar5_read_data_skip,
3455 rar5_has_encrypted_entries);
3457 if(ret != ARCHIVE_OK) {
3458 (void) rar5_cleanup(ar);