27 assert(bpp >= 1 && bpp <= 8);
28 unsigned int bpp_pos[8];
29 for (
int row = 0; row < 8; row++) {
30 for (
int col = 0; col < 8; col++) {
32 tile.
data[row * 8 + col] = (data[offset + row] >> (7 - col)) & 0x01;
39 bpp_pos[0] = offset + row * 2;
40 bpp_pos[1] = offset + row * 2 + 1;
41 char mask = 1 << (7 - col);
42 tile.
data[row * 8 + col] = (data[bpp_pos[0]] & mask) ? 1 : 0;
43 tile.
data[row * 8 + col] |= ((data[bpp_pos[1]] & mask) ? 1 : 0) << 1;
47 bpp_pos[2] = offset + 16 + row;
48 tile.
data[row * 8 + col] |= ((data[bpp_pos[2]] & mask) ? 1 : 0) << 2;
53 bpp_pos[2] = offset + 16 + row * 2;
54 bpp_pos[3] = offset + 16 + row * 2 + 1;
55 tile.
data[row * 8 + col] |= ((data[bpp_pos[2]] & mask) ? 1 : 0) << 2;
56 tile.
data[row * 8 + col] |= ((data[bpp_pos[3]] & mask) ? 1 : 0) << 3;
59 bpp_pos[4] = offset + 32 + row * 2;
60 bpp_pos[5] = offset + 32 + row * 2 + 1;
61 bpp_pos[6] = offset + 48 + row * 2;
62 bpp_pos[7] = offset + 48 + row * 2 + 1;
63 tile.
data[row * 8 + col] |= ((data[bpp_pos[4]] & mask) ? 1 : 0) << 4;
64 tile.
data[row * 8 + col] |= ((data[bpp_pos[5]] & mask) ? 1 : 0) << 5;
65 tile.
data[row * 8 + col] |= ((data[bpp_pos[6]] & mask) ? 1 : 0) << 6;
66 tile.
data[row * 8 + col] |= ((data[bpp_pos[7]] & mask) ? 1 : 0) << 7;
75 std::vector<uint8_t> output(bpp * 8, 0);
76 unsigned maxcolor = 1 << bpp;
79 for (
unsigned int row = 0; row < 8; row++) {
80 for (
unsigned int col = 0; col < 8; col++) {
81 uint8_t color = tile.
data[row * 8 + col];
82 if (color >= maxcolor) {
83 throw std::invalid_argument(
"Invalid color value.");
88 output[row] += (uint8_t)((color & 1) << (7 - col));
92 output[row * 2] += ((color & 1) << (7 - col));
93 output[row * 2 + 1] += (((color & 2) == 2) << (7 - col));
98 output[16 + row] += (((color & 4) == 4) << (7 - col));
102 output[16 + row * 2] += (((color & 4) == 4) << (7 - col));
103 output[16 + row * 2 + 1] += (((color & 8) == 8) << (7 - col));
108 output[32 + row * 2] += (((color & 16) == 16) << (7 - col));
109 output[32 + row * 2 + 1] += (((color & 32) == 32) << (7 - col));
110 output[48 + row * 2] += (((color & 64) == 64) << (7 - col));
111 output[48 + row * 2 + 1] += (((color & 128) == 128) << (7 - col));
118std::vector<uint8_t>
ConvertBpp(std::span<uint8_t> tiles, uint32_t from_bpp,
120 unsigned int nb_tile = tiles.size() / (from_bpp * 8);
121 std::vector<uint8_t> converted(nb_tile * to_bpp * 8);
123 for (
unsigned int i = 0; i < nb_tile; i++) {
125 std::vector<uint8_t> packed_tile =
PackBppTile(tile, to_bpp);
126 std::memcpy(converted.data() + i * to_bpp * 8, packed_tile.data(),
139 int buffer_size = 0x1000;
144 buffer_size = 0x2000;
145 }
else if (bpp == 3) {
147 }
else if (bpp == 4) {
149 buffer_size = 0x4000;
150 }
else if (bpp == 8) {
154 if (num_sheets != 1) {
155 num_tiles *= num_sheets;
156 buffer_size *= num_sheets;
160 if (
static_cast<size_t>(num_tiles * bpp) > sheet.size()) {
164 num_tiles =
static_cast<int>(sheet.size()) / bpp;
170 std::vector<uint8_t> sheet_buffer_out(buffer_size);
172 for (
int i = 0; i < num_tiles; i++) {
173 for (
int y = 0; y < 8; y++) {
174 for (
int x = 0; x < 8; x++) {
185 if (b3 != 0 && bpp != 16) {
188 sheet_buffer_out[x + xx + (y * 128) + (yy * 1024)] = b;
200 return sheet_buffer_out;
210 const int default_tile_rows = (bpp == 2) ? 8 : 4;
211 const int computed_tile_rows =
213 const int tile_rows = (computed_tile_rows > 0)
214 ? std::max(default_tile_rows, computed_tile_rows)
216 const int tiles_per_sheet = tiles_per_row * tile_rows;
217 const int total_tiles = tiles_per_sheet * num_sheets;
218 const int bytes_per_tile = bpp * 8;
219 const uint8_t max_color =
220 static_cast<uint8_t
>((1u <<
static_cast<uint8_t
>(bpp)) - 1u);
222 std::vector<uint8_t> output(total_tiles * bytes_per_tile, 0);
229 for (
int i = 0; i < total_tiles; i++) {
232 for (
int y = 0; y < 8; y++) {
233 for (
int x = 0; x < 8; x++) {
236 if (index >= 0 && index <
static_cast<int>(sheet.size())) {
237 tile.
data[y * 8 + x] = sheet[index] & max_color;
243 std::copy(packed_tile.begin(), packed_tile.end(),
244 output.begin() + (pos * bytes_per_tile));
249 if (ypos >= tiles_per_row) {
272 auto buffer = std::vector<uint8_t>(data.size());
273 std::vector<std::vector<uint8_t>> bitmap_data;
274 bitmap_data.resize(0x80);
275 for (
auto& each : bitmap_data) {
282 const uint16_t sheet_width = 128;
288 for (
int i = 0; i < 4096; i++) {
290 for (
int y = 0; y < 8; y++) {
292 for (
int x = 0; x < 8; x++) {
293 const uint16_t bitmask[] = {0x80, 0x40, 0x20, 0x10,
294 0x08, 0x04, 0x02, 0x01};
295 auto b1 = (data[(y * 2) + ((bpp * 8) * pos)] & (bitmask[x]));
296 auto b2 = (data[((y * 2) + ((bpp * 8) * pos)) + 1] & (bitmask[x]));
297 auto b3 = (data[(y * 2) + ((bpp * 8) * pos) + 16] & (bitmask[x]));
298 auto b4 = (data[(y * 2) + ((bpp * 8) * pos) + 17] & (bitmask[x]));
299 auto b5 = (data[(y * 2) + ((bpp * 8) * pos) + 32] & (bitmask[x]));
300 auto b6 = (data[(y * 2) + ((bpp * 8) * pos) + 33] & (bitmask[x]));
301 auto b7 = (data[(y * 2) + ((bpp * 8) * pos) + 48] & (bitmask[x]));
302 auto b8 = (data[(y * 2) + ((bpp * 8) * pos) + 49] & (bitmask[x]));
334 bitmap_data[x + xx][y + (yy * 8)] = b;
349 for (
int y = 0; y < (data.size() / 64); y++) {
350 for (
int x = 0; x < sheet_width; x++) {
351 if (n < data.size()) {
353 buffer[n] = bitmap_data[x][y];
380 uint16_t
id = word & 0x3FF;
383 bool vertical_mirror = (word >> 15) & 0x01;
384 bool horizontal_mirror = (word >> 14) & 0x01;
385 bool over = (word >> 13) & 0x01;
388 uint8_t palette = (word >> 10) & 0x07;
390 return TileInfo(
id, palette, vertical_mirror, horizontal_mirror, over);
437 std::vector<uint8_t>& blockset) {
439 ((tile - ((tile / 0x08) * 0x08)) * 0x10) + ((tile / 0x08) * 2048);
440 int dest_pos = (x + (y * 0x200));
441 for (
int yy = 0; yy < 0x10; yy++) {
442 for (
int xx = 0; xx < 0x10; xx++) {
443 bitmap[dest_pos + xx + (yy * 0x200)] =
444 blockset[src_pos + xx + (yy * 0x80)];
450 std::span<uint8_t> src) {
451 std::vector<uint8_t> dest;
463 int main_index_limit = src.size() / 32;
464 for (
int main_index = 0; main_index <= main_index_limit; main_index += 32) {
465 src_index = (main_index << 5);
466 if (src_index + 31 >= src.size()) {
467 throw std::invalid_argument(
"src_index + 31 >= src.size()");
469 dest_x = main_index & 0x0F;
470 dest_y = main_index >> 4;
471 dest_index = ((dest_y << 7) + dest_x) << 3;
472 if (dest_index + 903 >= dest.size()) {
473 throw std::invalid_argument(
"dest_index + 903 >= dest.size()");
475 for (
int i = 0; i < 16; i += 2) {
477 b0 = src[src_index + i];
478 b1 = src[src_index + i + 1];
479 b2 = src[src_index + i + 16];
480 b3 = src[src_index + i + 17];
481 for (
int j = 0; j < 8; j++) {
482 res = ((b0 & mul) | ((b1 & mul) << 1) | ((b2 & mul) << 2) |
483 ((b3 & mul) << 3)) >>
485 dest[dest_index + (7 - j) + y_adder] = res;