Index: tests/heap.cfa
===================================================================
--- tests/heap.cfa	(revision 3f654ecdcfdb73f9b05285ff8427be103b5a03b8)
+++ tests/heap.cfa	(revision 3e91703d48f4929b38011321827ae8704bd9d4d0)
@@ -10,6 +10,6 @@
 // Created On       : Tue Nov  6 17:54:56 2018
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Dec 11 21:52:40 2018
-// Update Count     : 18
+// Last Modified On : Fri Jul 19 08:22:34 2019
+// Update Count     : 19
 // 
 
@@ -29,5 +29,5 @@
 #define __U_DEFAULT_MMAP_START__ (512 * 1024 + 1)
 size_t default_mmap_start() __attribute__(( weak )) {
-    return __U_DEFAULT_MMAP_START__;
+	return __U_DEFAULT_MMAP_START__;
 } // default_mmap_start
 
@@ -36,11 +36,11 @@
 
 void main( Worker & ) {
-    enum { NoOfAllocs = 5000, NoOfMmaps = 10 };
-    char * locns[NoOfAllocs];
-    int i;
-
-    // check alloc/free
-
-    for ( j; 40 ) {
+	enum { NoOfAllocs = 5000, NoOfMmaps = 10 };
+	char * locns[NoOfAllocs];
+	int i;
+
+	// check alloc/free
+
+	for ( j; 40 ) {
 		for ( i; NoOfAllocs ) {
 			locns[i] = alloc( i );
@@ -67,9 +67,9 @@
 			free( locns[i] );
 		} // for
-    } // for
-
-    // check malloc/free (sbrk)
-
-    for ( i; NoOfAllocs ) {
+	} // for
+
+	// check malloc/free (sbrk)
+
+	for ( i; NoOfAllocs ) {
 		size_t s = (i + 1) * 20;
 		char * area = (char *)malloc( s );
@@ -78,7 +78,7 @@
 		area[malloc_usable_size( area ) - 1] = '\345';	// fill ultimate byte
 		free( area );
-    } // for
-
-    for ( i; NoOfAllocs ) {
+	} // for
+
+	for ( i; NoOfAllocs ) {
 		size_t s = i + 1;								// +1 to make initialization simpler
 		locns[i] = (char *)malloc( s );
@@ -86,15 +86,15 @@
 		locns[i][0] = '\345'; locns[i][s - 1] = '\345';	// fill first/last
 		locns[i][malloc_usable_size( locns[i] ) - 1] = '\345'; // fill ultimate byte
-    } // for
-    for ( i; NoOfAllocs ) {
+	} // for
+	for ( i; NoOfAllocs ) {
 		size_t s = i + 1;
 		if ( locns[i][0] != '\345' || locns[i][s - 1] != '\345' ||
 			 locns[i][malloc_usable_size( locns[i] ) - 1] != '\345' ) abort( "malloc/free corrupt storage" );
 		free( locns[i] );
-    } // for
-
-    // check malloc/free (mmap)
-
-    for ( i; NoOfMmaps ) {
+	} // for
+
+	// check malloc/free (mmap)
+
+	for ( i; NoOfMmaps ) {
 		size_t s = i + default_mmap_start();			// cross over point
 		char * area = (char *)malloc( s );
@@ -103,7 +103,7 @@
 		area[malloc_usable_size( area ) - 1] = '\345';	// fill ultimate byte
 		free( area );
-    } // for
-
-    for ( i; NoOfMmaps ) {
+	} // for
+
+	for ( i; NoOfMmaps ) {
 		size_t s = i + default_mmap_start();			// cross over point
 		locns[i] = (char *)malloc( s );
@@ -111,15 +111,15 @@
 		locns[i][0] = '\345'; locns[i][s - 1] = '\345';	// fill first/last
 		locns[i][malloc_usable_size( locns[i] ) - 1] = '\345'; // fill ultimate byte
-    } // for
-    for ( i; NoOfMmaps ) {
+	} // for
+	for ( i; NoOfMmaps ) {
 		size_t s = i + default_mmap_start();			// cross over point
 		if ( locns[i][0] != '\345' || locns[i][s - 1] != '\345' ||
 			 locns[i][malloc_usable_size( locns[i] ) - 1] != '\345' ) abort( "malloc/free corrupt storage" );
 		free( locns[i] );
-    } // for
-
-    // check calloc/free (sbrk)
-
-    for ( i; NoOfAllocs ) {
+	} // for
+
+	// check calloc/free (sbrk)
+
+	for ( i; NoOfAllocs ) {
 		size_t s = (i + 1) * 20;
 		char * area = (char *)calloc( 5, s );
@@ -131,7 +131,7 @@
 		area[malloc_usable_size( area ) - 1] = '\345';	// fill ultimate byte
 		free( area );
-    } // for
-
-    for ( i; NoOfAllocs ) {
+	} // for
+
+	for ( i; NoOfAllocs ) {
 		size_t s = i + 1;
 		locns[i] = (char *)calloc( 5, s );
@@ -142,15 +142,15 @@
 		locns[i][0] = '\345'; locns[i][s - 1] = '\345';	// fill first/last
 		locns[i][malloc_usable_size( locns[i] ) - 1] = '\345'; // fill ultimate byte
-    } // for
-    for ( i; NoOfAllocs ) {
+	} // for
+	for ( i; NoOfAllocs ) {
 		size_t s = i + 1;
 		if ( locns[i][0] != '\345' || locns[i][s - 1] != '\345' ||
 			 locns[i][malloc_usable_size( locns[i] ) - 1] != '\345' ) abort( "calloc/free corrupt storage3" );
 		free( locns[i] );
-    } // for
-
-    // check calloc/free (mmap)
-
-    for ( i; NoOfMmaps ) {
+	} // for
+
+	// check calloc/free (mmap)
+
+	for ( i; NoOfMmaps ) {
 		size_t s = i + default_mmap_start();			// cross over point
 		char * area = (char *)calloc( 1, s );
@@ -162,7 +162,7 @@
 		area[malloc_usable_size( area ) - 1] = '\345';	// fill ultimate byte
 		free( area );
-    } // for
-
-    for ( i; NoOfMmaps ) {
+	} // for
+
+	for ( i; NoOfMmaps ) {
 		size_t s = i + default_mmap_start();			// cross over point
 		locns[i] = (char *)calloc( 1, s );
@@ -173,15 +173,15 @@
 		locns[i][0] = '\345'; locns[i][s - 1] = '\345';	// fill first/last
 		locns[i][malloc_usable_size( locns[i] ) - 1] = '\345'; // fill ultimate byte
-    } // for
-    for ( i; NoOfMmaps ) {
+	} // for
+	for ( i; NoOfMmaps ) {
 		size_t s = i + default_mmap_start();			// cross over point
 		if ( locns[i][0] != '\345' || locns[i][s - 1] != '\345' ||
 			 locns[i][malloc_usable_size( locns[i] ) - 1] != '\345' ) abort( "calloc/free corrupt storage6" );
 		free( locns[i] );
-    } // for
-
-    // check memalign/free (sbrk)
-
-    enum { limit = 64 * 1024 };							// check alignments up to here
+	} // for
+
+	// check memalign/free (sbrk)
+
+	enum { limit = 64 * 1024 };							// check alignments up to here
 
 	for ( a; libAlign() ~= limit ~ a ) {				// generate powers of 2
@@ -198,7 +198,7 @@
 			free( area );
 		} // for
-    } // for
-
-    // check memalign/free (mmap)
+	} // for
+
+	// check memalign/free (mmap)
 
 	for ( a; libAlign() ~= limit ~ a ) {				// generate powers of 2
@@ -216,9 +216,9 @@
 			free( area );
 		} // for
