HomeSort by relevance Sort by last modified time
    Searched refs:npairs (Results 1 - 9 of 9) sorted by null

  /external/javassist/src/main/javassist/bytecode/analysis/
SubroutineScanner.java 129 int npairs = iter.s32bitAt(index += 4); local
130 int end = npairs * 8 + (index += 4);
Analyzer.java 351 int npairs = iter.s32bitAt(index += 4); local
352 int end = npairs * 8 + (index += 4);
  /external/javassist/src/main/javassist/bytecode/
CodeIterator.java 758 int npairs = ByteArray.read32bit(code, index2); local
759 return index2 + npairs * 8 + 4;
935 int npairs = ByteArray.read32bit(code, i2 + 4); local
1198 int npairs = ByteArray.read32bit(code, i2 + 4); local
    [all...]
CodeAnalyzer.java 160 int npairs = ci.s32bitAt(index2 + 4); local
162 for (int i = 0; i < npairs; ++i) {
InstructionPrinter.java 228 int npairs = iter.s32bitAt(index += 4); local
229 int end = npairs * 8 + (index += 4);
  /external/emma/core/java12/com/vladium/emma/instr/
InstrVisitor.java 819 final int npairs = ((0xFF & code [++ scan]) << 24) | ((0xFF & code [++ scan]) << 16) | ((0xFF & code [++ scan]) << 8) | (0xFF & code [++ scan]); local
1704 final int npairs = m_keys.length; local
    [all...]
  /external/javassist/src/main/javassist/compiler/
CodeGen.java 511 int npairs = 0; local
514 ++npairs;
519 bytecode.add32bit(npairs);
520 bytecode.addGap(npairs * 8);
522 long[] pairs = new long[npairs];
544 for (int i = 0; i < npairs; ++i) {
    [all...]
  /dalvik/dx/src/com/android/dx/cf/code/
BytecodeArray.java 872 int npairs = bytes.getInt(at + 4); local
    [all...]
  /external/emma/lib/
emma.jar 

Completed in 122 milliseconds