File path: /jEdit-4.2/src/installer/CBZip2InputStream.java | File path: /jEdit-4.2/src/installer/CBZip2InputStream.java | |||
Method name: void getAndMoveToFrontDecode()
|
Method name: void getAndMoveToFrontDecode()
|
|||
Number of AST nodes: 19 | Number of AST nodes: 19 | |||
1 | zt = m_selector[ groupNo ];↵ | 1 | zt = m_selector[ groupNo ];↵ | |
2 | zn = m_minLens[ zt ];↵ | 2 | zn = m_minLens[ zt ];↵ | |
3 | zvec = bsR( zn );↵ | 3 | zvec = bsR( zn );↵ | |
4 | while( zvec > m_limit[ zt ][ zn ] )↵ | 4 | while( zvec > m_limit[ zt ][ zn ] )↵ | |
5 | {↵ | 5 | ↵ | |
6 | {↵ | |||
6 | zn++;↵ | 7 | zn++;↵ | |
7 | while( m_bsLive < 1 )↵ | 8 | while( m_bsLive < 1 )↵ | |
8 | {↵ | 9 | ↵ | |
10 | {↵ | |||
9 | int zzi;↵ | 11 | int zzi;↵ | |
10 | char thech = 0;↵ | 12 | char thech = 0;↵ | |
11 | try↵ | 13 | ↵ | |
14 | try↵ | |||
12 | {↵ | 15 | ↵ | |
16 | {↵ | |||
13 | thech = (char)m_input.read();↵ | 17 | thech = (char)m_input.read();↵ | |
14 | }↵ | 18 | ↵ | |
19 | }↵ | |||
15 | catch( IOException e )↵ | 20 | catch( IOException e )↵ | |
16 | {↵ | 21 | {↵ | |
17 | compressedStreamEOF();↵ | 22 | compressedStreamEOF();↵ | |
18 | }↵ | 23 | }↵ | |
19 | if( thech == -1 )↵ | 24 | if( thech == -1 )↵ | |
20 | {↵ | 25 | {↵ | |
21 | compressedStreamEOF();↵ | 26 | compressedStreamEOF();↵ | |
22 | }↵ | 27 | ↵ | |
28 | }↵ | |||
23 | zzi = thech;↵ | 29 | zzi = thech;↵ | |
24 | m_bsBuff = ( m_bsBuff << 8 ) | ( zzi & 0xff );↵ | 30 | m_bsBuff = ( m_bsBuff << 8 ) | ( zzi & 0xff );↵ | |
25 | m_bsLive += 8;↵ | 31 | m_bsLive += 8;↵ | |
26 | }↵ | 32 | ↵ | |
33 | }↵ | |||
27 | zj = ( m_bsBuff >> ( m_bsLive - 1 ) ) & 1;↵ | 34 | zj = ( m_bsBuff >> ( m_bsLive - 1 ) ) & 1;↵ | |
28 | m_bsLive--;↵ | 35 | m_bsLive--;↵ | |
29 | zvec = ( zvec << 1 ) | zj;↵ | 36 | zvec = ( zvec << 1 ) | zj;↵ | |
30 | }↵ | 37 | ↵ | |
38 | }↵ | |||
31 | nextSym = m_perm[ zt ][ zvec - m_base[ zt ][ zn ] ]; | 39 | nextSym = m_perm[ zt ][ zvec - m_base[ zt ][ zn ] ]; | |
See real code fragment | See real code fragment |
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.9 |
Clones location | Clones are in the same method |
Number of node comparisons | 91 |
Number of mapped statements | 19 |
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) | 18.2 |
Clone type | Type 1 |
ID | Statement | ID | Statement | |
---|---|---|---|---|
20 | zt = m_selector[groupNo]; | 54 | zt = m_selector[groupNo]; | |
21 | zn = m_minLens[zt]; | 55 | zn = m_minLens[zt]; | |
22 | zvec = bsR(zn); | 56 | zvec = bsR(zn); | |
23 | while (zvec > m_limit[zt][zn]) | 57 | while (zvec > m_limit[zt][zn]) | |
24 | zn++; | 58 | zn++; | |
25 | while (m_bsLive < 1) | 59 | while (m_bsLive < 1) | |
26 | int zzi; | 60 | int zzi; | |
27 | char thech = 0; | 61 | char thech = 0; | |
28 | try | 62 | try | |
29 | thech = (char)m_input.read(); | 63 | thech = (char)m_input.read(); | |
30 | if (thech == -1) | 64 | if (thech == -1) | |
31 | compressedStreamEOF(); | 65 | compressedStreamEOF(); | |
32 | zzi = thech; | 66 | zzi = thech; | |
33 | m_bsBuff = (m_bsBuff << 8) | (zzi & 0xff); | 67 | m_bsBuff = (m_bsBuff << 8) | (zzi & 0xff); | |
34 | m_bsLive += 8; | 68 | m_bsLive += 8; | |
35 | zj = (m_bsBuff >> (m_bsLive - 1)) & 1; | 69 | zj = (m_bsBuff >> (m_bsLive - 1)) & 1; | |
36 | m_bsLive--; | 70 | m_bsLive--; | |
37 | zvec = (zvec << 1) | zj; | 71 | zvec = (zvec << 1) | zj; | |
38 | nextSym = m_perm[zt][zvec - m_base[zt][zn]]; | 72 | nextSym = m_perm[zt][zvec - m_base[zt][zn]]; |
Row | Violation |
---|