From 1eede6ae9b08d305d0c1123284ff958373916474 Mon Sep 17 00:00:00 2001 From: Nicolas Geoffray Date: Thu, 2 Mar 2017 16:14:53 +0000 Subject: Don't inline methods that throw in graph with irreducible loops. Re-computing the loop information is not supported in graphs with irreducible loops, as it is not deterministic, and the loop header of a loop could change. That would lead to having the suspend check in the wrong block. Test: test-art-host Test: 641-irreducible-inline bug: 35757766 Change-Id: I6a435885461fbeca035e4f5d94f055fc3262adca --- compiler/optimizing/nodes.cc | 3 +++ 1 file changed, 3 insertions(+) (limited to 'compiler/optimizing/nodes.cc') diff --git a/compiler/optimizing/nodes.cc b/compiler/optimizing/nodes.cc index 62c89100eb..020e4463d4 100644 --- a/compiler/optimizing/nodes.cc +++ b/compiler/optimizing/nodes.cc @@ -2179,6 +2179,9 @@ HInstruction* HGraph::InlineInto(HGraph* outer_graph, HInvoke* invoke) { } } if (rerun_loop_analysis) { + DCHECK(!outer_graph->HasIrreducibleLoops()) + << "Recomputing loop information in graphs with irreducible loops " + << "is unsupported, as it could lead to loop header changes"; outer_graph->ClearLoopInformation(); outer_graph->ClearDominanceInformation(); outer_graph->BuildDominatorTree(); -- cgit v1.2.3-59-g8ed1b