消失的字符串

时间:2014-05-25 11:25:01

标签: c string malloc strdup

这是我在这里发表的第一篇文章,所以我提前感谢大家提供任何帮助。

我遇到了消失信息的问题。该程序应该从文件中读取书名和库ID号,创建链表的哈希表,其中每个节点包含一个书结构,其中包含书的标题,另一个链表与库ID,书可以被发现。此时我只是想填充哈希表但由于某种原因我的标题值正在消失。文件格式如下所示:

2345年,老人与海 567434,哈利波特 1233,学习的艺术
等...

我有

typedef NodeStruct {void* data; NodePtr prev; NodePtr next;} NodeStruct;

typedef NodeStruct* NodePtr;

typedef ListStruct {NodePtr first; NodePtr last; NodePtr current; } ListStruct;

typedef ListStruct* ListHndl;

typedef BookStruct {char* title; ListHndl lib; } BookStruct;

typedef BookStruct* BookHndl;

FILE *fileptr;
int numlines;
int numslots;
int i;
int index;
NodePtr fillnode;


int main(int argc, char *argv[]) {
    fileptr = fopen(argv[1], "r");

    if (!fileptr) {
        printf("Error: cannot open file\n");
        return 1;
    }
    int *libID = malloc(sizeof(int));
    printf("(main) libID: %p\n", libID);
    fscanf(fileptr, "%d %d", &numlines, &numslots);
    printf("(main) numlines: %d   numslots: %d\n", numlines, numslots);
    ListHndl *H = calloc(numslots, sizeof(ListHndl));
    printf("(main) calloc iterated\n");

    for (i = 0; i < numlines; i++) {
        printf("*************LOOP #%d*************\n", i);
        char *title = malloc(sizeof(char) * 50);
        if (fscanf(fileptr, "%d%*c%*c%[^\n]", libID, title) == 0) {
            printf("Error: incorrect # of keys\n");
            return 1;
        }
        printf("(main) book: %s  ID: %d\n", title, *libID); 
        index = hash(title, numslots);
        printf("(main) index: %d\n", index);
        printf("(main) hash[index]: %p\n", H[index]);
        if (H[index] == NULL) {
            H[index] = newList();
            printf("(main_if_H_NULL) hash[index]: %p\n", H[index]);
            BookHndl B = newBook(title, libID);
            printf("(main_if_H_NULL) BookHndl B: %p\n", B);
            insertAtFront(H[index],(void *) B);
            printf("(main_if_H_NULL) H[index] title: %s  ID: %d\n", ((BookHndl) H[index]->first->data)->title, 
                        *((int *) ((BookHndl) H[index]->first->data)->lib->first->data));
        }
        printAll(H, numslots);
        NodePtr S = searchTitle(H[index], title);
        printf("(main) NodePtr S: %p\n", S);
        if (S == NULL) {
            BookHndl B = newBook(title, libID);
            insertAtBack(H[index], (void *) B);
            printf("(main_if_!S) inserted book\n");
        } else {
            printf("(main_if_S)\n");
            ListHndl idL = ((BookHndl) S->data)->lib;
            if (searchID(idL, libID) == 0) {
                insertAtBack(idL, (void *) libID);
                printf("(main_if_S) inserted libID\n");
            }
        }
        free((char *) title);
        free((NodePtr) S);
        printAll(H, numslots);
        printf("hash[%d]: %s in library # %d\n", index, title, *libID);
    }

    return 1;
}

实际上有四个fscanf参数%d用于libID,%* c用于跳过&#34;,&#34;,另一个%* c用于跳过&#34; &#34;和%[^ / n]读取标题,直到读取换行符。在确认了libID和title中的正确值之后不久的print语句。在printAll(H,numslots),所有值都存在,返回NodePtr S = searchTitle(H [index],title)时标题消失。下面是我的newBook和searchTitle函数

BookHndl newBook(char* str, int* ID) {
    BookHndl B = malloc(sizeof(BookStruct));
    /*B->title = malloc(sizeof(char) * 50);*/
    B->title = strdup(str);
    printf("(newBook) B->title = %s\n", B->title);
    B->lib = newList();
    printf("(newBook) B->lib = %p\n", B->lib);
    insertAtFront(B->lib, (void *) ID);
    printf("(newBook) B->lib->first = %d\n", *((int *)B->lib->first->data));

    return B;
}

NodePtr searchTitle(ListHndl L, char* key) {
    assert(L != NULL);
    if (isEmpty(L)) {
        printf("Book list empty\n");
        return NULL;
    } else {
        L->current = L->first;
        printf("(searchTitle) ListHndl L = %p, L->first = %p, L->first->data = %p\n", L, L->first, (BookHndl) L->first->data);
        while (L->current != NULL) {
            BookHndl B = malloc(sizeof(BookStruct));
            B = (BookHndl) L->current->data;
            printf("(searchTitle) bookhandle B = %p\n", B);
            printf("(searchTitle) B->title = %s\n B->ID = %d\n", B->title, *((int *) B->lib->first->data));
            if (strcmp(B->title, key) == 0) {
                free(B);
                return L->current;
            }
            free(B);
            L->current = L->current->next;
        }
    }
    return NULL;
}

1 个答案:

答案 0 :(得分:0)

此代码已损坏。

BookHndl B = malloc(sizeof(BookStruct));
B = (BookHndl) L->current->data;
// ...
free(B);

这将泄漏一大块内存,然后从节点结构中释放出一些东西。解决这个问题,问题可能会消失。