xfrm_state.c 59 KB

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