luau-lang/luau
1
0
Fork 0
mirror of https://github.com/luau-lang/luau.git synced 2025-04-05 19:30:54 +01:00
Code Issues Projects Releases Packages Wiki Activity

Fix signed/unsigned comparison warnings on GCC.

Browse source
This commit is contained in:
Andy Friesen 2023-01-27 14:04:10 -08:00
parent a17481baca
commit b7af49c8b5
2 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
CodeGen/src/IrLoweringX64.cpp
View file

@ -37,7 +37,7 @@ void IrLoweringX64::lower(AssemblyOptions options)
// While we will need a better block ordering in the future, right now we want to mostly preserve build order with fallbacks outlined
std::vector<uint32_t> sortedBlocks;
sortedBlocks.reserve(function.blocks.size());
for (int i = 0; i < function.blocks.size(); i++)
for (uint32_t i = 0; i < function.blocks.size(); i++)
sortedBlocks.push_back(i);
std::sort(sortedBlocks.begin(), sortedBlocks.end(), [&](uint32_t idxA, uint32_t idxB) {

8
tests/DenseHash.test.cpp
View file

@ -29,9 +29,9 @@ TEST_CASE("overwriting_an_existing_field_when_full_shouldnt_rehash")
for (auto [k, a] : m)
m[k] = a + 1;
for (int i = 0; i < m.size(); ++i)
for (size_t i = 0; i < m.size(); ++i)
{
int* a = m.find(i);
int* a = m.find(int(i));
REQUIRE(a);
CHECK(i + 1 == *a);
}
@ -65,9 +65,9 @@ TEST_CASE("merging_another_map_and_resolve_conflicts_that_also_just_so_happens_t
}
REQUIRE(m1.size() == 24);
for (int i = 0; i < m1.size(); ++i)
for (size_t i = 0; i < m1.size(); ++i)
{
int* a = m1.find(i);
int* a = m1.find(int(i));
REQUIRE(a);
if (i < 8 || i >= 12)
CHECK(i == *a);