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: 34 | Number of AST nodes: 28 | |||
1 | for ( ; i < buflen ; ) {↵ | 1 | if (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 | ↵ | |
26 | case 'E':↵ | |||
27 | state = SOPTEXP;↵ | |||
28 | break states;↵ | |||
29 | case '_':↵ | |||
30 | // ignore↵ | |||
31 | break; // switch↵ | |||
32 | default:↵ | 26 | default:↵ | |
33 | // end of parseable data, go to calc↵ | 27 | // no dec digits, end of parseable data, go to calc↵ | |
34 | state = SOPTCALC;↵ | 28 | state = SOPTCALC;↵ | |
35 | break states;↵ | 29 | break states;↵ | |
30 | ↵ | |||
36 | } // switch↵ | 31 | } // switch↵ | |
37 | } | 32 |
| |
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) | 2.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 191 |
Number of mapped statements | 27 |
Number of unmapped statements in the first code fragment | 6 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 49.8 |
Clone type | Type 3 |
ID | Statement | ID | Statement | ||||
---|---|---|---|---|---|---|---|
155 | switch (ival = bytes[i++]) | 127 | switch (ival = bytes[i++]) | ||||
156 | case '0': | 128 | case '0': | ||||
157 | if (nDigits > 0) | 129 | if (nDigits > 0) | ||||
158 | nTrailingZeroes++; | 130 | nTrailingZeroes++; | ||||
else | else | ||||||
159 | exponent--; | 131 | exponent--; | ||||
160 | break; | 132 | break; | ||||
161 | case '1': | 133 | case '1': | ||||
162 | case '2': | 134 | case '2': | ||||
163 | case '3': | 135 | case '3': | ||||
164 | case '4': | 136 | case '4': | ||||
165 | case '5': | 137 | case '5': | ||||
166 | case '6': | 138 | case '6': | ||||
167 | case '7': | 139 | case '7': | ||||
168 | case '8': | 140 | case '8': | ||||
169 | case '9': | 141 | case '9': | ||||
170 | if (nTrailingZeroes > 0) | 142 | if (nTrailingZeroes > 0) | ||||
171 | if ((nDigits += nTrailingZeroes) < MAX_DECIMAL_DIGITS) | 143 | if ((nDigits += nTrailingZeroes) < MAX_DECIMAL_DIGITS) | ||||
172 | significand *= LONG_10_POWERS[nTrailingZeroes]; | 144 | significand *= LONG_10_POWERS[nTrailingZeroes]; | ||||
173 | nTrailingZeroes = 0; | 145 | nTrailingZeroes = 0; | ||||
174 | if (nDigits++ < MAX_DECIMAL_DIGITS) | 146 | if (nDigits++ < MAX_DECIMAL_DIGITS) | ||||
175 | significand = significand * 10L + (long)((int)ival - (int)'0'); | 147 | significand = significand * 10L + (long)((int)ival - (int)'0'); | ||||
176 | break; | 148 | break; | ||||
else | else | ||||||
177 | state = SDIGIT; | 149 | state = SDIGIT; | ||||
178 | break states; | 150 | break states; | ||||
179 | case 'e': | | |||||
180 | case 'E': | | |||||
181 | state = SOPTEXP; |
| | ||||
182 | break states; |
| | ||||
183 | case '_': | | |||||
184 | break; |
| | ||||
185 | default: | 151 | default: | ||||
186 | state = SOPTCALC; | 152 | state = SOPTCALC; | ||||
187 | break states; | 153 | break states; |
Row | Violation |
---|---|
1 | Unmatched statement state=SOPTEXP; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched break states; |
3 | Unmatched break; |
4 | Clone fragment #1 returns variables i, ival, nDigits, nTrailingZeroes, significand, exponent , while Clone fragment #2 returns variables i, ival, nDigits, nTrailingZeroes, significand, exponent |