aboutsummaryrefslogtreecommitdiffstats
path: root/Source/charon/testcases/prime_pool_test.c
diff options
context:
space:
mode:
authorMartin Willi <martin@strongswan.org>2005-12-07 15:53:34 +0000
committerMartin Willi <martin@strongswan.org>2005-12-07 15:53:34 +0000
commitc3903a186150e59610930f7acb07a544b8a86e72 (patch)
treee2d8c542f16a8d93f9c9d43e2ea31de869261e52 /Source/charon/testcases/prime_pool_test.c
parent0d43ad12dd3a882f83d4a80f591a4e51b4470845 (diff)
downloadstrongswan-c3903a186150e59610930f7acb07a544b8a86e72.tar.bz2
strongswan-c3903a186150e59610930f7acb07a544b8a86e72.tar.xz
- removed prime pool
Diffstat (limited to 'Source/charon/testcases/prime_pool_test.c')
-rw-r--r--Source/charon/testcases/prime_pool_test.c67
1 files changed, 0 insertions, 67 deletions
diff --git a/Source/charon/testcases/prime_pool_test.c b/Source/charon/testcases/prime_pool_test.c
deleted file mode 100644
index 397a8b58b..000000000
--- a/Source/charon/testcases/prime_pool_test.c
+++ /dev/null
@@ -1,67 +0,0 @@
-/**
- * @file prime_pool_test.h
- *
- * @brief Tests for the hasher_t classes.
- *
- */
-
-/*
- * Copyright (C) 2005 Jan Hutter, Martin Willi
- * Hochschule fuer Technik Rapperswil
- *
- * This program is free software; you can redistribute it and/or modify it
- * under the terms of the GNU General Public License as published by the
- * Free Software Foundation; either version 2 of the License, or (at your
- * option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
- *
- * This program is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
- * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
- * for more details.
- */
-
-#include <string.h>
-#include <unistd.h>
-
-#include "prime_pool_test.h"
-
-#include <daemon.h>
-#include <utils/allocator.h>
-#include <utils/logger.h>
-#include <threads/prime_pool.h>
-
-
-/*
- * described in Header-File
- */
-void test_prime_pool(protected_tester_t *tester)
-{
- mpz_t p1, p2, p3, p4;
- prime_pool_t *prime_pool;
-
- prime_pool = prime_pool_create(20);
-
- prime_pool->get_prime(prime_pool, 4, &p1);
- sleep(1);
- tester->assert_true(tester, prime_pool->get_count(prime_pool, 4) == 20, "number of 4 bytes primes");
- tester->assert_true(tester, prime_pool->get_count(prime_pool, 8) == 0, "number of 8 bytes primes");
- tester->assert_true(tester, prime_pool->get_count(prime_pool, 16) == 0, "number of 16 bytes primes");
- prime_pool->get_prime(prime_pool, 8, &p2);
- sleep(1);
- tester->assert_true(tester, prime_pool->get_count(prime_pool, 4) == 20, "number of 4 bytes primes");
- tester->assert_true(tester, prime_pool->get_count(prime_pool, 8) == 20, "number of 8 bytes primes");
- tester->assert_true(tester, prime_pool->get_count(prime_pool, 16) == 0, "number of 16 bytes primes");
- prime_pool->get_prime(prime_pool, 16, &p3);
- sleep(1);
- tester->assert_true(tester, prime_pool->get_count(prime_pool, 4) == 20, "number of 4 bytes primes");
- tester->assert_true(tester, prime_pool->get_count(prime_pool, 8) == 20, "number of 8 bytes primes");
- tester->assert_true(tester, prime_pool->get_count(prime_pool, 16) == 20, "number of 16 bytes primes");
- prime_pool->get_prime(prime_pool, 16, &p4);
-
- mpz_clear(p1);
- mpz_clear(p2);
- mpz_clear(p3);
- mpz_clear(p4);
- prime_pool->destroy(prime_pool);
-
-}