2021-11-17 11:22:33 +00:00
|
|
|
#! /bin/bash -efu
|
2021-06-03 15:21:41 +00:00
|
|
|
|
|
|
|
# heavily based upon find-suggests.ksyms by Andreas Gruenbacher <agruen@suse.de>.
|
|
|
|
# with modifications by Michael Brown <Michael_E_Brown@dell.com>
|
|
|
|
#
|
|
|
|
# -- added module versioning info to modalias() symbols
|
|
|
|
# -- removed code which inspects spec files.
|
|
|
|
|
|
|
|
IFS=$'\n'
|
|
|
|
|
|
|
|
#
|
|
|
|
# Initially, dont generate modalias() lines for kernel package. This needs
|
|
|
|
# additional discussion. Would like to eventually add them for
|
|
|
|
# completeness, so that we can determine when drivers are folded into
|
|
|
|
# mainline kernel.
|
|
|
|
#
|
2021-11-17 11:22:33 +00:00
|
|
|
is_kernel_package=""
|
|
|
|
case "${1:-}" in
|
2021-06-03 15:21:41 +00:00
|
|
|
kernel-module-*) ;; # Fedora kernel module package names start with
|
|
|
|
# kernel-module.
|
|
|
|
kernel*) is_kernel_package=1 ;;
|
|
|
|
esac
|
|
|
|
|
|
|
|
if ! [ -z "$is_kernel_package" ]; then
|
|
|
|
cat > /dev/null
|
|
|
|
exit 0
|
|
|
|
fi
|
|
|
|
|
2023-05-05 15:34:05 +00:00
|
|
|
# Check for presence of the commands used.
|
|
|
|
# "command" is a builtin, faster to use than fork+execing "which" - see
|
|
|
|
# https://pubs.opengroup.org/onlinepubs/9699919799/utilities/command.html
|
|
|
|
command -v /sbin/modinfo >/dev/null || exit 1
|
|
|
|
command -v sed >/dev/null || exit 1
|
|
|
|
command -v sort >/dev/null || exit 1
|
2021-11-17 11:22:33 +00:00
|
|
|
|
2021-06-03 15:21:41 +00:00
|
|
|
print_modaliases() {
|
2023-05-05 15:40:03 +00:00
|
|
|
local class="$1" variants="$2" pos="$3"
|
2021-06-03 15:21:41 +00:00
|
|
|
if [ -n "$variants" ]; then
|
|
|
|
echo "${class:0:pos}[$variants]${class:pos+1}"
|
|
|
|
else
|
|
|
|
[ -z "$class" ] || echo "$class"
|
|
|
|
fi
|
|
|
|
}
|
|
|
|
|
2023-05-05 16:12:36 +00:00
|
|
|
# Try to make "provides" list a bit smaller:
|
|
|
|
# find "mergeable" strings a-la
|
|
|
|
# modalias(pci:v0000168Cd00000023sv*sd*bc*sc*i*)
|
|
|
|
# modalias(pci:v0000168Cd00000024sv*sd*bc*sc*i*)
|
|
|
|
# modalias(pci:v0000168Cd00000027sv*sd*bc*sc*i*)
|
|
|
|
# modalias(pci:v0000168Cd00000029sv*sd*bc*sc*i*)
|
|
|
|
# replace with
|
|
|
|
# modalias(pci:v0000168Cd0000002[3479]sv*sd*bc*sc*i*)
|
2021-06-03 15:21:41 +00:00
|
|
|
combine_modaliases() {
|
2023-05-07 15:43:27 +00:00
|
|
|
local unused_len tag class variants="" pos="" n end xc
|
2023-05-03 09:30:18 +00:00
|
|
|
|
|
|
|
# Due to set -e, we can exit with exitcode 1 on read EOF
|
|
|
|
# and this makes our caller think we failed. "|| return 0" prevents this:
|
2023-05-07 15:29:18 +00:00
|
|
|
IFS=' ' read unused_len class || return 0
|
2023-05-03 09:30:18 +00:00
|
|
|
|
2023-05-05 16:12:36 +00:00
|
|
|
# For each line after the first...
|
2023-05-07 15:29:18 +00:00
|
|
|
while IFS=' ' read unused_len tag; do
|
2023-05-07 15:43:27 +00:00
|
|
|
if [ -z "$pos" ]; then
|
|
|
|
# 2nd line: after "modalias(" prefix, for each char in prev line...
|
|
|
|
n=9
|
|
|
|
end=${#class}
|
|
|
|
else
|
|
|
|
# 3rd+ lines: only check the char at the same position
|
|
|
|
n=$pos
|
|
|
|
end=$((pos + 1))
|
|
|
|
fi
|
|
|
|
# Search for aaaNbbb,aaaMbbb line pair, where N and M chars differ.
|
|
|
|
# sort -u guarantees there are no identical line pairs.
|
|
|
|
# We assume that lines will not differ only in " = version" suffix.
|
|
|
|
for ((; n < $end; n++)); do
|
|
|
|
if [ "${class:0:n}" != "${tag:0:n}" ]; then
|
|
|
|
# the prefixes already aren't the same: break
|
|
|
|
n=$end
|
2021-06-03 15:21:41 +00:00
|
|
|
break
|
|
|
|
fi
|
2023-05-07 15:43:27 +00:00
|
|
|
# If suffixes differ, go to next char
|
|
|
|
[ x"${class:n+1}" != x"${tag:n+1}" ] && continue
|
|
|
|
# aaaNbbb = aaaMbbb. If N and M aren't special...
|
|
|
|
xc=x"${class:n:1}"
|
|
|
|
[ x"[" = "$xc" -o x"]" = "$xc" ] && continue
|
|
|
|
[ x"?" = "$xc" -o x"*" = "$xc" ] && continue
|
|
|
|
xc=x"${tag:n:1}"
|
|
|
|
[ x"[" = "$xc" -o x"]" = "$xc" ] && continue
|
|
|
|
[ x"?" = "$xc" -o x"*" = "$xc" ] && continue
|
|
|
|
# Add M (and maybe N) to $variants, go to next line
|
|
|
|
variants="${variants:-${class:n:1}}${tag:n:1}"
|
|
|
|
pos=$n
|
|
|
|
break
|
2021-06-03 15:21:41 +00:00
|
|
|
done
|
2023-05-07 15:43:27 +00:00
|
|
|
if [ $n -eq $end ]; then
|
|
|
|
# This line is not mergeable with the previous one(s),
|
|
|
|
# print collected merged line and reset the state
|
2021-06-03 15:21:41 +00:00
|
|
|
print_modaliases "$class" "$variants" "$pos"
|
2023-05-07 15:43:27 +00:00
|
|
|
variants=""
|
|
|
|
pos=""
|
2021-06-03 15:21:41 +00:00
|
|
|
class=$tag
|
|
|
|
fi
|
|
|
|
done
|
2023-05-05 16:12:36 +00:00
|
|
|
# Print last collected merged line
|
2021-06-03 15:21:41 +00:00
|
|
|
print_modaliases "$class" "$variants" "$pos"
|
|
|
|
}
|
|
|
|
|
2021-11-17 11:38:00 +00:00
|
|
|
for module in $(grep -E '/lib/modules/.+\.ko(\.gz|\.bz2|\.xz|\.zst)?$') "$@"; do
|
2023-05-07 15:43:27 +00:00
|
|
|
modver=$(/sbin/modinfo -F version "$module")
|
|
|
|
# delete possible extra lines because some modules have *two* version tags. *cough*b44*cough*
|
|
|
|
modver=${modver%%$'\n'*} # using $'' bashism, avoid running "head -n1" process
|
|
|
|
# replace any strange chars with underscores.
|
2021-11-17 14:52:00 +00:00
|
|
|
modver=${modver//[^0-9a-zA-Z._]/_}
|
2023-05-07 15:43:27 +00:00
|
|
|
# only add version tag if it indeed has a version
|
2021-11-17 14:52:00 +00:00
|
|
|
[ -z "$modver" ] || modver=" = $modver"
|
|
|
|
|
|
|
|
/sbin/modinfo -F alias "$module" \
|
|
|
|
| sed -nre "s,[^][0-9a-zA-Z._:*?/-],_,g; s,(.+),modalias(\\1)$modver,p"
|
2023-05-07 15:29:18 +00:00
|
|
|
|
|
|
|
# Below: combining code can only possibly combine lines of equal length.
|
|
|
|
# Prepend line lengths before sort, so that same-length lines end up next
|
|
|
|
# to each other. (The lengths are discarded by combine_modaliases).
|
2021-06-03 15:21:41 +00:00
|
|
|
done \
|
2023-05-07 15:29:18 +00:00
|
|
|
| { while read line; do echo "${#line} $line"; done } \
|
2023-05-05 15:35:42 +00:00
|
|
|
| LC_ALL=C sort -u \
|
2021-06-03 15:21:41 +00:00
|
|
|
| combine_modaliases
|