xfrm_state.c 56 KB

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