Index: libcfa/src/bits/random.hfa
===================================================================
--- libcfa/src/bits/random.hfa	(revision 611f29dd8a1b6bbae4d52c5b474269066522deeb)
+++ libcfa/src/bits/random.hfa	(revision 22226e4c0c12d34b6c6883c00f1607a84fce93f5)
@@ -1,11 +1,26 @@
+// 
+// Cforall Version 1.0.0 Copyright (C) 2022 University of Waterloo
+// 
+// The contents of this file are covered under the licence agreement in the
+// file "LICENCE" distributed with Cforall.
+//
+// random.hfa -- 
+// 
+// Author           : Peter A. Buhr
+// Created On       : Fri Jan 14 07:18:11 2022
+// Last Modified By : Peter A. Buhr
+// Last Modified On : Fri Jan 14 07:18:58 2022
+// Update Count     : 1
+// 
+
 #pragma once
 
 #include <stdint.h>
 
-// Pipelined to allow out-of-order overlap with reduced dependencies. Critically, return the current value, and compute
-// and store the next value.
+// Pipelined to allow out-of-order overlap with reduced dependencies. Critically, the current random state is returned
+// (copied), and then compute and store the next random value.
 
+#if defined(__SIZEOF_INT128__)
 //--------------------------------------------------
-#if defined(__SIZEOF_INT128__)
 	static inline uint64_t lehmer64( __uint128_t & state ) {
 		__uint128_t ret = state;
@@ -50,7 +65,7 @@
 } xorwow__state_t;
 
-/* The state array must be initialized to not be all zero in the first four words */
+// The state array must be initialized to not be all zero in the first four words.
 static inline uint32_t xorwow( xorwow__state_t & state ) {
-	/* Algorithm "xorwow" from p. 5 of Marsaglia, "Xorshift RNGs" */
+	// Algorithm "xorwow" from p. 5 of Marsaglia, "Xorshift RNGs".
 	uint32_t ret = state.a + state.counter;
 	uint32_t t = state.d;
@@ -84,4 +99,5 @@
 #define D  (16_l64u)
 
+// Bi-directional LCG random-number generator
 static inline uint32_t LCGBI_fwd( uint64_t & state ) {
 	state = (A * state + C) & (M - 1);