Changes in tests/concurrency/lockfree_stack.cfa [c26bea2a:d8d9c115]

File:

• tests/concurrency/lockfree_stack.cfa (modified) (3 diffs)

tests/concurrency/lockfree_stack.cfa ¶

@@ -10 +10 @@
 // Created On       : Thu May 25 15:36:50 2023
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu May 25 16:20:23 2023
-// Update Count     : 2
+// Last Modified On : Tue May 30 19:02:32 2023
+// Update Count     : 18
 // 
 
@@ -20 +20 @@
 struct Node;                                                                                    // forward declaration
 union Link {
-        struct {                                                                                        // 64-bit x 2
+        struct {                                                                                        // 32/64-bit x 2
                 Node * volatile top;                                                    // pointer to stack top
                 uintptr_t count;                                                                // count each push
         };
+        #if defined( __SIZEOF_INT128__ )
         __int128 atom;                                                                          // gcc, 128-bit integer
+        #else
+        int64_t atom;
+        #endif // __SIZEOF_INT128__
 } __attribute__(( aligned( 16 ) ));
 
@@ -53 +57 @@
 Stack stack;                                                                                    // global stack
 
+enum { Times =
+        #if defined( __ARM_ARCH )                                                       // ARM CASV is very slow
+        10_000
+        #else
+        1_000_000
+        #endif // __arm_64__
+};
+
 thread Worker {};
 void main( Worker & w ) {
-        for ( i; 100000 ) {
-                Node & n = *pop( stack );
+        for ( i; Times ) {
+                Node & n = *pop( stack );                                               // pop any node
                 assert( &n != NULL );
-                n.next.top = 0p;                                                                // shrub fields
+                n.next.top = 0p;                                                                // scrub fields
                 n.next.count = 0;
                 //yield( rand() % 3 );
-                push( stack, n );
+                push( stack, n );                                                               // push it back
         }
 }
 
-
 int main() {
-        enum { N = 10 };
-        processor p[N - 1];                                                                     // kernel threads
+        enum { N = 8 };                                                                         // kernel threads
+        processor p[N - 1];                                                                     // add kernel threads
 
         for ( i; N ) {                                                                          // push N values on stack