incomplete object at file scope.

Author: thradams

manual.md

@@ -258,7 +258,7 @@ In C99/C23, there are two related but distinct concepts:
 - **VM types** (`int (*p)[n]`) - any type derived from a runtime-sized array, including pointers to VLAs. **Mandatory** in C23 even when `__STDC_NO_VLA__` is defined.
 
 Cake supports **VM types** and converts them to C89-compatible code.
-Cake does **not** support VLA objects - a diagnostic is emitted instead, pointing to the VM type alternative.
+Cake does **not** support VLA objects.
 
 #### VM type pointer declarations
 
@@ -278,68 +278,6 @@ int main() {
 ```
 <button onclick="Try(this)">try</button>
 
-The C89 output captures the dimensions into snapshot variables at declaration time,
-so that later mutation of `n` or `m` does not affect the allocation size or `sizeof` results:
-
-```c
-int __v0;
-int __v1;
-int *p;
-__v0 = (n);
-__v1 = (m);
-p = (int *)malloc(sizeof(int) * __v0 * __v1);
-printf("%zu\n", (sizeof(int) * __v0 * __v1));
-free(p);
-```
-
-#### VM type function parameters
-
-VM pointer parameters are also rewritten to flat pointers. Subscript expressions
-through the pointer are linearised automatically.
-
-```c
-#include <stdlib.h>
-#include <stdio.h>
-
-void fill(int n, int m, int (*grid)[n][m])
-{
-    int i, j;
-    for (i = 0; i < n; i++)
-        for (j = 0; j < m; j++)
-            (*grid)[i][j] = i * 10 + j;
-}
-
-int main() {
-    int n = 3, m = 4;
-    int (*p)[n][m] = malloc(sizeof *p);
-    fill(n, m, p);
-    free(p);
-}
-```
-<button onclick="Try(this)">try</button>
-
-C89 output for `fill`:
-
-```c
-void fill(int n, int m, int *grid)
-{
-    int i, j;
-    for (i = 0; i < n; i++)
-        for (j = 0; j < m; j++)
-            ((int*)grid)[(i) * m + (j)] = i * 10 + j;
-}
-```
-
-#### VLA objects are not supported
-
-```c
-int main() {
-    int n = 5;
-    int a[n]; /* error: variable length arrays are not supported;
-                 use a pointer to a variably modified type instead
-                 (e.g. 'int (*p)[n] = malloc(sizeof *p);') */
-}
-```
 
 ### C99 Flexible array members
 

src/cakeconfig.h

@@ -1,12 +1,11 @@
 //This was generated by running cake -autoconfig 
 //This file was generated reading the variable INCLUDE inside Visual Studio Command Prompt.
 //echo %INCLUDE% 
-#pragma dir "C:/Program Files/Microsoft Visual Studio/2022/Professional/VC/Tools/MSVC/14.44.35207/include/"
-#pragma dir "C:/Program Files/Microsoft Visual Studio/2022/Professional/VC/Tools/MSVC/14.44.35207/ATLMFC/include/"
-#pragma dir "C:/Program Files/Microsoft Visual Studio/2022/Professional/VC/Auxiliary/VS/include/"
+#pragma dir "C:/Program Files/Microsoft Visual Studio/2022/Community/VC/Tools/MSVC/14.44.35207/include/"
+#pragma dir "C:/Program Files/Microsoft Visual Studio/2022/Community/VC/Tools/MSVC/14.44.35207/ATLMFC/include/"
+#pragma dir "C:/Program Files/Microsoft Visual Studio/2022/Community/VC/Auxiliary/VS/include/"
 #pragma dir "C:/Program Files (x86)/Windows Kits/10/include/10.0.26100.0/ucrt/"
 #pragma dir "C:/Program Files (x86)/Windows Kits/10//include/10.0.26100.0//um/"
 #pragma dir "C:/Program Files (x86)/Windows Kits/10//include/10.0.26100.0//shared/"
 #pragma dir "C:/Program Files (x86)/Windows Kits/10//include/10.0.26100.0//winrt/"
 #pragma dir "C:/Program Files (x86)/Windows Kits/10//include/10.0.26100.0//cppwinrt/"
-#pragma dir "C:/Program Files (x86)/Windows Kits/NETFXSDK/4.8/include/um/"

src/file.c

@@ -1,158 +1,5 @@
+char str[]; /* incomplete type */
 
-#include <stdio.h>
-#include <stdlib.h>
-
-void print2D(int n, int m, int a[n][m])
-{
-    for (int i = 0; i < n; i++)
-    {
-        for (int j = 0; j < m; j++)
-        {
-            printf("%d ", a[i][j]);
-        }
-        printf("\n");
-    }
-}
-
-void print1D(int n, int a[n])
-{
-    for (int i = 0; i < n; i++)
-    {
-        printf(" %d", a[i]);
-    }
-    printf("\n");
-}
-
-void test_1d(int n)
-{
-    int (*p)[n] = malloc(sizeof * p);
-    int i;
-    for (i = 0; i < n; i++)
-        (*p)[i] = i + 1;
-    for (i = 0; i < n; i++)
-        printf("%d ", (*p)[i]);
-    printf("\n");
-    free(p);
-}
-
-void test_2d(int n, int m)
-{
-    int (*p)[n][m] = malloc(sizeof * p);
-    int i, j;
-    for (i = 0; i < n; i++)
-        for (j = 0; j < m; j++)
-            (*p)[i][j] = i * m + j;
-    for (i = 0; i < n; i++)
-    {
-        for (j = 0; j < m; j++)
-            printf("%3d", (*p)[i][j]);
-        printf("\n");
-    }
-    free(p);
-}
-
-void test_sizeof_stable(int n, int m)
-{
-    int (*p)[n][m] = malloc(sizeof * p);
-    size_t sz = sizeof(*p);
-    printf("sizeof(*p) = %zu\n", sz);
-    n = 999;
-    m = 999;
-    printf("sizeof(*p) after n=999,m=999 = %zu\n", sizeof(*p));
-    printf("same? %d\n", sz == sizeof(*p));
-    free(p);
-}
-
-void fill(int n, int m, int (*grid)[n][m])
-{
-    int i, j;
-    for (i = 0; i < n; i++)
-        for (j = 0; j < m; j++)
-            (*grid)[i][j] = i * 10 + j;
-}
-
-void print_grid(int n, int m, int (*grid)[n][m])
-{
-    int i, j;
-    for (i = 0; i < n; i++)
-    {
-        for (j = 0; j < m; j++)
-            printf("%3d", (*grid)[i][j]);
-        printf("\n");
-    }
-}
-
-void test_vm_param(int n, int m)
-{
-    int (*p)[n][m] = malloc(sizeof * p);
-    fill(n, m, p);
-    print_grid(n, m, p);
-    free(p);
-}
-
-void test_multiple(int n, int m)
-{
-    int (*a)[n] = malloc(sizeof * a);
-    int (*b)[m] = malloc(sizeof * b);
-    int i;
-    for (i = 0; i < n; i++) (*a)[i] = i;
-    for (i = 0; i < m; i++) (*b)[i] = i + 100;
-    printf("a[0]=%d a[n-1]=%d\n", (*a)[0], (*a)[n - 1]);
-    printf("b[0]=%d b[m-1]=%d\n", (*b)[0], (*b)[m - 1]);
-    free(a);
-    free(b);
-}
-
-void test_mixed_dims(int n)
-{
-    int (*p)[4][n] = malloc(sizeof * p);
-    int i, j;
-    for (i = 0; i < 4; i++)
-        for (j = 0; j < n; j++)
-            (*p)[i][j] = i * n + j;
-    for (i = 0; i < 4; i++)
-    {
-        for (j = 0; j < n; j++)
-            printf("%3d", (*p)[i][j]);
-        printf("\n");
-    }
-    free(p);
-}
-
-void test_reassign(int n)
-{
-    int (*p)[n] = malloc(sizeof * p);
-    printf("sizeof(*p) first  = %zu\n", sizeof(*p));
-    free(p);
-    n = 2;                         /* n changes */
-    p = malloc(sizeof * p);         /* new allocation — but snapshot is fixed */
-    printf("sizeof(*p) second = %zu\n", sizeof(*p));
-    free(p);
-}
-
-int main(void)
-{
-    printf("=== 1. 1-D VM pointer ===\n");
-    test_1d(5);
-
-    printf("=== 2. 2-D VM pointer ===\n");
-    test_2d(3, 4);
-
-    printf("=== 3. sizeof stability ===\n");
-    test_sizeof_stable(3, 4);
-
-    printf("=== 4. VM parameter ===\n");
-    test_vm_param(3, 4);
-
-    printf("=== 5. Multiple VM pointers ===\n");
-    test_multiple(4, 3);
-
-    printf("=== 6. Mixed constant/runtime dims ===\n");
-    test_mixed_dims(3);
-
-    printf("=== 7. Reassignment ===\n");
-    test_reassign(5);
-
-    return 0;
-}
+char str[] = "initializer"; /* complete type */
 
+void main(void) {}

src/lib.c

@@ -29026,7 +29026,7 @@ void defer_start_visit_declaration(struct defer_visit_ctx* ctx, struct declarati
 
 //#pragma once
 
-#define CAKE_VERSION "0.12.86"
+#define CAKE_VERSION "0.12.87"
 
 
 
@@ -29220,7 +29220,7 @@ static void check_func_open_brace_style(struct parser_ctx* ctx, struct token* to
 
 static void check_func_close_brace_style(struct parser_ctx* ctx, struct token* token)
 {
- 
+
 }
 
 
@@ -31881,7 +31881,7 @@ struct init_declarator* _Owner _Opt init_declarator(struct parser_ctx* ctx,
             type_is_vm(&p_init_declarator->p_declarator->type))
         {
             /*
-              MSVC accepts this as constant expression. Cake does not.              
+              MSVC accepts this as constant expression. Cake does not.
               static_assert(&((struct X { int i; }*) 0)->i) == 0);
 
 
@@ -31933,20 +31933,34 @@ struct init_declarator* _Owner _Opt init_declarator(struct parser_ctx* ctx,
                 break;
 
             case SIZEOF_RESULT_INCOMPLETE:
-                
+
                 if (p_init_declarator->p_declarator->type.storage_class_specifier_flags & STORAGE_SPECIFIER_EXTERN)
                 {
                     /* extern variables do not need to be complete */
                 }
+                else if (ctx->scopes.tail->scope_level == 0)
+                {
+                    /*
+                      FILE SCOPE is diferent here,.
+                      Incomplete objects at file scope are tentatives
+                      (cake needs a last pass to detect this problem)
+                    */
+                    /*
+                       char str[];  //not an error
+                       char str[] = "abc"; complete type
+                       int main() {}
+                    */
+                }
                 else
                 {
                     compiler_diagnostic(C_ERROR_STORAGE_SIZE,
                        ctx,
                        p_init_declarator->p_declarator->name_opt, NULL,
                        "storage size of '%s' isn't known because the type is incomplete",
                        p_init_declarator->p_declarator->name_opt->lexeme);
+                    throw;
                 }
-                throw;
+
             case SIZEOF_RESULT_FUNCTION:
                 break;
             }
@@ -34776,16 +34790,16 @@ struct function_declarator* declarator_find_function_declarator(const struct dec
     {
         if (p_declarator->direct_declarator->declarator)
             return declarator_find_function_declarator(p_declarator->direct_declarator->declarator);
-        
+
         if (p_declarator->direct_declarator->function_declarator)
         {
             if (p_declarator->direct_declarator->function_declarator->direct_declarator &&
                 p_declarator->direct_declarator->function_declarator->direct_declarator->declarator)
             {
-                struct function_declarator* p = 
+                struct function_declarator* p =
                     declarator_find_function_declarator(p_declarator->direct_declarator->function_declarator->direct_declarator->declarator);
-               if (p)
-                   return p;
+                if (p)
+                    return p;
             }
 
             return p_declarator->direct_declarator->function_declarator;
@@ -59521,22 +59535,23 @@ bool type_is_vm(const struct type* p_type)
     while (p)
     {
         switch (p->category)
-        {        
+        {
         case TYPE_CATEGORY_ARRAY:
             if (p->array_num_elements > 0)
-            {      
+            {
                 /* constant size */
             }
             else
             {
-                if (p->p_array_num_elements_expression == NULL) {
+                if (p->p_array_num_elements_expression == NULL)
+                {
                     /*
-                    * size is unknown but not vm. 
+                    * size is unknown but not vm.
                     * int a[]
                     */
                 }
                 else
-                    return true;                
+                    return true;
             }
             break;
 
@@ -59554,7 +59569,7 @@ bool type_is_vm(const struct type* p_type)
         }
         break;
 
-        case TYPE_CATEGORY_ITSELF:            
+        case TYPE_CATEGORY_ITSELF:
         case TYPE_CATEGORY_POINTER:
             break;
         }
@@ -60989,8 +61004,12 @@ enum sizeof_result type_get_sizeof(const struct type* p_type, size_t* size, enum
         else
         {
             if (p_type->array_num_elements <= 0)
-                return SIZEOF_RESULT_RUNTIME;
+            {
+                if (p_type->p_array_num_elements_expression == NULL)
+                    return SIZEOF_RESULT_INCOMPLETE;
 
+                return SIZEOF_RESULT_RUNTIME;
+            }
             unsigned long long arraysize = p_type->array_num_elements;
             struct type type = get_array_item_type(p_type);