mem: reduce memory fragmentation
Status from this message: Applied, thanks
Get series with b4
b4 am [email protected]Versions newest first
Patches in v1 Applied
| # | Subject and files | Size | Replies | Applied |
|---|---|---|---|---|
| 1/9 | fbarray: fix errno values returned from functionslib/ | +2 | 0 replies | |
| 2/9 | fbarray: reduce duplication in find_contig codelib/ | +28 | 0 replies | |
| 3/9 | fbarray: reduce duplication in find_next_n codelib/ | +36 | 0 replies | |
| 4/9 | fbarray: reduce duplication in find_next codelib/ | +29 | 0 replies | |
| 5/9 | fbarray: add reverse find_free/usedlib/ lib/ lib/ | +109 | 0 replies | |
| 6/9 | fbarray: add reverse find n used/freelib/ lib/ lib/ | +237 | 0 replies | |
| 7/9 | fbarray: add reverse find contig used/freelib/ lib/ lib/ | +122 | 0 replies | |
| 8/9 | test: add fbarray autoteststest/ test/ | +577 | 0 replies | |
| 9/9 | memalloc: allocate memory in reverselib/ | +2 | 2 replies |
Reviews trailers per patch
No Reviewed-by, Acked-by or Tested-by trailers for v1 yet.
Cover letter [PATCH 0/9] mem: reduce memory fragmentation
This patchset is mostly dealing with changes fbarray, but it is actually about reducing fragmentation in Linuxapp memalloc.
We allocate hugepages from lower VA to higher VA. However, our malloc heap allocates addresses from higher VA to lower VA. This results in a situation where, whenever new page is allocated, malloc starts to allocate memory from the top, leaving fragmented space between new allocation's leftover and previous leftover.
Over time, this leads to lots of free elements sitting at page boundaries, small enough to be useful but large enough to have an impact on memory fragmentation in certain circumstances.
To fix this, we need to allocate memory from higher VA first. However, in order to do that, we need the ability to search fbarray in reverse, which is currently not supported. Adding this support is what most of this patchset is about.
First 4 patches fix some issues in existing fbarray implementation and remove some code duplication, preparing for adding of new functionality.
Next 3 patches add new functionality - reverse search of used/free slots, mirroring already existing functionality in semantics and capable of returning identical results but in reverse order.
Patch 8 adds unit tests for fbarray, testing both existing and new functionality.
Finally, patch 9 changes memalloc to look up free slots in memseg list in reverse order. No other changes is necessary, as all other code can handle segments, wherever they are allocated.
Anatoly Burakov (9):
fbarray: fix errno values returned from functions
fbarray: reduce duplication in find_contig code
fbarray: reduce duplication in find_next_n code
fbarray: reduce duplication in find_next code
fbarray: add reverse find_free/used
fbarray: add reverse find n used/free
fbarray: add reverse find contig used/free
test: add fbarray autotests
memalloc: allocate memory in reverse
lib/librte_eal/common/eal_common_fbarray.c | 493 ++++++++++++++--- lib/librte_eal/common/include/rte_fbarray.h | 114 ++++ lib/librte_eal/linuxapp/eal/eal_memalloc.c | 3 +- lib/librte_eal/rte_eal_version.map | 6 + test/test/Makefile | 1 + test/test/test_fbarray.c | 576 ++++++++++++++++++++ 6 files changed, 1119 insertions(+), 74 deletions(-) create mode 100644 test/test/test_fbarray.c
Signature · 1 line
2.17.1