C中的有序链表导致内存错误？

Question

我写了一个函数

void
insertNode(node_t *front, node_t *nodeIn) {
    node_t *currentNode = front;
    node_t *copy;
    if (!(copy = (node_t*)malloc(sizeof(struct node)))) {
        printf("Out of memory, exiting here?");
        exit(0);
    }   
    strcpy(copy->name, nodeIn->name);
    copy->aisle = nodeIn->aisle;
    copy->shelf = nodeIn->shelf;
    copy->mass = nodeIn->mass;
    copy->price = nodeIn->price;
    copy->quantity = nodeIn->quantity;
    copy->next = NULL;

    if (front == NULL || strcmp(front->name,copy->name) > 0) {
        copy->next = currentNode;
        front = copy;
        printf("%s\n", front->name);
    }
    else {  
        while (currentNode->next != NULL && 
            strcmp((currentNode->next)->name,copy->name) < 0) {
            currentNode = currentNode->next;
        }
        copy->next = currentNode->next;
        currentNode->next = copy;
    }
}

它接收指向前节点的指针和我想要插入到列表中的节点，但它没有按预期运行。我的代码中有什么明显的地方可能会被破坏吗？

Answer 1

/**
 * @param front Might be changed upon insertion in front
 * @param nodeIn payload to insert; will neither be changed,
 *               nor used in the list
 */
void
insertNode(node_t **front, node_t *nodeIn) {
    node_t *copy;
    if (!(copy = (node_t*)malloc(sizeof(node_t)))) {
        printf("Out of memory, exiting here?");
        exit(0);
    }   
    copy->name = strdup(nodeIn->name);
    copy->aisle = nodeIn->aisle;
    copy->shelf = nodeIn->shelf;
    copy->mass = nodeIn->mass;
    copy->price = nodeIn->price;
    copy->quantity = nodeIn->quantity;

    node_t **currentNode = front;
    while (*currentNode != NULL && strcmp((*currentNode)->name, copy->name) < 0) {
        currentNode = &(*currentNode)->next;
    }
    copy->next = *currentNode;
    *currentNode = copy;
}

• front 指针是一个输入输出参数，因为在前面插入时它可能会发生变化。
• name 未分配，strdup 使字符串重复。
• currentNode 是别名。它允许更改前面的变量，或一些下一个字段。
• wile 循环将 currentNode 定位在右侧变量上。

删除也应该释放名称。

用法：

node_t *list = NULL;
node_t data;

data.name = "unu";
...
insertNode(&list, &data);
data.name = "du";
...
insertNode(&list, &data);
data.name = "tri";
...
insertNode(&list, &data);