More twiddling work

This commit is contained in:
Luke Benstead 2023-09-10 19:41:25 +01:00
parent 3308a57e59
commit 61e5a7a2a6
4 changed files with 66 additions and 8 deletions

View File

@ -75,16 +75,70 @@ static const unsigned short MortonTable256[256] =
};
static struct TwiddleTable {
int32_t width;
int32_t height;
int32_t* table;
} TWIDDLE_TABLE = {0, 0, NULL};
int32_t twiddle_recurse(int32_t* table, int32_t stride, int32_t x, int32_t y, int32_t block_size, int32_t idx) {
int32_t prev_idx = idx;
if(block_size == 1) {
table[idx++] = y * stride + x;
} else {
block_size = block_size >> 1;
idx += twiddle_recurse(table, stride, x, y, block_size, idx);
idx += twiddle_recurse(table, stride, x, y + block_size, block_size, idx);
idx += twiddle_recurse(table, stride, x + block_size, y, block_size, idx);
idx += twiddle_recurse(table, stride, x + block_size, y + block_size, block_size, idx);
}
return (idx - prev_idx);
}
void build_twiddle_table(int32_t* table, int32_t w, int32_t h) {
free(TWIDDLE_TABLE.table);
TWIDDLE_TABLE.table = (int32_t*) malloc(w * h * sizeof(int32_t));
TWIDDLE_TABLE.width = w;
TWIDDLE_TABLE.height = h;
int32_t idx = 0;
if(w < h) {
for(int32_t i = 0; i < h; i += w) {
idx += twiddle_recurse(table, w, 0, i, w, idx);
}
} else {
for(int32_t i = 0; i < w; i += h) {
idx += twiddle_recurse(table, w, i, 0, h, idx);
}
}
}
/* Given a 0-based texel location, and an image width/height. Return the
* new 0-based texel location */
GL_FORCE_INLINE uint32_t twid_location(uint32_t i, uint32_t w, uint32_t h) {
uint16_t y = i / w;
uint16_t x = i % w;
if(TWIDDLE_TABLE.width != w || TWIDDLE_TABLE.height != h || !TWIDDLE_TABLE.table) {
build_twiddle_table(TWIDDLE_TABLE.table, w, h);
}
return MortonTable256[y >> 8] << 17 |
MortonTable256[x >> 8] << 16 |
MortonTable256[y & 0xFF] << 1 |
MortonTable256[x & 0xFF];
uint32_t ret = TWIDDLE_TABLE.table[i];
fprintf(stderr, "%d -> %d\n", i, ret);
return ret;
// uint32_t x = i % w;
// uint32_t y = i / w;
// uint32_t ret = MortonTable256[y >> 8] << 17 |
// MortonTable256[x >> 8] << 16 |
// MortonTable256[y & 0xFF] << 1 |
// MortonTable256[x & 0xFF];
// uint32_t min = (w < h) ? w : h;
// uint32_t r = (x / min + y / min) * min * min / 2;
// return ret + r;
}
@ -1024,6 +1078,8 @@ static GLuint _determinePVRFormat(GLint internalFormat) {
/* Given a cleaned internalFormat, return the Dreamcast format
* that can hold it
*/
fprintf(stderr, "Internal format -> 0x%x\n", internalFormat);
switch(internalFormat) {
case GL_RGB565_KOS:
return GPU_TXRFMT_RGB565 | GPU_TXRFMT_NONTWIDDLED;

View File

@ -53,7 +53,7 @@ void LoadGLTextures() {
// 2d texture, level of detail 0 (normal), 3 components (red, green, blue), x size from image, y size from image,
// border 0 (normal), rgb color data, unsigned byte data, and finally the data itself.
glTexImage2D(GL_TEXTURE_2D, 0, 3, image1->sizeX, image1->sizeY, 0, GL_RGB, GL_UNSIGNED_BYTE, image1->data);
glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, image1->sizeX, image1->sizeY, 0, GL_RGB, GL_UNSIGNED_BYTE, image1->data);
free(image1);
}

Binary file not shown.

Before

Width:  |  Height:  |  Size: 192 KiB

After

Width:  |  Height:  |  Size: 522 B

View File

@ -281,6 +281,8 @@ int BMP_GetPalette(FILE *pFile)
}
return 1;
}
fprintf(stderr, "BitCount: %d\n", BmpInfoHeader.BitCount);
return 0;
}
@ -346,7 +348,7 @@ int LoadPalettedBMP(const char* filename, Image* image)
}
if (!BMP_GetPalette(fp)) {
printf("Only 16c BMP are supported for this sample");
printf("Only 16c BMP are supported for this sample\n");
return 0;
}