Index: tests/array-collections/.expect/c-dependent.txt
===================================================================
--- tests/array-collections/.expect/c-dependent.txt	(revision 16d9c3ad11804ba6611afddc59feffaa040594e1)
+++ tests/array-collections/.expect/c-dependent.txt	(revision fc9d167d64b216338bbb31c8110868bf4a4c6068)
@@ -1,3 +1,3 @@
-bound_ptr_allow 999: 1.1 1.2 1.3
+bound_ptr_allow 42: 1.1 1.2 1.3
 bound_ar_allow 41:
 1.1 1.2 1.3
Index: tests/array-collections/c-dependent.cfa
===================================================================
--- tests/array-collections/c-dependent.cfa	(revision 16d9c3ad11804ba6611afddc59feffaa040594e1)
+++ tests/array-collections/c-dependent.cfa	(revision fc9d167d64b216338bbb31c8110868bf4a4c6068)
@@ -1,3 +1,13 @@
-void iota1( int n, float * a, float base ) {
+// Purpose:  Demonstrate that aruably-dependent types, like `void (*)( size_t n, float[n] )`,
+// which are valid in C, work also in CFA.  It's a C-compatibility test.
+// So, here we exercise code that a C compiler that omnisciently warns about bounds would accept.
+
+// Note this test was once written with a broader intent, articulated after the fact as either of:
+// - demonstrate how permissive this C-compatibility feature is,
+//   even though gcc continually works to clamp down in these areas
+// - demonstrate that CFA lowering does not get in the way of C's warnings in these areas
+// Current decision is these qualities (while desirable) are too fickle to be pursued practically.
+
+void iota1( size_t n, float * a, float base ) {
     for (i; n) {
         a[i] = base + 0.1f * (float)(i + 1);
@@ -11,7 +21,8 @@
     float a[42];
     iota1( 42, a, 1.0 );
-    f__bound_ptr_allow( 999, a );
+    f__bound_ptr_allow( 42, a );  // pass actual size (42)  ==>  bounds ok
 }
 
+// note dimension `n + 1`, exercising nontrivial dim-expression
 void f__bound_ar_allow( size_t n, float a[][n + 1] ) {
     printf( "bound_ar_allow %zd:\n", n );
@@ -25,5 +36,5 @@
     iota1( 42, a[1], 2.0 );
     iota1( 42, a[2], 3.0 );
-    f__bound_ar_allow( 41, a );
+    f__bound_ar_allow( 41, a );  // n == 41  ==>  len(a) == 42  =>  bounds ok
 }