| /dalvik/libdex/ |
| H A D | DexDataMap.h | 28 u4 max; /* maximum number of items that may be held */ member in struct:DexDataMap
|
| 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 | 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;
|
| /dalvik/vm/alloc/ |
| 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 | 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 | MarkSweep.cpp | 918 uintptr_t max[HEAP_SOURCE_MAX_HEAP_COUNT]; local
924 dvmHeapSourceGetRegions(base, max, numHeaps);
936 dvmHeapBitmapSweepWalk(prevLive, prevMark, base[i], max[i],
|
| 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 | 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 | 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/tools/dmtracedump/ |
| H A D | TraceDump.c | 45 /* thread list in key file is not reliable, so just max out */
2641 int max = (d1->numMethods < d2->numMethods) ? d2->numMethods : d1->numMethods; local
2642 max++;
2643 DiffEntry* diffs = (DiffEntry*)malloc(max * sizeof(DiffEntry));
2644 memset(diffs, 0, max * sizeof(DiffEntry));
|
| /dalvik/dx/etc/ |
| H A D | jasmin.jar | META-INF/ META-INF/MANIFEST.MF jas/ jas/AnnotDefAttr.class AnnotDefAttr.java package jas ... |