From a5abf7091711eed1e9f1d0e1538fe9963ebdf31c Mon Sep 17 00:00:00 2001 From: buzbee Date: Fri, 12 Apr 2013 14:39:29 -0700 Subject: Compiler: replace DOM traversal computation Originally the old trace JIT used a few recursive graph walking algorithms - which was perfectly reasonable given that the graph size was capped at a few dozen nodes at most. These were replaced with iterative walk order computations - or at least I thought they all were. Missed one of them, which caused a stack overflow on a pathologically large method compilation. Renaming of some arena_allocator items for consistency and clarity. More detailed memory usage logging. Reworked the allocator to waste less space when an allocation doesn't fit and a new block must be allocated. Change-Id: I4d84dded3c47819eefa0de90ebb821dd12eb8be8 --- src/compiler/dex/mir_dataflow.cc | 7 ------- 1 file changed, 7 deletions(-) (limited to 'src/compiler/dex/mir_dataflow.cc') diff --git a/src/compiler/dex/mir_dataflow.cc b/src/compiler/dex/mir_dataflow.cc index 444874dce5..9f61d73d6b 100644 --- a/src/compiler/dex/mir_dataflow.cc +++ b/src/compiler/dex/mir_dataflow.cc @@ -1202,13 +1202,6 @@ void MIRGraph::CompilerInitializeSSAConversion() } } -/* Clear the visited flag for each BB */ -bool MIRGraph::ClearVisitedFlag(struct BasicBlock* bb) -{ - bb->visited = false; - return true; -} - /* * This function will make a best guess at whether the invoke will * end up using Method*. It isn't critical to get it exactly right, -- cgit v1.2.3-59-g8ed1b