Lines Matching defs:cell
116 The above means that all the cells (each cell containing a key and
118 of each cell is determined by the hash value of its key and the
121 second is stored in the first unoccupied cell that follows it.
131 Collisions complicate deletion because simply clearing a cell
134 "tombstone" marker instead of clearing the cell, and another is to
148 struct cell {
160 struct cell *cells; /* contiguous array of cells. */
171 a cell is empty. It is unaligned and therefore illegal as a
187 /* Whether the cell C is occupied (non-empty). */
190 /* Clear the cell C, i.e. mark it as empty (unoccupied). */
193 /* "Next" cell is the cell following C, but wrapping back to CELLS
198 an empty cell is encountered. */
295 ht->cells = xnew_array (struct cell, ht->size);
299 memset (ht->cells, INVALID_PTR_CHAR, size * sizeof (struct cell));
315 /* The heart of most functions in this file -- find the cell whose
316 KEY is equal to key, using linear probing. Returns the cell
317 that matches KEY, or the first empty cell if none matches. */
319 static inline struct cell *
322 struct cell *cells = ht->cells;
324 struct cell *c = cells + HASH_POSITION (key, ht->hash_function, size);
343 struct cell *c = find_cell (ht, key);
357 struct cell *c = find_cell (ht, lookup_key);
375 struct cell *c = find_cell (ht, key);
386 struct cell *old_cells = ht->cells;
387 struct cell *old_end = ht->cells + ht->size;
388 struct cell *c, *cells;
402 cells = xnew_array (struct cell, newsize);
403 memset (cells, INVALID_PTR_CHAR, newsize * sizeof (struct cell));
409 struct cell *new_c;
428 struct cell *c = find_cell (ht, key);
457 struct cell *c = find_cell (ht, key);
463 struct cell *cells = ht->cells;
478 struct cell *c_new;
484 /* The cell C (key2) is already where we want it (in
505 memset (ht->cells, INVALID_PTR_CHAR, ht->size * sizeof (struct cell));
524 struct cell *c = ht->cells;
525 struct cell *end = ht->cells + ht->size;
570 struct cell *c = iter->pos;
571 struct cell *end = iter->end;