diff options
| author | Randy Dunlap <rdunlap@infradead.org> | 2020-07-17 16:37:25 -0700 |
|---|---|---|
| committer | David S. Miller <davem@davemloft.net> | 2020-07-17 18:34:18 -0700 |
| commit | 7f5f81406e2b36785f1e25fe5209edd9dd3610d7 (patch) | |
| tree | ce0a93d056b4c9035e0930b8d4fac06f2ada140f | |
| parent | 2ccb0161a0e9eb06f538557d38987e436fc39b8d (diff) | |
rhashtable: drop duplicated word in <linux/rhashtable.h>
Drop the doubled word "be" in a comment.
Signed-off-by: Randy Dunlap <rdunlap@infradead.org>
Cc: Thomas Graf <tgraf@suug.ch>
Cc: Herbert Xu <herbert@gondor.apana.org.au>
Cc: netdev@vger.kernel.org
Signed-off-by: David S. Miller <davem@davemloft.net>
| -rw-r--r-- | include/linux/rhashtable.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/include/linux/rhashtable.h b/include/linux/rhashtable.h index 70ebef866cc8..d3432ee65de7 100644 --- a/include/linux/rhashtable.h +++ b/include/linux/rhashtable.h @@ -33,7 +33,7 @@ * of two or more hash tables when the rhashtable is being resized. * The end of the chain is marked with a special nulls marks which has * the least significant bit set but otherwise stores the address of - * the hash bucket. This allows us to be be sure we've found the end + * the hash bucket. This allows us to be sure we've found the end * of the right list. * The value stored in the hash bucket has BIT(0) used as a lock bit. * This bit must be atomically set before any changes are made to |