Index: tests/concurrency/lockfree_stack.cfa
===================================================================
--- tests/concurrency/lockfree_stack.cfa	(revision 8cbb6aae0d19200acf355f58598101738d6549e2)
+++ tests/concurrency/lockfree_stack.cfa	(revision d8d9c11521a3bc60d8372f1f17c0779a6cf61fb8)
@@ -10,6 +10,6 @@
 // Created On       : Thu May 25 15:36:50 2023
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri May 26 08:08:47 2023
-// Update Count     : 4
+// Last Modified On : Tue May 30 19:02:32 2023
+// Update Count     : 18
 // 
 
@@ -20,5 +20,5 @@
 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
@@ -57,20 +57,27 @@
 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