-    } // for
-
-    // check calloc/realloc/free (sbrk)
-
-    for ( i; 1 ~ 10_000 ~ 12 ) {
+	} // for
+
+	// check calloc/realloc/free (sbrk)
+
+	for ( i; 1 ~ 10_000 ~ 12 ) {
 		// initial N byte allocation
 		char * area = (char *)calloc( 5, i );
@@ -237,9 +237,9 @@
 		} // for
 		free( area );
-    } // for
-
-    // check calloc/realloc/free (mmap)
-
-    for ( i; 1 ~ 10_000 ~ 12 ) {
+	} // for
+
+	// check calloc/realloc/free (mmap)
+
+	for ( i; 1 ~ 10_000 ~ 12 ) {
 		// initial N byte allocation
 		size_t s = i + default_mmap_start();			// cross over point
@@ -259,9 +259,9 @@
 		} // for
 		free( area );
-    } // for
-
-    // check memalign/realloc/free
-
-    size_t amount = 2;
+	} // for
+
+	// check memalign/realloc/free
+
+	size_t amount = 2;
 	for ( a; libAlign() ~= limit ~ a ) {				// generate powers of 2
 		// initial N byte allocation
@@ -286,7 +286,7 @@
 		} // for
 		free( area );
-    } // for
-
-    // check cmemalign/free
+	} // for
+
+	// check cmemalign/free
 
 	for ( a; libAlign() ~= limit ~ a ) {				// generate powers of 2
@@ -305,9 +305,9 @@
 			free( area );
 		} // for
-    } // for
-
-    // check cmemalign/realloc/free
-
-    amount = 2;
+	} // for
+
+	// check cmemalign/realloc/free
+
+	amount = 2;
 	for ( a; libAlign() ~= limit ~ a ) {				// generate powers of 2
 		// initial N byte allocation
@@ -338,16 +338,16 @@
 		} // for
 		free( area );
-    } // for
+	} // for
 	//sout | "worker" | thisTask() | "successful completion";
 } // Worker main
 
 int main() {
-    const unsigned int NoOfWorkers = 4;
-    {
+	const unsigned int NoOfWorkers = 4;
+	{
 		processor processors[NoOfWorkers - 1] __attribute__(( unused )); // more than one processor
 		Worker workers[NoOfWorkers] __attribute__(( unused ));
-    }
+	}
 	// checkFreeOn();
-    // malloc_stats();
+	// malloc_stats();
 }