Index: libcfa/src/concurrency/kernel_private.hfa
===================================================================
--- libcfa/src/concurrency/kernel_private.hfa	(revision 97c3159a8935460c693d4081ccd00629d1f32093)
+++ libcfa/src/concurrency/kernel_private.hfa	(revision fd9b5241b956ae00298c87d393f481cf1d8a329a)
@@ -10,6 +10,6 @@
 // Created On       : Mon Feb 13 12:27:26 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Sat Nov 30 19:25:02 2019
-// Update Count     : 8
+// Last Modified On : Wed Aug 12 08:21:33 2020
+// Update Count     : 9
 //
 
@@ -132,5 +132,5 @@
 	while( __builtin_expect(__atomic_exchange_n(ll, (bool)true, __ATOMIC_SEQ_CST), false) ) {
 		while(__atomic_load_n(ll, (int)__ATOMIC_RELAXED))
-			asm volatile("pause");
+			Pause();
 	}
 	/* paranoid */ verify(*ll);
@@ -186,5 +186,5 @@
 	// Step 1 : make sure no writer are in the middle of the critical section
 	while(__atomic_load_n(&lock, (int)__ATOMIC_RELAXED))
-		asm volatile("pause");
+		Pause();
 
 	// Fence needed because we don't want to start trying to acquire the lock
Index: libcfa/src/concurrency/ready_queue.cfa
===================================================================
--- libcfa/src/concurrency/ready_queue.cfa	(revision 97c3159a8935460c693d4081ccd00629d1f32093)
+++ libcfa/src/concurrency/ready_queue.cfa	(revision fd9b5241b956ae00298c87d393f481cf1d8a329a)
@@ -118,10 +118,10 @@
 	__scheduler_lock_id_t * storage = (__scheduler_lock_id_t *)&data[n];
 	(*storage){ proc };
-	while(true) {
+	while() {
 		unsigned copy = n;
 		if( __atomic_load_n(&ready, __ATOMIC_RELAXED) == n
 			&& __atomic_compare_exchange_n(&ready, &copy, n + 1, true, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST))
 			break;
-		asm volatile("pause");
+		Pause();
 	}