1 /* $NetBSD: gss_duplicate_name.c,v 1.1.1.2 2014/04/24 12:45:29 pettai Exp $ */
2
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 * $FreeBSD: src/lib/libgssapi/gss_duplicate_name.c,v 1.1 2005/12/29 14:40:20 dfr Exp $
29 */
30
31 #include "mech_locl.h"
32
33 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)34 gss_duplicate_name(OM_uint32 *minor_status,
35 const gss_name_t src_name,
36 gss_name_t *dest_name)
37 {
38 OM_uint32 major_status;
39 struct _gss_name *name = (struct _gss_name *) src_name;
40 struct _gss_name *new_name;
41 struct _gss_mechanism_name *mn;
42
43 *minor_status = 0;
44 *dest_name = GSS_C_NO_NAME;
45
46 /*
47 * If this name has a value (i.e. it didn't come from
48 * gss_canonicalize_name(), we re-import the thing. Otherwise,
49 * we make copy of each mech names.
50 */
51 if (name->gn_value.value) {
52 major_status = gss_import_name(minor_status,
53 &name->gn_value, &name->gn_type, dest_name);
54 if (major_status != GSS_S_COMPLETE)
55 return (major_status);
56 new_name = (struct _gss_name *) *dest_name;
57
58 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) {
59 struct _gss_mechanism_name *mn2;
60 _gss_find_mn(minor_status, new_name,
61 mn->gmn_mech_oid, &mn2);
62 }
63 } else {
64 new_name = malloc(sizeof(struct _gss_name));
65 if (!new_name) {
66 *minor_status = ENOMEM;
67 return (GSS_S_FAILURE);
68 }
69 memset(new_name, 0, sizeof(struct _gss_name));
70 HEIM_SLIST_INIT(&new_name->gn_mn);
71 *dest_name = (gss_name_t) new_name;
72
73 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) {
74 struct _gss_mechanism_name *new_mn;
75
76 new_mn = malloc(sizeof(*new_mn));
77 if (!new_mn) {
78 *minor_status = ENOMEM;
79 return GSS_S_FAILURE;
80 }
81 new_mn->gmn_mech = mn->gmn_mech;
82 new_mn->gmn_mech_oid = mn->gmn_mech_oid;
83
84 major_status =
85 mn->gmn_mech->gm_duplicate_name(minor_status,
86 mn->gmn_name, &new_mn->gmn_name);
87 if (major_status != GSS_S_COMPLETE) {
88 free(new_mn);
89 continue;
90 }
91 HEIM_SLIST_INSERT_HEAD(&new_name->gn_mn, new_mn, gmn_link);
92 }
93
94 }
95
96 return (GSS_S_COMPLETE);
97 }
98