xfrm_state.c 69 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * xfrm_state.c
  4. *
  5. * Changes:
  6. * Mitsuru KANDA @USAGI
  7. * Kazunori MIYAZAWA @USAGI
  8. * Kunihiro Ishiguro <[email protected]>
  9. * IPv6 support
  10. * YOSHIFUJI Hideaki @USAGI
  11. * Split up af-specific functions
  12. * Derek Atkins <[email protected]>
  13. * Add UDP Encapsulation
  14. *
  15. */
  16. #include <linux/compat.h>
  17. #include <linux/workqueue.h>
  18. #include <net/xfrm.h>
  19. #include <linux/pfkeyv2.h>
  20. #include <linux/ipsec.h>
  21. #include <linux/module.h>
  22. #include <linux/cache.h>
  23. #include <linux/audit.h>
  24. #include <linux/uaccess.h>
  25. #include <linux/ktime.h>
  26. #include <linux/slab.h>
  27. #include <linux/interrupt.h>
  28. #include <linux/kernel.h>
  29. #include <crypto/aead.h>
  30. #include "xfrm_hash.h"
  31. #define xfrm_state_deref_prot(table, net) \
  32. rcu_dereference_protected((table), lockdep_is_held(&(net)->xfrm.xfrm_state_lock))
  33. static void xfrm_state_gc_task(struct work_struct *work);
  34. /* Each xfrm_state may be linked to two tables:
  35. 1. Hash table by (spi,daddr,ah/esp) to find SA by SPI. (input,ctl)
  36. 2. Hash table by (daddr,family,reqid) to find what SAs exist for given
  37. destination/tunnel endpoint. (output)
  38. */
  39. static unsigned int xfrm_state_hashmax __read_mostly = 1 * 1024 * 1024;
  40. static struct kmem_cache *xfrm_state_cache __ro_after_init;
  41. static DECLARE_WORK(xfrm_state_gc_work, xfrm_state_gc_task);
  42. static HLIST_HEAD(xfrm_state_gc_list);
  43. static inline bool xfrm_state_hold_rcu(struct xfrm_state __rcu *x)
  44. {
  45. return refcount_inc_not_zero(&x->refcnt);
  46. }
  47. static inline unsigned int xfrm_dst_hash(struct net *net,
  48. const xfrm_address_t *daddr,
  49. const xfrm_address_t *saddr,
  50. u32 reqid,
  51. unsigned short family)
  52. {
  53. return __xfrm_dst_hash(daddr, saddr, reqid, family, net->xfrm.state_hmask);
  54. }
  55. static inline unsigned int xfrm_src_hash(struct net *net,
  56. const xfrm_address_t *daddr,
  57. const xfrm_address_t *saddr,
  58. unsigned short family)
  59. {
  60. return __xfrm_src_hash(daddr, saddr, family, net->xfrm.state_hmask);
  61. }
  62. static inline unsigned int
  63. xfrm_spi_hash(struct net *net, const xfrm_address_t *daddr,
  64. __be32 spi, u8 proto, unsigned short family)
  65. {
  66. return __xfrm_spi_hash(daddr, spi, proto, family, net->xfrm.state_hmask);
  67. }
  68. static unsigned int xfrm_seq_hash(struct net *net, u32 seq)
  69. {
  70. return __xfrm_seq_hash(seq, net->xfrm.state_hmask);
  71. }
  72. static void xfrm_hash_transfer(struct hlist_head *list,
  73. struct hlist_head *ndsttable,
  74. struct hlist_head *nsrctable,
  75. struct hlist_head *nspitable,
  76. struct hlist_head *nseqtable,
  77. unsigned int nhashmask)
  78. {
  79. struct hlist_node *tmp;
  80. struct xfrm_state *x;
  81. hlist_for_each_entry_safe(x, tmp, list, bydst) {
  82. unsigned int h;
  83. h = __xfrm_dst_hash(&x->id.daddr, &x->props.saddr,
  84. x->props.reqid, x->props.family,
  85. nhashmask);
  86. hlist_add_head_rcu(&x->bydst, ndsttable + h);
  87. h = __xfrm_src_hash(&x->id.daddr, &x->props.saddr,
  88. x->props.family,
  89. nhashmask);
  90. hlist_add_head_rcu(&x->bysrc, nsrctable + h);
  91. if (x->id.spi) {
  92. h = __xfrm_spi_hash(&x->id.daddr, x->id.spi,
  93. x->id.proto, x->props.family,
  94. nhashmask);
  95. hlist_add_head_rcu(&x->byspi, nspitable + h);
  96. }
  97. if (x->km.seq) {
  98. h = __xfrm_seq_hash(x->km.seq, nhashmask);
  99. hlist_add_head_rcu(&x->byseq, nseqtable + h);
  100. }
  101. }
  102. }
  103. static unsigned long xfrm_hash_new_size(unsigned int state_hmask)
  104. {
  105. return ((state_hmask + 1) << 1) * sizeof(struct hlist_head);
  106. }
  107. static void xfrm_hash_resize(struct work_struct *work)
  108. {
  109. struct net *net = container_of(work, struct net, xfrm.state_hash_work);
  110. struct hlist_head *ndst, *nsrc, *nspi, *nseq, *odst, *osrc, *ospi, *oseq;
  111. unsigned long nsize, osize;
  112. unsigned int nhashmask, ohashmask;
  113. int i;
  114. nsize = xfrm_hash_new_size(net->xfrm.state_hmask);
  115. ndst = xfrm_hash_alloc(nsize);
  116. if (!ndst)
  117. return;
  118. nsrc = xfrm_hash_alloc(nsize);
  119. if (!nsrc) {
  120. xfrm_hash_free(ndst, nsize);
  121. return;
  122. }
  123. nspi = xfrm_hash_alloc(nsize);
  124. if (!nspi) {
  125. xfrm_hash_free(ndst, nsize);
  126. xfrm_hash_free(nsrc, nsize);
  127. return;
  128. }
  129. nseq = xfrm_hash_alloc(nsize);
  130. if (!nseq) {
  131. xfrm_hash_free(ndst, nsize);
  132. xfrm_hash_free(nsrc, nsize);
  133. xfrm_hash_free(nspi, nsize);
  134. return;
  135. }
  136. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  137. write_seqcount_begin(&net->xfrm.xfrm_state_hash_generation);
  138. nhashmask = (nsize / sizeof(struct hlist_head)) - 1U;
  139. odst = xfrm_state_deref_prot(net->xfrm.state_bydst, net);
  140. for (i = net->xfrm.state_hmask; i >= 0; i--)
  141. xfrm_hash_transfer(odst + i, ndst, nsrc, nspi, nseq, nhashmask);
  142. osrc = xfrm_state_deref_prot(net->xfrm.state_bysrc, net);
  143. ospi = xfrm_state_deref_prot(net->xfrm.state_byspi, net);
  144. oseq = xfrm_state_deref_prot(net->xfrm.state_byseq, net);
  145. ohashmask = net->xfrm.state_hmask;
  146. rcu_assign_pointer(net->xfrm.state_bydst, ndst);
  147. rcu_assign_pointer(net->xfrm.state_bysrc, nsrc);
  148. rcu_assign_pointer(net->xfrm.state_byspi, nspi);
  149. rcu_assign_pointer(net->xfrm.state_byseq, nseq);
  150. net->xfrm.state_hmask = nhashmask;
  151. write_seqcount_end(&net->xfrm.xfrm_state_hash_generation);
  152. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  153. osize = (ohashmask + 1) * sizeof(struct hlist_head);
  154. synchronize_rcu();
  155. xfrm_hash_free(odst, osize);
  156. xfrm_hash_free(osrc, osize);
  157. xfrm_hash_free(ospi, osize);
  158. xfrm_hash_free(oseq, osize);
  159. }
  160. static DEFINE_SPINLOCK(xfrm_state_afinfo_lock);
  161. static struct xfrm_state_afinfo __rcu *xfrm_state_afinfo[NPROTO];
  162. static DEFINE_SPINLOCK(xfrm_state_gc_lock);
  163. int __xfrm_state_delete(struct xfrm_state *x);
  164. int km_query(struct xfrm_state *x, struct xfrm_tmpl *t, struct xfrm_policy *pol);
  165. static bool km_is_alive(const struct km_event *c);
  166. void km_state_expired(struct xfrm_state *x, int hard, u32 portid);
  167. int xfrm_register_type(const struct xfrm_type *type, unsigned short family)
  168. {
  169. struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
  170. int err = 0;
  171. if (!afinfo)
  172. return -EAFNOSUPPORT;
  173. #define X(afi, T, name) do { \
  174. WARN_ON((afi)->type_ ## name); \
  175. (afi)->type_ ## name = (T); \
  176. } while (0)
  177. switch (type->proto) {
  178. case IPPROTO_COMP:
  179. X(afinfo, type, comp);
  180. break;
  181. case IPPROTO_AH:
  182. X(afinfo, type, ah);
  183. break;
  184. case IPPROTO_ESP:
  185. X(afinfo, type, esp);
  186. break;
  187. case IPPROTO_IPIP:
  188. X(afinfo, type, ipip);
  189. break;
  190. case IPPROTO_DSTOPTS:
  191. X(afinfo, type, dstopts);
  192. break;
  193. case IPPROTO_ROUTING:
  194. X(afinfo, type, routing);
  195. break;
  196. case IPPROTO_IPV6:
  197. X(afinfo, type, ipip6);
  198. break;
  199. default:
  200. WARN_ON(1);
  201. err = -EPROTONOSUPPORT;
  202. break;
  203. }
  204. #undef X
  205. rcu_read_unlock();
  206. return err;
  207. }
  208. EXPORT_SYMBOL(xfrm_register_type);
  209. void xfrm_unregister_type(const struct xfrm_type *type, unsigned short family)
  210. {
  211. struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
  212. if (unlikely(afinfo == NULL))
  213. return;
  214. #define X(afi, T, name) do { \
  215. WARN_ON((afi)->type_ ## name != (T)); \
  216. (afi)->type_ ## name = NULL; \
  217. } while (0)
  218. switch (type->proto) {
  219. case IPPROTO_COMP:
  220. X(afinfo, type, comp);
  221. break;
  222. case IPPROTO_AH:
  223. X(afinfo, type, ah);
  224. break;
  225. case IPPROTO_ESP:
  226. X(afinfo, type, esp);
  227. break;
  228. case IPPROTO_IPIP:
  229. X(afinfo, type, ipip);
  230. break;
  231. case IPPROTO_DSTOPTS:
  232. X(afinfo, type, dstopts);
  233. break;
  234. case IPPROTO_ROUTING:
  235. X(afinfo, type, routing);
  236. break;
  237. case IPPROTO_IPV6:
  238. X(afinfo, type, ipip6);
  239. break;
  240. default:
  241. WARN_ON(1);
  242. break;
  243. }
  244. #undef X
  245. rcu_read_unlock();
  246. }
  247. EXPORT_SYMBOL(xfrm_unregister_type);
  248. static const struct xfrm_type *xfrm_get_type(u8 proto, unsigned short family)
  249. {
  250. const struct xfrm_type *type = NULL;
  251. struct xfrm_state_afinfo *afinfo;
  252. int modload_attempted = 0;
  253. retry:
  254. afinfo = xfrm_state_get_afinfo(family);
  255. if (unlikely(afinfo == NULL))
  256. return NULL;
  257. switch (proto) {
  258. case IPPROTO_COMP:
  259. type = afinfo->type_comp;
  260. break;
  261. case IPPROTO_AH:
  262. type = afinfo->type_ah;
  263. break;
  264. case IPPROTO_ESP:
  265. type = afinfo->type_esp;
  266. break;
  267. case IPPROTO_IPIP:
  268. type = afinfo->type_ipip;
  269. break;
  270. case IPPROTO_DSTOPTS:
  271. type = afinfo->type_dstopts;
  272. break;
  273. case IPPROTO_ROUTING:
  274. type = afinfo->type_routing;
  275. break;
  276. case IPPROTO_IPV6:
  277. type = afinfo->type_ipip6;
  278. break;
  279. default:
  280. break;
  281. }
  282. if (unlikely(type && !try_module_get(type->owner)))
  283. type = NULL;
  284. rcu_read_unlock();
  285. if (!type && !modload_attempted) {
  286. request_module("xfrm-type-%d-%d", family, proto);
  287. modload_attempted = 1;
  288. goto retry;
  289. }
  290. return type;
  291. }
  292. static void xfrm_put_type(const struct xfrm_type *type)
  293. {
  294. module_put(type->owner);
  295. }
  296. int xfrm_register_type_offload(const struct xfrm_type_offload *type,
  297. unsigned short family)
  298. {
  299. struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
  300. int err = 0;
  301. if (unlikely(afinfo == NULL))
  302. return -EAFNOSUPPORT;
  303. switch (type->proto) {
  304. case IPPROTO_ESP:
  305. WARN_ON(afinfo->type_offload_esp);
  306. afinfo->type_offload_esp = type;
  307. break;
  308. default:
  309. WARN_ON(1);
  310. err = -EPROTONOSUPPORT;
  311. break;
  312. }
  313. rcu_read_unlock();
  314. return err;
  315. }
  316. EXPORT_SYMBOL(xfrm_register_type_offload);
  317. void xfrm_unregister_type_offload(const struct xfrm_type_offload *type,
  318. unsigned short family)
  319. {
  320. struct xfrm_state_afinfo *afinfo = xfrm_state_get_afinfo(family);
  321. if (unlikely(afinfo == NULL))
  322. return;
  323. switch (type->proto) {
  324. case IPPROTO_ESP:
  325. WARN_ON(afinfo->type_offload_esp != type);
  326. afinfo->type_offload_esp = NULL;
  327. break;
  328. default:
  329. WARN_ON(1);
  330. break;
  331. }
  332. rcu_read_unlock();
  333. }
  334. EXPORT_SYMBOL(xfrm_unregister_type_offload);
  335. static const struct xfrm_type_offload *
  336. xfrm_get_type_offload(u8 proto, unsigned short family, bool try_load)
  337. {
  338. const struct xfrm_type_offload *type = NULL;
  339. struct xfrm_state_afinfo *afinfo;
  340. retry:
  341. afinfo = xfrm_state_get_afinfo(family);
  342. if (unlikely(afinfo == NULL))
  343. return NULL;
  344. switch (proto) {
  345. case IPPROTO_ESP:
  346. type = afinfo->type_offload_esp;
  347. break;
  348. default:
  349. break;
  350. }
  351. if ((type && !try_module_get(type->owner)))
  352. type = NULL;
  353. rcu_read_unlock();
  354. if (!type && try_load) {
  355. request_module("xfrm-offload-%d-%d", family, proto);
  356. try_load = false;
  357. goto retry;
  358. }
  359. return type;
  360. }
  361. static void xfrm_put_type_offload(const struct xfrm_type_offload *type)
  362. {
  363. module_put(type->owner);
  364. }
  365. static const struct xfrm_mode xfrm4_mode_map[XFRM_MODE_MAX] = {
  366. [XFRM_MODE_BEET] = {
  367. .encap = XFRM_MODE_BEET,
  368. .flags = XFRM_MODE_FLAG_TUNNEL,
  369. .family = AF_INET,
  370. },
  371. [XFRM_MODE_TRANSPORT] = {
  372. .encap = XFRM_MODE_TRANSPORT,
  373. .family = AF_INET,
  374. },
  375. [XFRM_MODE_TUNNEL] = {
  376. .encap = XFRM_MODE_TUNNEL,
  377. .flags = XFRM_MODE_FLAG_TUNNEL,
  378. .family = AF_INET,
  379. },
  380. };
  381. static const struct xfrm_mode xfrm6_mode_map[XFRM_MODE_MAX] = {
  382. [XFRM_MODE_BEET] = {
  383. .encap = XFRM_MODE_BEET,
  384. .flags = XFRM_MODE_FLAG_TUNNEL,
  385. .family = AF_INET6,
  386. },
  387. [XFRM_MODE_ROUTEOPTIMIZATION] = {
  388. .encap = XFRM_MODE_ROUTEOPTIMIZATION,
  389. .family = AF_INET6,
  390. },
  391. [XFRM_MODE_TRANSPORT] = {
  392. .encap = XFRM_MODE_TRANSPORT,
  393. .family = AF_INET6,
  394. },
  395. [XFRM_MODE_TUNNEL] = {
  396. .encap = XFRM_MODE_TUNNEL,
  397. .flags = XFRM_MODE_FLAG_TUNNEL,
  398. .family = AF_INET6,
  399. },
  400. };
  401. static const struct xfrm_mode *xfrm_get_mode(unsigned int encap, int family)
  402. {
  403. const struct xfrm_mode *mode;
  404. if (unlikely(encap >= XFRM_MODE_MAX))
  405. return NULL;
  406. switch (family) {
  407. case AF_INET:
  408. mode = &xfrm4_mode_map[encap];
  409. if (mode->family == family)
  410. return mode;
  411. break;
  412. case AF_INET6:
  413. mode = &xfrm6_mode_map[encap];
  414. if (mode->family == family)
  415. return mode;
  416. break;
  417. default:
  418. break;
  419. }
  420. return NULL;
  421. }
  422. void xfrm_state_free(struct xfrm_state *x)
  423. {
  424. kmem_cache_free(xfrm_state_cache, x);
  425. }
  426. EXPORT_SYMBOL(xfrm_state_free);
  427. static void ___xfrm_state_destroy(struct xfrm_state *x)
  428. {
  429. hrtimer_cancel(&x->mtimer);
  430. del_timer_sync(&x->rtimer);
  431. kfree(x->aead);
  432. kfree(x->aalg);
  433. kfree(x->ealg);
  434. kfree(x->calg);
  435. kfree(x->encap);
  436. kfree(x->coaddr);
  437. kfree(x->replay_esn);
  438. kfree(x->preplay_esn);
  439. if (x->type_offload)
  440. xfrm_put_type_offload(x->type_offload);
  441. if (x->type) {
  442. x->type->destructor(x);
  443. xfrm_put_type(x->type);
  444. }
  445. if (x->xfrag.page)
  446. put_page(x->xfrag.page);
  447. xfrm_dev_state_free(x);
  448. security_xfrm_state_free(x);
  449. xfrm_state_free(x);
  450. }
  451. static void xfrm_state_gc_task(struct work_struct *work)
  452. {
  453. struct xfrm_state *x;
  454. struct hlist_node *tmp;
  455. struct hlist_head gc_list;
  456. spin_lock_bh(&xfrm_state_gc_lock);
  457. hlist_move_list(&xfrm_state_gc_list, &gc_list);
  458. spin_unlock_bh(&xfrm_state_gc_lock);
  459. synchronize_rcu();
  460. hlist_for_each_entry_safe(x, tmp, &gc_list, gclist)
  461. ___xfrm_state_destroy(x);
  462. }
  463. static enum hrtimer_restart xfrm_timer_handler(struct hrtimer *me)
  464. {
  465. struct xfrm_state *x = container_of(me, struct xfrm_state, mtimer);
  466. enum hrtimer_restart ret = HRTIMER_NORESTART;
  467. time64_t now = ktime_get_real_seconds();
  468. time64_t next = TIME64_MAX;
  469. int warn = 0;
  470. int err = 0;
  471. spin_lock(&x->lock);
  472. if (x->km.state == XFRM_STATE_DEAD)
  473. goto out;
  474. if (x->km.state == XFRM_STATE_EXPIRED)
  475. goto expired;
  476. if (x->lft.hard_add_expires_seconds) {
  477. long tmo = x->lft.hard_add_expires_seconds +
  478. x->curlft.add_time - now;
  479. if (tmo <= 0) {
  480. if (x->xflags & XFRM_SOFT_EXPIRE) {
  481. /* enter hard expire without soft expire first?!
  482. * setting a new date could trigger this.
  483. * workaround: fix x->curflt.add_time by below:
  484. */
  485. x->curlft.add_time = now - x->saved_tmo - 1;
  486. tmo = x->lft.hard_add_expires_seconds - x->saved_tmo;
  487. } else
  488. goto expired;
  489. }
  490. if (tmo < next)
  491. next = tmo;
  492. }
  493. if (x->lft.hard_use_expires_seconds) {
  494. long tmo = x->lft.hard_use_expires_seconds +
  495. (READ_ONCE(x->curlft.use_time) ? : now) - now;
  496. if (tmo <= 0)
  497. goto expired;
  498. if (tmo < next)
  499. next = tmo;
  500. }
  501. if (x->km.dying)
  502. goto resched;
  503. if (x->lft.soft_add_expires_seconds) {
  504. long tmo = x->lft.soft_add_expires_seconds +
  505. x->curlft.add_time - now;
  506. if (tmo <= 0) {
  507. warn = 1;
  508. x->xflags &= ~XFRM_SOFT_EXPIRE;
  509. } else if (tmo < next) {
  510. next = tmo;
  511. x->xflags |= XFRM_SOFT_EXPIRE;
  512. x->saved_tmo = tmo;
  513. }
  514. }
  515. if (x->lft.soft_use_expires_seconds) {
  516. long tmo = x->lft.soft_use_expires_seconds +
  517. (READ_ONCE(x->curlft.use_time) ? : now) - now;
  518. if (tmo <= 0)
  519. warn = 1;
  520. else if (tmo < next)
  521. next = tmo;
  522. }
  523. x->km.dying = warn;
  524. if (warn)
  525. km_state_expired(x, 0, 0);
  526. resched:
  527. if (next != TIME64_MAX) {
  528. hrtimer_forward_now(&x->mtimer, ktime_set(next, 0));
  529. ret = HRTIMER_RESTART;
  530. }
  531. goto out;
  532. expired:
  533. if (x->km.state == XFRM_STATE_ACQ && x->id.spi == 0)
  534. x->km.state = XFRM_STATE_EXPIRED;
  535. err = __xfrm_state_delete(x);
  536. if (!err)
  537. km_state_expired(x, 1, 0);
  538. xfrm_audit_state_delete(x, err ? 0 : 1, true);
  539. out:
  540. spin_unlock(&x->lock);
  541. return ret;
  542. }
  543. static void xfrm_replay_timer_handler(struct timer_list *t);
  544. struct xfrm_state *xfrm_state_alloc(struct net *net)
  545. {
  546. struct xfrm_state *x;
  547. x = kmem_cache_zalloc(xfrm_state_cache, GFP_ATOMIC);
  548. if (x) {
  549. write_pnet(&x->xs_net, net);
  550. refcount_set(&x->refcnt, 1);
  551. atomic_set(&x->tunnel_users, 0);
  552. INIT_LIST_HEAD(&x->km.all);
  553. INIT_HLIST_NODE(&x->bydst);
  554. INIT_HLIST_NODE(&x->bysrc);
  555. INIT_HLIST_NODE(&x->byspi);
  556. INIT_HLIST_NODE(&x->byseq);
  557. hrtimer_init(&x->mtimer, CLOCK_BOOTTIME, HRTIMER_MODE_ABS_SOFT);
  558. x->mtimer.function = xfrm_timer_handler;
  559. timer_setup(&x->rtimer, xfrm_replay_timer_handler, 0);
  560. x->curlft.add_time = ktime_get_real_seconds();
  561. x->lft.soft_byte_limit = XFRM_INF;
  562. x->lft.soft_packet_limit = XFRM_INF;
  563. x->lft.hard_byte_limit = XFRM_INF;
  564. x->lft.hard_packet_limit = XFRM_INF;
  565. x->replay_maxage = 0;
  566. x->replay_maxdiff = 0;
  567. spin_lock_init(&x->lock);
  568. }
  569. return x;
  570. }
  571. EXPORT_SYMBOL(xfrm_state_alloc);
  572. void __xfrm_state_destroy(struct xfrm_state *x, bool sync)
  573. {
  574. WARN_ON(x->km.state != XFRM_STATE_DEAD);
  575. if (sync) {
  576. synchronize_rcu();
  577. ___xfrm_state_destroy(x);
  578. } else {
  579. spin_lock_bh(&xfrm_state_gc_lock);
  580. hlist_add_head(&x->gclist, &xfrm_state_gc_list);
  581. spin_unlock_bh(&xfrm_state_gc_lock);
  582. schedule_work(&xfrm_state_gc_work);
  583. }
  584. }
  585. EXPORT_SYMBOL(__xfrm_state_destroy);
  586. int __xfrm_state_delete(struct xfrm_state *x)
  587. {
  588. struct net *net = xs_net(x);
  589. int err = -ESRCH;
  590. if (x->km.state != XFRM_STATE_DEAD) {
  591. x->km.state = XFRM_STATE_DEAD;
  592. spin_lock(&net->xfrm.xfrm_state_lock);
  593. list_del(&x->km.all);
  594. hlist_del_rcu(&x->bydst);
  595. hlist_del_rcu(&x->bysrc);
  596. if (x->km.seq)
  597. hlist_del_rcu(&x->byseq);
  598. if (x->id.spi)
  599. hlist_del_rcu(&x->byspi);
  600. net->xfrm.state_num--;
  601. spin_unlock(&net->xfrm.xfrm_state_lock);
  602. if (x->encap_sk)
  603. sock_put(rcu_dereference_raw(x->encap_sk));
  604. xfrm_dev_state_delete(x);
  605. /* All xfrm_state objects are created by xfrm_state_alloc.
  606. * The xfrm_state_alloc call gives a reference, and that
  607. * is what we are dropping here.
  608. */
  609. xfrm_state_put(x);
  610. err = 0;
  611. }
  612. return err;
  613. }
  614. EXPORT_SYMBOL(__xfrm_state_delete);
  615. int xfrm_state_delete(struct xfrm_state *x)
  616. {
  617. int err;
  618. spin_lock_bh(&x->lock);
  619. err = __xfrm_state_delete(x);
  620. spin_unlock_bh(&x->lock);
  621. return err;
  622. }
  623. EXPORT_SYMBOL(xfrm_state_delete);
  624. #ifdef CONFIG_SECURITY_NETWORK_XFRM
  625. static inline int
  626. xfrm_state_flush_secctx_check(struct net *net, u8 proto, bool task_valid)
  627. {
  628. int i, err = 0;
  629. for (i = 0; i <= net->xfrm.state_hmask; i++) {
  630. struct xfrm_state *x;
  631. hlist_for_each_entry(x, net->xfrm.state_bydst+i, bydst) {
  632. if (xfrm_id_proto_match(x->id.proto, proto) &&
  633. (err = security_xfrm_state_delete(x)) != 0) {
  634. xfrm_audit_state_delete(x, 0, task_valid);
  635. return err;
  636. }
  637. }
  638. }
  639. return err;
  640. }
  641. static inline int
  642. xfrm_dev_state_flush_secctx_check(struct net *net, struct net_device *dev, bool task_valid)
  643. {
  644. int i, err = 0;
  645. for (i = 0; i <= net->xfrm.state_hmask; i++) {
  646. struct xfrm_state *x;
  647. struct xfrm_dev_offload *xso;
  648. hlist_for_each_entry(x, net->xfrm.state_bydst+i, bydst) {
  649. xso = &x->xso;
  650. if (xso->dev == dev &&
  651. (err = security_xfrm_state_delete(x)) != 0) {
  652. xfrm_audit_state_delete(x, 0, task_valid);
  653. return err;
  654. }
  655. }
  656. }
  657. return err;
  658. }
  659. #else
  660. static inline int
  661. xfrm_state_flush_secctx_check(struct net *net, u8 proto, bool task_valid)
  662. {
  663. return 0;
  664. }
  665. static inline int
  666. xfrm_dev_state_flush_secctx_check(struct net *net, struct net_device *dev, bool task_valid)
  667. {
  668. return 0;
  669. }
  670. #endif
  671. int xfrm_state_flush(struct net *net, u8 proto, bool task_valid, bool sync)
  672. {
  673. int i, err = 0, cnt = 0;
  674. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  675. err = xfrm_state_flush_secctx_check(net, proto, task_valid);
  676. if (err)
  677. goto out;
  678. err = -ESRCH;
  679. for (i = 0; i <= net->xfrm.state_hmask; i++) {
  680. struct xfrm_state *x;
  681. restart:
  682. hlist_for_each_entry(x, net->xfrm.state_bydst+i, bydst) {
  683. if (!xfrm_state_kern(x) &&
  684. xfrm_id_proto_match(x->id.proto, proto)) {
  685. xfrm_state_hold(x);
  686. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  687. err = xfrm_state_delete(x);
  688. xfrm_audit_state_delete(x, err ? 0 : 1,
  689. task_valid);
  690. if (sync)
  691. xfrm_state_put_sync(x);
  692. else
  693. xfrm_state_put(x);
  694. if (!err)
  695. cnt++;
  696. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  697. goto restart;
  698. }
  699. }
  700. }
  701. out:
  702. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  703. if (cnt)
  704. err = 0;
  705. return err;
  706. }
  707. EXPORT_SYMBOL(xfrm_state_flush);
  708. int xfrm_dev_state_flush(struct net *net, struct net_device *dev, bool task_valid)
  709. {
  710. int i, err = 0, cnt = 0;
  711. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  712. err = xfrm_dev_state_flush_secctx_check(net, dev, task_valid);
  713. if (err)
  714. goto out;
  715. err = -ESRCH;
  716. for (i = 0; i <= net->xfrm.state_hmask; i++) {
  717. struct xfrm_state *x;
  718. struct xfrm_dev_offload *xso;
  719. restart:
  720. hlist_for_each_entry(x, net->xfrm.state_bydst+i, bydst) {
  721. xso = &x->xso;
  722. if (!xfrm_state_kern(x) && xso->dev == dev) {
  723. xfrm_state_hold(x);
  724. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  725. err = xfrm_state_delete(x);
  726. xfrm_audit_state_delete(x, err ? 0 : 1,
  727. task_valid);
  728. xfrm_state_put(x);
  729. if (!err)
  730. cnt++;
  731. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  732. goto restart;
  733. }
  734. }
  735. }
  736. if (cnt)
  737. err = 0;
  738. out:
  739. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  740. return err;
  741. }
  742. EXPORT_SYMBOL(xfrm_dev_state_flush);
  743. void xfrm_sad_getinfo(struct net *net, struct xfrmk_sadinfo *si)
  744. {
  745. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  746. si->sadcnt = net->xfrm.state_num;
  747. si->sadhcnt = net->xfrm.state_hmask + 1;
  748. si->sadhmcnt = xfrm_state_hashmax;
  749. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  750. }
  751. EXPORT_SYMBOL(xfrm_sad_getinfo);
  752. static void
  753. __xfrm4_init_tempsel(struct xfrm_selector *sel, const struct flowi *fl)
  754. {
  755. const struct flowi4 *fl4 = &fl->u.ip4;
  756. sel->daddr.a4 = fl4->daddr;
  757. sel->saddr.a4 = fl4->saddr;
  758. sel->dport = xfrm_flowi_dport(fl, &fl4->uli);
  759. sel->dport_mask = htons(0xffff);
  760. sel->sport = xfrm_flowi_sport(fl, &fl4->uli);
  761. sel->sport_mask = htons(0xffff);
  762. sel->family = AF_INET;
  763. sel->prefixlen_d = 32;
  764. sel->prefixlen_s = 32;
  765. sel->proto = fl4->flowi4_proto;
  766. sel->ifindex = fl4->flowi4_oif;
  767. }
  768. static void
  769. __xfrm6_init_tempsel(struct xfrm_selector *sel, const struct flowi *fl)
  770. {
  771. const struct flowi6 *fl6 = &fl->u.ip6;
  772. /* Initialize temporary selector matching only to current session. */
  773. *(struct in6_addr *)&sel->daddr = fl6->daddr;
  774. *(struct in6_addr *)&sel->saddr = fl6->saddr;
  775. sel->dport = xfrm_flowi_dport(fl, &fl6->uli);
  776. sel->dport_mask = htons(0xffff);
  777. sel->sport = xfrm_flowi_sport(fl, &fl6->uli);
  778. sel->sport_mask = htons(0xffff);
  779. sel->family = AF_INET6;
  780. sel->prefixlen_d = 128;
  781. sel->prefixlen_s = 128;
  782. sel->proto = fl6->flowi6_proto;
  783. sel->ifindex = fl6->flowi6_oif;
  784. }
  785. static void
  786. xfrm_init_tempstate(struct xfrm_state *x, const struct flowi *fl,
  787. const struct xfrm_tmpl *tmpl,
  788. const xfrm_address_t *daddr, const xfrm_address_t *saddr,
  789. unsigned short family)
  790. {
  791. switch (family) {
  792. case AF_INET:
  793. __xfrm4_init_tempsel(&x->sel, fl);
  794. break;
  795. case AF_INET6:
  796. __xfrm6_init_tempsel(&x->sel, fl);
  797. break;
  798. }
  799. x->id = tmpl->id;
  800. switch (tmpl->encap_family) {
  801. case AF_INET:
  802. if (x->id.daddr.a4 == 0)
  803. x->id.daddr.a4 = daddr->a4;
  804. x->props.saddr = tmpl->saddr;
  805. if (x->props.saddr.a4 == 0)
  806. x->props.saddr.a4 = saddr->a4;
  807. break;
  808. case AF_INET6:
  809. if (ipv6_addr_any((struct in6_addr *)&x->id.daddr))
  810. memcpy(&x->id.daddr, daddr, sizeof(x->sel.daddr));
  811. memcpy(&x->props.saddr, &tmpl->saddr, sizeof(x->props.saddr));
  812. if (ipv6_addr_any((struct in6_addr *)&x->props.saddr))
  813. memcpy(&x->props.saddr, saddr, sizeof(x->props.saddr));
  814. break;
  815. }
  816. x->props.mode = tmpl->mode;
  817. x->props.reqid = tmpl->reqid;
  818. x->props.family = tmpl->encap_family;
  819. }
  820. static struct xfrm_state *__xfrm_state_lookup(struct net *net, u32 mark,
  821. const xfrm_address_t *daddr,
  822. __be32 spi, u8 proto,
  823. unsigned short family)
  824. {
  825. unsigned int h = xfrm_spi_hash(net, daddr, spi, proto, family);
  826. struct xfrm_state *x;
  827. hlist_for_each_entry_rcu(x, net->xfrm.state_byspi + h, byspi) {
  828. if (x->props.family != family ||
  829. x->id.spi != spi ||
  830. x->id.proto != proto ||
  831. !xfrm_addr_equal(&x->id.daddr, daddr, family))
  832. continue;
  833. if ((mark & x->mark.m) != x->mark.v)
  834. continue;
  835. if (!xfrm_state_hold_rcu(x))
  836. continue;
  837. return x;
  838. }
  839. return NULL;
  840. }
  841. static struct xfrm_state *__xfrm_state_lookup_byaddr(struct net *net, u32 mark,
  842. const xfrm_address_t *daddr,
  843. const xfrm_address_t *saddr,
  844. u8 proto, unsigned short family)
  845. {
  846. unsigned int h = xfrm_src_hash(net, daddr, saddr, family);
  847. struct xfrm_state *x;
  848. hlist_for_each_entry_rcu(x, net->xfrm.state_bysrc + h, bysrc) {
  849. if (x->props.family != family ||
  850. x->id.proto != proto ||
  851. !xfrm_addr_equal(&x->id.daddr, daddr, family) ||
  852. !xfrm_addr_equal(&x->props.saddr, saddr, family))
  853. continue;
  854. if ((mark & x->mark.m) != x->mark.v)
  855. continue;
  856. if (!xfrm_state_hold_rcu(x))
  857. continue;
  858. return x;
  859. }
  860. return NULL;
  861. }
  862. static inline struct xfrm_state *
  863. __xfrm_state_locate(struct xfrm_state *x, int use_spi, int family)
  864. {
  865. struct net *net = xs_net(x);
  866. u32 mark = x->mark.v & x->mark.m;
  867. if (use_spi)
  868. return __xfrm_state_lookup(net, mark, &x->id.daddr,
  869. x->id.spi, x->id.proto, family);
  870. else
  871. return __xfrm_state_lookup_byaddr(net, mark,
  872. &x->id.daddr,
  873. &x->props.saddr,
  874. x->id.proto, family);
  875. }
  876. static void xfrm_hash_grow_check(struct net *net, int have_hash_collision)
  877. {
  878. if (have_hash_collision &&
  879. (net->xfrm.state_hmask + 1) < xfrm_state_hashmax &&
  880. net->xfrm.state_num > net->xfrm.state_hmask)
  881. schedule_work(&net->xfrm.state_hash_work);
  882. }
  883. static void xfrm_state_look_at(struct xfrm_policy *pol, struct xfrm_state *x,
  884. const struct flowi *fl, unsigned short family,
  885. struct xfrm_state **best, int *acq_in_progress,
  886. int *error)
  887. {
  888. /* Resolution logic:
  889. * 1. There is a valid state with matching selector. Done.
  890. * 2. Valid state with inappropriate selector. Skip.
  891. *
  892. * Entering area of "sysdeps".
  893. *
  894. * 3. If state is not valid, selector is temporary, it selects
  895. * only session which triggered previous resolution. Key
  896. * manager will do something to install a state with proper
  897. * selector.
  898. */
  899. if (x->km.state == XFRM_STATE_VALID) {
  900. if ((x->sel.family &&
  901. (x->sel.family != family ||
  902. !xfrm_selector_match(&x->sel, fl, family))) ||
  903. !security_xfrm_state_pol_flow_match(x, pol,
  904. &fl->u.__fl_common))
  905. return;
  906. if (!*best ||
  907. (*best)->km.dying > x->km.dying ||
  908. ((*best)->km.dying == x->km.dying &&
  909. (*best)->curlft.add_time < x->curlft.add_time))
  910. *best = x;
  911. } else if (x->km.state == XFRM_STATE_ACQ) {
  912. *acq_in_progress = 1;
  913. } else if (x->km.state == XFRM_STATE_ERROR ||
  914. x->km.state == XFRM_STATE_EXPIRED) {
  915. if ((!x->sel.family ||
  916. (x->sel.family == family &&
  917. xfrm_selector_match(&x->sel, fl, family))) &&
  918. security_xfrm_state_pol_flow_match(x, pol,
  919. &fl->u.__fl_common))
  920. *error = -ESRCH;
  921. }
  922. }
  923. struct xfrm_state *
  924. xfrm_state_find(const xfrm_address_t *daddr, const xfrm_address_t *saddr,
  925. const struct flowi *fl, struct xfrm_tmpl *tmpl,
  926. struct xfrm_policy *pol, int *err,
  927. unsigned short family, u32 if_id)
  928. {
  929. static xfrm_address_t saddr_wildcard = { };
  930. struct net *net = xp_net(pol);
  931. unsigned int h, h_wildcard;
  932. struct xfrm_state *x, *x0, *to_put;
  933. int acquire_in_progress = 0;
  934. int error = 0;
  935. struct xfrm_state *best = NULL;
  936. u32 mark = pol->mark.v & pol->mark.m;
  937. unsigned short encap_family = tmpl->encap_family;
  938. unsigned int sequence;
  939. struct km_event c;
  940. to_put = NULL;
  941. sequence = read_seqcount_begin(&net->xfrm.xfrm_state_hash_generation);
  942. rcu_read_lock();
  943. h = xfrm_dst_hash(net, daddr, saddr, tmpl->reqid, encap_family);
  944. hlist_for_each_entry_rcu(x, net->xfrm.state_bydst + h, bydst) {
  945. if (x->props.family == encap_family &&
  946. x->props.reqid == tmpl->reqid &&
  947. (mark & x->mark.m) == x->mark.v &&
  948. x->if_id == if_id &&
  949. !(x->props.flags & XFRM_STATE_WILDRECV) &&
  950. xfrm_state_addr_check(x, daddr, saddr, encap_family) &&
  951. tmpl->mode == x->props.mode &&
  952. tmpl->id.proto == x->id.proto &&
  953. (tmpl->id.spi == x->id.spi || !tmpl->id.spi))
  954. xfrm_state_look_at(pol, x, fl, family,
  955. &best, &acquire_in_progress, &error);
  956. }
  957. if (best || acquire_in_progress)
  958. goto found;
  959. h_wildcard = xfrm_dst_hash(net, daddr, &saddr_wildcard, tmpl->reqid, encap_family);
  960. hlist_for_each_entry_rcu(x, net->xfrm.state_bydst + h_wildcard, bydst) {
  961. if (x->props.family == encap_family &&
  962. x->props.reqid == tmpl->reqid &&
  963. (mark & x->mark.m) == x->mark.v &&
  964. x->if_id == if_id &&
  965. !(x->props.flags & XFRM_STATE_WILDRECV) &&
  966. xfrm_addr_equal(&x->id.daddr, daddr, encap_family) &&
  967. tmpl->mode == x->props.mode &&
  968. tmpl->id.proto == x->id.proto &&
  969. (tmpl->id.spi == x->id.spi || !tmpl->id.spi))
  970. xfrm_state_look_at(pol, x, fl, family,
  971. &best, &acquire_in_progress, &error);
  972. }
  973. found:
  974. x = best;
  975. if (!x && !error && !acquire_in_progress) {
  976. if (tmpl->id.spi &&
  977. (x0 = __xfrm_state_lookup(net, mark, daddr, tmpl->id.spi,
  978. tmpl->id.proto, encap_family)) != NULL) {
  979. to_put = x0;
  980. error = -EEXIST;
  981. goto out;
  982. }
  983. c.net = net;
  984. /* If the KMs have no listeners (yet...), avoid allocating an SA
  985. * for each and every packet - garbage collection might not
  986. * handle the flood.
  987. */
  988. if (!km_is_alive(&c)) {
  989. error = -ESRCH;
  990. goto out;
  991. }
  992. x = xfrm_state_alloc(net);
  993. if (x == NULL) {
  994. error = -ENOMEM;
  995. goto out;
  996. }
  997. /* Initialize temporary state matching only
  998. * to current session. */
  999. xfrm_init_tempstate(x, fl, tmpl, daddr, saddr, family);
  1000. memcpy(&x->mark, &pol->mark, sizeof(x->mark));
  1001. x->if_id = if_id;
  1002. error = security_xfrm_state_alloc_acquire(x, pol->security, fl->flowi_secid);
  1003. if (error) {
  1004. x->km.state = XFRM_STATE_DEAD;
  1005. to_put = x;
  1006. x = NULL;
  1007. goto out;
  1008. }
  1009. if (km_query(x, tmpl, pol) == 0) {
  1010. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1011. x->km.state = XFRM_STATE_ACQ;
  1012. list_add(&x->km.all, &net->xfrm.state_all);
  1013. hlist_add_head_rcu(&x->bydst, net->xfrm.state_bydst + h);
  1014. h = xfrm_src_hash(net, daddr, saddr, encap_family);
  1015. hlist_add_head_rcu(&x->bysrc, net->xfrm.state_bysrc + h);
  1016. if (x->id.spi) {
  1017. h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto, encap_family);
  1018. hlist_add_head_rcu(&x->byspi, net->xfrm.state_byspi + h);
  1019. }
  1020. if (x->km.seq) {
  1021. h = xfrm_seq_hash(net, x->km.seq);
  1022. hlist_add_head_rcu(&x->byseq, net->xfrm.state_byseq + h);
  1023. }
  1024. x->lft.hard_add_expires_seconds = net->xfrm.sysctl_acq_expires;
  1025. hrtimer_start(&x->mtimer,
  1026. ktime_set(net->xfrm.sysctl_acq_expires, 0),
  1027. HRTIMER_MODE_REL_SOFT);
  1028. net->xfrm.state_num++;
  1029. xfrm_hash_grow_check(net, x->bydst.next != NULL);
  1030. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1031. } else {
  1032. x->km.state = XFRM_STATE_DEAD;
  1033. to_put = x;
  1034. x = NULL;
  1035. error = -ESRCH;
  1036. }
  1037. }
  1038. out:
  1039. if (x) {
  1040. if (!xfrm_state_hold_rcu(x)) {
  1041. *err = -EAGAIN;
  1042. x = NULL;
  1043. }
  1044. } else {
  1045. *err = acquire_in_progress ? -EAGAIN : error;
  1046. }
  1047. rcu_read_unlock();
  1048. if (to_put)
  1049. xfrm_state_put(to_put);
  1050. if (read_seqcount_retry(&net->xfrm.xfrm_state_hash_generation, sequence)) {
  1051. *err = -EAGAIN;
  1052. if (x) {
  1053. xfrm_state_put(x);
  1054. x = NULL;
  1055. }
  1056. }
  1057. return x;
  1058. }
  1059. struct xfrm_state *
  1060. xfrm_stateonly_find(struct net *net, u32 mark, u32 if_id,
  1061. xfrm_address_t *daddr, xfrm_address_t *saddr,
  1062. unsigned short family, u8 mode, u8 proto, u32 reqid)
  1063. {
  1064. unsigned int h;
  1065. struct xfrm_state *rx = NULL, *x = NULL;
  1066. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1067. h = xfrm_dst_hash(net, daddr, saddr, reqid, family);
  1068. hlist_for_each_entry(x, net->xfrm.state_bydst+h, bydst) {
  1069. if (x->props.family == family &&
  1070. x->props.reqid == reqid &&
  1071. (mark & x->mark.m) == x->mark.v &&
  1072. x->if_id == if_id &&
  1073. !(x->props.flags & XFRM_STATE_WILDRECV) &&
  1074. xfrm_state_addr_check(x, daddr, saddr, family) &&
  1075. mode == x->props.mode &&
  1076. proto == x->id.proto &&
  1077. x->km.state == XFRM_STATE_VALID) {
  1078. rx = x;
  1079. break;
  1080. }
  1081. }
  1082. if (rx)
  1083. xfrm_state_hold(rx);
  1084. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1085. return rx;
  1086. }
  1087. EXPORT_SYMBOL(xfrm_stateonly_find);
  1088. struct xfrm_state *xfrm_state_lookup_byspi(struct net *net, __be32 spi,
  1089. unsigned short family)
  1090. {
  1091. struct xfrm_state *x;
  1092. struct xfrm_state_walk *w;
  1093. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1094. list_for_each_entry(w, &net->xfrm.state_all, all) {
  1095. x = container_of(w, struct xfrm_state, km);
  1096. if (x->props.family != family ||
  1097. x->id.spi != spi)
  1098. continue;
  1099. xfrm_state_hold(x);
  1100. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1101. return x;
  1102. }
  1103. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1104. return NULL;
  1105. }
  1106. EXPORT_SYMBOL(xfrm_state_lookup_byspi);
  1107. static void __xfrm_state_insert(struct xfrm_state *x)
  1108. {
  1109. struct net *net = xs_net(x);
  1110. unsigned int h;
  1111. list_add(&x->km.all, &net->xfrm.state_all);
  1112. h = xfrm_dst_hash(net, &x->id.daddr, &x->props.saddr,
  1113. x->props.reqid, x->props.family);
  1114. hlist_add_head_rcu(&x->bydst, net->xfrm.state_bydst + h);
  1115. h = xfrm_src_hash(net, &x->id.daddr, &x->props.saddr, x->props.family);
  1116. hlist_add_head_rcu(&x->bysrc, net->xfrm.state_bysrc + h);
  1117. if (x->id.spi) {
  1118. h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto,
  1119. x->props.family);
  1120. hlist_add_head_rcu(&x->byspi, net->xfrm.state_byspi + h);
  1121. }
  1122. if (x->km.seq) {
  1123. h = xfrm_seq_hash(net, x->km.seq);
  1124. hlist_add_head_rcu(&x->byseq, net->xfrm.state_byseq + h);
  1125. }
  1126. hrtimer_start(&x->mtimer, ktime_set(1, 0), HRTIMER_MODE_REL_SOFT);
  1127. if (x->replay_maxage)
  1128. mod_timer(&x->rtimer, jiffies + x->replay_maxage);
  1129. net->xfrm.state_num++;
  1130. xfrm_hash_grow_check(net, x->bydst.next != NULL);
  1131. }
  1132. /* net->xfrm.xfrm_state_lock is held */
  1133. static void __xfrm_state_bump_genids(struct xfrm_state *xnew)
  1134. {
  1135. struct net *net = xs_net(xnew);
  1136. unsigned short family = xnew->props.family;
  1137. u32 reqid = xnew->props.reqid;
  1138. struct xfrm_state *x;
  1139. unsigned int h;
  1140. u32 mark = xnew->mark.v & xnew->mark.m;
  1141. u32 if_id = xnew->if_id;
  1142. h = xfrm_dst_hash(net, &xnew->id.daddr, &xnew->props.saddr, reqid, family);
  1143. hlist_for_each_entry(x, net->xfrm.state_bydst+h, bydst) {
  1144. if (x->props.family == family &&
  1145. x->props.reqid == reqid &&
  1146. x->if_id == if_id &&
  1147. (mark & x->mark.m) == x->mark.v &&
  1148. xfrm_addr_equal(&x->id.daddr, &xnew->id.daddr, family) &&
  1149. xfrm_addr_equal(&x->props.saddr, &xnew->props.saddr, family))
  1150. x->genid++;
  1151. }
  1152. }
  1153. void xfrm_state_insert(struct xfrm_state *x)
  1154. {
  1155. struct net *net = xs_net(x);
  1156. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1157. __xfrm_state_bump_genids(x);
  1158. __xfrm_state_insert(x);
  1159. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1160. }
  1161. EXPORT_SYMBOL(xfrm_state_insert);
  1162. /* net->xfrm.xfrm_state_lock is held */
  1163. static struct xfrm_state *__find_acq_core(struct net *net,
  1164. const struct xfrm_mark *m,
  1165. unsigned short family, u8 mode,
  1166. u32 reqid, u32 if_id, u8 proto,
  1167. const xfrm_address_t *daddr,
  1168. const xfrm_address_t *saddr,
  1169. int create)
  1170. {
  1171. unsigned int h = xfrm_dst_hash(net, daddr, saddr, reqid, family);
  1172. struct xfrm_state *x;
  1173. u32 mark = m->v & m->m;
  1174. hlist_for_each_entry(x, net->xfrm.state_bydst+h, bydst) {
  1175. if (x->props.reqid != reqid ||
  1176. x->props.mode != mode ||
  1177. x->props.family != family ||
  1178. x->km.state != XFRM_STATE_ACQ ||
  1179. x->id.spi != 0 ||
  1180. x->id.proto != proto ||
  1181. (mark & x->mark.m) != x->mark.v ||
  1182. !xfrm_addr_equal(&x->id.daddr, daddr, family) ||
  1183. !xfrm_addr_equal(&x->props.saddr, saddr, family))
  1184. continue;
  1185. xfrm_state_hold(x);
  1186. return x;
  1187. }
  1188. if (!create)
  1189. return NULL;
  1190. x = xfrm_state_alloc(net);
  1191. if (likely(x)) {
  1192. switch (family) {
  1193. case AF_INET:
  1194. x->sel.daddr.a4 = daddr->a4;
  1195. x->sel.saddr.a4 = saddr->a4;
  1196. x->sel.prefixlen_d = 32;
  1197. x->sel.prefixlen_s = 32;
  1198. x->props.saddr.a4 = saddr->a4;
  1199. x->id.daddr.a4 = daddr->a4;
  1200. break;
  1201. case AF_INET6:
  1202. x->sel.daddr.in6 = daddr->in6;
  1203. x->sel.saddr.in6 = saddr->in6;
  1204. x->sel.prefixlen_d = 128;
  1205. x->sel.prefixlen_s = 128;
  1206. x->props.saddr.in6 = saddr->in6;
  1207. x->id.daddr.in6 = daddr->in6;
  1208. break;
  1209. }
  1210. x->km.state = XFRM_STATE_ACQ;
  1211. x->id.proto = proto;
  1212. x->props.family = family;
  1213. x->props.mode = mode;
  1214. x->props.reqid = reqid;
  1215. x->if_id = if_id;
  1216. x->mark.v = m->v;
  1217. x->mark.m = m->m;
  1218. x->lft.hard_add_expires_seconds = net->xfrm.sysctl_acq_expires;
  1219. xfrm_state_hold(x);
  1220. hrtimer_start(&x->mtimer,
  1221. ktime_set(net->xfrm.sysctl_acq_expires, 0),
  1222. HRTIMER_MODE_REL_SOFT);
  1223. list_add(&x->km.all, &net->xfrm.state_all);
  1224. hlist_add_head_rcu(&x->bydst, net->xfrm.state_bydst + h);
  1225. h = xfrm_src_hash(net, daddr, saddr, family);
  1226. hlist_add_head_rcu(&x->bysrc, net->xfrm.state_bysrc + h);
  1227. net->xfrm.state_num++;
  1228. xfrm_hash_grow_check(net, x->bydst.next != NULL);
  1229. }
  1230. return x;
  1231. }
  1232. static struct xfrm_state *__xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq);
  1233. int xfrm_state_add(struct xfrm_state *x)
  1234. {
  1235. struct net *net = xs_net(x);
  1236. struct xfrm_state *x1, *to_put;
  1237. int family;
  1238. int err;
  1239. u32 mark = x->mark.v & x->mark.m;
  1240. int use_spi = xfrm_id_proto_match(x->id.proto, IPSEC_PROTO_ANY);
  1241. family = x->props.family;
  1242. to_put = NULL;
  1243. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1244. x1 = __xfrm_state_locate(x, use_spi, family);
  1245. if (x1) {
  1246. to_put = x1;
  1247. x1 = NULL;
  1248. err = -EEXIST;
  1249. goto out;
  1250. }
  1251. if (use_spi && x->km.seq) {
  1252. x1 = __xfrm_find_acq_byseq(net, mark, x->km.seq);
  1253. if (x1 && ((x1->id.proto != x->id.proto) ||
  1254. !xfrm_addr_equal(&x1->id.daddr, &x->id.daddr, family))) {
  1255. to_put = x1;
  1256. x1 = NULL;
  1257. }
  1258. }
  1259. if (use_spi && !x1)
  1260. x1 = __find_acq_core(net, &x->mark, family, x->props.mode,
  1261. x->props.reqid, x->if_id, x->id.proto,
  1262. &x->id.daddr, &x->props.saddr, 0);
  1263. __xfrm_state_bump_genids(x);
  1264. __xfrm_state_insert(x);
  1265. err = 0;
  1266. out:
  1267. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1268. if (x1) {
  1269. xfrm_state_delete(x1);
  1270. xfrm_state_put(x1);
  1271. }
  1272. if (to_put)
  1273. xfrm_state_put(to_put);
  1274. return err;
  1275. }
  1276. EXPORT_SYMBOL(xfrm_state_add);
  1277. #ifdef CONFIG_XFRM_MIGRATE
  1278. static inline int clone_security(struct xfrm_state *x, struct xfrm_sec_ctx *security)
  1279. {
  1280. struct xfrm_user_sec_ctx *uctx;
  1281. int size = sizeof(*uctx) + security->ctx_len;
  1282. int err;
  1283. uctx = kmalloc(size, GFP_KERNEL);
  1284. if (!uctx)
  1285. return -ENOMEM;
  1286. uctx->exttype = XFRMA_SEC_CTX;
  1287. uctx->len = size;
  1288. uctx->ctx_doi = security->ctx_doi;
  1289. uctx->ctx_alg = security->ctx_alg;
  1290. uctx->ctx_len = security->ctx_len;
  1291. memcpy(uctx + 1, security->ctx_str, security->ctx_len);
  1292. err = security_xfrm_state_alloc(x, uctx);
  1293. kfree(uctx);
  1294. if (err)
  1295. return err;
  1296. return 0;
  1297. }
  1298. static struct xfrm_state *xfrm_state_clone(struct xfrm_state *orig,
  1299. struct xfrm_encap_tmpl *encap)
  1300. {
  1301. struct net *net = xs_net(orig);
  1302. struct xfrm_state *x = xfrm_state_alloc(net);
  1303. if (!x)
  1304. goto out;
  1305. memcpy(&x->id, &orig->id, sizeof(x->id));
  1306. memcpy(&x->sel, &orig->sel, sizeof(x->sel));
  1307. memcpy(&x->lft, &orig->lft, sizeof(x->lft));
  1308. x->props.mode = orig->props.mode;
  1309. x->props.replay_window = orig->props.replay_window;
  1310. x->props.reqid = orig->props.reqid;
  1311. x->props.family = orig->props.family;
  1312. x->props.saddr = orig->props.saddr;
  1313. if (orig->aalg) {
  1314. x->aalg = xfrm_algo_auth_clone(orig->aalg);
  1315. if (!x->aalg)
  1316. goto error;
  1317. }
  1318. x->props.aalgo = orig->props.aalgo;
  1319. if (orig->aead) {
  1320. x->aead = xfrm_algo_aead_clone(orig->aead);
  1321. x->geniv = orig->geniv;
  1322. if (!x->aead)
  1323. goto error;
  1324. }
  1325. if (orig->ealg) {
  1326. x->ealg = xfrm_algo_clone(orig->ealg);
  1327. if (!x->ealg)
  1328. goto error;
  1329. }
  1330. x->props.ealgo = orig->props.ealgo;
  1331. if (orig->calg) {
  1332. x->calg = xfrm_algo_clone(orig->calg);
  1333. if (!x->calg)
  1334. goto error;
  1335. }
  1336. x->props.calgo = orig->props.calgo;
  1337. if (encap || orig->encap) {
  1338. if (encap)
  1339. x->encap = kmemdup(encap, sizeof(*x->encap),
  1340. GFP_KERNEL);
  1341. else
  1342. x->encap = kmemdup(orig->encap, sizeof(*x->encap),
  1343. GFP_KERNEL);
  1344. if (!x->encap)
  1345. goto error;
  1346. }
  1347. if (orig->security)
  1348. if (clone_security(x, orig->security))
  1349. goto error;
  1350. if (orig->coaddr) {
  1351. x->coaddr = kmemdup(orig->coaddr, sizeof(*x->coaddr),
  1352. GFP_KERNEL);
  1353. if (!x->coaddr)
  1354. goto error;
  1355. }
  1356. if (orig->replay_esn) {
  1357. if (xfrm_replay_clone(x, orig))
  1358. goto error;
  1359. }
  1360. memcpy(&x->mark, &orig->mark, sizeof(x->mark));
  1361. memcpy(&x->props.smark, &orig->props.smark, sizeof(x->props.smark));
  1362. x->props.flags = orig->props.flags;
  1363. x->props.extra_flags = orig->props.extra_flags;
  1364. x->if_id = orig->if_id;
  1365. x->tfcpad = orig->tfcpad;
  1366. x->replay_maxdiff = orig->replay_maxdiff;
  1367. x->replay_maxage = orig->replay_maxage;
  1368. memcpy(&x->curlft, &orig->curlft, sizeof(x->curlft));
  1369. x->km.state = orig->km.state;
  1370. x->km.seq = orig->km.seq;
  1371. x->replay = orig->replay;
  1372. x->preplay = orig->preplay;
  1373. x->mapping_maxage = orig->mapping_maxage;
  1374. x->lastused = orig->lastused;
  1375. x->new_mapping = 0;
  1376. x->new_mapping_sport = 0;
  1377. return x;
  1378. error:
  1379. xfrm_state_put(x);
  1380. out:
  1381. return NULL;
  1382. }
  1383. struct xfrm_state *xfrm_migrate_state_find(struct xfrm_migrate *m, struct net *net,
  1384. u32 if_id)
  1385. {
  1386. unsigned int h;
  1387. struct xfrm_state *x = NULL;
  1388. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1389. if (m->reqid) {
  1390. h = xfrm_dst_hash(net, &m->old_daddr, &m->old_saddr,
  1391. m->reqid, m->old_family);
  1392. hlist_for_each_entry(x, net->xfrm.state_bydst+h, bydst) {
  1393. if (x->props.mode != m->mode ||
  1394. x->id.proto != m->proto)
  1395. continue;
  1396. if (m->reqid && x->props.reqid != m->reqid)
  1397. continue;
  1398. if (if_id != 0 && x->if_id != if_id)
  1399. continue;
  1400. if (!xfrm_addr_equal(&x->id.daddr, &m->old_daddr,
  1401. m->old_family) ||
  1402. !xfrm_addr_equal(&x->props.saddr, &m->old_saddr,
  1403. m->old_family))
  1404. continue;
  1405. xfrm_state_hold(x);
  1406. break;
  1407. }
  1408. } else {
  1409. h = xfrm_src_hash(net, &m->old_daddr, &m->old_saddr,
  1410. m->old_family);
  1411. hlist_for_each_entry(x, net->xfrm.state_bysrc+h, bysrc) {
  1412. if (x->props.mode != m->mode ||
  1413. x->id.proto != m->proto)
  1414. continue;
  1415. if (if_id != 0 && x->if_id != if_id)
  1416. continue;
  1417. if (!xfrm_addr_equal(&x->id.daddr, &m->old_daddr,
  1418. m->old_family) ||
  1419. !xfrm_addr_equal(&x->props.saddr, &m->old_saddr,
  1420. m->old_family))
  1421. continue;
  1422. xfrm_state_hold(x);
  1423. break;
  1424. }
  1425. }
  1426. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1427. return x;
  1428. }
  1429. EXPORT_SYMBOL(xfrm_migrate_state_find);
  1430. struct xfrm_state *xfrm_state_migrate(struct xfrm_state *x,
  1431. struct xfrm_migrate *m,
  1432. struct xfrm_encap_tmpl *encap)
  1433. {
  1434. struct xfrm_state *xc;
  1435. xc = xfrm_state_clone(x, encap);
  1436. if (!xc)
  1437. return NULL;
  1438. xc->props.family = m->new_family;
  1439. if (xfrm_init_state(xc) < 0)
  1440. goto error;
  1441. memcpy(&xc->id.daddr, &m->new_daddr, sizeof(xc->id.daddr));
  1442. memcpy(&xc->props.saddr, &m->new_saddr, sizeof(xc->props.saddr));
  1443. /* add state */
  1444. if (xfrm_addr_equal(&x->id.daddr, &m->new_daddr, m->new_family)) {
  1445. /* a care is needed when the destination address of the
  1446. state is to be updated as it is a part of triplet */
  1447. xfrm_state_insert(xc);
  1448. } else {
  1449. if (xfrm_state_add(xc) < 0)
  1450. goto error;
  1451. }
  1452. return xc;
  1453. error:
  1454. xfrm_state_put(xc);
  1455. return NULL;
  1456. }
  1457. EXPORT_SYMBOL(xfrm_state_migrate);
  1458. #endif
  1459. int xfrm_state_update(struct xfrm_state *x)
  1460. {
  1461. struct xfrm_state *x1, *to_put;
  1462. int err;
  1463. int use_spi = xfrm_id_proto_match(x->id.proto, IPSEC_PROTO_ANY);
  1464. struct net *net = xs_net(x);
  1465. to_put = NULL;
  1466. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1467. x1 = __xfrm_state_locate(x, use_spi, x->props.family);
  1468. err = -ESRCH;
  1469. if (!x1)
  1470. goto out;
  1471. if (xfrm_state_kern(x1)) {
  1472. to_put = x1;
  1473. err = -EEXIST;
  1474. goto out;
  1475. }
  1476. if (x1->km.state == XFRM_STATE_ACQ) {
  1477. __xfrm_state_insert(x);
  1478. x = NULL;
  1479. }
  1480. err = 0;
  1481. out:
  1482. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1483. if (to_put)
  1484. xfrm_state_put(to_put);
  1485. if (err)
  1486. return err;
  1487. if (!x) {
  1488. xfrm_state_delete(x1);
  1489. xfrm_state_put(x1);
  1490. return 0;
  1491. }
  1492. err = -EINVAL;
  1493. spin_lock_bh(&x1->lock);
  1494. if (likely(x1->km.state == XFRM_STATE_VALID)) {
  1495. if (x->encap && x1->encap &&
  1496. x->encap->encap_type == x1->encap->encap_type)
  1497. memcpy(x1->encap, x->encap, sizeof(*x1->encap));
  1498. else if (x->encap || x1->encap)
  1499. goto fail;
  1500. if (x->coaddr && x1->coaddr) {
  1501. memcpy(x1->coaddr, x->coaddr, sizeof(*x1->coaddr));
  1502. }
  1503. if (!use_spi && memcmp(&x1->sel, &x->sel, sizeof(x1->sel)))
  1504. memcpy(&x1->sel, &x->sel, sizeof(x1->sel));
  1505. memcpy(&x1->lft, &x->lft, sizeof(x1->lft));
  1506. x1->km.dying = 0;
  1507. hrtimer_start(&x1->mtimer, ktime_set(1, 0),
  1508. HRTIMER_MODE_REL_SOFT);
  1509. if (READ_ONCE(x1->curlft.use_time))
  1510. xfrm_state_check_expire(x1);
  1511. if (x->props.smark.m || x->props.smark.v || x->if_id) {
  1512. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1513. if (x->props.smark.m || x->props.smark.v)
  1514. x1->props.smark = x->props.smark;
  1515. if (x->if_id)
  1516. x1->if_id = x->if_id;
  1517. __xfrm_state_bump_genids(x1);
  1518. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1519. }
  1520. err = 0;
  1521. x->km.state = XFRM_STATE_DEAD;
  1522. __xfrm_state_put(x);
  1523. }
  1524. fail:
  1525. spin_unlock_bh(&x1->lock);
  1526. xfrm_state_put(x1);
  1527. return err;
  1528. }
  1529. EXPORT_SYMBOL(xfrm_state_update);
  1530. int xfrm_state_check_expire(struct xfrm_state *x)
  1531. {
  1532. if (!READ_ONCE(x->curlft.use_time))
  1533. WRITE_ONCE(x->curlft.use_time, ktime_get_real_seconds());
  1534. if (x->curlft.bytes >= x->lft.hard_byte_limit ||
  1535. x->curlft.packets >= x->lft.hard_packet_limit) {
  1536. x->km.state = XFRM_STATE_EXPIRED;
  1537. hrtimer_start(&x->mtimer, 0, HRTIMER_MODE_REL_SOFT);
  1538. return -EINVAL;
  1539. }
  1540. if (!x->km.dying &&
  1541. (x->curlft.bytes >= x->lft.soft_byte_limit ||
  1542. x->curlft.packets >= x->lft.soft_packet_limit)) {
  1543. x->km.dying = 1;
  1544. km_state_expired(x, 0, 0);
  1545. }
  1546. return 0;
  1547. }
  1548. EXPORT_SYMBOL(xfrm_state_check_expire);
  1549. struct xfrm_state *
  1550. xfrm_state_lookup(struct net *net, u32 mark, const xfrm_address_t *daddr, __be32 spi,
  1551. u8 proto, unsigned short family)
  1552. {
  1553. struct xfrm_state *x;
  1554. rcu_read_lock();
  1555. x = __xfrm_state_lookup(net, mark, daddr, spi, proto, family);
  1556. rcu_read_unlock();
  1557. return x;
  1558. }
  1559. EXPORT_SYMBOL(xfrm_state_lookup);
  1560. struct xfrm_state *
  1561. xfrm_state_lookup_byaddr(struct net *net, u32 mark,
  1562. const xfrm_address_t *daddr, const xfrm_address_t *saddr,
  1563. u8 proto, unsigned short family)
  1564. {
  1565. struct xfrm_state *x;
  1566. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1567. x = __xfrm_state_lookup_byaddr(net, mark, daddr, saddr, proto, family);
  1568. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1569. return x;
  1570. }
  1571. EXPORT_SYMBOL(xfrm_state_lookup_byaddr);
  1572. struct xfrm_state *
  1573. xfrm_find_acq(struct net *net, const struct xfrm_mark *mark, u8 mode, u32 reqid,
  1574. u32 if_id, u8 proto, const xfrm_address_t *daddr,
  1575. const xfrm_address_t *saddr, int create, unsigned short family)
  1576. {
  1577. struct xfrm_state *x;
  1578. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1579. x = __find_acq_core(net, mark, family, mode, reqid, if_id, proto, daddr, saddr, create);
  1580. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1581. return x;
  1582. }
  1583. EXPORT_SYMBOL(xfrm_find_acq);
  1584. #ifdef CONFIG_XFRM_SUB_POLICY
  1585. #if IS_ENABLED(CONFIG_IPV6)
  1586. /* distribution counting sort function for xfrm_state and xfrm_tmpl */
  1587. static void
  1588. __xfrm6_sort(void **dst, void **src, int n,
  1589. int (*cmp)(const void *p), int maxclass)
  1590. {
  1591. int count[XFRM_MAX_DEPTH] = { };
  1592. int class[XFRM_MAX_DEPTH];
  1593. int i;
  1594. for (i = 0; i < n; i++) {
  1595. int c = cmp(src[i]);
  1596. class[i] = c;
  1597. count[c]++;
  1598. }
  1599. for (i = 2; i < maxclass; i++)
  1600. count[i] += count[i - 1];
  1601. for (i = 0; i < n; i++) {
  1602. dst[count[class[i] - 1]++] = src[i];
  1603. src[i] = NULL;
  1604. }
  1605. }
  1606. /* Rule for xfrm_state:
  1607. *
  1608. * rule 1: select IPsec transport except AH
  1609. * rule 2: select MIPv6 RO or inbound trigger
  1610. * rule 3: select IPsec transport AH
  1611. * rule 4: select IPsec tunnel
  1612. * rule 5: others
  1613. */
  1614. static int __xfrm6_state_sort_cmp(const void *p)
  1615. {
  1616. const struct xfrm_state *v = p;
  1617. switch (v->props.mode) {
  1618. case XFRM_MODE_TRANSPORT:
  1619. if (v->id.proto != IPPROTO_AH)
  1620. return 1;
  1621. else
  1622. return 3;
  1623. #if IS_ENABLED(CONFIG_IPV6_MIP6)
  1624. case XFRM_MODE_ROUTEOPTIMIZATION:
  1625. case XFRM_MODE_IN_TRIGGER:
  1626. return 2;
  1627. #endif
  1628. case XFRM_MODE_TUNNEL:
  1629. case XFRM_MODE_BEET:
  1630. return 4;
  1631. }
  1632. return 5;
  1633. }
  1634. /* Rule for xfrm_tmpl:
  1635. *
  1636. * rule 1: select IPsec transport
  1637. * rule 2: select MIPv6 RO or inbound trigger
  1638. * rule 3: select IPsec tunnel
  1639. * rule 4: others
  1640. */
  1641. static int __xfrm6_tmpl_sort_cmp(const void *p)
  1642. {
  1643. const struct xfrm_tmpl *v = p;
  1644. switch (v->mode) {
  1645. case XFRM_MODE_TRANSPORT:
  1646. return 1;
  1647. #if IS_ENABLED(CONFIG_IPV6_MIP6)
  1648. case XFRM_MODE_ROUTEOPTIMIZATION:
  1649. case XFRM_MODE_IN_TRIGGER:
  1650. return 2;
  1651. #endif
  1652. case XFRM_MODE_TUNNEL:
  1653. case XFRM_MODE_BEET:
  1654. return 3;
  1655. }
  1656. return 4;
  1657. }
  1658. #else
  1659. static inline int __xfrm6_state_sort_cmp(const void *p) { return 5; }
  1660. static inline int __xfrm6_tmpl_sort_cmp(const void *p) { return 4; }
  1661. static inline void
  1662. __xfrm6_sort(void **dst, void **src, int n,
  1663. int (*cmp)(const void *p), int maxclass)
  1664. {
  1665. int i;
  1666. for (i = 0; i < n; i++)
  1667. dst[i] = src[i];
  1668. }
  1669. #endif /* CONFIG_IPV6 */
  1670. void
  1671. xfrm_tmpl_sort(struct xfrm_tmpl **dst, struct xfrm_tmpl **src, int n,
  1672. unsigned short family)
  1673. {
  1674. int i;
  1675. if (family == AF_INET6)
  1676. __xfrm6_sort((void **)dst, (void **)src, n,
  1677. __xfrm6_tmpl_sort_cmp, 5);
  1678. else
  1679. for (i = 0; i < n; i++)
  1680. dst[i] = src[i];
  1681. }
  1682. void
  1683. xfrm_state_sort(struct xfrm_state **dst, struct xfrm_state **src, int n,
  1684. unsigned short family)
  1685. {
  1686. int i;
  1687. if (family == AF_INET6)
  1688. __xfrm6_sort((void **)dst, (void **)src, n,
  1689. __xfrm6_state_sort_cmp, 6);
  1690. else
  1691. for (i = 0; i < n; i++)
  1692. dst[i] = src[i];
  1693. }
  1694. #endif
  1695. /* Silly enough, but I'm lazy to build resolution list */
  1696. static struct xfrm_state *__xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq)
  1697. {
  1698. unsigned int h = xfrm_seq_hash(net, seq);
  1699. struct xfrm_state *x;
  1700. hlist_for_each_entry_rcu(x, net->xfrm.state_byseq + h, byseq) {
  1701. if (x->km.seq == seq &&
  1702. (mark & x->mark.m) == x->mark.v &&
  1703. x->km.state == XFRM_STATE_ACQ) {
  1704. xfrm_state_hold(x);
  1705. return x;
  1706. }
  1707. }
  1708. return NULL;
  1709. }
  1710. struct xfrm_state *xfrm_find_acq_byseq(struct net *net, u32 mark, u32 seq)
  1711. {
  1712. struct xfrm_state *x;
  1713. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1714. x = __xfrm_find_acq_byseq(net, mark, seq);
  1715. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1716. return x;
  1717. }
  1718. EXPORT_SYMBOL(xfrm_find_acq_byseq);
  1719. u32 xfrm_get_acqseq(void)
  1720. {
  1721. u32 res;
  1722. static atomic_t acqseq;
  1723. do {
  1724. res = atomic_inc_return(&acqseq);
  1725. } while (!res);
  1726. return res;
  1727. }
  1728. EXPORT_SYMBOL(xfrm_get_acqseq);
  1729. int verify_spi_info(u8 proto, u32 min, u32 max)
  1730. {
  1731. switch (proto) {
  1732. case IPPROTO_AH:
  1733. case IPPROTO_ESP:
  1734. break;
  1735. case IPPROTO_COMP:
  1736. /* IPCOMP spi is 16-bits. */
  1737. if (max >= 0x10000)
  1738. return -EINVAL;
  1739. break;
  1740. default:
  1741. return -EINVAL;
  1742. }
  1743. if (min > max)
  1744. return -EINVAL;
  1745. return 0;
  1746. }
  1747. EXPORT_SYMBOL(verify_spi_info);
  1748. int xfrm_alloc_spi(struct xfrm_state *x, u32 low, u32 high)
  1749. {
  1750. struct net *net = xs_net(x);
  1751. unsigned int h;
  1752. struct xfrm_state *x0;
  1753. int err = -ENOENT;
  1754. __be32 minspi = htonl(low);
  1755. __be32 maxspi = htonl(high);
  1756. __be32 newspi = 0;
  1757. u32 mark = x->mark.v & x->mark.m;
  1758. spin_lock_bh(&x->lock);
  1759. if (x->km.state == XFRM_STATE_DEAD)
  1760. goto unlock;
  1761. err = 0;
  1762. if (x->id.spi)
  1763. goto unlock;
  1764. err = -ENOENT;
  1765. if (minspi == maxspi) {
  1766. x0 = xfrm_state_lookup(net, mark, &x->id.daddr, minspi, x->id.proto, x->props.family);
  1767. if (x0) {
  1768. xfrm_state_put(x0);
  1769. goto unlock;
  1770. }
  1771. newspi = minspi;
  1772. } else {
  1773. u32 spi = 0;
  1774. for (h = 0; h < high-low+1; h++) {
  1775. spi = low + prandom_u32_max(high - low + 1);
  1776. x0 = xfrm_state_lookup(net, mark, &x->id.daddr, htonl(spi), x->id.proto, x->props.family);
  1777. if (x0 == NULL) {
  1778. newspi = htonl(spi);
  1779. break;
  1780. }
  1781. xfrm_state_put(x0);
  1782. }
  1783. }
  1784. if (newspi) {
  1785. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1786. x->id.spi = newspi;
  1787. h = xfrm_spi_hash(net, &x->id.daddr, x->id.spi, x->id.proto, x->props.family);
  1788. hlist_add_head_rcu(&x->byspi, net->xfrm.state_byspi + h);
  1789. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1790. err = 0;
  1791. }
  1792. unlock:
  1793. spin_unlock_bh(&x->lock);
  1794. return err;
  1795. }
  1796. EXPORT_SYMBOL(xfrm_alloc_spi);
  1797. static bool __xfrm_state_filter_match(struct xfrm_state *x,
  1798. struct xfrm_address_filter *filter)
  1799. {
  1800. if (filter) {
  1801. if ((filter->family == AF_INET ||
  1802. filter->family == AF_INET6) &&
  1803. x->props.family != filter->family)
  1804. return false;
  1805. return addr_match(&x->props.saddr, &filter->saddr,
  1806. filter->splen) &&
  1807. addr_match(&x->id.daddr, &filter->daddr,
  1808. filter->dplen);
  1809. }
  1810. return true;
  1811. }
  1812. int xfrm_state_walk(struct net *net, struct xfrm_state_walk *walk,
  1813. int (*func)(struct xfrm_state *, int, void*),
  1814. void *data)
  1815. {
  1816. struct xfrm_state *state;
  1817. struct xfrm_state_walk *x;
  1818. int err = 0;
  1819. if (walk->seq != 0 && list_empty(&walk->all))
  1820. return 0;
  1821. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1822. if (list_empty(&walk->all))
  1823. x = list_first_entry(&net->xfrm.state_all, struct xfrm_state_walk, all);
  1824. else
  1825. x = list_first_entry(&walk->all, struct xfrm_state_walk, all);
  1826. list_for_each_entry_from(x, &net->xfrm.state_all, all) {
  1827. if (x->state == XFRM_STATE_DEAD)
  1828. continue;
  1829. state = container_of(x, struct xfrm_state, km);
  1830. if (!xfrm_id_proto_match(state->id.proto, walk->proto))
  1831. continue;
  1832. if (!__xfrm_state_filter_match(state, walk->filter))
  1833. continue;
  1834. err = func(state, walk->seq, data);
  1835. if (err) {
  1836. list_move_tail(&walk->all, &x->all);
  1837. goto out;
  1838. }
  1839. walk->seq++;
  1840. }
  1841. if (walk->seq == 0) {
  1842. err = -ENOENT;
  1843. goto out;
  1844. }
  1845. list_del_init(&walk->all);
  1846. out:
  1847. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1848. return err;
  1849. }
  1850. EXPORT_SYMBOL(xfrm_state_walk);
  1851. void xfrm_state_walk_init(struct xfrm_state_walk *walk, u8 proto,
  1852. struct xfrm_address_filter *filter)
  1853. {
  1854. INIT_LIST_HEAD(&walk->all);
  1855. walk->proto = proto;
  1856. walk->state = XFRM_STATE_DEAD;
  1857. walk->seq = 0;
  1858. walk->filter = filter;
  1859. }
  1860. EXPORT_SYMBOL(xfrm_state_walk_init);
  1861. void xfrm_state_walk_done(struct xfrm_state_walk *walk, struct net *net)
  1862. {
  1863. kfree(walk->filter);
  1864. if (list_empty(&walk->all))
  1865. return;
  1866. spin_lock_bh(&net->xfrm.xfrm_state_lock);
  1867. list_del(&walk->all);
  1868. spin_unlock_bh(&net->xfrm.xfrm_state_lock);
  1869. }
  1870. EXPORT_SYMBOL(xfrm_state_walk_done);
  1871. static void xfrm_replay_timer_handler(struct timer_list *t)
  1872. {
  1873. struct xfrm_state *x = from_timer(x, t, rtimer);
  1874. spin_lock(&x->lock);
  1875. if (x->km.state == XFRM_STATE_VALID) {
  1876. if (xfrm_aevent_is_on(xs_net(x)))
  1877. xfrm_replay_notify(x, XFRM_REPLAY_TIMEOUT);
  1878. else
  1879. x->xflags |= XFRM_TIME_DEFER;
  1880. }
  1881. spin_unlock(&x->lock);
  1882. }
  1883. static LIST_HEAD(xfrm_km_list);
  1884. void km_policy_notify(struct xfrm_policy *xp, int dir, const struct km_event *c)
  1885. {
  1886. struct xfrm_mgr *km;
  1887. rcu_read_lock();
  1888. list_for_each_entry_rcu(km, &xfrm_km_list, list)
  1889. if (km->notify_policy)
  1890. km->notify_policy(xp, dir, c);
  1891. rcu_read_unlock();
  1892. }
  1893. void km_state_notify(struct xfrm_state *x, const struct km_event *c)
  1894. {
  1895. struct xfrm_mgr *km;
  1896. rcu_read_lock();
  1897. list_for_each_entry_rcu(km, &xfrm_km_list, list)
  1898. if (km->notify)
  1899. km->notify(x, c);
  1900. rcu_read_unlock();
  1901. }
  1902. EXPORT_SYMBOL(km_policy_notify);
  1903. EXPORT_SYMBOL(km_state_notify);
  1904. void km_state_expired(struct xfrm_state *x, int hard, u32 portid)
  1905. {
  1906. struct km_event c;
  1907. c.data.hard = hard;
  1908. c.portid = portid;
  1909. c.event = XFRM_MSG_EXPIRE;
  1910. km_state_notify(x, &c);
  1911. }
  1912. EXPORT_SYMBOL(km_state_expired);
  1913. /*
  1914. * We send to all registered managers regardless of failure
  1915. * We are happy with one success
  1916. */
  1917. int km_query(struct xfrm_state *x, struct xfrm_tmpl *t, struct xfrm_policy *pol)
  1918. {
  1919. int err = -EINVAL, acqret;
  1920. struct xfrm_mgr *km;
  1921. rcu_read_lock();
  1922. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  1923. acqret = km->acquire(x, t, pol);
  1924. if (!acqret)
  1925. err = acqret;
  1926. }
  1927. rcu_read_unlock();
  1928. return err;
  1929. }
  1930. EXPORT_SYMBOL(km_query);
  1931. static int __km_new_mapping(struct xfrm_state *x, xfrm_address_t *ipaddr, __be16 sport)
  1932. {
  1933. int err = -EINVAL;
  1934. struct xfrm_mgr *km;
  1935. rcu_read_lock();
  1936. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  1937. if (km->new_mapping)
  1938. err = km->new_mapping(x, ipaddr, sport);
  1939. if (!err)
  1940. break;
  1941. }
  1942. rcu_read_unlock();
  1943. return err;
  1944. }
  1945. int km_new_mapping(struct xfrm_state *x, xfrm_address_t *ipaddr, __be16 sport)
  1946. {
  1947. int ret = 0;
  1948. if (x->mapping_maxage) {
  1949. if ((jiffies / HZ - x->new_mapping) > x->mapping_maxage ||
  1950. x->new_mapping_sport != sport) {
  1951. x->new_mapping_sport = sport;
  1952. x->new_mapping = jiffies / HZ;
  1953. ret = __km_new_mapping(x, ipaddr, sport);
  1954. }
  1955. } else {
  1956. ret = __km_new_mapping(x, ipaddr, sport);
  1957. }
  1958. return ret;
  1959. }
  1960. EXPORT_SYMBOL(km_new_mapping);
  1961. void km_policy_expired(struct xfrm_policy *pol, int dir, int hard, u32 portid)
  1962. {
  1963. struct km_event c;
  1964. c.data.hard = hard;
  1965. c.portid = portid;
  1966. c.event = XFRM_MSG_POLEXPIRE;
  1967. km_policy_notify(pol, dir, &c);
  1968. }
  1969. EXPORT_SYMBOL(km_policy_expired);
  1970. #ifdef CONFIG_XFRM_MIGRATE
  1971. int km_migrate(const struct xfrm_selector *sel, u8 dir, u8 type,
  1972. const struct xfrm_migrate *m, int num_migrate,
  1973. const struct xfrm_kmaddress *k,
  1974. const struct xfrm_encap_tmpl *encap)
  1975. {
  1976. int err = -EINVAL;
  1977. int ret;
  1978. struct xfrm_mgr *km;
  1979. rcu_read_lock();
  1980. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  1981. if (km->migrate) {
  1982. ret = km->migrate(sel, dir, type, m, num_migrate, k,
  1983. encap);
  1984. if (!ret)
  1985. err = ret;
  1986. }
  1987. }
  1988. rcu_read_unlock();
  1989. return err;
  1990. }
  1991. EXPORT_SYMBOL(km_migrate);
  1992. #endif
  1993. int km_report(struct net *net, u8 proto, struct xfrm_selector *sel, xfrm_address_t *addr)
  1994. {
  1995. int err = -EINVAL;
  1996. int ret;
  1997. struct xfrm_mgr *km;
  1998. rcu_read_lock();
  1999. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  2000. if (km->report) {
  2001. ret = km->report(net, proto, sel, addr);
  2002. if (!ret)
  2003. err = ret;
  2004. }
  2005. }
  2006. rcu_read_unlock();
  2007. return err;
  2008. }
  2009. EXPORT_SYMBOL(km_report);
  2010. static bool km_is_alive(const struct km_event *c)
  2011. {
  2012. struct xfrm_mgr *km;
  2013. bool is_alive = false;
  2014. rcu_read_lock();
  2015. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  2016. if (km->is_alive && km->is_alive(c)) {
  2017. is_alive = true;
  2018. break;
  2019. }
  2020. }
  2021. rcu_read_unlock();
  2022. return is_alive;
  2023. }
  2024. #if IS_ENABLED(CONFIG_XFRM_USER_COMPAT)
  2025. static DEFINE_SPINLOCK(xfrm_translator_lock);
  2026. static struct xfrm_translator __rcu *xfrm_translator;
  2027. struct xfrm_translator *xfrm_get_translator(void)
  2028. {
  2029. struct xfrm_translator *xtr;
  2030. rcu_read_lock();
  2031. xtr = rcu_dereference(xfrm_translator);
  2032. if (unlikely(!xtr))
  2033. goto out;
  2034. if (!try_module_get(xtr->owner))
  2035. xtr = NULL;
  2036. out:
  2037. rcu_read_unlock();
  2038. return xtr;
  2039. }
  2040. EXPORT_SYMBOL_GPL(xfrm_get_translator);
  2041. void xfrm_put_translator(struct xfrm_translator *xtr)
  2042. {
  2043. module_put(xtr->owner);
  2044. }
  2045. EXPORT_SYMBOL_GPL(xfrm_put_translator);
  2046. int xfrm_register_translator(struct xfrm_translator *xtr)
  2047. {
  2048. int err = 0;
  2049. spin_lock_bh(&xfrm_translator_lock);
  2050. if (unlikely(xfrm_translator != NULL))
  2051. err = -EEXIST;
  2052. else
  2053. rcu_assign_pointer(xfrm_translator, xtr);
  2054. spin_unlock_bh(&xfrm_translator_lock);
  2055. return err;
  2056. }
  2057. EXPORT_SYMBOL_GPL(xfrm_register_translator);
  2058. int xfrm_unregister_translator(struct xfrm_translator *xtr)
  2059. {
  2060. int err = 0;
  2061. spin_lock_bh(&xfrm_translator_lock);
  2062. if (likely(xfrm_translator != NULL)) {
  2063. if (rcu_access_pointer(xfrm_translator) != xtr)
  2064. err = -EINVAL;
  2065. else
  2066. RCU_INIT_POINTER(xfrm_translator, NULL);
  2067. }
  2068. spin_unlock_bh(&xfrm_translator_lock);
  2069. synchronize_rcu();
  2070. return err;
  2071. }
  2072. EXPORT_SYMBOL_GPL(xfrm_unregister_translator);
  2073. #endif
  2074. int xfrm_user_policy(struct sock *sk, int optname, sockptr_t optval, int optlen)
  2075. {
  2076. int err;
  2077. u8 *data;
  2078. struct xfrm_mgr *km;
  2079. struct xfrm_policy *pol = NULL;
  2080. if (sockptr_is_null(optval) && !optlen) {
  2081. xfrm_sk_policy_insert(sk, XFRM_POLICY_IN, NULL);
  2082. xfrm_sk_policy_insert(sk, XFRM_POLICY_OUT, NULL);
  2083. __sk_dst_reset(sk);
  2084. return 0;
  2085. }
  2086. if (optlen <= 0 || optlen > PAGE_SIZE)
  2087. return -EMSGSIZE;
  2088. data = memdup_sockptr(optval, optlen);
  2089. if (IS_ERR(data))
  2090. return PTR_ERR(data);
  2091. /* Use the 64-bit / untranslated format on Android, even for compat */
  2092. if (!IS_ENABLED(CONFIG_GKI_NET_XFRM_HACKS) || IS_ENABLED(CONFIG_XFRM_USER_COMPAT)) {
  2093. if (in_compat_syscall()) {
  2094. struct xfrm_translator *xtr = xfrm_get_translator();
  2095. if (!xtr) {
  2096. kfree(data);
  2097. return -EOPNOTSUPP;
  2098. }
  2099. err = xtr->xlate_user_policy_sockptr(&data, optlen);
  2100. xfrm_put_translator(xtr);
  2101. if (err) {
  2102. kfree(data);
  2103. return err;
  2104. }
  2105. }
  2106. }
  2107. err = -EINVAL;
  2108. rcu_read_lock();
  2109. list_for_each_entry_rcu(km, &xfrm_km_list, list) {
  2110. pol = km->compile_policy(sk, optname, data,
  2111. optlen, &err);
  2112. if (err >= 0)
  2113. break;
  2114. }
  2115. rcu_read_unlock();
  2116. if (err >= 0) {
  2117. xfrm_sk_policy_insert(sk, err, pol);
  2118. xfrm_pol_put(pol);
  2119. __sk_dst_reset(sk);
  2120. err = 0;
  2121. }
  2122. kfree(data);
  2123. return err;
  2124. }
  2125. EXPORT_SYMBOL(xfrm_user_policy);
  2126. static DEFINE_SPINLOCK(xfrm_km_lock);
  2127. void xfrm_register_km(struct xfrm_mgr *km)
  2128. {
  2129. spin_lock_bh(&xfrm_km_lock);
  2130. list_add_tail_rcu(&km->list, &xfrm_km_list);
  2131. spin_unlock_bh(&xfrm_km_lock);
  2132. }
  2133. EXPORT_SYMBOL(xfrm_register_km);
  2134. void xfrm_unregister_km(struct xfrm_mgr *km)
  2135. {
  2136. spin_lock_bh(&xfrm_km_lock);
  2137. list_del_rcu(&km->list);
  2138. spin_unlock_bh(&xfrm_km_lock);
  2139. synchronize_rcu();
  2140. }
  2141. EXPORT_SYMBOL(xfrm_unregister_km);
  2142. int xfrm_state_register_afinfo(struct xfrm_state_afinfo *afinfo)
  2143. {
  2144. int err = 0;
  2145. if (WARN_ON(afinfo->family >= NPROTO))
  2146. return -EAFNOSUPPORT;
  2147. spin_lock_bh(&xfrm_state_afinfo_lock);
  2148. if (unlikely(xfrm_state_afinfo[afinfo->family] != NULL))
  2149. err = -EEXIST;
  2150. else
  2151. rcu_assign_pointer(xfrm_state_afinfo[afinfo->family], afinfo);
  2152. spin_unlock_bh(&xfrm_state_afinfo_lock);
  2153. return err;
  2154. }
  2155. EXPORT_SYMBOL(xfrm_state_register_afinfo);
  2156. int xfrm_state_unregister_afinfo(struct xfrm_state_afinfo *afinfo)
  2157. {
  2158. int err = 0, family = afinfo->family;
  2159. if (WARN_ON(family >= NPROTO))
  2160. return -EAFNOSUPPORT;
  2161. spin_lock_bh(&xfrm_state_afinfo_lock);
  2162. if (likely(xfrm_state_afinfo[afinfo->family] != NULL)) {
  2163. if (rcu_access_pointer(xfrm_state_afinfo[family]) != afinfo)
  2164. err = -EINVAL;
  2165. else
  2166. RCU_INIT_POINTER(xfrm_state_afinfo[afinfo->family], NULL);
  2167. }
  2168. spin_unlock_bh(&xfrm_state_afinfo_lock);
  2169. synchronize_rcu();
  2170. return err;
  2171. }
  2172. EXPORT_SYMBOL(xfrm_state_unregister_afinfo);
  2173. struct xfrm_state_afinfo *xfrm_state_afinfo_get_rcu(unsigned int family)
  2174. {
  2175. if (unlikely(family >= NPROTO))
  2176. return NULL;
  2177. return rcu_dereference(xfrm_state_afinfo[family]);
  2178. }
  2179. EXPORT_SYMBOL_GPL(xfrm_state_afinfo_get_rcu);
  2180. struct xfrm_state_afinfo *xfrm_state_get_afinfo(unsigned int family)
  2181. {
  2182. struct xfrm_state_afinfo *afinfo;
  2183. if (unlikely(family >= NPROTO))
  2184. return NULL;
  2185. rcu_read_lock();
  2186. afinfo = rcu_dereference(xfrm_state_afinfo[family]);
  2187. if (unlikely(!afinfo))
  2188. rcu_read_unlock();
  2189. return afinfo;
  2190. }
  2191. void xfrm_flush_gc(void)
  2192. {
  2193. flush_work(&xfrm_state_gc_work);
  2194. }
  2195. EXPORT_SYMBOL(xfrm_flush_gc);
  2196. /* Temporarily located here until net/xfrm/xfrm_tunnel.c is created */
  2197. void xfrm_state_delete_tunnel(struct xfrm_state *x)
  2198. {
  2199. if (x->tunnel) {
  2200. struct xfrm_state *t = x->tunnel;
  2201. if (atomic_read(&t->tunnel_users) == 2)
  2202. xfrm_state_delete(t);
  2203. atomic_dec(&t->tunnel_users);
  2204. xfrm_state_put_sync(t);
  2205. x->tunnel = NULL;
  2206. }
  2207. }
  2208. EXPORT_SYMBOL(xfrm_state_delete_tunnel);
  2209. u32 xfrm_state_mtu(struct xfrm_state *x, int mtu)
  2210. {
  2211. const struct xfrm_type *type = READ_ONCE(x->type);
  2212. struct crypto_aead *aead;
  2213. u32 blksize, net_adj = 0;
  2214. if (x->km.state != XFRM_STATE_VALID ||
  2215. !type || type->proto != IPPROTO_ESP)
  2216. return mtu - x->props.header_len;
  2217. aead = x->data;
  2218. blksize = ALIGN(crypto_aead_blocksize(aead), 4);
  2219. switch (x->props.mode) {
  2220. case XFRM_MODE_TRANSPORT:
  2221. case XFRM_MODE_BEET:
  2222. if (x->props.family == AF_INET)
  2223. net_adj = sizeof(struct iphdr);
  2224. else if (x->props.family == AF_INET6)
  2225. net_adj = sizeof(struct ipv6hdr);
  2226. break;
  2227. case XFRM_MODE_TUNNEL:
  2228. break;
  2229. default:
  2230. WARN_ON_ONCE(1);
  2231. break;
  2232. }
  2233. return ((mtu - x->props.header_len - crypto_aead_authsize(aead) -
  2234. net_adj) & ~(blksize - 1)) + net_adj - 2;
  2235. }
  2236. EXPORT_SYMBOL_GPL(xfrm_state_mtu);
  2237. int __xfrm_init_state(struct xfrm_state *x, bool init_replay, bool offload,
  2238. struct netlink_ext_ack *extack)
  2239. {
  2240. const struct xfrm_mode *inner_mode;
  2241. const struct xfrm_mode *outer_mode;
  2242. int family = x->props.family;
  2243. int err;
  2244. if (family == AF_INET &&
  2245. READ_ONCE(xs_net(x)->ipv4.sysctl_ip_no_pmtu_disc))
  2246. x->props.flags |= XFRM_STATE_NOPMTUDISC;
  2247. err = -EPROTONOSUPPORT;
  2248. if (x->sel.family != AF_UNSPEC) {
  2249. inner_mode = xfrm_get_mode(x->props.mode, x->sel.family);
  2250. if (inner_mode == NULL) {
  2251. NL_SET_ERR_MSG(extack, "Requested mode not found");
  2252. goto error;
  2253. }
  2254. if (!(inner_mode->flags & XFRM_MODE_FLAG_TUNNEL) &&
  2255. family != x->sel.family) {
  2256. NL_SET_ERR_MSG(extack, "Only tunnel modes can accommodate a change of family");
  2257. goto error;
  2258. }
  2259. x->inner_mode = *inner_mode;
  2260. } else {
  2261. const struct xfrm_mode *inner_mode_iaf;
  2262. int iafamily = AF_INET;
  2263. inner_mode = xfrm_get_mode(x->props.mode, x->props.family);
  2264. if (inner_mode == NULL) {
  2265. NL_SET_ERR_MSG(extack, "Requested mode not found");
  2266. goto error;
  2267. }
  2268. x->inner_mode = *inner_mode;
  2269. if (x->props.family == AF_INET)
  2270. iafamily = AF_INET6;
  2271. inner_mode_iaf = xfrm_get_mode(x->props.mode, iafamily);
  2272. if (inner_mode_iaf) {
  2273. if (inner_mode_iaf->flags & XFRM_MODE_FLAG_TUNNEL)
  2274. x->inner_mode_iaf = *inner_mode_iaf;
  2275. }
  2276. }
  2277. x->type = xfrm_get_type(x->id.proto, family);
  2278. if (x->type == NULL) {
  2279. NL_SET_ERR_MSG(extack, "Requested type not found");
  2280. goto error;
  2281. }
  2282. x->type_offload = xfrm_get_type_offload(x->id.proto, family, offload);
  2283. err = x->type->init_state(x, extack);
  2284. if (err)
  2285. goto error;
  2286. outer_mode = xfrm_get_mode(x->props.mode, family);
  2287. if (!outer_mode) {
  2288. NL_SET_ERR_MSG(extack, "Requested mode not found");
  2289. err = -EPROTONOSUPPORT;
  2290. goto error;
  2291. }
  2292. x->outer_mode = *outer_mode;
  2293. if (init_replay) {
  2294. err = xfrm_init_replay(x, extack);
  2295. if (err)
  2296. goto error;
  2297. }
  2298. error:
  2299. return err;
  2300. }
  2301. EXPORT_SYMBOL(__xfrm_init_state);
  2302. int xfrm_init_state(struct xfrm_state *x)
  2303. {
  2304. int err;
  2305. err = __xfrm_init_state(x, true, false, NULL);
  2306. if (!err)
  2307. x->km.state = XFRM_STATE_VALID;
  2308. return err;
  2309. }
  2310. EXPORT_SYMBOL(xfrm_init_state);
  2311. int __net_init xfrm_state_init(struct net *net)
  2312. {
  2313. unsigned int sz;
  2314. if (net_eq(net, &init_net))
  2315. xfrm_state_cache = KMEM_CACHE(xfrm_state,
  2316. SLAB_HWCACHE_ALIGN | SLAB_PANIC);
  2317. INIT_LIST_HEAD(&net->xfrm.state_all);
  2318. sz = sizeof(struct hlist_head) * 8;
  2319. net->xfrm.state_bydst = xfrm_hash_alloc(sz);
  2320. if (!net->xfrm.state_bydst)
  2321. goto out_bydst;
  2322. net->xfrm.state_bysrc = xfrm_hash_alloc(sz);
  2323. if (!net->xfrm.state_bysrc)
  2324. goto out_bysrc;
  2325. net->xfrm.state_byspi = xfrm_hash_alloc(sz);
  2326. if (!net->xfrm.state_byspi)
  2327. goto out_byspi;
  2328. net->xfrm.state_byseq = xfrm_hash_alloc(sz);
  2329. if (!net->xfrm.state_byseq)
  2330. goto out_byseq;
  2331. net->xfrm.state_hmask = ((sz / sizeof(struct hlist_head)) - 1);
  2332. net->xfrm.state_num = 0;
  2333. INIT_WORK(&net->xfrm.state_hash_work, xfrm_hash_resize);
  2334. spin_lock_init(&net->xfrm.xfrm_state_lock);
  2335. seqcount_spinlock_init(&net->xfrm.xfrm_state_hash_generation,
  2336. &net->xfrm.xfrm_state_lock);
  2337. return 0;
  2338. out_byseq:
  2339. xfrm_hash_free(net->xfrm.state_byspi, sz);
  2340. out_byspi:
  2341. xfrm_hash_free(net->xfrm.state_bysrc, sz);
  2342. out_bysrc:
  2343. xfrm_hash_free(net->xfrm.state_bydst, sz);
  2344. out_bydst:
  2345. return -ENOMEM;
  2346. }
  2347. void xfrm_state_fini(struct net *net)
  2348. {
  2349. unsigned int sz;
  2350. flush_work(&net->xfrm.state_hash_work);
  2351. flush_work(&xfrm_state_gc_work);
  2352. xfrm_state_flush(net, 0, false, true);
  2353. WARN_ON(!list_empty(&net->xfrm.state_all));
  2354. sz = (net->xfrm.state_hmask + 1) * sizeof(struct hlist_head);
  2355. WARN_ON(!hlist_empty(net->xfrm.state_byseq));
  2356. xfrm_hash_free(net->xfrm.state_byseq, sz);
  2357. WARN_ON(!hlist_empty(net->xfrm.state_byspi));
  2358. xfrm_hash_free(net->xfrm.state_byspi, sz);
  2359. WARN_ON(!hlist_empty(net->xfrm.state_bysrc));
  2360. xfrm_hash_free(net->xfrm.state_bysrc, sz);
  2361. WARN_ON(!hlist_empty(net->xfrm.state_bydst));
  2362. xfrm_hash_free(net->xfrm.state_bydst, sz);
  2363. }
  2364. #ifdef CONFIG_AUDITSYSCALL
  2365. static void xfrm_audit_helper_sainfo(struct xfrm_state *x,
  2366. struct audit_buffer *audit_buf)
  2367. {
  2368. struct xfrm_sec_ctx *ctx = x->security;
  2369. u32 spi = ntohl(x->id.spi);
  2370. if (ctx)
  2371. audit_log_format(audit_buf, " sec_alg=%u sec_doi=%u sec_obj=%s",
  2372. ctx->ctx_alg, ctx->ctx_doi, ctx->ctx_str);
  2373. switch (x->props.family) {
  2374. case AF_INET:
  2375. audit_log_format(audit_buf, " src=%pI4 dst=%pI4",
  2376. &x->props.saddr.a4, &x->id.daddr.a4);
  2377. break;
  2378. case AF_INET6:
  2379. audit_log_format(audit_buf, " src=%pI6 dst=%pI6",
  2380. x->props.saddr.a6, x->id.daddr.a6);
  2381. break;
  2382. }
  2383. audit_log_format(audit_buf, " spi=%u(0x%x)", spi, spi);
  2384. }
  2385. static void xfrm_audit_helper_pktinfo(struct sk_buff *skb, u16 family,
  2386. struct audit_buffer *audit_buf)
  2387. {
  2388. const struct iphdr *iph4;
  2389. const struct ipv6hdr *iph6;
  2390. switch (family) {
  2391. case AF_INET:
  2392. iph4 = ip_hdr(skb);
  2393. audit_log_format(audit_buf, " src=%pI4 dst=%pI4",
  2394. &iph4->saddr, &iph4->daddr);
  2395. break;
  2396. case AF_INET6:
  2397. iph6 = ipv6_hdr(skb);
  2398. audit_log_format(audit_buf,
  2399. " src=%pI6 dst=%pI6 flowlbl=0x%x%02x%02x",
  2400. &iph6->saddr, &iph6->daddr,
  2401. iph6->flow_lbl[0] & 0x0f,
  2402. iph6->flow_lbl[1],
  2403. iph6->flow_lbl[2]);
  2404. break;
  2405. }
  2406. }
  2407. void xfrm_audit_state_add(struct xfrm_state *x, int result, bool task_valid)
  2408. {
  2409. struct audit_buffer *audit_buf;
  2410. audit_buf = xfrm_audit_start("SAD-add");
  2411. if (audit_buf == NULL)
  2412. return;
  2413. xfrm_audit_helper_usrinfo(task_valid, audit_buf);
  2414. xfrm_audit_helper_sainfo(x, audit_buf);
  2415. audit_log_format(audit_buf, " res=%u", result);
  2416. audit_log_end(audit_buf);
  2417. }
  2418. EXPORT_SYMBOL_GPL(xfrm_audit_state_add);
  2419. void xfrm_audit_state_delete(struct xfrm_state *x, int result, bool task_valid)
  2420. {
  2421. struct audit_buffer *audit_buf;
  2422. audit_buf = xfrm_audit_start("SAD-delete");
  2423. if (audit_buf == NULL)
  2424. return;
  2425. xfrm_audit_helper_usrinfo(task_valid, audit_buf);
  2426. xfrm_audit_helper_sainfo(x, audit_buf);
  2427. audit_log_format(audit_buf, " res=%u", result);
  2428. audit_log_end(audit_buf);
  2429. }
  2430. EXPORT_SYMBOL_GPL(xfrm_audit_state_delete);
  2431. void xfrm_audit_state_replay_overflow(struct xfrm_state *x,
  2432. struct sk_buff *skb)
  2433. {
  2434. struct audit_buffer *audit_buf;
  2435. u32 spi;
  2436. audit_buf = xfrm_audit_start("SA-replay-overflow");
  2437. if (audit_buf == NULL)
  2438. return;
  2439. xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
  2440. /* don't record the sequence number because it's inherent in this kind
  2441. * of audit message */
  2442. spi = ntohl(x->id.spi);
  2443. audit_log_format(audit_buf, " spi=%u(0x%x)", spi, spi);
  2444. audit_log_end(audit_buf);
  2445. }
  2446. EXPORT_SYMBOL_GPL(xfrm_audit_state_replay_overflow);
  2447. void xfrm_audit_state_replay(struct xfrm_state *x,
  2448. struct sk_buff *skb, __be32 net_seq)
  2449. {
  2450. struct audit_buffer *audit_buf;
  2451. u32 spi;
  2452. audit_buf = xfrm_audit_start("SA-replayed-pkt");
  2453. if (audit_buf == NULL)
  2454. return;
  2455. xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
  2456. spi = ntohl(x->id.spi);
  2457. audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
  2458. spi, spi, ntohl(net_seq));
  2459. audit_log_end(audit_buf);
  2460. }
  2461. EXPORT_SYMBOL_GPL(xfrm_audit_state_replay);
  2462. void xfrm_audit_state_notfound_simple(struct sk_buff *skb, u16 family)
  2463. {
  2464. struct audit_buffer *audit_buf;
  2465. audit_buf = xfrm_audit_start("SA-notfound");
  2466. if (audit_buf == NULL)
  2467. return;
  2468. xfrm_audit_helper_pktinfo(skb, family, audit_buf);
  2469. audit_log_end(audit_buf);
  2470. }
  2471. EXPORT_SYMBOL_GPL(xfrm_audit_state_notfound_simple);
  2472. void xfrm_audit_state_notfound(struct sk_buff *skb, u16 family,
  2473. __be32 net_spi, __be32 net_seq)
  2474. {
  2475. struct audit_buffer *audit_buf;
  2476. u32 spi;
  2477. audit_buf = xfrm_audit_start("SA-notfound");
  2478. if (audit_buf == NULL)
  2479. return;
  2480. xfrm_audit_helper_pktinfo(skb, family, audit_buf);
  2481. spi = ntohl(net_spi);
  2482. audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
  2483. spi, spi, ntohl(net_seq));
  2484. audit_log_end(audit_buf);
  2485. }
  2486. EXPORT_SYMBOL_GPL(xfrm_audit_state_notfound);
  2487. void xfrm_audit_state_icvfail(struct xfrm_state *x,
  2488. struct sk_buff *skb, u8 proto)
  2489. {
  2490. struct audit_buffer *audit_buf;
  2491. __be32 net_spi;
  2492. __be32 net_seq;
  2493. audit_buf = xfrm_audit_start("SA-icv-failure");
  2494. if (audit_buf == NULL)
  2495. return;
  2496. xfrm_audit_helper_pktinfo(skb, x->props.family, audit_buf);
  2497. if (xfrm_parse_spi(skb, proto, &net_spi, &net_seq) == 0) {
  2498. u32 spi = ntohl(net_spi);
  2499. audit_log_format(audit_buf, " spi=%u(0x%x) seqno=%u",
  2500. spi, spi, ntohl(net_seq));
  2501. }
  2502. audit_log_end(audit_buf);
  2503. }
  2504. EXPORT_SYMBOL_GPL(xfrm_audit_state_icvfail);
  2505. #endif /* CONFIG_AUDITSYSCALL */