xfrm_state.c 55 KB

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