Searched refs:base (Results 1 - 25 of 55) sorted by relevance

123

/dalvik/tests/065-mismatched-implements/src/
H A DIndirect.java25 Base base = new Base();
/dalvik/tests/066-mismatched-super/src/
H A DIndirect.java25 Base base = new Base();
/dalvik/vm/alloc/
H A DHeapBitmap.cpp23 * enough to cover a heap at <base> of <maxSize> bytes, where
26 bool dvmHeapBitmapInit(HeapBitmap *hb, const void *base, size_t maxSize, argument
42 hb->base = (uintptr_t)base;
43 hb->max = hb->base - 1;
73 hb->max = hb->base - 1;
86 const uintptr_t offset = (uintptr_t)obj - hb->base;
103 uintptr_t end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base);
108 uintptr_t ptrBase = HB_INDEX_TO_OFFSET(i) + bitmap->base;
137 uintptr_t end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base);
163 dvmHeapBitmapSweepWalk(const HeapBitmap *liveHb, const HeapBitmap *markHb, uintptr_t base, uintptr_t max, BitmapSweepCallback *callback, void *callbackArg) argument
[all...]
H A DHeapBitmapInlines.h30 const uintptr_t offset = (uintptr_t)obj - hb->base;
35 assert((uintptr_t)obj >= hb->base);
98 assert((uintptr_t)obj >= hb->base);
100 const uintptr_t offset = (uintptr_t)obj - hb->base;
H A DHeapBitmap.h25 /* <offset> is the difference from .base to a pointer address.
61 /* The base address, which corresponds to the first bit in
64 uintptr_t base; member in struct:HeapBitmap
68 * to a set bit. If there are no bits set, (max < base).
82 * enough to cover a heap at <base> of <maxSize> bytes, where
85 bool dvmHeapBitmapInit(HeapBitmap *hb, const void *base, size_t maxSize,
126 uintptr_t base, uintptr_t max,
H A DHeapSource.cpp94 char *base; member in struct:Heap
149 * The base address of the virtual memory reservation.
241 if ((const char *)ptr >= heap->base && (const char *)ptr < heap->limit) {
289 static mspace createMspace(void *base, size_t startSize, size_t maximumSize) argument
303 maximumSize, /*locked=*/false, base);
334 hs->heaps[0].base = hs->heapBase;
363 char *base = (char *)ALIGN_UP_TO_PAGE_SIZE(sbrk0); local
364 size_t overhead = base - hs->heaps[0].base;
365 assert(((size_t)hs->heaps[0].base
510 void *base; local
703 dvmHeapSourceGetRegions(uintptr_t *base, uintptr_t *max, size_t numHeaps) argument
[all...]
H A DMarkSweep.h33 const Object **base; member in struct:GcMarkStack
H A DMarkSweep.cpp48 madvise(stack->base, length, MADV_NORMAL);
49 stack->top = stack->base;
60 madvise(stack->base, stack->length, MADV_DONTNEED);
70 assert(stack->base <= stack->top);
83 assert(stack->base < stack->top);
475 assert(ctx->stack.top >= ctx->stack.base);
477 while (stack->top > stack->base) {
500 static Object *nextGrayObject(const u1 *base, const u1 *limit, argument
505 assert(base < limit);
506 assert(limit - base <
918 uintptr_t base[HEAP_SOURCE_MAX_HEAP_COUNT]; local
[all...]
H A DHeapSource.h74 * Returns the base and inclusive max addresses of the heap source
75 * heaps. The base and max values are suitable for passing directly
78 void dvmHeapSourceGetRegions(uintptr_t *base, uintptr_t *max, size_t numHeaps);
/dalvik/vm/mterp/armv5te/
H A DOP_GOTO_32.S21 ldrle rIBASE, [rSELF, #offThread_curHandlerTable] @ refresh handler base
26 ldrle rIBASE, [rSELF, #offThread_curHandlerTable] @ refresh handler base
H A DOP_PACKED_SWITCH.S26 ldrle rIBASE, [rSELF, #offThread_curHandlerTable] @ refresh handler base
31 ldrle rIBASE, [rSELF, #offThread_curHandlerTable] @ refresh handler base
H A Dzcmp.S20 ldrmi rIBASE, [rSELF, #offThread_curHandlerTable] @ refresh table base
24 ldrmi rIBASE, [rSELF, #offThread_curHandlerTable] @ refresh table base
H A DOP_GOTO_16.S13 ldrmi rIBASE, [rSELF, #offThread_curHandlerTable] @ refresh handler base
H A DOP_GOTO.S15 ldrmi rIBASE, [rSELF, #offThread_curHandlerTable] @ refresh handler base
H A DOP_EXECUTE_INLINE_RANGE.S45 4: add ip, r9, #3 @ base+3
47 3: add ip, r9, #2 @ base+2
49 2: add ip, r9, #1 @ base+1
H A DOP_IPUT_OBJECT_QUICK.S13 ldr r2, [rSELF, #offThread_cardTable] @ r2<- card table base
/dalvik/vm/alloc/TEST/HeapBitmapTest/
H A Dmain.c35 assert(hb.base == (uintptr_t)HEAP_BASE);
36 assert(hb.max < hb.base);
55 assert(hb.base == 0);
82 assert(hb->base == (uintptr_t)HEAP_BASE);
83 assert(hb->max < hb->base);
353 uintptr_t base; local
356 base = (uintptr_t)HEAP_BASE + offset;
358 base = (uintptr_t)HEAP_BASE + (uintptr_t)HEAP_SIZE + offset;
360 if (base < (uintptr_t)HEAP_BASE) {
361 base
[all...]
/dalvik/tests/003-omnibus-opcodes/src/
H A DMethodCall.java56 MethodCallBase base = inst;
57 base.tryThing();
/dalvik/tests/072-precise-gc/src/
H A DMain.java61 static String generateString(String base, int num) { argument
62 return base + num;
/dalvik/vm/mterp/x86-atom/
H A DOP_IPUT_OBJECT_QUICK.S40 movl offGlue_cardTable(%ecx), %ecx # get card table base
/dalvik/vm/mterp/x86/
H A Dentry.S28 push %ebp # save caller base pointer
/dalvik/hit/src/com/android/hit/
H A DQueries.java178 private static ArrayList<ClassObj> traverseSubclasses(ClassObj base) { argument
181 for (ClassObj subclass: base.mSubclasses) {
/dalvik/dexgen/src/com/android/dexgen/rop/code/
H A DRegisterSpecList.java328 * base, with the first number duplicated if indicated.
330 * @param base the base register number
334 public RegisterSpecList withSequentialRegisters(int base, argument
347 result.set0(i, one.withReg(base));
351 base += one.getCategory();
/dalvik/dexgen/src/com/android/dexgen/rop/type/
H A DPrototype.java166 Prototype base = intern(descriptor);
169 return base;
176 return base.withFirstParameter(definer);
/dalvik/dx/src/com/android/dx/rop/code/
H A DRegisterSpecList.java363 * the given base, with the first number duplicated if indicated. If
366 * @param base the base register number
373 public RegisterSpecList withExpandedRegisters(int base, argument
390 result.set0(i, one.withReg(base));
392 base += one.getCategory();

Completed in 249 milliseconds

123