2 * Copyright (c) 2003 - 2006 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include "gsskrb5_locl.h"
36 #define DEFAULT_JITTER_WINDOW 20
38 struct gss_msg_order {
42 OM_uint32 jitter_window;
53 msg_order_alloc(OM_uint32 *minor_status,
54 struct gss_msg_order **o,
55 OM_uint32 jitter_window)
59 len = jitter_window * sizeof((*o)->elem[0]);
61 len -= sizeof((*o)->elem[0]);
65 *minor_status = ENOMEM;
70 return GSS_S_COMPLETE;
78 _gssapi_msg_order_create(OM_uint32 *minor_status,
79 struct gss_msg_order **o,
82 OM_uint32 jitter_window,
87 if (jitter_window == 0)
88 jitter_window = DEFAULT_JITTER_WINDOW;
90 ret = msg_order_alloc(minor_status, o, jitter_window);
91 if(ret != GSS_S_COMPLETE)
96 (*o)->first_seq = seq_num;
97 (*o)->jitter_window = jitter_window;
98 (*o)->elem[0] = seq_num - 1;
101 return GSS_S_COMPLETE;
105 _gssapi_msg_order_destroy(struct gss_msg_order **m)
109 return GSS_S_COMPLETE;
113 elem_set(struct gss_msg_order *o, unsigned int slot, OM_uint32 val)
115 o->elem[slot % o->jitter_window] = val;
119 elem_insert(struct gss_msg_order *o,
120 unsigned int after_slot,
123 assert(o->jitter_window > after_slot);
125 if (o->length > after_slot)
126 memmove(&o->elem[after_slot + 1], &o->elem[after_slot],
127 (o->length - after_slot - 1) * sizeof(o->elem[0]));
129 elem_set(o, after_slot, seq_num);
131 if (o->length < o->jitter_window)
135 /* rule 1: expected sequence number */
136 /* rule 2: > expected sequence number */
137 /* rule 3: seqnum < seqnum(first) */
138 /* rule 4+5: seqnum in [seqnum(first),seqnum(last)] */
141 _gssapi_msg_order_check(struct gss_msg_order *o, OM_uint32 seq_num)
147 return GSS_S_COMPLETE;
149 if ((o->flags & (GSS_C_REPLAY_FLAG|GSS_C_SEQUENCE_FLAG)) == 0)
150 return GSS_S_COMPLETE;
152 /* check if the packet is the next in order */
153 if (o->elem[0] == seq_num - 1) {
154 elem_insert(o, 0, seq_num);
155 return GSS_S_COMPLETE;
158 r = (o->flags & (GSS_C_REPLAY_FLAG|GSS_C_SEQUENCE_FLAG))==GSS_C_REPLAY_FLAG;
160 /* sequence number larger then largest sequence number
161 * or smaller then the first sequence number */
162 if (seq_num > o->elem[0]
163 || seq_num < o->first_seq
166 elem_insert(o, 0, seq_num);
168 return GSS_S_COMPLETE;
170 return GSS_S_GAP_TOKEN;
174 assert(o->length > 0);
176 /* sequence number smaller the first sequence number */
177 if (seq_num < o->elem[o->length - 1]) {
179 return(GSS_S_OLD_TOKEN);
181 return(GSS_S_UNSEQ_TOKEN);
184 if (seq_num == o->elem[o->length - 1]) {
185 return GSS_S_DUPLICATE_TOKEN;
188 for (i = 0; i < o->length - 1; i++) {
189 if (o->elem[i] == seq_num)
190 return GSS_S_DUPLICATE_TOKEN;
191 if (o->elem[i + 1] < seq_num && o->elem[i] < seq_num) {
192 elem_insert(o, i, seq_num);
194 return GSS_S_COMPLETE;
196 return GSS_S_UNSEQ_TOKEN;
200 return GSS_S_FAILURE;
204 _gssapi_msg_order_f(OM_uint32 flags)
206 return flags & (GSS_C_SEQUENCE_FLAG|GSS_C_REPLAY_FLAG);
210 * Translate `o` into inter-process format and export in to `sp'.
214 _gssapi_msg_order_export(krb5_storage *sp, struct gss_msg_order *o)
216 krb5_error_code kret;
219 kret = krb5_store_int32(sp, o->flags);
222 kret = krb5_store_int32(sp, o->start);
225 kret = krb5_store_int32(sp, o->length);
228 kret = krb5_store_int32(sp, o->jitter_window);
231 kret = krb5_store_int32(sp, o->first_seq);
235 for (i = 0; i < o->jitter_window; i++) {
236 kret = krb5_store_int32(sp, o->elem[i]);
245 _gssapi_msg_order_import(OM_uint32 *minor_status,
247 struct gss_msg_order **o)
250 krb5_error_code kret;
251 int32_t i, flags, start, length, jitter_window, first_seq;
253 kret = krb5_ret_int32(sp, &flags);
256 kret = krb5_ret_int32(sp, &start);
259 kret = krb5_ret_int32(sp, &length);
262 kret = krb5_ret_int32(sp, &jitter_window);
265 kret = krb5_ret_int32(sp, &first_seq);
269 ret = msg_order_alloc(minor_status, o, jitter_window);
270 if (ret != GSS_S_COMPLETE)
275 (*o)->length = length;
276 (*o)->jitter_window = jitter_window;
277 (*o)->first_seq = first_seq;
279 for( i = 0; i < jitter_window; i++ ) {
280 kret = krb5_ret_int32(sp, (int32_t*)&((*o)->elem[i]));
286 return GSS_S_COMPLETE;
289 _gssapi_msg_order_destroy(o);
290 *minor_status = kret;
291 return GSS_S_FAILURE;