* make a queue appear empty if an enqueuer is preempted for a long time
* between xchg() and setting the previous node's next pointer.
*/
-static inline bool _cds_wfcq_empty(cds_wfcq_head_ptr_t u_head,
- struct cds_wfcq_tail *tail)
+static inline bool _cds_wfcq_empty(cds_wfcq_head_const_ptr_t u_head,
+ const struct cds_wfcq_tail *tail)
{
- struct __cds_wfcq_head *head = u_head._h;
+ const struct __cds_wfcq_head *head = u_head._h;
/*
* Queue is empty if no node is pointed by head->node.next nor
* tail->p. Even though the tail->p check is sufficient to find
struct __cds_wfcq_head *head = u_head._h;
struct cds_wfcq_node *node;
- if (_cds_wfcq_empty(__cds_wfcq_head_cast(head), tail))
+ if (_cds_wfcq_empty(__cds_wfcq_head_const_cast(head), tail))
return NULL;
node = ___cds_wfcq_node_sync_next(&head->node, blocking);
if (state)
*state = 0;
- if (_cds_wfcq_empty(__cds_wfcq_head_cast(head), tail)) {
+ if (_cds_wfcq_empty(__cds_wfcq_head_const_cast(head), tail)) {
return NULL;
}
* Initial emptiness check to speed up cases where queue is
* empty: only require loads to check if queue is empty.
*/
- if (_cds_wfcq_empty(__cds_wfcq_head_cast(src_q_head), src_q_tail))
+ if (_cds_wfcq_empty(__cds_wfcq_head_const_cast(src_q_head), src_q_tail))
return CDS_WFCQ_RET_SRC_EMPTY;
for (;;) {
struct __cds_wfcq_head *_h;
struct cds_wfcq_head *h;
} __attribute__((__transparent_union__)) cds_wfcq_head_ptr_t;
+
+typedef union {
+ const struct __cds_wfcq_head *_h;
+ const struct cds_wfcq_head *h;
+} __attribute__((__transparent_union__)) cds_wfcq_head_const_ptr_t;
#if defined(__clang__)
#pragma clang diagnostic pop
#endif
{
return head;
}
+
+/*
+ * This static inline is only present for compatibility with C++. It is
+ * effect-less in C.
+ */
+static inline const struct __cds_wfcq_head *__cds_wfcq_head_const_cast(const struct __cds_wfcq_head *head)
+{
+ return head;
+}
+
+/*
+ * This static inline is only present for compatibility with C++. It is
+ * effect-less in C.
+ */
+static inline const struct cds_wfcq_head *cds_wfcq_head_const_cast(const struct cds_wfcq_head *head)
+{
+ return head;
+}
+
#else /* #ifndef __cplusplus */
/*
cds_wfcq_head_ptr_t ret = { .h = head };
return ret;
}
+
+/*
+ * This static inline is used by internally in the static inline
+ * implementation of the API.
+ */
+static inline cds_wfcq_head_const_ptr_t __cds_wfcq_head_const_cast(const struct __cds_wfcq_head *head)
+{
+ cds_wfcq_head_const_ptr_t ret = { ._h = head };
+ return ret;
+}
+
+/*
+ * This static inline is used by internally in the static inline
+ * implementation of the API.
+ */
+static inline cds_wfcq_head_const_ptr_t cds_wfcq_head_const_cast(const struct cds_wfcq_head *head)
+{
+ cds_wfcq_head_const_ptr_t ret = { .h = head };
+ return ret;
+}
+
#endif /* #else #ifndef __cplusplus */
struct cds_wfcq_tail {
*
* No memory barrier is issued. No mutual exclusion is required.
*/
-extern bool cds_wfcq_empty(cds_wfcq_head_ptr_t head,
- struct cds_wfcq_tail *tail);
+extern bool cds_wfcq_empty(cds_wfcq_head_const_ptr_t head,
+ const struct cds_wfcq_tail *tail);
/*
* cds_wfcq_dequeue_lock: take the dequeue mutual exclusion lock.
return ret;
}
+static inline cds_wfcq_head_const_ptr_t cds_wfcq_head_const_cast_cpp(const struct __cds_wfcq_head *head)
+{
+ cds_wfcq_head_const_ptr_t ret = { ._h = head };
+ return ret;
+}
+
+static inline cds_wfcq_head_const_ptr_t cds_wfcq_head_const_cast_cpp(const struct cds_wfcq_head *head)
+{
+ cds_wfcq_head_const_ptr_t ret = { .h = head };
+ return ret;
+}
+
template<typename T> static inline bool cds_wfcq_empty(T head,
- struct cds_wfcq_tail *tail)
+ const struct cds_wfcq_tail *tail)
{
- return cds_wfcq_empty(cds_wfcq_head_cast_cpp(head), tail);
+ return cds_wfcq_empty(cds_wfcq_head_const_cast_cpp(head), tail);
}
template<typename T> static inline bool cds_wfcq_enqueue(T head,
___cds_wfcq_init(head, tail);
}
-bool cds_wfcq_empty(cds_wfcq_head_ptr_t head,
- struct cds_wfcq_tail *tail)
+bool cds_wfcq_empty(cds_wfcq_head_const_ptr_t head,
+ const struct cds_wfcq_tail *tail)
{
return _cds_wfcq_empty(head, tail);