aboutsummaryrefslogtreecommitdiff
path: root/gcc/pointer-set.c
diff options
context:
space:
mode:
Diffstat (limited to 'gcc/pointer-set.c')
-rw-r--r--gcc/pointer-set.c14
1 files changed, 7 insertions, 7 deletions
diff --git a/gcc/pointer-set.c b/gcc/pointer-set.c
index b7154de..b0f04ff 100644
--- a/gcc/pointer-set.c
+++ b/gcc/pointer-set.c
@@ -51,7 +51,7 @@ struct pointer_set_t
We don't need to do anything special for full-width multiplication
because we're only interested in the least significant word of the
- product, and unsigned arithmetic in C is modulo the word size. */
+ product, and unsigned arithmetic in C is modulo the word size. */
static inline size_t
hash1 (const void *p, unsigned long max, unsigned long logmax)
@@ -69,7 +69,7 @@ hash1 (const void *p, unsigned long max, unsigned long logmax)
return ((A * (unsigned long) p) >> shift) & (max - 1);
}
-/* Allocate an empty pointer set. */
+/* Allocate an empty pointer set. */
struct pointer_set_t *
pointer_set_create (void)
{
@@ -83,7 +83,7 @@ pointer_set_create (void)
return result;
}
-/* Reclaims all memory associated with PSET. */
+/* Reclaims all memory associated with PSET. */
void pointer_set_destroy (struct pointer_set_t *pset)
{
XDELETEVEC (pset->slots);
@@ -94,7 +94,7 @@ void pointer_set_destroy (struct pointer_set_t *pset)
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. */
+ significantly exceeds 0.5, and we never let that happen. */
int
pointer_set_contains (struct pointer_set_t *pset, void *p)
{
@@ -117,7 +117,7 @@ pointer_set_contains (struct pointer_set_t *pset, void *p)
/* Subroutine of pointer_set_insert. Inserts P into an empty
element of SLOTS, an array of length N_SLOTS. Returns nonzero
- if P was already present in N_SLOTS. */
+ if P was already present in N_SLOTS. */
static int
insert_aux (void *p, void **slots, size_t n_slots, size_t log_slots)
{
@@ -141,7 +141,7 @@ insert_aux (void *p, void **slots, size_t n_slots, size_t log_slots)
}
/* Inserts P into PSET if it wasn't already there. Returns nonzero
- if it was already there. P must be nonnull. */
+ if it was already there. P must be nonnull. */
int
pointer_set_insert (struct pointer_set_t *pset, void *p)
{
@@ -149,7 +149,7 @@ pointer_set_insert (struct pointer_set_t *pset, void *p)
return 1;
/* We've inserted a new element. Expand the table if necessary to keep
- the load factor small. */
+ the load factor small. */
++pset->n_elements;
if (pset->n_elements > pset->n_slots / 4)
{