ms-queue: finally, the correct (?) memory orderings

[model-checker-benchmarks.git] / spsc-queue / queue.h

diff --git a/spsc-queue/queue.h b/spsc-queue/queue.h
index 3167e22bf8e4f98d1d29129ea91dbbf933ef635a..c77425f5b662f1de1982e9738ede23bcff4e4a07 100644 (file)
--- a/spsc-queue/queue.h
+++ b/spsc-queue/queue.h
@@ -9,7 +9,7 @@ class spsc_queue
 public:
        spsc_queue()
        {
-               node* n = RL_NEW node ();
+               node* n = new node ();
                head = n;
                tail = n;
        }
@@ -17,12 +17,12 @@ public:
        ~spsc_queue()
        {
                RL_ASSERT(head == tail);
-               RL_DELETE((node*)head($));
+               delete ((node*)head($));
        }
 
        void enqueue(T data)
        {
-               node* n = RL_NEW node (data);
+               node* n = new node (data);
                head($)->next.store(n, std::memory_order_release);
                head = n;
                ec.signal_relaxed();
@@ -70,7 +70,7 @@ private:
                if (0 == n)
                        return 0;
                T data = n->data($);
-               RL_DELETE(t);
+               delete (t);
                tail = n;
                return data;
        }