diff options
| author | Jason A. Donenfeld <Jason@zx2c4.com> | 2018-02-21 17:43:39 +0100 |
|---|---|---|
| committer | Jason A. Donenfeld <Jason@zx2c4.com> | 2018-02-21 17:43:39 +0100 |
| commit | c263d644f9810e3c5e4c4caf35de2a39babb4c91 (patch) | |
| tree | 8e628e286d3ea13f10ea583d7c9a7eeaa4124e3d | |
| parent | 8f6e4572112e17e0484e0be581d03e39b1c2e305 (diff) | |
allowedips: fix comment style
Signed-off-by: Jason A. Donenfeld <Jason@zx2c4.com>
| -rw-r--r-- | src/allowedips.c | 3 |
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) |