Changeset 8e4aa05 for libcfa/src/containers/stackLockFree.hfa

Timestamp:

Mar 4, 2021, 7:40:25 PM (5 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

77d601f

Parents:

342af53 (diff), a5040fe (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc

File:

• libcfa/src/containers/stackLockFree.hfa (modified) (5 diffs)

libcfa/src/containers/stackLockFree.hfa

@@ -9 +9 @@
 // Created On       : Wed May 13 20:58:58 2020
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Sun Jun 14 13:25:09 2020
-// Update Count     : 64
+// Last Modified On : Wed Jan 20 20:40:03 2021
+// Update Count     : 67
 //
 
@@ -17 +17 @@
 #include <stdint.h>
 
-forall( dtype T )
+forall( T & )
 union Link {
         struct {                                                                                        // 32/64-bit x 2
@@ -31 +31 @@
 }; // Link
 
-forall( otype T | sized(T) | { Link(T) * ?`next( T * ); } ) {
+forall( T | sized(T) | { Link(T) * ?`next( T * ); } ) {
         struct StackLF {
                 Link(T) stack;
@@ -42 +42 @@
 
                 void push( StackLF(T) & this, T & n ) with(this) {
-                        *( &n )`next = stack;                                   // atomic assignment unnecessary, or use CAA
+                        *( &n )`next = stack;                                           // atomic assignment unnecessary, or use CAA
                         for () {                                                                        // busy wait
                           if ( __atomic_compare_exchange_n( &stack.atom, &( &n )`next->atom, (Link(T))@{ {&n, ( &n )`next->count + 1} }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) break; // attempt to update top node
@@ -65 +65 @@
                                 }
                                 if( next == 0p ) return false;
-                                link = (next)`next;
+                                link = ( next )`next;
                         }
                 }