Make it possible to pass an arena allocator to HLoopOptimization.
loop_optimization_test uses memory from HLoopOptimization's
allocator, which is scoped by the Run method.
Fix is to pass custom allocator.
test: m test-art-host-gtest
Change-Id: I359330e22202519f400a26da5403eeb00f0b2db4
diff --git a/compiler/optimizing/loop_optimization.cc b/compiler/optimizing/loop_optimization.cc
index 383a027..b12a7f7 100644
--- a/compiler/optimizing/loop_optimization.cc
+++ b/compiler/optimizing/loop_optimization.cc
@@ -126,9 +126,14 @@
HLoopOptimization::HLoopOptimization(HGraph* graph,
HInductionVarAnalysis* induction_analysis)
+ : HLoopOptimization(graph, induction_analysis, nullptr) {}
+
+HLoopOptimization::HLoopOptimization(HGraph* graph,
+ HInductionVarAnalysis* induction_analysis,
+ ArenaAllocator* allocator)
: HOptimization(graph, kLoopOptimizationPassName),
induction_range_(induction_analysis),
- loop_allocator_(nullptr),
+ loop_allocator_(allocator),
top_loop_(nullptr),
last_loop_(nullptr) {
}
@@ -141,7 +146,9 @@
}
ArenaAllocator allocator(graph_->GetArena()->GetArenaPool());
- loop_allocator_ = &allocator;
+ if (loop_allocator_ == nullptr) {
+ loop_allocator_ = &allocator;
+ }
// Build the linear order. This step enables building a loop hierarchy that
// properly reflects the outer-inner and previous-next relation.
@@ -157,7 +164,9 @@
// Traverse the loop hierarchy inner-to-outer and optimize.
TraverseLoopsInnerToOuter(top_loop_);
}
- loop_allocator_ = nullptr;
+ if (loop_allocator_ == &allocator) {
+ loop_allocator_ = nullptr;
+ }
}
void HLoopOptimization::AddLoop(HLoopInformation* loop_info) {