X-Git-Url: http://git.sourceforge.jp/view?p=pf3gnuchains%2Fgcc-fork.git;a=blobdiff_plain;f=gcc%2Fpointer-set.c;h=266cccfef8aa2627f9321b3953b2a3fbd1a8e942;hp=b0f04ff3aa3d6927151641a8afaf7dd57433a81f;hb=82c07781b419f07a8100ca397c5b538ef932a0b5;hpb=dac49aa5c53ad15cdab5f898160dbe72708c98d3

diff --git a/gcc/pointer-set.c b/gcc/pointer-set.c
index b0f04ff3aa3..266cccfef8a 100644
--- a/gcc/pointer-set.c
+++ b/gcc/pointer-set.c
@@ -92,9 +92,7 @@ void pointer_set_destroy (struct pointer_set_t *pset)
 
 /* Returns nonzero if PSET contains P.  P must be nonnull.
 
-   Collisions are resolved by linear probing.  More complicated
-   collision management schemes are only useful when the load factor
-   significantly exceeds 0.5, and we never let that happen.  */
+   Collisions are resolved by linear probing.  */
 int
 pointer_set_contains (struct pointer_set_t *pset, void *p)
 {
@@ -103,15 +101,15 @@ pointer_set_contains (struct pointer_set_t *pset, void *p)
   while (true)
     {
       if (pset->slots[n] == p)
-	return 1;
+       return 1;
       else if (pset->slots[n] == 0)
-	return 0;
+       return 0;
       else
-	{
-	  ++n;
-	  if (n == pset->n_slots)
-	    n = 0;
-	}
+       {
+         ++n;
+         if (n == pset->n_slots)
+           n = 0;
+       }
     }
 }