-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathProcessAlpha.cpp
195 lines (168 loc) · 5.09 KB
/
ProcessAlpha.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
#include "Math.hpp"
#include "ProcessAlpha.hpp"
#include "ProcessCommon.hpp"
#include "Tables.hpp"
#include "Types.hpp"
#include "Vector.hpp"
static uint Average1( const uint8* data )
{
uint32 a = 4;
for( int i=0; i<8; i++ )
{
a += *data++;
}
return a / 8;
}
static void CalcErrorBlock( const uint8* data, uint err[2] )
{
for( int i=0; i<8; i++ )
{
uint v = *data++;
err[0] += v;
err[1] += v*v;
}
}
static uint CalcError( const uint block[2], uint average )
{
uint err = block[1];
err -= block[0] * 2 * average;
err += 8 * sq( average );
return err;
}
static void ProcessAverages( uint* a )
{
for( int i=0; i<2; i++ )
{
int c1 = mul8bit( a[i*2+1], 31 );
int c2 = mul8bit( a[i*2], 31 );
int diff = c2 - c1;
if( diff > 3 ) diff = 3;
else if( diff < -4 ) diff = -4;
int co = c1 + diff;
a[5+i*2] = ( c1 << 3 ) | ( c1 >> 2 );
a[4+i*2] = ( co << 3 ) | ( co >> 2 );
}
for( int i=0; i<4; i++ )
{
a[i] = g_avg2[mul8bit( a[i], 15 )];
}
}
static void EncodeAverages( uint64& _d, const uint* a, size_t idx )
{
auto d = _d;
d |= ( idx << 24 );
size_t base = idx << 1;
uint v;
if( ( idx & 0x2 ) == 0 )
{
v = ( a[base+0] >> 4 ) | ( a[base+1] & 0xF0 );
}
else
{
v = a[base+1] & 0xF8;
int32 c = ( ( a[base+0] & 0xF8 ) - ( a[base+1] & 0xF8 ) ) >> 3;
v |= c & ~0xFFFFFFF8;
}
d |= v | ( v << 8 ) | ( v << 16 );
_d = d;
}
uint64 ProcessAlpha( const uint8* src )
{
uint64 d = 0;
{
bool solid = true;
const uint8* ptr = src + 1;
for( int i=1; i<16; i++ )
{
if( *src != *ptr++ )
{
solid = false;
break;
}
}
if( solid )
{
uint c = *src & 0xF8;
d |= 0x02000000 | ( c << 16 ) | ( c << 8 ) | c;
return d;
}
}
uint8 b23[2][8];
const uint8* b[4] = { src+8, src, b23[0], b23[1] };
for( int i=0; i<4; i++ )
{
*(b23[1]+i*2) = *(src+i*4);
*(b23[0]+i*2) = *(src+i*4+3);
}
uint a[8];
for( int i=0; i<4; i++ )
{
a[i] = Average1( b[i] );
}
ProcessAverages( a );
uint err[4] = {};
for( int i=0; i<4; i++ )
{
uint errblock[2] = {};
CalcErrorBlock( b[i], errblock );
err[i/2] += CalcError( errblock, a[i] );
err[2+i/2] += CalcError( errblock, a[i+4] );
}
size_t idx = GetLeastError( err, 4 );
EncodeAverages( d, a, idx );
uint terr[2][8] = {};
uint16 tsel[16][8];
auto id = g_id[idx];
const uint8* data = src;
for( size_t i=0; i<16; i++ )
{
uint16* sel = tsel[i];
uint bid = id[i];
uint* ter = terr[bid%2];
uint8 c = *data++;
#ifdef __SSE4_1__
__m128i pix = _mm_set1_epi16(a[bid] - c);
// Taking the absolute value is way faster. The values are only used to sort, so the result will be the same.
__m128i error0 = _mm_abs_epi16(_mm_add_epi16(pix, g_table_SIMD[0]));
__m128i error1 = _mm_abs_epi16(_mm_add_epi16(pix, g_table_SIMD[1]));
__m128i error2 = _mm_abs_epi16(_mm_sub_epi16(pix, g_table_SIMD[0]));
__m128i error3 = _mm_abs_epi16(_mm_sub_epi16(pix, g_table_SIMD[1]));
__m128i index0 = _mm_and_si128(_mm_cmplt_epi16(error1, error0), _mm_set1_epi16(1));
__m128i minError0 = _mm_min_epi16(error0, error1);
__m128i index1 = _mm_sub_epi16(_mm_set1_epi16(2), _mm_cmplt_epi16(error3, error2));
__m128i minError1 = _mm_min_epi16(error2, error3);
__m128i minIndex = _mm_blendv_epi8(index0, index1, _mm_cmplt_epi16(minError1, minError0));
__m128i minError = _mm_min_epi16(minError0, minError1);
// Squaring the minimum error to produce correct values when adding
__m128i squareErrorLo = _mm_mullo_epi16(minError, minError);
__m128i squareErrorHi = _mm_mulhi_epi16(minError, minError);
__m128i squareErrorLow = _mm_unpacklo_epi16(squareErrorLo, squareErrorHi);
__m128i squareErrorHigh = _mm_unpackhi_epi16(squareErrorLo, squareErrorHi);
squareErrorLow = _mm_add_epi32(squareErrorLow, _mm_lddqu_si128(((__m128i*)ter) + 0));
_mm_storeu_si128(((__m128i*)ter) + 0, squareErrorLow);
squareErrorHigh = _mm_add_epi32(squareErrorHigh, _mm_lddqu_si128(((__m128i*)ter) + 1));
_mm_storeu_si128(((__m128i*)ter) + 1, squareErrorHigh);
_mm_storeu_si128((__m128i*)sel, minIndex);
#else
int32 pix = a[bid] - c;
for( int t=0; t<8; t++ )
{
const int32* tab = g_table[t];
uint idx = 0;
uint err = sq( tab[0] + pix );
for( int j=1; j<4; j++ )
{
uint local = sq( tab[j] + pix );
if( local < err )
{
err = local;
idx = j;
}
}
*sel++ = idx;
*ter++ += err;
}
#endif
}
return FixByteOrder( EncodeSelectors( d, terr, tsel, id ) );
}