/net/xfrm/xfrm_replay.c

http://github.com/mirrors/linux · C · 750 lines · 581 code · 131 blank · 38 comment · 126 complexity · f3a1f588dd63259e498e96f50544de82 MD5 · raw file

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