1/*-
2 * Copyright (c) 2005 Doug Rabson
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 *
26 *	$FreeBSD: src/lib/libgssapi/gss_names.c,v 1.1 2005/12/29 14:40:20 dfr Exp $
27 */
28
29#include "mech_locl.h"
30
31OM_uint32
32_gss_find_mn(OM_uint32 *minor_status, struct _gss_name *name, gss_OID mech,
33	     struct _gss_mechanism_name **output_mn)
34{
35	OM_uint32 major_status;
36	gssapi_mech_interface m;
37	struct _gss_mechanism_name *mn;
38
39	*output_mn = NULL;
40
41	HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) {
42		if (gss_oid_equal(mech, mn->gmn_mech_oid))
43			break;
44	}
45
46	if (!mn) {
47		/*
48		 * If this name is canonical (i.e. there is only an
49		 * MN but it is from a different mech), give up now.
50		 */
51		if (!name->gn_value.value)
52			return GSS_S_BAD_NAME;
53
54		m = __gss_get_mechanism(mech);
55		if (!m)
56			return (GSS_S_BAD_MECH);
57
58		mn = malloc(sizeof(struct _gss_mechanism_name));
59		if (!mn)
60			return GSS_S_FAILURE;
61
62		major_status = m->gm_import_name(minor_status,
63		    &name->gn_value,
64		    (name->gn_type.elements
65			? &name->gn_type : GSS_C_NO_OID),
66		    &mn->gmn_name);
67		if (major_status != GSS_S_COMPLETE) {
68			_gss_mg_error(m, major_status, *minor_status);
69			free(mn);
70			return major_status;
71		}
72
73		mn->gmn_mech = m;
74		mn->gmn_mech_oid = &m->gm_mech_oid;
75		HEIM_SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link);
76	}
77	*output_mn = mn;
78	return 0;
79}
80
81
82/*
83 * Make a name from an MN.
84 */
85struct _gss_name *
86_gss_make_name(gssapi_mech_interface m, gss_name_t new_mn)
87{
88	struct _gss_name *name;
89	struct _gss_mechanism_name *mn;
90
91	name = malloc(sizeof(struct _gss_name));
92	if (!name)
93		return (0);
94	memset(name, 0, sizeof(struct _gss_name));
95
96	mn = malloc(sizeof(struct _gss_mechanism_name));
97	if (!mn) {
98		free(name);
99		return (0);
100	}
101
102	HEIM_SLIST_INIT(&name->gn_mn);
103	mn->gmn_mech = m;
104	mn->gmn_mech_oid = &m->gm_mech_oid;
105	mn->gmn_name = new_mn;
106	HEIM_SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link);
107
108	return (name);
109}
110
111