1*ae771770SStanislav Sedov /*-
2*ae771770SStanislav Sedov * Copyright (c) 2005 Doug Rabson
3*ae771770SStanislav Sedov * All rights reserved.
4*ae771770SStanislav Sedov *
5*ae771770SStanislav Sedov * Redistribution and use in source and binary forms, with or without
6*ae771770SStanislav Sedov * modification, are permitted provided that the following conditions
7*ae771770SStanislav Sedov * are met:
8*ae771770SStanislav Sedov * 1. Redistributions of source code must retain the above copyright
9*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer.
10*ae771770SStanislav Sedov * 2. Redistributions in binary form must reproduce the above copyright
11*ae771770SStanislav Sedov * notice, this list of conditions and the following disclaimer in the
12*ae771770SStanislav Sedov * documentation and/or other materials provided with the distribution.
13*ae771770SStanislav Sedov *
14*ae771770SStanislav Sedov * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15*ae771770SStanislav Sedov * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16*ae771770SStanislav Sedov * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17*ae771770SStanislav Sedov * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18*ae771770SStanislav Sedov * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19*ae771770SStanislav Sedov * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20*ae771770SStanislav Sedov * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21*ae771770SStanislav Sedov * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22*ae771770SStanislav Sedov * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23*ae771770SStanislav Sedov * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24*ae771770SStanislav Sedov * SUCH DAMAGE.
25*ae771770SStanislav Sedov *
26*ae771770SStanislav Sedov * $FreeBSD: src/lib/libgssapi/gss_duplicate_name.c,v 1.1 2005/12/29 14:40:20 dfr Exp $
27*ae771770SStanislav Sedov */
28*ae771770SStanislav Sedov
29*ae771770SStanislav Sedov #include "mech_locl.h"
30*ae771770SStanislav Sedov
31*ae771770SStanislav Sedov GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
gss_duplicate_name(OM_uint32 * minor_status,const gss_name_t src_name,gss_name_t * dest_name)32*ae771770SStanislav Sedov gss_duplicate_name(OM_uint32 *minor_status,
33*ae771770SStanislav Sedov const gss_name_t src_name,
34*ae771770SStanislav Sedov gss_name_t *dest_name)
35*ae771770SStanislav Sedov {
36*ae771770SStanislav Sedov OM_uint32 major_status;
37*ae771770SStanislav Sedov struct _gss_name *name = (struct _gss_name *) src_name;
38*ae771770SStanislav Sedov struct _gss_name *new_name;
39*ae771770SStanislav Sedov struct _gss_mechanism_name *mn;
40*ae771770SStanislav Sedov
41*ae771770SStanislav Sedov *minor_status = 0;
42*ae771770SStanislav Sedov *dest_name = GSS_C_NO_NAME;
43*ae771770SStanislav Sedov
44*ae771770SStanislav Sedov /*
45*ae771770SStanislav Sedov * If this name has a value (i.e. it didn't come from
46*ae771770SStanislav Sedov * gss_canonicalize_name(), we re-import the thing. Otherwise,
47*ae771770SStanislav Sedov * we make copy of each mech names.
48*ae771770SStanislav Sedov */
49*ae771770SStanislav Sedov if (name->gn_value.value) {
50*ae771770SStanislav Sedov major_status = gss_import_name(minor_status,
51*ae771770SStanislav Sedov &name->gn_value, &name->gn_type, dest_name);
52*ae771770SStanislav Sedov if (major_status != GSS_S_COMPLETE)
53*ae771770SStanislav Sedov return (major_status);
54*ae771770SStanislav Sedov new_name = (struct _gss_name *) *dest_name;
55*ae771770SStanislav Sedov
56*ae771770SStanislav Sedov HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) {
57*ae771770SStanislav Sedov struct _gss_mechanism_name *mn2;
58*ae771770SStanislav Sedov _gss_find_mn(minor_status, new_name,
59*ae771770SStanislav Sedov mn->gmn_mech_oid, &mn2);
60*ae771770SStanislav Sedov }
61*ae771770SStanislav Sedov } else {
62*ae771770SStanislav Sedov new_name = malloc(sizeof(struct _gss_name));
63*ae771770SStanislav Sedov if (!new_name) {
64*ae771770SStanislav Sedov *minor_status = ENOMEM;
65*ae771770SStanislav Sedov return (GSS_S_FAILURE);
66*ae771770SStanislav Sedov }
67*ae771770SStanislav Sedov memset(new_name, 0, sizeof(struct _gss_name));
68*ae771770SStanislav Sedov HEIM_SLIST_INIT(&new_name->gn_mn);
69*ae771770SStanislav Sedov *dest_name = (gss_name_t) new_name;
70*ae771770SStanislav Sedov
71*ae771770SStanislav Sedov HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) {
72*ae771770SStanislav Sedov struct _gss_mechanism_name *new_mn;
73*ae771770SStanislav Sedov
74*ae771770SStanislav Sedov new_mn = malloc(sizeof(*new_mn));
75*ae771770SStanislav Sedov if (!new_mn) {
76*ae771770SStanislav Sedov *minor_status = ENOMEM;
77*ae771770SStanislav Sedov return GSS_S_FAILURE;
78*ae771770SStanislav Sedov }
79*ae771770SStanislav Sedov new_mn->gmn_mech = mn->gmn_mech;
80*ae771770SStanislav Sedov new_mn->gmn_mech_oid = mn->gmn_mech_oid;
81*ae771770SStanislav Sedov
82*ae771770SStanislav Sedov major_status =
83*ae771770SStanislav Sedov mn->gmn_mech->gm_duplicate_name(minor_status,
84*ae771770SStanislav Sedov mn->gmn_name, &new_mn->gmn_name);
85*ae771770SStanislav Sedov if (major_status != GSS_S_COMPLETE) {
86*ae771770SStanislav Sedov free(new_mn);
87*ae771770SStanislav Sedov continue;
88*ae771770SStanislav Sedov }
89*ae771770SStanislav Sedov HEIM_SLIST_INSERT_HEAD(&new_name->gn_mn, new_mn, gmn_link);
90*ae771770SStanislav Sedov }
91*ae771770SStanislav Sedov
92*ae771770SStanislav Sedov }
93*ae771770SStanislav Sedov
94*ae771770SStanislav Sedov return (GSS_S_COMPLETE);
95*ae771770SStanislav Sedov }
96