encounter/dawn-cmake
1
0
Fork 0
mirror of https://github.com/encounter/dawn-cmake.git synced 2025-12-10 05:57:51 +00:00
Code Issues Packages Projects Releases Wiki Activity

Revert "MSL writer: make signed int overflow defined behaviour"

Browse Source 
This reverts commit e5dbe24e94.

Reason for revert: Makes the Tint-Dawn roll fails because of
MSL compilation errors on as_type<uint>(-2147483648):
as_type cast from 'long' to 'uint' (aka 'unsigned int') is not allowed
   
as_type<uint>(-2147483647) compiles fine, so this is most
likely because the MSL compiler types the literal as a long
(since without the - it is larger than the max int32).

Original change's description:
> MSL writer: make signed int overflow defined behaviour
>
> Bug: tint:124
> Change-Id: Icf545b633d6390ceb7f639e80111390005e311a1
> Reviewed-on: https://dawn-review.googlesource.com/c/tint/+/60100
> Kokoro: Kokoro <noreply+kokoro@google.com>
> Commit-Queue: Antonio Maiorano <amaiorano@google.com>
> Reviewed-by: David Neto <dneto@google.com>

TBR=dneto@google.com,bclayton@google.com,jrprice@google.com,amaiorano@google.com,noreply+kokoro@google.com,tint-scoped@luci-project-accounts.iam.gserviceaccount.com

Change-Id: I3e3384a9185013bb141a1b7b9b22bad8571bbc50
No-Presubmit: true
No-Tree-Checks: true
No-Try: true
Bug: tint:124
Reviewed-on: https://dawn-review.googlesource.com/c/tint/+/60345
Reviewed-by: Corentin Wallez <cwallez@chromium.org>
Reviewed-by: Ben Clayton <bclayton@google.com>
Auto-Submit: Corentin Wallez <cwallez@chromium.org>
Commit-Queue: Ben Clayton <bclayton@google.com>
Kokoro: Kokoro <noreply+kokoro@google.com>
This commit is contained in:
Corentin Wallez
2021-07-30 08:22:58 +00:00
committed by Tint LUCI CQ
parent 13969024c9
commit e33b0baa08
651 changed files with 3048 additions and 3963 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
test/vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-nested-if-and-conditional/1.spvasm.expected.msl
View File

@@ -187,55 +187,55 @@ void main_1(constant buf0& x_16, thread tint_array_wrapper* const tint_symbol_6,
BST const x_93 = param_4;
(*(tint_symbol_6)).arr[0] = x_93;
int const x_95 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_95) + as_type<uint>(1)));
treeIndex_1 = (x_95 + 1);
int const x_97 = treeIndex_1;
param_6 = x_97;
param_7 = 5;
insert_i1_i1_(x_16, &(param_6), &(param_7), tint_symbol_6);
int const x_99 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_99) + as_type<uint>(1)));
treeIndex_1 = (x_99 + 1);
int const x_101 = treeIndex_1;
param_8 = x_101;
param_9 = 12;
insert_i1_i1_(x_16, &(param_8), &(param_9), tint_symbol_6);
int const x_103 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_103) + as_type<uint>(1)));
treeIndex_1 = (x_103 + 1);
int const x_105 = treeIndex_1;
param_10 = x_105;
param_11 = 15;
insert_i1_i1_(x_16, &(param_10), &(param_11), tint_symbol_6);
int const x_107 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_107) + as_type<uint>(1)));
treeIndex_1 = (x_107 + 1);
int const x_109 = treeIndex_1;
param_12 = x_109;
param_13 = 7;
insert_i1_i1_(x_16, &(param_12), &(param_13), tint_symbol_6);
int const x_111 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_111) + as_type<uint>(1)));
treeIndex_1 = (x_111 + 1);
int const x_113 = treeIndex_1;
param_14 = x_113;
param_15 = 8;
insert_i1_i1_(x_16, &(param_14), &(param_15), tint_symbol_6);
int const x_115 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_115) + as_type<uint>(1)));
treeIndex_1 = (x_115 + 1);
int const x_117 = treeIndex_1;
param_16 = x_117;
param_17 = 2;
insert_i1_i1_(x_16, &(param_16), &(param_17), tint_symbol_6);
int const x_119 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_119) + as_type<uint>(1)));
treeIndex_1 = (x_119 + 1);
int const x_121 = treeIndex_1;
param_18 = x_121;
param_19 = 6;
insert_i1_i1_(x_16, &(param_18), &(param_19), tint_symbol_6);
int const x_123 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_123) + as_type<uint>(1)));
treeIndex_1 = (x_123 + 1);
int const x_125 = treeIndex_1;
param_20 = x_125;
param_21 = 17;
insert_i1_i1_(x_16, &(param_20), &(param_21), tint_symbol_6);
int const x_127 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_127) + as_type<uint>(1)));
treeIndex_1 = (x_127 + 1);
int const x_129 = treeIndex_1;
param_22 = x_129;
param_23 = 13;
@@ -268,7 +268,7 @@ void main_1(constant buf0& x_16, thread tint_array_wrapper* const tint_symbol_6,
int const x_151 = i;
if ((x_150 == x_151)) {
int const x_155 = count;
count = as_type<int>((as_type<uint>(x_155) + as_type<uint>(1)));
count = (x_155 + 1);
}
break;
}
@@ -276,14 +276,14 @@ void main_1(constant buf0& x_16, thread tint_array_wrapper* const tint_symbol_6,
int const x_144 = result;
if ((x_144 == -1)) {
int const x_148 = count;
count = as_type<int>((as_type<uint>(x_148) + as_type<uint>(1)));
count = (x_148 + 1);
}
break;
}
}
{
int const x_157 = i;
i = as_type<int>((as_type<uint>(x_157) + as_type<uint>(1)));
i = (x_157 + 1);
}
}
int const x_159 = count;

