skipList是LevelDB的memtable实际采用的数据结构.其原理可以自行google
SkipList应用概率保持平衡,可以用来替代平衡树,优点是实现简单。这里每个链表从小到大排列,height=0是所有节点的链表,height越高,链表节点越稀少。
几个tips:
i) 使用内存池和placement new操作内存:
template<typename Key, class Comparator>
typename SkipList<Key,Comparator>::Node*
SkipList<Key,Comparator>::NewNode(const Key& key, int height) {
char* mem = arena_->AllocateAligned(
sizeof(Node) + sizeof(port::AtomicPointer) * (height - 1));
return new (mem) Node(key);
}
ii)memory barrier。
在SkipList的实现中,内部并没有使用到锁,只是用到了AtomicPointer。AtomicPointer可以保存一个void*,利用了memory barrier来实现同步。(似乎说mutex已经带了mb的操作,但是对单个int或者位的操作,不必用到mutex,用mb可以更快?)
inline void MemoryBarrier() {
// See http://gcc.gnu.org/ml/gcc/2003-04/msg01180.html for a discussion on
// this idiom. Also see http://en.wikipedia.org/wiki/Memory_ordering.
__asm__ __volatile__("" : : : "memory");
}
Acquire_Load(){void* result = rep_; MemoryBarrier();return result;}
Release_Store(void* v){MemoryBarrier();rep_ = v;}
An operation has acquire semantics if other processors will always see its effect before any subsequent operation's effect. An operation has release semantics if other processors will see every preceding operation's effect before the effect of the operation itself.
acquire保证其他线程先看到执行当前命令,而后执行后续指令;release保证其他线程先看到其他前序指令执行,而后执行当前指令
在强内存模型下,(X86-64,AMD64的内存模型都是强内存模型)volatile关键字声明的变量已经具备load acquire和store release的功能了,但在其他如安腾等是弱内存模型,需要另外的实现
参考:http://duanple.blog.163.com/blog/static/70971767201242491334104/