1 /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2 /* lib/krb5/rcache/t_memrcache.c - memory replay cache tests */
3 /*
4 * Copyright (C) 2019 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 "memrcache.c"
34
35 int
main(void)36 main(void)
37 {
38 krb5_error_code ret;
39 krb5_context context;
40 k5_memrcache mrc;
41 int i;
42 uint8_t tag[4];
43 krb5_data tag_data = make_data(tag, 4);
44 struct entry *e;
45
46 ret = krb5_init_context(&context);
47 assert(ret == 0);
48
49 /* Store a thousand unique tags, then verify that they all appear as
50 * replays. */
51 ret = k5_memrcache_create(context, &mrc);
52 assert(ret == 0);
53 for (i = 0; i < 1000; i++) {
54 store_32_be(i, tag);
55 ret = k5_memrcache_store(context, mrc, &tag_data);
56 assert(ret == 0);
57 }
58 for (i = 0; i < 1000; i++) {
59 store_32_be(i, tag);
60 ret = k5_memrcache_store(context, mrc, &tag_data);
61 assert(ret == KRB5KRB_AP_ERR_REPEAT);
62 }
63 k5_memrcache_free(context, mrc);
64
65 /* Store a thousand unique tags, each spaced out so that previous entries
66 * appear as expired. Verify that the expiration queue has one entry. */
67 ret = k5_memrcache_create(context, &mrc);
68 assert(ret == 0);
69 context->clockskew = 100;
70 for (i = 1; i < 1000; i++) {
71 krb5_set_debugging_time(context, i * 200, 0);
72 store_32_be(i, tag);
73 ret = k5_memrcache_store(context, mrc, &tag_data);
74 assert(ret == 0);
75 }
76 e = K5_TAILQ_FIRST(&mrc->expiration_queue);
77 assert(e != NULL && K5_TAILQ_NEXT(e, links) == NULL);
78 k5_memrcache_free(context, mrc);
79
80 krb5_free_context(context);
81 return 0;
82 }
83