Changeset a6b48f6 for libcfa/src/collections

Timestamp:

Dec 24, 2024, 10:52:13 AM (4 weeks ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

master

Children:

2853d6f, 5db580e

Parents:

4f4ae60

Message:

formatting, comment out unused parameter names to remove warnings

File:

• libcfa/src/collections/lockfree.hfa (modified) (4 diffs)

libcfa/src/collections/lockfree.hfa

@@ -6 +6 @@
 #include <bits/defs.hfa>
 
-forall( T &) {
+forall( T & ) {
         //------------------------------------------------------------
         // Queue based on the MCS lock
@@ -200 +200 @@
 forall( T & )
 struct LinkData {
-        T * volatile top;                                                               // pointer to stack top
-        uintptr_t count;                                                                // count each push
+        T * volatile top;                                                                       // pointer to stack top
+        uintptr_t count;                                                                        // count each push
 };
 
@@ -215 +215 @@
 }; // Link
 
-forall( T | sized(T) | { Link(T) * ?`next( T * ); } ) {
+forall( T /*| sized(T)*/ | { Link(T) * ?`next( T * ); } ) {
         struct StackLF {
                 Link(T) stack;
@@ -235 +235 @@
                         Link(T) t @= stack;                                                     // atomic assignment unnecessary, or use CAA
                         for () {                                                                        // busy wait
-                                if ( t.data.top == 0p ) return 0p;                              // empty stack ?
+                                if ( t.data.top == 0p ) return 0p;              // empty stack ?
                                 Link(T) * next = ( t.data.top )`next;
                                 if ( __atomic_compare_exchange_n( &stack.atom, &t.atom, (Link(T))@{ (LinkData(T))@{ next->data.top, t.data.count } }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) return t.data.top; // attempt to update top node