xfrm_state.c 54 KB

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