c - 系统小程序 : Assertion failed - How can I solve?

标签 c memory graph malloc

我正在编写一些简单的函数来管理图形。

当我运行我的程序时出现以下错误:

malloc.c:3096: sYSMALLOc: Assertion `(old_top == (((mbinptr) (((char *)
&((av)->bins[((1) - 1) * 2])) - __builtin_offsetof (struct malloc_chunk, fd))))
&& old_size == 0) || ((unsigned long) (old_size) >= (unsigned long)
((((__builtin_offsetof (struct malloc_chunk, fd_nextsize))
+((2 * (sizeof(size_t))) - 1)) & ~((2 * (sizeof(size_t))) - 1)))
&& ((old_top)->size & 0x1) && ((unsigned long)old_end & pagemask) == 0)' failed.

我执行 valgrind,它向我显示了这个错误:

==5903== Memcheck, a memory error detector
==5903== Invalid write of size 4
==5903==    at 0x8048866: creategraph
==5903==    by 0x8048718: readFile
==5903==    by 0x80486BF: main
==5903==  Address 0x41c3204 is 0 bytes after a block of size 4 alloc'd
==5903==    at 0x4027ABA: malloc (vg_replace_malloc.c:263)
==5903==    by 0x8048850: createGraph
==5903==    by 0x8048718: readFile
==5903==    by 0x80486BF: main

这是我的结构

typedef struct GRAPH {
   int id;
   int destination;
   int cost;
   struct GRAPH *next;
   struct GRAPH *prev;
} GRAPH;

这是我的函数 readFile

void readFile() {
   FILE *f = NULL;
   char c;
   f = fopen("g.txt", "r");
   if (f == NULL) {
     puts("Error");
   }
   int line = 0, column = 0;
   g = createGraph(16);
   while (!feof(f)) {
     c = fgetc(f);
     if (c == '\n') {
        line++;
     } else if (c == '1') {
        createEdge(line, column, 1, g);
        column++;
     }
   }
  fclose(f);
 }

这是我的函数 createGraph

graph **creatgraph(int tV) {
   int i;
   graph **v;
   v = (graph**) malloc(sizeof (graph*));
   if (v == NULL) {
      puts("Error");
      exit(EXIT_FAILURE);
   }
   for (i = 0; i < tV; i++) {
      v[i] = NULL;
   }
   return v;
}

这是我的函数 createVertex

graph *createVertex() {
   graph *newVertex = NULL;
   newVertex = (graph*) malloc(sizeof (graph));
   if (newVertex == NULL) {
      puts("Error");
      exit(EXIT_FAILURE);
   }
   newVertex->id = 0;
   newVertex->destination = 0;
   newVertex->cost = 1;
   newVertex->next = NULL;
   novoVertice->prev = NULL;
   return (newVertex);
}

这是我的函数 createEdge

void createEdge(int vStart, int vFinal, int id, graph** g) {
   graph *newVertex = createVertex();
   newVertex->destination = vFinal;
   newVertex->id = id;
   g[vFinal] = insertLast(g[vStart], newVertex);
}

非常感谢您的帮助。

最佳答案

这里有一个内存损坏错误:

   v = (graph**) malloc(sizeof (graph*));
   ...
   for (i = 0; i < tV; i++) {
      v[i] = NULL;
   }

您只为一个 graph* 指针分配存储空间,但将分配的 block 视为足够大以容纳 tV 此类指针。

要修复,请将 malloc() 调用更改为:

   v = (graph**) malloc(tV * sizeof (graph*));

关于c - 系统小程序 : Assertion failed - How can I solve?,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/10319288/

相关文章:

java - 将 C 源 CRC16CITT 函数转换为 Java

c - 为什么我的打印函数会用以下代码中的最后一个条目覆盖以前的条目?

c - 尝试计算文件中的单词数

c - 为什么这个 sizeof(c+a) 给出 4 个字节而不是 3 个字节

c - 为什么在 C 中自动变量分配在堆栈内存中而不是堆内存中?

python - SQLAlchemy 吃 RAM

algorithm - 存储具有未知节点顺序的图

mysql - Jelastic MySQL 在空闲时使用大量内存

java - 将图表存储在数据库中

java - 如何将类分配给graphstream中的节点