xref: /freebsd/crypto/heimdal/lib/krb5/store-test.c (revision 9336e0699bda8a301cd2bfa37106b6ec5e32012e)
1 /*
2  * Copyright (c) 2001 Kungliga Tekniska H�gskolan
3  * (Royal Institute of Technology, Stockholm, Sweden).
4  * All rights reserved.
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions
8  * are met:
9  *
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  *
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.
16  *
17  * 3. Neither the name of KTH nor the names of its contributors may be
18  *    used to endorse or promote products derived from this software without
19  *    specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY KTH AND ITS CONTRIBUTORS ``AS IS'' AND ANY
22  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
24  * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KTH OR ITS CONTRIBUTORS BE
25  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
26  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
27  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
28  * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
29  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
30  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
31  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
32 
33 #include "krb5_locl.h"
34 
35 RCSID("$Id: store-test.c,v 1.1 2001/05/11 16:06:25 joda Exp $");
36 
37 static void
38 print_data(unsigned char *data, size_t len)
39 {
40     int i;
41     for(i = 0; i < len; i++) {
42 	if(i > 0 && (i % 16) == 0)
43 	    printf("\n            ");
44 	printf("%02x ", data[i]);
45     }
46     printf("\n");
47 }
48 
49 static int
50 compare(const char *name, krb5_storage *sp, void *expected, size_t len)
51 {
52     int ret = 0;
53     krb5_data data;
54     krb5_storage_to_data(sp, &data);
55     krb5_storage_free(sp);
56     if(data.length != len || memcmp(data.data, expected, len) != 0) {
57 	printf("%s mismatch\n", name);
58 	printf("  Expected: ");
59 	print_data(expected, len);
60 	printf("  Actual:   ");
61 	print_data(data.data, data.length);
62 	ret++;
63     }
64     krb5_data_free(&data);
65     return ret;
66 }
67 
68 int
69 main(int argc, char **argv)
70 {
71     int nerr = 0;
72     krb5_storage *sp;
73     krb5_context context;
74     krb5_principal principal;
75 
76 
77     krb5_init_context(&context);
78 
79     sp = krb5_storage_emem();
80     krb5_store_int32(sp, 0x01020304);
81     nerr += compare("Integer", sp, "\x1\x2\x3\x4", 4);
82 
83     sp = krb5_storage_emem();
84     krb5_storage_set_byteorder(sp, KRB5_STORAGE_BYTEORDER_LE);
85     krb5_store_int32(sp, 0x01020304);
86     nerr += compare("Integer (LE)", sp, "\x4\x3\x2\x1", 4);
87 
88     sp = krb5_storage_emem();
89     krb5_storage_set_byteorder(sp, KRB5_STORAGE_BYTEORDER_BE);
90     krb5_store_int32(sp, 0x01020304);
91     nerr += compare("Integer (BE)", sp, "\x1\x2\x3\x4", 4);
92 
93     sp = krb5_storage_emem();
94     krb5_storage_set_byteorder(sp, KRB5_STORAGE_BYTEORDER_HOST);
95     krb5_store_int32(sp, 0x01020304);
96     {
97 	int test = 1;
98 	void *data;
99 	if(*(char*)&test)
100 	    data = "\x4\x3\x2\x1";
101 	else
102 	    data = "\x1\x2\x3\x4";
103 	nerr += compare("Integer (host)", sp, data, 4);
104     }
105 
106     sp = krb5_storage_emem();
107     krb5_make_principal(context, &principal, "TEST", "foobar", NULL);
108     krb5_store_principal(sp, principal);
109     nerr += compare("Principal", sp, "\x0\x0\x0\x1"
110 		    "\x0\x0\x0\x1"
111 		    "\x0\x0\x0\x4TEST"
112 		    "\x0\x0\x0\x6""foobar", 26);
113 
114     return nerr ? 1 : 0;
115 }
116