diff --git a/CodeGen/src/IrLoweringX64.cpp b/CodeGen/src/IrLoweringX64.cpp
index 4e3bb900..fd35b787 100644
--- a/CodeGen/src/IrLoweringX64.cpp
+++ b/CodeGen/src/IrLoweringX64.cpp
@@ -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) {
diff --git a/tests/DenseHash.test.cpp b/tests/DenseHash.test.cpp
index 5bb94a6a..b1c63d2d 100644
--- a/tests/DenseHash.test.cpp
+++ b/tests/DenseHash.test.cpp
@@ -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);