Loading lib/llist.c +16 −4 Original line number Diff line number Diff line Loading @@ -55,7 +55,13 @@ Curl_llist_alloc(curl_llist_dtor dtor) } /* * Curl_llist_insert_next() returns 1 on success and 0 on failure. * Curl_llist_insert_next() * * Inserts a new list element after the given one 'e'. If the given existing * entry is NULL and the list already has elements, the new one will be * inserted first in the list. * * Returns: 1 on success and 0 on failure. */ int Curl_llist_insert_next(struct curl_llist *list, struct curl_llist_element *e, Loading @@ -73,14 +79,20 @@ Curl_llist_insert_next(struct curl_llist *list, struct curl_llist_element *e, list->tail = ne; } else { ne->next = e->next; /* if 'e' is NULL here, we insert the new element first in the list */ ne->next = e?e->next:list->head; ne->prev = e; if(e->next) { if(!e) { list->head->prev = ne; list->head = ne; } else if(e->next) { e->next->prev = ne; } else { list->tail = ne; } if(e) e->next = ne; } Loading Loading
lib/llist.c +16 −4 Original line number Diff line number Diff line Loading @@ -55,7 +55,13 @@ Curl_llist_alloc(curl_llist_dtor dtor) } /* * Curl_llist_insert_next() returns 1 on success and 0 on failure. * Curl_llist_insert_next() * * Inserts a new list element after the given one 'e'. If the given existing * entry is NULL and the list already has elements, the new one will be * inserted first in the list. * * Returns: 1 on success and 0 on failure. */ int Curl_llist_insert_next(struct curl_llist *list, struct curl_llist_element *e, Loading @@ -73,14 +79,20 @@ Curl_llist_insert_next(struct curl_llist *list, struct curl_llist_element *e, list->tail = ne; } else { ne->next = e->next; /* if 'e' is NULL here, we insert the new element first in the list */ ne->next = e?e->next:list->head; ne->prev = e; if(e->next) { if(!e) { list->head->prev = ne; list->head = ne; } else if(e->next) { e->next->prev = ne; } else { list->tail = ne; } if(e) e->next = ne; } Loading