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

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

Browse Source 
This reverts commit e33b0baa08.

Added tests/expressions/literals/intmin.wgsl test.

Bug: tint:124
Change-Id: I3d46f939ff20fa377ddb5fcb52f9afe728b8e430
Reviewed-on: https://dawn-review.googlesource.com/c/tint/+/60441
Kokoro: Kokoro <noreply+kokoro@google.com>
Commit-Queue: Antonio Maiorano <amaiorano@google.com>
Reviewed-by: Ben Clayton <bclayton@google.com>
Reviewed-by: David Neto <dneto@google.com>
This commit is contained in:
Antonio Maiorano
2021-07-30 18:59:06 +00:00
committed by Tint LUCI CQ
parent 9bdf2dcc6b
commit d388bc9b36
686 changed files with 4111 additions and 3079 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 = (x_95 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_95) + as_type<uint>(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 = (x_99 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_99) + as_type<uint>(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 = (x_103 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_103) + as_type<uint>(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 = (x_107 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_107) + as_type<uint>(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 = (x_111 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_111) + as_type<uint>(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 = (x_115 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_115) + as_type<uint>(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 = (x_119 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_119) + as_type<uint>(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 = (x_123 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_123) + as_type<uint>(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 = (x_127 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_127) + as_type<uint>(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 = (x_155 + 1);
count = as_type<int>((as_type<uint>(x_155) + as_type<uint>(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 = (x_148 + 1);
count = as_type<int>((as_type<uint>(x_148) + as_type<uint>(1)));
}
break;
}
}
{
int const x_157 = i;
i = (x_157 + 1);
i = as_type<int>((as_type<uint>(x_157) + as_type<uint>(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 = (x_95 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_95) + as_type<uint>(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 = (x_99 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_99) + as_type<uint>(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 = (x_103 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_103) + as_type<uint>(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 = (x_107 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_107) + as_type<uint>(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 = (x_111 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_111) + as_type<uint>(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 = (x_115 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_115) + as_type<uint>(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 = (x_119 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_119) + as_type<uint>(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 = (x_123 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_123) + as_type<uint>(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 = (x_127 + 1);
treeIndex_1 = as_type<int>((as_type<uint>(x_127) + as_type<uint>(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 = (x_155 + 1);
count = as_type<int>((as_type<uint>(x_155) + as_type<uint>(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 = (x_148 + 1);
count = as_type<int>((as_type<uint>(x_148) + as_type<uint>(1)));
}
break;
}
}
{
int const x_157 = i;
i = (x_157 + 1);
i = as_type<int>((as_type<uint>(x_157) + as_type<uint>(1)));
}
}
int const x_159 = count;