加入收藏 | 设为首页 | 会员中心 | 我要投稿 安卓应用网 (https://www.0791zz.com/)- 科技、建站、经验、云计算、5G、大数据,站长网!
当前位置: 首页 > 综合聚焦 > 服务器 > Linux > 正文

Basic Data Structures and Algorithms in the Linux Kernel--re

发布时间:2020-05-24 08:09:39 所属栏目:Linux 来源:互联网
导读:http://luisbg.blogalia.com/historias/74062Thanks toVijay DSilvasbrilliant answerincstheory

http://luisbg.blogalia.com/historias/74062

Links based on:
    • ,,.
    • with comments telling you what you can't find in the textbooks.
    • used for,,etc.
    • areare used for scheduling,virtual memory management,to track file descriptors and directory entries,etc.
    • .
    • ,are used for,NFS related lookups and networking related functionality.
    • ,which is literally,a textbook implementation,used in the.
    • ,with a reference to Knuth and to a paper.
    • Some parts of the code,such as,implement their own hash function.
    • used to implement,,etc.
    • ,which are used for dealing with flags,interrupts,etc. and are featured in Knuth Vol. 4.
    • and.
    • is used for,,etc.
    • .
    • and variant used in.
    • is used to check correctness of locking at runtime.
    • on linked lists is used for,,etc.
    • is amazingly implemented too,in a driver library.
    • .
    • with references and recommendations for when to prefer the alternative.

<div align="right"><a href="http://luisbg.blogalia.com/historias/74062#comentarios"&gt;7 Comentarios

URL de trackback de esta historia http://luisbg.blogalia.com//trackbacks/74062

(编辑:安卓应用网)

【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容!

    推荐文章
      热点阅读