Lines Matching defs:neigh_ifinfo
220 * batadv_neigh_ifinfo_release() - release neigh_ifinfo from lists and queue for
222 * @ref: kref pointer of the neigh_ifinfo
226 struct batadv_neigh_ifinfo *neigh_ifinfo;
228 neigh_ifinfo = container_of(ref, struct batadv_neigh_ifinfo, refcount);
230 if (neigh_ifinfo->if_outgoing != BATADV_IF_DEFAULT)
231 batadv_hardif_put(neigh_ifinfo->if_outgoing);
233 kfree_rcu(neigh_ifinfo, rcu);
265 struct batadv_neigh_ifinfo *neigh_ifinfo;
269 hlist_for_each_entry_safe(neigh_ifinfo, node_tmp,
271 batadv_neigh_ifinfo_put(neigh_ifinfo);
399 * Return: the requested neigh_ifinfo or NULL if not found
405 struct batadv_neigh_ifinfo *neigh_ifinfo = NULL,
417 neigh_ifinfo = tmp_neigh_ifinfo;
422 return neigh_ifinfo;
426 * batadv_neigh_ifinfo_new() - search and possibly create an neigh_ifinfo object
430 * Return: NULL in case of failure or the neigh_ifinfo object for the
440 struct batadv_neigh_ifinfo *neigh_ifinfo;
444 neigh_ifinfo = batadv_neigh_ifinfo_get(neigh, if_outgoing);
445 if (neigh_ifinfo)
448 neigh_ifinfo = kzalloc(sizeof(*neigh_ifinfo), GFP_ATOMIC);
449 if (!neigh_ifinfo)
455 INIT_HLIST_NODE(&neigh_ifinfo->list);
456 kref_init(&neigh_ifinfo->refcount);
457 neigh_ifinfo->if_outgoing = if_outgoing;
459 kref_get(&neigh_ifinfo->refcount);
460 hlist_add_head_rcu(&neigh_ifinfo->list, &neigh->ifinfo_list);
465 return neigh_ifinfo;
982 struct batadv_neigh_ifinfo *neigh_ifinfo;
989 hlist_for_each_entry_safe(neigh_ifinfo, node_tmp,
991 if_outgoing = neigh_ifinfo->if_outgoing;
1007 hlist_del_rcu(&neigh_ifinfo->list);
1008 batadv_neigh_ifinfo_put(neigh_ifinfo);