label = v + readInt(b, u); u += 4;
newOffset = getNewOffset(allIndexes, allSizes, v, label);
newCode.put4(newOffset);
label = v + readInt(b, u); u += 4;
newOffset = getNewOffset(allIndexes, allSizes, v, label);
newCode.put4(newOffset);
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: 4
|
|
Number of AST nodes: 4
|
|
1 | label = v + readInt(b, u); u += 4;↵ | | 1 | label = v + readInt(b, u); u += 4;↵
|
2 | newOffset = getNewOffset(allIndexes, allSizes, v, label);↵ | | 2 | newOffset = getNewOffset(allIndexes, allSizes, v, label);↵
|
3 | newCode.put4(newOffset); | | 3 | newCode.put4(newOffset);
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in the same method |
Number of node comparisons | 21 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 4 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
160 | label = v + readInt(b, u); | | 182 | label = v + readInt(b, u); |
161 | u += 4; | | 183 | u += 4; |
162 | newOffset = getNewOffset(allIndexes, allSizes, v, label); | | 184 | newOffset = getNewOffset(allIndexes, allSizes, v, label); |
163 | newCode.put4(newOffset); | | 185 | newCode.put4(newOffset); |
Precondition Violations (0)
Row |
Violation |