int main(int argc, char **argv) { struct node *tmp, *ins; int i, max, min; SPLAY_INIT(&root); for (i = 0; i < ITER; i++) { tmp = malloc(sizeof(struct node)); if (tmp == NULL) err(1, "malloc"); do { tmp->key = arc4random_uniform(MAX-MIN); tmp->key += MIN; } while (SPLAY_FIND(tree, &root, tmp) != NULL); if (i == 0) max = min = tmp->key; else { if (tmp->key > max) max = tmp->key; if (tmp->key < min) min = tmp->key; } if (SPLAY_INSERT(tree, &root, tmp) != NULL) errx(1, "SPLAY_INSERT failed"); } ins = SPLAY_MIN(tree, &root); if (ins->key != min) errx(1, "min does not match"); tmp = ins; ins = SPLAY_MAX(tree, &root); if (ins->key != max) errx(1, "max does not match"); if (SPLAY_REMOVE(tree, &root, tmp) != tmp) errx(1, "SPLAY_REMOVE failed"); for (i = 0; i < ITER - 1; i++) { tmp = SPLAY_ROOT(&root); if (tmp == NULL) errx(1, "SPLAY_ROOT error"); if (SPLAY_REMOVE(tree, &root, tmp) != tmp) errx(1, "SPLAY_REMOVE error"); free(tmp); } exit(0); }
void filter_top(struct filtertree *filters, int n, void (*cb)(void *, void *), void *arg) { int i = 0; struct filter *filter; while (i++ < n) { if ((filter = SPLAY_MAX(filtertree, filters)) == NULL || filter->count == 0) break; SPLAY_REMOVE(filtertree, filters, filter); (*cb)(filter->report, arg); free (filter); } }