drivers/md/dm-vdo/indexer/radix-sort.h

Source file repositories/reference/linux-study-clean/drivers/md/dm-vdo/indexer/radix-sort.h

File Facts

System
Linux kernel
Corpus path
drivers/md/dm-vdo/indexer/radix-sort.h
Extension
.h
Size
797 bytes
Lines
27
Domain
Driver Families
Bucket
drivers/md
Inferred role
Driver Families: implementation source
Status
source implementation candidate

Why This File Exists

Repeatable hardware-adapter layer. Deep compatibility for every driver is out of scope; this atlas records patterns, probe lifecycles, bus glue, IRQ/DMA usage, and links back to core abstractions.

Dependency Surface

Detected Declarations

Annotated Snippet

#ifndef UDS_RADIX_SORT_H
#define UDS_RADIX_SORT_H

/*
 * Radix sort is implemented using an American Flag sort, an unstable, in-place 8-bit radix
 * exchange sort. This is adapted from the algorithm in the paper by Peter M. McIlroy, Keith
 * Bostic, and M. Douglas McIlroy, "Engineering Radix Sort".
 *
 * http://www.usenix.org/publications/compsystems/1993/win_mcilroy.pdf
 */

struct radix_sorter;

int __must_check uds_make_radix_sorter(unsigned int count, struct radix_sorter **sorter);

void uds_free_radix_sorter(struct radix_sorter *sorter);

int __must_check uds_radix_sort(struct radix_sorter *sorter, const unsigned char *keys[],
				unsigned int count, unsigned short length);

#endif /* UDS_RADIX_SORT_H */

Annotation

Implementation Notes