Index: tests/concurrency/lockfree_stack.cfa
===================================================================
--- tests/concurrency/lockfree_stack.cfa	(revision d923fca679790b81e32b6a12debf586d34a17e72)
+++ tests/concurrency/lockfree_stack.cfa	(revision 0244ab6cafd02e729678c8d7bcacd8a5061b4e2d)
@@ -10,10 +10,10 @@
 // Created On       : Thu May 25 15:36:50 2023
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri Jun  9 14:01:07 2023
-// Update Count     : 68
+// Last Modified On : Sat Jul  4 15:59:49 2026
+// Update Count     : 74
 //
 
 #include <thread.hfa>
-#include <atomic.hfa>									// CASV
+#include <bits/atomic.hfa>								// AtomicCasv
 #include <fstream.hfa>
 
@@ -43,5 +43,5 @@
 	for () {											// busy wait
 		Link temp{ { &n, n.next.count + 1 } };
-		if ( CASV( s.stack.atom, n.next.atom, temp.atom ) ) break; // attempt to update top node
+		if ( AtomicCasv( s.stack.atom, n.next.atom, temp.atom ) ) break; // attempt to update top node
 	}
 }
@@ -52,5 +52,5 @@
 		if ( t.top == NULL ) return NULL;				// empty stack ?
 		Link temp{ { t.top->next.top, t.count } };
-		if ( CASV( stack.atom, t.atom, temp.atom ) ) return t.top; // attempt to update top node
+		if ( AtomicCasv( stack.atom, t.atom, temp.atom ) ) return t.top; // attempt to update top node
 	}
 }