mirror of
https://github.com/edk2-porting/linux-next.git
synced 2024-12-29 15:43:59 +08:00
scripts: get_abi.pl: ensure that "others" regex will be parsed
The way the search algorithm works is that reduces the number of regex expressions that will be checked for a given file entry at sysfs. It does that by looking at the devnode name. For instance, when it checks for this file: /sys/bus/pci/drivers/iosf_mbi_pci/bind The logic will seek only the "What:" expressions that end with "bind". Currently, there are just a couple of What expressions that matches it: What: /sys/bus/fsl\-mc/drivers/.*/bind What: /sys/bus/pci/drivers/.*/bind It will then run an O(n²) algorithm to seek, which runs quickly when there are few regexs to seek. There are, however, some What: expressions that end with a wildcard. Those are harder to process. Right now, they're all grouped together at the "others" group. As those don't depend on the basename of the node, add an extra loop to ensure that those will be processed at the end, if not done yet. Signed-off-by: Mauro Carvalho Chehab <mchehab+huawei@kernel.org> Link: https://lore.kernel.org/r/9fe7ab46f67575def5db9e83034e9fab43846d84.1632411447.git.mchehab+huawei@kernel.org Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
This commit is contained in:
parent
f34f67292b
commit
d4771993f2
@ -723,6 +723,22 @@ sub check_undefined_symbols {
|
||||
}
|
||||
next if ($exact);
|
||||
|
||||
if ($leave ne "others") {
|
||||
my @expr = @{$leaf{$leave}->{expr}};
|
||||
for (my $i = 0; $i < @names; $i++) {
|
||||
foreach my $re (@expr) {
|
||||
print "$names[$i] =~ /^$re\$/\n" if ($debug && $dbg_undefined);
|
||||
if ($names[$i] =~ $re) {
|
||||
$exact = 1;
|
||||
last;
|
||||
}
|
||||
}
|
||||
last if ($exact);
|
||||
}
|
||||
last if ($exact);
|
||||
}
|
||||
next if ($exact);
|
||||
|
||||
if ($hint && (!$search_string || $found_string)) {
|
||||
my $what = $leaf{$leave}->{what};
|
||||
$what =~ s/\xac/\n\t/g;
|
||||
|
Loading…
Reference in New Issue
Block a user