Searched refs:max (Results 1 - 25 of 31) sorted by relevance

12

/dalvik/libdex/
H A DDexCatch.c54 // 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 DDexDataMap.c51 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 DDexDataMap.h28 u4 max; /* maximum number of items that may be held */ member in struct:DexDataMap
/dalvik/vm/alloc/
H A DFloat12.h93 fprintf(stderr, "usage: %s <min> <max>\n", argv[0]);
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) {
H A DHeapBitmap.c45 hb->max = hb->base - 1;
77 hb->max = hb->base - 1;
86 * The callback is permitted to increase the bitmap's max; the walk
87 * will use the updated max as a terminating condition,
111 /*TODO: hold onto ptrBase so we can shrink max later if possible */ \
123 /* The callback may have caused hb_->max to grow. */ \
124 index = HB_OFFSET_TO_INDEX(hb_->max - hb_->base); \
146 if (liveHb->max < liveHb->base && markHb->max < markHb->base) {
154 if (liveHb->max >
[all...]
H A DHeapInternal.h159 #define FRACTIONAL_PCT(n,max) ((n) * 100) / (max), \
160 (((n) * 1000) / (max)) % 10
H A DHeapBitmap.h78 * to a set bit. If there are no bits set, (max < base).
80 uintptr_t max; member in struct:__anon48
108 * change the bitmap bits or max during the traversal.
119 uintptr_t end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base);
138 * to change the bitmap bits and max during traversal. Used by the
157 uintptr_t end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base);
171 end = HB_OFFSET_TO_INDEX(bitmap->max - bitmap->base);
181 * The callback is permitted to increase the bitmap's max; the walk
182 * will use the updated max as a terminating condition.
225 if ((uintptr_t)obj > hb->max) {
[all...]
H A DHeapSource.c33 static void setIdealFootprint(size_t max);
82 - keep mspace max footprint clamped to actual footprint
91 - but we need to use the memory, and the current max is the amount we
159 /* The desired max size of the heap source as a whole.
267 //TODO: include size of bitmaps? If so, don't use bitsLen, listen to .max
404 "(%zd overhead, %zd max)\n",
495 LOGE("Bad heap parameters (start=%d, max=%d)\n",
702 uintptr_t base, uintptr_t max) {
706 dst->max = max;
701 aliasBitmap(HeapBitmap *dst, HeapBitmap *src, uintptr_t base, uintptr_t max) argument
729 uintptr_t base, max; local
863 size_t max; local
1184 setIdealFootprint(size_t max) argument
[all...]
/dalvik/dx/src/com/android/dx/util/
H A DIntList.java413 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 DBitIntSet.java32 * @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 DBits.java33 * @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 DMain.java52 long max = delay + epsilon;
57 } else if (elapsed > max) {
59 + "elapsed=" + elapsed + " max=" + max);
/dalvik/dx/src/com/android/dx/dex/code/
H A DLocalSnapshot.java81 int max = locals.getMaxSize();
86 for (int i = 0; i < max; i++) {
/dalvik/vm/mterp/x86-atom/
H A DOP_DOUBLE_TO_INT.S35 fildl .LintMax # push max int value
H A DOP_DOUBLE_TO_LONG.S35 fildll .LvaluePosInfLong # push max int value
H A DOP_FLOAT_TO_INT.S35 fildl .LintMax # push max int value
H A DOP_FLOAT_TO_LONG.S35 fildll .LvaluePosInfLong # push max int value
/dalvik/dx/src/com/android/dx/ssa/back/
H A DInterferenceGraph.java65 ensureCapacity(Math.max(regV, regW) + 1);
H A DFirstFitAllocator.java124 maxCategory = Math.max(maxCategory,
/dalvik/dx/src/com/android/dx/dex/file/
H A DUniformListItem.java77 return Math.max(HEADER_SIZE, items.get(0).getAlignment());
/dalvik/dx/src/com/android/dx/rop/code/
H A DRegisterSpecSet.java299 int max = set.getMaxSize();
301 for (int i = 0; i < max; i++) {
/dalvik/vm/alloc/TEST/HeapBitmapTest/
H A Dmain.c36 assert(hb.max < hb.base);
56 assert(hb.max == 0);
83 assert(hb->max < hb->base);
462 //xxx test where max points to beginning, middle, and end of a word
/dalvik/dx/src/com/android/dx/cf/code/
H A DLocalsArraySet.java268 int sz = Math.max(sz1, sz2);
411 int sz = Math.max(predLabel + 1, szSecondaries);
/dalvik/tests/003-omnibus-opcodes/src/
H A DFloatMath.java295 assert(approxEqual(Math.max(ff, -5.0f), ff, 0.001f));
300 assert(approxEqual(Math.max(dd, -5.0), dd, 0.001));
H A DIntMath.java446 assert(Math.max(ii, -5) == ii);
451 assert(Math.max(ll, -5L) == ll);

Completed in 461 milliseconds

12