Right you are; I should have measured. Though if speed's the deal, the following code should be faster than the other options mentioned, as it should avoid both conditional branches and compilers' overoptimizations.
return (t + (t < 0)) / 1000000000 - (t < 0);
