Commit | Line | Data |
---|---|---|
9fdc4883 SK |
1 | /* |
2 | * xfrm_replay.c - xfrm replay detection, derived from xfrm_state.c. | |
97e15c3a SK |
3 | * |
4 | * Copyright (C) 2010 secunet Security Networks AG | |
5 | * Copyright (C) 2010 Steffen Klassert <steffen.klassert@secunet.com> | |
6 | * | |
7 | * This program is free software; you can redistribute it and/or modify it | |
8 | * under the terms and conditions of the GNU General Public License, | |
9 | * version 2, as published by the Free Software Foundation. | |
10 | * | |
11 | * This program is distributed in the hope it will be useful, but WITHOUT | |
12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for | |
14 | * more details. | |
15 | * | |
16 | * You should have received a copy of the GNU General Public License along with | |
17 | * this program; if not, write to the Free Software Foundation, Inc., | |
18 | * 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA. | |
9fdc4883 SK |
19 | */ |
20 | ||
bc3b2d7f | 21 | #include <linux/export.h> |
9fdc4883 SK |
22 | #include <net/xfrm.h> |
23 | ||
2cd08467 SK |
24 | u32 xfrm_replay_seqhi(struct xfrm_state *x, __be32 net_seq) |
25 | { | |
26 | u32 seq, seq_hi, bottom; | |
27 | struct xfrm_replay_state_esn *replay_esn = x->replay_esn; | |
28 | ||
29 | if (!(x->props.flags & XFRM_STATE_ESN)) | |
30 | return 0; | |
31 | ||
32 | seq = ntohl(net_seq); | |
33 | seq_hi = replay_esn->seq_hi; | |
34 | bottom = replay_esn->seq - replay_esn->replay_window + 1; | |
35 | ||
36 | if (likely(replay_esn->seq >= replay_esn->replay_window - 1)) { | |
37 | /* A. same subspace */ | |
38 | if (unlikely(seq < bottom)) | |
39 | seq_hi++; | |
40 | } else { | |
41 | /* B. window spans two subspaces */ | |
42 | if (unlikely(seq >= bottom)) | |
43 | seq_hi--; | |
44 | } | |
45 | ||
46 | return seq_hi; | |
47 | } | |
48 | ||
9fdc4883 SK |
49 | static void xfrm_replay_notify(struct xfrm_state *x, int event) |
50 | { | |
51 | struct km_event c; | |
52 | /* we send notify messages in case | |
53 | * 1. we updated on of the sequence numbers, and the seqno difference | |
54 | * is at least x->replay_maxdiff, in this case we also update the | |
55 | * timeout of our timer function | |
56 | * 2. if x->replay_maxage has elapsed since last update, | |
57 | * and there were changes | |
58 | * | |
59 | * The state structure must be locked! | |
60 | */ | |
61 | ||
62 | switch (event) { | |
63 | case XFRM_REPLAY_UPDATE: | |
64 | if (x->replay_maxdiff && | |
65 | (x->replay.seq - x->preplay.seq < x->replay_maxdiff) && | |
66 | (x->replay.oseq - x->preplay.oseq < x->replay_maxdiff)) { | |
67 | if (x->xflags & XFRM_TIME_DEFER) | |
68 | event = XFRM_REPLAY_TIMEOUT; | |
69 | else | |
70 | return; | |
71 | } | |
72 | ||
73 | break; | |
74 | ||
75 | case XFRM_REPLAY_TIMEOUT: | |
76 | if (memcmp(&x->replay, &x->preplay, | |
77 | sizeof(struct xfrm_replay_state)) == 0) { | |
78 | x->xflags |= XFRM_TIME_DEFER; | |
79 | return; | |
80 | } | |
81 | ||
82 | break; | |
83 | } | |
84 | ||
85 | memcpy(&x->preplay, &x->replay, sizeof(struct xfrm_replay_state)); | |
86 | c.event = XFRM_MSG_NEWAE; | |
87 | c.data.aevent = event; | |
88 | km_state_notify(x, &c); | |
89 | ||
90 | if (x->replay_maxage && | |
91 | !mod_timer(&x->rtimer, jiffies + x->replay_maxage)) | |
92 | x->xflags &= ~XFRM_TIME_DEFER; | |
93 | } | |
94 | ||
95 | static int xfrm_replay_overflow(struct xfrm_state *x, struct sk_buff *skb) | |
96 | { | |
97 | int err = 0; | |
98 | struct net *net = xs_net(x); | |
99 | ||
100 | if (x->type->flags & XFRM_TYPE_REPLAY_PROT) { | |
101 | XFRM_SKB_CB(skb)->seq.output.low = ++x->replay.oseq; | |
102 | if (unlikely(x->replay.oseq == 0)) { | |
103 | x->replay.oseq--; | |
104 | xfrm_audit_state_replay_overflow(x, skb); | |
105 | err = -EOVERFLOW; | |
106 | ||
107 | return err; | |
108 | } | |
109 | if (xfrm_aevent_is_on(net)) | |
110 | x->repl->notify(x, XFRM_REPLAY_UPDATE); | |
111 | } | |
112 | ||
113 | return err; | |
114 | } | |
115 | ||
116 | static int xfrm_replay_check(struct xfrm_state *x, | |
117 | struct sk_buff *skb, __be32 net_seq) | |
118 | { | |
119 | u32 diff; | |
120 | u32 seq = ntohl(net_seq); | |
121 | ||
36ae0148 SK |
122 | if (!x->props.replay_window) |
123 | return 0; | |
124 | ||
9fdc4883 SK |
125 | if (unlikely(seq == 0)) |
126 | goto err; | |
127 | ||
128 | if (likely(seq > x->replay.seq)) | |
129 | return 0; | |
130 | ||
131 | diff = x->replay.seq - seq; | |
33fce60d | 132 | if (diff >= x->props.replay_window) { |
9fdc4883 SK |
133 | x->stats.replay_window++; |
134 | goto err; | |
135 | } | |
136 | ||
137 | if (x->replay.bitmap & (1U << diff)) { | |
138 | x->stats.replay++; | |
139 | goto err; | |
140 | } | |
141 | return 0; | |
142 | ||
143 | err: | |
144 | xfrm_audit_state_replay(x, skb, net_seq); | |
145 | return -EINVAL; | |
146 | } | |
147 | ||
148 | static void xfrm_replay_advance(struct xfrm_state *x, __be32 net_seq) | |
149 | { | |
150 | u32 diff; | |
151 | u32 seq = ntohl(net_seq); | |
152 | ||
153 | if (!x->props.replay_window) | |
154 | return; | |
155 | ||
156 | if (seq > x->replay.seq) { | |
157 | diff = seq - x->replay.seq; | |
158 | if (diff < x->props.replay_window) | |
159 | x->replay.bitmap = ((x->replay.bitmap) << diff) | 1; | |
160 | else | |
161 | x->replay.bitmap = 1; | |
162 | x->replay.seq = seq; | |
163 | } else { | |
164 | diff = x->replay.seq - seq; | |
165 | x->replay.bitmap |= (1U << diff); | |
166 | } | |
167 | ||
168 | if (xfrm_aevent_is_on(xs_net(x))) | |
1265fd61 | 169 | x->repl->notify(x, XFRM_REPLAY_UPDATE); |
9fdc4883 SK |
170 | } |
171 | ||
97e15c3a SK |
172 | static int xfrm_replay_overflow_bmp(struct xfrm_state *x, struct sk_buff *skb) |
173 | { | |
174 | int err = 0; | |
175 | struct xfrm_replay_state_esn *replay_esn = x->replay_esn; | |
176 | struct net *net = xs_net(x); | |
177 | ||
178 | if (x->type->flags & XFRM_TYPE_REPLAY_PROT) { | |
179 | XFRM_SKB_CB(skb)->seq.output.low = ++replay_esn->oseq; | |
180 | if (unlikely(replay_esn->oseq == 0)) { | |
181 | replay_esn->oseq--; | |
182 | xfrm_audit_state_replay_overflow(x, skb); | |
183 | err = -EOVERFLOW; | |
184 | ||
185 | return err; | |
186 | } | |
187 | if (xfrm_aevent_is_on(net)) | |
188 | x->repl->notify(x, XFRM_REPLAY_UPDATE); | |
189 | } | |
190 | ||
191 | return err; | |
192 | } | |
193 | ||
194 | static int xfrm_replay_check_bmp(struct xfrm_state *x, | |
195 | struct sk_buff *skb, __be32 net_seq) | |
196 | { | |
197 | unsigned int bitnr, nr; | |
198 | struct xfrm_replay_state_esn *replay_esn = x->replay_esn; | |
36ae0148 | 199 | u32 pos; |
97e15c3a SK |
200 | u32 seq = ntohl(net_seq); |
201 | u32 diff = replay_esn->seq - seq; | |
36ae0148 SK |
202 | |
203 | if (!replay_esn->replay_window) | |
204 | return 0; | |
205 | ||
97e15c3a SK |
206 | if (unlikely(seq == 0)) |
207 | goto err; | |
208 | ||
209 | if (likely(seq > replay_esn->seq)) | |
210 | return 0; | |
211 | ||
212 | if (diff >= replay_esn->replay_window) { | |
213 | x->stats.replay_window++; | |
214 | goto err; | |
215 | } | |
216 | ||
1d974374 SK |
217 | pos = (replay_esn->seq - 1) % replay_esn->replay_window; |
218 | ||
219 | if (pos >= diff) | |
97e15c3a | 220 | bitnr = (pos - diff) % replay_esn->replay_window; |
1d974374 | 221 | else |
97e15c3a | 222 | bitnr = replay_esn->replay_window - (diff - pos); |
1d974374 SK |
223 | |
224 | nr = bitnr >> 5; | |
225 | bitnr = bitnr & 0x1F; | |
226 | if (replay_esn->bmp[nr] & (1U << bitnr)) | |
227 | goto err_replay; | |
228 | ||
97e15c3a SK |
229 | return 0; |
230 | ||
231 | err_replay: | |
232 | x->stats.replay++; | |
233 | err: | |
234 | xfrm_audit_state_replay(x, skb, net_seq); | |
235 | return -EINVAL; | |
236 | } | |
237 | ||
238 | static void xfrm_replay_advance_bmp(struct xfrm_state *x, __be32 net_seq) | |
239 | { | |
240 | unsigned int bitnr, nr, i; | |
241 | u32 diff; | |
242 | struct xfrm_replay_state_esn *replay_esn = x->replay_esn; | |
243 | u32 seq = ntohl(net_seq); | |
e2f67259 | 244 | u32 pos; |
97e15c3a SK |
245 | |
246 | if (!replay_esn->replay_window) | |
247 | return; | |
248 | ||
e2f67259 NZ |
249 | pos = (replay_esn->seq - 1) % replay_esn->replay_window; |
250 | ||
97e15c3a SK |
251 | if (seq > replay_esn->seq) { |
252 | diff = seq - replay_esn->seq; | |
253 | ||
254 | if (diff < replay_esn->replay_window) { | |
255 | for (i = 1; i < diff; i++) { | |
256 | bitnr = (pos + i) % replay_esn->replay_window; | |
257 | nr = bitnr >> 5; | |
258 | bitnr = bitnr & 0x1F; | |
259 | replay_esn->bmp[nr] &= ~(1U << bitnr); | |
260 | } | |
97e15c3a | 261 | } else { |
e756682c | 262 | nr = (replay_esn->replay_window - 1) >> 5; |
97e15c3a SK |
263 | for (i = 0; i <= nr; i++) |
264 | replay_esn->bmp[i] = 0; | |
97e15c3a SK |
265 | } |
266 | ||
1d974374 | 267 | bitnr = (pos + diff) % replay_esn->replay_window; |
97e15c3a SK |
268 | replay_esn->seq = seq; |
269 | } else { | |
270 | diff = replay_esn->seq - seq; | |
271 | ||
1d974374 | 272 | if (pos >= diff) |
97e15c3a | 273 | bitnr = (pos - diff) % replay_esn->replay_window; |
1d974374 | 274 | else |
97e15c3a | 275 | bitnr = replay_esn->replay_window - (diff - pos); |
97e15c3a SK |
276 | } |
277 | ||
1d974374 SK |
278 | nr = bitnr >> 5; |
279 | bitnr = bitnr & 0x1F; | |
280 | replay_esn->bmp[nr] |= (1U << bitnr); | |
281 | ||
97e15c3a | 282 | if (xfrm_aevent_is_on(xs_net(x))) |
1265fd61 | 283 | x->repl->notify(x, XFRM_REPLAY_UPDATE); |
97e15c3a SK |
284 | } |
285 | ||
286 | static void xfrm_replay_notify_bmp(struct xfrm_state *x, int event) | |
287 | { | |
288 | struct km_event c; | |
289 | struct xfrm_replay_state_esn *replay_esn = x->replay_esn; | |
290 | struct xfrm_replay_state_esn *preplay_esn = x->preplay_esn; | |
291 | ||
292 | /* we send notify messages in case | |
293 | * 1. we updated on of the sequence numbers, and the seqno difference | |
294 | * is at least x->replay_maxdiff, in this case we also update the | |
295 | * timeout of our timer function | |
296 | * 2. if x->replay_maxage has elapsed since last update, | |
297 | * and there were changes | |
298 | * | |
299 | * The state structure must be locked! | |
300 | */ | |
301 | ||
302 | switch (event) { | |
303 | case XFRM_REPLAY_UPDATE: | |
304 | if (x->replay_maxdiff && | |
305 | (replay_esn->seq - preplay_esn->seq < x->replay_maxdiff) && | |
306 | (replay_esn->oseq - preplay_esn->oseq < x->replay_maxdiff)) { | |
307 | if (x->xflags & XFRM_TIME_DEFER) | |
308 | event = XFRM_REPLAY_TIMEOUT; | |
309 | else | |
310 | return; | |
311 | } | |
312 | ||
313 | break; | |
314 | ||
315 | case XFRM_REPLAY_TIMEOUT: | |
316 | if (memcmp(x->replay_esn, x->preplay_esn, | |
317 | xfrm_replay_state_esn_len(replay_esn)) == 0) { | |
318 | x->xflags |= XFRM_TIME_DEFER; | |
319 | return; | |
320 | } | |
321 | ||
322 | break; | |
323 | } | |
324 | ||
325 | memcpy(x->preplay_esn, x->replay_esn, | |
326 | xfrm_replay_state_esn_len(replay_esn)); | |
327 | c.event = XFRM_MSG_NEWAE; | |
328 | c.data.aevent = event; | |
329 | km_state_notify(x, &c); | |
330 | ||
331 | if (x->replay_maxage && | |
332 | !mod_timer(&x->rtimer, jiffies + x->replay_maxage)) | |
333 | x->xflags &= ~XFRM_TIME_DEFER; | |
334 | } | |
335 | ||
0017c0b5 SK |
336 | static void xfrm_replay_notify_esn(struct xfrm_state *x, int event) |
337 | { | |
338 | u32 seq_diff, oseq_diff; | |
339 | struct km_event c; | |
340 | struct xfrm_replay_state_esn *replay_esn = x->replay_esn; | |
341 | struct xfrm_replay_state_esn *preplay_esn = x->preplay_esn; | |
342 | ||
343 | /* we send notify messages in case | |
344 | * 1. we updated on of the sequence numbers, and the seqno difference | |
345 | * is at least x->replay_maxdiff, in this case we also update the | |
346 | * timeout of our timer function | |
347 | * 2. if x->replay_maxage has elapsed since last update, | |
348 | * and there were changes | |
349 | * | |
350 | * The state structure must be locked! | |
351 | */ | |
352 | ||
353 | switch (event) { | |
354 | case XFRM_REPLAY_UPDATE: | |
355 | if (!x->replay_maxdiff) | |
356 | break; | |
357 | ||
358 | if (replay_esn->seq_hi == preplay_esn->seq_hi) | |
359 | seq_diff = replay_esn->seq - preplay_esn->seq; | |
360 | else | |
799ef90c | 361 | seq_diff = ~preplay_esn->seq + replay_esn->seq + 1; |
0017c0b5 SK |
362 | |
363 | if (replay_esn->oseq_hi == preplay_esn->oseq_hi) | |
364 | oseq_diff = replay_esn->oseq - preplay_esn->oseq; | |
365 | else | |
799ef90c | 366 | oseq_diff = ~preplay_esn->oseq + replay_esn->oseq + 1; |
0017c0b5 SK |
367 | |
368 | if (seq_diff < x->replay_maxdiff && | |
369 | oseq_diff < x->replay_maxdiff) { | |
370 | ||
371 | if (x->xflags & XFRM_TIME_DEFER) | |
372 | event = XFRM_REPLAY_TIMEOUT; | |
373 | else | |
374 | return; | |
375 | } | |
376 | ||
377 | break; | |
378 | ||
379 | case XFRM_REPLAY_TIMEOUT: | |
380 | if (memcmp(x->replay_esn, x->preplay_esn, | |
381 | xfrm_replay_state_esn_len(replay_esn)) == 0) { | |
382 | x->xflags |= XFRM_TIME_DEFER; | |
383 | return; | |
384 | } | |
385 | ||
386 | break; | |
387 | } | |
388 | ||
389 | memcpy(x->preplay_esn, x->replay_esn, | |
390 | xfrm_replay_state_esn_len(replay_esn)); | |
391 | c.event = XFRM_MSG_NEWAE; | |
392 | c.data.aevent = event; | |
393 | km_state_notify(x, &c); | |
394 | ||
395 | if (x->replay_maxage && | |
396 | !mod_timer(&x->rtimer, jiffies + x->replay_maxage)) | |
397 | x->xflags &= ~XFRM_TIME_DEFER; | |
398 | } | |
399 | ||
2cd08467 SK |
400 | static int xfrm_replay_overflow_esn(struct xfrm_state *x, struct sk_buff *skb) |
401 | { | |
402 | int err = 0; | |
403 | struct xfrm_replay_state_esn *replay_esn = x->replay_esn; | |
404 | struct net *net = xs_net(x); | |
405 | ||
406 | if (x->type->flags & XFRM_TYPE_REPLAY_PROT) { | |
407 | XFRM_SKB_CB(skb)->seq.output.low = ++replay_esn->oseq; | |
408 | XFRM_SKB_CB(skb)->seq.output.hi = replay_esn->oseq_hi; | |
409 | ||
410 | if (unlikely(replay_esn->oseq == 0)) { | |
411 | XFRM_SKB_CB(skb)->seq.output.hi = ++replay_esn->oseq_hi; | |
412 | ||
413 | if (replay_esn->oseq_hi == 0) { | |
414 | replay_esn->oseq--; | |
415 | replay_esn->oseq_hi--; | |
416 | xfrm_audit_state_replay_overflow(x, skb); | |
417 | err = -EOVERFLOW; | |
418 | ||
419 | return err; | |
420 | } | |
421 | } | |
422 | if (xfrm_aevent_is_on(net)) | |
423 | x->repl->notify(x, XFRM_REPLAY_UPDATE); | |
424 | } | |
425 | ||
426 | return err; | |
427 | } | |
428 | ||
429 | static int xfrm_replay_check_esn(struct xfrm_state *x, | |
430 | struct sk_buff *skb, __be32 net_seq) | |
431 | { | |
432 | unsigned int bitnr, nr; | |
433 | u32 diff; | |
434 | struct xfrm_replay_state_esn *replay_esn = x->replay_esn; | |
36ae0148 | 435 | u32 pos; |
2cd08467 | 436 | u32 seq = ntohl(net_seq); |
2cd08467 SK |
437 | u32 wsize = replay_esn->replay_window; |
438 | u32 top = replay_esn->seq; | |
439 | u32 bottom = top - wsize + 1; | |
440 | ||
36ae0148 SK |
441 | if (!wsize) |
442 | return 0; | |
443 | ||
2cd08467 SK |
444 | if (unlikely(seq == 0 && replay_esn->seq_hi == 0 && |
445 | (replay_esn->seq < replay_esn->replay_window - 1))) | |
446 | goto err; | |
447 | ||
448 | diff = top - seq; | |
449 | ||
450 | if (likely(top >= wsize - 1)) { | |
451 | /* A. same subspace */ | |
452 | if (likely(seq > top) || seq < bottom) | |
453 | return 0; | |
454 | } else { | |
455 | /* B. window spans two subspaces */ | |
456 | if (likely(seq > top && seq < bottom)) | |
457 | return 0; | |
458 | if (seq >= bottom) | |
459 | diff = ~seq + top + 1; | |
460 | } | |
461 | ||
462 | if (diff >= replay_esn->replay_window) { | |
463 | x->stats.replay_window++; | |
464 | goto err; | |
465 | } | |
466 | ||
1d974374 SK |
467 | pos = (replay_esn->seq - 1) % replay_esn->replay_window; |
468 | ||
469 | if (pos >= diff) | |
2cd08467 | 470 | bitnr = (pos - diff) % replay_esn->replay_window; |
1d974374 | 471 | else |
2cd08467 | 472 | bitnr = replay_esn->replay_window - (diff - pos); |
1d974374 SK |
473 | |
474 | nr = bitnr >> 5; | |
475 | bitnr = bitnr & 0x1F; | |
476 | if (replay_esn->bmp[nr] & (1U << bitnr)) | |
477 | goto err_replay; | |
478 | ||
2cd08467 SK |
479 | return 0; |
480 | ||
481 | err_replay: | |
482 | x->stats.replay++; | |
483 | err: | |
484 | xfrm_audit_state_replay(x, skb, net_seq); | |
485 | return -EINVAL; | |
486 | } | |
487 | ||
3b59df46 SK |
488 | static int xfrm_replay_recheck_esn(struct xfrm_state *x, |
489 | struct sk_buff *skb, __be32 net_seq) | |
490 | { | |
491 | if (unlikely(XFRM_SKB_CB(skb)->seq.input.hi != | |
492 | htonl(xfrm_replay_seqhi(x, net_seq)))) { | |
493 | x->stats.replay_window++; | |
494 | return -EINVAL; | |
495 | } | |
496 | ||
497 | return xfrm_replay_check_esn(x, skb, net_seq); | |
498 | } | |
499 | ||
2cd08467 SK |
500 | static void xfrm_replay_advance_esn(struct xfrm_state *x, __be32 net_seq) |
501 | { | |
502 | unsigned int bitnr, nr, i; | |
503 | int wrap; | |
504 | u32 diff, pos, seq, seq_hi; | |
505 | struct xfrm_replay_state_esn *replay_esn = x->replay_esn; | |
506 | ||
507 | if (!replay_esn->replay_window) | |
508 | return; | |
509 | ||
510 | seq = ntohl(net_seq); | |
511 | pos = (replay_esn->seq - 1) % replay_esn->replay_window; | |
512 | seq_hi = xfrm_replay_seqhi(x, net_seq); | |
513 | wrap = seq_hi - replay_esn->seq_hi; | |
514 | ||
515 | if ((!wrap && seq > replay_esn->seq) || wrap > 0) { | |
516 | if (likely(!wrap)) | |
517 | diff = seq - replay_esn->seq; | |
518 | else | |
519 | diff = ~replay_esn->seq + seq + 1; | |
520 | ||
521 | if (diff < replay_esn->replay_window) { | |
522 | for (i = 1; i < diff; i++) { | |
523 | bitnr = (pos + i) % replay_esn->replay_window; | |
524 | nr = bitnr >> 5; | |
525 | bitnr = bitnr & 0x1F; | |
526 | replay_esn->bmp[nr] &= ~(1U << bitnr); | |
527 | } | |
2cd08467 | 528 | } else { |
e756682c | 529 | nr = (replay_esn->replay_window - 1) >> 5; |
2cd08467 SK |
530 | for (i = 0; i <= nr; i++) |
531 | replay_esn->bmp[i] = 0; | |
2cd08467 SK |
532 | } |
533 | ||
1d974374 | 534 | bitnr = (pos + diff) % replay_esn->replay_window; |
2cd08467 SK |
535 | replay_esn->seq = seq; |
536 | ||
537 | if (unlikely(wrap > 0)) | |
538 | replay_esn->seq_hi++; | |
539 | } else { | |
540 | diff = replay_esn->seq - seq; | |
541 | ||
1d974374 | 542 | if (pos >= diff) |
2cd08467 | 543 | bitnr = (pos - diff) % replay_esn->replay_window; |
1d974374 | 544 | else |
2cd08467 | 545 | bitnr = replay_esn->replay_window - (diff - pos); |
2cd08467 SK |
546 | } |
547 | ||
1d974374 SK |
548 | nr = bitnr >> 5; |
549 | bitnr = bitnr & 0x1F; | |
550 | replay_esn->bmp[nr] |= (1U << bitnr); | |
551 | ||
2cd08467 | 552 | if (xfrm_aevent_is_on(xs_net(x))) |
1265fd61 | 553 | x->repl->notify(x, XFRM_REPLAY_UPDATE); |
2cd08467 SK |
554 | } |
555 | ||
9fdc4883 SK |
556 | static struct xfrm_replay xfrm_replay_legacy = { |
557 | .advance = xfrm_replay_advance, | |
558 | .check = xfrm_replay_check, | |
3b59df46 | 559 | .recheck = xfrm_replay_check, |
9fdc4883 SK |
560 | .notify = xfrm_replay_notify, |
561 | .overflow = xfrm_replay_overflow, | |
562 | }; | |
563 | ||
97e15c3a SK |
564 | static struct xfrm_replay xfrm_replay_bmp = { |
565 | .advance = xfrm_replay_advance_bmp, | |
566 | .check = xfrm_replay_check_bmp, | |
3b59df46 | 567 | .recheck = xfrm_replay_check_bmp, |
97e15c3a SK |
568 | .notify = xfrm_replay_notify_bmp, |
569 | .overflow = xfrm_replay_overflow_bmp, | |
570 | }; | |
571 | ||
2cd08467 SK |
572 | static struct xfrm_replay xfrm_replay_esn = { |
573 | .advance = xfrm_replay_advance_esn, | |
574 | .check = xfrm_replay_check_esn, | |
3b59df46 | 575 | .recheck = xfrm_replay_recheck_esn, |
0017c0b5 | 576 | .notify = xfrm_replay_notify_esn, |
2cd08467 SK |
577 | .overflow = xfrm_replay_overflow_esn, |
578 | }; | |
579 | ||
9fdc4883 SK |
580 | int xfrm_init_replay(struct xfrm_state *x) |
581 | { | |
97e15c3a SK |
582 | struct xfrm_replay_state_esn *replay_esn = x->replay_esn; |
583 | ||
584 | if (replay_esn) { | |
585 | if (replay_esn->replay_window > | |
3f602b08 | 586 | replay_esn->bmp_len * sizeof(__u32) * 8) |
97e15c3a SK |
587 | return -EINVAL; |
588 | ||
aafd0d88 UW |
589 | if (x->props.flags & XFRM_STATE_ESN) { |
590 | if (replay_esn->replay_window == 0) | |
591 | return -EINVAL; | |
592 | x->repl = &xfrm_replay_esn; | |
593 | } else | |
594 | x->repl = &xfrm_replay_bmp; | |
97e15c3a SK |
595 | } else |
596 | x->repl = &xfrm_replay_legacy; | |
597 | ||
9fdc4883 SK |
598 | return 0; |
599 | } | |
600 | EXPORT_SYMBOL(xfrm_init_replay); |