* that the queue is being appended to. The following store will append
* "node" to the queue from a dequeuer perspective.
*/
- CAA_STORE_SHARED(*old_tail, node);
+ CMM_STORE_SHARED(*old_tail, node);
}
/*
/*
* Queue is empty if it only contains the dummy node.
*/
- if (q->head == &q->dummy && CAA_LOAD_SHARED(q->tail) == &q->dummy.next)
+ if (q->head == &q->dummy && CMM_LOAD_SHARED(q->tail) == &q->dummy.next)
return NULL;
node = q->head;
/*
* Adaptative busy-looping waiting for enqueuer to complete enqueue.
*/
- while ((next = CAA_LOAD_SHARED(node->next)) == NULL) {
+ while ((next = CMM_LOAD_SHARED(node->next)) == NULL) {
if (++attempt >= WFQ_ADAPT_ATTEMPTS) {
poll(NULL, 0, WFQ_WAIT); /* Wait for 10ms */
attempt = 0;