From e9c133caa866f883bda66107a4977e3bd0c1a64c Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Colm=20MacC=C3=A1rthaigh?= Date: Thu, 1 Oct 2020 03:54:42 +0000 Subject: [PATCH] Update the test --- tests/unit/s2n_random_test.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/tests/unit/s2n_random_test.c b/tests/unit/s2n_random_test.c index ac724099e11..0c2d4ef762d 100644 --- a/tests/unit/s2n_random_test.c +++ b/tests/unit/s2n_random_test.c @@ -329,14 +329,14 @@ int main(int argc, char **argv) ** ** To get good coverage we want to pick a value that maximizes ** '((2^64 - bound) % bound)'. With bound = 6148914691236517206 - ** ((2^64 / 3) + 1) we get a value of 6148914691236517204 for + ** ((2^64 / 3) + 1) we get a value of 6148914691236517204 for ** the second piece. This maximizes the odds of our random - ** fぬnction taking the branches that we want to cover. + ** function taking the branches that we want to cover. ** **/ for (int i = 0; i < 1000000; i++) { EXPECT_OK(s2n_public_random(6148914691236517206, &r)); - EXPECT_TRUE(r <= 611686018427387906); + EXPECT_TRUE(r <= 6148914691236517206); } /* 0 should fail */