leandrof/linux
1
0
Fork 0
forked from Minki/linux
Code Issues Pull Requests Packages Projects Releases Wiki Activity

scripts: get_abi.pl: make undefined search more deterministic

Browse Source 
Sort keys on hashes during undefined search, in order to
make the script more deterministic.

Signed-off-by: Mauro Carvalho Chehab <mchehab+huawei@kernel.org>
Link: https://lore.kernel.org/r/5dc55fd42e632a24a48f95212aa6c6bc4b2d11fd.1632865873.git.mchehab+huawei@kernel.org
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
This commit is contained in:
Mauro Carvalho Chehab 2021-09-28 23:51:32 +02:00 committed by Greg Kroah-Hartman
parent 654e4d5d3d
commit e5c044c8a9
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
scripts/get_abi.pl
View File

@ -775,6 +775,8 @@ sub check_undefined_symbols {
my $next_i = 0;
my $start_time = times;
@files = sort @files;
my $last_time = $start_time;
# When either debug or hint is enabled, there's no sense showing
@ -909,16 +911,16 @@ sub undefined_symbols {
}
}
# Compile regexes
foreach my $l (keys %leaf) {
foreach my $l (sort keys %leaf) {
my @expr;
foreach my $w(split /\xac/, $leaf{$l}->{what}) {
foreach my $w(sort split /\xac/, $leaf{$l}->{what}) {
push @expr, qr /^$w$/;
}
$leaf{$l}->{expr} = \@expr;
}
# Take links into account
foreach my $link (keys %aliases) {
foreach my $link (sort keys %aliases) {
my $abs_file = $aliases{$link};
graph_add_link($abs_file, $link);
}