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 * Portions Copyright 2003-2010 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.
60 #define KRB_KEYTYPE(key) ((key)->enctype)
63 gssEapSign(krb5_context context,
67 krb5_keyusage sign_usage,
68 gss_iov_buffer_desc *iov,
72 gssEapVerify(krb5_context context,
76 krb5_keyusage sign_usage,
77 gss_iov_buffer_desc *iov,
82 OM_uint32 gssEapAllocContext(OM_uint32 *minor, gss_ctx_id_t *pCtx);
83 OM_uint32 gssEapReleaseContext(OM_uint32 *minor, gss_ctx_id_t *pCtx);
86 OM_uint32 gssEapAllocCred(OM_uint32 *minor, gss_cred_id_t *pCred);
87 OM_uint32 gssEapReleaseCred(OM_uint32 *minor, gss_cred_id_t *pCred);
91 gssEapEncrypt(krb5_context context, int dce_style, size_t ec,
92 size_t rrc, krb5_keyblock *key, int usage, krb5_pointer iv,
93 gss_iov_buffer_desc *iov, int iov_count);
96 gssEapDecrypt(krb5_context context, int dce_style, size_t ec,
97 size_t rrc, krb5_keyblock *key, int usage, krb5_pointer iv,
98 gss_iov_buffer_desc *iov, int iov_count);
101 gssEapMapCryptoFlag(OM_uint32 type);
104 gssEapLocateIov(gss_iov_buffer_desc *iov,
109 gssEapIovMessageLength(gss_iov_buffer_desc *iov,
112 size_t *assoc_data_length);
115 gssEapReleaseIov(gss_iov_buffer_desc *iov, int iov_count);
118 gssEapIsIntegrityOnly(gss_iov_buffer_desc *iov, int iov_count);
121 gssEapAllocIov(gss_iov_buffer_t iov, size_t size);
125 gssEapInternalizeOid(const gss_OID oid,
126 gss_OID *const pInternalizedOid);
129 gssEapDefaultMech(OM_uint32 *minor,
133 gssEapIndicateMechs(OM_uint32 *minor,
137 gssEapEnctypeToOid(OM_uint32 *minor,
138 krb5_enctype enctype,
142 gssEapOidToEnctype(OM_uint32 *minor,
144 krb5_enctype *enctype);
147 OM_uint32 gssEapAllocName(OM_uint32 *minor, gss_name_t *pName);
148 OM_uint32 gssEapReleaseName(OM_uint32 *minor, gss_name_t *pName);
152 composeOid(OM_uint32 *minor_status,
159 decomposeOid(OM_uint32 *minor_status,
166 oidEqual(const gss_OID_desc *o1, const gss_OID_desc *o2)
168 return (o1->length == o2->length &&
169 memcmp(o1->elements, o2->elements, o1->length) == 0);
172 /* util_ordering.c */
174 sequenceInternalize(void **vqueue, unsigned char **buf, size_t *lenremain);
177 sequenceExternalize(void *vqueue, unsigned char **buf, size_t *lenremain);
180 sequenceSize(void *vqueue, size_t *sizep);
183 sequenceFree(void **vqueue);
186 sequenceCheck(void **vqueue, uint64_t seqnum);
189 sequenceInit(void **vqueue, uint64_t seqnum,
190 int do_replay, int do_sequence, int wide_nums);
194 tokenSize(const gss_OID_desc *mech, size_t body_size);
197 makeTokenHeader(const gss_OID_desc *mech,
200 enum gss_eap_token_type tok_type);
203 verifyTokenHeader(const gss_OID_desc * mech,
205 unsigned char **buf_in,
207 enum gss_eap_token_type tok_type);
210 #define GSSEAP_CALLOC(count, size) (calloc((count), (size)))
211 #define GSSEAP_FREE(ptr) (free((ptr)))
212 #define GSSEAP_MALLOC(size) (malloc((size)))
213 #define GSSEAP_REALLOC(ptr, size) (realloc((ptr), (size)))
215 #define GSSEAP_NOT_IMPLEMENTED do { \
216 assert(0 && "not implemented"); \
218 return GSS_S_FAILURE; \
221 /* Helper functions */
223 store_uint16_be(uint16_t val, void *vp)
225 unsigned char *p = (unsigned char *)vp;
227 p[0] = (val >> 8) & 0xff;
228 p[1] = (val ) & 0xff;
231 static inline uint16_t
232 load_uint16_be(const void *cvp)
234 const unsigned char *p = (const unsigned char *)cvp;
236 return (p[1] | (p[0] << 8));
240 store_uint32_be(uint32_t val, void *vp)
242 unsigned char *p = (unsigned char *)vp;
244 p[0] = (val >> 24) & 0xff;
245 p[1] = (val >> 16) & 0xff;
246 p[2] = (val >> 8) & 0xff;
247 p[3] = (val ) & 0xff;
250 static inline uint32_t
251 load_uint32_be(const void *cvp)
253 const unsigned char *p = (const unsigned char *)cvp;
255 return (p[3] | (p[2] << 8)
256 | ((uint32_t) p[1] << 16)
257 | ((uint32_t) p[0] << 24));
261 store_uint64_be(uint64_t val, void *vp)
263 unsigned char *p = (unsigned char *)vp;
265 p[0] = (unsigned char)((val >> 56) & 0xff);
266 p[1] = (unsigned char)((val >> 48) & 0xff);
267 p[2] = (unsigned char)((val >> 40) & 0xff);
268 p[3] = (unsigned char)((val >> 32) & 0xff);
269 p[4] = (unsigned char)((val >> 24) & 0xff);
270 p[5] = (unsigned char)((val >> 16) & 0xff);
271 p[6] = (unsigned char)((val >> 8) & 0xff);
272 p[7] = (unsigned char)((val ) & 0xff);
275 static inline uint64_t
276 load_uint64_be(const void *cvp)
278 const unsigned char *p = (const unsigned char *)cvp;
280 return ((uint64_t)load_uint32_be(p) << 32) | load_uint32_be(p + 4);
283 #endif /* _UTIL_H_ */