aboutsummaryrefslogtreecommitdiffstats
path: root/target/linux/generic/pending-3.18/080-19-fib_trie-Use-index-0ul-n-bits-instead-of-index-n-bit.patch
diff options
context:
space:
mode:
authorKoen Vandeputte <koen.vandeputte@ncentric.com>2018-08-08 09:54:51 +0200
committerKoen Vandeputte <koen.vandeputte@ncentric.com>2018-08-08 09:54:51 +0200
commite3ab280e47000aee3dc0ea916bcb656490e9839d (patch)
tree4e61f399b6624044b76e9437660eea975345080f /target/linux/generic/pending-3.18/080-19-fib_trie-Use-index-0ul-n-bits-instead-of-index-n-bit.patch
parent5742a2ba35e20b7fe7ca9aac3ceb42e0a4f37ca0 (diff)
downloadupstream-e3ab280e47000aee3dc0ea916bcb656490e9839d.tar.gz
upstream-e3ab280e47000aee3dc0ea916bcb656490e9839d.tar.bz2
upstream-e3ab280e47000aee3dc0ea916bcb656490e9839d.zip
kernel: remove linux 3.18 support
No targets are using it anymore Signed-off-by: Koen Vandeputte <koen.vandeputte@ncentric.com>
Diffstat (limited to 'target/linux/generic/pending-3.18/080-19-fib_trie-Use-index-0ul-n-bits-instead-of-index-n-bit.patch')
-rw-r--r--target/linux/generic/pending-3.18/080-19-fib_trie-Use-index-0ul-n-bits-instead-of-index-n-bit.patch52
1 files changed, 0 insertions, 52 deletions
diff --git a/target/linux/generic/pending-3.18/080-19-fib_trie-Use-index-0ul-n-bits-instead-of-index-n-bit.patch b/target/linux/generic/pending-3.18/080-19-fib_trie-Use-index-0ul-n-bits-instead-of-index-n-bit.patch
deleted file mode 100644
index d5fc112563..0000000000
--- a/target/linux/generic/pending-3.18/080-19-fib_trie-Use-index-0ul-n-bits-instead-of-index-n-bit.patch
+++ /dev/null
@@ -1,52 +0,0 @@
-From: Alexander Duyck <alexander.h.duyck@redhat.com>
-Date: Thu, 22 Jan 2015 15:51:08 -0800
-Subject: [PATCH] fib_trie: Use index & (~0ul << n->bits) instead of index >>
- n->bits
-
-In doing performance testing and analysis of the changes I recently found
-that by shifting the index I had created an unnecessary dependency.
-
-I have updated the code so that we instead shift a mask by bits and then
-just test against that as that should save us about 2 CPU cycles since we
-can generate the mask while the key and pos are being processed.
-
-Signed-off-by: Alexander Duyck <alexander.h.duyck@redhat.com>
-Signed-off-by: David S. Miller <davem@davemloft.net>
----
-
---- a/net/ipv4/fib_trie.c
-+++ b/net/ipv4/fib_trie.c
-@@ -961,12 +961,12 @@ static struct tnode *fib_find_node(struc
- * prefix plus zeros for the bits in the cindex. The index
- * is the difference between the key and this value. From
- * this we can actually derive several pieces of data.
-- * if !(index >> bits)
-- * we know the value is cindex
-- * else
-+ * if (index & (~0ul << bits))
- * we have a mismatch in skip bits and failed
-+ * else
-+ * we know the value is cindex
- */
-- if (index >> n->bits)
-+ if (index & (~0ul << n->bits))
- return NULL;
-
- /* we have found a leaf. Prefixes have already been compared */
-@@ -1301,12 +1301,12 @@ int fib_table_lookup(struct fib_table *t
- * prefix plus zeros for the "bits" in the prefix. The index
- * is the difference between the key and this value. From
- * this we can actually derive several pieces of data.
-- * if !(index >> bits)
-- * we know the value is child index
-- * else
-+ * if (index & (~0ul << bits))
- * we have a mismatch in skip bits and failed
-+ * else
-+ * we know the value is cindex
- */
-- if (index >> n->bits)
-+ if (index & (~0ul << n->bits))
- break;
-
- /* we have found a leaf. Prefixes have already been compared */