/dalvik/dx/src/com/android/dx/merge/ |
H A D | SortableType.java | 73 int max; 75 max = 0; // this is Object.class or an interface 79 max = 1; // unknown, so assume it's a root. 83 max = sortableSupertype.depth; 90 max = Math.max(max, 1); // unknown, so assume it's a root. 94 max = Math.max(max, implemente [all...] |
/dalvik/libdex/ |
H A D | DexCatch.cpp | 54 // Note: Signed type is important for max and min. 56 int max = triesSize - 1; local 58 while (max >= min) { 59 int guess = (min + max) >> 1; 64 max = guess - 1;
|
H A D | DexDataMap.cpp | 51 map->max = maxCount; 76 assert(map->count < map->max); 97 // Note: Signed type is important for max and min. 99 int max = map->count - 1; local 102 while (max >= min) { 103 int guessIdx = (min + max) >> 1; 107 max = guessIdx - 1;
|
H A D | DexDataMap.h | 28 u4 max; /* maximum number of items that may be held */ member in struct:DexDataMap
|
/dalvik/vm/alloc/ |
H A D | HeapInternal.h | 94 #define FRACTIONAL_PCT(n,max) ((n) * 100) / (max), \ 95 (((n) * 1000) / (max)) % 10
|
H A D | HeapBitmap.cpp | 43 hb->max = hb->base - 1; 73 hb->max = hb->base - 1; 95 * change the bitmap bits or max during the traversal. 103 uintptr_t end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base); 121 * to change the bitmap bits and max during traversal. Used by the 137 uintptr_t end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base); 151 end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base); 161 * The callback is not permitted to increase the max of either bitmap. 164 uintptr_t base, uintptr_t max, 174 assert(base <= max); 163 dvmHeapBitmapSweepWalk(const HeapBitmap *liveHb, const HeapBitmap *markHb, uintptr_t base, uintptr_t max, BitmapSweepCallback *callback, void *callbackArg) argument [all...] |
H A D | HeapBitmapInlines.h | 38 if ((uintptr_t)obj > hb->max) { 39 hb->max = (uintptr_t)obj; 99 if ((uintptr_t)obj <= hb->max) {
|
H A D | HeapBitmap.h | 68 * to a set bit. If there are no bits set, (max < base). 70 uintptr_t max; member in struct:HeapBitmap 123 * The callback is not permitted to increase the max of either bitmap. 126 uintptr_t base, uintptr_t max,
|
H A D | HeapSource.h | 73 * Returns the base and inclusive max addresses of the heap source 74 * heaps. The base and max values are suitable for passing directly 77 void dvmHeapSourceGetRegions(uintptr_t *base, uintptr_t *max, size_t numHeaps);
|
H A D | HeapSource.cpp | 34 static void setIdealFootprint(size_t max); 126 /* The desired max size of the heap source as a whole. 244 //TODO: include size of bitmaps? If so, don't use bitsLen, listen to .max 447 "(%zd overhead, %zd max)", 604 ALOGE("Bad heap size parameters (start=%zd, max=%zd, limit=%zd)", 831 void dvmHeapSourceGetRegions(uintptr_t *base, uintptr_t *max, size_t numHeaps) argument 840 max[i] = MIN((uintptr_t)hs->heaps[i].limit - 1, hs->markBits.max); 907 /* Make sure max points to the address of the highest set bit. */ 908 if (gHs->markBits.max < (uintptr_ 1001 size_t max = heap->maximumSize; local 1277 setIdealFootprint(size_t max) argument [all...] |
/dalvik/dexgen/src/com/android/dexgen/util/ |
H A D | IntList.java | 413 int max = sz; 415 while (max > (min + 1)) { 417 * The guessIdx calculation is equivalent to ((min + max) 418 * / 2) but won't go wonky when min and max are close to 421 int guessIdx = min + ((max - min) >> 1); 425 max = guessIdx; 431 if ((max != sz)) { 432 return (value == values[max]) ? max : (-max [all...] |
H A D | BitIntSet.java | 32 * @param max the maximum value of ints in this set. 34 public BitIntSet(int max) { argument 35 bits = Bits.makeBitSet(max); 52 Math.max(value + 1, 2 * Bits.getMax(bits)));
|
H A D | Bits.java | 33 * @param max {@code >= 0;} the maximum bit index (exclusive) 36 public static int[] makeBitSet(int max) { argument 37 int size = (max + 0x1f) >> 5;
|
/dalvik/dx/src/com/android/dx/util/ |
H A D | IntList.java | 414 int max = sz; 416 while (max > (min + 1)) { 418 * The guessIdx calculation is equivalent to ((min + max) 419 * / 2) but won't go wonky when min and max are close to 422 int guessIdx = min + ((max - min) >> 1); 426 max = guessIdx; 432 if ((max != sz)) { 433 return (value == values[max]) ? max : (-max [all...] |
H A D | BitIntSet.java | 32 * @param max the maximum value of ints in this set. 34 public BitIntSet(int max) { argument 35 bits = Bits.makeBitSet(max); 52 Math.max(value + 1, 2 * Bits.getMax(bits)));
|
H A D | Bits.java | 33 * @param max {@code >= 0;} the maximum bit index (exclusive) 36 public static int[] makeBitSet(int max) { argument 37 int size = (max + 0x1f) >> 5;
|
/dalvik/tests/053-wait-some/src/ |
H A D | Main.java | 52 long max = delay + epsilon; 57 } else if (elapsed > max) { 59 + "elapsed=" + elapsed + " max=" + max);
|
/dalvik/dexgen/src/com/android/dexgen/dex/code/ |
H A D | LocalSnapshot.java | 81 int max = locals.getMaxSize(); 86 for (int i = 0; i < max; i++) {
|
/dalvik/dx/src/com/android/dx/dex/code/ |
H A D | LocalSnapshot.java | 81 int max = locals.getMaxSize(); 86 for (int i = 0; i < max; i++) {
|
/dalvik/dx/src/com/android/dx/ssa/back/ |
H A D | InterferenceGraph.java | 55 ensureCapacity(Math.max(regV, regW) + 1);
|
H A D | FirstFitAllocator.java | 122 maxCategory = Math.max(maxCategory,
|
/dalvik/dexgen/src/com/android/dexgen/dex/file/ |
H A D | UniformListItem.java | 77 return Math.max(HEADER_SIZE, items.get(0).getAlignment());
|
/dalvik/dx/src/com/android/dx/dex/file/ |
H A D | UniformListItem.java | 75 return Math.max(HEADER_SIZE, items.get(0).getAlignment());
|
/dalvik/dexgen/src/com/android/dexgen/rop/code/ |
H A D | RegisterSpecSet.java | 299 int max = set.getMaxSize(); 301 for (int i = 0; i < max; i++) {
|
/dalvik/dx/src/com/android/dx/rop/code/ |
H A D | RegisterSpecSet.java | 298 int max = set.getMaxSize(); 300 for (int i = 0; i < max; i++) {
|