lib/libgssapi/gss_duplicate_name.c

   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$
  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_duplicate_name(OM_uint32 *minor_status,
  38     const gss_name_t src_name,
  39     gss_name_t *dest_name)
  40 {
  41         OM_uint32               major_status;
  42         struct _gss_name        *name = (struct _gss_name *) src_name;
  43         struct _gss_name        *new_name;
  44         struct _gss_mechanism_name *mn;
  45
  46         *minor_status = 0;
  47         *dest_name = GSS_C_NO_NAME;
  48
  49         /*
  50          * If this name has a value (i.e. it didn't come from
  51          * gss_canonicalize_name(), we re-import the thing. Otherwise,
  52          * we make a copy of the mechanism names.
  53          */
  54         if (name->gn_value.value) {
  55                 major_status = gss_import_name(minor_status,
  56                     &name->gn_value, &name->gn_type, dest_name);
  57                 if (major_status != GSS_S_COMPLETE)
  58                         return (major_status);
  59                 new_name = (struct _gss_name *) *dest_name;
  60
  61                 SLIST_FOREACH(mn, &name->gn_mn, gmn_link) {
  62                         struct _gss_mechanism_name *mn2;
  63                         _gss_find_mn(minor_status, new_name,
  64                             mn->gmn_mech_oid, &mn2);
  65                 }
  66         } else {
  67                 new_name = malloc(sizeof(struct _gss_name));
  68                 if (!new_name) {
  69                         *minor_status = ENOMEM;
  70                         return (GSS_S_FAILURE);
  71                 }
  72                 memset(new_name, 0, sizeof(struct _gss_name));
  73                 SLIST_INIT(&new_name->gn_mn);
  74                 *dest_name = (gss_name_t) new_name;
  75
  76                 SLIST_FOREACH(mn, &name->gn_mn, gmn_link) {
  77                         struct _gss_mechanism_name *new_mn;
  78
  79                         new_mn = malloc(sizeof(*new_mn));
  80                         if (!new_mn) {
  81                                 *minor_status = ENOMEM;
  82                                 return (GSS_S_FAILURE);
  83                         }
  84                         new_mn->gmn_mech = mn->gmn_mech;
  85                         new_mn->gmn_mech_oid = mn->gmn_mech_oid;
  86
  87                         major_status =
  88                             mn->gmn_mech->gm_duplicate_name(minor_status,
  89                                 mn->gmn_name, &new_mn->gmn_name);
  90                         if (major_status != GSS_S_COMPLETE) {
  91                                 free(new_mn);
  92                                 continue;
  93                         }
  94                         SLIST_INSERT_HEAD(&new_name->gn_mn, new_mn, gmn_link);
  95                 }
  96
  97         }
  98
  99         return (GSS_S_COMPLETE);
 100 }