dm-vdo/indexer/index.c

14 #include "sparse-cache.h"
24  * is sparse, the index will search the sparse cache.
27  * chapter writer, and sparse cache barrier messages for the sparse cache.
42  * The sparse cache relies on having the same set of chapter indexes available to all zones. When a
43  * request wants to add a chapter to the sparse cache, it sends a barrier message to each zone
46  * can proceed. More details can be found in the sparse cache documentation.
48  * If a sparse cache has only one zone, it will not create a triage queue, but it still needs the
49  * barrier message to change the sparse cache membership, so the index simulates the message by
120  * Determine whether this request should trigger a sparse cache barrier message to change the
121  * membership of the sparse cache. If a change in membership is desired, the function returns the
147  * Simulate a message to change the sparse cache membership for a single-zone sparse index. This
148  * allows us to forgo the complicated locking required by a multi-zone sparse index. Any other kind
469 		 * name is in a cached sparse chapter. If we found the name on
496 		 * be done both for new records, and for records from cached sparse chapters.
663 	/* The triage queue is only needed for sparse multi-zone indexes. */
877 		 * This entry will be in a sparse chapter after the rebuild completes, and it is
933 		 * done regardless of whether we are a brand new record or a sparse record, i.e.
934 		 * one that doesn't exist in the index but does on disk, since for a sparse record,
974 static int replay_chapter(struct uds_index *index, u64 virtual, bool sparse)
1018 			result = replay_record(index, &name, virtual, sparse);
1043 	 * in order, skipping non-hooks in chapters which will be sparse to save time.