Searched defs:entry (Results 1 - 25 of 29) sorted by relevance

12

/dalvik/libdex/
H A DCmdUtils.cpp44 ZipEntry entry; local
67 entry = dexZipFindEntry(&archive, kFileToExtract);
68 if (entry == NULL) {
77 if (dexZipExtractEntryToFile(&archive, entry, fd) != 0) {
H A DZipArchive.h33 * One entry in the hash table.
43 * We want "open" and "find entry by name" to be fast operations, and
57 * of the string length into the hash table entry.
118 * Find an entry in the Zip archive, by name. Returns NULL if the entry
130 int dexZipGetEntryInfo(const ZipArchive* pArchive, ZipEntry entry,
138 const ZipEntry entry)
141 dexZipGetEntryInfo(pArchive, entry, NULL, NULL, NULL, &val, NULL, NULL);
145 const ZipEntry entry)
148 dexZipGetEntryInfo(pArchive, entry, NUL
137 dexGetZipEntryOffset(const ZipArchive* pArchive, const ZipEntry entry) argument
144 dexGetZipEntryUncompLen(const ZipArchive* pArchive, const ZipEntry entry) argument
151 dexGetZipEntryModTime(const ZipArchive* pArchive, const ZipEntry entry) argument
158 dexGetZipEntryCrc32(const ZipArchive* pArchive, const ZipEntry entry) argument
[all...]
H A DZipArchive.cpp64 #define kCDECRC 16 // offset to entry CRC
88 static int entryToIndex(const ZipArchive* pArchive, const ZipEntry entry) argument
90 long ent = ((long) entry) - kZipEntryAdj;
94 ALOGW("Zip: invalid ZipEntry %p (%ld)", entry, ent);
114 * Add a new entry to the hash table.
344 * least one unused entry to avoid an infinite loop during creation.
368 ALOGW("Zip: bad LFH offset %ld at entry %d", localHdrOffset, i);
398 ALOGW("Zip: bad CD advance (%d vs %zd) at entry %d",
496 * Find a matching entry.
523 * Find the Nth entry
554 dexZipGetEntryInfo(const ZipArchive* pArchive, ZipEntry entry, int* pMethod, size_t* pUncompLen, size_t* pCompLen, off_t* pOffset, long* pModWhen, long* pCrc32) argument
777 dexZipExtractEntryToFile(const ZipArchive* pArchive, const ZipEntry entry, int fd) argument
[all...]
/dalvik/vm/
H A DIntern.cpp56 void* entry = dvmHashTableLookup(table, key, (void*)value, local
58 return (StringObject*)entry;
66 void* entry = dvmHashTableLookup(table, key, (void*)value, local
68 return (StringObject*)entry;
130 * Find an entry in the interned string table.
133 * the table. Otherwise, the existing entry is returned.
H A DJarFile.cpp94 ZipEntry entry; local
133 entry = dexZipFindEntry(&archive, kDexInJarName);
134 if (entry != NULL) {
147 dexGetZipEntryModTime(&archive, entry),
148 dexGetZipEntryCrc32(&archive, entry),
239 ZipEntry entry; local
246 entry = dexZipFindEntry(&archive, kDexInJarName);
247 if (entry != NULL) {
272 dexGetZipEntryModTime(&archive, entry),
273 dexGetZipEntryCrc32(&archive, entry),
[all...]
/dalvik/dexgen/src/com/android/dexgen/dex/code/
H A DCatchHandlerList.java75 Entry entry = get(i);
86 sb.append(entry.getExceptionType().toHuman());
90 sb.append(Hex.u2or4(entry.getHandler()));
115 * Sets the entry at the given index.
126 * Sets the entry at the given index.
129 * @param entry {@code non-null;} the entry to set at {@code n}
131 public void set(int n, Entry entry) { argument
132 set0(n, entry);
H A DCatchTable.java23 * Table of catch entries. Each entry includes a range of code
54 * Sets the entry at the given index.
57 * @param entry {@code non-null;} the entry to set at {@code n}
59 public void set(int n, Entry entry) { argument
60 set0(n, entry);
H A DPositionList.java136 * Sets the entry at the given index.
139 * @param entry {@code non-null;} the entry to set at {@code n}
141 public void set(int n, Entry entry) { argument
142 set0(n, entry);
149 /** {@code >= 0;} address of this entry */
158 * @param address {@code >= 0;} address of this entry
H A DLocalList.java31 * List of local variables. Each local variable entry indicates a
64 * Sets the entry at the given index.
67 * @param entry {@code non-null;} the entry to set at {@code n}
69 public void set(int n, Entry entry) { argument
70 set0(n, entry);
89 * Disposition of a local entry.
186 * @param other {@code non-null;} entry to compare to
295 * @param other {@code non-null;} another entry
754 Entry entry;
[all...]
/dalvik/dx/src/com/android/dx/dex/code/
H A DCatchHandlerList.java75 Entry entry = get(i);
86 sb.append(entry.getExceptionType().toHuman());
90 sb.append(Hex.u2or4(entry.getHandler()));
115 * Sets the entry at the given index.
126 * Sets the entry at the given index.
129 * @param entry {@code non-null;} the entry to set at {@code n}
131 public void set(int n, Entry entry) { argument
132 set0(n, entry);
H A DCatchTable.java22 * Table of catch entries. Each entry includes a range of code
53 * Sets the entry at the given index.
56 * @param entry {@code non-null;} the entry to set at {@code n}
58 public void set(int n, Entry entry) { argument
59 set0(n, entry);
H A DPositionList.java136 * Sets the entry at the given index.
139 * @param entry {@code non-null;} the entry to set at {@code n}
141 public void set(int n, Entry entry) { argument
142 set0(n, entry);
149 /** {@code >= 0;} address of this entry */
158 * @param address {@code >= 0;} address of this entry
H A DLocalList.java30 * List of local variables. Each local variable entry indicates a
63 * Sets the entry at the given index.
66 * @param entry {@code non-null;} the entry to set at {@code n}
68 public void set(int n, Entry entry) { argument
69 set0(n, entry);
88 * Disposition of a local entry.
185 * @param other {@code non-null;} entry to compare to
294 * @param other {@code non-null;} another entry
753 Entry entry;
[all...]
/dalvik/vm/alloc/
H A DVisit.cpp43 HashEntry *entry = &table->pEntries[i]; local
44 if (entry->data != NULL && entry->data != HASH_TOMBSTONE) {
45 (*visitor)(&entry->data, 0, type, arg);
59 for (Object **entry = table->table; entry < table->nextEntry; ++entry) {
60 assert(entry != NULL);
61 (*visitor)(entry, threadId, type, arg);
H A DMarkSweep.cpp892 Object** entry = *it; local
893 if (!isMarked(*entry, ctx)) {
894 *entry = kClearedJniWeakGlobal;
/dalvik/dexgen/src/com/android/dexgen/dex/file/
H A DDebugInfoEncoder.java256 // Combined advance PC + position entry
286 LocalList.Entry entry = locals.get(curLocalIdx++);
287 int reg = entry.getRegister();
290 if (entry == prevEntry) {
299 // At this point we have a new entry one way or another.
300 lastEntryForReg[reg] = entry;
302 if (entry.isStart()) {
303 if ((prevEntry != null) && entry.matches(prevEntry)) {
316 emitLocalRestart(entry);
318 emitLocalStart(entry);
611 emitLocalRestart(LocalList.Entry entry) argument
682 emitLocalStart(LocalList.Entry entry) argument
716 emitLocalStartExtended(LocalList.Entry entry) argument
745 emitLocalEnd(LocalList.Entry entry) argument
772 emitPosition(PositionList.Entry entry) argument
[all...]
/dalvik/dx/src/com/android/dx/dex/file/
H A DDebugInfoEncoder.java264 // Combined advance PC + position entry
294 LocalList.Entry entry = locals.get(curLocalIdx++);
295 int reg = entry.getRegister();
298 if (entry == prevEntry) {
307 // At this point we have a new entry one way or another.
308 lastEntryForReg[reg] = entry;
310 if (entry.isStart()) {
311 if ((prevEntry != null) && entry.matches(prevEntry)) {
324 emitLocalRestart(entry);
326 emitLocalStart(entry);
619 emitLocalRestart(LocalList.Entry entry) argument
690 emitLocalStart(LocalList.Entry entry) argument
724 emitLocalStartExtended(LocalList.Entry entry) argument
753 emitLocalEnd(LocalList.Entry entry) argument
780 emitPosition(PositionList.Entry entry) argument
[all...]
/dalvik/vm/compiler/
H A DLoop.cpp432 BasicBlock *entry = cUnit->entryBlock; local
457 dvmCompilerAppendMIR(entry, rangeCheckMIR);
472 dvmCompilerAppendMIR(entry, boundCheckMIR);
489 dvmCompilerAppendMIR(entry, boundCheckMIR);
496 dvmCompilerAppendMIR(entry, boundCheckMIR);
504 dvmCompilerAppendMIR(entry, boundCheckMIR);
671 * Main entry point to do loop optimization.
/dalvik/vm/compiler/codegen/x86/
H A DBytecodeVisitor.cpp468 //remove this entry??
538 int entry, tmpValue[2], tmpValue2[2]; local
562 entry = findVirtualRegInTable(vA, LowOpndRegType_gp, true);
564 infoArray[entry].isConst = true;
565 infoArray[entry].value[0] = tmpValue[0];
566 compileTable[entry].refCount--;
590 entry = findVirtualRegInTable(vA, LowOpndRegType_xmm, true);
592 compileTable[entry].refCount--;
736 entry = findVirtualRegInTable(vA, LowOpndRegType_gp, true);
737 infoArray[entry]
[all...]
H A DCodegenInterface.cpp209 static inline int getProfileCount(const JitEntry *entry) argument
211 if (entry->dPC == 0 || entry->codeAddress == 0)
213 u4 *pExecutionCount = (u4 *) getTraceBase(entry);
937 static void setupLoopEntryBlock(CompilationUnit *cUnit, BasicBlock *entry, argument
1079 /* Traces start with a profiling entry point. Generate it here */
/dalvik/vm/native/
H A Ddalvik_system_VMRuntime.cpp299 // Skip uninitialized classes because filled cache entry implies it is initialized.
321 // cache entry implies the class is initialized.
355 // cache entry implies the class is initialized.
466 HashEntry *entry = &gDvm.literalStrings->pEntries[i]; local
467 if (entry->data != NULL && entry->data != HASH_TOMBSTONE) {
468 preloadDexCachesStringsVisitor(&entry->data, 0, ROOT_INTERNED_STRING, &strings);
/dalvik/vm/analysis/
H A DRegisterMap.cpp225 * since we don't count method entry as a GC point.
545 /* rawMap now points to the address field of the next entry */
723 * We want an entry for every class, loaded or not.
923 * Find the appropriate entry. Many maps are very small, some are very
1102 Each entry consists of an address and a bit vector. Adjacent entries are
1109 We therefore cannot omit an entry.
1112 entry in the register map, we must conservatively scan the registers in
1120 Each entry advances the address value by at least 1 (measured in 16-bit
1219 // for each entry
1239 The most common situation is an entry whos
1764 int entry; local
[all...]
/dalvik/vm/compiler/codegen/arm/
H A DAssemble.cpp1207 * | | Trace profile code | <- entry point when profiling
1209 * | | Code body | <- entry point when not profiling
1257 static inline JitTraceCounter_t getProfileCount(const JitEntry *entry) argument
1259 if (entry->dPC == 0 || entry->codeAddress == 0 ||
1260 entry->codeAddress == dvmCompilerGetInterpretTemplate())
1263 JitTraceCounter_t **p = (JitTraceCounter_t **) getTraceBase(entry);
1269 static inline void resetProfileCount(const JitEntry *entry) argument
1271 if (entry->dPC == 0 || entry
2254 const JitEntry *entry = &gDvmJit.pJitEntryTable[traceIdx]; local
[all...]
/dalvik/vm/compiler/codegen/mips/
H A DAssemble.cpp588 * | | Trace profile code | <- entry point when profiling
590 * | | Code body | <- entry point when not profiling
637 static inline JitTraceCounter_t getProfileCount(const JitEntry *entry) argument
639 if (entry->dPC == 0 || entry->codeAddress == 0 ||
640 entry->codeAddress == dvmCompilerGetInterpretTemplate())
643 JitTraceCounter_t **p = (JitTraceCounter_t **) getTraceBase(entry);
649 static inline void resetProfileCount(const JitEntry *entry) argument
651 if (entry->dPC == 0 || entry
1619 const JitEntry *entry = &gDvmJit.pJitEntryTable[traceIdx]; local
[all...]
/dalvik/tools/dmtracedump/
H A DTraceDump.c2365 /* This is a method entry */
2431 /* Remember the time of the last entry or exit event */
2494 MethodEntry* entry = &dataKeys->methods[ii]; local
2495 pMethods[ii] = entry;

Completed in 3890 milliseconds

12