/dalvik/dexgen/src/com/android/dexgen/util/ |
H A D | IntIterator.java | 25 * Checks to see if the iterator has a next value. 27 * @return true if next() will succeed 32 * Returns the next value in the iterator. 34 * @return next value 35 * @throws java.util.NoSuchElementException if no next element exists 37 int next(); method in interface:IntIterator
|
/dalvik/dx/src/com/android/dx/util/ |
H A D | IntIterator.java | 25 * Checks to see if the iterator has a next value. 27 * @return true if next() will succeed 32 * Returns the next value in the iterator. 34 * @return next value 35 * @throws java.util.NoSuchElementException if no next element exists 37 int next(); method in interface:IntIterator
|
/dalvik/vm/compiler/ |
H A D | CompilerUtility.h | 31 struct ArenaMemBlock *next; member in struct:ArenaMemBlock
|
H A D | CompilerIR.h | 83 struct LIR *next; member in struct:LIR 133 struct MIR *next; member in struct:MIR
|
/dalvik/tests/080-oom-throw/src/ |
H A D | Main.java | 36 InstanceMemEater next; field in class:Main.InstanceMemEater 68 lastMemEater.next = InstanceMemEater.blowup(); 69 lastMemEater = lastMemEater.next;
|
/dalvik/vm/ |
H A D | JniInternal.h | 47 struct JNIEnvExt* next; member in struct:JNIEnvExt
|
H A D | Sync.cpp | 81 Monitor* next; member in struct:Monitor 113 mon->next = gDvm.monitorList; 114 } while (android_atomic_release_cas((int32_t)mon->next, (int32_t)mon, 130 nextMon = mon->next; 232 prev->next = curr = *mon; 236 prev->next = curr->next; 238 curr = prev->next; 241 curr = curr->next; 244 *mon = handle.next; [all...] |
H A D | Thread.h | 264 /* links to the next thread in the wait set this thread is part of */ 278 struct Thread* next; member in struct:Thread
|
/dalvik/vm/jdwp/ |
H A D | JdwpEvent.h | 88 JdwpEvent* next; member in struct:JdwpEvent
|
/dalvik/vm/interp/ |
H A D | Jit.h | 117 unsigned int next; member in struct:JitTraceProfCounters 134 u2 chain; /* Index of next in chain */
|
/dalvik/dx/src/com/android/dx/cf/code/ |
H A D | Ropper.java | 1340 * @return next available label 1641 * @param next next block to visit 1646 BasicBlock next, BasicBlock.Visitor v, BitSet visited) { 1647 v.visitBlock(next); 1648 visited.set(next.getLabel()); 1650 IntList successors = next.getSuccessors(); 1660 if (isSubroutineCaller(next) && i > 0) { 1645 forEachNonSubBlockDepthFirst0( BasicBlock next, BasicBlock.Visitor v, BitSet visited) argument
|
/dalvik/vm/compiler/codegen/ |
H A D | RallocUtil.cpp | 199 int next = *nextTemp; local 201 if (next >= numTemps) 202 next = 0; 203 if (!p[next].inUse && !p[next].live) { 204 dvmCompilerClobber(cUnit, p[next].reg); 205 p[next].inUse = true; 206 p[next].pair = false; 207 *nextTemp = next + 1; 208 return p[next] 237 int next = cUnit->regPool->nextFPTemp; local [all...] |
/dalvik/vm/compiler/codegen/mips/ |
H A D | RallocUtil.cpp | 201 int next = *nextTemp; local 203 if (next >= numTemps) 204 next = 0; 205 if (!p[next].inUse && !p[next].live) { 206 dvmCompilerClobber(cUnit, p[next].reg); 207 p[next].inUse = true; 208 p[next].pair = false; 209 *nextTemp = next + 1; 210 return p[next] 241 int next = start; local [all...] |
/dalvik/vm/alloc/ |
H A D | MarkSweep.cpp | 395 Object *next = dvmGetFieldObject(head, offset); local 396 dvmSetFieldObject(*list, offset, next); 497 * Scans forward to the header of the next marked object between start 540 /* Ended within the current card, advance to the next card. */ 581 * to the address corresponding to the lowest address in the next word
|
/dalvik/vm/compiler/codegen/x86/ |
H A D | AnalysisO1.h | 166 struct DefOrUseLink* next; member in struct:DefOrUseLink 174 struct DefUsePair* next; member in struct:DefUsePair 207 struct LiveRange* next; member in struct:LiveRange
|
H A D | LowerHelper.cpp | 166 struct AtomMemBlock *next; member in struct:AtomMemBlock 183 currentAtomMem->next = NULL; 196 if (currentAtomMem->next) { 197 currentAtomMem = currentAtomMem->next; 207 newAtomMem->next = NULL; 208 currentAtomMem->next = newAtomMem; 220 tmpMem = tmpMem->next; 1839 return; //next native instruction starts at op 1952 nextVersionOfHardReg(PhysicalReg_EDX, 2); //next version has 2 ref count 1983 nextVersionOfHardReg(PhysicalReg_EDX, 2); //next versio [all...] |
/dalvik/tools/dmtracedump/ |
H A D | TraceDump.c | 137 struct TimedMethod *next; member in struct:TimedMethod 579 * Find the offset to the next occurrence of the specified character. 602 * Count the number of lines until the next token. 609 int next; local 612 next = findNextChar(data, len, '\n'); 613 if (next < 0) 616 data += next+1; 617 len -= next+1; 631 int next; local 639 next 658 int i, count, next; local 713 int i, next, tab, count; local 767 int i, next, count; local 879 int next; local [all...] |