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
31c0b9f4feSDoug Rabson #include "mech_switch.h"
32c0b9f4feSDoug Rabson #include "name.h"
3333f12199SDoug Rabson #include "utils.h"
34c0b9f4feSDoug Rabson
35c0b9f4feSDoug Rabson OM_uint32
gss_export_name(OM_uint32 * minor_status,const gss_name_t input_name,gss_buffer_t exported_name)36c0b9f4feSDoug Rabson gss_export_name(OM_uint32 *minor_status,
37c0b9f4feSDoug Rabson const gss_name_t input_name,
38c0b9f4feSDoug Rabson gss_buffer_t exported_name)
39c0b9f4feSDoug Rabson {
40c0b9f4feSDoug Rabson struct _gss_name *name = (struct _gss_name *) input_name;
41c0b9f4feSDoug Rabson struct _gss_mechanism_name *mn;
42c0b9f4feSDoug Rabson
4333f12199SDoug Rabson _gss_buffer_zero(exported_name);
4422a25490SDoug Rabson
45c0b9f4feSDoug Rabson /*
46c0b9f4feSDoug Rabson * If this name already has any attached MNs, export the first
47c0b9f4feSDoug Rabson * one, otherwise export based on the first mechanism in our
48c0b9f4feSDoug Rabson * list.
49c0b9f4feSDoug Rabson */
50c0b9f4feSDoug Rabson mn = SLIST_FIRST(&name->gn_mn);
51c0b9f4feSDoug Rabson if (!mn) {
52c0b9f4feSDoug Rabson *minor_status = 0;
5333f12199SDoug Rabson return (GSS_S_NAME_NOT_MN);
54c0b9f4feSDoug Rabson }
55c0b9f4feSDoug Rabson
56c0b9f4feSDoug Rabson return mn->gmn_mech->gm_export_name(minor_status,
57c0b9f4feSDoug Rabson mn->gmn_name, exported_name);
58c0b9f4feSDoug Rabson }
59