N-archive/Ryujinx
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
Ryujinx/Ryujinx.Graphics.Texture/BC6Decoder.cs

820 lines
32 KiB
C#
Raw Normal View History

Vulkan backend (#2518) * WIP Vulkan implementation * No need to initialize attributes on the SPIR-V backend anymore * Allow multithreading shaderc and vkCreateShaderModule You'll only really see the benefit here with threaded-gal or parallel shader cache compile. Fix shaderc multithreaded changes Thread safety for shaderc Options constructor Dunno how they managed to make a constructor not thread safe, but you do you. May avoid some freezes. * Support multiple levels/layers for blit. Fixes MK8D when scaled, maybe a few other games. AMD software "safe" blit not supported right now. * TextureStorage should hold a ref of the foreign storage, otherwise it might be freed while in use * New depth-stencil blit method for AMD * Workaround for AMD driver bug * Fix some tessellation related issues (still doesn't work?) * Submit command buffer before Texture GetData. (UE4 fix) * DrawTexture support * Fix BGRA on OpenGL backend * Fix rebase build break * Support format aliasing on SetImage * Fix uniform buffers being lost when bindings are out of order * Fix storage buffers being lost when bindings are out of order (also avoid allocations when changing bindings) * Use current command buffer for unscaled copy (perf) Avoids flushing commands and renting a command buffer when fulfilling copy dependencies and when games do unscaled copies. * Update to .net6 * Update Silk.NET to version 2.10.1 Somehow, massive performance boost. Seems like their vtable for looking up vulkan methods was really slow before. * Fix PrimitivesGenerated query, disable Transform Feedback queries for now Lets Splatoon 2 work on nvidia. (mostly) * Update counter queue to be similar to the OGL one Fixes softlocks when games had to flush counters. * Don't throw when ending conditional rendering for now This should be re-enabled when conditional rendering is enabled on nvidia etc. * Update findMSB/findLSB to match master's instruction enum * Fix triangle overlay on SMO, Captain Toad, maybe others? * Don't make Intel Mesa pay for Intel Windows bugs * Fix samplers with MinFilter Linear or Nearest (fixes New Super Mario Bros U Deluxe black borders) * Update Spv.Generator * Add alpha test emulation on shader (but no shader specialisation yet...) * Fix R4G4B4A4Unorm texture format permutation * Validation layers should be enabled for any log level other than None * Add barriers around vkCmdCopyImage Write->Read barrier for src image (we want to wait for a write to read it) Write->Read barrier for dst image (we want to wait for the copy to complete before use) * Be a bit more careful with texture access flags, since it can be used for anything * Device local mapping for all buffers May avoid issues with drivers with NVIDIA on linux/older gpus on windows when using large buffers (?) Also some performance things and fixes issues with opengl games loading textures weird. * Cleanup, disable device local buffers for now. * Add single queue support Multiqueue seems to be a bit more responsive on NVIDIA. Should fix texture flush on intel. AMD has been forced to single queue for an experiment. * Fix some validation errors around extended dynamic state * Remove Intel bug workaround, it was fixed on the latest driver * Use circular queue for checking consumption on command buffers Speeds up games that spam command buffers a little. Avoids checking multiple command buffers if multiple are active at once. * Use SupportBufferUpdater, add single layer flush * Fix counter queue leak when game decides to use host conditional rendering * Force device local storage for textures (fixes linux performance) * Port #3019 * Insert barriers around vkCmdBlitImage (may fix some amd flicker) * Fix transform feedback on Intel, gl_Position feedback and clears to inexistent depth buffers * Don't pause transform feedback for multi draw * Fix draw outside of render pass and missing capability * Workaround for wrong last attribute on AMD (affects FFVII, STRIKERS1945, probably more) * Better workaround for AMD vertex buffer size alignment issue * More instructions + fixes on SPIR-V backend * Allow custom aspect ratio on Vulkan * Correct GTK UI status bar positions * SPIR-V: Functions must always end with a return * SPIR-V: Fix ImageQuerySizeLod * SPIR-V: Set DepthReplacing execution mode when FragDepth is modified * SPIR-V: Implement LoopContinue IR instruction * SPIR-V: Geometry shader support * SPIR-V: Use correct binding number on storage buffers array * Reduce allocations for Spir-v serialization Passes BinaryWriter instead of the stream to Write and WriteOperand - Removes creation of BinaryWriter for each instruction - Removes allocations for literal string * Some optimizations to Spv.Generator - Dictionary for lookups of type declarations, constants, extinst - LiteralInteger internal data format -> ushort - Deterministic HashCode implementation to avoid spirv result not being the same between runs - Inline operand list instead of List<T>, falls back to array if many operands. (large performance boost) TODO: improve instruction allocation, structured program creator, ssa? * Pool Spv.Generator resources, cache delegates, spv opts - Pools for Instructions and LiteralIntegers. Can be passed in when creating the generator module. - NewInstruction is called instead of new Instruction() - Ryujinx SpirvGenerator passes in some pools that are static. The idea is for these to be shared between threads eventually. - Estimate code size when creating the output MemoryStream - LiteralInteger pools using ThreadStatic pools that are initialized before and after creation... not sure of a better way since the way these are created is via implicit cast. Also, cache delegates for Spv.Generator for functions that are passed around to GenerateBinary etc, since passing the function raw creates a delegate on each call. TODO: update python spv cs generator to make the coregrammar with NewInstruction and the `params` overloads. * LocalDefMap for Ssa Rewriter Rather than allocating a large array of all registers for each block in the shader, allocate one array of all registers and clear it between blocks. Reduces allocations in the shader translator. * SPIR-V: Transform feedback support * SPIR-V: Fragment shader interlock support (and image coherency) * SPIR-V: Add early fragment tests support * SPIR-V: Implement SwizzleAdd, add missing Triangles ExecutionMode for geometry shaders, remove SamplerType field from TextureMeta * Don't pass depth clip state right now (fix decals) Explicitly disabling it is incorrect. OpenGL currently automatically disables based on depth clamp, which is the behaviour if this state is omitted. * Multisampling support * Multisampling: Use resolve if src samples count > dst samples count * Multisampling: We can only resolve for unscaled copies * SPIR-V: Only add FSI exec mode if used. * SPIR-V: Use ConstantComposite for Texture Offset Vector Fixes a bunch of freezes with SPIR-V on AMD hardware, and validation errors. Note: Obviously assumes input offsets are constant, which they currently are. * SPIR-V: Don't OpReturn if we already OpExit'ed Fixes spir-v parse failure and stack smashing in RADV (obviously you still need bolist) * SPIR-V: Only use input attribute type for input attributes Output vertex attributes should always be of type float. * Multithreaded Pipeline Compilation * Address some feedback * Make this 32 * Update topology with GpuAccessorState * Cleanup for merge (note: disables spir-v) * Make more robust to shader compilation failure - Don't freeze when GLSL compilation fails - Background SPIR-V pipeline compile failure results in skipped draws, similar to GLSL compilation failure. * Fix Multisampling * Only update fragment scale count if a vertex texture needs a scale. Fixes a performance regression introduced by texture scaling in the vertex stage where support buffer updates would be very frequent, even at 1x, if any textures were used on the vertex stage. This check doesn't exactly look cheap (a flag in the shader stage would probably be preferred), but it is much cheaper than uploading scales in both vulkan and opengl, so it will do for now. * Use a bitmap to do granular tracking for buffer uploads. This path is only taken if the much faster check of "is the buffer rented at all" is triggered, so it doesn't actually end up costing too much, and the time saved by not ending render passes (and on gpu for not waiting on barriers) is probably helpful. Avoids ending render passes to update buffer data (not all the time) - 140-180 to 35-45 in SMO metro kingdom (these updates are in the UI) - Very variable 60-150(!) to 16-25 in mario kart 8 (these updates are in the UI) As well as allowing more data to be preloaded persistently, this will also allow more data to be loaded in the preload buffer, which should be faster as it doesn't need to insert barriers between draws. (and on tbdr, does not need to flush and reload tile memory) Improves performance in GPU limited scenarios. Should notably improve performance on TBDR gpus. Still a lot more to do here. * Copy query results after RP ends, rather than ending to copy We need to end the render pass to get the data (submit command buffer) anyways... Reduces render passes created in games that use queries. * Rework Query stuff a bit to avoid render pass end Tries to reset returned queries in background when possible, rather than ending the render pass. Still ends render pass when resetting a counter after draws, but maybe that can be solved too. (by just pulling an empty object off the pool?) * Remove unnecessary lines Was for testing * Fix validation error for query reset Need to think of a better way to do this. * SPIR-V: Fix SwizzleAdd and some validation errors * SPIR-V: Implement attribute indexing and StoreAttribute * SPIR-V: Fix TextureSize for MS and Buffer sampler types * Fix relaunch issues * SPIR-V: Implement LogicalExclusiveOr * SPIR-V: Constant buffer indexing support * Ignore unsupported attributes rather than throwing (matches current GLSL behaviour) * SPIR-V: Implement tessellation support * SPIR-V: Geometry shader passthrough support * SPIR-V: Implement StoreShader8/16 and StoreStorage8/16 * SPIR-V: Resolution scale support and fix TextureSample multisample with LOD bug * SPIR-V: Fix field index for scale count * SPIR-V: Fix another case of wrong field index * SPIRV/GLSL: More scaling related fixes * SPIR-V: Fix ImageLoad CompositeExtract component type * SPIR-V: Workaround for Intel FrontFacing bug * Enable SPIR-V backend by default * Allow null samplers (samplers are not required when only using texelFetch to access the texture) * Fix some validation errors related to texel block view usage flag and invalid image barrier base level * Use explicit subgroup size if we can (might fix some block flickering on AMD) * Take componentMask and scissor into account when clearing framebuffer attachments * Add missing barriers around CmdFillBuffer (fixes Monster Hunter Rise flickering on NVIDIA) * Use ClampToEdge for Clamp sampler address mode on Vulkan (fixes Hollow Knight) Clamp is unsupported on Vulkan, but ClampToEdge behaves almost the same. ClampToBorder on the other hand (which was being used before) is pretty different * Shader specialization for new Vulkan required state (fixes remaining alpha test issues, vertex stretching on AMD on Crash Bandicoot, etc) * Check if the subgroup size is supported before passing a explicit size * Only enable ShaderFloat64 if the GPU supports it * We don't need to recompile shaders if alpha test state changed but alpha test is disabled * Enable shader cache on Vulkan and implement MultiplyHighS32/U32 on SPIR-V (missed those before) * Fix pipeline state saving before it is updated. This should fix a few warnings and potential stutters due to bad pipeline states being saved in the cache. You may need to clear your guest cache. * Allow null samplers on OpenGL backend * _unit0Sampler should be set only for binding 0 * Remove unused PipelineConverter format variable (was causing IOR) * Raise textures limit to 64 on Vulkan * No need to pack the shader binaries if shader cache is disabled * Fix backbuffer not being cleared and scissor not being re-enabled on OpenGL * Do not clear unbound framebuffer color attachments * Geometry shader passthrough emulation * Consolidate UpdateDepthMode and GetDepthMode implementation * Fix A1B5G5R5 texture format and support R4G4 on Vulkan * Add barrier before use of some modified images * Report 32 bit query result on AMD windows (smo issue) * Add texture recompression support (disabled for now) It recompresses ASTC textures into BC7, which might reduce VRAM usage significantly on games that uses ASTC textures * Do not report R4G4 format as supported on Vulkan It was causing mario head to become white on Super Mario 64 (???) * Improvements to -1 to 1 depth mode. - Transformation is only applied on the last stage in the vertex pipeline. - Should fix some issues with geometry and tessellation (hopefully) - Reading back FragCoord Z on fragment will transform back to -1 to 1. * Geometry Shader index count from ThreadsPerInputPrimitive Generally fixes SPIR-V emitting too many triangles, may change games in OpenGL * Remove gl_FragDepth scaling This is always 0-1; the other two issues were causing the problems. Fixes regression with Xenoblade. * Add Gl StencilOp enum values to Vulkan * Update guest cache to v1.1 (due to specialization state changes) This will explode your shader cache from earlier vulkan build, but it must be done. :pensive: * Vulkan/SPIR-V support for viewport inverse * Fix typo * Don't create query pools for unsupported query types * Return of the Vector Indexing Bug One day, everyone will get this right. * Check for transform feedback query support Sometimes transform feedback is supported without the query type. * Fix gl_FragCoord.z transformation FragCoord.z is always in 0-1, even when the real depth range is -1 to 1. Turns out the only bug was geo and tess stage outputs. Fixes Pokemon Sword/Shield, possibly others. * Fix Avalonia Rebase Vulkan is currently not available on Avalonia, but the build does work and you can use opengl. * Fix headless build * Add support for BC6 and BC7 decompression, decompress all BC formats if they are not supported by the host * Fix BCn 4/5 conversion, GetTextureTarget BCn 4/5 could generate invalid data when a line's size in bytes was not divisible by 4, which both backends expect. GetTextureTarget was not creating a view with the replacement format. * Fix dependency * Fix inverse viewport transform vector type on SPIR-V * Do not require null descriptors support * If MultiViewport is not supported, do not try to set more than one viewport/scissor * Bounds check on bitmap add. * Flush queries on attachment change rather than program change Occlusion queries are usually used in a depth only pass so the attachments changing is a better indication of the query block ending. Write mask changes are also considered since some games do depth only pass by setting 0 write mask on all the colour targets. * Add support for avalonia (#6) * add avalonia support * only lock around skia flush * addressed review * cleanup * add fallback size if avalonia attempts to render but the window size is 0. read desktop scale after enabling dpi check * fix getting window handle on linux. skip render is size is 0 * Combine non-buffer with buffer image descriptor sets * Support multisample texture copy with automatic resolve on Vulkan * Remove old CompileShader methods from the Vulkan backend * Add minimal pipeline layouts that only contains used bindings They are used by helper shaders, the intention is avoiding needing to recompile the shaders (from GLSL to SPIR-V) if the bindings changes on the translated guest shaders * Pre-compile helper shader as SPIR-V, and some fixes * Remove pre-compiled shaderc binary for Windows as its no longer needed by default * Workaround RADV crash Enabling the descriptor indexing extension, even if it is not used, forces the radv driver to use "bolist". * Use RobustBufferAccess on NVIDIA gpus Avoids the SMO waterfall triangle on older NVIDIA gpus. * Implement GPU selector and expose texture recompression on the UI and config * Fix and enable background compute shader compilation Also disables warnings from shader cache pipeline misses. * Fix error due to missing subpass dependency when Attachment Write -> Shader Read barriers are added * If S8D24 is not supported, use D32FS8 * Ensure all fences are destroyed on dispose * Pre-allocate arrays up front on DescriptorSetUpdater, allows the removal of some checks * Add missing clear layer parameter after rebase * Use selected gpu from config for avalonia (#7) * use configured device * address review * Fix D32S8 copy workaround (AMD) Fixes water in Pokemon Legends Arceus on AMD GPUs. Possibly fixes other things. * Use push descriptors for uniform buffer updates (disabled for now) * Push descriptor support check, buffer redundancy checks Should make push descriptors faster, needs more testing though. * Increase light command buffer pool to 2 command buffers, throw rather than returning invalid cbs * Adjust bindings array sizes * Force submit command buffers if memory in use by its resources is high * Add workaround for AMD GCN cubemap view sins `ImageCreateCubeCompatibleBit` seems to generally break 2D array textures with mipmaps... even if they are eventually aliased as a cubemap with mipmaps. Forcing a copy here works around the issue. This could be used in future if enabling this bit reduces performance on certain GPUs. (mobile class is generally a worry) Currently also enabled on Linux as I don't know if they managed to dodge this bug (someone please tell me). Not enabled on Vega at the moment, but easy to add if the issue is there. * Add mobile, non-RX variants to the GCN regex. Also make sure that the 3 digit ones only include numbers starting with 7 or 8. * Increase image limit per stage from 8 to 16 Xenoblade Chronicles 2 was hiting the limit of 8 * Minor code cleanup * Fix NRE caused by SupportBufferUpdater calling pipeline ClearBuffer * Add gpu selector to Avalonia (#8) * Add gpu selector to avalonia settings * show backend label on window * some fixes * address review * Minor changes to the Avalonia UI * Update graphics window UI and locales. (#9) * Update xaml and update locales * locale updates Did my best here but likely needs to be checked by native speakers, especially the use of ampersands in greek, russian and turkish? * Fix locales with more (?) correct translations. * add separator to render widget * fix spanish and portuguese * Add new IdList, replaces buffer list that could not remove elements and had unbounded growth * Don't crash the settings window if Vulkan is not supported * Fix Actions menu not being clickable on GTK UI after relaunch * Rename VulkanGraphicsDevice to VulkanRenderer and Renderer to OpenGLRenderer * Fix IdList and make it not thread safe * Revert useless OpenGL format table changes * Fix headless project build * List throws ArgumentOutOfRangeException * SPIR-V: Fix tessellation * Increase shader cache version due to tessellation fix * Reduce number of Sync objects created (improves perf in some specific titles) * Fix vulkan validation errors for NPOT compressed upload and GCN workaround. * Add timestamp to the shader cache and force rebuild if host cache is outdated * Prefer Mail box present mode for popups (#11) * Prefer Mail box present mode * fix debug * switch present mode when vsync is toggled * only disable vsync on the main window * SPIR-V: Fix geometry shader input load with transform feedback * BC7 Encoder: Prefer more precision on alpha rather than RGB when alpha is 0 * Fix Avalonia build * Address initial PR feedback * Only set transform feedback outputs on last vertex stage * Address riperiperi PR feedback * Remove outdated comment * Remove unused constructor * Only throw for negative results * Throw for QueueSubmit and other errors No point in delaying the inevitable * Transform feedback decorations inside gl_PerVertex struct breaks the NVIDIA compiler * Fix some resolution scale issues * No need for two UpdateScale calls * Fix comments on SPIR-V generator project * Try to fix shader local memory size On DOOM, a shader is using local memory, but both Low and High size are 0, CRS size is 1536, it seems to store on that region? * Remove RectangleF that is now unused * Fix ImageGather with multiple offsets Needs ImageGatherExtended capability, and must use `ConstantComposite` instead of `CompositeConstruct` * Address PR feedback from jD in all projects except Avalonia * Address most of jD PR feedback on Avalonia * Remove unsafe * Fix VulkanSkiaGpu * move present mode request out of Create Swapchain method * split more parts of create swapchain * addressed reviews * addressed review * Address second batch of jD PR feedback * Fix buffer <-> image copy row length and height alignment AlignUp helper does not support NPOT alignment, and ASTC textures can have NPOT block sizes * Better fix for NPOT alignment issue * Use switch expressions on Vulkan EnumConversion Thanks jD * Fix Avalonia build * Add Vulkan selection prompt on startup * Grammar fixes on Vulkan prompt message * Add missing Vulkan migration flag Co-authored-by: riperiperi <rhy3756547@hotmail.com> Co-authored-by: Emmanuel Hansen <emmausssss@gmail.com> Co-authored-by: MutantAura <44103205+MutantAura@users.noreply.github.com>
2022-07-31 23:26:06 +02:00
using Ryujinx.Graphics.Texture.Utils;
using System;
using System.Runtime.InteropServices;
namespace Ryujinx.Graphics.Texture
{
static class BC6Decoder
{
private const int HalfOne = 0x3C00;
public static void Decode(Span<byte> output, ReadOnlySpan<byte> data, int width, int height, bool signed)
{
ReadOnlySpan<Block> blocks = MemoryMarshal.Cast<byte, Block>(data);
Span<ulong> output64 = MemoryMarshal.Cast<byte, ulong>(output);
int wInBlocks = (width + 3) / 4;
int hInBlocks = (height + 3) / 4;
for (int y = 0; y < hInBlocks; y++)
{
int y2 = y * 4;
int bh = Math.Min(4, height - y2);
for (int x = 0; x < wInBlocks; x++)
{
int x2 = x * 4;
int bw = Math.Min(4, width - x2);
DecodeBlock(blocks[y * wInBlocks + x], output64.Slice(y2 * width + x2), bw, bh, width, signed);
}
}
}
private static void DecodeBlock(Block block, Span<ulong> output, int w, int h, int width, bool signed)
{
int mode = (int)(block.Low & 3);
if ((mode & 2) != 0)
{
mode = (int)(block.Low & 0x1f);
}
Span<RgbaColor32> endPoints = stackalloc RgbaColor32[4];
int subsetCount = DecodeEndPoints(ref block, endPoints, mode, signed);
if (subsetCount == 0)
{
// Mode is invalid, the spec mandates that hardware fills the block with
// a opaque black color.
for (int ty = 0; ty < h; ty++)
{
int baseOffs = ty * width;
for (int tx = 0; tx < w; tx++)
{
output[baseOffs + tx] = (ulong)HalfOne << 48;
}
}
return;
}
int partition;
int indexBitCount;
ulong indices;
if (subsetCount > 1)
{
partition = (int)((block.High >> 13) & 0x1F);
indexBitCount = 3;
int fixUpIndex = BC67Tables.FixUpIndices[subsetCount - 1][partition][1] * 3;
ulong lowMask = (ulong.MaxValue >> (65 - fixUpIndex)) << 3;
ulong highMask = ulong.MaxValue << (fixUpIndex + 3);
indices = ((block.High >> 16) & highMask) | ((block.High >> 17) & lowMask) | ((block.High >> 18) & 3);
}
else
{
partition = 0;
indexBitCount = 4;
indices = (block.High & ~0xFUL) | ((block.High >> 1) & 7);
}
ulong indexMask = (1UL << indexBitCount) - 1;
for (int ty = 0; ty < h; ty++)
{
int baseOffs = ty * width;
for (int tx = 0; tx < w; tx++)
{
int offs = baseOffs + tx;
int index = (int)(indices & indexMask);
int endPointBase = BC67Tables.PartitionTable[subsetCount - 1][partition][ty * 4 + tx] << 1;
RgbaColor32 color1 = endPoints[endPointBase];
RgbaColor32 color2 = endPoints[endPointBase + 1];
RgbaColor32 color = BC67Utils.Interpolate(color1, color2, index, indexBitCount);
output[offs] =
(ulong)FinishUnquantize(color.R, signed) |
((ulong)FinishUnquantize(color.G, signed) << 16) |
((ulong)FinishUnquantize(color.B, signed) << 32) |
((ulong)HalfOne << 48);
indices >>= indexBitCount;
}
}
}
private static int DecodeEndPoints(ref Block block, Span<RgbaColor32> endPoints, int mode, bool signed)
{
ulong low = block.Low;
ulong high = block.High;
int r0 = 0, g0 = 0, b0 = 0, r1 = 0, g1 = 0, b1 = 0, r2 = 0, g2 = 0, b2 = 0, r3 = 0, g3 = 0, b3 = 0;
int subsetCount;
switch (mode)
{
case 0:
r0 = (int)(low >> 5) & 0x3FF;
g0 = (int)(low >> 15) & 0x3FF;
b0 = (int)(low >> 25) & 0x3FF;
if (signed)
{
r0 = SignExtend(r0, 10);
g0 = SignExtend(g0, 10);
b0 = SignExtend(b0, 10);
}
r1 = r0 + SignExtend((int)(low >> 35), 5);
g1 = g0 + SignExtend((int)(low >> 45), 5);
b1 = b0 + SignExtend((int)(low >> 55), 5);
r2 = r0 + SignExtend((int)(high >> 1), 5);
g2 = g0 + SignExtend((int)(((low << 2) & 0x10) | ((low >> 41) & 0xF)), 5);
b2 = b0 + SignExtend((int)(((low << 1) & 0x10) | ((high << 3) & 0x08) | (low >> 61)), 5);
r3 = r0 + SignExtend((int)(high >> 7), 5);
g3 = g0 + SignExtend((int)(((low >> 36) & 0x10) | ((low >> 51) & 0xF)), 5);
b3 = b0 + SignExtend((int)(
((low) & 0x10) |
((high >> 9) & 0x08) |
((high >> 4) & 0x04) |
((low >> 59) & 0x02) |
((low >> 50) & 0x01)), 5);
r0 = Unquantize(r0, 10, signed);
g0 = Unquantize(g0, 10, signed);
b0 = Unquantize(b0, 10, signed);
r1 = Unquantize(r1 & 0x3FF, 10, signed);
g1 = Unquantize(g1 & 0x3FF, 10, signed);
b1 = Unquantize(b1 & 0x3FF, 10, signed);
r2 = Unquantize(r2 & 0x3FF, 10, signed);
g2 = Unquantize(g2 & 0x3FF, 10, signed);
b2 = Unquantize(b2 & 0x3FF, 10, signed);
r3 = Unquantize(r3 & 0x3FF, 10, signed);
g3 = Unquantize(g3 & 0x3FF, 10, signed);
b3 = Unquantize(b3 & 0x3FF, 10, signed);
subsetCount = 2;
break;
case 1:
r0 = (int)(low >> 5) & 0x7F;
g0 = (int)(low >> 15) & 0x7F;
b0 = (int)(low >> 25) & 0x7F;
if (signed)
{
r0 = SignExtend(r0, 7);
g0 = SignExtend(g0, 7);
b0 = SignExtend(b0, 7);
}
r1 = r0 + SignExtend((int)(low >> 35), 6);
g1 = g0 + SignExtend((int)(low >> 45), 6);
b1 = b0 + SignExtend((int)(low >> 55), 6);
r2 = r0 + SignExtend((int)(high >> 1), 6);
g2 = g0 + SignExtend((int)(((low << 3) & 0x20) | ((low >> 20) & 0x10) | ((low >> 41) & 0x0F)), 6);
b2 = b0 + SignExtend((int)(
((low >> 17) & 0x20) |
((low >> 10) & 0x10) |
((high << 3) & 0x08) |
(low >> 61)), 6);
r3 = r0 + SignExtend((int)(high >> 7), 6);
g3 = g0 + SignExtend((int)(((low << 1) & 0x30) | ((low >> 51) & 0xF)), 6);
b3 = b0 + SignExtend((int)(
((low >> 28) & 0x20) |
((low >> 30) & 0x10) |
((low >> 29) & 0x08) |
((low >> 21) & 0x04) |
((low >> 12) & 0x03)), 6);
r0 = Unquantize(r0, 7, signed);
g0 = Unquantize(g0, 7, signed);
b0 = Unquantize(b0, 7, signed);
r1 = Unquantize(r1 & 0x7F, 7, signed);
g1 = Unquantize(g1 & 0x7F, 7, signed);
b1 = Unquantize(b1 & 0x7F, 7, signed);
r2 = Unquantize(r2 & 0x7F, 7, signed);
g2 = Unquantize(g2 & 0x7F, 7, signed);
b2 = Unquantize(b2 & 0x7F, 7, signed);
r3 = Unquantize(r3 & 0x7F, 7, signed);
g3 = Unquantize(g3 & 0x7F, 7, signed);
b3 = Unquantize(b3 & 0x7F, 7, signed);
subsetCount = 2;
break;
case 2:
r0 = (int)(((low >> 30) & 0x400) | ((low >> 5) & 0x3FF));
g0 = (int)(((low >> 39) & 0x400) | ((low >> 15) & 0x3FF));
b0 = (int)(((low >> 49) & 0x400) | ((low >> 25) & 0x3FF));
if (signed)
{
r0 = SignExtend(r0, 11);
g0 = SignExtend(g0, 11);
b0 = SignExtend(b0, 11);
}
r1 = r0 + SignExtend((int)(low >> 35), 5);
g1 = g0 + SignExtend((int)(low >> 45), 4);
b1 = b0 + SignExtend((int)(low >> 55), 4);
r2 = r0 + SignExtend((int)(high >> 1), 5);
g2 = g0 + SignExtend((int)(low >> 41), 4);
b2 = b0 + SignExtend((int)(((high << 3) & 8) | (low >> 61)), 4);
r3 = r0 + SignExtend((int)(high >> 7), 5);
g3 = g0 + SignExtend((int)(low >> 51), 4);
b3 = b0 + SignExtend((int)(
((high >> 9) & 8) |
((high >> 4) & 4) |
((low >> 59) & 2) |
((low >> 50) & 1)), 4);
r0 = Unquantize(r0, 11, signed);
g0 = Unquantize(g0, 11, signed);
b0 = Unquantize(b0, 11, signed);
r1 = Unquantize(r1 & 0x7FF, 11, signed);
g1 = Unquantize(g1 & 0x7FF, 11, signed);
b1 = Unquantize(b1 & 0x7FF, 11, signed);
r2 = Unquantize(r2 & 0x7FF, 11, signed);
g2 = Unquantize(g2 & 0x7FF, 11, signed);
b2 = Unquantize(b2 & 0x7FF, 11, signed);
r3 = Unquantize(r3 & 0x7FF, 11, signed);
g3 = Unquantize(g3 & 0x7FF, 11, signed);
b3 = Unquantize(b3 & 0x7FF, 11, signed);
subsetCount = 2;
break;
case 3:
r0 = (int)(low >> 5) & 0x3FF;
g0 = (int)(low >> 15) & 0x3FF;
b0 = (int)(low >> 25) & 0x3FF;
r1 = (int)(low >> 35) & 0x3FF;
g1 = (int)(low >> 45) & 0x3FF;
b1 = (int)(((high << 9) & 0x200) | (low >> 55));
if (signed)
{
r0 = SignExtend(r0, 10);
g0 = SignExtend(g0, 10);
b0 = SignExtend(b0, 10);
r1 = SignExtend(r1, 10);
g1 = SignExtend(g1, 10);
b1 = SignExtend(b1, 10);
}
r0 = Unquantize(r0, 10, signed);
g0 = Unquantize(g0, 10, signed);
b0 = Unquantize(b0, 10, signed);
r1 = Unquantize(r1, 10, signed);
g1 = Unquantize(g1, 10, signed);
b1 = Unquantize(b1, 10, signed);
subsetCount = 1;
break;
case 6:
r0 = (int)(((low >> 29) & 0x400) | ((low >> 5) & 0x3FF));
g0 = (int)(((low >> 40) & 0x400) | ((low >> 15) & 0x3FF));
b0 = (int)(((low >> 49) & 0x400) | ((low >> 25) & 0x3FF));
if (signed)
{
r0 = SignExtend(r0, 11);
g0 = SignExtend(g0, 11);
b0 = SignExtend(b0, 11);
}
r1 = r0 + SignExtend((int)(low >> 35), 4);
g1 = g0 + SignExtend((int)(low >> 45), 5);
b1 = b0 + SignExtend((int)(low >> 55), 4);
r2 = r0 + SignExtend((int)(high >> 1), 4);
g2 = g0 + SignExtend((int)(((high >> 7) & 0x10) | ((low >> 41) & 0x0F)), 5);
b2 = b0 + SignExtend((int)(((high << 3) & 0x08) | ((low >> 61))), 4);
r3 = r0 + SignExtend((int)(high >> 7), 4);
g3 = g0 + SignExtend((int)(((low >> 36) & 0x10) | ((low >> 51) & 0x0F)), 5);
b3 = b0 + SignExtend((int)(
((high >> 9) & 8) |
((high >> 4) & 4) |
((low >> 59) & 2) |
((high >> 5) & 1)), 4);
r0 = Unquantize(r0, 11, signed);
g0 = Unquantize(g0, 11, signed);
b0 = Unquantize(b0, 11, signed);
r1 = Unquantize(r1 & 0x7FF, 11, signed);
g1 = Unquantize(g1 & 0x7FF, 11, signed);
b1 = Unquantize(b1 & 0x7FF, 11, signed);
r2 = Unquantize(r2 & 0x7FF, 11, signed);
g2 = Unquantize(g2 & 0x7FF, 11, signed);
b2 = Unquantize(b2 & 0x7FF, 11, signed);
r3 = Unquantize(r3 & 0x7FF, 11, signed);
g3 = Unquantize(g3 & 0x7FF, 11, signed);
b3 = Unquantize(b3 & 0x7FF, 11, signed);
subsetCount = 2;
break;
case 7:
r0 = (int)(((low >> 34) & 0x400) | ((low >> 5) & 0x3FF));
g0 = (int)(((low >> 44) & 0x400) | ((low >> 15) & 0x3FF));
b0 = (int)(((high << 10) & 0x400) | ((low >> 25) & 0x3FF));
if (signed)
{
r0 = SignExtend(r0, 11);
g0 = SignExtend(g0, 11);
b0 = SignExtend(b0, 11);
}
r1 = (r0 + SignExtend((int)(low >> 35), 9)) & 0x7FF;
g1 = (g0 + SignExtend((int)(low >> 45), 9)) & 0x7FF;
b1 = (b0 + SignExtend((int)(low >> 55), 9)) & 0x7FF;
r0 = Unquantize(r0, 11, signed);
g0 = Unquantize(g0, 11, signed);
b0 = Unquantize(b0, 11, signed);
r1 = Unquantize(r1, 11, signed);
g1 = Unquantize(g1, 11, signed);
b1 = Unquantize(b1, 11, signed);
subsetCount = 1;
break;
case 10:
r0 = (int)(((low >> 29) & 0x400) | ((low >> 5) & 0x3FF));
g0 = (int)(((low >> 39) & 0x400) | ((low >> 15) & 0x3FF));
b0 = (int)(((low >> 50) & 0x400) | ((low >> 25) & 0x3FF));
if (signed)
{
r0 = SignExtend(r0, 11);
g0 = SignExtend(g0, 11);
b0 = SignExtend(b0, 11);
}
r1 = r0 + SignExtend((int)(low >> 35), 4);
g1 = g0 + SignExtend((int)(low >> 45), 4);
b1 = b0 + SignExtend((int)(low >> 55), 5);
r2 = r0 + SignExtend((int)(high >> 1), 4);
g2 = g0 + SignExtend((int)(low >> 41), 4);
b2 = b0 + SignExtend((int)(((low >> 36) & 0x10) | ((high << 3) & 8) | (low >> 61)), 5);
r3 = r0 + SignExtend((int)(high >> 7), 4);
g3 = g0 + SignExtend((int)(low >> 51), 4);
b3 = b0 + SignExtend((int)(
((high >> 7) & 0x10) |
((high >> 9) & 0x08) |
((high >> 4) & 0x06) |
((low >> 50) & 0x01)), 5);
r0 = Unquantize(r0, 11, signed);
g0 = Unquantize(g0, 11, signed);
b0 = Unquantize(b0, 11, signed);
r1 = Unquantize(r1 & 0x7FF, 11, signed);
g1 = Unquantize(g1 & 0x7FF, 11, signed);
b1 = Unquantize(b1 & 0x7FF, 11, signed);
r2 = Unquantize(r2 & 0x7FF, 11, signed);
g2 = Unquantize(g2 & 0x7FF, 11, signed);
b2 = Unquantize(b2 & 0x7FF, 11, signed);
r3 = Unquantize(r3 & 0x7FF, 11, signed);
g3 = Unquantize(g3 & 0x7FF, 11, signed);
b3 = Unquantize(b3 & 0x7FF, 11, signed);
subsetCount = 2;
break;
case 11:
r0 = (int)(((low >> 32) & 0x800) | ((low >> 34) & 0x400) | ((low >> 5) & 0x3FF));
g0 = (int)(((low >> 42) & 0x800) | ((low >> 44) & 0x400) | ((low >> 15) & 0x3FF));
b0 = (int)(((low >> 52) & 0x800) | ((high << 10) & 0x400) | ((low >> 25) & 0x3FF));
if (signed)
{
r0 = SignExtend(r0, 12);
g0 = SignExtend(g0, 12);
b0 = SignExtend(b0, 12);
}
r1 = (r0 + SignExtend((int)(low >> 35), 8)) & 0xFFF;
g1 = (g0 + SignExtend((int)(low >> 45), 8)) & 0xFFF;
b1 = (b0 + SignExtend((int)(low >> 55), 8)) & 0xFFF;
r0 = Unquantize(r0, 12, signed);
g0 = Unquantize(g0, 12, signed);
b0 = Unquantize(b0, 12, signed);
r1 = Unquantize(r1, 12, signed);
g1 = Unquantize(g1, 12, signed);
b1 = Unquantize(b1, 12, signed);
subsetCount = 1;
break;
case 14:
r0 = (int)(low >> 5) & 0x1FF;
g0 = (int)(low >> 15) & 0x1FF;
b0 = (int)(low >> 25) & 0x1FF;
if (signed)
{
r0 = SignExtend(r0, 9);
g0 = SignExtend(g0, 9);
b0 = SignExtend(b0, 9);
}
r1 = r0 + SignExtend((int)(low >> 35), 5);
g1 = g0 + SignExtend((int)(low >> 45), 5);
b1 = b0 + SignExtend((int)(low >> 55), 5);
r2 = r0 + SignExtend((int)(high >> 1), 5);
g2 = g0 + SignExtend((int)(((low >> 20) & 0x10) | ((low >> 41) & 0xF)), 5);
b2 = b0 + SignExtend((int)(((low >> 10) & 0x10) | ((high << 3) & 8) | (low >> 61)), 5);
r3 = r0 + SignExtend((int)(high >> 7), 5);
g3 = g0 + SignExtend((int)(((low >> 36) & 0x10) | ((low >> 51) & 0xF)), 5);
b3 = b0 + SignExtend((int)(
((low >> 30) & 0x10) |
((high >> 9) & 0x08) |
((high >> 4) & 0x04) |
((low >> 59) & 0x02) |
((low >> 50) & 0x01)), 5);
r0 = Unquantize(r0, 9, signed);
g0 = Unquantize(g0, 9, signed);
b0 = Unquantize(b0, 9, signed);
r1 = Unquantize(r1 & 0x1FF, 9, signed);
g1 = Unquantize(g1 & 0x1FF, 9, signed);
b1 = Unquantize(b1 & 0x1FF, 9, signed);
r2 = Unquantize(r2 & 0x1FF, 9, signed);
g2 = Unquantize(g2 & 0x1FF, 9, signed);
b2 = Unquantize(b2 & 0x1FF, 9, signed);
r3 = Unquantize(r3 & 0x1FF, 9, signed);
g3 = Unquantize(g3 & 0x1FF, 9, signed);
b3 = Unquantize(b3 & 0x1FF, 9, signed);
subsetCount = 2;
break;
case 15:
r0 = (BitReverse6((int)(low >> 39) & 0x3F) << 10) | ((int)(low >> 5) & 0x3FF);
g0 = (BitReverse6((int)(low >> 49) & 0x3F) << 10) | ((int)(low >> 15) & 0x3FF);
b0 = ((BitReverse6((int)(low >> 59)) | (int)(high & 1)) << 10) | ((int)(low >> 25) & 0x3FF);
if (signed)
{
r0 = SignExtend(r0, 16);
g0 = SignExtend(g0, 16);
b0 = SignExtend(b0, 16);
}
r1 = (r0 + SignExtend((int)(low >> 35), 4)) & 0xFFFF;
g1 = (g0 + SignExtend((int)(low >> 45), 4)) & 0xFFFF;
b1 = (b0 + SignExtend((int)(low >> 55), 4)) & 0xFFFF;
subsetCount = 1;
break;
case 18:
r0 = (int)(low >> 5) & 0xFF;
g0 = (int)(low >> 15) & 0xFF;
b0 = (int)(low >> 25) & 0xFF;
if (signed)
{
r0 = SignExtend(r0, 8);
g0 = SignExtend(g0, 8);
b0 = SignExtend(b0, 8);
}
r1 = r0 + SignExtend((int)(low >> 35), 6);
g1 = g0 + SignExtend((int)(low >> 45), 5);
b1 = b0 + SignExtend((int)(low >> 55), 5);
r2 = r0 + SignExtend((int)(high >> 1), 6);
g2 = g0 + SignExtend((int)(((low >> 20) & 0x10) | ((low >> 41) & 0xF)), 5);
b2 = b0 + SignExtend((int)(((low >> 10) & 0x10) | ((high << 3) & 8) | (low >> 61)), 5);
r3 = r0 + SignExtend((int)(high >> 7), 6);
g3 = g0 + SignExtend((int)(((low >> 9) & 0x10) | ((low >> 51) & 0xF)), 5);
b3 = b0 + SignExtend((int)(
((low >> 30) & 0x18) |
((low >> 21) & 0x04) |
((low >> 59) & 0x02) |
((low >> 50) & 0x01)), 5);
r0 = Unquantize(r0, 8, signed);
g0 = Unquantize(g0, 8, signed);
b0 = Unquantize(b0, 8, signed);
r1 = Unquantize(r1 & 0xFF, 8, signed);
g1 = Unquantize(g1 & 0xFF, 8, signed);
b1 = Unquantize(b1 & 0xFF, 8, signed);
r2 = Unquantize(r2 & 0xFF, 8, signed);
g2 = Unquantize(g2 & 0xFF, 8, signed);
b2 = Unquantize(b2 & 0xFF, 8, signed);
r3 = Unquantize(r3 & 0xFF, 8, signed);
g3 = Unquantize(g3 & 0xFF, 8, signed);
b3 = Unquantize(b3 & 0xFF, 8, signed);
subsetCount = 2;
break;
case 22:
r0 = (int)(low >> 5) & 0xFF;
g0 = (int)(low >> 15) & 0xFF;
b0 = (int)(low >> 25) & 0xFF;
if (signed)
{
r0 = SignExtend(r0, 8);
g0 = SignExtend(g0, 8);
b0 = SignExtend(b0, 8);
}
r1 = r0 + SignExtend((int)(low >> 35), 5);
g1 = g0 + SignExtend((int)(low >> 45), 6);
b1 = b0 + SignExtend((int)(low >> 55), 5);
r2 = r0 + SignExtend((int)(high >> 1), 5);
g2 = g0 + SignExtend((int)(((low >> 18) & 0x20) | ((low >> 20) & 0x10) | ((low >> 41) & 0xF)), 6);
b2 = b0 + SignExtend((int)(((low >> 10) & 0x10) | ((high << 3) & 0x08) | (low >> 61)), 5);
r3 = r0 + SignExtend((int)(high >> 7), 5);
g3 = g0 + SignExtend((int)(((low >> 28) & 0x20) | ((low >> 36) & 0x10) | ((low >> 51) & 0x0F)), 6);
b3 = b0 + SignExtend((int)(
((low >> 30) & 0x10) |
((high >> 9) & 0x08) |
((high >> 4) & 0x04) |
((low >> 59) & 0x02) |
((low >> 13) & 0x01)), 5);
r0 = Unquantize(r0, 8, signed);
g0 = Unquantize(g0, 8, signed);
b0 = Unquantize(b0, 8, signed);
r1 = Unquantize(r1 & 0xFF, 8, signed);
g1 = Unquantize(g1 & 0xFF, 8, signed);
b1 = Unquantize(b1 & 0xFF, 8, signed);
r2 = Unquantize(r2 & 0xFF, 8, signed);
g2 = Unquantize(g2 & 0xFF, 8, signed);
b2 = Unquantize(b2 & 0xFF, 8, signed);
r3 = Unquantize(r3 & 0xFF, 8, signed);
g3 = Unquantize(g3 & 0xFF, 8, signed);
b3 = Unquantize(b3 & 0xFF, 8, signed);
subsetCount = 2;
break;
case 26:
r0 = (int)(low >> 5) & 0xFF;
g0 = (int)(low >> 15) & 0xFF;
b0 = (int)(low >> 25) & 0xFF;
if (signed)
{
r0 = SignExtend(r0, 8);
g0 = SignExtend(g0, 8);
b0 = SignExtend(b0, 8);
}
r1 = r0 + SignExtend((int)(low >> 35), 5);
g1 = g0 + SignExtend((int)(low >> 45), 5);
b1 = b0 + SignExtend((int)(low >> 55), 6);
r2 = r0 + SignExtend((int)(high >> 1), 5);
g2 = g0 + SignExtend((int)(((low >> 20) & 0x10) | ((low >> 41) & 0xF)), 5);
b2 = b0 + SignExtend((int)(
((low >> 18) & 0x20) |
((low >> 10) & 0x10) |
((high << 3) & 0x08) |
(low >> 61)), 6);
r3 = r0 + SignExtend((int)(high >> 7), 5);
g3 = g0 + SignExtend((int)(((low >> 36) & 0x10) | ((low >> 51) & 0xF)), 5);
b3 = b0 + SignExtend((int)(
((low >> 28) & 0x20) |
((low >> 30) & 0x10) |
((high >> 9) & 0x08) |
((high >> 4) & 0x04) |
((low >> 12) & 0x02) |
((low >> 50) & 0x01)), 6);
r0 = Unquantize(r0, 8, signed);
g0 = Unquantize(g0, 8, signed);
b0 = Unquantize(b0, 8, signed);
r1 = Unquantize(r1 & 0xFF, 8, signed);
g1 = Unquantize(g1 & 0xFF, 8, signed);
b1 = Unquantize(b1 & 0xFF, 8, signed);
r2 = Unquantize(r2 & 0xFF, 8, signed);
g2 = Unquantize(g2 & 0xFF, 8, signed);
b2 = Unquantize(b2 & 0xFF, 8, signed);
r3 = Unquantize(r3 & 0xFF, 8, signed);
g3 = Unquantize(g3 & 0xFF, 8, signed);
b3 = Unquantize(b3 & 0xFF, 8, signed);
subsetCount = 2;
break;
case 30:
r0 = (int)(low >> 5) & 0x3F;
g0 = (int)(low >> 15) & 0x3F;
b0 = (int)(low >> 25) & 0x3F;
r1 = (int)(low >> 35) & 0x3F;
g1 = (int)(low >> 45) & 0x3F;
b1 = (int)(low >> 55) & 0x3F;
r2 = (int)(high >> 1) & 0x3F;
g2 = (int)(((low >> 16) & 0x20) | ((low >> 20) & 0x10) | ((low >> 41) & 0xF));
b2 = (int)(((low >> 17) & 0x20) | ((low >> 10) & 0x10) | ((high << 3) & 0x08) | (low >> 61));
r3 = (int)(high >> 7) & 0x3F;
g3 = (int)(((low >> 26) & 0x20) | ((low >> 7) & 0x10) | ((low >> 51) & 0xF));
b3 = (int)(
((low >> 28) & 0x20) |
((low >> 30) & 0x10) |
((low >> 29) & 0x08) |
((low >> 21) & 0x04) |
((low >> 12) & 0x03));
if (signed)
{
r0 = SignExtend(r0, 6);
g0 = SignExtend(g0, 6);
b0 = SignExtend(b0, 6);
r1 = SignExtend(r1, 6);
g1 = SignExtend(g1, 6);
b1 = SignExtend(b1, 6);
r2 = SignExtend(r2, 6);
g2 = SignExtend(g2, 6);
b2 = SignExtend(b2, 6);
r3 = SignExtend(r3, 6);
g3 = SignExtend(g3, 6);
b3 = SignExtend(b3, 6);
}
r0 = Unquantize(r0, 6, signed);
g0 = Unquantize(g0, 6, signed);
b0 = Unquantize(b0, 6, signed);
r1 = Unquantize(r1, 6, signed);
g1 = Unquantize(g1, 6, signed);
b1 = Unquantize(b1, 6, signed);
r2 = Unquantize(r2, 6, signed);
g2 = Unquantize(g2, 6, signed);
b2 = Unquantize(b2, 6, signed);
r3 = Unquantize(r3, 6, signed);
g3 = Unquantize(g3, 6, signed);
b3 = Unquantize(b3, 6, signed);
subsetCount = 2;
break;
default:
subsetCount = 0;
break;
}
if (subsetCount > 0)
{
endPoints[0] = new RgbaColor32(r0, g0, b0, HalfOne);
endPoints[1] = new RgbaColor32(r1, g1, b1, HalfOne);
if (subsetCount > 1)
{
endPoints[2] = new RgbaColor32(r2, g2, b2, HalfOne);
endPoints[3] = new RgbaColor32(r3, g3, b3, HalfOne);
}
}
return subsetCount;
}
private static int SignExtend(int value, int bits)
{
int shift = 32 - bits;
return (value << shift) >> shift;
}
private static int Unquantize(int value, int bits, bool signed)
{
if (signed)
{
if (bits >= 16)
{
return value;
}
else
{
bool sign = value < 0;
if (sign)
{
value = -value;
}
if (value == 0)
{
return value;
}
else if (value >= ((1 << (bits - 1)) - 1))
{
value = 0x7FFF;
}
else
{
value = ((value << 15) + 0x4000) >> (bits - 1);
}
if (sign)
{
value = -value;
}
}
}
else
{
if (bits >= 15 || value == 0)
{
return value;
}
else if (value == ((1 << bits) - 1))
{
return 0xFFFF;
}
else
{
return ((value << 16) + 0x8000) >> bits;
}
}
return value;
}
private static ushort FinishUnquantize(int value, bool signed)
{
if (signed)
{
value = value < 0 ? -((-value * 31) >> 5) : (value * 31) >> 5;
int sign = 0;
if (value < 0)
{
sign = 0x8000;
value = -value;
}
return (ushort)(sign | value);
}
else
{
return (ushort)((value * 31) >> 6);
}
}
private static int BitReverse6(int value)
{
value = ((value >> 1) & 0x55) | ((value << 1) & 0xaa);
value = ((value >> 2) & 0x33) | ((value << 2) & 0xcc);
value = ((value >> 4) & 0x0f) | ((value << 4) & 0xf0);
return value >> 2;
}
}
}
Reference in a new issue Copy permalink