2016-08-24 18:56:07 -07:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
#include <stdbool.h>
|
2017-06-24 13:47:11 -07:00
|
|
|
#include <getopt.h>
|
2016-08-24 18:56:07 -07:00
|
|
|
|
|
|
|
struct Frame {
|
|
|
|
uint8_t* data;
|
|
|
|
int size;
|
|
|
|
int bitmask;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct Frames {
|
|
|
|
struct Frame* frames;
|
|
|
|
int num_frames;
|
|
|
|
int frame_size;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct Bitmask {
|
|
|
|
uint8_t* data;
|
|
|
|
int bitlength;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct Bitmasks {
|
|
|
|
struct Bitmask* bitmasks;
|
|
|
|
int num_bitmasks;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
void make_frames(struct Frames* frames, struct Bitmasks* bitmasks, char* tilemap_filename, char* dimensions_filename);
|
2017-05-28 20:22:10 -07:00
|
|
|
int bitmask_exists(struct Bitmask *bitmask, struct Bitmasks *bitmasks);
|
|
|
|
void print_frames(struct Frames* frames);
|
2016-08-24 18:56:07 -07:00
|
|
|
|
|
|
|
|
|
|
|
void make_frames(struct Frames* frames, struct Bitmasks* bitmasks, char* tilemap_filename, char* dimensions_filename) {
|
|
|
|
uint8_t* tilemap;
|
|
|
|
uint8_t* this_frame;
|
|
|
|
FILE* f;
|
2017-12-27 22:25:25 -08:00
|
|
|
size_t size;
|
2016-08-24 18:56:07 -07:00
|
|
|
int width;
|
|
|
|
int height;
|
|
|
|
uint8_t byte;
|
|
|
|
int frame_size;
|
|
|
|
int num_frames;
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
f = fopen(tilemap_filename, "rb");
|
|
|
|
if (f == NULL) {
|
2017-12-27 22:25:25 -08:00
|
|
|
fprintf(stderr, "could not open file %s\n", tilemap_filename);
|
2016-08-24 18:56:07 -07:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
fseek(f, 0, SEEK_END);
|
|
|
|
size = ftell(f);
|
2017-06-29 21:45:30 -07:00
|
|
|
if (!size) {
|
|
|
|
fprintf(stderr, "empty file %s\n", tilemap_filename);
|
|
|
|
exit(1);
|
|
|
|
}
|
2016-08-24 18:56:07 -07:00
|
|
|
rewind(f);
|
|
|
|
|
|
|
|
tilemap = malloc(size);
|
2017-06-29 21:45:30 -07:00
|
|
|
if (!tilemap) {
|
|
|
|
fprintf(stderr, "malloc failure\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
2017-12-27 22:25:25 -08:00
|
|
|
if (size != fread(tilemap, 1, size, f)) {
|
|
|
|
fprintf(stderr, "failed to read file %s\n", tilemap_filename);
|
|
|
|
exit(1);
|
|
|
|
}
|
2016-08-24 18:56:07 -07:00
|
|
|
fclose(f);
|
|
|
|
|
|
|
|
f = fopen(dimensions_filename, "rb");
|
|
|
|
if (f == NULL) {
|
2017-12-27 22:25:25 -08:00
|
|
|
fprintf(stderr, "could not open file %s\n", dimensions_filename);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
if (1 != fread(&byte, 1, 1, f)) {
|
|
|
|
fprintf(stderr, "failed to read file %s\n", dimensions_filename);
|
2016-08-24 18:56:07 -07:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
fclose(f);
|
|
|
|
|
|
|
|
width = byte & 0xf;
|
|
|
|
height = byte >> 4;
|
|
|
|
|
|
|
|
frame_size = width * height;
|
|
|
|
|
|
|
|
num_frames = size / frame_size - 1;
|
|
|
|
//fprintf(stderr, "num_frames: %d\n", num_frames);
|
|
|
|
|
2017-05-28 20:22:10 -07:00
|
|
|
bitmasks->bitmasks = malloc((sizeof (struct Bitmask)) * num_frames);
|
2016-08-24 18:56:07 -07:00
|
|
|
bitmasks->num_bitmasks = 0;
|
|
|
|
|
2017-05-28 20:22:10 -07:00
|
|
|
frames->frames = malloc((sizeof (struct Frame)) * num_frames);
|
2016-08-24 18:56:07 -07:00
|
|
|
frames->frame_size = frame_size;
|
|
|
|
frames->num_frames = 0;
|
|
|
|
|
2017-05-28 20:22:10 -07:00
|
|
|
uint8_t *first_frame = tilemap;
|
2016-08-24 18:56:07 -07:00
|
|
|
this_frame = tilemap + frame_size;
|
|
|
|
for (i = 0; i < num_frames; i++) {
|
2017-05-28 20:22:10 -07:00
|
|
|
struct Frame *frame = (struct Frame*)malloc(sizeof(struct Frame));
|
2016-08-24 18:56:07 -07:00
|
|
|
frame->data = malloc(frame_size);
|
|
|
|
frame->size = 0;
|
2017-05-28 20:22:10 -07:00
|
|
|
struct Bitmask *bitmask = (struct Bitmask*)malloc(sizeof(struct Bitmask));
|
|
|
|
bitmask->data = calloc((frame_size + 7) / 8, 1);
|
2016-08-24 18:56:07 -07:00
|
|
|
bitmask->bitlength = 0;
|
|
|
|
for (j = 0; j < frame_size; j++) {
|
2017-05-28 20:22:10 -07:00
|
|
|
if (bitmask->bitlength % 8 == 0) {
|
|
|
|
bitmask->data[bitmask->bitlength / 8] = 0;
|
|
|
|
}
|
|
|
|
bitmask->data[bitmask->bitlength / 8] >>= 1;
|
|
|
|
if (this_frame[j] != first_frame[j]) {
|
2016-08-24 18:56:07 -07:00
|
|
|
frame->data[frame->size] = this_frame[j];
|
|
|
|
frame->size++;
|
2017-05-28 20:22:10 -07:00
|
|
|
bitmask->data[bitmask->bitlength / 8] |= (1 << 7);
|
2016-08-24 18:56:07 -07:00
|
|
|
}
|
|
|
|
bitmask->bitlength++;
|
|
|
|
}
|
2017-05-28 20:22:10 -07:00
|
|
|
// I don't remember exactly why this works.
|
|
|
|
// I think it was that the bits are read backwards, but not indexed backwards.
|
|
|
|
int last = bitmask->bitlength - 1;
|
|
|
|
bitmask->data[last / 8] >>= (7 - (last % 8));
|
|
|
|
|
|
|
|
frame->bitmask = bitmask_exists(bitmask, bitmasks);
|
2016-08-24 18:56:07 -07:00
|
|
|
if (frame->bitmask == -1) {
|
|
|
|
frame->bitmask = bitmasks->num_bitmasks;
|
|
|
|
bitmasks->bitmasks[bitmasks->num_bitmasks] = *bitmask;
|
|
|
|
bitmasks->num_bitmasks++;
|
|
|
|
} else {
|
|
|
|
free(bitmask->data);
|
|
|
|
free(bitmask);
|
|
|
|
}
|
|
|
|
frames->frames[i] = *frame;
|
|
|
|
frames->num_frames++;
|
|
|
|
this_frame += frame_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
//for (i = 0; i < frames->num_frames; i++) {
|
|
|
|
//free(frames->frames[i].data);
|
|
|
|
//free(frames->frames[i]);
|
|
|
|
//}
|
|
|
|
//free(frames->frames);
|
|
|
|
|
2017-12-27 22:25:25 -08:00
|
|
|
//fprintf(stderr, "num bitmasks: %d\n", bitmasks->num_bitmasks);
|
2016-08-24 18:56:07 -07:00
|
|
|
//for (i = 0; i < bitmasks->num_bitmasks; i++) {
|
|
|
|
// free(bitmasks->bitmasks[i].data);
|
|
|
|
// fprintf(stderr, "freed bitmask %d\n", i);
|
|
|
|
//free(bitmasks->bitmasks[i]);
|
|
|
|
//}
|
|
|
|
//free(bitmasks->bitmasks);
|
|
|
|
//fprintf(stderr, "freed bitmasks\n");
|
|
|
|
|
|
|
|
free(tilemap);
|
|
|
|
}
|
|
|
|
|
2017-05-28 20:22:10 -07:00
|
|
|
int bitmask_exists(struct Bitmask *bitmask, struct Bitmasks *bitmasks) {
|
2016-08-24 18:56:07 -07:00
|
|
|
int i, j;
|
|
|
|
struct Bitmask existing;
|
2017-05-28 20:22:10 -07:00
|
|
|
for (i = 0; i < bitmasks->num_bitmasks; i++) {
|
|
|
|
existing = bitmasks->bitmasks[i];
|
|
|
|
if (bitmask->bitlength != existing.bitlength) {
|
2016-08-24 18:56:07 -07:00
|
|
|
continue;
|
|
|
|
}
|
2017-05-28 20:22:10 -07:00
|
|
|
bool match = true;
|
|
|
|
for (j = 0; j < (bitmask->bitlength + 7) / 8; j++) {
|
|
|
|
if (bitmask->data[j] != existing.data[j]) {
|
|
|
|
match = false;
|
2016-08-24 18:56:07 -07:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2017-05-28 20:22:10 -07:00
|
|
|
if (match) {
|
2016-08-24 18:56:07 -07:00
|
|
|
return i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
void print_frames(struct Frames* frames) {
|
|
|
|
int i;
|
|
|
|
int j;
|
|
|
|
for (i = 0; i < frames->num_frames; i++) {
|
|
|
|
printf("\tdw .frame%d\n", i + 1);
|
|
|
|
}
|
|
|
|
for (i = 0; i < frames->num_frames; i++) {
|
2017-05-28 20:22:10 -07:00
|
|
|
struct Frame *frame = &frames->frames[i];
|
2016-08-24 18:56:07 -07:00
|
|
|
printf(".frame%d\n", i + 1);
|
2017-05-28 20:22:10 -07:00
|
|
|
printf("\tdb $%02x ; bitmask\n", frame->bitmask);
|
|
|
|
if (frame->size > 0) {
|
|
|
|
for (j = 0; j < frame->size; j++) {
|
|
|
|
if (j % 12 == 0) {
|
|
|
|
if (j) {
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
printf("\tdb $%02x", frame->data[j]);
|
|
|
|
} else {
|
|
|
|
printf(", $%02x", frame->data[j]);
|
|
|
|
}
|
2016-08-24 18:56:07 -07:00
|
|
|
}
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void print_bitmasks(struct Bitmasks* bitmasks) {
|
|
|
|
int i, j, k;
|
|
|
|
int length;
|
|
|
|
struct Bitmask bitmask;
|
|
|
|
for (i = 0; i < bitmasks->num_bitmasks; i++) {
|
|
|
|
printf("; %d\n", i);
|
|
|
|
bitmask = bitmasks->bitmasks[i];
|
|
|
|
length = (bitmask.bitlength + 7) / 8;
|
|
|
|
for (j = 0; j < length; j++) {
|
|
|
|
printf("\tdb %%");
|
|
|
|
for (k = 0; k < 8; k++) {
|
|
|
|
if ((bitmask.data[j] >> (7 - k)) & 1) {
|
|
|
|
printf("1");
|
|
|
|
} else {
|
|
|
|
printf("0");
|
|
|
|
};
|
|
|
|
}
|
|
|
|
printf("\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// HOW ARE YOU GENTLEMEN.
|
|
|
|
char* cats (char* head, char* tail) {
|
|
|
|
char* string;
|
|
|
|
string = malloc(strlen(head) + strlen(tail) + 1);
|
|
|
|
strcpy(string, head);
|
|
|
|
strcat(string, tail);
|
|
|
|
return string;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void usage(void) {
|
|
|
|
printf("Usage: pokemon_animation [-b] [-f] tilemap_file dimensions_file\n");
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
int main(int argc, char* argv[]) {
|
|
|
|
struct Frames frames = {0};
|
|
|
|
struct Bitmasks bitmasks = {0};
|
|
|
|
int ch;
|
2017-06-24 23:49:57 -07:00
|
|
|
bool use_bitmasks = false, use_frames = false;
|
2016-08-24 18:56:07 -07:00
|
|
|
char* tilemap_filename;
|
|
|
|
char* dimensions_filename;
|
|
|
|
|
|
|
|
while ((ch = getopt(argc, argv, "bf")) != -1) {
|
|
|
|
switch (ch) {
|
|
|
|
case 'b':
|
|
|
|
use_bitmasks = true;
|
|
|
|
break;
|
|
|
|
case 'f':
|
|
|
|
use_frames = true;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
usage();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
argc -= optind;
|
|
|
|
argv += optind;
|
|
|
|
if (argc < 2) {
|
|
|
|
usage();
|
|
|
|
}
|
|
|
|
tilemap_filename = argv[0];
|
|
|
|
dimensions_filename = argv[1];
|
|
|
|
|
|
|
|
//ext = strrchr(argv[3], '.');
|
|
|
|
//if (!ext || ext == argv[3]) {
|
2017-12-27 22:25:25 -08:00
|
|
|
// fprintf(stderr, "need a file extension to determine what to write to %s\n", argv[3]);
|
2016-08-24 18:56:07 -07:00
|
|
|
//}
|
|
|
|
|
|
|
|
make_frames(&frames, &bitmasks, tilemap_filename, dimensions_filename);
|
|
|
|
if (use_frames) {
|
|
|
|
print_frames(&frames);
|
|
|
|
}
|
|
|
|
if (use_bitmasks) {
|
|
|
|
print_bitmasks(&bitmasks);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|