xfrm_replay.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537
  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 >= min_t(unsigned int, x->props.replay_window,
  111. sizeof(x->replay.bitmap) * 8)) {
  112. x->stats.replay_window++;
  113. goto err;
  114. }
  115. if (x->replay.bitmap & (1U << diff)) {
  116. x->stats.replay++;
  117. goto err;
  118. }
  119. return 0;
  120. err:
  121. xfrm_audit_state_replay(x, skb, net_seq);
  122. return -EINVAL;
  123. }
  124. static void xfrm_replay_advance(struct xfrm_state *x, __be32 net_seq)
  125. {
  126. u32 diff;
  127. u32 seq = ntohl(net_seq);
  128. if (!x->props.replay_window)
  129. return;
  130. if (seq > x->replay.seq) {
  131. diff = seq - x->replay.seq;
  132. if (diff < x->props.replay_window)
  133. x->replay.bitmap = ((x->replay.bitmap) << diff) | 1;
  134. else
  135. x->replay.bitmap = 1;
  136. x->replay.seq = seq;
  137. } else {
  138. diff = x->replay.seq - seq;
  139. x->replay.bitmap |= (1U << diff);
  140. }
  141. if (xfrm_aevent_is_on(xs_net(x)))
  142. x->repl->notify(x, XFRM_REPLAY_UPDATE);
  143. }
  144. static int xfrm_replay_overflow_bmp(struct xfrm_state *x, struct sk_buff *skb)
  145. {
  146. int err = 0;
  147. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  148. struct net *net = xs_net(x);
  149. if (x->type->flags & XFRM_TYPE_REPLAY_PROT) {
  150. XFRM_SKB_CB(skb)->seq.output.low = ++replay_esn->oseq;
  151. if (unlikely(replay_esn->oseq == 0)) {
  152. replay_esn->oseq--;
  153. xfrm_audit_state_replay_overflow(x, skb);
  154. err = -EOVERFLOW;
  155. return err;
  156. }
  157. if (xfrm_aevent_is_on(net))
  158. x->repl->notify(x, XFRM_REPLAY_UPDATE);
  159. }
  160. return err;
  161. }
  162. static int xfrm_replay_check_bmp(struct xfrm_state *x,
  163. struct sk_buff *skb, __be32 net_seq)
  164. {
  165. unsigned int bitnr, nr;
  166. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  167. u32 pos;
  168. u32 seq = ntohl(net_seq);
  169. u32 diff = replay_esn->seq - seq;
  170. if (!replay_esn->replay_window)
  171. return 0;
  172. if (unlikely(seq == 0))
  173. goto err;
  174. if (likely(seq > replay_esn->seq))
  175. return 0;
  176. if (diff >= replay_esn->replay_window) {
  177. x->stats.replay_window++;
  178. goto err;
  179. }
  180. pos = (replay_esn->seq - 1) % replay_esn->replay_window;
  181. if (pos >= diff)
  182. bitnr = (pos - diff) % replay_esn->replay_window;
  183. else
  184. bitnr = replay_esn->replay_window - (diff - pos);
  185. nr = bitnr >> 5;
  186. bitnr = bitnr & 0x1F;
  187. if (replay_esn->bmp[nr] & (1U << bitnr))
  188. goto err_replay;
  189. return 0;
  190. err_replay:
  191. x->stats.replay++;
  192. err:
  193. xfrm_audit_state_replay(x, skb, net_seq);
  194. return -EINVAL;
  195. }
  196. static void xfrm_replay_advance_bmp(struct xfrm_state *x, __be32 net_seq)
  197. {
  198. unsigned int bitnr, nr, i;
  199. u32 diff;
  200. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  201. u32 seq = ntohl(net_seq);
  202. u32 pos = (replay_esn->seq - 1) % replay_esn->replay_window;
  203. if (!replay_esn->replay_window)
  204. return;
  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 < x->replay_maxdiff)) {
  253. if (x->xflags & XFRM_TIME_DEFER)
  254. event = XFRM_REPLAY_TIMEOUT;
  255. else
  256. return;
  257. }
  258. break;
  259. case XFRM_REPLAY_TIMEOUT:
  260. if (memcmp(x->replay_esn, x->preplay_esn,
  261. xfrm_replay_state_esn_len(replay_esn)) == 0) {
  262. x->xflags |= XFRM_TIME_DEFER;
  263. return;
  264. }
  265. break;
  266. }
  267. memcpy(x->preplay_esn, x->replay_esn,
  268. xfrm_replay_state_esn_len(replay_esn));
  269. c.event = XFRM_MSG_NEWAE;
  270. c.data.aevent = event;
  271. km_state_notify(x, &c);
  272. if (x->replay_maxage &&
  273. !mod_timer(&x->rtimer, jiffies + x->replay_maxage))
  274. x->xflags &= ~XFRM_TIME_DEFER;
  275. }
  276. static int xfrm_replay_overflow_esn(struct xfrm_state *x, struct sk_buff *skb)
  277. {
  278. int err = 0;
  279. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  280. struct net *net = xs_net(x);
  281. if (x->type->flags & XFRM_TYPE_REPLAY_PROT) {
  282. XFRM_SKB_CB(skb)->seq.output.low = ++replay_esn->oseq;
  283. XFRM_SKB_CB(skb)->seq.output.hi = replay_esn->oseq_hi;
  284. if (unlikely(replay_esn->oseq == 0)) {
  285. XFRM_SKB_CB(skb)->seq.output.hi = ++replay_esn->oseq_hi;
  286. if (replay_esn->oseq_hi == 0) {
  287. replay_esn->oseq--;
  288. replay_esn->oseq_hi--;
  289. xfrm_audit_state_replay_overflow(x, skb);
  290. err = -EOVERFLOW;
  291. return err;
  292. }
  293. }
  294. if (xfrm_aevent_is_on(net))
  295. x->repl->notify(x, XFRM_REPLAY_UPDATE);
  296. }
  297. return err;
  298. }
  299. static int xfrm_replay_check_esn(struct xfrm_state *x,
  300. struct sk_buff *skb, __be32 net_seq)
  301. {
  302. unsigned int bitnr, nr;
  303. u32 diff;
  304. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  305. u32 pos;
  306. u32 seq = ntohl(net_seq);
  307. u32 wsize = replay_esn->replay_window;
  308. u32 top = replay_esn->seq;
  309. u32 bottom = top - wsize + 1;
  310. if (!wsize)
  311. return 0;
  312. if (unlikely(seq == 0 && replay_esn->seq_hi == 0 &&
  313. (replay_esn->seq < replay_esn->replay_window - 1)))
  314. goto err;
  315. diff = top - seq;
  316. if (likely(top >= wsize - 1)) {
  317. /* A. same subspace */
  318. if (likely(seq > top) || seq < bottom)
  319. return 0;
  320. } else {
  321. /* B. window spans two subspaces */
  322. if (likely(seq > top && seq < bottom))
  323. return 0;
  324. if (seq >= bottom)
  325. diff = ~seq + top + 1;
  326. }
  327. if (diff >= replay_esn->replay_window) {
  328. x->stats.replay_window++;
  329. goto err;
  330. }
  331. pos = (replay_esn->seq - 1) % replay_esn->replay_window;
  332. if (pos >= diff)
  333. bitnr = (pos - diff) % replay_esn->replay_window;
  334. else
  335. bitnr = replay_esn->replay_window - (diff - pos);
  336. nr = bitnr >> 5;
  337. bitnr = bitnr & 0x1F;
  338. if (replay_esn->bmp[nr] & (1U << bitnr))
  339. goto err_replay;
  340. return 0;
  341. err_replay:
  342. x->stats.replay++;
  343. err:
  344. xfrm_audit_state_replay(x, skb, net_seq);
  345. return -EINVAL;
  346. }
  347. static int xfrm_replay_recheck_esn(struct xfrm_state *x,
  348. struct sk_buff *skb, __be32 net_seq)
  349. {
  350. if (unlikely(XFRM_SKB_CB(skb)->seq.input.hi !=
  351. htonl(xfrm_replay_seqhi(x, net_seq)))) {
  352. x->stats.replay_window++;
  353. return -EINVAL;
  354. }
  355. return xfrm_replay_check_esn(x, skb, net_seq);
  356. }
  357. static void xfrm_replay_advance_esn(struct xfrm_state *x, __be32 net_seq)
  358. {
  359. unsigned int bitnr, nr, i;
  360. int wrap;
  361. u32 diff, pos, seq, seq_hi;
  362. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  363. if (!replay_esn->replay_window)
  364. return;
  365. seq = ntohl(net_seq);
  366. pos = (replay_esn->seq - 1) % replay_esn->replay_window;
  367. seq_hi = xfrm_replay_seqhi(x, net_seq);
  368. wrap = seq_hi - replay_esn->seq_hi;
  369. if ((!wrap && seq > replay_esn->seq) || wrap > 0) {
  370. if (likely(!wrap))
  371. diff = seq - replay_esn->seq;
  372. else
  373. diff = ~replay_esn->seq + seq + 1;
  374. if (diff < replay_esn->replay_window) {
  375. for (i = 1; i < diff; i++) {
  376. bitnr = (pos + i) % replay_esn->replay_window;
  377. nr = bitnr >> 5;
  378. bitnr = bitnr & 0x1F;
  379. replay_esn->bmp[nr] &= ~(1U << bitnr);
  380. }
  381. } else {
  382. nr = (replay_esn->replay_window - 1) >> 5;
  383. for (i = 0; i <= nr; i++)
  384. replay_esn->bmp[i] = 0;
  385. }
  386. bitnr = (pos + diff) % replay_esn->replay_window;
  387. replay_esn->seq = seq;
  388. if (unlikely(wrap > 0))
  389. replay_esn->seq_hi++;
  390. } else {
  391. diff = replay_esn->seq - seq;
  392. if (pos >= diff)
  393. bitnr = (pos - diff) % replay_esn->replay_window;
  394. else
  395. bitnr = replay_esn->replay_window - (diff - pos);
  396. }
  397. nr = bitnr >> 5;
  398. bitnr = bitnr & 0x1F;
  399. replay_esn->bmp[nr] |= (1U << bitnr);
  400. if (xfrm_aevent_is_on(xs_net(x)))
  401. x->repl->notify(x, XFRM_REPLAY_UPDATE);
  402. }
  403. static struct xfrm_replay xfrm_replay_legacy = {
  404. .advance = xfrm_replay_advance,
  405. .check = xfrm_replay_check,
  406. .recheck = xfrm_replay_check,
  407. .notify = xfrm_replay_notify,
  408. .overflow = xfrm_replay_overflow,
  409. };
  410. static struct xfrm_replay xfrm_replay_bmp = {
  411. .advance = xfrm_replay_advance_bmp,
  412. .check = xfrm_replay_check_bmp,
  413. .recheck = xfrm_replay_check_bmp,
  414. .notify = xfrm_replay_notify_bmp,
  415. .overflow = xfrm_replay_overflow_bmp,
  416. };
  417. static struct xfrm_replay xfrm_replay_esn = {
  418. .advance = xfrm_replay_advance_esn,
  419. .check = xfrm_replay_check_esn,
  420. .recheck = xfrm_replay_recheck_esn,
  421. .notify = xfrm_replay_notify_bmp,
  422. .overflow = xfrm_replay_overflow_esn,
  423. };
  424. int xfrm_init_replay(struct xfrm_state *x)
  425. {
  426. struct xfrm_replay_state_esn *replay_esn = x->replay_esn;
  427. if (replay_esn) {
  428. if (replay_esn->replay_window >
  429. replay_esn->bmp_len * sizeof(__u32) * 8)
  430. return -EINVAL;
  431. if ((x->props.flags & XFRM_STATE_ESN) && replay_esn->replay_window == 0)
  432. return -EINVAL;
  433. if ((x->props.flags & XFRM_STATE_ESN) && x->replay_esn)
  434. x->repl = &xfrm_replay_esn;
  435. else
  436. x->repl = &xfrm_replay_bmp;
  437. } else
  438. x->repl = &xfrm_replay_legacy;
  439. return 0;
  440. }
  441. EXPORT_SYMBOL(xfrm_init_replay);