xfrm_state.c 55 KB

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