Commit c8ed9fc9 authored by Alexander A. Klimov's avatar Alexander A. Klimov Committed by Michael Ellerman

powerpc: 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.

Deterministic algorithm:
For each file:
  If not .svg:
    For each line:
      If doesn't contain `\bxmlns\b`:
        For each link, `\bhttp://[^# \t\r\n]*(?:\w|/)`:
	  If neither `\bgnu\.org/license`, nor `\bmozilla\.org/MPL\b`:
            If both the HTTP and HTTPS versions
            return 200 OK and serve the same content:
              Replace HTTP with HTTPS.
Signed-off-by: default avatarAlexander A. Klimov <grandmaster@al2klimov.de>
Signed-off-by: default avatarMichael Ellerman <mpe@ellerman.id.au>
Link: https://lore.kernel.org/r/20200718103958.5455-1-grandmaster@al2klimov.de
parent 38b407be
...@@ -2,7 +2,7 @@ ...@@ -2,7 +2,7 @@
Linux 2.6.x on MPC52xx family Linux 2.6.x on MPC52xx family
============================= =============================
For the latest info, go to http://www.246tNt.com/mpc52xx/ For the latest info, go to https://www.246tNt.com/mpc52xx/
To compile/use : To compile/use :
......
...@@ -19,7 +19,7 @@ ...@@ -19,7 +19,7 @@
* We then use fixed point Barrett reduction to compute a mod n over GF(2) * We then use fixed point Barrett reduction to compute a mod n over GF(2)
* for n = CRC using POWER8 instructions. We use x = 32. * for n = CRC using POWER8 instructions. We use x = 32.
* *
* http://en.wikipedia.org/wiki/Barrett_reduction * https://en.wikipedia.org/wiki/Barrett_reduction
* *
* Copyright (C) 2015 Anton Blanchard <anton@au.ibm.com>, IBM * Copyright (C) 2015 Anton Blanchard <anton@au.ibm.com>, IBM
*/ */
......
...@@ -10,7 +10,7 @@ ...@@ -10,7 +10,7 @@
* *
* © Copyright 1995 Apple Computer, Inc. All rights reserved. * © Copyright 1995 Apple Computer, Inc. All rights reserved.
* *
* It's available online from http://www.cpu.lu/~mlan/ftp/MacTech.pdf * It's available online from https://www.cpu.lu/~mlan/ftp/MacTech.pdf
* You can obtain paper copies of this book from computer bookstores or by * You can obtain paper copies of this book from computer bookstores or by
* writing Morgan Kaufmann Publishers, Inc., 340 Pine Street, Sixth Floor, San * writing Morgan Kaufmann Publishers, Inc., 340 Pine Street, Sixth Floor, San
* Francisco, CA 94104. Reference ISBN 1-55860-393-X. * Francisco, CA 94104. Reference ISBN 1-55860-393-X.
......
...@@ -50,7 +50,7 @@ ...@@ -50,7 +50,7 @@
# Written by Andy Polyakov <appro@openssl.org> for the OpenSSL # Written by Andy Polyakov <appro@openssl.org> for the OpenSSL
# project. The module is, however, dual licensed under OpenSSL and # project. The module is, however, dual licensed under OpenSSL and
# CRYPTOGAMS licenses depending on where you obtain it. For further # CRYPTOGAMS licenses depending on where you obtain it. For further
# details see http://www.openssl.org/~appro/cryptogams/. # details see https://www.openssl.org/~appro/cryptogams/.
# ==================================================================== # ====================================================================
# #
# This module implements support for AES instructions as per PowerISA # This module implements support for AES instructions as per PowerISA
......
...@@ -13,7 +13,7 @@ ...@@ -13,7 +13,7 @@
# Written by Andy Polyakov <appro@openssl.org> for the OpenSSL # Written by Andy Polyakov <appro@openssl.org> for the OpenSSL
# project. The module is, however, dual licensed under OpenSSL and # project. The module is, however, dual licensed under OpenSSL and
# CRYPTOGAMS licenses depending on where you obtain it. For further # CRYPTOGAMS licenses depending on where you obtain it. For further
# details see http://www.openssl.org/~appro/cryptogams/. # details see https://www.openssl.org/~appro/cryptogams/.
# ==================================================================== # ====================================================================
# #
# GHASH for for PowerISA v2.07. # GHASH for for PowerISA v2.07.
......
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