為什么此鏈表出現段故障？

Question

如果在insertAfter之后調用insertBefore或多次調用insertAfter，以下代碼將導致分段錯誤。

void insertBefore(list *l, void *p){
    node* newNode = malloc(sizeof(node) + l->SizeOfData);
    memcpy(newNode->item, p, l->SizeofData);
    l->curent->previous->next = newNode;
    l->current->previous = newNode;
}
void insertAfter(list *l, void *p){
    node* newNode = malloc(sizeof(node) + l->SizeOfData);
    memcpy(newNode->item, p, l->SizeofData);
    l->curent->next->previous = newNode;
    l->current->previous->next = newNode;
    l->current = newNode;
}

使用的列表是：

struct node {
    struct node *previous;
    struct node *next;
    char item[];
};

typedef struct node node;

struct list {
    node *first;
    node *current;
    node *last;
    int SizeOfData;
};

list *newList(int b) {
    list *list = malloc(sizeof(list));
    node *sentnode = malloc(sizeof(node));
    sentnode->previous = sentnode;
    sentnode->next = sentnode;
    list->first = sentnode;
    list->current = sentnode;
    list->last = sentnode;
    list->SizeOfData = b;
    return list;
}

Answer 1

您忘記設置newNode的previous和next指針。 insertAfter （更改的行）中還有另一個錯誤。

void insertBefore(list *l, void *p){
    node* newNode = malloc(sizeof(node) + l->SizeOfData);
    memcpy(newNode->item, p, l->SizeofData);
    newNode->previous = l->current->previous;   // Added line
    newNode->next = l->current;                 // Added line
    l->current->previous->next = newNode;
    l->current->previous = newNode;
}

void insertAfter(list *l, void *p){
    node* newNode = malloc(sizeof(node) + l->SizeOfData);
    memcpy(newNode->item, p, l->SizeofData);
    newNode->previous = l->current;        // Added line
    newNode->next = l->current->next;      // Added line
    l->current->next->previous = newNode;  
    l->current->next = newNode;            // Changed line
    l->current = newNode;
}