if (opcode == Constants.GOTO) { newCode.put1(200); // GOTO_W } else if (opcode == Constants.JSR) { newCode.put1(201); // JSR_W } else { newCode.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1); newCode.put2(8); // jump offset newCode.put1(200); // GOTO_W newOffset -= 3; // newOffset now computed from start of GOTO_W } newCode.put4(newOffset);
if (opcode == Constants.GOTO) { code.put1(200); // GOTO_W } else if (opcode == Constants.JSR) { code.put1(201); // JSR_W } else { code.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1); code.put2(8); // jump offset code.put1(200); // GOTO_W } label.put(this, code, code.length - 1, true);
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: void visitJumpInsn(int, Label)
Number of AST nodes: 9 Number of AST nodes: 8
1
if (opcode == Constants.GOTO) {
1
if (opcode == Constants.GOTO) {
2
              newCode.put1(200); // GOTO_W
2
        code.put1(200); // GOTO_W
3
            } else if (opcode == Constants.JSR) {
3
      } else if (opcode == Constants.JSR) {
4
              newCode.put1(201); // JSR_W
4
        code.put1(201); // JSR_W
5
            } else {
5
      } else {
6
              newCode.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
6
        code.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
7
              newCode.put2(8);   // jump offset
7
        code.put2(8);   // jump offset
8
              newCode.put1(200); // GOTO_W
8
        code.put1(200); // GOTO_W
9
      
9
      }
10
        newOffset -= 3;    // newOffset now computed from start of GOTO_W
10
      
11
            }
12
            newCode.put4(newOffset);
11
label.put(this, code, code.length - 1, true);
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)1.0
Clones locationClones are declared in the same class
Number of node comparisons36
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements7
    Number of unmapped statements in the first code fragment2
    Number of unmapped statements in the second code fragment1
    Time elapsed for statement mapping (ms)12.0
    Clone typeType 3
    Mapped Statements
    ID Statement ID Statement
    122
    if (opcode == Constants.GOTO)
    19
    if (opcode == Constants.GOTO)
    123
    newCode.put1(200);
    123
    newCode.put1(200);
    20
    code.put1(200);
    Differences
    Expression1Expression2Difference
    newCodecodeVARIABLE_NAME_MISMATCH
    20
    code.put1(200);
    124
    else if (opcode == Constants.JSR)
    21
    else if (opcode == Constants.JSR)
    125
    newCode.put1(201);
    125
    newCode.put1(201);
    22
    code.put1(201);
    Differences
    Expression1Expression2Difference
    newCodecodeVARIABLE_NAME_MISMATCH
    22
    code.put1(201);
    else
    else
    126
    newCode.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
    126
    newCode.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
    23
    code.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
    Differences
    Expression1Expression2Difference
    newCodecodeVARIABLE_NAME_MISMATCH
    23
    code.put1(opcode <= 166 ? ((opcode + 1) ^ 1) - 1 : opcode ^ 1);
    127
    newCode.put2(8);
    127
    newCode.put2(8);
    24
    code.put2(8);
    Differences
    Expression1Expression2Difference
    newCodecodeVARIABLE_NAME_MISMATCH
    24
    code.put2(8);
    128
    newCode.put1(200);
    128
    newCode.put1(200);
    25
    code.put1(200);
    Differences
    Expression1Expression2Difference
    newCodecodeVARIABLE_NAME_MISMATCH
    25
    code.put1(200);
    129
    newOffset -= 3;
                                        
                                                                                                
    26
    label.put(this, code, code.length - 1, true);
    Preondition Violations
    Unmatched statement label.put(this,code,code.length - 1,true); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
    26
    label.put(this, code, code.length - 1, true);
    130
    newCode.put4(newOffset);
    130
    newCode.put4(newOffset);
    Preondition Violations
    Unmatched statement newCode.put4(newOffset); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted
                                                              
    Precondition Violations (2)
    Row Violation
    1Unmatched statement label.put(this,code,code.length - 1,true); cannot be moved before the extracted code, because it has control dependencies from statements that will be extracted
    2Unmatched statement newCode.put4(newOffset); cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted