Mainline fast symbol resolution for kernel module loading

From eLinux.org
Revision as of 03:34, 24 July 2011 by Abogani (Talk | contribs) (Mainlined)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Summary
Mainline fast symbol resolution for kernel module loading
Proposer
Tim Bird

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.

Related work

Status

Mainlined in v3.0
{"cc_re__cc_re__cc_by_sa_3_0": ["ion_for_kernel_module_loading&amp;action=info\" title=\"More information about this page\">Page information</a></li>\n\t\t\t\t\t\t\t\t\t\t\t</ul>\n\t\t\t\t\t\t\t</div>\n\t\t</div>\n\t\t\t\t</div>\n\t\t</div>\n\t\t<div id=\"footer\" role=\"contentinfo\">\n\t\t\t\t\t\t\t<ul id=\"footer-info\">\n\t\t\t\t\t\t\t\t\t\t\t<li id=\"footer-info-lastmod\"> This page was last modified on 24 July 2011, at 03:34.</li>\n\t\t\t\t\t\t\t\t\t\t\t<li id=\"footer-info-viewcount\">This page has been accessed 2,709 times.</li>\n\t\t\t\t\t\t\t\t\t\t\t<li id=\"footer-info-copyright\">Content is available under <a class=\"external\" rel=\"nofollow\" href=\"http://creativecommons.org/licenses/by-sa/3.0/\">a Creative Commons Attribution-ShareAlike 3.0 Unported License</a> unless otherwise noted.</li>\n\t\t\t\t\t\t\t\t\t</ul>\n\t\t\t\t\t\t\t<ul id=\"footer-places\">\n\t\t\t\t\t\t\t\t\t\t\t<li id=\"footer-places-privacy\"><a href=\"/eLinux.org:Privacy_policy\" title=\"eLinux.org:Privacy policy\">Privacy policy</a></li>\n\t\t\t\t\t\t\t\t\t\t\t<li id=\"footer-places-about\"><a href=\"/eLinux.org:About\" title=\"eLinux.org:About\">About eLinux.org</a></li>\n\t\t\t\t\t\t\t\t\t\t\t<li id=\"footer-places-disclaimer\"><a href=\"/eLinux.org:General_disclaimer\" title=\"eLinux.or", "oter-places-privacy\"><a href=\"/eLinux.org:Privacy_policy\" title=\"eLinux.org:Privacy policy\">Privacy policy</a></li>\n\t\t\t\t\t\t\t\t\t\t\t<li id=\"footer-places-about\"><a href=\"/eLinux.org:About\" title=\"eLinux.org:About\">About eLinux.org</a></li>\n\t\t\t\t\t\t\t\t\t\t\t<li id=\"footer-places-disclaimer\"><a href=\"/eLinux.org:General_disclaimer\" title=\"eLinux.org:General disclaimer\">Disclaimers</a></li>\n\t\t\t\t\t\t\t\t\t</ul>\n\t\t\t\t\t\t\t\t\t\t<ul id=\"footer-icons\" class=\"noprint\">\n\t\t\t\t\t\t\t\t\t\t\t<li id=\"footer-copyrightico\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"http://creativecommons.org/licenses/by-sa/3.0/\"><img src=\"http://i.creativecommons.org/l/by-sa/3.0/88x31.png\" alt=\"a Creative Commons Attribution-ShareAlike 3.0 Unported License\" width=\"88\" height=\"31\" /></a>\n\t\t\t\t\t\t\t\t\t\t\t\t\t</li>\n\t\t\t\t\t\t\t\t\t\t\t<li id=\"footer-poweredbyico\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<a href=\"//www.mediawiki.org/\"><img src=\"/resources/assets/poweredby_mediawiki_88x31.png\" alt=\"Powered by MediaWiki\" srcset=\"/resources/assets/poweredby_mediawiki_132x47.png 1.5x, /resources/assets/poweredby_mediawiki_176x62.png 2x\" width=\"88\" height=\"31\" /></a>\n\t"], "copyright__copyright__copyright": ["ules can take a long time, since the current symbol lookup mechanism in the kernel is a linear lookup.\n\nVarious 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.\n\nThis project would consist of mainlining one of these approaches to reducing symbol resolution time for kernel loadable modules.\n\nRelated work\n\nStatus\n\nMainlined in v3.0", "ules can take a long time, since the current symbol lookup mechanism in the kernel is a linear lookup.\n\nVarious 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.\n\nThis project would consist of mainlining one of these approaches to reducing symbol resolution time for kernel loadable modules.\n\nRelated work\n\nStatus\n\nMainlined in v3.0", "ules can take a long time, since the current symbol lookup mechanism in the kernel is a linear lookup.\n\nVarious 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.\n\nThis project would consist of mainlining one of these approaches to reducing symbol resolution time for kernel loadable modules.\n\nRelated work\n\nStatus\n\nMainlined in v3.0"]}