1 /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2 /* lib/kdb/t_sort_key_data.c - krb5_dbe_sort_key_data() unit tests */
3 /*
4 * Copyright (C) 2015 by the Massachusetts Institute of Technology.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 *
14 * * Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in
16 * the documentation and/or other materials provided with the
17 * distribution.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
22 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
23 * COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
24 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
25 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
26 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
28 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
30 * OF THE POSSIBILITY OF SUCH DAMAGE.
31 */
32
33 #include "k5-cmocka.h"
34 #include "kdb.h"
35
36 #define KEY(kvno) { \
37 1, kvno, { ENCTYPE_AES128_CTS_HMAC_SHA1_96, 0 }, \
38 { 16, 0 }, \
39 { (uint8_t *)("\xDC\xEE\xB7\x0B\x3D\xE7\x65\x62" \
40 "\xE6\x89\x22\x6C\x76\x42\x91\x48"), \
41 NULL } \
42 }
43
44 static void
assert_sorted(krb5_key_data * keys,int num_keys)45 assert_sorted(krb5_key_data *keys, int num_keys)
46 {
47 int i;
48
49 for (i = 1; i < num_keys; i++)
50 assert_true(keys[i].key_data_kvno <= keys[i - 1].key_data_kvno);
51 }
52
53 static void
test_pre_sorted(void ** state)54 test_pre_sorted(void **state)
55 {
56 krb5_key_data keys[] = { KEY(5), KEY(5), KEY(4), KEY(3), KEY(3), KEY(2),
57 KEY(2), KEY(1) };
58 int n_keys = sizeof(keys)/sizeof(keys[0]);
59
60 krb5_dbe_sort_key_data(keys, n_keys);
61 assert_sorted(keys, n_keys);
62 }
63
64 static void
test_reverse_sorted(void ** state)65 test_reverse_sorted(void **state)
66 {
67 krb5_key_data keys[] = { KEY(1), KEY(2), KEY(2), KEY(3), KEY(3), KEY(3),
68 KEY(4), KEY(5) };
69 int n_keys = sizeof(keys)/sizeof(keys[0]);
70
71 krb5_dbe_sort_key_data(keys, n_keys);
72 assert_sorted(keys, n_keys);
73 }
74
75 static void
test_random_order(void ** state)76 test_random_order(void **state)
77 {
78 krb5_key_data keys[] = { KEY(1), KEY(4), KEY(1), KEY(3), KEY(4), KEY(3),
79 KEY(5), KEY(2) };
80 int n_keys = sizeof(keys)/sizeof(keys[0]);
81
82 krb5_dbe_sort_key_data(keys, n_keys);
83 assert_sorted(keys, n_keys);
84 }
85
86 int
main(void)87 main(void)
88 {
89 const struct CMUnitTest tests[] = {
90 cmocka_unit_test(test_pre_sorted),
91 cmocka_unit_test(test_reverse_sorted),
92 cmocka_unit_test(test_random_order)
93 };
94
95 return cmocka_run_group_tests(tests, NULL, NULL);
96 }
97