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