1c0b9f4feSDoug Rabson /*-
2*4d846d26SWarner Losh * SPDX-License-Identifier: BSD-2-Clause
35e53a4f9SPedro F. Giffuni *
4c0b9f4feSDoug Rabson * Copyright (c) 2005 Doug Rabson
5c0b9f4feSDoug Rabson * All rights reserved.
6c0b9f4feSDoug Rabson *
7c0b9f4feSDoug Rabson * Redistribution and use in source and binary forms, with or without
8c0b9f4feSDoug Rabson * modification, are permitted provided that the following conditions
9c0b9f4feSDoug Rabson * are met:
10c0b9f4feSDoug Rabson * 1. Redistributions of source code must retain the above copyright
11c0b9f4feSDoug Rabson * notice, this list of conditions and the following disclaimer.
12c0b9f4feSDoug Rabson * 2. Redistributions in binary form must reproduce the above copyright
13c0b9f4feSDoug Rabson * notice, this list of conditions and the following disclaimer in the
14c0b9f4feSDoug Rabson * documentation and/or other materials provided with the distribution.
15c0b9f4feSDoug Rabson *
16c0b9f4feSDoug Rabson * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17c0b9f4feSDoug Rabson * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18c0b9f4feSDoug Rabson * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19c0b9f4feSDoug Rabson * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20c0b9f4feSDoug Rabson * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21c0b9f4feSDoug Rabson * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22c0b9f4feSDoug Rabson * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23c0b9f4feSDoug Rabson * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24c0b9f4feSDoug Rabson * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25c0b9f4feSDoug Rabson * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26c0b9f4feSDoug Rabson * SUCH DAMAGE.
27c0b9f4feSDoug Rabson */
28c0b9f4feSDoug Rabson
29c0b9f4feSDoug Rabson #include <gssapi/gssapi.h>
30c0b9f4feSDoug Rabson #include <stdlib.h>
313aebdb89SAlexander Kabaev #include <string.h>
32c0b9f4feSDoug Rabson #include <errno.h>
33c0b9f4feSDoug Rabson
34c0b9f4feSDoug Rabson #include "mech_switch.h"
35c0b9f4feSDoug Rabson #include "name.h"
36c0b9f4feSDoug Rabson
37c0b9f4feSDoug Rabson OM_uint32
gss_canonicalize_name(OM_uint32 * minor_status,const gss_name_t input_name,const gss_OID mech_type,gss_name_t * output_name)38c0b9f4feSDoug Rabson gss_canonicalize_name(OM_uint32 *minor_status,
39c0b9f4feSDoug Rabson const gss_name_t input_name,
40c0b9f4feSDoug Rabson const gss_OID mech_type,
41c0b9f4feSDoug Rabson gss_name_t *output_name)
42c0b9f4feSDoug Rabson {
43c0b9f4feSDoug Rabson OM_uint32 major_status;
44c0b9f4feSDoug Rabson struct _gss_name *name = (struct _gss_name *) input_name;
45c0b9f4feSDoug Rabson struct _gss_mechanism_name *mn;
46c0b9f4feSDoug Rabson struct _gss_mech_switch *m = _gss_find_mech_switch(mech_type);
47c0b9f4feSDoug Rabson gss_name_t new_canonical_name;
48c0b9f4feSDoug Rabson
49c0b9f4feSDoug Rabson *minor_status = 0;
50c0b9f4feSDoug Rabson *output_name = 0;
51c0b9f4feSDoug Rabson
5233f12199SDoug Rabson major_status = _gss_find_mn(minor_status, name, mech_type, &mn);
5333f12199SDoug Rabson if (major_status)
5433f12199SDoug Rabson return (major_status);
55c0b9f4feSDoug Rabson
56c0b9f4feSDoug Rabson m = mn->gmn_mech;
57c0b9f4feSDoug Rabson major_status = m->gm_canonicalize_name(minor_status,
58c0b9f4feSDoug Rabson mn->gmn_name, mech_type, &new_canonical_name);
5933f12199SDoug Rabson if (major_status) {
6033f12199SDoug Rabson _gss_mg_error(m, major_status, *minor_status);
61c0b9f4feSDoug Rabson return (major_status);
6233f12199SDoug Rabson }
63c0b9f4feSDoug Rabson
64c0b9f4feSDoug Rabson /*
65c0b9f4feSDoug Rabson * Now we make a new name and mark it as an MN.
66c0b9f4feSDoug Rabson */
67c0b9f4feSDoug Rabson *minor_status = 0;
68c0b9f4feSDoug Rabson name = malloc(sizeof(struct _gss_name));
69c0b9f4feSDoug Rabson if (!name) {
70c0b9f4feSDoug Rabson m->gm_release_name(minor_status, &new_canonical_name);
71c0b9f4feSDoug Rabson *minor_status = ENOMEM;
72c0b9f4feSDoug Rabson return (GSS_S_FAILURE);
73c0b9f4feSDoug Rabson }
74c0b9f4feSDoug Rabson memset(name, 0, sizeof(struct _gss_name));
75c0b9f4feSDoug Rabson
76c0b9f4feSDoug Rabson mn = malloc(sizeof(struct _gss_mechanism_name));
77c0b9f4feSDoug Rabson if (!mn) {
78c0b9f4feSDoug Rabson m->gm_release_name(minor_status, &new_canonical_name);
79c0b9f4feSDoug Rabson free(name);
80c0b9f4feSDoug Rabson *minor_status = ENOMEM;
81c0b9f4feSDoug Rabson return (GSS_S_FAILURE);
82c0b9f4feSDoug Rabson }
83c0b9f4feSDoug Rabson
84c0b9f4feSDoug Rabson SLIST_INIT(&name->gn_mn);
85c0b9f4feSDoug Rabson mn->gmn_mech = m;
86c0b9f4feSDoug Rabson mn->gmn_mech_oid = &m->gm_mech_oid;
87c0b9f4feSDoug Rabson mn->gmn_name = new_canonical_name;
88c0b9f4feSDoug Rabson SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link);
89c0b9f4feSDoug Rabson
90c0b9f4feSDoug Rabson *output_name = (gss_name_t) name;
91c0b9f4feSDoug Rabson
92c0b9f4feSDoug Rabson return (GSS_S_COMPLETE);
93c0b9f4feSDoug Rabson }
94