int size = stackSize + SIZE[opcode];
if (size > maxStackSize) {
maxStackSize = size;
}
stackSize = size;
int size = stackSize + SIZE[opcode];
if (size > maxStackSize) {
maxStackSize = size;
}
stackSize = size;
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: void visitInsn(int)
|
|
Method name: void visitVarInsn(int, int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | int size = stackSize + SIZE[opcode];↵ | | 1 | int size = stackSize + SIZE[opcode];↵
|
2 | if (size > maxStackSize) {↵ | | 2 | if (size > maxStackSize) {↵
|
3 | maxStackSize = size;↵ | | 3 | maxStackSize = size;↵
|
4 | }↵ | | 4 | ↵
|
| | | 5 | }↵
|
5 | stackSize = size; | | 6 | stackSize = size;
|
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.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 6 |
-
{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.6 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
2 | int size = stackSize + SIZE[opcode]; | | 6 | int size = stackSize + SIZE[opcode]; |
3 | if (size > maxStackSize) | | 7 | if (size > maxStackSize) |
4 | | | 8 | |
5 | stackSize = size; | | 9 | stackSize = size; |
Precondition Violations (0)
Row |
Violation |