xfrm_replay.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603
  1. /*
  2. * xfrm_replay.c - xfrm replay detection, derived from xfrm_state.c.
  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.
  19. */
  20. #include <linux/export.h>
  21. #include <net/xfrm.h>
  22. u32 xfrm_replay_seqhi(struct xfrm_state *x, __be32 net_seq)
  23. {
  24. u32 seq, seq_hi, bottom;
  25. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  26. if (!(x->props.flags & XFRM_STATE_ESN))
  27. return 0;
  28. seq = ntohl(net_seq);
  29. seq_hi = replay_esn->seq_hi;
  30. bottom = replay_esn->seq - replay_esn->replay_window + 1;
  31. if (likely(replay_esn->seq >= replay_esn->replay_window - 1)) {
  32. /* A. same subspace */
  33. if (unlikely(seq < bottom))
  34. seq_hi++;
  35. } else {
  36. /* B. window spans two subspaces */
  37. if (unlikely(seq >= bottom))
  38. seq_hi--;
  39. }
  40. return seq_hi;
  41. }
  42. static void xfrm_replay_notify(struct xfrm_state *x, int event)
  43. {
  44. struct km_event c;
  45. /* we send notify messages in case
  46. * 1. we updated on of the sequence numbers, and the seqno difference
  47. * is at least x->replay_maxdiff, in this case we also update the
  48. * timeout of our timer function
  49. * 2. if x->replay_maxage has elapsed since last update,
  50. * and there were changes
  51. *
  52. * The state structure must be locked!
  53. */
  54. switch (event) {
  55. case XFRM_REPLAY_UPDATE:
  56. if (!x->replay_maxdiff ||
  57. ((x->replay.seq - x->preplay.seq < x->replay_maxdiff) &&
  58. (x->replay.oseq - x->preplay.oseq < x->replay_maxdiff))) {
  59. if (x->xflags & XFRM_TIME_DEFER)
  60. event = XFRM_REPLAY_TIMEOUT;
  61. else
  62. return;
  63. }
  64. break;
  65. case XFRM_REPLAY_TIMEOUT:
  66. if (memcmp(&x->replay, &x->preplay,
  67. sizeof(struct xfrm_replay_state)) == 0) {
  68. x->xflags |= XFRM_TIME_DEFER;
  69. return;
  70. }
  71. break;
  72. }
  73. memcpy(&x->preplay, &x->replay, sizeof(struct xfrm_replay_state));
  74. c.event = XFRM_MSG_NEWAE;
  75. c.data.aevent = event;
  76. km_state_notify(x, &c);
  77. if (x->replay_maxage &&
  78. !mod_timer(&x->rtimer, jiffies + x->replay_maxage))
  79. x->xflags &= ~XFRM_TIME_DEFER;
  80. }
  81. static int xfrm_replay_overflow(struct xfrm_state *x, struct sk_buff *skb)
  82. {
  83. int err = 0;
  84. struct net *net = xs_net(x);
  85. if (x->type->flags & XFRM_TYPE_REPLAY_PROT) {
  86. XFRM_SKB_CB(skb)->seq.output.low = ++x->replay.oseq;
  87. if (unlikely(x->replay.oseq == 0)) {
  88. x->replay.oseq--;
  89. xfrm_audit_state_replay_overflow(x, skb);
  90. err = -EOVERFLOW;
  91. return err;
  92. }
  93. if (xfrm_aevent_is_on(net))
  94. x->repl->notify(x, XFRM_REPLAY_UPDATE);
  95. }
  96. return err;
  97. }
  98. static int xfrm_replay_check(struct xfrm_state *x,
  99. struct sk_buff *skb, __be32 net_seq)
  100. {
  101. u32 diff;
  102. u32 seq = ntohl(net_seq);
  103. if (!x->props.replay_window)
  104. return 0;
  105. if (unlikely(seq == 0))
  106. goto err;
  107. if (likely(seq > x->replay.seq))
  108. return 0;
  109. diff = x->replay.seq - seq;
  110. if (diff >= x->props.replay_window) {
  111. x->stats.replay_window++;
  112. goto err;
  113. }
  114. if (x->replay.bitmap & (1U << diff)) {
  115. x->stats.replay++;
  116. goto err;
  117. }
  118. return 0;
  119. err:
  120. xfrm_audit_state_replay(x, skb, net_seq);
  121. return -EINVAL;
  122. }
  123. static void xfrm_replay_advance(struct xfrm_state *x, __be32 net_seq)
  124. {
  125. u32 diff;
  126. u32 seq = ntohl(net_seq);
  127. if (!x->props.replay_window)
  128. return;
  129. if (seq > x->replay.seq) {
  130. diff = seq - x->replay.seq;
  131. if (diff < x->props.replay_window)
  132. x->replay.bitmap = ((x->replay.bitmap) << diff) | 1;
  133. else
  134. x->replay.bitmap = 1;
  135. x->replay.seq = seq;
  136. } else {
  137. diff = x->replay.seq - seq;
  138. x->replay.bitmap |= (1U << diff);
  139. }
  140. if (xfrm_aevent_is_on(xs_net(x)))
  141. x->repl->notify(x, XFRM_REPLAY_UPDATE);
  142. }
  143. static int xfrm_replay_overflow_bmp(struct xfrm_state *x, struct sk_buff *skb)
  144. {
  145. int err = 0;
  146. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  147. struct net *net = xs_net(x);
  148. if (x->type->flags & XFRM_TYPE_REPLAY_PROT) {
  149. XFRM_SKB_CB(skb)->seq.output.low = ++replay_esn->oseq;
  150. if (unlikely(replay_esn->oseq == 0)) {
  151. replay_esn->oseq--;
  152. xfrm_audit_state_replay_overflow(x, skb);
  153. err = -EOVERFLOW;
  154. return err;
  155. }
  156. if (xfrm_aevent_is_on(net))
  157. x->repl->notify(x, XFRM_REPLAY_UPDATE);
  158. }
  159. return err;
  160. }
  161. static int xfrm_replay_check_bmp(struct xfrm_state *x,
  162. struct sk_buff *skb, __be32 net_seq)
  163. {
  164. unsigned int bitnr, nr;
  165. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  166. u32 pos;
  167. u32 seq = ntohl(net_seq);
  168. u32 diff = replay_esn->seq - seq;
  169. if (!replay_esn->replay_window)
  170. return 0;
  171. if (unlikely(seq == 0))
  172. goto err;
  173. if (likely(seq > replay_esn->seq))
  174. return 0;
  175. if (diff >= replay_esn->replay_window) {
  176. x->stats.replay_window++;
  177. goto err;
  178. }
  179. pos = (replay_esn->seq - 1) % replay_esn->replay_window;
  180. if (pos >= diff)
  181. bitnr = (pos - diff) % replay_esn->replay_window;
  182. else
  183. bitnr = replay_esn->replay_window - (diff - pos);
  184. nr = bitnr >> 5;
  185. bitnr = bitnr & 0x1F;
  186. if (replay_esn->bmp[nr] & (1U << bitnr))
  187. goto err_replay;
  188. return 0;
  189. err_replay:
  190. x->stats.replay++;
  191. err:
  192. xfrm_audit_state_replay(x, skb, net_seq);
  193. return -EINVAL;
  194. }
  195. static void xfrm_replay_advance_bmp(struct xfrm_state *x, __be32 net_seq)
  196. {
  197. unsigned int bitnr, nr, i;
  198. u32 diff;
  199. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  200. u32 seq = ntohl(net_seq);
  201. u32 pos;
  202. if (!replay_esn->replay_window)
  203. return;
  204. pos = (replay_esn->seq - 1) % replay_esn->replay_window;
  205. if (seq > replay_esn->seq) {
  206. diff = seq - replay_esn->seq;
  207. if (diff < replay_esn->replay_window) {
  208. for (i = 1; i < diff; i++) {
  209. bitnr = (pos + i) % replay_esn->replay_window;
  210. nr = bitnr >> 5;
  211. bitnr = bitnr & 0x1F;
  212. replay_esn->bmp[nr] &= ~(1U << bitnr);
  213. }
  214. } else {
  215. nr = (replay_esn->replay_window - 1) >> 5;
  216. for (i = 0; i <= nr; i++)
  217. replay_esn->bmp[i] = 0;
  218. }
  219. bitnr = (pos + diff) % replay_esn->replay_window;
  220. replay_esn->seq = seq;
  221. } else {
  222. diff = replay_esn->seq - seq;
  223. if (pos >= diff)
  224. bitnr = (pos - diff) % replay_esn->replay_window;
  225. else
  226. bitnr = replay_esn->replay_window - (diff - pos);
  227. }
  228. nr = bitnr >> 5;
  229. bitnr = bitnr & 0x1F;
  230. replay_esn->bmp[nr] |= (1U << bitnr);
  231. if (xfrm_aevent_is_on(xs_net(x)))
  232. x->repl->notify(x, XFRM_REPLAY_UPDATE);
  233. }
  234. static void xfrm_replay_notify_bmp(struct xfrm_state *x, int event)
  235. {
  236. struct km_event c;
  237. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  238. struct xfrm_replay_state_esn *preplay_esn = x->preplay_esn;
  239. /* we send notify messages in case
  240. * 1. we updated on of the sequence numbers, and the seqno difference
  241. * is at least x->replay_maxdiff, in this case we also update the
  242. * timeout of our timer function
  243. * 2. if x->replay_maxage has elapsed since last update,
  244. * and there were changes
  245. *
  246. * The state structure must be locked!
  247. */
  248. switch (event) {
  249. case XFRM_REPLAY_UPDATE:
  250. if (!x->replay_maxdiff ||
  251. ((replay_esn->seq - preplay_esn->seq < x->replay_maxdiff) &&
  252. (replay_esn->oseq - preplay_esn->oseq
  253. < x->replay_maxdiff))) {
  254. if (x->xflags & XFRM_TIME_DEFER)
  255. event = XFRM_REPLAY_TIMEOUT;
  256. else
  257. return;
  258. }
  259. break;
  260. case XFRM_REPLAY_TIMEOUT:
  261. if (memcmp(x->replay_esn, x->preplay_esn,
  262. xfrm_replay_state_esn_len(replay_esn)) == 0) {
  263. x->xflags |= XFRM_TIME_DEFER;
  264. return;
  265. }
  266. break;
  267. }
  268. memcpy(x->preplay_esn, x->replay_esn,
  269. xfrm_replay_state_esn_len(replay_esn));
  270. c.event = XFRM_MSG_NEWAE;
  271. c.data.aevent = event;
  272. km_state_notify(x, &c);
  273. if (x->replay_maxage &&
  274. !mod_timer(&x->rtimer, jiffies + x->replay_maxage))
  275. x->xflags &= ~XFRM_TIME_DEFER;
  276. }
  277. static void xfrm_replay_notify_esn(struct xfrm_state *x, int event)
  278. {
  279. u32 seq_diff, oseq_diff;
  280. struct km_event c;
  281. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  282. struct xfrm_replay_state_esn *preplay_esn = x->preplay_esn;
  283. /* we send notify messages in case
  284. * 1. we updated on of the sequence numbers, and the seqno difference
  285. * is at least x->replay_maxdiff, in this case we also update the
  286. * timeout of our timer function
  287. * 2. if x->replay_maxage has elapsed since last update,
  288. * and there were changes
  289. *
  290. * The state structure must be locked!
  291. */
  292. switch (event) {
  293. case XFRM_REPLAY_UPDATE:
  294. if (x->replay_maxdiff) {
  295. if (replay_esn->seq_hi == preplay_esn->seq_hi)
  296. seq_diff = replay_esn->seq - preplay_esn->seq;
  297. else
  298. seq_diff = ~preplay_esn->seq + replay_esn->seq
  299. + 1;
  300. if (replay_esn->oseq_hi == preplay_esn->oseq_hi)
  301. oseq_diff = replay_esn->oseq
  302. - preplay_esn->oseq;
  303. else
  304. oseq_diff = ~preplay_esn->oseq
  305. + replay_esn->oseq + 1;
  306. if (seq_diff >= x->replay_maxdiff ||
  307. oseq_diff >= x->replay_maxdiff)
  308. break;
  309. }
  310. if (x->xflags & XFRM_TIME_DEFER)
  311. event = XFRM_REPLAY_TIMEOUT;
  312. else
  313. return;
  314. break;
  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. break;
  322. }
  323. memcpy(x->preplay_esn, x->replay_esn,
  324. xfrm_replay_state_esn_len(replay_esn));
  325. c.event = XFRM_MSG_NEWAE;
  326. c.data.aevent = event;
  327. km_state_notify(x, &c);
  328. if (x->replay_maxage &&
  329. !mod_timer(&x->rtimer, jiffies + x->replay_maxage))
  330. x->xflags &= ~XFRM_TIME_DEFER;
  331. }
  332. static int xfrm_replay_overflow_esn(struct xfrm_state *x, struct sk_buff *skb)
  333. {
  334. int err = 0;
  335. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  336. struct net *net = xs_net(x);
  337. if (x->type->flags & XFRM_TYPE_REPLAY_PROT) {
  338. XFRM_SKB_CB(skb)->seq.output.low = ++replay_esn->oseq;
  339. XFRM_SKB_CB(skb)->seq.output.hi = replay_esn->oseq_hi;
  340. if (unlikely(replay_esn->oseq == 0)) {
  341. XFRM_SKB_CB(skb)->seq.output.hi = ++replay_esn->oseq_hi;
  342. if (replay_esn->oseq_hi == 0) {
  343. replay_esn->oseq--;
  344. replay_esn->oseq_hi--;
  345. xfrm_audit_state_replay_overflow(x, skb);
  346. err = -EOVERFLOW;
  347. return err;
  348. }
  349. }
  350. if (xfrm_aevent_is_on(net))
  351. x->repl->notify(x, XFRM_REPLAY_UPDATE);
  352. }
  353. return err;
  354. }
  355. static int xfrm_replay_check_esn(struct xfrm_state *x,
  356. struct sk_buff *skb, __be32 net_seq)
  357. {
  358. unsigned int bitnr, nr;
  359. u32 diff;
  360. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  361. u32 pos;
  362. u32 seq = ntohl(net_seq);
  363. u32 wsize = replay_esn->replay_window;
  364. u32 top = replay_esn->seq;
  365. u32 bottom = top - wsize + 1;
  366. if (!wsize)
  367. return 0;
  368. if (unlikely(seq == 0 && replay_esn->seq_hi == 0 &&
  369. (replay_esn->seq < replay_esn->replay_window - 1)))
  370. goto err;
  371. diff = top - seq;
  372. if (likely(top >= wsize - 1)) {
  373. /* A. same subspace */
  374. if (likely(seq > top) || seq < bottom)
  375. return 0;
  376. } else {
  377. /* B. window spans two subspaces */
  378. if (likely(seq > top && seq < bottom))
  379. return 0;
  380. if (seq >= bottom)
  381. diff = ~seq + top + 1;
  382. }
  383. if (diff >= replay_esn->replay_window) {
  384. x->stats.replay_window++;
  385. goto err;
  386. }
  387. pos = (replay_esn->seq - 1) % replay_esn->replay_window;
  388. if (pos >= diff)
  389. bitnr = (pos - diff) % replay_esn->replay_window;
  390. else
  391. bitnr = replay_esn->replay_window - (diff - pos);
  392. nr = bitnr >> 5;
  393. bitnr = bitnr & 0x1F;
  394. if (replay_esn->bmp[nr] & (1U << bitnr))
  395. goto err_replay;
  396. return 0;
  397. err_replay:
  398. x->stats.replay++;
  399. err:
  400. xfrm_audit_state_replay(x, skb, net_seq);
  401. return -EINVAL;
  402. }
  403. static int xfrm_replay_recheck_esn(struct xfrm_state *x,
  404. struct sk_buff *skb, __be32 net_seq)
  405. {
  406. if (unlikely(XFRM_SKB_CB(skb)->seq.input.hi !=
  407. htonl(xfrm_replay_seqhi(x, net_seq)))) {
  408. x->stats.replay_window++;
  409. return -EINVAL;
  410. }
  411. return xfrm_replay_check_esn(x, skb, net_seq);
  412. }
  413. static void xfrm_replay_advance_esn(struct xfrm_state *x, __be32 net_seq)
  414. {
  415. unsigned int bitnr, nr, i;
  416. int wrap;
  417. u32 diff, pos, seq, seq_hi;
  418. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  419. if (!replay_esn->replay_window)
  420. return;
  421. seq = ntohl(net_seq);
  422. pos = (replay_esn->seq - 1) % replay_esn->replay_window;
  423. seq_hi = xfrm_replay_seqhi(x, net_seq);
  424. wrap = seq_hi - replay_esn->seq_hi;
  425. if ((!wrap && seq > replay_esn->seq) || wrap > 0) {
  426. if (likely(!wrap))
  427. diff = seq - replay_esn->seq;
  428. else
  429. diff = ~replay_esn->seq + seq + 1;
  430. if (diff < replay_esn->replay_window) {
  431. for (i = 1; i < diff; i++) {
  432. bitnr = (pos + i) % replay_esn->replay_window;
  433. nr = bitnr >> 5;
  434. bitnr = bitnr & 0x1F;
  435. replay_esn->bmp[nr] &= ~(1U << bitnr);
  436. }
  437. } else {
  438. nr = (replay_esn->replay_window - 1) >> 5;
  439. for (i = 0; i <= nr; i++)
  440. replay_esn->bmp[i] = 0;
  441. }
  442. bitnr = (pos + diff) % replay_esn->replay_window;
  443. replay_esn->seq = seq;
  444. if (unlikely(wrap > 0))
  445. replay_esn->seq_hi++;
  446. } else {
  447. diff = replay_esn->seq - seq;
  448. if (pos >= diff)
  449. bitnr = (pos - diff) % replay_esn->replay_window;
  450. else
  451. bitnr = replay_esn->replay_window - (diff - pos);
  452. }
  453. nr = bitnr >> 5;
  454. bitnr = bitnr & 0x1F;
  455. replay_esn->bmp[nr] |= (1U << bitnr);
  456. if (xfrm_aevent_is_on(xs_net(x)))
  457. x->repl->notify(x, XFRM_REPLAY_UPDATE);
  458. }
  459. static struct xfrm_replay xfrm_replay_legacy = {
  460. .advance = xfrm_replay_advance,
  461. .check = xfrm_replay_check,
  462. .recheck = xfrm_replay_check,
  463. .notify = xfrm_replay_notify,
  464. .overflow = xfrm_replay_overflow,
  465. };
  466. static struct xfrm_replay xfrm_replay_bmp = {
  467. .advance = xfrm_replay_advance_bmp,
  468. .check = xfrm_replay_check_bmp,
  469. .recheck = xfrm_replay_check_bmp,
  470. .notify = xfrm_replay_notify_bmp,
  471. .overflow = xfrm_replay_overflow_bmp,
  472. };
  473. static struct xfrm_replay xfrm_replay_esn = {
  474. .advance = xfrm_replay_advance_esn,
  475. .check = xfrm_replay_check_esn,
  476. .recheck = xfrm_replay_recheck_esn,
  477. .notify = xfrm_replay_notify_esn,
  478. .overflow = xfrm_replay_overflow_esn,
  479. };
  480. int xfrm_init_replay(struct xfrm_state *x)
  481. {
  482. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  483. if (replay_esn) {
  484. if (replay_esn->replay_window >
  485. replay_esn->bmp_len * sizeof(__u32) * 8)
  486. return -EINVAL;
  487. if (x->props.flags & XFRM_STATE_ESN) {
  488. if (replay_esn->replay_window == 0)
  489. return -EINVAL;
  490. x->repl = &xfrm_replay_esn;
  491. } else
  492. x->repl = &xfrm_replay_bmp;
  493. } else
  494. x->repl = &xfrm_replay_legacy;
  495. return 0;
  496. }
  497. EXPORT_SYMBOL(xfrm_init_replay);