Searched defs:table (Results 1 - 8 of 8) sorted by relevance
/dalvik/vm/ |
H A D | ReferenceTable.h | 18 * Maintain a table of references. Used for internal local references, 21 * None of the table functions are synchronized. 32 * If "allocEntries" is not equal to "maxEntries", the table may expand when 34 * pointers into "table" rather than offsets, use a fixed-size table. 37 * table/nextEntry is allowed.) 41 Object** table; /* bottom of the list */ member in struct:ReferenceTable 50 * If "initialCount" != "maxCount", the table will expand as required. 52 * Returns "false" if table allocation fails. 61 * You must call dvmInitReferenceTable() before you can re-use this table [all...] |
H A D | IndirectRefTable.h | 20 * Maintain a table of indirect references. Used for local/global JNI 23 * The table contains object references that are part of the GC root set. 30 * operations that allow us to operate on segments of the table, where 34 * a method returns. Additions to the table must be made in the current 40 * The GC must be able to scan the entire table quickly. 49 * - scanning the entire table straight through 51 * If there's more than one segment, we don't guarantee that the table 57 * the table is capped at 64K. 59 * None of the table functions are synchronized. 66 * We need a 16-bit table inde 189 Object** table; /* bottom of the stack */ member in struct:IndirectRefTable [all...] |
/dalvik/dx/src/com/android/dx/dex/file/ |
H A D | CatchStructs.java | 49 * {@code null-ok;} the underlying table; set in 52 private CatchTable table; field in class:CatchStructs 79 this.table = null; 89 if (table == null) { 90 table = code.getCatches(); 101 return table.size(); 123 int size = table.size(); 132 handlerOffsets.put(table.get(i).getHandlers(), null); 202 int tableSize = table.size(); 204 CatchTable.Entry one = table [all...] |
/dalvik/vm/alloc/ |
H A D | HeapTable.c | 53 LargeHeapRefTable *table; local 58 /* Make sure that a table with a free slot is 62 table = *tableP; 68 while (table != NULL && heapRefTableIsFull(&table->refs)) { 69 prevTable = table; 70 table = table->next; 72 if (table != NULL) { 74 /* Move the table t 122 LargeHeapRefTable *table; local 143 dvmHeapFreeLargeTable(LargeHeapRefTable *table) argument 155 LargeHeapRefTable *table; local 186 dvmHeapMarkLargeTableRefs(LargeHeapRefTable *table) argument [all...] |
H A D | Visit.c | 35 * Applies a verification function to all present values in the hash table. 37 static void visitHashTable(Visitor *visitor, HashTable *table, void *arg) argument 42 assert(table != NULL); 43 dvmHashTableLock(table); 44 for (i = 0; i < table->tableSize; ++i) { 45 HashEntry *entry = &table->pEntries[i]; 50 dvmHashTableUnlock(table); 54 * Visits all entries in the reference table. 56 static void visitReferenceTable(Visitor *visitor, const ReferenceTable *table, argument 62 assert(table ! 73 visitLargeHeapRefTable(Visitor *visitor, LargeHeapRefTable *table, void *arg) argument [all...] |
H A D | Copying.c | 38 * are the block space table and the block queue. 40 * The block space table records the state of a block. We must track 1166 /* Create a table that the new pending refs will 1187 gapRef = ref = finRefs->refs.table; 1192 //TODO: add the current table and allocate 1215 //TODO: if the table is empty when we're done, free it. 1222 * Free the empty temporary table. 1242 ref = newPendingRefs.table; 1456 static void pinHashTableEntries(HashTable *table) argument 1462 LOG_PIN(">>> pinHashTableEntries(table 1499 HashTable *table; local 1527 HashTable *table; local 1557 pinReferenceTable(const ReferenceTable *table) argument 1571 scavengeLargeHeapRefTable(LargeHeapRefTable *table) argument [all...] |
/dalvik/vm/analysis/ |
H A D | Optimize.c | 52 * Create a table of inline substitutions. 55 * into a hash table as the list size increases. 61 InlineSub* table; local 69 table = malloc(sizeof(InlineSub) * (count+1)); 108 table[tableIndex].method = method; 109 table[tableIndex].inlineIdx = i; 119 /* mark end of table */ 120 table[tableIndex].method = NULL; 121 LOGV("DexOpt: inline table has %d entries\n", tableIndex); 123 return table; [all...] |
/dalvik/libdex/ |
H A D | DexFile.h | 310 * The "catches" table is used when throwing an exception, 338 * Link table. Currently undefined. 425 * Lookup table for classes. It provides a mapping from class name to 429 * don't need the same hash table in every VM. This is slightly slower than 430 * a hash table with direct pointers to the items, but because it's shared 431 * there's less of a penalty for using a fairly sparse table. 435 int numEntries; // size of table[]; always power of 2 440 } table[1]; member in struct:DexClassLookup 456 u4 depsOffset; /* offset of optimized DEX dependency table */ 560 * Create class lookup table [all...] |
Completed in 87 milliseconds