Lines Matching defs:hole

443  * @hole: The empty bucket to fill with an entry that precedes it in one of its enclosing
450  * Return: The bucket that was vacated by moving its entry to the provided hole, or NULL if no
453 static struct bucket *move_empty_bucket(struct bucket *hole)
458 	 * arithmetic since this function is only called when hole is at least NEIGHBORHOOD cells
463 	for (bucket = &hole[1 - NEIGHBORHOOD]; bucket < hole; bucket++) {
479 		 * Skip this bucket if its first entry is actually further away than the hole that
482 		if (hole < new_hole)
487 		 * the hole closer to the hash bucket, if not all the way into its neighborhood.
491 		 * The entry that will be the new hole is the first bucket in the list, so setting
497 		/* Move the entry into the original hole. */
498 		hole->key = new_hole->key;
499 		hole->value = new_hole->value;
502 		/* Insert the filled hole into the hop list for the neighborhood. */
503 		insert_in_hop_list(bucket, hole);
507 	/* We couldn't find an entry to relocate to the hole. */
560 	struct bucket *hole = find_empty_bucket(map, neighborhood, MAX_PROBES);
566 	while (hole != NULL) {
567 		int distance = hole - neighborhood;
574 			return hole;
581 		hole = move_empty_bucket(hole);