send.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666
  1. /*
  2. * Copyright (C) 2007-2011 B.A.T.M.A.N. contributors:
  3. *
  4. * Marek Lindner, Simon Wunderlich
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of version 2 of the GNU General Public
  8. * License as published by the Free Software Foundation.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program; if not, write to the Free Software
  17. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  18. * 02110-1301, USA
  19. *
  20. */
  21. #include "main.h"
  22. #include "send.h"
  23. #include "routing.h"
  24. #include "translation-table.h"
  25. #include "soft-interface.h"
  26. #include "hard-interface.h"
  27. #include "vis.h"
  28. #include "aggregation.h"
  29. #include "gateway_common.h"
  30. #include "originator.h"
  31. static void send_outstanding_bcast_packet(struct work_struct *work);
  32. /* apply hop penalty for a normal link */
  33. static uint8_t hop_penalty(uint8_t tq, const struct bat_priv *bat_priv)
  34. {
  35. int hop_penalty = atomic_read(&bat_priv->hop_penalty);
  36. return (tq * (TQ_MAX_VALUE - hop_penalty)) / (TQ_MAX_VALUE);
  37. }
  38. /* when do we schedule our own packet to be sent */
  39. static unsigned long own_send_time(const struct bat_priv *bat_priv)
  40. {
  41. return jiffies + msecs_to_jiffies(
  42. atomic_read(&bat_priv->orig_interval) -
  43. JITTER + (random32() % 2*JITTER));
  44. }
  45. /* when do we schedule a forwarded packet to be sent */
  46. static unsigned long forward_send_time(void)
  47. {
  48. return jiffies + msecs_to_jiffies(random32() % (JITTER/2));
  49. }
  50. /* send out an already prepared packet to the given address via the
  51. * specified batman interface */
  52. int send_skb_packet(struct sk_buff *skb, struct hard_iface *hard_iface,
  53. const uint8_t *dst_addr)
  54. {
  55. struct ethhdr *ethhdr;
  56. if (hard_iface->if_status != IF_ACTIVE)
  57. goto send_skb_err;
  58. if (unlikely(!hard_iface->net_dev))
  59. goto send_skb_err;
  60. if (!(hard_iface->net_dev->flags & IFF_UP)) {
  61. pr_warning("Interface %s is not up - can't send packet via "
  62. "that interface!\n", hard_iface->net_dev->name);
  63. goto send_skb_err;
  64. }
  65. /* push to the ethernet header. */
  66. if (my_skb_head_push(skb, sizeof(*ethhdr)) < 0)
  67. goto send_skb_err;
  68. skb_reset_mac_header(skb);
  69. ethhdr = (struct ethhdr *) skb_mac_header(skb);
  70. memcpy(ethhdr->h_source, hard_iface->net_dev->dev_addr, ETH_ALEN);
  71. memcpy(ethhdr->h_dest, dst_addr, ETH_ALEN);
  72. ethhdr->h_proto = __constant_htons(ETH_P_BATMAN);
  73. skb_set_network_header(skb, ETH_HLEN);
  74. skb->priority = TC_PRIO_CONTROL;
  75. skb->protocol = __constant_htons(ETH_P_BATMAN);
  76. skb->dev = hard_iface->net_dev;
  77. /* dev_queue_xmit() returns a negative result on error. However on
  78. * congestion and traffic shaping, it drops and returns NET_XMIT_DROP
  79. * (which is > 0). This will not be treated as an error. */
  80. return dev_queue_xmit(skb);
  81. send_skb_err:
  82. kfree_skb(skb);
  83. return NET_XMIT_DROP;
  84. }
  85. /* Send a packet to a given interface */
  86. static void send_packet_to_if(struct forw_packet *forw_packet,
  87. struct hard_iface *hard_iface)
  88. {
  89. struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
  90. char *fwd_str;
  91. uint8_t packet_num;
  92. int16_t buff_pos;
  93. struct batman_packet *batman_packet;
  94. struct sk_buff *skb;
  95. if (hard_iface->if_status != IF_ACTIVE)
  96. return;
  97. packet_num = 0;
  98. buff_pos = 0;
  99. batman_packet = (struct batman_packet *)forw_packet->skb->data;
  100. /* adjust all flags and log packets */
  101. while (aggregated_packet(buff_pos,
  102. forw_packet->packet_len,
  103. batman_packet->tt_num_changes)) {
  104. /* we might have aggregated direct link packets with an
  105. * ordinary base packet */
  106. if ((forw_packet->direct_link_flags & (1 << packet_num)) &&
  107. (forw_packet->if_incoming == hard_iface))
  108. batman_packet->flags |= DIRECTLINK;
  109. else
  110. batman_packet->flags &= ~DIRECTLINK;
  111. fwd_str = (packet_num > 0 ? "Forwarding" : (forw_packet->own ?
  112. "Sending own" :
  113. "Forwarding"));
  114. bat_dbg(DBG_BATMAN, bat_priv,
  115. "%s %spacket (originator %pM, seqno %d, TQ %d, TTL %d,"
  116. " IDF %s, hvn %d) on interface %s [%pM]\n",
  117. fwd_str, (packet_num > 0 ? "aggregated " : ""),
  118. batman_packet->orig, ntohl(batman_packet->seqno),
  119. batman_packet->tq, batman_packet->ttl,
  120. (batman_packet->flags & DIRECTLINK ?
  121. "on" : "off"),
  122. batman_packet->ttvn, hard_iface->net_dev->name,
  123. hard_iface->net_dev->dev_addr);
  124. buff_pos += sizeof(*batman_packet) +
  125. tt_len(batman_packet->tt_num_changes);
  126. packet_num++;
  127. batman_packet = (struct batman_packet *)
  128. (forw_packet->skb->data + buff_pos);
  129. }
  130. /* create clone because function is called more than once */
  131. skb = skb_clone(forw_packet->skb, GFP_ATOMIC);
  132. if (skb)
  133. send_skb_packet(skb, hard_iface, broadcast_addr);
  134. }
  135. /* send a batman packet */
  136. static void send_packet(struct forw_packet *forw_packet)
  137. {
  138. struct hard_iface *hard_iface;
  139. struct net_device *soft_iface;
  140. struct bat_priv *bat_priv;
  141. struct hard_iface *primary_if = NULL;
  142. struct batman_packet *batman_packet =
  143. (struct batman_packet *)(forw_packet->skb->data);
  144. int directlink = (batman_packet->flags & DIRECTLINK ? 1 : 0);
  145. if (!forw_packet->if_incoming) {
  146. pr_err("Error - can't forward packet: incoming iface not "
  147. "specified\n");
  148. goto out;
  149. }
  150. soft_iface = forw_packet->if_incoming->soft_iface;
  151. bat_priv = netdev_priv(soft_iface);
  152. if (forw_packet->if_incoming->if_status != IF_ACTIVE)
  153. goto out;
  154. primary_if = primary_if_get_selected(bat_priv);
  155. if (!primary_if)
  156. goto out;
  157. /* multihomed peer assumed */
  158. /* non-primary OGMs are only broadcasted on their interface */
  159. if ((directlink && (batman_packet->ttl == 1)) ||
  160. (forw_packet->own && (forw_packet->if_incoming != primary_if))) {
  161. /* FIXME: what about aggregated packets ? */
  162. bat_dbg(DBG_BATMAN, bat_priv,
  163. "%s packet (originator %pM, seqno %d, TTL %d) "
  164. "on interface %s [%pM]\n",
  165. (forw_packet->own ? "Sending own" : "Forwarding"),
  166. batman_packet->orig, ntohl(batman_packet->seqno),
  167. batman_packet->ttl,
  168. forw_packet->if_incoming->net_dev->name,
  169. forw_packet->if_incoming->net_dev->dev_addr);
  170. /* skb is only used once and than forw_packet is free'd */
  171. send_skb_packet(forw_packet->skb, forw_packet->if_incoming,
  172. broadcast_addr);
  173. forw_packet->skb = NULL;
  174. goto out;
  175. }
  176. /* broadcast on every interface */
  177. rcu_read_lock();
  178. list_for_each_entry_rcu(hard_iface, &hardif_list, list) {
  179. if (hard_iface->soft_iface != soft_iface)
  180. continue;
  181. send_packet_to_if(forw_packet, hard_iface);
  182. }
  183. rcu_read_unlock();
  184. out:
  185. if (primary_if)
  186. hardif_free_ref(primary_if);
  187. }
  188. static void realloc_packet_buffer(struct hard_iface *hard_iface,
  189. int new_len)
  190. {
  191. unsigned char *new_buff;
  192. struct batman_packet *batman_packet;
  193. new_buff = kmalloc(new_len, GFP_ATOMIC);
  194. /* keep old buffer if kmalloc should fail */
  195. if (new_buff) {
  196. memcpy(new_buff, hard_iface->packet_buff,
  197. sizeof(*batman_packet));
  198. kfree(hard_iface->packet_buff);
  199. hard_iface->packet_buff = new_buff;
  200. hard_iface->packet_len = new_len;
  201. }
  202. }
  203. /* when calling this function (hard_iface == primary_if) has to be true */
  204. static void prepare_packet_buffer(struct bat_priv *bat_priv,
  205. struct hard_iface *hard_iface)
  206. {
  207. int new_len;
  208. struct batman_packet *batman_packet;
  209. new_len = BAT_PACKET_LEN +
  210. tt_len((uint8_t)atomic_read(&bat_priv->tt_local_changes));
  211. /* if we have too many changes for one packet don't send any
  212. * and wait for the tt table request which will be fragmented */
  213. if (new_len > hard_iface->soft_iface->mtu)
  214. new_len = BAT_PACKET_LEN;
  215. realloc_packet_buffer(hard_iface, new_len);
  216. batman_packet = (struct batman_packet *)hard_iface->packet_buff;
  217. atomic_set(&bat_priv->tt_crc, tt_local_crc(bat_priv));
  218. /* reset the sending counter */
  219. atomic_set(&bat_priv->tt_ogm_append_cnt, TT_OGM_APPEND_MAX);
  220. batman_packet->tt_num_changes = tt_changes_fill_buffer(bat_priv,
  221. hard_iface->packet_buff + BAT_PACKET_LEN,
  222. hard_iface->packet_len - BAT_PACKET_LEN);
  223. }
  224. static void reset_packet_buffer(struct bat_priv *bat_priv,
  225. struct hard_iface *hard_iface)
  226. {
  227. struct batman_packet *batman_packet;
  228. realloc_packet_buffer(hard_iface, BAT_PACKET_LEN);
  229. batman_packet = (struct batman_packet *)hard_iface->packet_buff;
  230. batman_packet->tt_num_changes = 0;
  231. }
  232. void schedule_own_packet(struct hard_iface *hard_iface)
  233. {
  234. struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
  235. struct hard_iface *primary_if;
  236. unsigned long send_time;
  237. struct batman_packet *batman_packet;
  238. int vis_server;
  239. if ((hard_iface->if_status == IF_NOT_IN_USE) ||
  240. (hard_iface->if_status == IF_TO_BE_REMOVED))
  241. return;
  242. vis_server = atomic_read(&bat_priv->vis_mode);
  243. primary_if = primary_if_get_selected(bat_priv);
  244. /**
  245. * the interface gets activated here to avoid race conditions between
  246. * the moment of activating the interface in
  247. * hardif_activate_interface() where the originator mac is set and
  248. * outdated packets (especially uninitialized mac addresses) in the
  249. * packet queue
  250. */
  251. if (hard_iface->if_status == IF_TO_BE_ACTIVATED)
  252. hard_iface->if_status = IF_ACTIVE;
  253. if (hard_iface == primary_if) {
  254. /* if at least one change happened */
  255. if (atomic_read(&bat_priv->tt_local_changes) > 0) {
  256. tt_commit_changes(bat_priv);
  257. prepare_packet_buffer(bat_priv, hard_iface);
  258. }
  259. /* if the changes have been sent enough times */
  260. if (!atomic_dec_not_zero(&bat_priv->tt_ogm_append_cnt))
  261. reset_packet_buffer(bat_priv, hard_iface);
  262. }
  263. /**
  264. * NOTE: packet_buff might just have been re-allocated in
  265. * prepare_packet_buffer() or in reset_packet_buffer()
  266. */
  267. batman_packet = (struct batman_packet *)hard_iface->packet_buff;
  268. /* change sequence number to network order */
  269. batman_packet->seqno =
  270. htonl((uint32_t)atomic_read(&hard_iface->seqno));
  271. batman_packet->ttvn = atomic_read(&bat_priv->ttvn);
  272. batman_packet->tt_crc = htons((uint16_t)atomic_read(&bat_priv->tt_crc));
  273. if (vis_server == VIS_TYPE_SERVER_SYNC)
  274. batman_packet->flags |= VIS_SERVER;
  275. else
  276. batman_packet->flags &= ~VIS_SERVER;
  277. if ((hard_iface == primary_if) &&
  278. (atomic_read(&bat_priv->gw_mode) == GW_MODE_SERVER))
  279. batman_packet->gw_flags =
  280. (uint8_t)atomic_read(&bat_priv->gw_bandwidth);
  281. else
  282. batman_packet->gw_flags = NO_FLAGS;
  283. atomic_inc(&hard_iface->seqno);
  284. slide_own_bcast_window(hard_iface);
  285. send_time = own_send_time(bat_priv);
  286. add_bat_packet_to_list(bat_priv,
  287. hard_iface->packet_buff,
  288. hard_iface->packet_len,
  289. hard_iface, 1, send_time);
  290. if (primary_if)
  291. hardif_free_ref(primary_if);
  292. }
  293. void schedule_forward_packet(struct orig_node *orig_node,
  294. const struct ethhdr *ethhdr,
  295. struct batman_packet *batman_packet,
  296. int directlink,
  297. struct hard_iface *if_incoming)
  298. {
  299. struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
  300. struct neigh_node *router;
  301. uint8_t in_tq, in_ttl, tq_avg = 0;
  302. unsigned long send_time;
  303. uint8_t tt_num_changes;
  304. if (batman_packet->ttl <= 1) {
  305. bat_dbg(DBG_BATMAN, bat_priv, "ttl exceeded\n");
  306. return;
  307. }
  308. router = orig_node_get_router(orig_node);
  309. in_tq = batman_packet->tq;
  310. in_ttl = batman_packet->ttl;
  311. tt_num_changes = batman_packet->tt_num_changes;
  312. batman_packet->ttl--;
  313. memcpy(batman_packet->prev_sender, ethhdr->h_source, ETH_ALEN);
  314. /* rebroadcast tq of our best ranking neighbor to ensure the rebroadcast
  315. * of our best tq value */
  316. if (router && router->tq_avg != 0) {
  317. /* rebroadcast ogm of best ranking neighbor as is */
  318. if (!compare_eth(router->addr, ethhdr->h_source)) {
  319. batman_packet->tq = router->tq_avg;
  320. if (router->last_ttl)
  321. batman_packet->ttl = router->last_ttl - 1;
  322. }
  323. tq_avg = router->tq_avg;
  324. }
  325. if (router)
  326. neigh_node_free_ref(router);
  327. /* apply hop penalty */
  328. batman_packet->tq = hop_penalty(batman_packet->tq, bat_priv);
  329. bat_dbg(DBG_BATMAN, bat_priv,
  330. "Forwarding packet: tq_orig: %i, tq_avg: %i, "
  331. "tq_forw: %i, ttl_orig: %i, ttl_forw: %i\n",
  332. in_tq, tq_avg, batman_packet->tq, in_ttl - 1,
  333. batman_packet->ttl);
  334. batman_packet->seqno = htonl(batman_packet->seqno);
  335. batman_packet->tt_crc = htons(batman_packet->tt_crc);
  336. /* switch of primaries first hop flag when forwarding */
  337. batman_packet->flags &= ~PRIMARIES_FIRST_HOP;
  338. if (directlink)
  339. batman_packet->flags |= DIRECTLINK;
  340. else
  341. batman_packet->flags &= ~DIRECTLINK;
  342. send_time = forward_send_time();
  343. add_bat_packet_to_list(bat_priv,
  344. (unsigned char *)batman_packet,
  345. sizeof(*batman_packet) + tt_len(tt_num_changes),
  346. if_incoming, 0, send_time);
  347. }
  348. static void forw_packet_free(struct forw_packet *forw_packet)
  349. {
  350. if (forw_packet->skb)
  351. kfree_skb(forw_packet->skb);
  352. if (forw_packet->if_incoming)
  353. hardif_free_ref(forw_packet->if_incoming);
  354. kfree(forw_packet);
  355. }
  356. static void _add_bcast_packet_to_list(struct bat_priv *bat_priv,
  357. struct forw_packet *forw_packet,
  358. unsigned long send_time)
  359. {
  360. INIT_HLIST_NODE(&forw_packet->list);
  361. /* add new packet to packet list */
  362. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  363. hlist_add_head(&forw_packet->list, &bat_priv->forw_bcast_list);
  364. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  365. /* start timer for this packet */
  366. INIT_DELAYED_WORK(&forw_packet->delayed_work,
  367. send_outstanding_bcast_packet);
  368. queue_delayed_work(bat_event_workqueue, &forw_packet->delayed_work,
  369. send_time);
  370. }
  371. /* add a broadcast packet to the queue and setup timers. broadcast packets
  372. * are sent multiple times to increase probability for beeing received.
  373. *
  374. * This function returns NETDEV_TX_OK on success and NETDEV_TX_BUSY on
  375. * errors.
  376. *
  377. * The skb is not consumed, so the caller should make sure that the
  378. * skb is freed. */
  379. int add_bcast_packet_to_list(struct bat_priv *bat_priv,
  380. const struct sk_buff *skb, unsigned long delay)
  381. {
  382. struct hard_iface *primary_if = NULL;
  383. struct forw_packet *forw_packet;
  384. struct bcast_packet *bcast_packet;
  385. struct sk_buff *newskb;
  386. if (!atomic_dec_not_zero(&bat_priv->bcast_queue_left)) {
  387. bat_dbg(DBG_BATMAN, bat_priv, "bcast packet queue full\n");
  388. goto out;
  389. }
  390. primary_if = primary_if_get_selected(bat_priv);
  391. if (!primary_if)
  392. goto out_and_inc;
  393. forw_packet = kmalloc(sizeof(*forw_packet), GFP_ATOMIC);
  394. if (!forw_packet)
  395. goto out_and_inc;
  396. newskb = skb_copy(skb, GFP_ATOMIC);
  397. if (!newskb)
  398. goto packet_free;
  399. /* as we have a copy now, it is safe to decrease the TTL */
  400. bcast_packet = (struct bcast_packet *)newskb->data;
  401. bcast_packet->ttl--;
  402. skb_reset_mac_header(newskb);
  403. forw_packet->skb = newskb;
  404. forw_packet->if_incoming = primary_if;
  405. /* how often did we send the bcast packet ? */
  406. forw_packet->num_packets = 0;
  407. _add_bcast_packet_to_list(bat_priv, forw_packet, delay);
  408. return NETDEV_TX_OK;
  409. packet_free:
  410. kfree(forw_packet);
  411. out_and_inc:
  412. atomic_inc(&bat_priv->bcast_queue_left);
  413. out:
  414. if (primary_if)
  415. hardif_free_ref(primary_if);
  416. return NETDEV_TX_BUSY;
  417. }
  418. static void send_outstanding_bcast_packet(struct work_struct *work)
  419. {
  420. struct hard_iface *hard_iface;
  421. struct delayed_work *delayed_work =
  422. container_of(work, struct delayed_work, work);
  423. struct forw_packet *forw_packet =
  424. container_of(delayed_work, struct forw_packet, delayed_work);
  425. struct sk_buff *skb1;
  426. struct net_device *soft_iface = forw_packet->if_incoming->soft_iface;
  427. struct bat_priv *bat_priv = netdev_priv(soft_iface);
  428. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  429. hlist_del(&forw_packet->list);
  430. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  431. if (atomic_read(&bat_priv->mesh_state) == MESH_DEACTIVATING)
  432. goto out;
  433. /* rebroadcast packet */
  434. rcu_read_lock();
  435. list_for_each_entry_rcu(hard_iface, &hardif_list, list) {
  436. if (hard_iface->soft_iface != soft_iface)
  437. continue;
  438. /* send a copy of the saved skb */
  439. skb1 = skb_clone(forw_packet->skb, GFP_ATOMIC);
  440. if (skb1)
  441. send_skb_packet(skb1, hard_iface, broadcast_addr);
  442. }
  443. rcu_read_unlock();
  444. forw_packet->num_packets++;
  445. /* if we still have some more bcasts to send */
  446. if (forw_packet->num_packets < 3) {
  447. _add_bcast_packet_to_list(bat_priv, forw_packet,
  448. ((5 * HZ) / 1000));
  449. return;
  450. }
  451. out:
  452. forw_packet_free(forw_packet);
  453. atomic_inc(&bat_priv->bcast_queue_left);
  454. }
  455. void send_outstanding_bat_packet(struct work_struct *work)
  456. {
  457. struct delayed_work *delayed_work =
  458. container_of(work, struct delayed_work, work);
  459. struct forw_packet *forw_packet =
  460. container_of(delayed_work, struct forw_packet, delayed_work);
  461. struct bat_priv *bat_priv;
  462. bat_priv = netdev_priv(forw_packet->if_incoming->soft_iface);
  463. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  464. hlist_del(&forw_packet->list);
  465. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  466. if (atomic_read(&bat_priv->mesh_state) == MESH_DEACTIVATING)
  467. goto out;
  468. send_packet(forw_packet);
  469. /**
  470. * we have to have at least one packet in the queue
  471. * to determine the queues wake up time unless we are
  472. * shutting down
  473. */
  474. if (forw_packet->own)
  475. schedule_own_packet(forw_packet->if_incoming);
  476. out:
  477. /* don't count own packet */
  478. if (!forw_packet->own)
  479. atomic_inc(&bat_priv->batman_queue_left);
  480. forw_packet_free(forw_packet);
  481. }
  482. void purge_outstanding_packets(struct bat_priv *bat_priv,
  483. const struct hard_iface *hard_iface)
  484. {
  485. struct forw_packet *forw_packet;
  486. struct hlist_node *tmp_node, *safe_tmp_node;
  487. bool pending;
  488. if (hard_iface)
  489. bat_dbg(DBG_BATMAN, bat_priv,
  490. "purge_outstanding_packets(): %s\n",
  491. hard_iface->net_dev->name);
  492. else
  493. bat_dbg(DBG_BATMAN, bat_priv,
  494. "purge_outstanding_packets()\n");
  495. /* free bcast list */
  496. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  497. hlist_for_each_entry_safe(forw_packet, tmp_node, safe_tmp_node,
  498. &bat_priv->forw_bcast_list, list) {
  499. /**
  500. * if purge_outstanding_packets() was called with an argmument
  501. * we delete only packets belonging to the given interface
  502. */
  503. if ((hard_iface) &&
  504. (forw_packet->if_incoming != hard_iface))
  505. continue;
  506. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  507. /**
  508. * send_outstanding_bcast_packet() will lock the list to
  509. * delete the item from the list
  510. */
  511. pending = cancel_delayed_work_sync(&forw_packet->delayed_work);
  512. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  513. if (pending) {
  514. hlist_del(&forw_packet->list);
  515. forw_packet_free(forw_packet);
  516. }
  517. }
  518. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  519. /* free batman packet list */
  520. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  521. hlist_for_each_entry_safe(forw_packet, tmp_node, safe_tmp_node,
  522. &bat_priv->forw_bat_list, list) {
  523. /**
  524. * if purge_outstanding_packets() was called with an argmument
  525. * we delete only packets belonging to the given interface
  526. */
  527. if ((hard_iface) &&
  528. (forw_packet->if_incoming != hard_iface))
  529. continue;
  530. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  531. /**
  532. * send_outstanding_bat_packet() will lock the list to
  533. * delete the item from the list
  534. */
  535. pending = cancel_delayed_work_sync(&forw_packet->delayed_work);
  536. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  537. if (pending) {
  538. hlist_del(&forw_packet->list);
  539. forw_packet_free(forw_packet);
  540. }
  541. }
  542. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  543. }