1*9ca3dc7dSchristos /* $NetBSD: in_cksum.c,v 1.5 2015/10/18 18:27:25 christos Exp $ */
2fca19cadSchristos /*-
3fca19cadSchristos * Copyright (c) 2008 Joerg Sonnenberger <joerg@NetBSD.org>.
4fca19cadSchristos * All rights reserved.
5fca19cadSchristos *
6fca19cadSchristos * Redistribution and use in source and binary forms, with or without
7fca19cadSchristos * modification, are permitted provided that the following conditions
8fca19cadSchristos * are met:
9fca19cadSchristos *
10fca19cadSchristos * 1. Redistributions of source code must retain the above copyright
11fca19cadSchristos * notice, this list of conditions and the following disclaimer.
12fca19cadSchristos * 2. Redistributions in binary form must reproduce the above copyright
13fca19cadSchristos * notice, this list of conditions and the following disclaimer in
14fca19cadSchristos * the documentation and/or other materials provided with the
15fca19cadSchristos * distribution.
16fca19cadSchristos *
17fca19cadSchristos * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18fca19cadSchristos * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19fca19cadSchristos * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
20fca19cadSchristos * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
21fca19cadSchristos * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
22fca19cadSchristos * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
23fca19cadSchristos * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
24fca19cadSchristos * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
25fca19cadSchristos * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
26fca19cadSchristos * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
27fca19cadSchristos * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28fca19cadSchristos * SUCH DAMAGE.
29fca19cadSchristos */
30fca19cadSchristos
31fca19cadSchristos #include <sys/cdefs.h>
32*9ca3dc7dSchristos __KERNEL_RCSID(0, "$NetBSD: in_cksum.c,v 1.5 2015/10/18 18:27:25 christos Exp $");
33fca19cadSchristos
34fca19cadSchristos #include <sys/param.h>
35fca19cadSchristos #include <sys/mbuf.h>
36fca19cadSchristos #include <sys/resource.h>
37fca19cadSchristos #include <err.h>
38fca19cadSchristos #include <stdbool.h>
39fca19cadSchristos #include <stdio.h>
406d5379c9Schristos #include <stdarg.h>
41fca19cadSchristos #include <unistd.h>
42fca19cadSchristos #include <stdlib.h>
43fca19cadSchristos #include <string.h>
44fca19cadSchristos
45fca19cadSchristos #define cpu_in_cksum portable_cpu_in_cksum
46fca19cadSchristos #include "cpu_in_cksum.c"
47fca19cadSchristos
48fca19cadSchristos #ifdef HAVE_CPU_IN_CKSUM
496d5379c9Schristos #undef cpu_in_cksum
50fca19cadSchristos int cpu_in_cksum(struct mbuf*, int, int, uint32_t);
51fca19cadSchristos #endif
52fca19cadSchristos
53fca19cadSchristos static bool random_aligned;
54fca19cadSchristos
55707bb266Sjoerg void panic(const char *, ...) __printflike(1, 2);
566d5379c9Schristos void
panic(const char * fmt,...)576d5379c9Schristos panic(const char *fmt, ...)
586d5379c9Schristos {
596d5379c9Schristos va_list ap;
606d5379c9Schristos va_start(ap, fmt);
616d5379c9Schristos verrx(1, fmt, ap);
626d5379c9Schristos va_end(ap);
636d5379c9Schristos }
646d5379c9Schristos
65fca19cadSchristos static void
free_mbuf_chain(struct mbuf * m)66fca19cadSchristos free_mbuf_chain(struct mbuf *m)
67fca19cadSchristos {
68fca19cadSchristos struct mbuf *next;
69fca19cadSchristos
70fca19cadSchristos if (m == NULL)
71fca19cadSchristos return;
72fca19cadSchristos
73fca19cadSchristos next = m->m_next;
74fca19cadSchristos free(m);
75fca19cadSchristos free_mbuf_chain(next);
76fca19cadSchristos }
77fca19cadSchristos
78fca19cadSchristos static struct mbuf *
allocate_mbuf_chain(char ** lens)79fca19cadSchristos allocate_mbuf_chain(char **lens)
80fca19cadSchristos {
81fca19cadSchristos int len, off;
82fca19cadSchristos struct mbuf *m;
83fca19cadSchristos
84fca19cadSchristos if (*lens == NULL)
85fca19cadSchristos return NULL;
86fca19cadSchristos
87fca19cadSchristos len = atoi(*lens);
88fca19cadSchristos off = random_aligned ? rand() % 64 : 0;
89fca19cadSchristos
90fca19cadSchristos m = malloc(sizeof(struct m_hdr) + len + off);
91fca19cadSchristos if (m == NULL)
92fca19cadSchristos err(EXIT_FAILURE, "malloc failed");
93fca19cadSchristos
94fca19cadSchristos m->m_data = (char *)m + sizeof(struct m_hdr) + off;
95fca19cadSchristos m->m_len = len;
96fca19cadSchristos
97fca19cadSchristos m->m_next = allocate_mbuf_chain(lens + 1);
98fca19cadSchristos
99fca19cadSchristos return m;
100fca19cadSchristos }
101fca19cadSchristos
1023075d038Schristos #ifdef MBUFDUMP
1033075d038Schristos static void
dump_mbuf(const struct mbuf * m,int len,int off)1043075d038Schristos dump_mbuf(const struct mbuf *m, int len, int off)
1053075d038Schristos {
1063075d038Schristos int x = 0;
1073075d038Schristos if (len <= 0)
1083075d038Schristos return;
1093075d038Schristos
1103075d038Schristos printf("Starting len=%d off=%d:\n", len, off);
1113075d038Schristos if (off > 0) {
1123075d038Schristos for (; m; m = m->m_next)
1133075d038Schristos if (off > m->m_len)
1143075d038Schristos off -= m->m_len;
1153075d038Schristos else
1163075d038Schristos break;
1173075d038Schristos if (m == NULL || off > m->m_len)
1183075d038Schristos errx(1, "out of data");
1193075d038Schristos }
1203075d038Schristos
1213075d038Schristos unsigned char *ptr = mtod(m, unsigned char *) + off;
1223075d038Schristos unsigned char *eptr = ptr + m->m_len;
1233075d038Schristos printf("[");
1243075d038Schristos for (;;) {
1253075d038Schristos if (ptr == eptr) {
1263075d038Schristos m = m->m_next;
1273075d038Schristos if (m == NULL)
1283075d038Schristos errx(1, "out of data");
1293075d038Schristos ptr = mtod(m, unsigned char *);
1303075d038Schristos eptr = ptr + m->m_len;
1313075d038Schristos printf("]\n[");
1323075d038Schristos x = 0;
1333075d038Schristos }
1343075d038Schristos printf("%.2x ", *ptr++);
1353075d038Schristos if (++x % 16 == 0)
1363075d038Schristos printf("\n");
1373075d038Schristos if (--len == 0)
1383075d038Schristos break;
1393075d038Schristos }
1403075d038Schristos printf("]\n");
1413075d038Schristos fflush(stdout);
1423075d038Schristos }
1433075d038Schristos #endif
1443075d038Schristos
145fca19cadSchristos static void
randomise_mbuf_chain(struct mbuf * m)146fca19cadSchristos randomise_mbuf_chain(struct mbuf *m)
147fca19cadSchristos {
148fca19cadSchristos int i, data, len;
149fca19cadSchristos
150fca19cadSchristos for (i = 0; i < m->m_len; i += sizeof(int)) {
151fca19cadSchristos data = rand();
152fca19cadSchristos if (i + sizeof(int) < (size_t)m->m_len)
153fca19cadSchristos len = sizeof(int);
154fca19cadSchristos else
155fca19cadSchristos len = m->m_len - i;
156fca19cadSchristos memcpy(m->m_data + i, &data, len);
157fca19cadSchristos }
158fca19cadSchristos if (m->m_next)
159fca19cadSchristos randomise_mbuf_chain(m->m_next);
160fca19cadSchristos }
161fca19cadSchristos
162fca19cadSchristos static int
mbuf_len(struct mbuf * m)163fca19cadSchristos mbuf_len(struct mbuf *m)
164fca19cadSchristos {
165fca19cadSchristos return m == NULL ? 0 : m->m_len + mbuf_len(m->m_next);
166fca19cadSchristos }
167fca19cadSchristos
168fca19cadSchristos int in_cksum_portable(struct mbuf *, int);
169fca19cadSchristos int in_cksum(struct mbuf *, int);
170fca19cadSchristos
171fca19cadSchristos int
main(int argc,char ** argv)172fca19cadSchristos main(int argc, char **argv)
173fca19cadSchristos {
174fca19cadSchristos struct rusage res;
175fca19cadSchristos struct timeval tv, old_tv;
176fca19cadSchristos int loops, old_sum, off, len;
177fca19cadSchristos #ifdef HAVE_CPU_IN_CKSUM
178fca19cadSchristos int new_sum;
179fca19cadSchristos #endif
180fca19cadSchristos long i, iterations;
181fca19cadSchristos uint32_t init_sum;
182fca19cadSchristos struct mbuf *m;
183fca19cadSchristos bool verbose;
184fca19cadSchristos int c;
185fca19cadSchristos
186fca19cadSchristos loops = 16;
187fca19cadSchristos verbose = false;
188fca19cadSchristos random_aligned = 0;
189fca19cadSchristos iterations = 100000;
190fca19cadSchristos
191fca19cadSchristos while ((c = getopt(argc, argv, "i:l:u:v")) != -1) {
192fca19cadSchristos switch (c) {
193fca19cadSchristos case 'i':
194fca19cadSchristos iterations = atoi(optarg);
195fca19cadSchristos break;
196fca19cadSchristos case 'l':
197fca19cadSchristos loops = atoi(optarg);
198fca19cadSchristos break;
199fca19cadSchristos case 'u':
200fca19cadSchristos random_aligned = atoi(optarg);
201fca19cadSchristos break;
202fca19cadSchristos case 'v':
203fca19cadSchristos verbose = true;
204fca19cadSchristos break;
205fca19cadSchristos default:
206fca19cadSchristos errx(1, "%s [-l <loops>] [-u <unalign> [-i <iterations> "
207fca19cadSchristos "[<mbuf-size> ...]", getprogname());
208fca19cadSchristos }
209fca19cadSchristos }
210fca19cadSchristos
211fca19cadSchristos for (; loops; --loops) {
212fca19cadSchristos if ((m = allocate_mbuf_chain(argv + 4)) == NULL)
213fca19cadSchristos continue;
214fca19cadSchristos randomise_mbuf_chain(m);
215fca19cadSchristos init_sum = rand();
216fca19cadSchristos len = mbuf_len(m);
217fca19cadSchristos
218fca19cadSchristos /* force one loop over all data */
219fca19cadSchristos if (loops == 1)
220fca19cadSchristos off = 0;
221fca19cadSchristos else
222fca19cadSchristos off = len ? rand() % len : 0;
223fca19cadSchristos
224fca19cadSchristos len -= off;
225fca19cadSchristos old_sum = portable_cpu_in_cksum(m, len, off, init_sum);
226fca19cadSchristos #ifdef HAVE_CPU_IN_CKSUM
2273075d038Schristos #ifdef MBUFDUMP
2283075d038Schristos printf("m->m_len=%d len=%d off=%d\n", m->m_len, len, off);
2293075d038Schristos dump_mbuf(m, len, off);
2303075d038Schristos #endif
231fca19cadSchristos new_sum = cpu_in_cksum(m, len, off, init_sum);
232fca19cadSchristos if (old_sum != new_sum)
233fca19cadSchristos errx(1, "comparison failed: %x %x", old_sum, new_sum);
234fca19cadSchristos #else
235fca19cadSchristos __USE(old_sum);
236fca19cadSchristos #endif
237fca19cadSchristos
238fca19cadSchristos if (iterations == 0)
239fca19cadSchristos continue;
240fca19cadSchristos
241fca19cadSchristos getrusage(RUSAGE_SELF, &res);
242fca19cadSchristos tv = res.ru_utime;
243fca19cadSchristos for (i = iterations; i; --i)
244fca19cadSchristos (void)portable_cpu_in_cksum(m, len, off, init_sum);
245fca19cadSchristos getrusage(RUSAGE_SELF, &res);
246fca19cadSchristos timersub(&res.ru_utime, &tv, &old_tv);
247fca19cadSchristos if (verbose)
248fca19cadSchristos printf("portable version: %jd.%06jd\n",
249fca19cadSchristos (intmax_t)old_tv.tv_sec, (intmax_t)old_tv.tv_usec);
250fca19cadSchristos
251fca19cadSchristos #ifdef HAVE_CPU_IN_CKSUM
252fca19cadSchristos getrusage(RUSAGE_SELF, &res);
253fca19cadSchristos tv = res.ru_utime;
254fca19cadSchristos for (i = iterations; i; --i)
255fca19cadSchristos (void)cpu_in_cksum(m, len, off, init_sum);
256fca19cadSchristos getrusage(RUSAGE_SELF, &res);
257fca19cadSchristos timersub(&res.ru_utime, &tv, &tv);
258fca19cadSchristos if (verbose) {
259fca19cadSchristos printf("test version: %jd.%06jd\n",
260fca19cadSchristos (intmax_t)tv.tv_sec, (intmax_t)tv.tv_usec);
261fca19cadSchristos printf("relative time: %3.g%%\n",
262fca19cadSchristos 100 * ((double)tv.tv_sec * 1e6 + tv.tv_usec) /
263fca19cadSchristos ((double)old_tv.tv_sec * 1e6 + old_tv.tv_usec + 1));
264fca19cadSchristos }
265fca19cadSchristos #endif
266fca19cadSchristos free_mbuf_chain(m);
267fca19cadSchristos }
268fca19cadSchristos
269fca19cadSchristos return 0;
270fca19cadSchristos }
271