如何在 c 中正确地释放()我的 mallocs

How to properly free() my mallocs in c

我需要一个动态数组,所以我在我的代码中使用了 malloc...但是我不知道之后如何成功释放内存。在我的代码中的某个地方,我相信我有一个指针重新分配,这会导致悬空指针错误(当我执行 child2=child1 时)。有谁知道如何正确释放我的 mallocs?提前致谢。

我的实际代码如下:

typedef struct Edge//per solution
{
int label;//label
float weight;//energy of each edge
} edge;

// creating the chrom structure
typedef struct Chrom
{
edge **gene;
float fitness_score;
}     

在我的一个函数中,我有以下内容,其中 pop_size 和 num_nodes 之前分别计算为 100 和 10。

Chrom* child1;
Chrom* child2;

//allocate memory of child
child1 = malloc(num_nodes * sizeof(child1));
child2 = malloc(num_nodes * sizeof(child2));
if(child1 == NULL||child2 == NULL)
    printf("ERROR1: Memory allocation failed!");
for(x = 1; x <= num_nodes; x++)
{
    child1[x].gene = malloc(num_nodes * sizeof(edge*));
    child2[x].gene = malloc(num_nodes * sizeof(edge*));
    if(child1[x].gene == NULL||child2[x].gene == NULL)
        printf("ERROR2: Memory allocation failed!");
    for(y = 0; y < num_nodes; y++)
    {
        child1[x].gene[y] = malloc(num_nodes * sizeof(edge));
        child2[x].gene[y] = malloc(num_nodes * sizeof(edge));
        if(child1[x].gene[y] == NULL||child2[x].gene[y] == NULL)
            printf("ERROR3: Memory allocation failed!");
    }
}

//do something...

for(i=0; i<pop_size; i++)
    for(x=0; x<num_nodes; x++)
        for(y=0;y<num_nodes;y++)
            child2[i].gene[x][y].label=child1[i].gene[x][y].label;

free(child1);//can i free the memory like this?
free (child2);// will it automatically do all 'arrays'?

另外,在释放内存之前是否必须先检查是否分配正确?

child1 = malloc(num_nodes * sizeof(child1));

这是不正确的。您正在为 num_nodes 指针分配 space(child1 是指向 Chrom 的指针)。您要为 num_nodes 个 Chrom 实例分配 space。 将其更改为

child1 = malloc(num_nodes * sizeof(*child1));

首先,您为 Chrom 指针分配了 space,而不是为 Chrom 结构分配了 space,所以我很惊讶 child1[x].gene 可以正常工作而不会崩溃,但只回答问题在您的代码中作为评论提出,

free(child1);//can i free the memory like this?
free (child2);// will it automatically do all 'arrays'?

child1 是一个指针数组,每个指针都指向已分配的内存,当您 free(child1) 时,这些内存将丢失。我会先释放每个指针 child1[x].gene,然后再释放 child1。 child2 也一样。

这可能接近您想要的:

typedef struct Edge//per solution
{
  int label;//label
  float weight;//energy of each edge
} edge;

// creating the chrom structure
typedef struct Chrom
{
  edge *gene;  // changed from edge**
  float fitness_score;
};

int main(void)
{
  int num_nodes = 3;
  int x;

  struct Chrom* child1;

  // if you want num_nodes Chrom entries

  child1 = malloc(num_nodes * sizeof(struct Chrom));

  // Allocating individual edges (I don't know why you declare edge** gene
  // so I will assume that what you intended was edge* gene

  for(x = 1; x <= num_nodes; x++)
  {
     child1[x].gene = (edge*)malloc(sizeof(struct Edge));
  }


  // deallocate your memory

  for(x = 1; x <= num_nodes; x++)
  {
     free(child1[x].gene);
  }

  // free your array of Chroms

  free(child1);

  return 0;

}

如果你想在每个 Chrom 中有一个 edegs 的二维数组,代码可能是这样的;另外,我之前的回答有一个错误; x 应该在 for 循环中初始化为 0 而不是 1,因为这会导致数组索引越界并使用 lower-than 而不是 lower-than-or-equal。 (警告:我只是稍微测试了一下):

typedef struct Edge//per solution
{
  int label;//label
  float weight;//energy of each edge
} edge;

// creating the chrom structure
typedef struct Chrom
{
  edge **gene;  
  float fitness_score;
};

int main(void)
{
  int num_nodes = 3;
  int num_edges_x = 2;
  int num_edges_y = 3;
  int x, j;

  struct Chrom* child1;

  // if you want num_nodes Chrom entries

  child1 = malloc(num_nodes * sizeof(struct Chrom));

  // Allocating 2D array of edges for each Chrom
  // USE zero-based indexing.

  for(x=0; x < num_nodes; x++)
  {
     child1[x].gene = (edge**)malloc(num_edges_x * sizeof(edge*));

     // initialise you array of edges

     for (j=0; j<num_edges_x; j++)
     {
         child1[x].gene[j] = (edge*)malloc(num_edges_y * sizeof(edge));           
     }
  }

  // Use a child1[x].gene[x][y]

  child1[0].gene[0][0].label = 3;
  child1[0].gene[0][0].weight = 7.2F;

  printf("\nlabel: %d - weight: %f", child1[0].gene[0][0].label,   child1[0].gene[0][0].weight);

  child1[1].gene[0][0].label = 1;
  child1[1].gene[0][0].weight = 12.4F;

  printf("\nlabel: %d - weight: %f", child1[1].gene[0][0].label,  child1[1].gene[0][0].weight);

  child1[1].gene[1][0].label = 5;
  child1[1].gene[1][0].weight = 112.6F;

  printf("\nlabel: %d - weight: %f", child1[1].gene[1][0].label,      child1[1].gene[1][0].weight);

  // deallocate your memory
  for(x =0; x < num_nodes; x++)
  {

     for (j=0; j<num_edges_x; j++)
     {
        free(child1[x].gene[j]);
     }

     free(child1[x].gene);
  }

  free(child1);

  return 0;
}