void request_data_list_dump(request_t *request, fr_dlist_head_t *head)
{
request_data_t *rd = NULL;
- int count = 0;
if (fr_dlist_empty(head)) return;
desc = request_data_description(NULL, rd);
ROPTIONAL(RDEBUG, DEBUG, "%s", desc);
talloc_free(desc);
- count++;
}
}
lst_thing *array = NULL;
static bool done_init = false;
int insert_count = 0;
- int element_count = 0;
if (!done_init) {
srand((unsigned int) time(NULL));
insert:
TEST_CHECK((ret_insert = fr_lst_insert(lst, &array[insert_count])) >= 0);
insert_count++;
- element_count++;
} else {
switch (rand() % 3) {
case 0: /* insert */
case 1: /* pop */
ret_thing = fr_lst_pop(lst);
TEST_CHECK(ret_thing != NULL);
- element_count--;
break;
case 2: /* peek */
ret_thing = fr_lst_peek(lst);
minmax_heap_thing *array = NULL;
static bool done_init = false;
int insert_count = 0;
- int element_count = 0;
if (!done_init) {
srand((unsigned int) time(0));
insert:
TEST_CHECK((ret_insert = fr_minmax_heap_insert(hp, &array[insert_count])) >= 0);
insert_count++;
- element_count++;
} else {
switch (rand() % 3) {
case 0: /* insert */
case 1: /* min pop */
ret_thing = fr_minmax_heap_min_pop(hp);
TEST_CHECK(ret_thing != NULL);
- element_count--;
break;
case 2: /* min peek */
ret_thing = fr_minmax_heap_min_peek(hp);
case 3: /* max pop */
ret_thing = fr_minmax_heap_max_pop(hp);
TEST_CHECK(ret_thing != NULL);
- element_count--;
break;
case 4: /* max peek */
ret_thing = fr_minmax_heap_max_peek(hp);