active_list_add(head, &node->list);
}
-static void active_test_add_depend(struct active_test *A, struct active_test *B)
-{
- active_list_add_depend(&A->list, &B->list);
-}
-
/*
.--A---B----C----D-----E----F
| |__k---L
active_test_add(head, M);
active_test_add(head, N);
active_test_add(head, O);
- active_test_add_depend(H, M);
- active_test_add_depend(A, G);
- active_test_add_depend(A, H);
- active_test_add_depend(A, I);
- active_test_add_depend(A, J);
- active_test_add_depend(J, O);
- active_test_add_depend(C, K);
- active_test_add_depend(C, L);
- active_test_add_depend(L, N);
-}
-
-static int active_test_compare(const void *a, const void *b)
-{
- struct active_list *first = (struct active_list *)a;
- struct active_list *second = (struct active_list *)b;
- return memcmp(list_entry(first, struct active_test, list),
- list_entry(second, struct active_test, list),
- sizeof(struct active_test));
}
static void show_list(struct active_list *head)
test = list_entry(ptr, struct active_test, list);
printf("%s ", test->str);
}
- printf("\npos order after sort: ");
- active_list_sort(&head, &active_test_compare);
- show_list(&head);
-
printf("after clear: ");
active_list_clear(&head);
for (ptr = active_list_next(&head, NULL); ptr;