/dalvik/dexgen/src/com/android/dexgen/rop/code/ |
H A D | ThrowingInsn.java | 45 int sz = catches.size();
|
/dalvik/dx/src/com/android/dx/cf/code/ |
H A D | ByteBlock.java | 73 int sz = successors.size();
|
/dalvik/dx/src/com/android/dx/command/dump/ |
H A D | DotDumper.java | 134 int sz = blocks.size(); 140 if (successors.size() == 0) { 142 } else if (successors.size() == 1) { 147 for (int j = 0; j < successors.size(); j++ ) {
|
/dalvik/dx/src/com/android/dx/dex/code/ |
H A D | LocalSnapshot.java | 80 int sz = locals.size();
|
/dalvik/dx/src/com/android/dx/dex/code/form/ |
H A D | Form10t.java | 62 (insn.getRegisters().size() == 0))) {
|
H A D | Form11x.java | 67 (regs.size() == 1) &&
|
H A D | Form20t.java | 62 (insn.getRegisters().size() == 0))) {
|
/dalvik/dx/src/com/android/dx/dex/file/ |
H A D | StringDataItem.java | 44 * Gets the write size for a given value. 47 * @return {@code >= 2}; the write size, in bytes 78 out.annotate(bytes.size() + 1, value.toQuoted());
|
H A D | UniformItemSection.java | 25 * {@link Item} objects. Each of the items must have the same size in 46 int sz = items.size(); 52 // Since each item has to be the same size, we can pick any. 95 * Since all items must be the same size, we can use the size
|
/dalvik/dx/src/com/android/dx/rop/code/ |
H A D | Rop.java | 113 if ((exceptions.size() != 0) && (branchingness != BRANCH_THROW)) { 265 int sz = sources.size(); 279 sz = exceptions.size(); 400 * {@code getExceptions().size() != 0}. 405 return (exceptions.size() != 0);
|
H A D | ThrowingInsn.java | 45 int sz = catches.size();
|
/dalvik/dx/src/com/android/dx/ssa/ |
H A D | Dominators.java | 74 this.info = new DFSInfo[blocks.size() + 2]; 125 int wsize = worklist.size(); 188 int dfsMax = vertex.size() - 1; 227 int lastItem = wParentBucket.size() - 1;
|
H A D | PhiInsn.java | 213 if (operands.size() == 0) { 218 int szSources = operands.size(); 252 if (operands.size() == 0 ) { 365 int sz = getSources().size();
|
H A D | SsaRenamer.java | 111 startsForBlocks = new RegisterSpec[ssaMeth.getBlocks().size()][]; 182 int sz = ssaRegToRopReg.size(); 213 if (ssaReg < ssaRegToLocalItems.size()) { 230 while (ssaRegToLocalItems.size() <= reg) { 379 int szInsns = insns.size();
|
/dalvik/vm/compiler/ |
H A D | Compiler.h | 52 #define UNPROTECT_CODE_CACHE(addr, size) \ 56 (size) + (((intptr_t) (addr)) & gDvmJit.pageSizeMask), \ 61 #define PROTECT_CODE_CACHE(addr, size) \ 64 (size) + (((intptr_t) (addr)) & gDvmJit.pageSizeMask), \ 133 * flexible array at end, as these will be of variable size. To
|
/dalvik/vm/compiler/codegen/mips/ |
H A D | ArchUtility.cpp | 31 * Interpret a format string and build a string no longer than size 35 unsigned char *baseAddr, int size) 38 char *bufEnd = &buf[size-1]; 325 ALOGD("total size is %d bytes", cUnit->totalSize); 352 void dvmCompilerCacheClear(char *start, size_t size) 355 memset(start, 0x66, size); 34 buildInsnString(const char *fmt, MipsLIR *lir, char* buf, unsigned char *baseAddr, int size) argument
|
/dalvik/vm/interp/ |
H A D | Interp.h | 64 bool dvmAddSingleStep(Thread* thread, int size, int depth);
|
/dalvik/vm/jdwp/ |
H A D | JdwpEvent.h | 72 int size; /* JdwpStepSize */ member in struct:JdwpEventMod::__anon78
|
/dalvik/libdex/ |
H A D | DexFile.h | 248 u4 size; /* count of items of the indicated type */ member in struct:DexMapItem 256 u4 size; /* #of entries in list */ member in struct:DexMapList 326 u4 size; /* #of entries in list */ member in struct:DexTypeList 343 u4 insnsSize; /* size of the insns array, in u2 units */ 416 u4 size; member in struct:DexAnnotationSetRefList 424 u4 size; member in struct:DexAnnotationSetItem 457 int size; // total size, including "size" member in struct:DexClassLookup 458 int numEntries; // size o [all...] |
H A D | DexSwapVerify.cpp | 247 * Calculate the required size (in elements) of the array pointed at by 405 SWAP_FIELD4(pMap->size); 406 count = pMap->size; 413 SWAP_FIELD4(item->size); 425 ALOGE("Map item after end of file: %x, size %#x", 431 u4 icount = item->size; 518 ALOGE("Unable to allocate data map (size %#x)", dataItemCount); 542 sectionOffset + sizeof(u4) + (pMap->size * sizeof(DexMapItem)); 1014 u4 size = interfaces->size; local 1444 verifyFields(const CheckState* state, u4 size, DexField* fields, bool expectStatic) argument 1471 verifyMethods(const CheckState* state, u4 size, DexMethod* methods, bool expectDirect) argument 1670 int size = readAndVerifySignedLeb128(&ptr, fileEnd, &okay); local 2122 readUnsignedLittleEndian(const CheckState* state, const u1** pData, u4 size) argument 2143 u4 size = readAndVerifyUnsignedLeb128(&data, state->fileEnd, &okay); local 2304 u4 size = readAndVerifyUnsignedLeb128(&data, fileEnd, &okay); local [all...] |
H A D | DexProto.cpp | 139 u4 paramCount = (typeList == NULL) ? 0 : typeList->size; 222 return (typeList == NULL) ? 0 : typeList->size; 265 int paramCount1 = (typeList1 == NULL) ? 0 : typeList1->size; 271 int paramCount2 = (typeList2 == NULL) ? 0 : typeList2->size; 489 : pIterator->parameters->size;
|
/dalvik/dexgen/src/com/android/dexgen/util/ |
H A D | ByteArrayAnnotatedOutput.java | 32 /** default size for stretchy instances */ 66 * Constructs an instance with a fixed maximum size. Note that the 264 int blen = bytes.size(); 384 int asz = annotations.size(); 403 int sz = annotations.size(); 458 int asz = annotations.size(); 488 int rightSz = annotations.size(); 541 * @param desiredSize {@code >= 0;} the desired minimum total size of the array
|
/dalvik/vm/alloc/ |
H A D | Copying.cpp | 216 * The starting size of the heap. This value is the same as the 222 * The maximum size of the heap. This value is the same as the 228 * The current, committed size of the heap. At present, this is 467 size_t size = sizeof(heapSource->blockQueue[0]); local 468 heapSource->blockQueue = malloc(heapSource->totalBlocks*size); 470 memset(heapSource->blockQueue, 0xCC, heapSource->totalBlocks*size); 476 size_t size = sizeof(heapSource->blockSpace[0]); local 477 heapSource->blockSpace = calloc(1, heapSource->totalBlocks*size); 632 void *dvmHeapSourceAllocAndGrow(size_t size) argument 634 return dvmHeapSourceAlloc(size); 638 allocateGray(size_t size) argument [all...] |
/dalvik/vm/compiler/codegen/arm/ |
H A D | Assemble.cpp | 44 k3, k3s, k3e, flags, name, fmt, size) \ 46 {k3, k3s, k3e}}, opcode, flags, name, fmt, size} 1169 if (encoder->size == 2) { 1189 /* Reserved for the size field of class pointer pool */ 1226 * | # Class pointer pool size | -> 4 bytes 1228 * | Class pointer pool | -> 4-byte aligned, variable size 1233 * | Literal pool | -> 4-byte aligned, variable size 1283 /* 4 is the size of the profile count */ 1289 /* Get the size of all chaining cells */ 1315 /* Get the size o 1330 matchSignatureBreakpoint(const CompilationUnit *cUnit, unsigned int size) argument 2393 selfVerificationLoad(int addr, int size) argument 2468 selfVerificationStore(int addr, int data, int size) argument 2628 int size = kSVWord; local [all...] |
/dalvik/dexgen/src/com/android/dexgen/dex/file/ |
H A D | DebugInfoEncoder.java | 206 int positionsSz = sortedPositions.size(); 207 int localsSz = locals.size(); 280 int sz = locals.size(); 351 int positionsSz = sortedPositions.size(); 375 if (sortedPositions.size() > 0) { 388 int szParamTypes = paramTypes.size(); 487 int sz = (positions == null) ? 0 : positions.size(); 529 = new ArrayList(desc.getParameterTypes().size()); 532 int sz = locals.size();
|