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
35static void
36print_data(unsigned char *data, size_t len)
37{
38    int i;
39    for(i = 0; i < len; i++) {
40	if(i > 0 && (i % 16) == 0)
41	    printf("\n            ");
42	printf("%02x ", data[i]);
43    }
44    printf("\n");
45}
46
47static int
48compare(const char *name, krb5_storage *sp, void *expected, size_t len)
49{
50    int ret = 0;
51    krb5_data data;
52    if (krb5_storage_to_data(sp, &data))
53	errx(1, "krb5_storage_to_data failed");
54    krb5_storage_free(sp);
55    if(data.length != len || memcmp(data.data, expected, len) != 0) {
56	printf("%s mismatch\n", name);
57	printf("  Expected: ");
58	print_data(expected, len);
59	printf("  Actual:   ");
60	print_data(data.data, data.length);
61	ret++;
62    }
63    krb5_data_free(&data);
64    return ret;
65}
66
67int
68main(int argc, char **argv)
69{
70    int nerr = 0;
71    krb5_storage *sp;
72    krb5_context context;
73    krb5_principal principal;
74
75
76    krb5_init_context(&context);
77
78    sp = krb5_storage_emem();
79    krb5_store_int32(sp, 0x01020304);
80    nerr += compare("Integer", sp, "\x1\x2\x3\x4", 4);
81
82    sp = krb5_storage_emem();
83    krb5_storage_set_byteorder(sp, KRB5_STORAGE_BYTEORDER_LE);
84    krb5_store_int32(sp, 0x01020304);
85    nerr += compare("Integer (LE)", sp, "\x4\x3\x2\x1", 4);
86
87    sp = krb5_storage_emem();
88    krb5_storage_set_byteorder(sp, KRB5_STORAGE_BYTEORDER_BE);
89    krb5_store_int32(sp, 0x01020304);
90    nerr += compare("Integer (BE)", sp, "\x1\x2\x3\x4", 4);
91
92    sp = krb5_storage_emem();
93    krb5_storage_set_byteorder(sp, KRB5_STORAGE_BYTEORDER_HOST);
94    krb5_store_int32(sp, 0x01020304);
95    {
96	int test = 1;
97	void *data;
98	if(*(char*)&test)
99	    data = "\x4\x3\x2\x1";
100	else
101	    data = "\x1\x2\x3\x4";
102	nerr += compare("Integer (host)", sp, data, 4);
103    }
104
105    sp = krb5_storage_emem();
106    krb5_make_principal(context, &principal, "TEST", "foobar", NULL);
107    krb5_store_principal(sp, principal);
108    krb5_free_principal(context, 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    krb5_free_context(context);
115
116    return nerr ? 1 : 0;
117}
118