2 * Copyright (c) 1999 - 2003 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42 #include "check-common.h"
44 RCSID("$Id: check-common.c,v 1.1 2003/01/23 10:21:36 lha Exp $");
47 print_bytes (unsigned const char *buf, size_t len)
51 for (i = 0; i < len; ++i)
52 printf ("%02x ", buf[i]);
56 generic_test (const struct test_case *tests,
59 int (*encode)(unsigned char *, size_t, void *, size_t *),
60 int (*length)(void *),
61 int (*decode)(unsigned char *, size_t, void *, size_t *),
62 int (*cmp)(void *a, void *b))
64 unsigned char buf[4711];
67 void *val = malloc (data_size);
69 if (data_size != 0 && val == NULL)
72 for (i = 0; i < ntests; ++i) {
74 size_t sz, consumed_sz, length_sz;
77 ret = (*encode) (buf + sizeof(buf) - 1, sizeof(buf),
79 beg = buf + sizeof(buf) - sz;
81 printf ("encoding of %s failed\n", tests[i].name);
84 if (sz != tests[i].byte_len) {
85 printf ("encoding of %s has wrong len (%lu != %lu)\n",
87 (unsigned long)sz, (unsigned long)tests[i].byte_len);
91 length_sz = (*length) (tests[i].val);
92 if (sz != length_sz) {
93 printf ("length for %s is bad (%lu != %lu)\n",
94 tests[i].name, (unsigned long)length_sz, (unsigned long)sz);
98 if (memcmp (beg, tests[i].bytes, tests[i].byte_len) != 0) {
99 printf ("encoding of %s has bad bytes:\n"
100 "correct: ", tests[i].name);
101 print_bytes (tests[i].bytes, tests[i].byte_len);
102 printf ("\nactual: ");
103 print_bytes (beg, sz);
107 ret = (*decode) (beg, sz, val, &consumed_sz);
109 printf ("decoding of %s failed\n", tests[i].name);
112 if (sz != consumed_sz) {
113 printf ("different length decoding %s (%ld != %ld)\n",
115 (unsigned long)sz, (unsigned long)consumed_sz);
118 if ((*cmp)(val, tests[i].val) != 0) {
119 printf ("%s: comparison failed\n", tests[i].name);