* Stack implementing push, pop, pop_all operations, as well as iterator
* on the stack head returned by pop_all.
*
- * Wait-free operations: cds_wfs_push, __cds_wfs_pop_all.
- * Blocking operations: cds_wfs_pop, cds_wfs_pop_all, iteration on stack
- * head returned by pop_all.
+ * Wait-free operations: cds_wfs_push, __cds_wfs_pop_all, cds_wfs_empty,
+ * cds_wfs_first.
+ * Blocking operations: cds_wfs_pop, cds_wfs_pop_all, cds_wfs_next,
+ * iteration on stack head returned by pop_all.
*
* Synchronization table:
*
* For iteration on cds_wfs_head returned by __cds_wfs_pop_all or
* cds_wfs_pop_all_blocking.
*/
-#define cds_wfs_first_blocking _cds_wfs_first_blocking
+#define cds_wfs_first _cds_wfs_first
#define cds_wfs_next_blocking _cds_wfs_next_blocking
/* Pop locking with internal mutex */
extern struct cds_wfs_head *cds_wfs_pop_all_blocking(struct cds_wfs_stack *s);
/*
- * cds_wfs_first_blocking: get first node of a popped stack.
+ * cds_wfs_first: get first node of a popped stack.
*
* Content written into the node before enqueue is guaranteed to be
* consistent, but no other memory ordering is ensured.
*
* Returns NULL if popped stack is empty, top stack node otherwise.
*/
-extern struct cds_wfs_node *cds_wfs_first_blocking(struct cds_wfs_head *head);
+extern struct cds_wfs_node *cds_wfs_first(struct cds_wfs_head *head);
/*
* cds_wfs_next_blocking: get next node of a popped stack.
* consistent, but no other memory ordering is ensured.
*/
#define cds_wfs_for_each_blocking(head, node) \
- for (node = cds_wfs_first_blocking(head); \
+ for (node = cds_wfs_first(head); \
node != NULL; \
node = cds_wfs_next_blocking(node))
* consistent, but no other memory ordering is ensured.
*/
#define cds_wfs_for_each_blocking_safe(head, node, n) \
- for (node = cds_wfs_first_blocking(head), \
+ for (node = cds_wfs_first(head), \
n = (node ? cds_wfs_next_blocking(node) : NULL); \
node != NULL; \
node = n, n = (node ? cds_wfs_next_blocking(node) : NULL))