lib: Introduce priority array area manager

This introduces a infrastructure for management of linear priority
areas. Priority order in an array matters, however order of items inside
a priority group does not matter.

As an initial implementation, L-sort algorithm is used. It is quite
trivial. More advanced algorithm called P-sort will be introduced as a
follow-up. The infrastructure is prepared for other algos.

Alongside this, a testing module is introduced as well.

Signed-off-by: Jiri Pirko <jiri@mellanox.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
This commit is contained in:
Jiri Pirko 2017-02-03 10:29:06 +01:00 committed by David S. Miller
parent b862815c3e
commit 44091d29f2
7 changed files with 871 additions and 0 deletions

View file

@ -1826,6 +1826,16 @@ config TEST_HASH
This is intended to help people writing architecture-specific
optimized versions. If unsure, say N.
config TEST_PARMAN
tristate "Perform selftest on priority array manager"
default n
depends on PARMAN
help
Enable this option to test priority array manager on boot
(or module load).
If unsure, say N.
endmenu # runtime tests
config PROVIDE_OHCI1394_DMA_INIT