Lines Matching defs:cells
116 The above means that all the cells (each cell containing a key and
135 recalculate the positions of adjacent cells. We take the latter
160 struct cell *cells; /* contiguous array of cells. */
173 used to initialize the entire cells array as empty.
195 #define NEXT_CELL(c, cells, size) (c != cells + (size - 1) ? c + 1 : cells)
197 /* Loop over occupied cells starting at C, terminating the loop when
199 #define FOREACH_OCCUPIED_ADJACENT(c, cells, size) \
200 for (; CELL_OCCUPIED (c); c = NEXT_CELL (c, cells, size))
295 ht->cells = xnew_array (struct cell, ht->size);
297 /* Mark cells as empty. We use 0xff rather than 0 to mark empty
299 memset (ht->cells, INVALID_PTR_CHAR, size * sizeof (struct cell));
311 xfree (ht->cells);
322 struct cell *cells = ht->cells;
324 struct cell *c = cells + HASH_POSITION (key, ht->hash_function, size);
327 FOREACH_OCCUPIED_ADJACENT (c, cells, size)
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));
404 ht->cells = cells;
413 new_c = cells + HASH_POSITION (c->key, hasher, newsize);
414 FOREACH_OCCUPIED_ADJACENT (new_c, cells, newsize)
463 struct cell *cells = ht->cells;
474 c = NEXT_CELL (c, cells, size);
475 FOREACH_OCCUPIED_ADJACENT (c, cells, size)
481 c_new = cells + HASH_POSITION (key2, hasher, size);
482 FOREACH_OCCUPIED_ADJACENT (c_new, cells, size)
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;
535 /* hash_table_remove might have moved the adjacent cells. */
554 iter->pos = ht->cells;
555 iter->end = ht->cells + ht->size;