Searched refs:length (Results 51 - 75 of 160) sorted by relevance

1234567

/dalvik/dx/junit-tests/com/android/dx/util/
H A DBitsTest.java23 assertEquals(label(0), 0, Bits.makeBitSet(0).length);
26 assertEquals(label(i), 1, Bits.makeBitSet(i).length);
30 assertEquals(label(i), 2, Bits.makeBitSet(i).length);
38 assertEquals(label(i), expect, Bits.makeBitSet(i).length);
63 for (int i = 0; i < bits.length; i++) {
147 for (int i = 0; i < bits.length; i++) {
238 for (int i = 0; i < bits.length; i++) {
249 for (int i = 0; i < bits.length; i++) {
260 for (int i = 0; i < bits.length; i++) {
279 for (int i = 0; i < bits.length;
[all...]
/dalvik/dexgen/src/com/android/dexgen/rop/cst/
H A DStdConstantPool.java52 return entries.length;
107 if (n == (entries.length - 1)) {
/dalvik/dx/src/com/android/dx/command/dump/
H A DClassDumper.java69 if (readBytes != bytes.length) {
70 parsed(ba, readBytes, bytes.length - readBytes, "<extra data at end of file>");
H A DMain.java48 for (/*at*/; at < args.length; at++) {
82 if (at == args.length) {
87 for (/*at*/; at < args.length; at++) {
/dalvik/dx/src/com/android/dx/rop/cst/
H A DStdConstantPool.java53 return entries.length;
121 if (n == (entries.length - 1)) {
/dalvik/dx/tests/093-ssa-invoke-range/
H A DBlort.class ... int f static void testTailParams (int, int) int destPos int length int src int dest void testFlip () int src int dest ...
/dalvik/dx/src/com/android/dx/cf/code/
H A DExecutionStack.java66 ExecutionStack result = new ExecutionStack(stack.length);
68 System.arraycopy(stack, 0, result.stack, 0, stack.length);
69 System.arraycopy(local, 0, result.local, 0, local.length);
121 return stack.length;
167 if ((stackPtr + category) > stack.length) {
H A DBytecodeArray.java83 * @return {@code >= 0;} the length of the bytecode array
90 * Gets the total length of this structure in bytes, when included in
94 * @return {@code >= 4;} the total length, in bytes
133 int length = parseInstruction(at, null);
134 at += length;
215 * @return the length of the instruction, in bytes
825 * @return instruction length, in bytes
856 int length = at - offset;
857 visitor.visitSwitch(ByteOps.LOOKUPSWITCH, offset, length, cases,
860 return length;
1180 visitInvalid(int opcode, int offset, int length) argument
1191 visitNoArgs(int opcode, int offset, int length, Type type) argument
1205 visitLocal(int opcode, int offset, int length, int idx, Type type, int value) argument
1232 visitConstant(int opcode, int offset, int length, Constant cst, int value) argument
1243 visitBranch(int opcode, int offset, int length, int target) argument
1257 visitSwitch(int opcode, int offset, int length, SwitchList cases, int padding) argument
1269 visitNewarray(int offset, int length, CstType type, ArrayList<Constant> initVals) argument
1300 visitInvalid(int opcode, int offset, int length) argument
1306 visitNoArgs(int opcode, int offset, int length, Type type) argument
1313 visitLocal(int opcode, int offset, int length, int idx, Type type, int value) argument
1320 visitConstant(int opcode, int offset, int length, Constant cst, int value) argument
1327 visitBranch(int opcode, int offset, int length, int target) argument
1334 visitSwitch(int opcode, int offset, int length, SwitchList cases, int padding) argument
1341 visitNewarray(int offset, int length, CstType type, ArrayList<Constant> initValues) argument
1365 int length; field in class:BytecodeArray.ConstantParserVisitor
1378 visitInvalid(int opcode, int offset, int length) argument
1384 visitNoArgs(int opcode, int offset, int length, Type type) argument
1391 visitLocal(int opcode, int offset, int length, int idx, Type type, int value) argument
1398 visitConstant(int opcode, int offset, int length, Constant cst, int value) argument
1407 visitBranch(int opcode, int offset, int length, int target) argument
1414 visitSwitch(int opcode, int offset, int length, SwitchList cases, int padding) argument
1421 visitNewarray(int offset, int length, CstType type, ArrayList<Constant> initVals) argument
[all...]
/dalvik/dx/src/com/android/dx/merge/
H A DDexMerger.java104 indexMaps = new IndexMap[dexes.length];
105 for (int i = 0; i < dexes.length; i++) {
190 if (dexes.length == 1) {
192 } else if (dexes.length == 0) {
217 for (int i = 0; i < dexes.length; i++) {
247 TableOfContents.Section[] sections = new TableOfContents.Section[dexes.length];
248 Dex.Section[] dexSections = new Dex.Section[dexes.length];
249 int[] offsets = new int[dexes.length];
250 int[] indexes = new int[dexes.length];
257 for (int i = 0; i < dexes.length;
[all...]
/dalvik/dexgen/src/com/android/dexgen/util/
H A DFixedSizeList.java124 return arr.length;
133 int sz = arr.length;
250 int len = arr.length;
/dalvik/dx/src/com/android/dx/command/annotool/
H A DMain.java63 for (int i = 0; i < argArray.length; i++) {
95 files = new String[argArray.length - i];
96 System.arraycopy(argArray, i, files, 0, files.length);
/dalvik/dx/src/com/android/dx/util/
H A DFixedSizeList.java125 return arr.length;
134 int sz = arr.length;
251 int len = arr.length;
/dalvik/libdex/
H A DCmdUtils.cpp197 sysChangeMapAccess(pMap->addr, pMap->length, true, pMap);
199 if (dexSwapAndVerifyIfNecessary((u1*) pMap->addr, pMap->length)) {
210 sysChangeMapAccess(pMap->addr, pMap->length, false, pMap);
213 * Success! Close the file and return with the start/length in pMap.
H A DDexFile.cpp122 static void dexComputeSHA1Digest(const unsigned char* data, size_t length, argument
127 SHA1Update(&context, data, length);
286 DexFile* dexFileParse(const u1* data, size_t length, int flags) argument
293 if (length < sizeof(DexHeader)) {
319 if (!dexParseOptData(data, length, pDexFile))
324 length -= pDexFile->pOptHeader->dexOffset;
325 if (pDexFile->pOptHeader->dexLength > length) {
327 pDexFile->pOptHeader->dexLength, (int) length);
330 length = pDexFile->pOptHeader->dexLength;
381 dexComputeSHA1Digest(data + nonSum, length
[all...]
H A DDexOptData.cpp49 bool dexParseOptData(const u1* data, size_t length, DexFile* pDexFile) argument
52 const void* pOptEnd = data + length;
68 /* Make sure that the opt data length is a whole number of words. */
/dalvik/dexgen/src/com/android/dexgen/dex/code/
H A DSwitchData.java78 if (sz != targets.length) {
104 int sz = targets.length;
165 int sz = targets.length;
181 int sz = targets.length;
/dalvik/dx/src/com/android/dx/dex/code/
H A DSwitchData.java79 if (sz != targets.length) {
105 int sz = targets.length;
166 int sz = targets.length;
182 int sz = targets.length;
/dalvik/dx/src/com/android/dx/io/instructions/
H A DShortArrayCodeInput.java43 return cursor() < array.length;
/dalvik/dx/tests/140-ssa-phi-overlap/
H A DTest.java98 for (int i0 = mArray.length - 1; i0 >= 0; i0--) {
103 int i2 = -1; while (++i2 < mArray.length) {
119 mArray[i0][i1][mArray.length - 1][i0][i1][1][i1] *= ((! mZ) ? -1041059197.0f : (mF / -1370212878.0f));
150 switch (mArray.length - 1) {
/dalvik/tools/dexdeps/src/com/android/dexdeps/
H A DMethodRef.java78 for (int i = 0; i < protos.length; i++) {
H A DDexData.java295 for (int i = mClassDefs.length -1; i >= 0; i--) {
299 for (int i = 0; i < mTypeIds.length; i++) {
302 if (className.length() == 1) {
335 String[] result = new String[protoId.types.length];
337 for (int i = 0; i < protoId.types.length; i++) {
361 ClassRef[] sparseRefs = new ClassRef[mTypeIds.length];
365 for (int i = 0; i < mTypeIds.length; i++) {
380 for (int i = 0; i < mTypeIds.length; i++) {
395 for (int i = 0; i < mFieldIds.length; i++) {
412 for (int i = 0; i < mMethodIds.length;
[all...]
/dalvik/dx/src/com/android/dx/command/
H A DMain.java85 for (int i = 0; i < args.length; i++) {
172 int len = orig.length - 1;
/dalvik/dx/src/com/android/dex/
H A DDex.java144 private static void checkBounds(int index, int length) { argument
145 if (index < 0 || index >= length) {
146 throw new IndexOutOfBoundsException("index:" + index + ", length=" + length);
155 int count = Math.min(buffer.length, data.remaining());
174 + " length=" + data.capacity());
284 int count = Math.min(buffer.length, data.remaining());
301 int count = Math.min(buffer.length, data.remaining());
360 public byte[] readByteArray(int length) { argument
361 byte[] result = new byte[length];
366 readShortArray(int length) argument
[all...]
/dalvik/dx/src/com/android/multidex/
H A DClassReferenceListBuilder.java72 classNames.add(name.substring(0, name.length() - CLASS_EXTENSION.length()));
134 addClassWithHierachy(typeDescriptor.substring(1, typeDescriptor.length()-1));
136 assert typeDescriptor.length() > lastBrace + 3
139 typeDescriptor.length() - 1));
/dalvik/dexgen/src/com/android/dexgen/rop/type/
H A DType.java356 int length = descriptor.length();
358 (descriptor.charAt(length - 1) != ';')) {
371 int limit = (length - 1); // Skip the final ';'.
384 (i == (length - 1)) ||
660 className = descriptor.substring(1, descriptor.length() - 1);

Completed in 435 milliseconds

1234567