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