Index: libcfa/prelude/prototypes.awk
===================================================================
--- libcfa/prelude/prototypes.awk	(revision fb64e86bb9e4500074425f9fa73c2667ad6f120f)
+++ libcfa/prelude/prototypes.awk	(revision 8c9da33ccd24f6ebb19003bcfa35de0cf69ac73e)
@@ -10,6 +10,6 @@
 # Created On       : Sat May 16 07:57:37 2015
 # Last Modified By : Peter A. Buhr
-# Last Modified On : Thu Jun  6 20:46:28 2019
-# Update Count     : 34
+# Last Modified On : Sat Feb  8 09:46:58 2020
+# Update Count     : 36
 #
 
@@ -17,5 +17,5 @@
 
 BEGIN {
-  FS = "[( )]"
+	FS = "[( )]"
 	# order so string search is longest string
 	i=-1
@@ -84,10 +84,10 @@
 
 /BT_FN/ {
-	for (i = 1; i <= NF; i++) {
-	  if( match($i, "BT_FN") != 0 ) {
-		prototypes[$i] = $i
-	  }
+	for (i = 1; i <= NF; i += 1 ) {
+		if ( match($i, "BT_FN") != 0 ) {
+			prototypes[$i] = $i
+		}
 	}
-  }
+}
 
 END {
@@ -103,47 +103,47 @@
 
 	for ( prototype in prototypes ) {
-	  # printf( "//\"%s\"\n", prototype )
-	  if ( index( "BT_LAST", prototype ) == 1 ) {
-		continue
-	  } # if
+		# printf( "//\"%s\"\n", prototype )
+		if ( index( "BT_LAST", prototype ) == 1 ) {
+			continue
+		} # if
 
-	  printf( "#define %s(NAME) FUNC_SIMPLE(", prototype )
+		printf( "#define %s(NAME) FUNC_SIMPLE(", prototype )
 
-	  if ( sub( "BT_FN_", "", prototype ) == 0 ) {
-		printf( "\n********** BAD MACRO NAME \"%s\" **********\n", prototype )
-		exit 0
-	  } # if
+		if ( sub( "BT_FN_", "", prototype ) == 0 ) {
+			printf( "\n********** BAD MACRO NAME \"%s\" **********\n", prototype )
+			exit 0
+		} # if
 
-	  # generate function return type as macro
-	  for ( t = 0; t < N; t += 1 ) {					# find longest match
-		type = types[t];
-		if ( index( prototype, type ) == 1 ) {		# found match
-		  printf( "BT_%s, NAME", type )
-		  sub( type, "", prototype )
-		  break;
+		# generate function return type as macro
+		for ( t = 0; t < N; t += 1 ) {					# find longest match
+			type = types[t];
+			if ( index( prototype, type ) == 1 ) {		# found match
+				printf( "BT_%s, NAME", type )
+				sub( type, "", prototype )
+				break;
+			} # if
+		} # for
+
+		# generate function parameter types as macro
+		if ( index( prototype, "VAR" ) != 2 ) {			# C-style empty parameters ?
+			for ( p = 0; length( prototype ) > 0; p += 1 ) { # until all parameters types are removed
+				sub( "_", "", prototype)				# remove "_"
+				printf( ", ", type )
+				temp = prototype
+				for ( t = 0; t < N; t += 1 ) {			# find longest match
+					type = types[t];
+					if ( index( prototype, type ) == 1 ) { # found match
+						printf( "BT_%s", type )
+						sub( type, "", prototype )
+						break;
+					} # if
+				} # for
+				if ( temp == prototype ) {				# no match found for parameter in macro table
+					printf( "\n********** MISSING TYPE \"%s\" **********\n", prototype )
+					exit 0
+				} # if
+			} # for
 		} # if
-	  } # for
-
-	  # generate function parameter types as macro
-	  if ( index( prototype, "VAR" ) != 2 ) {			# C-style empty parameters ?
-		for ( p = 0; length( prototype ) > 0; p += 1 ) { # until all parameters types are removed
-		  sub( "_", "", prototype)				# remove "_"
-		  printf( ", ", type )
-		  temp = prototype
-		  for ( t = 0; t < N; t += 1 ) {			# find longest match
-			type = types[t];
-			if ( index( prototype, type ) == 1 ) { # found match
-			  printf( "BT_%s", type )
-			  sub( type, "", prototype )
-			  break;
-			} # if
-		  } # for
-		  if ( temp == prototype ) {				# no match found for parameter in macro table
-			printf( "\n********** MISSING TYPE \"%s\" **********\n", prototype )
-			exit 0
-		  } # if
-		} # for
-	  } # if
-	  printf( ")\n" )
+		printf( ")\n" )
 	} # for