Lines Matching full:hop

21  * searched, and one or more entries will "hop" into those neighborhoods. When this process works,
30  * with the increased memory burden for maintaining the hop vectors, less memory is needed to
38  * "no next hop" (i.e. NULL) as the natural initial value of zero, the offsets are biased by one
40  * entries with just 8+8=16 bits per entry. The hop list is sorted by hop offset so the first entry
62 #define NULL_HOP_OFFSET 0   /* the hop offset value terminating the hop list */
69  * tempting to encode the hop offsets separately and maintain alignment of key/value pairs, but
70  * it's crucial to keep the hop fields near the buckets that they use them so they'll tend to share
75 	 * @first_hop: The biased offset of the first entry in the hop list of the neighborhood
79 	/** @next_hop: The biased offset of the next bucket in the hop list. */
236  * dereference_hop() - Convert a biased hop offset within a neighborhood to a pointer to the bucket
239  * @hop_offset: The biased hop offset to the desired bucket.
254  * insert_in_hop_list() - Add a bucket into the hop list for the neighborhood.
256  * @new_bucket: The bucket to add to the hop list.
258  * The bucket is inserted it into the list so the hop list remains sorted by hop offset.
262 	/* Zero indicates a NULL hop offset, so bias the hop offset by one. */  in insert_in_hop_list()
274 	/* Search the hop list for the insertion point that maintains the sort order. */  in insert_in_hop_list()
311  * search_hop_list() - Search the hop list associated with given hash bucket for a given search
486 		 * We've found an entry in this neighborhood that we can "hop" further away, moving  in move_empty_bucket()
502 		/* Insert the filled hole into the hop list for the neighborhood. */  in move_empty_bucket()
572 			 * hash bucket to be referenced by its hop vector.  in find_or_make_vacancy()
691 	/* The victim bucket is now empty, but it still needs to be spliced out of the hop list. */  in vdo_int_map_remove()