while (curr < lti) {
// inlined: bsW(2, 2);
while (bsLiveShadow >= 8) {
outShadow.write(bsBuffShadow >> 24); // write 8-bit
bsBuffShadow <<= 8;
bsLiveShadow -= 8;
}
bsBuffShadow |= 2 << (32 - bsLiveShadow - 2);
bsLiveShadow += 2;
curr++; /* 10 */
}
while (curr > lti) {
// inlined: bsW(2, 3);
while (bsLiveShadow >= 8) {
outShadow.write(bsBuffShadow >> 24); // write 8-bit
bsBuffShadow <<= 8;
bsLiveShadow -= 8;
}
bsBuffShadow |= 3 << (32 - bsLiveShadow - 2);
bsLiveShadow += 2;
curr--; /* 11 */
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2OutputStream.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2OutputStream.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | while (curr < lti) {↵ | | 1 | while (curr > lti) {↵
|
2 | // inlined: bsW(2, 2);↵ | | 2 | // inlined: bsW(2, 3);↵
|
3 | while (bsLiveShadow >= 8) {↵ | | 3 | while (bsLiveShadow >= 8) {↵
|
4 | outShadow.write(bsBuffShadow >> 24); // write 8-bit↵ | | 4 | outShadow.write(bsBuffShadow >> 24); // write 8-bit↵
|
5 | bsBuffShadow <<= 8;↵ | | 5 | bsBuffShadow <<= 8;↵
|
6 | bsLiveShadow -= 8;↵ | | 6 | bsLiveShadow -= 8;↵
|
7 | }↵ | | 7 | }↵
|
8 | bsBuffShadow |= 2 << (32 - bsLiveShadow - 2);↵ | | 8 | bsBuffShadow |= 3 << (32 - bsLiveShadow - 2);↵
|
9 | bsLiveShadow += 2;↵ | | 9 | bsLiveShadow += 2;↵
|
|
10 | curr++; /* 10 */↵ | | 10 | curr--; /* 11 */↵
|
11 | } | | 11 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |