Searched refs:entries (Results 1 - 10 of 10) sorted by relevance

/dalvik/dexgen/src/com/android/dexgen/rop/cst/
H A DStdConstantPool.java29 /** {@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 DStdConstantPool.java29 /** {@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/
H A DAtomicCache.h45 * 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 DAtomicCache.cpp61 newCache->entries = (AtomicCacheEntry*)
/dalvik/vm/interp/
H A DInterp.cpp408 * 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
1022 const s4* entries; local
1027 * ushort size number of entries in the table
1051 /* The entries are guaranteed to be aligned on a 32-bit boundary;
1054 entries = (const s4*) switchData;
1055 assert(((u4)entries & 0x3) == 0);
1060 s4FromSwitchData(&entries[testVal - firstKey]));
1061 return s4FromSwitchData(&entries[testVa
1075 const s4* entries; local
[all...]
/dalvik/dx/src/com/android/dx/cf/direct/
H A DClassPathOpener.java212 = Collections.list(zip.entries());
/dalvik/libdex/
H A DDexFile.h26 * 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
939 return pAnnoSet->entries[idx];
H A DDexSwapVerify.cpp1387 item = set->entries;
1434 return (void*) (set->entries + count);
/dalvik/vm/compiler/codegen/arm/
H A DCodegenDriver.cpp2788 const int *entries; local
2798 * ushort size number of entries in the table
2811 /* The entries are guaranteed to be aligned on a 32-bit boundary;
2814 entries = (const int*) &switchData[4];
2815 assert(((u4)entries & 0x3) == 0);
2825 caseDPCOffset = entries[index];
2840 const int *entries; local
2847 * ushort size number of entries in the table; > 0
2863 /* The entries are guaranteed to be aligned on a 32-bit boundary;
2866 entries
[all...]
/dalvik/dx/etc/
H A Djasmin.jar ... java.lang.Object { java.util.Vector entries public void " href="/4.1.2/s?defs ...

Completed in 307 milliseconds