2 * Copyright (c) 2008 Doug Rabson
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 #include <gssapi/gssapi.h>
36 gss_encapsulate_token(const gss_buffer_t input_token, gss_OID oid,
37 gss_buffer_t output_token)
40 size_t len, inside_len;
44 _gss_buffer_zero(output_token);
47 * First time around, we calculate the size, second time, we
51 for (i = 0; i < 2; i++) {
55 * Token starts with [APPLICATION 0] SEQUENCE.
62 * The length embedded in the token is the space
63 * needed for the encapsulated oid plus the length of
66 if (oid->length > 127)
67 return (GSS_S_DEFECTIVE_TOKEN);
69 inside_len = 2 + oid->length + input_token->length;
72 * Figure out how to encode the length
74 if (inside_len < 128) {
80 if (inside_len >= 0x100)
82 if (inside_len >= 0x10000)
84 if (inside_len >= 0x1000000)
89 a = inside_len << 8*(4 - b);
100 * Encode the OID for the mechanism. Simplify life by
101 * assuming that the OID length is less than 128 bytes.
110 memcpy(p, oid->elements, oid->length);
116 memcpy(p, input_token->value, input_token->length);
117 p += input_token->length;
119 len += input_token->length;
122 output_token->length = len;
123 output_token->value = malloc(len);
124 if (!output_token->value)
125 return (GSS_S_DEFECTIVE_TOKEN);
126 p = output_token->value;
130 return (GSS_S_COMPLETE);