|
1 | 1 | #include "ar.hpp"
|
2 | 2 |
|
3 |
| -#include "ar/bnk.hpp" |
4 |
| -#include "ar/wad.hpp" |
5 |
| -#include "ar/wpk.hpp" |
6 |
| - |
7 | 3 | using namespace rlib;
|
8 |
| -using namespace rlib::ar; |
9 | 4 |
|
10 |
| -auto ArSplit::operator()(IO const& io, offset_cb cb) const -> void { |
11 |
| - process(io, cb, 0, {.offset = 0, .size = io.size()}); |
| 5 | +auto Ar::operator()(IO const& io, offset_cb cb) const -> void { |
| 6 | + process(io, cb, {.offset = 0, .size = io.size(), .nest = true}); |
12 | 7 | }
|
13 | 8 |
|
14 |
| -template <typename T> |
15 |
| -auto ArSplit::process_ar(IO const& io, offset_cb cb, Entry top_entry) const -> void { |
16 |
| - auto archive = T{}; |
17 |
| - if (auto error = archive.read(io, top_entry.offset, top_entry.size)) rlib_error(error); |
18 |
| - |
19 |
| - // ensure offsets are processed in order |
20 |
| - std::sort(archive.entries.begin(), archive.entries.end(), [](auto const& lhs, auto const& rhs) { |
21 |
| - if (lhs.offset < rhs.offset) return true; |
22 |
| - if (lhs.offset == rhs.offset && lhs.size > rhs.size) return true; |
23 |
| - return false; |
24 |
| - }); |
25 |
| - |
26 |
| - auto cur = top_entry.offset; |
27 |
| - for (auto entry : archive.entries) { |
28 |
| - // skip empty entries |
29 |
| - if (!entry.size) continue; |
30 |
| - |
31 |
| - // skip duplicate or overlapping entries |
32 |
| - if (entry.offset < cur) { |
33 |
| - continue; |
34 |
| - } |
35 |
| - |
36 |
| - // process any skipped data |
37 |
| - if (auto leftover = entry.offset - cur) { |
38 |
| - process(io, cb, -1, {.offset = cur, .size = leftover, .compressed = top_entry.compressed}); |
39 |
| - } |
40 |
| - |
41 |
| - // process current entry |
42 |
| - process(io, |
43 |
| - cb, |
44 |
| - T::can_nest && !no_nest && !entry.compressed ? 1 : -1, |
45 |
| - { |
46 |
| - .offset = entry.offset, |
47 |
| - .size = entry.size, |
48 |
| - .compressed = entry.compressed, |
49 |
| - }); |
50 |
| - |
51 |
| - // go to next entry |
52 |
| - cur = entry.offset + entry.size; |
| 9 | +auto Ar::process_iter_next(IO const& io, |
| 10 | + offset_cb cb, |
| 11 | + Entry const& top_entry, |
| 12 | + std::size_t& cur, |
| 13 | + Entry const& entry) const -> void { |
| 14 | + // skip empty entries |
| 15 | + if (!entry.size) return; |
| 16 | + // skip duplicate or overlapping entries |
| 17 | + if (entry.offset < cur) return; |
| 18 | + // process any skipped data |
| 19 | + if (auto leftover = entry.offset - cur) { |
| 20 | + process(io, cb, {.offset = cur, .size = leftover, .compressed = top_entry.compressed}); |
| 21 | + cur += leftover; |
53 | 22 | }
|
| 23 | + // process current entry |
| 24 | + process(io, cb, entry); |
| 25 | + // go to next entry |
| 26 | + cur += entry.size; |
| 27 | +} |
54 | 28 |
|
55 |
| - // process any remaining data |
| 29 | +auto Ar::process_iter_end(IO const& io, offset_cb cb, Entry const& top_entry, std::size_t cur) const -> void { |
56 | 30 | if (auto remain = (top_entry.offset + top_entry.size) - cur) {
|
57 |
| - process(io, cb, -1, {.offset = cur, .size = remain, .compressed = top_entry.compressed}); |
| 31 | + process(io, cb, {.offset = cur, .size = remain, .compressed = top_entry.compressed}); |
58 | 32 | }
|
59 | 33 | }
|
60 | 34 |
|
61 |
| -auto ArSplit::process(IO const& io, offset_cb cb, int depth, Entry top_entry) const -> void { |
62 |
| - if (depth >= 0 && top_entry.size >= 64) { |
63 |
| - char buffer[8] = {}; |
64 |
| - rlib_assert(io.read(top_entry.offset, buffer)); |
65 |
| - if (!no_bnk && BNK::check_magic(buffer)) { |
66 |
| - return process_ar<BNK>(io, cb, top_entry); |
67 |
| - } |
68 |
| - if (!no_wad && depth < 1 && WAD::check_magic(buffer)) { |
69 |
| - return process_ar<WAD>(io, cb, top_entry); |
70 |
| - } |
71 |
| - if (!no_wpk && WPK::check_magic(buffer)) { |
72 |
| - return process_ar<WPK>(io, cb, top_entry); |
73 |
| - } |
| 35 | +auto Ar::process(IO const& io, offset_cb cb, Entry const& top_entry) const -> void { |
| 36 | + if (top_entry.nest && !no_wad && process_try_wad(io, cb, top_entry)) { |
| 37 | + return; |
| 38 | + } |
| 39 | + if (top_entry.nest && !no_wpk && process_try_wpk(io, cb, top_entry)) { |
| 40 | + return; |
| 41 | + } |
| 42 | + if (top_entry.nest && !no_zip && process_try_zip(io, cb, top_entry)) { |
| 43 | + return; |
74 | 44 | }
|
75 | 45 | for (auto i = top_entry.offset, remain = top_entry.size; remain;) {
|
76 | 46 | auto size = std::min(chunk_size, remain);
|
77 | 47 | cb({.offset = i, .size = size, .compressed = top_entry.compressed});
|
78 | 48 | i += size;
|
79 | 49 | remain -= size;
|
80 | 50 | }
|
| 51 | + return; |
81 | 52 | }
|
0 commit comments