blob: 240e6575bc2f7bca9f134a7841f366fe13a66124 [file] [log] [blame]
Barry Hayes6e5cf602010-06-22 12:32:59 -07001/*
2 * Copyright (C) 2010 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
Carl Shapiro5ba39372010-08-06 17:07:53 -070017#include <sys/mman.h> /* for PROT_* */
Barry Hayes6e5cf602010-06-22 12:32:59 -070018
19#include "Dalvik.h"
20#include "alloc/HeapSource.h"
21#include "alloc/Visit.h"
22
23/*
24 * Maintain a card table from the the write barrier. All writes of
25 * non-NULL values to heap addresses should go through an entry in
26 * WriteBarrier, and from there to here.
27 *
Barry Hayes8f921a72010-07-09 12:53:49 -070028 * The heap is divided into "cards" of GC_CARD_SIZE bytes, as
29 * determined by GC_CARD_SHIFT. The card table contains one byte of
30 * data per card, to be used by the GC. The value of the byte will be
31 * one of GC_CARD_CLEAN or GC_CARD_DIRTY.
Barry Hayes6e5cf602010-06-22 12:32:59 -070032 *
33 * After any store of a non-NULL object pointer into a heap object,
34 * code is obliged to mark the card dirty. The setters in
35 * ObjectInlines.h [such as dvmSetFieldObject] do this for you. The
36 * JIT and fast interpreters also contain code to mark cards as dirty.
37 *
Barry Hayes6e5cf602010-06-22 12:32:59 -070038 * The card table's base [the "biased card table"] gets set to a
39 * rather strange value. In order to keep the JIT from having to
40 * fabricate or load GC_DIRTY_CARD to store into the card table,
41 * biased base is within the mmap allocation at a point where it's low
42 * byte is equal to GC_DIRTY_CARD. See dvmCardTableStartup for details.
43 */
44
45/*
46 * Initializes the card table; must be called before any other
47 * dvmCardTable*() functions.
48 */
Barry Hayesb874ab92010-07-14 08:13:18 -070049bool dvmCardTableStartup(void)
Barry Hayes6e5cf602010-06-22 12:32:59 -070050{
51 size_t length;
52 void *allocBase;
53 u1 *biasedBase;
Barry Hayesb874ab92010-07-14 08:13:18 -070054 GcHeap *gcHeap = gDvm.gcHeap;
55 void *heapBase = dvmHeapSourceGetBase();
56 assert(gcHeap != NULL);
57 assert(heapBase != NULL);
Barry Hayes6e5cf602010-06-22 12:32:59 -070058
59 /* Set up the card table */
60 length = gDvm.heapSizeMax / GC_CARD_SIZE;
61 /* Allocate an extra 256 bytes to allow fixed low-byte of base */
62 allocBase = dvmAllocRegion(length + 0x100, PROT_READ | PROT_WRITE,
63 "dalvik-card-table");
64 if (allocBase == NULL) {
65 return false;
66 }
67 gcHeap->cardTableBase = allocBase;
68 gcHeap->cardTableLength = length;
69 /* All zeros is the correct initial value; all clean. */
70 assert(GC_CARD_CLEAN == 0);
71
72 biasedBase = (u1 *)((uintptr_t)allocBase -
73 ((uintptr_t)heapBase >> GC_CARD_SHIFT));
74 if (((uintptr_t)biasedBase & 0xff) != GC_CARD_DIRTY) {
Carl Shapiro5d81aa32010-08-20 11:04:25 -070075 int offset = GC_CARD_DIRTY - ((uintptr_t)biasedBase & 0xff);
Barry Hayes6e5cf602010-06-22 12:32:59 -070076 biasedBase += offset + (offset < 0 ? 0x100 : 0);
77 }
78 assert(((uintptr_t)biasedBase & 0xff) == GC_CARD_DIRTY);
Barry Hayes4496ed92010-07-12 09:52:20 -070079 gDvm.biasedCardTableBase = biasedBase;
Barry Hayes6e5cf602010-06-22 12:32:59 -070080
81 return true;
82}
83
84/*
85 * Tears down the entire CardTable.
86 */
87void dvmCardTableShutdown()
88{
Barry Hayesb874ab92010-07-14 08:13:18 -070089 gDvm.biasedCardTableBase = NULL;
Barry Hayes6e5cf602010-06-22 12:32:59 -070090 munmap(gDvm.gcHeap->cardTableBase, gDvm.gcHeap->cardTableLength);
91}
92
Carl Shapiro106c5fd2010-07-28 14:12:27 -070093void dvmClearCardTable(void)
94{
95 assert(gDvm.gcHeap->cardTableBase != NULL);
96 memset(gDvm.gcHeap->cardTableBase, GC_CARD_CLEAN, gDvm.gcHeap->cardTableLength);
97}
98
Barry Hayes6e5cf602010-06-22 12:32:59 -070099/*
Barry Hayes4496ed92010-07-12 09:52:20 -0700100 * Returns true iff the address is within the bounds of the card table.
101 */
102bool dvmIsValidCard(const u1 *cardAddr)
103{
104 GcHeap *h = gDvm.gcHeap;
105 return cardAddr >= h->cardTableBase &&
106 cardAddr < &h->cardTableBase[h->cardTableLength];
107}
108
109/*
Barry Hayes8f921a72010-07-09 12:53:49 -0700110 * Returns the address of the relevent byte in the card table, given
Barry Hayes6e5cf602010-06-22 12:32:59 -0700111 * an address on the heap.
112 */
113u1 *dvmCardFromAddr(const void *addr)
114{
Barry Hayes4496ed92010-07-12 09:52:20 -0700115 u1 *biasedBase = gDvm.biasedCardTableBase;
116 u1 *cardAddr = biasedBase + ((uintptr_t)addr >> GC_CARD_SHIFT);
117 assert(dvmIsValidCard(cardAddr));
Barry Hayes6e5cf602010-06-22 12:32:59 -0700118 return cardAddr;
119}
120
Barry Hayes8f921a72010-07-09 12:53:49 -0700121/*
122 * Returns the first address in the heap which maps to this card.
123 */
124void *dvmAddrFromCard(const u1 *cardAddr)
125{
Barry Hayes4496ed92010-07-12 09:52:20 -0700126 assert(dvmIsValidCard(cardAddr));
127 uintptr_t offset = cardAddr - gDvm.biasedCardTableBase;
Barry Hayes8f921a72010-07-09 12:53:49 -0700128 return (void *)(offset << GC_CARD_SHIFT);
Barry Hayes6e5cf602010-06-22 12:32:59 -0700129}
130
131/*
132 * Dirties the card for the given address.
133 */
134void dvmMarkCard(const void *addr)
135{
136 u1 *cardAddr = dvmCardFromAddr(addr);
137 *cardAddr = GC_CARD_DIRTY;
138}
Carl Shapiro5ba39372010-08-06 17:07:53 -0700139
140/*
Carl Shapiro5ba39372010-08-06 17:07:53 -0700141 * Returns true if the object is on a dirty card.
142 */
143static bool isObjectDirty(const Object *obj)
144{
145 assert(obj != NULL);
146 assert(dvmIsValidObject(obj));
Carl Shapiro71ce7a92010-09-29 01:09:11 -0700147 u1 *card = dvmCardFromAddr(obj);
148 return *card == GC_CARD_DIRTY;
Carl Shapiro5ba39372010-08-06 17:07:53 -0700149}
150
151/*
152 * Context structure for verifying the card table.
153 */
154typedef struct {
155 HeapBitmap *markBits;
156 size_t whiteRefs;
157} WhiteReferenceCounter;
158
159/*
160 * Visitor that counts white referents.
161 */
162static void countWhiteReferenceVisitor(void *addr, void *arg)
163{
164 WhiteReferenceCounter *ctx;
165 Object *obj;
166
167 assert(addr != NULL);
168 assert(arg != NULL);
169 obj = *(Object **)addr;
Carl Shapiro8e14bc72010-10-18 16:27:29 -0700170 if (obj == NULL) {
171 return;
172 }
Carl Shapiro5ba39372010-08-06 17:07:53 -0700173 assert(dvmIsValidObject(obj));
174 ctx = arg;
Carl Shapiro8e14bc72010-10-18 16:27:29 -0700175 if (dvmHeapBitmapIsObjectBitSet(ctx->markBits, obj)) {
Carl Shapiro5ba39372010-08-06 17:07:53 -0700176 return;
177 }
178 ctx->whiteRefs += 1;
179}
180
181/*
Carl Shapiro7f43c032010-10-18 17:26:46 -0700182 * Visitor that logs white references.
183 */
184static void dumpWhiteReferenceVisitor(void *addr, void *arg)
185{
186 WhiteReferenceCounter *ctx;
187 Object *obj;
188
189 assert(addr != NULL);
190 assert(arg != NULL);
191 obj = *(Object **)addr;
192 if (obj == NULL) {
193 return;
194 }
195 assert(dvmIsValidObject(obj));
196 ctx = arg;
197 if (dvmHeapBitmapIsObjectBitSet(ctx->markBits, obj)) {
198 return;
199 }
200 LOGE("object %p is white", obj);
201}
202
203/*
204 * Visitor that signals the caller when a matching reference is found.
205 */
206static void dumpReferencesVisitor(void *pObj, void *arg)
207{
208 Object *obj = *(Object **)pObj;
209 Object *lookingFor = *(Object **)arg;
210 if (lookingFor != NULL && lookingFor == obj) {
211 *(Object **)arg = NULL;
212 }
213}
214
215static void dumpReferencesCallback(void *ptr, void *arg)
216{
217 Object *obj = arg;
218 if (ptr == obj) {
219 return;
220 }
221 dvmVisitObject(dumpReferencesVisitor, ptr, &obj);
222 if (obj == NULL) {
223 LOGD("Found %p in the heap @ %p", arg, ptr);
224 dvmDumpObject(ptr);
225 }
226}
227
228/*
229 * Root visitor that looks for matching references.
230 */
231static void dumpReferencesRootVisitor(void *ptr, void *arg)
232{
233 Object *obj = *(Object **)ptr;
234 Object *lookingFor = *(Object **)arg;
235 if (obj == lookingFor) {
236 LOGD("Found %p in a root @ %p", arg, ptr);
237 }
238}
239
240/*
241 * Invokes visitors to search for references to an object.
242 */
243static void dumpReferences(const Object *obj)
244{
245 HeapBitmap *bitmap = dvmHeapSourceGetLiveBits();
246 void *arg = (void *)obj;
247 dvmVisitRoots(dumpReferencesRootVisitor, arg);
248 dvmHeapBitmapWalk(bitmap, dumpReferencesCallback, arg);
249}
250
251/*
Carl Shapiro5ba39372010-08-06 17:07:53 -0700252 * Returns true if the given object is a reference object and the
253 * just the referent is unmarked.
254 */
255static bool isReferentUnmarked(const Object *obj,
256 const WhiteReferenceCounter* ctx)
257{
258 assert(obj != NULL);
259 assert(obj->clazz != NULL);
260 assert(ctx != NULL);
261 if (ctx->whiteRefs != 1) {
262 return false;
263 } else if (IS_CLASS_FLAG_SET(obj->clazz, CLASS_ISREFERENCE)) {
264 size_t offset = gDvm.offJavaLangRefReference_referent;
265 const Object *referent = dvmGetFieldObject(obj, offset);
266 return !dvmHeapBitmapIsObjectBitSet(ctx->markBits, referent);
267 } else {
268 return false;
269 }
270}
271
272/*
273 * Returns true if the given object is a string and has been interned
274 * by the user.
275 */
276static bool isWeakInternedString(const Object *obj)
277{
278 assert(obj != NULL);
279 if (obj->clazz == gDvm.classJavaLangString) {
280 return dvmIsWeakInternedString((StringObject *)obj);
281 } else {
282 return false;
283 }
284}
285
286/*
Carl Shapiro71ce7a92010-09-29 01:09:11 -0700287 * Returns true if the given object has been pushed on the mark stack
288 * by root marking.
289 */
290static bool isPushedOnMarkStack(const Object *obj)
291{
292 GcMarkContext *ctx = &gDvm.gcHeap->markContext;
293 const Object **ptr;
294
295 for (ptr = ctx->stack.top; ptr != ctx->stack.base; ++ptr) {
296 if (*ptr == obj) {
297 return true;
298 }
299 }
300 return false;
301}
302
303/*
304 * Callback applied to marked objects. If the object is gray and on
305 * an unmarked card an error is logged and the VM is aborted. Card
306 * table verification occurs between root marking and weak reference
307 * processing. We treat objects marked from the roots and weak
308 * references specially as it is permissible for these objects to be
309 * gray and on an unmarked card.
Carl Shapiro5ba39372010-08-06 17:07:53 -0700310 */
Carl Shapiro57ee2702010-08-27 13:06:48 -0700311static void verifyCardTableCallback(void *ptr, void *arg)
Carl Shapiro5ba39372010-08-06 17:07:53 -0700312{
Carl Shapiro57ee2702010-08-27 13:06:48 -0700313 Object *obj = ptr;
314 WhiteReferenceCounter ctx = { arg, 0 };
Carl Shapiro5ba39372010-08-06 17:07:53 -0700315
Carl Shapiro57ee2702010-08-27 13:06:48 -0700316 dvmVisitObject(countWhiteReferenceVisitor, obj, &ctx);
317 if (ctx.whiteRefs == 0) {
318 return;
319 } else if (isObjectDirty(obj)) {
320 return;
321 } else if (isReferentUnmarked(obj, &ctx)) {
322 return;
323 } else if (isWeakInternedString(obj)) {
324 return;
Carl Shapiro71ce7a92010-09-29 01:09:11 -0700325 } else if (isPushedOnMarkStack(obj)) {
326 return;
Carl Shapiro57ee2702010-08-27 13:06:48 -0700327 } else {
Carl Shapiro71ce7a92010-09-29 01:09:11 -0700328 LOGE("Verify failed, object %p is gray and on an unmarked card", obj);
Carl Shapiro5ba39372010-08-06 17:07:53 -0700329 dvmDumpObject(obj);
Carl Shapiro7f43c032010-10-18 17:26:46 -0700330 dvmVisitObject(dumpWhiteReferenceVisitor, obj, &ctx);
331 dumpReferences(obj);
Carl Shapiro5ba39372010-08-06 17:07:53 -0700332 dvmAbort();
333 }
334}
335
336/*
337 * Verifies that gray objects are on a dirty card.
338 */
339void dvmVerifyCardTable(void)
340{
341 HeapBitmap *markBits = gDvm.gcHeap->markContext.bitmap;
342 dvmHeapBitmapWalk(markBits, verifyCardTableCallback, markBits);
343}