| 1 |
/* |
| 2 |
* Copyright (c) 2011 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 |
#include <err.h> |
| 35 |
|
| 36 |
/* |
| 37 |
* |
| 38 |
*/ |
| 39 |
|
| 40 |
static void |
| 41 |
check_linear(krb5_context context, |
| 42 |
const char *client_realm, |
| 43 |
const char *server_realm, |
| 44 |
const char *realm, |
| 45 |
...) |
| 46 |
{ |
| 47 |
unsigned int num_inrealms = 0, num_realms = 0, n; |
| 48 |
char **inrealms = NULL; |
| 49 |
char **realms = NULL; |
| 50 |
krb5_error_code ret; |
| 51 |
krb5_data tr; |
| 52 |
va_list va; |
| 53 |
|
| 54 |
krb5_data_zero(&tr); |
| 55 |
|
| 56 |
va_start(va, realm); |
| 57 |
|
| 58 |
while (realm) { |
| 59 |
inrealms = erealloc(inrealms, (num_inrealms + 2) * sizeof(inrealms[0])); |
| 60 |
inrealms[num_inrealms] = rk_UNCONST(realm); |
| 61 |
num_inrealms++; |
| 62 |
realm = va_arg(va, const char *); |
| 63 |
} |
| 64 |
if (inrealms) |
| 65 |
inrealms[num_inrealms] = NULL; |
| 66 |
|
| 67 |
ret = krb5_domain_x500_encode(inrealms, num_inrealms, &tr); |
| 68 |
if (ret) |
| 69 |
krb5_err(context, 1, ret, "krb5_domain_x500_encode"); |
| 70 |
|
| 71 |
ret = krb5_domain_x500_decode(context, tr, |
| 72 |
&realms, &num_realms, |
| 73 |
client_realm, server_realm); |
| 74 |
if (ret) |
| 75 |
krb5_err(context, 1, ret, "krb5_domain_x500_decode"); |
| 76 |
|
| 77 |
krb5_data_free(&tr); |
| 78 |
|
| 79 |
if (num_inrealms != num_realms) |
| 80 |
errx(1, "num_inrealms != num_realms"); |
| 81 |
|
| 82 |
for(n = 0; n < num_realms; n++) |
| 83 |
free(realms[n]); |
| 84 |
free(realms); |
| 85 |
|
| 86 |
free(inrealms); |
| 87 |
} |
| 88 |
|
| 89 |
|
| 90 |
int |
| 91 |
main(int argc, char **argv) |
| 92 |
{ |
| 93 |
krb5_context context; |
| 94 |
krb5_error_code ret; |
| 95 |
|
| 96 |
setprogname(argv[0]); |
| 97 |
|
| 98 |
ret = krb5_init_context(&context); |
| 99 |
if (ret) |
| 100 |
errx(1, "krb5_init_context"); |
| 101 |
|
| 102 |
|
| 103 |
check_linear(context, "KTH1.SE", "KTH1.SE", NULL); |
| 104 |
check_linear(context, "KTH1.SE", "KTH2.SE", NULL); |
| 105 |
check_linear(context, "KTH1.SE", "KTH3.SE", "KTH2.SE", NULL); |
| 106 |
check_linear(context, "KTH1.SE", "KTH4.SE", "KTH3.SE", "KTH2.SE", NULL); |
| 107 |
check_linear(context, "KTH1.SE", "KTH5.SE", "KTH4.SE", "KTH3.SE", "KTH2.SE", NULL); |
| 108 |
|
| 109 |
return 0; |
| 110 |
} |