Kyle Swenson | 8d8f654 | 2021-03-15 11:02:55 -0600 | [diff] [blame^] | 1 | /* Copyright (C) 2007-2015 B.A.T.M.A.N. contributors: |
| 2 | * |
| 3 | * Marek Lindner, Simon Wunderlich |
| 4 | * |
| 5 | * This program is free software; you can redistribute it and/or |
| 6 | * modify it under the terms of version 2 of the GNU General Public |
| 7 | * License as published by the Free Software Foundation. |
| 8 | * |
| 9 | * This program is distributed in the hope that it will be useful, but |
| 10 | * WITHOUT ANY WARRANTY; without even the implied warranty of |
| 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 12 | * General Public License for more details. |
| 13 | * |
| 14 | * You should have received a copy of the GNU General Public License |
| 15 | * along with this program; if not, see <http://www.gnu.org/licenses/>. |
| 16 | */ |
| 17 | |
| 18 | #ifndef _NET_BATMAN_ADV_ORIGINATOR_H_ |
| 19 | #define _NET_BATMAN_ADV_ORIGINATOR_H_ |
| 20 | |
| 21 | #include "main.h" |
| 22 | |
| 23 | #include <linux/atomic.h> |
| 24 | #include <linux/compiler.h> |
| 25 | #include <linux/if_ether.h> |
| 26 | #include <linux/jhash.h> |
| 27 | #include <linux/rculist.h> |
| 28 | #include <linux/rcupdate.h> |
| 29 | #include <linux/stddef.h> |
| 30 | #include <linux/types.h> |
| 31 | |
| 32 | #include "hash.h" |
| 33 | |
| 34 | struct seq_file; |
| 35 | |
| 36 | int batadv_compare_orig(const struct hlist_node *node, const void *data2); |
| 37 | int batadv_originator_init(struct batadv_priv *bat_priv); |
| 38 | void batadv_originator_free(struct batadv_priv *bat_priv); |
| 39 | void batadv_purge_orig_ref(struct batadv_priv *bat_priv); |
| 40 | void batadv_orig_node_free_ref(struct batadv_orig_node *orig_node); |
| 41 | struct batadv_orig_node *batadv_orig_node_new(struct batadv_priv *bat_priv, |
| 42 | const u8 *addr); |
| 43 | struct batadv_neigh_node * |
| 44 | batadv_neigh_node_new(struct batadv_orig_node *orig_node, |
| 45 | struct batadv_hard_iface *hard_iface, |
| 46 | const u8 *neigh_addr); |
| 47 | void batadv_neigh_node_free_ref(struct batadv_neigh_node *neigh_node); |
| 48 | struct batadv_neigh_node * |
| 49 | batadv_orig_router_get(struct batadv_orig_node *orig_node, |
| 50 | const struct batadv_hard_iface *if_outgoing); |
| 51 | struct batadv_neigh_ifinfo * |
| 52 | batadv_neigh_ifinfo_new(struct batadv_neigh_node *neigh, |
| 53 | struct batadv_hard_iface *if_outgoing); |
| 54 | struct batadv_neigh_ifinfo * |
| 55 | batadv_neigh_ifinfo_get(struct batadv_neigh_node *neigh, |
| 56 | struct batadv_hard_iface *if_outgoing); |
| 57 | void batadv_neigh_ifinfo_free_ref(struct batadv_neigh_ifinfo *neigh_ifinfo); |
| 58 | |
| 59 | struct batadv_orig_ifinfo * |
| 60 | batadv_orig_ifinfo_get(struct batadv_orig_node *orig_node, |
| 61 | struct batadv_hard_iface *if_outgoing); |
| 62 | struct batadv_orig_ifinfo * |
| 63 | batadv_orig_ifinfo_new(struct batadv_orig_node *orig_node, |
| 64 | struct batadv_hard_iface *if_outgoing); |
| 65 | void batadv_orig_ifinfo_free_ref(struct batadv_orig_ifinfo *orig_ifinfo); |
| 66 | |
| 67 | int batadv_orig_seq_print_text(struct seq_file *seq, void *offset); |
| 68 | int batadv_orig_hardif_seq_print_text(struct seq_file *seq, void *offset); |
| 69 | int batadv_orig_hash_add_if(struct batadv_hard_iface *hard_iface, |
| 70 | int max_if_num); |
| 71 | int batadv_orig_hash_del_if(struct batadv_hard_iface *hard_iface, |
| 72 | int max_if_num); |
| 73 | struct batadv_orig_node_vlan * |
| 74 | batadv_orig_node_vlan_new(struct batadv_orig_node *orig_node, |
| 75 | unsigned short vid); |
| 76 | struct batadv_orig_node_vlan * |
| 77 | batadv_orig_node_vlan_get(struct batadv_orig_node *orig_node, |
| 78 | unsigned short vid); |
| 79 | void batadv_orig_node_vlan_free_ref(struct batadv_orig_node_vlan *orig_vlan); |
| 80 | |
| 81 | /* hashfunction to choose an entry in a hash table of given size |
| 82 | * hash algorithm from http://en.wikipedia.org/wiki/Hash_table |
| 83 | */ |
| 84 | static inline u32 batadv_choose_orig(const void *data, u32 size) |
| 85 | { |
| 86 | u32 hash = 0; |
| 87 | |
| 88 | hash = jhash(data, ETH_ALEN, hash); |
| 89 | return hash % size; |
| 90 | } |
| 91 | |
| 92 | static inline struct batadv_orig_node * |
| 93 | batadv_orig_hash_find(struct batadv_priv *bat_priv, const void *data) |
| 94 | { |
| 95 | struct batadv_hashtable *hash = bat_priv->orig_hash; |
| 96 | struct hlist_head *head; |
| 97 | struct batadv_orig_node *orig_node, *orig_node_tmp = NULL; |
| 98 | int index; |
| 99 | |
| 100 | if (!hash) |
| 101 | return NULL; |
| 102 | |
| 103 | index = batadv_choose_orig(data, hash->size); |
| 104 | head = &hash->table[index]; |
| 105 | |
| 106 | rcu_read_lock(); |
| 107 | hlist_for_each_entry_rcu(orig_node, head, hash_entry) { |
| 108 | if (!batadv_compare_eth(orig_node, data)) |
| 109 | continue; |
| 110 | |
| 111 | if (!atomic_inc_not_zero(&orig_node->refcount)) |
| 112 | continue; |
| 113 | |
| 114 | orig_node_tmp = orig_node; |
| 115 | break; |
| 116 | } |
| 117 | rcu_read_unlock(); |
| 118 | |
| 119 | return orig_node_tmp; |
| 120 | } |
| 121 | |
| 122 | #endif /* _NET_BATMAN_ADV_ORIGINATOR_H_ */ |