Bug 17531 - (arch_)get_unmapped_area can be terribly slow due to unnecessary linear search and find_vma
(arch_)get_unmapped_area can be terribly slow due to unnecessary linear searc...
Status: RESOLVED INVALID
Product: Memory Management
Classification: Unclassified
Component: Other
All Linux
: P1 normal
Assigned To: Andrew Morton
:
Depends on:
Blocks:
  Show dependency treegraph
 
Reported: 2010-08-30 20:50 UTC by Luca Barbieri
Modified: 2012-08-13 16:04 UTC (History)
2 users (show)

See Also:
Kernel Version: 2.6.35
Tree: Mainline
Regression: No


Attachments

Description Luca Barbieri 2010-08-30 20:50:09 UTC
Currently most/all versions of get_unmapped_area perform a linear search in the process virtual address space to find free space.

Some, like arch_get_unmapped_area_topdown for x86-64 even call find_vma for each step, which does a full walk on the rb-tree of vmas.

Instead, they should use, from slower to faster:
- O(n) but faster: a linked list of virtual address space holes
- O(log(n)): an rb-tree of virtual address space holes indexed by size
- O(1): a buddy allocator of virtual address space holes, or another scheme with buckets

Is there any reason this issue hasn't been fixed yet? (i.e. any reason none of the proposed schemes are feasible?)

Workloads doing a lot of mmaps tend to suffer greatly, especially on the versions that do a find_vma for each step of the scan.

An example are OpenGL drivers using DRM/GEM/TTM who don't employ userspace caching and suballocation of TTM allocated buffers.

Note You need to log in before you can comment on or make changes to this bug.