/dalvik/dexgen/src/com/android/dexgen/rop/cst/ |
H A D | StdConstantPool.java | 29 /** {@code non-null;} array of entries */ 30 private final Constant[] entries; field in class:StdConstantPool 47 entries = new Constant[size]; 52 return entries.length; 58 return entries[n]; 77 Constant result = entries[n]; 107 if (n == (entries.length - 1)) { 111 entries[n + 1] = null; 114 if ((cst != null) && (entries[n] == null)) { 119 Constant prev = entries[ [all...] |
/dalvik/dx/src/com/android/dx/rop/cst/ |
H A D | StdConstantPool.java | 29 /** {@code non-null;} array of entries */ 30 private final Constant[] entries; field in class:StdConstantPool 47 entries = new Constant[size]; 52 return entries.length; 58 return entries[n]; 77 Constant result = entries[n]; 107 if (n == (entries.length - 1)) { 111 entries[n + 1] = null; 114 if ((cst != null) && (entries[n] == null)) { 119 Constant prev = entries[ [all...] |
/dalvik/vm/compiler/codegen/x86/ |
H A D | NcgHelper.cpp | 29 s4 dvmNcgHandlePackedSwitch(const s4* entries, s4 firstKey, u2 size, s4 testVal) argument 42 s4FromSwitchData(&entries[testVal - firstKey])); 43 return s4FromSwitchData(&entries[testVal - firstKey]); 47 s4 dvmJitHandlePackedSwitch(const s4* entries, s4 firstKey, u2 size, s4 testVal) argument 57 s4FromSwitchData(&entries[testVal - firstKey])); 58 return 2*s4FromSwitchData(&entries[testVal - firstKey]); //convert from u2 to byte 70 const s4* entries = keys + size; local 76 testVal, i, s4FromSwitchData(&entries[i])); 77 return s4FromSwitchData(&entries[i]); 89 const s4* entries local [all...] |
H A D | LowerJump.cpp | 104 It takes argument checkDup, if checkDup is true, an entry is created in globalShortMap, entries in globalShortWorklist are checked, if there exists a match, the immediate in the jump instruction is updated and the entry is removed from globalShortWorklist; 819 //update entries 845 //update entries 1126 s4* entries = NULL; local 1139 s4* entries = (s4*) switchData; local 1140 assert(((u4)entries & 0x3) == 0); 1149 /* "entries" is constant for JIT 1151 move_imm_to_mem(OpndSize_32, (int)entries, 0, PhysicalReg_ESP, true); 1190 s4* entries = NULL; local 1204 s4* entries local [all...] |
/dalvik/vm/ |
H A D | AtomicCache.h | 45 * struct and "entries" separately, avoiding an indirection. (We already 49 AtomicCacheEntry* entries; /* array of entries */ member in struct:AtomicCache 50 int numEntries; /* #of entries, must be power of 2 */ 52 void* entryAlloc; /* memory allocated for entries */ 63 * Do a cache lookup. We need to be able to read and write entries 103 pEntry = (_cache)->entries + hash; \
|
H A D | AtomicCache.cpp | 63 newCache->entries = (AtomicCacheEntry*)
|
/dalvik/vm/interp/ |
H A D | Interp.cpp | 408 * Sometimes the debugger likes to add two entries for one breakpoint. 409 * We add two entries here, so that we get the right behavior when it's 414 * to be the only one adding entries, and the lock ensures that nobody 1006 * ushort size number of entries in the table 1031 /* The entries are guaranteed to be aligned on a 32-bit boundary; 1034 const s4* entries = (const s4*) switchData; local 1035 assert(((u4)entries & 0x3) == 0); 1040 s4FromSwitchData(&entries[index])); 1041 return s4FromSwitchData(&entries[index]); 1055 const s4* entries; local [all...] |
/dalvik/dx/src/com/android/dx/cf/direct/ |
H A D | ClassPathOpener.java | 250 = Collections.list(zip.entries());
|
/dalvik/libdex/ |
H A D | DexFile.h | 26 * obviating the need to copy code and constant pool entries into newly 256 u4 size; /* #of entries in list */ 257 DexMapItem list[1]; /* entries */ 326 u4 size; /* #of entries in list */ 327 DexTypeItem list[1]; /* entries */ 335 * debugging. An offset of zero indicates that there are no entries. 425 u4 entries[1]; /* offset to DexAnnotationItem */ member in struct:DexAnnotationSetItem 943 return pAnnoSet->entries[idx];
|
H A D | DexSwapVerify.cpp | 1393 item = set->entries; 1440 return (void*) (set->entries + count);
|
/dalvik/vm/compiler/codegen/mips/ |
H A D | CodegenDriver.cpp | 2877 const int *entries; local 2885 * ushort size number of entries in the table 2898 /* The entries are guaranteed to be aligned on a 32-bit boundary; 2901 entries = (const int*) &switchData[4]; 2902 assert(((u4)entries & 0x3) == 0); 2913 caseDPCOffset = entries[index]; 2915 caseDPCOffset = (unsigned int)entries[index] >> 16 | entries[index] << 16; 2930 const int *entries; local 2937 * ushort size number of entries i [all...] |
/dalvik/vm/compiler/codegen/arm/ |
H A D | CodegenDriver.cpp | 2791 const int *entries; local 2801 * ushort size number of entries in the table 2814 /* The entries are guaranteed to be aligned on a 32-bit boundary; 2817 entries = (const int*) &switchData[4]; 2818 assert(((u4)entries & 0x3) == 0); 2828 caseDPCOffset = entries[index]; 2843 const int *entries; local 2850 * ushort size number of entries in the table; > 0 2866 /* The entries are guaranteed to be aligned on a 32-bit boundary; 2869 entries [all...] |
/dalvik/dx/etc/ |
H A D | jasmin.jar | ... java.lang.Object {
java.util.Vector entries public void " href="/4.4.4_r1/s? ... |