aboutsummaryrefslogtreecommitdiffstatshomepage
path: root/src
diff options
context:
space:
mode:
authorJason A. Donenfeld <Jason@zx2c4.com>2018-02-21 17:43:39 +0100
committerJason A. Donenfeld <Jason@zx2c4.com>2018-02-21 17:43:39 +0100
commit06099b8e1a40ea1a6e10f17f675531a60ef30ee0 (patch)
treea91a2bff201511aab69ff568fc494da86264dc34 /src
parentcontrib: embedded-wg-library: add ability to add and del interfaces (diff)
downloadwireguard-monolithic-historical-06099b8e1a40ea1a6e10f17f675531a60ef30ee0.tar.xz
wireguard-monolithic-historical-06099b8e1a40ea1a6e10f17f675531a60ef30ee0.zip
allowedips: fix comment style
Diffstat (limited to 'src')
-rw-r--r--src/allowedips.c3
1 files changed, 2 insertions, 1 deletions
diff --git a/src/allowedips.c b/src/allowedips.c
index 282b819..b9cd0aa 100644
--- a/src/allowedips.c
+++ b/src/allowedips.c
@@ -139,7 +139,8 @@ static __always_inline u8 common_bits(const struct allowedips_node *node, const
/* This could be much faster if it actually just compared the common bits properly,
* by precomputing a mask bswap(~0 << (32 - cidr)), and the rest, but it turns out that
* common_bits is already super fast on modern processors, even taking into account
- * the unfortunate bswap. So, we just inline it like this instead. */
+ * the unfortunate bswap. So, we just inline it like this instead.
+ */
#define prefix_matches(node, key, bits) (common_bits(node, key, bits) >= node->cidr)
static __always_inline struct allowedips_node *find_node(struct allowedips_node *trie, u8 bits, const u8 *key)