send.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658
  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 batman_packet *batman_packet =
  142. (struct batman_packet *)(forw_packet->skb->data);
  143. int directlink = (batman_packet->flags & DIRECTLINK ? 1 : 0);
  144. if (!forw_packet->if_incoming) {
  145. pr_err("Error - can't forward packet: incoming iface not "
  146. "specified\n");
  147. return;
  148. }
  149. soft_iface = forw_packet->if_incoming->soft_iface;
  150. bat_priv = netdev_priv(soft_iface);
  151. if (forw_packet->if_incoming->if_status != IF_ACTIVE)
  152. return;
  153. /* multihomed peer assumed */
  154. /* non-primary OGMs are only broadcasted on their interface */
  155. if ((directlink && (batman_packet->ttl == 1)) ||
  156. (forw_packet->own && (forw_packet->if_incoming->if_num > 0))) {
  157. /* FIXME: what about aggregated packets ? */
  158. bat_dbg(DBG_BATMAN, bat_priv,
  159. "%s packet (originator %pM, seqno %d, TTL %d) "
  160. "on interface %s [%pM]\n",
  161. (forw_packet->own ? "Sending own" : "Forwarding"),
  162. batman_packet->orig, ntohl(batman_packet->seqno),
  163. batman_packet->ttl,
  164. forw_packet->if_incoming->net_dev->name,
  165. forw_packet->if_incoming->net_dev->dev_addr);
  166. /* skb is only used once and than forw_packet is free'd */
  167. send_skb_packet(forw_packet->skb, forw_packet->if_incoming,
  168. broadcast_addr);
  169. forw_packet->skb = NULL;
  170. return;
  171. }
  172. /* broadcast on every interface */
  173. rcu_read_lock();
  174. list_for_each_entry_rcu(hard_iface, &hardif_list, list) {
  175. if (hard_iface->soft_iface != soft_iface)
  176. continue;
  177. send_packet_to_if(forw_packet, hard_iface);
  178. }
  179. rcu_read_unlock();
  180. }
  181. static void realloc_packet_buffer(struct hard_iface *hard_iface,
  182. int new_len)
  183. {
  184. unsigned char *new_buff;
  185. struct batman_packet *batman_packet;
  186. new_buff = kmalloc(new_len, GFP_ATOMIC);
  187. /* keep old buffer if kmalloc should fail */
  188. if (new_buff) {
  189. memcpy(new_buff, hard_iface->packet_buff,
  190. sizeof(*batman_packet));
  191. kfree(hard_iface->packet_buff);
  192. hard_iface->packet_buff = new_buff;
  193. hard_iface->packet_len = new_len;
  194. }
  195. }
  196. /* when calling this function (hard_iface == primary_if) has to be true */
  197. static void prepare_packet_buffer(struct bat_priv *bat_priv,
  198. struct hard_iface *hard_iface)
  199. {
  200. int new_len;
  201. struct batman_packet *batman_packet;
  202. new_len = BAT_PACKET_LEN +
  203. tt_len((uint8_t)atomic_read(&bat_priv->tt_local_changes));
  204. /* if we have too many changes for one packet don't send any
  205. * and wait for the tt table request which will be fragmented */
  206. if (new_len > hard_iface->soft_iface->mtu)
  207. new_len = BAT_PACKET_LEN;
  208. realloc_packet_buffer(hard_iface, new_len);
  209. batman_packet = (struct batman_packet *)hard_iface->packet_buff;
  210. atomic_set(&bat_priv->tt_crc, tt_local_crc(bat_priv));
  211. /* reset the sending counter */
  212. atomic_set(&bat_priv->tt_ogm_append_cnt, TT_OGM_APPEND_MAX);
  213. batman_packet->tt_num_changes = tt_changes_fill_buffer(bat_priv,
  214. hard_iface->packet_buff + BAT_PACKET_LEN,
  215. hard_iface->packet_len - BAT_PACKET_LEN);
  216. }
  217. static void reset_packet_buffer(struct bat_priv *bat_priv,
  218. struct hard_iface *hard_iface)
  219. {
  220. struct batman_packet *batman_packet;
  221. realloc_packet_buffer(hard_iface, BAT_PACKET_LEN);
  222. batman_packet = (struct batman_packet *)hard_iface->packet_buff;
  223. batman_packet->tt_num_changes = 0;
  224. }
  225. void schedule_own_packet(struct hard_iface *hard_iface)
  226. {
  227. struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
  228. struct hard_iface *primary_if;
  229. unsigned long send_time;
  230. struct batman_packet *batman_packet;
  231. int vis_server;
  232. if ((hard_iface->if_status == IF_NOT_IN_USE) ||
  233. (hard_iface->if_status == IF_TO_BE_REMOVED))
  234. return;
  235. vis_server = atomic_read(&bat_priv->vis_mode);
  236. primary_if = primary_if_get_selected(bat_priv);
  237. /**
  238. * the interface gets activated here to avoid race conditions between
  239. * the moment of activating the interface in
  240. * hardif_activate_interface() where the originator mac is set and
  241. * outdated packets (especially uninitialized mac addresses) in the
  242. * packet queue
  243. */
  244. if (hard_iface->if_status == IF_TO_BE_ACTIVATED)
  245. hard_iface->if_status = IF_ACTIVE;
  246. if (hard_iface == primary_if) {
  247. /* if at least one change happened */
  248. if (atomic_read(&bat_priv->tt_local_changes) > 0) {
  249. prepare_packet_buffer(bat_priv, hard_iface);
  250. /* Increment the TTVN only once per OGM interval */
  251. atomic_inc(&bat_priv->ttvn);
  252. }
  253. /* if the changes have been sent enough times */
  254. if (!atomic_dec_not_zero(&bat_priv->tt_ogm_append_cnt))
  255. reset_packet_buffer(bat_priv, hard_iface);
  256. }
  257. /**
  258. * NOTE: packet_buff might just have been re-allocated in
  259. * prepare_packet_buffer() or in reset_packet_buffer()
  260. */
  261. batman_packet = (struct batman_packet *)hard_iface->packet_buff;
  262. /* change sequence number to network order */
  263. batman_packet->seqno =
  264. htonl((uint32_t)atomic_read(&hard_iface->seqno));
  265. batman_packet->ttvn = atomic_read(&bat_priv->ttvn);
  266. batman_packet->tt_crc = htons((uint16_t)atomic_read(&bat_priv->tt_crc));
  267. if (vis_server == VIS_TYPE_SERVER_SYNC)
  268. batman_packet->flags |= VIS_SERVER;
  269. else
  270. batman_packet->flags &= ~VIS_SERVER;
  271. if ((hard_iface == primary_if) &&
  272. (atomic_read(&bat_priv->gw_mode) == GW_MODE_SERVER))
  273. batman_packet->gw_flags =
  274. (uint8_t)atomic_read(&bat_priv->gw_bandwidth);
  275. else
  276. batman_packet->gw_flags = NO_FLAGS;
  277. atomic_inc(&hard_iface->seqno);
  278. slide_own_bcast_window(hard_iface);
  279. send_time = own_send_time(bat_priv);
  280. add_bat_packet_to_list(bat_priv,
  281. hard_iface->packet_buff,
  282. hard_iface->packet_len,
  283. hard_iface, 1, send_time);
  284. if (primary_if)
  285. hardif_free_ref(primary_if);
  286. }
  287. void schedule_forward_packet(struct orig_node *orig_node,
  288. const struct ethhdr *ethhdr,
  289. struct batman_packet *batman_packet,
  290. int directlink,
  291. struct hard_iface *if_incoming)
  292. {
  293. struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
  294. struct neigh_node *router;
  295. uint8_t in_tq, in_ttl, tq_avg = 0;
  296. unsigned long send_time;
  297. uint8_t tt_num_changes;
  298. if (batman_packet->ttl <= 1) {
  299. bat_dbg(DBG_BATMAN, bat_priv, "ttl exceeded\n");
  300. return;
  301. }
  302. router = orig_node_get_router(orig_node);
  303. in_tq = batman_packet->tq;
  304. in_ttl = batman_packet->ttl;
  305. tt_num_changes = batman_packet->tt_num_changes;
  306. batman_packet->ttl--;
  307. memcpy(batman_packet->prev_sender, ethhdr->h_source, ETH_ALEN);
  308. /* rebroadcast tq of our best ranking neighbor to ensure the rebroadcast
  309. * of our best tq value */
  310. if (router && router->tq_avg != 0) {
  311. /* rebroadcast ogm of best ranking neighbor as is */
  312. if (!compare_eth(router->addr, ethhdr->h_source)) {
  313. batman_packet->tq = router->tq_avg;
  314. if (router->last_ttl)
  315. batman_packet->ttl = router->last_ttl - 1;
  316. }
  317. tq_avg = router->tq_avg;
  318. }
  319. if (router)
  320. neigh_node_free_ref(router);
  321. /* apply hop penalty */
  322. batman_packet->tq = hop_penalty(batman_packet->tq, bat_priv);
  323. bat_dbg(DBG_BATMAN, bat_priv,
  324. "Forwarding packet: tq_orig: %i, tq_avg: %i, "
  325. "tq_forw: %i, ttl_orig: %i, ttl_forw: %i\n",
  326. in_tq, tq_avg, batman_packet->tq, in_ttl - 1,
  327. batman_packet->ttl);
  328. batman_packet->seqno = htonl(batman_packet->seqno);
  329. batman_packet->tt_crc = htons(batman_packet->tt_crc);
  330. /* switch of primaries first hop flag when forwarding */
  331. batman_packet->flags &= ~PRIMARIES_FIRST_HOP;
  332. if (directlink)
  333. batman_packet->flags |= DIRECTLINK;
  334. else
  335. batman_packet->flags &= ~DIRECTLINK;
  336. send_time = forward_send_time();
  337. add_bat_packet_to_list(bat_priv,
  338. (unsigned char *)batman_packet,
  339. sizeof(*batman_packet) + tt_len(tt_num_changes),
  340. if_incoming, 0, send_time);
  341. }
  342. static void forw_packet_free(struct forw_packet *forw_packet)
  343. {
  344. if (forw_packet->skb)
  345. kfree_skb(forw_packet->skb);
  346. if (forw_packet->if_incoming)
  347. hardif_free_ref(forw_packet->if_incoming);
  348. kfree(forw_packet);
  349. }
  350. static void _add_bcast_packet_to_list(struct bat_priv *bat_priv,
  351. struct forw_packet *forw_packet,
  352. unsigned long send_time)
  353. {
  354. INIT_HLIST_NODE(&forw_packet->list);
  355. /* add new packet to packet list */
  356. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  357. hlist_add_head(&forw_packet->list, &bat_priv->forw_bcast_list);
  358. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  359. /* start timer for this packet */
  360. INIT_DELAYED_WORK(&forw_packet->delayed_work,
  361. send_outstanding_bcast_packet);
  362. queue_delayed_work(bat_event_workqueue, &forw_packet->delayed_work,
  363. send_time);
  364. }
  365. /* add a broadcast packet to the queue and setup timers. broadcast packets
  366. * are sent multiple times to increase probability for beeing received.
  367. *
  368. * This function returns NETDEV_TX_OK on success and NETDEV_TX_BUSY on
  369. * errors.
  370. *
  371. * The skb is not consumed, so the caller should make sure that the
  372. * skb is freed. */
  373. int add_bcast_packet_to_list(struct bat_priv *bat_priv,
  374. const struct sk_buff *skb)
  375. {
  376. struct hard_iface *primary_if = NULL;
  377. struct forw_packet *forw_packet;
  378. struct bcast_packet *bcast_packet;
  379. struct sk_buff *newskb;
  380. if (!atomic_dec_not_zero(&bat_priv->bcast_queue_left)) {
  381. bat_dbg(DBG_BATMAN, bat_priv, "bcast packet queue full\n");
  382. goto out;
  383. }
  384. primary_if = primary_if_get_selected(bat_priv);
  385. if (!primary_if)
  386. goto out_and_inc;
  387. forw_packet = kmalloc(sizeof(*forw_packet), GFP_ATOMIC);
  388. if (!forw_packet)
  389. goto out_and_inc;
  390. newskb = skb_copy(skb, GFP_ATOMIC);
  391. if (!newskb)
  392. goto packet_free;
  393. /* as we have a copy now, it is safe to decrease the TTL */
  394. bcast_packet = (struct bcast_packet *)newskb->data;
  395. bcast_packet->ttl--;
  396. skb_reset_mac_header(newskb);
  397. forw_packet->skb = newskb;
  398. forw_packet->if_incoming = primary_if;
  399. /* how often did we send the bcast packet ? */
  400. forw_packet->num_packets = 0;
  401. _add_bcast_packet_to_list(bat_priv, forw_packet, 1);
  402. return NETDEV_TX_OK;
  403. packet_free:
  404. kfree(forw_packet);
  405. out_and_inc:
  406. atomic_inc(&bat_priv->bcast_queue_left);
  407. out:
  408. if (primary_if)
  409. hardif_free_ref(primary_if);
  410. return NETDEV_TX_BUSY;
  411. }
  412. static void send_outstanding_bcast_packet(struct work_struct *work)
  413. {
  414. struct hard_iface *hard_iface;
  415. struct delayed_work *delayed_work =
  416. container_of(work, struct delayed_work, work);
  417. struct forw_packet *forw_packet =
  418. container_of(delayed_work, struct forw_packet, delayed_work);
  419. struct sk_buff *skb1;
  420. struct net_device *soft_iface = forw_packet->if_incoming->soft_iface;
  421. struct bat_priv *bat_priv = netdev_priv(soft_iface);
  422. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  423. hlist_del(&forw_packet->list);
  424. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  425. if (atomic_read(&bat_priv->mesh_state) == MESH_DEACTIVATING)
  426. goto out;
  427. /* rebroadcast packet */
  428. rcu_read_lock();
  429. list_for_each_entry_rcu(hard_iface, &hardif_list, list) {
  430. if (hard_iface->soft_iface != soft_iface)
  431. continue;
  432. /* send a copy of the saved skb */
  433. skb1 = skb_clone(forw_packet->skb, GFP_ATOMIC);
  434. if (skb1)
  435. send_skb_packet(skb1, hard_iface, broadcast_addr);
  436. }
  437. rcu_read_unlock();
  438. forw_packet->num_packets++;
  439. /* if we still have some more bcasts to send */
  440. if (forw_packet->num_packets < 3) {
  441. _add_bcast_packet_to_list(bat_priv, forw_packet,
  442. ((5 * HZ) / 1000));
  443. return;
  444. }
  445. out:
  446. forw_packet_free(forw_packet);
  447. atomic_inc(&bat_priv->bcast_queue_left);
  448. }
  449. void send_outstanding_bat_packet(struct work_struct *work)
  450. {
  451. struct delayed_work *delayed_work =
  452. container_of(work, struct delayed_work, work);
  453. struct forw_packet *forw_packet =
  454. container_of(delayed_work, struct forw_packet, delayed_work);
  455. struct bat_priv *bat_priv;
  456. bat_priv = netdev_priv(forw_packet->if_incoming->soft_iface);
  457. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  458. hlist_del(&forw_packet->list);
  459. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  460. if (atomic_read(&bat_priv->mesh_state) == MESH_DEACTIVATING)
  461. goto out;
  462. send_packet(forw_packet);
  463. /**
  464. * we have to have at least one packet in the queue
  465. * to determine the queues wake up time unless we are
  466. * shutting down
  467. */
  468. if (forw_packet->own)
  469. schedule_own_packet(forw_packet->if_incoming);
  470. out:
  471. /* don't count own packet */
  472. if (!forw_packet->own)
  473. atomic_inc(&bat_priv->batman_queue_left);
  474. forw_packet_free(forw_packet);
  475. }
  476. void purge_outstanding_packets(struct bat_priv *bat_priv,
  477. const struct hard_iface *hard_iface)
  478. {
  479. struct forw_packet *forw_packet;
  480. struct hlist_node *tmp_node, *safe_tmp_node;
  481. bool pending;
  482. if (hard_iface)
  483. bat_dbg(DBG_BATMAN, bat_priv,
  484. "purge_outstanding_packets(): %s\n",
  485. hard_iface->net_dev->name);
  486. else
  487. bat_dbg(DBG_BATMAN, bat_priv,
  488. "purge_outstanding_packets()\n");
  489. /* free bcast list */
  490. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  491. hlist_for_each_entry_safe(forw_packet, tmp_node, safe_tmp_node,
  492. &bat_priv->forw_bcast_list, list) {
  493. /**
  494. * if purge_outstanding_packets() was called with an argmument
  495. * we delete only packets belonging to the given interface
  496. */
  497. if ((hard_iface) &&
  498. (forw_packet->if_incoming != hard_iface))
  499. continue;
  500. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  501. /**
  502. * send_outstanding_bcast_packet() will lock the list to
  503. * delete the item from the list
  504. */
  505. pending = cancel_delayed_work_sync(&forw_packet->delayed_work);
  506. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  507. if (pending) {
  508. hlist_del(&forw_packet->list);
  509. forw_packet_free(forw_packet);
  510. }
  511. }
  512. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  513. /* free batman packet list */
  514. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  515. hlist_for_each_entry_safe(forw_packet, tmp_node, safe_tmp_node,
  516. &bat_priv->forw_bat_list, list) {
  517. /**
  518. * if purge_outstanding_packets() was called with an argmument
  519. * we delete only packets belonging to the given interface
  520. */
  521. if ((hard_iface) &&
  522. (forw_packet->if_incoming != hard_iface))
  523. continue;
  524. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  525. /**
  526. * send_outstanding_bat_packet() will lock the list to
  527. * delete the item from the list
  528. */
  529. pending = cancel_delayed_work_sync(&forw_packet->delayed_work);
  530. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  531. if (pending) {
  532. hlist_del(&forw_packet->list);
  533. forw_packet_free(forw_packet);
  534. }
  535. }
  536. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  537. }