send.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612
  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(struct 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->num_tt)) {
  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) 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. hard_iface->net_dev->name,
  123. hard_iface->net_dev->dev_addr);
  124. buff_pos += sizeof(struct batman_packet) +
  125. (batman_packet->num_tt * ETH_ALEN);
  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. unsigned char 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 rebuild_batman_packet(struct bat_priv *bat_priv,
  182. struct hard_iface *hard_iface)
  183. {
  184. int new_len;
  185. unsigned char *new_buff;
  186. struct batman_packet *batman_packet;
  187. new_len = sizeof(struct batman_packet) +
  188. (bat_priv->num_local_tt * ETH_ALEN);
  189. new_buff = kmalloc(new_len, GFP_ATOMIC);
  190. /* keep old buffer if kmalloc should fail */
  191. if (new_buff) {
  192. memcpy(new_buff, hard_iface->packet_buff,
  193. sizeof(struct batman_packet));
  194. batman_packet = (struct batman_packet *)new_buff;
  195. batman_packet->num_tt = tt_local_fill_buffer(bat_priv,
  196. new_buff + sizeof(struct batman_packet),
  197. new_len - sizeof(struct 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. void schedule_own_packet(struct hard_iface *hard_iface)
  204. {
  205. struct bat_priv *bat_priv = netdev_priv(hard_iface->soft_iface);
  206. struct hard_iface *primary_if;
  207. unsigned long send_time;
  208. struct batman_packet *batman_packet;
  209. int vis_server;
  210. if ((hard_iface->if_status == IF_NOT_IN_USE) ||
  211. (hard_iface->if_status == IF_TO_BE_REMOVED))
  212. return;
  213. vis_server = atomic_read(&bat_priv->vis_mode);
  214. primary_if = primary_if_get_selected(bat_priv);
  215. /**
  216. * the interface gets activated here to avoid race conditions between
  217. * the moment of activating the interface in
  218. * hardif_activate_interface() where the originator mac is set and
  219. * outdated packets (especially uninitialized mac addresses) in the
  220. * packet queue
  221. */
  222. if (hard_iface->if_status == IF_TO_BE_ACTIVATED)
  223. hard_iface->if_status = IF_ACTIVE;
  224. /* if local tt has changed and interface is a primary interface */
  225. if ((atomic_read(&bat_priv->tt_local_changed)) &&
  226. (hard_iface == primary_if))
  227. rebuild_batman_packet(bat_priv, hard_iface);
  228. /**
  229. * NOTE: packet_buff might just have been re-allocated in
  230. * rebuild_batman_packet()
  231. */
  232. batman_packet = (struct batman_packet *)hard_iface->packet_buff;
  233. /* change sequence number to network order */
  234. batman_packet->seqno =
  235. htonl((uint32_t)atomic_read(&hard_iface->seqno));
  236. if (vis_server == VIS_TYPE_SERVER_SYNC)
  237. batman_packet->flags |= VIS_SERVER;
  238. else
  239. batman_packet->flags &= ~VIS_SERVER;
  240. if ((hard_iface == primary_if) &&
  241. (atomic_read(&bat_priv->gw_mode) == GW_MODE_SERVER))
  242. batman_packet->gw_flags =
  243. (uint8_t)atomic_read(&bat_priv->gw_bandwidth);
  244. else
  245. batman_packet->gw_flags = 0;
  246. atomic_inc(&hard_iface->seqno);
  247. slide_own_bcast_window(hard_iface);
  248. send_time = own_send_time(bat_priv);
  249. add_bat_packet_to_list(bat_priv,
  250. hard_iface->packet_buff,
  251. hard_iface->packet_len,
  252. hard_iface, 1, send_time);
  253. if (primary_if)
  254. hardif_free_ref(primary_if);
  255. }
  256. void schedule_forward_packet(struct orig_node *orig_node,
  257. const struct ethhdr *ethhdr,
  258. struct batman_packet *batman_packet,
  259. uint8_t directlink, int tt_buff_len,
  260. struct hard_iface *if_incoming)
  261. {
  262. struct bat_priv *bat_priv = netdev_priv(if_incoming->soft_iface);
  263. struct neigh_node *router;
  264. unsigned char in_tq, in_ttl, tq_avg = 0;
  265. unsigned long send_time;
  266. if (batman_packet->ttl <= 1) {
  267. bat_dbg(DBG_BATMAN, bat_priv, "ttl exceeded\n");
  268. return;
  269. }
  270. router = orig_node_get_router(orig_node);
  271. in_tq = batman_packet->tq;
  272. in_ttl = batman_packet->ttl;
  273. batman_packet->ttl--;
  274. memcpy(batman_packet->prev_sender, ethhdr->h_source, ETH_ALEN);
  275. /* rebroadcast tq of our best ranking neighbor to ensure the rebroadcast
  276. * of our best tq value */
  277. if (router && router->tq_avg != 0) {
  278. /* rebroadcast ogm of best ranking neighbor as is */
  279. if (!compare_eth(router->addr, ethhdr->h_source)) {
  280. batman_packet->tq = router->tq_avg;
  281. if (router->last_ttl)
  282. batman_packet->ttl = router->last_ttl - 1;
  283. }
  284. tq_avg = router->tq_avg;
  285. }
  286. if (router)
  287. neigh_node_free_ref(router);
  288. /* apply hop penalty */
  289. batman_packet->tq = hop_penalty(batman_packet->tq, bat_priv);
  290. bat_dbg(DBG_BATMAN, bat_priv,
  291. "Forwarding packet: tq_orig: %i, tq_avg: %i, "
  292. "tq_forw: %i, ttl_orig: %i, ttl_forw: %i\n",
  293. in_tq, tq_avg, batman_packet->tq, in_ttl - 1,
  294. batman_packet->ttl);
  295. batman_packet->seqno = htonl(batman_packet->seqno);
  296. /* switch of primaries first hop flag when forwarding */
  297. batman_packet->flags &= ~PRIMARIES_FIRST_HOP;
  298. if (directlink)
  299. batman_packet->flags |= DIRECTLINK;
  300. else
  301. batman_packet->flags &= ~DIRECTLINK;
  302. send_time = forward_send_time();
  303. add_bat_packet_to_list(bat_priv,
  304. (unsigned char *)batman_packet,
  305. sizeof(struct batman_packet) + tt_buff_len,
  306. if_incoming, 0, send_time);
  307. }
  308. static void forw_packet_free(struct forw_packet *forw_packet)
  309. {
  310. if (forw_packet->skb)
  311. kfree_skb(forw_packet->skb);
  312. if (forw_packet->if_incoming)
  313. hardif_free_ref(forw_packet->if_incoming);
  314. kfree(forw_packet);
  315. }
  316. static void _add_bcast_packet_to_list(struct bat_priv *bat_priv,
  317. struct forw_packet *forw_packet,
  318. unsigned long send_time)
  319. {
  320. INIT_HLIST_NODE(&forw_packet->list);
  321. /* add new packet to packet list */
  322. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  323. hlist_add_head(&forw_packet->list, &bat_priv->forw_bcast_list);
  324. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  325. /* start timer for this packet */
  326. INIT_DELAYED_WORK(&forw_packet->delayed_work,
  327. send_outstanding_bcast_packet);
  328. queue_delayed_work(bat_event_workqueue, &forw_packet->delayed_work,
  329. send_time);
  330. }
  331. /* add a broadcast packet to the queue and setup timers. broadcast packets
  332. * are sent multiple times to increase probability for beeing received.
  333. *
  334. * This function returns NETDEV_TX_OK on success and NETDEV_TX_BUSY on
  335. * errors.
  336. *
  337. * The skb is not consumed, so the caller should make sure that the
  338. * skb is freed. */
  339. int add_bcast_packet_to_list(struct bat_priv *bat_priv,
  340. const struct sk_buff *skb)
  341. {
  342. struct hard_iface *primary_if = NULL;
  343. struct forw_packet *forw_packet;
  344. struct bcast_packet *bcast_packet;
  345. struct sk_buff *newskb;
  346. if (!atomic_dec_not_zero(&bat_priv->bcast_queue_left)) {
  347. bat_dbg(DBG_BATMAN, bat_priv, "bcast packet queue full\n");
  348. goto out;
  349. }
  350. primary_if = primary_if_get_selected(bat_priv);
  351. if (!primary_if)
  352. goto out_and_inc;
  353. forw_packet = kmalloc(sizeof(struct forw_packet), GFP_ATOMIC);
  354. if (!forw_packet)
  355. goto out_and_inc;
  356. newskb = skb_copy(skb, GFP_ATOMIC);
  357. if (!newskb)
  358. goto packet_free;
  359. /* as we have a copy now, it is safe to decrease the TTL */
  360. bcast_packet = (struct bcast_packet *)newskb->data;
  361. bcast_packet->ttl--;
  362. skb_reset_mac_header(newskb);
  363. forw_packet->skb = newskb;
  364. forw_packet->if_incoming = primary_if;
  365. /* how often did we send the bcast packet ? */
  366. forw_packet->num_packets = 0;
  367. _add_bcast_packet_to_list(bat_priv, forw_packet, 1);
  368. return NETDEV_TX_OK;
  369. packet_free:
  370. kfree(forw_packet);
  371. out_and_inc:
  372. atomic_inc(&bat_priv->bcast_queue_left);
  373. out:
  374. if (primary_if)
  375. hardif_free_ref(primary_if);
  376. return NETDEV_TX_BUSY;
  377. }
  378. static void send_outstanding_bcast_packet(struct work_struct *work)
  379. {
  380. struct hard_iface *hard_iface;
  381. struct delayed_work *delayed_work =
  382. container_of(work, struct delayed_work, work);
  383. struct forw_packet *forw_packet =
  384. container_of(delayed_work, struct forw_packet, delayed_work);
  385. struct sk_buff *skb1;
  386. struct net_device *soft_iface = forw_packet->if_incoming->soft_iface;
  387. struct bat_priv *bat_priv = netdev_priv(soft_iface);
  388. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  389. hlist_del(&forw_packet->list);
  390. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  391. if (atomic_read(&bat_priv->mesh_state) == MESH_DEACTIVATING)
  392. goto out;
  393. /* rebroadcast packet */
  394. rcu_read_lock();
  395. list_for_each_entry_rcu(hard_iface, &hardif_list, list) {
  396. if (hard_iface->soft_iface != soft_iface)
  397. continue;
  398. /* send a copy of the saved skb */
  399. skb1 = skb_clone(forw_packet->skb, GFP_ATOMIC);
  400. if (skb1)
  401. send_skb_packet(skb1, hard_iface, broadcast_addr);
  402. }
  403. rcu_read_unlock();
  404. forw_packet->num_packets++;
  405. /* if we still have some more bcasts to send */
  406. if (forw_packet->num_packets < 3) {
  407. _add_bcast_packet_to_list(bat_priv, forw_packet,
  408. ((5 * HZ) / 1000));
  409. return;
  410. }
  411. out:
  412. forw_packet_free(forw_packet);
  413. atomic_inc(&bat_priv->bcast_queue_left);
  414. }
  415. void send_outstanding_bat_packet(struct work_struct *work)
  416. {
  417. struct delayed_work *delayed_work =
  418. container_of(work, struct delayed_work, work);
  419. struct forw_packet *forw_packet =
  420. container_of(delayed_work, struct forw_packet, delayed_work);
  421. struct bat_priv *bat_priv;
  422. bat_priv = netdev_priv(forw_packet->if_incoming->soft_iface);
  423. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  424. hlist_del(&forw_packet->list);
  425. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  426. if (atomic_read(&bat_priv->mesh_state) == MESH_DEACTIVATING)
  427. goto out;
  428. send_packet(forw_packet);
  429. /**
  430. * we have to have at least one packet in the queue
  431. * to determine the queues wake up time unless we are
  432. * shutting down
  433. */
  434. if (forw_packet->own)
  435. schedule_own_packet(forw_packet->if_incoming);
  436. out:
  437. /* don't count own packet */
  438. if (!forw_packet->own)
  439. atomic_inc(&bat_priv->batman_queue_left);
  440. forw_packet_free(forw_packet);
  441. }
  442. void purge_outstanding_packets(struct bat_priv *bat_priv,
  443. const struct hard_iface *hard_iface)
  444. {
  445. struct forw_packet *forw_packet;
  446. struct hlist_node *tmp_node, *safe_tmp_node;
  447. bool pending;
  448. if (hard_iface)
  449. bat_dbg(DBG_BATMAN, bat_priv,
  450. "purge_outstanding_packets(): %s\n",
  451. hard_iface->net_dev->name);
  452. else
  453. bat_dbg(DBG_BATMAN, bat_priv,
  454. "purge_outstanding_packets()\n");
  455. /* free bcast list */
  456. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  457. hlist_for_each_entry_safe(forw_packet, tmp_node, safe_tmp_node,
  458. &bat_priv->forw_bcast_list, list) {
  459. /**
  460. * if purge_outstanding_packets() was called with an argmument
  461. * we delete only packets belonging to the given interface
  462. */
  463. if ((hard_iface) &&
  464. (forw_packet->if_incoming != hard_iface))
  465. continue;
  466. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  467. /**
  468. * send_outstanding_bcast_packet() will lock the list to
  469. * delete the item from the list
  470. */
  471. pending = cancel_delayed_work_sync(&forw_packet->delayed_work);
  472. spin_lock_bh(&bat_priv->forw_bcast_list_lock);
  473. if (pending) {
  474. hlist_del(&forw_packet->list);
  475. forw_packet_free(forw_packet);
  476. }
  477. }
  478. spin_unlock_bh(&bat_priv->forw_bcast_list_lock);
  479. /* free batman packet list */
  480. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  481. hlist_for_each_entry_safe(forw_packet, tmp_node, safe_tmp_node,
  482. &bat_priv->forw_bat_list, list) {
  483. /**
  484. * if purge_outstanding_packets() was called with an argmument
  485. * we delete only packets belonging to the given interface
  486. */
  487. if ((hard_iface) &&
  488. (forw_packet->if_incoming != hard_iface))
  489. continue;
  490. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  491. /**
  492. * send_outstanding_bat_packet() will lock the list to
  493. * delete the item from the list
  494. */
  495. pending = cancel_delayed_work_sync(&forw_packet->delayed_work);
  496. spin_lock_bh(&bat_priv->forw_bat_list_lock);
  497. if (pending) {
  498. hlist_del(&forw_packet->list);
  499. forw_packet_free(forw_packet);
  500. }
  501. }
  502. spin_unlock_bh(&bat_priv->forw_bat_list_lock);
  503. }