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