|
|
|
@ -177,11 +177,12 @@ static void test2(void) { |
|
|
|
|
|
|
|
|
|
grpc_timer_heap pq; |
|
|
|
|
|
|
|
|
|
elem_struct elems[1000]; |
|
|
|
|
static const size_t elems_size = 1000; |
|
|
|
|
elem_struct *elems = gpr_malloc(elems_size * sizeof(elem_struct)); |
|
|
|
|
size_t num_inserted = 0; |
|
|
|
|
|
|
|
|
|
grpc_timer_heap_init(&pq); |
|
|
|
|
memset(elems, 0, sizeof(elems)); |
|
|
|
|
memset(elems, 0, elems_size); |
|
|
|
|
|
|
|
|
|
for (size_t round = 0; round < 10000; round++) { |
|
|
|
|
int r = rand() % 1000; |
|
|
|
@ -209,7 +210,7 @@ static void test2(void) { |
|
|
|
|
if (num_inserted > 0) { |
|
|
|
|
grpc_timer *top = grpc_timer_heap_top(&pq); |
|
|
|
|
grpc_timer_heap_pop(&pq); |
|
|
|
|
for (size_t i = 0; i < GPR_ARRAY_SIZE(elems); i++) { |
|
|
|
|
for (size_t i = 0; i < elems_size; i++) { |
|
|
|
|
if (top == &elems[i].elem) { |
|
|
|
|
GPR_ASSERT(elems[i].inserted); |
|
|
|
|
elems[i].inserted = false; |
|
|
|
@ -222,7 +223,7 @@ static void test2(void) { |
|
|
|
|
|
|
|
|
|
if (num_inserted) { |
|
|
|
|
gpr_timespec *min_deadline = NULL; |
|
|
|
|
for (size_t i = 0; i < GPR_ARRAY_SIZE(elems); i++) { |
|
|
|
|
for (size_t i = 0; i < elems_size; i++) { |
|
|
|
|
if (elems[i].inserted) { |
|
|
|
|
if (min_deadline == NULL) { |
|
|
|
|
min_deadline = &elems[i].elem.deadline; |
|
|
|
@ -239,6 +240,7 @@ static void test2(void) { |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
grpc_timer_heap_destroy(&pq); |
|
|
|
|
gpr_free(elems); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
static void shrink_test(void) { |
|
|
|
|