artemist/mes
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

ntoab: Simplify LONG_MIN case.

Browse source 
* lib/mes/ntoab.c (ntoab): Simplify LONG_MIN case.

Co-Authored-By: Nathalie Kopaczewski <natkopa@gmail.com>
This commit is contained in:
Danny Milosavljevic 2020-06-17 00:21:57 +02:00
parent aaa174382e
commit 821d1b8fe9
No known key found for this signature in database
GPG key ID: E71A35542C30BAA5
1 changed files with 3 additions and 20 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

23
lib/mes/ntoab.c
View file

@ -38,26 +38,9 @@ ntoab (long x, int base, int signed_p)
if (signed_p && x < 0)
{
sign_p = 1;
if (x == LONG_MIN)
{
/* Cannot do u = (-x), so avoid it. */
long i;
if (base == 10)
return XSTR(LONG_MIN);
/* We cause the same result as
i = (-x) % base
u = (-x) / base
would in mathematics if x and base were integers.
It will be the case that -base < x <= 0 after the loop.
Because base > 1, the quotient will definitely fit into u.
i will contain the last digit to print. */
for (u = 0; x <= -base; x += base, ++u)
;
i = -x;
*p-- = i > 9 ? 'a' + i - 10 : '0' + i;
}
else
u = -x;
/* Avoid LONG_MIN */
u = (unsigned long) (-(x + 1));
++u;
}
else
u = x;