mirror of
https://github.com/encounter/dawn-cmake.git
synced 2025-12-12 22:56:09 +00:00
Make reserved words an error.
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:
committed by
Dawn LUCI CQ
parent
2d706a0436
commit
5071a54af4
@@ -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 %buf0 "buf0"
|
||||
@@ -427,7 +427,7 @@
|
||||
OpReturn
|
||||
OpFunctionEnd
|
||||
%search_i1_ = OpFunction %int None %55
|
||||
%target = OpFunctionParameter %_ptr_Function_int
|
||||
%t = OpFunctionParameter %_ptr_Function_int
|
||||
%260 = OpLabel
|
||||
%index = OpVariable %_ptr_Function_int Function
|
||||
%currentNode = OpVariable %_ptr_Function_BST Function
|
||||
@@ -448,15 +448,15 @@
|
||||
OpStore %currentNode %271
|
||||
%272 = OpAccessChain %_ptr_Function_int %currentNode %int_0
|
||||
%273 = OpLoad %int %272
|
||||
%274 = OpLoad %int %target
|
||||
%274 = OpLoad %int %t
|
||||
%275 = OpIEqual %bool %273 %274
|
||||
OpSelectionMerge %276 None
|
||||
OpBranchConditional %275 %277 %276
|
||||
%277 = OpLabel
|
||||
%278 = OpLoad %int %target
|
||||
%278 = OpLoad %int %t
|
||||
OpReturnValue %278
|
||||
%276 = OpLabel
|
||||
%279 = OpLoad %int %target
|
||||
%279 = OpLoad %int %t
|
||||
%280 = OpAccessChain %_ptr_Function_int %currentNode %int_0
|
||||
%281 = OpLoad %int %280
|
||||
%282 = OpSGreaterThan %bool %279 %281
|
||||
|
||||
@@ -112,7 +112,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_261 : i32;
|
||||
@@ -127,12 +127,12 @@ fn search_i1_(target : ptr<function, i32>) -> i32 {
|
||||
let x_271 : BST = tree_1[x_269];
|
||||
currentNode = x_271;
|
||||
let x_273 : i32 = currentNode.data;
|
||||
let x_274 : i32 = *(target);
|
||||
let x_274 : i32 = *(t);
|
||||
if ((x_273 == x_274)) {
|
||||
let x_278 : i32 = *(target);
|
||||
let x_278 : i32 = *(t);
|
||||
return x_278;
|
||||
}
|
||||
let x_279 : i32 = *(target);
|
||||
let x_279 : i32 = *(t);
|
||||
let x_281 : i32 = currentNode.data;
|
||||
if ((x_279 > x_281)) {
|
||||
let x_287 : i32 = currentNode.rightIndex;
|
||||
|
||||
Reference in New Issue
Block a user