(Somebody should double-check this answer, especially border cases and the rounding of negative values. Also, I wrote it for round-to-nearest. To reproduce C’s conversion, this should be changed to round-toward-zero.)
Essentially, the process is:
Separate the 32 bits into one sign bit (s), eight exponent bits (e), and 23 significand bits (f). We will treat these as twos-complement integers.
If e is 255, the floating-point object is either infinity (if f is zero) or a NaN (otherwise). In this case, the conversion cannot be performed, and an error should be reported.
Otherwise, if e is not zero, add 224 to f. (If e is not zero, the significand implicitly has a 1 bit at its front. Adding 224 makes that bit explicit in f.)
Subtract 127 from e. (This converts the exponent from its biased/encoded form to the actual exponent. If we were doing a general conversion to any value, we would have to handle the special case when e is zero: Subtract 126 instead of 127. But, since we are only converting to an integer result, we can neglect this case, as long as the integer result is zero for these tiny input numbers.)
If s is 0 (the sign is positive) and e is 31 or more, then the value overflows a signed 32-bit integer (it is 231 or larger). The conversion cannot be performed, and an error should be reported.
If s is 1 (the sign is negative) and e is more than 31, then the value overflows a signed 32-bit integer (it is less than or equal to -232). If s is one, e is 32, and f is greater than 224 (any of the original significand bits were set), then the value overflows a signed 32-bit integer (it is less than -231; if the original f were zero, it would be exactly -231, which does not overflow). In any of these cases, the conversion cannot be performed, and an error should be reported.
Now we have an s, an e, and an f for a value which does not overflow, so we can prepare the final value.
If s is 1, set f to -f.
The exponent value is for a significand between 1 (inclusive) and 2 (exclusive), but our significand starts with a bit at 224. So we have to adjust for that. If e is 24, our significand is correct, and we are done, so return f as the result. If e is greater than 24 or less than 24, we have to shift the significand appropriately. Also, if we are going to shift f right, we may have to round it, to get a result rounded to the nearest integer.
If e is greater than 24, shift f left e-24 bits. Return f as the result.
If e is less than -1, the floating-point number is between -½ and ½, exclusive. Return 0 as the result.
Otherwise, we will shift f right 24-e bits. However, we will first save the bits we need for rounding. Set r to the result of casting f to an unsigned 32-bit integer and shifting it left by 32-(24-e) bits (equivalently, left by 8+e bits). This takes the bits that will be shifted out of f (below) and “left adjusts” them in the 32 bits, so we have a fixed position where they start.
Shift f right 24-e bits.
If r is less than 231, do nothing (this is rounding down; the shift truncated bits). If r is greater than 231, add one to f (this is rounding up). If r equals 231, add the low bit of f to f. (If f is odd, add one to f. Of the two equally near values, this rounds to the even value.) Return f.
2.03e1
to20
[by rounding] as the(int)2.03e1
cast will. – Basile Starynkevitch