encounter/dawn-cmake
1
0
Fork 0
mirror of https://github.com/encounter/dawn-cmake.git synced 2025-12-20 18:29:23 +00:00
Code Issues Packages Projects Releases Wiki Activity

Make reserved words an error.

Browse Source 
This CL moves reserved words from a deprecation to an error.

Bug: tint:1463
Change-Id: I5c66baa15dc748215877c8152171c690495bc0c2
Reviewed-on: https://dawn-review.googlesource.com/c/dawn/+/108861
Kokoro: Kokoro <noreply+kokoro@google.com>
Reviewed-by: Ben Clayton <bclayton@google.com>
Commit-Queue: Dan Sinclair <dsinclair@chromium.org>
This commit is contained in:
dan sinclair
2022-11-07 16:15:55 +00:00
committed by Dawn LUCI CQ
parent 2d706a0436
commit 5071a54af4
59 changed files with 422 additions and 428 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
test/tint/vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-fragcoord-less-than-zero/0.spvasm
View File

@@ -16,7 +16,7 @@
OpName %treeIndex "treeIndex"
OpName %data_0 "data"
OpName %search_i1_ "search(i1;"
OpName %target "target"
OpName %t "t"
OpName %baseIndex "baseIndex"
OpName %tree_0 "tree"
OpName %param "param"
@@ -364,7 +364,7 @@
OpReturn
OpFunctionEnd
%search_i1_ = OpFunction %int None %53
%target = OpFunctionParameter %_ptr_Function_int
%t = OpFunctionParameter %_ptr_Function_int
%219 = OpLabel
%index = OpVariable %_ptr_Function_int Function
%currentNode = OpVariable %_ptr_Function_BST Function
@@ -385,15 +385,15 @@
OpStore %currentNode %230
%231 = OpAccessChain %_ptr_Function_int %currentNode %int_0
%232 = OpLoad %int %231
%233 = OpLoad %int %target
%233 = OpLoad %int %t
%234 = OpIEqual %bool %232 %233
OpSelectionMerge %235 None
OpBranchConditional %234 %236 %235
%236 = OpLabel
%237 = OpLoad %int %target
%237 = OpLoad %int %t
OpReturnValue %237
%235 = OpLabel
%238 = OpLoad %int %target
%238 = OpLoad %int %t
%239 = OpAccessChain %_ptr_Function_int %currentNode %int_0
%240 = OpLoad %int %239
%241 = OpSGreaterThan %bool %238 %240

8
test/tint/vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-fragcoord-less-than-zero/0.wgsl
View File

@@ -82,7 +82,7 @@ fn insert_i1_i1_(treeIndex : ptr<function, i32>, data_1 : ptr<function, i32>) {
return;
}
fn search_i1_(target : ptr<function, i32>) -> i32 {
fn search_i1_(t: ptr<function, i32>) -> i32 {
var index : i32;
var currentNode : BST;
var x_220 : i32;
@@ -97,12 +97,12 @@ fn search_i1_(target : ptr<function, i32>) -> i32 {
let x_230 : BST = tree_1[x_228];
currentNode = x_230;
let x_232 : i32 = currentNode.data;
let x_233 : i32 = *(target);
let x_233 : i32 = *(t);
if ((x_232 == x_233)) {
let x_237 : i32 = *(target);
let x_237 : i32 = *(t);
return x_237;
}
let x_238 : i32 = *(target);
let x_238 : i32 = *(t);
let x_240 : i32 = currentNode.data;
if ((x_238 > x_240)) {
let x_246 : i32 = currentNode.rightIndex;

10
test/tint/vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-fragcoord-less-than-zero/1.spvasm
View File

@@ -16,7 +16,7 @@
OpName %treeIndex "treeIndex"
OpName %data_0 "data"
OpName %search_i1_ "search(i1;"
OpName %target "target"
OpName %t "t"
OpName %baseIndex "baseIndex"
OpName %tree_0 "tree"
OpName %param "param"
@@ -380,7 +380,7 @@
OpReturn
OpFunctionEnd
%search_i1_ = OpFunction %int None %54
%target = OpFunctionParameter %_ptr_Function_int
%t = OpFunctionParameter %_ptr_Function_int
%230 = OpLabel
%index = OpVariable %_ptr_Function_int Function
%currentNode = OpVariable %_ptr_Function_BST Function
@@ -401,15 +401,15 @@
OpStore %currentNode %241
%242 = OpAccessChain %_ptr_Function_int %currentNode %int_0
%243 = OpLoad %int %242
%244 = OpLoad %int %target
%244 = OpLoad %int %t
%245 = OpIEqual %bool %243 %244
OpSelectionMerge %246 None
OpBranchConditional %245 %247 %246
%247 = OpLabel
%248 = OpLoad %int %target
%248 = OpLoad %int %t
OpReturnValue %248
%246 = OpLabel
%249 = OpLoad %int %target
%249 = OpLoad %int %t
%250 = OpAccessChain %_ptr_Function_int %currentNode %int_0
%251 = OpLoad %int %250
%252 = OpSGreaterThan %bool %249 %251

8
test/tint/vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-fragcoord-less-than-zero/1.wgsl
View File

@@ -84,7 +84,7 @@ fn insert_i1_i1_(treeIndex : ptr<function, i32>, data_1 : ptr<function, i32>) {
return;
}
fn search_i1_(target : ptr<function, i32>) -> i32 {
fn search_i1_(t : ptr<function, i32>) -> i32 {
var index : i32;
var currentNode : BST;
var x_231 : i32;
@@ -99,12 +99,12 @@ fn search_i1_(target : ptr<function, i32>) -> i32 {
let x_241 : BST = tree_1[x_239];
currentNode = x_241;
let x_243 : i32 = currentNode.data;
let x_244 : i32 = *(target);
let x_244 : i32 = *(t);
if ((x_243 == x_244)) {
let x_248 : i32 = *(target);
let x_248 : i32 = *(t);
return x_248;
}
let x_249 : i32 = *(target);
let x_249 : i32 = *(t);
let x_251 : i32 = currentNode.data;
if ((x_249 > x_251)) {
let x_257 : i32 = currentNode.rightIndex;