1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
/*
* Copyright (C) 2009 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "Dalvik.h"
#include "CompilerInternals.h"
static ArenaMemBlock *arenaHead, *currentArena;
static int numArenaBlocks;
/* Allocate the initial memory block for arena-based allocation */
bool dvmCompilerHeapInit(void)
{
assert(arenaHead == NULL);
arenaHead =
(ArenaMemBlock *) malloc(sizeof(ArenaMemBlock) + ARENA_DEFAULT_SIZE);
if (arenaHead == NULL) {
LOGE("No memory left to create compiler heap memory\n");
return false;
}
currentArena = arenaHead;
currentArena->bytesAllocated = 0;
currentArena->next = NULL;
numArenaBlocks = 1;
return true;
}
/* Arena-based malloc for compilation tasks */
void * dvmCompilerNew(size_t size, bool zero)
{
size = (size + 3) & ~3;
retry:
/* Normal case - space is available in the current page */
if (size + currentArena->bytesAllocated <= ARENA_DEFAULT_SIZE) {
void *ptr;
ptr = ¤tArena->ptr[currentArena->bytesAllocated];
currentArena->bytesAllocated += size;
if (zero) {
memset(ptr, 0, size);
}
return ptr;
} else {
/*
* See if there are previously allocated arena blocks before the last
* reset
*/
if (currentArena->next) {
currentArena = currentArena->next;
goto retry;
}
/*
* If we allocate really large variable-sized data structures that
* could go above the limit we need to enhance the allocation
* mechanism.
*/
if (size > ARENA_DEFAULT_SIZE) {
LOGE("Requesting %d bytes which exceed the maximal size allowed\n",
size);
return NULL;
}
/* Time to allocate a new arena */
ArenaMemBlock *newArena = (ArenaMemBlock *)
malloc(sizeof(ArenaMemBlock) + ARENA_DEFAULT_SIZE);
newArena->bytesAllocated = 0;
newArena->next = NULL;
currentArena->next = newArena;
currentArena = newArena;
numArenaBlocks++;
goto retry;
}
return NULL;
}
/* Reclaim all the arena blocks allocated so far */
void dvmCompilerArenaReset(void)
{
ArenaMemBlock *block;
for (block = arenaHead; block; block = block->next) {
block->bytesAllocated = 0;
}
currentArena = arenaHead;
}
/* Growable List initialization */
void dvmInitGrowableList(GrowableList *gList, size_t initLength)
{
gList->numAllocated = initLength;
gList->numUsed = 0;
gList->elemList = (void **) dvmCompilerNew(sizeof(void *) * initLength,
true);
}
/* Expand the capacity of a growable list */
static void expandGrowableList(GrowableList *gList)
{
int newLength = gList->numAllocated;
if (newLength < 128) {
newLength <<= 1;
} else {
newLength += 128;
}
void *newArray = dvmCompilerNew(sizeof(void *) * newLength, true);
memcpy(newArray, gList->elemList, sizeof(void *) * gList->numAllocated);
gList->numAllocated = newLength;
gList->elemList = newArray;
}
/* Insert a new element into the growable list */
void dvmInsertGrowableList(GrowableList *gList, void *elem)
{
if (gList->numUsed == gList->numAllocated) {
expandGrowableList(gList);
}
gList->elemList[gList->numUsed++] = elem;
}
/* Debug Utility - dump a compilation unit */
void dvmCompilerDumpCompilationUnit(CompilationUnit *cUnit)
{
int i;
BasicBlock *bb;
LOGD("%d blocks in total\n", cUnit->numBlocks);
for (i = 0; i < cUnit->numBlocks; i++) {
bb = cUnit->blockList[i];
LOGD("Block %d (insn %04x - %04x%s)\n",
bb->id, bb->startOffset,
bb->lastMIRInsn ? bb->lastMIRInsn->offset : bb->startOffset,
bb->lastMIRInsn ? "" : " empty");
if (bb->taken) {
LOGD(" Taken branch: block %d (%04x)\n",
bb->taken->id, bb->taken->startOffset);
}
if (bb->fallThrough) {
LOGD(" Fallthrough : block %d (%04x)\n",
bb->fallThrough->id, bb->fallThrough->startOffset);
}
}
}
/*
* Dump the current stats of the compiler, including number of bytes used in
* the code cache, arena size, and work queue length, and various JIT stats.
*/
void dvmCompilerDumpStats(void)
{
LOGD("%d compilations using %d bytes",
gDvmJit.numCompilations, gDvmJit.codeCacheByteUsed);
LOGD("Compiler arena uses %d blocks (%d bytes each)",
numArenaBlocks, ARENA_DEFAULT_SIZE);
LOGD("Compiler work queue length is %d/%d", gDvmJit.compilerQueueLength,
gDvmJit.compilerMaxQueued);
dvmJitStats();
dvmCompilerArchDump();
}
|
