1 <= rne(x) <= max(u.ulevel/3,5) */
| 189 | |
| 190 | /* 1 <= rne(x) <= max(u.ulevel/3,5) */ |
| 191 | int |
| 192 | rne(int x) |
| 193 | { |
| 194 | int tmp, utmp; |
| 195 | |
| 196 | utmp = (u.ulevel < 15) ? 5 : u.ulevel / 3; |
| 197 | tmp = 1; |
| 198 | while (tmp < utmp && !rn2(x)) |
| 199 | tmp++; |
| 200 | return tmp; |
| 201 | |
| 202 | /* was: |
| 203 | * tmp = 1; |
| 204 | * while (!rn2(x)) |
| 205 | * tmp++; |
| 206 | * return min(tmp, (u.ulevel < 15) ? 5 : u.ulevel / 3); |
| 207 | * which is clearer but less efficient and stands a vanishingly |
| 208 | * small chance of overflowing tmp |
| 209 | */ |
| 210 | } |
| 211 | |
| 212 | /* rnz: everyone's favorite! */ |
| 213 | int |
no test coverage detected