str_list_push: remove unused function

[oweals/opkg-lede.git] / libopkg / active_list.c

diff --git a/libopkg/active_list.c b/libopkg/active_list.c
index 2c91965486ad748f9e886ff7f9d9648d817f66fe..a7ce08e11958f391eecb8c4e6f0882e9b393d449 100644 (file)
--- a/libopkg/active_list.c
+++ b/libopkg/active_list.c
@@ -118,14 +118,6 @@ void active_list_clear(struct active_list *head)
        active_list_init(head);
 }
 
-void active_list_add_depend(struct active_list *node,
-                           struct active_list *depend)
-{
-       list_del_init(&depend->node);
-       list_add_tail(&depend->node, &node->depend);
-       depend->depended = node;
-}
-
 void active_list_add(struct active_list *head, struct active_list *node)
 {
        list_del_init(&node->node);
@@ -145,43 +137,3 @@ void active_list_head_delete(struct active_list *head)
        active_list_clear(head);
        free(head);
 }
-
-/*
- *  Using insert sort.
- *  Note. the list should not be large, or it will be very inefficient.
- *
- */
-struct active_list *active_list_sort(struct active_list *head,
-                                    int (*compare) (const void *,
-                                                    const void *))
-{
-       struct active_list tmphead;
-       struct active_list *node, *ptr;
-       if (!head)
-               return NULL;
-       active_list_init(&tmphead);
-       for (node = active_list_next(head, NULL); node;
-            node = active_list_next(head, NULL)) {
-               if (tmphead.node.next == &tmphead.node) {
-                       active_list_move_node(head, &tmphead, node);
-               } else {
-                       for (ptr = active_list_next(&tmphead, NULL); ptr;
-                            ptr = active_list_next(&tmphead, ptr)) {
-                               if (compare(ptr, node) <= 0) {
-                                       break;
-                               }
-                       }
-                       if (!ptr) {
-                               active_list_move_node(head, &tmphead, node);
-                       } else {
-                               active_list_move_node(head, ptr, node);
-                       }
-               }
-               node->depended = &tmphead;
-       }
-       for (ptr = active_list_prev(&tmphead, NULL); ptr;
-            ptr = active_list_prev(&tmphead, NULL)) {
-               active_list_move_node(&tmphead, head, ptr);
-       }
-       return head;
-}