| /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 | 131 frame gets popped, we set "nextEntry" to the "top" pointer of the current
581 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 | 708 HashtableEntry<K, V> nextEntry;
718 nextEntry = next;
722 return nextEntry != null;
725 HashtableEntry<K, V> nextEntry() {
728 if (nextEntry == null)
731 HashtableEntry<K, V> entryToReturn = nextEntry;
737 nextEntry = next;
742 if (nextEntry == null)
745 HashtableEntry<K, V> entryToReturn = nextEntry;
751 nextEntry = next
[all...] |
| LinkedHashMap.java | 345 final LinkedEntry<K, V> nextEntry() {
367 public final K next() { return nextEntry().key; }
371 public final V next() { return nextEntry().value; }
376 public final Map.Entry<K, V> next() { return nextEntry(); }
|
| HashMap.java | 785 HashMapEntry<K, V> nextEntry = entryForNullKey;
790 if (nextEntry == null) {
796 nextEntry = next;
801 return nextEntry != null;
804 HashMapEntry<K, V> nextEntry() {
807 if (nextEntry == null)
810 HashMapEntry<K, V> entryToReturn = nextEntry;
816 nextEntry = next;
833 public K next() { return nextEntry().key; }
838 public V next() { return nextEntry().value;
[all...] |
| /frameworks/base/tools/aapt/tests/ |
| MockDirectoryWalker.h | 42 virtual struct dirent* nextEntry() {
|
| /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...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | [all...] |
| /external/smack/src/org/jivesoftware/smack/util/collections/ |
| AbstractReferenceMap.java | 795 protected ReferenceEntry<K, V> nextEntry() {
815 return nextEntry();
856 return nextEntry().getKey();
870 return nextEntry().getValue();
884 return nextEntry().getKey();
[all...] |
| AbstractHashedMap.java | 737 return super.nextEntry().getKey();
849 return super.nextEntry();
928 return super.nextEntry().getKey();
[all...] |
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| PartitionAlloc.cpp | 292 PartitionFreelistEntry* nextEntry = reinterpret_cast<PartitionFreelistEntry*>(nextFreeObject);
293 entry->next = partitionFreelistMask(nextEntry);
294 entry = nextEntry;
|
| /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/chromium_org/chrome/browser/resources/history/ |
| history.js | [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...] |
