2
* Copyright (c) 2011, 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.
58
* OID utility routines.
61
#include "gssapiP_eap.h"
64
duplicateOid(OM_uint32 *minor,
65
const gss_OID_desc * const oid,
70
*newOid = GSS_C_NO_OID;
72
p = (gss_OID)GSSEAP_MALLOC(sizeof(*p));
77
p->length = oid->length;
78
p->elements = GSSEAP_MALLOC(p->length);
79
if (p->elements == NULL) {
85
memcpy(p->elements, oid->elements, p->length);
89
return GSS_S_COMPLETE;
92
/* Compose an OID of a prefix and an integer suffix */
94
composeOid(OM_uint32 *minor,
104
if (oid == GSS_C_NO_OID) {
106
return GSS_S_CALL_INACCESSIBLE_READ | GSS_S_FAILURE;
109
if (oid->length < prefix_len) {
110
*minor = GSSEAP_WRONG_SIZE;
111
return GSS_S_FAILURE;
114
memcpy(oid->elements, prefix, prefix_len);
124
if (oid->length < prefix_len + nbytes) {
125
*minor = GSSEAP_WRONG_SIZE;
126
return GSS_S_FAILURE;
129
op = (unsigned char *) oid->elements + prefix_len + nbytes;
132
op[i] = (unsigned char)suffix & 0x7f;
139
oid->length = prefix_len + nbytes;
142
return GSS_S_COMPLETE;
146
decomposeOid(OM_uint32 *minor,
155
if (oid->length < prefix_len ||
156
memcmp(oid->elements, prefix, prefix_len) != 0) {
157
return GSS_S_BAD_MECH;
160
op = (unsigned char *) oid->elements + prefix_len;
164
slen = oid->length - prefix_len;
166
for (i = 0; i < slen; i++) {
167
*suffix = (*suffix << 7) | (op[i] & 0x7f);
168
if (i + 1 != slen && (op[i] & 0x80) == 0) {
169
*minor = GSSEAP_WRONG_SIZE;
170
return GSS_S_FAILURE;
174
return GSS_S_COMPLETE;
178
duplicateOidSet(OM_uint32 *minor,
179
const gss_OID_set src,
182
OM_uint32 major, tmpMinor;
185
if (src == GSS_C_NO_OID_SET) {
186
*dst = GSS_C_NO_OID_SET;
187
return GSS_S_COMPLETE;
190
major = gss_create_empty_oid_set(minor, dst);
191
if (GSS_ERROR(major))
194
for (i = 0; i < src->count; i++) {
195
gss_OID oid = &src->elements[i];
197
major = gss_add_oid_set_member(minor, oid, dst);
198
if (GSS_ERROR(major))
202
if (GSS_ERROR(major))
203
gss_release_oid_set(&tmpMinor, dst);