summaryrefslogtreecommitdiff
path: root/include/linux/btree.h
diff options
context:
space:
mode:
authorAlexander A. Klimov <grandmaster@al2klimov.de>2020-08-12 04:34:19 +0300
committerLinus Torvalds <torvalds@linux-foundation.org>2020-08-12 20:57:59 +0300
commit7f317d34906c1033f0752fc137dda04e43979bb8 (patch)
treee15d66c3e1a40975ac72de6fd47abd0383ab2a71 /include/linux/btree.h
parent376653435dacf84a8aca87e66aff94079a817cf2 (diff)
downloadlinux-7f317d34906c1033f0752fc137dda04e43979bb8.tar.xz
include/: replace HTTP links with HTTPS ones
Rationale: Reduces attack surface on kernel devs opening the links for MITM as HTTPS traffic is much harder to manipulate. Signed-off-by: Alexander A. Klimov <grandmaster@al2klimov.de> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Reviewed-by: Kees Cook <keescook@chromium.org> Link: http://lkml.kernel.org/r/20200726110117.16346-1-grandmaster@al2klimov.de Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'include/linux/btree.h')
-rw-r--r--include/linux/btree.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/include/linux/btree.h b/include/linux/btree.h
index 68f858c831b1..243ee544397a 100644
--- a/include/linux/btree.h
+++ b/include/linux/btree.h
@@ -10,7 +10,7 @@
*
* A B+Tree is a data structure for looking up arbitrary (currently allowing
* unsigned long, u32, u64 and 2 * u64) keys into pointers. The data structure
- * is described at http://en.wikipedia.org/wiki/B-tree, we currently do not
+ * is described at https://en.wikipedia.org/wiki/B-tree, we currently do not
* use binary search to find the key on lookups.
*
* Each B+Tree consists of a head, that contains bookkeeping information and