Raise the number of nested readers limit 2^16 and 2^32 on 32 and 64-bits arch.

[urcu.git] / urcu.c

diff --git a/urcu.c b/urcu.c
index 31cdf6fc08b61c14e0a8f47d93154c0d54599ccc..5514b278e4322b0f600a6d3427eab700057dc573 100644 (file)
--- a/urcu.c
+++ b/urcu.c
@@ -142,40 +142,6 @@ void synchronize_rcu(void)
 {
        debug_yield_write();
        internal_urcu_lock();
-       debug_yield_write();
-       switch_qparity();
-       debug_yield_write();
-       switch_qparity();
-       debug_yield_write();
-       internal_urcu_lock();
-       debug_yield_write();
-}
-
-/*
- * Return old pointer, OK to free, no more reference exist.
- * Called under rcu_write_lock.
- */
-void *urcu_publish_content(void **ptr, void *new)
-{
-       void *oldptr;
-
-       debug_yield_write();
-       internal_urcu_lock();
-       debug_yield_write();
-       /*
-        * We can publish the new pointer before we change the current qparity.
-        * Readers seeing the new pointer while being in the previous qparity
-        * window will make us wait until the end of the quiescent state before
-        * we release the unrelated memory area. However, given we hold the
-        * urcu_mutex, we are making sure that no further garbage collection can
-        * occur until we release the mutex, therefore we guarantee that this
-        * given reader will have completed its execution using the new pointer
-        * when the next quiescent state window will be over.
-        */
-       oldptr = *ptr;
-       debug_yield_write();
-       *ptr = new;
-
        debug_yield_write();
        switch_qparity();
        debug_yield_write();
@@ -183,8 +149,6 @@ void *urcu_publish_content(void **ptr, void *new)
        debug_yield_write();
        internal_urcu_unlock();
        debug_yield_write();
-
-       return oldptr;
 }
 
 void urcu_add_reader(pthread_t id)