| 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, function does not make a copy of the oid, |
| 38 |
* so the pointer to member_oid needs to be stable for the whole time |
| 39 |
* oid_set is used. |
| 40 |
* |
| 41 |
* If there is a duplicate member of the oid, the new member is not |
| 42 |
* added to to the set. |
| 43 |
* |
| 44 |
* @param minor_status minor status code. |
| 45 |
* @param member_oid member to add to the oid set |
| 46 |
* @param oid_set oid set to add the member too |
| 47 |
* |
| 48 |
* @returns a gss_error code, see gss_display_status() about printing |
| 49 |
* the error code. |
| 50 |
* |
| 51 |
* @ingroup gssapi |
| 52 |
*/ |
| 53 |
|
| 54 |
GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL |
| 55 |
gss_add_oid_set_member (OM_uint32 * minor_status, |
| 56 |
const gss_OID member_oid, |
| 57 |
gss_OID_set * oid_set) |
| 58 |
{ |
| 59 |
gss_OID tmp; |
| 60 |
size_t n; |
| 61 |
OM_uint32 res; |
| 62 |
int present; |
| 63 |
|
| 64 |
res = gss_test_oid_set_member(minor_status, member_oid, *oid_set, &present); |
| 65 |
if (res != GSS_S_COMPLETE) |
| 66 |
return res; |
| 67 |
|
| 68 |
if (present) { |
| 69 |
*minor_status = 0; |
| 70 |
return GSS_S_COMPLETE; |
| 71 |
} |
| 72 |
|
| 73 |
n = (*oid_set)->count + 1; |
| 74 |
tmp = realloc ((*oid_set)->elements, n * sizeof(gss_OID_desc)); |
| 75 |
if (tmp == NULL) { |
| 76 |
*minor_status = ENOMEM; |
| 77 |
return GSS_S_FAILURE; |
| 78 |
} |
| 79 |
(*oid_set)->elements = tmp; |
| 80 |
(*oid_set)->count = n; |
| 81 |
(*oid_set)->elements[n-1] = *member_oid; |
| 82 |
*minor_status = 0; |
| 83 |
return GSS_S_COMPLETE; |
| 84 |
} |