Line data    Source code

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