Searched refs:entry (Results 1 - 25 of 111) sorted by relevance

12345

/dalvik/libdex/
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 DCmdUtils.cpp44 ZipEntry entry; local
67 entry = dexZipFindEntry(&archive, kFileToExtract);
68 if (entry == NULL) {
77 if (dexZipExtractEntryToFile(&archive, entry, fd) != 0) {
H A DZipArchive.cpp57 #define kCDECRC 16 // offset to entry CRC
69 * entry indices.
77 static int entryToIndex(const ZipArchive* pArchive, const ZipEntry entry) argument
79 long ent = ((long) entry) - kZipEntryAdj;
83 ALOGW("Zip: invalid ZipEntry %p (%ld)", entry, ent);
103 * Add a new entry to the hash table.
284 * least one unused entry to avoid an infinite loop during creation.
308 ALOGW("Zip: bad LFH offset %ld at entry %d", localHdrOffset, i);
323 ALOGW("Zip: bad CD advance (%d vs %zd) at entry %d",
421 * Find a matching entry
479 dexZipGetEntryInfo(const ZipArchive* pArchive, ZipEntry entry, int* pMethod, size_t* pUncompLen, size_t* pCompLen, off_t* pOffset, long* pModWhen, long* pCrc32) argument
696 dexZipExtractEntryToFile(const ZipArchive* pArchive, const ZipEntry entry, int fd) argument
[all...]
/dalvik/vm/
H A DJarFile.cpp92 ZipEntry entry; local
111 entry = dexZipFindEntry(&archive, kDexInJarName);
112 if (entry != NULL) {
125 dexGetZipEntryModTime(&archive, entry),
126 dexGetZipEntryCrc32(&archive, entry),
235 ZipEntry entry; local
242 entry = dexZipFindEntry(&archive, kDexInJarName);
243 if (entry != NULL) {
268 dexGetZipEntryModTime(&archive, entry),
269 dexGetZipEntryCrc32(&archive, entry),
[all...]
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.
/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...]
H A DCatchStructs.java128 * First add a map entry for each unique list. The tree structure
165 CatchHandlerList.Entry entry = list.get(i);
167 typeIds.indexOf(entry.getExceptionType()));
168 out.writeUnsignedLeb128(entry.getHandler());
249 CatchTable.Entry entry = table.get(i);
250 CatchHandlerList handlers = entry.getHandlers();
251 String s1 = subPrefix + "try " + Hex.u2or4(entry.getStart())
252 + ".." + Hex.u2or4(entry.getEnd());
H A DDebugInfoDecoder.java127 * An entry in the resulting postions table
143 * An entry in the resulting locals table
253 // Start off with implicit 'this' entry
467 for (PositionEntry entry : decodedEntries) {
472 if (entry.line == ple.getPosition().getLine()
473 && entry.address == ple.getAddress()) {
480 throw new RuntimeException ("Could not match position entry: "
481 + entry.address + ", " + entry.line);
501 LocalEntry entry
[all...]
/dalvik/dx/src/com/android/dx/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...]
H A DMemberIdsSection.java74 for (Map.Entry<String, AtomicInteger> entry : membersByPackage.entrySet()) {
75 formatter.format("%n%6d %s", entry.getValue().get(), entry.getKey());
H A DCatchStructs.java126 * First add a map entry for each unique list. The tree structure
163 CatchHandlerList.Entry entry = list.get(i);
165 typeIds.indexOf(entry.getExceptionType()));
166 out.writeUleb128(entry.getHandler());
247 CatchTable.Entry entry = table.get(i);
248 CatchHandlerList handlers = entry.getHandlers();
249 String s1 = subPrefix + "try " + Hex.u2or4(entry.getStart())
250 + ".." + Hex.u2or4(entry.getEnd());
H A DDebugInfoDecoder.java128 * An entry in the resulting postions table
144 * An entry in the resulting locals table
253 // Start off with implicit 'this' entry
461 for (PositionEntry entry : decodedEntries) {
466 if (entry.line == ple.getPosition().getLine()
467 && entry.address == ple.getAddress()) {
474 throw new RuntimeException ("Could not match position entry: "
475 + entry.address + ", " + entry.line);
495 LocalEntry entry
[all...]
/dalvik/tests/063-process-manager/src/
H A DMain.java29 for (Map.Entry<Thread, StackTraceElement[]> entry :
31 Thread t = entry.getKey();
/dalvik/dexgen/src/com/android/dexgen/util/
H A DDexJarMaker.java85 JarEntry entry = new JarEntry(DEX_FILE_NAME_IN_JAR);
86 entry.setTime(source.lastModified());
87 target.putNextEntry(entry);
/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 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...]
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
/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 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...]
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
/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);
/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...]
/dalvik/tools/dexdeps/src/com/android/dexdeps/
H A DMain.java139 ZipEntry entry = zipFile.getEntry(CLASSES_DEX);
140 if (entry == null) {
147 InputStream zis = zipFile.getInputStream(entry);

Completed in 1476 milliseconds

12345