| /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
639 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) {
|
| /external/llvm/include/llvm/CodeGen/ |
| SlotIndexes.h | 656 IndexListEntry *prevEntry, *nextEntry;
659 nextEntry = &getIndexAfter(mi).entry();
660 prevEntry = nextEntry->getPrev();
664 nextEntry = prevEntry->getNext();
669 unsigned dist = ((nextEntry->getIndex() - prevEntry->getIndex())/2) & ~3u;
674 insert(nextEntry, newEntry);
720 IndexListEntry *nextEntry = 0;
723 nextEntry = getTail();
725 nextEntry = &getMBBStartIdx(nextMBB).entry();
728 insert(nextEntry, startEntry)
[all...] |
| /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 | 709 HashtableEntry<K, V> nextEntry;
719 nextEntry = next;
723 return nextEntry != null;
726 HashtableEntry<K, V> nextEntry() {
729 if (nextEntry == null)
732 HashtableEntry<K, V> entryToReturn = nextEntry;
738 nextEntry = next;
743 if (nextEntry == null)
746 HashtableEntry<K, V> entryToReturn = nextEntry;
752 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() {
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | [all...] |
| /external/guava/src/com/google/common/collect/ |
| CustomConcurrentHashMap.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...] |
| /frameworks/base/services/input/ |
| InputDispatcher.cpp | [all...] |
| /dalvik/vm/interp/ |
| Interp.cpp | 930 while (top < self->internalLocalRefTable.nextEntry) {
[all...] |
| /prebuilt/common/tradefed/ |
| tradefed-prebuilt.jar | |
