/******************************************************************************
* bst_lock_fraser.c
- *
+ *
* Lock-free binary serach trees (BSTs), based on per-node spinlocks.
* Uses threaded tree presentation as described in my PhD dissertation:
* "Practical Lock-Freedom", University of Cambridge, 2003.
new->k = k;
new->v = v;
}
-
+
LOCK(p, qp, P_LOCKED);
-
+
if ( p->k < k )
{
if ( (p->r != n) || (UNTHREAD(n)->k < k) ) goto retry;