rculist: allow reverse RCU traversal
[urcu.git] / urcu / rculist.h
index a177f20dbf67edab2e666051b7682700def6d7db..9a01dad2c8930f882763585d9ffc8f3c71e8d307 100644 (file)
@@ -35,9 +35,19 @@ void cds_list_add_rcu(struct cds_list_head *newp, struct cds_list_head *head)
 {
        newp->next = head->next;
        newp->prev = head;
-       cmm_smp_wmb();
-       head->next->prev = newp;
-       head->next = newp;
+       rcu_assign_pointer(head->next->prev, newp);
+       CMM_STORE_SHARED(head->next, newp);
+}
+
+/* Add new element at the tail of the list. */
+static inline
+void cds_list_add_tail_rcu(struct cds_list_head *newp,
+               struct cds_list_head *head)
+{
+       newp->next = head;
+       newp->prev = head->prev;
+       rcu_assign_pointer(head->prev->next, newp);
+       CMM_STORE_SHARED(head->prev, newp);
 }
 
 /*
@@ -51,15 +61,15 @@ void cds_list_replace_rcu(struct cds_list_head *old, struct cds_list_head *_new)
        _new->next = old->next;
        _new->prev = old->prev;
        rcu_assign_pointer(_new->prev->next, _new);
-       _new->next->prev = _new;
+       CMM_STORE_SHARED(_new->next->prev, _new);
 }
 
 /* Remove element from list. */
 static inline
 void cds_list_del_rcu(struct cds_list_head *elem)
 {
-       elem->next->prev = elem->prev;
-       elem->prev->next = elem->next;
+       CMM_STORE_SHARED(elem->next->prev, elem->prev);
+       CMM_STORE_SHARED(elem->prev->next, elem->next);
 }
 
 /*
This page took 0.025012 seconds and 4 git commands to generate.