/** The main network worker function.
*
* @param[in] nr the network data structure to run.
*/
void fr_network(fr_network_t *nr)
{
while (true) {
bool wait_for_event;
int num_events;
/*
* There are runnable requests. We still service
* the event loop, but we don't wait for events.
*/
wait_for_event = (fr_heap_num_elements(nr->replies) == 0);
DEBUG3("Waiting for events %d", wait_for_event);
/*
* Check the event list. If there's an error
* (e.g. exit), we stop looping and clean up.
*/
num_events = fr_event_corral(nr->el, wait_for_event);
DEBUG3("Got num_events %d", num_events);
if (num_events < 0) break;
/*
* Service outstanding events.
*/
if (num_events > 0) {
DEBUG3("servicing events");
fr_event_service(nr->el);
}
}
}
int main(int argc, char **argv)
{
fr_heap_t *hp;
int i;
heap_thing array[ARRAY_SIZE];
int skip = 0;
int left;
if (argc > 1) {
skip = atoi(argv[1]);
}
hp = fr_heap_create(heap_cmp, offsetof(heap_thing, heap));
if (!hp) {
fprintf(stderr, "Failed creating heap!\n");
fr_exit(1);
}
for (i = 0; i < ARRAY_SIZE; i++) {
array[i].data = rand() % 65537;
if (!fr_heap_insert(hp, &array[i])) {
fprintf(stderr, "Failed inserting %d\n", i);
fr_exit(1);
}
if (!fr_heap_check(hp, &array[i])) {
fprintf(stderr, "Inserted but not in heap %d\n", i);
fr_exit(1);
}
}
#if 0
for (i = 0; i < ARRAY_SIZE; i++) {
printf("Array %d has value %d at offset %d\n",
i, array[i].data, array[i].heap);
}
#endif
if (skip) {
int entry;
printf("%d elements to remove\n", ARRAY_SIZE / skip);
for (i = 0; i < ARRAY_SIZE / skip; i++) {
entry = i * skip;
if (!fr_heap_extract(hp, &array[entry])) {
fprintf(stderr, "Failed removing %d\n", entry);
}
if (fr_heap_check(hp, &array[entry])) {
fprintf(stderr, "Deleted but still in heap %d\n", entry);
fr_exit(1);
}
if (array[entry].heap != -1) {
fprintf(stderr, "heap offset is wrong %d\n", entry);
fr_exit(1);
}
}
}
left = fr_heap_num_elements(hp);
printf("%d elements left in the heap\n", left);
for (i = 0; i < left; i++) {
heap_thing *t = fr_heap_peek(hp);
if (!t) {
fprintf(stderr, "Failed peeking %d\n", i);
fr_exit(1);
}
printf("%d\t%d\n", i, t->data);
if (!fr_heap_extract(hp, NULL)) {
fprintf(stderr, "Failed extracting %d\n", i);
fr_exit(1);
}
}
if (fr_heap_num_elements(hp) > 0) {
fprintf(stderr, "%d elements left at the end", fr_heap_num_elements(hp));
fr_exit(1);
}
fr_heap_delete(hp);
return 0;
}