File path: /jEdit-4.2/src/installer/CBZip2OutputStream.java | File path: /jEdit-4.2/src/installer/CBZip2OutputStream.java | |||
Method name: void simpleSort(int, int, int)
|
Method name: void simpleSort(int, int, int)
|
|||
Number of AST nodes: 22 | Number of AST nodes: 22 | |||
1 | if( i > hi )↵ | 1 | if( i > hi )↵ | |
2 | {↵ | 2 | {↵ | |
3 | break;↵ | 3 | break;↵ | |
4 | }↵ | 4 | }↵ | |
5 | v = m_zptr[ i ];↵ | 5 | v = m_zptr[ i ];↵ | |
6 | j = i;↵ | 6 | j = i;↵ | |
7 | while( fullGtU( m_zptr[ j - h ] + d, v + d ) )↵ | 7 | while( fullGtU( m_zptr[ j - h ] + d, v + d ) )↵ | |
8 | {↵ | 8 | {↵ | |
9 | m_zptr[ j ] = m_zptr[ j - h ];↵ | 9 | m_zptr[ j ] = m_zptr[ j - h ];↵ | |
10 | j = j - h;↵ | 10 | j = j - h;↵ | |
11 | if( j <= ( lo + h - 1 ) )↵ | 11 | if( j <= ( lo + h - 1 ) )↵ | |
12 | {↵ | 12 | {↵ | |
13 | break;↵ | 13 | break;↵ | |
14 | }↵ | 14 | }↵ | |
15 | }↵ | 15 | }↵ | |
16 | m_zptr[ j ] = v;↵ | 16 | m_zptr[ j ] = v;↵ | |
17 | i++;↵ | 17 | i++;↵ | |
18 | /*↵ | 18 | /*↵ | |
19 | * copy 2↵ | 19 | * copy 3↵ | |
20 | */↵ | 20 | */↵ | |
21 | if( i > hi )↵ | 21 | if( i > hi )↵ | |
22 | {↵ | 22 | {↵ | |
23 | break;↵ | 23 | break;↵ | |
24 | }↵ | 24 | }↵ | |
25 | v = m_zptr[ i ];↵ | 25 | v = m_zptr[ i ];↵ | |
26 | j = i;↵ | 26 | j = i;↵ | |
27 | while( fullGtU( m_zptr[ j - h ] + d, v + d ) )↵ | 27 | while( fullGtU( m_zptr[ j - h ] + d, v + d ) )↵ | |
28 | {↵ | 28 | {↵ | |
29 | m_zptr[ j ] = m_zptr[ j - h ];↵ | 29 | m_zptr[ j ] = m_zptr[ j - h ];↵ | |
30 | j = j - h;↵ | 30 | j = j - h;↵ | |
31 | if( j <= ( lo + h - 1 ) )↵ | 31 | if( j <= ( lo + h - 1 ) )↵ | |
32 | {↵ | 32 | {↵ | |
33 | break;↵ | 33 | break;↵ | |
34 | }↵ | 34 | }↵ | |
35 | }↵ | 35 | }↵ | |
36 | m_zptr[ j ] = v;↵ | 36 | m_zptr[ j ] = v;↵ | |
37 | i++; | 37 |
| |
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) | 1.6 |
Clones location | Clones are in the same method |
Number of node comparisons | 72 |
Number of mapped statements | 22 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 3 |
Time elapsed for statement mapping (ms) | 4.3 |
Clone type | Type 3 |
ID | Statement | ID | Statement | |||||||
---|---|---|---|---|---|---|---|---|---|---|
18 | if (i > hi) | 29 | if (i > hi) | |||||||
19 | break; |
| 30 | break; | ||||||
20 | v = m_zptr[i]; | 31 | v = m_zptr[i]; | |||||||
21 | j = i; | 32 | j = i; | |||||||
22 | while (fullGtU(m_zptr[j - h] + d, v + d)) | 33 | while (fullGtU(m_zptr[j - h] + d, v + d)) | |||||||
23 | m_zptr[j] = m_zptr[j - h]; | 34 | m_zptr[j] = m_zptr[j - h]; | |||||||
24 | j = j - h; | 35 | j = j - h; | |||||||
25 | if (j <= (lo + h - 1)) | 36 | if (j <= (lo + h - 1)) | |||||||
26 | break; | 37 | break; | |||||||
27 | m_zptr[j] = v; | 38 | m_zptr[j] = v; | |||||||
28 | i++; | 39 | i++; | |||||||
29 | if (i > hi) | 40 | if (i > hi) | |||||||
30 | break; |
| 41 | break; | ||||||
31 | v = m_zptr[i]; | 31 | v = m_zptr[i]; | |||||||
32 | j = i; | 32 | j = i; | |||||||
|
| 42 | v = m_zptr[i]; | |||||||
|
| 43 | j = i; | |||||||
33 | while (fullGtU(m_zptr[j - h] + d, v + d)) | 44 | while (fullGtU(m_zptr[j - h] + d, v + d)) | |||||||
34 | m_zptr[j] = m_zptr[j - h]; | 45 | m_zptr[j] = m_zptr[j - h]; | |||||||
35 | j = j - h; | 46 | j = j - h; | |||||||
36 | if (j <= (lo + h - 1)) | 47 | if (j <= (lo + h - 1)) | |||||||
37 | break; | 48 | break; | |||||||
38 | m_zptr[j] = v; | 49 | m_zptr[j] = v; | |||||||
39 | i++; | 39 | i++; | |||||||
| 50 | i++; |
Row | Violation |
---|---|
1 | Statement break; without innermost loop |
2 | Statement break; without innermost loop |
3 | Statement break; without innermost loop |
4 | Statement break; without innermost loop |
5 | Unmatched statement v=m_zptr[i]; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
6 | Unmatched statement j=i; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |