So is a common practice to define struct reclamation method parameter as a pointer to a const struct so we can avoid casting to non-const any time and do this dirty cast once in the reclamation method implementation?
No. It is more common to not use const with dynamically allocated structures, or with structures containing pointers to dynamically allocated memory.
You only mark const things you do not intend to modify; and freeing it or data referred to by its members is a modification. Just look at how free() is declared: void free(void *), not void free(const void *).
That is the core problem in OP's code, and using struct test_struct_t *test_struct_ptr = create(10); without the const qualifier is the proper solution.
There is an interesting underlying question here, though, that I want to chew a bit on, because the wording of this question is such that those looking for answers to it will encounter this question via a web search.
How to reclaim struct correctly?
Let's look at a real-world case: a dynamically allocated string buffer. There are two basic approaches:
typedef struct {
size_t size; /* Number of chars allocated for data */
size_t used; /* Number of chars in data */
unsigned char *data;
} sbuffer1;
#define SBUFFER1_INITIALIZER { 0, 0, NULL }
typedef struct {
size_t size; /* Number of chars allocated for data */
size_t used; /* Number of chars in data */
unsigned char data[];
} sbuffer2;
One can declare and initialize the first version using the preprocessor initializer macro:
sbuffer1 my1 = SBUFFER1_INITIALIZER;
This is used in e.g. POSIX.1 pthread_mutex_t mutexes and pthread_cond_t condition variables.
However, because the second one has a flexible array member, it cannot be declared statically; you can only declare pointers to it. So, you need a constructor function:
sbuffer2 *sbuffer2_init(const size_t initial_size)
{
sbuffer2 *sb;
sb = malloc(sizeof (sbuffer2) + initial_size);
if (!sb)
return NULL; /* Out of memory */
sb->size = initial_size;
sb->used = 0;
return sb;
}
which you use thus:
sbuffer2 *my2 = sbuffer2_init(0);
although I personally implement the related functions so that you can do
sbuffer2 *my2 = NULL;
as the equivalent of sbuffer1 my1 = SBUFFER1_INITIALIZER;.
A function that can grow or shrink the amount of memory allocated for the data, only needs a pointer to the first structure; but either a pointer to the pointer to the second structure, or return the possibly modified pointer, for the changes to be visible to the caller.
For example, if we wanted to set the buffer contents from some source, perhaps
int sbuffer1_set(sbuffer1 *sb, const char *const source, const size_t length);
int sbuffer2_set(sbuffer2 **sb, const char *const source, const size_t length);
Functions that only access the data but do not modify it also differ:
int sbuffer1_copy(sbuffer1 *dst, const sbuffer1 *src);
int sbuffer2_copy(sbuffer2 **dst, const sbuffer2 *src);
Note that the const sbuffer2 *src is not a typo. Because the function will not modify the src pointer (we could make it const sbuffer2 *const src!), it does not need a pointer to the pointer to the data, just the pointer to the data.
The really interesting part is the reclaim/free functions.
The functions to free such dynamically allocated memory do differ in one important part: the first version can trivially poison the fields to help detect use-after-free bugs:
void sbuffer1_free(sbuffer1 *sb)
{
free(sb->data);
sb->size = 0;
sb->used = 0;
sb->data = NULL;
}
The second one is tricky. If we follow the above logic, we would write a poisoning reclaim/free function as
void sbuffer2_free1(sbuffer2 **sb)
{
free(*sb);
*sb = NULL;
}
but because programmers are used to the void *v = malloc(10); free(v); pattern (as opposed to free(&v);!), they usually expect the function to be
void sbuffer2_free2(sbuffer2 *sb)
{
free(sb);
}
instead; and this one cannot poison the pointer. Unless the user does the equivalent of sbuffer2_free2(sb); sb = NULL;, there is a risk of reusing the contents of sb afterwards.
The C libraries do not usually return the memory immediately to the OS, but just add it to its own internal free list, to be used by a subsequent malloc(), calloc(), or realloc() call. This means that in most situations the pointer can still be dereferenced after a free() without a runtime error, but the data it points to will be something completely different. This is what makes these bugs so nasty to reproduce and debug.
Poisoning is simply setting the structure members to invalid values, so that the use-after-free is easily detected at run time, because of the easily-seen values. Setting the pointer used to access dynamically allocated memory to NULL means that if the pointer is dereferenced, the program should crash with a segmentation fault. This is much easier to debug with a debugger; at least you can find easily exactly where and how the crash occurred.
This is not so important in self-contained code, but for library code, or for code used by other programmers, it can make a difference in the general quality of the combined code. It depends; I always judge it on a case-by-case basis, although I do tend to use the pointer-member-and-poisoning version for examples.
I've waxed and waned much more about pointer members versus flexible array members in this answer. It might be interesting to those wondering about how to reclaim/free structures, and how to choose which type (pointer member or flexible array member) to use in various cases.
