xfrm_state.c 59 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476
  1. /*
  2. * xfrm_state.c
  3. *
  4. * Changes:
  5. * Mitsuru KANDA @USAGI
  6. * Kazunori MIYAZAWA @USAGI
  7. * Kunihiro Ishiguro <kunihiro@ipinfusion.com>
  8. * IPv6 support
  9. * YOSHIFUJI Hideaki @USAGI
  10. * Split up af-specific functions
  11. * Derek Atkins <derek@ihtfp.com>
  12. * Add UDP Encapsulation
  13. *
  14. */
  15. #include <linux/workqueue.h>
  16. #include <net/xfrm.h>
  17. #include <linux/pfkeyv2.h>
  18. #include <linux/ipsec.h>
  19. #include <linux/module.h>
  20. #include <linux/cache.h>
  21. #include <linux/audit.h>
  22. #include <linux/uaccess.h>
  23. #include <linux/ktime.h>
  24. #include <linux/slab.h>
  25. #include <linux/interrupt.h>
  26. #include <linux/kernel.h>
  27. #include "xfrm_hash.h"
  28. #define xfrm_state_deref_prot(table, net) \
  29. rcu_dereference_protected((table), lockdep_is_held(&(net)->xfrm.xfrm_state_lock))
  30. static void xfrm_state_gc_task(struct work_struct *work);
  31. /* Each xfrm_state may be linked to two tables:
  32. 1. Hash table by (spi,daddr,ah/esp) to find SA by SPI. (input,ctl)
  33. 2. Hash table by (daddr,family,reqid) to find what SAs exist for given
  34. destination/tunnel endpoint. (output)
  35. */
  36. static unsigned int xfrm_state_hashmax __read_mostly = 1 * 1024 * 1024;
  37. static __read_mostly seqcount_t xfrm_state_hash_generation = SEQCNT_ZERO(xfrm_state_hash_generation);
  38. static DECLARE_WORK(xfrm_state_gc_work, xfrm_state_gc_task);
  39. static HLIST_HEAD(xfrm_state_gc_list);
  40. static inline bool xfrm_state_hold_rcu(struct xfrm_state __rcu *x)
  41. {
  42. return refcount_inc_not_zero(&x->refcnt);
  43. }
  44. static inline unsigned int xfrm_dst_hash(struct net *net,
  45. const xfrm_address_t *daddr,
  46. const xfrm_address_t *saddr,
  47. u32 reqid,
  48. unsigned short family)
  49. {
  50. return __xfrm_dst_hash(daddr, saddr, reqid, family, net->xfrm.state_hmask);
  51. }
  52. static inline unsigned int xfrm_src_hash(struct net *net,
  53. const xfrm_address_t *daddr,
  54. const xfrm_address_t *saddr,
  55. unsigned short family)
  56. {
  57. return __xfrm_src_hash(daddr, saddr, family, net->xfrm.state_hmask);
  58. }
  59. static inline unsigned int
  60. xfrm_spi_hash(struct net *net, const xfrm_address_t *daddr,
  61. __be32 spi, u8 proto, unsigned short family)
  62. {
  63. return __xfrm_spi_hash(daddr, spi, proto, family, net->xfrm.state_hmask);
  64. }
  65. static void xfrm_hash_transfer(struct hlist_head *list,
  66. struct hlist_head *ndsttable,
  67. struct hlist_head *nsrctable,
  68. struct hlist_head *nspitable,
  69. unsigned int nhashmask)
  70. {
  71. struct hlist_node *tmp;
  72. struct xfrm_state *x;
  73. hlist_for_each_entry_safe(x, tmp, list, bydst) {
  74. unsigned int h;
  75. h = __xfrm_dst_hash(&x->id.daddr, &x->props.saddr,
  76. x->props.reqid, x->props.family,
  77. nhashmask);
  78. hlist_add_head_rcu(&x->bydst, ndsttable + h);
  79. h = __xfrm_src_hash(&x->id.daddr, &x->props.saddr,
  80. x->props.family,
  81. nhashmask);
  82. hlist_add_head_rcu(&x->bysrc, nsrctable + h);
  83. if (x->id.spi) {
  84. h = __xfrm_spi_hash(&x->id.daddr, x->id.spi,
  85. x->id.proto, x->props.family,
  86. nhashmask);
  87. hlist_add_head_rcu(&x->byspi, nspitable + h);
  88. }
  89. }
  90. }
  91. static unsigned long xfrm_hash_new_size(unsigned int state_hmask)
  92. {
  93. return ((state_hmask + 1) << 1) * sizeof(struct hlist_head);
  94. }
  95. static void xfrm_hash_resize(struct work_struct *work)
  96. {
  97. struct net *net = container_of(work, struct net, xfrm.state_hash_work);
  98. struct hlist_head *ndst, *nsrc, *nspi, *odst, *osrc, *ospi;
  99. unsigned long nsize, osize;
  100. unsigned int nhashmask, ohashmask;
  101. int i;
  102. nsize = xfrm_hash_new_size(net->xfrm.state_hmask);
  103. ndst = xfrm_hash_alloc(nsize);
  104. if (!ndst)
  105. return;
  106. nsrc = xfrm_hash_alloc(nsize);
  107. if (!nsrc) {
  108. xfrm_hash_free(ndst, nsize);
  109. return;
  110. }
  111. nspi = xfrm_hash_alloc(nsize);
  112. if (!nspi) {
  113. xfrm_hash_free(ndst, nsize);
  114. xfrm_hash_free(nsrc, nsize);
  115. return;
  116. }
  117. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  118. write_seqcount_begin(&xfrm_state_hash_generation);
  119. nhashmask = (nsize / sizeof(struct hlist_head)) - 1U;
  120. odst = xfrm_state_deref_prot(net->xfrm.state_bydst, net);
  121. for (i = net->xfrm.state_hmask; i >= 0; i--)
  122. xfrm_hash_transfer(odst + i, ndst, nsrc, nspi, nhashmask);
  123. osrc = xfrm_state_deref_prot(net->xfrm.state_bysrc, net);
  124. ospi = xfrm_state_deref_prot(net->xfrm.state_byspi, net);
  125. ohashmask = net->xfrm.state_hmask;
  126. rcu_assign_pointer(net->xfrm.state_bydst, ndst);
  127. rcu_assign_pointer(net->xfrm.state_bysrc, nsrc);
  128. rcu_assign_pointer(net->xfrm.state_byspi, nspi);
  129. net->xfrm.state_hmask = nhashmask;
  130. write_seqcount_end(&xfrm_state_hash_generation);
  131. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  132. osize = (ohashmask + 1) * sizeof(struct hlist_head);
  133. synchronize_rcu();
  134. xfrm_hash_free(odst, osize);
  135. xfrm_hash_free(osrc, osize);
  136. xfrm_hash_free(ospi, osize);
  137. }
  138. static DEFINE_SPINLOCK(xfrm_state_afinfo_lock);
  139. static struct xfrm_state_afinfo __rcu *xfrm_state_afinfo[NPROTO];
  140. static DEFINE_SPINLOCK(xfrm_state_gc_lock);
  141. int __xfrm_state_delete(struct xfrm_state *x);
  142. int km_query(struct xfrm_state *x, struct xfrm_tmpl *t, struct xfrm_policy *pol);
  143. bool km_is_alive(const struct km_event *c);
  144. void km_state_expired(struct xfrm_state *x, int hard, u32 portid);
  145. static DEFINE_SPINLOCK(xfrm_type_lock);
  146. int xfrm_register_type(const struct xfrm_type *type, unsigned short family)
  147. {
  148. struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
  149. const struct xfrm_type **typemap;
  150. int err = 0;
  151. if (unlikely(afinfo == NULL))
  152. return -EAFNOSUPPORT;
  153. typemap = afinfo->type_map;
  154. spin_lock_bh(&xfrm_type_lock);
  155. if (likely(typemap[type->proto] == NULL))
  156. typemap[type->proto] = type;
  157. else
  158. err = -EEXIST;
  159. spin_unlock_bh(&xfrm_type_lock);
  160. rcu_read_unlock();
  161. return err;
  162. }
  163. EXPORT_SYMBOL(xfrm_register_type);
  164. int xfrm_unregister_type(const struct xfrm_type *type, unsigned short family)
  165. {
  166. struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
  167. const struct xfrm_type **typemap;
  168. int err = 0;
  169. if (unlikely(afinfo == NULL))
  170. return -EAFNOSUPPORT;
  171. typemap = afinfo->type_map;
  172. spin_lock_bh(&xfrm_type_lock);
  173. if (unlikely(typemap[type->proto] != type))
  174. err = -ENOENT;
  175. else
  176. typemap[type->proto] = NULL;
  177. spin_unlock_bh(&xfrm_type_lock);
  178. rcu_read_unlock();
  179. return err;
  180. }
  181. EXPORT_SYMBOL(xfrm_unregister_type);
  182. static const struct xfrm_type *xfrm_get_type(u8 proto, unsigned short family)
  183. {
  184. struct xfrm_state_afinfo *afinfo;
  185. const struct xfrm_type **typemap;
  186. const struct xfrm_type *type;
  187. int modload_attempted = 0;
  188. retry:
  189. afinfo = xfrm_state_get_afinfo(family);
  190. if (unlikely(afinfo == NULL))
  191. return NULL;
  192. typemap = afinfo->type_map;
  193. type = READ_ONCE(typemap[proto]);
  194. if (unlikely(type && !try_module_get(type->owner)))
  195. type = NULL;
  196. rcu_read_unlock();
  197. if (!type && !modload_attempted) {
  198. request_module("xfrm-type-%d-%d", family, proto);
  199. modload_attempted = 1;
  200. goto retry;
  201. }
  202. return type;
  203. }
  204. static void xfrm_put_type(const struct xfrm_type *type)
  205. {
  206. module_put(type->owner);
  207. }
  208. static DEFINE_SPINLOCK(xfrm_type_offload_lock);
  209. int xfrm_register_type_offload(const struct xfrm_type_offload *type,
  210. unsigned short family)
  211. {
  212. struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
  213. const struct xfrm_type_offload **typemap;
  214. int err = 0;
  215. if (unlikely(afinfo == NULL))
  216. return -EAFNOSUPPORT;
  217. typemap = afinfo->type_offload_map;
  218. spin_lock_bh(&xfrm_type_offload_lock);
  219. if (likely(typemap[type->proto] == NULL))
  220. typemap[type->proto] = type;
  221. else
  222. err = -EEXIST;
  223. spin_unlock_bh(&xfrm_type_offload_lock);
  224. rcu_read_unlock();
  225. return err;
  226. }
  227. EXPORT_SYMBOL(xfrm_register_type_offload);
  228. int xfrm_unregister_type_offload(const struct xfrm_type_offload *type,
  229. unsigned short family)
  230. {
  231. struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
  232. const struct xfrm_type_offload **typemap;
  233. int err = 0;
  234. if (unlikely(afinfo == NULL))
  235. return -EAFNOSUPPORT;
  236. typemap = afinfo->type_offload_map;
  237. spin_lock_bh(&xfrm_type_offload_lock);
  238. if (unlikely(typemap[type->proto] != type))
  239. err = -ENOENT;
  240. else
  241. typemap[type->proto] = NULL;
  242. spin_unlock_bh(&xfrm_type_offload_lock);
  243. rcu_read_unlock();
  244. return err;
  245. }
  246. EXPORT_SYMBOL(xfrm_unregister_type_offload);
  247. static const struct xfrm_type_offload *xfrm_get_type_offload(u8 proto, unsigned short family)
  248. {
  249. struct xfrm_state_afinfo *afinfo;
  250. const struct xfrm_type_offload **typemap;
  251. const struct xfrm_type_offload *type;
  252. afinfo = xfrm_state_get_afinfo(family);
  253. if (unlikely(afinfo == NULL))
  254. return NULL;
  255. typemap = afinfo->type_offload_map;
  256. type = typemap[proto];
  257. if ((type && !try_module_get(type->owner)))
  258. type = NULL;
  259. rcu_read_unlock();
  260. return type;
  261. }
  262. static void xfrm_put_type_offload(const struct xfrm_type_offload *type)
  263. {
  264. module_put(type->owner);
  265. }
  266. static DEFINE_SPINLOCK(xfrm_mode_lock);
  267. int xfrm_register_mode(struct xfrm_mode *mode, int family)
  268. {
  269. struct xfrm_state_afinfo *afinfo;
  270. struct xfrm_mode **modemap;
  271. int err;
  272. if (unlikely(mode->encap >= XFRM_MODE_MAX))
  273. return -EINVAL;
  274. afinfo = xfrm_state_get_afinfo(family);
  275. if (unlikely(afinfo == NULL))
  276. return -EAFNOSUPPORT;
  277. err = -EEXIST;
  278. modemap = afinfo->mode_map;
  279. spin_lock_bh(&xfrm_mode_lock);
  280. if (modemap[mode->encap])
  281. goto out;
  282. err = -ENOENT;
  283. if (!try_module_get(afinfo->owner))
  284. goto out;
  285. mode->afinfo = afinfo;
  286. modemap[mode->encap] = mode;
  287. err = 0;
  288. out:
  289. spin_unlock_bh(&xfrm_mode_lock);
  290. rcu_read_unlock();
  291. return err;
  292. }
  293. EXPORT_SYMBOL(xfrm_register_mode);
  294. int xfrm_unregister_mode(struct xfrm_mode *mode, int family)
  295. {
  296. struct xfrm_state_afinfo *afinfo;
  297. struct xfrm_mode **modemap;
  298. int err;
  299. if (unlikely(mode->encap >= XFRM_MODE_MAX))
  300. return -EINVAL;
  301. afinfo = xfrm_state_get_afinfo(family);
  302. if (unlikely(afinfo == NULL))
  303. return -EAFNOSUPPORT;
  304. err = -ENOENT;
  305. modemap = afinfo->mode_map;
  306. spin_lock_bh(&xfrm_mode_lock);
  307. if (likely(modemap[mode->encap] == mode)) {
  308. modemap[mode->encap] = NULL;
  309. module_put(mode->afinfo->owner);
  310. err = 0;
  311. }
  312. spin_unlock_bh(&xfrm_mode_lock);
  313. rcu_read_unlock();
  314. return err;
  315. }
  316. EXPORT_SYMBOL(xfrm_unregister_mode);
  317. static struct xfrm_mode *xfrm_get_mode(unsigned int encap, int family)
  318. {
  319. struct xfrm_state_afinfo *afinfo;
  320. struct xfrm_mode *mode;
  321. int modload_attempted = 0;
  322. if (unlikely(encap >= XFRM_MODE_MAX))
  323. return NULL;
  324. retry:
  325. afinfo = xfrm_state_get_afinfo(family);
  326. if (unlikely(afinfo == NULL))
  327. return NULL;
  328. mode = READ_ONCE(afinfo->mode_map[encap]);
  329. if (unlikely(mode && !try_module_get(mode->owner)))
  330. mode = NULL;
  331. rcu_read_unlock();
  332. if (!mode && !modload_attempted) {
  333. request_module("xfrm-mode-%d-%d", family, encap);
  334. modload_attempted = 1;
  335. goto retry;
  336. }
  337. return mode;
  338. }
  339. static void xfrm_put_mode(struct xfrm_mode *mode)
  340. {
  341. module_put(mode->owner);
  342. }
  343. static void xfrm_state_gc_destroy(struct xfrm_state *x)
  344. {
  345. tasklet_hrtimer_cancel(&x->mtimer);
  346. del_timer_sync(&x->rtimer);
  347. kfree(x->aead);
  348. kfree(x->aalg);
  349. kfree(x->ealg);
  350. kfree(x->calg);
  351. kfree(x->encap);
  352. kfree(x->coaddr);
  353. kfree(x->replay_esn);
  354. kfree(x->preplay_esn);
  355. if (x->inner_mode)
  356. xfrm_put_mode(x->inner_mode);
  357. if (x->inner_mode_iaf)
  358. xfrm_put_mode(x->inner_mode_iaf);
  359. if (x->outer_mode)
  360. xfrm_put_mode(x->outer_mode);
  361. if (x->type_offload)
  362. xfrm_put_type_offload(x->type_offload);
  363. if (x->type) {
  364. x->type->destructor(x);
  365. xfrm_put_type(x->type);
  366. }
  367. xfrm_dev_state_free(x);
  368. security_xfrm_state_free(x);
  369. kfree(x);
  370. }
  371. static void xfrm_state_gc_task(struct work_struct *work)
  372. {
  373. struct xfrm_state *x;
  374. struct hlist_node *tmp;
  375. struct hlist_head gc_list;
  376. spin_lock_bh(&xfrm_state_gc_lock);
  377. hlist_move_list(&xfrm_state_gc_list, &gc_list);
  378. spin_unlock_bh(&xfrm_state_gc_lock);
  379. synchronize_rcu();
  380. hlist_for_each_entry_safe(x, tmp, &gc_list, gclist)
  381. xfrm_state_gc_destroy(x);
  382. }
  383. static enum hrtimer_restart xfrm_timer_handler(struct hrtimer *me)
  384. {
  385. struct tasklet_hrtimer *thr = container_of(me, struct tasklet_hrtimer, timer);
  386. struct xfrm_state *x = container_of(thr, struct xfrm_state, mtimer);
  387. unsigned long now = get_seconds();
  388. long next = LONG_MAX;
  389. int warn = 0;
  390. int err = 0;
  391. spin_lock(&x->lock);
  392. if (x->km.state == XFRM_STATE_DEAD)
  393. goto out;
  394. if (x->km.state == XFRM_STATE_EXPIRED)
  395. goto expired;
  396. if (x->lft.hard_add_expires_seconds) {
  397. long tmo = x->lft.hard_add_expires_seconds +
  398. x->curlft.add_time - now;
  399. if (tmo <= 0) {
  400. if (x->xflags & XFRM_SOFT_EXPIRE) {
  401. /* enter hard expire without soft expire first?!
  402. * setting a new date could trigger this.
  403. * workaround: fix x->curflt.add_time by below:
  404. */
  405. x->curlft.add_time = now - x->saved_tmo - 1;
  406. tmo = x->lft.hard_add_expires_seconds - x->saved_tmo;
  407. } else
  408. goto expired;
  409. }
  410. if (tmo < next)
  411. next = tmo;
  412. }
  413. if (x->lft.hard_use_expires_seconds) {
  414. long tmo = x->lft.hard_use_expires_seconds +
  415. (x->curlft.use_time ? : now) - now;
  416. if (tmo <= 0)
  417. goto expired;
  418. if (tmo < next)
  419. next = tmo;
  420. }
  421. if (x->km.dying)
  422. goto resched;
  423. if (x->lft.soft_add_expires_seconds) {
  424. long tmo = x->lft.soft_add_expires_seconds +
  425. x->curlft.add_time - now;
  426. if (tmo <= 0) {
  427. warn = 1;
  428. x->xflags &= ~XFRM_SOFT_EXPIRE;
  429. } else if (tmo < next) {
  430. next = tmo;
  431. x->xflags |= XFRM_SOFT_EXPIRE;
  432. x->saved_tmo = tmo;
  433. }
  434. }
  435. if (x->lft.soft_use_expires_seconds) {
  436. long tmo = x->lft.soft_use_expires_seconds +
  437. (x->curlft.use_time ? : now) - now;
  438. if (tmo <= 0)
  439. warn = 1;
  440. else if (tmo < next)
  441. next = tmo;
  442. }
  443. x->km.dying = warn;
  444. if (warn)
  445. km_state_expired(x, 0, 0);
  446. resched:
  447. if (next != LONG_MAX) {
  448. tasklet_hrtimer_start(&x->mtimer, ktime_set(next, 0), HRTIMER_MODE_REL);
  449. }
  450. goto out;
  451. expired:
  452. if (x->km.state == XFRM_STATE_ACQ && x->id.spi == 0)
  453. x->km.state = XFRM_STATE_EXPIRED;
  454. err = __xfrm_state_delete(x);
  455. if (!err)
  456. km_state_expired(x, 1, 0);
  457. xfrm_audit_state_delete(x, err ? 0 : 1, true);
  458. out:
  459. spin_unlock(&x->lock);
  460. return HRTIMER_NORESTART;
  461. }
  462. static void xfrm_replay_timer_handler(unsigned long data);
  463. struct xfrm_state *xfrm_state_alloc(struct net *net)
  464. {
  465. struct xfrm_state *x;
  466. x = kzalloc(sizeof(struct xfrm_state), GFP_ATOMIC);
  467. if (x) {
  468. write_pnet(&x->xs_net, net);
  469. refcount_set(&x->refcnt, 1);
  470. atomic_set(&x->tunnel_users, 0);
  471. INIT_LIST_HEAD(&x->km.all);
  472. INIT_HLIST_NODE(&x->bydst);
  473. INIT_HLIST_NODE(&x->bysrc);
  474. INIT_HLIST_NODE(&x->byspi);
  475. tasklet_hrtimer_init(&x->mtimer, xfrm_timer_handler,
  476. CLOCK_BOOTTIME, HRTIMER_MODE_ABS);
  477. setup_timer(&x->rtimer, xfrm_replay_timer_handler,
  478. (unsigned long)x);
  479. x->curlft.add_time = get_seconds();
  480. x->lft.soft_byte_limit = XFRM_INF;
  481. x->lft.soft_packet_limit = XFRM_INF;
  482. x->lft.hard_byte_limit = XFRM_INF;
  483. x->lft.hard_packet_limit = XFRM_INF;
  484. x->replay_maxage = 0;
  485. x->replay_maxdiff = 0;
  486. x->inner_mode = NULL;
  487. x->inner_mode_iaf = NULL;
  488. spin_lock_init(&x->lock);
  489. }
  490. return x;
  491. }
  492. EXPORT_SYMBOL(xfrm_state_alloc);
  493. void __xfrm_state_destroy(struct xfrm_state *x)
  494. {
  495. WARN_ON(x->km.state != XFRM_STATE_DEAD);
  496. spin_lock_bh(&xfrm_state_gc_lock);
  497. hlist_add_head(&x->gclist, &xfrm_state_gc_list);
  498. spin_unlock_bh(&xfrm_state_gc_lock);
  499. schedule_work(&xfrm_state_gc_work);
  500. }
  501. EXPORT_SYMBOL(__xfrm_state_destroy);
  502. int __xfrm_state_delete(struct xfrm_state *x)
  503. {
  504. struct net *net = xs_net(x);
  505. int err = -ESRCH;
  506. if (x->km.state != XFRM_STATE_DEAD) {
  507. x->km.state = XFRM_STATE_DEAD;
  508. spin_lock(&net->xfrm.xfrm_state_lock);
  509. list_del(&x->km.all);
  510. hlist_del_rcu(&x->bydst);
  511. hlist_del_rcu(&x->bysrc);
  512. if (x->id.spi)
  513. hlist_del_rcu(&x->byspi);
  514. net->xfrm.state_num--;
  515. spin_unlock(&net->xfrm.xfrm_state_lock);
  516. xfrm_dev_state_delete(x);
  517. /* All xfrm_state objects are created by xfrm_state_alloc.
  518. * The xfrm_state_alloc call gives a reference, and that
  519. * is what we are dropping here.
  520. */
  521. xfrm_state_put(x);
  522. err = 0;
  523. }
  524. return err;
  525. }
  526. EXPORT_SYMBOL(__xfrm_state_delete);
  527. int xfrm_state_delete(struct xfrm_state *x)
  528. {
  529. int err;
  530. spin_lock_bh(&x->lock);
  531. err = __xfrm_state_delete(x);
  532. spin_unlock_bh(&x->lock);
  533. return err;
  534. }
  535. EXPORT_SYMBOL(xfrm_state_delete);
  536. #ifdef CONFIG_SECURITY_NETWORK_XFRM
  537. static inline int
  538. xfrm_state_flush_secctx_check(struct net *net, u8 proto, bool task_valid)
  539. {
  540. int i, err = 0;
  541. for (i = 0; i <= net->xfrm.state_hmask; i++) {
  542. struct xfrm_state *x;
  543. hlist_for_each_entry(x, net->xfrm.state_bydst+i, bydst) {
  544. if (xfrm_id_proto_match(x->id.proto, proto) &&
  545. (err = security_xfrm_state_delete(x)) != 0) {
  546. xfrm_audit_state_delete(x, 0, task_valid);
  547. return err;
  548. }
  549. }
  550. }
  551. return err;
  552. }
  553. static inline int
  554. xfrm_dev_state_flush_secctx_check(struct net *net, struct net_device *dev, bool task_valid)
  555. {
  556. int i, err = 0;
  557. for (i = 0; i <= net->xfrm.state_hmask; i++) {
  558. struct xfrm_state *x;
  559. struct xfrm_state_offload *xso;
  560. hlist_for_each_entry(x, net->xfrm.state_bydst+i, bydst) {
  561. xso = &x->xso;
  562. if (xso->dev == dev &&
  563. (err = security_xfrm_state_delete(x)) != 0) {
  564. xfrm_audit_state_delete(x, 0, task_valid);
  565. return err;
  566. }
  567. }
  568. }
  569. return err;
  570. }
  571. #else
  572. static inline int
  573. xfrm_state_flush_secctx_check(struct net *net, u8 proto, bool task_valid)
  574. {
  575. return 0;
  576. }
  577. static inline int
  578. xfrm_dev_state_flush_secctx_check(struct net *net, struct net_device *dev, bool task_valid)
  579. {
  580. return 0;
  581. }
  582. #endif
  583. int xfrm_state_flush(struct net *net, u8 proto, bool task_valid)
  584. {
  585. int i, err = 0, cnt = 0;
  586. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  587. err = xfrm_state_flush_secctx_check(net, proto, task_valid);
  588. if (err)
  589. goto out;
  590. err = -ESRCH;
  591. for (i = 0; i <= net->xfrm.state_hmask; i++) {
  592. struct xfrm_state *x;
  593. restart:
  594. hlist_for_each_entry(x, net->xfrm.state_bydst+i, bydst) {
  595. if (!xfrm_state_kern(x) &&
  596. xfrm_id_proto_match(x->id.proto, proto)) {
  597. xfrm_state_hold(x);
  598. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  599. err = xfrm_state_delete(x);
  600. xfrm_audit_state_delete(x, err ? 0 : 1,
  601. task_valid);
  602. xfrm_state_put(x);
  603. if (!err)
  604. cnt++;
  605. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  606. goto restart;
  607. }
  608. }
  609. }
  610. if (cnt)
  611. err = 0;
  612. out:
  613. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  614. return err;
  615. }
  616. EXPORT_SYMBOL(xfrm_state_flush);
  617. int xfrm_dev_state_flush(struct net *net, struct net_device *dev, bool task_valid)
  618. {
  619. int i, err = 0, cnt = 0;
  620. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  621. err = xfrm_dev_state_flush_secctx_check(net, dev, task_valid);
  622. if (err)
  623. goto out;
  624. err = -ESRCH;
  625. for (i = 0; i <= net->xfrm.state_hmask; i++) {
  626. struct xfrm_state *x;
  627. struct xfrm_state_offload *xso;
  628. restart:
  629. hlist_for_each_entry(x, net->xfrm.state_bydst+i, bydst) {
  630. xso = &x->xso;
  631. if (!xfrm_state_kern(x) && xso->dev == dev) {
  632. xfrm_state_hold(x);
  633. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  634. err = xfrm_state_delete(x);
  635. xfrm_audit_state_delete(x, err ? 0 : 1,
  636. task_valid);
  637. xfrm_state_put(x);
  638. if (!err)
  639. cnt++;
  640. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  641. goto restart;
  642. }
  643. }
  644. }
  645. if (cnt)
  646. err = 0;
  647. out:
  648. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  649. return err;
  650. }
  651. EXPORT_SYMBOL(xfrm_dev_state_flush);
  652. void xfrm_sad_getinfo(struct net *net, struct xfrmk_sadinfo *si)
  653. {
  654. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  655. si->sadcnt = net->xfrm.state_num;
  656. si->sadhcnt = net->xfrm.state_hmask;
  657. si->sadhmcnt = xfrm_state_hashmax;
  658. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  659. }
  660. EXPORT_SYMBOL(xfrm_sad_getinfo);
  661. static void
  662. xfrm_init_tempstate(struct xfrm_state *x, const struct flowi *fl,
  663. const struct xfrm_tmpl *tmpl,
  664. const xfrm_address_t *daddr, const xfrm_address_t *saddr,
  665. unsigned short family)
  666. {
  667. struct xfrm_state_afinfo *afinfo = xfrm_state_afinfo_get_rcu(family);
  668. if (!afinfo)
  669. return;
  670. afinfo->init_tempsel(&x->sel, fl);
  671. if (family != tmpl->encap_family) {
  672. afinfo = xfrm_state_afinfo_get_rcu(tmpl->encap_family);
  673. if (!afinfo)
  674. return;
  675. }
  676. afinfo->init_temprop(x, tmpl, daddr, saddr);
  677. }
  678. static struct xfrm_state *__xfrm_state_lookup(struct net *net, u32 mark,
  679. const xfrm_address_t *daddr,
  680. __be32 spi, u8 proto,
  681. unsigned short family)
  682. {
  683. unsigned int h = xfrm_spi_hash(net, daddr, spi, proto, family);
  684. struct xfrm_state *x;
  685. hlist_for_each_entry_rcu(x, net->xfrm.state_byspi + h, byspi) {
  686. if (x->props.family != family ||
  687. x->id.spi != spi ||
  688. x->id.proto != proto ||
  689. !xfrm_addr_equal(&x->id.daddr, daddr, family))
  690. continue;
  691. if ((mark & x->mark.m) != x->mark.v)
  692. continue;
  693. if (!xfrm_state_hold_rcu(x))
  694. continue;
  695. return x;
  696. }
  697. return NULL;
  698. }
  699. static struct xfrm_state *__xfrm_state_lookup_byaddr(struct net *net, u32 mark,
  700. const xfrm_address_t *daddr,
  701. const xfrm_address_t *saddr,
  702. u8 proto, unsigned short family)
  703. {
  704. unsigned int h = xfrm_src_hash(net, daddr, saddr, family);
  705. struct xfrm_state *x;
  706. hlist_for_each_entry_rcu(x, net->xfrm.state_bysrc + h, bysrc) {
  707. if (x->props.family != family ||
  708. x->id.proto != proto ||
  709. !xfrm_addr_equal(&x->id.daddr, daddr, family) ||
  710. !xfrm_addr_equal(&x->props.saddr, saddr, family))
  711. continue;
  712. if ((mark & x->mark.m) != x->mark.v)
  713. continue;
  714. if (!xfrm_state_hold_rcu(x))
  715. continue;
  716. return x;
  717. }
  718. return NULL;
  719. }
  720. static inline struct xfrm_state *
  721. __xfrm_state_locate(struct xfrm_state *x, int use_spi, int family)
  722. {
  723. struct net *net = xs_net(x);
  724. u32 mark = x->mark.v & x->mark.m;
  725. if (use_spi)
  726. return __xfrm_state_lookup(net, mark, &x->id.daddr,
  727. x->id.spi, x->id.proto, family);
  728. else
  729. return __xfrm_state_lookup_byaddr(net, mark,
  730. &x->id.daddr,
  731. &x->props.saddr,
  732. x->id.proto, family);
  733. }
  734. static void xfrm_hash_grow_check(struct net *net, int have_hash_collision)
  735. {
  736. if (have_hash_collision &&
  737. (net->xfrm.state_hmask + 1) < xfrm_state_hashmax &&
  738. net->xfrm.state_num > net->xfrm.state_hmask)
  739. schedule_work(&net->xfrm.state_hash_work);
  740. }
  741. static void xfrm_state_look_at(struct xfrm_policy *pol, struct xfrm_state *x,
  742. const struct flowi *fl, unsigned short family,
  743. struct xfrm_state **best, int *acq_in_progress,
  744. int *error)
  745. {
  746. /* Resolution logic:
  747. * 1. There is a valid state with matching selector. Done.
  748. * 2. Valid state with inappropriate selector. Skip.
  749. *
  750. * Entering area of "sysdeps".
  751. *
  752. * 3. If state is not valid, selector is temporary, it selects
  753. * only session which triggered previous resolution. Key
  754. * manager will do something to install a state with proper
  755. * selector.
  756. */
  757. if (x->km.state == XFRM_STATE_VALID) {
  758. if ((x->sel.family &&
  759. !xfrm_selector_match(&x->sel, fl, x->sel.family)) ||
  760. !security_xfrm_state_pol_flow_match(x, pol, fl))
  761. return;
  762. if (!*best ||
  763. (*best)->km.dying > x->km.dying ||
  764. ((*best)->km.dying == x->km.dying &&
  765. (*best)->curlft.add_time < x->curlft.add_time))
  766. *best = x;
  767. } else if (x->km.state == XFRM_STATE_ACQ) {
  768. *acq_in_progress = 1;
  769. } else if (x->km.state == XFRM_STATE_ERROR ||
  770. x->km.state == XFRM_STATE_EXPIRED) {
  771. if (xfrm_selector_match(&x->sel, fl, x->sel.family) &&
  772. security_xfrm_state_pol_flow_match(x, pol, fl))
  773. *error = -ESRCH;
  774. }
  775. }
  776. struct xfrm_state *
  777. xfrm_state_find(const xfrm_address_t *daddr, const xfrm_address_t *saddr,
  778. const struct flowi *fl, struct xfrm_tmpl *tmpl,
  779. struct xfrm_policy *pol, int *err,
  780. unsigned short family)
  781. {
  782. static xfrm_address_t saddr_wildcard = { };
  783. struct net *net = xp_net(pol);
  784. unsigned int h, h_wildcard;
  785. struct xfrm_state *x, *x0, *to_put;
  786. int acquire_in_progress = 0;
  787. int error = 0;
  788. struct xfrm_state *best = NULL;
  789. u32 mark = pol->mark.v & pol->mark.m;
  790. unsigned short encap_family = tmpl->encap_family;
  791. unsigned int sequence;
  792. struct km_event c;
  793. to_put = NULL;
  794. sequence = read_seqcount_begin(&xfrm_state_hash_generation);
  795. rcu_read_lock();
  796. h = xfrm_dst_hash(net, daddr, saddr, tmpl->reqid, encap_family);
  797. hlist_for_each_entry_rcu(x, net->xfrm.state_bydst + h, bydst) {
  798. if (x->props.family == encap_family &&
  799. x->props.reqid == tmpl->reqid &&
  800. (mark & x->mark.m) == x->mark.v &&
  801. !(x->props.flags & XFRM_STATE_WILDRECV) &&
  802. xfrm_state_addr_check(x, daddr, saddr, encap_family) &&
  803. tmpl->mode == x->props.mode &&
  804. tmpl->id.proto == x->id.proto &&
  805. (tmpl->id.spi == x->id.spi || !tmpl->id.spi))
  806. xfrm_state_look_at(pol, x, fl, encap_family,
  807. &best, &acquire_in_progress, &error);
  808. }
  809. if (best || acquire_in_progress)
  810. goto found;
  811. h_wildcard = xfrm_dst_hash(net, daddr, &saddr_wildcard, tmpl->reqid, encap_family);
  812. hlist_for_each_entry_rcu(x, net->xfrm.state_bydst + h_wildcard, bydst) {
  813. if (x->props.family == encap_family &&
  814. x->props.reqid == tmpl->reqid &&
  815. (mark & x->mark.m) == x->mark.v &&
  816. !(x->props.flags & XFRM_STATE_WILDRECV) &&
  817. xfrm_addr_equal(&x->id.daddr, daddr, encap_family) &&
  818. tmpl->mode == x->props.mode &&
  819. tmpl->id.proto == x->id.proto &&
  820. (tmpl->id.spi == x->id.spi || !tmpl->id.spi))
  821. xfrm_state_look_at(pol, x, fl, encap_family,
  822. &best, &acquire_in_progress, &error);
  823. }
  824. found:
  825. x = best;
  826. if (!x && !error && !acquire_in_progress) {
  827. if (tmpl->id.spi &&
  828. (x0 = __xfrm_state_lookup(net, mark, daddr, tmpl->id.spi,
  829. tmpl->id.proto, encap_family)) != NULL) {
  830. to_put = x0;
  831. error = -EEXIST;
  832. goto out;
  833. }
  834. c.net = net;
  835. /* If the KMs have no listeners (yet...), avoid allocating an SA
  836. * for each and every packet - garbage collection might not
  837. * handle the flood.
  838. */
  839. if (!km_is_alive(&c)) {
  840. error = -ESRCH;
  841. goto out;
  842. }
  843. x = xfrm_state_alloc(net);
  844. if (x == NULL) {
  845. error = -ENOMEM;
  846. goto out;
  847. }
  848. /* Initialize temporary state matching only
  849. * to current session. */
  850. xfrm_init_tempstate(x, fl, tmpl, daddr, saddr, family);
  851. memcpy(&x->mark, &pol->mark, sizeof(x->mark));
  852. error = security_xfrm_state_alloc_acquire(x, pol->security, fl->flowi_secid);
  853. if (error) {
  854. x->km.state = XFRM_STATE_DEAD;
  855. to_put = x;
  856. x = NULL;
  857. goto out;
  858. }
  859. if (km_query(x, tmpl, pol) == 0) {
  860. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  861. x->km.state = XFRM_STATE_ACQ;
  862. list_add(&x->km.all, &net->xfrm.state_all);
  863. hlist_add_head_rcu(&x->bydst, net->xfrm.state_bydst + h);
  864. h = xfrm_src_hash(net, daddr, saddr, encap_family);
  865. hlist_add_head_rcu(&x->bysrc, net->xfrm.state_bysrc + h);
  866. if (x->id.spi) {
  867. h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto, encap_family);
  868. hlist_add_head_rcu(&x->byspi, net->xfrm.state_byspi + h);
  869. }
  870. x->lft.hard_add_expires_seconds = net->xfrm.sysctl_acq_expires;
  871. tasklet_hrtimer_start(&x->mtimer, ktime_set(net->xfrm.sysctl_acq_expires, 0), HRTIMER_MODE_REL);
  872. net->xfrm.state_num++;
  873. xfrm_hash_grow_check(net, x->bydst.next != NULL);
  874. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  875. } else {
  876. x->km.state = XFRM_STATE_DEAD;
  877. to_put = x;
  878. x = NULL;
  879. error = -ESRCH;
  880. }
  881. }
  882. out:
  883. if (x) {
  884. if (!xfrm_state_hold_rcu(x)) {
  885. *err = -EAGAIN;
  886. x = NULL;
  887. }
  888. } else {
  889. *err = acquire_in_progress ? -EAGAIN : error;
  890. }
  891. rcu_read_unlock();
  892. if (to_put)
  893. xfrm_state_put(to_put);
  894. if (read_seqcount_retry(&xfrm_state_hash_generation, sequence)) {
  895. *err = -EAGAIN;
  896. if (x) {
  897. xfrm_state_put(x);
  898. x = NULL;
  899. }
  900. }
  901. return x;
  902. }
  903. struct xfrm_state *
  904. xfrm_stateonly_find(struct net *net, u32 mark,
  905. xfrm_address_t *daddr, xfrm_address_t *saddr,
  906. unsigned short family, u8 mode, u8 proto, u32 reqid)
  907. {
  908. unsigned int h;
  909. struct xfrm_state *rx = NULL, *x = NULL;
  910. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  911. h = xfrm_dst_hash(net, daddr, saddr, reqid, family);
  912. hlist_for_each_entry(x, net->xfrm.state_bydst+h, bydst) {
  913. if (x->props.family == family &&
  914. x->props.reqid == reqid &&
  915. (mark & x->mark.m) == x->mark.v &&
  916. !(x->props.flags & XFRM_STATE_WILDRECV) &&
  917. xfrm_state_addr_check(x, daddr, saddr, family) &&
  918. mode == x->props.mode &&
  919. proto == x->id.proto &&
  920. x->km.state == XFRM_STATE_VALID) {
  921. rx = x;
  922. break;
  923. }
  924. }
  925. if (rx)
  926. xfrm_state_hold(rx);
  927. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  928. return rx;
  929. }
  930. EXPORT_SYMBOL(xfrm_stateonly_find);
  931. struct xfrm_state *xfrm_state_lookup_byspi(struct net *net, __be32 spi,
  932. unsigned short family)
  933. {
  934. struct xfrm_state *x;
  935. struct xfrm_state_walk *w;
  936. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  937. list_for_each_entry(w, &net->xfrm.state_all, all) {
  938. x = container_of(w, struct xfrm_state, km);
  939. if (x->props.family != family ||
  940. x->id.spi != spi)
  941. continue;
  942. xfrm_state_hold(x);
  943. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  944. return x;
  945. }
  946. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  947. return NULL;
  948. }
  949. EXPORT_SYMBOL(xfrm_state_lookup_byspi);
  950. static void __xfrm_state_insert(struct xfrm_state *x)
  951. {
  952. struct net *net = xs_net(x);
  953. unsigned int h;
  954. list_add(&x->km.all, &net->xfrm.state_all);
  955. h = xfrm_dst_hash(net, &x->id.daddr, &x->props.saddr,
  956. x->props.reqid, x->props.family);
  957. hlist_add_head_rcu(&x->bydst, net->xfrm.state_bydst + h);
  958. h = xfrm_src_hash(net, &x->id.daddr, &x->props.saddr, x->props.family);
  959. hlist_add_head_rcu(&x->bysrc, net->xfrm.state_bysrc + h);
  960. if (x->id.spi) {
  961. h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto,
  962. x->props.family);
  963. hlist_add_head_rcu(&x->byspi, net->xfrm.state_byspi + h);
  964. }
  965. tasklet_hrtimer_start(&x->mtimer, ktime_set(1, 0), HRTIMER_MODE_REL);
  966. if (x->replay_maxage)
  967. mod_timer(&x->rtimer, jiffies + x->replay_maxage);
  968. net->xfrm.state_num++;
  969. xfrm_hash_grow_check(net, x->bydst.next != NULL);
  970. }
  971. /* net->xfrm.xfrm_state_lock is held */
  972. static void __xfrm_state_bump_genids(struct xfrm_state *xnew)
  973. {
  974. struct net *net = xs_net(xnew);
  975. unsigned short family = xnew->props.family;
  976. u32 reqid = xnew->props.reqid;
  977. struct xfrm_state *x;
  978. unsigned int h;
  979. u32 mark = xnew->mark.v & xnew->mark.m;
  980. h = xfrm_dst_hash(net, &xnew->id.daddr, &xnew->props.saddr, reqid, family);
  981. hlist_for_each_entry(x, net->xfrm.state_bydst+h, bydst) {
  982. if (x->props.family == family &&
  983. x->props.reqid == reqid &&
  984. (mark & x->mark.m) == x->mark.v &&
  985. xfrm_addr_equal(&x->id.daddr, &xnew->id.daddr, family) &&
  986. xfrm_addr_equal(&x->props.saddr, &xnew->props.saddr, family))
  987. x->genid++;
  988. }
  989. }
  990. void xfrm_state_insert(struct xfrm_state *x)
  991. {
  992. struct net *net = xs_net(x);
  993. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  994. __xfrm_state_bump_genids(x);
  995. __xfrm_state_insert(x);
  996. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  997. }
  998. EXPORT_SYMBOL(xfrm_state_insert);
  999. /* net->xfrm.xfrm_state_lock is held */
  1000. static struct xfrm_state *__find_acq_core(struct net *net,
  1001. const struct xfrm_mark *m,
  1002. unsigned short family, u8 mode,
  1003. u32 reqid, u8 proto,
  1004. const xfrm_address_t *daddr,
  1005. const xfrm_address_t *saddr,
  1006. int create)
  1007. {
  1008. unsigned int h = xfrm_dst_hash(net, daddr, saddr, reqid, family);
  1009. struct xfrm_state *x;
  1010. u32 mark = m->v & m->m;
  1011. hlist_for_each_entry(x, net->xfrm.state_bydst+h, bydst) {
  1012. if (x->props.reqid != reqid ||
  1013. x->props.mode != mode ||
  1014. x->props.family != family ||
  1015. x->km.state != XFRM_STATE_ACQ ||
  1016. x->id.spi != 0 ||
  1017. x->id.proto != proto ||
  1018. (mark & x->mark.m) != x->mark.v ||
  1019. !xfrm_addr_equal(&x->id.daddr, daddr, family) ||
  1020. !xfrm_addr_equal(&x->props.saddr, saddr, family))
  1021. continue;
  1022. xfrm_state_hold(x);
  1023. return x;
  1024. }
  1025. if (!create)
  1026. return NULL;
  1027. x = xfrm_state_alloc(net);
  1028. if (likely(x)) {
  1029. switch (family) {
  1030. case AF_INET:
  1031. x->sel.daddr.a4 = daddr->a4;
  1032. x->sel.saddr.a4 = saddr->a4;
  1033. x->sel.prefixlen_d = 32;
  1034. x->sel.prefixlen_s = 32;
  1035. x->props.saddr.a4 = saddr->a4;
  1036. x->id.daddr.a4 = daddr->a4;
  1037. break;
  1038. case AF_INET6:
  1039. x->sel.daddr.in6 = daddr->in6;
  1040. x->sel.saddr.in6 = saddr->in6;
  1041. x->sel.prefixlen_d = 128;
  1042. x->sel.prefixlen_s = 128;
  1043. x->props.saddr.in6 = saddr->in6;
  1044. x->id.daddr.in6 = daddr->in6;
  1045. break;
  1046. }
  1047. x->km.state = XFRM_STATE_ACQ;
  1048. x->id.proto = proto;
  1049. x->props.family = family;
  1050. x->props.mode = mode;
  1051. x->props.reqid = reqid;
  1052. x->mark.v = m->v;
  1053. x->mark.m = m->m;
  1054. x->lft.hard_add_expires_seconds = net->xfrm.sysctl_acq_expires;
  1055. xfrm_state_hold(x);
  1056. tasklet_hrtimer_start(&x->mtimer, ktime_set(net->xfrm.sysctl_acq_expires, 0), HRTIMER_MODE_REL);
  1057. list_add(&x->km.all, &net->xfrm.state_all);
  1058. hlist_add_head_rcu(&x->bydst, net->xfrm.state_bydst + h);
  1059. h = xfrm_src_hash(net, daddr, saddr, family);
  1060. hlist_add_head_rcu(&x->bysrc, net->xfrm.state_bysrc + h);
  1061. net->xfrm.state_num++;
  1062. xfrm_hash_grow_check(net, x->bydst.next != NULL);
  1063. }
  1064. return x;
  1065. }
  1066. static struct xfrm_state *__xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq);
  1067. int xfrm_state_add(struct xfrm_state *x)
  1068. {
  1069. struct net *net = xs_net(x);
  1070. struct xfrm_state *x1, *to_put;
  1071. int family;
  1072. int err;
  1073. u32 mark = x->mark.v & x->mark.m;
  1074. int use_spi = xfrm_id_proto_match(x->id.proto, IPSEC_PROTO_ANY);
  1075. family = x->props.family;
  1076. to_put = NULL;
  1077. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1078. x1 = __xfrm_state_locate(x, use_spi, family);
  1079. if (x1) {
  1080. to_put = x1;
  1081. x1 = NULL;
  1082. err = -EEXIST;
  1083. goto out;
  1084. }
  1085. if (use_spi && x->km.seq) {
  1086. x1 = __xfrm_find_acq_byseq(net, mark, x->km.seq);
  1087. if (x1 && ((x1->id.proto != x->id.proto) ||
  1088. !xfrm_addr_equal(&x1->id.daddr, &x->id.daddr, family))) {
  1089. to_put = x1;
  1090. x1 = NULL;
  1091. }
  1092. }
  1093. if (use_spi && !x1)
  1094. x1 = __find_acq_core(net, &x->mark, family, x->props.mode,
  1095. x->props.reqid, x->id.proto,
  1096. &x->id.daddr, &x->props.saddr, 0);
  1097. __xfrm_state_bump_genids(x);
  1098. __xfrm_state_insert(x);
  1099. err = 0;
  1100. out:
  1101. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1102. if (x1) {
  1103. xfrm_state_delete(x1);
  1104. xfrm_state_put(x1);
  1105. }
  1106. if (to_put)
  1107. xfrm_state_put(to_put);
  1108. return err;
  1109. }
  1110. EXPORT_SYMBOL(xfrm_state_add);
  1111. #ifdef CONFIG_XFRM_MIGRATE
  1112. static struct xfrm_state *xfrm_state_clone(struct xfrm_state *orig,
  1113. struct xfrm_encap_tmpl *encap)
  1114. {
  1115. struct net *net = xs_net(orig);
  1116. struct xfrm_state *x = xfrm_state_alloc(net);
  1117. if (!x)
  1118. goto out;
  1119. memcpy(&x->id, &orig->id, sizeof(x->id));
  1120. memcpy(&x->sel, &orig->sel, sizeof(x->sel));
  1121. memcpy(&x->lft, &orig->lft, sizeof(x->lft));
  1122. x->props.mode = orig->props.mode;
  1123. x->props.replay_window = orig->props.replay_window;
  1124. x->props.reqid = orig->props.reqid;
  1125. x->props.family = orig->props.family;
  1126. x->props.saddr = orig->props.saddr;
  1127. if (orig->aalg) {
  1128. x->aalg = xfrm_algo_auth_clone(orig->aalg);
  1129. if (!x->aalg)
  1130. goto error;
  1131. }
  1132. x->props.aalgo = orig->props.aalgo;
  1133. if (orig->aead) {
  1134. x->aead = xfrm_algo_aead_clone(orig->aead);
  1135. if (!x->aead)
  1136. goto error;
  1137. }
  1138. if (orig->ealg) {
  1139. x->ealg = xfrm_algo_clone(orig->ealg);
  1140. if (!x->ealg)
  1141. goto error;
  1142. }
  1143. x->props.ealgo = orig->props.ealgo;
  1144. if (orig->calg) {
  1145. x->calg = xfrm_algo_clone(orig->calg);
  1146. if (!x->calg)
  1147. goto error;
  1148. }
  1149. x->props.calgo = orig->props.calgo;
  1150. if (encap || orig->encap) {
  1151. if (encap)
  1152. x->encap = kmemdup(encap, sizeof(*x->encap),
  1153. GFP_KERNEL);
  1154. else
  1155. x->encap = kmemdup(orig->encap, sizeof(*x->encap),
  1156. GFP_KERNEL);
  1157. if (!x->encap)
  1158. goto error;
  1159. }
  1160. if (orig->coaddr) {
  1161. x->coaddr = kmemdup(orig->coaddr, sizeof(*x->coaddr),
  1162. GFP_KERNEL);
  1163. if (!x->coaddr)
  1164. goto error;
  1165. }
  1166. if (orig->replay_esn) {
  1167. if (xfrm_replay_clone(x, orig))
  1168. goto error;
  1169. }
  1170. memcpy(&x->mark, &orig->mark, sizeof(x->mark));
  1171. if (xfrm_init_state(x) < 0)
  1172. goto error;
  1173. x->props.flags = orig->props.flags;
  1174. x->props.extra_flags = orig->props.extra_flags;
  1175. x->tfcpad = orig->tfcpad;
  1176. x->replay_maxdiff = orig->replay_maxdiff;
  1177. x->replay_maxage = orig->replay_maxage;
  1178. x->curlft.add_time = orig->curlft.add_time;
  1179. x->km.state = orig->km.state;
  1180. x->km.seq = orig->km.seq;
  1181. x->replay = orig->replay;
  1182. x->preplay = orig->preplay;
  1183. return x;
  1184. error:
  1185. xfrm_state_put(x);
  1186. out:
  1187. return NULL;
  1188. }
  1189. struct xfrm_state *xfrm_migrate_state_find(struct xfrm_migrate *m, struct net *net)
  1190. {
  1191. unsigned int h;
  1192. struct xfrm_state *x = NULL;
  1193. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1194. if (m->reqid) {
  1195. h = xfrm_dst_hash(net, &m->old_daddr, &m->old_saddr,
  1196. m->reqid, m->old_family);
  1197. hlist_for_each_entry(x, net->xfrm.state_bydst+h, bydst) {
  1198. if (x->props.mode != m->mode ||
  1199. x->id.proto != m->proto)
  1200. continue;
  1201. if (m->reqid && x->props.reqid != m->reqid)
  1202. continue;
  1203. if (!xfrm_addr_equal(&x->id.daddr, &m->old_daddr,
  1204. m->old_family) ||
  1205. !xfrm_addr_equal(&x->props.saddr, &m->old_saddr,
  1206. m->old_family))
  1207. continue;
  1208. xfrm_state_hold(x);
  1209. break;
  1210. }
  1211. } else {
  1212. h = xfrm_src_hash(net, &m->old_daddr, &m->old_saddr,
  1213. m->old_family);
  1214. hlist_for_each_entry(x, net->xfrm.state_bysrc+h, bysrc) {
  1215. if (x->props.mode != m->mode ||
  1216. x->id.proto != m->proto)
  1217. continue;
  1218. if (!xfrm_addr_equal(&x->id.daddr, &m->old_daddr,
  1219. m->old_family) ||
  1220. !xfrm_addr_equal(&x->props.saddr, &m->old_saddr,
  1221. m->old_family))
  1222. continue;
  1223. xfrm_state_hold(x);
  1224. break;
  1225. }
  1226. }
  1227. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1228. return x;
  1229. }
  1230. EXPORT_SYMBOL(xfrm_migrate_state_find);
  1231. struct xfrm_state *xfrm_state_migrate(struct xfrm_state *x,
  1232. struct xfrm_migrate *m,
  1233. struct xfrm_encap_tmpl *encap)
  1234. {
  1235. struct xfrm_state *xc;
  1236. xc = xfrm_state_clone(x, encap);
  1237. if (!xc)
  1238. return NULL;
  1239. memcpy(&xc->id.daddr, &m->new_daddr, sizeof(xc->id.daddr));
  1240. memcpy(&xc->props.saddr, &m->new_saddr, sizeof(xc->props.saddr));
  1241. /* add state */
  1242. if (xfrm_addr_equal(&x->id.daddr, &m->new_daddr, m->new_family)) {
  1243. /* a care is needed when the destination address of the
  1244. state is to be updated as it is a part of triplet */
  1245. xfrm_state_insert(xc);
  1246. } else {
  1247. if (xfrm_state_add(xc) < 0)
  1248. goto error;
  1249. }
  1250. return xc;
  1251. error:
  1252. xfrm_state_put(xc);
  1253. return NULL;
  1254. }
  1255. EXPORT_SYMBOL(xfrm_state_migrate);
  1256. #endif
  1257. int xfrm_state_update(struct xfrm_state *x)
  1258. {
  1259. struct xfrm_state *x1, *to_put;
  1260. int err;
  1261. int use_spi = xfrm_id_proto_match(x->id.proto, IPSEC_PROTO_ANY);
  1262. struct net *net = xs_net(x);
  1263. to_put = NULL;
  1264. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1265. x1 = __xfrm_state_locate(x, use_spi, x->props.family);
  1266. err = -ESRCH;
  1267. if (!x1)
  1268. goto out;
  1269. if (xfrm_state_kern(x1)) {
  1270. to_put = x1;
  1271. err = -EEXIST;
  1272. goto out;
  1273. }
  1274. if (x1->km.state == XFRM_STATE_ACQ) {
  1275. __xfrm_state_insert(x);
  1276. x = NULL;
  1277. }
  1278. err = 0;
  1279. out:
  1280. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1281. if (to_put)
  1282. xfrm_state_put(to_put);
  1283. if (err)
  1284. return err;
  1285. if (!x) {
  1286. xfrm_state_delete(x1);
  1287. xfrm_state_put(x1);
  1288. return 0;
  1289. }
  1290. err = -EINVAL;
  1291. spin_lock_bh(&x1->lock);
  1292. if (likely(x1->km.state == XFRM_STATE_VALID)) {
  1293. if (x->encap && x1->encap)
  1294. memcpy(x1->encap, x->encap, sizeof(*x1->encap));
  1295. if (x->coaddr && x1->coaddr) {
  1296. memcpy(x1->coaddr, x->coaddr, sizeof(*x1->coaddr));
  1297. }
  1298. if (!use_spi && memcmp(&x1->sel, &x->sel, sizeof(x1->sel)))
  1299. memcpy(&x1->sel, &x->sel, sizeof(x1->sel));
  1300. memcpy(&x1->lft, &x->lft, sizeof(x1->lft));
  1301. x1->km.dying = 0;
  1302. tasklet_hrtimer_start(&x1->mtimer, ktime_set(1, 0), HRTIMER_MODE_REL);
  1303. if (x1->curlft.use_time)
  1304. xfrm_state_check_expire(x1);
  1305. err = 0;
  1306. x->km.state = XFRM_STATE_DEAD;
  1307. __xfrm_state_put(x);
  1308. }
  1309. spin_unlock_bh(&x1->lock);
  1310. xfrm_state_put(x1);
  1311. return err;
  1312. }
  1313. EXPORT_SYMBOL(xfrm_state_update);
  1314. int xfrm_state_check_expire(struct xfrm_state *x)
  1315. {
  1316. if (!x->curlft.use_time)
  1317. x->curlft.use_time = get_seconds();
  1318. if (x->curlft.bytes >= x->lft.hard_byte_limit ||
  1319. x->curlft.packets >= x->lft.hard_packet_limit) {
  1320. x->km.state = XFRM_STATE_EXPIRED;
  1321. tasklet_hrtimer_start(&x->mtimer, 0, HRTIMER_MODE_REL);
  1322. return -EINVAL;
  1323. }
  1324. if (!x->km.dying &&
  1325. (x->curlft.bytes >= x->lft.soft_byte_limit ||
  1326. x->curlft.packets >= x->lft.soft_packet_limit)) {
  1327. x->km.dying = 1;
  1328. km_state_expired(x, 0, 0);
  1329. }
  1330. return 0;
  1331. }
  1332. EXPORT_SYMBOL(xfrm_state_check_expire);
  1333. struct xfrm_state *
  1334. xfrm_state_lookup(struct net *net, u32 mark, const xfrm_address_t *daddr, __be32 spi,
  1335. u8 proto, unsigned short family)
  1336. {
  1337. struct xfrm_state *x;
  1338. rcu_read_lock();
  1339. x = __xfrm_state_lookup(net, mark, daddr, spi, proto, family);
  1340. rcu_read_unlock();
  1341. return x;
  1342. }
  1343. EXPORT_SYMBOL(xfrm_state_lookup);
  1344. struct xfrm_state *
  1345. xfrm_state_lookup_byaddr(struct net *net, u32 mark,
  1346. const xfrm_address_t *daddr, const xfrm_address_t *saddr,
  1347. u8 proto, unsigned short family)
  1348. {
  1349. struct xfrm_state *x;
  1350. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1351. x = __xfrm_state_lookup_byaddr(net, mark, daddr, saddr, proto, family);
  1352. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1353. return x;
  1354. }
  1355. EXPORT_SYMBOL(xfrm_state_lookup_byaddr);
  1356. struct xfrm_state *
  1357. xfrm_find_acq(struct net *net, const struct xfrm_mark *mark, u8 mode, u32 reqid,
  1358. u8 proto, const xfrm_address_t *daddr,
  1359. const xfrm_address_t *saddr, int create, unsigned short family)
  1360. {
  1361. struct xfrm_state *x;
  1362. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1363. x = __find_acq_core(net, mark, family, mode, reqid, proto, daddr, saddr, create);
  1364. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1365. return x;
  1366. }
  1367. EXPORT_SYMBOL(xfrm_find_acq);
  1368. #ifdef CONFIG_XFRM_SUB_POLICY
  1369. int
  1370. xfrm_tmpl_sort(struct xfrm_tmpl **dst, struct xfrm_tmpl **src, int n,
  1371. unsigned short family, struct net *net)
  1372. {
  1373. int err = 0;
  1374. struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
  1375. if (!afinfo)
  1376. return -EAFNOSUPPORT;
  1377. spin_lock_bh(&net->xfrm.xfrm_state_lock); /*FIXME*/
  1378. if (afinfo->tmpl_sort)
  1379. err = afinfo->tmpl_sort(dst, src, n);
  1380. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1381. rcu_read_unlock();
  1382. return err;
  1383. }
  1384. EXPORT_SYMBOL(xfrm_tmpl_sort);
  1385. int
  1386. xfrm_state_sort(struct xfrm_state **dst, struct xfrm_state **src, int n,
  1387. unsigned short family)
  1388. {
  1389. int err = 0;
  1390. struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
  1391. struct net *net = xs_net(*src);
  1392. if (!afinfo)
  1393. return -EAFNOSUPPORT;
  1394. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1395. if (afinfo->state_sort)
  1396. err = afinfo->state_sort(dst, src, n);
  1397. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1398. rcu_read_unlock();
  1399. return err;
  1400. }
  1401. EXPORT_SYMBOL(xfrm_state_sort);
  1402. #endif
  1403. /* Silly enough, but I'm lazy to build resolution list */
  1404. static struct xfrm_state *__xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq)
  1405. {
  1406. int i;
  1407. for (i = 0; i <= net->xfrm.state_hmask; i++) {
  1408. struct xfrm_state *x;
  1409. hlist_for_each_entry(x, net->xfrm.state_bydst+i, bydst) {
  1410. if (x->km.seq == seq &&
  1411. (mark & x->mark.m) == x->mark.v &&
  1412. x->km.state == XFRM_STATE_ACQ) {
  1413. xfrm_state_hold(x);
  1414. return x;
  1415. }
  1416. }
  1417. }
  1418. return NULL;
  1419. }
  1420. struct xfrm_state *xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq)
  1421. {
  1422. struct xfrm_state *x;
  1423. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1424. x = __xfrm_find_acq_byseq(net, mark, seq);
  1425. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1426. return x;
  1427. }
  1428. EXPORT_SYMBOL(xfrm_find_acq_byseq);
  1429. u32 xfrm_get_acqseq(void)
  1430. {
  1431. u32 res;
  1432. static atomic_t acqseq;
  1433. do {
  1434. res = atomic_inc_return(&acqseq);
  1435. } while (!res);
  1436. return res;
  1437. }
  1438. EXPORT_SYMBOL(xfrm_get_acqseq);
  1439. int verify_spi_info(u8 proto, u32 min, u32 max)
  1440. {
  1441. switch (proto) {
  1442. case IPPROTO_AH:
  1443. case IPPROTO_ESP:
  1444. break;
  1445. case IPPROTO_COMP:
  1446. /* IPCOMP spi is 16-bits. */
  1447. if (max >= 0x10000)
  1448. return -EINVAL;
  1449. break;
  1450. default:
  1451. return -EINVAL;
  1452. }
  1453. if (min > max)
  1454. return -EINVAL;
  1455. return 0;
  1456. }
  1457. EXPORT_SYMBOL(verify_spi_info);
  1458. int xfrm_alloc_spi(struct xfrm_state *x, u32 low, u32 high)
  1459. {
  1460. struct net *net = xs_net(x);
  1461. unsigned int h;
  1462. struct xfrm_state *x0;
  1463. int err = -ENOENT;
  1464. __be32 minspi = htonl(low);
  1465. __be32 maxspi = htonl(high);
  1466. u32 mark = x->mark.v & x->mark.m;
  1467. spin_lock_bh(&x->lock);
  1468. if (x->km.state == XFRM_STATE_DEAD)
  1469. goto unlock;
  1470. err = 0;
  1471. if (x->id.spi)
  1472. goto unlock;
  1473. err = -ENOENT;
  1474. if (minspi == maxspi) {
  1475. x0 = xfrm_state_lookup(net, mark, &x->id.daddr, minspi, x->id.proto, x->props.family);
  1476. if (x0) {
  1477. xfrm_state_put(x0);
  1478. goto unlock;
  1479. }
  1480. x->id.spi = minspi;
  1481. } else {
  1482. u32 spi = 0;
  1483. for (h = 0; h < high-low+1; h++) {
  1484. spi = low + prandom_u32()%(high-low+1);
  1485. x0 = xfrm_state_lookup(net, mark, &x->id.daddr, htonl(spi), x->id.proto, x->props.family);
  1486. if (x0 == NULL) {
  1487. x->id.spi = htonl(spi);
  1488. break;
  1489. }
  1490. xfrm_state_put(x0);
  1491. }
  1492. }
  1493. if (x->id.spi) {
  1494. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1495. h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto, x->props.family);
  1496. hlist_add_head_rcu(&x->byspi, net->xfrm.state_byspi + h);
  1497. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1498. err = 0;
  1499. }
  1500. unlock:
  1501. spin_unlock_bh(&x->lock);
  1502. return err;
  1503. }
  1504. EXPORT_SYMBOL(xfrm_alloc_spi);
  1505. static bool __xfrm_state_filter_match(struct xfrm_state *x,
  1506. struct xfrm_address_filter *filter)
  1507. {
  1508. if (filter) {
  1509. if ((filter->family == AF_INET ||
  1510. filter->family == AF_INET6) &&
  1511. x->props.family != filter->family)
  1512. return false;
  1513. return addr_match(&x->props.saddr, &filter->saddr,
  1514. filter->splen) &&
  1515. addr_match(&x->id.daddr, &filter->daddr,
  1516. filter->dplen);
  1517. }
  1518. return true;
  1519. }
  1520. int xfrm_state_walk(struct net *net, struct xfrm_state_walk *walk,
  1521. int (*func)(struct xfrm_state *, int, void*),
  1522. void *data)
  1523. {
  1524. struct xfrm_state *state;
  1525. struct xfrm_state_walk *x;
  1526. int err = 0;
  1527. if (walk->seq != 0 && list_empty(&walk->all))
  1528. return 0;
  1529. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1530. if (list_empty(&walk->all))
  1531. x = list_first_entry(&net->xfrm.state_all, struct xfrm_state_walk, all);
  1532. else
  1533. x = list_first_entry(&walk->all, struct xfrm_state_walk, all);
  1534. list_for_each_entry_from(x, &net->xfrm.state_all, all) {
  1535. if (x->state == XFRM_STATE_DEAD)
  1536. continue;
  1537. state = container_of(x, struct xfrm_state, km);
  1538. if (!xfrm_id_proto_match(state->id.proto, walk->proto))
  1539. continue;
  1540. if (!__xfrm_state_filter_match(state, walk->filter))
  1541. continue;
  1542. err = func(state, walk->seq, data);
  1543. if (err) {
  1544. list_move_tail(&walk->all, &x->all);
  1545. goto out;
  1546. }
  1547. walk->seq++;
  1548. }
  1549. if (walk->seq == 0) {
  1550. err = -ENOENT;
  1551. goto out;
  1552. }
  1553. list_del_init(&walk->all);
  1554. out:
  1555. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1556. return err;
  1557. }
  1558. EXPORT_SYMBOL(xfrm_state_walk);
  1559. void xfrm_state_walk_init(struct xfrm_state_walk *walk, u8 proto,
  1560. struct xfrm_address_filter *filter)
  1561. {
  1562. INIT_LIST_HEAD(&walk->all);
  1563. walk->proto = proto;
  1564. walk->state = XFRM_STATE_DEAD;
  1565. walk->seq = 0;
  1566. walk->filter = filter;
  1567. }
  1568. EXPORT_SYMBOL(xfrm_state_walk_init);
  1569. void xfrm_state_walk_done(struct xfrm_state_walk *walk, struct net *net)
  1570. {
  1571. kfree(walk->filter);
  1572. if (list_empty(&walk->all))
  1573. return;
  1574. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1575. list_del(&walk->all);
  1576. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1577. }
  1578. EXPORT_SYMBOL(xfrm_state_walk_done);
  1579. static void xfrm_replay_timer_handler(unsigned long data)
  1580. {
  1581. struct xfrm_state *x = (struct xfrm_state *)data;
  1582. spin_lock(&x->lock);
  1583. if (x->km.state == XFRM_STATE_VALID) {
  1584. if (xfrm_aevent_is_on(xs_net(x)))
  1585. x->repl->notify(x, XFRM_REPLAY_TIMEOUT);
  1586. else
  1587. x->xflags |= XFRM_TIME_DEFER;
  1588. }
  1589. spin_unlock(&x->lock);
  1590. }
  1591. static LIST_HEAD(xfrm_km_list);
  1592. void km_policy_notify(struct xfrm_policy *xp, int dir, const struct km_event *c)
  1593. {
  1594. struct xfrm_mgr *km;
  1595. rcu_read_lock();
  1596. list_for_each_entry_rcu(km, &xfrm_km_list, list)
  1597. if (km->notify_policy)
  1598. km->notify_policy(xp, dir, c);
  1599. rcu_read_unlock();
  1600. }
  1601. void km_state_notify(struct xfrm_state *x, const struct km_event *c)
  1602. {
  1603. struct xfrm_mgr *km;
  1604. rcu_read_lock();
  1605. list_for_each_entry_rcu(km, &xfrm_km_list, list)
  1606. if (km->notify)
  1607. km->notify(x, c);
  1608. rcu_read_unlock();
  1609. }
  1610. EXPORT_SYMBOL(km_policy_notify);
  1611. EXPORT_SYMBOL(km_state_notify);
  1612. void km_state_expired(struct xfrm_state *x, int hard, u32 portid)
  1613. {
  1614. struct km_event c;
  1615. c.data.hard = hard;
  1616. c.portid = portid;
  1617. c.event = XFRM_MSG_EXPIRE;
  1618. km_state_notify(x, &c);
  1619. }
  1620. EXPORT_SYMBOL(km_state_expired);
  1621. /*
  1622. * We send to all registered managers regardless of failure
  1623. * We are happy with one success
  1624. */
  1625. int km_query(struct xfrm_state *x, struct xfrm_tmpl *t, struct xfrm_policy *pol)
  1626. {
  1627. int err = -EINVAL, acqret;
  1628. struct xfrm_mgr *km;
  1629. rcu_read_lock();
  1630. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  1631. acqret = km->acquire(x, t, pol);
  1632. if (!acqret)
  1633. err = acqret;
  1634. }
  1635. rcu_read_unlock();
  1636. return err;
  1637. }
  1638. EXPORT_SYMBOL(km_query);
  1639. int km_new_mapping(struct xfrm_state *x, xfrm_address_t *ipaddr, __be16 sport)
  1640. {
  1641. int err = -EINVAL;
  1642. struct xfrm_mgr *km;
  1643. rcu_read_lock();
  1644. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  1645. if (km->new_mapping)
  1646. err = km->new_mapping(x, ipaddr, sport);
  1647. if (!err)
  1648. break;
  1649. }
  1650. rcu_read_unlock();
  1651. return err;
  1652. }
  1653. EXPORT_SYMBOL(km_new_mapping);
  1654. void km_policy_expired(struct xfrm_policy *pol, int dir, int hard, u32 portid)
  1655. {
  1656. struct km_event c;
  1657. c.data.hard = hard;
  1658. c.portid = portid;
  1659. c.event = XFRM_MSG_POLEXPIRE;
  1660. km_policy_notify(pol, dir, &c);
  1661. }
  1662. EXPORT_SYMBOL(km_policy_expired);
  1663. #ifdef CONFIG_XFRM_MIGRATE
  1664. int km_migrate(const struct xfrm_selector *sel, u8 dir, u8 type,
  1665. const struct xfrm_migrate *m, int num_migrate,
  1666. const struct xfrm_kmaddress *k,
  1667. const struct xfrm_encap_tmpl *encap)
  1668. {
  1669. int err = -EINVAL;
  1670. int ret;
  1671. struct xfrm_mgr *km;
  1672. rcu_read_lock();
  1673. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  1674. if (km->migrate) {
  1675. ret = km->migrate(sel, dir, type, m, num_migrate, k,
  1676. encap);
  1677. if (!ret)
  1678. err = ret;
  1679. }
  1680. }
  1681. rcu_read_unlock();
  1682. return err;
  1683. }
  1684. EXPORT_SYMBOL(km_migrate);
  1685. #endif
  1686. int km_report(struct net *net, u8 proto, struct xfrm_selector *sel, xfrm_address_t *addr)
  1687. {
  1688. int err = -EINVAL;
  1689. int ret;
  1690. struct xfrm_mgr *km;
  1691. rcu_read_lock();
  1692. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  1693. if (km->report) {
  1694. ret = km->report(net, proto, sel, addr);
  1695. if (!ret)
  1696. err = ret;
  1697. }
  1698. }
  1699. rcu_read_unlock();
  1700. return err;
  1701. }
  1702. EXPORT_SYMBOL(km_report);
  1703. bool km_is_alive(const struct km_event *c)
  1704. {
  1705. struct xfrm_mgr *km;
  1706. bool is_alive = false;
  1707. rcu_read_lock();
  1708. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  1709. if (km->is_alive && km->is_alive(c)) {
  1710. is_alive = true;
  1711. break;
  1712. }
  1713. }
  1714. rcu_read_unlock();
  1715. return is_alive;
  1716. }
  1717. EXPORT_SYMBOL(km_is_alive);
  1718. int xfrm_user_policy(struct sock *sk, int optname, u8 __user *optval, int optlen)
  1719. {
  1720. int err;
  1721. u8 *data;
  1722. struct xfrm_mgr *km;
  1723. struct xfrm_policy *pol = NULL;
  1724. if (optlen <= 0 || optlen > PAGE_SIZE)
  1725. return -EMSGSIZE;
  1726. data = memdup_user(optval, optlen);
  1727. if (IS_ERR(data))
  1728. return PTR_ERR(data);
  1729. err = -EINVAL;
  1730. rcu_read_lock();
  1731. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  1732. pol = km->compile_policy(sk, optname, data,
  1733. optlen, &err);
  1734. if (err >= 0)
  1735. break;
  1736. }
  1737. rcu_read_unlock();
  1738. if (err >= 0) {
  1739. xfrm_sk_policy_insert(sk, err, pol);
  1740. xfrm_pol_put(pol);
  1741. err = 0;
  1742. }
  1743. kfree(data);
  1744. return err;
  1745. }
  1746. EXPORT_SYMBOL(xfrm_user_policy);
  1747. static DEFINE_SPINLOCK(xfrm_km_lock);
  1748. int xfrm_register_km(struct xfrm_mgr *km)
  1749. {
  1750. spin_lock_bh(&xfrm_km_lock);
  1751. list_add_tail_rcu(&km->list, &xfrm_km_list);
  1752. spin_unlock_bh(&xfrm_km_lock);
  1753. return 0;
  1754. }
  1755. EXPORT_SYMBOL(xfrm_register_km);
  1756. int xfrm_unregister_km(struct xfrm_mgr *km)
  1757. {
  1758. spin_lock_bh(&xfrm_km_lock);
  1759. list_del_rcu(&km->list);
  1760. spin_unlock_bh(&xfrm_km_lock);
  1761. synchronize_rcu();
  1762. return 0;
  1763. }
  1764. EXPORT_SYMBOL(xfrm_unregister_km);
  1765. int xfrm_state_register_afinfo(struct xfrm_state_afinfo *afinfo)
  1766. {
  1767. int err = 0;
  1768. if (WARN_ON(afinfo->family >= NPROTO))
  1769. return -EAFNOSUPPORT;
  1770. spin_lock_bh(&xfrm_state_afinfo_lock);
  1771. if (unlikely(xfrm_state_afinfo[afinfo->family] != NULL))
  1772. err = -EEXIST;
  1773. else
  1774. rcu_assign_pointer(xfrm_state_afinfo[afinfo->family], afinfo);
  1775. spin_unlock_bh(&xfrm_state_afinfo_lock);
  1776. return err;
  1777. }
  1778. EXPORT_SYMBOL(xfrm_state_register_afinfo);
  1779. int xfrm_state_unregister_afinfo(struct xfrm_state_afinfo *afinfo)
  1780. {
  1781. int err = 0, family = afinfo->family;
  1782. if (WARN_ON(family >= NPROTO))
  1783. return -EAFNOSUPPORT;
  1784. spin_lock_bh(&xfrm_state_afinfo_lock);
  1785. if (likely(xfrm_state_afinfo[afinfo->family] != NULL)) {
  1786. if (rcu_access_pointer(xfrm_state_afinfo[family]) != afinfo)
  1787. err = -EINVAL;
  1788. else
  1789. RCU_INIT_POINTER(xfrm_state_afinfo[afinfo->family], NULL);
  1790. }
  1791. spin_unlock_bh(&xfrm_state_afinfo_lock);
  1792. synchronize_rcu();
  1793. return err;
  1794. }
  1795. EXPORT_SYMBOL(xfrm_state_unregister_afinfo);
  1796. struct xfrm_state_afinfo *xfrm_state_afinfo_get_rcu(unsigned int family)
  1797. {
  1798. if (unlikely(family >= NPROTO))
  1799. return NULL;
  1800. return rcu_dereference(xfrm_state_afinfo[family]);
  1801. }
  1802. struct xfrm_state_afinfo *xfrm_state_get_afinfo(unsigned int family)
  1803. {
  1804. struct xfrm_state_afinfo *afinfo;
  1805. if (unlikely(family >= NPROTO))
  1806. return NULL;
  1807. rcu_read_lock();
  1808. afinfo = rcu_dereference(xfrm_state_afinfo[family]);
  1809. if (unlikely(!afinfo))
  1810. rcu_read_unlock();
  1811. return afinfo;
  1812. }
  1813. /* Temporarily located here until net/xfrm/xfrm_tunnel.c is created */
  1814. void xfrm_state_delete_tunnel(struct xfrm_state *x)
  1815. {
  1816. if (x->tunnel) {
  1817. struct xfrm_state *t = x->tunnel;
  1818. if (atomic_read(&t->tunnel_users) == 2)
  1819. xfrm_state_delete(t);
  1820. atomic_dec(&t->tunnel_users);
  1821. xfrm_state_put(t);
  1822. x->tunnel = NULL;
  1823. }
  1824. }
  1825. EXPORT_SYMBOL(xfrm_state_delete_tunnel);
  1826. int xfrm_state_mtu(struct xfrm_state *x, int mtu)
  1827. {
  1828. const struct xfrm_type *type = READ_ONCE(x->type);
  1829. if (x->km.state == XFRM_STATE_VALID &&
  1830. type && type->get_mtu)
  1831. return type->get_mtu(x, mtu);
  1832. return mtu - x->props.header_len;
  1833. }
  1834. int __xfrm_init_state(struct xfrm_state *x, bool init_replay)
  1835. {
  1836. struct xfrm_state_afinfo *afinfo;
  1837. struct xfrm_mode *inner_mode;
  1838. int family = x->props.family;
  1839. int err;
  1840. err = -EAFNOSUPPORT;
  1841. afinfo = xfrm_state_get_afinfo(family);
  1842. if (!afinfo)
  1843. goto error;
  1844. err = 0;
  1845. if (afinfo->init_flags)
  1846. err = afinfo->init_flags(x);
  1847. rcu_read_unlock();
  1848. if (err)
  1849. goto error;
  1850. err = -EPROTONOSUPPORT;
  1851. if (x->sel.family != AF_UNSPEC) {
  1852. inner_mode = xfrm_get_mode(x->props.mode, x->sel.family);
  1853. if (inner_mode == NULL)
  1854. goto error;
  1855. if (!(inner_mode->flags & XFRM_MODE_FLAG_TUNNEL) &&
  1856. family != x->sel.family) {
  1857. xfrm_put_mode(inner_mode);
  1858. goto error;
  1859. }
  1860. x->inner_mode = inner_mode;
  1861. } else {
  1862. struct xfrm_mode *inner_mode_iaf;
  1863. int iafamily = AF_INET;
  1864. inner_mode = xfrm_get_mode(x->props.mode, x->props.family);
  1865. if (inner_mode == NULL)
  1866. goto error;
  1867. if (!(inner_mode->flags & XFRM_MODE_FLAG_TUNNEL)) {
  1868. xfrm_put_mode(inner_mode);
  1869. goto error;
  1870. }
  1871. x->inner_mode = inner_mode;
  1872. if (x->props.family == AF_INET)
  1873. iafamily = AF_INET6;
  1874. inner_mode_iaf = xfrm_get_mode(x->props.mode, iafamily);
  1875. if (inner_mode_iaf) {
  1876. if (inner_mode_iaf->flags & XFRM_MODE_FLAG_TUNNEL)
  1877. x->inner_mode_iaf = inner_mode_iaf;
  1878. else
  1879. xfrm_put_mode(inner_mode_iaf);
  1880. }
  1881. }
  1882. x->type = xfrm_get_type(x->id.proto, family);
  1883. if (x->type == NULL)
  1884. goto error;
  1885. x->type_offload = xfrm_get_type_offload(x->id.proto, family);
  1886. err = x->type->init_state(x);
  1887. if (err)
  1888. goto error;
  1889. x->outer_mode = xfrm_get_mode(x->props.mode, family);
  1890. if (x->outer_mode == NULL) {
  1891. err = -EPROTONOSUPPORT;
  1892. goto error;
  1893. }
  1894. if (init_replay) {
  1895. err = xfrm_init_replay(x);
  1896. if (err)
  1897. goto error;
  1898. }
  1899. x->km.state = XFRM_STATE_VALID;
  1900. error:
  1901. return err;
  1902. }
  1903. EXPORT_SYMBOL(__xfrm_init_state);
  1904. int xfrm_init_state(struct xfrm_state *x)
  1905. {
  1906. return __xfrm_init_state(x, true);
  1907. }
  1908. EXPORT_SYMBOL(xfrm_init_state);
  1909. int __net_init xfrm_state_init(struct net *net)
  1910. {
  1911. unsigned int sz;
  1912. INIT_LIST_HEAD(&net->xfrm.state_all);
  1913. sz = sizeof(struct hlist_head) * 8;
  1914. net->xfrm.state_bydst = xfrm_hash_alloc(sz);
  1915. if (!net->xfrm.state_bydst)
  1916. goto out_bydst;
  1917. net->xfrm.state_bysrc = xfrm_hash_alloc(sz);
  1918. if (!net->xfrm.state_bysrc)
  1919. goto out_bysrc;
  1920. net->xfrm.state_byspi = xfrm_hash_alloc(sz);
  1921. if (!net->xfrm.state_byspi)
  1922. goto out_byspi;
  1923. net->xfrm.state_hmask = ((sz / sizeof(struct hlist_head)) - 1);
  1924. net->xfrm.state_num = 0;
  1925. INIT_WORK(&net->xfrm.state_hash_work, xfrm_hash_resize);
  1926. spin_lock_init(&net->xfrm.xfrm_state_lock);
  1927. return 0;
  1928. out_byspi:
  1929. xfrm_hash_free(net->xfrm.state_bysrc, sz);
  1930. out_bysrc:
  1931. xfrm_hash_free(net->xfrm.state_bydst, sz);
  1932. out_bydst:
  1933. return -ENOMEM;
  1934. }
  1935. void xfrm_state_fini(struct net *net)
  1936. {
  1937. unsigned int sz;
  1938. flush_work(&net->xfrm.state_hash_work);
  1939. xfrm_state_flush(net, IPSEC_PROTO_ANY, false);
  1940. flush_work(&xfrm_state_gc_work);
  1941. WARN_ON(!list_empty(&net->xfrm.state_all));
  1942. sz = (net->xfrm.state_hmask + 1) * sizeof(struct hlist_head);
  1943. WARN_ON(!hlist_empty(net->xfrm.state_byspi));
  1944. xfrm_hash_free(net->xfrm.state_byspi, sz);
  1945. WARN_ON(!hlist_empty(net->xfrm.state_bysrc));
  1946. xfrm_hash_free(net->xfrm.state_bysrc, sz);
  1947. WARN_ON(!hlist_empty(net->xfrm.state_bydst));
  1948. xfrm_hash_free(net->xfrm.state_bydst, sz);
  1949. }
  1950. #ifdef CONFIG_AUDITSYSCALL
  1951. static void xfrm_audit_helper_sainfo(struct xfrm_state *x,
  1952. struct audit_buffer *audit_buf)
  1953. {
  1954. struct xfrm_sec_ctx *ctx = x->security;
  1955. u32 spi = ntohl(x->id.spi);
  1956. if (ctx)
  1957. audit_log_format(audit_buf, " sec_alg=%u sec_doi=%u sec_obj=%s",
  1958. ctx->ctx_alg, ctx->ctx_doi, ctx->ctx_str);
  1959. switch (x->props.family) {
  1960. case AF_INET:
  1961. audit_log_format(audit_buf, " src=%pI4 dst=%pI4",
  1962. &x->props.saddr.a4, &x->id.daddr.a4);
  1963. break;
  1964. case AF_INET6:
  1965. audit_log_format(audit_buf, " src=%pI6 dst=%pI6",
  1966. x->props.saddr.a6, x->id.daddr.a6);
  1967. break;
  1968. }
  1969. audit_log_format(audit_buf, " spi=%u(0x%x)", spi, spi);
  1970. }
  1971. static void xfrm_audit_helper_pktinfo(struct sk_buff *skb, u16 family,
  1972. struct audit_buffer *audit_buf)
  1973. {
  1974. const struct iphdr *iph4;
  1975. const struct ipv6hdr *iph6;
  1976. switch (family) {
  1977. case AF_INET:
  1978. iph4 = ip_hdr(skb);
  1979. audit_log_format(audit_buf, " src=%pI4 dst=%pI4",
  1980. &iph4->saddr, &iph4->daddr);
  1981. break;
  1982. case AF_INET6:
  1983. iph6 = ipv6_hdr(skb);
  1984. audit_log_format(audit_buf,
  1985. " src=%pI6 dst=%pI6 flowlbl=0x%x%02x%02x",
  1986. &iph6->saddr, &iph6->daddr,
  1987. iph6->flow_lbl[0] & 0x0f,
  1988. iph6->flow_lbl[1],
  1989. iph6->flow_lbl[2]);
  1990. break;
  1991. }
  1992. }
  1993. void xfrm_audit_state_add(struct xfrm_state *x, int result, bool task_valid)
  1994. {
  1995. struct audit_buffer *audit_buf;
  1996. audit_buf = xfrm_audit_start("SAD-add");
  1997. if (audit_buf == NULL)
  1998. return;
  1999. xfrm_audit_helper_usrinfo(task_valid, audit_buf);
  2000. xfrm_audit_helper_sainfo(x, audit_buf);
  2001. audit_log_format(audit_buf, " res=%u", result);
  2002. audit_log_end(audit_buf);
  2003. }
  2004. EXPORT_SYMBOL_GPL(xfrm_audit_state_add);
  2005. void xfrm_audit_state_delete(struct xfrm_state *x, int result, bool task_valid)
  2006. {
  2007. struct audit_buffer *audit_buf;
  2008. audit_buf = xfrm_audit_start("SAD-delete");
  2009. if (audit_buf == NULL)
  2010. return;
  2011. xfrm_audit_helper_usrinfo(task_valid, audit_buf);
  2012. xfrm_audit_helper_sainfo(x, audit_buf);
  2013. audit_log_format(audit_buf, " res=%u", result);
  2014. audit_log_end(audit_buf);
  2015. }
  2016. EXPORT_SYMBOL_GPL(xfrm_audit_state_delete);
  2017. void xfrm_audit_state_replay_overflow(struct xfrm_state *x,
  2018. struct sk_buff *skb)
  2019. {
  2020. struct audit_buffer *audit_buf;
  2021. u32 spi;
  2022. audit_buf = xfrm_audit_start("SA-replay-overflow");
  2023. if (audit_buf == NULL)
  2024. return;
  2025. xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
  2026. /* don't record the sequence number because it's inherent in this kind
  2027. * of audit message */
  2028. spi = ntohl(x->id.spi);
  2029. audit_log_format(audit_buf, " spi=%u(0x%x)", spi, spi);
  2030. audit_log_end(audit_buf);
  2031. }
  2032. EXPORT_SYMBOL_GPL(xfrm_audit_state_replay_overflow);
  2033. void xfrm_audit_state_replay(struct xfrm_state *x,
  2034. struct sk_buff *skb, __be32 net_seq)
  2035. {
  2036. struct audit_buffer *audit_buf;
  2037. u32 spi;
  2038. audit_buf = xfrm_audit_start("SA-replayed-pkt");
  2039. if (audit_buf == NULL)
  2040. return;
  2041. xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
  2042. spi = ntohl(x->id.spi);
  2043. audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
  2044. spi, spi, ntohl(net_seq));
  2045. audit_log_end(audit_buf);
  2046. }
  2047. EXPORT_SYMBOL_GPL(xfrm_audit_state_replay);
  2048. void xfrm_audit_state_notfound_simple(struct sk_buff *skb, u16 family)
  2049. {
  2050. struct audit_buffer *audit_buf;
  2051. audit_buf = xfrm_audit_start("SA-notfound");
  2052. if (audit_buf == NULL)
  2053. return;
  2054. xfrm_audit_helper_pktinfo(skb, family, audit_buf);
  2055. audit_log_end(audit_buf);
  2056. }
  2057. EXPORT_SYMBOL_GPL(xfrm_audit_state_notfound_simple);
  2058. void xfrm_audit_state_notfound(struct sk_buff *skb, u16 family,
  2059. __be32 net_spi, __be32 net_seq)
  2060. {
  2061. struct audit_buffer *audit_buf;
  2062. u32 spi;
  2063. audit_buf = xfrm_audit_start("SA-notfound");
  2064. if (audit_buf == NULL)
  2065. return;
  2066. xfrm_audit_helper_pktinfo(skb, family, audit_buf);
  2067. spi = ntohl(net_spi);
  2068. audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
  2069. spi, spi, ntohl(net_seq));
  2070. audit_log_end(audit_buf);
  2071. }
  2072. EXPORT_SYMBOL_GPL(xfrm_audit_state_notfound);
  2073. void xfrm_audit_state_icvfail(struct xfrm_state *x,
  2074. struct sk_buff *skb, u8 proto)
  2075. {
  2076. struct audit_buffer *audit_buf;
  2077. __be32 net_spi;
  2078. __be32 net_seq;
  2079. audit_buf = xfrm_audit_start("SA-icv-failure");
  2080. if (audit_buf == NULL)
  2081. return;
  2082. xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
  2083. if (xfrm_parse_spi(skb, proto, &net_spi, &net_seq) == 0) {
  2084. u32 spi = ntohl(net_spi);
  2085. audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
  2086. spi, spi, ntohl(net_seq));
  2087. }
  2088. audit_log_end(audit_buf);
  2089. }
  2090. EXPORT_SYMBOL_GPL(xfrm_audit_state_icvfail);
  2091. #endif /* CONFIG_AUDITSYSCALL */