我有以下代码,我对为什么会出现分段错误感到困惑。
typedef struct {
int tag;
int valid;
} Row;
typedef struct {
int index;
int num_rows;
Row **rows;
} Set;
/* STRUCT CONSTRUCTORS */
// Returns a pointer to a new Sow.
// all fields of this row are NULL
Row* new_row() {
Row* r = malloc(sizeof(Row));
return r;
}
// Returns a pointer to a new Set.
// the set's index is the given index, and it has an array of
// rows of the given length.
Set* new_set( int index, int num_rows, int block_size ) {
Set* s = malloc(sizeof(Set));
s->index = index;
s->num_rows = num_rows;
Row* rows[num_rows];
for (int i = 0; i < num_rows; i++) {
Row* row_p = new_row();
rows[i] = row_p;
}
s->rows = rows;
return s;
}
/* PRINTING */
void print_row( Row* row ) {
printf("<<T: %d, V: %d>>", row->tag, row->valid);
}
void print_set( Set* set ) {
printf("[ INDEX %d :", set->index);
for (int i = 0; i < set->num_rows; i++) {
Row* row_p = set->rows[i];
print_row(row_p);
}
printf(" ]\n");
}
int main(int argc, char const *argv[]) {
Set* s = new_set(1, 4, 8);
print_set(s);
return 0;
}
基本上Set
有一个指向Row
数组的指针。我认为Row* row_p = set->rows[i];
是从集合中获取行的正确方法,但我必须遗漏一些东西。
答案 0 :(得分:4)
您正在分配Row*
s
Row* rows[num_rows];
for (int i = 0; i < num_rows; i++) {
Row* row_p = new_row();
rows[i] = row_p;
}
s->rows = rows;
并让rows
的{{1}}指针指向该指针。函数返回后,本地数组不再存在,因此Set
是一个悬空指针。返回函数后仍然有效的内存必须与s->rows
(或其中一个表兄弟)分配。
答案 1 :(得分:1)
s->rows
在函数rows
中分配了局部变量new_set()
的地址,这意味着s->rows
在new_set()
时为dangling pointer回报。动态分配Row*
数组以纠正:
s->rows = malloc(num_rows * sizeof(Row*));
if (s->rows)
{
/* for loop as is. */
}
请注意,s->rows
及其元素必须为free()
d。