24
test/vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-nested-if-and-conditional/1.wgsl.expected.msl
View File

@@ -187,55 +187,55 @@ void main_1(constant buf0& x_16, thread tint_array_wrapper* const tint_symbol_6,
BST const x_93 = param_4;
(*(tint_symbol_6)).arr[0] = x_93;
int const x_95 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_95) + as_type<uint>(1)));
treeIndex_1 = (x_95 + 1);
int const x_97 = treeIndex_1;
param_6 = x_97;
param_7 = 5;
insert_i1_i1_(x_16, &(param_6), &(param_7), tint_symbol_6);
int const x_99 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_99) + as_type<uint>(1)));
treeIndex_1 = (x_99 + 1);
int const x_101 = treeIndex_1;
param_8 = x_101;
param_9 = 12;
insert_i1_i1_(x_16, &(param_8), &(param_9), tint_symbol_6);
int const x_103 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_103) + as_type<uint>(1)));
treeIndex_1 = (x_103 + 1);
int const x_105 = treeIndex_1;
param_10 = x_105;
param_11 = 15;
insert_i1_i1_(x_16, &(param_10), &(param_11), tint_symbol_6);
int const x_107 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_107) + as_type<uint>(1)));
treeIndex_1 = (x_107 + 1);
int const x_109 = treeIndex_1;
param_12 = x_109;
param_13 = 7;
insert_i1_i1_(x_16, &(param_12), &(param_13), tint_symbol_6);
int const x_111 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_111) + as_type<uint>(1)));
treeIndex_1 = (x_111 + 1);
int const x_113 = treeIndex_1;
param_14 = x_113;
param_15 = 8;
insert_i1_i1_(x_16, &(param_14), &(param_15), tint_symbol_6);
int const x_115 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_115) + as_type<uint>(1)));
treeIndex_1 = (x_115 + 1);
int const x_117 = treeIndex_1;
param_16 = x_117;
param_17 = 2;
insert_i1_i1_(x_16, &(param_16), &(param_17), tint_symbol_6);
int const x_119 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_119) + as_type<uint>(1)));
treeIndex_1 = (x_119 + 1);
int const x_121 = treeIndex_1;
param_18 = x_121;
param_19 = 6;
insert_i1_i1_(x_16, &(param_18), &(param_19), tint_symbol_6);
int const x_123 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_123) + as_type<uint>(1)));
treeIndex_1 = (x_123 + 1);
int const x_125 = treeIndex_1;
param_20 = x_125;
param_21 = 17;
insert_i1_i1_(x_16, &(param_20), &(param_21), tint_symbol_6);
int const x_127 = treeIndex_1;
treeIndex_1 = as_type<int>((as_type<uint>(x_127) + as_type<uint>(1)));
treeIndex_1 = (x_127 + 1);
int const x_129 = treeIndex_1;
param_22 = x_129;
param_23 = 13;
@@ -268,7 +268,7 @@ void main_1(constant buf0& x_16, thread tint_array_wrapper* const tint_symbol_6,
int const x_151 = i;
if ((x_150 == x_151)) {
int const x_155 = count;
count = as_type<int>((as_type<uint>(x_155) + as_type<uint>(1)));
count = (x_155 + 1);
}
break;
}
@@ -276,14 +276,14 @@ void main_1(constant buf0& x_16, thread tint_array_wrapper* const tint_symbol_6,
int const x_144 = result;
if ((x_144 == -1)) {
int const x_148 = count;
count = as_type<int>((as_type<uint>(x_148) + as_type<uint>(1)));
count = (x_148 + 1);
}
break;
}
}
{
int const x_157 = i;
i = as_type<int>((as_type<uint>(x_157) + as_type<uint>(1)));
i = (x_157 + 1);
}
}
int const x_159 = count;