2694689cd7e0a633dc9ad934bd246a5711e547ec
1 /* active_list.h - the opkg package management system
3 Tick Chen <tick@openmoko.com>
5 Copyright (C) 2008 Openmoko Inc.
7 This program is free software; you can redistribute it and/or
8 modify it under the terms of the GNU General Public License as
9 published by the Free Software Foundation; either version 2, or (at
10 your option) any later version.
12 This program is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
19 #include "active_list.h"
23 void active_list_init(struct active_list
*ptr
) {
24 INIT_LIST_HEAD(&ptr
->node
);
25 INIT_LIST_HEAD(&ptr
->depend
);
31 struct active_list
* active_list_next(struct active_list
*head
, struct active_list
*ptr
) {
32 struct active_list
*next
=NULL
;
34 fprintf(stderr
, "active_list_next head = %p, ptr = %p invalid value!!\n", head
, ptr
);
39 next
= list_entry(ptr
->node
.next
, struct active_list
, node
);
43 if ( ptr
->depended
&& &ptr
->depended
->depend
== ptr
->node
.next
) {
46 while ( next
->depend
.next
!= &next
->depend
) {
47 next
= list_entry(next
->depend
.next
, struct active_list
, node
);
53 struct active_list
* active_list_prev(struct active_list
*head
, struct active_list
*ptr
) {
54 struct active_list
*prev
=NULL
;
56 fprintf(stderr
, "active_list_prev head = %p, ptr = %p invalid value!!\n", head
, ptr
);
61 if ( ptr
->depend
.prev
!= &ptr
->depend
) {
62 prev
= list_entry(ptr
->depend
.prev
, struct active_list
, node
);
65 if ( ptr
->depended
&& ptr
->depended
!= head
&& &ptr
->depended
->depend
== ptr
->node
.prev
) {
66 prev
= list_entry(ptr
->depended
->node
.prev
, struct active_list
, node
);
68 prev
= list_entry(ptr
->node
.prev
, struct active_list
, node
);
74 static void list_head_clear (struct list_head
*head
) {
75 struct active_list
*next
;
76 struct list_head
*n
, *ptr
;
79 list_for_each_safe(ptr
, n
, head
) {
80 next
= list_entry(ptr
, struct active_list
, node
);
81 if (next
->depend
.next
!= &next
->depend
) {
82 list_head_clear(&next
->depend
);
84 active_list_init(next
);
87 void active_list_clear(struct active_list
*head
) {
88 list_head_clear(&head
->node
);
91 void active_list_add_depend(struct active_list
*node
, struct active_list
*depend
) {
92 list_del_init(&depend
->node
);
93 list_add_tail(&depend
->node
, &node
->depend
);
94 depend
->depended
= node
;
97 void active_list_add(struct active_list
*head
, struct active_list
*node
) {
98 list_del_init(&node
->node
);
99 list_add_tail(&node
->node
, &head
->node
);
100 node
->depended
= head
;