xfrm_state.c 55 KB

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