encounter/dawn-cmake
1
0
Fork 0
mirror of https://github.com/encounter/dawn-cmake.git synced 2025-12-17 00:47:13 +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

28
test/vk-gl-cts/graphicsfuzz/spv-stable-mergesort-dead-code/0.spvasm.expected.msl
View File

@@ -24,7 +24,7 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
int const x_252 = *(from);
i = x_252;
int const x_253 = *(mid);
j = (x_253 + 1);
j = as_type<int>((as_type<uint>(x_253) + as_type<uint>(1)));
while (true) {
int const x_259 = i;
int const x_260 = *(mid);
@@ -40,16 +40,16 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
int const x_272 = (*(tint_symbol_5)).arr[x_270];
if ((x_269 < x_272)) {
int const x_277 = k;
k = (x_277 + 1);
k = as_type<int>((as_type<uint>(x_277) + as_type<uint>(1)));
int const x_279 = i;
i = (x_279 + 1);
i = as_type<int>((as_type<uint>(x_279) + as_type<uint>(1)));
int const x_282 = (*(tint_symbol_5)).arr[x_279];
(*(tint_symbol_6)).arr[x_277] = x_282;
} else {
int const x_284 = k;
k = (x_284 + 1);
k = as_type<int>((as_type<uint>(x_284) + as_type<uint>(1)));
int const x_286 = j;
j = (x_286 + 1);
j = as_type<int>((as_type<uint>(x_286) + as_type<uint>(1)));
int const x_289 = (*(tint_symbol_5)).arr[x_286];
(*(tint_symbol_6)).arr[x_284] = x_289;
}
@@ -63,9 +63,9 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
break;
}
int const x_302 = k;
k = (x_302 + 1);
k = as_type<int>((as_type<uint>(x_302) + as_type<uint>(1)));
int const x_304 = i;
i = (x_304 + 1);
i = as_type<int>((as_type<uint>(x_304) + as_type<uint>(1)));
int const x_307 = (*(tint_symbol_5)).arr[x_304];
(*(tint_symbol_6)).arr[x_302] = x_307;
}
@@ -84,7 +84,7 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
(*(tint_symbol_5)).arr[x_318] = x_321;
{
int const x_323 = i_1;
i_1 = (x_323 + 1);
i_1 = as_type<int>((as_type<uint>(x_323) + as_type<uint>(1)));
}
}
return;
@@ -124,11 +124,11 @@ void mergeSort_(thread tint_array_wrapper* const tint_symbol_7, thread tint_arra
from_1 = x_343;
int const x_344 = i_2;
int const x_345 = m;
mid_1 = ((x_344 + x_345) - 1);
mid_1 = as_type<int>((as_type<uint>(as_type<int>((as_type<uint>(x_344) + as_type<uint>(x_345)))) - as_type<uint>(1)));
int const x_348 = i_2;
int const x_349 = m;
int const x_353 = high;
to_1 = min(((x_348 + (2 * x_349)) - 1), x_353);
to_1 = min(as_type<int>((as_type<uint>(as_type<int>((as_type<uint>(x_348) + as_type<uint>(as_type<int>((as_type<uint>(2) * as_type<uint>(x_349))))))) - as_type<uint>(1))), x_353);
int const x_355 = from_1;
param = x_355;
int const x_356 = mid_1;
@@ -139,12 +139,12 @@ void mergeSort_(thread tint_array_wrapper* const tint_symbol_7, thread tint_arra
{
int const x_359 = m;
int const x_361 = i_2;
i_2 = (x_361 + (2 * x_359));
i_2 = as_type<int>((as_type<uint>(x_361) + as_type<uint>(as_type<int>((as_type<uint>(2) * as_type<uint>(x_359))))));
}
}
{
int const x_363 = m;
m = (2 * x_363);
m = as_type<int>((as_type<uint>(2) * as_type<uint>(x_363)));
}
}
return;
@@ -214,7 +214,7 @@ void main_1(constant buf0& x_28, thread tint_array_wrapper* const tint_symbol_9,
}
}
int const x_122 = i_3;
i_3 = (x_122 + 1);
i_3 = as_type<int>((as_type<uint>(x_122) + as_type<uint>(1)));
{
int const x_124 = i_3;
if ((x_124 < 10)) {
@@ -236,7 +236,7 @@ void main_1(constant buf0& x_28, thread tint_array_wrapper* const tint_symbol_9,
(*(tint_symbol_10)).arr[x_133] = x_136;
{
int const x_138 = j_1;
j_1 = (x_138 + 1);
j_1 = as_type<int>((as_type<uint>(x_138) + as_type<uint>(1)));
}
}
mergeSort_(tint_symbol_9, tint_symbol_10);

28
test/vk-gl-cts/graphicsfuzz/spv-stable-mergesort-dead-code/0.wgsl.expected.msl
View File

@@ -24,7 +24,7 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
int const x_252 = *(from);
i = x_252;
int const x_253 = *(mid);
j = (x_253 + 1);
j = as_type<int>((as_type<uint>(x_253) + as_type<uint>(1)));
while (true) {
int const x_259 = i;
int const x_260 = *(mid);
@@ -40,16 +40,16 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
int const x_272 = (*(tint_symbol_5)).arr[x_270];
if ((x_269 < x_272)) {
int const x_277 = k;
k = (x_277 + 1);
k = as_type<int>((as_type<uint>(x_277) + as_type<uint>(1)));
int const x_279 = i;
i = (x_279 + 1);
i = as_type<int>((as_type<uint>(x_279) + as_type<uint>(1)));
int const x_282 = (*(tint_symbol_5)).arr[x_279];
(*(tint_symbol_6)).arr[x_277] = x_282;
} else {
int const x_284 = k;
k = (x_284 + 1);
k = as_type<int>((as_type<uint>(x_284) + as_type<uint>(1)));
int const x_286 = j;
j = (x_286 + 1);
j = as_type<int>((as_type<uint>(x_286) + as_type<uint>(1)));
int const x_289 = (*(tint_symbol_5)).arr[x_286];
(*(tint_symbol_6)).arr[x_284] = x_289;
}
@@ -63,9 +63,9 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
break;
}
int const x_302 = k;
k = (x_302 + 1);
k = as_type<int>((as_type<uint>(x_302) + as_type<uint>(1)));
int const x_304 = i;
i = (x_304 + 1);
i = as_type<int>((as_type<uint>(x_304) + as_type<uint>(1)));
int const x_307 = (*(tint_symbol_5)).arr[x_304];
(*(tint_symbol_6)).arr[x_302] = x_307;
}
@@ -84,7 +84,7 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
(*(tint_symbol_5)).arr[x_318] = x_321;
{
int const x_323 = i_1;
i_1 = (x_323 + 1);
i_1 = as_type<int>((as_type<uint>(x_323) + as_type<uint>(1)));
}
}
return;
@@ -124,11 +124,11 @@ void mergeSort_(thread tint_array_wrapper* const tint_symbol_7, thread tint_arra
from_1 = x_343;
int const x_344 = i_2;
int const x_345 = m;
mid_1 = ((x_344 + x_345) - 1);
mid_1 = as_type<int>((as_type<uint>(as_type<int>((as_type<uint>(x_344) + as_type<uint>(x_345)))) - as_type<uint>(1)));
int const x_348 = i_2;
int const x_349 = m;
int const x_353 = high;
to_1 = min(((x_348 + (2 * x_349)) - 1), x_353);
to_1 = min(as_type<int>((as_type<uint>(as_type<int>((as_type<uint>(x_348) + as_type<uint>(as_type<int>((as_type<uint>(2) * as_type<uint>(x_349))))))) - as_type<uint>(1))), x_353);
int const x_355 = from_1;
param = x_355;
int const x_356 = mid_1;
@@ -139,12 +139,12 @@ void mergeSort_(thread tint_array_wrapper* const tint_symbol_7, thread tint_arra
{
int const x_359 = m;
int const x_361 = i_2;
i_2 = (x_361 + (2 * x_359));
i_2 = as_type<int>((as_type<uint>(x_361) + as_type<uint>(as_type<int>((as_type<uint>(2) * as_type<uint>(x_359))))));
}
}
{
int const x_363 = m;
m = (2 * x_363);
m = as_type<int>((as_type<uint>(2) * as_type<uint>(x_363)));
}
}
return;
@@ -214,7 +214,7 @@ void main_1(constant buf0& x_28, thread tint_array_wrapper* const tint_symbol_9,
}
}
int const x_122 = i_3;
i_3 = (x_122 + 1);
i_3 = as_type<int>((as_type<uint>(x_122) + as_type<uint>(1)));
{
int const x_124 = i_3;
if ((x_124 < 10)) {
@@ -236,7 +236,7 @@ void main_1(constant buf0& x_28, thread tint_array_wrapper* const tint_symbol_9,
(*(tint_symbol_10)).arr[x_133] = x_136;
{
int const x_138 = j_1;
j_1 = (x_138 + 1);
j_1 = as_type<int>((as_type<uint>(x_138) + as_type<uint>(1)));
}
}
mergeSort_(tint_symbol_9, tint_symbol_10);

28
test/vk-gl-cts/graphicsfuzz/spv-stable-mergesort-dead-code/1.spvasm.expected.msl
View File

@@ -24,7 +24,7 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
int const x_263 = *(from);
i = x_263;
int const x_264 = *(mid);
j = (x_264 + 1);
j = as_type<int>((as_type<uint>(x_264) + as_type<uint>(1)));
while (true) {
int const x_270 = i;
int const x_271 = *(mid);
@@ -40,16 +40,16 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
int const x_283 = (*(tint_symbol_5)).arr[x_281];
if ((x_280 < x_283)) {
int const x_288 = k;
k = (x_288 + 1);
k = as_type<int>((as_type<uint>(x_288) + as_type<uint>(1)));
int const x_290 = i;
i = (x_290 + 1);
i = as_type<int>((as_type<uint>(x_290) + as_type<uint>(1)));
int const x_293 = (*(tint_symbol_5)).arr[x_290];
(*(tint_symbol_6)).arr[x_288] = x_293;
} else {
int const x_295 = k;
k = (x_295 + 1);
k = as_type<int>((as_type<uint>(x_295) + as_type<uint>(1)));
int const x_297 = j;
j = (x_297 + 1);
j = as_type<int>((as_type<uint>(x_297) + as_type<uint>(1)));
int const x_300 = (*(tint_symbol_5)).arr[x_297];
(*(tint_symbol_6)).arr[x_295] = x_300;
}
@@ -63,9 +63,9 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
break;
}
int const x_313 = k;
k = (x_313 + 1);
k = as_type<int>((as_type<uint>(x_313) + as_type<uint>(1)));
int const x_315 = i;
i = (x_315 + 1);
i = as_type<int>((as_type<uint>(x_315) + as_type<uint>(1)));
int const x_318 = (*(tint_symbol_5)).arr[x_315];
(*(tint_symbol_6)).arr[x_313] = x_318;
}
@@ -84,7 +84,7 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
(*(tint_symbol_5)).arr[x_329] = x_332;
{
int const x_334 = i_1;
i_1 = (x_334 + 1);
i_1 = as_type<int>((as_type<uint>(x_334) + as_type<uint>(1)));
}
}
return;
@@ -124,11 +124,11 @@ void mergeSort_(thread tint_array_wrapper* const tint_symbol_7, thread tint_arra
from_1 = x_354;
int const x_355 = i_2;
int const x_356 = m;
mid_1 = ((x_355 + x_356) - 1);
mid_1 = as_type<int>((as_type<uint>(as_type<int>((as_type<uint>(x_355) + as_type<uint>(x_356)))) - as_type<uint>(1)));
int const x_359 = i_2;
int const x_360 = m;
int const x_364 = high;
to_1 = min(((x_359 + (2 * x_360)) - 1), x_364);
to_1 = min(as_type<int>((as_type<uint>(as_type<int>((as_type<uint>(x_359) + as_type<uint>(as_type<int>((as_type<uint>(2) * as_type<uint>(x_360))))))) - as_type<uint>(1))), x_364);
int const x_366 = from_1;
param = x_366;
int const x_367 = mid_1;
@@ -139,12 +139,12 @@ void mergeSort_(thread tint_array_wrapper* const tint_symbol_7, thread tint_arra
{
int const x_370 = m;
int const x_372 = i_2;
i_2 = (x_372 + (2 * x_370));
i_2 = as_type<int>((as_type<uint>(x_372) + as_type<uint>(as_type<int>((as_type<uint>(2) * as_type<uint>(x_370))))));
}
}
{
int const x_374 = m;
m = (2 * x_374);
m = as_type<int>((as_type<uint>(2) * as_type<uint>(x_374)));
}
}
return;
@@ -214,7 +214,7 @@ void main_1(constant buf0& x_28, thread tint_array_wrapper* const tint_symbol_9,
}
}
int const x_124 = i_3;
i_3 = (x_124 + 1);
i_3 = as_type<int>((as_type<uint>(x_124) + as_type<uint>(1)));
{
int const x_126 = i_3;
if ((x_126 < 10)) {
@@ -241,7 +241,7 @@ void main_1(constant buf0& x_28, thread tint_array_wrapper* const tint_symbol_9,
(*(tint_symbol_10)).arr[x_140] = x_143;
{
int const x_145 = j_1;
j_1 = (x_145 + 1);
j_1 = as_type<int>((as_type<uint>(x_145) + as_type<uint>(1)));
}
}
mergeSort_(tint_symbol_9, tint_symbol_10);

28
test/vk-gl-cts/graphicsfuzz/spv-stable-mergesort-dead-code/1.wgsl.expected.msl
View File

@@ -24,7 +24,7 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
int const x_263 = *(from);
i = x_263;
int const x_264 = *(mid);
j = (x_264 + 1);
j = as_type<int>((as_type<uint>(x_264) + as_type<uint>(1)));
while (true) {
int const x_270 = i;
int const x_271 = *(mid);
@@ -40,16 +40,16 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
int const x_283 = (*(tint_symbol_5)).arr[x_281];
if ((x_280 < x_283)) {
int const x_288 = k;
k = (x_288 + 1);
k = as_type<int>((as_type<uint>(x_288) + as_type<uint>(1)));
int const x_290 = i;
i = (x_290 + 1);
i = as_type<int>((as_type<uint>(x_290) + as_type<uint>(1)));
int const x_293 = (*(tint_symbol_5)).arr[x_290];
(*(tint_symbol_6)).arr[x_288] = x_293;
} else {
int const x_295 = k;
k = (x_295 + 1);
k = as_type<int>((as_type<uint>(x_295) + as_type<uint>(1)));
int const x_297 = j;
j = (x_297 + 1);
j = as_type<int>((as_type<uint>(x_297) + as_type<uint>(1)));
int const x_300 = (*(tint_symbol_5)).arr[x_297];
(*(tint_symbol_6)).arr[x_295] = x_300;
}
@@ -63,9 +63,9 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
break;
}
int const x_313 = k;
k = (x_313 + 1);
k = as_type<int>((as_type<uint>(x_313) + as_type<uint>(1)));
int const x_315 = i;
i = (x_315 + 1);
i = as_type<int>((as_type<uint>(x_315) + as_type<uint>(1)));
int const x_318 = (*(tint_symbol_5)).arr[x_315];
(*(tint_symbol_6)).arr[x_313] = x_318;
}
@@ -84,7 +84,7 @@ void merge_i1_i1_i1_(thread int* const from, thread int* const mid, thread int*
(*(tint_symbol_5)).arr[x_329] = x_332;
{
int const x_334 = i_1;
i_1 = (x_334 + 1);
i_1 = as_type<int>((as_type<uint>(x_334) + as_type<uint>(1)));
}
}
return;
@@ -124,11 +124,11 @@ void mergeSort_(thread tint_array_wrapper* const tint_symbol_7, thread tint_arra
from_1 = x_354;
int const x_355 = i_2;
int const x_356 = m;
mid_1 = ((x_355 + x_356) - 1);
mid_1 = as_type<int>((as_type<uint>(as_type<int>((as_type<uint>(x_355) + as_type<uint>(x_356)))) - as_type<uint>(1)));
int const x_359 = i_2;
int const x_360 = m;
int const x_364 = high;
to_1 = min(((x_359 + (2 * x_360)) - 1), x_364);
to_1 = min(as_type<int>((as_type<uint>(as_type<int>((as_type<uint>(x_359) + as_type<uint>(as_type<int>((as_type<uint>(2) * as_type<uint>(x_360))))))) - as_type<uint>(1))), x_364);
int const x_366 = from_1;
param = x_366;
int const x_367 = mid_1;
@@ -139,12 +139,12 @@ void mergeSort_(thread tint_array_wrapper* const tint_symbol_7, thread tint_arra
{
int const x_370 = m;
int const x_372 = i_2;
i_2 = (x_372 + (2 * x_370));
i_2 = as_type<int>((as_type<uint>(x_372) + as_type<uint>(as_type<int>((as_type<uint>(2) * as_type<uint>(x_370))))));
}
}
{
int const x_374 = m;
m = (2 * x_374);
m = as_type<int>((as_type<uint>(2) * as_type<uint>(x_374)));
}
}
return;
@@ -214,7 +214,7 @@ void main_1(constant buf0& x_28, thread tint_array_wrapper* const tint_symbol_9,
}
}
int const x_124 = i_3;
i_3 = (x_124 + 1);
i_3 = as_type<int>((as_type<uint>(x_124) + as_type<uint>(1)));
{
int const x_126 = i_3;
if ((x_126 < 10)) {
@@ -241,7 +241,7 @@ void main_1(constant buf0& x_28, thread tint_array_wrapper* const tint_symbol_9,
(*(tint_symbol_10)).arr[x_140] = x_143;
{
int const x_145 = j_1;
j_1 = (x_145 + 1);
j_1 = as_type<int>((as_type<uint>(x_145) + as_type<uint>(1)));
}
}
mergeSort_(tint_symbol_9, tint_symbol_10);