xfrm_state.c 54 KB

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