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);
+ }
+ list_del_init(&next->node);
+ next->depended = NULL;
+ }
+}
void active_list_clear(struct active_list *head) {
+ list_head_clear(&head->node);
}
void active_list_add_depend(struct active_list *node, struct active_list *depend) {
test = list_entry(ptr, struct active_test, list);
printf ("%s ",test->str);
}
- printf("\npos order: ");
+ printf("\nafter clear: ");
+ active_list_clear(&head);
for(ptr = active_list_next(&head, NULL); ptr ;ptr = active_list_next(&head, ptr)) {
test = list_entry(ptr, struct active_test, list);
printf ("%s ",test->str);