Commit d89775fc authored by Alexander A. Klimov's avatar Alexander A. Klimov Committed by Linus Torvalds

lib/: 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: default avatarAlexander A. Klimov <grandmaster@al2klimov.de>
Signed-off-by: default avatarAndrew Morton <akpm@linux-foundation.org>
Acked-by: Coly Li <colyli@suse.de>	[crc64.c]
Link: http://lkml.kernel.org/r/20200726112154.16510-1-grandmaster@al2klimov.deSigned-off-by: default avatarLinus Torvalds <torvalds@linux-foundation.org>
parent 3adf3bae
...@@ -2215,7 +2215,7 @@ config LIST_KUNIT_TEST ...@@ -2215,7 +2215,7 @@ config LIST_KUNIT_TEST
and associated macros. and associated macros.
KUnit tests run during boot and output the results to the debug log KUnit tests run during boot and output the results to the debug log
in TAP format (http://testanything.org/). Only useful for kernel devs in TAP format (https://testanything.org/). Only useful for kernel devs
running the KUnit test harness, and not intended for inclusion into a running the KUnit test harness, and not intended for inclusion into a
production build. production build.
......
...@@ -4,7 +4,7 @@ ...@@ -4,7 +4,7 @@
* *
* This is a basic crc64 implementation following ECMA-182 specification, * This is a basic crc64 implementation following ECMA-182 specification,
* which can be found from, * which can be found from,
* http://www.ecma-international.org/publications/standards/Ecma-182.htm * https://www.ecma-international.org/publications/standards/Ecma-182.htm
* *
* Dr. Ross N. Williams has a great document to introduce the idea of CRC * Dr. Ross N. Williams has a great document to introduce the idea of CRC
* algorithm, here the CRC64 code is also inspired by the table-driven * algorithm, here the CRC64 code is also inspired by the table-driven
......
...@@ -34,7 +34,7 @@ ...@@ -34,7 +34,7 @@
Phone (337) 232-1234 or 1-800-738-2226 Phone (337) 232-1234 or 1-800-738-2226
Fax (337) 232-1297 Fax (337) 232-1297
http://www.hospiceacadiana.com/ https://www.hospiceacadiana.com/
Manuel Manuel
*/ */
......
...@@ -8,7 +8,7 @@ ...@@ -8,7 +8,7 @@
*implementation for lzma. *implementation for lzma.
*Copyright (C) 2006 Aurelien Jacobs < aurel@gnuage.org > *Copyright (C) 2006 Aurelien Jacobs < aurel@gnuage.org >
* *
*Based on LzmaDecode.c from the LZMA SDK 4.22 (http://www.7-zip.org/) *Based on LzmaDecode.c from the LZMA SDK 4.22 (https://www.7-zip.org/)
*Copyright (C) 1999-2005 Igor Pavlov *Copyright (C) 1999-2005 Igor Pavlov
* *
*Copyrights of the parts, see headers below. *Copyrights of the parts, see headers below.
...@@ -56,7 +56,7 @@ static long long INIT read_int(unsigned char *ptr, int size) ...@@ -56,7 +56,7 @@ static long long INIT read_int(unsigned char *ptr, int size)
/* Small range coder implementation for lzma. /* Small range coder implementation for lzma.
*Copyright (C) 2006 Aurelien Jacobs < aurel@gnuage.org > *Copyright (C) 2006 Aurelien Jacobs < aurel@gnuage.org >
* *
*Based on LzmaDecode.c from the LZMA SDK 4.22 (http://www.7-zip.org/) *Based on LzmaDecode.c from the LZMA SDK 4.22 (https://www.7-zip.org/)
*Copyright (c) 1999-2005 Igor Pavlov *Copyright (c) 1999-2005 Igor Pavlov
*/ */
...@@ -213,7 +213,7 @@ rc_bit_tree_decode(struct rc *rc, uint16_t *p, int num_levels, int *symbol) ...@@ -213,7 +213,7 @@ rc_bit_tree_decode(struct rc *rc, uint16_t *p, int num_levels, int *symbol)
* Small lzma deflate implementation. * Small lzma deflate implementation.
* Copyright (C) 2006 Aurelien Jacobs < aurel@gnuage.org > * Copyright (C) 2006 Aurelien Jacobs < aurel@gnuage.org >
* *
* Based on LzmaDecode.c from the LZMA SDK 4.22 (http://www.7-zip.org/) * Based on LzmaDecode.c from the LZMA SDK 4.22 (https://www.7-zip.org/)
* Copyright (C) 1999-2005 Igor Pavlov * Copyright (C) 1999-2005 Igor Pavlov
*/ */
......
...@@ -27,7 +27,7 @@ ...@@ -27,7 +27,7 @@
* with the fractional part size described in given_denominator. * with the fractional part size described in given_denominator.
* *
* for theoretical background, see: * for theoretical background, see:
* http://en.wikipedia.org/wiki/Continued_fraction * https://en.wikipedia.org/wiki/Continued_fraction
*/ */
void rational_best_approximation( void rational_best_approximation(
......
...@@ -13,7 +13,7 @@ ...@@ -13,7 +13,7 @@
#include <linux/export.h> #include <linux/export.h>
/* /*
* red-black trees properties: http://en.wikipedia.org/wiki/Rbtree * red-black trees properties: https://en.wikipedia.org/wiki/Rbtree
* *
* 1) A node is either red or black * 1) A node is either red or black
* 2) The root is black * 2) The root is black
......
...@@ -11,7 +11,7 @@ ...@@ -11,7 +11,7 @@
* [1] A Fast String Searching Algorithm, R.S. Boyer and Moore. * [1] A Fast String Searching Algorithm, R.S. Boyer and Moore.
* Communications of the Association for Computing Machinery, * Communications of the Association for Computing Machinery,
* 20(10), 1977, pp. 762-772. * 20(10), 1977, pp. 762-772.
* http://www.cs.utexas.edu/users/moore/publications/fstrpos.pdf * https://www.cs.utexas.edu/users/moore/publications/fstrpos.pdf
* *
* [2] Handbook of Exact String Matching Algorithms, Thierry Lecroq, 2004 * [2] Handbook of Exact String Matching Algorithms, Thierry Lecroq, 2004
* http://www-igm.univ-mlv.fr/~lecroq/string/string.pdf * http://www-igm.univ-mlv.fr/~lecroq/string/string.pdf
......
...@@ -34,7 +34,7 @@ ...@@ -34,7 +34,7 @@
* ("BSD"). * ("BSD").
* *
* You can contact the author at: * You can contact the author at:
* - xxHash homepage: http://cyan4973.github.io/xxHash/ * - xxHash homepage: https://cyan4973.github.io/xxHash/
* - xxHash source repository: https://github.com/Cyan4973/xxHash * - xxHash source repository: https://github.com/Cyan4973/xxHash
*/ */
......
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
* CRC32 using the polynomial from IEEE-802.3 * CRC32 using the polynomial from IEEE-802.3
* *
* Authors: Lasse Collin <lasse.collin@tukaani.org> * Authors: Lasse Collin <lasse.collin@tukaani.org>
* Igor Pavlov <http://7-zip.org/> * Igor Pavlov <https://7-zip.org/>
* *
* This file has been put into the public domain. * This file has been put into the public domain.
* You can do whatever you want with this file. * You can do whatever you want with this file.
......
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
* Branch/Call/Jump (BCJ) filter decoders * Branch/Call/Jump (BCJ) filter decoders
* *
* Authors: Lasse Collin <lasse.collin@tukaani.org> * Authors: Lasse Collin <lasse.collin@tukaani.org>
* Igor Pavlov <http://7-zip.org/> * Igor Pavlov <https://7-zip.org/>
* *
* This file has been put into the public domain. * This file has been put into the public domain.
* You can do whatever you want with this file. * You can do whatever you want with this file.
......
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
* LZMA2 decoder * LZMA2 decoder
* *
* Authors: Lasse Collin <lasse.collin@tukaani.org> * Authors: Lasse Collin <lasse.collin@tukaani.org>
* Igor Pavlov <http://7-zip.org/> * Igor Pavlov <https://7-zip.org/>
* *
* This file has been put into the public domain. * This file has been put into the public domain.
* You can do whatever you want with this file. * You can do whatever you want with this file.
......
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
* LZMA2 definitions * LZMA2 definitions
* *
* Authors: Lasse Collin <lasse.collin@tukaani.org> * Authors: Lasse Collin <lasse.collin@tukaani.org>
* Igor Pavlov <http://7-zip.org/> * Igor Pavlov <https://7-zip.org/>
* *
* This file has been put into the public domain. * This file has been put into the public domain.
* You can do whatever you want with this file. * You can do whatever you want with this file.
......
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
/* /*
* See the .xz file format specification at * See the .xz file format specification at
* http://tukaani.org/xz/xz-file-format.txt * https://tukaani.org/xz/xz-file-format.txt
* to understand the container format. * to understand the container format.
*/ */
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment