| commit | 145bccd2397b53f2163c37e73413d80bfcbb8e35 | [log] [tgz] |
|---|---|---|
| author | Michel Dänzer <michel.daenzer@amd.com> | Wed Mar 19 17:37:14 2014 +0900 |
| committer | Dave Airlie <airlied@redhat.com> | Fri Apr 04 10:12:21 2014 +1000 |
| tree | 2dd49386d2a4a2a500badc1f9dedc41c0c3d2b95 | |
| parent | 740c22ae516c22f07ac275713d684581df08a386 [diff] |
drm/mm: Fix search for smallest hole satisfying constraints entry->size is the size of the node, not the size of the hole after it. So the code would actually find the hole which can satisfy the constraints and which is preceded by the smallest node, not the smallest hole satisfying the constraints. Reported-by: "Huang, FrankR" <FrankR.Huang@amd.com> Signed-off-by: Michel Dänzer <michel.daenzer@amd.com> Signed-off-by: Dave Airlie <airlied@redhat.com>