Searched defs:neigh_node (Results 1 - 10 of 10) sorted by relevance

/net/batman-adv/
H A Dnetwork-coding.h39 struct batadv_neigh_node *neigh_node);
93 struct batadv_neigh_node *neigh_node)
92 batadv_nc_skb_forward(struct sk_buff *skb, struct batadv_neigh_node *neigh_node) argument
H A Dicmp_socket.c159 struct batadv_neigh_node *neigh_node = NULL; local
219 neigh_node = batadv_orig_router_get(orig_node,
221 if (!neigh_node)
224 if (!neigh_node->if_incoming)
227 if (neigh_node->if_incoming->if_status != BATADV_IF_ACTIVE)
232 addr = neigh_node->if_incoming->net_dev->dev_addr;
256 batadv_send_skb_packet(skb, neigh_node->if_incoming, neigh_node->addr);
267 if (neigh_node)
268 batadv_neigh_node_free_ref(neigh_node);
[all...]
H A Dfragmentation.c337 struct batadv_neigh_node *neigh_node = NULL; local
347 neigh_node = batadv_find_router(bat_priv, orig_node_dst, recv_if);
348 if (!neigh_node)
355 if (total_size > neigh_node->if_incoming->net_dev->mtu) {
361 batadv_send_skb_packet(skb, neigh_node->if_incoming,
362 neigh_node->addr);
369 if (neigh_node)
370 batadv_neigh_node_free_ref(neigh_node);
416 * @neigh_node: next-hop of the created fragments
422 struct batadv_neigh_node *neigh_node)
420 batadv_frag_send_packet(struct sk_buff *skb, struct batadv_orig_node *orig_node, struct batadv_neigh_node *neigh_node) argument
[all...]
H A Dsend.c104 struct batadv_neigh_node *neigh_node; local
108 neigh_node = batadv_find_router(bat_priv, orig_node, recv_if);
109 if (!neigh_node)
116 skb->len > neigh_node->if_incoming->net_dev->mtu) {
118 if (batadv_frag_send_packet(skb, orig_node, neigh_node))
128 if (recv_if && batadv_nc_skb_forward(skb, neigh_node)) {
131 batadv_send_skb_packet(skb, neigh_node->if_incoming,
132 neigh_node->addr);
137 if (neigh_node)
138 batadv_neigh_node_free_ref(neigh_node);
[all...]
H A Drouting.c41 * @neigh_node: neighbor which should be the next router
48 struct batadv_neigh_node *neigh_node)
64 if ((curr_router) && (!neigh_node)) {
71 } else if ((!curr_router) && (neigh_node)) {
74 orig_node->orig, neigh_node->addr);
76 } else if (neigh_node && curr_router) {
79 orig_node->orig, neigh_node->addr,
87 if (neigh_node && !atomic_inc_not_zero(&neigh_node->refcount))
88 neigh_node
45 _batadv_update_route(struct batadv_priv *bat_priv, struct batadv_orig_node *orig_node, struct batadv_hard_iface *recv_if, struct batadv_neigh_node *neigh_node) argument
107 batadv_update_route(struct batadv_priv *bat_priv, struct batadv_orig_node *orig_node, struct batadv_hard_iface *recv_if, struct batadv_neigh_node *neigh_node) argument
[all...]
H A Ddistributed-arp-table.c579 struct batadv_neigh_node *neigh_node = NULL; local
593 neigh_node = batadv_orig_router_get(cand[i].orig_node,
595 if (!neigh_node)
607 neigh_node->if_incoming,
608 neigh_node->addr);
626 batadv_neigh_node_free_ref(neigh_node);
H A Doriginator.c192 * batadv_neigh_node_free_rcu - free the neigh_node
193 * @rcu: rcu pointer of the neigh_node
198 struct batadv_neigh_node *neigh_node; local
201 neigh_node = container_of(rcu, struct batadv_neigh_node, rcu);
204 &neigh_node->ifinfo_list, list) {
207 batadv_hardif_free_ref_now(neigh_node->if_incoming);
209 kfree(neigh_node);
215 * @neigh_node: neigh neighbor to free
218 batadv_neigh_node_free_ref_now(struct batadv_neigh_node *neigh_node) argument
220 if (atomic_dec_and_test(&neigh_node
229 batadv_neigh_node_free_ref(struct batadv_neigh_node *neigh_node) argument
440 struct batadv_neigh_node *neigh_node; local
544 struct batadv_neigh_node *neigh_node; local
815 struct batadv_neigh_node *neigh_node; local
[all...]
H A Dbat_iv_ogm.c270 struct batadv_neigh_node *neigh_node, *tmp_neigh_node; local
272 neigh_node = batadv_neigh_node_new(hard_iface, neigh_addr, orig_node);
273 if (!neigh_node)
277 kfree(neigh_node);
278 neigh_node = NULL;
282 neigh_node->orig_node = orig_neigh;
283 neigh_node->if_incoming = hard_iface;
289 hlist_add_head_rcu(&neigh_node->list, &orig_node->neigh_list);
291 kfree(neigh_node);
293 neigh_node
980 struct batadv_neigh_node *neigh_node = NULL, *tmp_neigh_node = NULL; local
1135 struct batadv_neigh_node *neigh_node = NULL, *tmp_neigh_node; local
1281 struct batadv_neigh_node *neigh_node; local
1775 struct batadv_neigh_node *neigh_node; local
1801 struct batadv_neigh_node *neigh_node; local
[all...]
H A Dnetwork-coding.c540 nc_packet->neigh_node->if_incoming,
1007 * @neigh_node: next hop to forward packet to
1015 struct batadv_neigh_node *neigh_node)
1038 router_neigh = batadv_orig_router_get(neigh_node->orig_node,
1048 neigh_tmp = nc_packet->neigh_node;
1071 second_dest = neigh_node->addr;
1080 first_dest = neigh_node->addr;
1179 batadv_send_skb_packet(skb_dest, neigh_node->if_incoming, first_dest);
1371 * @neigh_node: next hop to forward packet to
1382 struct batadv_neigh_node *neigh_node,
1011 batadv_nc_code_packets(struct batadv_priv *bat_priv, struct sk_buff *skb, struct ethhdr *ethhdr, struct batadv_nc_packet *nc_packet, struct batadv_neigh_node *neigh_node) argument
1381 batadv_nc_skb_dst_search(struct sk_buff *skb, struct batadv_neigh_node *neigh_node, struct ethhdr *ethhdr) argument
1435 batadv_nc_skb_add_to_path(struct sk_buff *skb, struct batadv_nc_path *nc_path, struct batadv_neigh_node *neigh_node, __be32 packet_id) argument
1469 batadv_nc_skb_forward(struct sk_buff *skb, struct batadv_neigh_node *neigh_node) argument
[all...]
H A Dtypes.h188 * neigh_node->bat_iv.real_bits & neigh_node->bat_iv.real_packet_count
194 * neigh_node->bat_iv.real_bits & neigh_node->bat_iv.real_packet_count
1055 * @neigh_node: pointer to original next hop neighbor of skb
1063 struct batadv_neigh_node *neigh_node; member in struct:batadv_nc_packet

Completed in 232 milliseconds