mirror of https://github.com/bsnes-emu/bsnes.git
196 lines
6.3 KiB
C++
Executable File
196 lines
6.3 KiB
C++
Executable File
//HQ2x filter
|
|
//authors: byuu and blargg
|
|
//license: public domain
|
|
//
|
|
//note: this is a clean reimplementation of the original HQ2x filter, which was
|
|
//written by Maxim Stepin (MaxSt). it is not 100% identical, but very similar.
|
|
|
|
#include "hq2x.hpp"
|
|
|
|
void HQ2xFilter::size(unsigned &outwidth, unsigned &outheight, unsigned width, unsigned height) {
|
|
if(width > 256 || height > 240) return filter_direct.size(outwidth, outheight, width, height);
|
|
outwidth = width * 2;
|
|
outheight = height * 2;
|
|
}
|
|
|
|
void HQ2xFilter::render(
|
|
uint32_t *output, unsigned outpitch,
|
|
const uint16_t *input, unsigned pitch, unsigned width, unsigned height
|
|
) {
|
|
if(width > 256 || height > 240) {
|
|
filter_direct.render(output, outpitch, input, pitch, width, height);
|
|
return;
|
|
}
|
|
|
|
pitch >>= 1;
|
|
outpitch >>= 2;
|
|
|
|
#pragma omp parallel for
|
|
for(unsigned y = 0; y < height; y++) {
|
|
const uint16_t *in = input + y * pitch;
|
|
uint32_t *out0 = output + y * outpitch * 2;
|
|
uint32_t *out1 = output + y * outpitch * 2 + outpitch;
|
|
|
|
int prevline = (y == 0 ? 0 : pitch);
|
|
int nextline = (y == height - 1 ? 0 : pitch);
|
|
|
|
in++;
|
|
*out0++ = 0; *out0++ = 0;
|
|
*out1++ = 0; *out1++ = 0;
|
|
|
|
for(unsigned x = 1; x < 256 - 1; x++) {
|
|
uint16_t A = *(in - prevline - 1);
|
|
uint16_t B = *(in - prevline + 0);
|
|
uint16_t C = *(in - prevline + 1);
|
|
uint16_t D = *(in - 1);
|
|
uint16_t E = *(in + 0);
|
|
uint16_t F = *(in + 1);
|
|
uint16_t G = *(in + nextline - 1);
|
|
uint16_t H = *(in + nextline + 0);
|
|
uint16_t I = *(in + nextline + 1);
|
|
uint32_t e = yuvTable[E] + diff_offset;
|
|
|
|
uint8_t pattern;
|
|
pattern = diff(e, A) << 0;
|
|
pattern |= diff(e, B) << 1;
|
|
pattern |= diff(e, C) << 2;
|
|
pattern |= diff(e, D) << 3;
|
|
pattern |= diff(e, F) << 4;
|
|
pattern |= diff(e, G) << 5;
|
|
pattern |= diff(e, H) << 6;
|
|
pattern |= diff(e, I) << 7;
|
|
|
|
*(out0 + 0) = colortable[blend(hqTable[pattern], E, A, B, D, F, H)]; pattern = rotate[pattern];
|
|
*(out0 + 1) = colortable[blend(hqTable[pattern], E, C, F, B, H, D)]; pattern = rotate[pattern];
|
|
*(out1 + 1) = colortable[blend(hqTable[pattern], E, I, H, F, D, B)]; pattern = rotate[pattern];
|
|
*(out1 + 0) = colortable[blend(hqTable[pattern], E, G, D, H, B, F)];
|
|
|
|
in++;
|
|
out0 += 2;
|
|
out1 += 2;
|
|
}
|
|
|
|
in++;
|
|
*out0++ = 0; *out0++ = 0;
|
|
*out1++ = 0; *out1++ = 0;
|
|
}
|
|
}
|
|
|
|
HQ2xFilter::HQ2xFilter() {
|
|
yuvTable = new uint32_t[32768];
|
|
|
|
for(unsigned i = 0; i < 32768; i++) {
|
|
uint8_t R = (i >> 0) & 31;
|
|
uint8_t G = (i >> 5) & 31;
|
|
uint8_t B = (i >> 10) & 31;
|
|
|
|
//bgr555->bgr888
|
|
double r = (R << 3) | (R >> 2);
|
|
double g = (G << 3) | (G >> 2);
|
|
double b = (B << 3) | (B >> 2);
|
|
|
|
//bgr888->yuv888
|
|
double y = (r + g + b) * (0.25f * (63.5f / 48.0f));
|
|
double u = ((r - b) * 0.25f + 128.0f) * (7.5f / 7.0f);
|
|
double v = ((g * 2.0f - r - b) * 0.125f + 128.0f) * (7.5f / 6.0f);
|
|
|
|
yuvTable[i] = ((unsigned)y << 21) + ((unsigned)u << 11) + ((unsigned)v);
|
|
}
|
|
|
|
for(unsigned n = 0; n < 256; n++) {
|
|
rotate[n] = ((n >> 2) & 0x11) | ((n << 2) & 0x88)
|
|
| ((n & 0x01) << 5) | ((n & 0x08) << 3)
|
|
| ((n & 0x10) >> 3) | ((n & 0x80) >> 5);
|
|
}
|
|
}
|
|
|
|
HQ2xFilter::~HQ2xFilter() {
|
|
delete[] yuvTable;
|
|
}
|
|
|
|
bool HQ2xFilter::same(uint16_t x, uint16_t y) {
|
|
return !((yuvTable[x] - yuvTable[y] + diff_offset) & diff_mask);
|
|
}
|
|
|
|
bool HQ2xFilter::diff(uint32_t x, uint16_t y) {
|
|
return ((x - yuvTable[y]) & diff_mask);
|
|
}
|
|
|
|
void HQ2xFilter::grow(uint32_t &n) { n |= n << 16; n &= 0x03e07c1f; }
|
|
uint16_t HQ2xFilter::pack(uint32_t n) { n &= 0x03e07c1f; return n | (n >> 16); }
|
|
|
|
uint16_t HQ2xFilter::blend1(uint32_t A, uint32_t B) {
|
|
grow(A); grow(B);
|
|
A = (A * 3 + B) >> 2;
|
|
return pack(A);
|
|
}
|
|
|
|
uint16_t HQ2xFilter::blend2(uint32_t A, uint32_t B, uint32_t C) {
|
|
grow(A); grow(B); grow(C);
|
|
return pack((A * 2 + B + C) >> 2);
|
|
}
|
|
|
|
uint16_t HQ2xFilter::blend3(uint32_t A, uint32_t B, uint32_t C) {
|
|
grow(A); grow(B); grow(C);
|
|
return pack((A * 5 + B * 2 + C) >> 3);
|
|
}
|
|
|
|
uint16_t HQ2xFilter::blend4(uint32_t A, uint32_t B, uint32_t C) {
|
|
grow(A); grow(B); grow(C);
|
|
return pack((A * 6 + B + C) >> 3);
|
|
}
|
|
|
|
uint16_t HQ2xFilter::blend5(uint32_t A, uint32_t B, uint32_t C) {
|
|
grow(A); grow(B); grow(C);
|
|
return pack((A * 2 + (B + C) * 3) >> 3);
|
|
}
|
|
|
|
uint16_t HQ2xFilter::blend6(uint32_t A, uint32_t B, uint32_t C) {
|
|
grow(A); grow(B); grow(C);
|
|
return pack((A * 14 + B + C) >> 4);
|
|
}
|
|
|
|
uint16_t HQ2xFilter::blend(unsigned rule, uint16_t E, uint16_t A, uint16_t B, uint16_t D, uint16_t F, uint16_t H) {
|
|
switch(rule) { default:
|
|
case 0: return E;
|
|
case 1: return blend1(E, A);
|
|
case 2: return blend1(E, D);
|
|
case 3: return blend1(E, B);
|
|
case 4: return blend2(E, D, B);
|
|
case 5: return blend2(E, A, B);
|
|
case 6: return blend2(E, A, D);
|
|
case 7: return blend3(E, B, D);
|
|
case 8: return blend3(E, D, B);
|
|
case 9: return blend4(E, D, B);
|
|
case 10: return blend5(E, D, B);
|
|
case 11: return blend6(E, D, B);
|
|
case 12: return same(B, D) ? blend2(E, D, B) : E;
|
|
case 13: return same(B, D) ? blend5(E, D, B) : E;
|
|
case 14: return same(B, D) ? blend6(E, D, B) : E;
|
|
case 15: return same(B, D) ? blend2(E, D, B) : blend1(E, A);
|
|
case 16: return same(B, D) ? blend4(E, D, B) : blend1(E, A);
|
|
case 17: return same(B, D) ? blend5(E, D, B) : blend1(E, A);
|
|
case 18: return same(B, F) ? blend3(E, B, D) : blend1(E, D);
|
|
case 19: return same(D, H) ? blend3(E, D, B) : blend1(E, B);
|
|
}
|
|
}
|
|
|
|
const uint8_t HQ2xFilter::hqTable[256] = {
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 15, 12, 5, 3, 17, 13,
|
|
4, 4, 6, 18, 4, 4, 6, 18, 5, 3, 12, 12, 5, 3, 1, 12,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 17, 13, 5, 3, 16, 14,
|
|
4, 4, 6, 18, 4, 4, 6, 18, 5, 3, 16, 12, 5, 3, 1, 14,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 19, 12, 12, 5, 19, 16, 12,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 16, 12, 5, 3, 16, 12,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 19, 1, 12, 5, 19, 1, 14,
|
|
4, 4, 6, 2, 4, 4, 6, 18, 5, 3, 16, 12, 5, 19, 1, 14,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 15, 12, 5, 3, 17, 13,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 16, 12, 5, 3, 16, 12,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 17, 13, 5, 3, 16, 14,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 16, 13, 5, 3, 1, 14,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 16, 12, 5, 3, 16, 13,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 16, 12, 5, 3, 1, 12,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 16, 12, 5, 3, 1, 14,
|
|
4, 4, 6, 2, 4, 4, 6, 2, 5, 3, 1, 12, 5, 3, 1, 14,
|
|
};
|