encounter
/
dawn-cmake
mirror of https://github.com/encounter/dawn-cmake.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
dawn-cmake/test/vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-fa.../0.spvasm.expected.wgsl

654 lines
15 KiB
WebGPU Shading Language
Raw Normal View History

Add tests derived from VK-GL-CTS This adds SPIR-V assembly and WGSL tests derived from VK-GL-CTS commit 571256871c2e2f03995373e1e4a02958d8cd8cf5. The following procedure was followed: - Those .amber files in VK-GL-CTS wholly owned by Google were identified - All GLSL and SPIR-V shaders were extracted from the Amber files and converted into SPIR-V binaries - The compact-ids pass of spirv-opt was applied to each binary - Duplicate binaries were removed - spirv-opt -O was used to obtain an optimized version of each remaining binary, with duplicates discarded - Binaries that failed validation using spirv-val with target environment SPIR-V 1.3 were discarded - Those binaries that tint could not successfully convert into WGSL were put aside for further investigation - SPIR-V assembly versions of the remaining binaries are included in this CL - test-runner with -generate-expected and -generate-skip was used to generate expected .spvasm, .msl, .hlsl and .wgsl outputs for these SPIR-V assembly tests - Each successfully-generated .expected.wgsl is included in this CL again, as a WGLSL test - test-runner with -generate-expected and -generate-skip was used again, to generate expected outputs for these WGSL tests Change-Id: Ibe9baf2729cf97e0b633db9a426f53362a5de540 Reviewed-on: https://dawn-review.googlesource.com/c/tint/+/58842 Kokoro: Kokoro <noreply+kokoro@google.com> Commit-Queue: Ben Clayton <bclayton@google.com> Reviewed-by: Ben Clayton <bclayton@google.com>
2021-07-23 13:10:12 +00:00
struct BST {
data : i32;
leftIndex : i32;
rightIndex : i32;
};
var<private> x_GLF_color : vec4<f32>;
fn main_1() {
var tree : array<BST, 10>;
var x_356 : i32;
var x_58_phi : i32;
var x_86_phi : bool;
var x_353_phi : i32;
var x_356_phi : i32;
var x_358_phi : i32;
tree[0] = BST(9, -1, -1);
switch(0u) {
default: {
x_58_phi = 0;
loop {
var x_84 : i32;
var x_76 : i32;
var x_59 : i32;
var x_59_phi : i32;
let x_58 : i32 = x_58_phi;
x_86_phi = false;
if ((x_58 <= 1)) {
} else {
break;
}
let x_65 : i32 = tree[x_58].data;
if ((5 <= x_65)) {
let x_78 : ptr<function, i32> = &(tree[x_58].leftIndex);
let x_79 : i32 = *(x_78);
if ((x_79 == -1)) {
*(x_78) = 1;
tree[1] = BST(5, -1, -1);
x_86_phi = true;
break;
} else {
x_84 = *(x_78);
x_59_phi = x_84;
continue;
}
return;
} else {
let x_70 : ptr<function, i32> = &(tree[x_58].rightIndex);
let x_71 : i32 = *(x_70);
if ((x_71 == -1)) {
*(x_70) = 1;
tree[1] = BST(5, -1, -1);
x_86_phi = true;
break;
} else {
x_76 = *(x_70);
x_59_phi = x_76;
continue;
}
return;
}
return;
continuing {
x_59 = x_59_phi;
x_58_phi = x_59;
}
}
let x_86 : bool = x_86_phi;
if (x_86) {
break;
}
}
}
var x_91_phi : i32;
var x_119_phi : bool;
switch(0u) {
default: {
x_91_phi = 0;
loop {
var x_117 : i32;
var x_109 : i32;
var x_92 : i32;
var x_92_phi : i32;
let x_91 : i32 = x_91_phi;
x_119_phi = false;
if ((x_91 <= 2)) {
} else {
break;
}
let x_98 : i32 = tree[x_91].data;
if ((12 <= x_98)) {
let x_111 : ptr<function, i32> = &(tree[x_91].leftIndex);
let x_112 : i32 = *(x_111);
if ((x_112 == -1)) {
*(x_111) = 2;
tree[2] = BST(12, -1, -1);
x_119_phi = true;
break;
} else {
x_117 = *(x_111);
x_92_phi = x_117;
continue;
}
return;
} else {
let x_103 : ptr<function, i32> = &(tree[x_91].rightIndex);
let x_104 : i32 = *(x_103);
if ((x_104 == -1)) {
*(x_103) = 2;
tree[2] = BST(12, -1, -1);
x_119_phi = true;
break;
} else {
x_109 = *(x_103);
x_92_phi = x_109;
continue;
}
return;
}
return;
continuing {
x_92 = x_92_phi;
x_91_phi = x_92;
}
}
let x_119 : bool = x_119_phi;
if (x_119) {
break;
}
}
}
var x_124_phi : i32;
var x_152_phi : bool;
switch(0u) {
default: {
x_124_phi = 0;
loop {
var x_150 : i32;
var x_142 : i32;
var x_125 : i32;
var x_125_phi : i32;
let x_124 : i32 = x_124_phi;
x_152_phi = false;
if ((x_124 <= 3)) {
} else {
break;
}
let x_131 : i32 = tree[x_124].data;
if ((15 <= x_131)) {
let x_144 : ptr<function, i32> = &(tree[x_124].leftIndex);
let x_145 : i32 = *(x_144);
if ((x_145 == -1)) {
*(x_144) = 3;
tree[3] = BST(15, -1, -1);
x_152_phi = true;
break;
} else {
x_150 = *(x_144);
x_125_phi = x_150;
continue;
}
return;
} else {
let x_136 : ptr<function, i32> = &(tree[x_124].rightIndex);
let x_137 : i32 = *(x_136);
if ((x_137 == -1)) {
*(x_136) = 3;
tree[3] = BST(15, -1, -1);
x_152_phi = true;
break;
} else {
x_142 = *(x_136);
x_125_phi = x_142;
continue;
}
return;
}
return;
continuing {
x_125 = x_125_phi;
x_124_phi = x_125;
}
}
let x_152 : bool = x_152_phi;
if (x_152) {
break;
}
}
}
var x_157_phi : i32;
var x_185_phi : bool;
switch(0u) {
default: {
x_157_phi = 0;
loop {
var x_183 : i32;
var x_175 : i32;
var x_158 : i32;
var x_158_phi : i32;
let x_157 : i32 = x_157_phi;
x_185_phi = false;
if ((x_157 <= 4)) {
} else {
break;
}
let x_164 : i32 = tree[x_157].data;
if ((7 <= x_164)) {
let x_177 : ptr<function, i32> = &(tree[x_157].leftIndex);
let x_178 : i32 = *(x_177);
if ((x_178 == -1)) {
*(x_177) = 4;
tree[4] = BST(7, -1, -1);
x_185_phi = true;
break;
} else {
x_183 = *(x_177);
x_158_phi = x_183;
continue;
}
return;
} else {
let x_169 : ptr<function, i32> = &(tree[x_157].rightIndex);
let x_170 : i32 = *(x_169);
if ((x_170 == -1)) {
*(x_169) = 4;
tree[4] = BST(7, -1, -1);
x_185_phi = true;
break;
} else {
x_175 = *(x_169);
x_158_phi = x_175;
continue;
}
return;
}
return;
continuing {
x_158 = x_158_phi;
x_157_phi = x_158;
}
}
let x_185 : bool = x_185_phi;
if (x_185) {
break;
}
}
}
var x_190_phi : i32;
var x_218_phi : bool;
switch(0u) {
default: {
x_190_phi = 0;
loop {
var x_216 : i32;
var x_208 : i32;
var x_191 : i32;
var x_191_phi : i32;
let x_190 : i32 = x_190_phi;
x_218_phi = false;
if ((x_190 <= 5)) {
} else {
break;
}
let x_197 : i32 = tree[x_190].data;
if ((8 <= x_197)) {
let x_210 : ptr<function, i32> = &(tree[x_190].leftIndex);
let x_211 : i32 = *(x_210);
if ((x_211 == -1)) {
*(x_210) = 5;
tree[5] = BST(8, -1, -1);
x_218_phi = true;
break;
} else {
x_216 = *(x_210);
x_191_phi = x_216;
continue;
}
return;
} else {
let x_202 : ptr<function, i32> = &(tree[x_190].rightIndex);
let x_203 : i32 = *(x_202);
if ((x_203 == -1)) {
*(x_202) = 5;
tree[5] = BST(8, -1, -1);
x_218_phi = true;
break;
} else {
x_208 = *(x_202);
x_191_phi = x_208;
continue;
}
return;
}
return;
continuing {
x_191 = x_191_phi;
x_190_phi = x_191;
}
}
let x_218 : bool = x_218_phi;
if (x_218) {
break;
}
}
}
var x_223_phi : i32;
var x_251_phi : bool;
switch(0u) {
default: {
x_223_phi = 0;
loop {
var x_249 : i32;
var x_241 : i32;
var x_224 : i32;
var x_224_phi : i32;
let x_223 : i32 = x_223_phi;
x_251_phi = false;
if ((x_223 <= 6)) {
} else {
break;
}
let x_230 : i32 = tree[x_223].data;
if ((2 <= x_230)) {
let x_243 : ptr<function, i32> = &(tree[x_223].leftIndex);
let x_244 : i32 = *(x_243);
if ((x_244 == -1)) {
*(x_243) = 6;
tree[6] = BST(2, -1, -1);
x_251_phi = true;
break;
} else {
x_249 = *(x_243);
x_224_phi = x_249;
continue;
}
return;
} else {
let x_235 : ptr<function, i32> = &(tree[x_223].rightIndex);
let x_236 : i32 = *(x_235);
if ((x_236 == -1)) {
*(x_235) = 6;
tree[6] = BST(2, -1, -1);
x_251_phi = true;
break;
} else {
x_241 = *(x_235);
x_224_phi = x_241;
continue;
}
return;
}
return;
continuing {
x_224 = x_224_phi;
x_223_phi = x_224;
}
}
let x_251 : bool = x_251_phi;
if (x_251) {
break;
}
}
}
var x_256_phi : i32;
var x_284_phi : bool;
switch(0u) {
default: {
x_256_phi = 0;
loop {
var x_282 : i32;
var x_274 : i32;
var x_257 : i32;
var x_257_phi : i32;
let x_256 : i32 = x_256_phi;
x_284_phi = false;
if ((x_256 <= 7)) {
} else {
break;
}
let x_263 : i32 = tree[x_256].data;
if ((6 <= x_263)) {
let x_276 : ptr<function, i32> = &(tree[x_256].leftIndex);
let x_277 : i32 = *(x_276);
if ((x_277 == -1)) {
*(x_276) = 7;
tree[7] = BST(6, -1, -1);
x_284_phi = true;
break;
} else {
x_282 = *(x_276);
x_257_phi = x_282;
continue;
}
return;
} else {
let x_268 : ptr<function, i32> = &(tree[x_256].rightIndex);
let x_269 : i32 = *(x_268);
if ((x_269 == -1)) {
*(x_268) = 7;
tree[7] = BST(6, -1, -1);
x_284_phi = true;
break;
} else {
x_274 = *(x_268);
x_257_phi = x_274;
continue;
}
return;
}
return;
continuing {
x_257 = x_257_phi;
x_256_phi = x_257;
}
}
let x_284 : bool = x_284_phi;
if (x_284) {
break;
}
}
}
var x_289_phi : i32;
var x_317_phi : bool;
switch(0u) {
default: {
x_289_phi = 0;
loop {
var x_315 : i32;
var x_307 : i32;
var x_290 : i32;
var x_290_phi : i32;
let x_289 : i32 = x_289_phi;
x_317_phi = false;
if ((x_289 <= 8)) {
} else {
break;
}
let x_296 : i32 = tree[x_289].data;
if ((17 <= x_296)) {
let x_309 : ptr<function, i32> = &(tree[x_289].leftIndex);
let x_310 : i32 = *(x_309);
if ((x_310 == -1)) {
*(x_309) = 8;
tree[8] = BST(17, -1, -1);
x_317_phi = true;
break;
} else {
x_315 = *(x_309);
x_290_phi = x_315;
continue;
}
return;
} else {
let x_301 : ptr<function, i32> = &(tree[x_289].rightIndex);
let x_302 : i32 = *(x_301);
if ((x_302 == -1)) {
*(x_301) = 8;
tree[8] = BST(17, -1, -1);
x_317_phi = true;
break;
} else {
x_307 = *(x_301);
x_290_phi = x_307;
continue;
}
return;
}
return;
continuing {
x_290 = x_290_phi;
x_289_phi = x_290;
}
}
let x_317 : bool = x_317_phi;
if (x_317) {
break;
}
}
}
var x_322_phi : i32;
var x_350_phi : bool;
switch(0u) {
default: {
x_322_phi = 0;
loop {
var x_348 : i32;
var x_340 : i32;
var x_323 : i32;
var x_323_phi : i32;
let x_322 : i32 = x_322_phi;
x_350_phi = false;
if ((x_322 <= 9)) {
} else {
break;
}
let x_329 : i32 = tree[x_322].data;
if ((13 <= x_329)) {
let x_342 : ptr<function, i32> = &(tree[x_322].leftIndex);
let x_343 : i32 = *(x_342);
if ((x_343 == -1)) {
*(x_342) = 9;
tree[9] = BST(13, -1, -1);
x_350_phi = true;
break;
} else {
x_348 = *(x_342);
x_323_phi = x_348;
continue;
}
return;
} else {
let x_334 : ptr<function, i32> = &(tree[x_322].rightIndex);
let x_335 : i32 = *(x_334);
if ((x_335 == -1)) {
*(x_334) = 9;
tree[9] = BST(13, -1, -1);
x_350_phi = true;
break;
} else {
x_340 = *(x_334);
x_323_phi = x_340;
continue;
}
return;
}
return;
continuing {
x_323 = x_323_phi;
x_322_phi = x_323;
}
}
let x_350 : bool = x_350_phi;
if (x_350) {
break;
}
}
}
x_353_phi = 0;
x_356_phi = 0;
x_358_phi = 0;
loop {
var x_381 : i32;
var x_391 : i32;
var x_396 : i32;
var x_359 : i32;
var x_354_phi : i32;
var x_357_phi : i32;
let x_353 : i32 = x_353_phi;
x_356 = x_356_phi;
let x_358 : i32 = x_358_phi;
if ((x_358 < 20)) {
} else {
break;
}
var x_366_phi : i32;
var x_381_phi : i32;
var x_382_phi : bool;
switch(0u) {
default: {
x_366_phi = 0;
loop {
let x_366 : i32 = x_366_phi;
x_381_phi = x_353;
x_382_phi = false;
if ((x_366 != -1)) {
} else {
break;
}
let x_373 : BST = tree[x_366];
let x_374 : i32 = x_373.data;
let x_375 : i32 = x_373.leftIndex;
let x_376 : i32 = x_373.rightIndex;
if ((x_374 == x_358)) {
x_381_phi = x_358;
x_382_phi = true;
break;
}
continuing {
x_366_phi = select(x_375, x_376, (x_358 > x_374));
}
}
x_381 = x_381_phi;
let x_382 : bool = x_382_phi;
x_354_phi = x_381;
if (x_382) {
break;
}
x_354_phi = -1;
}
}
var x_354 : i32;
var x_390 : i32;
var x_395 : i32;
var x_391_phi : i32;
var x_396_phi : i32;
x_354 = x_354_phi;
switch(x_358) {
case 2, 5, 6, 7, 8, 9, 12, 13, 15, 17: {
x_391_phi = x_356;
if ((x_354 == bitcast<i32>(x_358))) {
x_390 = bitcast<i32>((x_356 + bitcast<i32>(1)));
x_391_phi = x_390;
}
x_391 = x_391_phi;
x_357_phi = x_391;
}
default: {
x_396_phi = x_356;
if ((x_354 == bitcast<i32>(-1))) {
x_395 = bitcast<i32>((x_356 + bitcast<i32>(1)));
x_396_phi = x_395;
}
x_396 = x_396_phi;
x_357_phi = x_396;
}
}
let x_357 : i32 = x_357_phi;
continuing {
x_359 = (x_358 + 1);
x_353_phi = x_354;
x_356_phi = x_357;
x_358_phi = x_359;
}
}
if ((x_356 == bitcast<i32>(20))) {
x_GLF_color = vec4<f32>(1.0, 0.0, 0.0, 1.0);
} else {
x_GLF_color = vec4<f32>(0.0, 0.0, 1.0, 1.0);
}
return;
}
struct main_out {
[[location(0)]]
x_GLF_color_1 : vec4<f32>;
};
[[stage(fragment)]]
fn main() -> main_out {
main_1();
return main_out(x_GLF_color);
}