- */
-struct active_list * active_list_next(struct active_list *head, struct active_list *ptr) {
- struct active_list *next=NULL;
- if (!head || !ptr) {
- fprintf(stderr, "active_list_prev head = %p, ptr = %p invalid value!!\n", head, ptr);
- return NULL;
- }
- if (ptr == head) {
- head->walked = !head->walked;
- next = list_entry(ptr->node.next, struct active_list, node);
- if (next == head)
- return NULL;
- return active_list_next(head, next);
- }
- if (ptr->depend.next != &ptr->depend) {
- next = list_entry(ptr->depend.next, struct active_list, node);
- if (head->walked != next->walked) {
- ptr->walked = head->walked;
- return active_list_next(head, next);
- }
- }
- if (ptr->walked != head->walked) {
- ptr->walked = head->walked;
- return ptr;
- }
-
- if (ptr->depended && ptr->node.next == &ptr->depended->depend ) {
- return ptr->depended;
- }
-
- if (ptr->node.next != &head->node) {
- next = list_entry(ptr->node.next, struct active_list, node);
- return active_list_next(head, next);
- }
- return NULL;
+ */
+struct active_list *active_list_next(struct active_list *head,
+ struct active_list *ptr)
+{
+ struct active_list *next = NULL;
+ if (!head) {
+ opkg_msg(ERROR, "Internal error: head=%p, ptr=%p\n", head, ptr);
+ return NULL;
+ }
+ if (!ptr)
+ ptr = head;
+ next = list_entry(ptr->node.next, struct active_list, node);
+ if (next == head) {
+ return NULL;
+ }
+ if (ptr->depended && &ptr->depended->depend == ptr->node.next) {
+ return ptr->depended;
+ }
+ while (next->depend.next != &next->depend) {
+ next = list_entry(next->depend.next, struct active_list, node);
+ }
+ return next;
+}
+
+struct active_list *active_list_prev(struct active_list *head,
+ struct active_list *ptr)
+{
+ struct active_list *prev = NULL;
+ if (!head) {
+ opkg_msg(ERROR, "Internal error: head=%p, ptr=%p\n", head, ptr);
+ return NULL;
+ }
+ if (!ptr)
+ ptr = head;
+ if (ptr->depend.prev != &ptr->depend) {
+ prev = list_entry(ptr->depend.prev, struct active_list, node);
+ return prev;
+ }
+ if (ptr->depended && ptr->depended != head
+ && &ptr->depended->depend == ptr->node.prev) {
+ prev =
+ list_entry(ptr->depended->node.prev, struct active_list,
+ node);
+ } else
+ prev = list_entry(ptr->node.prev, struct active_list, node);
+ if (prev == head)
+ return NULL;
+ return prev;
+}
+
+struct active_list *active_list_move_node(struct active_list *old_head,
+ struct active_list *new_head,
+ struct active_list *node)
+{
+ struct active_list *prev;
+ if (!old_head || !new_head || !node)
+ return NULL;
+ if (old_head == new_head)
+ return node;
+ prev = active_list_prev(old_head, node);
+ active_list_add(new_head, node);
+ return prev;
+}
+
+static void list_head_clear(struct list_head *head)
+{
+ struct active_list *next;
+ struct list_head *n, *ptr;
+ if (!head)
+ return;
+ list_for_each_safe(ptr, n, head) {
+ next = list_entry(ptr, struct active_list, node);
+ if (next->depend.next != &next->depend) {
+ list_head_clear(&next->depend);
+ }
+ active_list_init(next);
+ }
+}
+
+void active_list_clear(struct active_list *head)
+{
+ list_head_clear(&head->node);
+ if (head->depend.next != &head->depend) {
+ list_head_clear(&head->depend);
+ }
+ active_list_init(head);