-
-
Save vladimyr/9a03481154cd3048a486bdf71e5e1535 to your computer and use it in GitHub Desktop.
Prints the various glibc versions required by an executable
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/bin/bash | |
# This scripts lets you check which minimum GLIBC version an executable requires. | |
# Simply run './glibc-check.sh path/to/your/binary' | |
# | |
# You can set `MAX_VER` however low you want, although I (fasterthanlime) | |
# feel like `2.13` is a good target (For reference, Ubuntu 12.04 has GLIBC 2.15) | |
MAX_VER="${MAX_VER:-2.13}" | |
BINARY="$1" | |
# Version comparison function in bash | |
vercomp() { | |
if [[ $1 == "$2" ]]; then | |
return 0 | |
fi | |
local i ver1 ver2 | |
IFS="." read -ra ver1 <<<"$1" | |
IFS="." read -ra ver2 <<<"$2" | |
# fill empty fields in ver1 with zeros | |
for ((i = ${#ver1[@]}; i < ${#ver2[@]}; i++)); do | |
ver1[i]=0 | |
done | |
for ((i = 0; i < ${#ver1[@]}; i++)); do | |
if [[ -z ${ver2[i]} ]]; then | |
# fill empty fields in ver2 with zeros | |
ver2[i]=0 | |
fi | |
if ((10#${ver1[i]} > 10#${ver2[i]})); then | |
return 1 | |
fi | |
if ((10#${ver1[i]} < 10#${ver2[i]})); then | |
return 2 | |
fi | |
done | |
return 0 | |
} | |
IFS=" | |
" | |
VERS=$(objdump -T "$BINARY" | grep GLIBC | sed 's/.*GLIBC_\([.0-9]*\).*/\1/g' | sort -u) | |
for VER in $VERS; do | |
vercomp "$VER" "$MAX_VER" | |
COMP=$? | |
if [[ $COMP -eq 1 ]]; then | |
echo "Error! ${BINARY} requests GLIBC ${VER}, which is higher than target ${MAX_VER}" | |
echo "Affected symbols:" | |
objdump -T "$BINARY" | grep -F "GLIBC_${VER}" | |
echo "Looking for symbols in libraries..." | |
for LIBRARY in $(ldd "$BINARY" | cut -d ' ' -f 3); do | |
echo "$LIBRARY" | |
objdump -T "$LIBRARY" | grep -F "GLIBC_${VER}" | |
done | |
exit 27 | |
else | |
echo "Found version ${VER}" | |
fi | |
done |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment