Intravision/reactos
1
0
Fork 0
mirror of https://github.com/reactos/reactos.git synced 2024-05-30 17:21:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

Replace our dxtn.dll by a version based on the libtxc_dxtn source code (#203)

Browse source 
This is no official system DLL and WineD3D is its only user. But latest WineD3D prefers the libtxc_dxtn codebase instead of the alternative library we used.
This is also what Mesa uses and Fedora ships now that the patents have expired, so we should stick to the same.

I'm importing the libtxc_dxtn-1.0.1 codebase from https://people.freedesktop.org/~cbrill/libtxc_dxtn/
It compiles warning-free in our tree without modifying a single line!

I'm merging this Pull Request based on the positive response in CORE-12759.
I lack a proper test case myself, but my version at least shouldn't make things worse. In my opinion, the previous one was broken anyway due to using stdcall imports when WineD3D called cdecl ones.

This also removes the NSWPAT option from our buildsystem as dxtn was its latest user.
This commit is contained in:
Colin Finck 2017-12-20 11:15:13 +01:00 committed by GitHub
parent 84c26953e4
commit 12b78f182d
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
16 changed files with 1118 additions and 2556 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
dll/3rdparty/CMakeLists.txt vendored
View file

@ -1,8 +1,5 @@
if(NSWPAT)
add_subdirectory(dxtn)
endif()
add_subdirectory(dxtn)
add_subdirectory(libjpeg)
add_subdirectory(libpng)
add_subdirectory(libtiff)

9
dll/3rdparty/dxtn/CMakeLists.txt vendored
View file

@ -2,15 +2,10 @@
spec2def(dxtn.dll dxtn.spec)
add_library(dxtn SHARED
fxt1.c
dxtn.c
wrapper.c
texstore.c
txc_compress_dxtn.c
txc_fetch_dxtn.c
${CMAKE_CURRENT_BINARY_DIR}/dxtn.def)
set_entrypoint(dxtn 0)
add_importlibs(dxtn msvcrt)
if(NOT MSVC)
add_target_compile_flags(dxtn "-Wno-unused-but-set-variable")
endif()
add_cd_file(TARGET dxtn DESTINATION reactos/system32 FOR all)

757
dll/3rdparty/dxtn/dxtn.c vendored
View file

@ -1,757 +0,0 @@
/*
* DXTn codec
* Version: 1.1
*
* Copyright (C) 2004 Daniel Borca All Rights Reserved.
*
* this is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* this is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GNU Make; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <stdlib.h>
#include <string.h>
#include "types.h"
#include "internal.h"
#include "dxtn.h"
/***************************************************************************\
* DXTn encoder
*
* The encoder was built by reversing the decoder,
* and is vaguely based on FXT1 codec. Note that this code
* is merely a proof of concept, since it is highly UNoptimized!
\***************************************************************************/
#define MAX_COMP 4 /* ever needed maximum number of components in texel */
#define MAX_VECT 4 /* ever needed maximum number of base vectors to find */
#define N_TEXELS 16 /* number of texels in a block (always 16) */
#define COLOR565(v) (word)((((v)[RCOMP] & 0xf8) << 8) | (((v)[GCOMP] & 0xfc) << 3) | ((v)[BCOMP] >> 3))
static const int dxtn_color_tlat[2][4] = {
{ 0, 2, 3, 1 },
{ 0, 2, 1, 3 }
};
static const int dxtn_alpha_tlat[2][8] = {
{ 0, 2, 3, 4, 5, 6, 7, 1 },
{ 0, 2, 3, 4, 5, 1, 6, 7 }
};
static void
dxt1_rgb_quantize (dword *cc, const byte *lines[], int comps)
{
float b, iv[MAX_COMP]; /* interpolation vector */
dword hi; /* high doubleword */
int color0, color1;
int n_vect;
const int n_comp = 3;
int black = 0;
int minSum = 2000; /* big enough */
int maxSum = -1; /* small enough */
int minCol = 0; /* phoudoin: silent compiler! */
int maxCol = 0; /* phoudoin: silent compiler! */
byte input[N_TEXELS][MAX_COMP];
int i, k, l;
/* make the whole block opaque */
/* we will NEVER reference ACOMP of any pixel */
/* 4 texels each line */
for (l = 0; l < 4; l++) {
for (k = 0; k < 4; k++) {
for (i = 0; i < comps; i++) {
input[k + l * 4][i] = *lines[l]++;
}
}
}
/* Our solution here is to find the darkest and brightest colors in
* the 4x4 tile and use those as the two representative colors.
* There are probably better algorithms to use (histogram-based).
*/
for (k = 0; k < N_TEXELS; k++) {
int sum = 0;
for (i = 0; i < n_comp; i++) {
sum += input[k][i];
}
if (minSum > sum) {
minSum = sum;
minCol = k;
}
if (maxSum < sum) {
maxSum = sum;
maxCol = k;
}
if (sum == 0) {
black = 1;
}
}
color0 = COLOR565(input[minCol]);
color1 = COLOR565(input[maxCol]);
if (color0 == color1) {
/* we'll use 3-vector */
cc[0] = color0 | (color1 << 16);
hi = black ? -1 : 0;
} else {
if (black && ((color0 == 0) || (color1 == 0))) {
/* we still can use 4-vector */
black = 0;
}
if (black ^ (color0 <= color1)) {
int aux;
aux = color0;
color0 = color1;
color1 = aux;
aux = minCol;
minCol = maxCol;
maxCol = aux;
}
n_vect = (color0 <= color1) ? 2 : 3;
MAKEIVEC(n_vect, n_comp, iv, b, input[minCol], input[maxCol]);
/* add in texels */
cc[0] = color0 | (color1 << 16);
hi = 0;
for (k = N_TEXELS - 1; k >= 0; k--) {
int texel = 3;
int sum = 0;
if (black) {
for (i = 0; i < n_comp; i++) {
sum += input[k][i];
}
}
if (!black || sum) {
/* interpolate color */
CALCCDOT(texel, n_vect, n_comp, iv, b, input[k]);
texel = dxtn_color_tlat[black][texel];
}
/* add in texel */
hi <<= 2;
hi |= texel;
}
}
cc[1] = hi;
}
static void
dxt1_rgba_quantize (dword *cc, const byte *lines[], int comps)
{
float b, iv[MAX_COMP]; /* interpolation vector */
dword hi; /* high doubleword */
int color0, color1;
int n_vect;
const int n_comp = 3;
int transparent = 0;
int minSum = 2000; /* big enough */
int maxSum = -1; /* small enough */
int minCol = 0; /* phoudoin: silent compiler! */
int maxCol = 0; /* phoudoin: silent compiler! */
byte input[N_TEXELS][MAX_COMP];
int i, k, l;
if (comps == 3) {
/* make the whole block opaque */
memset(input, -1, sizeof(input));
}
/* 4 texels each line */
for (l = 0; l < 4; l++) {
for (k = 0; k < 4; k++) {
for (i = 0; i < comps; i++) {
input[k + l * 4][i] = *lines[l]++;
}
}
}
/* Our solution here is to find the darkest and brightest colors in
* the 4x4 tile and use those as the two representative colors.
* There are probably better algorithms to use (histogram-based).
*/
for (k = 0; k < N_TEXELS; k++) {
int sum = 0;
for (i = 0; i < n_comp; i++) {
sum += input[k][i];
}
if (minSum > sum) {
minSum = sum;
minCol = k;
}
if (maxSum < sum) {
maxSum = sum;
maxCol = k;
}
if (input[k][ACOMP] < 128) {
transparent = 1;
}
}
color0 = COLOR565(input[minCol]);
color1 = COLOR565(input[maxCol]);
if (color0 == color1) {
/* we'll use 3-vector */
cc[0] = color0 | (color1 << 16);
hi = transparent ? -1 : 0;
} else {
if (transparent ^ (color0 <= color1)) {
int aux;
aux = color0;
color0 = color1;
color1 = aux;
aux = minCol;
minCol = maxCol;
maxCol = aux;
}
n_vect = (color0 <= color1) ? 2 : 3;
MAKEIVEC(n_vect, n_comp, iv, b, input[minCol], input[maxCol]);
/* add in texels */
cc[0] = color0 | (color1 << 16);
hi = 0;
for (k = N_TEXELS - 1; k >= 0; k--) {
int texel = 3;
if (input[k][ACOMP] >= 128) {
/* interpolate color */
CALCCDOT(texel, n_vect, n_comp, iv, b, input[k]);
texel = dxtn_color_tlat[transparent][texel];
}
/* add in texel */
hi <<= 2;
hi |= texel;
}
}
cc[1] = hi;
}
static void
dxt3_rgba_quantize (dword *cc, const byte *lines[], int comps)
{
float b, iv[MAX_COMP]; /* interpolation vector */
dword lolo, lohi; /* low quadword: lo dword, hi dword */
dword hihi; /* high quadword: high dword */
int color0, color1;
const int n_vect = 3;
const int n_comp = 3;
int minSum = 2000; /* big enough */
int maxSum = -1; /* small enough */
int minCol = 0; /* phoudoin: silent compiler! */
int maxCol = 0; /* phoudoin: silent compiler! */
byte input[N_TEXELS][MAX_COMP];
int i, k, l;
if (comps == 3) {
/* make the whole block opaque */
memset(input, -1, sizeof(input));
}
/* 4 texels each line */
for (l = 0; l < 4; l++) {
for (k = 0; k < 4; k++) {
for (i = 0; i < comps; i++) {
input[k + l * 4][i] = *lines[l]++;
}
}
}
/* Our solution here is to find the darkest and brightest colors in
* the 4x4 tile and use those as the two representative colors.
* There are probably better algorithms to use (histogram-based).
*/
for (k = 0; k < N_TEXELS; k++) {
int sum = 0;
for (i = 0; i < n_comp; i++) {
sum += input[k][i];
}
if (minSum > sum) {
minSum = sum;
minCol = k;
}
if (maxSum < sum) {
maxSum = sum;
maxCol = k;
}
}
/* add in alphas */
lolo = lohi = 0;
for (k = N_TEXELS - 1; k >= N_TEXELS / 2; k--) {
/* add in alpha */
lohi <<= 4;
lohi |= input[k][ACOMP] >> 4;
}
cc[1] = lohi;
for (; k >= 0; k--) {
/* add in alpha */
lolo <<= 4;
lolo |= input[k][ACOMP] >> 4;
}
cc[0] = lolo;
color0 = COLOR565(input[minCol]);
color1 = COLOR565(input[maxCol]);
cc[2] = color0 | (color1 << 16);
hihi = 0;
if (color0 != color1) {
MAKEIVEC(n_vect, n_comp, iv, b, input[minCol], input[maxCol]);
/* add in texels */
for (k = N_TEXELS - 1; k >= 0; k--) {
int texel;
/* interpolate color */
CALCCDOT(texel, n_vect, n_comp, iv, b, input[k]);
texel = dxtn_color_tlat[0][texel];
/* add in texel */
hihi <<= 2;
hihi |= texel;
}
}
cc[3] = hihi;
}
static void
dxt5_rgba_quantize (dword *cc, const byte *lines[], int comps)
{
float b, iv[MAX_COMP]; /* interpolation vector */
qword lo; /* low quadword */
dword hihi; /* high quadword: high dword */
int color0, color1;
const int n_vect = 3;
const int n_comp = 3;
int minSum = 2000; /* big enough */
int maxSum = -1; /* small enough */
int minCol = 0; /* phoudoin: silent compiler! */
int maxCol = 0; /* phoudoin: silent compiler! */
int alpha0 = 2000; /* big enough */
int alpha1 = -1; /* small enough */
int anyZero = 0, anyOne = 0;
int a_vect;
byte input[N_TEXELS][MAX_COMP];
int i, k, l;
if (comps == 3) {
/* make the whole block opaque */
memset(input, -1, sizeof(input));
}
/* 4 texels each line */
for (l = 0; l < 4; l++) {
for (k = 0; k < 4; k++) {
for (i = 0; i < comps; i++) {
input[k + l * 4][i] = *lines[l]++;
}
}
}
/* Our solution here is to find the darkest and brightest colors in
* the 4x4 tile and use those as the two representative colors.
* There are probably better algorithms to use (histogram-based).
*/
for (k = 0; k < N_TEXELS; k++) {
int sum = 0;
for (i = 0; i < n_comp; i++) {
sum += input[k][i];
}
if (minSum > sum) {
minSum = sum;
minCol = k;
}
if (maxSum < sum) {
maxSum = sum;
maxCol = k;
}
if (alpha0 > input[k][ACOMP]) {
alpha0 = input[k][ACOMP];
}
if (alpha1 < input[k][ACOMP]) {
alpha1 = input[k][ACOMP];
}
if (input[k][ACOMP] == 0) {
anyZero = 1;
}
if (input[k][ACOMP] == 255) {
anyOne = 1;
}
}
/* add in alphas */
if (alpha0 == alpha1) {
/* we'll use 6-vector */
cc[0] = alpha0 | (alpha1 << 8);
cc[1] = 0;
} else {
if (anyZero && ((alpha0 == 0) || (alpha1 == 0))) {
/* we still might use 8-vector */
anyZero = 0;
}
if (anyOne && ((alpha0 == 255) || (alpha1 == 255))) {
/* we still might use 8-vector */
anyOne = 0;
}
if ((anyZero | anyOne) ^ (alpha0 <= alpha1)) {
int aux;
aux = alpha0;
alpha0 = alpha1;
alpha1 = aux;
}
a_vect = (alpha0 <= alpha1) ? 5 : 7;
/* compute interpolation vector */
iv[ACOMP] = (float)a_vect / (alpha1 - alpha0);
b = -iv[ACOMP] * alpha0 + 0.5F;
/* add in alphas */
Q_MOV32(lo, 0);
for (k = N_TEXELS - 1; k >= 0; k--) {
int texel = -1;
if (anyZero | anyOne) {
if (input[k][ACOMP] == 0) {
texel = 6;
} else if (input[k][ACOMP] == 255) {
texel = 7;
}
}
/* interpolate alpha */
if (texel == -1) {
float dot = input[k][ACOMP] * iv[ACOMP];
texel = (int)(dot + b);
#if SAFECDOT
if (texel < 0) {
texel = 0;
} else if (texel > a_vect) {
texel = a_vect;
}
#endif
texel = dxtn_alpha_tlat[anyZero | anyOne][texel];
}
/* add in texel */
Q_SHL(lo, 3);
Q_OR32(lo, texel);
}
Q_SHL(lo, 16);
Q_OR32(lo, alpha0 | (alpha1 << 8));
((qword *)cc)[0] = lo;
}
color0 = COLOR565(input[minCol]);
color1 = COLOR565(input[maxCol]);
cc[2] = color0 | (color1 << 16);
hihi = 0;
if (color0 != color1) {
MAKEIVEC(n_vect, n_comp, iv, b, input[minCol], input[maxCol]);
/* add in texels */
for (k = N_TEXELS - 1; k >= 0; k--) {
int texel;
/* interpolate color */
CALCCDOT(texel, n_vect, n_comp, iv, b, input[k]);
texel = dxtn_color_tlat[0][texel];
/* add in texel */
hihi <<= 2;
hihi |= texel;
}
}
cc[3] = hihi;
}
#define ENCODER(dxtn, n) \
int TAPIENTRY \
dxtn##_encode (int width, int height, int comps, \
const void *source, int srcRowStride, \
void *dest, int destRowStride) \
{ \
int x, y; \
const byte *data; \
dword *encoded = (dword *)dest; \
void *newSource = NULL; \
\
/* Replicate image if width is not M4 or height is not M4 */ \
if ((width & 3) | (height & 3)) { \
int newWidth = (width + 3) & ~3; \
int newHeight = (height + 3) & ~3; \
newSource = malloc(comps * newWidth * newHeight * sizeof(byte *));\
_mesa_upscale_teximage2d(width, height, newWidth, newHeight, \
comps, (const byte *)source, \
srcRowStride, (byte *)newSource); \
source = newSource; \
width = newWidth; \
height = newHeight; \
srcRowStride = comps * newWidth; \
} \
\
data = (const byte *)source; \
destRowStride = (destRowStride - width * n) / 4; \
for (y = 0; y < height; y += 4) { \
unsigned int offs = 0 + (y + 0) * srcRowStride; \
for (x = 0; x < width; x += 4) { \
const byte *lines[4]; \
lines[0] = &data[offs]; \
lines[1] = lines[0] + srcRowStride; \
lines[2] = lines[1] + srcRowStride; \
lines[3] = lines[2] + srcRowStride; \
offs += 4 * comps; \
dxtn##_quantize(encoded, lines, comps); \
/* 4x4 block */ \
encoded += n; \
} \
encoded += destRowStride; \
} \
\
if (newSource != NULL) { \
free(newSource); \
} \
\
return 0; \
}
ENCODER(dxt1_rgb, 2)
ENCODER(dxt1_rgba, 2)
ENCODER(dxt3_rgba, 4)
ENCODER(dxt5_rgba, 4)
/***************************************************************************\
* DXTn decoder
*
* The decoder is based on GL_EXT_texture_compression_s3tc
* specification and serves as a concept for the encoder.
\***************************************************************************/
/* lookup table for scaling 4 bit colors up to 8 bits */
static const byte _rgb_scale_4[] = {
0, 17, 34, 51, 68, 85, 102, 119,
136, 153, 170, 187, 204, 221, 238, 255
};
/* lookup table for scaling 5 bit colors up to 8 bits */
static const byte _rgb_scale_5[] = {
0, 8, 16, 25, 33, 41, 49, 58,
66, 74, 82, 90, 99, 107, 115, 123,
132, 140, 148, 156, 165, 173, 181, 189,
197, 206, 214, 222, 230, 239, 247, 255
};
/* lookup table for scaling 6 bit colors up to 8 bits */
static const byte _rgb_scale_6[] = {
0, 4, 8, 12, 16, 20, 24, 28,
32, 36, 40, 45, 49, 53, 57, 61,
65, 69, 73, 77, 81, 85, 89, 93,
97, 101, 105, 109, 113, 117, 121, 125,
130, 134, 138, 142, 146, 150, 154, 158,
162, 166, 170, 174, 178, 182, 186, 190,
194, 198, 202, 206, 210, 215, 219, 223,
227, 231, 235, 239, 243, 247, 251, 255
};
#define CC_SEL(cc, which) (((dword *)(cc))[(which) / 32] >> ((which) & 31))
#define UP4(c) _rgb_scale_4[(c) & 15]
#define UP5(c) _rgb_scale_5[(c) & 31]
#define UP6(c) _rgb_scale_6[(c) & 63]
#define ZERO_4UBV(v) *((dword *)(v)) = 0
void TAPIENTRY
dxt1_rgb_decode_1 (const void *texture, int stride,
int i, int j, byte *rgba)
{
const byte *src = (const byte *)texture
+ ((j / 4) * ((stride + 3) / 4) + i / 4) * 8;
const int code = (src[4 + (j & 3)] >> ((i & 3) * 2)) & 0x3;
if (code == 0) {
rgba[RCOMP] = UP5(CC_SEL(src, 11));
rgba[GCOMP] = UP6(CC_SEL(src, 5));
rgba[BCOMP] = UP5(CC_SEL(src, 0));
} else if (code == 1) {
rgba[RCOMP] = UP5(CC_SEL(src, 27));
rgba[GCOMP] = UP6(CC_SEL(src, 21));
rgba[BCOMP] = UP5(CC_SEL(src, 16));
} else {
const word col0 = src[0] | (src[1] << 8);
const word col1 = src[2] | (src[3] << 8);
if (col0 > col1) {
if (code == 2) {
rgba[RCOMP] = (UP5(col0 >> 11) * 2 + UP5(col1 >> 11)) / 3;
rgba[GCOMP] = (UP6(col0 >> 5) * 2 + UP6(col1 >> 5)) / 3;
rgba[BCOMP] = (UP5(col0 ) * 2 + UP5(col1 )) / 3;
} else {
rgba[RCOMP] = (UP5(col0 >> 11) + 2 * UP5(col1 >> 11)) / 3;
rgba[GCOMP] = (UP6(col0 >> 5) + 2 * UP6(col1 >> 5)) / 3;
rgba[BCOMP] = (UP5(col0 ) + 2 * UP5(col1 )) / 3;
}
} else {
if (code == 2) {
rgba[RCOMP] = (UP5(col0 >> 11) + UP5(col1 >> 11)) / 2;
rgba[GCOMP] = (UP6(col0 >> 5) + UP6(col1 >> 5)) / 2;
rgba[BCOMP] = (UP5(col0 ) + UP5(col1 )) / 2;
} else {
ZERO_4UBV(rgba);
}
}
}
rgba[ACOMP] = 255;
}
void TAPIENTRY
dxt1_rgba_decode_1 (const void *texture, int stride,
int i, int j, byte *rgba)
{
/* Same as rgb_dxt1 above, except alpha=0 if col0<=col1 and code=3. */
const byte *src = (const byte *)texture
+ ((j / 4) * ((stride + 3) / 4) + i / 4) * 8;
const int code = (src[4 + (j & 3)] >> ((i & 3) * 2)) & 0x3;
if (code == 0) {
rgba[RCOMP] = UP5(CC_SEL(src, 11));
rgba[GCOMP] = UP6(CC_SEL(src, 5));
rgba[BCOMP] = UP5(CC_SEL(src, 0));
rgba[ACOMP] = 255;
} else if (code == 1) {
rgba[RCOMP] = UP5(CC_SEL(src, 27));
rgba[GCOMP] = UP6(CC_SEL(src, 21));
rgba[BCOMP] = UP5(CC_SEL(src, 16));
rgba[ACOMP] = 255;
} else {
const word col0 = src[0] | (src[1] << 8);
const word col1 = src[2] | (src[3] << 8);
if (col0 > col1) {
if (code == 2) {
rgba[RCOMP] = (UP5(col0 >> 11) * 2 + UP5(col1 >> 11)) / 3;
rgba[GCOMP] = (UP6(col0 >> 5) * 2 + UP6(col1 >> 5)) / 3;
rgba[BCOMP] = (UP5(col0 ) * 2 + UP5(col1 )) / 3;
} else {
rgba[RCOMP] = (UP5(col0 >> 11) + 2 * UP5(col1 >> 11)) / 3;
rgba[GCOMP] = (UP6(col0 >> 5) + 2 * UP6(col1 >> 5)) / 3;
rgba[BCOMP] = (UP5(col0 ) + 2 * UP5(col1 )) / 3;
}
rgba[ACOMP] = 255;
} else {
if (code == 2) {
rgba[RCOMP] = (UP5(col0 >> 11) + UP5(col1 >> 11)) / 2;
rgba[GCOMP] = (UP6(col0 >> 5) + UP6(col1 >> 5)) / 2;
rgba[BCOMP] = (UP5(col0 ) + UP5(col1 )) / 2;
rgba[ACOMP] = 255;
} else {
ZERO_4UBV(rgba);
}
}
}
}
void TAPIENTRY
dxt3_rgba_decode_1 (const void *texture, int stride,
int i, int j, byte *rgba)
{
const byte *src = (const byte *)texture
+ ((j / 4) * ((stride + 3) / 4) + i / 4) * 16;
const int code = (src[12 + (j & 3)] >> ((i & 3) * 2)) & 0x3;
const dword *cc = (const dword *)(src + 8);
if (code == 0) {
rgba[RCOMP] = UP5(CC_SEL(cc, 11));
rgba[GCOMP] = UP6(CC_SEL(cc, 5));
rgba[BCOMP] = UP5(CC_SEL(cc, 0));
} else if (code == 1) {
rgba[RCOMP] = UP5(CC_SEL(cc, 27));
rgba[GCOMP] = UP6(CC_SEL(cc, 21));
rgba[BCOMP] = UP5(CC_SEL(cc, 16));
} else if (code == 2) {
/* (col0 * (4 - code) + col1 * (code - 1)) / 3 */
rgba[RCOMP] = (UP5(CC_SEL(cc, 11)) * 2 + UP5(CC_SEL(cc, 27))) / 3;
rgba[GCOMP] = (UP6(CC_SEL(cc, 5)) * 2 + UP6(CC_SEL(cc, 21))) / 3;
rgba[BCOMP] = (UP5(CC_SEL(cc, 0)) * 2 + UP5(CC_SEL(cc, 16))) / 3;
} else {
rgba[RCOMP] = (UP5(CC_SEL(cc, 11)) + 2 * UP5(CC_SEL(cc, 27))) / 3;
rgba[GCOMP] = (UP6(CC_SEL(cc, 5)) + 2 * UP6(CC_SEL(cc, 21))) / 3;
rgba[BCOMP] = (UP5(CC_SEL(cc, 0)) + 2 * UP5(CC_SEL(cc, 16))) / 3;
}
rgba[ACOMP] = UP4(src[((j & 3) * 4 + (i & 3)) / 2] >> ((i & 1) * 4));
}
void TAPIENTRY
dxt5_rgba_decode_1 (const void *texture, int stride,
int i, int j, byte *rgba)
{
const byte *src = (const byte *)texture
+ ((j / 4) * ((stride + 3) / 4) + i / 4) * 16;
const int code = (src[12 + (j & 3)] >> ((i & 3) * 2)) & 0x3;
const dword *cc = (const dword *)(src + 8);
const byte alpha0 = src[0];
const byte alpha1 = src[1];
const int alphaShift = (((j & 3) * 4) + (i & 3)) * 3 + 16;
const int acode = ((alphaShift == 31)
? CC_SEL(src + 2, alphaShift - 16)
: CC_SEL(src, alphaShift)) & 0x7;
if (code == 0) {
rgba[RCOMP] = UP5(CC_SEL(cc, 11));
rgba[GCOMP] = UP6(CC_SEL(cc, 5));
rgba[BCOMP] = UP5(CC_SEL(cc, 0));
} else if (code == 1) {
rgba[RCOMP] = UP5(CC_SEL(cc, 27));
rgba[GCOMP] = UP6(CC_SEL(cc, 21));
rgba[BCOMP] = UP5(CC_SEL(cc, 16));
} else if (code == 2) {
/* (col0 * (4 - code) + col1 * (code - 1)) / 3 */
rgba[RCOMP] = (UP5(CC_SEL(cc, 11)) * 2 + UP5(CC_SEL(cc, 27))) / 3;
rgba[GCOMP] = (UP6(CC_SEL(cc, 5)) * 2 + UP6(CC_SEL(cc, 21))) / 3;
rgba[BCOMP] = (UP5(CC_SEL(cc, 0)) * 2 + UP5(CC_SEL(cc, 16))) / 3;
} else {
rgba[RCOMP] = (UP5(CC_SEL(cc, 11)) + 2 * UP5(CC_SEL(cc, 27))) / 3;
rgba[GCOMP] = (UP6(CC_SEL(cc, 5)) + 2 * UP6(CC_SEL(cc, 21))) / 3;
rgba[BCOMP] = (UP5(CC_SEL(cc, 0)) + 2 * UP5(CC_SEL(cc, 16))) / 3;
}
if (acode == 0) {
rgba[ACOMP] = alpha0;
} else if (acode == 1) {
rgba[ACOMP] = alpha1;
} else if (alpha0 > alpha1) {
rgba[ACOMP] = ((8 - acode) * alpha0 + (acode - 1) * alpha1) / 7;
} else if (acode == 6) {
rgba[ACOMP] = 0;
} else if (acode == 7) {
rgba[ACOMP] = 255;
} else {
rgba[ACOMP] = ((6 - acode) * alpha0 + (acode - 1) * alpha1) / 5;
}
}

62
dll/3rdparty/dxtn/dxtn.h vendored
View file

@ -1,62 +0,0 @@
/*
* DXTn codec
* Version: 1.1
*
* Copyright (C) 2004 Daniel Borca All Rights Reserved.
*
* this is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* this is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GNU Make; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#ifndef DXTN_H_included
#define DXTN_H_included
TAPI int TAPIENTRY
dxt1_rgb_encode (int width, int height, int comps,
const void *source, int srcRowStride,
void *dest, int destRowStride);
TAPI int TAPIENTRY
dxt1_rgba_encode (int width, int height, int comps,
const void *source, int srcRowStride,
void *dest, int destRowStride);
TAPI int TAPIENTRY
dxt3_rgba_encode (int width, int height, int comps,
const void *source, int srcRowStride,
void *dest, int destRowStride);
TAPI int TAPIENTRY
dxt5_rgba_encode (int width, int height, int comps,
const void *source, int srcRowStride,
void *dest, int destRowStride);
TAPI void TAPIENTRY
dxt1_rgb_decode_1 (const void *texture, int stride /* in pixels */,
int i, int j, byte *rgba);
TAPI void TAPIENTRY
dxt1_rgba_decode_1 (const void *texture, int stride /* in pixels */,
int i, int j, byte *rgba);
TAPI void TAPIENTRY
dxt3_rgba_decode_1 (const void *texture, int stride /* in pixels */,
int i, int j, byte *rgba);
TAPI void TAPIENTRY
dxt5_rgba_decode_1 (const void *texture, int stride /* in pixels */,
int i, int j, byte *rgba);
#endif

18
dll/3rdparty/dxtn/dxtn.spec vendored
View file

@ -1,14 +1,4 @@
@ stdcall dxt1_rgb_encode(long long long ptr long ptr long)
@ stdcall dxt1_rgba_encode(long long long ptr long ptr long)
@ stdcall dxt3_rgba_encode(long long long ptr long ptr long)
@ stdcall dxt5_rgba_encode(long long long ptr long ptr long)
@ stdcall dxt1_rgba_decode_1(ptr long long long long)
@ stdcall dxt3_rgba_decode_1(ptr long long long long)
@ stdcall dxt5_rgba_decode_1(ptr long long long long)
@ stdcall fxt1_encode(long long long ptr long ptr long)
@ stdcall fxt1_decode_1(ptr long long long long)
@ stdcall fetch_2d_texel_rgb_dxt1(long ptr long long long)
@ stdcall fetch_2d_texel_rgba_dxt1(long ptr long long long)
@ stdcall fetch_2d_texel_rgba_dxt3(long ptr long long long)
@ stdcall fetch_2d_texel_rgba_dxt5(long ptr long long long)
@ stdcall tx_compress_dxtn(long long long ptr long ptr long)
@ cdecl fetch_2d_texel_rgba_dxt1(long ptr long long ptr)
@ cdecl fetch_2d_texel_rgba_dxt3(long ptr long long ptr)
@ cdecl fetch_2d_texel_rgba_dxt5(long ptr long long ptr)
@ cdecl tx_compress_dxtn(long long long ptr long ptr long)

1369
dll/3rdparty/dxtn/fxt1.c vendored
View file

File diff suppressed because it is too large Load diff

38
dll/3rdparty/dxtn/fxt1.h vendored
View file

@ -1,38 +0,0 @@
/*
* FXT1 codec
* Version: 1.1
*
* Copyright (C) 2004 Daniel Borca All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* DANIEL BORCA BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
* AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#ifndef FXT1_H_included
#define FXT1_H_included
TAPI int TAPIENTRY
fxt1_encode (int width, int height, int comps,
const void *source, int srcRowStride,
void *dest, int destRowStride);
TAPI void TAPIENTRY
fxt1_decode_1 (const void *texture, int stride /* in pixels */,
int i, int j, byte *rgba);
#endif

138
dll/3rdparty/dxtn/internal.h vendored
View file

@ -1,138 +0,0 @@
/*
* Texture compression
* Version: 1.0
*
* Copyright (C) 2004 Daniel Borca All Rights Reserved.
*
* this is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* this is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GNU Make; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#ifndef INTERNAL_H_included
#define INTERNAL_H_included
/*****************************************************************************\
* DLL stuff
\*****************************************************************************/
#ifdef __WIN32__
#define TAPI __declspec(dllexport)
#define TAPIENTRY __stdcall
#else
#define TAPI
#define TAPIENTRY
#endif
/*****************************************************************************\
* 64bit types on 32bit machine
\*****************************************************************************/
#if defined(__GNUC__) && !defined(__cplusplus)
typedef unsigned long long qword;
#define Q_MOV32(a, b) a = b
#define Q_OR32(a, b) a |= b
#define Q_SHL(a, c) a <<= c
#else /* !__GNUC__ */
typedef struct {
dword lo, hi;
} qword;
#define Q_MOV32(a, b) a.lo = b
#define Q_OR32(a, b) a.lo |= b
#define Q_SHL(a, c) \
do { \
if ((c) >= 32) { \
a.hi = a.lo << ((c) - 32); \
a.lo = 0; \
} else { \
a.hi = (a.hi << (c)) | (a.lo >> (32 - (c)));\
a.lo <<= c; \
} \
} while (0)
#endif /* !__GNUC__ */
/*****************************************************************************\
* Config
\*****************************************************************************/
#define RCOMP 0
#define GCOMP 1
#define BCOMP 2
#define ACOMP 3
/*****************************************************************************\
* Metric
\*****************************************************************************/
#define F(i) (float)1 /* can be used to obtain an oblong metric: 0.30 / 0.59 / 0.11 */
#define SAFECDOT 1 /* for paranoids */
#define MAKEIVEC(NV, NC, IV, B, V0, V1) \
do { \
/* compute interpolation vector */\
float d2 = 0.0F; \
float rd2; \
\
for (i = 0; i < NC; i++) { \
IV[i] = (V1[i] - V0[i]) * F(i);\
d2 += IV[i] * IV[i]; \
} \
rd2 = (float)NV / d2; \
B = 0; \
for (i = 0; i < NC; i++) { \
IV[i] *= F(i); \
B -= IV[i] * V0[i]; \
IV[i] *= rd2; \
} \
B = B * rd2 + 0.5F; \
} while (0)
#define CALCCDOT(TEXEL, NV, NC, IV, B, V)\
do { \
float dot = 0.0F; \
for (i = 0; i < NC; i++) { \
dot += V[i] * IV[i]; \
} \
TEXEL = (int)(dot + B); \
if (SAFECDOT) { \
if (TEXEL < 0) { \
TEXEL = 0; \
} else if (TEXEL > NV) { \
TEXEL = NV; \
} \
} \
} while (0)
/*****************************************************************************\
* Utility functions
\*****************************************************************************/
void
_mesa_upscale_teximage2d (unsigned int inWidth, unsigned int inHeight,
unsigned int outWidth, unsigned int outHeight,
unsigned int comps,
const byte *src, int srcRowStride,
unsigned char *dest);
#endif

843
dll/3rdparty/dxtn/txc_compress_dxtn.c vendored Normal file
View file

@ -0,0 +1,843 @@
/*
* libtxc_dxtn
* Version: 1.0
*
* Copyright (C) 2004 Roland Scheidegger All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* BRIAN PAUL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
* AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#include <stdio.h>
#include <stdlib.h>
#include "txc_dxtn.h"
/* weights used for error function, basically weights (unsquared 2/4/1) according to rgb->luminance conversion
not sure if this really reflects visual perception */
#define REDWEIGHT 4
#define GREENWEIGHT 16
#define BLUEWEIGHT 1
#define ALPHACUT 127
static void fancybasecolorsearch( GLubyte *blkaddr, GLubyte srccolors[4][4][4], GLubyte *bestcolor[2],
GLint numxpixels, GLint numypixels, GLint type, GLboolean haveAlpha)
{
/* use same luminance-weighted distance metric to determine encoding as for finding the base colors */
/* TODO could also try to find a better encoding for the 3-color-encoding type, this really should be done
if it's rgba_dxt1 and we have alpha in the block, currently even values which will be mapped to black
due to their alpha value will influence the result */
GLint i, j, colors, z;
GLuint pixerror, pixerrorred, pixerrorgreen, pixerrorblue, pixerrorbest;
GLint colordist, blockerrlin[2][3];
GLubyte nrcolor[2];
GLint pixerrorcolorbest[3];
GLubyte enc = 0;
GLubyte cv[4][4];
GLubyte testcolor[2][3];
/* fprintf(stderr, "color begin 0 r/g/b %d/%d/%d, 1 r/g/b %d/%d/%d\n",
bestcolor[0][0], bestcolor[0][1], bestcolor[0][2], bestcolor[1][0], bestcolor[1][1], bestcolor[1][2]);*/
if (((bestcolor[0][0] & 0xf8) << 8 | (bestcolor[0][1] & 0xfc) << 3 | bestcolor[0][2] >> 3) <
((bestcolor[1][0] & 0xf8) << 8 | (bestcolor[1][1] & 0xfc) << 3 | bestcolor[1][2] >> 3)) {
testcolor[0][0] = bestcolor[0][0];
testcolor[0][1] = bestcolor[0][1];
testcolor[0][2] = bestcolor[0][2];
testcolor[1][0] = bestcolor[1][0];
testcolor[1][1] = bestcolor[1][1];
testcolor[1][2] = bestcolor[1][2];
}
else {
testcolor[1][0] = bestcolor[0][0];
testcolor[1][1] = bestcolor[0][1];
testcolor[1][2] = bestcolor[0][2];
testcolor[0][0] = bestcolor[1][0];
testcolor[0][1] = bestcolor[1][1];
testcolor[0][2] = bestcolor[1][2];
}
for (i = 0; i < 3; i ++) {
cv[0][i] = testcolor[0][i];
cv[1][i] = testcolor[1][i];
cv[2][i] = (testcolor[0][i] * 2 + testcolor[1][i]) / 3;
cv[3][i] = (testcolor[0][i] + testcolor[1][i] * 2) / 3;
}
blockerrlin[0][0] = 0;
blockerrlin[0][1] = 0;
blockerrlin[0][2] = 0;
blockerrlin[1][0] = 0;
blockerrlin[1][1] = 0;
blockerrlin[1][2] = 0;
nrcolor[0] = 0;
nrcolor[1] = 0;
for (j = 0; j < numypixels; j++) {
for (i = 0; i < numxpixels; i++) {
pixerrorbest = 0xffffffff;
for (colors = 0; colors < 4; colors++) {
colordist = srccolors[j][i][0] - (cv[colors][0]);
pixerror = colordist * colordist * REDWEIGHT;
pixerrorred = colordist;
colordist = srccolors[j][i][1] - (cv[colors][1]);
pixerror += colordist * colordist * GREENWEIGHT;
pixerrorgreen = colordist;
colordist = srccolors[j][i][2] - (cv[colors][2]);
pixerror += colordist * colordist * BLUEWEIGHT;
pixerrorblue = colordist;
if (pixerror < pixerrorbest) {
enc = colors;
pixerrorbest = pixerror;
pixerrorcolorbest[0] = pixerrorred;
pixerrorcolorbest[1] = pixerrorgreen;
pixerrorcolorbest[2] = pixerrorblue;
}
}
if (enc == 0) {
for (z = 0; z < 3; z++) {
blockerrlin[0][z] += 3 * pixerrorcolorbest[z];
}
nrcolor[0] += 3;
}
else if (enc == 2) {
for (z = 0; z < 3; z++) {
blockerrlin[0][z] += 2 * pixerrorcolorbest[z];
}
nrcolor[0] += 2;
for (z = 0; z < 3; z++) {
blockerrlin[1][z] += 1 * pixerrorcolorbest[z];
}
nrcolor[1] += 1;
}
else if (enc == 3) {
for (z = 0; z < 3; z++) {
blockerrlin[0][z] += 1 * pixerrorcolorbest[z];
}
nrcolor[0] += 1;
for (z = 0; z < 3; z++) {
blockerrlin[1][z] += 2 * pixerrorcolorbest[z];
}
nrcolor[1] += 2;
}
else if (enc == 1) {
for (z = 0; z < 3; z++) {
blockerrlin[1][z] += 3 * pixerrorcolorbest[z];
}
nrcolor[1] += 3;
}
}
}
if (nrcolor[0] == 0) nrcolor[0] = 1;
if (nrcolor[1] == 0) nrcolor[1] = 1;
for (j = 0; j < 2; j++) {
for (i = 0; i < 3; i++) {
GLint newvalue = testcolor[j][i] + blockerrlin[j][i] / nrcolor[j];
if (newvalue <= 0)
testcolor[j][i] = 0;
else if (newvalue >= 255)
testcolor[j][i] = 255;
else testcolor[j][i] = newvalue;
}
}
if ((abs(testcolor[0][0] - testcolor[1][0]) < 8) &&
(abs(testcolor[0][1] - testcolor[1][1]) < 4) &&
(abs(testcolor[0][2] - testcolor[1][2]) < 8)) {
/* both colors are so close they might get encoded as the same 16bit values */
GLubyte coldiffred, coldiffgreen, coldiffblue, coldiffmax, factor, ind0, ind1;
coldiffred = abs(testcolor[0][0] - testcolor[1][0]);
coldiffgreen = 2 * abs(testcolor[0][1] - testcolor[1][1]);
coldiffblue = abs(testcolor[0][2] - testcolor[1][2]);
coldiffmax = coldiffred;
if (coldiffmax < coldiffgreen) coldiffmax = coldiffgreen;
if (coldiffmax < coldiffblue) coldiffmax = coldiffblue;
if (coldiffmax > 0) {
if (coldiffmax > 4) factor = 2;
else if (coldiffmax > 2) factor = 3;
else factor = 4;
/* Won't do much if the color value is near 255... */
/* argh so many ifs */
if (testcolor[1][1] >= testcolor[0][1]) {
ind1 = 1; ind0 = 0;
}
else {
ind1 = 0; ind0 = 1;
}
if ((testcolor[ind1][1] + factor * coldiffgreen) <= 255)
testcolor[ind1][1] += factor * coldiffgreen;
else testcolor[ind1][1] = 255;
if ((testcolor[ind1][0] - testcolor[ind0][1]) > 0) {
if ((testcolor[ind1][0] + factor * coldiffred) <= 255)
testcolor[ind1][0] += factor * coldiffred;
else testcolor[ind1][0] = 255;
}
else {
if ((testcolor[ind0][0] + factor * coldiffred) <= 255)
testcolor[ind0][0] += factor * coldiffred;
else testcolor[ind0][0] = 255;
}
if ((testcolor[ind1][2] - testcolor[ind0][2]) > 0) {
if ((testcolor[ind1][2] + factor * coldiffblue) <= 255)
testcolor[ind1][2] += factor * coldiffblue;
else testcolor[ind1][2] = 255;
}
else {
if ((testcolor[ind0][2] + factor * coldiffblue) <= 255)
testcolor[ind0][2] += factor * coldiffblue;
else testcolor[ind0][2] = 255;
}
}
}
if (((testcolor[0][0] & 0xf8) << 8 | (testcolor[0][1] & 0xfc) << 3 | testcolor[0][2] >> 3) <
((testcolor[1][0] & 0xf8) << 8 | (testcolor[1][1] & 0xfc) << 3 | testcolor[1][2]) >> 3) {
for (i = 0; i < 3; i++) {
bestcolor[0][i] = testcolor[0][i];
bestcolor[1][i] = testcolor[1][i];
}
}
else {
for (i = 0; i < 3; i++) {
bestcolor[0][i] = testcolor[1][i];
bestcolor[1][i] = testcolor[0][i];
}
}
/* fprintf(stderr, "color end 0 r/g/b %d/%d/%d, 1 r/g/b %d/%d/%d\n",
bestcolor[0][0], bestcolor[0][1], bestcolor[0][2], bestcolor[1][0], bestcolor[1][1], bestcolor[1][2]);*/
}
static void storedxtencodedblock( GLubyte *blkaddr, GLubyte srccolors[4][4][4], GLubyte *bestcolor[2],
GLint numxpixels, GLint numypixels, GLuint type, GLboolean haveAlpha)
{
/* use same luminance-weighted distance metric to determine encoding as for finding the base colors */
GLint i, j, colors;
GLuint testerror, testerror2, pixerror, pixerrorbest;
GLint colordist;
GLushort color0, color1, tempcolor;
GLuint bits = 0, bits2 = 0;
GLubyte *colorptr;
GLubyte enc = 0;
GLubyte cv[4][4];
bestcolor[0][0] = bestcolor[0][0] & 0xf8;
bestcolor[0][1] = bestcolor[0][1] & 0xfc;
bestcolor[0][2] = bestcolor[0][2] & 0xf8;
bestcolor[1][0] = bestcolor[1][0] & 0xf8;
bestcolor[1][1] = bestcolor[1][1] & 0xfc;
bestcolor[1][2] = bestcolor[1][2] & 0xf8;
color0 = bestcolor[0][0] << 8 | bestcolor[0][1] << 3 | bestcolor[0][2] >> 3;
color1 = bestcolor[1][0] << 8 | bestcolor[1][1] << 3 | bestcolor[1][2] >> 3;
if (color0 < color1) {
tempcolor = color0; color0 = color1; color1 = tempcolor;
colorptr = bestcolor[0]; bestcolor[0] = bestcolor[1]; bestcolor[1] = colorptr;
}
for (i = 0; i < 3; i++) {
cv[0][i] = bestcolor[0][i];
cv[1][i] = bestcolor[1][i];
cv[2][i] = (bestcolor[0][i] * 2 + bestcolor[1][i]) / 3;
cv[3][i] = (bestcolor[0][i] + bestcolor[1][i] * 2) / 3;
}
testerror = 0;
for (j = 0; j < numypixels; j++) {
for (i = 0; i < numxpixels; i++) {
pixerrorbest = 0xffffffff;
for (colors = 0; colors < 4; colors++) {
colordist = srccolors[j][i][0] - cv[colors][0];
pixerror = colordist * colordist * REDWEIGHT;
colordist = srccolors[j][i][1] - cv[colors][1];
pixerror += colordist * colordist * GREENWEIGHT;
colordist = srccolors[j][i][2] - cv[colors][2];
pixerror += colordist * colordist * BLUEWEIGHT;
if (pixerror < pixerrorbest) {
pixerrorbest = pixerror;
enc = colors;
}
}
testerror += pixerrorbest;
bits |= enc << (2 * (j * 4 + i));
}
}
/* some hw might disagree but actually decoding should always use 4-color encoding
for non-dxt1 formats */
if (type == GL_COMPRESSED_RGB_S3TC_DXT1_EXT || type == GL_COMPRESSED_RGBA_S3TC_DXT1_EXT) {
for (i = 0; i < 3; i++) {
cv[2][i] = (bestcolor[0][i] + bestcolor[1][i]) / 2;
/* this isn't used. Looks like the black color constant can only be used
with RGB_DXT1 if I read the spec correctly (note though that the radeon gpu disagrees,
it will decode 3 to black even with DXT3/5), and due to how the color searching works
it won't get used even then */
cv[3][i] = 0;
}
testerror2 = 0;
for (j = 0; j < numypixels; j++) {
for (i = 0; i < numxpixels; i++) {
pixerrorbest = 0xffffffff;
if ((type == GL_COMPRESSED_RGBA_S3TC_DXT1_EXT) && (srccolors[j][i][3] <= ALPHACUT)) {
enc = 3;
pixerrorbest = 0; /* don't calculate error */
}
else {
/* we're calculating the same what we have done already for colors 0-1 above... */
for (colors = 0; colors < 3; colors++) {
colordist = srccolors[j][i][0] - cv[colors][0];
pixerror = colordist * colordist * REDWEIGHT;
colordist = srccolors[j][i][1] - cv[colors][1];
pixerror += colordist * colordist * GREENWEIGHT;
colordist = srccolors[j][i][2] - cv[colors][2];
pixerror += colordist * colordist * BLUEWEIGHT;
if (pixerror < pixerrorbest) {
pixerrorbest = pixerror;
/* need to exchange colors later */
if (colors > 1) enc = colors;
else enc = colors ^ 1;
}
}
}
testerror2 += pixerrorbest;
bits2 |= enc << (2 * (j * 4 + i));
}
}
} else {
testerror2 = 0xffffffff;
}
/* finally we're finished, write back colors and bits */
if ((testerror > testerror2) || (haveAlpha)) {
*blkaddr++ = color1 & 0xff;
*blkaddr++ = color1 >> 8;
*blkaddr++ = color0 & 0xff;
*blkaddr++ = color0 >> 8;
*blkaddr++ = bits2 & 0xff;
*blkaddr++ = ( bits2 >> 8) & 0xff;
*blkaddr++ = ( bits2 >> 16) & 0xff;
*blkaddr = bits2 >> 24;
}
else {
*blkaddr++ = color0 & 0xff;
*blkaddr++ = color0 >> 8;
*blkaddr++ = color1 & 0xff;
*blkaddr++ = color1 >> 8;
*blkaddr++ = bits & 0xff;
*blkaddr++ = ( bits >> 8) & 0xff;
*blkaddr++ = ( bits >> 16) & 0xff;
*blkaddr = bits >> 24;
}
}
static void encodedxtcolorblockfaster( GLubyte *blkaddr, GLubyte srccolors[4][4][4],
GLint numxpixels, GLint numypixels, GLuint type )
{
/* simplistic approach. We need two base colors, simply use the "highest" and the "lowest" color
present in the picture as base colors */
/* define lowest and highest color as shortest and longest vector to 0/0/0, though the
vectors are weighted similar to their importance in rgb-luminance conversion
doesn't work too well though...
This seems to be a rather difficult problem */
GLubyte *bestcolor[2];
GLubyte basecolors[2][3];
GLubyte i, j;
GLuint lowcv, highcv, testcv;
GLboolean haveAlpha = GL_FALSE;
lowcv = highcv = srccolors[0][0][0] * srccolors[0][0][0] * REDWEIGHT +
srccolors[0][0][1] * srccolors[0][0][1] * GREENWEIGHT +
srccolors[0][0][2] * srccolors[0][0][2] * BLUEWEIGHT;
bestcolor[0] = bestcolor[1] = srccolors[0][0];
for (j = 0; j < numypixels; j++) {
for (i = 0; i < numxpixels; i++) {
/* don't use this as a base color if the pixel will get black/transparent anyway */
if ((type != GL_COMPRESSED_RGBA_S3TC_DXT1_EXT) || (srccolors[j][i][3] > ALPHACUT)) {
testcv = srccolors[j][i][0] * srccolors[j][i][0] * REDWEIGHT +
srccolors[j][i][1] * srccolors[j][i][1] * GREENWEIGHT +
srccolors[j][i][2] * srccolors[j][i][2] * BLUEWEIGHT;
if (testcv > highcv) {
highcv = testcv;
bestcolor[1] = srccolors[j][i];
}
else if (testcv < lowcv) {
lowcv = testcv;
bestcolor[0] = srccolors[j][i];
}
}
else haveAlpha = GL_TRUE;
}
}
/* make sure the original color values won't get touched... */
for (j = 0; j < 2; j++) {
for (i = 0; i < 3; i++) {
basecolors[j][i] = bestcolor[j][i];
}
}
bestcolor[0] = basecolors[0];
bestcolor[1] = basecolors[1];
/* try to find better base colors */
fancybasecolorsearch(blkaddr, srccolors, bestcolor, numxpixels, numypixels, type, haveAlpha);
/* find the best encoding for these colors, and store the result */
storedxtencodedblock(blkaddr, srccolors, bestcolor, numxpixels, numypixels, type, haveAlpha);
}
static void writedxt5encodedalphablock( GLubyte *blkaddr, GLubyte alphabase1, GLubyte alphabase2,
GLubyte alphaenc[16])
{
*blkaddr++ = alphabase1;
*blkaddr++ = alphabase2;
*blkaddr++ = alphaenc[0] | (alphaenc[1] << 3) | ((alphaenc[2] & 3) << 6);
*blkaddr++ = (alphaenc[2] >> 2) | (alphaenc[3] << 1) | (alphaenc[4] << 4) | ((alphaenc[5] & 1) << 7);
*blkaddr++ = (alphaenc[5] >> 1) | (alphaenc[6] << 2) | (alphaenc[7] << 5);
*blkaddr++ = alphaenc[8] | (alphaenc[9] << 3) | ((alphaenc[10] & 3) << 6);
*blkaddr++ = (alphaenc[10] >> 2) | (alphaenc[11] << 1) | (alphaenc[12] << 4) | ((alphaenc[13] & 1) << 7);
*blkaddr++ = (alphaenc[13] >> 1) | (alphaenc[14] << 2) | (alphaenc[15] << 5);
}
static void encodedxt5alpha(GLubyte *blkaddr, GLubyte srccolors[4][4][4],
GLint numxpixels, GLint numypixels)
{
GLubyte alphabase[2], alphause[2];
GLshort alphatest[2];
GLuint alphablockerror1, alphablockerror2, alphablockerror3;
GLubyte i, j, aindex, acutValues[7];
GLubyte alphaenc1[16], alphaenc2[16], alphaenc3[16];
GLboolean alphaabsmin = GL_FALSE;
GLboolean alphaabsmax = GL_FALSE;
GLshort alphadist;
/* find lowest and highest alpha value in block, alphabase[0] lowest, alphabase[1] highest */
alphabase[0] = 0xff; alphabase[1] = 0x0;
for (j = 0; j < numypixels; j++) {
for (i = 0; i < numxpixels; i++) {
if (srccolors[j][i][3] == 0)
alphaabsmin = GL_TRUE;
else if (srccolors[j][i][3] == 255)
alphaabsmax = GL_TRUE;
else {
if (srccolors[j][i][3] > alphabase[1])
alphabase[1] = srccolors[j][i][3];
if (srccolors[j][i][3] < alphabase[0])
alphabase[0] = srccolors[j][i][3];
}
}
}
if ((alphabase[0] > alphabase[1]) && !(alphaabsmin && alphaabsmax)) { /* one color, either max or min */
/* shortcut here since it is a very common case (and also avoids later problems) */
/* || (alphabase[0] == alphabase[1] && !alphaabsmin && !alphaabsmax) */
/* could also thest for alpha0 == alpha1 (and not min/max), but probably not common, so don't bother */
*blkaddr++ = srccolors[0][0][3];
blkaddr++;
*blkaddr++ = 0;
*blkaddr++ = 0;
*blkaddr++ = 0;
*blkaddr++ = 0;
*blkaddr++ = 0;
*blkaddr++ = 0;
/* fprintf(stderr, "enc0 used\n");*/
return;
}
/* find best encoding for alpha0 > alpha1 */
/* it's possible this encoding is better even if both alphaabsmin and alphaabsmax are true */
alphablockerror1 = 0x0;
alphablockerror2 = 0xffffffff;
alphablockerror3 = 0xffffffff;
if (alphaabsmin) alphause[0] = 0;
else alphause[0] = alphabase[0];
if (alphaabsmax) alphause[1] = 255;
else alphause[1] = alphabase[1];
/* calculate the 7 cut values, just the middle between 2 of the computed alpha values */
for (aindex = 0; aindex < 7; aindex++) {
/* don't forget here is always rounded down */
acutValues[aindex] = (alphause[0] * (2*aindex + 1) + alphause[1] * (14 - (2*aindex + 1))) / 14;
}
for (j = 0; j < numypixels; j++) {
for (i = 0; i < numxpixels; i++) {
/* maybe it's overkill to have the most complicated calculation just for the error
calculation which we only need to figure out if encoding1 or encoding2 is better... */
if (srccolors[j][i][3] > acutValues[0]) {
alphaenc1[4*j + i] = 0;
alphadist = srccolors[j][i][3] - alphause[1];
}
else if (srccolors[j][i][3] > acutValues[1]) {
alphaenc1[4*j + i] = 2;
alphadist = srccolors[j][i][3] - (alphause[1] * 6 + alphause[0] * 1) / 7;
}
else if (srccolors[j][i][3] > acutValues[2]) {
alphaenc1[4*j + i] = 3;
alphadist = srccolors[j][i][3] - (alphause[1] * 5 + alphause[0] * 2) / 7;
}
else if (srccolors[j][i][3] > acutValues[3]) {
alphaenc1[4*j + i] = 4;
alphadist = srccolors[j][i][3] - (alphause[1] * 4 + alphause[0] * 3) / 7;
}
else if (srccolors[j][i][3] > acutValues[4]) {
alphaenc1[4*j + i] = 5;
alphadist = srccolors[j][i][3] - (alphause[1] * 3 + alphause[0] * 4) / 7;
}
else if (srccolors[j][i][3] > acutValues[5]) {
alphaenc1[4*j + i] = 6;
alphadist = srccolors[j][i][3] - (alphause[1] * 2 + alphause[0] * 5) / 7;
}
else if (srccolors[j][i][3] > acutValues[6]) {
alphaenc1[4*j + i] = 7;
alphadist = srccolors[j][i][3] - (alphause[1] * 1 + alphause[0] * 6) / 7;
}
else {
alphaenc1[4*j + i] = 1;
alphadist = srccolors[j][i][3] - alphause[0];
}
alphablockerror1 += alphadist * alphadist;
}
}
/* for (i = 0; i < 16; i++) {
fprintf(stderr, "%d ", alphaenc1[i]);
}
fprintf(stderr, "cutVals ");
for (i = 0; i < 8; i++) {
fprintf(stderr, "%d ", acutValues[i]);
}
fprintf(stderr, "srcVals ");
for (j = 0; j < numypixels; j++)
for (i = 0; i < numxpixels; i++) {
fprintf(stderr, "%d ", srccolors[j][i][3]);
}
fprintf(stderr, "\n");
}*/
/* it's not very likely this encoding is better if both alphaabsmin and alphaabsmax
are false but try it anyway */
if (alphablockerror1 >= 32) {
/* don't bother if encoding is already very good, this condition should also imply
we have valid alphabase colors which we absolutely need (alphabase[0] <= alphabase[1]) */
alphablockerror2 = 0;
for (aindex = 0; aindex < 5; aindex++) {
/* don't forget here is always rounded down */
acutValues[aindex] = (alphabase[0] * (10 - (2*aindex + 1)) + alphabase[1] * (2*aindex + 1)) / 10;
}
for (j = 0; j < numypixels; j++) {
for (i = 0; i < numxpixels; i++) {
/* maybe it's overkill to have the most complicated calculation just for the error
calculation which we only need to figure out if encoding1 or encoding2 is better... */
if (srccolors[j][i][3] == 0) {
alphaenc2[4*j + i] = 6;
alphadist = 0;
}
else if (srccolors[j][i][3] == 255) {
alphaenc2[4*j + i] = 7;
alphadist = 0;
}
else if (srccolors[j][i][3] <= acutValues[0]) {
alphaenc2[4*j + i] = 0;
alphadist = srccolors[j][i][3] - alphabase[0];
}
else if (srccolors[j][i][3] <= acutValues[1]) {
alphaenc2[4*j + i] = 2;
alphadist = srccolors[j][i][3] - (alphabase[0] * 4 + alphabase[1] * 1) / 5;
}
else if (srccolors[j][i][3] <= acutValues[2]) {
alphaenc2[4*j + i] = 3;
alphadist = srccolors[j][i][3] - (alphabase[0] * 3 + alphabase[1] * 2) / 5;
}
else if (srccolors[j][i][3] <= acutValues[3]) {
alphaenc2[4*j + i] = 4;
alphadist = srccolors[j][i][3] - (alphabase[0] * 2 + alphabase[1] * 3) / 5;
}
else if (srccolors[j][i][3] <= acutValues[4]) {
alphaenc2[4*j + i] = 5;
alphadist = srccolors[j][i][3] - (alphabase[0] * 1 + alphabase[1] * 4) / 5;
}
else {
alphaenc2[4*j + i] = 1;
alphadist = srccolors[j][i][3] - alphabase[1];
}
alphablockerror2 += alphadist * alphadist;
}
}
/* skip this if the error is already very small
this encoding is MUCH better on average than #2 though, but expensive! */
if ((alphablockerror2 > 96) && (alphablockerror1 > 96)) {
GLshort blockerrlin1 = 0;
GLshort blockerrlin2 = 0;
GLubyte nralphainrangelow = 0;
GLubyte nralphainrangehigh = 0;
alphatest[0] = 0xff;
alphatest[1] = 0x0;
/* if we have large range it's likely there are values close to 0/255, try to map them to 0/255 */
for (j = 0; j < numypixels; j++) {
for (i = 0; i < numxpixels; i++) {
if ((srccolors[j][i][3] > alphatest[1]) && (srccolors[j][i][3] < (255 -(alphabase[1] - alphabase[0]) / 28)))
alphatest[1] = srccolors[j][i][3];
if ((srccolors[j][i][3] < alphatest[0]) && (srccolors[j][i][3] > (alphabase[1] - alphabase[0]) / 28))
alphatest[0] = srccolors[j][i][3];
}
}
/* shouldn't happen too often, don't really care about those degenerated cases */
if (alphatest[1] <= alphatest[0]) {
alphatest[0] = 1;
alphatest[1] = 254;
/* fprintf(stderr, "only 1 or 0 colors for encoding!\n");*/
}
for (aindex = 0; aindex < 5; aindex++) {
/* don't forget here is always rounded down */
acutValues[aindex] = (alphatest[0] * (10 - (2*aindex + 1)) + alphatest[1] * (2*aindex + 1)) / 10;
}
/* find the "average" difference between the alpha values and the next encoded value.
This is then used to calculate new base values.
Should there be some weighting, i.e. those values closer to alphatest[x] have more weight,
since they will see more improvement, and also because the values in the middle are somewhat
likely to get no improvement at all (because the base values might move in different directions)?
OTOH it would mean the values in the middle are even less likely to get an improvement
*/
for (j = 0; j < numypixels; j++) {
for (i = 0; i < numxpixels; i++) {
if (srccolors[j][i][3] <= alphatest[0] / 2) {
}
else if (srccolors[j][i][3] > ((255 + alphatest[1]) / 2)) {
}
else if (srccolors[j][i][3] <= acutValues[0]) {
blockerrlin1 += (srccolors[j][i][3] - alphatest[0]);
nralphainrangelow += 1;
}
else if (srccolors[j][i][3] <= acutValues[1]) {
blockerrlin1 += (srccolors[j][i][3] - (alphatest[0] * 4 + alphatest[1] * 1) / 5);
blockerrlin2 += (srccolors[j][i][3] - (alphatest[0] * 4 + alphatest[1] * 1) / 5);
nralphainrangelow += 1;
nralphainrangehigh += 1;
}
else if (srccolors[j][i][3] <= acutValues[2]) {
blockerrlin1 += (srccolors[j][i][3] - (alphatest[0] * 3 + alphatest[1] * 2) / 5);
blockerrlin2 += (srccolors[j][i][3] - (alphatest[0] * 3 + alphatest[1] * 2) / 5);
nralphainrangelow += 1;
nralphainrangehigh += 1;
}
else if (srccolors[j][i][3] <= acutValues[3]) {
blockerrlin1 += (srccolors[j][i][3] - (alphatest[0] * 2 + alphatest[1] * 3) / 5);
blockerrlin2 += (srccolors[j][i][3] - (alphatest[0] * 2 + alphatest[1] * 3) / 5);
nralphainrangelow += 1;
nralphainrangehigh += 1;
}
else if (srccolors[j][i][3] <= acutValues[4]) {
blockerrlin1 += (srccolors[j][i][3] - (alphatest[0] * 1 + alphatest[1] * 4) / 5);
blockerrlin2 += (srccolors[j][i][3] - (alphatest[0] * 1 + alphatest[1] * 4) / 5);
nralphainrangelow += 1;
nralphainrangehigh += 1;
}
else {
blockerrlin2 += (srccolors[j][i][3] - alphatest[1]);
nralphainrangehigh += 1;
}
}
}
/* shouldn't happen often, needed to avoid div by zero */
if (nralphainrangelow == 0) nralphainrangelow = 1;
if (nralphainrangehigh == 0) nralphainrangehigh = 1;
alphatest[0] = alphatest[0] + (blockerrlin1 / nralphainrangelow);
/* fprintf(stderr, "block err lin low %d, nr %d\n", blockerrlin1, nralphainrangelow);
fprintf(stderr, "block err lin high %d, nr %d\n", blockerrlin2, nralphainrangehigh);*/
/* again shouldn't really happen often... */
if (alphatest[0] < 0) {
alphatest[0] = 0;
/* fprintf(stderr, "adj alpha base val to 0\n");*/
}
alphatest[1] = alphatest[1] + (blockerrlin2 / nralphainrangehigh);
if (alphatest[1] > 255) {
alphatest[1] = 255;
/* fprintf(stderr, "adj alpha base val to 255\n");*/
}
alphablockerror3 = 0;
for (aindex = 0; aindex < 5; aindex++) {
/* don't forget here is always rounded down */
acutValues[aindex] = (alphatest[0] * (10 - (2*aindex + 1)) + alphatest[1] * (2*aindex + 1)) / 10;
}
for (j = 0; j < numypixels; j++) {
for (i = 0; i < numxpixels; i++) {
/* maybe it's overkill to have the most complicated calculation just for the error
calculation which we only need to figure out if encoding1 or encoding2 is better... */
if (srccolors[j][i][3] <= alphatest[0] / 2) {
alphaenc3[4*j + i] = 6;
alphadist = srccolors[j][i][3];
}
else if (srccolors[j][i][3] > ((255 + alphatest[1]) / 2)) {
alphaenc3[4*j + i] = 7;
alphadist = 255 - srccolors[j][i][3];
}
else if (srccolors[j][i][3] <= acutValues[0]) {
alphaenc3[4*j + i] = 0;
alphadist = srccolors[j][i][3] - alphatest[0];
}
else if (srccolors[j][i][3] <= acutValues[1]) {
alphaenc3[4*j + i] = 2;
alphadist = srccolors[j][i][3] - (alphatest[0] * 4 + alphatest[1] * 1) / 5;
}
else if (srccolors[j][i][3] <= acutValues[2]) {
alphaenc3[4*j + i] = 3;
alphadist = srccolors[j][i][3] - (alphatest[0] * 3 + alphatest[1] * 2) / 5;
}
else if (srccolors[j][i][3] <= acutValues[3]) {
alphaenc3[4*j + i] = 4;
alphadist = srccolors[j][i][3] - (alphatest[0] * 2 + alphatest[1] * 3) / 5;
}
else if (srccolors[j][i][3] <= acutValues[4]) {
alphaenc3[4*j + i] = 5;
alphadist = srccolors[j][i][3] - (alphatest[0] * 1 + alphatest[1] * 4) / 5;
}
else {
alphaenc3[4*j + i] = 1;
alphadist = srccolors[j][i][3] - alphatest[1];
}
alphablockerror3 += alphadist * alphadist;
}
}
}
}
/* write the alpha values and encoding back. */
if ((alphablockerror1 <= alphablockerror2) && (alphablockerror1 <= alphablockerror3)) {
/* if (alphablockerror1 > 96) fprintf(stderr, "enc1 used, error %d\n", alphablockerror1);*/
writedxt5encodedalphablock( blkaddr, alphause[1], alphause[0], alphaenc1 );
}
else if (alphablockerror2 <= alphablockerror3) {
/* if (alphablockerror2 > 96) fprintf(stderr, "enc2 used, error %d\n", alphablockerror2);*/
writedxt5encodedalphablock( blkaddr, alphabase[0], alphabase[1], alphaenc2 );
}
else {
/* fprintf(stderr, "enc3 used, error %d\n", alphablockerror3);*/
writedxt5encodedalphablock( blkaddr, (GLubyte)alphatest[0], (GLubyte)alphatest[1], alphaenc3 );
}
}
static void extractsrccolors( GLubyte srcpixels[4][4][4], const GLchan *srcaddr,
GLint srcRowStride, GLint numxpixels, GLint numypixels, GLint comps)
{
GLubyte i, j, c;
const GLchan *curaddr;
for (j = 0; j < numypixels; j++) {
curaddr = srcaddr + j * srcRowStride * comps;
for (i = 0; i < numxpixels; i++) {
for (c = 0; c < comps; c++) {
srcpixels[j][i][c] = *curaddr++ / (CHAN_MAX / 255);
}
}
}
}
void tx_compress_dxtn(GLint srccomps, GLint width, GLint height, const GLubyte *srcPixData,
GLenum destFormat, GLubyte *dest, GLint dstRowStride)
{
GLubyte *blkaddr = dest;
GLubyte srcpixels[4][4][4];
const GLchan *srcaddr = srcPixData;
GLint numxpixels, numypixels;
GLint i, j;
GLint dstRowDiff;
switch (destFormat) {
case GL_COMPRESSED_RGB_S3TC_DXT1_EXT:
case GL_COMPRESSED_RGBA_S3TC_DXT1_EXT:
/* hmm we used to get called without dstRowStride... */
dstRowDiff = dstRowStride >= (width * 2) ? dstRowStride - (((width + 3) & ~3) * 2) : 0;
/* fprintf(stderr, "dxt1 tex width %d tex height %d dstRowStride %d\n",
width, height, dstRowStride); */
for (j = 0; j < height; j += 4) {
if (height > j + 3) numypixels = 4;
else numypixels = height - j;
srcaddr = srcPixData + j * width * srccomps;
for (i = 0; i < width; i += 4) {
if (width > i + 3) numxpixels = 4;
else numxpixels = width - i;
extractsrccolors(srcpixels, srcaddr, width, numxpixels, numypixels, srccomps);
encodedxtcolorblockfaster(blkaddr, srcpixels, numxpixels, numypixels, destFormat);
srcaddr += srccomps * numxpixels;
blkaddr += 8;
}
blkaddr += dstRowDiff;
}
break;
case GL_COMPRESSED_RGBA_S3TC_DXT3_EXT:
dstRowDiff = dstRowStride >= (width * 4) ? dstRowStride - (((width + 3) & ~3) * 4) : 0;
/* fprintf(stderr, "dxt3 tex width %d tex height %d dstRowStride %d\n",
width, height, dstRowStride); */
for (j = 0; j < height; j += 4) {
if (height > j + 3) numypixels = 4;
else numypixels = height - j;
srcaddr = srcPixData + j * width * srccomps;
for (i = 0; i < width; i += 4) {
if (width > i + 3) numxpixels = 4;
else numxpixels = width - i;
extractsrccolors(srcpixels, srcaddr, width, numxpixels, numypixels, srccomps);
*blkaddr++ = (srcpixels[0][0][3] >> 4) | (srcpixels[0][1][3] & 0xf0);
*blkaddr++ = (srcpixels[0][2][3] >> 4) | (srcpixels[0][3][3] & 0xf0);
*blkaddr++ = (srcpixels[1][0][3] >> 4) | (srcpixels[1][1][3] & 0xf0);
*blkaddr++ = (srcpixels[1][2][3] >> 4) | (srcpixels[1][3][3] & 0xf0);
*blkaddr++ = (srcpixels[2][0][3] >> 4) | (srcpixels[2][1][3] & 0xf0);
*blkaddr++ = (srcpixels[2][2][3] >> 4) | (srcpixels[2][3][3] & 0xf0);
*blkaddr++ = (srcpixels[3][0][3] >> 4) | (srcpixels[3][1][3] & 0xf0);
*blkaddr++ = (srcpixels[3][2][3] >> 4) | (srcpixels[3][3][3] & 0xf0);
encodedxtcolorblockfaster(blkaddr, srcpixels, numxpixels, numypixels, destFormat);
srcaddr += srccomps * numxpixels;
blkaddr += 8;
}
blkaddr += dstRowDiff;
}
break;
case GL_COMPRESSED_RGBA_S3TC_DXT5_EXT:
dstRowDiff = dstRowStride >= (width * 4) ? dstRowStride - (((width + 3) & ~3) * 4) : 0;
/* fprintf(stderr, "dxt5 tex width %d tex height %d dstRowStride %d\n",
width, height, dstRowStride); */
for (j = 0; j < height; j += 4) {
if (height > j + 3) numypixels = 4;
else numypixels = height - j;
srcaddr = srcPixData + j * width * srccomps;
for (i = 0; i < width; i += 4) {
if (width > i + 3) numxpixels = 4;
else numxpixels = width - i;
extractsrccolors(srcpixels, srcaddr, width, numxpixels, numypixels, srccomps);
encodedxt5alpha(blkaddr, srcpixels, numxpixels, numypixels);
encodedxtcolorblockfaster(blkaddr + 8, srcpixels, numxpixels, numypixels, destFormat);
srcaddr += srccomps * numxpixels;
blkaddr += 16;
}
blkaddr += dstRowDiff;
}
break;
default:
fprintf(stderr, "libdxtn: Bad dstFormat %d in tx_compress_dxtn\n", destFormat);
return;
}
}

53
dll/3rdparty/dxtn/texstore.c → dll/3rdparty/dxtn/txc_dxtn.h vendored
View file

@ -1,8 +1,8 @@
/*
* Mesa 3-D graphics library
* Version: 6.3
* libtxc_dxtn
* Version: 1.0
*
* Copyright (C) 1999-2004 Brian Paul All Rights Reserved.
* Copyright (C) 2004 Roland Scheidegger All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
@ -22,33 +22,30 @@
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#ifndef _TXC_DXTN_H
#define _TXC_DXTN_H
#include <assert.h>
#include <GL/gl.h>
#include "types.h"
#include "internal.h"
typedef GLubyte GLchan;
#define UBYTE_TO_CHAN(b) (b)
#define CHAN_MAX 255
#define RCOMP 0
#define GCOMP 1
#define BCOMP 2
#define ACOMP 3
void fetch_2d_texel_rgb_dxt1(GLint srcRowStride, const GLubyte *pixdata,
GLint i, GLint j, GLvoid *texel);
void fetch_2d_texel_rgba_dxt1(GLint srcRowStride, const GLubyte *pixdata,
GLint i, GLint j, GLvoid *texel);
void fetch_2d_texel_rgba_dxt3(GLint srcRowStride, const GLubyte *pixdata,
GLint i, GLint j, GLvoid *texel);
void fetch_2d_texel_rgba_dxt5(GLint srcRowStride, const GLubyte *pixdata,
GLint i, GLint j, GLvoid *texel);
void
_mesa_upscale_teximage2d (unsigned int inWidth, unsigned int inHeight,
unsigned int outWidth, unsigned int outHeight,
unsigned int comps,
const byte *src, int srcRowStride,
byte *dest)
{
unsigned int i, j, k;
void tx_compress_dxtn(GLint srccomps, GLint width, GLint height,
const GLubyte *srcPixData, GLenum destformat,
GLubyte *dest, GLint dstRowStride);
assert(outWidth >= inWidth);
assert(outHeight >= inHeight);
for (i = 0; i < outHeight; i++) {
const int ii = i % inHeight;
for (j = 0; j < outWidth; j++) {
const int jj = j % inWidth;
for (k = 0; k < comps; k++) {
dest[(i * outWidth + j) * comps + k]
= src[ii * srcRowStride + jj * comps + k];
}
}
}
}
#endif /* _TXC_DXTN_H */

243
dll/3rdparty/dxtn/txc_fetch_dxtn.c vendored Normal file
View file

@ -0,0 +1,243 @@
/*
* libtxc_dxtn
* Version: 1.0
*
* Copyright (C) 2004 Roland Scheidegger All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* BRIAN PAUL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
* AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#include <stdio.h>
#include "txc_dxtn.h"
#define EXP5TO8R(packedcol) \
((((packedcol) >> 8) & 0xf8) | (((packedcol) >> 13) & 0x7))
#define EXP6TO8G(packedcol) \
((((packedcol) >> 3) & 0xfc) | (((packedcol) >> 9) & 0x3))
#define EXP5TO8B(packedcol) \
((((packedcol) << 3) & 0xf8) | (((packedcol) >> 2) & 0x7))
#define EXP4TO8(col) \
((col) | ((col) << 4))
/* inefficient. To be efficient, it would be necessary to decode 16 pixels at once */
static void dxt135_decode_imageblock ( const GLubyte *img_block_src,
GLint i, GLint j, GLuint dxt_type, GLvoid *texel ) {
GLchan *rgba = (GLchan *) texel;
const GLushort color0 = img_block_src[0] | (img_block_src[1] << 8);
const GLushort color1 = img_block_src[2] | (img_block_src[3] << 8);
const GLuint bits = img_block_src[4] | (img_block_src[5] << 8) |
(img_block_src[6] << 16) | (img_block_src[7] << 24);
/* What about big/little endian? */
GLubyte bit_pos = 2 * (j * 4 + i) ;
GLubyte code = (GLubyte) ((bits >> bit_pos) & 3);
rgba[ACOMP] = CHAN_MAX;
switch (code) {
case 0:
rgba[RCOMP] = UBYTE_TO_CHAN( EXP5TO8R(color0) );
rgba[GCOMP] = UBYTE_TO_CHAN( EXP6TO8G(color0) );
rgba[BCOMP] = UBYTE_TO_CHAN( EXP5TO8B(color0) );
break;
case 1:
rgba[RCOMP] = UBYTE_TO_CHAN( EXP5TO8R(color1) );
rgba[GCOMP] = UBYTE_TO_CHAN( EXP6TO8G(color1) );
rgba[BCOMP] = UBYTE_TO_CHAN( EXP5TO8B(color1) );
break;
case 2:
if ((dxt_type > 1) || (color0 > color1)) {
rgba[RCOMP] = UBYTE_TO_CHAN( ((EXP5TO8R(color0) * 2 + EXP5TO8R(color1)) / 3) );
rgba[GCOMP] = UBYTE_TO_CHAN( ((EXP6TO8G(color0) * 2 + EXP6TO8G(color1)) / 3) );
rgba[BCOMP] = UBYTE_TO_CHAN( ((EXP5TO8B(color0) * 2 + EXP5TO8B(color1)) / 3) );
}
else {
rgba[RCOMP] = UBYTE_TO_CHAN( ((EXP5TO8R(color0) + EXP5TO8R(color1)) / 2) );
rgba[GCOMP] = UBYTE_TO_CHAN( ((EXP6TO8G(color0) + EXP6TO8G(color1)) / 2) );
rgba[BCOMP] = UBYTE_TO_CHAN( ((EXP5TO8B(color0) + EXP5TO8B(color1)) / 2) );
}
break;
case 3:
if ((dxt_type > 1) || (color0 > color1)) {
rgba[RCOMP] = UBYTE_TO_CHAN( ((EXP5TO8R(color0) + EXP5TO8R(color1) * 2) / 3) );
rgba[GCOMP] = UBYTE_TO_CHAN( ((EXP6TO8G(color0) + EXP6TO8G(color1) * 2) / 3) );
rgba[BCOMP] = UBYTE_TO_CHAN( ((EXP5TO8B(color0) + EXP5TO8B(color1) * 2) / 3) );
}
else {
rgba[RCOMP] = 0;
rgba[GCOMP] = 0;
rgba[BCOMP] = 0;
if (dxt_type == 1) rgba[ACOMP] = UBYTE_TO_CHAN(0);
}
break;
default:
/* CANNOT happen (I hope) */
break;
}
}
void fetch_2d_texel_rgb_dxt1(GLint srcRowStride, const GLubyte *pixdata,
GLint i, GLint j, GLvoid *texel)
{
/* Extract the (i,j) pixel from pixdata and return it
* in texel[RCOMP], texel[GCOMP], texel[BCOMP], texel[ACOMP].
*/
const GLubyte *blksrc = (pixdata + ((srcRowStride + 3) / 4 * (j / 4) + (i / 4)) * 8);
dxt135_decode_imageblock(blksrc, (i&3), (j&3), 0, texel);
}
void fetch_2d_texel_rgba_dxt1(GLint srcRowStride, const GLubyte *pixdata,
GLint i, GLint j, GLvoid *texel)
{
/* Extract the (i,j) pixel from pixdata and return it
* in texel[RCOMP], texel[GCOMP], texel[BCOMP], texel[ACOMP].
*/
const GLubyte *blksrc = (pixdata + ((srcRowStride + 3) / 4 * (j / 4) + (i / 4)) * 8);
dxt135_decode_imageblock(blksrc, (i&3), (j&3), 1, texel);
}
void fetch_2d_texel_rgba_dxt3(GLint srcRowStride, const GLubyte *pixdata,
GLint i, GLint j, GLvoid *texel) {
/* Extract the (i,j) pixel from pixdata and return it
* in texel[RCOMP], texel[GCOMP], texel[BCOMP], texel[ACOMP].
*/
GLchan *rgba = (GLchan *) texel;
const GLubyte *blksrc = (pixdata + ((srcRowStride + 3) / 4 * (j / 4) + (i / 4)) * 16);
#if 0
/* Simple 32bit version. */
/* that's pretty brain-dead for a single pixel, isn't it? */
const GLubyte bit_pos = 4 * ((j&3) * 4 + (i&3));
const GLuint alpha_low = blksrc[0] | (blksrc[1] << 8) | (blksrc[2] << 16) | (blksrc[3] << 24);
const GLuint alpha_high = blksrc[4] | (blksrc[5] << 8) | (blksrc[6] << 16) | (blksrc[7] << 24);
dxt135_decode_imageblock(blksrc + 8, (i&3), (j&3), 2, texel);
if (bit_pos < 32)
rgba[ACOMP] = UBYTE_TO_CHAN( (GLubyte)(EXP4TO8((alpha_low >> bit_pos) & 15)) );
else
rgba[ACOMP] = UBYTE_TO_CHAN( (GLubyte)(EXP4TO8((alpha_high >> (bit_pos - 32)) & 15)) );
#endif
#if 1
/* TODO test this! */
const GLubyte anibble = (blksrc[((j&3) * 4 + (i&3)) / 2] >> (4 * (i&1))) & 0xf;
dxt135_decode_imageblock(blksrc + 8, (i&3), (j&3), 2, texel);
rgba[ACOMP] = UBYTE_TO_CHAN( (GLubyte)(EXP4TO8(anibble)) );
#endif
}
void fetch_2d_texel_rgba_dxt5(GLint srcRowStride, const GLubyte *pixdata,
GLint i, GLint j, GLvoid *texel) {
/* Extract the (i,j) pixel from pixdata and return it
* in texel[RCOMP], texel[GCOMP], texel[BCOMP], texel[ACOMP].
*/
GLchan *rgba = (GLchan *) texel;
const GLubyte *blksrc = (pixdata + ((srcRowStride + 3) / 4 * (j / 4) + (i / 4)) * 16);
const GLubyte alpha0 = blksrc[0];
const GLubyte alpha1 = blksrc[1];
#if 0
const GLubyte bit_pos = 3 * ((j&3) * 4 + (i&3));
/* simple 32bit version */
const GLuint bits_low = blksrc[2] | (blksrc[3] << 8) | (blksrc[4] << 16) | (blksrc[5] << 24);
const GLuint bits_high = blksrc[6] | (blksrc[7] << 8);
GLubyte code;
if (bit_pos < 30)
code = (GLubyte) ((bits_low >> bit_pos) & 7);
else if (bit_pos == 30)
code = (GLubyte) ((bits_low >> 30) & 3) | ((bits_high << 2) & 4);
else
code = (GLubyte) ((bits_high >> (bit_pos - 32)) & 7);
#endif
#if 1
/* TODO test this! */
const GLubyte bit_pos = ((j&3) * 4 + (i&3)) * 3;
const GLubyte acodelow = blksrc[2 + bit_pos / 8];
const GLubyte acodehigh = blksrc[3 + bit_pos / 8];
const GLubyte code = (acodelow >> (bit_pos & 0x7) |
(acodehigh << (8 - (bit_pos & 0x7)))) & 0x7;
#endif
dxt135_decode_imageblock(blksrc + 8, (i&3), (j&3), 2, texel);
#if 0
if (alpha0 > alpha1) {
switch (code) {
case 0:
rgba[ACOMP] = UBYTE_TO_CHAN( alpha0 );
break;
case 1:
rgba[ACOMP] = UBYTE_TO_CHAN( alpha1 );
break;
case 2:
case 3:
case 4:
case 5:
case 6:
case 7:
rgba[ACOMP] = UBYTE_TO_CHAN( ((alpha0 * (8 - code) + (alpha1 * (code - 1))) / 7) );
break;
}
}
else {
switch (code) {
case 0:
rgba[ACOMP] = UBYTE_TO_CHAN( alpha0 );
break;
case 1:
rgba[ACOMP] = UBYTE_TO_CHAN( alpha1 );
break;
case 2:
case 3:
case 4:
case 5:
rgba[ACOMP] = UBYTE_TO_CHAN( ((alpha0 * (6 - code) + (alpha1 * (code - 1))) / 5) );
break;
case 6:
rgba[ACOMP] = 0;
break;
case 7:
rgba[ACOMP] = CHAN_MAX;
break;
}
}
#endif
/* not sure. Which version is faster? */
#if 1
/* TODO test this */
if (code == 0)
rgba[ACOMP] = UBYTE_TO_CHAN( alpha0 );
else if (code == 1)
rgba[ACOMP] = UBYTE_TO_CHAN( alpha1 );
else if (alpha0 > alpha1)
rgba[ACOMP] = UBYTE_TO_CHAN( ((alpha0 * (8 - code) + (alpha1 * (code - 1))) / 7) );
else if (code < 6)
rgba[ACOMP] = UBYTE_TO_CHAN( ((alpha0 * (6 - code) + (alpha1 * (code - 1))) / 5) );
else if (code == 6)
rgba[ACOMP] = 0;
else
rgba[ACOMP] = CHAN_MAX;
#endif
}

11
dll/3rdparty/dxtn/types.h vendored
View file

@ -1,11 +0,0 @@
#ifndef TYPES_H_included
#define TYPES_H_included
/*****************************************************************************\
* 32bit types
\*****************************************************************************/
typedef unsigned char byte; /* 8-bit */
typedef unsigned short word; /* 16-bit */
typedef unsigned int dword; /* 32-bit */
#endif

110
dll/3rdparty/dxtn/wrapper.c vendored
View file

@ -1,110 +0,0 @@
/*
* Texture compression
* Version: 1.0
*
* Copyright (C) 2004 Daniel Borca All Rights Reserved.
*
* this is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* this is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GNU Make; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <assert.h>
#include "types.h"
#include "internal.h"
#include "dxtn.h"
#define GL_COMPRESSED_RGB_S3TC_DXT1_EXT 0x83F0
#define GL_COMPRESSED_RGBA_S3TC_DXT1_EXT 0x83F1
#define GL_COMPRESSED_RGBA_S3TC_DXT3_EXT 0x83F2
#define GL_COMPRESSED_RGBA_S3TC_DXT5_EXT 0x83F3
TAPI void TAPIENTRY
fetch_2d_texel_rgb_dxt1 (int texImage_RowStride,
const byte *texImage_Data,
int i, int j,
byte *texel)
{
dxt1_rgb_decode_1(texImage_Data, texImage_RowStride, i, j, texel);
}
TAPI void TAPIENTRY
fetch_2d_texel_rgba_dxt1 (int texImage_RowStride,
const byte *texImage_Data,
int i, int j,
byte *texel)
{
dxt1_rgba_decode_1(texImage_Data, texImage_RowStride, i, j, texel);
}
TAPI void TAPIENTRY
fetch_2d_texel_rgba_dxt3 (int texImage_RowStride,
const byte *texImage_Data,
int i, int j,
byte *texel)
{
dxt3_rgba_decode_1(texImage_Data, texImage_RowStride, i, j, texel);
}
TAPI void TAPIENTRY
fetch_2d_texel_rgba_dxt5 (int texImage_RowStride,
const byte *texImage_Data,
int i, int j,
byte *texel)
{
dxt5_rgba_decode_1(texImage_Data, texImage_RowStride, i, j, texel);
}
TAPI void TAPIENTRY
tx_compress_dxtn (int srccomps, int width, int height,
const byte *source, int destformat, byte *dest,
int destRowStride)
{
int srcRowStride = width * srccomps;
int rv;
switch (destformat) {
case GL_COMPRESSED_RGB_S3TC_DXT1_EXT:
rv = dxt1_rgb_encode(width, height, srccomps,
source, srcRowStride,
dest, destRowStride);
break;
case GL_COMPRESSED_RGBA_S3TC_DXT1_EXT:
rv = dxt1_rgba_encode(width, height, srccomps,
source, srcRowStride,
dest, destRowStride);
break;
case GL_COMPRESSED_RGBA_S3TC_DXT3_EXT:
rv = dxt3_rgba_encode(width, height, srccomps,
source, srcRowStride,
dest, destRowStride);
break;
case GL_COMPRESSED_RGBA_S3TC_DXT5_EXT:
rv = dxt5_rgba_encode(width, height, srccomps,
source, srcRowStride,
dest, destRowStride);
break;
default:
assert(0);
}
/*return rv;*/
}

6
sdk/cmake/config-amd64.cmake
View file

@ -37,12 +37,6 @@ set(_ELF_ FALSE CACHE BOOL
"Whether to compile support for ELF files.
Do not enable unless you know what you're doing.")
set(NSWPAT FALSE CACHE BOOL
"Whether to compile apps/libs with features covered software patents or not.
If you live in a country where software patents are valid/apply, don't
enable this (except they/you purchased a license from the patent owner).
This settings is disabled (0) by default.")
set(USERMODE TRUE CACHE BOOL
"Whether to compile any usermode parts. This is while kernel mode is under
heavy development and usermode part not relevant for bootcd.")

6
sdk/cmake/config-arm.cmake
View file

@ -38,12 +38,6 @@ set(_ELF_ FALSE CACHE BOOL
"Whether to compile support for ELF files.
Do not enable unless you know what you're doing.")
set(NSWPAT FALSE CACHE BOOL
"Whether to compile apps/libs with features covered software patents or not.
If you live in a country where software patents are valid/apply, don't
enable this (except they/you purchased a license from the patent owner).
This settings is disabled (0) by default.")
set(BUILD_MP TRUE CACHE BOOL
"Whether to compile the multi processor versions for ntoskrnl and hal.")

6
sdk/cmake/config.cmake
View file

@ -58,12 +58,6 @@ set(_ELF_ FALSE CACHE BOOL
"Whether to compile support for ELF files.
Do not enable unless you know what you're doing.")
set(NSWPAT FALSE CACHE BOOL
"Whether to build apps/libs with features covered by software patents.
If you live in a country where software patents are valid/apply, don't
enable this (except they/you purchased a license from the patent owner).
This setting is disabled by default.")
set(BUILD_MP TRUE CACHE BOOL
"Whether to build the multiprocessor versions of NTOSKRNL and HAL.")