You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
70 lines
2.9 KiB
C++
70 lines
2.9 KiB
C++
/* Quicktex Texture Compression Library
|
|
Copyright (C) 2021 Andrew Cassidy <drewcassidy@me.com>
|
|
Partially derived from rgbcx.h written by Richard Geldreich <richgel99@gmail.com>
|
|
and licenced under the public domain
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program 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 Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "BC4Block.h"
|
|
|
|
#include <algorithm>
|
|
#include <stdexcept>
|
|
|
|
#include "../../util.h"
|
|
|
|
namespace quicktex::s3tc {
|
|
|
|
BC4Block::SelectorArray BC4Block::GetSelectors() const {
|
|
auto packed = Pack<uint8_t, uint64_t, 8, SelectorSize>(_selectors);
|
|
auto rows = Unpack<uint64_t, uint16_t, SelectorBits * Width, Height>(packed);
|
|
return MapArray(rows, Unpack<uint16_t, uint8_t, SelectorBits, Width>);
|
|
}
|
|
|
|
void BC4Block::SetSelectors(const BC4Block::SelectorArray& unpacked) {
|
|
for (unsigned y = 0; y < (unsigned)Height; y++) {
|
|
if (std::any_of(unpacked[y].begin(), unpacked[y].end(), [](uint8_t i) { return i > SelectorMax; }))
|
|
throw std::invalid_argument("Selector value out of bounds.");
|
|
}
|
|
auto rows = MapArray(unpacked, Pack<uint8_t, uint16_t, SelectorBits, Width>);
|
|
auto packed = Pack<uint16_t, uint64_t, SelectorBits * Width, Height>(rows);
|
|
_selectors = Unpack<uint64_t, uint8_t, 8, SelectorSize>(packed);
|
|
}
|
|
|
|
std::array<uint8_t, 8> BC4Block::GetValues6() const {
|
|
return {alpha0,
|
|
alpha1,
|
|
static_cast<uint8_t>((alpha0 * 4 + alpha1) / 5),
|
|
static_cast<uint8_t>((alpha0 * 3 + alpha1 * 2) / 5),
|
|
static_cast<uint8_t>((alpha0 * 2 + alpha1 * 3) / 5),
|
|
static_cast<uint8_t>((alpha0 + alpha1 * 4) / 5),
|
|
0,
|
|
0xFF};
|
|
}
|
|
|
|
std::array<uint8_t, 8> BC4Block::GetValues8() const {
|
|
return {alpha0,
|
|
alpha1,
|
|
static_cast<uint8_t>((alpha0 * 6 + alpha1) / 7),
|
|
static_cast<uint8_t>((alpha0 * 5 + alpha1 * 2) / 7),
|
|
static_cast<uint8_t>((alpha0 * 4 + alpha1 * 3) / 7),
|
|
static_cast<uint8_t>((alpha0 * 3 + alpha1 * 4) / 7),
|
|
static_cast<uint8_t>((alpha0 * 2 + alpha1 * 5) / 7),
|
|
static_cast<uint8_t>((alpha0 + alpha1 * 6) / 7)};
|
|
}
|
|
|
|
bool BC4Block::operator==(const BC4Block& Rhs) const { return alpha0 == Rhs.alpha0 && alpha1 == Rhs.alpha1 && _selectors == Rhs._selectors; }
|
|
bool BC4Block::operator!=(const BC4Block& Rhs) const { return !(Rhs == *this); }
|
|
} // namespace quicktex::s3tc
|