#include <urcu/urcu_ref.h>
#include <assert.h>
+#ifdef __cplusplus
+extern "C" {
+#endif
+
#if (!defined(_GNU_SOURCE) && !defined(_LGPL_SOURCE))
#error "Dynamic loader LGPL wrappers not implemented yet"
#endif
}
}
+#ifdef __cplusplus
+}
+#endif
+
#endif /* _URCU_RCULFQUEUE_H */
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
+#ifdef __cplusplus
+extern "C" {
+#endif
+
#if (!defined(_GNU_SOURCE) && !defined(_LGPL_SOURCE))
#error "Dynamic loader LGPL wrappers not implemented yet"
#endif
}
}
+#ifdef __cplusplus
+}
+#endif
+
#endif /* _URCU_RCULFSTACK_H */
+#ifndef _URCU_RCUWFQUEUE_H
+#define _URCU_RCUWFQUEUE_H
+
/*
* rcuwfqueue.h
*
#include <urcu/urcu_ref.h>
#include <assert.h>
+#ifdef __cplusplus
+extern "C" {
+#endif
+
#if (!defined(_GNU_SOURCE) && !defined(_LGPL_SOURCE))
#error "Dynamic loader LGPL wrappers not implemented yet"
#endif
* modified/re-used/freed until the reference count reaches zero and a grace
* period has elapsed (after the refcount reached 0).
*
- * TODO: implement adaptative busy-wait and wait/wakeup scheme rather than busy
- * loops. Better for UP.
+ * No need to go on a waitqueue here, as there is no possible state in which the
+ * list could cause dequeue to busy-loop needlessly while waiting for another
+ * thread to be scheduled. The queue appears empty until tail->next is set by
+ * enqueue.
*/
struct rcu_wfq_node *
rcu_wfq_dequeue_blocking(struct rcu_wfq_queue *q,
}
}
}
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* _URCU_RCUWFQUEUE_H */
#include <assert.h>
+#ifdef __cplusplus
+extern "C" {
+#endif
+
#if (!defined(_GNU_SOURCE) && !defined(_LGPL_SOURCE))
#error "Dynamic loader LGPL wrappers not implemented yet"
#endif
#define RCU_WF_STACK_END ((void *)0x1UL)
+#define RCU_WFS_ADAPT_ATTEMPTS 10 /* Retry if being set */
+#define RCU_WFS_WAIT 10 /* Wait 10 ms if being set */
+
+extern int rcu_wfs_futex;
struct rcu_wfs_node {
struct rcu_wfs_node *next;
* cmpxchg is protected from ABA races by holding a RCU read lock between
* s->head read and cmpxchg modifying s->head and requiring that dequeuers wait
* for a grace period before freeing the returned node.
- *
- * TODO: implement adaptative busy-wait and wait/wakeup scheme rather than busy
- * loops. Better for UP.
*/
struct rcu_wfs_node *
rcu_wfs_pop_blocking(struct rcu_wfs_stack *s)
{
+ int attempt = 0;
+
for (;;) {
struct rcu_wfs_node *head;
/* Retry while head is being set by push(). */
if (!next) {
rcu_read_unlock();
+ if (++attempt >= RCU_WFS_ADAPT_ATTEMPTS) {
+ /* Sleep for 10ms */
+ poll(NULL, 0, RCU_WFS_WAIT);
+ attempt = 0;
+ }
continue;
}
if (uatomic_cmpxchg(&s->head, head, next) == head) {
}
}
+#ifdef __cplusplus
+}
+#endif
+
#endif /* _URCU_RCUWFSTACK_H */