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
|
//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 more than 2 adjacent calls to saturated_cooperation
// are fused, even with operations between them
//
//TEST_INPUT:ubuffer(data=[0 3 2 2], stride=4):out,name=outputBuffer
RWStructuredBuffer<int> outputBuffer;
static int count = 0;
int coopAdd(float x, int i)
{
count += i;
return int(x) * 2;
}
int fallback(float x, int)
{
count = -1;
return -1;
}
int coopMul(float x, float f)
{
count *= int(f);
return int(x) * 2;
}
int fallback2(float x, float)
{
count = -1;
return -1;
}
int coopExp(float x, int i)
{
int c = count;
count = 1;
for(int j = 0; j < i; ++j)
count *= c;
return int(x) * 2;
}
// 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, **2, +1, *2, **2, +1, *2, **2 = 40804
let i = tig < 4 ? float(outputBuffer[tig]) : 0;
let y = saturated_cooperation(coopAdd, fallback, i, 1);
let m = 2.f;
let x = saturated_cooperation(coopMul, fallback2, i, m);
// Put some calculation between the calls to check that the fusion still takes place
let e = min(m*100, 2);
let z = saturated_cooperation(coopExp, fallback, i, int(e));
if(tig < 4)
outputBuffer[tig] = tig == 0 ? count : z;
}
|
