/dalvik/vm/ |
ReferenceTable.h | 37 * table/nextEntry is allowed.) 40 Object** nextEntry; /* top of the list */ 70 return pRef->nextEntry - pRef->table;
|
ReferenceTable.cpp | 37 pRef->nextEntry = pRef->table; 50 pRef->table = pRef->nextEntry = NULL; 64 if (pRef->nextEntry == pRef->table + pRef->allocEntries) { 66 if (pRef->nextEntry == pRef->table + pRef->maxEntries) { 87 /* update entries; adjust "nextEntry" in case memory moved */ 88 pRef->nextEntry = newTable + (pRef->nextEntry - pRef->table); 93 *pRef->nextEntry++ = obj; 105 ptr = pRef->nextEntry; 139 pRef->nextEntry-- [all...] |
Jni.cpp | 130 frame gets popped, we set "nextEntry" to the "top" pointer of the current 609 while (ppObj < gDvm.jniPinRefTable.nextEntry) { [all...] |
/frameworks/base/tools/aapt/ |
DirectoryWalker.h | 31 virtual struct dirent* nextEntry() = 0; 73 virtual struct dirent* nextEntry() {
|
FileFinder.cpp | 55 while ((entry = dw->nextEntry()) != NULL) {
|
/libcore/luni/src/main/java/java/util/ |
WeakHashMap.java | 118 private Entry<K, V> currentEntry, nextEntry; 130 if (nextEntry != null && (nextKey != null || nextEntry.isNull)) { 134 if (nextEntry == null) { 136 if ((nextEntry = elementData[position++]) != null) { 140 if (nextEntry == null) { 145 nextKey = nextEntry.get(); 146 if (nextKey != null || nextEntry.isNull) { 149 nextEntry = nextEntry.next [all...] |
Hashtable.java | 713 HashtableEntry<K, V> nextEntry; 723 nextEntry = next; 727 return nextEntry != null; 730 HashtableEntry<K, V> nextEntry() { 733 if (nextEntry == null) 736 HashtableEntry<K, V> entryToReturn = nextEntry; 742 nextEntry = next; 747 if (nextEntry == null) 750 HashtableEntry<K, V> entryToReturn = nextEntry; 756 nextEntry = next [all...] |
LinkedHashMap.java | 348 final LinkedEntry<K, V> nextEntry() { 370 public final K next() { return nextEntry().key; } 374 public final V next() { return nextEntry().value; } 379 public final Map.Entry<K, V> next() { return nextEntry(); }
|
HashMap.java | 771 HashMapEntry<K, V> nextEntry = entryForNullKey; 776 if (nextEntry == null) { 782 nextEntry = next; 787 return nextEntry != null; 790 HashMapEntry<K, V> nextEntry() { 793 if (nextEntry == null) 796 HashMapEntry<K, V> entryToReturn = nextEntry; 802 nextEntry = next; 819 public K next() { return nextEntry().key; } 824 public V next() { return nextEntry().value; [all...] |
/frameworks/base/tools/aapt/tests/ |
MockDirectoryWalker.h | 42 virtual struct dirent* nextEntry() {
|
/external/llvm/include/llvm/CodeGen/ |
SlotIndexes.h | 606 IndexListEntry *nextEntry = 0; 609 nextEntry = indexList.end(); 611 nextEntry = getMBBStartIdx(nextMBB).listEntry(); 614 indexList.insert(nextEntry, startEntry); 615 indexList.insert(nextEntry, stopEntry); 618 SlotIndex endIdx(nextEntry, SlotIndex::Slot_Block);
|
/external/antlr/antlr-3.4/runtime/C/src/ |
antlr3collections.c | 201 pANTLR3_HASH_ENTRY nextEntry; 225 nextEntry = entry->nextEntry; 246 entry = nextEntry; /* Load next pointer to see if we shoud free it */ 308 (*nextPointer) = entry->nextEntry; 319 nextPointer = & (entry->nextEntry); /* Address of the next pointer in the current entry */ 320 entry = entry->nextEntry; /* Address of the next element in the bucket (if any) */ 365 (*nextPointer) = entry->nextEntry; 384 nextPointer = & (entry->nextEntry); /* Address of the next pointer in the current entry */ 385 entry = entry->nextEntry; /* Address of the next element in the bucket (if any) * [all...] |
/sdk/lint/libs/lint_checks/src/com/android/tools/lint/checks/ |
ApiLookup.java | 442 int nextEntry = buffer.position(); 450 buffer.putInt(nextEntry); 452 buffer.position(nextEntry); 462 nextEntry = buffer.position(); 479 buffer.putInt(nextEntry); 481 buffer.position(nextEntry); 512 nextEntry = buffer.position(); [all...] |
TypoLookup.java | 382 int nextEntry = buffer.position(); 391 buffer.putInt(nextEntry); 393 buffer.position(nextEntry); 398 nextEntry = buffer.position();
|
/libcore/luni/src/main/java/java/util/concurrent/ |
ConcurrentHashMap.java | [all...] |
/packages/apps/Mms/src/com/android/mms/dom/smil/ |
SmilPlayer.java | 688 TimelineEntry nextEntry = actionNext(); 689 if (nextEntry != null) { 690 entry = nextEntry;
|
/dalvik/vm/alloc/ |
Visit.cpp | 59 for (Object **entry = table->table; entry < table->nextEntry; ++entry) {
|
Copying.cpp | [all...] |
/external/antlr/antlr-3.4/runtime/C/include/ |
antlr3collections.h | 83 struct ANTLR3_HASH_ENTRY_struct * nextEntry;
|
/external/guava/guava/src/com/google/common/cache/ |
LocalCache.java | [all...] |
/external/guava/guava/src/com/google/common/collect/ |
MapMakerInternalMap.java | [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
org.eclipse.equinox.p2.core_2.0.2.R36x_v20100804.jar | |
org.eclipse.equinox.p2.metadata.generator_1.0.200.v20100503a.jar | |
/dalvik/vm/interp/ |
Interp.cpp | 930 while (top < self->internalLocalRefTable.nextEntry) { [all...] |
/frameworks/base/services/input/ |
InputDispatcher.cpp | [all...] |