xfrm_state.c 54 KB

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