c - 文件到C中的链表？

Question

我是 C 编程的新手，我无法解决检测到错误堆栈粉碎的问题

我需要读取文件到链表。该文件如下所示:

    chicago;addie;story begins here;-----#####-----------|-----#@$.#-----------|-----#####-----------
    houston;harvey;we got a problem;-----#####-----------|-----#---#-----------|-----#$--#-----------|---###--$##----------|---#--$-$-#----------|-###-#-##-#---######-|-#---#-##-#####--..#-|-#-$--$----------..#-|-#####-###-#@##--..#-|-----#-----#########-|-----#######---------

游戏推箱子有关卡，(每一关占一行)

我需要使用函数 load_levels() 将所有级别加载到链表和另一个 parse_level() 接收一个级别作为参数并解析级别

有人可以帮忙吗？它在 load_levels 中失败(在源代码中用注释标记)

这是我的源代码:

    #include <stdlib.h>
    #include <stdio.h>
    #include <curses.h>
    #include <unistd.h>
    #include <string.h>

    typedef struct level{
        char name[50];
        char password[50];
        char description[100];  
        char map[200];
        struct level *next_level;
    }LEVEL;

    LEVEL* parse_level(char *string) {

    char level_name[50];
    char level_password[50];
    char level_descrition[100];
    char level_map[200];

    int i = 0;
    int j = 0;
    while (string[i] != ';') {
        level_name[j] = string[i];
        i++;
        j++;
    }
    j = 0;
    while (string[i] != ';') {
        level_password[j] = string[i];
        i++;
        j++;
    }
    j = 0;
    while (string[i] != ';') {
        level_descrition[j] = string[i];
        i++;
        j++;
    }
    j = 0;
    while (string[i] != '\0') {
        level_map[j] = string[i];
        i++;
        j++;
    }
    j = 0;

    LEVEL *current;
    current = (LEVEL *) malloc(sizeof (LEVEL));
    if (current != NULL) {
        strncpy(current->name, level_name, strlen(level_name) + 1);
        strncpy(current->description, level_descrition, strlen(level_descrition) + 1);
        strncpy(current->password, level_password, strlen(level_password) + 1);
        strncpy(current->map, level_map, strlen(level_map) + 1);

        current->next_level = NULL;
    }
    return (current);
}

LEVEL* load_levels(char* file_path) {
FILE *fr;
    fr = fopen(file_path, "r");
    if (fr == NULL) {
        printw("ERROR: file no open\n");
        refresh();
        usleep(1000000);
        exit(EXIT_FAILURE);
    }
    LEVEL *current;
    LEVEL *first;

#define MAX 1000
    char one_line[MAX];
    fgets(one_line, MAX, fr);

    first = current = parse_level(one_line);

    while (fgets(one_line, MAX, fr) != NULL) {

        printw("5");      
    refresh();
    usleep(1000000);


 // here it fails - stack smashing detected.     
        current->next_level = parse_level(one_line);

        printw("6");
    refresh();
    usleep(1000000);

        current = current->next_level;
        current->next_level = NULL;
    }

    fclose(fr);
    return (first);
}

编辑:我用当前问题更新了代码和问题。

Answer 1

此 load_levels() 函数一次性读取文件，并返回生成的链表。为了破坏事物，我更改了一些变量名称，并删除了不相关的 curses 内容。

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

struct level{
    struct level *next;
    char name[50];
    char password[50];
    char description[100];
    char map[200];
    };

struct level *load_levels(char* file_path)
{
FILE *fp;
struct level *ret = NULL, **hnd = &ret;
size_t one, two, three, last, len;
char line[400];

fp = fopen(file_path, "r");
if (!fp ) {
    fprintf(stderr, "ERROR: opening file \"%s\"\n", file_path);
    return NULL;
}

while (fgets(line, sizeof line, fp)) {

      /* find position of first semicolon */
    for(one=0; line[one]; one++) {
            if (line[one] == ';') break;
        }
    if (!line[one]) {
         /* Maybe complain about incomplete line here */
        continue;
        }

      /* find the second semicolon */
    for(two =one+1; line[two]; two++) { if (line[two] == ';') break; }
    if (!line[two]) { continue; }

    for(three =two+1; line[three]; three++) { if (line[three] == ';') break; }
    if (!line[three]) { continue; }

    for(last =three+1; line[last]; last++) {
        if (line[last] == '\r' || line[last] == '\n') break;         
        }
    if (!line[last]) { continue; }

    *hnd = malloc(sizeof **hnd);
    if ( !*hnd) break;

#define MINLEN(a,b) ((a)<(b) ? (a) : (b))
    len = MINLEN(one, sizeof ret->name -1);
    memcpy( (*hnd)->name, line, len); (*hnd)->name[len] = 0;

    len = MINLEN(two-one, sizeof ret->password) -1;
    memcpy( (*hnd)->password, line+one+1, len); (*hnd)->password[len] = 0;

    len = MINLEN(three-two, sizeof ret->description) -1;
    memcpy( (*hnd)->description, line+two+1, len); (*hnd)->description[len] = 0;

    len = MINLEN(last-three, sizeof ret->map) -1;
    memcpy( (*hnd)->map, line+three+1, len); (*hnd)->map[len] = 0;
#undef MINLEN

    (*hnd)->next = NULL;
    hnd = &(*hnd)->next;
    }
fclose(fp);
return ret;
}

int main(int argc, char **argv)
{
struct level *lp;

for(lp = load_levels(argv[1]); lp; lp=lp->next) {
        fprintf(stdout, "%s!%s!%s!%s\n"
        , lp->name, lp->password, lp->description, lp->map);
        }
return 0;
}