Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8608853
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 12, 20262026-06-12T03:43:31+00:00 2026-06-12T03:43:31+00:00

This is C99 code: typedef struct expr_t { int n_children; foo data; // Maybe

  • 0

This is C99 code:

typedef struct expr_t
{
    int n_children; 
    foo data; // Maybe whatever type with unknown alignment
    struct expr_t *children[];
} expr_t;

Now, how do I allocate memory ?

expr_t *e = malloc (sizeof (expr_t) + n * sizeof (expr_t *));

or

expr_t *e = malloc (offsetof (expr_t, children) + n * sizeof (expr_t *));

?

Is sizeof even guaranteed to work on an type with flexible array member (GCC accepts it) ?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-12T03:43:32+00:00Added an answer on June 12, 2026 at 3:43 am

    expr_t *e = malloc (sizeof (expr_t) + n * sizeof (expr_t *)); is well defined in C99. From the C99 specification 6.7.2.1.16:

    As a special case, the last element of a structure with more than one
    named member may have an incomplete array type; this is called a
    flexible array member. In most situations, the flexible array member
    is ignored. In particular, the size of the structure is as if the
    flexible array member were omitted except that it may have more
    trailing padding than the omission would imply.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Please consider the following code: typedef struct { int type; } object_t; typedef struct
Where can we write code like struct Foo { int bar; int baz; }
Does this code follow C standards (e.g. C89, C99, C10x)? void main(int a,int b,
Is this valid C (C99) code? int f(); int g(int x) { if (x<0)
This is some code I'm compiling on Linux: #include <net/if.h> int main() { struct
I have the following code: int main(void) { struct { int x; } a,
I found this example code and I tried to google what (int (*)[])var1 could
While debugging a crash, I came across this issue in some code: int func()
Is the following code legal according to C99? ... for(....) { int x =
The C99 standard allows the creation of flexible array members such as typedef struct

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.