timers: implementation of lazily-ordered timers.

[ccan] / ccan / timer / test / run.c

diff --git a/ccan/timer/test/run.c b/ccan/timer/test/run.c
new file mode 100644 (file)
index 0000000..2946ba1
--- /dev/null
+++ b/ccan/timer/test/run.c
@@ -0,0 +1,84 @@
+#include <ccan/timer/timer.h>
+/* Include the C files directly. */
+#include <ccan/timer/timer.c>
+#include <ccan/tap/tap.h>
+
+int main(void)
+{
+       struct timers timers;
+       struct timer t[64];
+       struct list_head expired;
+       struct timespec earliest;
+       uint64_t i;
+
+       /* This is how many tests you plan to run */
+       plan_tests(488);
+
+       timers_init(&timers, time_from_nsec(0));
+       ok1(timers_check(&timers, NULL));
+       ok1(!timer_earliest(&timers, &earliest));
+
+       timer_add(&timers, &t[0], time_from_nsec(1));
+       ok1(timers_check(&timers, NULL));
+       ok1(timer_earliest(&timers, &earliest));
+       ok1(time_eq(earliest, grains_to_time(t[0].time)));
+       timer_del(&timers, &t[0]);
+       ok1(timers_check(&timers, NULL));
+       ok1(!timer_earliest(&timers, &earliest));
+
+       /* Check timer ordering. */
+       for (i = 0; i < 32; i++) {
+               timer_add(&timers, &t[i*2], time_from_nsec(1ULL << i));
+               ok1(timers_check(&timers, NULL));
+               timer_add(&timers, &t[i*2+1], time_from_nsec((1ULL << i) + 1));
+               ok1(timers_check(&timers, NULL));
+       }
+
+       for (i = 0; i < 32; i++) {
+               const struct timer *t1, *t2;
+
+               t1 = get_first(&timers);
+               ok1(t1 == &t[i*2] || t1 == &t[i*2+1]);
+               timer_del(&timers, (struct timer *)t1);
+               ok1(timers_check(&timers, NULL));
+
+               t2 = get_first(&timers);
+               ok1(t2 != t1 && (t2 == &t[i*2] || t2 == &t[i*2+1]));
+               timer_del(&timers, (struct timer *)t2);
+               ok1(timers_check(&timers, NULL));
+       }
+
+       /* Check expiry. */
+       for (i = 0; i < 32; i++) {
+               uint64_t exp = (uint64_t)TIMER_GRANULARITY << i;
+
+               timer_add(&timers, &t[i*2], time_from_nsec(exp));
+               ok1(timers_check(&timers, NULL));
+               timer_add(&timers, &t[i*2+1], time_from_nsec(exp + 1));
+               ok1(timers_check(&timers, NULL));
+       }
+
+       for (i = 0; i < 32; i++) {
+               struct timer *t1, *t2;
+
+               ok1(timer_earliest(&timers, &earliest));
+               timers_expire(&timers, earliest, &expired);
+
+               t1 = list_pop(&expired, struct timer, list);
+               ok1(t1);
+               t2 = list_pop(&expired, struct timer, list);
+               ok1(t2);
+               ok1(list_empty(&expired));
+
+               ok1(t1 == &t[i*2] || t1 == &t[i*2+1]);
+               ok1(t2 != t1 && (t2 == &t[i*2] || t2 == &t[i*2+1]));
+               ok1(timers_check(&timers, NULL));
+       }
+
+       ok1(!timer_earliest(&timers, &earliest));
+
+       timers_cleanup(&timers);
+
+       /* This exits depending on whether all tests passed */
+       return exit_status();
+}