1/*	$NetBSD: regress_minheap.c,v 1.7 2020/05/25 20:47:34 christos Exp $	*/
2
3/*
4 * Copyright (c) 2009-2012 Niels Provos and Nick Mathewson
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 * 1. Redistributions of source code must retain the above copyright
10 *    notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 *    notice, this list of conditions and the following disclaimer in the
13 *    documentation and/or other materials provided with the distribution.
14 * 3. The name of the author may not be used to endorse or promote products
15 *    derived from this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28#include "../minheap-internal.h"
29
30#include <stdlib.h>
31#include "event2/event_struct.h"
32
33#include "tinytest.h"
34#include "tinytest_macros.h"
35#include "regress.h"
36
37static void
38set_random_timeout(struct event *ev)
39{
40	ev->ev_timeout.tv_sec = test_weakrand();
41	ev->ev_timeout.tv_usec = test_weakrand() & 0xfffff;
42	ev->ev_timeout_pos.min_heap_idx = -1;
43}
44
45static void
46check_heap(struct min_heap *heap)
47{
48	unsigned i;
49	for (i = 1; i < heap->n; ++i) {
50		unsigned parent_idx = (i-1)/2;
51		tt_want(evutil_timercmp(&heap->p[i]->ev_timeout,
52			&heap->p[parent_idx]->ev_timeout, >=));
53	}
54}
55
56static void
57test_heap_randomized(void *ptr)
58{
59	struct min_heap heap;
60	struct event *inserted[1024];
61	struct event *e, *last_e;
62	int i;
63
64	min_heap_ctor_(&heap);
65
66	for (i = 0; i < 1024; ++i) {
67		inserted[i] = malloc(sizeof(struct event));
68		assert(inserted[i] != NULL);
69		set_random_timeout(inserted[i]);
70		min_heap_push_(&heap, inserted[i]);
71	}
72	check_heap(&heap);
73
74	tt_assert(min_heap_size_(&heap) == 1024);
75
76	for (i = 0; i < 512; ++i) {
77		min_heap_erase_(&heap, inserted[i]);
78		if (0 == (i % 32))
79			check_heap(&heap);
80	}
81	tt_assert(min_heap_size_(&heap) == 512);
82
83	last_e = min_heap_pop_(&heap);
84	while (1) {
85		e = min_heap_pop_(&heap);
86		if (!e)
87			break;
88		tt_want(evutil_timercmp(&last_e->ev_timeout,
89			&e->ev_timeout, <=));
90	}
91	tt_assert(min_heap_size_(&heap) == 0);
92end:
93	for (i = 0; i < 1024; ++i)
94		free(inserted[i]);
95
96	min_heap_dtor_(&heap);
97}
98
99struct testcase_t minheap_testcases[] = {
100	{ "randomized", test_heap_randomized, 0, NULL, NULL },
101	END_OF_TESTCASES
102};
103