| .. | .. |
|---|
| 1 | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
|---|
| 2 | | -/* Copyright (C) 2006-2018 B.A.T.M.A.N. contributors: |
|---|
| 2 | +/* Copyright (C) 2006-2020 B.A.T.M.A.N. contributors: |
|---|
| 3 | 3 | * |
|---|
| 4 | 4 | * Simon Wunderlich, Marek Lindner |
|---|
| 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, see <http://www.gnu.org/licenses/>. |
|---|
| 17 | 5 | */ |
|---|
| 18 | 6 | |
|---|
| 19 | 7 | #ifndef _NET_BATMAN_ADV_HASH_H_ |
|---|
| .. | .. |
|---|
| 21 | 9 | |
|---|
| 22 | 10 | #include "main.h" |
|---|
| 23 | 11 | |
|---|
| 12 | +#include <linux/atomic.h> |
|---|
| 24 | 13 | #include <linux/compiler.h> |
|---|
| 25 | 14 | #include <linux/list.h> |
|---|
| 15 | +#include <linux/lockdep.h> |
|---|
| 26 | 16 | #include <linux/rculist.h> |
|---|
| 27 | 17 | #include <linux/spinlock.h> |
|---|
| 28 | 18 | #include <linux/stddef.h> |
|---|
| 29 | 19 | #include <linux/types.h> |
|---|
| 30 | | - |
|---|
| 31 | | -struct lock_class_key; |
|---|
| 32 | 20 | |
|---|
| 33 | 21 | /* callback to a compare function. should compare 2 element datas for their |
|---|
| 34 | 22 | * keys |
|---|
| .. | .. |
|---|
| 58 | 46 | |
|---|
| 59 | 47 | /** @size: size of hashtable */ |
|---|
| 60 | 48 | u32 size; |
|---|
| 49 | + |
|---|
| 50 | + /** @generation: current (generation) sequence number */ |
|---|
| 51 | + atomic_t generation; |
|---|
| 61 | 52 | }; |
|---|
| 62 | 53 | |
|---|
| 63 | 54 | /* allocates and clears the hash */ |
|---|
| .. | .. |
|---|
| 112 | 103 | |
|---|
| 113 | 104 | /* no duplicate found in list, add new element */ |
|---|
| 114 | 105 | hlist_add_head_rcu(data_node, head); |
|---|
| 106 | + atomic_inc(&hash->generation); |
|---|
| 115 | 107 | |
|---|
| 116 | 108 | ret = 0; |
|---|
| 117 | 109 | |
|---|
| .. | .. |
|---|
| 154 | 146 | |
|---|
| 155 | 147 | data_save = node; |
|---|
| 156 | 148 | hlist_del_rcu(node); |
|---|
| 149 | + atomic_inc(&hash->generation); |
|---|
| 157 | 150 | break; |
|---|
| 158 | 151 | } |
|---|
| 159 | 152 | spin_unlock_bh(&hash->list_locks[index]); |
|---|