Index: newlib/libm/common/s_lrint.c
===================================================================
RCS file: /cvs/src/src/newlib/libm/common/s_lrint.c,v
retrieving revision 1.1
diff -p -u -B -b -r1.1 s_lrint.c
--- newlib/libm/common/s_lrint.c	7 Jun 2002 21:59:56 -0000	1.1
+++ newlib/libm/common/s_lrint.c	26 Jun 2005 15:02:26 -0000
@@ -54,7 +54,11 @@ TWO52[2]={
   long int result;
   
   EXTRACT_WORDS(i0,i1,x);
+
+  /* Extract sign bit. */
   sx = (i0>>31)&1;
+
+  /* Extract exponent field. */
   j0 = ((i0 & 0x7ff00000) >> 20) - 1023;
   
   if(j0 < 20)
@@ -66,13 +70,17 @@ TWO52[2]={
           w = TWO52[sx] + x;
           t = w - TWO52[sx];
           GET_HIGH_WORD(i0, t);
+          /* Detect the all-zeros representation of plus and
+             minus zero, which fails the calculation below. */
+          if ((i0 & ~(1 << 31)) == 0)
+              return 0;
           j0 = ((i0 & 0x7ff00000) >> 20) - 1023;
           i0 &= 0x000fffff;
           i0 |= 0x00100000;
           result = i0 >> (20 - j0);
         }
     }
-  else if (j0 < (8 * sizeof (long int)) - 1)
+  else if (j0 < (int)(8 * sizeof (long int)) - 1)
     {
       if (j0 >= 52)
         result = ((long int) i0 << (j0 - 20)) | (i1 << (j0 - 52));
@@ -81,6 +89,10 @@ TWO52[2]={
           w = TWO52[sx] + x;
           t = w - TWO52[sx];
           EXTRACT_WORDS (i0, i1, t);
+          /* Detect the all-zeros representation of plus and
+             minus zero, which fails the calculation below. */
+          if (((i0 & ~(1 << 31)) | i1) == 0)
+              return 0;
           j0 = ((i0 & 0x7ff00000) >> 20) - 1023;
           i0 &= 0x000fffff;
           i0 |= 0x00100000;
Index: newlib/libm/common/sf_lrint.c
===================================================================
RCS file: /cvs/src/src/newlib/libm/common/sf_lrint.c,v
retrieving revision 1.1
diff -p -u -B -b -r1.1 sf_lrint.c
--- newlib/libm/common/sf_lrint.c	7 Jun 2002 21:59:56 -0000	1.1
+++ newlib/libm/common/sf_lrint.c	26 Jun 2005 15:02:26 -0000
@@ -28,6 +28,10 @@ static const float
 #else
 static float 
 #endif
+/* Adding a float, x, to 2^23 will cause the result to be rounded based on
+   the fractional part of x, according to the implementation's current rounding
+   mode.  2^23 is the smallest float that can be represented using all 23 significant
+   digits. */
 TWO23[2]={
   8.3886080000e+06, /* 0x4b000000 */
  -8.3886080000e+06, /* 0xcb000000 */
@@ -54,7 +58,7 @@ TWO23[2]={
   /* Extract exponent field. */
   j0 = ((i0 & 0x7f800000) >> 23) - 127;
   
-  if (j0 < (sizeof (long int) * 8) - 1)
+  if (j0 < (int)(sizeof (long int) * 8) - 1)
     {
       if (j0 < -1)
         return 0;
@@ -65,6 +69,10 @@ TWO23[2]={
           w = TWO23[sx] + x;
           t = w - TWO23[sx];
           GET_FLOAT_WORD (i0, t);
+          /* Detect the all-zeros representation of plus and
+             minus zero, which fails the calculation below. */
+          if ((i0 & ~(1 << 31)) == 0)
+              return 0;
           j0 = ((i0 >> 23) & 0xff) - 0x7f;
           i0 &= 0x7fffff;
           i0 |= 0x800000;