xfrm_state.c 61 KB

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