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

12

/dalvik/dx/src/com/android/dx/merge/
H A DSortableType.java73 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 DDexCatch.cpp54 // 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.cpp51 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/dexgen/src/com/android/dexgen/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/dx/src/com/android/dx/util/
H A DIntList.java414 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 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/dexgen/src/com/android/dexgen/dex/code/
H A DLocalSnapshot.java81 int max = locals.getMaxSize();
86 for (int i = 0; i < max; i++) {
H A DDalvInsn.java225 return Math.max(sourceRequirement, resultRequirement);
/dalvik/dx/src/com/android/dx/dex/code/
H A DLocalSnapshot.java82 int max = locals.getMaxSize();
87 for (int i = 0; i < max; i++) {
H A DDalvInsn.java237 return Math.max(sourceRequirement, resultRequirement);
/dalvik/dx/src/com/android/dx/ssa/back/
H A DInterferenceGraph.java55 ensureCapacity(Math.max(regV, regW) + 1);
H A DFirstFitAllocator.java122 maxCategory = Math.max(maxCategory,
/dalvik/dexgen/src/com/android/dexgen/dex/file/
H A DUniformListItem.java77 return Math.max(HEADER_SIZE, items.get(0).getAlignment());
/dalvik/dx/src/com/android/dx/dex/file/
H A DUniformListItem.java75 return Math.max(HEADER_SIZE, items.get(0).getAlignment());
/dalvik/dexgen/src/com/android/dexgen/rop/code/
H A DRegisterSpecSet.java299 int max = set.getMaxSize();
301 for (int i = 0; i < max; i++) {
/dalvik/dx/src/com/android/dx/rop/code/
H A DRegisterSpecSet.java298 int max = set.getMaxSize();
300 for (int i = 0; i < max; i++) {
/dalvik/dx/src/com/android/dx/cf/code/
H A DLocalsArraySet.java266 int sz = Math.max(sz1, sz2);
409 int sz = Math.max(predLabel + 1, szSecondaries);
/dalvik/dx/etc/
H A Ddx.bat49 REM By default, give dx a max heap size of 1 gig and a stack size of 1meg.
/dalvik/dx/tests/115-merge/com/android/dx/merge/
H A DDexMergeTest.java151 maxLength = Math.max(maxLength, merged.getLength());
/dalvik/dx/src/com/android/dx/ssa/
H A DSsaMethod.java62 /** really one greater than the max label */
322 registerCount = Math.max(registerCount, result + category);
/dalvik/tools/dmtracedump/
H A DTraceDump.c45 /* 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));

Completed in 504 milliseconds

12