Lock-free FIFO queue implementation
The meaning of lock-free
Although your program is free of locks in the traditional sense, &quot;lock free programming&quot; typically describes a style of programming with certain guarantees.  One of these guarantees is that even if one or more threads are suspended indefinitely, other threads can continue to make progress.  This wikipedia article on Non-blocking algorithms describes &quot;lock-free&quot; and &quot;wait-free&quot; programming in more detail.
In your code, if one thread is permanently suspended between these two lines:

    prev = atomic_xchg64(&amp;head-&gt;tail, node);
    prev-&gt;next = node;


then some other thread will spin forever in this loop:

                            while (ACCESS_ONCE(head-&gt;next) == next)
                                    head-&gt;next = ACCESS_ONCE(node-&gt;next);


and furthermore, no nodes past the node that the suspended thread &quot;half-pushed&quot; will be able to be popped.
ABA problem
Additionally, your code falls victim to the ABA problem.  Consider an initial situation with two nodes in your FIFO:
A -&gt; B    (head-&gt;next = A, head-&gt;tail = B)

Suppose thread #1 calls __fifo_list_pop(), and gets to this line:

            if (cmpxchg_eq(&amp;head-&gt;next, node, next) == node) {


Here, node will be A, and next will be  B, and the code is about to atomically change head-&gt;next from A to B.
Now suppose thread #1 is descheduled, and in the meantime, other threads pop both A and B off the FIFO, and then push A and C back on the FIFO.  Now, your FIFO looks like this:
A -&gt; C    (head-&gt;next = A, head-&gt;tail = C)

If thread #1 now wakes up, it will perform the atomic exchange, causing head-&gt;next to point at B which isn't even alive any more:
A -&gt; B    (but B was already popped and is now dead)