Searched hist:"44091 d29f2075972aede47ef17e1e70db3d51190" (Results 1 – 7 of 7) sorted by relevance
/openbmc/linux/include/linux/ |
H A D | parman.h | 44091d29f2075972aede47ef17e1e70db3d51190 Fri Feb 03 03:29:06 CST 2017 Jiri Pirko <jiri@mellanox.com> 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>
|
/openbmc/linux/lib/ |
H A D | test_parman.c | 44091d29f2075972aede47ef17e1e70db3d51190 Fri Feb 03 03:29:06 CST 2017 Jiri Pirko <jiri@mellanox.com> 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>
|
H A D | parman.c | 44091d29f2075972aede47ef17e1e70db3d51190 Fri Feb 03 03:29:06 CST 2017 Jiri Pirko <jiri@mellanox.com> 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>
|
H A D | Kconfig | 44091d29f2075972aede47ef17e1e70db3d51190 Fri Feb 03 03:29:06 CST 2017 Jiri Pirko <jiri@mellanox.com> 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>
|
H A D | Makefile | 44091d29f2075972aede47ef17e1e70db3d51190 Fri Feb 03 03:29:06 CST 2017 Jiri Pirko <jiri@mellanox.com> 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>
|
H A D | Kconfig.debug | 44091d29f2075972aede47ef17e1e70db3d51190 Fri Feb 03 03:29:06 CST 2017 Jiri Pirko <jiri@mellanox.com> 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>
|
/openbmc/linux/ |
H A D | MAINTAINERS | 44091d29f2075972aede47ef17e1e70db3d51190 Fri Feb 03 03:29:06 CST 2017 Jiri Pirko <jiri@mellanox.com> 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>
|