1226031Sstas/* 2226031Sstas * Copyright (c) 2006 Kungliga Tekniska H��gskolan 3226031Sstas * (Royal Institute of Technology, Stockholm, Sweden). 4226031Sstas * All rights reserved. 5226031Sstas * 6226031Sstas * Redistribution and use in source and binary forms, with or without 7226031Sstas * modification, are permitted provided that the following conditions 8226031Sstas * are met: 9226031Sstas * 10226031Sstas * 1. Redistributions of source code must retain the above copyright 11226031Sstas * notice, this list of conditions and the following disclaimer. 12226031Sstas * 13226031Sstas * 2. Redistributions in binary form must reproduce the above copyright 14226031Sstas * notice, this list of conditions and the following disclaimer in the 15226031Sstas * documentation and/or other materials provided with the distribution. 16226031Sstas * 17226031Sstas * 3. Neither the name of the Institute nor the names of its contributors 18226031Sstas * may be used to endorse or promote products derived from this software 19226031Sstas * without specific prior written permission. 20226031Sstas * 21226031Sstas * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND 22226031Sstas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23226031Sstas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24226031Sstas * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE 25226031Sstas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26226031Sstas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27226031Sstas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28226031Sstas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29226031Sstas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30226031Sstas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31226031Sstas * SUCH DAMAGE. 32226031Sstas */ 33226031Sstas 34226031Sstas#include "mech_locl.h" 35226031Sstas 36226031SstasGSSAPI_LIB_FUNCTION OM_uint32 GSSAPI_LIB_CALL 37226031Sstasgss_decapsulate_token(gss_const_buffer_t input_token, 38226031Sstas gss_const_OID oid, 39226031Sstas gss_buffer_t output_token) 40226031Sstas{ 41226031Sstas GSSAPIContextToken ct; 42226031Sstas heim_oid o; 43226031Sstas OM_uint32 status; 44226031Sstas int ret; 45226031Sstas size_t size; 46226031Sstas 47226031Sstas _mg_buffer_zero(output_token); 48226031Sstas 49226031Sstas ret = der_get_oid (oid->elements, oid->length, &o, &size); 50226031Sstas if (ret) 51226031Sstas return GSS_S_FAILURE; 52226031Sstas 53226031Sstas ret = decode_GSSAPIContextToken(input_token->value, input_token->length, 54226031Sstas &ct, NULL); 55226031Sstas if (ret) { 56226031Sstas der_free_oid(&o); 57226031Sstas return GSS_S_FAILURE; 58226031Sstas } 59226031Sstas 60226031Sstas if (der_heim_oid_cmp(&ct.thisMech, &o) == 0) { 61226031Sstas status = GSS_S_COMPLETE; 62226031Sstas output_token->value = ct.innerContextToken.data; 63226031Sstas output_token->length = ct.innerContextToken.length; 64226031Sstas der_free_oid(&ct.thisMech); 65226031Sstas } else { 66226031Sstas free_GSSAPIContextToken(&ct); 67226031Sstas status = GSS_S_FAILURE; 68226031Sstas } 69226031Sstas der_free_oid(&o); 70226031Sstas 71226031Sstas return status; 72226031Sstas} 73