mirror of
https://github.com/encounter/dawn-cmake.git
synced 2025-06-05 06:03:34 +00:00
Use the new semantic constant value information to significantly reduce the complex indexing logic emitted for UBO accesses. This will dramatically reduce the number of `for` loops that are decayed to `while` loops. Change-Id: I1b0adb5edde2b4ed39c6beafc2e28106b86e0edd Reviewed-on: https://dawn-review.googlesource.com/c/tint/+/57701 Kokoro: Kokoro <noreply+kokoro@google.com> Reviewed-by: James Price <jrprice@google.com>
35 lines
1.4 KiB
HLSL
35 lines
1.4 KiB
HLSL
float2x3 tint_symbol_8(ByteAddressBuffer buffer, uint offset) {
|
|
return float2x3(asfloat(buffer.Load3((offset + 0u))), asfloat(buffer.Load3((offset + 16u))));
|
|
}
|
|
|
|
float3x2 tint_symbol_10(ByteAddressBuffer buffer, uint offset) {
|
|
return float3x2(asfloat(buffer.Load2((offset + 0u))), asfloat(buffer.Load2((offset + 8u))), asfloat(buffer.Load2((offset + 16u))));
|
|
}
|
|
|
|
typedef int4 tint_symbol_12_ret[4];
|
|
tint_symbol_12_ret tint_symbol_12(ByteAddressBuffer buffer, uint offset) {
|
|
const int4 tint_symbol_13[4] = {asint(buffer.Load4((offset + 0u))), asint(buffer.Load4((offset + 16u))), asint(buffer.Load4((offset + 32u))), asint(buffer.Load4((offset + 48u)))};
|
|
return tint_symbol_13;
|
|
}
|
|
|
|
ByteAddressBuffer s : register(t0, space0);
|
|
|
|
struct tint_symbol_1 {
|
|
uint idx : SV_GroupIndex;
|
|
};
|
|
|
|
[numthreads(1, 1, 1)]
|
|
void main(tint_symbol_1 tint_symbol) {
|
|
const uint idx = tint_symbol.idx;
|
|
const int3 a = asint(s.Load3((176u * idx)));
|
|
const int b = asint(s.Load(((176u * idx) + 12u)));
|
|
const uint3 c = s.Load3(((176u * idx) + 16u));
|
|
const uint d = s.Load(((176u * idx) + 28u));
|
|
const float3 e = asfloat(s.Load3(((176u * idx) + 32u)));
|
|
const float f = asfloat(s.Load(((176u * idx) + 44u)));
|
|
const float2x3 g = tint_symbol_8(s, ((176u * idx) + 48u));
|
|
const float3x2 h = tint_symbol_10(s, ((176u * idx) + 80u));
|
|
const int4 i[4] = tint_symbol_12(s, ((176u * idx) + 112u));
|
|
return;
|
|
}
|