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/**
37 * Release a gss_OID
38 *
39 * This function should never be used, this is since many of the
40 * gss_OID objects passed around are stack and data objected that are
41 * not free-able.
42 *
43 * The function tries to find internal OIDs that are static and avoid
44 * trying to free them.
45 *
46 * One could guess that gss_name_to_oid() might return an allocated
47 * OID.  In this implementation it wont, so there is no need to call
48 * gss_release_oid().
49 *
50 * @param minor_status minor status code returned
51 * @param oid oid to be released/freed.
52 *
53 * @returns GSS major status code
54 *
55 * @ingroup gssapi
56 */
57
58GSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL
59gss_release_oid(OM_uint32 *minor_status, gss_OID *oid)
60{
61    struct _gss_mech_switch *m;
62    gss_OID o = *oid;
63    size_t n;
64
65    *oid = GSS_C_NO_OID;
66
67    if (minor_status != NULL)
68	*minor_status = 0;
69
70    if (o == GSS_C_NO_OID)
71	return GSS_S_COMPLETE;
72
73    /*
74     * Program broken and tries to release an static oid, don't let
75     * it crash us, search static tables forst.
76     */
77    for (n = 0; _gss_ont_mech[n].oid; n++)
78	if (_gss_ont_mech[n].oid == o)
79	    return GSS_S_COMPLETE;
80    for (n = 0; _gss_ont_ma[n].oid; n++)
81	if (_gss_ont_ma[n].oid == o)
82	    return GSS_S_COMPLETE;
83
84    HEIM_SLIST_FOREACH(m, &_gss_mechs, gm_link) {
85	if (&m->gm_mech.gm_mech_oid == o)
86	    return GSS_S_COMPLETE;
87    }
88
89    /* ok, the program doesn't try to crash us, lets release it for real now */
90
91    if (o->elements != NULL) {
92	free(o->elements);
93	o->elements = NULL;
94    }
95    o->length = 0;
96    free(o);
97
98    return GSS_S_COMPLETE;
99}
100