mrp.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895
  1. /*
  2. * IEEE 802.1Q Multiple Registration Protocol (MRP)
  3. *
  4. * Copyright (c) 2012 Massachusetts Institute of Technology
  5. *
  6. * Adapted from code in net/802/garp.c
  7. * Copyright (c) 2008 Patrick McHardy <kaber@trash.net>
  8. *
  9. * This program is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU General Public License
  11. * version 2 as published by the Free Software Foundation.
  12. */
  13. #include <linux/kernel.h>
  14. #include <linux/timer.h>
  15. #include <linux/skbuff.h>
  16. #include <linux/netdevice.h>
  17. #include <linux/etherdevice.h>
  18. #include <linux/rtnetlink.h>
  19. #include <linux/slab.h>
  20. #include <linux/module.h>
  21. #include <net/mrp.h>
  22. #include <asm/unaligned.h>
  23. static unsigned int mrp_join_time __read_mostly = 200;
  24. module_param(mrp_join_time, uint, 0644);
  25. MODULE_PARM_DESC(mrp_join_time, "Join time in ms (default 200ms)");
  26. MODULE_LICENSE("GPL");
  27. static const u8
  28. mrp_applicant_state_table[MRP_APPLICANT_MAX + 1][MRP_EVENT_MAX + 1] = {
  29. [MRP_APPLICANT_VO] = {
  30. [MRP_EVENT_NEW] = MRP_APPLICANT_VN,
  31. [MRP_EVENT_JOIN] = MRP_APPLICANT_VP,
  32. [MRP_EVENT_LV] = MRP_APPLICANT_VO,
  33. [MRP_EVENT_TX] = MRP_APPLICANT_VO,
  34. [MRP_EVENT_R_NEW] = MRP_APPLICANT_VO,
  35. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_AO,
  36. [MRP_EVENT_R_IN] = MRP_APPLICANT_VO,
  37. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_VO,
  38. [MRP_EVENT_R_MT] = MRP_APPLICANT_VO,
  39. [MRP_EVENT_R_LV] = MRP_APPLICANT_VO,
  40. [MRP_EVENT_R_LA] = MRP_APPLICANT_VO,
  41. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_VO,
  42. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_VO,
  43. },
  44. [MRP_APPLICANT_VP] = {
  45. [MRP_EVENT_NEW] = MRP_APPLICANT_VN,
  46. [MRP_EVENT_JOIN] = MRP_APPLICANT_VP,
  47. [MRP_EVENT_LV] = MRP_APPLICANT_VO,
  48. [MRP_EVENT_TX] = MRP_APPLICANT_AA,
  49. [MRP_EVENT_R_NEW] = MRP_APPLICANT_VP,
  50. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_AP,
  51. [MRP_EVENT_R_IN] = MRP_APPLICANT_VP,
  52. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_VP,
  53. [MRP_EVENT_R_MT] = MRP_APPLICANT_VP,
  54. [MRP_EVENT_R_LV] = MRP_APPLICANT_VP,
  55. [MRP_EVENT_R_LA] = MRP_APPLICANT_VP,
  56. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_VP,
  57. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_VP,
  58. },
  59. [MRP_APPLICANT_VN] = {
  60. [MRP_EVENT_NEW] = MRP_APPLICANT_VN,
  61. [MRP_EVENT_JOIN] = MRP_APPLICANT_VN,
  62. [MRP_EVENT_LV] = MRP_APPLICANT_LA,
  63. [MRP_EVENT_TX] = MRP_APPLICANT_AN,
  64. [MRP_EVENT_R_NEW] = MRP_APPLICANT_VN,
  65. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_VN,
  66. [MRP_EVENT_R_IN] = MRP_APPLICANT_VN,
  67. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_VN,
  68. [MRP_EVENT_R_MT] = MRP_APPLICANT_VN,
  69. [MRP_EVENT_R_LV] = MRP_APPLICANT_VN,
  70. [MRP_EVENT_R_LA] = MRP_APPLICANT_VN,
  71. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_VN,
  72. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_VN,
  73. },
  74. [MRP_APPLICANT_AN] = {
  75. [MRP_EVENT_NEW] = MRP_APPLICANT_AN,
  76. [MRP_EVENT_JOIN] = MRP_APPLICANT_AN,
  77. [MRP_EVENT_LV] = MRP_APPLICANT_LA,
  78. [MRP_EVENT_TX] = MRP_APPLICANT_QA,
  79. [MRP_EVENT_R_NEW] = MRP_APPLICANT_AN,
  80. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_AN,
  81. [MRP_EVENT_R_IN] = MRP_APPLICANT_AN,
  82. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_AN,
  83. [MRP_EVENT_R_MT] = MRP_APPLICANT_AN,
  84. [MRP_EVENT_R_LV] = MRP_APPLICANT_VN,
  85. [MRP_EVENT_R_LA] = MRP_APPLICANT_VN,
  86. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_VN,
  87. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_AN,
  88. },
  89. [MRP_APPLICANT_AA] = {
  90. [MRP_EVENT_NEW] = MRP_APPLICANT_VN,
  91. [MRP_EVENT_JOIN] = MRP_APPLICANT_AA,
  92. [MRP_EVENT_LV] = MRP_APPLICANT_LA,
  93. [MRP_EVENT_TX] = MRP_APPLICANT_QA,
  94. [MRP_EVENT_R_NEW] = MRP_APPLICANT_AA,
  95. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_QA,
  96. [MRP_EVENT_R_IN] = MRP_APPLICANT_AA,
  97. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_AA,
  98. [MRP_EVENT_R_MT] = MRP_APPLICANT_AA,
  99. [MRP_EVENT_R_LV] = MRP_APPLICANT_VP,
  100. [MRP_EVENT_R_LA] = MRP_APPLICANT_VP,
  101. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_VP,
  102. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_AA,
  103. },
  104. [MRP_APPLICANT_QA] = {
  105. [MRP_EVENT_NEW] = MRP_APPLICANT_VN,
  106. [MRP_EVENT_JOIN] = MRP_APPLICANT_QA,
  107. [MRP_EVENT_LV] = MRP_APPLICANT_LA,
  108. [MRP_EVENT_TX] = MRP_APPLICANT_QA,
  109. [MRP_EVENT_R_NEW] = MRP_APPLICANT_QA,
  110. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_QA,
  111. [MRP_EVENT_R_IN] = MRP_APPLICANT_QA,
  112. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_AA,
  113. [MRP_EVENT_R_MT] = MRP_APPLICANT_AA,
  114. [MRP_EVENT_R_LV] = MRP_APPLICANT_VP,
  115. [MRP_EVENT_R_LA] = MRP_APPLICANT_VP,
  116. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_VP,
  117. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_AA,
  118. },
  119. [MRP_APPLICANT_LA] = {
  120. [MRP_EVENT_NEW] = MRP_APPLICANT_VN,
  121. [MRP_EVENT_JOIN] = MRP_APPLICANT_AA,
  122. [MRP_EVENT_LV] = MRP_APPLICANT_LA,
  123. [MRP_EVENT_TX] = MRP_APPLICANT_VO,
  124. [MRP_EVENT_R_NEW] = MRP_APPLICANT_LA,
  125. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_LA,
  126. [MRP_EVENT_R_IN] = MRP_APPLICANT_LA,
  127. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_LA,
  128. [MRP_EVENT_R_MT] = MRP_APPLICANT_LA,
  129. [MRP_EVENT_R_LV] = MRP_APPLICANT_LA,
  130. [MRP_EVENT_R_LA] = MRP_APPLICANT_LA,
  131. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_LA,
  132. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_LA,
  133. },
  134. [MRP_APPLICANT_AO] = {
  135. [MRP_EVENT_NEW] = MRP_APPLICANT_VN,
  136. [MRP_EVENT_JOIN] = MRP_APPLICANT_AP,
  137. [MRP_EVENT_LV] = MRP_APPLICANT_AO,
  138. [MRP_EVENT_TX] = MRP_APPLICANT_AO,
  139. [MRP_EVENT_R_NEW] = MRP_APPLICANT_AO,
  140. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_QO,
  141. [MRP_EVENT_R_IN] = MRP_APPLICANT_AO,
  142. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_AO,
  143. [MRP_EVENT_R_MT] = MRP_APPLICANT_AO,
  144. [MRP_EVENT_R_LV] = MRP_APPLICANT_VO,
  145. [MRP_EVENT_R_LA] = MRP_APPLICANT_VO,
  146. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_VO,
  147. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_AO,
  148. },
  149. [MRP_APPLICANT_QO] = {
  150. [MRP_EVENT_NEW] = MRP_APPLICANT_VN,
  151. [MRP_EVENT_JOIN] = MRP_APPLICANT_QP,
  152. [MRP_EVENT_LV] = MRP_APPLICANT_QO,
  153. [MRP_EVENT_TX] = MRP_APPLICANT_QO,
  154. [MRP_EVENT_R_NEW] = MRP_APPLICANT_QO,
  155. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_QO,
  156. [MRP_EVENT_R_IN] = MRP_APPLICANT_QO,
  157. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_AO,
  158. [MRP_EVENT_R_MT] = MRP_APPLICANT_AO,
  159. [MRP_EVENT_R_LV] = MRP_APPLICANT_VO,
  160. [MRP_EVENT_R_LA] = MRP_APPLICANT_VO,
  161. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_VO,
  162. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_QO,
  163. },
  164. [MRP_APPLICANT_AP] = {
  165. [MRP_EVENT_NEW] = MRP_APPLICANT_VN,
  166. [MRP_EVENT_JOIN] = MRP_APPLICANT_AP,
  167. [MRP_EVENT_LV] = MRP_APPLICANT_AO,
  168. [MRP_EVENT_TX] = MRP_APPLICANT_QA,
  169. [MRP_EVENT_R_NEW] = MRP_APPLICANT_AP,
  170. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_QP,
  171. [MRP_EVENT_R_IN] = MRP_APPLICANT_AP,
  172. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_AP,
  173. [MRP_EVENT_R_MT] = MRP_APPLICANT_AP,
  174. [MRP_EVENT_R_LV] = MRP_APPLICANT_VP,
  175. [MRP_EVENT_R_LA] = MRP_APPLICANT_VP,
  176. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_VP,
  177. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_AP,
  178. },
  179. [MRP_APPLICANT_QP] = {
  180. [MRP_EVENT_NEW] = MRP_APPLICANT_VN,
  181. [MRP_EVENT_JOIN] = MRP_APPLICANT_QP,
  182. [MRP_EVENT_LV] = MRP_APPLICANT_QO,
  183. [MRP_EVENT_TX] = MRP_APPLICANT_QP,
  184. [MRP_EVENT_R_NEW] = MRP_APPLICANT_QP,
  185. [MRP_EVENT_R_JOIN_IN] = MRP_APPLICANT_QP,
  186. [MRP_EVENT_R_IN] = MRP_APPLICANT_QP,
  187. [MRP_EVENT_R_JOIN_MT] = MRP_APPLICANT_AP,
  188. [MRP_EVENT_R_MT] = MRP_APPLICANT_AP,
  189. [MRP_EVENT_R_LV] = MRP_APPLICANT_VP,
  190. [MRP_EVENT_R_LA] = MRP_APPLICANT_VP,
  191. [MRP_EVENT_REDECLARE] = MRP_APPLICANT_VP,
  192. [MRP_EVENT_PERIODIC] = MRP_APPLICANT_AP,
  193. },
  194. };
  195. static const u8
  196. mrp_tx_action_table[MRP_APPLICANT_MAX + 1] = {
  197. [MRP_APPLICANT_VO] = MRP_TX_ACTION_S_IN_OPTIONAL,
  198. [MRP_APPLICANT_VP] = MRP_TX_ACTION_S_JOIN_IN,
  199. [MRP_APPLICANT_VN] = MRP_TX_ACTION_S_NEW,
  200. [MRP_APPLICANT_AN] = MRP_TX_ACTION_S_NEW,
  201. [MRP_APPLICANT_AA] = MRP_TX_ACTION_S_JOIN_IN,
  202. [MRP_APPLICANT_QA] = MRP_TX_ACTION_S_JOIN_IN_OPTIONAL,
  203. [MRP_APPLICANT_LA] = MRP_TX_ACTION_S_LV,
  204. [MRP_APPLICANT_AO] = MRP_TX_ACTION_S_IN_OPTIONAL,
  205. [MRP_APPLICANT_QO] = MRP_TX_ACTION_S_IN_OPTIONAL,
  206. [MRP_APPLICANT_AP] = MRP_TX_ACTION_S_JOIN_IN,
  207. [MRP_APPLICANT_QP] = MRP_TX_ACTION_S_IN_OPTIONAL,
  208. };
  209. static void mrp_attrvalue_inc(void *value, u8 len)
  210. {
  211. u8 *v = (u8 *)value;
  212. /* Add 1 to the last byte. If it becomes zero,
  213. * go to the previous byte and repeat.
  214. */
  215. while (len > 0 && !++v[--len])
  216. ;
  217. }
  218. static int mrp_attr_cmp(const struct mrp_attr *attr,
  219. const void *value, u8 len, u8 type)
  220. {
  221. if (attr->type != type)
  222. return attr->type - type;
  223. if (attr->len != len)
  224. return attr->len - len;
  225. return memcmp(attr->value, value, len);
  226. }
  227. static struct mrp_attr *mrp_attr_lookup(const struct mrp_applicant *app,
  228. const void *value, u8 len, u8 type)
  229. {
  230. struct rb_node *parent = app->mad.rb_node;
  231. struct mrp_attr *attr;
  232. int d;
  233. while (parent) {
  234. attr = rb_entry(parent, struct mrp_attr, node);
  235. d = mrp_attr_cmp(attr, value, len, type);
  236. if (d > 0)
  237. parent = parent->rb_left;
  238. else if (d < 0)
  239. parent = parent->rb_right;
  240. else
  241. return attr;
  242. }
  243. return NULL;
  244. }
  245. static struct mrp_attr *mrp_attr_create(struct mrp_applicant *app,
  246. const void *value, u8 len, u8 type)
  247. {
  248. struct rb_node *parent = NULL, **p = &app->mad.rb_node;
  249. struct mrp_attr *attr;
  250. int d;
  251. while (*p) {
  252. parent = *p;
  253. attr = rb_entry(parent, struct mrp_attr, node);
  254. d = mrp_attr_cmp(attr, value, len, type);
  255. if (d > 0)
  256. p = &parent->rb_left;
  257. else if (d < 0)
  258. p = &parent->rb_right;
  259. else {
  260. /* The attribute already exists; re-use it. */
  261. return attr;
  262. }
  263. }
  264. attr = kmalloc(sizeof(*attr) + len, GFP_ATOMIC);
  265. if (!attr)
  266. return attr;
  267. attr->state = MRP_APPLICANT_VO;
  268. attr->type = type;
  269. attr->len = len;
  270. memcpy(attr->value, value, len);
  271. rb_link_node(&attr->node, parent, p);
  272. rb_insert_color(&attr->node, &app->mad);
  273. return attr;
  274. }
  275. static void mrp_attr_destroy(struct mrp_applicant *app, struct mrp_attr *attr)
  276. {
  277. rb_erase(&attr->node, &app->mad);
  278. kfree(attr);
  279. }
  280. static int mrp_pdu_init(struct mrp_applicant *app)
  281. {
  282. struct sk_buff *skb;
  283. struct mrp_pdu_hdr *ph;
  284. skb = alloc_skb(app->dev->mtu + LL_RESERVED_SPACE(app->dev),
  285. GFP_ATOMIC);
  286. if (!skb)
  287. return -ENOMEM;
  288. skb->dev = app->dev;
  289. skb->protocol = app->app->pkttype.type;
  290. skb_reserve(skb, LL_RESERVED_SPACE(app->dev));
  291. skb_reset_network_header(skb);
  292. skb_reset_transport_header(skb);
  293. ph = (struct mrp_pdu_hdr *)__skb_put(skb, sizeof(*ph));
  294. ph->version = app->app->version;
  295. app->pdu = skb;
  296. return 0;
  297. }
  298. static int mrp_pdu_append_end_mark(struct mrp_applicant *app)
  299. {
  300. __be16 *endmark;
  301. if (skb_tailroom(app->pdu) < sizeof(*endmark))
  302. return -1;
  303. endmark = (__be16 *)__skb_put(app->pdu, sizeof(*endmark));
  304. put_unaligned(MRP_END_MARK, endmark);
  305. return 0;
  306. }
  307. static void mrp_pdu_queue(struct mrp_applicant *app)
  308. {
  309. if (!app->pdu)
  310. return;
  311. if (mrp_cb(app->pdu)->mh)
  312. mrp_pdu_append_end_mark(app);
  313. mrp_pdu_append_end_mark(app);
  314. dev_hard_header(app->pdu, app->dev, ntohs(app->app->pkttype.type),
  315. app->app->group_address, app->dev->dev_addr,
  316. app->pdu->len);
  317. skb_queue_tail(&app->queue, app->pdu);
  318. app->pdu = NULL;
  319. }
  320. static void mrp_queue_xmit(struct mrp_applicant *app)
  321. {
  322. struct sk_buff *skb;
  323. while ((skb = skb_dequeue(&app->queue)))
  324. dev_queue_xmit(skb);
  325. }
  326. static int mrp_pdu_append_msg_hdr(struct mrp_applicant *app,
  327. u8 attrtype, u8 attrlen)
  328. {
  329. struct mrp_msg_hdr *mh;
  330. if (mrp_cb(app->pdu)->mh) {
  331. if (mrp_pdu_append_end_mark(app) < 0)
  332. return -1;
  333. mrp_cb(app->pdu)->mh = NULL;
  334. mrp_cb(app->pdu)->vah = NULL;
  335. }
  336. if (skb_tailroom(app->pdu) < sizeof(*mh))
  337. return -1;
  338. mh = (struct mrp_msg_hdr *)__skb_put(app->pdu, sizeof(*mh));
  339. mh->attrtype = attrtype;
  340. mh->attrlen = attrlen;
  341. mrp_cb(app->pdu)->mh = mh;
  342. return 0;
  343. }
  344. static int mrp_pdu_append_vecattr_hdr(struct mrp_applicant *app,
  345. const void *firstattrvalue, u8 attrlen)
  346. {
  347. struct mrp_vecattr_hdr *vah;
  348. if (skb_tailroom(app->pdu) < sizeof(*vah) + attrlen)
  349. return -1;
  350. vah = (struct mrp_vecattr_hdr *)__skb_put(app->pdu,
  351. sizeof(*vah) + attrlen);
  352. put_unaligned(0, &vah->lenflags);
  353. memcpy(vah->firstattrvalue, firstattrvalue, attrlen);
  354. mrp_cb(app->pdu)->vah = vah;
  355. memcpy(mrp_cb(app->pdu)->attrvalue, firstattrvalue, attrlen);
  356. return 0;
  357. }
  358. static int mrp_pdu_append_vecattr_event(struct mrp_applicant *app,
  359. const struct mrp_attr *attr,
  360. enum mrp_vecattr_event vaevent)
  361. {
  362. u16 len, pos;
  363. u8 *vaevents;
  364. int err;
  365. again:
  366. if (!app->pdu) {
  367. err = mrp_pdu_init(app);
  368. if (err < 0)
  369. return err;
  370. }
  371. /* If there is no Message header in the PDU, or the Message header is
  372. * for a different attribute type, add an EndMark (if necessary) and a
  373. * new Message header to the PDU.
  374. */
  375. if (!mrp_cb(app->pdu)->mh ||
  376. mrp_cb(app->pdu)->mh->attrtype != attr->type ||
  377. mrp_cb(app->pdu)->mh->attrlen != attr->len) {
  378. if (mrp_pdu_append_msg_hdr(app, attr->type, attr->len) < 0)
  379. goto queue;
  380. }
  381. /* If there is no VectorAttribute header for this Message in the PDU,
  382. * or this attribute's value does not sequentially follow the previous
  383. * attribute's value, add a new VectorAttribute header to the PDU.
  384. */
  385. if (!mrp_cb(app->pdu)->vah ||
  386. memcmp(mrp_cb(app->pdu)->attrvalue, attr->value, attr->len)) {
  387. if (mrp_pdu_append_vecattr_hdr(app, attr->value, attr->len) < 0)
  388. goto queue;
  389. }
  390. len = be16_to_cpu(get_unaligned(&mrp_cb(app->pdu)->vah->lenflags));
  391. pos = len % 3;
  392. /* Events are packed into Vectors in the PDU, three to a byte. Add a
  393. * byte to the end of the Vector if necessary.
  394. */
  395. if (!pos) {
  396. if (skb_tailroom(app->pdu) < sizeof(u8))
  397. goto queue;
  398. vaevents = (u8 *)__skb_put(app->pdu, sizeof(u8));
  399. } else {
  400. vaevents = (u8 *)(skb_tail_pointer(app->pdu) - sizeof(u8));
  401. }
  402. switch (pos) {
  403. case 0:
  404. *vaevents = vaevent * (__MRP_VECATTR_EVENT_MAX *
  405. __MRP_VECATTR_EVENT_MAX);
  406. break;
  407. case 1:
  408. *vaevents += vaevent * __MRP_VECATTR_EVENT_MAX;
  409. break;
  410. case 2:
  411. *vaevents += vaevent;
  412. break;
  413. default:
  414. WARN_ON(1);
  415. }
  416. /* Increment the length of the VectorAttribute in the PDU, as well as
  417. * the value of the next attribute that would continue its Vector.
  418. */
  419. put_unaligned(cpu_to_be16(++len), &mrp_cb(app->pdu)->vah->lenflags);
  420. mrp_attrvalue_inc(mrp_cb(app->pdu)->attrvalue, attr->len);
  421. return 0;
  422. queue:
  423. mrp_pdu_queue(app);
  424. goto again;
  425. }
  426. static void mrp_attr_event(struct mrp_applicant *app,
  427. struct mrp_attr *attr, enum mrp_event event)
  428. {
  429. enum mrp_applicant_state state;
  430. state = mrp_applicant_state_table[attr->state][event];
  431. if (state == MRP_APPLICANT_INVALID) {
  432. WARN_ON(1);
  433. return;
  434. }
  435. if (event == MRP_EVENT_TX) {
  436. /* When appending the attribute fails, don't update its state
  437. * in order to retry at the next TX event.
  438. */
  439. switch (mrp_tx_action_table[attr->state]) {
  440. case MRP_TX_ACTION_NONE:
  441. case MRP_TX_ACTION_S_JOIN_IN_OPTIONAL:
  442. case MRP_TX_ACTION_S_IN_OPTIONAL:
  443. break;
  444. case MRP_TX_ACTION_S_NEW:
  445. if (mrp_pdu_append_vecattr_event(
  446. app, attr, MRP_VECATTR_EVENT_NEW) < 0)
  447. return;
  448. break;
  449. case MRP_TX_ACTION_S_JOIN_IN:
  450. if (mrp_pdu_append_vecattr_event(
  451. app, attr, MRP_VECATTR_EVENT_JOIN_IN) < 0)
  452. return;
  453. break;
  454. case MRP_TX_ACTION_S_LV:
  455. if (mrp_pdu_append_vecattr_event(
  456. app, attr, MRP_VECATTR_EVENT_LV) < 0)
  457. return;
  458. /* As a pure applicant, sending a leave message
  459. * implies that the attribute was unregistered and
  460. * can be destroyed.
  461. */
  462. mrp_attr_destroy(app, attr);
  463. return;
  464. default:
  465. WARN_ON(1);
  466. }
  467. }
  468. attr->state = state;
  469. }
  470. int mrp_request_join(const struct net_device *dev,
  471. const struct mrp_application *appl,
  472. const void *value, u8 len, u8 type)
  473. {
  474. struct mrp_port *port = rtnl_dereference(dev->mrp_port);
  475. struct mrp_applicant *app = rtnl_dereference(
  476. port->applicants[appl->type]);
  477. struct mrp_attr *attr;
  478. if (sizeof(struct mrp_skb_cb) + len >
  479. FIELD_SIZEOF(struct sk_buff, cb))
  480. return -ENOMEM;
  481. spin_lock_bh(&app->lock);
  482. attr = mrp_attr_create(app, value, len, type);
  483. if (!attr) {
  484. spin_unlock_bh(&app->lock);
  485. return -ENOMEM;
  486. }
  487. mrp_attr_event(app, attr, MRP_EVENT_JOIN);
  488. spin_unlock_bh(&app->lock);
  489. return 0;
  490. }
  491. EXPORT_SYMBOL_GPL(mrp_request_join);
  492. void mrp_request_leave(const struct net_device *dev,
  493. const struct mrp_application *appl,
  494. const void *value, u8 len, u8 type)
  495. {
  496. struct mrp_port *port = rtnl_dereference(dev->mrp_port);
  497. struct mrp_applicant *app = rtnl_dereference(
  498. port->applicants[appl->type]);
  499. struct mrp_attr *attr;
  500. if (sizeof(struct mrp_skb_cb) + len >
  501. FIELD_SIZEOF(struct sk_buff, cb))
  502. return;
  503. spin_lock_bh(&app->lock);
  504. attr = mrp_attr_lookup(app, value, len, type);
  505. if (!attr) {
  506. spin_unlock_bh(&app->lock);
  507. return;
  508. }
  509. mrp_attr_event(app, attr, MRP_EVENT_LV);
  510. spin_unlock_bh(&app->lock);
  511. }
  512. EXPORT_SYMBOL_GPL(mrp_request_leave);
  513. static void mrp_mad_event(struct mrp_applicant *app, enum mrp_event event)
  514. {
  515. struct rb_node *node, *next;
  516. struct mrp_attr *attr;
  517. for (node = rb_first(&app->mad);
  518. next = node ? rb_next(node) : NULL, node != NULL;
  519. node = next) {
  520. attr = rb_entry(node, struct mrp_attr, node);
  521. mrp_attr_event(app, attr, event);
  522. }
  523. }
  524. static void mrp_join_timer_arm(struct mrp_applicant *app)
  525. {
  526. unsigned long delay;
  527. delay = (u64)msecs_to_jiffies(mrp_join_time) * net_random() >> 32;
  528. mod_timer(&app->join_timer, jiffies + delay);
  529. }
  530. static void mrp_join_timer(unsigned long data)
  531. {
  532. struct mrp_applicant *app = (struct mrp_applicant *)data;
  533. spin_lock(&app->lock);
  534. mrp_mad_event(app, MRP_EVENT_TX);
  535. mrp_pdu_queue(app);
  536. spin_unlock(&app->lock);
  537. mrp_queue_xmit(app);
  538. mrp_join_timer_arm(app);
  539. }
  540. static int mrp_pdu_parse_end_mark(struct sk_buff *skb, int *offset)
  541. {
  542. __be16 endmark;
  543. if (skb_copy_bits(skb, *offset, &endmark, sizeof(endmark)) < 0)
  544. return -1;
  545. if (endmark == MRP_END_MARK) {
  546. *offset += sizeof(endmark);
  547. return -1;
  548. }
  549. return 0;
  550. }
  551. static void mrp_pdu_parse_vecattr_event(struct mrp_applicant *app,
  552. struct sk_buff *skb,
  553. enum mrp_vecattr_event vaevent)
  554. {
  555. struct mrp_attr *attr;
  556. enum mrp_event event;
  557. attr = mrp_attr_lookup(app, mrp_cb(skb)->attrvalue,
  558. mrp_cb(skb)->mh->attrlen,
  559. mrp_cb(skb)->mh->attrtype);
  560. if (attr == NULL)
  561. return;
  562. switch (vaevent) {
  563. case MRP_VECATTR_EVENT_NEW:
  564. event = MRP_EVENT_R_NEW;
  565. break;
  566. case MRP_VECATTR_EVENT_JOIN_IN:
  567. event = MRP_EVENT_R_JOIN_IN;
  568. break;
  569. case MRP_VECATTR_EVENT_IN:
  570. event = MRP_EVENT_R_IN;
  571. break;
  572. case MRP_VECATTR_EVENT_JOIN_MT:
  573. event = MRP_EVENT_R_JOIN_MT;
  574. break;
  575. case MRP_VECATTR_EVENT_MT:
  576. event = MRP_EVENT_R_MT;
  577. break;
  578. case MRP_VECATTR_EVENT_LV:
  579. event = MRP_EVENT_R_LV;
  580. break;
  581. default:
  582. return;
  583. }
  584. mrp_attr_event(app, attr, event);
  585. }
  586. static int mrp_pdu_parse_vecattr(struct mrp_applicant *app,
  587. struct sk_buff *skb, int *offset)
  588. {
  589. struct mrp_vecattr_hdr _vah;
  590. u16 valen;
  591. u8 vaevents, vaevent;
  592. mrp_cb(skb)->vah = skb_header_pointer(skb, *offset, sizeof(_vah),
  593. &_vah);
  594. if (!mrp_cb(skb)->vah)
  595. return -1;
  596. *offset += sizeof(_vah);
  597. if (get_unaligned(&mrp_cb(skb)->vah->lenflags) &
  598. MRP_VECATTR_HDR_FLAG_LA)
  599. mrp_mad_event(app, MRP_EVENT_R_LA);
  600. valen = be16_to_cpu(get_unaligned(&mrp_cb(skb)->vah->lenflags) &
  601. MRP_VECATTR_HDR_LEN_MASK);
  602. /* The VectorAttribute structure in a PDU carries event information
  603. * about one or more attributes having consecutive values. Only the
  604. * value for the first attribute is contained in the structure. So
  605. * we make a copy of that value, and then increment it each time we
  606. * advance to the next event in its Vector.
  607. */
  608. if (sizeof(struct mrp_skb_cb) + mrp_cb(skb)->mh->attrlen >
  609. FIELD_SIZEOF(struct sk_buff, cb))
  610. return -1;
  611. if (skb_copy_bits(skb, *offset, mrp_cb(skb)->attrvalue,
  612. mrp_cb(skb)->mh->attrlen) < 0)
  613. return -1;
  614. *offset += mrp_cb(skb)->mh->attrlen;
  615. /* In a VectorAttribute, the Vector contains events which are packed
  616. * three to a byte. We process one byte of the Vector at a time.
  617. */
  618. while (valen > 0) {
  619. if (skb_copy_bits(skb, *offset, &vaevents,
  620. sizeof(vaevents)) < 0)
  621. return -1;
  622. *offset += sizeof(vaevents);
  623. /* Extract and process the first event. */
  624. vaevent = vaevents / (__MRP_VECATTR_EVENT_MAX *
  625. __MRP_VECATTR_EVENT_MAX);
  626. if (vaevent >= __MRP_VECATTR_EVENT_MAX) {
  627. /* The byte is malformed; stop processing. */
  628. return -1;
  629. }
  630. mrp_pdu_parse_vecattr_event(app, skb, vaevent);
  631. /* If present, extract and process the second event. */
  632. if (!--valen)
  633. break;
  634. mrp_attrvalue_inc(mrp_cb(skb)->attrvalue,
  635. mrp_cb(skb)->mh->attrlen);
  636. vaevents %= (__MRP_VECATTR_EVENT_MAX *
  637. __MRP_VECATTR_EVENT_MAX);
  638. vaevent = vaevents / __MRP_VECATTR_EVENT_MAX;
  639. mrp_pdu_parse_vecattr_event(app, skb, vaevent);
  640. /* If present, extract and process the third event. */
  641. if (!--valen)
  642. break;
  643. mrp_attrvalue_inc(mrp_cb(skb)->attrvalue,
  644. mrp_cb(skb)->mh->attrlen);
  645. vaevents %= __MRP_VECATTR_EVENT_MAX;
  646. vaevent = vaevents;
  647. mrp_pdu_parse_vecattr_event(app, skb, vaevent);
  648. }
  649. return 0;
  650. }
  651. static int mrp_pdu_parse_msg(struct mrp_applicant *app, struct sk_buff *skb,
  652. int *offset)
  653. {
  654. struct mrp_msg_hdr _mh;
  655. mrp_cb(skb)->mh = skb_header_pointer(skb, *offset, sizeof(_mh), &_mh);
  656. if (!mrp_cb(skb)->mh)
  657. return -1;
  658. *offset += sizeof(_mh);
  659. if (mrp_cb(skb)->mh->attrtype == 0 ||
  660. mrp_cb(skb)->mh->attrtype > app->app->maxattr ||
  661. mrp_cb(skb)->mh->attrlen == 0)
  662. return -1;
  663. while (skb->len > *offset) {
  664. if (mrp_pdu_parse_end_mark(skb, offset) < 0)
  665. break;
  666. if (mrp_pdu_parse_vecattr(app, skb, offset) < 0)
  667. return -1;
  668. }
  669. return 0;
  670. }
  671. static int mrp_rcv(struct sk_buff *skb, struct net_device *dev,
  672. struct packet_type *pt, struct net_device *orig_dev)
  673. {
  674. struct mrp_application *appl = container_of(pt, struct mrp_application,
  675. pkttype);
  676. struct mrp_port *port;
  677. struct mrp_applicant *app;
  678. struct mrp_pdu_hdr _ph;
  679. const struct mrp_pdu_hdr *ph;
  680. int offset = skb_network_offset(skb);
  681. /* If the interface is in promiscuous mode, drop the packet if
  682. * it was unicast to another host.
  683. */
  684. if (unlikely(skb->pkt_type == PACKET_OTHERHOST))
  685. goto out;
  686. skb = skb_share_check(skb, GFP_ATOMIC);
  687. if (unlikely(!skb))
  688. goto out;
  689. port = rcu_dereference(dev->mrp_port);
  690. if (unlikely(!port))
  691. goto out;
  692. app = rcu_dereference(port->applicants[appl->type]);
  693. if (unlikely(!app))
  694. goto out;
  695. ph = skb_header_pointer(skb, offset, sizeof(_ph), &_ph);
  696. if (!ph)
  697. goto out;
  698. offset += sizeof(_ph);
  699. if (ph->version != app->app->version)
  700. goto out;
  701. spin_lock(&app->lock);
  702. while (skb->len > offset) {
  703. if (mrp_pdu_parse_end_mark(skb, &offset) < 0)
  704. break;
  705. if (mrp_pdu_parse_msg(app, skb, &offset) < 0)
  706. break;
  707. }
  708. spin_unlock(&app->lock);
  709. out:
  710. kfree_skb(skb);
  711. return 0;
  712. }
  713. static int mrp_init_port(struct net_device *dev)
  714. {
  715. struct mrp_port *port;
  716. port = kzalloc(sizeof(*port), GFP_KERNEL);
  717. if (!port)
  718. return -ENOMEM;
  719. rcu_assign_pointer(dev->mrp_port, port);
  720. return 0;
  721. }
  722. static void mrp_release_port(struct net_device *dev)
  723. {
  724. struct mrp_port *port = rtnl_dereference(dev->mrp_port);
  725. unsigned int i;
  726. for (i = 0; i <= MRP_APPLICATION_MAX; i++) {
  727. if (rtnl_dereference(port->applicants[i]))
  728. return;
  729. }
  730. RCU_INIT_POINTER(dev->mrp_port, NULL);
  731. kfree_rcu(port, rcu);
  732. }
  733. int mrp_init_applicant(struct net_device *dev, struct mrp_application *appl)
  734. {
  735. struct mrp_applicant *app;
  736. int err;
  737. ASSERT_RTNL();
  738. if (!rtnl_dereference(dev->mrp_port)) {
  739. err = mrp_init_port(dev);
  740. if (err < 0)
  741. goto err1;
  742. }
  743. err = -ENOMEM;
  744. app = kzalloc(sizeof(*app), GFP_KERNEL);
  745. if (!app)
  746. goto err2;
  747. err = dev_mc_add(dev, appl->group_address);
  748. if (err < 0)
  749. goto err3;
  750. app->dev = dev;
  751. app->app = appl;
  752. app->mad = RB_ROOT;
  753. spin_lock_init(&app->lock);
  754. skb_queue_head_init(&app->queue);
  755. rcu_assign_pointer(dev->mrp_port->applicants[appl->type], app);
  756. setup_timer(&app->join_timer, mrp_join_timer, (unsigned long)app);
  757. mrp_join_timer_arm(app);
  758. return 0;
  759. err3:
  760. kfree(app);
  761. err2:
  762. mrp_release_port(dev);
  763. err1:
  764. return err;
  765. }
  766. EXPORT_SYMBOL_GPL(mrp_init_applicant);
  767. void mrp_uninit_applicant(struct net_device *dev, struct mrp_application *appl)
  768. {
  769. struct mrp_port *port = rtnl_dereference(dev->mrp_port);
  770. struct mrp_applicant *app = rtnl_dereference(
  771. port->applicants[appl->type]);
  772. ASSERT_RTNL();
  773. RCU_INIT_POINTER(port->applicants[appl->type], NULL);
  774. /* Delete timer and generate a final TX event to flush out
  775. * all pending messages before the applicant is gone.
  776. */
  777. del_timer_sync(&app->join_timer);
  778. mrp_mad_event(app, MRP_EVENT_TX);
  779. mrp_pdu_queue(app);
  780. mrp_queue_xmit(app);
  781. dev_mc_del(dev, appl->group_address);
  782. kfree_rcu(app, rcu);
  783. mrp_release_port(dev);
  784. }
  785. EXPORT_SYMBOL_GPL(mrp_uninit_applicant);
  786. int mrp_register_application(struct mrp_application *appl)
  787. {
  788. appl->pkttype.func = mrp_rcv;
  789. dev_add_pack(&appl->pkttype);
  790. return 0;
  791. }
  792. EXPORT_SYMBOL_GPL(mrp_register_application);
  793. void mrp_unregister_application(struct mrp_application *appl)
  794. {
  795. dev_remove_pack(&appl->pkttype);
  796. }
  797. EXPORT_SYMBOL_GPL(mrp_unregister_application);