mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-10-01 06:33:07 +00:00
cba22b1c59
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 both the HTTP and HTTPS versions
return 200 OK and serve the same content:
Replace HTTP with HTTPS.
Signed-off-by: Alexander A. Klimov <grandmaster@al2klimov.de>
Reviewed-by: Aurelien Aptel <aaptel@suse.com>
Link: https://lore.kernel.org/r/20200627103125.71828-1-grandmaster@al2klimov.de
Signed-off-by: Jonathan Corbet <corbet@lwn.net>
62 lines
1.6 KiB
Perl
Executable file
62 lines
1.6 KiB
Perl
Executable file
#!/usr/bin/perl -w
|
|
#
|
|
# winucase_convert.pl -- convert "Windows 8 Upper Case Mapping Table.txt" to
|
|
# a two-level set of C arrays.
|
|
#
|
|
# Copyright 2013: Jeff Layton <jlayton@redhat.com>
|
|
#
|
|
# This program is free software: you can redistribute it and/or modify
|
|
# it under the terms of the GNU General Public License as published by
|
|
# the Free Software Foundation, either version 3 of the License, or
|
|
# (at your option) any later version.
|
|
#
|
|
# This program is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU General Public License for more details.
|
|
#
|
|
# You should have received a copy of the GNU General Public License
|
|
# along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
#
|
|
|
|
while(<>) {
|
|
next if (!/^0x(..)(..)\t0x(....)\t/);
|
|
$firstchar = hex($1);
|
|
$secondchar = hex($2);
|
|
$uppercase = hex($3);
|
|
|
|
$top[$firstchar][$secondchar] = $uppercase;
|
|
}
|
|
|
|
for ($i = 0; $i < 256; $i++) {
|
|
next if (!$top[$i]);
|
|
|
|
printf("static const wchar_t t2_%2.2x[256] = {", $i);
|
|
for ($j = 0; $j < 256; $j++) {
|
|
if (($j % 8) == 0) {
|
|
print "\n\t";
|
|
} else {
|
|
print " ";
|
|
}
|
|
printf("0x%4.4x,", $top[$i][$j] ? $top[$i][$j] : 0);
|
|
}
|
|
print "\n};\n\n";
|
|
}
|
|
|
|
printf("static const wchar_t *const toplevel[256] = {", $i);
|
|
for ($i = 0; $i < 256; $i++) {
|
|
if (($i % 8) == 0) {
|
|
print "\n\t";
|
|
} elsif ($top[$i]) {
|
|
print " ";
|
|
} else {
|
|
print " ";
|
|
}
|
|
|
|
if ($top[$i]) {
|
|
printf("t2_%2.2x,", $i);
|
|
} else {
|
|
print "NULL,";
|
|
}
|
|
}
|
|
print "\n};\n\n";
|