-
Notifications
You must be signed in to change notification settings - Fork 5
/
ConvectionKernels_ETC.cpp
3147 lines (2570 loc) · 144 KB
/
ConvectionKernels_ETC.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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
Convection Texture Tools
Copyright (c) 2018-2019 Eric Lasota
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 THE AUTHORS OR COPYRIGHT HOLDERS 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.
-------------------------------------------------------------------------------------
Portions based on DirectX Texture Library (DirectXTex)
Copyright (c) Microsoft Corporation. All rights reserved.
Licensed under the MIT License.
http://go.microsoft.com/fwlink/?LinkId=248926
*/
#include "ConvectionKernels_Config.h"
#if !defined(CVTT_SINGLE_FILE) || defined(CVTT_SINGLE_FILE_IMPL)
#include "ConvectionKernels.h"
#include "ConvectionKernels_ETC.h"
#include "ConvectionKernels_ETC1.h"
#include "ConvectionKernels_ETC2.h"
#include "ConvectionKernels_ETC2_Rounding.h"
#include "ConvectionKernels_ParallelMath.h"
#include "ConvectionKernels_FakeBT709_Rounding.h"
#include <cmath>
const int cvtt::Internal::ETCComputer::g_flipTables[2][2][8] =
{
{
{ 0, 1, 4, 5, 8, 9, 12, 13 },
{ 2, 3, 6, 7, 10, 11, 14, 15 }
},
{
{ 0, 1, 2, 3, 4, 5, 6, 7 },
{ 8, 9, 10, 11, 12, 13, 14, 15 }
},
};
cvtt::ParallelMath::Float cvtt::Internal::ETCComputer::ComputeErrorUniform(const MUInt15 pixelA[3], const MUInt15 pixelB[3])
{
MSInt16 d0 = ParallelMath::LosslessCast<MSInt16>::Cast(pixelA[0]) - ParallelMath::LosslessCast<MSInt16>::Cast(pixelB[0]);
MFloat fd0 = ParallelMath::ToFloat(d0);
MFloat error = fd0 * fd0;
for (int ch = 1; ch < 3; ch++)
{
MSInt16 d = ParallelMath::LosslessCast<MSInt16>::Cast(pixelA[ch]) - ParallelMath::LosslessCast<MSInt16>::Cast(pixelB[ch]);
MFloat fd = ParallelMath::ToFloat(d);
error = error + fd * fd;
}
return error;
}
cvtt::ParallelMath::Float cvtt::Internal::ETCComputer::ComputeErrorWeighted(const MUInt15 reconstructed[3], const MFloat preWeightedPixel[3], const Options options)
{
MFloat dr = ParallelMath::ToFloat(reconstructed[0]) * options.redWeight - preWeightedPixel[0];
MFloat dg = ParallelMath::ToFloat(reconstructed[1]) * options.greenWeight - preWeightedPixel[1];
MFloat db = ParallelMath::ToFloat(reconstructed[2]) * options.blueWeight - preWeightedPixel[2];
return dr * dr + dg * dg + db * db;
}
cvtt::ParallelMath::Float cvtt::Internal::ETCComputer::ComputeErrorFakeBT709(const MUInt15 reconstructed[3], const MFloat preWeightedPixel[3])
{
MFloat yuv[3];
ConvertToFakeBT709(yuv, reconstructed);
MFloat dy = yuv[0] - preWeightedPixel[0];
MFloat du = yuv[1] - preWeightedPixel[1];
MFloat dv = yuv[2] - preWeightedPixel[2];
return dy * dy + du * du + dv * dv;
}
void cvtt::Internal::ETCComputer::TestHalfBlock(MFloat &outError, MUInt16 &outSelectors, MUInt15 quantizedPackedColor, const MUInt15 pixels[8][3], const MFloat preWeightedPixels[8][3], const MSInt16 modifiers[4], bool isDifferential, const Options &options)
{
MUInt15 quantized[3];
MUInt15 unquantized[3];
for (int ch = 0; ch < 3; ch++)
{
quantized[ch] = (ParallelMath::RightShift(quantizedPackedColor, (ch * 5)) & ParallelMath::MakeUInt15(31));
if (isDifferential)
unquantized[ch] = (quantized[ch] << 3) | ParallelMath::RightShift(quantized[ch], 2);
else
unquantized[ch] = (quantized[ch] << 4) | quantized[ch];
}
MUInt16 selectors = ParallelMath::MakeUInt16(0);
MFloat totalError = ParallelMath::MakeFloatZero();
MUInt15 u15_255 = ParallelMath::MakeUInt15(255);
MSInt16 s16_zero = ParallelMath::MakeSInt16(0);
MUInt15 unquantizedModified[4][3];
for (unsigned int s = 0; s < 4; s++)
for (int ch = 0; ch < 3; ch++)
unquantizedModified[s][ch] = ParallelMath::Min(ParallelMath::ToUInt15(ParallelMath::Max(ParallelMath::ToSInt16(unquantized[ch]) + modifiers[s], s16_zero)), u15_255);
bool isUniform = ((options.flags & cvtt::Flags::Uniform) != 0);
bool isFakeBT709 = ((options.flags & cvtt::Flags::ETC_UseFakeBT709) != 0);
for (int px = 0; px < 8; px++)
{
MFloat bestError = ParallelMath::MakeFloat(FLT_MAX);
MUInt16 bestSelector = ParallelMath::MakeUInt16(0);
for (unsigned int s = 0; s < 4; s++)
{
MFloat error;
if (isFakeBT709)
error = ComputeErrorFakeBT709(unquantizedModified[s], preWeightedPixels[px]);
else if (isUniform)
error = ComputeErrorUniform(pixels[px], unquantizedModified[s]);
else
error = ComputeErrorWeighted(unquantizedModified[s], preWeightedPixels[px], options);
ParallelMath::FloatCompFlag errorBetter = ParallelMath::Less(error, bestError);
bestSelector = ParallelMath::Select(ParallelMath::FloatFlagToInt16(errorBetter), ParallelMath::MakeUInt16(s), bestSelector);
bestError = ParallelMath::Min(error, bestError);
}
totalError = totalError + bestError;
selectors = selectors | (bestSelector << (px * 2));
}
outError = totalError;
outSelectors = selectors;
}
void cvtt::Internal::ETCComputer::TestHalfBlockPunchthrough(MFloat &outError, MUInt16 &outSelectors, MUInt15 quantizedPackedColor, const MUInt15 pixels[8][3], const MFloat preWeightedPixels[8][3], const ParallelMath::Int16CompFlag isTransparent[8], const MUInt15 modifier, const Options &options)
{
MUInt15 quantized[3];
MUInt15 unquantized[3];
for (int ch = 0; ch < 3; ch++)
{
quantized[ch] = (ParallelMath::RightShift(quantizedPackedColor, (ch * 5)) & ParallelMath::MakeUInt15(31));
unquantized[ch] = (quantized[ch] << 3) | ParallelMath::RightShift(quantized[ch], 2);
}
MUInt16 selectors = ParallelMath::MakeUInt16(0);
MFloat totalError = ParallelMath::MakeFloatZero();
MUInt15 u15_255 = ParallelMath::MakeUInt15(255);
MSInt16 s16_zero = ParallelMath::MakeSInt16(0);
MUInt15 unquantizedModified[3][3];
for (int ch = 0; ch < 3; ch++)
{
unquantizedModified[0][ch] = ParallelMath::Max(unquantized[ch], modifier) - modifier;
unquantizedModified[1][ch] = unquantized[ch];
unquantizedModified[2][ch] = ParallelMath::Min(unquantized[ch] + modifier, u15_255);
}
bool isUniform = ((options.flags & cvtt::Flags::Uniform) != 0);
bool isFakeBT709 = ((options.flags & cvtt::Flags::ETC_UseFakeBT709) != 0);
for (int px = 0; px < 8; px++)
{
ParallelMath::FloatCompFlag isTransparentFloat = ParallelMath::Int16FlagToFloat(isTransparent[px]);
MFloat bestError = ParallelMath::MakeFloat(FLT_MAX);
MUInt15 bestSelector = ParallelMath::MakeUInt15(0);
for (unsigned int s = 0; s < 3; s++)
{
MFloat error;
if (isFakeBT709)
error = ComputeErrorFakeBT709(unquantizedModified[s], preWeightedPixels[px]);
else if (isUniform)
error = ComputeErrorUniform(pixels[px], unquantizedModified[s]);
else
error = ComputeErrorWeighted(unquantizedModified[s], preWeightedPixels[px], options);
ParallelMath::FloatCompFlag errorBetter = ParallelMath::Less(error, bestError);
bestSelector = ParallelMath::Select(ParallelMath::FloatFlagToInt16(errorBetter), ParallelMath::MakeUInt15(s), bestSelector);
bestError = ParallelMath::Min(error, bestError);
}
// Annoying quirk: The ETC encoding machinery assumes that selectors are in the table order in the spec, which isn't
// the same as their encoding bits, so the transparent index is actually 1 and the valid indexes are 0, 2, and 3.
// Remap selector 1 to 2, and 2 to 3
bestSelector = ParallelMath::Min(ParallelMath::MakeUInt15(3), bestSelector << 1);
// Mark zero transparent as
ParallelMath::ConditionalSet(bestError, isTransparentFloat, ParallelMath::MakeFloatZero());
ParallelMath::ConditionalSet(bestSelector, isTransparent[px], ParallelMath::MakeUInt15(1));
totalError = totalError + bestError;
selectors = selectors | (ParallelMath::LosslessCast<MUInt16>::Cast(bestSelector) << (px * 2));
}
outError = totalError;
outSelectors = selectors;
}
void cvtt::Internal::ETCComputer::FindBestDifferentialCombination(int flip, int d, const ParallelMath::Int16CompFlag canIgnoreSector[2], ParallelMath::Int16CompFlag& bestIsThisMode, MFloat& bestTotalError, MUInt15& bestFlip, MUInt15& bestD, MUInt15 bestColors[2], MUInt16 bestSelectors[2], MUInt15 bestTables[2], DifferentialResolveStorage &drs)
{
// We do this part scalar because most of the cost benefit of parallelization is in error evaluation,
// and this code has a LOT of early-outs and disjointed index lookups that vary heavily between blocks
// and save a lot of time.
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
bool canIgnore[2] = { ParallelMath::Extract(canIgnoreSector[0], block), ParallelMath::Extract(canIgnoreSector[1], block) };
bool canIgnoreEither = canIgnore[0] || canIgnore[1];
float blockBestTotalError = ParallelMath::Extract(bestTotalError, block);
float bestDiffErrors[2] = { FLT_MAX, FLT_MAX };
uint16_t bestDiffSelectors[2] = { 0, 0 };
uint16_t bestDiffColors[2] = { 0, 0 };
uint16_t bestDiffTables[2] = { 0, 0 };
for (int sector = 0; sector < 2; sector++)
{
unsigned int sectorNumAttempts = ParallelMath::Extract(drs.diffNumAttempts[sector], block);
for (unsigned int i = 0; i < sectorNumAttempts; i++)
{
float error = ParallelMath::Extract(drs.diffErrors[sector][i], block);
if (error < bestDiffErrors[sector])
{
bestDiffErrors[sector] = error;
bestDiffSelectors[sector] = ParallelMath::Extract(drs.diffSelectors[sector][i], block);
bestDiffColors[sector] = ParallelMath::Extract(drs.diffColors[sector][i], block);
bestDiffTables[sector] = ParallelMath::Extract(drs.diffTables[sector][i], block);
}
}
}
if (canIgnore[0])
bestDiffColors[0] = bestDiffColors[1];
else if (canIgnore[1])
bestDiffColors[1] = bestDiffColors[0];
// The best differential possibilities must be better than the best total error
if (bestDiffErrors[0] + bestDiffErrors[1] < blockBestTotalError)
{
// Fast path if the best possible case is legal
if (canIgnoreEither || ETCDifferentialIsLegalScalar(bestDiffColors[0], bestDiffColors[1]))
{
ParallelMath::PutBoolInt16(bestIsThisMode, block, true);
ParallelMath::PutFloat(bestTotalError, block, bestDiffErrors[0] + bestDiffErrors[1]);
ParallelMath::PutUInt15(bestFlip, block, flip);
ParallelMath::PutUInt15(bestD, block, d);
for (int sector = 0; sector < 2; sector++)
{
ParallelMath::PutUInt15(bestColors[sector], block, bestDiffColors[sector]);
ParallelMath::PutUInt16(bestSelectors[sector], block, bestDiffSelectors[sector]);
ParallelMath::PutUInt15(bestTables[sector], block, bestDiffTables[sector]);
}
}
else
{
// Slow path: Sort the possible cases by quality, and search valid combinations
// TODO: Pre-flatten the error lists so this is nicer to cache
unsigned int numSortIndexes[2] = { 0, 0 };
for (int sector = 0; sector < 2; sector++)
{
unsigned int sectorNumAttempts = ParallelMath::Extract(drs.diffNumAttempts[sector], block);
for (unsigned int i = 0; i < sectorNumAttempts; i++)
{
if (ParallelMath::Extract(drs.diffErrors[sector][i], block) < blockBestTotalError)
drs.attemptSortIndexes[sector][numSortIndexes[sector]++] = i;
}
struct SortPredicate
{
const MFloat *diffErrors;
int block;
bool operator()(uint16_t a, uint16_t b) const
{
float errorA = ParallelMath::Extract(diffErrors[a], block);
float errorB = ParallelMath::Extract(diffErrors[b], block);
if (errorA < errorB)
return true;
if (errorA > errorB)
return false;
return a < b;
}
};
SortPredicate sp;
sp.diffErrors = drs.diffErrors[sector];
sp.block = block;
std::sort<uint16_t*, const SortPredicate&>(drs.attemptSortIndexes[sector], drs.attemptSortIndexes[sector] + numSortIndexes[sector], sp);
}
int scannedElements = 0;
for (unsigned int i = 0; i < numSortIndexes[0]; i++)
{
unsigned int attemptIndex0 = drs.attemptSortIndexes[0][i];
float error0 = ParallelMath::Extract(drs.diffErrors[0][attemptIndex0], block);
scannedElements++;
if (error0 >= blockBestTotalError)
break;
float maxError1 = ParallelMath::Extract(bestTotalError, block) - error0;
uint16_t diffColor0 = ParallelMath::Extract(drs.diffColors[0][attemptIndex0], block);
if (maxError1 < bestDiffErrors[1])
break;
for (unsigned int j = 0; j < numSortIndexes[1]; j++)
{
unsigned int attemptIndex1 = drs.attemptSortIndexes[1][j];
float error1 = ParallelMath::Extract(drs.diffErrors[1][attemptIndex1], block);
scannedElements++;
if (error1 >= maxError1)
break;
uint16_t diffColor1 = ParallelMath::Extract(drs.diffColors[1][attemptIndex1], block);
if (ETCDifferentialIsLegalScalar(diffColor0, diffColor1))
{
blockBestTotalError = error0 + error1;
ParallelMath::PutBoolInt16(bestIsThisMode, block, true);
ParallelMath::PutFloat(bestTotalError, block, blockBestTotalError);
ParallelMath::PutUInt15(bestFlip, block, flip);
ParallelMath::PutUInt15(bestD, block, d);
ParallelMath::PutUInt15(bestColors[0], block, diffColor0);
ParallelMath::PutUInt15(bestColors[1], block, diffColor1);
ParallelMath::PutUInt16(bestSelectors[0], block, ParallelMath::Extract(drs.diffSelectors[0][attemptIndex0], block));
ParallelMath::PutUInt16(bestSelectors[1], block, ParallelMath::Extract(drs.diffSelectors[1][attemptIndex1], block));
ParallelMath::PutUInt15(bestTables[0], block, ParallelMath::Extract(drs.diffTables[0][attemptIndex0], block));
ParallelMath::PutUInt15(bestTables[1], block, ParallelMath::Extract(drs.diffTables[1][attemptIndex1], block));
break;
}
}
}
}
}
}
}
cvtt::ParallelMath::Int16CompFlag cvtt::Internal::ETCComputer::ETCDifferentialIsLegalForChannel(const MUInt15 &a, const MUInt15 &b)
{
MSInt16 diff = ParallelMath::LosslessCast<MSInt16>::Cast(b) - ParallelMath::LosslessCast<MSInt16>::Cast(a);
return ParallelMath::Less(ParallelMath::MakeSInt16(-5), diff) & ParallelMath::Less(diff, ParallelMath::MakeSInt16(4));
}
cvtt::ParallelMath::Int16CompFlag cvtt::Internal::ETCComputer::ETCDifferentialIsLegal(const MUInt15 &a, const MUInt15 &b)
{
MUInt15 mask = ParallelMath::MakeUInt15(31);
return ETCDifferentialIsLegalForChannel(ParallelMath::RightShift(a, 10), ParallelMath::RightShift(b, 10))
& ETCDifferentialIsLegalForChannel(ParallelMath::RightShift(a, 5) & mask, ParallelMath::RightShift(b, 5) & mask)
& ETCDifferentialIsLegalForChannel(a & mask, b & mask);
}
bool cvtt::Internal::ETCComputer::ETCDifferentialIsLegalForChannelScalar(const uint16_t &a, const uint16_t &b)
{
int16_t diff = static_cast<int16_t>(b) - static_cast<int16_t>(a);
return (-4 <= diff) && (diff <= 3);
}
bool cvtt::Internal::ETCComputer::ETCDifferentialIsLegalScalar(const uint16_t &a, const uint16_t &b)
{
MUInt15 mask = ParallelMath::MakeUInt15(31);
return ETCDifferentialIsLegalForChannelScalar((a >> 10), (b >> 10))
& ETCDifferentialIsLegalForChannelScalar((a >> 5) & 31, (b >> 5) & 31)
& ETCDifferentialIsLegalForChannelScalar(a & 31, b & 31);
}
void cvtt::Internal::ETCComputer::EncodeTMode(uint8_t *outputBuffer, MFloat &bestError, const ParallelMath::Int16CompFlag isIsolated[16], const MUInt15 pixels[16][3], const MFloat preWeightedPixels[16][3], const Options &options)
{
bool isUniform = ((options.flags & cvtt::Flags::Uniform) != 0);
bool isFakeBT709 = ((options.flags & cvtt::Flags::ETC_UseFakeBT709) != 0);
ParallelMath::Int16CompFlag bestIsThisMode = ParallelMath::MakeBoolInt16(false);
MUInt15 isolatedTotal[3] = { ParallelMath::MakeUInt15(0), ParallelMath::MakeUInt15(0), ParallelMath::MakeUInt15(0) };
MUInt15 lineTotal[3] = { ParallelMath::MakeUInt15(0), ParallelMath::MakeUInt15(0), ParallelMath::MakeUInt15(0) };
MUInt15 numPixelsIsolated = ParallelMath::MakeUInt15(0);
// To speed this up, we compute line total as the sum, then subtract out isolated
for (unsigned int px = 0; px < 16; px++)
{
for (int ch = 0; ch < 3; ch++)
{
isolatedTotal[ch] = isolatedTotal[ch] + ParallelMath::SelectOrZero(isIsolated[px], pixels[px][ch]);
lineTotal[ch] = lineTotal[ch] + pixels[px][ch];
}
numPixelsIsolated = numPixelsIsolated + ParallelMath::SelectOrZero(isIsolated[px], ParallelMath::MakeUInt15(1));
}
for (int ch = 0; ch < 3; ch++)
lineTotal[ch] = lineTotal[ch] - isolatedTotal[ch];
MUInt15 numPixelsLine = ParallelMath::MakeUInt15(16) - numPixelsIsolated;
MUInt15 isolatedAverageQuantized[3];
MUInt15 isolatedAverageTargets[3];
{
int divisors[ParallelMath::ParallelSize];
for (int block = 0; block < ParallelMath::ParallelSize; block++)
divisors[block] = ParallelMath::Extract(numPixelsIsolated, block) * 34;
MUInt15 addend = (numPixelsIsolated << 4) | numPixelsIsolated;
for (int ch = 0; ch < 3; ch++)
{
// isolatedAverageQuantized[ch] = (isolatedTotal[ch] * 2 + numPixelsIsolated * 17) / (numPixelsIsolated * 34);
MUInt15 numerator = isolatedTotal[ch] + isolatedTotal[ch];
if (!isFakeBT709)
numerator = numerator + addend;
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
int divisor = divisors[block];
if (divisor == 0)
ParallelMath::PutUInt15(isolatedAverageQuantized[ch], block, 0);
else
ParallelMath::PutUInt15(isolatedAverageQuantized[ch], block, ParallelMath::Extract(numerator, block) / divisor);
}
isolatedAverageTargets[ch] = numerator;
}
}
if (isFakeBT709)
ResolveTHFakeBT709Rounding(isolatedAverageQuantized, isolatedAverageTargets, numPixelsIsolated);
MUInt15 isolatedColor[3];
for (int ch = 0; ch < 3; ch++)
isolatedColor[ch] = (isolatedAverageQuantized[ch]) | (isolatedAverageQuantized[ch] << 4);
MFloat isolatedError[16];
for (int px = 0; px < 16; px++)
{
if (isFakeBT709)
isolatedError[px] = ComputeErrorFakeBT709(isolatedColor, preWeightedPixels[px]);
else if (isUniform)
isolatedError[px] = ComputeErrorUniform(pixels[px], isolatedColor);
else
isolatedError[px] = ComputeErrorWeighted(isolatedColor, preWeightedPixels[px], options);
}
MSInt32 bestSelectors = ParallelMath::MakeSInt32(0);
MUInt15 bestTable = ParallelMath::MakeUInt15(0);
MUInt15 bestLineColor = ParallelMath::MakeUInt15(0);
MSInt16 maxLine = ParallelMath::LosslessCast<MSInt16>::Cast(numPixelsLine);
MSInt16 minLine = ParallelMath::MakeSInt16(0) - maxLine;
int16_t clusterMaxLine = 0;
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
int16_t blockMaxLine = ParallelMath::Extract(maxLine, block);
if (blockMaxLine > clusterMaxLine)
clusterMaxLine = blockMaxLine;
}
int16_t clusterMinLine = -clusterMaxLine;
int lineDivisors[ParallelMath::ParallelSize];
for (int block = 0; block < ParallelMath::ParallelSize; block++)
lineDivisors[block] = ParallelMath::Extract(numPixelsLine, block) * 34;
MUInt15 lineAddend = (numPixelsLine << 4) | numPixelsLine;
for (int table = 0; table < 8; table++)
{
int numUniqueColors[ParallelMath::ParallelSize];
MUInt15 uniqueQuantizedColors[31];
for (int block = 0; block < ParallelMath::ParallelSize; block++)
numUniqueColors[block] = 0;
MUInt15 modifier = ParallelMath::MakeUInt15(cvtt::Tables::ETC2::g_thModifierTable[table]);
MUInt15 modifierOffset = (modifier + modifier);
for (int16_t offsetPremultiplier = clusterMinLine; offsetPremultiplier <= clusterMaxLine; offsetPremultiplier++)
{
MSInt16 clampedOffsetPremultiplier = ParallelMath::Max(minLine, ParallelMath::Min(maxLine, ParallelMath::MakeSInt16(offsetPremultiplier)));
MSInt16 modifierAddend = ParallelMath::CompactMultiply(clampedOffsetPremultiplier, modifierOffset);
MUInt15 quantized[3];
if (isFakeBT709)
{
MUInt15 targets[3];
for (int ch = 0; ch < 3; ch++)
{
//quantized[ch] = std::min<int16_t>(15, std::max(0, (lineTotal[ch] * 2 + modifierOffset * offsetPremultiplier)) / (numDAIILine * 34));
MUInt15 numerator = ParallelMath::LosslessCast<MUInt15>::Cast(ParallelMath::Max(ParallelMath::MakeSInt16(0), ParallelMath::LosslessCast<MSInt16>::Cast(lineTotal[ch] + lineTotal[ch]) + modifierAddend));
MUInt15 divided = ParallelMath::MakeUInt15(0);
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
int divisor = lineDivisors[block];
if (divisor == 0)
ParallelMath::PutUInt15(divided, block, 0);
else
ParallelMath::PutUInt15(divided, block, ParallelMath::Extract(numerator, block) / divisor);
}
quantized[ch] = ParallelMath::Min(ParallelMath::MakeUInt15(15), divided);
targets[ch] = numerator;
}
ResolveTHFakeBT709Rounding(quantized, targets, numPixelsLine);
}
else
{
for (int ch = 0; ch < 3; ch++)
{
//quantized[ch] = std::min<int16_t>(15, std::max(0, (lineTotal[ch] * 2 + numDAIILine * 17 + modifierOffset * offsetPremultiplier)) / (numDAIILine * 34));
MUInt15 numerator = ParallelMath::LosslessCast<MUInt15>::Cast(ParallelMath::Max(ParallelMath::MakeSInt16(0), ParallelMath::LosslessCast<MSInt16>::Cast(lineTotal[ch] + lineTotal[ch] + lineAddend) + modifierAddend));
MUInt15 divided = ParallelMath::MakeUInt15(0);
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
int divisor = lineDivisors[block];
if (divisor == 0)
ParallelMath::PutUInt15(divided, block, 0);
else
ParallelMath::PutUInt15(divided, block, ParallelMath::Extract(numerator, block) / divisor);
}
quantized[ch] = ParallelMath::Min(ParallelMath::MakeUInt15(15), divided);
}
}
MUInt15 packedColor = quantized[0] | (quantized[1] << 5) | (quantized[2] << 10);
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
uint16_t blockPackedColor = ParallelMath::Extract(packedColor, block);
if (numUniqueColors[block] == 0 || blockPackedColor != ParallelMath::Extract(uniqueQuantizedColors[numUniqueColors[block] - 1], block))
ParallelMath::PutUInt15(uniqueQuantizedColors[numUniqueColors[block]++], block, blockPackedColor);
}
}
// Stripe unfilled unique colors
int maxUniqueColors = 0;
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
if (numUniqueColors[block] > maxUniqueColors)
maxUniqueColors = numUniqueColors[block];
}
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
uint16_t fillColor = ParallelMath::Extract(uniqueQuantizedColors[0], block);
int numUnique = numUniqueColors[block];
for (int fill = numUnique + 1; fill < maxUniqueColors; fill++)
ParallelMath::PutUInt15(uniqueQuantizedColors[fill], block, fillColor);
}
for (int ci = 0; ci < maxUniqueColors; ci++)
{
MUInt15 lineColors[3][3];
for (int ch = 0; ch < 3; ch++)
{
MUInt15 quantizedChannel = (ParallelMath::RightShift(uniqueQuantizedColors[ci], (ch * 5)) & ParallelMath::MakeUInt15(15));
MUInt15 unquantizedColor = (quantizedChannel << 4) | quantizedChannel;
lineColors[0][ch] = ParallelMath::Min(ParallelMath::MakeUInt15(255), unquantizedColor + modifier);
lineColors[1][ch] = unquantizedColor;
lineColors[2][ch] = ParallelMath::ToUInt15(ParallelMath::Max(ParallelMath::MakeSInt16(0), ParallelMath::LosslessCast<MSInt16>::Cast(unquantizedColor) - ParallelMath::LosslessCast<MSInt16>::Cast(modifier)));
}
MSInt32 selectors = ParallelMath::MakeSInt32(0);
MFloat error = ParallelMath::MakeFloatZero();
for (int px = 0; px < 16; px++)
{
MFloat pixelError = isolatedError[px];
MUInt15 pixelBestSelector = ParallelMath::MakeUInt15(0);
for (int i = 0; i < 3; i++)
{
MFloat error = isUniform ? ComputeErrorUniform(lineColors[i], pixels[px]) : ComputeErrorWeighted(lineColors[i], preWeightedPixels[px], options);
ParallelMath::FloatCompFlag errorBetter = ParallelMath::Less(error, pixelError);
pixelError = ParallelMath::Min(error, pixelError);
pixelBestSelector = ParallelMath::Select(ParallelMath::FloatFlagToInt16(errorBetter), ParallelMath::MakeUInt15(i + 1), pixelBestSelector);
}
error = error + pixelError;
selectors = selectors | (ParallelMath::ToInt32(pixelBestSelector) << (px * 2));
}
ParallelMath::Int16CompFlag errorBetter = ParallelMath::FloatFlagToInt16(ParallelMath::Less(error, bestError));
bestError = ParallelMath::Min(error, bestError);
if (ParallelMath::AnySet(errorBetter))
{
ParallelMath::ConditionalSet(bestLineColor, errorBetter, uniqueQuantizedColors[ci]);
ParallelMath::ConditionalSet(bestSelectors, errorBetter, selectors);
ParallelMath::ConditionalSet(bestTable, errorBetter, ParallelMath::MakeUInt15(table));
bestIsThisMode = bestIsThisMode | errorBetter;
}
}
}
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
if (ParallelMath::Extract(bestIsThisMode, block))
{
uint32_t lowBits = 0;
uint32_t highBits = 0;
uint16_t blockBestLineColor = ParallelMath::Extract(bestLineColor, block);
ParallelMath::ScalarUInt16 blockIsolatedAverageQuantized[3];
for (int ch = 0; ch < 3; ch++)
blockIsolatedAverageQuantized[ch] = ParallelMath::Extract(isolatedAverageQuantized[ch], block);
uint16_t blockBestTable = ParallelMath::Extract(bestTable, block);
int32_t blockBestSelectors = ParallelMath::Extract(bestSelectors, block);
ParallelMath::ScalarUInt16 lineColor[3];
for (int ch = 0; ch < 3; ch++)
lineColor[ch] = (blockBestLineColor >> (ch * 5)) & 15;
EmitTModeBlock(outputBuffer + block * 8, lineColor, blockIsolatedAverageQuantized, blockBestSelectors, blockBestTable, true);
}
}
}
void cvtt::Internal::ETCComputer::EncodeHMode(uint8_t *outputBuffer, MFloat &bestError, const ParallelMath::Int16CompFlag groupings[16], const MUInt15 pixels[16][3], HModeEval &he, const MFloat preWeightedPixels[16][3], const Options &options)
{
bool isUniform = ((options.flags & cvtt::Flags::Uniform) != 0);
bool isFakeBT709 = ((options.flags & cvtt::Flags::ETC_UseFakeBT709) != 0);
MUInt15 zero15 = ParallelMath::MakeUInt15(0);
MUInt15 counts[2] = { zero15, zero15 };
ParallelMath::Int16CompFlag bestIsThisMode = ParallelMath::MakeBoolInt16(false);
MUInt15 totals[2][3] =
{
{ zero15, zero15, zero15 },
{ zero15, zero15, zero15 }
};
for (unsigned int px = 0; px < 16; px++)
{
for (int ch = 0; ch < 3; ch++)
{
totals[0][ch] = totals[0][ch] + pixels[px][ch];
totals[1][ch] = totals[1][ch] + ParallelMath::SelectOrZero(groupings[px], pixels[px][ch]);
}
counts[1] = counts[1] + ParallelMath::SelectOrZero(groupings[px], ParallelMath::MakeUInt15(1));
}
for (int ch = 0; ch < 3; ch++)
totals[0][ch] = totals[0][ch] - totals[1][ch];
counts[0] = ParallelMath::MakeUInt15(16) - counts[1];
MUInt16 bestSectorBits = ParallelMath::MakeUInt16(0);
MUInt16 bestSignBits = ParallelMath::MakeUInt16(0);
MUInt15 bestColors[2] = { zero15, zero15 };
MUInt15 bestTable = ParallelMath::MakeUInt15(0);
for (int table = 0; table < 8; table++)
{
MUInt15 numUniqueColors = zero15;
int modifier = cvtt::Tables::ETC1::g_thModifierTable[table];
for (int sector = 0; sector < 2; sector++)
{
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
int blockNumUniqueColors = 0;
uint16_t blockUniqueQuantizedColors[31];
int maxOffsetMultiplier = ParallelMath::Extract(counts[sector], block);
int minOffsetMultiplier = -maxOffsetMultiplier;
int modifierOffset = modifier * 2;
int blockSectorCounts = ParallelMath::Extract(counts[sector], block);
int blockSectorTotals[3];
for (int ch = 0; ch < 3; ch++)
blockSectorTotals[ch] = ParallelMath::Extract(totals[sector][ch], block);
for (int offsetPremultiplier = minOffsetMultiplier; offsetPremultiplier <= maxOffsetMultiplier; offsetPremultiplier++)
{
// TODO: This isn't ideal for FakeBT709
int16_t quantized[3];
for (int ch = 0; ch < 3; ch++)
{
if (blockSectorCounts == 0)
quantized[ch] = 0;
else
quantized[ch] = std::min<int16_t>(15, std::max<int16_t>(0, (blockSectorTotals[ch] * 2 + blockSectorCounts * 17 + modifierOffset * offsetPremultiplier)) / (blockSectorCounts * 34));
}
uint16_t packedColor = (quantized[0] << 10) | (quantized[1] << 5) | quantized[2];
if (blockNumUniqueColors == 0 || packedColor != blockUniqueQuantizedColors[blockNumUniqueColors - 1])
{
assert(blockNumUniqueColors < 32);
blockUniqueQuantizedColors[blockNumUniqueColors++] = packedColor;
}
}
ParallelMath::PutUInt15(he.numUniqueColors[sector], block, blockNumUniqueColors);
int baseIndex = 0;
if (sector == 1)
baseIndex = ParallelMath::Extract(he.numUniqueColors[0], block);
for (int i = 0; i < blockNumUniqueColors; i++)
ParallelMath::PutUInt15(he.uniqueQuantizedColors[baseIndex + i], block, blockUniqueQuantizedColors[i]);
}
}
MUInt15 totalColors = he.numUniqueColors[0] + he.numUniqueColors[1];
int maxErrorColors = 0;
for (int block = 0; block < ParallelMath::ParallelSize; block++)
maxErrorColors = std::max<int>(maxErrorColors, ParallelMath::Extract(totalColors, block));
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
int lastColor = ParallelMath::Extract(totalColors, block);
uint16_t stripeColor = ParallelMath::Extract(he.uniqueQuantizedColors[0], block);
for (int i = lastColor; i < maxErrorColors; i++)
ParallelMath::PutUInt15(he.uniqueQuantizedColors[i], block, stripeColor);
}
for (int ci = 0; ci < maxErrorColors; ci++)
{
MUInt15 fifteen = ParallelMath::MakeUInt15(15);
MUInt15 twoFiftyFive = ParallelMath::MakeUInt15(255);
MSInt16 zeroS16 = ParallelMath::MakeSInt16(0);
MUInt15 colors[2][3];
for (int ch = 0; ch < 3; ch++)
{
MUInt15 quantizedChannel = ParallelMath::RightShift(he.uniqueQuantizedColors[ci], ((2 - ch) * 5)) & fifteen;
MUInt15 unquantizedColor = (quantizedChannel << 4) | quantizedChannel;
colors[0][ch] = ParallelMath::Min(twoFiftyFive, unquantizedColor + modifier);
colors[1][ch] = ParallelMath::ToUInt15(ParallelMath::Max(zeroS16, ParallelMath::LosslessCast<MSInt16>::Cast(unquantizedColor) - ParallelMath::MakeSInt16(modifier)));
}
MUInt16 signBits = ParallelMath::MakeUInt16(0);
for (int px = 0; px < 16; px++)
{
MFloat errors[2];
for (int i = 0; i < 2; i++)
{
if (isFakeBT709)
errors[i] = ComputeErrorFakeBT709(colors[i], preWeightedPixels[px]);
else if (isUniform)
errors[i] = ComputeErrorUniform(colors[i], pixels[px]);
else
errors[i] = ComputeErrorWeighted(colors[i], preWeightedPixels[px], options);
}
ParallelMath::Int16CompFlag errorOneLess = ParallelMath::FloatFlagToInt16(ParallelMath::Less(errors[1], errors[0]));
he.errors[ci][px] = ParallelMath::Min(errors[0], errors[1]);
signBits = signBits | ParallelMath::SelectOrZero(errorOneLess, ParallelMath::MakeUInt16(1 << px));
}
he.signBits[ci] = signBits;
}
int maxUniqueColorCombos = 0;
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
int numUniqueColorCombos = ParallelMath::Extract(he.numUniqueColors[0], block) * ParallelMath::Extract(he.numUniqueColors[1], block);
if (numUniqueColorCombos > maxUniqueColorCombos)
maxUniqueColorCombos = numUniqueColorCombos;
}
MUInt15 indexes[2] = { zero15, zero15 };
MUInt15 maxIndex[2] = { he.numUniqueColors[0] - ParallelMath::MakeUInt15(1), he.numUniqueColors[1] - ParallelMath::MakeUInt15(1) };
int block1Starts[ParallelMath::ParallelSize];
for (int block = 0; block < ParallelMath::ParallelSize; block++)
block1Starts[block] = ParallelMath::Extract(he.numUniqueColors[0], block);
for (int combo = 0; combo < maxUniqueColorCombos; combo++)
{
MUInt15 index0 = indexes[0] + ParallelMath::MakeUInt15(1);
ParallelMath::Int16CompFlag index0Overflow = ParallelMath::Less(maxIndex[0], index0);
ParallelMath::ConditionalSet(index0, index0Overflow, ParallelMath::MakeUInt15(0));
MUInt15 index1 = ParallelMath::Min(maxIndex[1], indexes[1] + ParallelMath::SelectOrZero(index0Overflow, ParallelMath::MakeUInt15(1)));
indexes[0] = index0;
indexes[1] = index1;
int ci0[ParallelMath::ParallelSize];
int ci1[ParallelMath::ParallelSize];
MUInt15 color0;
MUInt15 color1;
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
ci0[block] = ParallelMath::Extract(index0, block);
ci1[block] = ParallelMath::Extract(index1, block) + block1Starts[block];
ParallelMath::PutUInt15(color0, block, ParallelMath::Extract(he.uniqueQuantizedColors[ci0[block]], block));
ParallelMath::PutUInt15(color1, block, ParallelMath::Extract(he.uniqueQuantizedColors[ci1[block]], block));
}
MFloat totalError = ParallelMath::MakeFloatZero();
MUInt16 sectorBits = ParallelMath::MakeUInt16(0);
MUInt16 signBits = ParallelMath::MakeUInt16(0);
for (int px = 0; px < 16; px++)
{
MFloat errorCI0;
MFloat errorCI1;
MUInt16 signBits0;
MUInt16 signBits1;
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
ParallelMath::PutFloat(errorCI0, block, ParallelMath::Extract(he.errors[ci0[block]][px], block));
ParallelMath::PutFloat(errorCI1, block, ParallelMath::Extract(he.errors[ci1[block]][px], block));
ParallelMath::PutUInt16(signBits0, block, ParallelMath::Extract(he.signBits[ci0[block]], block));
ParallelMath::PutUInt16(signBits1, block, ParallelMath::Extract(he.signBits[ci1[block]], block));
}
totalError = totalError + ParallelMath::Min(errorCI0, errorCI1);
MUInt16 bitPosition = ParallelMath::MakeUInt16(1 << px);
ParallelMath::Int16CompFlag error1Better = ParallelMath::FloatFlagToInt16(ParallelMath::Less(errorCI1, errorCI0));
sectorBits = sectorBits | ParallelMath::SelectOrZero(error1Better, bitPosition);
signBits = signBits | (bitPosition & ParallelMath::Select(error1Better, signBits1, signBits0));
}
ParallelMath::FloatCompFlag totalErrorBetter = ParallelMath::Less(totalError, bestError);
ParallelMath::Int16CompFlag totalErrorBetter16 = ParallelMath::FloatFlagToInt16(totalErrorBetter);
if (ParallelMath::AnySet(totalErrorBetter16))
{
bestIsThisMode = bestIsThisMode | totalErrorBetter16;
ParallelMath::ConditionalSet(bestTable, totalErrorBetter16, ParallelMath::MakeUInt15(table));
ParallelMath::ConditionalSet(bestColors[0], totalErrorBetter16, color0);
ParallelMath::ConditionalSet(bestColors[1], totalErrorBetter16, color1);
ParallelMath::ConditionalSet(bestSectorBits, totalErrorBetter16, sectorBits);
ParallelMath::ConditionalSet(bestSignBits, totalErrorBetter16, signBits);
bestError = ParallelMath::Min(totalError, bestError);
}
}
}
if (ParallelMath::AnySet(bestIsThisMode))
{
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
if (!ParallelMath::Extract(bestIsThisMode, block))
continue;
ParallelMath::ScalarUInt16 blockBestColors[2] = { ParallelMath::Extract(bestColors[0], block), ParallelMath::Extract(bestColors[1], block) };
ParallelMath::ScalarUInt16 blockBestSectorBits = ParallelMath::Extract(bestSectorBits, block);
ParallelMath::ScalarUInt16 blockBestSignBits = ParallelMath::Extract(bestSignBits, block);
ParallelMath::ScalarUInt16 blockBestTable = ParallelMath::Extract(bestTable, block);
EmitHModeBlock(outputBuffer + block * 8, blockBestColors, blockBestSectorBits, blockBestSignBits, blockBestTable, true);
}
}
}
void cvtt::Internal::ETCComputer::EncodeVirtualTModePunchthrough(uint8_t *outputBuffer, MFloat &bestError, const ParallelMath::Int16CompFlag isIsolatedBase[16], const MUInt15 pixels[16][3], const MFloat preWeightedPixels[16][3], const ParallelMath::Int16CompFlag isTransparent[16], const ParallelMath::Int16CompFlag& anyTransparent, const ParallelMath::Int16CompFlag& allTransparent, const Options &options)
{
// We treat T and H mode as the same mode ("Virtual T mode") with punchthrough, because of how the colors work:
//
// T mode: C1, C2+M, Transparent, C2-M
// H mode: C1+M, C1-M, Transparent, C2-M
//
// So in either case, we have 2 colors +/- a modifier, and a third unique color, which is basically T mode except without the middle color.
// The only thing that matters is whether it's better to store the isolated color as T mode color 1, or store it offset in H mode color 2.
//
// Sometimes it won't even be possible to store it in H mode color 2 because the table low bit derives from a numeric comparison of the colors,
// but unlike opaque blocks, we can't flip them.
bool isUniform = ((options.flags & cvtt::Flags::Uniform) != 0);
bool isFakeBT709 = ((options.flags & cvtt::Flags::ETC_UseFakeBT709) != 0);
ParallelMath::FloatCompFlag isTransparentF[16];
for (int px = 0; px < 16; px++)
isTransparentF[px] = ParallelMath::Int16FlagToFloat(isTransparent[px]);
ParallelMath::Int16CompFlag bestIsThisMode = ParallelMath::MakeBoolInt16(false);
ParallelMath::Int16CompFlag bestIsHMode = ParallelMath::MakeBoolInt16(false);
MUInt15 isolatedTotal[3] = { ParallelMath::MakeUInt15(0), ParallelMath::MakeUInt15(0), ParallelMath::MakeUInt15(0) };
MUInt15 lineTotal[3] = { ParallelMath::MakeUInt15(0), ParallelMath::MakeUInt15(0), ParallelMath::MakeUInt15(0) };
MUInt15 numPixelsIsolated = ParallelMath::MakeUInt15(0);
MUInt15 numPixelsLine = ParallelMath::MakeUInt15(0);
ParallelMath::Int16CompFlag isIsolated[16];
ParallelMath::Int16CompFlag isLine[16];
for (unsigned int px = 0; px < 16; px++)
{
ParallelMath::Int16CompFlag isOpaque = ParallelMath::Not(isTransparent[px]);
isIsolated[px] = isIsolatedBase[px] & isOpaque;
isLine[px] = ParallelMath::Not(isIsolatedBase[px]) & isOpaque;
}
for (unsigned int px = 0; px < 16; px++)
{
for (int ch = 0; ch < 3; ch++)
{
isolatedTotal[ch] = isolatedTotal[ch] + ParallelMath::SelectOrZero(isIsolated[px], pixels[px][ch]);
lineTotal[ch] = lineTotal[ch] + ParallelMath::SelectOrZero(isLine[px], pixels[px][ch]);
}
numPixelsIsolated = numPixelsIsolated + ParallelMath::SelectOrZero(isIsolated[px], ParallelMath::MakeUInt15(1));
numPixelsLine = numPixelsLine + ParallelMath::SelectOrZero(isLine[px], ParallelMath::MakeUInt15(1));
}
MUInt15 isolatedAverageQuantized[3];
MUInt15 hModeIsolatedQuantized[8][3];
MUInt15 isolatedAverageTargets[3];
{
int divisors[ParallelMath::ParallelSize];
for (int block = 0; block < ParallelMath::ParallelSize; block++)
divisors[block] = ParallelMath::Extract(numPixelsIsolated, block) * 34;
MUInt15 addend = (numPixelsIsolated << 4) | numPixelsIsolated;
for (int ch = 0; ch < 3; ch++)
{
// isolatedAverageQuantized[ch] = (isolatedTotal[ch] * 2 + numPixelsIsolated * 17) / (numPixelsIsolated * 34);
MUInt15 numerator = isolatedTotal[ch] + isolatedTotal[ch];
if (!isFakeBT709)
numerator = numerator + addend;
MUInt15 hModeIsolatedNumerators[8];
for (int table = 0; table < 8; table++)
{
// FIXME: Handle fake BT.709 correctly
MUInt15 offsetTotal = isolatedTotal[ch] + ParallelMath::LosslessCast<MUInt15>::Cast(ParallelMath::CompactMultiply(ParallelMath::MakeUInt15(cvtt::Tables::ETC2::g_thModifierTable[table]), numPixelsIsolated));
hModeIsolatedNumerators[table] = (offsetTotal + offsetTotal) + addend;
}
for (int block = 0; block < ParallelMath::ParallelSize; block++)
{
int divisor = divisors[block];
if (divisor == 0)
{
ParallelMath::PutUInt15(isolatedAverageQuantized[ch], block, 0);
for (int table = 0; table < 8; table++)
ParallelMath::PutUInt15(hModeIsolatedQuantized[table][ch], block, 0);
}
else
{
ParallelMath::PutUInt15(isolatedAverageQuantized[ch], block, ParallelMath::Extract(numerator, block) / divisor);
for (int table = 0; table < 8; table++)
ParallelMath::PutUInt15(hModeIsolatedQuantized[table][ch], block, ParallelMath::Extract(hModeIsolatedNumerators[table], block) / divisor);
}
}
isolatedAverageTargets[ch] = numerator;
}
}
if (isFakeBT709)
ResolveTHFakeBT709Rounding(isolatedAverageQuantized, isolatedAverageTargets, numPixelsIsolated);
for (int table = 0; table < 8; table++)
for (int ch = 0; ch < 3; ch++)
hModeIsolatedQuantized[table][ch] = ParallelMath::Min(ParallelMath::MakeUInt15(15), hModeIsolatedQuantized[table][ch]);
MUInt15 isolatedColor[3];
for (int ch = 0; ch < 3; ch++)
isolatedColor[ch] = (isolatedAverageQuantized[ch]) | (isolatedAverageQuantized[ch] << 4);
MFloat isolatedError[16];
for (int px = 0; px < 16; px++)
{
if (isFakeBT709)
isolatedError[px] = ComputeErrorFakeBT709(isolatedColor, preWeightedPixels[px]);
else if (isUniform)
isolatedError[px] = ComputeErrorUniform(pixels[px], isolatedColor);