File path: /jruby-1.4.0/src/org/jruby/util/Convert.java | File path: /jruby-1.4.0/src/org/jruby/util/Convert.java | |||
Method name: double byteArrayToDouble(byte[], int, int, boolean)
|
Method name: double byteArrayToDouble(byte[], int, int, boolean)
|
|||
Number of AST nodes: 39 | Number of AST nodes: 34 | |||
1 | for ( ; i < buflen ; ) {↵ | 1 | for ( ; i < buflen ; ) {↵ | |
2 | switch(ival = bytes[i++]) {↵ | 2 | switch(ival = bytes[i++]) {↵ | |
3 | case '0':↵ | 3 | case '0':↵ | |
4 | if (nDigits > 0) {↵ | 4 | if (nDigits > 0) {↵ | |
5 | nTrailingZeroes++;↵ | 5 | nTrailingZeroes++;↵ | |
6 | } else {↵ | 6 | } else {↵ | |
7 | exponent--;↵ | 7 | exponent--;↵ | |
8 | }↵ | 8 | }↵ | |
9 | break; // switch↵ | 9 | break; // switch↵ | |
10 | case '1': case '2': case '3': case '4':↵ | 10 | case '1': case '2': case '3': case '4':↵ | |
11 | case '5': case '6': case '7': case '8': case '9':↵ | 11 | case '5': case '6': case '7': case '8': case '9':↵ | |
12 | if (nTrailingZeroes > 0) {↵ | 12 | if (nTrailingZeroes > 0) {↵ | |
13 | if ((nDigits += nTrailingZeroes) < MAX_DECIMAL_DIGITS) {↵ | 13 | if ((nDigits += nTrailingZeroes) < MAX_DECIMAL_DIGITS) {↵ | |
14 | significand *= LONG_10_POWERS[nTrailingZeroes];↵ | 14 | significand *= LONG_10_POWERS[nTrailingZeroes];↵ | |
15 | nTrailingZeroes = 0;↵ | 15 | nTrailingZeroes = 0;↵ | |
16 | } // else catch oversize below↵ | 16 | } // else catch oversize below↵ | |
17 | }↵ | 17 | }↵ | |
18 | if (nDigits++ < MAX_DECIMAL_DIGITS) {↵ | 18 | if (nDigits++ < MAX_DECIMAL_DIGITS) {↵ | |
19 | significand = significand*10L + (long)((int)ival-(int)'0');↵ | 19 | significand = significand*10L + (long)((int)ival-(int)'0');↵ | |
20 | break; // switch↵ | 20 | break; // switch↵ | |
21 | } else {↵ | 21 | } else {↵ | |
22 | state = SDIGIT;↵ | 22 | state = SDIGIT;↵ | |
23 | break states;↵ | 23 | break states;↵ | |
24 | }↵ | 24 | }↵ | |
25 | case 'e':↵ | 25 | case 'e':↵ | |
26 | case 'E':↵ | 26 | case 'E':↵ | |
27 | state = SOPTEXP_STRICT;↵ | 27 | state = SOPTEXP;↵ | |
28 | break states;↵ | 28 | break states;↵ | |
29 | case '_':↵ | 29 | case '_':↵ | |
30 | if (i >= buflen || bytes[i] < '0' || bytes[i] > '9') {↵ | 30 | ↵ | |
31 | state = SERR_NOT_STRICT;↵ | |||
32 | break states;↵ | |||
33 | }↵ | |||
34 | break; // switch↵ | |||
35 | default:↵ | |||
36 | // only whitespace allowed after value for strict↵ | |||
37 | for ( --i; i < buflen && isWhitespace(bytes[i]); i++);↵ | |||
38 | state = i < buflen ? SERR_NOT_STRICT :↵ | 31 | // ignore↵ | |
32 | break; // switch↵ | |||
33 | default:↵ | |||
34 | // end of parseable data, go to calc↵ | |||
39 | SOPTCALC; ↵ | 35 | state = SOPTCALC;↵ | |
40 | break states;↵ | 36 | break states;↵ | |
41 | } // switch↵ | 37 | } // switch↵ | |
42 | } | 38 |
| |
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) | 4.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 288 |
Number of mapped statements | 33 |
Number of unmapped statements in the first code fragment | 6 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 56.3 |
Clone type | Type 3 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
352 | for (; i < buflen; ) | 154 | for (; i < buflen; ) | |||||||||||
353 | switch (ival = bytes[i++]) | 155 | switch (ival = bytes[i++]) | |||||||||||
354 | case '0': | 156 | case '0': | |||||||||||
355 | if (nDigits > 0) | 157 | if (nDigits > 0) | |||||||||||
356 | nTrailingZeroes++; | 158 | nTrailingZeroes++; | |||||||||||
else | else | |||||||||||||
357 | exponent--; | 159 | exponent--; | |||||||||||
358 | break; | 160 | break; | |||||||||||
359 | case '1': | 161 | case '1': | |||||||||||
360 | case '2': | 162 | case '2': | |||||||||||
361 | case '3': | 163 | case '3': | |||||||||||
362 | case '4': | 164 | case '4': | |||||||||||
363 | case '5': | 165 | case '5': | |||||||||||
364 | case '6': | 166 | case '6': | |||||||||||
365 | case '7': | 167 | case '7': | |||||||||||
366 | case '8': | 168 | case '8': | |||||||||||
367 | case '9': | 169 | case '9': | |||||||||||
368 | if (nTrailingZeroes > 0) | 170 | if (nTrailingZeroes > 0) | |||||||||||
369 | if ((nDigits += nTrailingZeroes) < MAX_DECIMAL_DIGITS) | 171 | if ((nDigits += nTrailingZeroes) < MAX_DECIMAL_DIGITS) | |||||||||||
370 | significand *= LONG_10_POWERS[nTrailingZeroes]; | 172 | significand *= LONG_10_POWERS[nTrailingZeroes]; | |||||||||||
371 | nTrailingZeroes = 0; | 173 | nTrailingZeroes = 0; | |||||||||||
372 | if (nDigits++ < MAX_DECIMAL_DIGITS) | 174 | if (nDigits++ < MAX_DECIMAL_DIGITS) | |||||||||||
373 | significand = significand * 10L + (long)((int)ival - (int)'0'); | 175 | significand = significand * 10L + (long)((int)ival - (int)'0'); | |||||||||||
374 | break; | 176 | break; | |||||||||||
else | else | |||||||||||||
375 | state = SDIGIT; | 177 | state = SDIGIT; | |||||||||||
376 | break states; | 178 | break states; | |||||||||||
377 | case 'e': | 179 | case 'e': | |||||||||||
378 | case 'E': | 180 | case 'E': | |||||||||||
379 | state = SOPTEXP_STRICT; |
| 181 | state = SOPTEXP; | ||||||||||
380 | break states; | 182 | break states; | |||||||||||
381 | case '_': | 183 | case '_': | |||||||||||
382 | if (i >= buflen || bytes[i] < '0' || bytes[i] > '9') |
| | |||||||||||
383 | state = SERR_NOT_STRICT; |
| | |||||||||||
384 | break states; |
| | |||||||||||
385 | break; | 184 | break; | |||||||||||
386 | default: | 185 | default: | |||||||||||
|
| 186 | state = SOPTCALC; | |||||||||||
387 | for (--i; i < buflen && isWhitespace(bytes[i]); i++) |
| | |||||||||||
388 | ; | | ||||||||||||
389 | state = i < buflen ? SERR_NOT_STRICT : SOPTCALC; |
| | |||||||||||
390 | break states; | 187 | break states; |
Row | Violation |
---|---|
1 | Unmatched statement if(i >= buflen || bytes[i] < '0' || bytes[i] > '9') cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched statement state=SERR_NOT_STRICT; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
3 | Unmatched break states; |
4 | Unmatched statement state=SOPTCALC; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
5 | Unmatched statement for(--i; i < buflen && isWhitespace(bytes[i]); i++) cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
6 | Unmatched statement state=i < buflen ? SERR_NOT_STRICT : SOPTCALC; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
7 | Clone fragment #1 returns variables i, ival, nDigits, nTrailingZeroes, significand, exponent , while Clone fragment #2 returns variables i, ival, nDigits, nTrailingZeroes, significand, exponent |