translation-table.c 64 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320
  1. /* Copyright (C) 2007-2012 B.A.T.M.A.N. contributors:
  2. *
  3. * Marek Lindner, Simon Wunderlich, Antonio Quartulli
  4. *
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of version 2 of the GNU General Public
  7. * License as published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it will be useful, but
  10. * WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. * General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write to the Free Software
  16. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  17. * 02110-1301, USA
  18. */
  19. #include "main.h"
  20. #include "translation-table.h"
  21. #include "soft-interface.h"
  22. #include "hard-interface.h"
  23. #include "send.h"
  24. #include "hash.h"
  25. #include "originator.h"
  26. #include "routing.h"
  27. #include "bridge_loop_avoidance.h"
  28. #include <linux/crc16.h>
  29. static void batadv_send_roam_adv(struct bat_priv *bat_priv, uint8_t *client,
  30. struct orig_node *orig_node);
  31. static void batadv_tt_purge(struct work_struct *work);
  32. static void
  33. batadv_tt_global_del_orig_list(struct tt_global_entry *tt_global_entry);
  34. /* returns 1 if they are the same mac addr */
  35. static int batadv_compare_tt(const struct hlist_node *node, const void *data2)
  36. {
  37. const void *data1 = container_of(node, struct tt_common_entry,
  38. hash_entry);
  39. return (memcmp(data1, data2, ETH_ALEN) == 0 ? 1 : 0);
  40. }
  41. static void batadv_tt_start_timer(struct bat_priv *bat_priv)
  42. {
  43. INIT_DELAYED_WORK(&bat_priv->tt_work, batadv_tt_purge);
  44. queue_delayed_work(batadv_event_workqueue, &bat_priv->tt_work,
  45. msecs_to_jiffies(5000));
  46. }
  47. static struct tt_common_entry *batadv_tt_hash_find(struct hashtable_t *hash,
  48. const void *data)
  49. {
  50. struct hlist_head *head;
  51. struct hlist_node *node;
  52. struct tt_common_entry *tt_common_entry, *tt_common_entry_tmp = NULL;
  53. uint32_t index;
  54. if (!hash)
  55. return NULL;
  56. index = batadv_choose_orig(data, hash->size);
  57. head = &hash->table[index];
  58. rcu_read_lock();
  59. hlist_for_each_entry_rcu(tt_common_entry, node, head, hash_entry) {
  60. if (!batadv_compare_eth(tt_common_entry, data))
  61. continue;
  62. if (!atomic_inc_not_zero(&tt_common_entry->refcount))
  63. continue;
  64. tt_common_entry_tmp = tt_common_entry;
  65. break;
  66. }
  67. rcu_read_unlock();
  68. return tt_common_entry_tmp;
  69. }
  70. static struct tt_local_entry *
  71. batadv_tt_local_hash_find(struct bat_priv *bat_priv, const void *data)
  72. {
  73. struct tt_common_entry *tt_common_entry;
  74. struct tt_local_entry *tt_local_entry = NULL;
  75. tt_common_entry = batadv_tt_hash_find(bat_priv->tt_local_hash, data);
  76. if (tt_common_entry)
  77. tt_local_entry = container_of(tt_common_entry,
  78. struct tt_local_entry, common);
  79. return tt_local_entry;
  80. }
  81. static struct tt_global_entry *
  82. batadv_tt_global_hash_find(struct bat_priv *bat_priv, const void *data)
  83. {
  84. struct tt_common_entry *tt_common_entry;
  85. struct tt_global_entry *tt_global_entry = NULL;
  86. tt_common_entry = batadv_tt_hash_find(bat_priv->tt_global_hash, data);
  87. if (tt_common_entry)
  88. tt_global_entry = container_of(tt_common_entry,
  89. struct tt_global_entry, common);
  90. return tt_global_entry;
  91. }
  92. static void
  93. batadv_tt_local_entry_free_ref(struct tt_local_entry *tt_local_entry)
  94. {
  95. if (atomic_dec_and_test(&tt_local_entry->common.refcount))
  96. kfree_rcu(tt_local_entry, common.rcu);
  97. }
  98. static void batadv_tt_global_entry_free_rcu(struct rcu_head *rcu)
  99. {
  100. struct tt_common_entry *tt_common_entry;
  101. struct tt_global_entry *tt_global_entry;
  102. tt_common_entry = container_of(rcu, struct tt_common_entry, rcu);
  103. tt_global_entry = container_of(tt_common_entry, struct tt_global_entry,
  104. common);
  105. kfree(tt_global_entry);
  106. }
  107. static void
  108. batadv_tt_global_entry_free_ref(struct tt_global_entry *tt_global_entry)
  109. {
  110. if (atomic_dec_and_test(&tt_global_entry->common.refcount)) {
  111. batadv_tt_global_del_orig_list(tt_global_entry);
  112. call_rcu(&tt_global_entry->common.rcu,
  113. batadv_tt_global_entry_free_rcu);
  114. }
  115. }
  116. static void batadv_tt_orig_list_entry_free_rcu(struct rcu_head *rcu)
  117. {
  118. struct tt_orig_list_entry *orig_entry;
  119. orig_entry = container_of(rcu, struct tt_orig_list_entry, rcu);
  120. batadv_orig_node_free_ref(orig_entry->orig_node);
  121. kfree(orig_entry);
  122. }
  123. static void
  124. batadv_tt_orig_list_entry_free_ref(struct tt_orig_list_entry *orig_entry)
  125. {
  126. /* to avoid race conditions, immediately decrease the tt counter */
  127. atomic_dec(&orig_entry->orig_node->tt_size);
  128. call_rcu(&orig_entry->rcu, batadv_tt_orig_list_entry_free_rcu);
  129. }
  130. static void batadv_tt_local_event(struct bat_priv *bat_priv,
  131. const uint8_t *addr, uint8_t flags)
  132. {
  133. struct tt_change_node *tt_change_node, *entry, *safe;
  134. bool event_removed = false;
  135. bool del_op_requested, del_op_entry;
  136. tt_change_node = kmalloc(sizeof(*tt_change_node), GFP_ATOMIC);
  137. if (!tt_change_node)
  138. return;
  139. tt_change_node->change.flags = flags;
  140. memcpy(tt_change_node->change.addr, addr, ETH_ALEN);
  141. del_op_requested = flags & TT_CLIENT_DEL;
  142. /* check for ADD+DEL or DEL+ADD events */
  143. spin_lock_bh(&bat_priv->tt_changes_list_lock);
  144. list_for_each_entry_safe(entry, safe, &bat_priv->tt_changes_list,
  145. list) {
  146. if (!batadv_compare_eth(entry->change.addr, addr))
  147. continue;
  148. /* DEL+ADD in the same orig interval have no effect and can be
  149. * removed to avoid silly behaviour on the receiver side. The
  150. * other way around (ADD+DEL) can happen in case of roaming of
  151. * a client still in the NEW state. Roaming of NEW clients is
  152. * now possible due to automatically recognition of "temporary"
  153. * clients
  154. */
  155. del_op_entry = entry->change.flags & TT_CLIENT_DEL;
  156. if (!del_op_requested && del_op_entry)
  157. goto del;
  158. if (del_op_requested && !del_op_entry)
  159. goto del;
  160. continue;
  161. del:
  162. list_del(&entry->list);
  163. kfree(entry);
  164. event_removed = true;
  165. goto unlock;
  166. }
  167. /* track the change in the OGMinterval list */
  168. list_add_tail(&tt_change_node->list, &bat_priv->tt_changes_list);
  169. unlock:
  170. spin_unlock_bh(&bat_priv->tt_changes_list_lock);
  171. if (event_removed)
  172. atomic_dec(&bat_priv->tt_local_changes);
  173. else
  174. atomic_inc(&bat_priv->tt_local_changes);
  175. }
  176. int batadv_tt_len(int changes_num)
  177. {
  178. return changes_num * sizeof(struct tt_change);
  179. }
  180. static int batadv_tt_local_init(struct bat_priv *bat_priv)
  181. {
  182. if (bat_priv->tt_local_hash)
  183. return 0;
  184. bat_priv->tt_local_hash = batadv_hash_new(1024);
  185. if (!bat_priv->tt_local_hash)
  186. return -ENOMEM;
  187. return 0;
  188. }
  189. void batadv_tt_local_add(struct net_device *soft_iface, const uint8_t *addr,
  190. int ifindex)
  191. {
  192. struct bat_priv *bat_priv = netdev_priv(soft_iface);
  193. struct tt_local_entry *tt_local_entry = NULL;
  194. struct tt_global_entry *tt_global_entry = NULL;
  195. struct hlist_head *head;
  196. struct hlist_node *node;
  197. struct tt_orig_list_entry *orig_entry;
  198. int hash_added;
  199. tt_local_entry = batadv_tt_local_hash_find(bat_priv, addr);
  200. if (tt_local_entry) {
  201. tt_local_entry->last_seen = jiffies;
  202. /* possibly unset the TT_CLIENT_PENDING flag */
  203. tt_local_entry->common.flags &= ~TT_CLIENT_PENDING;
  204. goto out;
  205. }
  206. tt_local_entry = kmalloc(sizeof(*tt_local_entry), GFP_ATOMIC);
  207. if (!tt_local_entry)
  208. goto out;
  209. batadv_dbg(DBG_TT, bat_priv,
  210. "Creating new local tt entry: %pM (ttvn: %d)\n", addr,
  211. (uint8_t)atomic_read(&bat_priv->ttvn));
  212. memcpy(tt_local_entry->common.addr, addr, ETH_ALEN);
  213. tt_local_entry->common.flags = NO_FLAGS;
  214. if (batadv_is_wifi_iface(ifindex))
  215. tt_local_entry->common.flags |= TT_CLIENT_WIFI;
  216. atomic_set(&tt_local_entry->common.refcount, 2);
  217. tt_local_entry->last_seen = jiffies;
  218. /* the batman interface mac address should never be purged */
  219. if (batadv_compare_eth(addr, soft_iface->dev_addr))
  220. tt_local_entry->common.flags |= TT_CLIENT_NOPURGE;
  221. /* The local entry has to be marked as NEW to avoid to send it in
  222. * a full table response going out before the next ttvn increment
  223. * (consistency check)
  224. */
  225. tt_local_entry->common.flags |= TT_CLIENT_NEW;
  226. hash_added = batadv_hash_add(bat_priv->tt_local_hash, batadv_compare_tt,
  227. batadv_choose_orig,
  228. &tt_local_entry->common,
  229. &tt_local_entry->common.hash_entry);
  230. if (unlikely(hash_added != 0)) {
  231. /* remove the reference for the hash */
  232. batadv_tt_local_entry_free_ref(tt_local_entry);
  233. goto out;
  234. }
  235. batadv_tt_local_event(bat_priv, addr, tt_local_entry->common.flags);
  236. /* remove address from global hash if present */
  237. tt_global_entry = batadv_tt_global_hash_find(bat_priv, addr);
  238. /* Check whether it is a roaming! */
  239. if (tt_global_entry) {
  240. /* These node are probably going to update their tt table */
  241. head = &tt_global_entry->orig_list;
  242. rcu_read_lock();
  243. hlist_for_each_entry_rcu(orig_entry, node, head, list) {
  244. orig_entry->orig_node->tt_poss_change = true;
  245. batadv_send_roam_adv(bat_priv,
  246. tt_global_entry->common.addr,
  247. orig_entry->orig_node);
  248. }
  249. rcu_read_unlock();
  250. /* The global entry has to be marked as ROAMING and
  251. * has to be kept for consistency purpose
  252. */
  253. tt_global_entry->common.flags |= TT_CLIENT_ROAM;
  254. tt_global_entry->roam_at = jiffies;
  255. }
  256. out:
  257. if (tt_local_entry)
  258. batadv_tt_local_entry_free_ref(tt_local_entry);
  259. if (tt_global_entry)
  260. batadv_tt_global_entry_free_ref(tt_global_entry);
  261. }
  262. static void batadv_tt_realloc_packet_buff(unsigned char **packet_buff,
  263. int *packet_buff_len,
  264. int min_packet_len,
  265. int new_packet_len)
  266. {
  267. unsigned char *new_buff;
  268. new_buff = kmalloc(new_packet_len, GFP_ATOMIC);
  269. /* keep old buffer if kmalloc should fail */
  270. if (new_buff) {
  271. memcpy(new_buff, *packet_buff, min_packet_len);
  272. kfree(*packet_buff);
  273. *packet_buff = new_buff;
  274. *packet_buff_len = new_packet_len;
  275. }
  276. }
  277. static void batadv_tt_prepare_packet_buff(struct bat_priv *bat_priv,
  278. unsigned char **packet_buff,
  279. int *packet_buff_len,
  280. int min_packet_len)
  281. {
  282. struct hard_iface *primary_if;
  283. int req_len;
  284. primary_if = batadv_primary_if_get_selected(bat_priv);
  285. req_len = min_packet_len;
  286. req_len += batadv_tt_len(atomic_read(&bat_priv->tt_local_changes));
  287. /* if we have too many changes for one packet don't send any
  288. * and wait for the tt table request which will be fragmented
  289. */
  290. if ((!primary_if) || (req_len > primary_if->soft_iface->mtu))
  291. req_len = min_packet_len;
  292. batadv_tt_realloc_packet_buff(packet_buff, packet_buff_len,
  293. min_packet_len, req_len);
  294. if (primary_if)
  295. batadv_hardif_free_ref(primary_if);
  296. }
  297. static int batadv_tt_changes_fill_buff(struct bat_priv *bat_priv,
  298. unsigned char **packet_buff,
  299. int *packet_buff_len,
  300. int min_packet_len)
  301. {
  302. struct tt_change_node *entry, *safe;
  303. int count = 0, tot_changes = 0, new_len;
  304. unsigned char *tt_buff;
  305. batadv_tt_prepare_packet_buff(bat_priv, packet_buff,
  306. packet_buff_len, min_packet_len);
  307. new_len = *packet_buff_len - min_packet_len;
  308. tt_buff = *packet_buff + min_packet_len;
  309. if (new_len > 0)
  310. tot_changes = new_len / batadv_tt_len(1);
  311. spin_lock_bh(&bat_priv->tt_changes_list_lock);
  312. atomic_set(&bat_priv->tt_local_changes, 0);
  313. list_for_each_entry_safe(entry, safe, &bat_priv->tt_changes_list,
  314. list) {
  315. if (count < tot_changes) {
  316. memcpy(tt_buff + batadv_tt_len(count),
  317. &entry->change, sizeof(struct tt_change));
  318. count++;
  319. }
  320. list_del(&entry->list);
  321. kfree(entry);
  322. }
  323. spin_unlock_bh(&bat_priv->tt_changes_list_lock);
  324. /* Keep the buffer for possible tt_request */
  325. spin_lock_bh(&bat_priv->tt_buff_lock);
  326. kfree(bat_priv->tt_buff);
  327. bat_priv->tt_buff_len = 0;
  328. bat_priv->tt_buff = NULL;
  329. /* check whether this new OGM has no changes due to size problems */
  330. if (new_len > 0) {
  331. /* if kmalloc() fails we will reply with the full table
  332. * instead of providing the diff
  333. */
  334. bat_priv->tt_buff = kmalloc(new_len, GFP_ATOMIC);
  335. if (bat_priv->tt_buff) {
  336. memcpy(bat_priv->tt_buff, tt_buff, new_len);
  337. bat_priv->tt_buff_len = new_len;
  338. }
  339. }
  340. spin_unlock_bh(&bat_priv->tt_buff_lock);
  341. return count;
  342. }
  343. int batadv_tt_local_seq_print_text(struct seq_file *seq, void *offset)
  344. {
  345. struct net_device *net_dev = (struct net_device *)seq->private;
  346. struct bat_priv *bat_priv = netdev_priv(net_dev);
  347. struct hashtable_t *hash = bat_priv->tt_local_hash;
  348. struct tt_common_entry *tt_common_entry;
  349. struct hard_iface *primary_if;
  350. struct hlist_node *node;
  351. struct hlist_head *head;
  352. uint32_t i;
  353. int ret = 0;
  354. primary_if = batadv_primary_if_get_selected(bat_priv);
  355. if (!primary_if) {
  356. ret = seq_printf(seq,
  357. "BATMAN mesh %s disabled - please specify interfaces to enable it\n",
  358. net_dev->name);
  359. goto out;
  360. }
  361. if (primary_if->if_status != IF_ACTIVE) {
  362. ret = seq_printf(seq,
  363. "BATMAN mesh %s disabled - primary interface not active\n",
  364. net_dev->name);
  365. goto out;
  366. }
  367. seq_printf(seq,
  368. "Locally retrieved addresses (from %s) announced via TT (TTVN: %u):\n",
  369. net_dev->name, (uint8_t)atomic_read(&bat_priv->ttvn));
  370. for (i = 0; i < hash->size; i++) {
  371. head = &hash->table[i];
  372. rcu_read_lock();
  373. hlist_for_each_entry_rcu(tt_common_entry, node,
  374. head, hash_entry) {
  375. seq_printf(seq, " * %pM [%c%c%c%c%c]\n",
  376. tt_common_entry->addr,
  377. (tt_common_entry->flags &
  378. TT_CLIENT_ROAM ? 'R' : '.'),
  379. (tt_common_entry->flags &
  380. TT_CLIENT_NOPURGE ? 'P' : '.'),
  381. (tt_common_entry->flags &
  382. TT_CLIENT_NEW ? 'N' : '.'),
  383. (tt_common_entry->flags &
  384. TT_CLIENT_PENDING ? 'X' : '.'),
  385. (tt_common_entry->flags &
  386. TT_CLIENT_WIFI ? 'W' : '.'));
  387. }
  388. rcu_read_unlock();
  389. }
  390. out:
  391. if (primary_if)
  392. batadv_hardif_free_ref(primary_if);
  393. return ret;
  394. }
  395. static void batadv_tt_local_set_pending(struct bat_priv *bat_priv,
  396. struct tt_local_entry *tt_local_entry,
  397. uint16_t flags, const char *message)
  398. {
  399. batadv_tt_local_event(bat_priv, tt_local_entry->common.addr,
  400. tt_local_entry->common.flags | flags);
  401. /* The local client has to be marked as "pending to be removed" but has
  402. * to be kept in the table in order to send it in a full table
  403. * response issued before the net ttvn increment (consistency check)
  404. */
  405. tt_local_entry->common.flags |= TT_CLIENT_PENDING;
  406. batadv_dbg(DBG_TT, bat_priv,
  407. "Local tt entry (%pM) pending to be removed: %s\n",
  408. tt_local_entry->common.addr, message);
  409. }
  410. void batadv_tt_local_remove(struct bat_priv *bat_priv, const uint8_t *addr,
  411. const char *message, bool roaming)
  412. {
  413. struct tt_local_entry *tt_local_entry = NULL;
  414. tt_local_entry = batadv_tt_local_hash_find(bat_priv, addr);
  415. if (!tt_local_entry)
  416. goto out;
  417. batadv_tt_local_set_pending(bat_priv, tt_local_entry, TT_CLIENT_DEL |
  418. (roaming ? TT_CLIENT_ROAM : NO_FLAGS),
  419. message);
  420. out:
  421. if (tt_local_entry)
  422. batadv_tt_local_entry_free_ref(tt_local_entry);
  423. }
  424. static void batadv_tt_local_purge(struct bat_priv *bat_priv)
  425. {
  426. struct hashtable_t *hash = bat_priv->tt_local_hash;
  427. struct tt_local_entry *tt_local_entry;
  428. struct tt_common_entry *tt_common_entry;
  429. struct hlist_node *node, *node_tmp;
  430. struct hlist_head *head;
  431. spinlock_t *list_lock; /* protects write access to the hash lists */
  432. uint32_t i;
  433. for (i = 0; i < hash->size; i++) {
  434. head = &hash->table[i];
  435. list_lock = &hash->list_locks[i];
  436. spin_lock_bh(list_lock);
  437. hlist_for_each_entry_safe(tt_common_entry, node, node_tmp,
  438. head, hash_entry) {
  439. tt_local_entry = container_of(tt_common_entry,
  440. struct tt_local_entry,
  441. common);
  442. if (tt_local_entry->common.flags & TT_CLIENT_NOPURGE)
  443. continue;
  444. /* entry already marked for deletion */
  445. if (tt_local_entry->common.flags & TT_CLIENT_PENDING)
  446. continue;
  447. if (!batadv_has_timed_out(tt_local_entry->last_seen,
  448. TT_LOCAL_TIMEOUT))
  449. continue;
  450. batadv_tt_local_set_pending(bat_priv, tt_local_entry,
  451. TT_CLIENT_DEL, "timed out");
  452. }
  453. spin_unlock_bh(list_lock);
  454. }
  455. }
  456. static void batadv_tt_local_table_free(struct bat_priv *bat_priv)
  457. {
  458. struct hashtable_t *hash;
  459. spinlock_t *list_lock; /* protects write access to the hash lists */
  460. struct tt_common_entry *tt_common_entry;
  461. struct tt_local_entry *tt_local_entry;
  462. struct hlist_node *node, *node_tmp;
  463. struct hlist_head *head;
  464. uint32_t i;
  465. if (!bat_priv->tt_local_hash)
  466. return;
  467. hash = bat_priv->tt_local_hash;
  468. for (i = 0; i < hash->size; i++) {
  469. head = &hash->table[i];
  470. list_lock = &hash->list_locks[i];
  471. spin_lock_bh(list_lock);
  472. hlist_for_each_entry_safe(tt_common_entry, node, node_tmp,
  473. head, hash_entry) {
  474. hlist_del_rcu(node);
  475. tt_local_entry = container_of(tt_common_entry,
  476. struct tt_local_entry,
  477. common);
  478. batadv_tt_local_entry_free_ref(tt_local_entry);
  479. }
  480. spin_unlock_bh(list_lock);
  481. }
  482. batadv_hash_destroy(hash);
  483. bat_priv->tt_local_hash = NULL;
  484. }
  485. static int batadv_tt_global_init(struct bat_priv *bat_priv)
  486. {
  487. if (bat_priv->tt_global_hash)
  488. return 0;
  489. bat_priv->tt_global_hash = batadv_hash_new(1024);
  490. if (!bat_priv->tt_global_hash)
  491. return -ENOMEM;
  492. return 0;
  493. }
  494. static void batadv_tt_changes_list_free(struct bat_priv *bat_priv)
  495. {
  496. struct tt_change_node *entry, *safe;
  497. spin_lock_bh(&bat_priv->tt_changes_list_lock);
  498. list_for_each_entry_safe(entry, safe, &bat_priv->tt_changes_list,
  499. list) {
  500. list_del(&entry->list);
  501. kfree(entry);
  502. }
  503. atomic_set(&bat_priv->tt_local_changes, 0);
  504. spin_unlock_bh(&bat_priv->tt_changes_list_lock);
  505. }
  506. /* find out if an orig_node is already in the list of a tt_global_entry.
  507. * returns 1 if found, 0 otherwise
  508. */
  509. static bool batadv_tt_global_entry_has_orig(const struct tt_global_entry *entry,
  510. const struct orig_node *orig_node)
  511. {
  512. struct tt_orig_list_entry *tmp_orig_entry;
  513. const struct hlist_head *head;
  514. struct hlist_node *node;
  515. bool found = false;
  516. rcu_read_lock();
  517. head = &entry->orig_list;
  518. hlist_for_each_entry_rcu(tmp_orig_entry, node, head, list) {
  519. if (tmp_orig_entry->orig_node == orig_node) {
  520. found = true;
  521. break;
  522. }
  523. }
  524. rcu_read_unlock();
  525. return found;
  526. }
  527. static void
  528. batadv_tt_global_add_orig_entry(struct tt_global_entry *tt_global_entry,
  529. struct orig_node *orig_node, int ttvn)
  530. {
  531. struct tt_orig_list_entry *orig_entry;
  532. orig_entry = kzalloc(sizeof(*orig_entry), GFP_ATOMIC);
  533. if (!orig_entry)
  534. return;
  535. INIT_HLIST_NODE(&orig_entry->list);
  536. atomic_inc(&orig_node->refcount);
  537. atomic_inc(&orig_node->tt_size);
  538. orig_entry->orig_node = orig_node;
  539. orig_entry->ttvn = ttvn;
  540. spin_lock_bh(&tt_global_entry->list_lock);
  541. hlist_add_head_rcu(&orig_entry->list,
  542. &tt_global_entry->orig_list);
  543. spin_unlock_bh(&tt_global_entry->list_lock);
  544. }
  545. /* caller must hold orig_node refcount */
  546. int batadv_tt_global_add(struct bat_priv *bat_priv, struct orig_node *orig_node,
  547. const unsigned char *tt_addr, uint8_t flags,
  548. uint8_t ttvn)
  549. {
  550. struct tt_global_entry *tt_global_entry = NULL;
  551. int ret = 0;
  552. int hash_added;
  553. struct tt_common_entry *common;
  554. tt_global_entry = batadv_tt_global_hash_find(bat_priv, tt_addr);
  555. if (!tt_global_entry) {
  556. tt_global_entry = kzalloc(sizeof(*tt_global_entry), GFP_ATOMIC);
  557. if (!tt_global_entry)
  558. goto out;
  559. common = &tt_global_entry->common;
  560. memcpy(common->addr, tt_addr, ETH_ALEN);
  561. common->flags = flags;
  562. tt_global_entry->roam_at = 0;
  563. atomic_set(&common->refcount, 2);
  564. INIT_HLIST_HEAD(&tt_global_entry->orig_list);
  565. spin_lock_init(&tt_global_entry->list_lock);
  566. hash_added = batadv_hash_add(bat_priv->tt_global_hash,
  567. batadv_compare_tt,
  568. batadv_choose_orig, common,
  569. &common->hash_entry);
  570. if (unlikely(hash_added != 0)) {
  571. /* remove the reference for the hash */
  572. batadv_tt_global_entry_free_ref(tt_global_entry);
  573. goto out_remove;
  574. }
  575. batadv_tt_global_add_orig_entry(tt_global_entry, orig_node,
  576. ttvn);
  577. } else {
  578. /* there is already a global entry, use this one. */
  579. /* If there is the TT_CLIENT_ROAM flag set, there is only one
  580. * originator left in the list and we previously received a
  581. * delete + roaming change for this originator.
  582. *
  583. * We should first delete the old originator before adding the
  584. * new one.
  585. */
  586. if (tt_global_entry->common.flags & TT_CLIENT_ROAM) {
  587. batadv_tt_global_del_orig_list(tt_global_entry);
  588. tt_global_entry->common.flags &= ~TT_CLIENT_ROAM;
  589. tt_global_entry->roam_at = 0;
  590. }
  591. if (!batadv_tt_global_entry_has_orig(tt_global_entry,
  592. orig_node))
  593. batadv_tt_global_add_orig_entry(tt_global_entry,
  594. orig_node, ttvn);
  595. }
  596. batadv_dbg(DBG_TT, bat_priv,
  597. "Creating new global tt entry: %pM (via %pM)\n",
  598. tt_global_entry->common.addr, orig_node->orig);
  599. out_remove:
  600. /* remove address from local hash if present */
  601. batadv_tt_local_remove(bat_priv, tt_global_entry->common.addr,
  602. "global tt received", flags & TT_CLIENT_ROAM);
  603. ret = 1;
  604. out:
  605. if (tt_global_entry)
  606. batadv_tt_global_entry_free_ref(tt_global_entry);
  607. return ret;
  608. }
  609. /* print all orig nodes who announce the address for this global entry.
  610. * it is assumed that the caller holds rcu_read_lock();
  611. */
  612. static void
  613. batadv_tt_global_print_entry(struct tt_global_entry *tt_global_entry,
  614. struct seq_file *seq)
  615. {
  616. struct hlist_head *head;
  617. struct hlist_node *node;
  618. struct tt_orig_list_entry *orig_entry;
  619. struct tt_common_entry *tt_common_entry;
  620. uint16_t flags;
  621. uint8_t last_ttvn;
  622. tt_common_entry = &tt_global_entry->common;
  623. head = &tt_global_entry->orig_list;
  624. hlist_for_each_entry_rcu(orig_entry, node, head, list) {
  625. flags = tt_common_entry->flags;
  626. last_ttvn = atomic_read(&orig_entry->orig_node->last_ttvn);
  627. seq_printf(seq, " * %pM (%3u) via %pM (%3u) [%c%c]\n",
  628. tt_global_entry->common.addr, orig_entry->ttvn,
  629. orig_entry->orig_node->orig, last_ttvn,
  630. (flags & TT_CLIENT_ROAM ? 'R' : '.'),
  631. (flags & TT_CLIENT_WIFI ? 'W' : '.'));
  632. }
  633. }
  634. int batadv_tt_global_seq_print_text(struct seq_file *seq, void *offset)
  635. {
  636. struct net_device *net_dev = (struct net_device *)seq->private;
  637. struct bat_priv *bat_priv = netdev_priv(net_dev);
  638. struct hashtable_t *hash = bat_priv->tt_global_hash;
  639. struct tt_common_entry *tt_common_entry;
  640. struct tt_global_entry *tt_global_entry;
  641. struct hard_iface *primary_if;
  642. struct hlist_node *node;
  643. struct hlist_head *head;
  644. uint32_t i;
  645. int ret = 0;
  646. primary_if = batadv_primary_if_get_selected(bat_priv);
  647. if (!primary_if) {
  648. ret = seq_printf(seq,
  649. "BATMAN mesh %s disabled - please specify interfaces to enable it\n",
  650. net_dev->name);
  651. goto out;
  652. }
  653. if (primary_if->if_status != IF_ACTIVE) {
  654. ret = seq_printf(seq,
  655. "BATMAN mesh %s disabled - primary interface not active\n",
  656. net_dev->name);
  657. goto out;
  658. }
  659. seq_printf(seq,
  660. "Globally announced TT entries received via the mesh %s\n",
  661. net_dev->name);
  662. seq_printf(seq, " %-13s %s %-15s %s %s\n",
  663. "Client", "(TTVN)", "Originator", "(Curr TTVN)", "Flags");
  664. for (i = 0; i < hash->size; i++) {
  665. head = &hash->table[i];
  666. rcu_read_lock();
  667. hlist_for_each_entry_rcu(tt_common_entry, node,
  668. head, hash_entry) {
  669. tt_global_entry = container_of(tt_common_entry,
  670. struct tt_global_entry,
  671. common);
  672. batadv_tt_global_print_entry(tt_global_entry, seq);
  673. }
  674. rcu_read_unlock();
  675. }
  676. out:
  677. if (primary_if)
  678. batadv_hardif_free_ref(primary_if);
  679. return ret;
  680. }
  681. /* deletes the orig list of a tt_global_entry */
  682. static void
  683. batadv_tt_global_del_orig_list(struct tt_global_entry *tt_global_entry)
  684. {
  685. struct hlist_head *head;
  686. struct hlist_node *node, *safe;
  687. struct tt_orig_list_entry *orig_entry;
  688. spin_lock_bh(&tt_global_entry->list_lock);
  689. head = &tt_global_entry->orig_list;
  690. hlist_for_each_entry_safe(orig_entry, node, safe, head, list) {
  691. hlist_del_rcu(node);
  692. batadv_tt_orig_list_entry_free_ref(orig_entry);
  693. }
  694. spin_unlock_bh(&tt_global_entry->list_lock);
  695. }
  696. static void
  697. batadv_tt_global_del_orig_entry(struct bat_priv *bat_priv,
  698. struct tt_global_entry *tt_global_entry,
  699. struct orig_node *orig_node,
  700. const char *message)
  701. {
  702. struct hlist_head *head;
  703. struct hlist_node *node, *safe;
  704. struct tt_orig_list_entry *orig_entry;
  705. spin_lock_bh(&tt_global_entry->list_lock);
  706. head = &tt_global_entry->orig_list;
  707. hlist_for_each_entry_safe(orig_entry, node, safe, head, list) {
  708. if (orig_entry->orig_node == orig_node) {
  709. batadv_dbg(DBG_TT, bat_priv,
  710. "Deleting %pM from global tt entry %pM: %s\n",
  711. orig_node->orig,
  712. tt_global_entry->common.addr, message);
  713. hlist_del_rcu(node);
  714. batadv_tt_orig_list_entry_free_ref(orig_entry);
  715. }
  716. }
  717. spin_unlock_bh(&tt_global_entry->list_lock);
  718. }
  719. static void batadv_tt_global_del_struct(struct bat_priv *bat_priv,
  720. struct tt_global_entry *tt_global_entry,
  721. const char *message)
  722. {
  723. batadv_dbg(DBG_TT, bat_priv, "Deleting global tt entry %pM: %s\n",
  724. tt_global_entry->common.addr, message);
  725. batadv_hash_remove(bat_priv->tt_global_hash, batadv_compare_tt,
  726. batadv_choose_orig, tt_global_entry->common.addr);
  727. batadv_tt_global_entry_free_ref(tt_global_entry);
  728. }
  729. /* If the client is to be deleted, we check if it is the last origantor entry
  730. * within tt_global entry. If yes, we set the TT_CLIENT_ROAM flag and the timer,
  731. * otherwise we simply remove the originator scheduled for deletion.
  732. */
  733. static void
  734. batadv_tt_global_del_roaming(struct bat_priv *bat_priv,
  735. struct tt_global_entry *tt_global_entry,
  736. struct orig_node *orig_node, const char *message)
  737. {
  738. bool last_entry = true;
  739. struct hlist_head *head;
  740. struct hlist_node *node;
  741. struct tt_orig_list_entry *orig_entry;
  742. /* no local entry exists, case 1:
  743. * Check if this is the last one or if other entries exist.
  744. */
  745. rcu_read_lock();
  746. head = &tt_global_entry->orig_list;
  747. hlist_for_each_entry_rcu(orig_entry, node, head, list) {
  748. if (orig_entry->orig_node != orig_node) {
  749. last_entry = false;
  750. break;
  751. }
  752. }
  753. rcu_read_unlock();
  754. if (last_entry) {
  755. /* its the last one, mark for roaming. */
  756. tt_global_entry->common.flags |= TT_CLIENT_ROAM;
  757. tt_global_entry->roam_at = jiffies;
  758. } else
  759. /* there is another entry, we can simply delete this
  760. * one and can still use the other one.
  761. */
  762. batadv_tt_global_del_orig_entry(bat_priv, tt_global_entry,
  763. orig_node, message);
  764. }
  765. static void batadv_tt_global_del(struct bat_priv *bat_priv,
  766. struct orig_node *orig_node,
  767. const unsigned char *addr,
  768. const char *message, bool roaming)
  769. {
  770. struct tt_global_entry *tt_global_entry = NULL;
  771. struct tt_local_entry *local_entry = NULL;
  772. tt_global_entry = batadv_tt_global_hash_find(bat_priv, addr);
  773. if (!tt_global_entry)
  774. goto out;
  775. if (!roaming) {
  776. batadv_tt_global_del_orig_entry(bat_priv, tt_global_entry,
  777. orig_node, message);
  778. if (hlist_empty(&tt_global_entry->orig_list))
  779. batadv_tt_global_del_struct(bat_priv, tt_global_entry,
  780. message);
  781. goto out;
  782. }
  783. /* if we are deleting a global entry due to a roam
  784. * event, there are two possibilities:
  785. * 1) the client roamed from node A to node B => if there
  786. * is only one originator left for this client, we mark
  787. * it with TT_CLIENT_ROAM, we start a timer and we
  788. * wait for node B to claim it. In case of timeout
  789. * the entry is purged.
  790. *
  791. * If there are other originators left, we directly delete
  792. * the originator.
  793. * 2) the client roamed to us => we can directly delete
  794. * the global entry, since it is useless now.
  795. */
  796. local_entry = batadv_tt_local_hash_find(bat_priv,
  797. tt_global_entry->common.addr);
  798. if (local_entry) {
  799. /* local entry exists, case 2: client roamed to us. */
  800. batadv_tt_global_del_orig_list(tt_global_entry);
  801. batadv_tt_global_del_struct(bat_priv, tt_global_entry, message);
  802. } else
  803. /* no local entry exists, case 1: check for roaming */
  804. batadv_tt_global_del_roaming(bat_priv, tt_global_entry,
  805. orig_node, message);
  806. out:
  807. if (tt_global_entry)
  808. batadv_tt_global_entry_free_ref(tt_global_entry);
  809. if (local_entry)
  810. batadv_tt_local_entry_free_ref(local_entry);
  811. }
  812. void batadv_tt_global_del_orig(struct bat_priv *bat_priv,
  813. struct orig_node *orig_node, const char *message)
  814. {
  815. struct tt_global_entry *global_entry;
  816. struct tt_common_entry *tt_common_entry;
  817. uint32_t i;
  818. struct hashtable_t *hash = bat_priv->tt_global_hash;
  819. struct hlist_node *node, *safe;
  820. struct hlist_head *head;
  821. spinlock_t *list_lock; /* protects write access to the hash lists */
  822. if (!hash)
  823. return;
  824. for (i = 0; i < hash->size; i++) {
  825. head = &hash->table[i];
  826. list_lock = &hash->list_locks[i];
  827. spin_lock_bh(list_lock);
  828. hlist_for_each_entry_safe(tt_common_entry, node, safe,
  829. head, hash_entry) {
  830. global_entry = container_of(tt_common_entry,
  831. struct tt_global_entry,
  832. common);
  833. batadv_tt_global_del_orig_entry(bat_priv, global_entry,
  834. orig_node, message);
  835. if (hlist_empty(&global_entry->orig_list)) {
  836. batadv_dbg(DBG_TT, bat_priv,
  837. "Deleting global tt entry %pM: %s\n",
  838. global_entry->common.addr, message);
  839. hlist_del_rcu(node);
  840. batadv_tt_global_entry_free_ref(global_entry);
  841. }
  842. }
  843. spin_unlock_bh(list_lock);
  844. }
  845. orig_node->tt_initialised = false;
  846. }
  847. static void batadv_tt_global_roam_purge(struct bat_priv *bat_priv)
  848. {
  849. struct hashtable_t *hash = bat_priv->tt_global_hash;
  850. struct tt_common_entry *tt_common_entry;
  851. struct tt_global_entry *tt_global_entry;
  852. struct hlist_node *node, *node_tmp;
  853. struct hlist_head *head;
  854. spinlock_t *list_lock; /* protects write access to the hash lists */
  855. uint32_t i;
  856. for (i = 0; i < hash->size; i++) {
  857. head = &hash->table[i];
  858. list_lock = &hash->list_locks[i];
  859. spin_lock_bh(list_lock);
  860. hlist_for_each_entry_safe(tt_common_entry, node, node_tmp,
  861. head, hash_entry) {
  862. tt_global_entry = container_of(tt_common_entry,
  863. struct tt_global_entry,
  864. common);
  865. if (!(tt_global_entry->common.flags & TT_CLIENT_ROAM))
  866. continue;
  867. if (!batadv_has_timed_out(tt_global_entry->roam_at,
  868. TT_CLIENT_ROAM_TIMEOUT))
  869. continue;
  870. batadv_dbg(DBG_TT, bat_priv,
  871. "Deleting global tt entry (%pM): Roaming timeout\n",
  872. tt_global_entry->common.addr);
  873. hlist_del_rcu(node);
  874. batadv_tt_global_entry_free_ref(tt_global_entry);
  875. }
  876. spin_unlock_bh(list_lock);
  877. }
  878. }
  879. static void batadv_tt_global_table_free(struct bat_priv *bat_priv)
  880. {
  881. struct hashtable_t *hash;
  882. spinlock_t *list_lock; /* protects write access to the hash lists */
  883. struct tt_common_entry *tt_common_entry;
  884. struct tt_global_entry *tt_global_entry;
  885. struct hlist_node *node, *node_tmp;
  886. struct hlist_head *head;
  887. uint32_t i;
  888. if (!bat_priv->tt_global_hash)
  889. return;
  890. hash = bat_priv->tt_global_hash;
  891. for (i = 0; i < hash->size; i++) {
  892. head = &hash->table[i];
  893. list_lock = &hash->list_locks[i];
  894. spin_lock_bh(list_lock);
  895. hlist_for_each_entry_safe(tt_common_entry, node, node_tmp,
  896. head, hash_entry) {
  897. hlist_del_rcu(node);
  898. tt_global_entry = container_of(tt_common_entry,
  899. struct tt_global_entry,
  900. common);
  901. batadv_tt_global_entry_free_ref(tt_global_entry);
  902. }
  903. spin_unlock_bh(list_lock);
  904. }
  905. batadv_hash_destroy(hash);
  906. bat_priv->tt_global_hash = NULL;
  907. }
  908. static bool _batadv_is_ap_isolated(struct tt_local_entry *tt_local_entry,
  909. struct tt_global_entry *tt_global_entry)
  910. {
  911. bool ret = false;
  912. if (tt_local_entry->common.flags & TT_CLIENT_WIFI &&
  913. tt_global_entry->common.flags & TT_CLIENT_WIFI)
  914. ret = true;
  915. return ret;
  916. }
  917. struct orig_node *batadv_transtable_search(struct bat_priv *bat_priv,
  918. const uint8_t *src,
  919. const uint8_t *addr)
  920. {
  921. struct tt_local_entry *tt_local_entry = NULL;
  922. struct tt_global_entry *tt_global_entry = NULL;
  923. struct orig_node *orig_node = NULL;
  924. struct neigh_node *router = NULL;
  925. struct hlist_head *head;
  926. struct hlist_node *node;
  927. struct tt_orig_list_entry *orig_entry;
  928. int best_tq;
  929. if (src && atomic_read(&bat_priv->ap_isolation)) {
  930. tt_local_entry = batadv_tt_local_hash_find(bat_priv, src);
  931. if (!tt_local_entry)
  932. goto out;
  933. }
  934. tt_global_entry = batadv_tt_global_hash_find(bat_priv, addr);
  935. if (!tt_global_entry)
  936. goto out;
  937. /* check whether the clients should not communicate due to AP
  938. * isolation
  939. */
  940. if (tt_local_entry &&
  941. _batadv_is_ap_isolated(tt_local_entry, tt_global_entry))
  942. goto out;
  943. best_tq = 0;
  944. rcu_read_lock();
  945. head = &tt_global_entry->orig_list;
  946. hlist_for_each_entry_rcu(orig_entry, node, head, list) {
  947. router = batadv_orig_node_get_router(orig_entry->orig_node);
  948. if (!router)
  949. continue;
  950. if (router->tq_avg > best_tq) {
  951. orig_node = orig_entry->orig_node;
  952. best_tq = router->tq_avg;
  953. }
  954. batadv_neigh_node_free_ref(router);
  955. }
  956. /* found anything? */
  957. if (orig_node && !atomic_inc_not_zero(&orig_node->refcount))
  958. orig_node = NULL;
  959. rcu_read_unlock();
  960. out:
  961. if (tt_global_entry)
  962. batadv_tt_global_entry_free_ref(tt_global_entry);
  963. if (tt_local_entry)
  964. batadv_tt_local_entry_free_ref(tt_local_entry);
  965. return orig_node;
  966. }
  967. /* Calculates the checksum of the local table of a given orig_node */
  968. static uint16_t batadv_tt_global_crc(struct bat_priv *bat_priv,
  969. struct orig_node *orig_node)
  970. {
  971. uint16_t total = 0, total_one;
  972. struct hashtable_t *hash = bat_priv->tt_global_hash;
  973. struct tt_common_entry *tt_common_entry;
  974. struct tt_global_entry *tt_global_entry;
  975. struct hlist_node *node;
  976. struct hlist_head *head;
  977. uint32_t i;
  978. int j;
  979. for (i = 0; i < hash->size; i++) {
  980. head = &hash->table[i];
  981. rcu_read_lock();
  982. hlist_for_each_entry_rcu(tt_common_entry, node,
  983. head, hash_entry) {
  984. tt_global_entry = container_of(tt_common_entry,
  985. struct tt_global_entry,
  986. common);
  987. /* Roaming clients are in the global table for
  988. * consistency only. They don't have to be
  989. * taken into account while computing the
  990. * global crc
  991. */
  992. if (tt_global_entry->common.flags & TT_CLIENT_ROAM)
  993. continue;
  994. /* find out if this global entry is announced by this
  995. * originator
  996. */
  997. if (!batadv_tt_global_entry_has_orig(tt_global_entry,
  998. orig_node))
  999. continue;
  1000. total_one = 0;
  1001. for (j = 0; j < ETH_ALEN; j++)
  1002. total_one = crc16_byte(total_one,
  1003. tt_global_entry->common.addr[j]);
  1004. total ^= total_one;
  1005. }
  1006. rcu_read_unlock();
  1007. }
  1008. return total;
  1009. }
  1010. /* Calculates the checksum of the local table */
  1011. static uint16_t batadv_tt_local_crc(struct bat_priv *bat_priv)
  1012. {
  1013. uint16_t total = 0, total_one;
  1014. struct hashtable_t *hash = bat_priv->tt_local_hash;
  1015. struct tt_common_entry *tt_common_entry;
  1016. struct hlist_node *node;
  1017. struct hlist_head *head;
  1018. uint32_t i;
  1019. int j;
  1020. for (i = 0; i < hash->size; i++) {
  1021. head = &hash->table[i];
  1022. rcu_read_lock();
  1023. hlist_for_each_entry_rcu(tt_common_entry, node,
  1024. head, hash_entry) {
  1025. /* not yet committed clients have not to be taken into
  1026. * account while computing the CRC
  1027. */
  1028. if (tt_common_entry->flags & TT_CLIENT_NEW)
  1029. continue;
  1030. total_one = 0;
  1031. for (j = 0; j < ETH_ALEN; j++)
  1032. total_one = crc16_byte(total_one,
  1033. tt_common_entry->addr[j]);
  1034. total ^= total_one;
  1035. }
  1036. rcu_read_unlock();
  1037. }
  1038. return total;
  1039. }
  1040. static void batadv_tt_req_list_free(struct bat_priv *bat_priv)
  1041. {
  1042. struct tt_req_node *node, *safe;
  1043. spin_lock_bh(&bat_priv->tt_req_list_lock);
  1044. list_for_each_entry_safe(node, safe, &bat_priv->tt_req_list, list) {
  1045. list_del(&node->list);
  1046. kfree(node);
  1047. }
  1048. spin_unlock_bh(&bat_priv->tt_req_list_lock);
  1049. }
  1050. static void batadv_tt_save_orig_buffer(struct bat_priv *bat_priv,
  1051. struct orig_node *orig_node,
  1052. const unsigned char *tt_buff,
  1053. uint8_t tt_num_changes)
  1054. {
  1055. uint16_t tt_buff_len = batadv_tt_len(tt_num_changes);
  1056. /* Replace the old buffer only if I received something in the
  1057. * last OGM (the OGM could carry no changes)
  1058. */
  1059. spin_lock_bh(&orig_node->tt_buff_lock);
  1060. if (tt_buff_len > 0) {
  1061. kfree(orig_node->tt_buff);
  1062. orig_node->tt_buff_len = 0;
  1063. orig_node->tt_buff = kmalloc(tt_buff_len, GFP_ATOMIC);
  1064. if (orig_node->tt_buff) {
  1065. memcpy(orig_node->tt_buff, tt_buff, tt_buff_len);
  1066. orig_node->tt_buff_len = tt_buff_len;
  1067. }
  1068. }
  1069. spin_unlock_bh(&orig_node->tt_buff_lock);
  1070. }
  1071. static void batadv_tt_req_purge(struct bat_priv *bat_priv)
  1072. {
  1073. struct tt_req_node *node, *safe;
  1074. spin_lock_bh(&bat_priv->tt_req_list_lock);
  1075. list_for_each_entry_safe(node, safe, &bat_priv->tt_req_list, list) {
  1076. if (batadv_has_timed_out(node->issued_at, TT_REQUEST_TIMEOUT)) {
  1077. list_del(&node->list);
  1078. kfree(node);
  1079. }
  1080. }
  1081. spin_unlock_bh(&bat_priv->tt_req_list_lock);
  1082. }
  1083. /* returns the pointer to the new tt_req_node struct if no request
  1084. * has already been issued for this orig_node, NULL otherwise
  1085. */
  1086. static struct tt_req_node *batadv_new_tt_req_node(struct bat_priv *bat_priv,
  1087. struct orig_node *orig_node)
  1088. {
  1089. struct tt_req_node *tt_req_node_tmp, *tt_req_node = NULL;
  1090. spin_lock_bh(&bat_priv->tt_req_list_lock);
  1091. list_for_each_entry(tt_req_node_tmp, &bat_priv->tt_req_list, list) {
  1092. if (batadv_compare_eth(tt_req_node_tmp, orig_node) &&
  1093. !batadv_has_timed_out(tt_req_node_tmp->issued_at,
  1094. TT_REQUEST_TIMEOUT))
  1095. goto unlock;
  1096. }
  1097. tt_req_node = kmalloc(sizeof(*tt_req_node), GFP_ATOMIC);
  1098. if (!tt_req_node)
  1099. goto unlock;
  1100. memcpy(tt_req_node->addr, orig_node->orig, ETH_ALEN);
  1101. tt_req_node->issued_at = jiffies;
  1102. list_add(&tt_req_node->list, &bat_priv->tt_req_list);
  1103. unlock:
  1104. spin_unlock_bh(&bat_priv->tt_req_list_lock);
  1105. return tt_req_node;
  1106. }
  1107. /* data_ptr is useless here, but has to be kept to respect the prototype */
  1108. static int batadv_tt_local_valid_entry(const void *entry_ptr,
  1109. const void *data_ptr)
  1110. {
  1111. const struct tt_common_entry *tt_common_entry = entry_ptr;
  1112. if (tt_common_entry->flags & TT_CLIENT_NEW)
  1113. return 0;
  1114. return 1;
  1115. }
  1116. static int batadv_tt_global_valid(const void *entry_ptr,
  1117. const void *data_ptr)
  1118. {
  1119. const struct tt_common_entry *tt_common_entry = entry_ptr;
  1120. const struct tt_global_entry *tt_global_entry;
  1121. const struct orig_node *orig_node = data_ptr;
  1122. if (tt_common_entry->flags & TT_CLIENT_ROAM)
  1123. return 0;
  1124. tt_global_entry = container_of(tt_common_entry, struct tt_global_entry,
  1125. common);
  1126. return batadv_tt_global_entry_has_orig(tt_global_entry, orig_node);
  1127. }
  1128. static struct sk_buff *
  1129. batadv_tt_response_fill_table(uint16_t tt_len, uint8_t ttvn,
  1130. struct hashtable_t *hash,
  1131. struct hard_iface *primary_if,
  1132. int (*valid_cb)(const void *, const void *),
  1133. void *cb_data)
  1134. {
  1135. struct tt_common_entry *tt_common_entry;
  1136. struct tt_query_packet *tt_response;
  1137. struct tt_change *tt_change;
  1138. struct hlist_node *node;
  1139. struct hlist_head *head;
  1140. struct sk_buff *skb = NULL;
  1141. uint16_t tt_tot, tt_count;
  1142. ssize_t tt_query_size = sizeof(struct tt_query_packet);
  1143. uint32_t i;
  1144. if (tt_query_size + tt_len > primary_if->soft_iface->mtu) {
  1145. tt_len = primary_if->soft_iface->mtu - tt_query_size;
  1146. tt_len -= tt_len % sizeof(struct tt_change);
  1147. }
  1148. tt_tot = tt_len / sizeof(struct tt_change);
  1149. skb = dev_alloc_skb(tt_query_size + tt_len + ETH_HLEN);
  1150. if (!skb)
  1151. goto out;
  1152. skb_reserve(skb, ETH_HLEN);
  1153. tt_response = (struct tt_query_packet *)skb_put(skb,
  1154. tt_query_size + tt_len);
  1155. tt_response->ttvn = ttvn;
  1156. tt_change = (struct tt_change *)(skb->data + tt_query_size);
  1157. tt_count = 0;
  1158. rcu_read_lock();
  1159. for (i = 0; i < hash->size; i++) {
  1160. head = &hash->table[i];
  1161. hlist_for_each_entry_rcu(tt_common_entry, node,
  1162. head, hash_entry) {
  1163. if (tt_count == tt_tot)
  1164. break;
  1165. if ((valid_cb) && (!valid_cb(tt_common_entry, cb_data)))
  1166. continue;
  1167. memcpy(tt_change->addr, tt_common_entry->addr,
  1168. ETH_ALEN);
  1169. tt_change->flags = NO_FLAGS;
  1170. tt_count++;
  1171. tt_change++;
  1172. }
  1173. }
  1174. rcu_read_unlock();
  1175. /* store in the message the number of entries we have successfully
  1176. * copied
  1177. */
  1178. tt_response->tt_data = htons(tt_count);
  1179. out:
  1180. return skb;
  1181. }
  1182. static int batadv_send_tt_request(struct bat_priv *bat_priv,
  1183. struct orig_node *dst_orig_node,
  1184. uint8_t ttvn, uint16_t tt_crc,
  1185. bool full_table)
  1186. {
  1187. struct sk_buff *skb = NULL;
  1188. struct tt_query_packet *tt_request;
  1189. struct neigh_node *neigh_node = NULL;
  1190. struct hard_iface *primary_if;
  1191. struct tt_req_node *tt_req_node = NULL;
  1192. int ret = 1;
  1193. primary_if = batadv_primary_if_get_selected(bat_priv);
  1194. if (!primary_if)
  1195. goto out;
  1196. /* The new tt_req will be issued only if I'm not waiting for a
  1197. * reply from the same orig_node yet
  1198. */
  1199. tt_req_node = batadv_new_tt_req_node(bat_priv, dst_orig_node);
  1200. if (!tt_req_node)
  1201. goto out;
  1202. skb = dev_alloc_skb(sizeof(struct tt_query_packet) + ETH_HLEN);
  1203. if (!skb)
  1204. goto out;
  1205. skb_reserve(skb, ETH_HLEN);
  1206. tt_request = (struct tt_query_packet *)skb_put(skb,
  1207. sizeof(struct tt_query_packet));
  1208. tt_request->header.packet_type = BAT_TT_QUERY;
  1209. tt_request->header.version = BATADV_COMPAT_VERSION;
  1210. memcpy(tt_request->src, primary_if->net_dev->dev_addr, ETH_ALEN);
  1211. memcpy(tt_request->dst, dst_orig_node->orig, ETH_ALEN);
  1212. tt_request->header.ttl = TTL;
  1213. tt_request->ttvn = ttvn;
  1214. tt_request->tt_data = htons(tt_crc);
  1215. tt_request->flags = TT_REQUEST;
  1216. if (full_table)
  1217. tt_request->flags |= TT_FULL_TABLE;
  1218. neigh_node = batadv_orig_node_get_router(dst_orig_node);
  1219. if (!neigh_node)
  1220. goto out;
  1221. batadv_dbg(DBG_TT, bat_priv,
  1222. "Sending TT_REQUEST to %pM via %pM [%c]\n",
  1223. dst_orig_node->orig, neigh_node->addr,
  1224. (full_table ? 'F' : '.'));
  1225. batadv_inc_counter(bat_priv, BAT_CNT_TT_REQUEST_TX);
  1226. batadv_send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
  1227. ret = 0;
  1228. out:
  1229. if (neigh_node)
  1230. batadv_neigh_node_free_ref(neigh_node);
  1231. if (primary_if)
  1232. batadv_hardif_free_ref(primary_if);
  1233. if (ret)
  1234. kfree_skb(skb);
  1235. if (ret && tt_req_node) {
  1236. spin_lock_bh(&bat_priv->tt_req_list_lock);
  1237. list_del(&tt_req_node->list);
  1238. spin_unlock_bh(&bat_priv->tt_req_list_lock);
  1239. kfree(tt_req_node);
  1240. }
  1241. return ret;
  1242. }
  1243. static bool batadv_send_other_tt_response(struct bat_priv *bat_priv,
  1244. struct tt_query_packet *tt_request)
  1245. {
  1246. struct orig_node *req_dst_orig_node = NULL, *res_dst_orig_node = NULL;
  1247. struct neigh_node *neigh_node = NULL;
  1248. struct hard_iface *primary_if = NULL;
  1249. uint8_t orig_ttvn, req_ttvn, ttvn;
  1250. int ret = false;
  1251. unsigned char *tt_buff;
  1252. bool full_table;
  1253. uint16_t tt_len, tt_tot;
  1254. struct sk_buff *skb = NULL;
  1255. struct tt_query_packet *tt_response;
  1256. batadv_dbg(DBG_TT, bat_priv,
  1257. "Received TT_REQUEST from %pM for ttvn: %u (%pM) [%c]\n",
  1258. tt_request->src, tt_request->ttvn, tt_request->dst,
  1259. (tt_request->flags & TT_FULL_TABLE ? 'F' : '.'));
  1260. /* Let's get the orig node of the REAL destination */
  1261. req_dst_orig_node = batadv_orig_hash_find(bat_priv, tt_request->dst);
  1262. if (!req_dst_orig_node)
  1263. goto out;
  1264. res_dst_orig_node = batadv_orig_hash_find(bat_priv, tt_request->src);
  1265. if (!res_dst_orig_node)
  1266. goto out;
  1267. neigh_node = batadv_orig_node_get_router(res_dst_orig_node);
  1268. if (!neigh_node)
  1269. goto out;
  1270. primary_if = batadv_primary_if_get_selected(bat_priv);
  1271. if (!primary_if)
  1272. goto out;
  1273. orig_ttvn = (uint8_t)atomic_read(&req_dst_orig_node->last_ttvn);
  1274. req_ttvn = tt_request->ttvn;
  1275. /* I don't have the requested data */
  1276. if (orig_ttvn != req_ttvn ||
  1277. tt_request->tt_data != htons(req_dst_orig_node->tt_crc))
  1278. goto out;
  1279. /* If the full table has been explicitly requested */
  1280. if (tt_request->flags & TT_FULL_TABLE ||
  1281. !req_dst_orig_node->tt_buff)
  1282. full_table = true;
  1283. else
  1284. full_table = false;
  1285. /* In this version, fragmentation is not implemented, then
  1286. * I'll send only one packet with as much TT entries as I can
  1287. */
  1288. if (!full_table) {
  1289. spin_lock_bh(&req_dst_orig_node->tt_buff_lock);
  1290. tt_len = req_dst_orig_node->tt_buff_len;
  1291. tt_tot = tt_len / sizeof(struct tt_change);
  1292. skb = dev_alloc_skb(sizeof(struct tt_query_packet) +
  1293. tt_len + ETH_HLEN);
  1294. if (!skb)
  1295. goto unlock;
  1296. skb_reserve(skb, ETH_HLEN);
  1297. tt_response = (struct tt_query_packet *)skb_put(skb,
  1298. sizeof(struct tt_query_packet) + tt_len);
  1299. tt_response->ttvn = req_ttvn;
  1300. tt_response->tt_data = htons(tt_tot);
  1301. tt_buff = skb->data + sizeof(struct tt_query_packet);
  1302. /* Copy the last orig_node's OGM buffer */
  1303. memcpy(tt_buff, req_dst_orig_node->tt_buff,
  1304. req_dst_orig_node->tt_buff_len);
  1305. spin_unlock_bh(&req_dst_orig_node->tt_buff_lock);
  1306. } else {
  1307. tt_len = (uint16_t)atomic_read(&req_dst_orig_node->tt_size) *
  1308. sizeof(struct tt_change);
  1309. ttvn = (uint8_t)atomic_read(&req_dst_orig_node->last_ttvn);
  1310. skb = batadv_tt_response_fill_table(tt_len, ttvn,
  1311. bat_priv->tt_global_hash,
  1312. primary_if,
  1313. batadv_tt_global_valid,
  1314. req_dst_orig_node);
  1315. if (!skb)
  1316. goto out;
  1317. tt_response = (struct tt_query_packet *)skb->data;
  1318. }
  1319. tt_response->header.packet_type = BAT_TT_QUERY;
  1320. tt_response->header.version = BATADV_COMPAT_VERSION;
  1321. tt_response->header.ttl = TTL;
  1322. memcpy(tt_response->src, req_dst_orig_node->orig, ETH_ALEN);
  1323. memcpy(tt_response->dst, tt_request->src, ETH_ALEN);
  1324. tt_response->flags = TT_RESPONSE;
  1325. if (full_table)
  1326. tt_response->flags |= TT_FULL_TABLE;
  1327. batadv_dbg(DBG_TT, bat_priv,
  1328. "Sending TT_RESPONSE %pM via %pM for %pM (ttvn: %u)\n",
  1329. res_dst_orig_node->orig, neigh_node->addr,
  1330. req_dst_orig_node->orig, req_ttvn);
  1331. batadv_inc_counter(bat_priv, BAT_CNT_TT_RESPONSE_TX);
  1332. batadv_send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
  1333. ret = true;
  1334. goto out;
  1335. unlock:
  1336. spin_unlock_bh(&req_dst_orig_node->tt_buff_lock);
  1337. out:
  1338. if (res_dst_orig_node)
  1339. batadv_orig_node_free_ref(res_dst_orig_node);
  1340. if (req_dst_orig_node)
  1341. batadv_orig_node_free_ref(req_dst_orig_node);
  1342. if (neigh_node)
  1343. batadv_neigh_node_free_ref(neigh_node);
  1344. if (primary_if)
  1345. batadv_hardif_free_ref(primary_if);
  1346. if (!ret)
  1347. kfree_skb(skb);
  1348. return ret;
  1349. }
  1350. static bool batadv_send_my_tt_response(struct bat_priv *bat_priv,
  1351. struct tt_query_packet *tt_request)
  1352. {
  1353. struct orig_node *orig_node = NULL;
  1354. struct neigh_node *neigh_node = NULL;
  1355. struct hard_iface *primary_if = NULL;
  1356. uint8_t my_ttvn, req_ttvn, ttvn;
  1357. int ret = false;
  1358. unsigned char *tt_buff;
  1359. bool full_table;
  1360. uint16_t tt_len, tt_tot;
  1361. struct sk_buff *skb = NULL;
  1362. struct tt_query_packet *tt_response;
  1363. batadv_dbg(DBG_TT, bat_priv,
  1364. "Received TT_REQUEST from %pM for ttvn: %u (me) [%c]\n",
  1365. tt_request->src, tt_request->ttvn,
  1366. (tt_request->flags & TT_FULL_TABLE ? 'F' : '.'));
  1367. my_ttvn = (uint8_t)atomic_read(&bat_priv->ttvn);
  1368. req_ttvn = tt_request->ttvn;
  1369. orig_node = batadv_orig_hash_find(bat_priv, tt_request->src);
  1370. if (!orig_node)
  1371. goto out;
  1372. neigh_node = batadv_orig_node_get_router(orig_node);
  1373. if (!neigh_node)
  1374. goto out;
  1375. primary_if = batadv_primary_if_get_selected(bat_priv);
  1376. if (!primary_if)
  1377. goto out;
  1378. /* If the full table has been explicitly requested or the gap
  1379. * is too big send the whole local translation table
  1380. */
  1381. if (tt_request->flags & TT_FULL_TABLE || my_ttvn != req_ttvn ||
  1382. !bat_priv->tt_buff)
  1383. full_table = true;
  1384. else
  1385. full_table = false;
  1386. /* In this version, fragmentation is not implemented, then
  1387. * I'll send only one packet with as much TT entries as I can
  1388. */
  1389. if (!full_table) {
  1390. spin_lock_bh(&bat_priv->tt_buff_lock);
  1391. tt_len = bat_priv->tt_buff_len;
  1392. tt_tot = tt_len / sizeof(struct tt_change);
  1393. skb = dev_alloc_skb(sizeof(struct tt_query_packet) +
  1394. tt_len + ETH_HLEN);
  1395. if (!skb)
  1396. goto unlock;
  1397. skb_reserve(skb, ETH_HLEN);
  1398. tt_response = (struct tt_query_packet *)skb_put(skb,
  1399. sizeof(struct tt_query_packet) + tt_len);
  1400. tt_response->ttvn = req_ttvn;
  1401. tt_response->tt_data = htons(tt_tot);
  1402. tt_buff = skb->data + sizeof(struct tt_query_packet);
  1403. memcpy(tt_buff, bat_priv->tt_buff,
  1404. bat_priv->tt_buff_len);
  1405. spin_unlock_bh(&bat_priv->tt_buff_lock);
  1406. } else {
  1407. tt_len = (uint16_t)atomic_read(&bat_priv->num_local_tt) *
  1408. sizeof(struct tt_change);
  1409. ttvn = (uint8_t)atomic_read(&bat_priv->ttvn);
  1410. skb = batadv_tt_response_fill_table(tt_len, ttvn,
  1411. bat_priv->tt_local_hash,
  1412. primary_if,
  1413. batadv_tt_local_valid_entry,
  1414. NULL);
  1415. if (!skb)
  1416. goto out;
  1417. tt_response = (struct tt_query_packet *)skb->data;
  1418. }
  1419. tt_response->header.packet_type = BAT_TT_QUERY;
  1420. tt_response->header.version = BATADV_COMPAT_VERSION;
  1421. tt_response->header.ttl = TTL;
  1422. memcpy(tt_response->src, primary_if->net_dev->dev_addr, ETH_ALEN);
  1423. memcpy(tt_response->dst, tt_request->src, ETH_ALEN);
  1424. tt_response->flags = TT_RESPONSE;
  1425. if (full_table)
  1426. tt_response->flags |= TT_FULL_TABLE;
  1427. batadv_dbg(DBG_TT, bat_priv,
  1428. "Sending TT_RESPONSE to %pM via %pM [%c]\n",
  1429. orig_node->orig, neigh_node->addr,
  1430. (tt_response->flags & TT_FULL_TABLE ? 'F' : '.'));
  1431. batadv_inc_counter(bat_priv, BAT_CNT_TT_RESPONSE_TX);
  1432. batadv_send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
  1433. ret = true;
  1434. goto out;
  1435. unlock:
  1436. spin_unlock_bh(&bat_priv->tt_buff_lock);
  1437. out:
  1438. if (orig_node)
  1439. batadv_orig_node_free_ref(orig_node);
  1440. if (neigh_node)
  1441. batadv_neigh_node_free_ref(neigh_node);
  1442. if (primary_if)
  1443. batadv_hardif_free_ref(primary_if);
  1444. if (!ret)
  1445. kfree_skb(skb);
  1446. /* This packet was for me, so it doesn't need to be re-routed */
  1447. return true;
  1448. }
  1449. bool batadv_send_tt_response(struct bat_priv *bat_priv,
  1450. struct tt_query_packet *tt_request)
  1451. {
  1452. if (batadv_is_my_mac(tt_request->dst)) {
  1453. /* don't answer backbone gws! */
  1454. if (batadv_bla_is_backbone_gw_orig(bat_priv, tt_request->src))
  1455. return true;
  1456. return batadv_send_my_tt_response(bat_priv, tt_request);
  1457. } else {
  1458. return batadv_send_other_tt_response(bat_priv, tt_request);
  1459. }
  1460. }
  1461. static void _batadv_tt_update_changes(struct bat_priv *bat_priv,
  1462. struct orig_node *orig_node,
  1463. struct tt_change *tt_change,
  1464. uint16_t tt_num_changes, uint8_t ttvn)
  1465. {
  1466. int i;
  1467. int roams;
  1468. for (i = 0; i < tt_num_changes; i++) {
  1469. if ((tt_change + i)->flags & TT_CLIENT_DEL) {
  1470. roams = (tt_change + i)->flags & TT_CLIENT_ROAM;
  1471. batadv_tt_global_del(bat_priv, orig_node,
  1472. (tt_change + i)->addr,
  1473. "tt removed by changes",
  1474. roams);
  1475. } else {
  1476. if (!batadv_tt_global_add(bat_priv, orig_node,
  1477. (tt_change + i)->addr,
  1478. (tt_change + i)->flags, ttvn))
  1479. /* In case of problem while storing a
  1480. * global_entry, we stop the updating
  1481. * procedure without committing the
  1482. * ttvn change. This will avoid to send
  1483. * corrupted data on tt_request
  1484. */
  1485. return;
  1486. }
  1487. }
  1488. orig_node->tt_initialised = true;
  1489. }
  1490. static void batadv_tt_fill_gtable(struct bat_priv *bat_priv,
  1491. struct tt_query_packet *tt_response)
  1492. {
  1493. struct orig_node *orig_node = NULL;
  1494. orig_node = batadv_orig_hash_find(bat_priv, tt_response->src);
  1495. if (!orig_node)
  1496. goto out;
  1497. /* Purge the old table first.. */
  1498. batadv_tt_global_del_orig(bat_priv, orig_node, "Received full table");
  1499. _batadv_tt_update_changes(bat_priv, orig_node,
  1500. (struct tt_change *)(tt_response + 1),
  1501. ntohs(tt_response->tt_data),
  1502. tt_response->ttvn);
  1503. spin_lock_bh(&orig_node->tt_buff_lock);
  1504. kfree(orig_node->tt_buff);
  1505. orig_node->tt_buff_len = 0;
  1506. orig_node->tt_buff = NULL;
  1507. spin_unlock_bh(&orig_node->tt_buff_lock);
  1508. atomic_set(&orig_node->last_ttvn, tt_response->ttvn);
  1509. out:
  1510. if (orig_node)
  1511. batadv_orig_node_free_ref(orig_node);
  1512. }
  1513. static void batadv_tt_update_changes(struct bat_priv *bat_priv,
  1514. struct orig_node *orig_node,
  1515. uint16_t tt_num_changes, uint8_t ttvn,
  1516. struct tt_change *tt_change)
  1517. {
  1518. _batadv_tt_update_changes(bat_priv, orig_node, tt_change,
  1519. tt_num_changes, ttvn);
  1520. batadv_tt_save_orig_buffer(bat_priv, orig_node,
  1521. (unsigned char *)tt_change, tt_num_changes);
  1522. atomic_set(&orig_node->last_ttvn, ttvn);
  1523. }
  1524. bool batadv_is_my_client(struct bat_priv *bat_priv, const uint8_t *addr)
  1525. {
  1526. struct tt_local_entry *tt_local_entry = NULL;
  1527. bool ret = false;
  1528. tt_local_entry = batadv_tt_local_hash_find(bat_priv, addr);
  1529. if (!tt_local_entry)
  1530. goto out;
  1531. /* Check if the client has been logically deleted (but is kept for
  1532. * consistency purpose)
  1533. */
  1534. if (tt_local_entry->common.flags & TT_CLIENT_PENDING)
  1535. goto out;
  1536. ret = true;
  1537. out:
  1538. if (tt_local_entry)
  1539. batadv_tt_local_entry_free_ref(tt_local_entry);
  1540. return ret;
  1541. }
  1542. void batadv_handle_tt_response(struct bat_priv *bat_priv,
  1543. struct tt_query_packet *tt_response)
  1544. {
  1545. struct tt_req_node *node, *safe;
  1546. struct orig_node *orig_node = NULL;
  1547. batadv_dbg(DBG_TT, bat_priv,
  1548. "Received TT_RESPONSE from %pM for ttvn %d t_size: %d [%c]\n",
  1549. tt_response->src, tt_response->ttvn,
  1550. ntohs(tt_response->tt_data),
  1551. (tt_response->flags & TT_FULL_TABLE ? 'F' : '.'));
  1552. /* we should have never asked a backbone gw */
  1553. if (batadv_bla_is_backbone_gw_orig(bat_priv, tt_response->src))
  1554. goto out;
  1555. orig_node = batadv_orig_hash_find(bat_priv, tt_response->src);
  1556. if (!orig_node)
  1557. goto out;
  1558. if (tt_response->flags & TT_FULL_TABLE)
  1559. batadv_tt_fill_gtable(bat_priv, tt_response);
  1560. else
  1561. batadv_tt_update_changes(bat_priv, orig_node,
  1562. ntohs(tt_response->tt_data),
  1563. tt_response->ttvn,
  1564. (struct tt_change *)(tt_response + 1));
  1565. /* Delete the tt_req_node from pending tt_requests list */
  1566. spin_lock_bh(&bat_priv->tt_req_list_lock);
  1567. list_for_each_entry_safe(node, safe, &bat_priv->tt_req_list, list) {
  1568. if (!batadv_compare_eth(node->addr, tt_response->src))
  1569. continue;
  1570. list_del(&node->list);
  1571. kfree(node);
  1572. }
  1573. spin_unlock_bh(&bat_priv->tt_req_list_lock);
  1574. /* Recalculate the CRC for this orig_node and store it */
  1575. orig_node->tt_crc = batadv_tt_global_crc(bat_priv, orig_node);
  1576. /* Roaming phase is over: tables are in sync again. I can
  1577. * unset the flag
  1578. */
  1579. orig_node->tt_poss_change = false;
  1580. out:
  1581. if (orig_node)
  1582. batadv_orig_node_free_ref(orig_node);
  1583. }
  1584. int batadv_tt_init(struct bat_priv *bat_priv)
  1585. {
  1586. int ret;
  1587. ret = batadv_tt_local_init(bat_priv);
  1588. if (ret < 0)
  1589. return ret;
  1590. ret = batadv_tt_global_init(bat_priv);
  1591. if (ret < 0)
  1592. return ret;
  1593. batadv_tt_start_timer(bat_priv);
  1594. return 1;
  1595. }
  1596. static void batadv_tt_roam_list_free(struct bat_priv *bat_priv)
  1597. {
  1598. struct tt_roam_node *node, *safe;
  1599. spin_lock_bh(&bat_priv->tt_roam_list_lock);
  1600. list_for_each_entry_safe(node, safe, &bat_priv->tt_roam_list, list) {
  1601. list_del(&node->list);
  1602. kfree(node);
  1603. }
  1604. spin_unlock_bh(&bat_priv->tt_roam_list_lock);
  1605. }
  1606. static void batadv_tt_roam_purge(struct bat_priv *bat_priv)
  1607. {
  1608. struct tt_roam_node *node, *safe;
  1609. spin_lock_bh(&bat_priv->tt_roam_list_lock);
  1610. list_for_each_entry_safe(node, safe, &bat_priv->tt_roam_list, list) {
  1611. if (!batadv_has_timed_out(node->first_time, ROAMING_MAX_TIME))
  1612. continue;
  1613. list_del(&node->list);
  1614. kfree(node);
  1615. }
  1616. spin_unlock_bh(&bat_priv->tt_roam_list_lock);
  1617. }
  1618. /* This function checks whether the client already reached the
  1619. * maximum number of possible roaming phases. In this case the ROAMING_ADV
  1620. * will not be sent.
  1621. *
  1622. * returns true if the ROAMING_ADV can be sent, false otherwise
  1623. */
  1624. static bool batadv_tt_check_roam_count(struct bat_priv *bat_priv,
  1625. uint8_t *client)
  1626. {
  1627. struct tt_roam_node *tt_roam_node;
  1628. bool ret = false;
  1629. spin_lock_bh(&bat_priv->tt_roam_list_lock);
  1630. /* The new tt_req will be issued only if I'm not waiting for a
  1631. * reply from the same orig_node yet
  1632. */
  1633. list_for_each_entry(tt_roam_node, &bat_priv->tt_roam_list, list) {
  1634. if (!batadv_compare_eth(tt_roam_node->addr, client))
  1635. continue;
  1636. if (batadv_has_timed_out(tt_roam_node->first_time,
  1637. ROAMING_MAX_TIME))
  1638. continue;
  1639. if (!batadv_atomic_dec_not_zero(&tt_roam_node->counter))
  1640. /* Sorry, you roamed too many times! */
  1641. goto unlock;
  1642. ret = true;
  1643. break;
  1644. }
  1645. if (!ret) {
  1646. tt_roam_node = kmalloc(sizeof(*tt_roam_node), GFP_ATOMIC);
  1647. if (!tt_roam_node)
  1648. goto unlock;
  1649. tt_roam_node->first_time = jiffies;
  1650. atomic_set(&tt_roam_node->counter, ROAMING_MAX_COUNT - 1);
  1651. memcpy(tt_roam_node->addr, client, ETH_ALEN);
  1652. list_add(&tt_roam_node->list, &bat_priv->tt_roam_list);
  1653. ret = true;
  1654. }
  1655. unlock:
  1656. spin_unlock_bh(&bat_priv->tt_roam_list_lock);
  1657. return ret;
  1658. }
  1659. static void batadv_send_roam_adv(struct bat_priv *bat_priv, uint8_t *client,
  1660. struct orig_node *orig_node)
  1661. {
  1662. struct neigh_node *neigh_node = NULL;
  1663. struct sk_buff *skb = NULL;
  1664. struct roam_adv_packet *roam_adv_packet;
  1665. int ret = 1;
  1666. struct hard_iface *primary_if;
  1667. /* before going on we have to check whether the client has
  1668. * already roamed to us too many times
  1669. */
  1670. if (!batadv_tt_check_roam_count(bat_priv, client))
  1671. goto out;
  1672. skb = dev_alloc_skb(sizeof(struct roam_adv_packet) + ETH_HLEN);
  1673. if (!skb)
  1674. goto out;
  1675. skb_reserve(skb, ETH_HLEN);
  1676. roam_adv_packet = (struct roam_adv_packet *)skb_put(skb,
  1677. sizeof(struct roam_adv_packet));
  1678. roam_adv_packet->header.packet_type = BAT_ROAM_ADV;
  1679. roam_adv_packet->header.version = BATADV_COMPAT_VERSION;
  1680. roam_adv_packet->header.ttl = TTL;
  1681. primary_if = batadv_primary_if_get_selected(bat_priv);
  1682. if (!primary_if)
  1683. goto out;
  1684. memcpy(roam_adv_packet->src, primary_if->net_dev->dev_addr, ETH_ALEN);
  1685. batadv_hardif_free_ref(primary_if);
  1686. memcpy(roam_adv_packet->dst, orig_node->orig, ETH_ALEN);
  1687. memcpy(roam_adv_packet->client, client, ETH_ALEN);
  1688. neigh_node = batadv_orig_node_get_router(orig_node);
  1689. if (!neigh_node)
  1690. goto out;
  1691. batadv_dbg(DBG_TT, bat_priv,
  1692. "Sending ROAMING_ADV to %pM (client %pM) via %pM\n",
  1693. orig_node->orig, client, neigh_node->addr);
  1694. batadv_inc_counter(bat_priv, BAT_CNT_TT_ROAM_ADV_TX);
  1695. batadv_send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
  1696. ret = 0;
  1697. out:
  1698. if (neigh_node)
  1699. batadv_neigh_node_free_ref(neigh_node);
  1700. if (ret)
  1701. kfree_skb(skb);
  1702. return;
  1703. }
  1704. static void batadv_tt_purge(struct work_struct *work)
  1705. {
  1706. struct delayed_work *delayed_work =
  1707. container_of(work, struct delayed_work, work);
  1708. struct bat_priv *bat_priv =
  1709. container_of(delayed_work, struct bat_priv, tt_work);
  1710. batadv_tt_local_purge(bat_priv);
  1711. batadv_tt_global_roam_purge(bat_priv);
  1712. batadv_tt_req_purge(bat_priv);
  1713. batadv_tt_roam_purge(bat_priv);
  1714. batadv_tt_start_timer(bat_priv);
  1715. }
  1716. void batadv_tt_free(struct bat_priv *bat_priv)
  1717. {
  1718. cancel_delayed_work_sync(&bat_priv->tt_work);
  1719. batadv_tt_local_table_free(bat_priv);
  1720. batadv_tt_global_table_free(bat_priv);
  1721. batadv_tt_req_list_free(bat_priv);
  1722. batadv_tt_changes_list_free(bat_priv);
  1723. batadv_tt_roam_list_free(bat_priv);
  1724. kfree(bat_priv->tt_buff);
  1725. }
  1726. /* This function will enable or disable the specified flags for all the entries
  1727. * in the given hash table and returns the number of modified entries
  1728. */
  1729. static uint16_t batadv_tt_set_flags(struct hashtable_t *hash, uint16_t flags,
  1730. bool enable)
  1731. {
  1732. uint32_t i;
  1733. uint16_t changed_num = 0;
  1734. struct hlist_head *head;
  1735. struct hlist_node *node;
  1736. struct tt_common_entry *tt_common_entry;
  1737. if (!hash)
  1738. goto out;
  1739. for (i = 0; i < hash->size; i++) {
  1740. head = &hash->table[i];
  1741. rcu_read_lock();
  1742. hlist_for_each_entry_rcu(tt_common_entry, node,
  1743. head, hash_entry) {
  1744. if (enable) {
  1745. if ((tt_common_entry->flags & flags) == flags)
  1746. continue;
  1747. tt_common_entry->flags |= flags;
  1748. } else {
  1749. if (!(tt_common_entry->flags & flags))
  1750. continue;
  1751. tt_common_entry->flags &= ~flags;
  1752. }
  1753. changed_num++;
  1754. }
  1755. rcu_read_unlock();
  1756. }
  1757. out:
  1758. return changed_num;
  1759. }
  1760. /* Purge out all the tt local entries marked with TT_CLIENT_PENDING */
  1761. static void batadv_tt_local_purge_pending_clients(struct bat_priv *bat_priv)
  1762. {
  1763. struct hashtable_t *hash = bat_priv->tt_local_hash;
  1764. struct tt_common_entry *tt_common_entry;
  1765. struct tt_local_entry *tt_local_entry;
  1766. struct hlist_node *node, *node_tmp;
  1767. struct hlist_head *head;
  1768. spinlock_t *list_lock; /* protects write access to the hash lists */
  1769. uint32_t i;
  1770. if (!hash)
  1771. return;
  1772. for (i = 0; i < hash->size; i++) {
  1773. head = &hash->table[i];
  1774. list_lock = &hash->list_locks[i];
  1775. spin_lock_bh(list_lock);
  1776. hlist_for_each_entry_safe(tt_common_entry, node, node_tmp,
  1777. head, hash_entry) {
  1778. if (!(tt_common_entry->flags & TT_CLIENT_PENDING))
  1779. continue;
  1780. batadv_dbg(DBG_TT, bat_priv,
  1781. "Deleting local tt entry (%pM): pending\n",
  1782. tt_common_entry->addr);
  1783. atomic_dec(&bat_priv->num_local_tt);
  1784. hlist_del_rcu(node);
  1785. tt_local_entry = container_of(tt_common_entry,
  1786. struct tt_local_entry,
  1787. common);
  1788. batadv_tt_local_entry_free_ref(tt_local_entry);
  1789. }
  1790. spin_unlock_bh(list_lock);
  1791. }
  1792. }
  1793. static int batadv_tt_commit_changes(struct bat_priv *bat_priv,
  1794. unsigned char **packet_buff,
  1795. int *packet_buff_len, int packet_min_len)
  1796. {
  1797. uint16_t changed_num = 0;
  1798. if (atomic_read(&bat_priv->tt_local_changes) < 1)
  1799. return -ENOENT;
  1800. changed_num = batadv_tt_set_flags(bat_priv->tt_local_hash,
  1801. TT_CLIENT_NEW, false);
  1802. /* all reset entries have to be counted as local entries */
  1803. atomic_add(changed_num, &bat_priv->num_local_tt);
  1804. batadv_tt_local_purge_pending_clients(bat_priv);
  1805. bat_priv->tt_crc = batadv_tt_local_crc(bat_priv);
  1806. /* Increment the TTVN only once per OGM interval */
  1807. atomic_inc(&bat_priv->ttvn);
  1808. batadv_dbg(DBG_TT, bat_priv,
  1809. "Local changes committed, updating to ttvn %u\n",
  1810. (uint8_t)atomic_read(&bat_priv->ttvn));
  1811. bat_priv->tt_poss_change = false;
  1812. /* reset the sending counter */
  1813. atomic_set(&bat_priv->tt_ogm_append_cnt, TT_OGM_APPEND_MAX);
  1814. return batadv_tt_changes_fill_buff(bat_priv, packet_buff,
  1815. packet_buff_len, packet_min_len);
  1816. }
  1817. /* when calling this function (hard_iface == primary_if) has to be true */
  1818. int batadv_tt_append_diff(struct bat_priv *bat_priv,
  1819. unsigned char **packet_buff, int *packet_buff_len,
  1820. int packet_min_len)
  1821. {
  1822. int tt_num_changes;
  1823. /* if at least one change happened */
  1824. tt_num_changes = batadv_tt_commit_changes(bat_priv, packet_buff,
  1825. packet_buff_len,
  1826. packet_min_len);
  1827. /* if the changes have been sent often enough */
  1828. if ((tt_num_changes < 0) &&
  1829. (!batadv_atomic_dec_not_zero(&bat_priv->tt_ogm_append_cnt))) {
  1830. batadv_tt_realloc_packet_buff(packet_buff, packet_buff_len,
  1831. packet_min_len, packet_min_len);
  1832. tt_num_changes = 0;
  1833. }
  1834. return tt_num_changes;
  1835. }
  1836. bool batadv_is_ap_isolated(struct bat_priv *bat_priv, uint8_t *src,
  1837. uint8_t *dst)
  1838. {
  1839. struct tt_local_entry *tt_local_entry = NULL;
  1840. struct tt_global_entry *tt_global_entry = NULL;
  1841. bool ret = false;
  1842. if (!atomic_read(&bat_priv->ap_isolation))
  1843. goto out;
  1844. tt_local_entry = batadv_tt_local_hash_find(bat_priv, dst);
  1845. if (!tt_local_entry)
  1846. goto out;
  1847. tt_global_entry = batadv_tt_global_hash_find(bat_priv, src);
  1848. if (!tt_global_entry)
  1849. goto out;
  1850. if (!_batadv_is_ap_isolated(tt_local_entry, tt_global_entry))
  1851. goto out;
  1852. ret = true;
  1853. out:
  1854. if (tt_global_entry)
  1855. batadv_tt_global_entry_free_ref(tt_global_entry);
  1856. if (tt_local_entry)
  1857. batadv_tt_local_entry_free_ref(tt_local_entry);
  1858. return ret;
  1859. }
  1860. void batadv_tt_update_orig(struct bat_priv *bat_priv,
  1861. struct orig_node *orig_node,
  1862. const unsigned char *tt_buff, uint8_t tt_num_changes,
  1863. uint8_t ttvn, uint16_t tt_crc)
  1864. {
  1865. uint8_t orig_ttvn = (uint8_t)atomic_read(&orig_node->last_ttvn);
  1866. bool full_table = true;
  1867. /* don't care about a backbone gateways updates. */
  1868. if (batadv_bla_is_backbone_gw_orig(bat_priv, orig_node->orig))
  1869. return;
  1870. /* orig table not initialised AND first diff is in the OGM OR the ttvn
  1871. * increased by one -> we can apply the attached changes
  1872. */
  1873. if ((!orig_node->tt_initialised && ttvn == 1) ||
  1874. ttvn - orig_ttvn == 1) {
  1875. /* the OGM could not contain the changes due to their size or
  1876. * because they have already been sent TT_OGM_APPEND_MAX times.
  1877. * In this case send a tt request
  1878. */
  1879. if (!tt_num_changes) {
  1880. full_table = false;
  1881. goto request_table;
  1882. }
  1883. batadv_tt_update_changes(bat_priv, orig_node, tt_num_changes,
  1884. ttvn, (struct tt_change *)tt_buff);
  1885. /* Even if we received the precomputed crc with the OGM, we
  1886. * prefer to recompute it to spot any possible inconsistency
  1887. * in the global table
  1888. */
  1889. orig_node->tt_crc = batadv_tt_global_crc(bat_priv, orig_node);
  1890. /* The ttvn alone is not enough to guarantee consistency
  1891. * because a single value could represent different states
  1892. * (due to the wrap around). Thus a node has to check whether
  1893. * the resulting table (after applying the changes) is still
  1894. * consistent or not. E.g. a node could disconnect while its
  1895. * ttvn is X and reconnect on ttvn = X + TTVN_MAX: in this case
  1896. * checking the CRC value is mandatory to detect the
  1897. * inconsistency
  1898. */
  1899. if (orig_node->tt_crc != tt_crc)
  1900. goto request_table;
  1901. /* Roaming phase is over: tables are in sync again. I can
  1902. * unset the flag
  1903. */
  1904. orig_node->tt_poss_change = false;
  1905. } else {
  1906. /* if we missed more than one change or our tables are not
  1907. * in sync anymore -> request fresh tt data
  1908. */
  1909. if (!orig_node->tt_initialised || ttvn != orig_ttvn ||
  1910. orig_node->tt_crc != tt_crc) {
  1911. request_table:
  1912. batadv_dbg(DBG_TT, bat_priv,
  1913. "TT inconsistency for %pM. Need to retrieve the correct information (ttvn: %u last_ttvn: %u crc: %u last_crc: %u num_changes: %u)\n",
  1914. orig_node->orig, ttvn, orig_ttvn, tt_crc,
  1915. orig_node->tt_crc, tt_num_changes);
  1916. batadv_send_tt_request(bat_priv, orig_node, ttvn,
  1917. tt_crc, full_table);
  1918. return;
  1919. }
  1920. }
  1921. }
  1922. /* returns true whether we know that the client has moved from its old
  1923. * originator to another one. This entry is kept is still kept for consistency
  1924. * purposes
  1925. */
  1926. bool batadv_tt_global_client_is_roaming(struct bat_priv *bat_priv,
  1927. uint8_t *addr)
  1928. {
  1929. struct tt_global_entry *tt_global_entry;
  1930. bool ret = false;
  1931. tt_global_entry = batadv_tt_global_hash_find(bat_priv, addr);
  1932. if (!tt_global_entry)
  1933. goto out;
  1934. ret = tt_global_entry->common.flags & TT_CLIENT_ROAM;
  1935. batadv_tt_global_entry_free_ref(tt_global_entry);
  1936. out:
  1937. return ret;
  1938. }