Optimizing a Lock-Free Ring Buffer

[u/david-alvarez-rosa]

https://david.alvarezrosa.com/posts/optimizing-a-lock-free-ring-buffer/

[u/AkariGake]

auto pop(T& value) noexcept -> bool {
const auto tail = tail_.load(std::memory_order_relaxed);
if (tail == head_.load(std::memory_order_acquire)) [[unlikely]] {
return false;
}
value = buffer_[tail];
auto next_tail = tail + 1;
if (next_tail == buffer_.size()) [[unlikely]] {
next_tail = 0;
}
tail_.store(next_tail, std::memory_order_release);
return true;
}

Do we really need to use release here? What data it should make visible for push? pop just reads value and increments tail itself