xfrm_replay.c 13 KB

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