1/*
2 * Copyright (c) 2006 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
37GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
38gss_release_oid(OM_uint32 *minor_status, gss_OID *oid)
39{
40    struct _gss_mech_switch *m;
41    gss_OID o = *oid;
42    size_t n;
43
44    *oid = GSS_C_NO_OID;
45
46    if (minor_status != NULL)
47	*minor_status = 0;
48
49    if (o == GSS_C_NO_OID)
50	return GSS_S_COMPLETE;
51
52    /*
53     * Program broken and tries to release an static oid, don't let
54     * it crash us, search static tables forst.
55     */
56    for (n = 0; _gss_ont_mech[n].oid; n++)
57	if (_gss_ont_mech[n].oid == o)
58	    return GSS_S_COMPLETE;
59    for (n = 0; _gss_ont_ma[n].oid; n++)
60	if (_gss_ont_mech[n].oid == o)
61	    return GSS_S_COMPLETE;
62
63    HEIM_SLIST_FOREACH(m, &_gss_mechs, gm_link) {
64	if (&m->gm_mech.gm_mech_oid == o)
65	    return GSS_S_COMPLETE;
66    }
67
68    /* ok, the program doesn't try to crash us, lets release it for real now */
69
70    if (o->elements != NULL) {
71	free(o->elements);
72	o->elements = NULL;
73    }
74    o->length = 0;
75    free(o);
76
77    return GSS_S_COMPLETE;
78}
79