On 08/02/2018 10:04 PM, Christian König wrote:
The kernel handles are dense and the kernel always tries to use the
lowest free id. Use this to implement a more efficient handle table
by using a resizeable array instead of a hash.
Signed-off-by: Christian König
---
amdgpu/Makefile.sources |
Applies to patch #1 and patch #3, should lockup not be lookup?
On 08/02/2018 09:04 AM, Christian König wrote:
> The kernel handles are dense and the kernel always tries to use the
> lowest free id. Use this to implement a more efficient handle table
> by using a resizeable array instead of a
On 2018-08-02 04:04 PM, Christian König wrote:
> The kernel handles are dense and the kernel always tries to use the
> lowest free id. Use this to implement a more efficient handle table
> by using a resizeable array instead of a hash.
>
> Signed-off-by: Christian König
>
> [...]
>
>
The kernel handles are dense and the kernel always tries to use the
lowest free id. Use this to implement a more efficient handle table
by using a resizeable array instead of a hash.
Signed-off-by: Christian König
---
amdgpu/Makefile.sources | 4 +++-
amdgpu/handle_table.c | 59
