/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
|
H A D | ListIntSet.java | 97 add(iter.next()); 118 public int next() {
|
H A D | BitIntSet.java | 89 add(iter.next()); 110 public int next() {
|
/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
|
H A D | ListIntSet.java | 97 add(iter.next()); 118 public int next() {
|
H A D | BitIntSet.java | 89 add(iter.next()); 110 public int next() {
|
/dalvik/dx/src/com/android/multidex/ |
H A D | ArchivePathElement.java | 67 ZipEntry next = null; 71 while (next == null && delegate.hasMoreElements()) { 72 next = delegate.nextElement(); 73 if (next.isDirectory()) { 74 next = null; 77 return next != null; 81 public String next() { 83 String name = next.getName(); 84 next = null;
|
/dalvik/dx/src/com/android/dx/cf/code/ |
H A D | BasicBlocker.java | 229 * target and next instruction begin new blocks.) 232 // Fall through to next case... 235 int next = offset + length; 237 addWorkIfNecessary(next, true); 238 targetLists[offset] = IntList.makeImmutable(next, target); 277 for (int at = 0, next; /*at*/; at = next) { 278 next = Bits.findFirst(blockSet, at + 1); 279 if (next < 0) { 287 * there isn't any, then "next" i [all...] |
H A D | Ropper.java | 1445 * @return next available label 1766 * @param next next block to visit 1771 BasicBlock next, BasicBlock.Visitor v, BitSet visited) { 1772 v.visitBlock(next); 1773 visited.set(next.getLabel()); 1775 IntList successors = next.getSuccessors(); 1785 if (isSubroutineCaller(next) && i > 0) { 1770 forEachNonSubBlockDepthFirst0( BasicBlock next, BasicBlock.Visitor v, BitSet visited) argument
|
/dalvik/dexgen/src/com/android/dexgen/dex/code/form/ |
H A D | Form3rc.java | 129 int next = first; 137 if (one.getReg() != next) { 140 next += one.getCategory(); 143 return unsignedFitsInByte(next - first);
|
H A D | Form4rcc.java | 129 int next = first; 137 if (one.getReg() != next) { 140 next += one.getCategory(); 143 return unsignedFitsInByte(next - first);
|
/dalvik/dx/junit-tests/com/android/dx/util/ |
H A D | ListIntSetTest.java | 56 assertEquals(iter.next(), 0); 58 assertEquals(iter.next(), 1); 60 assertEquals(iter.next(), 31); 65 iter.next();
|
H A D | BitIntSetTest.java | 56 assertEquals(iter.next(), 0); 58 assertEquals(iter.next(), 1); 60 assertEquals(iter.next(), 31); 65 iter.next(); 110 assertEquals(values[i], iter.next());
|
/dalvik/dexgen/src/com/android/dexgen/rop/annotation/ |
H A D | Annotations.java | 114 Annotation thisOne = thisIter.next(); 115 Annotation otherOne = otherIter.next();
|
H A D | Annotation.java | 116 NameValuePair thisOne = thisIter.next(); 117 NameValuePair otherOne = otherIter.next();
|
/dalvik/dx/src/com/android/dx/rop/annotation/ |
H A D | Annotations.java | 113 Annotation thisOne = thisIter.next(); 114 Annotation otherOne = otherIter.next();
|
H A D | Annotation.java | 107 NameValuePair thisOne = thisIter.next(); 108 NameValuePair otherOne = otherIter.next();
|
/dalvik/dexgen/src/com/android/dexgen/dex/file/ |
H A D | UniformItemSection.java | 54 return sz * items.iterator().next().writeSize();
|
H A D | DebugInfoEncoder.java | 224 * Figure out what the next important address is. 238 int next = Math.min(nextAddrP, nextAddrL); 240 // No next important address == done. 241 if (next == Integer.MAX_VALUE) { 249 if (next == codeSize 255 if (next == nextAddrP) { 259 emitAdvancePc(next - address);
|
/dalvik/dx/src/com/android/dx/dex/file/ |
H A D | UniformItemSection.java | 53 return sz * items.iterator().next().writeSize();
|
H A D | DebugInfoEncoder.java | 232 * Figure out what the next important address is. 246 int next = Math.min(nextAddrP, nextAddrL); 248 // No next important address == done. 249 if (next == Integer.MAX_VALUE) { 257 if (next == codeSize 263 if (next == nextAddrP) { 267 emitAdvancePc(next - address);
|
/dalvik/dx/src/com/android/dx/ssa/ |
H A D | EscapeAnalysis.java | 567 SsaInsn next; 575 next = getMoveForInsn(use); 581 result = source.withReg(next.getResult().getReg()); 582 insertPlainInsnBefore(next, RegisterSpecList.make(source), 586 insertExceptionThrow(next, sources.get(1), deletedInsns); 587 deletedInsns.add(next.getBlock().getInsns().get(2)); 589 deletedInsns.add(next); 612 next = getMoveForInsn(use); 613 insertPlainInsnBefore(next, RegisterSpecList.EMPTY, 614 next [all...] |
H A D | SsaConverter.java | 356 int dfBlockIndex = dfIterator.next();
|
/dalvik/dx/src/com/android/dx/dex/code/ |
H A D | InsnFormat.java | 402 int next = first; 406 if (one.getReg() != next) { 409 next += one.getCategory();
|
/dalvik/dx/src/com/android/dx/ssa/back/ |
H A D | RegisterAllocator.java | 180 interference.add(newReg, liveOutIter.next());
|