| /dalvik/dx/src/com/android/dx/merge/ |
| D | SortableType.java | 81 int max; in tryAssignDepth() local
83 max = 0; // this is Object.class or an interface in tryAssignDepth()
91 max = 1; // unknown, so assume it's a root. in tryAssignDepth()
95 max = sortableSupertype.depth; in tryAssignDepth()
102 max = Math.max(max, 1); // unknown, so assume it's a root. in tryAssignDepth()
106 max = Math.max(max, implemented.depth); in tryAssignDepth()
110 depth = max + 1; in tryAssignDepth()
|
| /dalvik/dexgen/src/com/android/dexgen/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/dx/src/com/android/dx/util/ |
| D | IntList.java | 414 int max = sz; in binarysearch() local
416 while (max > (min + 1)) { in binarysearch()
422 int guessIdx = min + ((max - min) >> 1); in binarysearch()
426 max = guessIdx; in binarysearch()
432 if ((max != sz)) { in binarysearch()
433 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()
53 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/dexgen/src/com/android/dexgen/dex/code/ |
| D | LocalSnapshot.java | 81 int max = locals.getMaxSize(); in listingString0() local
86 for (int i = 0; i < max; i++) { in listingString0()
|
| D | DalvInsn.java | 225 return Math.max(sourceRequirement, resultRequirement); in getMinimumRegisterRequirement()
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| D | LocalSnapshot.java | 82 int max = locals.getMaxSize(); in listingString0() local
87 for (int i = 0; i < max; i++) { in listingString0()
|
| D | DalvInsn.java | 236 return Math.max(sourceRequirement, resultRequirement); in getMinimumRegisterRequirement()
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| D | InterferenceGraph.java | 55 ensureCapacity(Math.max(regV, regW) + 1); in add()
|
| D | FirstFitAllocator.java | 122 maxCategory = Math.max(maxCategory, in allocateRegisters()
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| D | RegisterSpecSet.java | 298 int max = set.getMaxSize(); in putAll() local
300 for (int i = 0; i < max; i++) { in putAll()
|
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| D | RegisterSpecSet.java | 299 int max = set.getMaxSize(); in putAll() local
301 for (int i = 0; i < max; i++) { in putAll()
|
| /dalvik/dx/src/com/android/dx/dex/file/ |
| D | UniformListItem.java | 75 return Math.max(HEADER_SIZE, items.get(0).getAlignment()); in getAlignment()
|
| /dalvik/dexgen/src/com/android/dexgen/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 | 267 int sz = Math.max(sz1, sz2); in mergeWithSet()
410 int sz = Math.max(predLabel + 1, szSecondaries); in mergeWithSubroutineCaller()
|
| /dalvik/dx/tests/115-merge/com/android/dx/merge/ |
| D | DexMergeTest.java | 154 maxLength = Math.max(maxLength, merged.getLength()); in testMergedOutputSizeIsBounded()
|
| /dalvik/dx/etc/ |
| D | dx.bat | 71 REM By default, give dx a max heap size of 1 gig and a stack size of 1meg.
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| D | SsaMethod.java | 322 registerCount = Math.max(registerCount, result + category); in borrowSpareRegister()
|