child-rekey: Suppress updown event when deleting redundant CHILD_SAs
[strongswan.git] / scripts / dh_speed.c
1 /*
2 * Copyright (C) 2009 Martin Willi
3 * Hochschule fuer Technik Rapperswil
4 *
5 * This program is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License as published by the
7 * Free Software Foundation; either version 2 of the License, or (at your
8 * option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
9 *
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
12 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
13 * for more details.
14 */
15
16 #include <stdio.h>
17 #include <time.h>
18 #include <assert.h>
19 #include <library.h>
20 #include <utils/debug.h>
21 #include <crypto/diffie_hellman.h>
22
23 static void usage()
24 {
25 printf("usage: dh_speed plugins rounds group1 [group2 [...]]\n");
26 exit(1);
27 }
28
29 struct {
30 char *name;
31 diffie_hellman_group_t group;
32 } groups[] = {
33 {"modp768", MODP_768_BIT},
34 {"modp1024", MODP_1024_BIT},
35 {"modp1024s160", MODP_1024_160},
36 {"modp1536", MODP_1536_BIT},
37 {"modp2048", MODP_2048_BIT},
38 {"modp2048s224", MODP_2048_224},
39 {"modp2048s256", MODP_2048_256},
40 {"modp3072", MODP_3072_BIT},
41 {"modp4096", MODP_4096_BIT},
42 {"modp6144", MODP_6144_BIT},
43 {"modp8192", MODP_8192_BIT},
44 {"ecp256", ECP_256_BIT},
45 {"ecp384", ECP_384_BIT},
46 {"ecp521", ECP_521_BIT},
47 {"ecp192", ECP_192_BIT},
48 {"ecp224", ECP_224_BIT},
49 };
50
51 static void start_timing(struct timespec *start)
52 {
53 clock_gettime(CLOCK_THREAD_CPUTIME_ID, start);
54 }
55
56 static double end_timing(struct timespec *start)
57 {
58 struct timespec end;
59
60 clock_gettime(CLOCK_THREAD_CPUTIME_ID, &end);
61 return (end.tv_nsec - start->tv_nsec) / 1000000000.0 +
62 (end.tv_sec - start->tv_sec) * 1.0;
63 }
64
65 static void run_test(diffie_hellman_group_t group, int rounds)
66 {
67 diffie_hellman_t *l[rounds], *r;
68 chunk_t chunk;
69 struct timespec timing;
70 int round;
71
72 r = lib->crypto->create_dh(lib->crypto, group);
73 if (!r)
74 {
75 printf("skipping %N, not supported\n",
76 diffie_hellman_group_names, group);
77 return;
78 }
79
80 printf("%N:\t",
81 diffie_hellman_group_names, group);
82
83 start_timing(&timing);
84 for (round = 0; round < rounds; round++)
85 {
86 l[round] = lib->crypto->create_dh(lib->crypto, group);
87 }
88 printf("A = g^a/s: %8.1f", rounds / end_timing(&timing));
89
90 for (round = 0; round < rounds; round++)
91 {
92 assert(l[round]->get_my_public_value(l[round], &chunk));
93 assert(r->set_other_public_value(r, chunk));
94 chunk_free(&chunk);
95 }
96
97 assert(r->get_my_public_value(r, &chunk));
98 start_timing(&timing);
99 for (round = 0; round < rounds; round++)
100 {
101 assert(l[round]->set_other_public_value(l[round], chunk));
102 }
103 printf(" | S = B^a/s: %8.1f\n", rounds / end_timing(&timing));
104 chunk_free(&chunk);
105
106 for (round = 0; round < rounds; round++)
107 {
108 l[round]->destroy(l[round]);
109 }
110 r->destroy(r);
111 }
112
113 int main(int argc, char *argv[])
114 {
115 int rounds, i, j;
116
117 if (argc < 4)
118 {
119 usage();
120 }
121
122 library_init(NULL, "dh_speed");
123 lib->plugins->load(lib->plugins, argv[1]);
124 atexit(library_deinit);
125
126 rounds = atoi(argv[2]);
127
128 for (i = 3; i < argc; i++)
129 {
130 bool found = FALSE;
131
132 for (j = 0; j < countof(groups); j++)
133 {
134 if (streq(groups[j].name, argv[i]))
135 {
136 run_test(groups[j].group, rounds);
137 found = TRUE;
138 }
139 }
140 if (!found)
141 {
142 printf("group %s not found\n", argv[i]);
143 }
144 }
145 return 0;
146 }