2 * Copyright (c) 2010, JANET(UK)
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of JANET(UK) nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
21 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * Copyright 1995-2010 by the Massachusetts Institute of Technology.
34 * All Rights Reserved.
36 * Export of this software from the United States of America may
37 * require a specific license from the United States Government.
38 * It is the responsibility of any person or organization contemplating
39 * export to obtain such a license before exporting.
41 * WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
42 * distribute this software and its documentation for any purpose and
43 * without fee is hereby granted, provided that the above copyright
44 * notice appear in all copies and that both that copyright notice and
45 * this permission notice appear in supporting documentation, and that
46 * the name of M.I.T. not be used in advertising or publicity pertaining
47 * to distribution of the software without specific, written prior
48 * permission. Furthermore if you modify this software you must label
49 * your software as modified software and not distribute it in such a
50 * fashion that it might be confused with the original M.I.T. software.
51 * M.I.T. makes no representations about the suitability of
52 * this software for any purpose. It is provided "as is" without express
53 * or implied warranty.
57 #include "gssapiP_eap.h"
61 copyOid(OM_uint32 *minor_status,
62 const gss_OID_desc * const oid,
69 p = (gss_OID) malloc(sizeof(gss_OID_desc));
71 *minor_status = ENOMEM;
74 p->length = oid->length;
75 p->elements = malloc(p->length);
80 memcpy(p->elements, oid->elements, p->length);
82 return(GSS_S_COMPLETE);
86 /* Compose an OID of a prefix and an integer suffix */
88 composeOid(OM_uint32 *minor_status,
98 if (oid == GSS_C_NO_OID) {
99 *minor_status = EINVAL;
100 return GSS_S_FAILURE;
102 if (oid->length < prefix_len) {
103 *minor_status = ERANGE;
104 return GSS_S_FAILURE;
107 memcpy(oid->elements, prefix, prefix_len);
117 if (oid->length < prefix_len + nbytes) {
118 *minor_status = ERANGE;
119 return GSS_S_FAILURE;
122 op = (unsigned char *) oid->elements + prefix_len + nbytes;
125 op[i] = (unsigned char)suffix & 0x7f;
132 oid->length = prefix_len + nbytes;
135 return GSS_S_COMPLETE;
139 decomposeOid(OM_uint32 *minor_status,
148 if (oid->length < prefix_len ||
149 memcmp(oid->elements, prefix, prefix_len) != 0) {
150 return GSS_S_BAD_MECH;
153 op = (unsigned char *) oid->elements + prefix_len;
157 slen = oid->length - prefix_len;
159 for (i = 0; i < slen; i++) {
160 *suffix = (*suffix << 7) | (op[i] & 0x7f);
161 if (i + 1 != slen && (op[i] & 0x80) == 0) {
162 *minor_status = EINVAL;
163 return GSS_S_FAILURE;
167 return GSS_S_COMPLETE;
172 gssEapReleaseOid(OM_uint32 *minor, gss_OID *oid)
176 major = gss_internal_release_oid(minor, oid);
177 if (major == GSS_S_CONTINUE_NEEDED) {
178 GSSEAP_FREE(oid->elements);
181 major = GSS_S_COMPLETE;