diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-10-22 17:05:11 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-10-22 17:05:11 +0000 |
| commit | dac49aa5c53ad15cdab5f898160dbe72708c98d3 (patch) | |
| tree | 78237ea08ce69e2e4f29b80e8bf73c2c708305a4 /gcc/pointer-set.c | |
| parent | e1cc2b2778f70e065dbe4189d50399c926a6221c (diff) | |
| download | gcc-dac49aa5c53ad15cdab5f898160dbe72708c98d3.tar.gz | |
* alias.c, basic-block.h, cgraphunit.c, combine.c, domwalk.h,
final.c, gengtype.c, genpreds.c, ggc-page.c, insn-notes.def,
lambda-code.c, loop-unroll.c, modulo-sched.c, pointer-set.c,
pretty-print.c, ra-colorize.c, sbitmap.c, tree-complex.c,
tree-data-ref.c, tree-dfa.c, tree-inline.c, tree-into-ssa.c,
tree-scalar-evolution.c, tree-ssa-dom.c,
tree-ssa-loop-manip.c, tree-ssa-loop-niter.c,
tree-ssa-phiopt.c, tree-ssa-pre.c, tree-ssa-threadupdate.c,
tree-vectorizer.c, vec.h: Fix comment formatting.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@89453 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/pointer-set.c')
| -rw-r--r-- | gcc/pointer-set.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/gcc/pointer-set.c b/gcc/pointer-set.c index b7154deabd1..b0f04ff3aa3 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) { |