xfrm_state.c 55 KB

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