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
|
//DISABLED_TEST(compute, vulkan):COMPARE_COMPUTE_EX():-vk -compute -shaderobj -output-using-type -render-features wave-ops
//DISABLED_TEST(compute):COMPARE_COMPUTE_EX():-dx12 -profile sm_6_5 -compute -shaderobj -output-using-type -render-features wave-ops
//
// This test checks whether adjacent calls to saturated_cooperation are fused
//
//TEST_INPUT:ubuffer(data=[0 3 2 2], stride=4):out,name=outputBuffer
RWStructuredBuffer<uint> outputBuffer;
static int count = 0;
int cooperate(float x, int i)
{
count += i;
return int(x) * 2;
}
int fallback(float x, int)
{
count += 100;
return int(x) * 3;
}
int cooperate2(float x, float f)
{
count *= int(f);
return int(x) * 2;
}
int fallback2(float x, float)
{
count += 100;
return int(x) * 3;
}
// Make sure that we have enough invocations to saturate the first workgroup
[numthreads(128, 1, 1)]
void computeMain(uint tig : SV_GroupIndex)
{
// The values we're cooperating over are {0, 2, 3}
// We track the number of sets evaluated in the "count" variable, and write
// that at index 0
//
// If these are not fused, then we'd expect count to be incremented three
// times then doubled three times. What we want to see is
// 0, +1, *2, +1, *2, +1, *2 = 14
let i = tig < 4 ? float(outputBuffer[tig]) : 0;
let y = saturated_cooperation(cooperate, fallback, i, 1);
let x = saturated_cooperation(cooperate2, fallback2, i, 2.f);
if(tig < 4)
outputBuffer[tig] = tig == 0 ? count : x;
}
|
