Index: src/compiler/register-allocator-verifier.cc |
diff --git a/src/compiler/register-allocator-verifier.cc b/src/compiler/register-allocator-verifier.cc |
index c2c55f52d3f97e44f4083337a3b7490b5670f673..5a2ed93827c08a8912a703463ce73fa492d4fc1d 100644 |
--- a/src/compiler/register-allocator-verifier.cc |
+++ b/src/compiler/register-allocator-verifier.cc |
@@ -373,8 +373,9 @@ void RegisterAllocatorVerifier::ValidatePendingAssessment( |
// for the original operand (the one where the assessment was created for |
// first) are also pending. To avoid recursion, we use a work list. To |
// deal with cycles, we keep a set of seen nodes. |
- ZoneQueue<std::pair<const PendingAssessment*, int>> worklist(zone()); |
- ZoneSet<RpoNumber> seen(zone()); |
+ Zone local_zone(zone()->allocator(), ZONE_NAME); |
+ ZoneQueue<std::pair<const PendingAssessment*, int>> worklist(&local_zone); |
+ ZoneSet<RpoNumber> seen(&local_zone); |
worklist.push(std::make_pair(assessment, virtual_register)); |
seen.insert(block_id); |