在用户空间编程使用linux内核链表list，hlist宏定义和操作

pilgrim_kevin

学习。

hxqhit

  挺好滴，我现在应用层链表就是用了list

不过最近在学习glib里面的数据结构实现也挺好的～～

hxqhit

Memory chunks
  Doubly-linked lists
  Singly-linked lists
  Hash tables
  Strings (which can grow dynamically)
  String chunks (groups of strings)
  Arrays (which can grow in size as elements are added)
  Balanced binary trees
  N-ary trees
  Quarks (a two-way association of a string and a unique integer identifier)
  Keyed data lists (lists of data elements accessible by a string or integer id)
  Relations and tuples (tables of data which can be indexed on any number of fields)
  Caches
这些常规的数据结构都有相关的API，在应用层开发还是挺方便的