xfrm_state.c 59 KB

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