| /dalvik/vm/alloc/ |
| D | HeapBitmap.c | 45 hb->max = hb->base - 1; in dvmHeapBitmapInit()
77 hb->max = hb->base - 1; in dvmHeapBitmapZero()
124 index = HB_OFFSET_TO_INDEX(hb_->max - hb_->base); \ in dvmHeapBitmapSweepWalk()
146 if (liveHb->max < liveHb->base && markHb->max < markHb->base) { in dvmHeapBitmapSweepWalk()
154 if (liveHb->max >= liveHb->base && markHb->max >= markHb->base) { in dvmHeapBitmapSweepWalk()
158 offset = ((liveHb->max < markHb->max) ? liveHb->max : markHb->max) - liveHb->base; in dvmHeapBitmapSweepWalk()
185 longHb = (liveHb->max > markHb->max) ? liveHb : markHb; in dvmHeapBitmapSweepWalk()
187 index = HB_OFFSET_TO_INDEX(longHb->max - longHb->base); in dvmHeapBitmapSweepWalk()
|
| D | Float12.h | 98 unsigned int max = atoi(argv[2]);
99 if (min > max) {
101 max = min;
103 } else if (min == max) {
104 max++;
107 while (min < max) {
|
| D | HeapBitmap.h | 80 uintptr_t max; member
119 uintptr_t end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base); in HB_INLINE_PROTO()
157 uintptr_t end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base); in HB_INLINE_PROTO()
171 end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base); in HB_INLINE_PROTO()
225 if ((uintptr_t)obj > hb->max) { in HB_INLINE_PROTO()
226 hb->max = (uintptr_t)obj; in HB_INLINE_PROTO()
297 if ((uintptr_t)obj <= hb->max) { in HB_INLINE_PROTO()
|
| D | HeapInternal.h | 159 #define FRACTIONAL_PCT(n,max) ((n) * 100) / (max), \ argument
160 (((n) * 1000) / (max)) % 10
|
| D | HeapSource.c | 33 static void setIdealFootprint(size_t max);
702 uintptr_t base, uintptr_t max) { in aliasBitmap() argument
706 dst->max = max; in aliasBitmap()
707 dst->bitsLen = HB_OFFSET_TO_BYTE_INDEX(max - base) + sizeof(dst->bits); in aliasBitmap()
709 assert(base + HB_MAX_OFFSET(dst) > max); in aliasBitmap()
711 assert((base + HB_MAX_OFFSET(dst)) - max <= in aliasBitmap()
729 uintptr_t base, max; in dvmHeapSourceGetObjectBitmaps() local
738 max = MIN((uintptr_t)hs->heaps[i].limit - 1, hs->markBits.max); in dvmHeapSourceGetObjectBitmaps()
739 aliasBitmap(&liveBits[i], &hs->liveBits, base, max); in dvmHeapSourceGetObjectBitmaps()
740 aliasBitmap(&markBits[i], &hs->markBits, base, max); in dvmHeapSourceGetObjectBitmaps()
[all …]
|
| /dalvik/libdex/ |
| D | DexDataMap.c | 51 map->max = maxCount; in dexDataMapAlloc()
76 assert(map->count < map->max); in dexDataMapAdd()
99 int max = map->count - 1; in dexDataMapGet() local
102 while (max >= min) { in dexDataMapGet()
103 int guessIdx = (min + max) >> 1; in dexDataMapGet()
107 max = guessIdx - 1; in dexDataMapGet()
|
| D | DexCatch.c | 56 int max = triesSize - 1; in dexFindCatchHandlerOffset0() local
58 while (max >= min) { in dexFindCatchHandlerOffset0()
59 int guess = (min + max) >> 1; in dexFindCatchHandlerOffset0()
64 max = guess - 1; in dexFindCatchHandlerOffset0()
|
| D | DexDataMap.h | 28 u4 max; /* maximum number of items that may be held */ member
|
| /dalvik/dx/src/com/android/dx/util/ |
| D | IntList.java | 413 int max = sz; in binarysearch() local
415 while (max > (min + 1)) { in binarysearch()
421 int guessIdx = min + ((max - min) >> 1); in binarysearch()
425 max = guessIdx; in binarysearch()
431 if ((max != sz)) { in binarysearch()
432 return (value == values[max]) ? max : (-max - 1); in binarysearch()
|
| D | BitIntSet.java | 34 public BitIntSet(int max) { in BitIntSet() argument
35 bits = Bits.makeBitSet(max); in BitIntSet()
52 Math.max(value + 1, 2 * Bits.getMax(bits))); in ensureCapacity()
|
| D | Bits.java | 36 public static int[] makeBitSet(int max) { in makeBitSet() argument
37 int size = (max + 0x1f) >> 5; in makeBitSet()
|
| /dalvik/tests/053-wait-some/src/ |
| D | Main.java | 52 long max = delay + epsilon; in doit() local
57 } else if (elapsed > max) { in doit()
59 + "elapsed=" + elapsed + " max=" + max); in doit()
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| D | LocalSnapshot.java | 81 int max = locals.getMaxSize(); in listingString0() local
86 for (int i = 0; i < max; i++) { in listingString0()
|
| /dalvik/vm/mterp/x86-atom/ |
| D | OP_DOUBLE_TO_INT.S | 35 fildl .LintMax # push max int value
|
| D | OP_FLOAT_TO_INT.S | 35 fildl .LintMax # push max int value
|
| D | OP_FLOAT_TO_LONG.S | 35 fildll .LvaluePosInfLong # push max int value
|
| D | OP_DOUBLE_TO_LONG.S | 35 fildll .LvaluePosInfLong # push max int value
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| D | InterferenceGraph.java | 65 ensureCapacity(Math.max(regV, regW) + 1); in add()
|
| D | FirstFitAllocator.java | 124 maxCategory = Math.max(maxCategory, in allocateRegisters()
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| D | RegisterSpecSet.java | 299 int max = set.getMaxSize(); in putAll() local
301 for (int i = 0; i < max; i++) { in putAll()
|
| /dalvik/tests/003-omnibus-opcodes/src/ |
| D | FloatMath.java | 295 assert(approxEqual(Math.max(ff, -5.0f), ff, 0.001f)); in jlmTests()
300 assert(approxEqual(Math.max(dd, -5.0), dd, 0.001)); in jlmTests()
|
| D | IntMath.java | 446 assert(Math.max(ii, -5) == ii); in jlmTests()
451 assert(Math.max(ll, -5L) == ll); in jlmTests()
|
| /dalvik/vm/alloc/TEST/HeapBitmapTest/ |
| D | main.c | 36 assert(hb.max < hb.base); in test_init()
56 assert(hb.max == 0); in test_init()
83 assert(hb->max < hb->base); in assert_empty()
|
| /dalvik/dx/src/com/android/dx/dex/file/ |
| D | UniformListItem.java | 77 return Math.max(HEADER_SIZE, items.get(0).getAlignment()); in getAlignment()
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| D | LocalsArraySet.java | 268 int sz = Math.max(sz1, sz2); in mergeWithSet()
411 int sz = Math.max(predLabel + 1, szSecondaries); in mergeWithSubroutineCaller()
|