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/frontend.h | 1 + 1 file changed, 1 insertion(+) (limited to 'src/compiler/dex/frontend.h') diff --git a/src/compiler/dex/frontend.h b/src/compiler/dex/frontend.h index 49e085270c..dc57a23485 100644 --- a/src/compiler/dex/frontend.h +++ b/src/compiler/dex/frontend.h @@ -71,6 +71,7 @@ enum debugControlVector { kDebugDumpCheckStats, kDebugDumpBitcodeFile, kDebugVerifyBitcode, + kDebugShowSummaryMemoryUsage, }; class LLVMInfo { -- cgit v1.2.3-59-g8ed1b