| commit | 9e24d0c54b162b443e3e144740deb0e1d5f8760b | [log] [tgz] |
|---|---|---|
| author | Chris Wilson <chris@chris-wilson.co.uk> | Thu Sep 22 14:44:50 2016 +0100 |
| committer | Chris Wilson <chris@chris-wilson.co.uk> | Sat Oct 22 09:32:54 2016 +0100 |
| tree | c073704460fd30a0c9b41c7f12a411c02f500d93 | |
| parent | 455e9b491723b89b19b6efc6590fc9c5558f7858 [diff] |
intel: Migrate handle/name lookups from linear lists to hashtables Walking a linear list to find a matching PRIME handle or flinked name does not scale and becomes a major burden with just a few objects. That said, the fixed size hash is not much better, it just buckets the look into a few separate chains rather than one long one. References: https://bugs.freedesktop.org/show_bug.cgi?id=94631 Signed-off-by: Chris Wilson <chris@chris-wilson.co.uk>