while (newCode.length % 4 != 0) { newCode.put1(0); } label = v + readInt(b, u); u += 4; newOffset = getNewOffset(allIndexes, allSizes, v, label); newCode.put4(newOffset); j = readInt(b, u); u += 4; newCode.put4(j);
while (newCode.length % 4 != 0) { newCode.put1(0); } label = v + readInt(b, u); u += 4; newOffset = getNewOffset(allIndexes, allSizes, v, label); newCode.put4(newOffset); j = readInt(b, u); u += 4; newCode.put4(j);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/objectweb/asm/CodeWriter.java File path: /jEdit-4.2/src/org/objectweb/asm/CodeWriter.java
Method name: int[] resizeInstructions(int[], int[], int) Method name: int[] resizeInstructions(int[], int[], int)
Number of AST nodes: 9 Number of AST nodes: 9
1
while (newCode.length % 4 != 0) {
1
while (newCode.length % 4 != 0) {
2
            newCode.put1(0);
2
            newCode.put1(0);
3
          }
3
          }
4
          label = v + readInt(b, u); u += 4;
4
          label = v + readInt(b, u); u += 4;
5
          newOffset = getNewOffset(allIndexes, allSizes, v, label);
5
          newOffset = getNewOffset(allIndexes, allSizes, v, label);
6
          newCode.put4(newOffset);
6
          newCode.put4(newOffset);
7
          j = readInt(b, u); u += 4;
7
          j = readInt(b, u); u += 4;
8
          newCode.put4(j);
8
          newCode.put4(j);
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.3
Clones locationClones are in the same method
Number of node comparisons58
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements9
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)7.6
    Clone typeType 1
    Mapped Statements
    ID Statement ID Statement
    147
    while (newCode.length % 4 != 0)
    170
    while (newCode.length % 4 != 0)
    148
    newCode.put1(0);
    171
    newCode.put1(0);
    149
    label = v + readInt(b, u);
    172
    label = v + readInt(b, u);
    150
    u += 4;
    173
    u += 4;
    151
    newOffset = getNewOffset(allIndexes, allSizes, v, label);
    174
    newOffset = getNewOffset(allIndexes, allSizes, v, label);
    152
    newCode.put4(newOffset);
    175
    newCode.put4(newOffset);
    153
    j = readInt(b, u);
    176
    j = readInt(b, u);
    154
    u += 4;
    177
    u += 4;
    155
    newCode.put4(j);
    178
    newCode.put4(j);
    Precondition Violations (1)
    Row Violation
    1Clone fragment #1 returns variables j, u , while Clone fragment #2 returns variables u, j