File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2InputStream.java | File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2InputStream.java | |||
Method name: void recvDecodingTables()
|
Method name: void recvDecodingTables()
|
|||
Number of AST nodes: 3 | Number of AST nodes: 3 | |||
1 | for (int j = 0; j < 16; j++) {↵ | 1 | for (int i = 0; i < 16; i++) {↵ | |
2 | if (bsGetBit()) {↵ | 2 | if (bsGetBit()) {↵ | |
3 | inUse[i16 + j] = true;↵ | 3 | inUse16 ↵ | |
4 | ↵ | 4 | |= 1 << i;↵ | |
5 | }↵ | 5 | }↵ | |
6 | } | 6 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 7 |
Number of mapped statements | 2 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 2.8 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
15 | for (int j = 0; j < 16; j++) |
| 7 | for (int i = 0; i < 16; i++) | ||||||||||||||||
16 | if (bsGetBit()) | 8 | if (bsGetBit()) | |||||||||||||||||
|
| 9 | inUse16 |= 1 << i; | |||||||||||||||||
17 | inUse[i16 + j] = true; |
| |
Row | Violation |
---|---|
1 | Unmatched statement inUse16|=1 << i; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched statement inUse[i16 + j]=true; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |