Index: third_party/grpc/test/core/support/time_test.c |
diff --git a/third_party/grpc/test/core/support/time_test.c b/third_party/grpc/test/core/support/time_test.c |
new file mode 100644 |
index 0000000000000000000000000000000000000000..6cc3786df12be55abceb93f41eaf8681365ef6a9 |
--- /dev/null |
+++ b/third_party/grpc/test/core/support/time_test.c |
@@ -0,0 +1,267 @@ |
+/* |
+ * |
+ * Copyright 2015-2016, Google Inc. |
+ * All rights reserved. |
+ * |
+ * Redistribution and use in source and binary forms, with or without |
+ * modification, are permitted provided that the following conditions are |
+ * met: |
+ * |
+ * * Redistributions of source code must retain the above copyright |
+ * notice, this list of conditions and the following disclaimer. |
+ * * Redistributions in binary form must reproduce the above |
+ * copyright notice, this list of conditions and the following disclaimer |
+ * in the documentation and/or other materials provided with the |
+ * distribution. |
+ * * Neither the name of Google Inc. nor the names of its |
+ * contributors may be used to endorse or promote products derived from |
+ * this software without specific prior written permission. |
+ * |
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
+ * |
+ */ |
+ |
+/* Test of gpr time support. */ |
+ |
+#include <stdio.h> |
+#include <stdlib.h> |
+#include <string.h> |
+#include <limits.h> |
+#include <grpc/support/log.h> |
+#include <grpc/support/sync.h> |
+#include <grpc/support/thd.h> |
+#include <grpc/support/time.h> |
+#include "test/core/util/test_config.h" |
+ |
+static void to_fp(void *arg, const char *buf, size_t len) { |
+ fwrite(buf, 1, len, (FILE *)arg); |
+} |
+ |
+/* Convert gpr_uintmax x to ascii base b (2..16), and write with |
+ (*writer)(arg, ...), zero padding to "chars" digits). */ |
+static void u_to_s(uintmax_t x, unsigned base, int chars, |
+ void (*writer)(void *arg, const char *buf, size_t len), |
+ void *arg) { |
+ char buf[64]; |
+ char *p = buf + sizeof(buf); |
+ do { |
+ *--p = "0123456789abcdef"[x % base]; |
+ x /= base; |
+ chars--; |
+ } while (x != 0 || chars > 0); |
+ (*writer)(arg, p, (size_t)(buf + sizeof(buf) - p)); |
+} |
+ |
+/* Convert gpr_intmax x to ascii base b (2..16), and write with |
+ (*writer)(arg, ...), zero padding to "chars" digits). */ |
+static void i_to_s(intmax_t x, unsigned base, int chars, |
+ void (*writer)(void *arg, const char *buf, size_t len), |
+ void *arg) { |
+ if (x < 0) { |
+ (*writer)(arg, "-", 1); |
+ u_to_s((uintmax_t)-x, base, chars - 1, writer, arg); |
+ } else { |
+ u_to_s((uintmax_t)x, base, chars, writer, arg); |
+ } |
+} |
+ |
+/* Convert ts to ascii, and write with (*writer)(arg, ...). */ |
+static void ts_to_s(gpr_timespec t, |
+ void (*writer)(void *arg, const char *buf, size_t len), |
+ void *arg) { |
+ if (t.tv_sec < 0 && t.tv_nsec != 0) { |
+ t.tv_sec++; |
+ t.tv_nsec = GPR_NS_PER_SEC - t.tv_nsec; |
+ } |
+ i_to_s(t.tv_sec, 10, 0, writer, arg); |
+ (*writer)(arg, ".", 1); |
+ i_to_s(t.tv_nsec, 10, 9, writer, arg); |
+} |
+ |
+static void test_values(void) { |
+ int i; |
+ |
+ gpr_timespec x = gpr_time_0(GPR_CLOCK_REALTIME); |
+ GPR_ASSERT(x.tv_sec == 0 && x.tv_nsec == 0); |
+ |
+ x = gpr_inf_future(GPR_CLOCK_REALTIME); |
+ fprintf(stderr, "far future "); |
+ i_to_s(x.tv_sec, 16, 16, &to_fp, stderr); |
+ fprintf(stderr, "\n"); |
+ GPR_ASSERT(x.tv_sec == INT64_MAX); |
+ fprintf(stderr, "far future "); |
+ ts_to_s(x, &to_fp, stderr); |
+ fprintf(stderr, "\n"); |
+ |
+ x = gpr_inf_past(GPR_CLOCK_REALTIME); |
+ fprintf(stderr, "far past "); |
+ i_to_s(x.tv_sec, 16, 16, &to_fp, stderr); |
+ fprintf(stderr, "\n"); |
+ GPR_ASSERT(x.tv_sec == INT64_MIN); |
+ fprintf(stderr, "far past "); |
+ ts_to_s(x, &to_fp, stderr); |
+ fprintf(stderr, "\n"); |
+ |
+ for (i = 1; i != 1000 * 1000 * 1000; i *= 10) { |
+ x = gpr_time_from_micros(i, GPR_TIMESPAN); |
+ GPR_ASSERT(x.tv_sec == i / GPR_US_PER_SEC && |
+ x.tv_nsec == (i % GPR_US_PER_SEC) * GPR_NS_PER_US); |
+ x = gpr_time_from_nanos(i, GPR_TIMESPAN); |
+ GPR_ASSERT(x.tv_sec == i / GPR_NS_PER_SEC && |
+ x.tv_nsec == (i % GPR_NS_PER_SEC)); |
+ x = gpr_time_from_millis(i, GPR_TIMESPAN); |
+ GPR_ASSERT(x.tv_sec == i / GPR_MS_PER_SEC && |
+ x.tv_nsec == (i % GPR_MS_PER_SEC) * GPR_NS_PER_MS); |
+ } |
+ |
+ /* Test possible overflow in conversion of -ve values. */ |
+ x = gpr_time_from_micros(-(INT64_MAX - 999997), GPR_TIMESPAN); |
+ GPR_ASSERT(x.tv_sec < 0); |
+ GPR_ASSERT(x.tv_nsec >= 0 && x.tv_nsec < GPR_NS_PER_SEC); |
+ |
+ x = gpr_time_from_nanos(-(INT64_MAX - 999999997), GPR_TIMESPAN); |
+ GPR_ASSERT(x.tv_sec < 0); |
+ GPR_ASSERT(x.tv_nsec >= 0 && x.tv_nsec < GPR_NS_PER_SEC); |
+ |
+ x = gpr_time_from_millis(-(INT64_MAX - 997), GPR_TIMESPAN); |
+ GPR_ASSERT(x.tv_sec < 0); |
+ GPR_ASSERT(x.tv_nsec >= 0 && x.tv_nsec < GPR_NS_PER_SEC); |
+ |
+ /* Test general -ve values. */ |
+ for (i = -1; i > -1000 * 1000 * 1000; i *= 7) { |
+ x = gpr_time_from_micros(i, GPR_TIMESPAN); |
+ GPR_ASSERT(x.tv_sec * GPR_US_PER_SEC + x.tv_nsec / GPR_NS_PER_US == i); |
+ x = gpr_time_from_nanos(i, GPR_TIMESPAN); |
+ GPR_ASSERT(x.tv_sec * GPR_NS_PER_SEC + x.tv_nsec == i); |
+ x = gpr_time_from_millis(i, GPR_TIMESPAN); |
+ GPR_ASSERT(x.tv_sec * GPR_MS_PER_SEC + x.tv_nsec / GPR_NS_PER_MS == i); |
+ } |
+} |
+ |
+static void test_add_sub(void) { |
+ int i; |
+ int j; |
+ int k; |
+ /* Basic addition and subtraction. */ |
+ for (i = -100; i <= 100; i++) { |
+ for (j = -100; j <= 100; j++) { |
+ for (k = 1; k <= 10000000; k *= 10) { |
+ int sum = i + j; |
+ int diff = i - j; |
+ gpr_timespec it = gpr_time_from_micros(i * k, GPR_TIMESPAN); |
+ gpr_timespec jt = gpr_time_from_micros(j * k, GPR_TIMESPAN); |
+ gpr_timespec sumt = gpr_time_add(it, jt); |
+ gpr_timespec difft = gpr_time_sub(it, jt); |
+ if (gpr_time_cmp(gpr_time_from_micros(sum * k, GPR_TIMESPAN), sumt) != |
+ 0) { |
+ fprintf(stderr, "i %d j %d sum %d sumt ", i, j, sum); |
+ ts_to_s(sumt, &to_fp, stderr); |
+ fprintf(stderr, "\n"); |
+ GPR_ASSERT(0); |
+ } |
+ if (gpr_time_cmp(gpr_time_from_micros(diff * k, GPR_TIMESPAN), difft) != |
+ 0) { |
+ fprintf(stderr, "i %d j %d diff %d diff ", i, j, diff); |
+ ts_to_s(sumt, &to_fp, stderr); |
+ fprintf(stderr, "\n"); |
+ GPR_ASSERT(0); |
+ } |
+ } |
+ } |
+ } |
+} |
+ |
+static void test_overflow(void) { |
+ /* overflow */ |
+ gpr_timespec x = gpr_time_from_micros(1, GPR_TIMESPAN); |
+ do { |
+ x = gpr_time_add(x, x); |
+ } while (gpr_time_cmp(x, gpr_inf_future(GPR_TIMESPAN)) < 0); |
+ GPR_ASSERT(gpr_time_cmp(x, gpr_inf_future(GPR_TIMESPAN)) == 0); |
+ x = gpr_time_from_micros(-1, GPR_TIMESPAN); |
+ do { |
+ x = gpr_time_add(x, x); |
+ } while (gpr_time_cmp(x, gpr_inf_past(GPR_TIMESPAN)) > 0); |
+ GPR_ASSERT(gpr_time_cmp(x, gpr_inf_past(GPR_TIMESPAN)) == 0); |
+} |
+ |
+static void test_sticky_infinities(void) { |
+ int i; |
+ int j; |
+ int k; |
+ gpr_timespec infinity[2]; |
+ gpr_timespec addend[3]; |
+ infinity[0] = gpr_inf_future(GPR_TIMESPAN); |
+ infinity[1] = gpr_inf_past(GPR_TIMESPAN); |
+ addend[0] = gpr_inf_future(GPR_TIMESPAN); |
+ addend[1] = gpr_inf_past(GPR_TIMESPAN); |
+ addend[2] = gpr_time_0(GPR_TIMESPAN); |
+ |
+ /* Infinities are sticky */ |
+ for (i = 0; i != sizeof(infinity) / sizeof(infinity[0]); i++) { |
+ for (j = 0; j != sizeof(addend) / sizeof(addend[0]); j++) { |
+ gpr_timespec x = gpr_time_add(infinity[i], addend[j]); |
+ GPR_ASSERT(gpr_time_cmp(x, infinity[i]) == 0); |
+ x = gpr_time_sub(infinity[i], addend[j]); |
+ GPR_ASSERT(gpr_time_cmp(x, infinity[i]) == 0); |
+ } |
+ for (k = -200; k <= 200; k++) { |
+ gpr_timespec y = gpr_time_from_micros(k * 100000, GPR_TIMESPAN); |
+ gpr_timespec x = gpr_time_add(infinity[i], y); |
+ GPR_ASSERT(gpr_time_cmp(x, infinity[i]) == 0); |
+ x = gpr_time_sub(infinity[i], y); |
+ GPR_ASSERT(gpr_time_cmp(x, infinity[i]) == 0); |
+ } |
+ } |
+} |
+ |
+static void test_similar(void) { |
+ GPR_ASSERT(1 == gpr_time_similar(gpr_inf_future(GPR_TIMESPAN), |
+ gpr_inf_future(GPR_TIMESPAN), |
+ gpr_time_0(GPR_TIMESPAN))); |
+ GPR_ASSERT(1 == gpr_time_similar(gpr_inf_past(GPR_TIMESPAN), |
+ gpr_inf_past(GPR_TIMESPAN), |
+ gpr_time_0(GPR_TIMESPAN))); |
+ GPR_ASSERT(0 == gpr_time_similar(gpr_inf_past(GPR_TIMESPAN), |
+ gpr_inf_future(GPR_TIMESPAN), |
+ gpr_time_0(GPR_TIMESPAN))); |
+ GPR_ASSERT(0 == gpr_time_similar(gpr_inf_future(GPR_TIMESPAN), |
+ gpr_inf_past(GPR_TIMESPAN), |
+ gpr_time_0(GPR_TIMESPAN))); |
+ GPR_ASSERT(1 == gpr_time_similar(gpr_time_from_micros(10, GPR_TIMESPAN), |
+ gpr_time_from_micros(10, GPR_TIMESPAN), |
+ gpr_time_0(GPR_TIMESPAN))); |
+ GPR_ASSERT(1 == gpr_time_similar(gpr_time_from_micros(10, GPR_TIMESPAN), |
+ gpr_time_from_micros(15, GPR_TIMESPAN), |
+ gpr_time_from_micros(10, GPR_TIMESPAN))); |
+ GPR_ASSERT(1 == gpr_time_similar(gpr_time_from_micros(15, GPR_TIMESPAN), |
+ gpr_time_from_micros(10, GPR_TIMESPAN), |
+ gpr_time_from_micros(10, GPR_TIMESPAN))); |
+ GPR_ASSERT(0 == gpr_time_similar(gpr_time_from_micros(10, GPR_TIMESPAN), |
+ gpr_time_from_micros(25, GPR_TIMESPAN), |
+ gpr_time_from_micros(10, GPR_TIMESPAN))); |
+ GPR_ASSERT(0 == gpr_time_similar(gpr_time_from_micros(25, GPR_TIMESPAN), |
+ gpr_time_from_micros(10, GPR_TIMESPAN), |
+ gpr_time_from_micros(10, GPR_TIMESPAN))); |
+} |
+ |
+int main(int argc, char *argv[]) { |
+ grpc_test_init(argc, argv); |
+ |
+ test_values(); |
+ test_add_sub(); |
+ test_overflow(); |
+ test_sticky_infinities(); |
+ test_similar(); |
+ return 0; |
+} |