linkedlist: Remove all nodes matching given data & concatenating two list

Author: updateing

include/linkedlist.h

@@ -19,6 +19,11 @@ void insert_data(LIST_ELEMENT** start, void* data);
  */
 void* lookup_data(LIST_ELEMENT* start, void* elem_to_find, int(*cmpfunc)(void*, void*));
 
+/*
+ * Remove all nodes matching specific data using custom compartor, zeroing its reference
+ */
+void remove_data(LIST_ELEMENT** start, void* elem_to_remove, int(*cmpfunc)(void*, void*), int free_content);
+
 /*
  * user pointer is passed to func directly, for private use
  * Prototype of func: void func(void* current_data, void* user);
@@ -31,7 +36,8 @@ void list_traverse(LIST_ELEMENT* start, void(*func)(void*, void*), void* user);
 void list_destroy(LIST_ELEMENT** start, int free_content);
 
 /*
- * Remove specific data using custom comprator, zeroing its reference
+ * Concatenate two lists. This will NOT duplicate the nodes in second list.
+ * So make sure they are always available.
  */
-void remove_data(LIST_ELEMENT** start, void* elem_to_remove, int(*cmpfunc)(void*, void*), int free_content);
+void list_concat(LIST_ELEMENT** org_list, LIST_ELEMENT* new_list);
 #endif

util/linkedlist.c

@@ -47,6 +47,16 @@ void list_traverse(LIST_ELEMENT* start, void(*func)(void*, void*), void* user) {
     }
 }
 
+void list_concat(LIST_ELEMENT** org_list, LIST_ELEMENT* new_list) {
+    if (org_list == NULL) return;
+    if (*org_list == NULL) {
+        *org_list = new_list;
+        return;
+    }
+
+    (find_last_node(*org_list))->next = new_list;
+}
+
 void list_destroy(LIST_ELEMENT** ref, int free_content) {
     LIST_ELEMENT* curr = NULL, *next = *ref;
     while ((curr = next)) {
@@ -70,7 +80,7 @@ void remove_data(LIST_ELEMENT** start, void* elem_to_remove, int(*cmpfunc)(void*
                 free(curr->content);
             }
             free(curr);
-            return;
+            continue;
         }
         curr_ref = &curr->next;
     }