Latest revision as of 10:34, 24 July 2011

Description

Symbol resolution for loading kernel modules can take a long time,
since the current symbol lookup mechanism in the kernel is a linear
lookup.

Various projects have demonstrated improved symbol resolution time
for kernel modules, using either binary trees or hash tables. Each
approach has its pros and cons, but as of January 2010 neither approach
has been mainlined.

This project would consist of mainlining one of these approaches to
reducing symbol resolution time for kernel loadable modules.