Line data    Source code

       1             : /*
       2             :  * Copyright (c) 1997 - 2001, 2003 Kungliga Tekniska Högskolan
       3             :  * (Royal Institute of Technology, Stockholm, Sweden).
       4             :  * All rights reserved.
       5             :  *
       6             :  * Redistribution and use in source and binary forms, with or without
       7             :  * modification, are permitted provided that the following conditions
       8             :  * are met:
       9             :  *
      10             :  * 1. Redistributions of source code must retain the above copyright
      11             :  *    notice, this list of conditions and the following disclaimer.
      12             :  *
      13             :  * 2. Redistributions in binary form must reproduce the above copyright
      14             :  *    notice, this list of conditions and the following disclaimer in the
      15             :  *    documentation and/or other materials provided with the distribution.
      16             :  *
      17             :  * 3. Neither the name of the Institute nor the names of its contributors
      18             :  *    may be used to endorse or promote products derived from this software
      19             :  *    without specific prior written permission.
      20             :  *
      21             :  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
      22             :  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
      23             :  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
      24             :  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
      25             :  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
      26             :  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
      27             :  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
      28             :  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
      29             :  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
      30             :  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
      31             :  * SUCH DAMAGE.
      32             :  */
      33             : 
      34             : #include "mech_locl.h"
      35             : 
      36             : /**
      37             :  * Add a oid to the oid set.
      38             :  *
      39             :  * If there is a duplicate member of the oid, the new member is not
      40             :  * added to to the set.
      41             :  *
      42             :  * @param minor_status minor status code.
      43             :  * @param member_oid member to add to the oid set
      44             :  * @param oid_set oid set to add the member too
      45             :  *
      46             :  * @returns a gss_error code, see gss_display_status() about printing
      47             :  *          the error code.
      48             :  *
      49             :  * @ingroup gssapi
      50             :  */
      51             : 
      52             : GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
      53      262124 : gss_add_oid_set_member (OM_uint32 * minor_status,
      54             :                         const gss_OID member_oid,
      55             :                         gss_OID_set * oid_set)
      56             : {
      57        8987 :     gss_OID tmp, interned_oid;
      58        8987 :     size_t n;
      59        8987 :     OM_uint32 res;
      60        8987 :     int present;
      61             : 
      62      262124 :     res = gss_test_oid_set_member(minor_status, member_oid, *oid_set, &present);
      63      262124 :     if (res != GSS_S_COMPLETE)
      64           0 :         return res;
      65             : 
      66      262124 :     if (present) {
      67           0 :         *minor_status = 0;
      68           0 :         return GSS_S_COMPLETE;
      69             :     }
      70             : 
      71      262124 :     n = (*oid_set)->count + 1;
      72      262124 :     tmp = realloc ((*oid_set)->elements, n * sizeof(gss_OID_desc));
      73      262124 :     if (tmp == NULL) {
      74           0 :         *minor_status = ENOMEM;
      75           0 :         return GSS_S_FAILURE;
      76             :     }
      77      262124 :     (*oid_set)->elements = tmp;
      78             : 
      79      262124 :     res = _gss_intern_oid(minor_status, member_oid, &interned_oid);
      80      262124 :     if (res != GSS_S_COMPLETE)
      81           0 :         return res;
      82             : 
      83      262124 :     (*oid_set)->count = n;
      84      262124 :     (*oid_set)->elements[n-1] = *interned_oid;
      85      262124 :     *minor_status = 0;
      86      262124 :     return GSS_S_COMPLETE;
      87             : }