mirror of https://github.com/ventoy/Ventoy.git
VentoyPlugson ---- A GUI ventoy.json configurator
This commit is contained in:
longpanda
parent
9eeb94e8b5
commit
4bf43ab9d4
|
|
@ -22,6 +22,11 @@ Please refer https://www.ventoy.net/en/doc_start.html for details.
|
||||||
2. open your browser and visit http://127.0.0.1:24680
|
2. open your browser and visit http://127.0.0.1:24680
|
||||||
|
|
||||||
|
|
||||||
|
========== VentoyPlugson.sh ===============
|
||||||
|
1. sudo sh VentoyPlugson.sh
|
||||||
|
2. open your browser and visit http://127.0.0.1:24681
|
||||||
|
|
||||||
|
|
||||||
========= VentoyGUI ===================
|
========= VentoyGUI ===================
|
||||||
VentoyGUI is native GUI program for Linux (GTK/QT)
|
VentoyGUI is native GUI program for Linux (GTK/QT)
|
||||||
1. Just double-click the file (e.g. VentoyGUI.x86_64)
|
1. Just double-click the file (e.g. VentoyGUI.x86_64)
|
||||||
|
|
|
||||||
Binary file not shown.
|
|
@ -46,23 +46,25 @@ echo "############# Ventoy2Disk $* [$TOOLDIR] ################" >> ./log.txt
|
||||||
date >> ./log.txt
|
date >> ./log.txt
|
||||||
|
|
||||||
#decompress tool
|
#decompress tool
|
||||||
if [ -f ./tool/$TOOLDIR/ash ]; then
|
echo "decompress tools" >> ./log.txt
|
||||||
echo "no need to decompress tools" >> ./log.txt
|
cd ./tool/$TOOLDIR
|
||||||
else
|
|
||||||
cd ./tool/$TOOLDIR
|
|
||||||
|
|
||||||
|
ls *.xz > /dev/null 2>&1
|
||||||
|
if [ $? -eq 0 ]; then
|
||||||
[ -f ./xzcat ] && chmod +x ./xzcat
|
[ -f ./xzcat ] && chmod +x ./xzcat
|
||||||
|
|
||||||
for file in $(ls *.xz); do
|
for file in $(ls *.xz); do
|
||||||
|
echo "decompress $file" >> ./log.txt
|
||||||
xzcat $file > ${file%.xz}
|
xzcat $file > ${file%.xz}
|
||||||
[ -f ./${file%.xz} ] && chmod +x ./${file%.xz}
|
[ -f ./${file%.xz} ] && chmod +x ./${file%.xz}
|
||||||
[ -f ./$file ] && rm -f ./$file
|
[ -f ./$file ] && rm -f ./$file
|
||||||
done
|
done
|
||||||
cd ../../
|
|
||||||
|
|
||||||
chmod +x -R ./tool/$TOOLDIR
|
|
||||||
fi
|
fi
|
||||||
|
|
||||||
|
cd ../../
|
||||||
|
chmod +x -R ./tool/$TOOLDIR
|
||||||
|
|
||||||
|
|
||||||
if [ -f /bin/bash ]; then
|
if [ -f /bin/bash ]; then
|
||||||
/bin/bash ./tool/VentoyWorker.sh $*
|
/bin/bash ./tool/VentoyWorker.sh $*
|
||||||
else
|
else
|
||||||
|
|
|
||||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
|
|
@ -0,0 +1,218 @@
|
||||||
|
#!/bin/sh
|
||||||
|
|
||||||
|
. ./tool/ventoy_lib.sh
|
||||||
|
|
||||||
|
print_usage() {
|
||||||
|
echo 'Usage: sudo sh VentoyPlugson.sh [OPTION] /dev/sdX'
|
||||||
|
echo ' OPTION: (optional)'
|
||||||
|
echo ' -H x.x.x.x http server IP address (default is 127.0.0.1)'
|
||||||
|
echo ' -P PORT http server PORT (default is 24681)'
|
||||||
|
echo ' -h print this help'
|
||||||
|
echo ''
|
||||||
|
}
|
||||||
|
|
||||||
|
uid=$(id -u)
|
||||||
|
if [ $uid -ne 0 ]; then
|
||||||
|
echo "Please use sudo or run the script as root."
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
|
||||||
|
OLDDIR=$(pwd)
|
||||||
|
|
||||||
|
machine=$(uname -m)
|
||||||
|
if echo $machine | egrep -q 'aarch64|arm64'; then
|
||||||
|
TOOLDIR=aarch64
|
||||||
|
elif echo $machine | egrep -q 'x86_64|amd64'; then
|
||||||
|
TOOLDIR=x86_64
|
||||||
|
elif echo $machine | egrep -q 'mips64'; then
|
||||||
|
TOOLDIR=mips64el
|
||||||
|
elif echo $machine | egrep -q 'i[3-6]86'; then
|
||||||
|
TOOLDIR=i386
|
||||||
|
else
|
||||||
|
echo "Unsupported machine type $machine"
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
|
||||||
|
if ! [ -f "$OLDDIR/tool/plugson.tar.xz" ]; then
|
||||||
|
echo "Please run under the correct directory!"
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
echo "############# VentoyPlugson $* [$TOOLDIR] ################" >> ./VentoyPlugson.log
|
||||||
|
date >> ./VentoyPlugson.log
|
||||||
|
|
||||||
|
echo "decompress tools" >> ./VentoyPlugson.log
|
||||||
|
cd ./tool/$TOOLDIR
|
||||||
|
|
||||||
|
ls *.xz > /dev/null 2>&1
|
||||||
|
if [ $? -eq 0 ]; then
|
||||||
|
[ -f ./xzcat ] && chmod +x ./xzcat
|
||||||
|
|
||||||
|
for file in $(ls *.xz); do
|
||||||
|
echo "decompress $file" >> ./VentoyPlugson.log
|
||||||
|
xzcat $file > ${file%.xz}
|
||||||
|
[ -f ./${file%.xz} ] && chmod +x ./${file%.xz}
|
||||||
|
[ -f ./$file ] && rm -f ./$file
|
||||||
|
done
|
||||||
|
fi
|
||||||
|
|
||||||
|
cd ../../
|
||||||
|
chmod +x -R ./tool/$TOOLDIR
|
||||||
|
|
||||||
|
if ! [ -f "$OLDDIR/tool/$TOOLDIR/Plugson" ]; then
|
||||||
|
echo "$OLDDIR/tool/$TOOLDIR/Plugson does not exist!"
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
|
||||||
|
PATH=./tool/$TOOLDIR:$PATH
|
||||||
|
|
||||||
|
HOST="127.0.0.1"
|
||||||
|
PORT=24681
|
||||||
|
|
||||||
|
while [ -n "$1" ]; do
|
||||||
|
if [ "$1" = "-h" ] || [ "$1" = "--help" ]; then
|
||||||
|
print_usage
|
||||||
|
exit 0
|
||||||
|
elif [ "$1" = "-H" ]; then
|
||||||
|
shift
|
||||||
|
if echo $1 | grep -q '[0-9]*\.[0-9]*\.[0-9]*\.[0-9]*'; then
|
||||||
|
HOST="$1"
|
||||||
|
else
|
||||||
|
echo "Invalid host $1"
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
elif [ "$1" = "-P" ]; then
|
||||||
|
shift
|
||||||
|
if [ $1 -gt 0 -a $1 -le 65535 ]; then
|
||||||
|
PORT="$1"
|
||||||
|
else
|
||||||
|
echo "Invalid port $1"
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
else
|
||||||
|
DISK=$1
|
||||||
|
fi
|
||||||
|
|
||||||
|
shift
|
||||||
|
done
|
||||||
|
|
||||||
|
if [ -z "$DISK" ]; then
|
||||||
|
print_usage
|
||||||
|
exit 0
|
||||||
|
fi
|
||||||
|
|
||||||
|
if ps -ef | grep "tool/$TOOLDIR/Plugson.*$HOST.*$PORT" | grep -q -v grep; then
|
||||||
|
echo "Another ventoy server is running now, please close it first."
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
if echo $DISK | grep -q "[a-z]d[a-z][1-9]"; then
|
||||||
|
DISK=${DISK:0:-1}
|
||||||
|
fi
|
||||||
|
|
||||||
|
if echo $DISK | egrep -q "/dev/nvme|/dev/mmcblk/dev/nbd"; then
|
||||||
|
if echo $DISK | grep -q "p[1-9]$"; then
|
||||||
|
DISK=${DISK:0:-2}
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
|
||||||
|
|
||||||
|
if [ ! -b "$DISK" ]; then
|
||||||
|
echo "$DISK does NOT exist."
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
|
||||||
|
version=$(get_disk_ventoy_version $DISK)
|
||||||
|
if [ $? -eq 0 ]; then
|
||||||
|
echo "Ventoy version in Disk: $version"
|
||||||
|
|
||||||
|
vtPart1Type=$(dd if=$DISK bs=1 count=1 skip=450 status=none | hexdump -n1 -e '1/1 "%02X"')
|
||||||
|
if [ "$vtPart1Type" = "EE" ]; then
|
||||||
|
echo "Disk Partition Style : GPT"
|
||||||
|
partstyle=1
|
||||||
|
else
|
||||||
|
echo "Disk Partition Style : MBR"
|
||||||
|
partstyle=0
|
||||||
|
fi
|
||||||
|
|
||||||
|
if check_disk_secure_boot $DISK; then
|
||||||
|
echo "Secure Boot Support : YES"
|
||||||
|
secureboot=1
|
||||||
|
else
|
||||||
|
echo "Secure Boot Support : NO"
|
||||||
|
secureboot=0
|
||||||
|
fi
|
||||||
|
else
|
||||||
|
echo "$DISK is NOT Ventoy disk."
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
PART1=$(get_disk_part_name $DISK 1)
|
||||||
|
|
||||||
|
if grep -q "^$PART1 " /proc/mounts; then
|
||||||
|
mtpnt=$(grep "^$PART1 " /proc/mounts | awk '{print $2}')
|
||||||
|
fstype=$(grep "^$PART1 " /proc/mounts | awk '{print $3}')
|
||||||
|
|
||||||
|
if echo $fstype | grep -q -i 'fuse'; then
|
||||||
|
if hexdump -C -n 16 $PART1 | grep -q -i "EXFAT"; then
|
||||||
|
fstype="exFAT"
|
||||||
|
elif hexdump -C -n 16 $PART1 | grep -q -i "NTFS"; then
|
||||||
|
fstype="NTFS"
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
|
||||||
|
echo "$PART1 is mounted at $mtpnt $fstype"
|
||||||
|
else
|
||||||
|
echo "$PART1 is NOT mounted, please mount it first!"
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
if [ -d "$mtpnt/ventoy" ]; then
|
||||||
|
echo "ventoy directory exist OK"
|
||||||
|
else
|
||||||
|
echo "create ventoy directory"
|
||||||
|
mkdir -p "$mtpnt/ventoy"
|
||||||
|
if [ -d "$mtpnt/ventoy" ]; then
|
||||||
|
chmod -R 0755 "$mtpnt/ventoy"
|
||||||
|
else
|
||||||
|
echo "Failed to create directory $mtpnt/ventoy"
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
|
||||||
|
|
||||||
|
#change current directory to Ventoy disk
|
||||||
|
cd "$mtpnt"
|
||||||
|
LANG=en_US $OLDDIR/tool/$TOOLDIR/Plugson "$HOST" "$PORT" "$OLDDIR" "$DISK" $version "$fstype" $partstyle $secureboot &
|
||||||
|
wID=$!
|
||||||
|
sleep 1
|
||||||
|
|
||||||
|
if [ -f /proc/$wID/maps ]; then
|
||||||
|
echo ""
|
||||||
|
echo "==============================================================="
|
||||||
|
if [ "$LANG" = "zh_CN.UTF-8" ]; then
|
||||||
|
echo " Ventoy Plugson Server 已经启动 ..."
|
||||||
|
echo " 请打开浏览器，访问 http://${HOST}:${PORT}"
|
||||||
|
else
|
||||||
|
echo " Ventoy Plugson Server is running ..."
|
||||||
|
echo " Please open your browser and visit http://${HOST}:${PORT}"
|
||||||
|
fi
|
||||||
|
echo "==============================================================="
|
||||||
|
echo ""
|
||||||
|
echo "################## Press Ctrl + C to exit #####################"
|
||||||
|
echo ""
|
||||||
|
|
||||||
|
wait $wID
|
||||||
|
fi
|
||||||
|
|
||||||
|
|
||||||
|
if [ -n "$OLDDIR" ]; then
|
||||||
|
CURDIR=$(pwd)
|
||||||
|
if [ "$CURDIR" != "$OLDDIR" ]; then
|
||||||
|
cd "$OLDDIR"
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
|
@ -36,6 +36,11 @@ sh language.sh || exit 1
|
||||||
sh build.sh
|
sh build.sh
|
||||||
cd -
|
cd -
|
||||||
|
|
||||||
|
cd ../Plugson
|
||||||
|
sh build.sh
|
||||||
|
sh pack.sh
|
||||||
|
cd -
|
||||||
|
|
||||||
|
|
||||||
LOOP=$(losetup -f)
|
LOOP=$(losetup -f)
|
||||||
|
|
||||||
|
|
@ -112,6 +117,7 @@ cp $OPT ./tool $tmpdir/
|
||||||
rm -f $tmpdir/ENROLL_THIS_KEY_IN_MOKMANAGER.cer
|
rm -f $tmpdir/ENROLL_THIS_KEY_IN_MOKMANAGER.cer
|
||||||
cp $OPT Ventoy2Disk.sh $tmpdir/
|
cp $OPT Ventoy2Disk.sh $tmpdir/
|
||||||
cp $OPT VentoyWeb.sh $tmpdir/
|
cp $OPT VentoyWeb.sh $tmpdir/
|
||||||
|
cp $OPT VentoyPlugson.sh $tmpdir/
|
||||||
cp $OPT VentoyGUI* $tmpdir/
|
cp $OPT VentoyGUI* $tmpdir/
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -121,6 +127,7 @@ cp $OPT CreatePersistentImg.sh $tmpdir/
|
||||||
cp $OPT ExtendPersistentImg.sh $tmpdir/
|
cp $OPT ExtendPersistentImg.sh $tmpdir/
|
||||||
dos2unix -q $tmpdir/Ventoy2Disk.sh
|
dos2unix -q $tmpdir/Ventoy2Disk.sh
|
||||||
dos2unix -q $tmpdir/VentoyWeb.sh
|
dos2unix -q $tmpdir/VentoyWeb.sh
|
||||||
|
dos2unix -q $tmpdir/VentoyPlugson.sh
|
||||||
|
|
||||||
|
|
||||||
dos2unix -q $tmpdir/CreatePersistentImg.sh
|
dos2unix -q $tmpdir/CreatePersistentImg.sh
|
||||||
|
|
@ -159,6 +166,7 @@ find $tmpdir/ -type d -exec chmod 755 "{}" +
|
||||||
find $tmpdir/ -type f -exec chmod 644 "{}" +
|
find $tmpdir/ -type f -exec chmod 644 "{}" +
|
||||||
chmod +x $tmpdir/Ventoy2Disk.sh
|
chmod +x $tmpdir/Ventoy2Disk.sh
|
||||||
chmod +x $tmpdir/VentoyWeb.sh
|
chmod +x $tmpdir/VentoyWeb.sh
|
||||||
|
chmod +x $tmpdir/VentoyPlugson.sh
|
||||||
chmod +x $tmpdir/VentoyGUI*
|
chmod +x $tmpdir/VentoyGUI*
|
||||||
|
|
||||||
cp $OPT $LANG_DIR/languages.json $tmpdir/tool/
|
cp $OPT $LANG_DIR/languages.json $tmpdir/tool/
|
||||||
|
|
@ -174,6 +182,7 @@ tar -czvf ventoy-${curver}-linux.tar.gz $tmpdir
|
||||||
rm -f ventoy-${curver}-windows.zip
|
rm -f ventoy-${curver}-windows.zip
|
||||||
|
|
||||||
cp $OPT Ventoy2Disk.exe $tmpdir/
|
cp $OPT Ventoy2Disk.exe $tmpdir/
|
||||||
|
cp $OPT VentoyPlugson.exe $tmpdir/
|
||||||
cp $OPT FOR_X64_ARM.txt $tmpdir/
|
cp $OPT FOR_X64_ARM.txt $tmpdir/
|
||||||
mkdir -p $tmpdir/altexe
|
mkdir -p $tmpdir/altexe
|
||||||
cp $OPT Ventoy2Disk_*.exe $tmpdir/altexe/
|
cp $OPT Ventoy2Disk_*.exe $tmpdir/altexe/
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,79 @@
|
||||||
|
#!/bin/bash
|
||||||
|
|
||||||
|
if [ "$1" = "sim" ]; then
|
||||||
|
exopt="-DVENTOY_SIM"
|
||||||
|
fi
|
||||||
|
|
||||||
|
build_func() {
|
||||||
|
libsuffix=$2
|
||||||
|
toolDir=$3
|
||||||
|
|
||||||
|
XXFLAG='-std=gnu99 -D_FILE_OFFSET_BITS=64'
|
||||||
|
XXLIB=""
|
||||||
|
|
||||||
|
echo "CC=$1 libsuffix=$libsuffix toolDir=$toolDir"
|
||||||
|
|
||||||
|
echo "CC civetweb.o"
|
||||||
|
$1 $XXFLAG -c -Wall -Wextra -Wshadow -Wformat-security -Winit-self \
|
||||||
|
-Wmissing-prototypes -O2 -DLINUX \
|
||||||
|
-I./src/Lib/libhttp/include \
|
||||||
|
-DNDEBUG -DNO_CGI -DNO_CACHING -DNO_SSL -DSQLITE_DISABLE_LFS -DSSL_ALREADY_INITIALIZED \
|
||||||
|
-DUSE_STACK_SIZE=102400 -DNDEBUG -fPIC \
|
||||||
|
./src/Lib/libhttp/include/civetweb.c \
|
||||||
|
-o ./civetweb.o
|
||||||
|
|
||||||
|
echo "CC plugson.o"
|
||||||
|
$1 $XXFLAG -O2 $exopt -Wall -Wno-unused-function -DSTATIC=static -DINIT= \
|
||||||
|
-I./src \
|
||||||
|
-I./src/Core \
|
||||||
|
-I./src/Web \
|
||||||
|
-I./src/Include \
|
||||||
|
-I./src/Lib/libhttp/include \
|
||||||
|
-I./src/Lib/fat_io_lib/include \
|
||||||
|
-I./src/Lib/xz-embedded/linux/include \
|
||||||
|
-I./src/Lib/xz-embedded/linux/include/linux \
|
||||||
|
-I./src/Lib/xz-embedded/userspace \
|
||||||
|
-I ./src/Lib/exfat/src/libexfat \
|
||||||
|
-I ./src/Lib/exfat/src/mkfs \
|
||||||
|
-I ./src/Lib/fat_io_lib \
|
||||||
|
\
|
||||||
|
-L ./src/Lib/fat_io_lib/lib \
|
||||||
|
src/main_linux.c \
|
||||||
|
src/Core/ventoy_crc32.c \
|
||||||
|
src/Core/ventoy_disk.c \
|
||||||
|
src/Core/ventoy_disk_linux.c \
|
||||||
|
src/Core/ventoy_json.c \
|
||||||
|
src/Core/ventoy_log.c \
|
||||||
|
src/Core/ventoy_md5.c \
|
||||||
|
src/Core/ventoy_util.c \
|
||||||
|
src/Core/ventoy_util_linux.c \
|
||||||
|
src/Web/*.c \
|
||||||
|
src/Lib/xz-embedded/linux/lib/decompress_unxz.c \
|
||||||
|
src/Lib/fat_io_lib/*.c \
|
||||||
|
$XXLIB \
|
||||||
|
-l pthread \
|
||||||
|
./civetweb.o \
|
||||||
|
-o Plugson$libsuffix
|
||||||
|
|
||||||
|
rm -f *.o
|
||||||
|
|
||||||
|
if [ "$libsuffix" = "aa64" ]; then
|
||||||
|
aarch64-linux-gnu-strip Plugson$libsuffix
|
||||||
|
elif [ "$libsuffix" = "m64e" ]; then
|
||||||
|
mips-linux-gnu-strip Plugson$libsuffix
|
||||||
|
else
|
||||||
|
strip Plugson$libsuffix
|
||||||
|
fi
|
||||||
|
|
||||||
|
rm -f ../INSTALL/tool/$toolDir/Plugson
|
||||||
|
cp -a Plugson$libsuffix ../INSTALL/tool/$toolDir/Plugson
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
build_func "gcc" '64' 'x86_64'
|
||||||
|
|
||||||
|
build_func "gcc -m32" '32' 'i386'
|
||||||
|
build_func "aarch64-linux-gnu-gcc" 'aa64' 'aarch64'
|
||||||
|
build_func "mips-linux-gnu-gcc -mips64r2 -mabi=64" 'm64e' 'mips64el'
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,54 @@
|
||||||
|
#!/bin/sh
|
||||||
|
|
||||||
|
output_hex_u32() {
|
||||||
|
hexval=$(printf '%08x' $1)
|
||||||
|
hex_B0=${hexval:0:2}
|
||||||
|
hex_B1=${hexval:2:2}
|
||||||
|
hex_B2=${hexval:4:2}
|
||||||
|
hex_B3=${hexval:6:2}
|
||||||
|
echo -en "\x$hex_B3\x$hex_B2\x$hex_B1\x$hex_B0"
|
||||||
|
}
|
||||||
|
|
||||||
|
if [ -n "$PKG_DATE" ]; then
|
||||||
|
plugson_verion=$PKG_DATE
|
||||||
|
else
|
||||||
|
plugson_verion=$(date '+%Y%m%d %H:%M:%S')
|
||||||
|
fi
|
||||||
|
|
||||||
|
sed "s#.*plugson_build_date.*# <b id=\"plugson_build_date\">$plugson_verion</b>#" -i ./www/index.html
|
||||||
|
|
||||||
|
if [ ! -f ./vs/VentoyPlugson/Release/VentoyPlugson.exe ]; then
|
||||||
|
echo "NO VentoyPlugson.exe found"
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
if [ -f ./www.tar.xz ]; then
|
||||||
|
rm -f ./www.tar.xz
|
||||||
|
fi
|
||||||
|
|
||||||
|
echo -n "$plugson_verion" > ./www/buildtime
|
||||||
|
|
||||||
|
tar cf www.tar www
|
||||||
|
xz --check=crc32 www.tar
|
||||||
|
|
||||||
|
xzdec=$(stat -c '%s' ./www.tar.xz)
|
||||||
|
echo xzdec=$xzdec
|
||||||
|
|
||||||
|
output_hex_u32 0x54535251 > ex.bin
|
||||||
|
output_hex_u32 $xzdec >> ex.bin
|
||||||
|
output_hex_u32 0xa4a3a2a1 >> ex.bin
|
||||||
|
|
||||||
|
cat ./vs/VentoyPlugson/Release/VentoyPlugson.exe ./www.tar.xz ex.bin > VentoyPlugson.exe
|
||||||
|
rm -f ./ex.bin
|
||||||
|
|
||||||
|
rm -f ../INSTALL/VentoyPlugson.exe
|
||||||
|
cp -a ./VentoyPlugson.exe ../INSTALL/VentoyPlugson.exe
|
||||||
|
|
||||||
|
rm -f ../INSTALL/tool/plugson.tar.xz
|
||||||
|
mv ./www.tar.xz ../INSTALL/tool/plugson.tar.xz
|
||||||
|
|
||||||
|
echo ""
|
||||||
|
echo "========= SUCCESS ==========="
|
||||||
|
echo ""
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,304 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* crc32.c ---- ventoy crc32
|
||||||
|
*
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
#include <Windows.h>
|
||||||
|
#define uint32_t UINT32
|
||||||
|
#else
|
||||||
|
#include <unistd.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
static uint32_t g_crc_table[256] = {
|
||||||
|
0x00000000,
|
||||||
|
0x77073096,
|
||||||
|
0xEE0E612C,
|
||||||
|
0x990951BA,
|
||||||
|
0x076DC419,
|
||||||
|
0x706AF48F,
|
||||||
|
0xE963A535,
|
||||||
|
0x9E6495A3,
|
||||||
|
0x0EDB8832,
|
||||||
|
0x79DCB8A4,
|
||||||
|
0xE0D5E91E,
|
||||||
|
0x97D2D988,
|
||||||
|
0x09B64C2B,
|
||||||
|
0x7EB17CBD,
|
||||||
|
0xE7B82D07,
|
||||||
|
0x90BF1D91,
|
||||||
|
0x1DB71064,
|
||||||
|
0x6AB020F2,
|
||||||
|
0xF3B97148,
|
||||||
|
0x84BE41DE,
|
||||||
|
0x1ADAD47D,
|
||||||
|
0x6DDDE4EB,
|
||||||
|
0xF4D4B551,
|
||||||
|
0x83D385C7,
|
||||||
|
0x136C9856,
|
||||||
|
0x646BA8C0,
|
||||||
|
0xFD62F97A,
|
||||||
|
0x8A65C9EC,
|
||||||
|
0x14015C4F,
|
||||||
|
0x63066CD9,
|
||||||
|
0xFA0F3D63,
|
||||||
|
0x8D080DF5,
|
||||||
|
0x3B6E20C8,
|
||||||
|
0x4C69105E,
|
||||||
|
0xD56041E4,
|
||||||
|
0xA2677172,
|
||||||
|
0x3C03E4D1,
|
||||||
|
0x4B04D447,
|
||||||
|
0xD20D85FD,
|
||||||
|
0xA50AB56B,
|
||||||
|
0x35B5A8FA,
|
||||||
|
0x42B2986C,
|
||||||
|
0xDBBBC9D6,
|
||||||
|
0xACBCF940,
|
||||||
|
0x32D86CE3,
|
||||||
|
0x45DF5C75,
|
||||||
|
0xDCD60DCF,
|
||||||
|
0xABD13D59,
|
||||||
|
0x26D930AC,
|
||||||
|
0x51DE003A,
|
||||||
|
0xC8D75180,
|
||||||
|
0xBFD06116,
|
||||||
|
0x21B4F4B5,
|
||||||
|
0x56B3C423,
|
||||||
|
0xCFBA9599,
|
||||||
|
0xB8BDA50F,
|
||||||
|
0x2802B89E,
|
||||||
|
0x5F058808,
|
||||||
|
0xC60CD9B2,
|
||||||
|
0xB10BE924,
|
||||||
|
0x2F6F7C87,
|
||||||
|
0x58684C11,
|
||||||
|
0xC1611DAB,
|
||||||
|
0xB6662D3D,
|
||||||
|
0x76DC4190,
|
||||||
|
0x01DB7106,
|
||||||
|
0x98D220BC,
|
||||||
|
0xEFD5102A,
|
||||||
|
0x71B18589,
|
||||||
|
0x06B6B51F,
|
||||||
|
0x9FBFE4A5,
|
||||||
|
0xE8B8D433,
|
||||||
|
0x7807C9A2,
|
||||||
|
0x0F00F934,
|
||||||
|
0x9609A88E,
|
||||||
|
0xE10E9818,
|
||||||
|
0x7F6A0DBB,
|
||||||
|
0x086D3D2D,
|
||||||
|
0x91646C97,
|
||||||
|
0xE6635C01,
|
||||||
|
0x6B6B51F4,
|
||||||
|
0x1C6C6162,
|
||||||
|
0x856530D8,
|
||||||
|
0xF262004E,
|
||||||
|
0x6C0695ED,
|
||||||
|
0x1B01A57B,
|
||||||
|
0x8208F4C1,
|
||||||
|
0xF50FC457,
|
||||||
|
0x65B0D9C6,
|
||||||
|
0x12B7E950,
|
||||||
|
0x8BBEB8EA,
|
||||||
|
0xFCB9887C,
|
||||||
|
0x62DD1DDF,
|
||||||
|
0x15DA2D49,
|
||||||
|
0x8CD37CF3,
|
||||||
|
0xFBD44C65,
|
||||||
|
0x4DB26158,
|
||||||
|
0x3AB551CE,
|
||||||
|
0xA3BC0074,
|
||||||
|
0xD4BB30E2,
|
||||||
|
0x4ADFA541,
|
||||||
|
0x3DD895D7,
|
||||||
|
0xA4D1C46D,
|
||||||
|
0xD3D6F4FB,
|
||||||
|
0x4369E96A,
|
||||||
|
0x346ED9FC,
|
||||||
|
0xAD678846,
|
||||||
|
0xDA60B8D0,
|
||||||
|
0x44042D73,
|
||||||
|
0x33031DE5,
|
||||||
|
0xAA0A4C5F,
|
||||||
|
0xDD0D7CC9,
|
||||||
|
0x5005713C,
|
||||||
|
0x270241AA,
|
||||||
|
0xBE0B1010,
|
||||||
|
0xC90C2086,
|
||||||
|
0x5768B525,
|
||||||
|
0x206F85B3,
|
||||||
|
0xB966D409,
|
||||||
|
0xCE61E49F,
|
||||||
|
0x5EDEF90E,
|
||||||
|
0x29D9C998,
|
||||||
|
0xB0D09822,
|
||||||
|
0xC7D7A8B4,
|
||||||
|
0x59B33D17,
|
||||||
|
0x2EB40D81,
|
||||||
|
0xB7BD5C3B,
|
||||||
|
0xC0BA6CAD,
|
||||||
|
0xEDB88320,
|
||||||
|
0x9ABFB3B6,
|
||||||
|
0x03B6E20C,
|
||||||
|
0x74B1D29A,
|
||||||
|
0xEAD54739,
|
||||||
|
0x9DD277AF,
|
||||||
|
0x04DB2615,
|
||||||
|
0x73DC1683,
|
||||||
|
0xE3630B12,
|
||||||
|
0x94643B84,
|
||||||
|
0x0D6D6A3E,
|
||||||
|
0x7A6A5AA8,
|
||||||
|
0xE40ECF0B,
|
||||||
|
0x9309FF9D,
|
||||||
|
0x0A00AE27,
|
||||||
|
0x7D079EB1,
|
||||||
|
0xF00F9344,
|
||||||
|
0x8708A3D2,
|
||||||
|
0x1E01F268,
|
||||||
|
0x6906C2FE,
|
||||||
|
0xF762575D,
|
||||||
|
0x806567CB,
|
||||||
|
0x196C3671,
|
||||||
|
0x6E6B06E7,
|
||||||
|
0xFED41B76,
|
||||||
|
0x89D32BE0,
|
||||||
|
0x10DA7A5A,
|
||||||
|
0x67DD4ACC,
|
||||||
|
0xF9B9DF6F,
|
||||||
|
0x8EBEEFF9,
|
||||||
|
0x17B7BE43,
|
||||||
|
0x60B08ED5,
|
||||||
|
0xD6D6A3E8,
|
||||||
|
0xA1D1937E,
|
||||||
|
0x38D8C2C4,
|
||||||
|
0x4FDFF252,
|
||||||
|
0xD1BB67F1,
|
||||||
|
0xA6BC5767,
|
||||||
|
0x3FB506DD,
|
||||||
|
0x48B2364B,
|
||||||
|
0xD80D2BDA,
|
||||||
|
0xAF0A1B4C,
|
||||||
|
0x36034AF6,
|
||||||
|
0x41047A60,
|
||||||
|
0xDF60EFC3,
|
||||||
|
0xA867DF55,
|
||||||
|
0x316E8EEF,
|
||||||
|
0x4669BE79,
|
||||||
|
0xCB61B38C,
|
||||||
|
0xBC66831A,
|
||||||
|
0x256FD2A0,
|
||||||
|
0x5268E236,
|
||||||
|
0xCC0C7795,
|
||||||
|
0xBB0B4703,
|
||||||
|
0x220216B9,
|
||||||
|
0x5505262F,
|
||||||
|
0xC5BA3BBE,
|
||||||
|
0xB2BD0B28,
|
||||||
|
0x2BB45A92,
|
||||||
|
0x5CB36A04,
|
||||||
|
0xC2D7FFA7,
|
||||||
|
0xB5D0CF31,
|
||||||
|
0x2CD99E8B,
|
||||||
|
0x5BDEAE1D,
|
||||||
|
0x9B64C2B0,
|
||||||
|
0xEC63F226,
|
||||||
|
0x756AA39C,
|
||||||
|
0x026D930A,
|
||||||
|
0x9C0906A9,
|
||||||
|
0xEB0E363F,
|
||||||
|
0x72076785,
|
||||||
|
0x05005713,
|
||||||
|
0x95BF4A82,
|
||||||
|
0xE2B87A14,
|
||||||
|
0x7BB12BAE,
|
||||||
|
0x0CB61B38,
|
||||||
|
0x92D28E9B,
|
||||||
|
0xE5D5BE0D,
|
||||||
|
0x7CDCEFB7,
|
||||||
|
0x0BDBDF21,
|
||||||
|
0x86D3D2D4,
|
||||||
|
0xF1D4E242,
|
||||||
|
0x68DDB3F8,
|
||||||
|
0x1FDA836E,
|
||||||
|
0x81BE16CD,
|
||||||
|
0xF6B9265B,
|
||||||
|
0x6FB077E1,
|
||||||
|
0x18B74777,
|
||||||
|
0x88085AE6,
|
||||||
|
0xFF0F6A70,
|
||||||
|
0x66063BCA,
|
||||||
|
0x11010B5C,
|
||||||
|
0x8F659EFF,
|
||||||
|
0xF862AE69,
|
||||||
|
0x616BFFD3,
|
||||||
|
0x166CCF45,
|
||||||
|
0xA00AE278,
|
||||||
|
0xD70DD2EE,
|
||||||
|
0x4E048354,
|
||||||
|
0x3903B3C2,
|
||||||
|
0xA7672661,
|
||||||
|
0xD06016F7,
|
||||||
|
0x4969474D,
|
||||||
|
0x3E6E77DB,
|
||||||
|
0xAED16A4A,
|
||||||
|
0xD9D65ADC,
|
||||||
|
0x40DF0B66,
|
||||||
|
0x37D83BF0,
|
||||||
|
0xA9BCAE53,
|
||||||
|
0xDEBB9EC5,
|
||||||
|
0x47B2CF7F,
|
||||||
|
0x30B5FFE9,
|
||||||
|
0xBDBDF21C,
|
||||||
|
0xCABAC28A,
|
||||||
|
0x53B39330,
|
||||||
|
0x24B4A3A6,
|
||||||
|
0xBAD03605,
|
||||||
|
0xCDD70693,
|
||||||
|
0x54DE5729,
|
||||||
|
0x23D967BF,
|
||||||
|
0xB3667A2E,
|
||||||
|
0xC4614AB8,
|
||||||
|
0x5D681B02,
|
||||||
|
0x2A6F2B94,
|
||||||
|
0xB40BBE37,
|
||||||
|
0xC30C8EA1,
|
||||||
|
0x5A05DF1B,
|
||||||
|
0x2D02EF8D
|
||||||
|
};
|
||||||
|
|
||||||
|
uint32_t ventoy_crc32(void *Buffer, uint32_t Length)
|
||||||
|
{
|
||||||
|
uint32_t i;
|
||||||
|
uint8_t *Ptr = Buffer;
|
||||||
|
uint32_t Crc = 0xFFFFFFFF;
|
||||||
|
|
||||||
|
for (i = 0; i < Length; i++, Ptr++)
|
||||||
|
{
|
||||||
|
Crc = (Crc >> 8) ^ g_crc_table[(uint8_t) Crc ^ *Ptr];
|
||||||
|
}
|
||||||
|
|
||||||
|
return Crc ^ 0xffffffff;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
@ -0,0 +1,207 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_define.h
|
||||||
|
*
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#ifndef __VENTOY_DEFINE_H__
|
||||||
|
#define __VENTOY_DEFINE_H__
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
#include <windows.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#else
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <stdarg.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <pthread.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <linux/limits.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define LOG_FILE "VentoyPlugson.log"
|
||||||
|
|
||||||
|
#define SIZE_1MB 1048576
|
||||||
|
#define SIZE_1GB 1073741824
|
||||||
|
#define JSON_BUF_MAX (8 * SIZE_1MB)
|
||||||
|
#define TAR_BUF_MAX (8 * SIZE_1MB)
|
||||||
|
|
||||||
|
#define VTOYIMG_PART_START_BYTES (1024 * 1024)
|
||||||
|
#define VTOYIMG_PART_START_SECTOR 2048
|
||||||
|
|
||||||
|
#define VTOYEFI_PART_BYTES (32 * 1024 * 1024)
|
||||||
|
#define VTOYEFI_PART_SECTORS 65536
|
||||||
|
|
||||||
|
|
||||||
|
#pragma pack(1)
|
||||||
|
|
||||||
|
typedef struct vtoy_guid
|
||||||
|
{
|
||||||
|
uint32_t data1;
|
||||||
|
uint16_t data2;
|
||||||
|
uint16_t data3;
|
||||||
|
uint8_t data4[8];
|
||||||
|
}vtoy_guid;
|
||||||
|
|
||||||
|
typedef struct PART_TABLE
|
||||||
|
{
|
||||||
|
uint8_t Active; // 0x00 0x80
|
||||||
|
|
||||||
|
uint8_t StartHead;
|
||||||
|
uint16_t StartSector : 6;
|
||||||
|
uint16_t StartCylinder : 10;
|
||||||
|
|
||||||
|
uint8_t FsFlag;
|
||||||
|
|
||||||
|
uint8_t EndHead;
|
||||||
|
uint16_t EndSector : 6;
|
||||||
|
uint16_t EndCylinder : 10;
|
||||||
|
|
||||||
|
uint32_t StartSectorId;
|
||||||
|
uint32_t SectorCount;
|
||||||
|
}PART_TABLE;
|
||||||
|
|
||||||
|
typedef struct MBR_HEAD
|
||||||
|
{
|
||||||
|
uint8_t BootCode[446];
|
||||||
|
PART_TABLE PartTbl[4];
|
||||||
|
uint8_t Byte55;
|
||||||
|
uint8_t ByteAA;
|
||||||
|
}MBR_HEAD;
|
||||||
|
|
||||||
|
typedef struct VTOY_GPT_HDR
|
||||||
|
{
|
||||||
|
char Signature[8]; /* EFI PART */
|
||||||
|
uint8_t Version[4];
|
||||||
|
uint32_t Length;
|
||||||
|
uint32_t Crc;
|
||||||
|
uint8_t Reserved1[4];
|
||||||
|
uint64_t EfiStartLBA;
|
||||||
|
uint64_t EfiBackupLBA;
|
||||||
|
uint64_t PartAreaStartLBA;
|
||||||
|
uint64_t PartAreaEndLBA;
|
||||||
|
vtoy_guid DiskGuid;
|
||||||
|
uint64_t PartTblStartLBA;
|
||||||
|
uint32_t PartTblTotNum;
|
||||||
|
uint32_t PartTblEntryLen;
|
||||||
|
uint32_t PartTblCrc;
|
||||||
|
uint8_t Reserved2[420];
|
||||||
|
}VTOY_GPT_HDR;
|
||||||
|
|
||||||
|
typedef struct VTOY_GPT_PART_TBL
|
||||||
|
{
|
||||||
|
vtoy_guid PartType;
|
||||||
|
vtoy_guid PartGuid;
|
||||||
|
uint64_t StartLBA;
|
||||||
|
uint64_t LastLBA;
|
||||||
|
uint64_t Attr;
|
||||||
|
uint16_t Name[36];
|
||||||
|
}VTOY_GPT_PART_TBL;
|
||||||
|
|
||||||
|
typedef struct VTOY_GPT_INFO
|
||||||
|
{
|
||||||
|
MBR_HEAD MBR;
|
||||||
|
VTOY_GPT_HDR Head;
|
||||||
|
VTOY_GPT_PART_TBL PartTbl[128];
|
||||||
|
}VTOY_GPT_INFO;
|
||||||
|
#pragma pack()
|
||||||
|
|
||||||
|
|
||||||
|
#define MBR_PART_STYLE 0
|
||||||
|
#define GPT_PART_STYLE 1
|
||||||
|
|
||||||
|
#pragma pack(1)
|
||||||
|
typedef struct ventoy_guid
|
||||||
|
{
|
||||||
|
uint32_t data1;
|
||||||
|
uint16_t data2;
|
||||||
|
uint16_t data3;
|
||||||
|
uint8_t data4[8];
|
||||||
|
}ventoy_guid;
|
||||||
|
#pragma pack()
|
||||||
|
|
||||||
|
#ifndef O_BINARY
|
||||||
|
#define O_BINARY 0
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define VLOG_LOG 1
|
||||||
|
#define VLOG_DEBUG 2
|
||||||
|
|
||||||
|
#define ulong unsigned long
|
||||||
|
#define _ll long long
|
||||||
|
#define _ull unsigned long long
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
#define strlcpy(dst, src) strcpy_s(dst, sizeof(dst), src)
|
||||||
|
#define scnprintf(dst, len, fmt, ...) sprintf_s(dst, len, fmt, ##__VA_ARGS__)
|
||||||
|
|
||||||
|
#define vlog(fmt, ...) ventoy_syslog(VLOG_LOG, fmt, ##__VA_ARGS__)
|
||||||
|
#define vdebug(fmt, ...) ventoy_syslog(VLOG_DEBUG, fmt, ##__VA_ARGS__)
|
||||||
|
|
||||||
|
#define localtime_r(a,b) localtime_s(b,a)
|
||||||
|
|
||||||
|
#define LASTERR GetLastError()
|
||||||
|
|
||||||
|
#define CHECK_CLOSE_HANDLE(Handle) \
|
||||||
|
{\
|
||||||
|
if (Handle != INVALID_HANDLE_VALUE) \
|
||||||
|
{\
|
||||||
|
CloseHandle(Handle); \
|
||||||
|
Handle = INVALID_HANDLE_VALUE; \
|
||||||
|
}\
|
||||||
|
}
|
||||||
|
|
||||||
|
#else
|
||||||
|
#define strlcpy(dst, src) strncpy(dst, src, sizeof(dst) - 1)
|
||||||
|
#define scnprintf(dst, len, fmt, args...) snprintf(dst, len, fmt, ##args)
|
||||||
|
|
||||||
|
#define vlog(fmt, args...) ventoy_syslog(VLOG_LOG, fmt, ##args)
|
||||||
|
#define vdebug(fmt, args...) ventoy_syslog(VLOG_DEBUG, fmt, ##args)
|
||||||
|
|
||||||
|
#define MAX_PATH PATH_MAX
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define CHECK_FREE(p) \
|
||||||
|
{\
|
||||||
|
if (p)\
|
||||||
|
{\
|
||||||
|
free(p); \
|
||||||
|
(p) = NULL; \
|
||||||
|
}\
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_syslog(int level, const char *Fmt, ...);
|
||||||
|
void ventoy_set_loglevel(int level);
|
||||||
|
uint32_t ventoy_crc32(void *Buffer, uint32_t Length);
|
||||||
|
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
static __inline void * zalloc(size_t n)
|
||||||
|
#else
|
||||||
|
static inline void * zalloc(size_t n)
|
||||||
|
#endif
|
||||||
|
{
|
||||||
|
void *p = malloc(n);
|
||||||
|
if (p) memset(p, 0, n);
|
||||||
|
return p;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
#endif /* __VENTOY_DEFINE_H__ */
|
||||||
|
|
||||||
|
|
@ -0,0 +1,24 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_disk.c ---- ventoy disk
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <string.h>
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,166 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_disk.h
|
||||||
|
*
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#ifndef __VENTOY_DISK_H__
|
||||||
|
#define __VENTOY_DISK_H__
|
||||||
|
|
||||||
|
#define MAX_DISK 256
|
||||||
|
typedef struct ventoy_disk
|
||||||
|
{
|
||||||
|
char devname[64];
|
||||||
|
|
||||||
|
int pathcase;
|
||||||
|
char cur_fsname[64];
|
||||||
|
char cur_capacity[64];
|
||||||
|
char cur_model[256];
|
||||||
|
char cur_ventoy_ver[64];
|
||||||
|
int cur_secureboot;
|
||||||
|
int cur_part_style;
|
||||||
|
|
||||||
|
}ventoy_disk;
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#else
|
||||||
|
|
||||||
|
typedef enum
|
||||||
|
{
|
||||||
|
VTOY_DEVICE_UNKNOWN = 0,
|
||||||
|
VTOY_DEVICE_SCSI,
|
||||||
|
VTOY_DEVICE_USB,
|
||||||
|
VTOY_DEVICE_IDE,
|
||||||
|
VTOY_DEVICE_DAC960,
|
||||||
|
VTOY_DEVICE_CPQARRAY,
|
||||||
|
VTOY_DEVICE_FILE,
|
||||||
|
VTOY_DEVICE_ATARAID,
|
||||||
|
VTOY_DEVICE_I2O,
|
||||||
|
VTOY_DEVICE_UBD,
|
||||||
|
VTOY_DEVICE_DASD,
|
||||||
|
VTOY_DEVICE_VIODASD,
|
||||||
|
VTOY_DEVICE_SX8,
|
||||||
|
VTOY_DEVICE_DM,
|
||||||
|
VTOY_DEVICE_XVD,
|
||||||
|
VTOY_DEVICE_SDMMC,
|
||||||
|
VTOY_DEVICE_VIRTBLK,
|
||||||
|
VTOY_DEVICE_AOE,
|
||||||
|
VTOY_DEVICE_MD,
|
||||||
|
VTOY_DEVICE_LOOP,
|
||||||
|
VTOY_DEVICE_NVME,
|
||||||
|
VTOY_DEVICE_RAM,
|
||||||
|
VTOY_DEVICE_PMEM,
|
||||||
|
|
||||||
|
VTOY_DEVICE_END
|
||||||
|
}ventoy_dev_type;
|
||||||
|
|
||||||
|
/* from <linux/major.h> */
|
||||||
|
#define IDE0_MAJOR 3
|
||||||
|
#define IDE1_MAJOR 22
|
||||||
|
#define IDE2_MAJOR 33
|
||||||
|
#define IDE3_MAJOR 34
|
||||||
|
#define IDE4_MAJOR 56
|
||||||
|
#define IDE5_MAJOR 57
|
||||||
|
#define SCSI_CDROM_MAJOR 11
|
||||||
|
#define SCSI_DISK0_MAJOR 8
|
||||||
|
#define SCSI_DISK1_MAJOR 65
|
||||||
|
#define SCSI_DISK2_MAJOR 66
|
||||||
|
#define SCSI_DISK3_MAJOR 67
|
||||||
|
#define SCSI_DISK4_MAJOR 68
|
||||||
|
#define SCSI_DISK5_MAJOR 69
|
||||||
|
#define SCSI_DISK6_MAJOR 70
|
||||||
|
#define SCSI_DISK7_MAJOR 71
|
||||||
|
#define SCSI_DISK8_MAJOR 128
|
||||||
|
#define SCSI_DISK9_MAJOR 129
|
||||||
|
#define SCSI_DISK10_MAJOR 130
|
||||||
|
#define SCSI_DISK11_MAJOR 131
|
||||||
|
#define SCSI_DISK12_MAJOR 132
|
||||||
|
#define SCSI_DISK13_MAJOR 133
|
||||||
|
#define SCSI_DISK14_MAJOR 134
|
||||||
|
#define SCSI_DISK15_MAJOR 135
|
||||||
|
#define COMPAQ_SMART2_MAJOR 72
|
||||||
|
#define COMPAQ_SMART2_MAJOR1 73
|
||||||
|
#define COMPAQ_SMART2_MAJOR2 74
|
||||||
|
#define COMPAQ_SMART2_MAJOR3 75
|
||||||
|
#define COMPAQ_SMART2_MAJOR4 76
|
||||||
|
#define COMPAQ_SMART2_MAJOR5 77
|
||||||
|
#define COMPAQ_SMART2_MAJOR6 78
|
||||||
|
#define COMPAQ_SMART2_MAJOR7 79
|
||||||
|
#define COMPAQ_SMART_MAJOR 104
|
||||||
|
#define COMPAQ_SMART_MAJOR1 105
|
||||||
|
#define COMPAQ_SMART_MAJOR2 106
|
||||||
|
#define COMPAQ_SMART_MAJOR3 107
|
||||||
|
#define COMPAQ_SMART_MAJOR4 108
|
||||||
|
#define COMPAQ_SMART_MAJOR5 109
|
||||||
|
#define COMPAQ_SMART_MAJOR6 110
|
||||||
|
#define COMPAQ_SMART_MAJOR7 111
|
||||||
|
#define DAC960_MAJOR 48
|
||||||
|
#define ATARAID_MAJOR 114
|
||||||
|
#define I2O_MAJOR1 80
|
||||||
|
#define I2O_MAJOR2 81
|
||||||
|
#define I2O_MAJOR3 82
|
||||||
|
#define I2O_MAJOR4 83
|
||||||
|
#define I2O_MAJOR5 84
|
||||||
|
#define I2O_MAJOR6 85
|
||||||
|
#define I2O_MAJOR7 86
|
||||||
|
#define I2O_MAJOR8 87
|
||||||
|
#define UBD_MAJOR 98
|
||||||
|
#define DASD_MAJOR 94
|
||||||
|
#define VIODASD_MAJOR 112
|
||||||
|
#define AOE_MAJOR 152
|
||||||
|
#define SX8_MAJOR1 160
|
||||||
|
#define SX8_MAJOR2 161
|
||||||
|
#define XVD_MAJOR 202
|
||||||
|
#define SDMMC_MAJOR 179
|
||||||
|
#define LOOP_MAJOR 7
|
||||||
|
#define MD_MAJOR 9
|
||||||
|
#define BLKEXT_MAJOR 259
|
||||||
|
#define RAM_MAJOR 1
|
||||||
|
|
||||||
|
#define SCSI_BLK_MAJOR(M) ( \
|
||||||
|
(M) == SCSI_DISK0_MAJOR \
|
||||||
|
|| (M) == SCSI_CDROM_MAJOR \
|
||||||
|
|| ((M) >= SCSI_DISK1_MAJOR && (M) <= SCSI_DISK7_MAJOR) \
|
||||||
|
|| ((M) >= SCSI_DISK8_MAJOR && (M) <= SCSI_DISK15_MAJOR))
|
||||||
|
|
||||||
|
#define IDE_BLK_MAJOR(M) \
|
||||||
|
((M) == IDE0_MAJOR || \
|
||||||
|
(M) == IDE1_MAJOR || \
|
||||||
|
(M) == IDE2_MAJOR || \
|
||||||
|
(M) == IDE3_MAJOR || \
|
||||||
|
(M) == IDE4_MAJOR || \
|
||||||
|
(M) == IDE5_MAJOR)
|
||||||
|
|
||||||
|
#define SX8_BLK_MAJOR(M) ((M) >= SX8_MAJOR1 && (M) <= SX8_MAJOR2)
|
||||||
|
#define I2O_BLK_MAJOR(M) ((M) >= I2O_MAJOR1 && (M) <= I2O_MAJOR8)
|
||||||
|
#define CPQARRAY_BLK_MAJOR(M) \
|
||||||
|
(((M) >= COMPAQ_SMART2_MAJOR && (M) <= COMPAQ_SMART2_MAJOR7) || \
|
||||||
|
(COMPAQ_SMART_MAJOR <= (M) && (M) <= COMPAQ_SMART_MAJOR7))
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
||||||
|
int ventoy_disk_init(void);
|
||||||
|
void ventoy_disk_exit(void);
|
||||||
|
int ventoy_get_disk_info(char **argv);
|
||||||
|
const ventoy_disk * ventoy_get_disk_list(int *num);
|
||||||
|
const ventoy_disk * ventoy_get_disk_node(int id);
|
||||||
|
int CheckRuntimeEnvironment(char Letter, ventoy_disk *disk);
|
||||||
|
|
||||||
|
#endif /* __VENTOY_DISK_H__ */
|
||||||
|
|
||||||
|
|
@ -0,0 +1,607 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_disk.c ---- ventoy disk
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#include <ctype.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <fcntl.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <sys/ioctl.h>
|
||||||
|
#include <sys/stat.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <linux/fs.h>
|
||||||
|
#include <dirent.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <ventoy_define.h>
|
||||||
|
#include <ventoy_disk.h>
|
||||||
|
#include <ventoy_util.h>
|
||||||
|
#include <fat_filelib.h>
|
||||||
|
|
||||||
|
static int g_fatlib_media_fd = 0;
|
||||||
|
static uint64_t g_fatlib_media_offset = 0;
|
||||||
|
|
||||||
|
static const char *g_ventoy_dev_type_str[VTOY_DEVICE_END] =
|
||||||
|
{
|
||||||
|
"unknown", "scsi", "USB", "ide", "dac960",
|
||||||
|
"cpqarray", "file", "ataraid", "i2o",
|
||||||
|
"ubd", "dasd", "viodasd", "sx8", "dm",
|
||||||
|
"xvd", "sd/mmc", "virtblk", "aoe",
|
||||||
|
"md", "loopback", "nvme", "brd", "pmem"
|
||||||
|
};
|
||||||
|
|
||||||
|
static const char * ventoy_get_dev_type_name(ventoy_dev_type type)
|
||||||
|
{
|
||||||
|
return (type < VTOY_DEVICE_END) ? g_ventoy_dev_type_str[type] : "unknown";
|
||||||
|
}
|
||||||
|
|
||||||
|
static int ventoy_check_blk_major(int major, const char *type)
|
||||||
|
{
|
||||||
|
int flag = 0;
|
||||||
|
int valid = 0;
|
||||||
|
int devnum = 0;
|
||||||
|
int len = 0;
|
||||||
|
char line[64];
|
||||||
|
char *pos = NULL;
|
||||||
|
FILE *fp = NULL;
|
||||||
|
|
||||||
|
fp = fopen("/proc/devices", "r");
|
||||||
|
if (!fp)
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
len = (int)strlen(type);
|
||||||
|
while (fgets(line, sizeof(line), fp))
|
||||||
|
{
|
||||||
|
if (flag)
|
||||||
|
{
|
||||||
|
pos = strchr(line, ' ');
|
||||||
|
if (pos)
|
||||||
|
{
|
||||||
|
devnum = (int)strtol(line, NULL, 10);
|
||||||
|
if (devnum == major)
|
||||||
|
{
|
||||||
|
if (strncmp(pos + 1, type, len) == 0)
|
||||||
|
{
|
||||||
|
valid = 1;
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else if (strncmp(line, "Block devices:", 14) == 0)
|
||||||
|
{
|
||||||
|
flag = 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fclose(fp);
|
||||||
|
return valid;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int ventoy_get_disk_devnum(const char *name, int *major, int* minor)
|
||||||
|
{
|
||||||
|
int rc;
|
||||||
|
char *pos;
|
||||||
|
char devnum[16] = {0};
|
||||||
|
|
||||||
|
rc = ventoy_get_sys_file_line(devnum, sizeof(devnum), "/sys/block/%s/dev", name);
|
||||||
|
if (rc)
|
||||||
|
{
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
pos = strstr(devnum, ":");
|
||||||
|
if (!pos)
|
||||||
|
{
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
*major = (int)strtol(devnum, NULL, 10);
|
||||||
|
*minor = (int)strtol(pos + 1, NULL, 10);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static ventoy_dev_type ventoy_get_dev_type(const char *name, int major, int minor)
|
||||||
|
{
|
||||||
|
int rc;
|
||||||
|
char syspath[128];
|
||||||
|
char dstpath[256];
|
||||||
|
|
||||||
|
memset(syspath, 0, sizeof(syspath));
|
||||||
|
memset(dstpath, 0, sizeof(dstpath));
|
||||||
|
|
||||||
|
scnprintf(syspath, sizeof(syspath), "/sys/block/%s", name);
|
||||||
|
rc = readlink(syspath, dstpath, sizeof(dstpath) - 1);
|
||||||
|
if (rc > 0 && strstr(dstpath, "/usb"))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_USB;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (SCSI_BLK_MAJOR(major) && (minor % 0x10 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_SCSI;
|
||||||
|
}
|
||||||
|
else if (IDE_BLK_MAJOR(major) && (minor % 0x40 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_IDE;
|
||||||
|
}
|
||||||
|
else if (major == DAC960_MAJOR && (minor % 0x8 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_DAC960;
|
||||||
|
}
|
||||||
|
else if (major == ATARAID_MAJOR && (minor % 0x10 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_ATARAID;
|
||||||
|
}
|
||||||
|
else if (major == AOE_MAJOR && (minor % 0x10 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_AOE;
|
||||||
|
}
|
||||||
|
else if (major == DASD_MAJOR && (minor % 0x4 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_DASD;
|
||||||
|
}
|
||||||
|
else if (major == VIODASD_MAJOR && (minor % 0x8 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_VIODASD;
|
||||||
|
}
|
||||||
|
else if (SX8_BLK_MAJOR(major) && (minor % 0x20 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_SX8;
|
||||||
|
}
|
||||||
|
else if (I2O_BLK_MAJOR(major) && (minor % 0x10 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_I2O;
|
||||||
|
}
|
||||||
|
else if (CPQARRAY_BLK_MAJOR(major) && (minor % 0x10 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_CPQARRAY;
|
||||||
|
}
|
||||||
|
else if (UBD_MAJOR == major && (minor % 0x10 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_UBD;
|
||||||
|
}
|
||||||
|
else if (XVD_MAJOR == major && (minor % 0x10 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_XVD;
|
||||||
|
}
|
||||||
|
else if (SDMMC_MAJOR == major && (minor % 0x8 == 0))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_SDMMC;
|
||||||
|
}
|
||||||
|
else if (ventoy_check_blk_major(major, "virtblk"))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_VIRTBLK;
|
||||||
|
}
|
||||||
|
else if (major == LOOP_MAJOR)
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_LOOP;
|
||||||
|
}
|
||||||
|
else if (major == MD_MAJOR)
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_MD;
|
||||||
|
}
|
||||||
|
else if (major == RAM_MAJOR)
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_RAM;
|
||||||
|
}
|
||||||
|
else if (strstr(name, "nvme") && ventoy_check_blk_major(major, "blkext"))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_NVME;
|
||||||
|
}
|
||||||
|
else if (strstr(name, "pmem") && ventoy_check_blk_major(major, "blkext"))
|
||||||
|
{
|
||||||
|
return VTOY_DEVICE_PMEM;
|
||||||
|
}
|
||||||
|
|
||||||
|
return VTOY_DEVICE_END;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int ventoy_is_possible_blkdev(const char *name)
|
||||||
|
{
|
||||||
|
if (name[0] == '.')
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* /dev/ramX */
|
||||||
|
if (name[0] == 'r' && name[1] == 'a' && name[2] == 'm')
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* /dev/zramX */
|
||||||
|
if (name[0] == 'z' && name[1] == 'r' && name[2] == 'a' && name[3] == 'm')
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* /dev/loopX */
|
||||||
|
if (name[0] == 'l' && name[1] == 'o' && name[2] == 'o' && name[3] == 'p')
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* /dev/dm-X */
|
||||||
|
if (name[0] == 'd' && name[1] == 'm' && name[2] == '-' && isdigit(name[3]))
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* /dev/srX */
|
||||||
|
if (name[0] == 's' && name[1] == 'r' && isdigit(name[2]))
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
uint64_t ventoy_get_disk_size_in_byte(const char *disk)
|
||||||
|
{
|
||||||
|
int fd;
|
||||||
|
int rc;
|
||||||
|
unsigned long long size = 0;
|
||||||
|
char diskpath[256] = {0};
|
||||||
|
char sizebuf[64] = {0};
|
||||||
|
|
||||||
|
// Try 1: get size from sysfs
|
||||||
|
scnprintf(diskpath, sizeof(diskpath) - 1, "/sys/block/%s/size", disk);
|
||||||
|
if (access(diskpath, F_OK) >= 0)
|
||||||
|
{
|
||||||
|
vdebug("get disk size from sysfs for %s\n", disk);
|
||||||
|
|
||||||
|
fd = open(diskpath, O_RDONLY | O_BINARY);
|
||||||
|
if (fd >= 0)
|
||||||
|
{
|
||||||
|
read(fd, sizebuf, sizeof(sizebuf));
|
||||||
|
size = strtoull(sizebuf, NULL, 10);
|
||||||
|
close(fd);
|
||||||
|
return (uint64_t)(size * 512);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vdebug("%s not exist \n", diskpath);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Try 2: get size from ioctl
|
||||||
|
scnprintf(diskpath, sizeof(diskpath) - 1, "/dev/%s", disk);
|
||||||
|
fd = open(diskpath, O_RDONLY);
|
||||||
|
if (fd >= 0)
|
||||||
|
{
|
||||||
|
vdebug("get disk size from ioctl for %s\n", disk);
|
||||||
|
rc = ioctl(fd, BLKGETSIZE64, &size);
|
||||||
|
if (rc == -1)
|
||||||
|
{
|
||||||
|
size = 0;
|
||||||
|
vdebug("failed to ioctl %d\n", rc);
|
||||||
|
}
|
||||||
|
close(fd);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vdebug("failed to open %s %d\n", diskpath, errno);
|
||||||
|
}
|
||||||
|
|
||||||
|
vdebug("disk %s size %llu bytes\n", disk, size);
|
||||||
|
return size;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_get_disk_vendor(const char *name, char *vendorbuf, int bufsize)
|
||||||
|
{
|
||||||
|
return ventoy_get_sys_file_line(vendorbuf, bufsize, "/sys/block/%s/device/vendor", name);
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_get_disk_model(const char *name, char *modelbuf, int bufsize)
|
||||||
|
{
|
||||||
|
return ventoy_get_sys_file_line(modelbuf, bufsize, "/sys/block/%s/device/model", name);
|
||||||
|
}
|
||||||
|
|
||||||
|
static int fatlib_media_sector_read(uint32 sector, uint8 *buffer, uint32 sector_count)
|
||||||
|
{
|
||||||
|
lseek(g_fatlib_media_fd, (sector + g_fatlib_media_offset) * 512ULL, SEEK_SET);
|
||||||
|
read(g_fatlib_media_fd, buffer, sector_count * 512);
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int fatlib_is_secure_boot_enable(void)
|
||||||
|
{
|
||||||
|
void *flfile = NULL;
|
||||||
|
|
||||||
|
flfile = fl_fopen("/EFI/BOOT/grubx64_real.efi", "rb");
|
||||||
|
if (flfile)
|
||||||
|
{
|
||||||
|
vlog("/EFI/BOOT/grubx64_real.efi find, secure boot in enabled\n");
|
||||||
|
fl_fclose(flfile);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vlog("/EFI/BOOT/grubx64_real.efi not exist\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int fatlib_get_ventoy_version(char *verbuf, int bufsize)
|
||||||
|
{
|
||||||
|
int rc = 1;
|
||||||
|
int size = 0;
|
||||||
|
char *buf = NULL;
|
||||||
|
char *pos = NULL;
|
||||||
|
char *end = NULL;
|
||||||
|
void *flfile = NULL;
|
||||||
|
|
||||||
|
flfile = fl_fopen("/grub/grub.cfg", "rb");
|
||||||
|
if (flfile)
|
||||||
|
{
|
||||||
|
fl_fseek(flfile, 0, SEEK_END);
|
||||||
|
size = (int)fl_ftell(flfile);
|
||||||
|
|
||||||
|
fl_fseek(flfile, 0, SEEK_SET);
|
||||||
|
|
||||||
|
buf = malloc(size + 1);
|
||||||
|
if (buf)
|
||||||
|
{
|
||||||
|
fl_fread(buf, 1, size, flfile);
|
||||||
|
buf[size] = 0;
|
||||||
|
|
||||||
|
pos = strstr(buf, "VENTOY_VERSION=");
|
||||||
|
if (pos)
|
||||||
|
{
|
||||||
|
pos += strlen("VENTOY_VERSION=");
|
||||||
|
if (*pos == '"')
|
||||||
|
{
|
||||||
|
pos++;
|
||||||
|
}
|
||||||
|
|
||||||
|
end = pos;
|
||||||
|
while (*end != 0 && *end != '"' && *end != '\r' && *end != '\n')
|
||||||
|
{
|
||||||
|
end++;
|
||||||
|
}
|
||||||
|
|
||||||
|
*end = 0;
|
||||||
|
|
||||||
|
scnprintf(verbuf, bufsize - 1, "%s", pos);
|
||||||
|
rc = 0;
|
||||||
|
}
|
||||||
|
free(buf);
|
||||||
|
}
|
||||||
|
|
||||||
|
fl_fclose(flfile);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vdebug("No grub.cfg found\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
return rc;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* <BEGIN>: Deleted by longpanda, 20211028 PN:XX LABEL:XX */
|
||||||
|
#if 0
|
||||||
|
int ventoy_get_vtoy_data(ventoy_disk *info, int *ppartstyle)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
int fd;
|
||||||
|
int len;
|
||||||
|
int rc = 1;
|
||||||
|
int ret = 1;
|
||||||
|
int part_style;
|
||||||
|
uint64_t part1_start_sector;
|
||||||
|
uint64_t part1_sector_count;
|
||||||
|
uint64_t part2_start_sector;
|
||||||
|
uint64_t part2_sector_count;
|
||||||
|
uint64_t preserved_space;
|
||||||
|
char name[64] = {0};
|
||||||
|
disk_ventoy_data *vtoy = NULL;
|
||||||
|
VTOY_GPT_INFO *gpt = NULL;
|
||||||
|
|
||||||
|
vtoy = &(info->vtoydata);
|
||||||
|
gpt = &(vtoy->gptinfo);
|
||||||
|
memset(vtoy, 0, sizeof(disk_ventoy_data));
|
||||||
|
|
||||||
|
vdebug("ventoy_get_vtoy_data %s\n", info->disk_path);
|
||||||
|
|
||||||
|
if (info->size_in_byte < (2 * VTOYEFI_PART_BYTES))
|
||||||
|
{
|
||||||
|
vdebug("disk %s is too small %llu\n", info->disk_path, (_ull)info->size_in_byte);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
fd = open(info->disk_path, O_RDONLY | O_BINARY);
|
||||||
|
if (fd < 0)
|
||||||
|
{
|
||||||
|
vdebug("failed to open %s %d\n", info->disk_path, errno);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
len = (int)read(fd, &(vtoy->gptinfo), sizeof(VTOY_GPT_INFO));
|
||||||
|
if (len != sizeof(VTOY_GPT_INFO))
|
||||||
|
{
|
||||||
|
vdebug("failed to read %s %d\n", info->disk_path, errno);
|
||||||
|
goto end;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (gpt->MBR.Byte55 != 0x55 || gpt->MBR.ByteAA != 0xAA)
|
||||||
|
{
|
||||||
|
vdebug("Invalid mbr magic 0x%x 0x%x\n", gpt->MBR.Byte55, gpt->MBR.ByteAA);
|
||||||
|
goto end;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (gpt->MBR.PartTbl[0].FsFlag == 0xEE && strncmp(gpt->Head.Signature, "EFI PART", 8) == 0)
|
||||||
|
{
|
||||||
|
part_style = GPT_PART_STYLE;
|
||||||
|
if (ppartstyle)
|
||||||
|
{
|
||||||
|
*ppartstyle = part_style;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (gpt->PartTbl[0].StartLBA == 0 || gpt->PartTbl[1].StartLBA == 0)
|
||||||
|
{
|
||||||
|
vdebug("NO ventoy efi part layout <%llu %llu>\n",
|
||||||
|
(_ull)gpt->PartTbl[0].StartLBA,
|
||||||
|
(_ull)gpt->PartTbl[1].StartLBA);
|
||||||
|
goto end;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 0; i < 36; i++)
|
||||||
|
{
|
||||||
|
name[i] = (char)(gpt->PartTbl[1].Name[i]);
|
||||||
|
}
|
||||||
|
if (strcmp(name, "VTOYEFI"))
|
||||||
|
{
|
||||||
|
vdebug("Invalid efi part2 name <%s>\n", name);
|
||||||
|
goto end;
|
||||||
|
}
|
||||||
|
|
||||||
|
part1_start_sector = gpt->PartTbl[0].StartLBA;
|
||||||
|
part1_sector_count = gpt->PartTbl[0].LastLBA - part1_start_sector + 1;
|
||||||
|
part2_start_sector = gpt->PartTbl[1].StartLBA;
|
||||||
|
part2_sector_count = gpt->PartTbl[1].LastLBA - part2_start_sector + 1;
|
||||||
|
|
||||||
|
preserved_space = info->size_in_byte - (part2_start_sector + part2_sector_count + 33) * 512;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
part_style = MBR_PART_STYLE;
|
||||||
|
if (ppartstyle)
|
||||||
|
{
|
||||||
|
*ppartstyle = part_style;
|
||||||
|
}
|
||||||
|
|
||||||
|
part1_start_sector = gpt->MBR.PartTbl[0].StartSectorId;
|
||||||
|
part1_sector_count = gpt->MBR.PartTbl[0].SectorCount;
|
||||||
|
part2_start_sector = gpt->MBR.PartTbl[1].StartSectorId;
|
||||||
|
part2_sector_count = gpt->MBR.PartTbl[1].SectorCount;
|
||||||
|
|
||||||
|
preserved_space = info->size_in_byte - (part2_start_sector + part2_sector_count) * 512;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (part1_start_sector != VTOYIMG_PART_START_SECTOR ||
|
||||||
|
part2_sector_count != VTOYEFI_PART_SECTORS ||
|
||||||
|
(part1_start_sector + part1_sector_count) != part2_start_sector)
|
||||||
|
{
|
||||||
|
vdebug("Not valid ventoy partition layout [%llu %llu] [%llu %llu]\n",
|
||||||
|
part1_start_sector, part1_sector_count, part2_start_sector, part2_sector_count);
|
||||||
|
goto end;
|
||||||
|
}
|
||||||
|
|
||||||
|
vdebug("ventoy partition layout check OK: [%llu %llu] [%llu %llu]\n",
|
||||||
|
part1_start_sector, part1_sector_count, part2_start_sector, part2_sector_count);
|
||||||
|
|
||||||
|
vtoy->ventoy_valid = 1;
|
||||||
|
|
||||||
|
vdebug("now check secure boot for %s ...\n", info->disk_path);
|
||||||
|
|
||||||
|
g_fatlib_media_fd = fd;
|
||||||
|
g_fatlib_media_offset = part2_start_sector;
|
||||||
|
fl_init();
|
||||||
|
|
||||||
|
if (0 == fl_attach_media(fatlib_media_sector_read, NULL))
|
||||||
|
{
|
||||||
|
ret = fatlib_get_ventoy_version(vtoy->ventoy_ver, sizeof(vtoy->ventoy_ver));
|
||||||
|
if (ret == 0 && vtoy->ventoy_ver[0])
|
||||||
|
{
|
||||||
|
vtoy->secure_boot_flag = fatlib_is_secure_boot_enable();
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vdebug("fatlib_get_ventoy_version failed %d\n", ret);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vdebug("fl_attach_media failed\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
fl_shutdown();
|
||||||
|
g_fatlib_media_fd = -1;
|
||||||
|
g_fatlib_media_offset = 0;
|
||||||
|
|
||||||
|
if (vtoy->ventoy_ver[0] == 0)
|
||||||
|
{
|
||||||
|
vtoy->ventoy_ver[0] = '?';
|
||||||
|
}
|
||||||
|
|
||||||
|
if (0 == vtoy->ventoy_valid)
|
||||||
|
{
|
||||||
|
goto end;
|
||||||
|
}
|
||||||
|
|
||||||
|
lseek(fd, 2040 * 512, SEEK_SET);
|
||||||
|
read(fd, vtoy->rsvdata, sizeof(vtoy->rsvdata));
|
||||||
|
|
||||||
|
vtoy->preserved_space = preserved_space;
|
||||||
|
vtoy->partition_style = part_style;
|
||||||
|
vtoy->part2_start_sector = part2_start_sector;
|
||||||
|
|
||||||
|
rc = 0;
|
||||||
|
end:
|
||||||
|
vtoy_safe_close_fd(fd);
|
||||||
|
return rc;
|
||||||
|
}
|
||||||
|
#endif /* #if 0 */
|
||||||
|
/* <END> : Deleted by longpanda, 20211028 PN:XX LABEL:XX */
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_get_disk_info(char **argv)
|
||||||
|
{
|
||||||
|
uint64_t size;
|
||||||
|
char vendor[128];
|
||||||
|
char model[128];
|
||||||
|
char *disk = argv[4];
|
||||||
|
|
||||||
|
if (strncmp(argv[4], "/dev/", 4) == 0)
|
||||||
|
{
|
||||||
|
disk += 4;
|
||||||
|
}
|
||||||
|
ventoy_get_disk_vendor(disk, vendor, sizeof(vendor));
|
||||||
|
ventoy_get_disk_model(disk, model, sizeof(model));
|
||||||
|
|
||||||
|
scnprintf(g_sysinfo.cur_model, sizeof(g_sysinfo.cur_model), "%s %s [%s]", vendor, model, argv[4]);
|
||||||
|
strlcpy(g_sysinfo.cur_ventoy_ver, argv[5]);
|
||||||
|
strlcpy(g_sysinfo.cur_fsname, argv[6]);
|
||||||
|
g_sysinfo.cur_part_style = (int)strtol(argv[7], NULL, 10);
|
||||||
|
g_sysinfo.cur_secureboot = (int)strtol(argv[8], NULL, 10);
|
||||||
|
|
||||||
|
size = ventoy_get_disk_size_in_byte(disk);
|
||||||
|
scnprintf(g_sysinfo.cur_capacity, sizeof(g_sysinfo.cur_capacity), "%dGB", (int)ventoy_get_human_readable_gb(size));
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_disk_init(void)
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_disk_exit(void)
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,88 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_disk.c ---- ventoy disk
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#include <windows.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <ventoy_define.h>
|
||||||
|
#include <ventoy_disk.h>
|
||||||
|
#include <ventoy_util.h>
|
||||||
|
#include <fat_filelib.h>
|
||||||
|
|
||||||
|
static int g_disk_num = 0;
|
||||||
|
ventoy_disk *g_disk_list = NULL;
|
||||||
|
|
||||||
|
int ventoy_disk_init(void)
|
||||||
|
{
|
||||||
|
char Letter = 'A';
|
||||||
|
DWORD Drives = GetLogicalDrives();
|
||||||
|
|
||||||
|
vlog("ventoy disk init ...\n");
|
||||||
|
|
||||||
|
g_disk_list = zalloc(sizeof(ventoy_disk) * MAX_DISK);
|
||||||
|
|
||||||
|
while (Drives)
|
||||||
|
{
|
||||||
|
if (Drives & 0x01)
|
||||||
|
{
|
||||||
|
if (CheckRuntimeEnvironment(Letter, g_disk_list + g_disk_num) == 0)
|
||||||
|
{
|
||||||
|
g_disk_list[g_disk_num].devname[0] = Letter;
|
||||||
|
g_disk_num++;
|
||||||
|
vlog("%C: is ventoy disk\n", Letter);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
memset(g_disk_list + g_disk_num, 0, sizeof(ventoy_disk));
|
||||||
|
vlog("%C: is NOT ventoy disk\n", Letter);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
Letter++;
|
||||||
|
Drives >>= 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_disk_exit(void)
|
||||||
|
{
|
||||||
|
vlog("ventoy disk exit ...\n");
|
||||||
|
|
||||||
|
check_free(g_disk_list);
|
||||||
|
g_disk_list = NULL;
|
||||||
|
g_disk_num = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
const ventoy_disk * ventoy_get_disk_list(int *num)
|
||||||
|
{
|
||||||
|
*num = g_disk_num;
|
||||||
|
return g_disk_list;
|
||||||
|
}
|
||||||
|
|
||||||
|
const ventoy_disk * ventoy_get_disk_node(int id)
|
||||||
|
{
|
||||||
|
if (id >= 0 && id < g_disk_num)
|
||||||
|
{
|
||||||
|
return g_disk_list + id;
|
||||||
|
}
|
||||||
|
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
@ -0,0 +1,803 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_json.c
|
||||||
|
*
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <stdarg.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
#else
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <linux/limits.h>
|
||||||
|
#endif
|
||||||
|
#include <ventoy_define.h>
|
||||||
|
#include <ventoy_util.h>
|
||||||
|
#include <ventoy_json.h>
|
||||||
|
|
||||||
|
static void vtoy_json_free(VTOY_JSON *pstJsonHead)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstNext = NULL;
|
||||||
|
|
||||||
|
while (NULL != pstJsonHead)
|
||||||
|
{
|
||||||
|
pstNext = pstJsonHead->pstNext;
|
||||||
|
if ((pstJsonHead->enDataType < JSON_TYPE_BUTT) && (NULL != pstJsonHead->pstChild))
|
||||||
|
{
|
||||||
|
vtoy_json_free(pstJsonHead->pstChild);
|
||||||
|
}
|
||||||
|
|
||||||
|
free(pstJsonHead);
|
||||||
|
pstJsonHead = pstNext;
|
||||||
|
}
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
static char *vtoy_json_skip(const char *pcData)
|
||||||
|
{
|
||||||
|
while ((NULL != pcData) && ('\0' != *pcData) && (*pcData <= 32))
|
||||||
|
{
|
||||||
|
pcData++;
|
||||||
|
}
|
||||||
|
|
||||||
|
return (char *)pcData;
|
||||||
|
}
|
||||||
|
|
||||||
|
VTOY_JSON *vtoy_json_find_item
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
JSON_TYPE enDataType,
|
||||||
|
const char *szKey
|
||||||
|
)
|
||||||
|
{
|
||||||
|
while (NULL != pstJson)
|
||||||
|
{
|
||||||
|
if ((enDataType == pstJson->enDataType) &&
|
||||||
|
(0 == strcmp(szKey, pstJson->pcName)))
|
||||||
|
{
|
||||||
|
return pstJson;
|
||||||
|
}
|
||||||
|
pstJson = pstJson->pstNext;
|
||||||
|
}
|
||||||
|
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int vtoy_json_parse_number
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *pcData,
|
||||||
|
const char **ppcEnd
|
||||||
|
)
|
||||||
|
{
|
||||||
|
unsigned long Value;
|
||||||
|
|
||||||
|
Value = strtoul(pcData, (char **)ppcEnd, 10);
|
||||||
|
if (*ppcEnd == pcData)
|
||||||
|
{
|
||||||
|
vdebug("Failed to parse json number %s.\n", pcData);
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
pstJson->enDataType = JSON_TYPE_NUMBER;
|
||||||
|
pstJson->unData.lValue = Value;
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int vtoy_json_parse_string
|
||||||
|
(
|
||||||
|
char *pcNewStart,
|
||||||
|
char *pcRawStart,
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *pcData,
|
||||||
|
const char **ppcEnd
|
||||||
|
)
|
||||||
|
{
|
||||||
|
uint32_t uiLen = 0;
|
||||||
|
const char *pcPos = NULL;
|
||||||
|
const char *pcTmp = pcData + 1;
|
||||||
|
|
||||||
|
*ppcEnd = pcData;
|
||||||
|
|
||||||
|
if ('\"' != *pcData)
|
||||||
|
{
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
pcPos = strchr(pcTmp, '\"');
|
||||||
|
if ((NULL == pcPos) || (pcPos < pcTmp))
|
||||||
|
{
|
||||||
|
vdebug("Invalid string %s.\n", pcData);
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (*(pcPos - 1) == '\\')
|
||||||
|
{
|
||||||
|
for (pcPos++; *pcPos; pcPos++)
|
||||||
|
{
|
||||||
|
if (*pcPos == '"' && *(pcPos - 1) != '\\')
|
||||||
|
{
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (*pcPos == 0 || pcPos < pcTmp)
|
||||||
|
{
|
||||||
|
vdebug("Invalid quotes string %s.", pcData);
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
*ppcEnd = pcPos + 1;
|
||||||
|
uiLen = (uint32_t)(unsigned long)(pcPos - pcTmp);
|
||||||
|
|
||||||
|
pstJson->enDataType = JSON_TYPE_STRING;
|
||||||
|
pstJson->unData.pcStrVal = pcNewStart + (pcTmp - pcRawStart);
|
||||||
|
pstJson->unData.pcStrVal[uiLen] = '\0';
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int vtoy_json_parse_array
|
||||||
|
(
|
||||||
|
char *pcNewStart,
|
||||||
|
char *pcRawStart,
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *pcData,
|
||||||
|
const char **ppcEnd
|
||||||
|
)
|
||||||
|
{
|
||||||
|
int Ret = JSON_SUCCESS;
|
||||||
|
VTOY_JSON *pstJsonChild = NULL;
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
const char *pcTmp = pcData + 1;
|
||||||
|
|
||||||
|
*ppcEnd = pcData;
|
||||||
|
pstJson->enDataType = JSON_TYPE_ARRAY;
|
||||||
|
|
||||||
|
if ('[' != *pcData)
|
||||||
|
{
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
pcTmp = vtoy_json_skip(pcTmp);
|
||||||
|
|
||||||
|
if (']' == *pcTmp)
|
||||||
|
{
|
||||||
|
*ppcEnd = pcTmp + 1;
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
JSON_NEW_ITEM(pstJson->pstChild, JSON_FAILED);
|
||||||
|
|
||||||
|
Ret = vtoy_json_parse_value(pcNewStart, pcRawStart, pstJson->pstChild, pcTmp, ppcEnd);
|
||||||
|
if (JSON_SUCCESS != Ret)
|
||||||
|
{
|
||||||
|
vdebug("Failed to parse array child.\n");
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
pstJsonChild = pstJson->pstChild;
|
||||||
|
pcTmp = vtoy_json_skip(*ppcEnd);
|
||||||
|
while ((NULL != pcTmp) && (',' == *pcTmp))
|
||||||
|
{
|
||||||
|
JSON_NEW_ITEM(pstJsonItem, JSON_FAILED);
|
||||||
|
pstJsonChild->pstNext = pstJsonItem;
|
||||||
|
pstJsonItem->pstPrev = pstJsonChild;
|
||||||
|
pstJsonChild = pstJsonItem;
|
||||||
|
|
||||||
|
Ret = vtoy_json_parse_value(pcNewStart, pcRawStart, pstJsonChild, vtoy_json_skip(pcTmp + 1), ppcEnd);
|
||||||
|
if (JSON_SUCCESS != Ret)
|
||||||
|
{
|
||||||
|
vdebug("Failed to parse array child.\n");
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
pcTmp = vtoy_json_skip(*ppcEnd);
|
||||||
|
}
|
||||||
|
|
||||||
|
if ((NULL != pcTmp) && (']' == *pcTmp))
|
||||||
|
{
|
||||||
|
*ppcEnd = pcTmp + 1;
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
*ppcEnd = pcTmp;
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static int vtoy_json_parse_object
|
||||||
|
(
|
||||||
|
char *pcNewStart,
|
||||||
|
char *pcRawStart,
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *pcData,
|
||||||
|
const char **ppcEnd
|
||||||
|
)
|
||||||
|
{
|
||||||
|
int Ret = JSON_SUCCESS;
|
||||||
|
VTOY_JSON *pstJsonChild = NULL;
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
const char *pcTmp = pcData + 1;
|
||||||
|
|
||||||
|
*ppcEnd = pcData;
|
||||||
|
pstJson->enDataType = JSON_TYPE_OBJECT;
|
||||||
|
|
||||||
|
if ('{' != *pcData)
|
||||||
|
{
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
pcTmp = vtoy_json_skip(pcTmp);
|
||||||
|
if ('}' == *pcTmp)
|
||||||
|
{
|
||||||
|
*ppcEnd = pcTmp + 1;
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
JSON_NEW_ITEM(pstJson->pstChild, JSON_FAILED);
|
||||||
|
|
||||||
|
Ret = vtoy_json_parse_string(pcNewStart, pcRawStart, pstJson->pstChild, pcTmp, ppcEnd);
|
||||||
|
if (JSON_SUCCESS != Ret)
|
||||||
|
{
|
||||||
|
vdebug("Failed to parse array child.\n");
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
pstJsonChild = pstJson->pstChild;
|
||||||
|
pstJsonChild->pcName = pstJsonChild->unData.pcStrVal;
|
||||||
|
pstJsonChild->unData.pcStrVal = NULL;
|
||||||
|
|
||||||
|
pcTmp = vtoy_json_skip(*ppcEnd);
|
||||||
|
if ((NULL == pcTmp) || (':' != *pcTmp))
|
||||||
|
{
|
||||||
|
*ppcEnd = pcTmp;
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
Ret = vtoy_json_parse_value(pcNewStart, pcRawStart, pstJsonChild, vtoy_json_skip(pcTmp + 1), ppcEnd);
|
||||||
|
if (JSON_SUCCESS != Ret)
|
||||||
|
{
|
||||||
|
vdebug("Failed to parse array child.\n");
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
pcTmp = vtoy_json_skip(*ppcEnd);
|
||||||
|
while ((NULL != pcTmp) && (',' == *pcTmp))
|
||||||
|
{
|
||||||
|
JSON_NEW_ITEM(pstJsonItem, JSON_FAILED);
|
||||||
|
pstJsonChild->pstNext = pstJsonItem;
|
||||||
|
pstJsonItem->pstPrev = pstJsonChild;
|
||||||
|
pstJsonChild = pstJsonItem;
|
||||||
|
|
||||||
|
Ret = vtoy_json_parse_string(pcNewStart, pcRawStart, pstJsonChild, vtoy_json_skip(pcTmp + 1), ppcEnd);
|
||||||
|
if (JSON_SUCCESS != Ret)
|
||||||
|
{
|
||||||
|
vdebug("Failed to parse array child.\n");
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
pcTmp = vtoy_json_skip(*ppcEnd);
|
||||||
|
pstJsonChild->pcName = pstJsonChild->unData.pcStrVal;
|
||||||
|
pstJsonChild->unData.pcStrVal = NULL;
|
||||||
|
if ((NULL == pcTmp) || (':' != *pcTmp))
|
||||||
|
{
|
||||||
|
*ppcEnd = pcTmp;
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
Ret = vtoy_json_parse_value(pcNewStart, pcRawStart, pstJsonChild, vtoy_json_skip(pcTmp + 1), ppcEnd);
|
||||||
|
if (JSON_SUCCESS != Ret)
|
||||||
|
{
|
||||||
|
vdebug("Failed to parse array child.\n");
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
pcTmp = vtoy_json_skip(*ppcEnd);
|
||||||
|
}
|
||||||
|
|
||||||
|
if ((NULL != pcTmp) && ('}' == *pcTmp))
|
||||||
|
{
|
||||||
|
*ppcEnd = pcTmp + 1;
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
*ppcEnd = pcTmp;
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_parse_value
|
||||||
|
(
|
||||||
|
char *pcNewStart,
|
||||||
|
char *pcRawStart,
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *pcData,
|
||||||
|
const char **ppcEnd
|
||||||
|
)
|
||||||
|
{
|
||||||
|
pcData = vtoy_json_skip(pcData);
|
||||||
|
|
||||||
|
switch (*pcData)
|
||||||
|
{
|
||||||
|
case 'n':
|
||||||
|
{
|
||||||
|
if (0 == strncmp(pcData, "null", 4))
|
||||||
|
{
|
||||||
|
pstJson->enDataType = JSON_TYPE_NULL;
|
||||||
|
*ppcEnd = pcData + 4;
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case 'f':
|
||||||
|
{
|
||||||
|
if (0 == strncmp(pcData, "false", 5))
|
||||||
|
{
|
||||||
|
pstJson->enDataType = JSON_TYPE_BOOL;
|
||||||
|
pstJson->unData.lValue = 0;
|
||||||
|
*ppcEnd = pcData + 5;
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case 't':
|
||||||
|
{
|
||||||
|
if (0 == strncmp(pcData, "true", 4))
|
||||||
|
{
|
||||||
|
pstJson->enDataType = JSON_TYPE_BOOL;
|
||||||
|
pstJson->unData.lValue = 1;
|
||||||
|
*ppcEnd = pcData + 4;
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case '\"':
|
||||||
|
{
|
||||||
|
return vtoy_json_parse_string(pcNewStart, pcRawStart, pstJson, pcData, ppcEnd);
|
||||||
|
}
|
||||||
|
case '[':
|
||||||
|
{
|
||||||
|
return vtoy_json_parse_array(pcNewStart, pcRawStart, pstJson, pcData, ppcEnd);
|
||||||
|
}
|
||||||
|
case '{':
|
||||||
|
{
|
||||||
|
return vtoy_json_parse_object(pcNewStart, pcRawStart, pstJson, pcData, ppcEnd);
|
||||||
|
}
|
||||||
|
case '-':
|
||||||
|
{
|
||||||
|
return vtoy_json_parse_number(pstJson, pcData, ppcEnd);
|
||||||
|
}
|
||||||
|
default :
|
||||||
|
{
|
||||||
|
if (*pcData >= '0' && *pcData <= '9')
|
||||||
|
{
|
||||||
|
return vtoy_json_parse_number(pstJson, pcData, ppcEnd);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
*ppcEnd = pcData;
|
||||||
|
vdebug("Invalid json data %u.\n", (uint8_t)(*pcData));
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
VTOY_JSON * vtoy_json_create(void)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstJson = NULL;
|
||||||
|
|
||||||
|
pstJson = (VTOY_JSON *)zalloc(sizeof(VTOY_JSON));
|
||||||
|
if (NULL == pstJson)
|
||||||
|
{
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
return pstJson;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_parse(VTOY_JSON *pstJson, const char *szJsonData)
|
||||||
|
{
|
||||||
|
uint32_t uiMemSize = 0;
|
||||||
|
int Ret = JSON_SUCCESS;
|
||||||
|
char *pcNewBuf = NULL;
|
||||||
|
const char *pcEnd = NULL;
|
||||||
|
|
||||||
|
uiMemSize = strlen(szJsonData) + 1;
|
||||||
|
pcNewBuf = (char *)malloc(uiMemSize);
|
||||||
|
if (NULL == pcNewBuf)
|
||||||
|
{
|
||||||
|
vdebug("Failed to alloc new buf.\n");
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
memcpy(pcNewBuf, szJsonData, uiMemSize);
|
||||||
|
pcNewBuf[uiMemSize - 1] = 0;
|
||||||
|
|
||||||
|
Ret = vtoy_json_parse_value(pcNewBuf, (char *)szJsonData, pstJson, szJsonData, &pcEnd);
|
||||||
|
if (JSON_SUCCESS != Ret)
|
||||||
|
{
|
||||||
|
vdebug("Failed to parse json data start=%p, end=%p.\n", szJsonData, pcEnd);
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_parse_ex(VTOY_JSON *pstJson, const char *szJsonData, int szLen)
|
||||||
|
{
|
||||||
|
uint32_t uiMemSize = 0;
|
||||||
|
int Ret = JSON_SUCCESS;
|
||||||
|
char *pcNewBuf = NULL;
|
||||||
|
const char *pcEnd = NULL;
|
||||||
|
|
||||||
|
uiMemSize = (uint32_t)szLen;
|
||||||
|
pcNewBuf = (char *)malloc(uiMemSize + 1);
|
||||||
|
if (NULL == pcNewBuf)
|
||||||
|
{
|
||||||
|
vdebug("Failed to alloc new buf.\n");
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
memcpy(pcNewBuf, szJsonData, szLen);
|
||||||
|
pcNewBuf[uiMemSize] = 0;
|
||||||
|
|
||||||
|
Ret = vtoy_json_parse_value(pcNewBuf, (char *)szJsonData, pstJson, szJsonData, &pcEnd);
|
||||||
|
if (JSON_SUCCESS != Ret)
|
||||||
|
{
|
||||||
|
vdebug("Failed to parse json data start=%p, end=%p\n", szJsonData, pcEnd);
|
||||||
|
return JSON_FAILED;
|
||||||
|
}
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_scan_parse
|
||||||
|
(
|
||||||
|
const VTOY_JSON *pstJson,
|
||||||
|
uint32_t uiParseNum,
|
||||||
|
VTOY_JSON_PARSE_S *pstJsonParse
|
||||||
|
)
|
||||||
|
{
|
||||||
|
uint32_t i = 0;
|
||||||
|
const VTOY_JSON *pstJsonCur = NULL;
|
||||||
|
VTOY_JSON_PARSE_S *pstCurParse = NULL;
|
||||||
|
|
||||||
|
for (pstJsonCur = pstJson; NULL != pstJsonCur; pstJsonCur = pstJsonCur->pstNext)
|
||||||
|
{
|
||||||
|
if ((JSON_TYPE_OBJECT == pstJsonCur->enDataType) ||
|
||||||
|
(JSON_TYPE_ARRAY == pstJsonCur->enDataType))
|
||||||
|
{
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 0, pstCurParse = NULL; i < uiParseNum; i++)
|
||||||
|
{
|
||||||
|
if (0 == strcmp(pstJsonParse[i].pcKey, pstJsonCur->pcName))
|
||||||
|
{
|
||||||
|
pstCurParse = pstJsonParse + i;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (NULL == pstCurParse)
|
||||||
|
{
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
switch (pstJsonCur->enDataType)
|
||||||
|
{
|
||||||
|
case JSON_TYPE_NUMBER:
|
||||||
|
{
|
||||||
|
if (sizeof(uint32_t) == pstCurParse->uiBufSize)
|
||||||
|
{
|
||||||
|
*(uint32_t *)(pstCurParse->pDataBuf) = (uint32_t)pstJsonCur->unData.lValue;
|
||||||
|
}
|
||||||
|
else if (sizeof(uint16_t) == pstCurParse->uiBufSize)
|
||||||
|
{
|
||||||
|
*(uint16_t *)(pstCurParse->pDataBuf) = (uint16_t)pstJsonCur->unData.lValue;
|
||||||
|
}
|
||||||
|
else if (sizeof(uint8_t) == pstCurParse->uiBufSize)
|
||||||
|
{
|
||||||
|
*(uint8_t *)(pstCurParse->pDataBuf) = (uint8_t)pstJsonCur->unData.lValue;
|
||||||
|
}
|
||||||
|
else if ((pstCurParse->uiBufSize > sizeof(uint64_t)))
|
||||||
|
{
|
||||||
|
scnprintf((char *)pstCurParse->pDataBuf, pstCurParse->uiBufSize, "%llu",
|
||||||
|
(unsigned long long)(pstJsonCur->unData.lValue));
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vdebug("Invalid number data buf size %u.\n", pstCurParse->uiBufSize);
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case JSON_TYPE_STRING:
|
||||||
|
{
|
||||||
|
scnprintf((char *)pstCurParse->pDataBuf, pstCurParse->uiBufSize, "%s", pstJsonCur->unData.pcStrVal);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case JSON_TYPE_BOOL:
|
||||||
|
{
|
||||||
|
*(uint8_t *)(pstCurParse->pDataBuf) = (pstJsonCur->unData.lValue) > 0 ? 1 : 0;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
default :
|
||||||
|
{
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_scan_array
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
VTOY_JSON **ppstArrayItem
|
||||||
|
)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
|
||||||
|
pstJsonItem = vtoy_json_find_item(pstJson, JSON_TYPE_ARRAY, szKey);
|
||||||
|
if (NULL == pstJsonItem)
|
||||||
|
{
|
||||||
|
vdebug("Key %s is not found in json data.\n", szKey);
|
||||||
|
return JSON_NOT_FOUND;
|
||||||
|
}
|
||||||
|
|
||||||
|
*ppstArrayItem = pstJsonItem;
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_scan_array_ex
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
VTOY_JSON **ppstArrayItem
|
||||||
|
)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
|
||||||
|
pstJsonItem = vtoy_json_find_item(pstJson, JSON_TYPE_ARRAY, szKey);
|
||||||
|
if (NULL == pstJsonItem)
|
||||||
|
{
|
||||||
|
vdebug("Key %s is not found in json data.\n", szKey);
|
||||||
|
return JSON_NOT_FOUND;
|
||||||
|
}
|
||||||
|
|
||||||
|
*ppstArrayItem = pstJsonItem->pstChild;
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_scan_object
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
VTOY_JSON **ppstObjectItem
|
||||||
|
)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
|
||||||
|
pstJsonItem = vtoy_json_find_item(pstJson, JSON_TYPE_OBJECT, szKey);
|
||||||
|
if (NULL == pstJsonItem)
|
||||||
|
{
|
||||||
|
vdebug("Key %s is not found in json data.\n", szKey);
|
||||||
|
return JSON_NOT_FOUND;
|
||||||
|
}
|
||||||
|
|
||||||
|
*ppstObjectItem = pstJsonItem;
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_get_int
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
int *piValue
|
||||||
|
)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
|
||||||
|
pstJsonItem = vtoy_json_find_item(pstJson, JSON_TYPE_NUMBER, szKey);
|
||||||
|
if (NULL == pstJsonItem)
|
||||||
|
{
|
||||||
|
//vdebug("Key %s is not found in json data.\n", szKey);
|
||||||
|
return JSON_NOT_FOUND;
|
||||||
|
}
|
||||||
|
|
||||||
|
*piValue = (int)pstJsonItem->unData.lValue;
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_get_uint
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
uint32_t *puiValue
|
||||||
|
)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
|
||||||
|
pstJsonItem = vtoy_json_find_item(pstJson, JSON_TYPE_NUMBER, szKey);
|
||||||
|
if (NULL == pstJsonItem)
|
||||||
|
{
|
||||||
|
vdebug("Key %s is not found in json data.\n", szKey);
|
||||||
|
return JSON_NOT_FOUND;
|
||||||
|
}
|
||||||
|
|
||||||
|
*puiValue = (uint32_t)pstJsonItem->unData.lValue;
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_get_uint64
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
uint64_t *pui64Value
|
||||||
|
)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
|
||||||
|
pstJsonItem = vtoy_json_find_item(pstJson, JSON_TYPE_NUMBER, szKey);
|
||||||
|
if (NULL == pstJsonItem)
|
||||||
|
{
|
||||||
|
vdebug("Key %s is not found in json data.\n", szKey);
|
||||||
|
return JSON_NOT_FOUND;
|
||||||
|
}
|
||||||
|
|
||||||
|
*pui64Value = (uint64_t)pstJsonItem->unData.lValue;
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_get_bool
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
uint8_t *pbValue
|
||||||
|
)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
|
||||||
|
pstJsonItem = vtoy_json_find_item(pstJson, JSON_TYPE_BOOL, szKey);
|
||||||
|
if (NULL == pstJsonItem)
|
||||||
|
{
|
||||||
|
vdebug("Key %s is not found in json data.\n", szKey);
|
||||||
|
return JSON_NOT_FOUND;
|
||||||
|
}
|
||||||
|
|
||||||
|
*pbValue = pstJsonItem->unData.lValue > 0 ? 1 : 0;
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_get_string
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
uint32_t uiBufLen,
|
||||||
|
char *pcBuf
|
||||||
|
)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
|
||||||
|
pstJsonItem = vtoy_json_find_item(pstJson, JSON_TYPE_STRING, szKey);
|
||||||
|
if (NULL == pstJsonItem)
|
||||||
|
{
|
||||||
|
//vdebug("Key %s is not found in json data.\n", szKey);
|
||||||
|
return JSON_NOT_FOUND;
|
||||||
|
}
|
||||||
|
|
||||||
|
scnprintf(pcBuf, uiBufLen, "%s", pstJsonItem->unData.pcStrVal);
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
const char * vtoy_json_get_string_ex(VTOY_JSON *pstJson, const char *szKey)
|
||||||
|
{
|
||||||
|
VTOY_JSON *pstJsonItem = NULL;
|
||||||
|
|
||||||
|
if ((NULL == pstJson) || (NULL == szKey))
|
||||||
|
{
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
pstJsonItem = vtoy_json_find_item(pstJson, JSON_TYPE_STRING, szKey);
|
||||||
|
if (NULL == pstJsonItem)
|
||||||
|
{
|
||||||
|
//vdebug("Key %s is not found in json data.\n", szKey);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
return pstJsonItem->unData.pcStrVal;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_destroy(VTOY_JSON *pstJson)
|
||||||
|
{
|
||||||
|
if (NULL == pstJson)
|
||||||
|
{
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (NULL != pstJson->pstChild)
|
||||||
|
{
|
||||||
|
vtoy_json_free(pstJson->pstChild);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (NULL != pstJson->pstNext)
|
||||||
|
{
|
||||||
|
vtoy_json_free(pstJson->pstNext);
|
||||||
|
}
|
||||||
|
|
||||||
|
free(pstJson);
|
||||||
|
|
||||||
|
return JSON_SUCCESS;
|
||||||
|
}
|
||||||
|
|
||||||
|
int vtoy_json_escape_string(char *buf, int buflen, const char *str, int newline)
|
||||||
|
{
|
||||||
|
char last = 0;
|
||||||
|
int count = 0;
|
||||||
|
|
||||||
|
*buf++ = '"';
|
||||||
|
count++;
|
||||||
|
|
||||||
|
while (*str)
|
||||||
|
{
|
||||||
|
if (*str == '"' && last != '\\')
|
||||||
|
{
|
||||||
|
*buf = '\\';
|
||||||
|
count++;
|
||||||
|
buf++;
|
||||||
|
}
|
||||||
|
|
||||||
|
*buf = *str;
|
||||||
|
count++;
|
||||||
|
buf++;
|
||||||
|
|
||||||
|
last = *str;
|
||||||
|
str++;
|
||||||
|
}
|
||||||
|
|
||||||
|
*buf++ = '"';
|
||||||
|
count++;
|
||||||
|
|
||||||
|
*buf++ = ',';
|
||||||
|
count++;
|
||||||
|
|
||||||
|
if (newline)
|
||||||
|
{
|
||||||
|
*buf++ = '\n';
|
||||||
|
count++;
|
||||||
|
}
|
||||||
|
|
||||||
|
return count;
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,436 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_json.h
|
||||||
|
*
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#ifndef __VENTOY_JSON_H__
|
||||||
|
#define __VENTOY_JSON_H__
|
||||||
|
|
||||||
|
#define JSON_NEW_ITEM(pstJson, ret) \
|
||||||
|
{ \
|
||||||
|
(pstJson) = (VTOY_JSON *)zalloc(sizeof(VTOY_JSON)); \
|
||||||
|
if (NULL == (pstJson)) \
|
||||||
|
{ \
|
||||||
|
vdebug("Failed to alloc memory for json."); \
|
||||||
|
return (ret); \
|
||||||
|
} \
|
||||||
|
}
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
#define ssprintf(curpos, buf, len, fmt, ...) \
|
||||||
|
curpos += scnprintf(buf + curpos, len - curpos, fmt, ##__VA_ARGS__)
|
||||||
|
|
||||||
|
#define VTOY_JSON_IS_SKIPABLE(c) (((c) <= 32) ? 1 : 0)
|
||||||
|
|
||||||
|
#define VTOY_JSON_PRINT_PREFIX(uiDepth, ...) \
|
||||||
|
{ \
|
||||||
|
uint32_t _uiLoop = 0; \
|
||||||
|
for (_uiLoop = 0; _uiLoop < (uiDepth); _uiLoop++) \
|
||||||
|
{ \
|
||||||
|
ssprintf(uiCurPos, pcBuf, uiBufLen, " "); \
|
||||||
|
} \
|
||||||
|
ssprintf(uiCurPos, pcBuf, uiBufLen, ##__VA_ARGS__); \
|
||||||
|
}
|
||||||
|
#else
|
||||||
|
|
||||||
|
#define ssprintf(curpos, buf, len, fmt, args...) \
|
||||||
|
curpos += scnprintf(buf + curpos, len - curpos, fmt, ##args)
|
||||||
|
|
||||||
|
#define VTOY_JSON_IS_SKIPABLE(c) (((c) <= 32) ? 1 : 0)
|
||||||
|
|
||||||
|
#define VTOY_JSON_PRINT_PREFIX(uiDepth, args...) \
|
||||||
|
{ \
|
||||||
|
uint32_t _uiLoop = 0; \
|
||||||
|
for (_uiLoop = 0; _uiLoop < (uiDepth); _uiLoop++) \
|
||||||
|
{ \
|
||||||
|
ssprintf(uiCurPos, pcBuf, uiBufLen, " "); \
|
||||||
|
} \
|
||||||
|
ssprintf(uiCurPos, pcBuf, uiBufLen, ##args); \
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_SUCCESS_RET "{ \"result\" : \"success\" }"
|
||||||
|
#define VTOY_JSON_FAILED_RET "{ \"result\" : \"failed\" }"
|
||||||
|
#define VTOY_JSON_INVALID_RET "{ \"result\" : \"invalidfmt\" }"
|
||||||
|
#define VTOY_JSON_TOKEN_ERR_RET "{ \"result\" : \"tokenerror\" }"
|
||||||
|
#define VTOY_JSON_EXIST_RET "{ \"result\" : \"exist\" }"
|
||||||
|
#define VTOY_JSON_TIMEOUT_RET "{ \"result\" : \"timeout\" }"
|
||||||
|
#define VTOY_JSON_BUSY_RET "{ \"result\" : \"busy\" }"
|
||||||
|
#define VTOY_JSON_INUSE_RET "{ \"result\" : \"inuse\" }"
|
||||||
|
#define VTOY_JSON_NOTFOUND_RET "{ \"result\" : \"notfound\" }"
|
||||||
|
#define VTOY_JSON_NOTRUNNING_RET "{ \"result\" : \"notrunning\" }"
|
||||||
|
#define VTOY_JSON_NOT_READY_RET "{ \"result\" : \"notready\" }"
|
||||||
|
#define VTOY_JSON_NOT_SUPPORT_RET "{ \"result\" : \"notsupport\" }"
|
||||||
|
#define VTOY_JSON_MBR_2TB_RET "{ \"result\" : \"mbr2tb\" }"
|
||||||
|
#define VTOY_JSON_INVALID_RSV_RET "{ \"result\" : \"reserve_invalid\" }"
|
||||||
|
#define VTOY_JSON_FILE_NOT_FOUND_RET "{ \"result\" : \"file_not_found\" }"
|
||||||
|
|
||||||
|
typedef enum tagJSON_TYPE
|
||||||
|
{
|
||||||
|
JSON_TYPE_NUMBER = 0,
|
||||||
|
JSON_TYPE_STRING,
|
||||||
|
JSON_TYPE_BOOL,
|
||||||
|
JSON_TYPE_ARRAY,
|
||||||
|
JSON_TYPE_OBJECT,
|
||||||
|
JSON_TYPE_NULL,
|
||||||
|
JSON_TYPE_BUTT
|
||||||
|
}JSON_TYPE;
|
||||||
|
|
||||||
|
typedef struct tagVTOY_JSON
|
||||||
|
{
|
||||||
|
struct tagVTOY_JSON *pstPrev;
|
||||||
|
struct tagVTOY_JSON *pstNext;
|
||||||
|
struct tagVTOY_JSON *pstChild;
|
||||||
|
|
||||||
|
JSON_TYPE enDataType;
|
||||||
|
union
|
||||||
|
{
|
||||||
|
char *pcStrVal;
|
||||||
|
int iNumVal;
|
||||||
|
uint64_t lValue;
|
||||||
|
}unData;
|
||||||
|
|
||||||
|
char *pcName;
|
||||||
|
}VTOY_JSON;
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_BEGIN(uiCurPos, pcBuf, uiBufLen) \
|
||||||
|
{\
|
||||||
|
uint32_t __uiCurPos = (uiCurPos);\
|
||||||
|
uint32_t __uiBufLen = (uiBufLen);\
|
||||||
|
char *__pcBuf = (pcBuf);
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_END(uiCurPos) \
|
||||||
|
(uiCurPos) = __uiCurPos;\
|
||||||
|
}
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_OBJ_BEGIN() ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "{")
|
||||||
|
#define VTOY_JSON_FMT_OBJ_BEGIN_L(P) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s{", P)
|
||||||
|
#define VTOY_JSON_FMT_OBJ_BEGIN_N() ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "{\n")
|
||||||
|
#define VTOY_JSON_FMT_OBJ_BEGIN_LN(P) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s{\n", P)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_OBJ_END() \
|
||||||
|
{\
|
||||||
|
if (',' == *(__pcBuf + (__uiCurPos - 1)))\
|
||||||
|
{\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "}");\
|
||||||
|
}
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_OBJ_ENDEX() \
|
||||||
|
{\
|
||||||
|
if (',' == *(__pcBuf + (__uiCurPos - 1)))\
|
||||||
|
{\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "},");\
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_KEY(Key) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\":", (Key))
|
||||||
|
#define VTOY_JSON_FMT_KEY_L(P, Key) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\":", P, (Key))
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_ITEM(Item) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\",", (Item))
|
||||||
|
#define VTOY_JSON_FMT_ITEM_L(P, Item) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\",", P, (Item))
|
||||||
|
#define VTOY_JSON_FMT_ITEM_LN(P, Item) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\",\n", P, (Item))
|
||||||
|
#define VTOY_JSON_FMT_ITEM_PATH_LN(P, Item) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\",\n", P, ventoy_real_path(Item))
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_COMA() ssprintf(__uiCurPos, __pcBuf, __uiBufLen, ",")
|
||||||
|
#define VTOY_JSON_FMT_COMA_N(cnt) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, ",\n")
|
||||||
|
#define VTOY_JSON_FMT_COMA_N_CNT(cnt) if ((cnt) > 0) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, ",\n")
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_APPEND_BEGIN() \
|
||||||
|
{ \
|
||||||
|
if ('}' == *(__pcBuf + (__uiCurPos - 1)))\
|
||||||
|
{\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, ",");\
|
||||||
|
}
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_APPEND_END() \
|
||||||
|
{ \
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "}");\
|
||||||
|
}
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_ARY_BEGIN() ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "[")
|
||||||
|
#define VTOY_JSON_FMT_ARY_BEGIN_N() ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "[\n")
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_ARY_END() \
|
||||||
|
{\
|
||||||
|
if (',' == *(__pcBuf + (__uiCurPos - 1)))\
|
||||||
|
{\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "]");\
|
||||||
|
}
|
||||||
|
#define VTOY_JSON_FMT_ARY_ENDEX() \
|
||||||
|
{\
|
||||||
|
if (',' == *(__pcBuf + (__uiCurPos - 1)))\
|
||||||
|
{\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "],");\
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_OBJ_END_L(P) \
|
||||||
|
{\
|
||||||
|
if ('\n' == *(__pcBuf + (__uiCurPos - 1)) && ',' == *(__pcBuf + (__uiCurPos - 2)))\
|
||||||
|
{\
|
||||||
|
*(__pcBuf + (__uiCurPos - 2)) = '\n';\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s}%s", P);\
|
||||||
|
}
|
||||||
|
#define VTOY_JSON_FMT_OBJ_ENDEX_L(P) \
|
||||||
|
{\
|
||||||
|
if ('\n' == *(__pcBuf + (__uiCurPos - 1)) && ',' == *(__pcBuf + (__uiCurPos - 2)))\
|
||||||
|
{\
|
||||||
|
*(__pcBuf + (__uiCurPos - 2)) = '\n';\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s},%s", P);\
|
||||||
|
}
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_OBJ_END_LN(P) \
|
||||||
|
{\
|
||||||
|
if ('\n' == *(__pcBuf + (__uiCurPos - 1)) && ',' == *(__pcBuf + (__uiCurPos - 2)))\
|
||||||
|
{\
|
||||||
|
*(__pcBuf + (__uiCurPos - 2)) = '\n';\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s}\n", P);\
|
||||||
|
}
|
||||||
|
#define VTOY_JSON_FMT_OBJ_ENDEX_LN(P) \
|
||||||
|
{\
|
||||||
|
if ('\n' == *(__pcBuf + (__uiCurPos - 1)) && ',' == *(__pcBuf + (__uiCurPos - 2)))\
|
||||||
|
{\
|
||||||
|
*(__pcBuf + (__uiCurPos - 2)) = '\n';\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s},\n", P);\
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_ARY_END_L(P) \
|
||||||
|
{\
|
||||||
|
if ('\n' == *(__pcBuf + (__uiCurPos - 1)) && ',' == *(__pcBuf + (__uiCurPos - 2)))\
|
||||||
|
{\
|
||||||
|
*(__pcBuf + (__uiCurPos - 2)) = '\n';\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s]", P);\
|
||||||
|
}
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_ARY_END_LN(P) \
|
||||||
|
{\
|
||||||
|
if ('\n' == *(__pcBuf + (__uiCurPos - 1)) && ',' == *(__pcBuf + (__uiCurPos - 2)))\
|
||||||
|
{\
|
||||||
|
*(__pcBuf + (__uiCurPos - 2)) = '\n';\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s]\n", P);\
|
||||||
|
}
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_ARY_ENDEX_L(P) \
|
||||||
|
{\
|
||||||
|
if ('\n' == *(__pcBuf + (__uiCurPos - 1)) && ',' == *(__pcBuf + (__uiCurPos - 2)))\
|
||||||
|
{\
|
||||||
|
*(__pcBuf + (__uiCurPos - 2)) = '\n';\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s],", P);\
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_ARY_ENDEX_LN(P) \
|
||||||
|
{\
|
||||||
|
if ('\n' == *(__pcBuf + (__uiCurPos - 1)) && ',' == *(__pcBuf + (__uiCurPos - 2)))\
|
||||||
|
{\
|
||||||
|
*(__pcBuf + (__uiCurPos - 2)) = '\n';\
|
||||||
|
__uiCurPos -= 1;\
|
||||||
|
}\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s],\n", P);\
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_UINT64(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": %llu,", Key, (_ull)Val)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_ULONG(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": %lu,", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_LONG(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": %ld,", Key, Val)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_UINT(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": %u,", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_UINT_N(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": %u,\n", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_UINT_L(P, Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": %u,", P, Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_UINT_LN(P, Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": %u,\n", P, Key, Val)
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_STRUINT(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": \"%u\",", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_STRUINT_N(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": \"%u\",\n", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_STRUINT_L(P, Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": \"%u\",", P, Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_STRUINT_LN(P, Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": \"%u\",\n", P, Key, Val)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_STRSINT(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": \"%d\",", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_STRSINT_N(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": \"%d\",\n", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_STRSINT_L(P, Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": \"%d\",", P, Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_STRSINT_LN(P, Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": \"%d\",\n", P, Key, Val)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_CTRL_INT(Prefix, Key, Field) \
|
||||||
|
if (def->Field != data->Field) \
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s{ \"%s\": \"%d\" },\n", Prefix, Key, data->Field)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_CTRL_STRN(P, Key, Field) \
|
||||||
|
if (strcmp(def->Field, data->Field)) \
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s{ \"%s\": \"%s\" },\n", P, Key, data->Field)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_CTRL_STRN_STR(P, Key, ptr) \
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s{ \"%s\": \"%s\" },\n", P, Key, ptr)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_CTRL_PUB_STRN(P, Key, Field) \
|
||||||
|
if (strcmp(def->Field, g_pub_path)) \
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s{ \"%s\": \"%s\" },\n", P, Key, g_pub_path)
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_DIFF_STRN(P, Key, Field) \
|
||||||
|
if (strcmp(def->Field, data->Field)) \
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": \"%s\",\n", P, Key, data->Field)
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_STRINT64(Key, Val) \
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": \"%llu\",", Key, Val)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_SINT(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": %d,", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_SINT_N(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": %d,\n", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_SINT_L(P, Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": %d,", P, Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_SINT_LN(P, Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": %d,\n", P, Key, Val)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_DUBL(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": %.1lf,", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_DUBL2(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": %10.02lf,", Key, Val)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_STRN(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": \"%s\",", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_STRN_N(Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": \"%s\",\n", Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_STRN_L(P, Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": \"%s\",", P, Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_STRN_LN(P, Key, Val) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": \"%s\",\n", P, Key, Val)
|
||||||
|
#define VTOY_JSON_FMT_STRN_PATH_LN(P, Key, Val) \
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": \"%s\",\n", P, Key, ventoy_real_path(Val))
|
||||||
|
|
||||||
|
int vtoy_json_escape_string(char *buf, int buflen, const char *str, int newline);
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_STRN_EX_LN(P, Key, Val) \
|
||||||
|
{\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "%s\"%s\": ", P, Key);\
|
||||||
|
__uiCurPos += vtoy_json_escape_string(__pcBuf + __uiCurPos, __uiBufLen - __uiCurPos, Val, 1);\
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_NULL(Key) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": null,", Key)
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_TRUE(Key) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": true,", (Key))
|
||||||
|
#define VTOY_JSON_FMT_FALSE(Key) ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": false,", (Key))
|
||||||
|
|
||||||
|
#define VTOY_JSON_FMT_BOOL(Key, Val) \
|
||||||
|
{\
|
||||||
|
if (0 == (Val))\
|
||||||
|
{\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": false,", (Key));\
|
||||||
|
}\
|
||||||
|
else \
|
||||||
|
{\
|
||||||
|
ssprintf(__uiCurPos, __pcBuf, __uiBufLen, "\"%s\": true,", (Key));\
|
||||||
|
}\
|
||||||
|
}
|
||||||
|
|
||||||
|
typedef struct tagVTOY_JSON_PARSE
|
||||||
|
{
|
||||||
|
char *pcKey;
|
||||||
|
void *pDataBuf;
|
||||||
|
uint32_t uiBufSize;
|
||||||
|
}VTOY_JSON_PARSE_S;
|
||||||
|
|
||||||
|
#define JSON_SUCCESS 0
|
||||||
|
#define JSON_FAILED 1
|
||||||
|
#define JSON_NOT_FOUND 2
|
||||||
|
|
||||||
|
int vtoy_json_parse_value
|
||||||
|
(
|
||||||
|
char *pcNewStart,
|
||||||
|
char *pcRawStart,
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *pcData,
|
||||||
|
const char **ppcEnd
|
||||||
|
);
|
||||||
|
VTOY_JSON * vtoy_json_create(void);
|
||||||
|
int vtoy_json_parse(VTOY_JSON *pstJson, const char *szJsonData);
|
||||||
|
int vtoy_json_parse_ex(VTOY_JSON *pstJson, const char *szJsonData, int szLen);
|
||||||
|
int vtoy_json_destroy(VTOY_JSON *pstJson);
|
||||||
|
VTOY_JSON *vtoy_json_find_item
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
JSON_TYPE enDataType,
|
||||||
|
const char *szKey
|
||||||
|
);
|
||||||
|
int vtoy_json_scan_parse
|
||||||
|
(
|
||||||
|
const VTOY_JSON *pstJson,
|
||||||
|
uint32_t uiParseNum,
|
||||||
|
VTOY_JSON_PARSE_S *pstJsonParse
|
||||||
|
);
|
||||||
|
int vtoy_json_get_int
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
int *piValue
|
||||||
|
);
|
||||||
|
int vtoy_json_get_uint
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
uint32_t *puiValue
|
||||||
|
);
|
||||||
|
int vtoy_json_get_uint64
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
uint64_t *pui64Value
|
||||||
|
);
|
||||||
|
int vtoy_json_get_bool
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
uint8_t *pbValue
|
||||||
|
);
|
||||||
|
int vtoy_json_get_string
|
||||||
|
(
|
||||||
|
VTOY_JSON *pstJson,
|
||||||
|
const char *szKey,
|
||||||
|
uint32_t uiBufLen,
|
||||||
|
char *pcBuf
|
||||||
|
);
|
||||||
|
const char * vtoy_json_get_string_ex(VTOY_JSON *pstJson, const char *szKey);
|
||||||
|
|
||||||
|
#endif /* __VENTOY_JSON_H__ */
|
||||||
|
|
||||||
|
|
@ -0,0 +1,151 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_log.c ---- ventoy log
|
||||||
|
*
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <ventoy_define.h>
|
||||||
|
#include <ventoy_util.h>
|
||||||
|
|
||||||
|
extern char g_log_file[MAX_PATH];
|
||||||
|
static int g_ventoy_log_level = VLOG_DEBUG;
|
||||||
|
static pthread_mutex_t g_log_mutex;
|
||||||
|
|
||||||
|
int ventoy_log_init(void)
|
||||||
|
{
|
||||||
|
if (ventoy_get_file_size(g_log_file) >= SIZE_1MB)
|
||||||
|
{
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
DeleteFileA(g_log_file);
|
||||||
|
#else
|
||||||
|
remove(g_log_file);
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
|
||||||
|
pthread_mutex_init(&g_log_mutex, NULL);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_log_exit(void)
|
||||||
|
{
|
||||||
|
pthread_mutex_destroy(&g_log_mutex);
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_set_loglevel(int level)
|
||||||
|
{
|
||||||
|
g_ventoy_log_level = level;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
void ventoy_syslog_printf(const char *Fmt, ...)
|
||||||
|
{
|
||||||
|
char log[512];
|
||||||
|
va_list arg;
|
||||||
|
time_t stamp;
|
||||||
|
struct tm ttm;
|
||||||
|
FILE *fp;
|
||||||
|
|
||||||
|
time(&stamp);
|
||||||
|
localtime_r(&stamp, &ttm);
|
||||||
|
|
||||||
|
va_start(arg, Fmt);
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
vsnprintf_s(log, 512, _TRUNCATE, Fmt, arg);
|
||||||
|
#else
|
||||||
|
vsnprintf(log, 512, Fmt, arg);
|
||||||
|
#endif
|
||||||
|
va_end(arg);
|
||||||
|
|
||||||
|
pthread_mutex_lock(&g_log_mutex);
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
fopen_s(&fp, g_log_file, "a+");
|
||||||
|
#else
|
||||||
|
fp = fopen(g_log_file, "a+");
|
||||||
|
#endif
|
||||||
|
|
||||||
|
if (fp)
|
||||||
|
{
|
||||||
|
fprintf(fp, "[%04u/%02u/%02u %02u:%02u:%02u] %s",
|
||||||
|
ttm.tm_year, ttm.tm_mon + 1, ttm.tm_mday,
|
||||||
|
ttm.tm_hour, ttm.tm_min, ttm.tm_sec,
|
||||||
|
log);
|
||||||
|
fclose(fp);
|
||||||
|
|
||||||
|
#ifdef VENTOY_SIM
|
||||||
|
printf("[%04u/%02u/%02u %02u:%02u:%02u] %s",
|
||||||
|
ttm.tm_year, ttm.tm_mon + 1, ttm.tm_mday,
|
||||||
|
ttm.tm_hour, ttm.tm_min, ttm.tm_sec,
|
||||||
|
log);
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
pthread_mutex_unlock(&g_log_mutex);
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_syslog(int level, const char *Fmt, ...)
|
||||||
|
{
|
||||||
|
char log[512];
|
||||||
|
va_list arg;
|
||||||
|
time_t stamp;
|
||||||
|
struct tm ttm;
|
||||||
|
FILE *fp;
|
||||||
|
|
||||||
|
if (level > g_ventoy_log_level)
|
||||||
|
{
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
time(&stamp);
|
||||||
|
localtime_r(&stamp, &ttm);
|
||||||
|
|
||||||
|
va_start(arg, Fmt);
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
vsnprintf_s(log, 512, _TRUNCATE, Fmt, arg);
|
||||||
|
#else
|
||||||
|
vsnprintf(log, 512, Fmt, arg);
|
||||||
|
#endif
|
||||||
|
va_end(arg);
|
||||||
|
|
||||||
|
pthread_mutex_lock(&g_log_mutex);
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
fopen_s(&fp, g_log_file, "a+");
|
||||||
|
#else
|
||||||
|
fp = fopen(g_log_file, "a+");
|
||||||
|
#endif
|
||||||
|
if (fp)
|
||||||
|
{
|
||||||
|
fprintf(fp, "[%04u/%02u/%02u %02u:%02u:%02u] %s",
|
||||||
|
ttm.tm_year + 1900, ttm.tm_mon + 1, ttm.tm_mday,
|
||||||
|
ttm.tm_hour, ttm.tm_min, ttm.tm_sec,
|
||||||
|
log);
|
||||||
|
fclose(fp);
|
||||||
|
|
||||||
|
#ifdef VENTOY_SIM
|
||||||
|
printf("[%04u/%02u/%02u %02u:%02u:%02u] %s",
|
||||||
|
ttm.tm_year + 1900, ttm.tm_mon + 1, ttm.tm_mday,
|
||||||
|
ttm.tm_hour, ttm.tm_min, ttm.tm_sec,
|
||||||
|
log);
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
pthread_mutex_unlock(&g_log_mutex);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
@ -0,0 +1,166 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_md5.c ---- ventoy md5
|
||||||
|
*
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <errno.h>
|
||||||
|
|
||||||
|
const static uint32_t k[64] =
|
||||||
|
{
|
||||||
|
0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee,
|
||||||
|
0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501,
|
||||||
|
0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be,
|
||||||
|
0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821,
|
||||||
|
0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa,
|
||||||
|
0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8,
|
||||||
|
0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed,
|
||||||
|
0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a,
|
||||||
|
0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c,
|
||||||
|
0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70,
|
||||||
|
0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05,
|
||||||
|
0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665,
|
||||||
|
0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039,
|
||||||
|
0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1,
|
||||||
|
0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1,
|
||||||
|
0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391
|
||||||
|
};
|
||||||
|
|
||||||
|
const static uint32_t r[] =
|
||||||
|
{
|
||||||
|
7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
|
||||||
|
5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
|
||||||
|
4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
|
||||||
|
6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21
|
||||||
|
};
|
||||||
|
|
||||||
|
#define LEFTROTATE(x, c) (((x) << (c)) | ((x) >> (32 - (c))))
|
||||||
|
#define to_bytes(val, bytes) *((uint32_t *)(bytes)) = (val)
|
||||||
|
|
||||||
|
#define ROTATE_CALC() \
|
||||||
|
{\
|
||||||
|
temp = d; \
|
||||||
|
d = c; \
|
||||||
|
c = b; \
|
||||||
|
b = b + LEFTROTATE((a + f + k[i] + w[g]), r[i]); \
|
||||||
|
a = temp; \
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_md5(const void *data, uint32_t len, uint8_t *md5)
|
||||||
|
{
|
||||||
|
uint32_t h0, h1, h2, h3;
|
||||||
|
uint32_t w[16];
|
||||||
|
uint32_t a, b, c, d, i, f, g, temp;
|
||||||
|
uint32_t offset, mod, delta;
|
||||||
|
uint8_t postbuf[128] = {0};
|
||||||
|
|
||||||
|
// Initialize variables - simple count in nibbles:
|
||||||
|
h0 = 0x67452301;
|
||||||
|
h1 = 0xefcdab89;
|
||||||
|
h2 = 0x98badcfe;
|
||||||
|
h3 = 0x10325476;
|
||||||
|
|
||||||
|
//Pre-processing:
|
||||||
|
//append "1" bit to message
|
||||||
|
//append "0" bits until message length in bits ¡Ô 448 (mod 512)
|
||||||
|
//append length mod (2^64) to message
|
||||||
|
|
||||||
|
mod = len % 64;
|
||||||
|
if (mod)
|
||||||
|
{
|
||||||
|
memcpy(postbuf, (const uint8_t *)data + len - mod, mod);
|
||||||
|
}
|
||||||
|
|
||||||
|
postbuf[mod] = 0x80;
|
||||||
|
if (mod < 56)
|
||||||
|
{
|
||||||
|
to_bytes(len * 8, postbuf + 56);
|
||||||
|
to_bytes(len >> 29, postbuf + 60);
|
||||||
|
delta = 64;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
to_bytes(len * 8, postbuf + 120);
|
||||||
|
to_bytes(len >> 29, postbuf + 124);
|
||||||
|
delta = 128;
|
||||||
|
}
|
||||||
|
|
||||||
|
len -= mod;
|
||||||
|
|
||||||
|
for (offset = 0; offset < len + delta; offset += 64)
|
||||||
|
{
|
||||||
|
if (offset < len)
|
||||||
|
{
|
||||||
|
memcpy(w, (const uint8_t *)data + offset, 64);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
memcpy(w, postbuf + offset - len, 64);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Initialize hash value for this chunk:
|
||||||
|
a = h0;
|
||||||
|
b = h1;
|
||||||
|
c = h2;
|
||||||
|
d = h3;
|
||||||
|
|
||||||
|
// Main loop:
|
||||||
|
for (i = 0; i < 16; i++)
|
||||||
|
{
|
||||||
|
f = (b & c) | ((~b) & d);
|
||||||
|
g = i;
|
||||||
|
ROTATE_CALC();
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 16; i < 32; i++)
|
||||||
|
{
|
||||||
|
f = (d & b) | ((~d) & c);
|
||||||
|
g = (5 * i + 1) % 16;
|
||||||
|
ROTATE_CALC();
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 32; i < 48; i++)
|
||||||
|
{
|
||||||
|
f = b ^ c ^ d;
|
||||||
|
g = (3 * i + 5) % 16;
|
||||||
|
ROTATE_CALC();
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 48; i < 64; i++)
|
||||||
|
{
|
||||||
|
f = c ^ (b | (~d));
|
||||||
|
g = (7 * i) % 16;
|
||||||
|
ROTATE_CALC();
|
||||||
|
}
|
||||||
|
|
||||||
|
// Add this chunk's hash to result so far:
|
||||||
|
h0 += a;
|
||||||
|
h1 += b;
|
||||||
|
h2 += c;
|
||||||
|
h3 += d;
|
||||||
|
}
|
||||||
|
|
||||||
|
//var char md5[16] := h0 append h1 append h2 append h3 //(Output is in little-endian)
|
||||||
|
to_bytes(h0, md5);
|
||||||
|
to_bytes(h1, md5 + 4);
|
||||||
|
to_bytes(h2, md5 + 8);
|
||||||
|
to_bytes(h3, md5 + 12);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
@ -0,0 +1,255 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_util.c ---- ventoy util
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <sys/stat.h>
|
||||||
|
#include <ventoy_define.h>
|
||||||
|
#include <ventoy_util.h>
|
||||||
|
|
||||||
|
|
||||||
|
static int g_tar_filenum = 0;
|
||||||
|
static char *g_tar_buffer = NULL;
|
||||||
|
static ventoy_file *g_tar_filelist = NULL;
|
||||||
|
|
||||||
|
SYSINFO g_sysinfo;
|
||||||
|
|
||||||
|
unsigned char *g_unxz_buffer = NULL;
|
||||||
|
int g_unxz_len = 0;
|
||||||
|
|
||||||
|
void unxz_error(char *x)
|
||||||
|
{
|
||||||
|
vlog("%s\n", x);
|
||||||
|
}
|
||||||
|
|
||||||
|
int unxz_flush(void *src, unsigned int size)
|
||||||
|
{
|
||||||
|
memcpy(g_unxz_buffer + g_unxz_len, src, size);
|
||||||
|
g_unxz_len += (int)size;
|
||||||
|
|
||||||
|
return (int)size;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
uint64_t ventoy_get_human_readable_gb(uint64_t SizeBytes)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
int Pow2 = 1;
|
||||||
|
double Delta;
|
||||||
|
double GB = SizeBytes * 1.0 / 1000 / 1000 / 1000;
|
||||||
|
|
||||||
|
if ((SizeBytes % SIZE_1GB) == 0)
|
||||||
|
{
|
||||||
|
return (uint64_t)(SizeBytes / SIZE_1GB);
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 0; i < 12; i++)
|
||||||
|
{
|
||||||
|
if (Pow2 > GB)
|
||||||
|
{
|
||||||
|
Delta = (Pow2 - GB) / Pow2;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
Delta = (GB - Pow2) / Pow2;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (Delta < 0.05)
|
||||||
|
{
|
||||||
|
return Pow2;
|
||||||
|
}
|
||||||
|
|
||||||
|
Pow2 <<= 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
return (uint64_t)GB;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_read_file_to_buf(const char *FileName, int ExtLen, void **Bufer, int *BufLen)
|
||||||
|
{
|
||||||
|
int FileSize;
|
||||||
|
FILE *fp = NULL;
|
||||||
|
void *Data = NULL;
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
fopen_s(&fp, FileName, "rb");
|
||||||
|
#else
|
||||||
|
fp = fopen(FileName, "rb");
|
||||||
|
#endif
|
||||||
|
if (fp == NULL)
|
||||||
|
{
|
||||||
|
vlog("Failed to open file %s", FileName);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
fseek(fp, 0, SEEK_END);
|
||||||
|
FileSize = (int)ftell(fp);
|
||||||
|
|
||||||
|
Data = malloc(FileSize + ExtLen);
|
||||||
|
if (!Data)
|
||||||
|
{
|
||||||
|
fclose(fp);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
fseek(fp, 0, SEEK_SET);
|
||||||
|
fread(Data, 1, FileSize, fp);
|
||||||
|
|
||||||
|
fclose(fp);
|
||||||
|
|
||||||
|
*Bufer = Data;
|
||||||
|
*BufLen = FileSize;
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
ventoy_file * ventoy_tar_find_file(const char *path)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
int len;
|
||||||
|
ventoy_file *node = g_tar_filelist;
|
||||||
|
|
||||||
|
len = (int)strlen(path);
|
||||||
|
|
||||||
|
for (i = 0; i < g_tar_filenum; i++, node++)
|
||||||
|
{
|
||||||
|
if (node->pathlen == len && memcmp(node->path, path, len) == 0)
|
||||||
|
{
|
||||||
|
return node;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (node->pathlen > len)
|
||||||
|
{
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_www_init(void)
|
||||||
|
{
|
||||||
|
int i = 0;
|
||||||
|
int j = 0;
|
||||||
|
int size = 0;
|
||||||
|
int tarsize = 0;
|
||||||
|
int offset = 0;
|
||||||
|
ventoy_file *node = NULL;
|
||||||
|
ventoy_file *node2 = NULL;
|
||||||
|
VENTOY_TAR_HEAD *pHead = NULL;
|
||||||
|
ventoy_file tmpnode;
|
||||||
|
|
||||||
|
if (!g_tar_filelist)
|
||||||
|
{
|
||||||
|
g_tar_filelist = malloc(VENTOY_FILE_MAX * sizeof(ventoy_file));
|
||||||
|
g_tar_buffer = malloc(TAR_BUF_MAX);
|
||||||
|
g_tar_filenum = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if ((!g_tar_filelist) || (!g_tar_buffer))
|
||||||
|
{
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (ventoy_decompress_tar(g_tar_buffer, TAR_BUF_MAX, &tarsize))
|
||||||
|
{
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
pHead = (VENTOY_TAR_HEAD *)g_tar_buffer;
|
||||||
|
node = g_tar_filelist;
|
||||||
|
|
||||||
|
while (g_tar_filenum < VENTOY_FILE_MAX && size < tarsize && memcmp(pHead->magic, TMAGIC, 5) == 0)
|
||||||
|
{
|
||||||
|
if (pHead->typeflag == REGTYPE)
|
||||||
|
{
|
||||||
|
node->size = (int)strtol(pHead->size, NULL, 8);
|
||||||
|
node->pathlen = (int)scnprintf(node->path, MAX_PATH, "%s", pHead->name);
|
||||||
|
node->addr = pHead + 1;
|
||||||
|
|
||||||
|
if (node->pathlen == 13 && strcmp(pHead->name, "www/buildtime") == 0)
|
||||||
|
{
|
||||||
|
scnprintf(g_sysinfo.buildtime, sizeof(g_sysinfo.buildtime), "%s", (char *)node->addr);
|
||||||
|
vlog("Plugson buildtime %s\n", g_sysinfo.buildtime);
|
||||||
|
}
|
||||||
|
|
||||||
|
offset = 512 + VENTOY_UP_ALIGN(node->size, 512);
|
||||||
|
|
||||||
|
node++;
|
||||||
|
g_tar_filenum++;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
offset = 512;
|
||||||
|
}
|
||||||
|
|
||||||
|
pHead = (VENTOY_TAR_HEAD *)((char *)pHead + offset);
|
||||||
|
size += offset;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
//sort
|
||||||
|
for (i = 0; i < g_tar_filenum; i++)
|
||||||
|
for (j = i + 1; j < g_tar_filenum; j++)
|
||||||
|
{
|
||||||
|
node = g_tar_filelist + i;
|
||||||
|
node2 = g_tar_filelist + j;
|
||||||
|
|
||||||
|
if (node->pathlen > node2->pathlen)
|
||||||
|
{
|
||||||
|
memcpy(&tmpnode, node, sizeof(ventoy_file));
|
||||||
|
memcpy(node, node2, sizeof(ventoy_file));
|
||||||
|
memcpy(node2, &tmpnode, sizeof(ventoy_file));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
vlog("Total extract %d files from tar file.\n", g_tar_filenum);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_www_exit(void)
|
||||||
|
{
|
||||||
|
check_free(g_tar_filelist);
|
||||||
|
check_free(g_tar_buffer);
|
||||||
|
g_tar_filelist = NULL;
|
||||||
|
g_tar_buffer = NULL;
|
||||||
|
g_tar_filenum = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
void ventoy_get_json_path(char *path, char *backup)
|
||||||
|
{
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
scnprintf(path, 64, "%C:\\ventoy\\ventoy.json", g_cur_dir[0]);
|
||||||
|
if (backup)
|
||||||
|
{
|
||||||
|
scnprintf(backup, 64, "%C:\\ventoy\\ventoy_backup.json", g_cur_dir[0]);
|
||||||
|
}
|
||||||
|
#else
|
||||||
|
scnprintf(path, 64, "%s/ventoy/ventoy.json", g_cur_dir);
|
||||||
|
if (backup)
|
||||||
|
{
|
||||||
|
scnprintf(backup, 64, "%s/ventoy/ventoy_backup.json", g_cur_dir);
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,210 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_util.h
|
||||||
|
*
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#ifndef __VENTOY_UTIL_H__
|
||||||
|
#define __VENTOY_UTIL_H__
|
||||||
|
|
||||||
|
#define check_free(p) if (p) free(p)
|
||||||
|
#define vtoy_safe_close_fd(fd) \
|
||||||
|
{\
|
||||||
|
if ((fd) >= 0) \
|
||||||
|
{ \
|
||||||
|
close(fd); \
|
||||||
|
(fd) = -1; \
|
||||||
|
}\
|
||||||
|
}
|
||||||
|
|
||||||
|
extern char g_cur_dir[MAX_PATH];
|
||||||
|
extern char g_ventoy_dir[MAX_PATH];
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
|
||||||
|
typedef HANDLE pthread_mutex_t;
|
||||||
|
|
||||||
|
static __inline int pthread_mutex_init(pthread_mutex_t *mutex, void *unused)
|
||||||
|
{
|
||||||
|
(void)unused;
|
||||||
|
*mutex = CreateMutex(NULL, FALSE, NULL);
|
||||||
|
return *mutex == NULL ? -1 : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static __inline int pthread_mutex_destroy(pthread_mutex_t *mutex)
|
||||||
|
{
|
||||||
|
return CloseHandle(*mutex) == 0 ? -1 : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static __inline int pthread_mutex_unlock(pthread_mutex_t *mutex)
|
||||||
|
{
|
||||||
|
return ReleaseMutex(*mutex) == 0 ? -1 : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static __inline int pthread_mutex_lock(pthread_mutex_t *mutex)
|
||||||
|
{
|
||||||
|
return WaitForSingleObject(*mutex, INFINITE) == WAIT_OBJECT_0 ? 0 : -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_path_case(char *path, int slash);
|
||||||
|
|
||||||
|
#else
|
||||||
|
int ventoy_get_sys_file_line(char *buffer, int buflen, const char *fmt, ...);
|
||||||
|
|
||||||
|
#define UINT8 uint8_t
|
||||||
|
#define UINT16 uint16_t
|
||||||
|
#define UINT32 uint32_t
|
||||||
|
#define UINT64 uint64_t
|
||||||
|
|
||||||
|
static inline int ventoy_path_case(char *path, int slash)
|
||||||
|
{
|
||||||
|
(void)path;
|
||||||
|
(void)slash;
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
|
||||||
|
#define LANGUAGE_EN 0
|
||||||
|
#define LANGUAGE_CN 1
|
||||||
|
|
||||||
|
typedef struct SYSINFO
|
||||||
|
{
|
||||||
|
char buildtime[128];
|
||||||
|
int syntax_error;
|
||||||
|
|
||||||
|
int language;
|
||||||
|
int pathcase;
|
||||||
|
char cur_fsname[64];
|
||||||
|
char cur_capacity[64];
|
||||||
|
char cur_model[256];
|
||||||
|
char cur_ventoy_ver[64];
|
||||||
|
int cur_secureboot;
|
||||||
|
int cur_part_style;
|
||||||
|
|
||||||
|
char ip[32];
|
||||||
|
char port[16];
|
||||||
|
}SYSINFO;
|
||||||
|
|
||||||
|
extern SYSINFO g_sysinfo;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#define TMAGIC "ustar"
|
||||||
|
|
||||||
|
#define REGTYPE '0'
|
||||||
|
#define AREGTYPE '\0'
|
||||||
|
#define LNKTYPE '1'
|
||||||
|
#define CHRTYPE '3'
|
||||||
|
#define BLKTYPE '4'
|
||||||
|
#define DIRTYPE '5'
|
||||||
|
#define FIFOTYPE '6'
|
||||||
|
#define CONTTYPE '7'
|
||||||
|
|
||||||
|
#pragma pack(1)
|
||||||
|
|
||||||
|
typedef struct tag_tar_head
|
||||||
|
{
|
||||||
|
char name[100];
|
||||||
|
char mode[8];
|
||||||
|
char uid[8];
|
||||||
|
char gid[8];
|
||||||
|
char size[12];
|
||||||
|
char mtime[12];
|
||||||
|
char chksum[8];
|
||||||
|
char typeflag;
|
||||||
|
char linkname[100];
|
||||||
|
char magic[6];
|
||||||
|
char version[2];
|
||||||
|
char uname[32];
|
||||||
|
char gname[32];
|
||||||
|
char devmajor[8];
|
||||||
|
char devminor[8];
|
||||||
|
char prefix[155];
|
||||||
|
char padding[12];
|
||||||
|
}VENTOY_TAR_HEAD;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
typedef struct VENTOY_MAGIC
|
||||||
|
{
|
||||||
|
uint32_t magic1; // 0x51 0x52 0x53 0x54
|
||||||
|
uint32_t xzlen; //
|
||||||
|
uint32_t magic2; // 0xa1 0xa2 0xa3 0xa4
|
||||||
|
}VENTOY_MAGIC;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#pragma pack()
|
||||||
|
|
||||||
|
#define VENTOY_UP_ALIGN(N, align) (((N) + ((align) - 1)) / (align) * (align))
|
||||||
|
#define VENTOY_FILE_MAX 2048
|
||||||
|
|
||||||
|
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
#define million_sleep(a) Sleep(a)
|
||||||
|
#else
|
||||||
|
#define million_sleep(a) usleep((a) * 1000)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
|
||||||
|
typedef struct ventoy_file
|
||||||
|
{
|
||||||
|
int size;
|
||||||
|
char path[MAX_PATH];
|
||||||
|
int pathlen;
|
||||||
|
void *addr;
|
||||||
|
}ventoy_file;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_is_file_exist(const char *fmt, ...);
|
||||||
|
int ventoy_is_directory_exist(const char *fmt, ...);
|
||||||
|
void ventoy_gen_preudo_uuid(void *uuid);
|
||||||
|
uint64_t ventoy_get_human_readable_gb(uint64_t SizeBytes);
|
||||||
|
void ventoy_md5(const void *data, uint32_t len, uint8_t *md5);
|
||||||
|
int ventoy_is_disk_mounted(const char *devpath);
|
||||||
|
int unxz(unsigned char *in, int in_size,
|
||||||
|
int (*fill)(void *dest, unsigned int size),
|
||||||
|
int (*flush)(void *src, unsigned int size),
|
||||||
|
unsigned char *out, int *in_used,
|
||||||
|
void (*error)(char *x));
|
||||||
|
int ventoy_read_file_to_buf(const char *FileName, int ExtLen, void **Bufer, int *BufLen);
|
||||||
|
int ventoy_write_buf_to_file(const char *FileName, void *Bufer, int BufLen);
|
||||||
|
const char * ventoy_get_os_language(void);
|
||||||
|
int ventoy_get_file_size(const char *file);
|
||||||
|
int ventoy_www_init(void);
|
||||||
|
void ventoy_www_exit(void);
|
||||||
|
int ventoy_decompress_tar(char *tarbuf, int buflen, int *tarsize);
|
||||||
|
ventoy_file * ventoy_tar_find_file(const char *path);
|
||||||
|
void ventoy_get_json_path(char *path, char *backup);
|
||||||
|
int ventoy_copy_file(const char *a, const char *b);
|
||||||
|
|
||||||
|
typedef int (*ventoy_http_writeback_pf)(void);
|
||||||
|
|
||||||
|
int ventoy_start_writeback_thread(ventoy_http_writeback_pf callback);
|
||||||
|
void ventoy_stop_writeback_thread(void);
|
||||||
|
void ventoy_set_writeback_event(void);
|
||||||
|
|
||||||
|
|
||||||
|
extern unsigned char *g_unxz_buffer;
|
||||||
|
extern int g_unxz_len;
|
||||||
|
void unxz_error(char *x);
|
||||||
|
int unxz_flush(void *src, unsigned int size);
|
||||||
|
|
||||||
|
#endif /* __VENTOY_UTIL_H__ */
|
||||||
|
|
||||||
|
|
@ -0,0 +1,344 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_util_linux.c ---- ventoy util
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <stdarg.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <fcntl.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <sys/ioctl.h>
|
||||||
|
#include <sys/stat.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <sys/mount.h>
|
||||||
|
#include <linux/fs.h>
|
||||||
|
#include <dirent.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <ventoy_define.h>
|
||||||
|
#include <ventoy_util.h>
|
||||||
|
|
||||||
|
void ventoy_gen_preudo_uuid(void *uuid)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
int fd;
|
||||||
|
|
||||||
|
fd = open("/dev/urandom", O_RDONLY | O_BINARY);
|
||||||
|
if (fd < 0)
|
||||||
|
{
|
||||||
|
srand(time(NULL));
|
||||||
|
for (i = 0; i < 8; i++)
|
||||||
|
{
|
||||||
|
*((uint16_t *)uuid + i) = (uint16_t)(rand() & 0xFFFF);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
read(fd, uuid, 16);
|
||||||
|
close(fd);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_get_sys_file_line(char *buffer, int buflen, const char *fmt, ...)
|
||||||
|
{
|
||||||
|
int len;
|
||||||
|
char c;
|
||||||
|
char path[256];
|
||||||
|
va_list arg;
|
||||||
|
|
||||||
|
va_start(arg, fmt);
|
||||||
|
vsnprintf(path, 256, fmt, arg);
|
||||||
|
va_end(arg);
|
||||||
|
|
||||||
|
if (access(path, F_OK) >= 0)
|
||||||
|
{
|
||||||
|
FILE *fp = fopen(path, "r");
|
||||||
|
memset(buffer, 0, buflen);
|
||||||
|
len = (int)fread(buffer, 1, buflen - 1, fp);
|
||||||
|
fclose(fp);
|
||||||
|
|
||||||
|
while (len > 0)
|
||||||
|
{
|
||||||
|
c = buffer[len - 1];
|
||||||
|
if (c == '\r' || c == '\n' || c == ' ' || c == '\t')
|
||||||
|
{
|
||||||
|
buffer[len - 1] = 0;
|
||||||
|
len--;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vdebug("%s not exist \n", path);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_is_disk_mounted(const char *devpath)
|
||||||
|
{
|
||||||
|
int len;
|
||||||
|
int mount = 0;
|
||||||
|
char line[512];
|
||||||
|
FILE *fp = NULL;
|
||||||
|
|
||||||
|
fp = fopen("/proc/mounts", "r");
|
||||||
|
if (!fp)
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
len = (int)strlen(devpath);
|
||||||
|
while (fgets(line, sizeof(line), fp))
|
||||||
|
{
|
||||||
|
if (strncmp(line, devpath, len) == 0)
|
||||||
|
{
|
||||||
|
mount = 1;
|
||||||
|
vdebug("%s mounted <%s>\n", devpath, line);
|
||||||
|
goto end;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
end:
|
||||||
|
fclose(fp);
|
||||||
|
return mount;
|
||||||
|
}
|
||||||
|
|
||||||
|
const char * ventoy_get_os_language(void)
|
||||||
|
{
|
||||||
|
const char *env = getenv("LANG");
|
||||||
|
|
||||||
|
if (env && strncasecmp(env, "zh_CN", 5) == 0)
|
||||||
|
{
|
||||||
|
return "cn";
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
return "en";
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_is_file_exist(const char *fmt, ...)
|
||||||
|
{
|
||||||
|
va_list ap;
|
||||||
|
struct stat sb;
|
||||||
|
char fullpath[MAX_PATH];
|
||||||
|
|
||||||
|
va_start (ap, fmt);
|
||||||
|
vsnprintf(fullpath, MAX_PATH, fmt, ap);
|
||||||
|
va_end (ap);
|
||||||
|
|
||||||
|
if (stat(fullpath, &sb))
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (S_ISREG(sb.st_mode))
|
||||||
|
{
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_is_directory_exist(const char *fmt, ...)
|
||||||
|
{
|
||||||
|
va_list ap;
|
||||||
|
struct stat sb;
|
||||||
|
char fullpath[MAX_PATH];
|
||||||
|
|
||||||
|
va_start (ap, fmt);
|
||||||
|
vsnprintf(fullpath, MAX_PATH, fmt, ap);
|
||||||
|
va_end (ap);
|
||||||
|
|
||||||
|
if (stat(fullpath, &sb))
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (S_ISDIR(sb.st_mode))
|
||||||
|
{
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_get_file_size(const char *file)
|
||||||
|
{
|
||||||
|
int Size = -1;
|
||||||
|
struct stat stStat;
|
||||||
|
|
||||||
|
if (stat(file, &stStat) >= 0)
|
||||||
|
{
|
||||||
|
Size = (int)(stStat.st_size);
|
||||||
|
}
|
||||||
|
|
||||||
|
return Size;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_write_buf_to_file(const char *FileName, void *Bufer, int BufLen)
|
||||||
|
{
|
||||||
|
int fd;
|
||||||
|
int rc;
|
||||||
|
ssize_t size;
|
||||||
|
|
||||||
|
fd = open(FileName, O_CREAT | O_RDWR | O_TRUNC, 0755);
|
||||||
|
if (fd < 0)
|
||||||
|
{
|
||||||
|
vlog("Failed to open file %s %d\n", FileName, errno);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
rc = fchmod(fd, 0755);
|
||||||
|
if (rc)
|
||||||
|
{
|
||||||
|
vlog("Failed to chmod <%s> %d\n", FileName, errno);
|
||||||
|
}
|
||||||
|
|
||||||
|
size = write(fd, Bufer, BufLen);
|
||||||
|
if ((int)size != BufLen)
|
||||||
|
{
|
||||||
|
close(fd);
|
||||||
|
vlog("write file %s failed %d err:%d\n", FileName, (int)size, errno);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
fsync(fd);
|
||||||
|
close(fd);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_decompress_tar(char *tarbuf, int buflen, int *tarsize)
|
||||||
|
{
|
||||||
|
int rc = 1;
|
||||||
|
int inused = 0;
|
||||||
|
int BufLen = 0;
|
||||||
|
unsigned char *buffer = NULL;
|
||||||
|
char tarxz[MAX_PATH];
|
||||||
|
|
||||||
|
scnprintf(tarxz, sizeof(tarxz), "%s/tool/plugson.tar.xz", g_ventoy_dir);
|
||||||
|
if (ventoy_read_file_to_buf(tarxz, 0, (void **)&buffer, &BufLen))
|
||||||
|
{
|
||||||
|
vlog("Failed to read file <%s>\n", tarxz);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
g_unxz_buffer = (unsigned char *)tarbuf;
|
||||||
|
g_unxz_len = 0;
|
||||||
|
|
||||||
|
unxz(buffer, BufLen, NULL, unxz_flush, NULL, &inused, unxz_error);
|
||||||
|
vlog("xzlen:%u rawdata size:%d\n", BufLen, g_unxz_len);
|
||||||
|
|
||||||
|
if (inused != BufLen)
|
||||||
|
{
|
||||||
|
vlog("Failed to unxz data %d %d\n", inused, BufLen);
|
||||||
|
rc = 1;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
*tarsize = g_unxz_len;
|
||||||
|
rc = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
free(buffer);
|
||||||
|
|
||||||
|
return rc;
|
||||||
|
}
|
||||||
|
|
||||||
|
static volatile int g_thread_stop = 0;
|
||||||
|
static pthread_t g_writeback_thread;
|
||||||
|
static pthread_mutex_t g_writeback_mutex;
|
||||||
|
static pthread_cond_t g_writeback_cond;
|
||||||
|
static void * ventoy_local_thread_run(void* data)
|
||||||
|
{
|
||||||
|
ventoy_http_writeback_pf callback = (ventoy_http_writeback_pf)data;
|
||||||
|
|
||||||
|
while (1)
|
||||||
|
{
|
||||||
|
pthread_mutex_lock(&g_writeback_mutex);
|
||||||
|
pthread_cond_wait(&g_writeback_cond, &g_writeback_mutex);
|
||||||
|
|
||||||
|
if (g_thread_stop)
|
||||||
|
{
|
||||||
|
pthread_mutex_unlock(&g_writeback_mutex);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
callback();
|
||||||
|
pthread_mutex_unlock(&g_writeback_mutex);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_set_writeback_event(void)
|
||||||
|
{
|
||||||
|
pthread_cond_signal(&g_writeback_cond);
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_start_writeback_thread(ventoy_http_writeback_pf callback)
|
||||||
|
{
|
||||||
|
g_thread_stop = 0;
|
||||||
|
pthread_mutex_init(&g_writeback_mutex, NULL);
|
||||||
|
pthread_cond_init(&g_writeback_cond, NULL);
|
||||||
|
|
||||||
|
pthread_create(&g_writeback_thread, NULL, ventoy_local_thread_run, callback);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_stop_writeback_thread(void)
|
||||||
|
{
|
||||||
|
g_thread_stop = 1;
|
||||||
|
pthread_cond_signal(&g_writeback_cond);
|
||||||
|
|
||||||
|
pthread_join(g_writeback_thread, NULL);
|
||||||
|
|
||||||
|
|
||||||
|
pthread_cond_destroy(&g_writeback_cond);
|
||||||
|
pthread_mutex_destroy(&g_writeback_mutex);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_copy_file(const char *a, const char *b)
|
||||||
|
{
|
||||||
|
int len = 0;
|
||||||
|
char *buf = NULL;
|
||||||
|
|
||||||
|
if (0 == ventoy_read_file_to_buf(a, 0, (void **)&buf, &len))
|
||||||
|
{
|
||||||
|
ventoy_write_buf_to_file(b, buf, len);
|
||||||
|
free(buf);
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
@ -0,0 +1,813 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_util.c ---- ventoy util
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <ventoy_define.h>
|
||||||
|
#include <ventoy_util.h>
|
||||||
|
#include <ventoy_disk.h>
|
||||||
|
#include "fat_filelib.h"
|
||||||
|
|
||||||
|
static void TrimString(CHAR *String)
|
||||||
|
{
|
||||||
|
CHAR *Pos1 = String;
|
||||||
|
CHAR *Pos2 = String;
|
||||||
|
size_t Len = strlen(String);
|
||||||
|
|
||||||
|
while (Len > 0)
|
||||||
|
{
|
||||||
|
if (String[Len - 1] != ' ' && String[Len - 1] != '\t')
|
||||||
|
{
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
String[Len - 1] = 0;
|
||||||
|
Len--;
|
||||||
|
}
|
||||||
|
|
||||||
|
while (*Pos1 == ' ' || *Pos1 == '\t')
|
||||||
|
{
|
||||||
|
Pos1++;
|
||||||
|
}
|
||||||
|
|
||||||
|
while (*Pos1)
|
||||||
|
{
|
||||||
|
*Pos2++ = *Pos1++;
|
||||||
|
}
|
||||||
|
*Pos2++ = 0;
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
void ventoy_gen_preudo_uuid(void *uuid)
|
||||||
|
{
|
||||||
|
CoCreateGuid((GUID *)uuid);
|
||||||
|
}
|
||||||
|
|
||||||
|
static int IsUTF8Encode(const char *src)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
const UCHAR *Byte = (const UCHAR *)src;
|
||||||
|
|
||||||
|
for (i = 0; i < MAX_PATH && Byte[i]; i++)
|
||||||
|
{
|
||||||
|
if (Byte[i] > 127)
|
||||||
|
{
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int Utf8ToUtf16(const char* src, WCHAR * dst)
|
||||||
|
{
|
||||||
|
return MultiByteToWideChar(CP_UTF8, 0, src, -1, dst, MAX_PATH * sizeof(WCHAR));
|
||||||
|
}
|
||||||
|
|
||||||
|
static int Utf16ToUtf8(const WCHAR* src, CHAR * dst)
|
||||||
|
{
|
||||||
|
int size = WideCharToMultiByte(CP_UTF8, 0, src, -1, dst, MAX_PATH, NULL, 0);
|
||||||
|
dst[size] = 0;
|
||||||
|
return size;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_path_case(char *path, int slash)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
int j = 0;
|
||||||
|
int count = 0;
|
||||||
|
int isUTF8 = 0;
|
||||||
|
BOOL bRet;
|
||||||
|
HANDLE handle = INVALID_HANDLE_VALUE;
|
||||||
|
WCHAR Buffer[MAX_PATH + 16];
|
||||||
|
WCHAR FilePathW[MAX_PATH];
|
||||||
|
CHAR FilePathA[MAX_PATH];
|
||||||
|
FILE_NAME_INFO *pInfo = NULL;
|
||||||
|
|
||||||
|
if (g_sysinfo.pathcase == 0)
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (path == NULL || path[0] == '/' || path[0] == '\\')
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
isUTF8 = IsUTF8Encode(path);
|
||||||
|
if (isUTF8)
|
||||||
|
{
|
||||||
|
Utf8ToUtf16(path, FilePathW);
|
||||||
|
handle = CreateFileW(FilePathW, GENERIC_READ, FILE_SHARE_READ, 0, OPEN_EXISTING, FILE_FLAG_BACKUP_SEMANTICS, 0);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
handle = CreateFileA(path, GENERIC_READ, FILE_SHARE_READ, 0, OPEN_EXISTING, FILE_FLAG_BACKUP_SEMANTICS, 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (handle != INVALID_HANDLE_VALUE)
|
||||||
|
{
|
||||||
|
bRet = GetFileInformationByHandleEx(handle, FileNameInfo, Buffer, sizeof(Buffer));
|
||||||
|
if (bRet)
|
||||||
|
{
|
||||||
|
pInfo = (FILE_NAME_INFO *)Buffer;
|
||||||
|
|
||||||
|
if (slash)
|
||||||
|
{
|
||||||
|
for (i = 0; i < (int)(pInfo->FileNameLength / sizeof(WCHAR)); i++)
|
||||||
|
{
|
||||||
|
if (pInfo->FileName[i] == L'\\')
|
||||||
|
{
|
||||||
|
pInfo->FileName[i] = L'/';
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
pInfo->FileName[(pInfo->FileNameLength / sizeof(WCHAR))] = 0;
|
||||||
|
|
||||||
|
memset(FilePathA, 0, sizeof(FilePathA));
|
||||||
|
Utf16ToUtf8(pInfo->FileName, FilePathA);
|
||||||
|
|
||||||
|
if (FilePathA[1] == ':')
|
||||||
|
{
|
||||||
|
j = 3;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
j = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 0; i < MAX_PATH && j < MAX_PATH; i++, j++)
|
||||||
|
{
|
||||||
|
if (FilePathA[j] == 0)
|
||||||
|
{
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (path[i] != FilePathA[j])
|
||||||
|
{
|
||||||
|
path[i] = FilePathA[j];
|
||||||
|
count++;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
CHECK_CLOSE_HANDLE(handle);
|
||||||
|
}
|
||||||
|
|
||||||
|
return count;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_is_directory_exist(const char *Fmt, ...)
|
||||||
|
{
|
||||||
|
va_list Arg;
|
||||||
|
DWORD Attr;
|
||||||
|
int UTF8 = 0;
|
||||||
|
CHAR FilePathA[MAX_PATH];
|
||||||
|
WCHAR FilePathW[MAX_PATH];
|
||||||
|
|
||||||
|
va_start(Arg, Fmt);
|
||||||
|
vsnprintf_s(FilePathA, sizeof(FilePathA), sizeof(FilePathA), Fmt, Arg);
|
||||||
|
va_end(Arg);
|
||||||
|
|
||||||
|
UTF8 = IsUTF8Encode(FilePathA);
|
||||||
|
|
||||||
|
if (UTF8)
|
||||||
|
{
|
||||||
|
Utf8ToUtf16(FilePathA, FilePathW);
|
||||||
|
Attr = GetFileAttributesW(FilePathW);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
Attr = GetFileAttributesA(FilePathA);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (Attr != INVALID_FILE_ATTRIBUTES && (Attr & FILE_ATTRIBUTE_DIRECTORY))
|
||||||
|
{
|
||||||
|
return TRUE;
|
||||||
|
}
|
||||||
|
|
||||||
|
return FALSE;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_is_file_exist(const char *Fmt, ...)
|
||||||
|
{
|
||||||
|
va_list Arg;
|
||||||
|
HANDLE hFile;
|
||||||
|
DWORD Attr;
|
||||||
|
int UTF8 = 0;
|
||||||
|
CHAR FilePathA[MAX_PATH];
|
||||||
|
WCHAR FilePathW[MAX_PATH];
|
||||||
|
|
||||||
|
va_start(Arg, Fmt);
|
||||||
|
vsnprintf_s(FilePathA, sizeof(FilePathA), sizeof(FilePathA), Fmt, Arg);
|
||||||
|
va_end(Arg);
|
||||||
|
|
||||||
|
UTF8 = IsUTF8Encode(FilePathA);
|
||||||
|
if (UTF8)
|
||||||
|
{
|
||||||
|
Utf8ToUtf16(FilePathA, FilePathW);
|
||||||
|
hFile = CreateFileW(FilePathW, FILE_READ_EA, FILE_SHARE_READ, 0, OPEN_EXISTING, 0, 0);
|
||||||
|
Attr = GetFileAttributesW(FilePathW);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
hFile = CreateFileA(FilePathA, FILE_READ_EA, FILE_SHARE_READ, 0, OPEN_EXISTING, 0, 0);
|
||||||
|
Attr = GetFileAttributesA(FilePathA);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (INVALID_HANDLE_VALUE == hFile)
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
CloseHandle(hFile);
|
||||||
|
|
||||||
|
if (Attr & FILE_ATTRIBUTE_DIRECTORY)
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
const char * ventoy_get_os_language(void)
|
||||||
|
{
|
||||||
|
if (GetUserDefaultUILanguage() == 0x0804)
|
||||||
|
{
|
||||||
|
return "cn";
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
return "en";
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int GetPhyDriveByLogicalDrive(int DriveLetter, UINT64 *Offset)
|
||||||
|
{
|
||||||
|
BOOL Ret;
|
||||||
|
DWORD dwSize;
|
||||||
|
HANDLE Handle;
|
||||||
|
VOLUME_DISK_EXTENTS DiskExtents;
|
||||||
|
CHAR PhyPath[128];
|
||||||
|
|
||||||
|
scnprintf(PhyPath, sizeof(PhyPath), "\\\\.\\%C:", (CHAR)DriveLetter);
|
||||||
|
|
||||||
|
Handle = CreateFileA(PhyPath, 0, 0, 0, OPEN_EXISTING, 0, 0);
|
||||||
|
if (Handle == INVALID_HANDLE_VALUE)
|
||||||
|
{
|
||||||
|
vlog("CreateFileA %s failed %u\n", PhyPath, LASTERR);
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
Ret = DeviceIoControl(Handle,
|
||||||
|
IOCTL_VOLUME_GET_VOLUME_DISK_EXTENTS,
|
||||||
|
NULL,
|
||||||
|
0,
|
||||||
|
&DiskExtents,
|
||||||
|
(DWORD)(sizeof(DiskExtents)),
|
||||||
|
(LPDWORD)&dwSize,
|
||||||
|
NULL);
|
||||||
|
|
||||||
|
if (!Ret || DiskExtents.NumberOfDiskExtents == 0)
|
||||||
|
{
|
||||||
|
vlog("IOCTL_VOLUME_GET_VOLUME_DISK_EXTENTSfailed %u\n", LASTERR);
|
||||||
|
CHECK_CLOSE_HANDLE(Handle);
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
CHECK_CLOSE_HANDLE(Handle);
|
||||||
|
|
||||||
|
if (Offset)
|
||||||
|
{
|
||||||
|
*Offset = (UINT64)(DiskExtents.Extents[0].StartingOffset.QuadPart);
|
||||||
|
}
|
||||||
|
|
||||||
|
return (int)DiskExtents.Extents[0].DiskNumber;
|
||||||
|
}
|
||||||
|
|
||||||
|
int GetPhyDriveInfo(int PhyDrive, UINT64 *Size, CHAR *Vendor, CHAR *Product)
|
||||||
|
{
|
||||||
|
int ret = 1;
|
||||||
|
BOOL bRet;
|
||||||
|
DWORD dwBytes;
|
||||||
|
CHAR Drive[64];
|
||||||
|
HANDLE Handle = INVALID_HANDLE_VALUE;
|
||||||
|
GET_LENGTH_INFORMATION LengthInfo;
|
||||||
|
STORAGE_PROPERTY_QUERY Query;
|
||||||
|
STORAGE_DESCRIPTOR_HEADER DevDescHeader;
|
||||||
|
STORAGE_DEVICE_DESCRIPTOR *pDevDesc = NULL;
|
||||||
|
|
||||||
|
sprintf_s(Drive, sizeof(Drive), "\\\\.\\PhysicalDrive%d", PhyDrive);
|
||||||
|
Handle = CreateFileA(Drive, GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, 0, NULL);
|
||||||
|
if (Handle == INVALID_HANDLE_VALUE)
|
||||||
|
{
|
||||||
|
vlog("CreateFileA %s failed %u\n", Drive, LASTERR);
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
bRet = DeviceIoControl(Handle,
|
||||||
|
IOCTL_DISK_GET_LENGTH_INFO, NULL,
|
||||||
|
0,
|
||||||
|
&LengthInfo,
|
||||||
|
sizeof(LengthInfo),
|
||||||
|
&dwBytes,
|
||||||
|
NULL);
|
||||||
|
if (!bRet)
|
||||||
|
{
|
||||||
|
vlog("IOCTL_DISK_GET_LENGTH_INFO failed %u\n", LASTERR);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (Size)
|
||||||
|
{
|
||||||
|
*Size = (UINT64)LengthInfo.Length.QuadPart;
|
||||||
|
}
|
||||||
|
|
||||||
|
Query.PropertyId = StorageDeviceProperty;
|
||||||
|
Query.QueryType = PropertyStandardQuery;
|
||||||
|
|
||||||
|
bRet = DeviceIoControl(Handle,
|
||||||
|
IOCTL_STORAGE_QUERY_PROPERTY,
|
||||||
|
&Query,
|
||||||
|
sizeof(Query),
|
||||||
|
&DevDescHeader,
|
||||||
|
sizeof(STORAGE_DESCRIPTOR_HEADER),
|
||||||
|
&dwBytes,
|
||||||
|
NULL);
|
||||||
|
if (!bRet)
|
||||||
|
{
|
||||||
|
vlog("IOCTL_STORAGE_QUERY_PROPERTY failed %u\n", LASTERR);
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (DevDescHeader.Size < sizeof(STORAGE_DEVICE_DESCRIPTOR))
|
||||||
|
{
|
||||||
|
vlog("DevDescHeader.size invalid %u\n", DevDescHeader.Size);
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
|
||||||
|
pDevDesc = (STORAGE_DEVICE_DESCRIPTOR *)malloc(DevDescHeader.Size);
|
||||||
|
if (!pDevDesc)
|
||||||
|
{
|
||||||
|
vlog("malloc failed\n");
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
|
||||||
|
bRet = DeviceIoControl(Handle,
|
||||||
|
IOCTL_STORAGE_QUERY_PROPERTY,
|
||||||
|
&Query,
|
||||||
|
sizeof(Query),
|
||||||
|
pDevDesc,
|
||||||
|
DevDescHeader.Size,
|
||||||
|
&dwBytes,
|
||||||
|
NULL);
|
||||||
|
if (!bRet)
|
||||||
|
{
|
||||||
|
vlog("IOCTL_STORAGE_QUERY_PROPERTY failed %u\n", LASTERR);
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (pDevDesc->VendorIdOffset && Vendor)
|
||||||
|
{
|
||||||
|
strcpy_s(Vendor, 128, (char *)pDevDesc + pDevDesc->VendorIdOffset);
|
||||||
|
TrimString(Vendor);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (pDevDesc->ProductIdOffset && Product)
|
||||||
|
{
|
||||||
|
strcpy_s(Product, 128, (char *)pDevDesc + pDevDesc->ProductIdOffset);
|
||||||
|
TrimString(Product);
|
||||||
|
}
|
||||||
|
|
||||||
|
ret = 0;
|
||||||
|
|
||||||
|
out:
|
||||||
|
CHECK_FREE(pDevDesc);
|
||||||
|
CHECK_CLOSE_HANDLE(Handle);
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_get_file_size(const char *file)
|
||||||
|
{
|
||||||
|
int Size = -1;
|
||||||
|
HANDLE hFile;
|
||||||
|
|
||||||
|
hFile = CreateFileA(file, 0, 0, NULL, OPEN_EXISTING, 0, NULL);
|
||||||
|
if (hFile != INVALID_HANDLE_VALUE)
|
||||||
|
{
|
||||||
|
Size = (int)GetFileSize(hFile, NULL);
|
||||||
|
CHECK_CLOSE_HANDLE(hFile);
|
||||||
|
}
|
||||||
|
|
||||||
|
return Size;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static HANDLE g_FatPhyDrive;
|
||||||
|
static UINT64 g_Part2StartSec;
|
||||||
|
|
||||||
|
const CHAR* ParseVentoyVersionFromString(CHAR *Buf)
|
||||||
|
{
|
||||||
|
CHAR *Pos = NULL;
|
||||||
|
CHAR *End = NULL;
|
||||||
|
static CHAR LocalVersion[64] = { 0 };
|
||||||
|
|
||||||
|
Pos = strstr(Buf, "VENTOY_VERSION=");
|
||||||
|
if (Pos)
|
||||||
|
{
|
||||||
|
Pos += strlen("VENTOY_VERSION=");
|
||||||
|
if (*Pos == '"')
|
||||||
|
{
|
||||||
|
Pos++;
|
||||||
|
}
|
||||||
|
|
||||||
|
End = Pos;
|
||||||
|
while (*End != 0 && *End != '"' && *End != '\r' && *End != '\n')
|
||||||
|
{
|
||||||
|
End++;
|
||||||
|
}
|
||||||
|
|
||||||
|
*End = 0;
|
||||||
|
|
||||||
|
sprintf_s(LocalVersion, sizeof(LocalVersion), "%s", Pos);
|
||||||
|
return LocalVersion;
|
||||||
|
}
|
||||||
|
|
||||||
|
return "";
|
||||||
|
}
|
||||||
|
static int GetVentoyVersionFromFatFile(CHAR *VerBuf, size_t BufLen)
|
||||||
|
{
|
||||||
|
int rc = 1;
|
||||||
|
int size = 0;
|
||||||
|
char *buf = NULL;
|
||||||
|
void *flfile = NULL;
|
||||||
|
|
||||||
|
flfile = fl_fopen("/grub/grub.cfg", "rb");
|
||||||
|
if (flfile)
|
||||||
|
{
|
||||||
|
fl_fseek(flfile, 0, SEEK_END);
|
||||||
|
size = (int)fl_ftell(flfile);
|
||||||
|
|
||||||
|
fl_fseek(flfile, 0, SEEK_SET);
|
||||||
|
|
||||||
|
buf = (char *)malloc(size + 1);
|
||||||
|
if (buf)
|
||||||
|
{
|
||||||
|
fl_fread(buf, 1, size, flfile);
|
||||||
|
buf[size] = 0;
|
||||||
|
|
||||||
|
rc = 0;
|
||||||
|
sprintf_s(VerBuf, BufLen, "%s", ParseVentoyVersionFromString(buf));
|
||||||
|
free(buf);
|
||||||
|
}
|
||||||
|
|
||||||
|
fl_fclose(flfile);
|
||||||
|
}
|
||||||
|
|
||||||
|
return rc;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int VentoyFatDiskRead(uint32 Sector, uint8 *Buffer, uint32 SectorCount)
|
||||||
|
{
|
||||||
|
DWORD dwSize;
|
||||||
|
BOOL bRet;
|
||||||
|
DWORD ReadSize;
|
||||||
|
LARGE_INTEGER liCurrentPosition;
|
||||||
|
|
||||||
|
liCurrentPosition.QuadPart = Sector + g_Part2StartSec;
|
||||||
|
liCurrentPosition.QuadPart *= 512;
|
||||||
|
SetFilePointerEx(g_FatPhyDrive, liCurrentPosition, &liCurrentPosition, FILE_BEGIN);
|
||||||
|
|
||||||
|
ReadSize = (DWORD)(SectorCount * 512);
|
||||||
|
|
||||||
|
bRet = ReadFile(g_FatPhyDrive, Buffer, ReadSize, &dwSize, NULL);
|
||||||
|
if (bRet == FALSE || dwSize != ReadSize)
|
||||||
|
{
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int GetVentoyVersion(int PhyDrive, ventoy_disk *disk)
|
||||||
|
{
|
||||||
|
int ret = 1;
|
||||||
|
BOOL bRet;
|
||||||
|
DWORD dwBytes;
|
||||||
|
UINT64 Part2Offset;
|
||||||
|
HANDLE Handle = INVALID_HANDLE_VALUE;
|
||||||
|
VTOY_GPT_INFO *pGPT = NULL;
|
||||||
|
CHAR Drive[64];
|
||||||
|
void *flfile = NULL;
|
||||||
|
UCHAR MbrData[] =
|
||||||
|
{
|
||||||
|
0xEB, 0x63, 0x90, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||||||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||||||
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
||||||
|
0x56, 0x54, 0x00, 0x47, 0x65, 0x00, 0x48, 0x44, 0x00, 0x52, 0x64, 0x00, 0x20, 0x45, 0x72, 0x0D,
|
||||||
|
};
|
||||||
|
|
||||||
|
sprintf_s(Drive, sizeof(Drive), "\\\\.\\PhysicalDrive%d", PhyDrive);
|
||||||
|
Handle = CreateFileA(Drive, GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, 0, NULL);
|
||||||
|
if (Handle == INVALID_HANDLE_VALUE)
|
||||||
|
{
|
||||||
|
vlog("CreateFileA %s failed %u\n", Drive, LASTERR);
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
|
||||||
|
pGPT = zalloc(sizeof(VTOY_GPT_INFO));
|
||||||
|
if (!pGPT)
|
||||||
|
{
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
|
||||||
|
bRet = ReadFile(Handle, pGPT, sizeof(VTOY_GPT_INFO), &dwBytes, NULL);
|
||||||
|
if (!bRet || dwBytes != sizeof(VTOY_GPT_INFO))
|
||||||
|
{
|
||||||
|
vlog("ReadFile failed %u\n", LASTERR);
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (memcmp(pGPT->MBR.BootCode, MbrData, 0x30) || memcmp(pGPT->MBR.BootCode + 0x190, MbrData + 0x30, 0x10))
|
||||||
|
{
|
||||||
|
vlog("Invalid MBR Code %u\n", LASTERR);
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (pGPT->MBR.PartTbl[0].FsFlag == 0xEE)
|
||||||
|
{
|
||||||
|
if (memcmp(pGPT->Head.Signature, "EFI PART", 8))
|
||||||
|
{
|
||||||
|
vlog("Invalid GPT Signature\n");
|
||||||
|
goto out;
|
||||||
|
}
|
||||||
|
|
||||||
|
Part2Offset = pGPT->PartTbl[1].StartLBA;
|
||||||
|
disk->cur_part_style = 1;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
Part2Offset = pGPT->MBR.PartTbl[1].StartSectorId;
|
||||||
|
disk->cur_part_style = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
g_FatPhyDrive = Handle;
|
||||||
|
g_Part2StartSec = Part2Offset;
|
||||||
|
|
||||||
|
fl_init();
|
||||||
|
|
||||||
|
if (0 == fl_attach_media(VentoyFatDiskRead, NULL))
|
||||||
|
{
|
||||||
|
ret = GetVentoyVersionFromFatFile(disk->cur_ventoy_ver, sizeof(disk->cur_ventoy_ver));
|
||||||
|
if (ret == 0)
|
||||||
|
{
|
||||||
|
flfile = fl_fopen("/EFI/BOOT/grubx64_real.efi", "rb");
|
||||||
|
if (flfile)
|
||||||
|
{
|
||||||
|
disk->cur_secureboot = 1;
|
||||||
|
fl_fclose(flfile);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fl_shutdown();
|
||||||
|
|
||||||
|
out:
|
||||||
|
CHECK_FREE(pGPT);
|
||||||
|
CHECK_CLOSE_HANDLE(Handle);
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
|
int CheckRuntimeEnvironment(char Letter, ventoy_disk *disk)
|
||||||
|
{
|
||||||
|
int PhyDrive;
|
||||||
|
UINT64 Offset = 0;
|
||||||
|
char Drive[32];
|
||||||
|
DWORD FsFlag;
|
||||||
|
CHAR Vendor[128] = { 0 };
|
||||||
|
CHAR Product[128] = { 0 };
|
||||||
|
CHAR FsName[MAX_PATH];
|
||||||
|
|
||||||
|
PhyDrive = GetPhyDriveByLogicalDrive(Letter, &Offset);
|
||||||
|
if (PhyDrive < 0)
|
||||||
|
{
|
||||||
|
vlog("GetPhyDriveByLogicalDrive failed %d %llu\n", PhyDrive, (ULONGLONG)Offset);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
if (Offset != 1048576)
|
||||||
|
{
|
||||||
|
vlog("Partition offset is NOT 1MB. This is NOT ventoy image partition (%llu)\n", (ULONGLONG)Offset);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (GetPhyDriveInfo(PhyDrive, &Offset, Vendor, Product) != 0)
|
||||||
|
{
|
||||||
|
vlog("GetPhyDriveInfo failed\n");
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
sprintf_s(disk->cur_capacity, sizeof(disk->cur_capacity), "%dGB", (int)ventoy_get_human_readable_gb(Offset));
|
||||||
|
sprintf_s(disk->cur_model, sizeof(disk->cur_model), "%s %s", Vendor, Product);
|
||||||
|
|
||||||
|
scnprintf(Drive, sizeof(Drive), "%C:\\", Letter);
|
||||||
|
if (0 == GetVolumeInformationA(Drive, NULL, 0, NULL, NULL, &FsFlag, FsName, MAX_PATH))
|
||||||
|
{
|
||||||
|
vlog("GetVolumeInformationA failed %u\n", LASTERR);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (_stricmp(FsName, "NTFS") == 0)
|
||||||
|
{
|
||||||
|
disk->pathcase = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
strlcpy(disk->cur_fsname, FsName);
|
||||||
|
|
||||||
|
if (GetVentoyVersion(PhyDrive, disk) != 0)
|
||||||
|
{
|
||||||
|
vlog("GetVentoyVersion failed %u\n", LASTERR);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_write_buf_to_file(const char *FileName, void *Bufer, int BufLen)
|
||||||
|
{
|
||||||
|
BOOL bRet;
|
||||||
|
DWORD dwBytes;
|
||||||
|
HANDLE hFile;
|
||||||
|
|
||||||
|
hFile = CreateFileA(FileName, GENERIC_READ | GENERIC_WRITE, 0, 0, CREATE_ALWAYS, 0, 0);
|
||||||
|
if (hFile == INVALID_HANDLE_VALUE)
|
||||||
|
{
|
||||||
|
vlog("CreateFile %s failed %u\n", FileName, LASTERR);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
bRet = WriteFile(hFile, Bufer, (DWORD)BufLen, &dwBytes, NULL);
|
||||||
|
|
||||||
|
if ((!bRet) || ((DWORD)BufLen != dwBytes))
|
||||||
|
{
|
||||||
|
vlog("Failed to write file <%s> %u err:%u", FileName, dwBytes, LASTERR);
|
||||||
|
CloseHandle(hFile);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
FlushFileBuffers(hFile);
|
||||||
|
CloseHandle(hFile);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int ventoy_decompress_tar(char *tarbuf, int buflen, int *tarsize)
|
||||||
|
{
|
||||||
|
int rc = 1;
|
||||||
|
int inused;
|
||||||
|
HANDLE hFile;
|
||||||
|
DWORD dwSize;
|
||||||
|
DWORD dwRead;
|
||||||
|
WCHAR FullPath[MAX_PATH];
|
||||||
|
BYTE *buffer;
|
||||||
|
VENTOY_MAGIC Magic;
|
||||||
|
|
||||||
|
GetModuleFileNameW(NULL, FullPath, MAX_PATH);
|
||||||
|
hFile = CreateFileW(FullPath, GENERIC_READ, 0, NULL, OPEN_EXISTING, 0, NULL);
|
||||||
|
if (hFile == INVALID_HANDLE_VALUE)
|
||||||
|
{
|
||||||
|
vlog("Failed to open self %u\n", LASTERR);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
dwSize = GetFileSize(hFile, NULL);
|
||||||
|
if (dwSize == INVALID_FILE_SIZE)
|
||||||
|
{
|
||||||
|
vlog("Invalid self exe size %u\n", LASTERR);
|
||||||
|
CHECK_CLOSE_HANDLE(hFile);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
buffer = malloc(dwSize);
|
||||||
|
if (!buffer)
|
||||||
|
{
|
||||||
|
vlog("Failed to malloc %u\n", dwSize);
|
||||||
|
CHECK_CLOSE_HANDLE(hFile);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
ReadFile(hFile, buffer, dwSize, &dwRead, NULL);
|
||||||
|
|
||||||
|
memcpy(&Magic, buffer + dwSize - sizeof(Magic), sizeof(Magic));
|
||||||
|
if (Magic.magic1 == 0x54535251 && Magic.magic2 == 0xa4a3a2a1)
|
||||||
|
{
|
||||||
|
g_unxz_buffer = (UCHAR *)tarbuf;
|
||||||
|
g_unxz_len = 0;
|
||||||
|
|
||||||
|
unxz(buffer + dwSize - Magic.xzlen - sizeof(Magic), Magic.xzlen, NULL, unxz_flush, NULL, &inused, unxz_error);
|
||||||
|
vlog("bigexe:%u xzlen:%u rawdata size:%d\n", dwSize, Magic.xzlen, g_unxz_len);
|
||||||
|
|
||||||
|
if (inused != Magic.xzlen)
|
||||||
|
{
|
||||||
|
vlog("Failed to unxz www %d\n", inused);
|
||||||
|
rc = 1;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
*tarsize = g_unxz_len;
|
||||||
|
rc = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vlog("Invalid magic 0x%x 0x%x\n", Magic.magic1, Magic.magic2);
|
||||||
|
rc = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
free(buffer);
|
||||||
|
CHECK_CLOSE_HANDLE(hFile);
|
||||||
|
|
||||||
|
return rc;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static volatile int g_thread_stop = 0;
|
||||||
|
static HANDLE g_writeback_thread;
|
||||||
|
static HANDLE g_writeback_event;
|
||||||
|
|
||||||
|
DWORD WINAPI ventoy_local_thread_run(LPVOID lpParameter)
|
||||||
|
{
|
||||||
|
ventoy_http_writeback_pf callback = (ventoy_http_writeback_pf)lpParameter;
|
||||||
|
|
||||||
|
while (1)
|
||||||
|
{
|
||||||
|
WaitForSingleObject(g_writeback_event, INFINITE);
|
||||||
|
if (g_thread_stop)
|
||||||
|
{
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
callback();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
void ventoy_set_writeback_event(void)
|
||||||
|
{
|
||||||
|
SetEvent(g_writeback_event);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_start_writeback_thread(ventoy_http_writeback_pf callback)
|
||||||
|
{
|
||||||
|
g_thread_stop = 0;
|
||||||
|
g_writeback_event = CreateEventA(NULL, FALSE, FALSE, "VTOYWRBK");
|
||||||
|
g_writeback_thread = CreateThread(NULL, 0, ventoy_local_thread_run, callback, 0, NULL);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
void ventoy_stop_writeback_thread(void)
|
||||||
|
{
|
||||||
|
g_thread_stop = 1;
|
||||||
|
ventoy_set_writeback_event();
|
||||||
|
|
||||||
|
WaitForSingleObject(g_writeback_thread, INFINITE);
|
||||||
|
|
||||||
|
CHECK_CLOSE_HANDLE(g_writeback_thread);
|
||||||
|
CHECK_CLOSE_HANDLE(g_writeback_event);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int ventoy_copy_file(const char *a, const char *b)
|
||||||
|
{
|
||||||
|
CopyFileA(a, b, FALSE);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
@ -0,0 +1,22 @@
|
||||||
|
File IO Lib API
|
||||||
|
-=-=-=-=-=-=-=-=-
|
||||||
|
|
||||||
|
void fl_init(void)
|
||||||
|
|
||||||
|
Called to initialize FAT IO library.
|
||||||
|
This should be called prior to any other functions.
|
||||||
|
|
||||||
|
void fl_attach_locks(void (*lock)(void), void (*unlock)(void))
|
||||||
|
|
||||||
|
[Optional] File system thread safety locking functions.
|
||||||
|
For thread safe operation, you should provide lock() and unlock() functions.
|
||||||
|
Note that locking primitive used must support recursive locking, i.e lock() called within an already ‘locked’ region.
|
||||||
|
|
||||||
|
int fl_attach_media(fn_diskio_read rd, fn_diskio_write wr)
|
||||||
|
|
||||||
|
This function is used to attach system specific disk/media access functions.
|
||||||
|
This should be done subsequent to calling fl_init() and fl_attach_locks() (if locking required).
|
||||||
|
|
||||||
|
void fl_shutdown(void)
|
||||||
|
|
||||||
|
Shutdown the FAT IO library. This purges any un-saved data back to disk.
|
||||||
|
|
@ -0,0 +1,345 @@
|
||||||
|
GNU GENERAL PUBLIC LICENSE
|
||||||
|
Version 2, June 1991
|
||||||
|
|
||||||
|
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
|
||||||
|
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
Everyone is permitted to copy and distribute verbatim copies
|
||||||
|
of this license document, but changing it is not allowed.
|
||||||
|
|
||||||
|
Preamble
|
||||||
|
|
||||||
|
The licenses for most software are designed to take away your
|
||||||
|
freedom to share and change it. By contrast, the GNU General Public
|
||||||
|
License is intended to guarantee your freedom to share and change free
|
||||||
|
software--to make sure the software is free for all its users. This
|
||||||
|
General Public License applies to most of the Free Software
|
||||||
|
Foundation's software and to any other program whose authors commit to
|
||||||
|
using it. (Some other Free Software Foundation software is covered by
|
||||||
|
the GNU Library General Public License instead.) You can apply it to
|
||||||
|
your programs, too.
|
||||||
|
|
||||||
|
When we speak of free software, we are referring to freedom, not
|
||||||
|
price. Our General Public Licenses are designed to make sure that you
|
||||||
|
have the freedom to distribute copies of free software (and charge for
|
||||||
|
this service if you wish), that you receive source code or can get it
|
||||||
|
if you want it, that you can change the software or use pieces of it
|
||||||
|
in new free programs; and that you know you can do these things.
|
||||||
|
|
||||||
|
To protect your rights, we need to make restrictions that forbid
|
||||||
|
anyone to deny you these rights or to ask you to surrender the rights.
|
||||||
|
These restrictions translate to certain responsibilities for you if you
|
||||||
|
distribute copies of the software, or if you modify it.
|
||||||
|
|
||||||
|
For example, if you distribute copies of such a program, whether
|
||||||
|
gratis or for a fee, you must give the recipients all the rights that
|
||||||
|
you have. You must make sure that they, too, receive or can get the
|
||||||
|
source code. And you must show them these terms so they know their
|
||||||
|
rights.
|
||||||
|
|
||||||
|
We protect your rights with two steps: (1) copyright the software, and
|
||||||
|
(2) offer you this license which gives you legal permission to copy,
|
||||||
|
distribute and/or modify the software.
|
||||||
|
|
||||||
|
Also, for each author's protection and ours, we want to make certain
|
||||||
|
that everyone understands that there is no warranty for this free
|
||||||
|
software. If the software is modified by someone else and passed on, we
|
||||||
|
want its recipients to know that what they have is not the original, so
|
||||||
|
that any problems introduced by others will not reflect on the original
|
||||||
|
authors' reputations.
|
||||||
|
|
||||||
|
Finally, any free program is threatened constantly by software
|
||||||
|
patents. We wish to avoid the danger that redistributors of a free
|
||||||
|
program will individually obtain patent licenses, in effect making the
|
||||||
|
program proprietary. To prevent this, we have made it clear that any
|
||||||
|
patent must be licensed for everyone's free use or not licensed at all.
|
||||||
|
|
||||||
|
The precise terms and conditions for copying, distribution and
|
||||||
|
modification follow.
|
||||||
|
|
||||||
|
|
||||||
|
GNU GENERAL PUBLIC LICENSE
|
||||||
|
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
||||||
|
|
||||||
|
0. This License applies to any program or other work which contains
|
||||||
|
a notice placed by the copyright holder saying it may be distributed
|
||||||
|
under the terms of this General Public License. The "Program", below,
|
||||||
|
refers to any such program or work, and a "work based on the Program"
|
||||||
|
means either the Program or any derivative work under copyright law:
|
||||||
|
that is to say, a work containing the Program or a portion of it,
|
||||||
|
either verbatim or with modifications and/or translated into another
|
||||||
|
language. (Hereinafter, translation is included without limitation in
|
||||||
|
the term "modification".) Each licensee is addressed as "you".
|
||||||
|
|
||||||
|
Activities other than copying, distribution and modification are not
|
||||||
|
covered by this License; they are outside its scope. The act of
|
||||||
|
running the Program is not restricted, and the output from the Program
|
||||||
|
is covered only if its contents constitute a work based on the
|
||||||
|
Program (independent of having been made by running the Program).
|
||||||
|
Whether that is true depends on what the Program does.
|
||||||
|
|
||||||
|
1. You may copy and distribute verbatim copies of the Program's
|
||||||
|
source code as you receive it, in any medium, provided that you
|
||||||
|
conspicuously and appropriately publish on each copy an appropriate
|
||||||
|
copyright notice and disclaimer of warranty; keep intact all the
|
||||||
|
notices that refer to this License and to the absence of any warranty;
|
||||||
|
and give any other recipients of the Program a copy of this License
|
||||||
|
along with the Program.
|
||||||
|
|
||||||
|
You may charge a fee for the physical act of transferring a copy, and
|
||||||
|
you may at your option offer warranty protection in exchange for a fee.
|
||||||
|
|
||||||
|
2. You may modify your copy or copies of the Program or any portion
|
||||||
|
of it, thus forming a work based on the Program, and copy and
|
||||||
|
distribute such modifications or work under the terms of Section 1
|
||||||
|
above, provided that you also meet all of these conditions:
|
||||||
|
|
||||||
|
a) You must cause the modified files to carry prominent notices
|
||||||
|
stating that you changed the files and the date of any change.
|
||||||
|
|
||||||
|
b) You must cause any work that you distribute or publish, that in
|
||||||
|
whole or in part contains or is derived from the Program or any
|
||||||
|
part thereof, to be licensed as a whole at no charge to all third
|
||||||
|
parties under the terms of this License.
|
||||||
|
|
||||||
|
c) If the modified program normally reads commands interactively
|
||||||
|
when run, you must cause it, when started running for such
|
||||||
|
interactive use in the most ordinary way, to print or display an
|
||||||
|
announcement including an appropriate copyright notice and a
|
||||||
|
notice that there is no warranty (or else, saying that you provide
|
||||||
|
a warranty) and that users may redistribute the program under
|
||||||
|
these conditions, and telling the user how to view a copy of this
|
||||||
|
License. (Exception: if the Program itself is interactive but
|
||||||
|
does not normally print such an announcement, your work based on
|
||||||
|
the Program is not required to print an announcement.)
|
||||||
|
|
||||||
|
|
||||||
|
These requirements apply to the modified work as a whole. If
|
||||||
|
identifiable sections of that work are not derived from the Program,
|
||||||
|
and can be reasonably considered independent and separate works in
|
||||||
|
themselves, then this License, and its terms, do not apply to those
|
||||||
|
sections when you distribute them as separate works. But when you
|
||||||
|
distribute the same sections as part of a whole which is a work based
|
||||||
|
on the Program, the distribution of the whole must be on the terms of
|
||||||
|
this License, whose permissions for other licensees extend to the
|
||||||
|
entire whole, and thus to each and every part regardless of who wrote it.
|
||||||
|
|
||||||
|
Thus, it is not the intent of this section to claim rights or contest
|
||||||
|
your rights to work written entirely by you; rather, the intent is to
|
||||||
|
exercise the right to control the distribution of derivative or
|
||||||
|
collective works based on the Program.
|
||||||
|
|
||||||
|
In addition, mere aggregation of another work not based on the Program
|
||||||
|
with the Program (or with a work based on the Program) on a volume of
|
||||||
|
a storage or distribution medium does not bring the other work under
|
||||||
|
the scope of this License.
|
||||||
|
|
||||||
|
3. You may copy and distribute the Program (or a work based on it,
|
||||||
|
under Section 2) in object code or executable form under the terms of
|
||||||
|
Sections 1 and 2 above provided that you also do one of the following:
|
||||||
|
|
||||||
|
a) Accompany it with the complete corresponding machine-readable
|
||||||
|
source code, which must be distributed under the terms of Sections
|
||||||
|
1 and 2 above on a medium customarily used for software interchange; or,
|
||||||
|
|
||||||
|
b) Accompany it with a written offer, valid for at least three
|
||||||
|
years, to give any third party, for a charge no more than your
|
||||||
|
cost of physically performing source distribution, a complete
|
||||||
|
machine-readable copy of the corresponding source code, to be
|
||||||
|
distributed under the terms of Sections 1 and 2 above on a medium
|
||||||
|
customarily used for software interchange; or,
|
||||||
|
|
||||||
|
c) Accompany it with the information you received as to the offer
|
||||||
|
to distribute corresponding source code. (This alternative is
|
||||||
|
allowed only for noncommercial distribution and only if you
|
||||||
|
received the program in object code or executable form with such
|
||||||
|
an offer, in accord with Subsection b above.)
|
||||||
|
|
||||||
|
The source code for a work means the preferred form of the work for
|
||||||
|
making modifications to it. For an executable work, complete source
|
||||||
|
code means all the source code for all modules it contains, plus any
|
||||||
|
associated interface definition files, plus the scripts used to
|
||||||
|
control compilation and installation of the executable. However, as a
|
||||||
|
special exception, the source code distributed need not include
|
||||||
|
anything that is normally distributed (in either source or binary
|
||||||
|
form) with the major components (compiler, kernel, and so on) of the
|
||||||
|
operating system on which the executable runs, unless that component
|
||||||
|
itself accompanies the executable.
|
||||||
|
|
||||||
|
If distribution of executable or object code is made by offering
|
||||||
|
access to copy from a designated place, then offering equivalent
|
||||||
|
access to copy the source code from the same place counts as
|
||||||
|
distribution of the source code, even though third parties are not
|
||||||
|
compelled to copy the source along with the object code.
|
||||||
|
|
||||||
|
|
||||||
|
4. You may not copy, modify, sublicense, or distribute the Program
|
||||||
|
except as expressly provided under this License. Any attempt
|
||||||
|
otherwise to copy, modify, sublicense or distribute the Program is
|
||||||
|
void, and will automatically terminate your rights under this License.
|
||||||
|
However, parties who have received copies, or rights, from you under
|
||||||
|
this License will not have their licenses terminated so long as such
|
||||||
|
parties remain in full compliance.
|
||||||
|
|
||||||
|
5. You are not required to accept this License, since you have not
|
||||||
|
signed it. However, nothing else grants you permission to modify or
|
||||||
|
distribute the Program or its derivative works. These actions are
|
||||||
|
prohibited by law if you do not accept this License. Therefore, by
|
||||||
|
modifying or distributing the Program (or any work based on the
|
||||||
|
Program), you indicate your acceptance of this License to do so, and
|
||||||
|
all its terms and conditions for copying, distributing or modifying
|
||||||
|
the Program or works based on it.
|
||||||
|
|
||||||
|
6. Each time you redistribute the Program (or any work based on the
|
||||||
|
Program), the recipient automatically receives a license from the
|
||||||
|
original licensor to copy, distribute or modify the Program subject to
|
||||||
|
these terms and conditions. You may not impose any further
|
||||||
|
restrictions on the recipients' exercise of the rights granted herein.
|
||||||
|
You are not responsible for enforcing compliance by third parties to
|
||||||
|
this License.
|
||||||
|
|
||||||
|
7. If, as a consequence of a court judgment or allegation of patent
|
||||||
|
infringement or for any other reason (not limited to patent issues),
|
||||||
|
conditions are imposed on you (whether by court order, agreement or
|
||||||
|
otherwise) that contradict the conditions of this License, they do not
|
||||||
|
excuse you from the conditions of this License. If you cannot
|
||||||
|
distribute so as to satisfy simultaneously your obligations under this
|
||||||
|
License and any other pertinent obligations, then as a consequence you
|
||||||
|
may not distribute the Program at all. For example, if a patent
|
||||||
|
license would not permit royalty-free redistribution of the Program by
|
||||||
|
all those who receive copies directly or indirectly through you, then
|
||||||
|
the only way you could satisfy both it and this License would be to
|
||||||
|
refrain entirely from distribution of the Program.
|
||||||
|
|
||||||
|
If any portion of this section is held invalid or unenforceable under
|
||||||
|
any particular circumstance, the balance of the section is intended to
|
||||||
|
apply and the section as a whole is intended to apply in other
|
||||||
|
circumstances.
|
||||||
|
|
||||||
|
It is not the purpose of this section to induce you to infringe any
|
||||||
|
patents or other property right claims or to contest validity of any
|
||||||
|
such claims; this section has the sole purpose of protecting the
|
||||||
|
integrity of the free software distribution system, which is
|
||||||
|
implemented by public license practices. Many people have made
|
||||||
|
generous contributions to the wide range of software distributed
|
||||||
|
through that system in reliance on consistent application of that
|
||||||
|
system; it is up to the author/donor to decide if he or she is willing
|
||||||
|
to distribute software through any other system and a licensee cannot
|
||||||
|
impose that choice.
|
||||||
|
|
||||||
|
This section is intended to make thoroughly clear what is believed to
|
||||||
|
be a consequence of the rest of this License.
|
||||||
|
|
||||||
|
|
||||||
|
8. If the distribution and/or use of the Program is restricted in
|
||||||
|
certain countries either by patents or by copyrighted interfaces, the
|
||||||
|
original copyright holder who places the Program under this License
|
||||||
|
may add an explicit geographical distribution limitation excluding
|
||||||
|
those countries, so that distribution is permitted only in or among
|
||||||
|
countries not thus excluded. In such case, this License incorporates
|
||||||
|
the limitation as if written in the body of this License.
|
||||||
|
|
||||||
|
9. The Free Software Foundation may publish revised and/or new versions
|
||||||
|
of the General Public License from time to time. Such new versions will
|
||||||
|
be similar in spirit to the present version, but may differ in detail to
|
||||||
|
address new problems or concerns.
|
||||||
|
|
||||||
|
Each version is given a distinguishing version number. If the Program
|
||||||
|
specifies a version number of this License which applies to it and "any
|
||||||
|
later version", you have the option of following the terms and conditions
|
||||||
|
either of that version or of any later version published by the Free
|
||||||
|
Software Foundation. If the Program does not specify a version number of
|
||||||
|
this License, you may choose any version ever published by the Free Software
|
||||||
|
Foundation.
|
||||||
|
|
||||||
|
10. If you wish to incorporate parts of the Program into other free
|
||||||
|
programs whose distribution conditions are different, write to the author
|
||||||
|
to ask for permission. For software which is copyrighted by the Free
|
||||||
|
Software Foundation, write to the Free Software Foundation; we sometimes
|
||||||
|
make exceptions for this. Our decision will be guided by the two goals
|
||||||
|
of preserving the free status of all derivatives of our free software and
|
||||||
|
of promoting the sharing and reuse of software generally.
|
||||||
|
|
||||||
|
NO WARRANTY
|
||||||
|
|
||||||
|
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
|
||||||
|
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
|
||||||
|
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
|
||||||
|
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
|
||||||
|
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
||||||
|
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
|
||||||
|
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
|
||||||
|
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
|
||||||
|
REPAIR OR CORRECTION.
|
||||||
|
|
||||||
|
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||||
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
|
||||||
|
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
|
||||||
|
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
|
||||||
|
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
|
||||||
|
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
|
||||||
|
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
|
||||||
|
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
|
||||||
|
POSSIBILITY OF SUCH DAMAGES.
|
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
|
||||||
|
How to Apply These Terms to Your New Programs
|
||||||
|
|
||||||
|
If you develop a new program, and you want it to be of the greatest
|
||||||
|
possible use to the public, the best way to achieve this is to make it
|
||||||
|
free software which everyone can redistribute and change under these terms.
|
||||||
|
|
||||||
|
To do so, attach the following notices to the program. It is safest
|
||||||
|
to attach them to the start of each source file to most effectively
|
||||||
|
convey the exclusion of warranty; and each file should have at least
|
||||||
|
the "copyright" line and a pointer to where the full notice is found.
|
||||||
|
|
||||||
|
<one line to give the program's name and a brief idea of what it does.>
|
||||||
|
Copyright (C) <year> <name of author>
|
||||||
|
|
||||||
|
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 2 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, write to the Free Software
|
||||||
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
|
||||||
|
|
||||||
|
Also add information on how to contact you by electronic and paper mail.
|
||||||
|
|
||||||
|
If the program is interactive, make it output a short notice like this
|
||||||
|
when it starts in an interactive mode:
|
||||||
|
|
||||||
|
Gnomovision version 69, Copyright (C) year name of author
|
||||||
|
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||||
|
This is free software, and you are welcome to redistribute it
|
||||||
|
under certain conditions; type `show c' for details.
|
||||||
|
|
||||||
|
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||||
|
parts of the General Public License. Of course, the commands you use may
|
||||||
|
be called something other than `show w' and `show c'; they could even be
|
||||||
|
mouse-clicks or menu items--whatever suits your program.
|
||||||
|
|
||||||
|
You should also get your employer (if you work as a programmer) or your
|
||||||
|
school, if any, to sign a "copyright disclaimer" for the program, if
|
||||||
|
necessary. Here is a sample; alter the names:
|
||||||
|
|
||||||
|
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
|
||||||
|
`Gnomovision' (which makes passes at compilers) written by James Hacker.
|
||||||
|
|
||||||
|
<signature of Ty Coon>, 1 April 1989
|
||||||
|
Ty Coon, President of Vice
|
||||||
|
|
||||||
|
This General Public License does not permit incorporating your program into
|
||||||
|
proprietary programs. If your program is a subroutine library, you may
|
||||||
|
consider it more useful to permit linking proprietary applications with the
|
||||||
|
library. If this is what you want to do, use the GNU Library General
|
||||||
|
Public License instead of this License.
|
||||||
|
|
@ -0,0 +1,53 @@
|
||||||
|
File IO Lib Options
|
||||||
|
-=-=-=-=-=-=-=-=-=-
|
||||||
|
|
||||||
|
See defines in fat_opts.h:
|
||||||
|
|
||||||
|
FATFS_IS_LITTLE_ENDIAN [1/0]
|
||||||
|
Which endian is your system? Set to 1 for little endian, 0 for big endian.
|
||||||
|
|
||||||
|
FATFS_MAX_LONG_FILENAME [260]
|
||||||
|
By default, 260 characters (max LFN length). Increase this to support greater path depths.
|
||||||
|
|
||||||
|
FATFS_MAX_OPEN_FILES
|
||||||
|
The more files you wish to have concurrently open, the greater this number should be.
|
||||||
|
This increases the number of FL_FILE file structures in the library, each of these is around 1K in size (assuming 512 byte sectors).
|
||||||
|
|
||||||
|
FAT_BUFFER_SECTORS
|
||||||
|
Minimum is 1, more increases performance.
|
||||||
|
This defines how many FAT sectors can be buffered per FAT_BUFFER entry.
|
||||||
|
|
||||||
|
FAT_BUFFERS
|
||||||
|
Minimum is 1, more increases performance.
|
||||||
|
This defines how many FAT buffer entries are available.
|
||||||
|
Memory usage is FAT_BUFFERS * FAT_BUFFER_SECTORS * FAT_SECTOR_SIZE
|
||||||
|
|
||||||
|
FATFS_INC_WRITE_SUPPORT
|
||||||
|
Support file write functionality.
|
||||||
|
|
||||||
|
FAT_SECTOR_SIZE
|
||||||
|
Sector size used by buffers. Most likely to be 512 bytes (standard for ATA/IDE).
|
||||||
|
|
||||||
|
FAT_PRINTF
|
||||||
|
A define that allows the File IO library to print to console/stdout.
|
||||||
|
Provide your own printf function if printf not available.
|
||||||
|
|
||||||
|
FAT_CLUSTER_CACHE_ENTRIES
|
||||||
|
Size of cluster chain cache (can be undefined if not required).
|
||||||
|
Mem used = FAT_CLUSTER_CACHE_ENTRIES * 4 * 2
|
||||||
|
Improves access speed considerably.
|
||||||
|
|
||||||
|
FATFS_INC_LFN_SUPPORT [1/0]
|
||||||
|
Enable/Disable support for long filenames.
|
||||||
|
|
||||||
|
FATFS_DIR_LIST_SUPPORT [1/0]
|
||||||
|
Include support for directory listing.
|
||||||
|
|
||||||
|
FATFS_INC_TIME_DATE_SUPPORT [1/0]
|
||||||
|
Use time/date functions provided by time.h to update creation & modification timestamps.
|
||||||
|
|
||||||
|
FATFS_INC_FORMAT_SUPPORT
|
||||||
|
Include support for formatting disks (FAT16 only).
|
||||||
|
|
||||||
|
FAT_PRINTF_NOINC_STDIO
|
||||||
|
Disable use of printf & inclusion of stdio.h
|
||||||
|
|
@ -0,0 +1,24 @@
|
||||||
|
Revision History
|
||||||
|
-=-=-=-=-=-=-=-=-
|
||||||
|
v2.6.11 - Fix compilation with GCC on 64-bit machines
|
||||||
|
v2.6.10 - Added support for FAT32 format.
|
||||||
|
V2.6.9 - Added support for time & date handling.
|
||||||
|
V2.6.8 - Fixed error with FSINFO sector write.
|
||||||
|
V2.6.7 - Added fgets().
|
||||||
|
Fixed C warnings, removed dependancy on some string.h functions.
|
||||||
|
V2.6.6 – Massive read + write performance improvements.
|
||||||
|
V2.6.5 – Bug fixes for big endian systems.
|
||||||
|
V2.6.4 – Further bug fixes and performance improvements for write operations.
|
||||||
|
V2.6.3 – Peformance improvements, FAT16 formatting support. Various bug fixes.
|
||||||
|
V2.6 - Basic support for FAT16 added (18-04-10).
|
||||||
|
V2.5 - Code cleaned up. Many bugs fixed. Thread safety functions added.
|
||||||
|
V2.x - Write support added as well as better stdio like API.
|
||||||
|
V1.0 - Rewrite of all code to enable multiple files to be opened and provides a
|
||||||
|
better file API.
|
||||||
|
Also better string matching, and generally better C code than origonal
|
||||||
|
version.
|
||||||
|
V0.1c - Fetch_ID_Max_LBA() function added to retrieve Drive infomation and stoping
|
||||||
|
the drive reads from addressing a sector that is out of range.
|
||||||
|
V0.1b - fopen(), fgetc(), fopenDIR() using new software stack for IDE and FAT32
|
||||||
|
access.
|
||||||
|
V0.1a - First release (27/12/03); fopen(), fgetc() unbuffered reads.
|
||||||
|
|
@ -0,0 +1,10 @@
|
||||||
|
FAT File IO Library License
|
||||||
|
-=-=-=-=-=-=-=-=-=-=-=-=-=-
|
||||||
|
|
||||||
|
This versions license: GPL
|
||||||
|
|
||||||
|
If you include GPL software in your project, you must release the source code of that project too.
|
||||||
|
|
||||||
|
If you would like a version with a more permissive license for use in closed source commercial applications please contact me for details.
|
||||||
|
|
||||||
|
Email: admin@ultra-embedded.com
|
||||||
|
|
@ -0,0 +1,40 @@
|
||||||
|
Media Access API
|
||||||
|
-=-=-=-=-=-=-=-=-
|
||||||
|
|
||||||
|
int media_read(uint32 sector, uint8 *buffer, uint32 sector_count)
|
||||||
|
|
||||||
|
Params:
|
||||||
|
Sector: 32-bit sector number
|
||||||
|
Buffer: Target buffer to read n sectors of data into.
|
||||||
|
Sector_count: Number of sectors to read.
|
||||||
|
|
||||||
|
Return:
|
||||||
|
int, 1 = success, 0 = failure.
|
||||||
|
|
||||||
|
Description:
|
||||||
|
Application/target specific disk/media read function.
|
||||||
|
Sector number (sectors are usually 512 byte pages) to read.
|
||||||
|
|
||||||
|
Media Write API
|
||||||
|
|
||||||
|
int media_write(uint32 sector, uint8 *buffer, uint32 sector_count)
|
||||||
|
|
||||||
|
Params:
|
||||||
|
Sector: 32-bit sector number
|
||||||
|
Buffer: Target buffer to write n sectors of data from.
|
||||||
|
Sector_count: Number of sectors to write.
|
||||||
|
|
||||||
|
Return:
|
||||||
|
int, 1 = success, 0 = failure.
|
||||||
|
|
||||||
|
Description:
|
||||||
|
Application/target specific disk/media write function.
|
||||||
|
Sector number (sectors are usually 512 byte pages) to write to.
|
||||||
|
|
||||||
|
File IO Library Linkage
|
||||||
|
Use the following API to attach the media IO functions to the File IO library.
|
||||||
|
|
||||||
|
int fl_attach_media(fn_diskio_read rd, fn_diskio_write wr)
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
@ -0,0 +1,907 @@
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT16/32 File IO Library
|
||||||
|
// V2.6
|
||||||
|
// Ultra-Embedded.com
|
||||||
|
// Copyright 2003 - 2012
|
||||||
|
//
|
||||||
|
// Email: admin@ultra-embedded.com
|
||||||
|
//
|
||||||
|
// License: GPL
|
||||||
|
// If you would like a version with a more permissive license for use in
|
||||||
|
// closed source commercial applications please contact me for details.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//
|
||||||
|
// This file is part of FAT File IO Library.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 2 of the License, or
|
||||||
|
// (at your option) any later version.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 FAT File IO Library; if not, write to the Free Software
|
||||||
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#include <string.h>
|
||||||
|
#include "fat_defs.h"
|
||||||
|
#include "fat_access.h"
|
||||||
|
#include "fat_table.h"
|
||||||
|
#include "fat_write.h"
|
||||||
|
#include "fat_string.h"
|
||||||
|
#include "fat_misc.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_init: Load FAT Parameters
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_init(struct fatfs *fs)
|
||||||
|
{
|
||||||
|
uint8 num_of_fats;
|
||||||
|
uint16 reserved_sectors;
|
||||||
|
uint32 FATSz;
|
||||||
|
uint32 root_dir_sectors;
|
||||||
|
uint32 total_sectors;
|
||||||
|
uint32 data_sectors;
|
||||||
|
uint32 count_of_clusters;
|
||||||
|
uint8 valid_partition = 0;
|
||||||
|
|
||||||
|
fs->currentsector.address = FAT32_INVALID_CLUSTER;
|
||||||
|
fs->currentsector.dirty = 0;
|
||||||
|
|
||||||
|
fs->next_free_cluster = 0; // Invalid
|
||||||
|
|
||||||
|
fatfs_fat_init(fs);
|
||||||
|
|
||||||
|
// Make sure we have a read function (write function is optional)
|
||||||
|
if (!fs->disk_io.read_media)
|
||||||
|
return FAT_INIT_MEDIA_ACCESS_ERROR;
|
||||||
|
|
||||||
|
// MBR: Sector 0 on the disk
|
||||||
|
// NOTE: Some removeable media does not have this.
|
||||||
|
|
||||||
|
// Load MBR (LBA 0) into the 512 byte buffer
|
||||||
|
if (!fs->disk_io.read_media(0, fs->currentsector.sector, 1))
|
||||||
|
return FAT_INIT_MEDIA_ACCESS_ERROR;
|
||||||
|
|
||||||
|
// Make Sure 0x55 and 0xAA are at end of sector
|
||||||
|
// (this should be the case regardless of the MBR or boot sector)
|
||||||
|
if (fs->currentsector.sector[SIGNATURE_POSITION] != 0x55 || fs->currentsector.sector[SIGNATURE_POSITION+1] != 0xAA)
|
||||||
|
return FAT_INIT_INVALID_SIGNATURE;
|
||||||
|
|
||||||
|
// Now check again using the access function to prove endian conversion function
|
||||||
|
if (GET_16BIT_WORD(fs->currentsector.sector, SIGNATURE_POSITION) != SIGNATURE_VALUE)
|
||||||
|
return FAT_INIT_ENDIAN_ERROR;
|
||||||
|
|
||||||
|
// Verify packed structures
|
||||||
|
if (sizeof(struct fat_dir_entry) != FAT_DIR_ENTRY_SIZE)
|
||||||
|
return FAT_INIT_STRUCT_PACKING;
|
||||||
|
|
||||||
|
// Check the partition type code
|
||||||
|
switch(fs->currentsector.sector[PARTITION1_TYPECODE_LOCATION])
|
||||||
|
{
|
||||||
|
case 0x0B:
|
||||||
|
case 0x06:
|
||||||
|
case 0x0C:
|
||||||
|
case 0x0E:
|
||||||
|
case 0x0F:
|
||||||
|
case 0x05:
|
||||||
|
valid_partition = 1;
|
||||||
|
break;
|
||||||
|
case 0x00:
|
||||||
|
valid_partition = 0;
|
||||||
|
break;
|
||||||
|
default:
|
||||||
|
if (fs->currentsector.sector[PARTITION1_TYPECODE_LOCATION] <= 0x06)
|
||||||
|
valid_partition = 1;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Read LBA Begin for the file system
|
||||||
|
if (valid_partition)
|
||||||
|
fs->lba_begin = GET_32BIT_WORD(fs->currentsector.sector, PARTITION1_LBA_BEGIN_LOCATION);
|
||||||
|
// Else possibly MBR less disk
|
||||||
|
else
|
||||||
|
fs->lba_begin = 0;
|
||||||
|
|
||||||
|
// Load Volume 1 table into sector buffer
|
||||||
|
// (We may already have this in the buffer if MBR less drive!)
|
||||||
|
if (!fs->disk_io.read_media(fs->lba_begin, fs->currentsector.sector, 1))
|
||||||
|
return FAT_INIT_MEDIA_ACCESS_ERROR;
|
||||||
|
|
||||||
|
// Make sure there are 512 bytes per cluster
|
||||||
|
if (GET_16BIT_WORD(fs->currentsector.sector, 0x0B) != FAT_SECTOR_SIZE)
|
||||||
|
return FAT_INIT_INVALID_SECTOR_SIZE;
|
||||||
|
|
||||||
|
// Load Parameters of FAT partition
|
||||||
|
fs->sectors_per_cluster = fs->currentsector.sector[BPB_SECPERCLUS];
|
||||||
|
reserved_sectors = GET_16BIT_WORD(fs->currentsector.sector, BPB_RSVDSECCNT);
|
||||||
|
num_of_fats = fs->currentsector.sector[BPB_NUMFATS];
|
||||||
|
fs->root_entry_count = GET_16BIT_WORD(fs->currentsector.sector, BPB_ROOTENTCNT);
|
||||||
|
|
||||||
|
if(GET_16BIT_WORD(fs->currentsector.sector, BPB_FATSZ16) != 0)
|
||||||
|
fs->fat_sectors = GET_16BIT_WORD(fs->currentsector.sector, BPB_FATSZ16);
|
||||||
|
else
|
||||||
|
fs->fat_sectors = GET_32BIT_WORD(fs->currentsector.sector, BPB_FAT32_FATSZ32);
|
||||||
|
|
||||||
|
// For FAT32 (which this may be)
|
||||||
|
fs->rootdir_first_cluster = GET_32BIT_WORD(fs->currentsector.sector, BPB_FAT32_ROOTCLUS);
|
||||||
|
fs->fs_info_sector = GET_16BIT_WORD(fs->currentsector.sector, BPB_FAT32_FSINFO);
|
||||||
|
|
||||||
|
// For FAT16 (which this may be), rootdir_first_cluster is actuall rootdir_first_sector
|
||||||
|
fs->rootdir_first_sector = reserved_sectors + (num_of_fats * fs->fat_sectors);
|
||||||
|
fs->rootdir_sectors = ((fs->root_entry_count * 32) + (FAT_SECTOR_SIZE - 1)) / FAT_SECTOR_SIZE;
|
||||||
|
|
||||||
|
// First FAT LBA address
|
||||||
|
fs->fat_begin_lba = fs->lba_begin + reserved_sectors;
|
||||||
|
|
||||||
|
// The address of the first data cluster on this volume
|
||||||
|
fs->cluster_begin_lba = fs->fat_begin_lba + (num_of_fats * fs->fat_sectors);
|
||||||
|
|
||||||
|
if (GET_16BIT_WORD(fs->currentsector.sector, 0x1FE) != 0xAA55) // This signature should be AA55
|
||||||
|
return FAT_INIT_INVALID_SIGNATURE;
|
||||||
|
|
||||||
|
// Calculate the root dir sectors
|
||||||
|
root_dir_sectors = ((GET_16BIT_WORD(fs->currentsector.sector, BPB_ROOTENTCNT) * 32) + (GET_16BIT_WORD(fs->currentsector.sector, BPB_BYTSPERSEC) - 1)) / GET_16BIT_WORD(fs->currentsector.sector, BPB_BYTSPERSEC);
|
||||||
|
|
||||||
|
if(GET_16BIT_WORD(fs->currentsector.sector, BPB_FATSZ16) != 0)
|
||||||
|
FATSz = GET_16BIT_WORD(fs->currentsector.sector, BPB_FATSZ16);
|
||||||
|
else
|
||||||
|
FATSz = GET_32BIT_WORD(fs->currentsector.sector, BPB_FAT32_FATSZ32);
|
||||||
|
|
||||||
|
if(GET_16BIT_WORD(fs->currentsector.sector, BPB_TOTSEC16) != 0)
|
||||||
|
total_sectors = GET_16BIT_WORD(fs->currentsector.sector, BPB_TOTSEC16);
|
||||||
|
else
|
||||||
|
total_sectors = GET_32BIT_WORD(fs->currentsector.sector, BPB_TOTSEC32);
|
||||||
|
|
||||||
|
data_sectors = total_sectors - (GET_16BIT_WORD(fs->currentsector.sector, BPB_RSVDSECCNT) + (fs->currentsector.sector[BPB_NUMFATS] * FATSz) + root_dir_sectors);
|
||||||
|
|
||||||
|
// Find out which version of FAT this is...
|
||||||
|
if (fs->sectors_per_cluster != 0)
|
||||||
|
{
|
||||||
|
count_of_clusters = data_sectors / fs->sectors_per_cluster;
|
||||||
|
|
||||||
|
if(count_of_clusters < 4085)
|
||||||
|
// Volume is FAT12
|
||||||
|
return FAT_INIT_WRONG_FILESYS_TYPE;
|
||||||
|
else if(count_of_clusters < 65525)
|
||||||
|
{
|
||||||
|
// Clear this FAT32 specific param
|
||||||
|
fs->rootdir_first_cluster = 0;
|
||||||
|
|
||||||
|
// Volume is FAT16
|
||||||
|
fs->fat_type = FAT_TYPE_16;
|
||||||
|
return FAT_INIT_OK;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Volume is FAT32
|
||||||
|
fs->fat_type = FAT_TYPE_32;
|
||||||
|
return FAT_INIT_OK;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
|
return FAT_INIT_WRONG_FILESYS_TYPE;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_lba_of_cluster: This function converts a cluster number into a sector /
|
||||||
|
// LBA number.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
uint32 fatfs_lba_of_cluster(struct fatfs *fs, uint32 Cluster_Number)
|
||||||
|
{
|
||||||
|
if (fs->fat_type == FAT_TYPE_16)
|
||||||
|
return (fs->cluster_begin_lba + (fs->root_entry_count * 32 / FAT_SECTOR_SIZE) + ((Cluster_Number-2) * fs->sectors_per_cluster));
|
||||||
|
else
|
||||||
|
return ((fs->cluster_begin_lba + ((Cluster_Number-2)*fs->sectors_per_cluster)));
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_sector_read:
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_sector_read(struct fatfs *fs, uint32 lba, uint8 *target, uint32 count)
|
||||||
|
{
|
||||||
|
return fs->disk_io.read_media(lba, target, count);
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_sector_write:
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_sector_write(struct fatfs *fs, uint32 lba, uint8 *target, uint32 count)
|
||||||
|
{
|
||||||
|
return fs->disk_io.write_media(lba, target, count);
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_sector_reader: From the provided startcluster and sector offset
|
||||||
|
// Returns True if success, returns False if not (including if read out of range)
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_sector_reader(struct fatfs *fs, uint32 start_cluster, uint32 offset, uint8 *target)
|
||||||
|
{
|
||||||
|
uint32 sector_to_read = 0;
|
||||||
|
uint32 cluster_to_read = 0;
|
||||||
|
uint32 cluster_chain = 0;
|
||||||
|
uint32 i;
|
||||||
|
uint32 lba;
|
||||||
|
|
||||||
|
// FAT16 Root directory
|
||||||
|
if (fs->fat_type == FAT_TYPE_16 && start_cluster == 0)
|
||||||
|
{
|
||||||
|
if (offset < fs->rootdir_sectors)
|
||||||
|
lba = fs->lba_begin + fs->rootdir_first_sector + offset;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
// FAT16/32 Other
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Set start of cluster chain to initial value
|
||||||
|
cluster_chain = start_cluster;
|
||||||
|
|
||||||
|
// Find parameters
|
||||||
|
cluster_to_read = offset / fs->sectors_per_cluster;
|
||||||
|
sector_to_read = offset - (cluster_to_read*fs->sectors_per_cluster);
|
||||||
|
|
||||||
|
// Follow chain to find cluster to read
|
||||||
|
for (i=0; i<cluster_to_read; i++)
|
||||||
|
cluster_chain = fatfs_find_next_cluster(fs, cluster_chain);
|
||||||
|
|
||||||
|
// If end of cluster chain then return false
|
||||||
|
if (cluster_chain == FAT32_LAST_CLUSTER)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Calculate sector address
|
||||||
|
lba = fatfs_lba_of_cluster(fs, cluster_chain)+sector_to_read;
|
||||||
|
}
|
||||||
|
|
||||||
|
// User provided target array
|
||||||
|
if (target)
|
||||||
|
return fs->disk_io.read_media(lba, target, 1);
|
||||||
|
// Else read sector if not already loaded
|
||||||
|
else if (lba != fs->currentsector.address)
|
||||||
|
{
|
||||||
|
fs->currentsector.address = lba;
|
||||||
|
return fs->disk_io.read_media(fs->currentsector.address, fs->currentsector.sector, 1);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_read_sector: Read from the provided cluster and sector offset
|
||||||
|
// Returns True if success, returns False if not
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_read_sector(struct fatfs *fs, uint32 cluster, uint32 sector, uint8 *target)
|
||||||
|
{
|
||||||
|
// FAT16 Root directory
|
||||||
|
if (fs->fat_type == FAT_TYPE_16 && cluster == 0)
|
||||||
|
{
|
||||||
|
uint32 lba;
|
||||||
|
|
||||||
|
// In FAT16, there are a limited amount of sectors in root dir!
|
||||||
|
if (sector < fs->rootdir_sectors)
|
||||||
|
lba = fs->lba_begin + fs->rootdir_first_sector + sector;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// User target buffer passed in
|
||||||
|
if (target)
|
||||||
|
{
|
||||||
|
// Read from disk
|
||||||
|
return fs->disk_io.read_media(lba, target, 1);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Calculate read address
|
||||||
|
fs->currentsector.address = lba;
|
||||||
|
|
||||||
|
// Read from disk
|
||||||
|
return fs->disk_io.read_media(fs->currentsector.address, fs->currentsector.sector, 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// FAT16/32 Other
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// User target buffer passed in
|
||||||
|
if (target)
|
||||||
|
{
|
||||||
|
// Calculate read address
|
||||||
|
uint32 lba = fatfs_lba_of_cluster(fs, cluster) + sector;
|
||||||
|
|
||||||
|
// Read from disk
|
||||||
|
return fs->disk_io.read_media(lba, target, 1);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Calculate write address
|
||||||
|
fs->currentsector.address = fatfs_lba_of_cluster(fs, cluster)+sector;
|
||||||
|
|
||||||
|
// Read from disk
|
||||||
|
return fs->disk_io.read_media(fs->currentsector.address, fs->currentsector.sector, 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_write_sector: Write to the provided cluster and sector offset
|
||||||
|
// Returns True if success, returns False if not
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
int fatfs_write_sector(struct fatfs *fs, uint32 cluster, uint32 sector, uint8 *target)
|
||||||
|
{
|
||||||
|
// No write access?
|
||||||
|
if (!fs->disk_io.write_media)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// FAT16 Root directory
|
||||||
|
if (fs->fat_type == FAT_TYPE_16 && cluster == 0)
|
||||||
|
{
|
||||||
|
uint32 lba;
|
||||||
|
|
||||||
|
// In FAT16 we cannot extend the root dir!
|
||||||
|
if (sector < fs->rootdir_sectors)
|
||||||
|
lba = fs->lba_begin + fs->rootdir_first_sector + sector;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// User target buffer passed in
|
||||||
|
if (target)
|
||||||
|
{
|
||||||
|
// Write to disk
|
||||||
|
return fs->disk_io.write_media(lba, target, 1);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Calculate write address
|
||||||
|
fs->currentsector.address = lba;
|
||||||
|
|
||||||
|
// Write to disk
|
||||||
|
return fs->disk_io.write_media(fs->currentsector.address, fs->currentsector.sector, 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// FAT16/32 Other
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// User target buffer passed in
|
||||||
|
if (target)
|
||||||
|
{
|
||||||
|
// Calculate write address
|
||||||
|
uint32 lba = fatfs_lba_of_cluster(fs, cluster) + sector;
|
||||||
|
|
||||||
|
// Write to disk
|
||||||
|
return fs->disk_io.write_media(lba, target, 1);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Calculate write address
|
||||||
|
fs->currentsector.address = fatfs_lba_of_cluster(fs, cluster)+sector;
|
||||||
|
|
||||||
|
// Write to disk
|
||||||
|
return fs->disk_io.write_media(fs->currentsector.address, fs->currentsector.sector, 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_show_details: Show the details about the filesystem
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
void fatfs_show_details(struct fatfs *fs)
|
||||||
|
{
|
||||||
|
FAT_PRINTF(("FAT details:\r\n"));
|
||||||
|
FAT_PRINTF((" Type =%s", (fs->fat_type == FAT_TYPE_32) ? "FAT32": "FAT16"));
|
||||||
|
FAT_PRINTF((" Root Dir First Cluster = %x\r\n", fs->rootdir_first_cluster));
|
||||||
|
FAT_PRINTF((" FAT Begin LBA = 0x%x\r\n",fs->fat_begin_lba));
|
||||||
|
FAT_PRINTF((" Cluster Begin LBA = 0x%x\r\n",fs->cluster_begin_lba));
|
||||||
|
FAT_PRINTF((" Sectors Per Cluster = %d\r\n", fs->sectors_per_cluster));
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_get_root_cluster: Get the root dir cluster
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
uint32 fatfs_get_root_cluster(struct fatfs *fs)
|
||||||
|
{
|
||||||
|
// NOTE: On FAT16 this will be 0 which has a special meaning...
|
||||||
|
return fs->rootdir_first_cluster;
|
||||||
|
}
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
// fatfs_get_file_entry: Find the file entry for a filename
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
uint32 fatfs_get_file_entry(struct fatfs *fs, uint32 Cluster, char *name_to_find, struct fat_dir_entry *sfEntry)
|
||||||
|
{
|
||||||
|
uint8 item=0;
|
||||||
|
uint16 recordoffset = 0;
|
||||||
|
uint8 i=0;
|
||||||
|
int x=0;
|
||||||
|
char *long_filename = NULL;
|
||||||
|
char short_filename[13];
|
||||||
|
struct lfn_cache lfn;
|
||||||
|
int dotRequired = 0;
|
||||||
|
struct fat_dir_entry *directoryEntry;
|
||||||
|
|
||||||
|
fatfs_lfn_cache_init(&lfn, 1);
|
||||||
|
|
||||||
|
// Main cluster following loop
|
||||||
|
while (1)
|
||||||
|
{
|
||||||
|
// Read sector
|
||||||
|
if (fatfs_sector_reader(fs, Cluster, x++, 0)) // If sector read was successfull
|
||||||
|
{
|
||||||
|
// Analyse Sector
|
||||||
|
for (item = 0; item < FAT_DIR_ENTRIES_PER_SECTOR; item++)
|
||||||
|
{
|
||||||
|
// Create the multiplier for sector access
|
||||||
|
recordoffset = FAT_DIR_ENTRY_SIZE * item;
|
||||||
|
|
||||||
|
// Overlay directory entry over buffer
|
||||||
|
directoryEntry = (struct fat_dir_entry*)(fs->currentsector.sector+recordoffset);
|
||||||
|
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
// Long File Name Text Found
|
||||||
|
if (fatfs_entry_lfn_text(directoryEntry) )
|
||||||
|
fatfs_lfn_cache_entry(&lfn, fs->currentsector.sector+recordoffset);
|
||||||
|
|
||||||
|
// If Invalid record found delete any long file name information collated
|
||||||
|
else if (fatfs_entry_lfn_invalid(directoryEntry) )
|
||||||
|
fatfs_lfn_cache_init(&lfn, 0);
|
||||||
|
|
||||||
|
// Normal SFN Entry and Long text exists
|
||||||
|
else if (fatfs_entry_lfn_exists(&lfn, directoryEntry) )
|
||||||
|
{
|
||||||
|
long_filename = fatfs_lfn_cache_get(&lfn);
|
||||||
|
|
||||||
|
// Compare names to see if they match
|
||||||
|
if (fatfs_compare_names(long_filename, name_to_find))
|
||||||
|
{
|
||||||
|
memcpy(sfEntry,directoryEntry,sizeof(struct fat_dir_entry));
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
fatfs_lfn_cache_init(&lfn, 0);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
#endif
|
||||||
|
// Normal Entry, only 8.3 Text
|
||||||
|
if (fatfs_entry_sfn_only(directoryEntry) )
|
||||||
|
{
|
||||||
|
memset(short_filename, 0, sizeof(short_filename));
|
||||||
|
|
||||||
|
// Copy name to string
|
||||||
|
for (i=0; i<8; i++)
|
||||||
|
short_filename[i] = directoryEntry->Name[i];
|
||||||
|
|
||||||
|
// Extension
|
||||||
|
dotRequired = 0;
|
||||||
|
for (i=8; i<11; i++)
|
||||||
|
{
|
||||||
|
short_filename[i+1] = directoryEntry->Name[i];
|
||||||
|
if (directoryEntry->Name[i] != ' ')
|
||||||
|
dotRequired = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Dot only required if extension present
|
||||||
|
if (dotRequired)
|
||||||
|
{
|
||||||
|
// If not . or .. entry
|
||||||
|
if (short_filename[0]!='.')
|
||||||
|
short_filename[8] = '.';
|
||||||
|
else
|
||||||
|
short_filename[8] = ' ';
|
||||||
|
}
|
||||||
|
else
|
||||||
|
short_filename[8] = ' ';
|
||||||
|
|
||||||
|
// Compare names to see if they match
|
||||||
|
if (fatfs_compare_names(short_filename, name_to_find))
|
||||||
|
{
|
||||||
|
memcpy(sfEntry,directoryEntry,sizeof(struct fat_dir_entry));
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
fatfs_lfn_cache_init(&lfn, 0);
|
||||||
|
}
|
||||||
|
} // End of if
|
||||||
|
}
|
||||||
|
else
|
||||||
|
break;
|
||||||
|
} // End of while loop
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
// fatfs_sfn_exists: Check if a short filename exists.
|
||||||
|
// NOTE: shortname is XXXXXXXXYYY not XXXXXXXX.YYY
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
int fatfs_sfn_exists(struct fatfs *fs, uint32 Cluster, char *shortname)
|
||||||
|
{
|
||||||
|
uint8 item=0;
|
||||||
|
uint16 recordoffset = 0;
|
||||||
|
int x=0;
|
||||||
|
struct fat_dir_entry *directoryEntry;
|
||||||
|
|
||||||
|
// Main cluster following loop
|
||||||
|
while (1)
|
||||||
|
{
|
||||||
|
// Read sector
|
||||||
|
if (fatfs_sector_reader(fs, Cluster, x++, 0)) // If sector read was successfull
|
||||||
|
{
|
||||||
|
// Analyse Sector
|
||||||
|
for (item = 0; item < FAT_DIR_ENTRIES_PER_SECTOR; item++)
|
||||||
|
{
|
||||||
|
// Create the multiplier for sector access
|
||||||
|
recordoffset = FAT_DIR_ENTRY_SIZE * item;
|
||||||
|
|
||||||
|
// Overlay directory entry over buffer
|
||||||
|
directoryEntry = (struct fat_dir_entry*)(fs->currentsector.sector+recordoffset);
|
||||||
|
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
// Long File Name Text Found
|
||||||
|
if (fatfs_entry_lfn_text(directoryEntry) )
|
||||||
|
;
|
||||||
|
|
||||||
|
// If Invalid record found delete any long file name information collated
|
||||||
|
else if (fatfs_entry_lfn_invalid(directoryEntry) )
|
||||||
|
;
|
||||||
|
else
|
||||||
|
#endif
|
||||||
|
// Normal Entry, only 8.3 Text
|
||||||
|
if (fatfs_entry_sfn_only(directoryEntry) )
|
||||||
|
{
|
||||||
|
if (strncmp((const char*)directoryEntry->Name, shortname, 11)==0)
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
} // End of if
|
||||||
|
}
|
||||||
|
else
|
||||||
|
break;
|
||||||
|
} // End of while loop
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
// fatfs_update_timestamps: Update date/time details
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
#if FATFS_INC_TIME_DATE_SUPPORT
|
||||||
|
int fatfs_update_timestamps(struct fat_dir_entry *directoryEntry, int create, int modify, int access)
|
||||||
|
{
|
||||||
|
time_t time_now;
|
||||||
|
struct tm * time_info;
|
||||||
|
uint16 fat_time;
|
||||||
|
uint16 fat_date;
|
||||||
|
|
||||||
|
// Get system time
|
||||||
|
time(&time_now);
|
||||||
|
|
||||||
|
// Convert to local time
|
||||||
|
time_info = localtime(&time_now);
|
||||||
|
|
||||||
|
// Convert time to FAT format
|
||||||
|
fat_time = fatfs_convert_to_fat_time(time_info->tm_hour, time_info->tm_min, time_info->tm_sec);
|
||||||
|
|
||||||
|
// Convert date to FAT format
|
||||||
|
fat_date = fatfs_convert_to_fat_date(time_info->tm_mday, time_info->tm_mon + 1, time_info->tm_year + 1900);
|
||||||
|
|
||||||
|
// Update requested fields
|
||||||
|
if (create)
|
||||||
|
{
|
||||||
|
directoryEntry->CrtTime[1] = fat_time >> 8;
|
||||||
|
directoryEntry->CrtTime[0] = fat_time >> 0;
|
||||||
|
directoryEntry->CrtDate[1] = fat_date >> 8;
|
||||||
|
directoryEntry->CrtDate[0] = fat_date >> 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (modify)
|
||||||
|
{
|
||||||
|
directoryEntry->WrtTime[1] = fat_time >> 8;
|
||||||
|
directoryEntry->WrtTime[0] = fat_time >> 0;
|
||||||
|
directoryEntry->WrtDate[1] = fat_date >> 8;
|
||||||
|
directoryEntry->WrtDate[0] = fat_date >> 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (access)
|
||||||
|
{
|
||||||
|
directoryEntry->LstAccDate[1] = fat_time >> 8;
|
||||||
|
directoryEntry->LstAccDate[0] = fat_time >> 0;
|
||||||
|
directoryEntry->LstAccDate[1] = fat_date >> 8;
|
||||||
|
directoryEntry->LstAccDate[0] = fat_date >> 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
// fatfs_update_file_length: Find a SFN entry and update it
|
||||||
|
// NOTE: shortname is XXXXXXXXYYY not XXXXXXXX.YYY
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
int fatfs_update_file_length(struct fatfs *fs, uint32 Cluster, char *shortname, uint32 fileLength)
|
||||||
|
{
|
||||||
|
uint8 item=0;
|
||||||
|
uint16 recordoffset = 0;
|
||||||
|
int x=0;
|
||||||
|
struct fat_dir_entry *directoryEntry;
|
||||||
|
|
||||||
|
// No write access?
|
||||||
|
if (!fs->disk_io.write_media)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Main cluster following loop
|
||||||
|
while (1)
|
||||||
|
{
|
||||||
|
// Read sector
|
||||||
|
if (fatfs_sector_reader(fs, Cluster, x++, 0)) // If sector read was successfull
|
||||||
|
{
|
||||||
|
// Analyse Sector
|
||||||
|
for (item = 0; item < FAT_DIR_ENTRIES_PER_SECTOR; item++)
|
||||||
|
{
|
||||||
|
// Create the multiplier for sector access
|
||||||
|
recordoffset = FAT_DIR_ENTRY_SIZE * item;
|
||||||
|
|
||||||
|
// Overlay directory entry over buffer
|
||||||
|
directoryEntry = (struct fat_dir_entry*)(fs->currentsector.sector+recordoffset);
|
||||||
|
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
// Long File Name Text Found
|
||||||
|
if (fatfs_entry_lfn_text(directoryEntry) )
|
||||||
|
;
|
||||||
|
|
||||||
|
// If Invalid record found delete any long file name information collated
|
||||||
|
else if (fatfs_entry_lfn_invalid(directoryEntry) )
|
||||||
|
;
|
||||||
|
|
||||||
|
// Normal Entry, only 8.3 Text
|
||||||
|
else
|
||||||
|
#endif
|
||||||
|
if (fatfs_entry_sfn_only(directoryEntry) )
|
||||||
|
{
|
||||||
|
if (strncmp((const char*)directoryEntry->Name, shortname, 11)==0)
|
||||||
|
{
|
||||||
|
directoryEntry->FileSize = FAT_HTONL(fileLength);
|
||||||
|
|
||||||
|
#if FATFS_INC_TIME_DATE_SUPPORT
|
||||||
|
// Update access / modify time & date
|
||||||
|
fatfs_update_timestamps(directoryEntry, 0, 1, 1);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Update sfn entry
|
||||||
|
memcpy((uint8*)(fs->currentsector.sector+recordoffset), (uint8*)directoryEntry, sizeof(struct fat_dir_entry));
|
||||||
|
|
||||||
|
// Write sector back
|
||||||
|
return fs->disk_io.write_media(fs->currentsector.address, fs->currentsector.sector, 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} // End of if
|
||||||
|
}
|
||||||
|
else
|
||||||
|
break;
|
||||||
|
} // End of while loop
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
// fatfs_mark_file_deleted: Find a SFN entry and mark if as deleted
|
||||||
|
// NOTE: shortname is XXXXXXXXYYY not XXXXXXXX.YYY
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
int fatfs_mark_file_deleted(struct fatfs *fs, uint32 Cluster, char *shortname)
|
||||||
|
{
|
||||||
|
uint8 item=0;
|
||||||
|
uint16 recordoffset = 0;
|
||||||
|
int x=0;
|
||||||
|
struct fat_dir_entry *directoryEntry;
|
||||||
|
|
||||||
|
// No write access?
|
||||||
|
if (!fs->disk_io.write_media)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Main cluster following loop
|
||||||
|
while (1)
|
||||||
|
{
|
||||||
|
// Read sector
|
||||||
|
if (fatfs_sector_reader(fs, Cluster, x++, 0)) // If sector read was successfull
|
||||||
|
{
|
||||||
|
// Analyse Sector
|
||||||
|
for (item = 0; item < FAT_DIR_ENTRIES_PER_SECTOR; item++)
|
||||||
|
{
|
||||||
|
// Create the multiplier for sector access
|
||||||
|
recordoffset = FAT_DIR_ENTRY_SIZE * item;
|
||||||
|
|
||||||
|
// Overlay directory entry over buffer
|
||||||
|
directoryEntry = (struct fat_dir_entry*)(fs->currentsector.sector+recordoffset);
|
||||||
|
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
// Long File Name Text Found
|
||||||
|
if (fatfs_entry_lfn_text(directoryEntry) )
|
||||||
|
;
|
||||||
|
|
||||||
|
// If Invalid record found delete any long file name information collated
|
||||||
|
else if (fatfs_entry_lfn_invalid(directoryEntry) )
|
||||||
|
;
|
||||||
|
|
||||||
|
// Normal Entry, only 8.3 Text
|
||||||
|
else
|
||||||
|
#endif
|
||||||
|
if (fatfs_entry_sfn_only(directoryEntry) )
|
||||||
|
{
|
||||||
|
if (strncmp((const char *)directoryEntry->Name, shortname, 11)==0)
|
||||||
|
{
|
||||||
|
// Mark as deleted
|
||||||
|
directoryEntry->Name[0] = FILE_HEADER_DELETED;
|
||||||
|
|
||||||
|
#if FATFS_INC_TIME_DATE_SUPPORT
|
||||||
|
// Update access / modify time & date
|
||||||
|
fatfs_update_timestamps(directoryEntry, 0, 1, 1);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Update sfn entry
|
||||||
|
memcpy((uint8*)(fs->currentsector.sector+recordoffset), (uint8*)directoryEntry, sizeof(struct fat_dir_entry));
|
||||||
|
|
||||||
|
// Write sector back
|
||||||
|
return fs->disk_io.write_media(fs->currentsector.address, fs->currentsector.sector, 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} // End of if
|
||||||
|
}
|
||||||
|
else
|
||||||
|
break;
|
||||||
|
} // End of while loop
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_list_directory_start: Initialise a directory listing procedure
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_DIR_LIST_SUPPORT
|
||||||
|
void fatfs_list_directory_start(struct fatfs *fs, struct fs_dir_list_status *dirls, uint32 StartCluster)
|
||||||
|
{
|
||||||
|
dirls->cluster = StartCluster;
|
||||||
|
dirls->sector = 0;
|
||||||
|
dirls->offset = 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_list_directory_next: Get the next entry in the directory.
|
||||||
|
// Returns: 1 = found, 0 = end of listing
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_DIR_LIST_SUPPORT
|
||||||
|
int fatfs_list_directory_next(struct fatfs *fs, struct fs_dir_list_status *dirls, struct fs_dir_ent *entry)
|
||||||
|
{
|
||||||
|
uint8 i,item;
|
||||||
|
uint16 recordoffset;
|
||||||
|
struct fat_dir_entry *directoryEntry;
|
||||||
|
char *long_filename = NULL;
|
||||||
|
char short_filename[13];
|
||||||
|
struct lfn_cache lfn;
|
||||||
|
int dotRequired = 0;
|
||||||
|
int result = 0;
|
||||||
|
|
||||||
|
// Initialise LFN cache first
|
||||||
|
fatfs_lfn_cache_init(&lfn, 0);
|
||||||
|
|
||||||
|
while (1)
|
||||||
|
{
|
||||||
|
// If data read OK
|
||||||
|
if (fatfs_sector_reader(fs, dirls->cluster, dirls->sector, 0))
|
||||||
|
{
|
||||||
|
// Maximum of 16 directory entries
|
||||||
|
for (item = dirls->offset; item < FAT_DIR_ENTRIES_PER_SECTOR; item++)
|
||||||
|
{
|
||||||
|
// Increase directory offset
|
||||||
|
recordoffset = FAT_DIR_ENTRY_SIZE * item;
|
||||||
|
|
||||||
|
// Overlay directory entry over buffer
|
||||||
|
directoryEntry = (struct fat_dir_entry*)(fs->currentsector.sector+recordoffset);
|
||||||
|
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
// Long File Name Text Found
|
||||||
|
if ( fatfs_entry_lfn_text(directoryEntry) )
|
||||||
|
fatfs_lfn_cache_entry(&lfn, fs->currentsector.sector+recordoffset);
|
||||||
|
|
||||||
|
// If Invalid record found delete any long file name information collated
|
||||||
|
else if ( fatfs_entry_lfn_invalid(directoryEntry) )
|
||||||
|
fatfs_lfn_cache_init(&lfn, 0);
|
||||||
|
|
||||||
|
// Normal SFN Entry and Long text exists
|
||||||
|
else if (fatfs_entry_lfn_exists(&lfn, directoryEntry) )
|
||||||
|
{
|
||||||
|
// Get text
|
||||||
|
long_filename = fatfs_lfn_cache_get(&lfn);
|
||||||
|
#if defined(_MSC_VER) || defined(WIN32)
|
||||||
|
strcpy_s(entry->filename, FATFS_MAX_LONG_FILENAME - 1, long_filename);
|
||||||
|
#else
|
||||||
|
strncpy(entry->filename, long_filename, FATFS_MAX_LONG_FILENAME - 1);
|
||||||
|
#endif
|
||||||
|
if (fatfs_entry_is_dir(directoryEntry))
|
||||||
|
entry->is_dir = 1;
|
||||||
|
else
|
||||||
|
entry->is_dir = 0;
|
||||||
|
|
||||||
|
#if FATFS_INC_TIME_DATE_SUPPORT
|
||||||
|
// Get time / dates
|
||||||
|
entry->create_time = ((uint16)directoryEntry->CrtTime[1] << 8) | directoryEntry->CrtTime[0];
|
||||||
|
entry->create_date = ((uint16)directoryEntry->CrtDate[1] << 8) | directoryEntry->CrtDate[0];
|
||||||
|
entry->access_date = ((uint16)directoryEntry->LstAccDate[1] << 8) | directoryEntry->LstAccDate[0];
|
||||||
|
entry->write_time = ((uint16)directoryEntry->WrtTime[1] << 8) | directoryEntry->WrtTime[0];
|
||||||
|
entry->write_date = ((uint16)directoryEntry->WrtDate[1] << 8) | directoryEntry->WrtDate[0];
|
||||||
|
#endif
|
||||||
|
|
||||||
|
entry->size = FAT_HTONL(directoryEntry->FileSize);
|
||||||
|
entry->cluster = (FAT_HTONS(directoryEntry->FstClusHI)<<16) | FAT_HTONS(directoryEntry->FstClusLO);
|
||||||
|
|
||||||
|
// Next starting position
|
||||||
|
dirls->offset = item + 1;
|
||||||
|
result = 1;
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
// Normal Entry, only 8.3 Text
|
||||||
|
else
|
||||||
|
#endif
|
||||||
|
if ( fatfs_entry_sfn_only(directoryEntry) )
|
||||||
|
{
|
||||||
|
fatfs_lfn_cache_init(&lfn, 0);
|
||||||
|
|
||||||
|
memset(short_filename, 0, sizeof(short_filename));
|
||||||
|
|
||||||
|
// Copy name to string
|
||||||
|
for (i=0; i<8; i++)
|
||||||
|
short_filename[i] = directoryEntry->Name[i];
|
||||||
|
|
||||||
|
// Extension
|
||||||
|
dotRequired = 0;
|
||||||
|
for (i=8; i<11; i++)
|
||||||
|
{
|
||||||
|
short_filename[i+1] = directoryEntry->Name[i];
|
||||||
|
if (directoryEntry->Name[i] != ' ')
|
||||||
|
dotRequired = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Dot only required if extension present
|
||||||
|
if (dotRequired)
|
||||||
|
{
|
||||||
|
// If not . or .. entry
|
||||||
|
if (short_filename[0]!='.')
|
||||||
|
short_filename[8] = '.';
|
||||||
|
else
|
||||||
|
short_filename[8] = ' ';
|
||||||
|
}
|
||||||
|
else
|
||||||
|
short_filename[8] = ' ';
|
||||||
|
|
||||||
|
fatfs_get_sfn_display_name(entry->filename, short_filename);
|
||||||
|
|
||||||
|
if (fatfs_entry_is_dir(directoryEntry))
|
||||||
|
entry->is_dir = 1;
|
||||||
|
else
|
||||||
|
entry->is_dir = 0;
|
||||||
|
|
||||||
|
#if FATFS_INC_TIME_DATE_SUPPORT
|
||||||
|
// Get time / dates
|
||||||
|
entry->create_time = ((uint16)directoryEntry->CrtTime[1] << 8) | directoryEntry->CrtTime[0];
|
||||||
|
entry->create_date = ((uint16)directoryEntry->CrtDate[1] << 8) | directoryEntry->CrtDate[0];
|
||||||
|
entry->access_date = ((uint16)directoryEntry->LstAccDate[1] << 8) | directoryEntry->LstAccDate[0];
|
||||||
|
entry->write_time = ((uint16)directoryEntry->WrtTime[1] << 8) | directoryEntry->WrtTime[0];
|
||||||
|
entry->write_date = ((uint16)directoryEntry->WrtDate[1] << 8) | directoryEntry->WrtDate[0];
|
||||||
|
#endif
|
||||||
|
|
||||||
|
entry->size = FAT_HTONL(directoryEntry->FileSize);
|
||||||
|
entry->cluster = (FAT_HTONS(directoryEntry->FstClusHI)<<16) | FAT_HTONS(directoryEntry->FstClusLO);
|
||||||
|
|
||||||
|
// Next starting position
|
||||||
|
dirls->offset = item + 1;
|
||||||
|
result = 1;
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
}// end of for
|
||||||
|
|
||||||
|
// If reached end of the dir move onto next sector
|
||||||
|
dirls->sector++;
|
||||||
|
dirls->offset = 0;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,133 @@
|
||||||
|
#ifndef __FAT_ACCESS_H__
|
||||||
|
#define __FAT_ACCESS_H__
|
||||||
|
|
||||||
|
#include "fat_defs.h"
|
||||||
|
#include "fat_opts.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Defines
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#define FAT_INIT_OK 0
|
||||||
|
#define FAT_INIT_MEDIA_ACCESS_ERROR (-1)
|
||||||
|
#define FAT_INIT_INVALID_SECTOR_SIZE (-2)
|
||||||
|
#define FAT_INIT_INVALID_SIGNATURE (-3)
|
||||||
|
#define FAT_INIT_ENDIAN_ERROR (-4)
|
||||||
|
#define FAT_INIT_WRONG_FILESYS_TYPE (-5)
|
||||||
|
#define FAT_INIT_WRONG_PARTITION_TYPE (-6)
|
||||||
|
#define FAT_INIT_STRUCT_PACKING (-7)
|
||||||
|
|
||||||
|
#define FAT_DIR_ENTRIES_PER_SECTOR (FAT_SECTOR_SIZE / FAT_DIR_ENTRY_SIZE)
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Function Pointers
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
typedef int (*fn_diskio_read) (uint32 sector, uint8 *buffer, uint32 sector_count);
|
||||||
|
typedef int (*fn_diskio_write)(uint32 sector, uint8 *buffer, uint32 sector_count);
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Structures
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
struct disk_if
|
||||||
|
{
|
||||||
|
// User supplied function pointers for disk IO
|
||||||
|
fn_diskio_read read_media;
|
||||||
|
fn_diskio_write write_media;
|
||||||
|
};
|
||||||
|
|
||||||
|
// Forward declaration
|
||||||
|
struct fat_buffer;
|
||||||
|
|
||||||
|
struct fat_buffer
|
||||||
|
{
|
||||||
|
uint8 sector[FAT_SECTOR_SIZE * FAT_BUFFER_SECTORS];
|
||||||
|
uint32 address;
|
||||||
|
int dirty;
|
||||||
|
uint8 * ptr;
|
||||||
|
|
||||||
|
// Next in chain of sector buffers
|
||||||
|
struct fat_buffer *next;
|
||||||
|
};
|
||||||
|
|
||||||
|
typedef enum eFatType
|
||||||
|
{
|
||||||
|
FAT_TYPE_16,
|
||||||
|
FAT_TYPE_32
|
||||||
|
} tFatType;
|
||||||
|
|
||||||
|
struct fatfs
|
||||||
|
{
|
||||||
|
// Filesystem globals
|
||||||
|
uint8 sectors_per_cluster;
|
||||||
|
uint32 cluster_begin_lba;
|
||||||
|
uint32 rootdir_first_cluster;
|
||||||
|
uint32 rootdir_first_sector;
|
||||||
|
uint32 rootdir_sectors;
|
||||||
|
uint32 fat_begin_lba;
|
||||||
|
uint16 fs_info_sector;
|
||||||
|
uint32 lba_begin;
|
||||||
|
uint32 fat_sectors;
|
||||||
|
uint32 next_free_cluster;
|
||||||
|
uint16 root_entry_count;
|
||||||
|
uint16 reserved_sectors;
|
||||||
|
uint8 num_of_fats;
|
||||||
|
tFatType fat_type;
|
||||||
|
|
||||||
|
// Disk/Media API
|
||||||
|
struct disk_if disk_io;
|
||||||
|
|
||||||
|
// [Optional] Thread Safety
|
||||||
|
void (*fl_lock)(void);
|
||||||
|
void (*fl_unlock)(void);
|
||||||
|
|
||||||
|
// Working buffer
|
||||||
|
struct fat_buffer currentsector;
|
||||||
|
|
||||||
|
// FAT Buffer
|
||||||
|
struct fat_buffer *fat_buffer_head;
|
||||||
|
struct fat_buffer fat_buffers[FAT_BUFFERS];
|
||||||
|
};
|
||||||
|
|
||||||
|
struct fs_dir_list_status
|
||||||
|
{
|
||||||
|
uint32 sector;
|
||||||
|
uint32 cluster;
|
||||||
|
uint8 offset;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct fs_dir_ent
|
||||||
|
{
|
||||||
|
char filename[FATFS_MAX_LONG_FILENAME];
|
||||||
|
uint8 is_dir;
|
||||||
|
uint32 cluster;
|
||||||
|
uint32 size;
|
||||||
|
|
||||||
|
#if FATFS_INC_TIME_DATE_SUPPORT
|
||||||
|
uint16 access_date;
|
||||||
|
uint16 write_time;
|
||||||
|
uint16 write_date;
|
||||||
|
uint16 create_date;
|
||||||
|
uint16 create_time;
|
||||||
|
#endif
|
||||||
|
};
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Prototypes
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_init(struct fatfs *fs);
|
||||||
|
uint32 fatfs_lba_of_cluster(struct fatfs *fs, uint32 Cluster_Number);
|
||||||
|
int fatfs_sector_reader(struct fatfs *fs, uint32 Startcluster, uint32 offset, uint8 *target);
|
||||||
|
int fatfs_sector_read(struct fatfs *fs, uint32 lba, uint8 *target, uint32 count);
|
||||||
|
int fatfs_sector_write(struct fatfs *fs, uint32 lba, uint8 *target, uint32 count);
|
||||||
|
int fatfs_read_sector(struct fatfs *fs, uint32 cluster, uint32 sector, uint8 *target);
|
||||||
|
int fatfs_write_sector(struct fatfs *fs, uint32 cluster, uint32 sector, uint8 *target);
|
||||||
|
void fatfs_show_details(struct fatfs *fs);
|
||||||
|
uint32 fatfs_get_root_cluster(struct fatfs *fs);
|
||||||
|
uint32 fatfs_get_file_entry(struct fatfs *fs, uint32 Cluster, char *nametofind, struct fat_dir_entry *sfEntry);
|
||||||
|
int fatfs_sfn_exists(struct fatfs *fs, uint32 Cluster, char *shortname);
|
||||||
|
int fatfs_update_file_length(struct fatfs *fs, uint32 Cluster, char *shortname, uint32 fileLength);
|
||||||
|
int fatfs_mark_file_deleted(struct fatfs *fs, uint32 Cluster, char *shortname);
|
||||||
|
void fatfs_list_directory_start(struct fatfs *fs, struct fs_dir_list_status *dirls, uint32 StartCluster);
|
||||||
|
int fatfs_list_directory_next(struct fatfs *fs, struct fs_dir_list_status *dirls, struct fs_dir_ent *entry);
|
||||||
|
int fatfs_update_timestamps(struct fat_dir_entry *directoryEntry, int create, int modify, int access);
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,91 @@
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT16/32 File IO Library
|
||||||
|
// V2.6
|
||||||
|
// Ultra-Embedded.com
|
||||||
|
// Copyright 2003 - 2012
|
||||||
|
//
|
||||||
|
// Email: admin@ultra-embedded.com
|
||||||
|
//
|
||||||
|
// License: GPL
|
||||||
|
// If you would like a version with a more permissive license for use in
|
||||||
|
// closed source commercial applications please contact me for details.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//
|
||||||
|
// This file is part of FAT File IO Library.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 2 of the License, or
|
||||||
|
// (at your option) any later version.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 FAT File IO Library; if not, write to the Free Software
|
||||||
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#include <string.h>
|
||||||
|
#include "fat_cache.h"
|
||||||
|
|
||||||
|
// Per file cluster chain caching used to improve performance.
|
||||||
|
// This does not have to be enabled for architectures with low
|
||||||
|
// memory space.
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_cache_init:
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_cache_init(struct fatfs *fs, FL_FILE *file)
|
||||||
|
{
|
||||||
|
#ifdef FAT_CLUSTER_CACHE_ENTRIES
|
||||||
|
int i;
|
||||||
|
|
||||||
|
for (i=0;i<FAT_CLUSTER_CACHE_ENTRIES;i++)
|
||||||
|
{
|
||||||
|
file->cluster_cache_idx[i] = 0xFFFFFFFF; // Not used
|
||||||
|
file->cluster_cache_data[i] = 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_cache_get_next_cluster:
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_cache_get_next_cluster(struct fatfs *fs, FL_FILE *file, uint32 clusterIdx, uint32 *pNextCluster)
|
||||||
|
{
|
||||||
|
#ifdef FAT_CLUSTER_CACHE_ENTRIES
|
||||||
|
uint32 slot = clusterIdx % FAT_CLUSTER_CACHE_ENTRIES;
|
||||||
|
|
||||||
|
if (file->cluster_cache_idx[slot] == clusterIdx)
|
||||||
|
{
|
||||||
|
*pNextCluster = file->cluster_cache_data[slot];
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_cache_set_next_cluster:
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_cache_set_next_cluster(struct fatfs *fs, FL_FILE *file, uint32 clusterIdx, uint32 nextCluster)
|
||||||
|
{
|
||||||
|
#ifdef FAT_CLUSTER_CACHE_ENTRIES
|
||||||
|
uint32 slot = clusterIdx % FAT_CLUSTER_CACHE_ENTRIES;
|
||||||
|
|
||||||
|
if (file->cluster_cache_idx[slot] == clusterIdx)
|
||||||
|
file->cluster_cache_data[slot] = nextCluster;
|
||||||
|
else
|
||||||
|
{
|
||||||
|
file->cluster_cache_idx[slot] = clusterIdx;
|
||||||
|
file->cluster_cache_data[slot] = nextCluster;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,13 @@
|
||||||
|
#ifndef __FAT_CACHE_H__
|
||||||
|
#define __FAT_CACHE_H__
|
||||||
|
|
||||||
|
#include "fat_filelib.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Prototypes
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_cache_init(struct fatfs *fs, FL_FILE *file);
|
||||||
|
int fatfs_cache_get_next_cluster(struct fatfs *fs, FL_FILE *file, uint32 clusterIdx, uint32 *pNextCluster);
|
||||||
|
int fatfs_cache_set_next_cluster(struct fatfs *fs, FL_FILE *file, uint32 clusterIdx, uint32 nextCluster);
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,128 @@
|
||||||
|
#ifndef __FAT_DEFS_H__
|
||||||
|
#define __FAT_DEFS_H__
|
||||||
|
|
||||||
|
#include "fat_opts.h"
|
||||||
|
#include "fat_types.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT32 Offsets
|
||||||
|
// Name Offset
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
// Boot Sector
|
||||||
|
#define BS_JMPBOOT 0 // Length = 3
|
||||||
|
#define BS_OEMNAME 3 // Length = 8
|
||||||
|
#define BPB_BYTSPERSEC 11 // Length = 2
|
||||||
|
#define BPB_SECPERCLUS 13 // Length = 1
|
||||||
|
#define BPB_RSVDSECCNT 14 // Length = 2
|
||||||
|
#define BPB_NUMFATS 16 // Length = 1
|
||||||
|
#define BPB_ROOTENTCNT 17 // Length = 2
|
||||||
|
#define BPB_TOTSEC16 19 // Length = 2
|
||||||
|
#define BPB_MEDIA 21 // Length = 1
|
||||||
|
#define BPB_FATSZ16 22 // Length = 2
|
||||||
|
#define BPB_SECPERTRK 24 // Length = 2
|
||||||
|
#define BPB_NUMHEADS 26 // Length = 2
|
||||||
|
#define BPB_HIDDSEC 28 // Length = 4
|
||||||
|
#define BPB_TOTSEC32 32 // Length = 4
|
||||||
|
|
||||||
|
// FAT 12/16
|
||||||
|
#define BS_FAT_DRVNUM 36 // Length = 1
|
||||||
|
#define BS_FAT_BOOTSIG 38 // Length = 1
|
||||||
|
#define BS_FAT_VOLID 39 // Length = 4
|
||||||
|
#define BS_FAT_VOLLAB 43 // Length = 11
|
||||||
|
#define BS_FAT_FILSYSTYPE 54 // Length = 8
|
||||||
|
|
||||||
|
// FAT 32
|
||||||
|
#define BPB_FAT32_FATSZ32 36 // Length = 4
|
||||||
|
#define BPB_FAT32_EXTFLAGS 40 // Length = 2
|
||||||
|
#define BPB_FAT32_FSVER 42 // Length = 2
|
||||||
|
#define BPB_FAT32_ROOTCLUS 44 // Length = 4
|
||||||
|
#define BPB_FAT32_FSINFO 48 // Length = 2
|
||||||
|
#define BPB_FAT32_BKBOOTSEC 50 // Length = 2
|
||||||
|
#define BS_FAT32_DRVNUM 64 // Length = 1
|
||||||
|
#define BS_FAT32_BOOTSIG 66 // Length = 1
|
||||||
|
#define BS_FAT32_VOLID 67 // Length = 4
|
||||||
|
#define BS_FAT32_VOLLAB 71 // Length = 11
|
||||||
|
#define BS_FAT32_FILSYSTYPE 82 // Length = 8
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT Types
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#define FAT_TYPE_FAT12 1
|
||||||
|
#define FAT_TYPE_FAT16 2
|
||||||
|
#define FAT_TYPE_FAT32 3
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT32 Specific Statics
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#define SIGNATURE_POSITION 510
|
||||||
|
#define SIGNATURE_VALUE 0xAA55
|
||||||
|
#define PARTITION1_TYPECODE_LOCATION 450
|
||||||
|
#define FAT32_TYPECODE1 0x0B
|
||||||
|
#define FAT32_TYPECODE2 0x0C
|
||||||
|
#define PARTITION1_LBA_BEGIN_LOCATION 454
|
||||||
|
#define PARTITION1_SIZE_LOCATION 458
|
||||||
|
|
||||||
|
#define FAT_DIR_ENTRY_SIZE 32
|
||||||
|
#define FAT_SFN_SIZE_FULL 11
|
||||||
|
#define FAT_SFN_SIZE_PARTIAL 8
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT32 File Attributes and Types
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#define FILE_ATTR_READ_ONLY 0x01
|
||||||
|
#define FILE_ATTR_HIDDEN 0x02
|
||||||
|
#define FILE_ATTR_SYSTEM 0x04
|
||||||
|
#define FILE_ATTR_SYSHID 0x06
|
||||||
|
#define FILE_ATTR_VOLUME_ID 0x08
|
||||||
|
#define FILE_ATTR_DIRECTORY 0x10
|
||||||
|
#define FILE_ATTR_ARCHIVE 0x20
|
||||||
|
#define FILE_ATTR_LFN_TEXT 0x0F
|
||||||
|
#define FILE_HEADER_BLANK 0x00
|
||||||
|
#define FILE_HEADER_DELETED 0xE5
|
||||||
|
#define FILE_TYPE_DIR 0x10
|
||||||
|
#define FILE_TYPE_FILE 0x20
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Time / Date details
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#define FAT_TIME_HOURS_SHIFT 11
|
||||||
|
#define FAT_TIME_HOURS_MASK 0x1F
|
||||||
|
#define FAT_TIME_MINUTES_SHIFT 5
|
||||||
|
#define FAT_TIME_MINUTES_MASK 0x3F
|
||||||
|
#define FAT_TIME_SECONDS_SHIFT 0
|
||||||
|
#define FAT_TIME_SECONDS_MASK 0x1F
|
||||||
|
#define FAT_TIME_SECONDS_SCALE 2
|
||||||
|
#define FAT_DATE_YEAR_SHIFT 9
|
||||||
|
#define FAT_DATE_YEAR_MASK 0x7F
|
||||||
|
#define FAT_DATE_MONTH_SHIFT 5
|
||||||
|
#define FAT_DATE_MONTH_MASK 0xF
|
||||||
|
#define FAT_DATE_DAY_SHIFT 0
|
||||||
|
#define FAT_DATE_DAY_MASK 0x1F
|
||||||
|
#define FAT_DATE_YEAR_OFFSET 1980
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Other Defines
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#define FAT32_LAST_CLUSTER 0xFFFFFFFF
|
||||||
|
#define FAT32_INVALID_CLUSTER 0xFFFFFFFF
|
||||||
|
|
||||||
|
STRUCT_PACK_BEGIN
|
||||||
|
struct fat_dir_entry STRUCT_PACK
|
||||||
|
{
|
||||||
|
uint8 Name[11];
|
||||||
|
uint8 Attr;
|
||||||
|
uint8 NTRes;
|
||||||
|
uint8 CrtTimeTenth;
|
||||||
|
uint8 CrtTime[2];
|
||||||
|
uint8 CrtDate[2];
|
||||||
|
uint8 LstAccDate[2];
|
||||||
|
uint16 FstClusHI;
|
||||||
|
uint8 WrtTime[2];
|
||||||
|
uint8 WrtDate[2];
|
||||||
|
uint16 FstClusLO;
|
||||||
|
uint32 FileSize;
|
||||||
|
} STRUCT_PACKED;
|
||||||
|
STRUCT_PACK_END
|
||||||
|
|
||||||
|
#endif
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,146 @@
|
||||||
|
#ifndef __FAT_FILELIB_H__
|
||||||
|
#define __FAT_FILELIB_H__
|
||||||
|
|
||||||
|
#include "fat_opts.h"
|
||||||
|
#include "fat_access.h"
|
||||||
|
#include "fat_list.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Defines
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#ifndef SEEK_CUR
|
||||||
|
#define SEEK_CUR 1
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef SEEK_END
|
||||||
|
#define SEEK_END 2
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef SEEK_SET
|
||||||
|
#define SEEK_SET 0
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef EOF
|
||||||
|
#define EOF (-1)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Structures
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
struct sFL_FILE;
|
||||||
|
|
||||||
|
struct cluster_lookup
|
||||||
|
{
|
||||||
|
uint32 ClusterIdx;
|
||||||
|
uint32 CurrentCluster;
|
||||||
|
};
|
||||||
|
|
||||||
|
typedef struct sFL_FILE
|
||||||
|
{
|
||||||
|
uint32 parentcluster;
|
||||||
|
uint32 startcluster;
|
||||||
|
uint32 bytenum;
|
||||||
|
uint32 filelength;
|
||||||
|
int filelength_changed;
|
||||||
|
char path[FATFS_MAX_LONG_FILENAME];
|
||||||
|
char filename[FATFS_MAX_LONG_FILENAME];
|
||||||
|
uint8 shortfilename[11];
|
||||||
|
|
||||||
|
#ifdef FAT_CLUSTER_CACHE_ENTRIES
|
||||||
|
uint32 cluster_cache_idx[FAT_CLUSTER_CACHE_ENTRIES];
|
||||||
|
uint32 cluster_cache_data[FAT_CLUSTER_CACHE_ENTRIES];
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Cluster Lookup
|
||||||
|
struct cluster_lookup last_fat_lookup;
|
||||||
|
|
||||||
|
// Read/Write sector buffer
|
||||||
|
uint8 file_data_sector[FAT_SECTOR_SIZE];
|
||||||
|
uint32 file_data_address;
|
||||||
|
int file_data_dirty;
|
||||||
|
|
||||||
|
// File fopen flags
|
||||||
|
uint8 flags;
|
||||||
|
#define FILE_READ (1 << 0)
|
||||||
|
#define FILE_WRITE (1 << 1)
|
||||||
|
#define FILE_APPEND (1 << 2)
|
||||||
|
#define FILE_BINARY (1 << 3)
|
||||||
|
#define FILE_ERASE (1 << 4)
|
||||||
|
#define FILE_CREATE (1 << 5)
|
||||||
|
|
||||||
|
struct fat_node list_node;
|
||||||
|
} FL_FILE;
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Prototypes
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
// External
|
||||||
|
void fl_init(void);
|
||||||
|
void fl_attach_locks(void (*lock)(void), void (*unlock)(void));
|
||||||
|
int fl_attach_media(fn_diskio_read rd, fn_diskio_write wr);
|
||||||
|
void fl_shutdown(void);
|
||||||
|
|
||||||
|
// Standard API
|
||||||
|
void* fl_fopen(const char *path, const char *modifiers);
|
||||||
|
void fl_fclose(void *file);
|
||||||
|
int fl_fflush(void *file);
|
||||||
|
int fl_fgetc(void *file);
|
||||||
|
char * fl_fgets(char *s, int n, void *f);
|
||||||
|
int fl_fputc(int c, void *file);
|
||||||
|
int fl_fputs(const char * str, void *file);
|
||||||
|
int fl_fwrite(const void * data, int size, int count, void *file );
|
||||||
|
int fl_fread(void * data, int size, int count, void *file );
|
||||||
|
int fl_fseek(void *file , long offset , int origin );
|
||||||
|
int fl_fgetpos(void *file , uint32 * position);
|
||||||
|
long fl_ftell(void *f);
|
||||||
|
int fl_feof(void *f);
|
||||||
|
int fl_remove(const char * filename);
|
||||||
|
|
||||||
|
// Equivelant dirent.h
|
||||||
|
typedef struct fs_dir_list_status FL_DIR;
|
||||||
|
typedef struct fs_dir_ent fl_dirent;
|
||||||
|
|
||||||
|
FL_DIR* fl_opendir(const char* path, FL_DIR *dir);
|
||||||
|
int fl_readdir(FL_DIR *dirls, fl_dirent *entry);
|
||||||
|
int fl_closedir(FL_DIR* dir);
|
||||||
|
|
||||||
|
// Extensions
|
||||||
|
void fl_listdirectory(const char *path);
|
||||||
|
int fl_createdirectory(const char *path);
|
||||||
|
int fl_is_dir(const char *path);
|
||||||
|
|
||||||
|
int fl_format(uint32 volume_sectors, const char *name);
|
||||||
|
|
||||||
|
// Test hooks
|
||||||
|
#ifdef FATFS_INC_TEST_HOOKS
|
||||||
|
struct fatfs* fl_get_fs(void);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Stdio file I/O names
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#ifdef USE_FILELIB_STDIO_COMPAT_NAMES
|
||||||
|
|
||||||
|
#define FILE FL_FILE
|
||||||
|
|
||||||
|
#define fopen(a,b) fl_fopen(a, b)
|
||||||
|
#define fclose(a) fl_fclose(a)
|
||||||
|
#define fflush(a) fl_fflush(a)
|
||||||
|
#define fgetc(a) fl_fgetc(a)
|
||||||
|
#define fgets(a,b,c) fl_fgets(a, b, c)
|
||||||
|
#define fputc(a,b) fl_fputc(a, b)
|
||||||
|
#define fputs(a,b) fl_fputs(a, b)
|
||||||
|
#define fwrite(a,b,c,d) fl_fwrite(a, b, c, d)
|
||||||
|
#define fread(a,b,c,d) fl_fread(a, b, c, d)
|
||||||
|
#define fseek(a,b,c) fl_fseek(a, b, c)
|
||||||
|
#define fgetpos(a,b) fl_fgetpos(a, b)
|
||||||
|
#define ftell(a) fl_ftell(a)
|
||||||
|
#define feof(a) fl_feof(a)
|
||||||
|
#define remove(a) fl_remove(a)
|
||||||
|
#define mkdir(a) fl_createdirectory(a)
|
||||||
|
#define rmdir(a) 0
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,532 @@
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT16/32 File IO Library
|
||||||
|
// V2.6
|
||||||
|
// Ultra-Embedded.com
|
||||||
|
// Copyright 2003 - 2012
|
||||||
|
//
|
||||||
|
// Email: admin@ultra-embedded.com
|
||||||
|
//
|
||||||
|
// License: GPL
|
||||||
|
// If you would like a version with a more permissive license for use in
|
||||||
|
// closed source commercial applications please contact me for details.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//
|
||||||
|
// This file is part of FAT File IO Library.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 2 of the License, or
|
||||||
|
// (at your option) any later version.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 FAT File IO Library; if not, write to the Free Software
|
||||||
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#include <string.h>
|
||||||
|
#include "fat_defs.h"
|
||||||
|
#include "fat_access.h"
|
||||||
|
#include "fat_table.h"
|
||||||
|
#include "fat_write.h"
|
||||||
|
#include "fat_string.h"
|
||||||
|
#include "fat_misc.h"
|
||||||
|
#include "fat_format.h"
|
||||||
|
|
||||||
|
#if FATFS_INC_FORMAT_SUPPORT
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Tables
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
struct sec_per_clus_table
|
||||||
|
{
|
||||||
|
uint32 sectors;
|
||||||
|
uint8 sectors_per_cluster;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct sec_per_clus_table _cluster_size_table16[] =
|
||||||
|
{
|
||||||
|
{ 32680, 2}, // 16MB - 1K
|
||||||
|
{ 262144, 4}, // 128MB - 2K
|
||||||
|
{ 524288, 8}, // 256MB - 4K
|
||||||
|
{ 1048576, 16}, // 512MB - 8K
|
||||||
|
{ 2097152, 32}, // 1GB - 16K
|
||||||
|
{ 4194304, 64}, // 2GB - 32K
|
||||||
|
{ 8388608, 128},// 2GB - 64K [Warning only supported by Windows XP onwards]
|
||||||
|
{ 0 , 0 } // Invalid
|
||||||
|
};
|
||||||
|
|
||||||
|
struct sec_per_clus_table _cluster_size_table32[] =
|
||||||
|
{
|
||||||
|
{ 532480, 1}, // 260MB - 512b
|
||||||
|
{ 16777216, 8}, // 8GB - 4K
|
||||||
|
{ 33554432, 16}, // 16GB - 8K
|
||||||
|
{ 67108864, 32}, // 32GB - 16K
|
||||||
|
{ 0xFFFFFFFF, 64},// >32GB - 32K
|
||||||
|
{ 0 , 0 } // Invalid
|
||||||
|
};
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_calc_cluster_size: Calculate what cluster size should be used
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static uint8 fatfs_calc_cluster_size(uint32 sectors, int is_fat32)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
|
||||||
|
if (!is_fat32)
|
||||||
|
{
|
||||||
|
for (i=0; _cluster_size_table16[i].sectors_per_cluster != 0;i++)
|
||||||
|
if (sectors <= _cluster_size_table16[i].sectors)
|
||||||
|
return _cluster_size_table16[i].sectors_per_cluster;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
for (i=0; _cluster_size_table32[i].sectors_per_cluster != 0;i++)
|
||||||
|
if (sectors <= _cluster_size_table32[i].sectors)
|
||||||
|
return _cluster_size_table32[i].sectors_per_cluster;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_erase_sectors: Erase a number of sectors
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static int fatfs_erase_sectors(struct fatfs *fs, uint32 lba, int count)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
|
||||||
|
// Zero sector first
|
||||||
|
memset(fs->currentsector.sector, 0, FAT_SECTOR_SIZE);
|
||||||
|
|
||||||
|
for (i=0;i<count;i++)
|
||||||
|
if (!fs->disk_io.write_media(lba + i, fs->currentsector.sector, 1))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_create_boot_sector: Create the boot sector
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static int fatfs_create_boot_sector(struct fatfs *fs, uint32 boot_sector_lba, uint32 vol_sectors, const char *name, int is_fat32)
|
||||||
|
{
|
||||||
|
uint32 total_clusters;
|
||||||
|
int i;
|
||||||
|
|
||||||
|
// Zero sector initially
|
||||||
|
memset(fs->currentsector.sector, 0, FAT_SECTOR_SIZE);
|
||||||
|
|
||||||
|
// OEM Name & Jump Code
|
||||||
|
fs->currentsector.sector[0] = 0xEB;
|
||||||
|
fs->currentsector.sector[1] = 0x3C;
|
||||||
|
fs->currentsector.sector[2] = 0x90;
|
||||||
|
fs->currentsector.sector[3] = 0x4D;
|
||||||
|
fs->currentsector.sector[4] = 0x53;
|
||||||
|
fs->currentsector.sector[5] = 0x44;
|
||||||
|
fs->currentsector.sector[6] = 0x4F;
|
||||||
|
fs->currentsector.sector[7] = 0x53;
|
||||||
|
fs->currentsector.sector[8] = 0x35;
|
||||||
|
fs->currentsector.sector[9] = 0x2E;
|
||||||
|
fs->currentsector.sector[10] = 0x30;
|
||||||
|
|
||||||
|
// Bytes per sector
|
||||||
|
fs->currentsector.sector[11] = (FAT_SECTOR_SIZE >> 0) & 0xFF;
|
||||||
|
fs->currentsector.sector[12] = (FAT_SECTOR_SIZE >> 8) & 0xFF;
|
||||||
|
|
||||||
|
// Get sectors per cluster size for the disk
|
||||||
|
fs->sectors_per_cluster = fatfs_calc_cluster_size(vol_sectors, is_fat32);
|
||||||
|
if (!fs->sectors_per_cluster)
|
||||||
|
return 0; // Invalid disk size
|
||||||
|
|
||||||
|
// Sectors per cluster
|
||||||
|
fs->currentsector.sector[13] = fs->sectors_per_cluster;
|
||||||
|
|
||||||
|
// Reserved Sectors
|
||||||
|
if (!is_fat32)
|
||||||
|
fs->reserved_sectors = 8;
|
||||||
|
else
|
||||||
|
fs->reserved_sectors = 32;
|
||||||
|
fs->currentsector.sector[14] = (fs->reserved_sectors >> 0) & 0xFF;
|
||||||
|
fs->currentsector.sector[15] = (fs->reserved_sectors >> 8) & 0xFF;
|
||||||
|
|
||||||
|
// Number of FATS
|
||||||
|
fs->num_of_fats = 2;
|
||||||
|
fs->currentsector.sector[16] = fs->num_of_fats;
|
||||||
|
|
||||||
|
// Max entries in root dir (FAT16 only)
|
||||||
|
if (!is_fat32)
|
||||||
|
{
|
||||||
|
fs->root_entry_count = 512;
|
||||||
|
fs->currentsector.sector[17] = (fs->root_entry_count >> 0) & 0xFF;
|
||||||
|
fs->currentsector.sector[18] = (fs->root_entry_count >> 8) & 0xFF;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
fs->root_entry_count = 0;
|
||||||
|
fs->currentsector.sector[17] = 0;
|
||||||
|
fs->currentsector.sector[18] = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
// [FAT16] Total sectors (use FAT32 count instead)
|
||||||
|
fs->currentsector.sector[19] = 0x00;
|
||||||
|
fs->currentsector.sector[20] = 0x00;
|
||||||
|
|
||||||
|
// Media type
|
||||||
|
fs->currentsector.sector[21] = 0xF8;
|
||||||
|
|
||||||
|
|
||||||
|
// FAT16 BS Details
|
||||||
|
if (!is_fat32)
|
||||||
|
{
|
||||||
|
// Count of sectors used by the FAT table (FAT16 only)
|
||||||
|
total_clusters = (vol_sectors / fs->sectors_per_cluster) + 1;
|
||||||
|
fs->fat_sectors = (total_clusters/(FAT_SECTOR_SIZE/2)) + 1;
|
||||||
|
fs->currentsector.sector[22] = (uint8)((fs->fat_sectors >> 0) & 0xFF);
|
||||||
|
fs->currentsector.sector[23] = (uint8)((fs->fat_sectors >> 8) & 0xFF);
|
||||||
|
|
||||||
|
// Sectors per track
|
||||||
|
fs->currentsector.sector[24] = 0x00;
|
||||||
|
fs->currentsector.sector[25] = 0x00;
|
||||||
|
|
||||||
|
// Heads
|
||||||
|
fs->currentsector.sector[26] = 0x00;
|
||||||
|
fs->currentsector.sector[27] = 0x00;
|
||||||
|
|
||||||
|
// Hidden sectors
|
||||||
|
fs->currentsector.sector[28] = 0x20;
|
||||||
|
fs->currentsector.sector[29] = 0x00;
|
||||||
|
fs->currentsector.sector[30] = 0x00;
|
||||||
|
fs->currentsector.sector[31] = 0x00;
|
||||||
|
|
||||||
|
// Total sectors for this volume
|
||||||
|
fs->currentsector.sector[32] = (uint8)((vol_sectors>>0)&0xFF);
|
||||||
|
fs->currentsector.sector[33] = (uint8)((vol_sectors>>8)&0xFF);
|
||||||
|
fs->currentsector.sector[34] = (uint8)((vol_sectors>>16)&0xFF);
|
||||||
|
fs->currentsector.sector[35] = (uint8)((vol_sectors>>24)&0xFF);
|
||||||
|
|
||||||
|
// Drive number
|
||||||
|
fs->currentsector.sector[36] = 0x00;
|
||||||
|
|
||||||
|
// Reserved
|
||||||
|
fs->currentsector.sector[37] = 0x00;
|
||||||
|
|
||||||
|
// Boot signature
|
||||||
|
fs->currentsector.sector[38] = 0x29;
|
||||||
|
|
||||||
|
// Volume ID
|
||||||
|
fs->currentsector.sector[39] = 0x12;
|
||||||
|
fs->currentsector.sector[40] = 0x34;
|
||||||
|
fs->currentsector.sector[41] = 0x56;
|
||||||
|
fs->currentsector.sector[42] = 0x78;
|
||||||
|
|
||||||
|
// Volume name
|
||||||
|
for (i=0;i<11;i++)
|
||||||
|
{
|
||||||
|
if (i < (int)strlen(name))
|
||||||
|
fs->currentsector.sector[i+43] = name[i];
|
||||||
|
else
|
||||||
|
fs->currentsector.sector[i+43] = ' ';
|
||||||
|
}
|
||||||
|
|
||||||
|
// File sys type
|
||||||
|
fs->currentsector.sector[54] = 'F';
|
||||||
|
fs->currentsector.sector[55] = 'A';
|
||||||
|
fs->currentsector.sector[56] = 'T';
|
||||||
|
fs->currentsector.sector[57] = '1';
|
||||||
|
fs->currentsector.sector[58] = '6';
|
||||||
|
fs->currentsector.sector[59] = ' ';
|
||||||
|
fs->currentsector.sector[60] = ' ';
|
||||||
|
fs->currentsector.sector[61] = ' ';
|
||||||
|
|
||||||
|
// Signature
|
||||||
|
fs->currentsector.sector[510] = 0x55;
|
||||||
|
fs->currentsector.sector[511] = 0xAA;
|
||||||
|
}
|
||||||
|
// FAT32 BS Details
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Count of sectors used by the FAT table (FAT16 only)
|
||||||
|
fs->currentsector.sector[22] = 0;
|
||||||
|
fs->currentsector.sector[23] = 0;
|
||||||
|
|
||||||
|
// Sectors per track (default)
|
||||||
|
fs->currentsector.sector[24] = 0x3F;
|
||||||
|
fs->currentsector.sector[25] = 0x00;
|
||||||
|
|
||||||
|
// Heads (default)
|
||||||
|
fs->currentsector.sector[26] = 0xFF;
|
||||||
|
fs->currentsector.sector[27] = 0x00;
|
||||||
|
|
||||||
|
// Hidden sectors
|
||||||
|
fs->currentsector.sector[28] = 0x00;
|
||||||
|
fs->currentsector.sector[29] = 0x00;
|
||||||
|
fs->currentsector.sector[30] = 0x00;
|
||||||
|
fs->currentsector.sector[31] = 0x00;
|
||||||
|
|
||||||
|
// Total sectors for this volume
|
||||||
|
fs->currentsector.sector[32] = (uint8)((vol_sectors>>0)&0xFF);
|
||||||
|
fs->currentsector.sector[33] = (uint8)((vol_sectors>>8)&0xFF);
|
||||||
|
fs->currentsector.sector[34] = (uint8)((vol_sectors>>16)&0xFF);
|
||||||
|
fs->currentsector.sector[35] = (uint8)((vol_sectors>>24)&0xFF);
|
||||||
|
|
||||||
|
total_clusters = (vol_sectors / fs->sectors_per_cluster) + 1;
|
||||||
|
fs->fat_sectors = (total_clusters/(FAT_SECTOR_SIZE/4)) + 1;
|
||||||
|
|
||||||
|
// BPB_FATSz32
|
||||||
|
fs->currentsector.sector[36] = (uint8)((fs->fat_sectors>>0)&0xFF);
|
||||||
|
fs->currentsector.sector[37] = (uint8)((fs->fat_sectors>>8)&0xFF);
|
||||||
|
fs->currentsector.sector[38] = (uint8)((fs->fat_sectors>>16)&0xFF);
|
||||||
|
fs->currentsector.sector[39] = (uint8)((fs->fat_sectors>>24)&0xFF);
|
||||||
|
|
||||||
|
// BPB_ExtFlags
|
||||||
|
fs->currentsector.sector[40] = 0;
|
||||||
|
fs->currentsector.sector[41] = 0;
|
||||||
|
|
||||||
|
// BPB_FSVer
|
||||||
|
fs->currentsector.sector[42] = 0;
|
||||||
|
fs->currentsector.sector[43] = 0;
|
||||||
|
|
||||||
|
// BPB_RootClus
|
||||||
|
fs->currentsector.sector[44] = (uint8)((fs->rootdir_first_cluster>>0)&0xFF);
|
||||||
|
fs->currentsector.sector[45] = (uint8)((fs->rootdir_first_cluster>>8)&0xFF);
|
||||||
|
fs->currentsector.sector[46] = (uint8)((fs->rootdir_first_cluster>>16)&0xFF);
|
||||||
|
fs->currentsector.sector[47] = (uint8)((fs->rootdir_first_cluster>>24)&0xFF);
|
||||||
|
|
||||||
|
// BPB_FSInfo
|
||||||
|
fs->currentsector.sector[48] = (uint8)((fs->fs_info_sector>>0)&0xFF);
|
||||||
|
fs->currentsector.sector[49] = (uint8)((fs->fs_info_sector>>8)&0xFF);
|
||||||
|
|
||||||
|
// BPB_BkBootSec
|
||||||
|
fs->currentsector.sector[50] = 6;
|
||||||
|
fs->currentsector.sector[51] = 0;
|
||||||
|
|
||||||
|
// Drive number
|
||||||
|
fs->currentsector.sector[64] = 0x00;
|
||||||
|
|
||||||
|
// Boot signature
|
||||||
|
fs->currentsector.sector[66] = 0x29;
|
||||||
|
|
||||||
|
// Volume ID
|
||||||
|
fs->currentsector.sector[67] = 0x12;
|
||||||
|
fs->currentsector.sector[68] = 0x34;
|
||||||
|
fs->currentsector.sector[69] = 0x56;
|
||||||
|
fs->currentsector.sector[70] = 0x78;
|
||||||
|
|
||||||
|
// Volume name
|
||||||
|
for (i=0;i<11;i++)
|
||||||
|
{
|
||||||
|
if (i < (int)strlen(name))
|
||||||
|
fs->currentsector.sector[i+71] = name[i];
|
||||||
|
else
|
||||||
|
fs->currentsector.sector[i+71] = ' ';
|
||||||
|
}
|
||||||
|
|
||||||
|
// File sys type
|
||||||
|
fs->currentsector.sector[82] = 'F';
|
||||||
|
fs->currentsector.sector[83] = 'A';
|
||||||
|
fs->currentsector.sector[84] = 'T';
|
||||||
|
fs->currentsector.sector[85] = '3';
|
||||||
|
fs->currentsector.sector[86] = '2';
|
||||||
|
fs->currentsector.sector[87] = ' ';
|
||||||
|
fs->currentsector.sector[88] = ' ';
|
||||||
|
fs->currentsector.sector[89] = ' ';
|
||||||
|
|
||||||
|
// Signature
|
||||||
|
fs->currentsector.sector[510] = 0x55;
|
||||||
|
fs->currentsector.sector[511] = 0xAA;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (fs->disk_io.write_media(boot_sector_lba, fs->currentsector.sector, 1))
|
||||||
|
return 1;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_create_fsinfo_sector: Create the FSInfo sector (FAT32)
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static int fatfs_create_fsinfo_sector(struct fatfs *fs, uint32 sector_lba)
|
||||||
|
{
|
||||||
|
// Zero sector initially
|
||||||
|
memset(fs->currentsector.sector, 0, FAT_SECTOR_SIZE);
|
||||||
|
|
||||||
|
// FSI_LeadSig
|
||||||
|
fs->currentsector.sector[0] = 0x52;
|
||||||
|
fs->currentsector.sector[1] = 0x52;
|
||||||
|
fs->currentsector.sector[2] = 0x61;
|
||||||
|
fs->currentsector.sector[3] = 0x41;
|
||||||
|
|
||||||
|
// FSI_StrucSig
|
||||||
|
fs->currentsector.sector[484] = 0x72;
|
||||||
|
fs->currentsector.sector[485] = 0x72;
|
||||||
|
fs->currentsector.sector[486] = 0x41;
|
||||||
|
fs->currentsector.sector[487] = 0x61;
|
||||||
|
|
||||||
|
// FSI_Free_Count
|
||||||
|
fs->currentsector.sector[488] = 0xFF;
|
||||||
|
fs->currentsector.sector[489] = 0xFF;
|
||||||
|
fs->currentsector.sector[490] = 0xFF;
|
||||||
|
fs->currentsector.sector[491] = 0xFF;
|
||||||
|
|
||||||
|
// FSI_Nxt_Free
|
||||||
|
fs->currentsector.sector[492] = 0xFF;
|
||||||
|
fs->currentsector.sector[493] = 0xFF;
|
||||||
|
fs->currentsector.sector[494] = 0xFF;
|
||||||
|
fs->currentsector.sector[495] = 0xFF;
|
||||||
|
|
||||||
|
// Signature
|
||||||
|
fs->currentsector.sector[510] = 0x55;
|
||||||
|
fs->currentsector.sector[511] = 0xAA;
|
||||||
|
|
||||||
|
if (fs->disk_io.write_media(sector_lba, fs->currentsector.sector, 1))
|
||||||
|
return 1;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_erase_fat: Erase FAT table using fs details in fs struct
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static int fatfs_erase_fat(struct fatfs *fs, int is_fat32)
|
||||||
|
{
|
||||||
|
uint32 i;
|
||||||
|
|
||||||
|
// Zero sector initially
|
||||||
|
memset(fs->currentsector.sector, 0, FAT_SECTOR_SIZE);
|
||||||
|
|
||||||
|
// Initialise default allocate / reserved clusters
|
||||||
|
if (!is_fat32)
|
||||||
|
{
|
||||||
|
SET_16BIT_WORD(fs->currentsector.sector, 0, 0xFFF8);
|
||||||
|
SET_16BIT_WORD(fs->currentsector.sector, 2, 0xFFFF);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
SET_32BIT_WORD(fs->currentsector.sector, 0, 0x0FFFFFF8);
|
||||||
|
SET_32BIT_WORD(fs->currentsector.sector, 4, 0xFFFFFFFF);
|
||||||
|
SET_32BIT_WORD(fs->currentsector.sector, 8, 0x0FFFFFFF);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!fs->disk_io.write_media(fs->fat_begin_lba + 0, fs->currentsector.sector, 1))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Zero remaining FAT sectors
|
||||||
|
memset(fs->currentsector.sector, 0, FAT_SECTOR_SIZE);
|
||||||
|
for (i=1;i<fs->fat_sectors*fs->num_of_fats;i++)
|
||||||
|
if (!fs->disk_io.write_media(fs->fat_begin_lba + i, fs->currentsector.sector, 1))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_format_fat16: Format a FAT16 partition
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_format_fat16(struct fatfs *fs, uint32 volume_sectors, const char *name)
|
||||||
|
{
|
||||||
|
fs->currentsector.address = FAT32_INVALID_CLUSTER;
|
||||||
|
fs->currentsector.dirty = 0;
|
||||||
|
|
||||||
|
fs->next_free_cluster = 0; // Invalid
|
||||||
|
|
||||||
|
fatfs_fat_init(fs);
|
||||||
|
|
||||||
|
// Make sure we have read + write functions
|
||||||
|
if (!fs->disk_io.read_media || !fs->disk_io.write_media)
|
||||||
|
return FAT_INIT_MEDIA_ACCESS_ERROR;
|
||||||
|
|
||||||
|
// Volume is FAT16
|
||||||
|
fs->fat_type = FAT_TYPE_16;
|
||||||
|
|
||||||
|
// Not valid for FAT16
|
||||||
|
fs->fs_info_sector = 0;
|
||||||
|
fs->rootdir_first_cluster = 0;
|
||||||
|
|
||||||
|
// Sector 0: Boot sector
|
||||||
|
// NOTE: We don't need an MBR, it is a waste of a good sector!
|
||||||
|
fs->lba_begin = 0;
|
||||||
|
if (!fatfs_create_boot_sector(fs, fs->lba_begin, volume_sectors, name, 0))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// For FAT16 (which this may be), rootdir_first_cluster is actuall rootdir_first_sector
|
||||||
|
fs->rootdir_first_sector = fs->reserved_sectors + (fs->num_of_fats * fs->fat_sectors);
|
||||||
|
fs->rootdir_sectors = ((fs->root_entry_count * 32) + (FAT_SECTOR_SIZE - 1)) / FAT_SECTOR_SIZE;
|
||||||
|
|
||||||
|
// First FAT LBA address
|
||||||
|
fs->fat_begin_lba = fs->lba_begin + fs->reserved_sectors;
|
||||||
|
|
||||||
|
// The address of the first data cluster on this volume
|
||||||
|
fs->cluster_begin_lba = fs->fat_begin_lba + (fs->num_of_fats * fs->fat_sectors);
|
||||||
|
|
||||||
|
// Initialise FAT sectors
|
||||||
|
if (!fatfs_erase_fat(fs, 0))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Erase Root directory
|
||||||
|
if (!fatfs_erase_sectors(fs, fs->lba_begin + fs->rootdir_first_sector, fs->rootdir_sectors))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_format_fat32: Format a FAT32 partition
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_format_fat32(struct fatfs *fs, uint32 volume_sectors, const char *name)
|
||||||
|
{
|
||||||
|
fs->currentsector.address = FAT32_INVALID_CLUSTER;
|
||||||
|
fs->currentsector.dirty = 0;
|
||||||
|
|
||||||
|
fs->next_free_cluster = 0; // Invalid
|
||||||
|
|
||||||
|
fatfs_fat_init(fs);
|
||||||
|
|
||||||
|
// Make sure we have read + write functions
|
||||||
|
if (!fs->disk_io.read_media || !fs->disk_io.write_media)
|
||||||
|
return FAT_INIT_MEDIA_ACCESS_ERROR;
|
||||||
|
|
||||||
|
// Volume is FAT32
|
||||||
|
fs->fat_type = FAT_TYPE_32;
|
||||||
|
|
||||||
|
// Basic defaults for normal FAT32 partitions
|
||||||
|
fs->fs_info_sector = 1;
|
||||||
|
fs->rootdir_first_cluster = 2;
|
||||||
|
|
||||||
|
// Sector 0: Boot sector
|
||||||
|
// NOTE: We don't need an MBR, it is a waste of a good sector!
|
||||||
|
fs->lba_begin = 0;
|
||||||
|
if (!fatfs_create_boot_sector(fs, fs->lba_begin, volume_sectors, name, 1))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// First FAT LBA address
|
||||||
|
fs->fat_begin_lba = fs->lba_begin + fs->reserved_sectors;
|
||||||
|
|
||||||
|
// The address of the first data cluster on this volume
|
||||||
|
fs->cluster_begin_lba = fs->fat_begin_lba + (fs->num_of_fats * fs->fat_sectors);
|
||||||
|
|
||||||
|
// Initialise FSInfo sector
|
||||||
|
if (!fatfs_create_fsinfo_sector(fs, fs->fs_info_sector))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Initialise FAT sectors
|
||||||
|
if (!fatfs_erase_fat(fs, 1))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Erase Root directory
|
||||||
|
if (!fatfs_erase_sectors(fs, fatfs_lba_of_cluster(fs, fs->rootdir_first_cluster), fs->sectors_per_cluster))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_format: Format a partition with either FAT16 or FAT32 based on size
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_format(struct fatfs *fs, uint32 volume_sectors, const char *name)
|
||||||
|
{
|
||||||
|
// 2GB - 32K limit for safe behaviour for FAT16
|
||||||
|
if (volume_sectors <= 4194304)
|
||||||
|
return fatfs_format_fat16(fs, volume_sectors, name);
|
||||||
|
else
|
||||||
|
return fatfs_format_fat32(fs, volume_sectors, name);
|
||||||
|
}
|
||||||
|
#endif /*FATFS_INC_FORMAT_SUPPORT*/
|
||||||
|
|
@ -0,0 +1,15 @@
|
||||||
|
#ifndef __FAT_FORMAT_H__
|
||||||
|
#define __FAT_FORMAT_H__
|
||||||
|
|
||||||
|
#include "fat_defs.h"
|
||||||
|
#include "fat_opts.h"
|
||||||
|
#include "fat_access.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Prototypes
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_format(struct fatfs *fs, uint32 volume_sectors, const char *name);
|
||||||
|
int fatfs_format_fat16(struct fatfs *fs, uint32 volume_sectors, const char *name);
|
||||||
|
int fatfs_format_fat32(struct fatfs *fs, uint32 volume_sectors, const char *name);
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,161 @@
|
||||||
|
#ifndef __FAT_LIST_H__
|
||||||
|
#define __FAT_LIST_H__
|
||||||
|
|
||||||
|
#ifndef FAT_ASSERT
|
||||||
|
#define FAT_ASSERT(x)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef FAT_INLINE
|
||||||
|
#define FAT_INLINE
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// Types
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
struct fat_list;
|
||||||
|
|
||||||
|
struct fat_node
|
||||||
|
{
|
||||||
|
struct fat_node *previous;
|
||||||
|
struct fat_node *next;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct fat_list
|
||||||
|
{
|
||||||
|
struct fat_node *head;
|
||||||
|
struct fat_node *tail;
|
||||||
|
};
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// Macros
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
#define fat_list_entry(p, t, m) p ? ((t *)((char *)(p)-(char*)(&((t *)0)->m))) : 0
|
||||||
|
#define fat_list_next(l, p) (p)->next
|
||||||
|
#define fat_list_prev(l, p) (p)->previous
|
||||||
|
#define fat_list_first(l) (l)->head
|
||||||
|
#define fat_list_last(l) (l)->tail
|
||||||
|
#define fat_list_for_each(l, p) for ((p) = (l)->head; (p); (p) = (p)->next)
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// Inline Functions
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// fat_list_init:
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
static FAT_INLINE void fat_list_init(struct fat_list *list)
|
||||||
|
{
|
||||||
|
FAT_ASSERT(list);
|
||||||
|
|
||||||
|
list->head = list->tail = 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// fat_list_remove:
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
static FAT_INLINE void fat_list_remove(struct fat_list *list, struct fat_node *node)
|
||||||
|
{
|
||||||
|
FAT_ASSERT(list);
|
||||||
|
FAT_ASSERT(node);
|
||||||
|
|
||||||
|
if(!node->previous)
|
||||||
|
list->head = node->next;
|
||||||
|
else
|
||||||
|
node->previous->next = node->next;
|
||||||
|
|
||||||
|
if(!node->next)
|
||||||
|
list->tail = node->previous;
|
||||||
|
else
|
||||||
|
node->next->previous = node->previous;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// fat_list_insert_after:
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
static FAT_INLINE void fat_list_insert_after(struct fat_list *list, struct fat_node *node, struct fat_node *new_node)
|
||||||
|
{
|
||||||
|
FAT_ASSERT(list);
|
||||||
|
FAT_ASSERT(node);
|
||||||
|
FAT_ASSERT(new_node);
|
||||||
|
|
||||||
|
new_node->previous = node;
|
||||||
|
new_node->next = node->next;
|
||||||
|
if (!node->next)
|
||||||
|
list->tail = new_node;
|
||||||
|
else
|
||||||
|
node->next->previous = new_node;
|
||||||
|
node->next = new_node;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// fat_list_insert_before:
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
static FAT_INLINE void fat_list_insert_before(struct fat_list *list, struct fat_node *node, struct fat_node *new_node)
|
||||||
|
{
|
||||||
|
FAT_ASSERT(list);
|
||||||
|
FAT_ASSERT(node);
|
||||||
|
FAT_ASSERT(new_node);
|
||||||
|
|
||||||
|
new_node->previous = node->previous;
|
||||||
|
new_node->next = node;
|
||||||
|
if (!node->previous)
|
||||||
|
list->head = new_node;
|
||||||
|
else
|
||||||
|
node->previous->next = new_node;
|
||||||
|
node->previous = new_node;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// fat_list_insert_first:
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
static FAT_INLINE void fat_list_insert_first(struct fat_list *list, struct fat_node *node)
|
||||||
|
{
|
||||||
|
FAT_ASSERT(list);
|
||||||
|
FAT_ASSERT(node);
|
||||||
|
|
||||||
|
if (!list->head)
|
||||||
|
{
|
||||||
|
list->head = node;
|
||||||
|
list->tail = node;
|
||||||
|
node->previous = 0;
|
||||||
|
node->next = 0;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
fat_list_insert_before(list, list->head, node);
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// fat_list_insert_last:
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
static FAT_INLINE void fat_list_insert_last(struct fat_list *list, struct fat_node *node)
|
||||||
|
{
|
||||||
|
FAT_ASSERT(list);
|
||||||
|
FAT_ASSERT(node);
|
||||||
|
|
||||||
|
if (!list->tail)
|
||||||
|
fat_list_insert_first(list, node);
|
||||||
|
else
|
||||||
|
fat_list_insert_after(list, list->tail, node);
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// fat_list_is_empty:
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
static FAT_INLINE int fat_list_is_empty(struct fat_list *list)
|
||||||
|
{
|
||||||
|
FAT_ASSERT(list);
|
||||||
|
|
||||||
|
return !list->head;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
// fat_list_pop_head:
|
||||||
|
//-----------------------------------------------------------------
|
||||||
|
static FAT_INLINE struct fat_node * fat_list_pop_head(struct fat_list *list)
|
||||||
|
{
|
||||||
|
struct fat_node * node;
|
||||||
|
|
||||||
|
FAT_ASSERT(list);
|
||||||
|
|
||||||
|
node = fat_list_first(list);
|
||||||
|
if (node)
|
||||||
|
fat_list_remove(list, node);
|
||||||
|
|
||||||
|
return node;
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
||||||
|
|
@ -0,0 +1,505 @@
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT16/32 File IO Library
|
||||||
|
// V2.6
|
||||||
|
// Ultra-Embedded.com
|
||||||
|
// Copyright 2003 - 2012
|
||||||
|
//
|
||||||
|
// Email: admin@ultra-embedded.com
|
||||||
|
//
|
||||||
|
// License: GPL
|
||||||
|
// If you would like a version with a more permissive license for use in
|
||||||
|
// closed source commercial applications please contact me for details.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//
|
||||||
|
// This file is part of FAT File IO Library.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 2 of the License, or
|
||||||
|
// (at your option) any later version.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 FAT File IO Library; if not, write to the Free Software
|
||||||
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include "fat_misc.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_lfn_cache_init: Clear long file name cache
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
void fatfs_lfn_cache_init(struct lfn_cache *lfn, int wipeTable)
|
||||||
|
{
|
||||||
|
int i = 0;
|
||||||
|
|
||||||
|
lfn->no_of_strings = 0;
|
||||||
|
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
|
||||||
|
// Zero out buffer also
|
||||||
|
if (wipeTable)
|
||||||
|
for (i=0;i<MAX_LONGFILENAME_ENTRIES;i++)
|
||||||
|
memset(lfn->String[i], 0x00, MAX_LFN_ENTRY_LENGTH);
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_lfn_cache_entry - Function extracts long file name text from sector
|
||||||
|
// at a specific offset
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
void fatfs_lfn_cache_entry(struct lfn_cache *lfn, uint8 *entryBuffer)
|
||||||
|
{
|
||||||
|
uint8 LFNIndex, i;
|
||||||
|
LFNIndex = entryBuffer[0] & 0x1F;
|
||||||
|
|
||||||
|
// Limit file name to cache size!
|
||||||
|
if (LFNIndex > MAX_LONGFILENAME_ENTRIES)
|
||||||
|
return ;
|
||||||
|
|
||||||
|
// This is an error condition
|
||||||
|
if (LFNIndex == 0)
|
||||||
|
return ;
|
||||||
|
|
||||||
|
if (lfn->no_of_strings == 0)
|
||||||
|
lfn->no_of_strings = LFNIndex;
|
||||||
|
|
||||||
|
lfn->String[LFNIndex-1][0] = entryBuffer[1];
|
||||||
|
lfn->String[LFNIndex-1][1] = entryBuffer[3];
|
||||||
|
lfn->String[LFNIndex-1][2] = entryBuffer[5];
|
||||||
|
lfn->String[LFNIndex-1][3] = entryBuffer[7];
|
||||||
|
lfn->String[LFNIndex-1][4] = entryBuffer[9];
|
||||||
|
lfn->String[LFNIndex-1][5] = entryBuffer[0x0E];
|
||||||
|
lfn->String[LFNIndex-1][6] = entryBuffer[0x10];
|
||||||
|
lfn->String[LFNIndex-1][7] = entryBuffer[0x12];
|
||||||
|
lfn->String[LFNIndex-1][8] = entryBuffer[0x14];
|
||||||
|
lfn->String[LFNIndex-1][9] = entryBuffer[0x16];
|
||||||
|
lfn->String[LFNIndex-1][10] = entryBuffer[0x18];
|
||||||
|
lfn->String[LFNIndex-1][11] = entryBuffer[0x1C];
|
||||||
|
lfn->String[LFNIndex-1][12] = entryBuffer[0x1E];
|
||||||
|
|
||||||
|
for (i=0; i<MAX_LFN_ENTRY_LENGTH; i++)
|
||||||
|
if (lfn->String[LFNIndex-1][i]==0xFF)
|
||||||
|
lfn->String[LFNIndex-1][i] = 0x20; // Replace with spaces
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_lfn_cache_get: Get a reference to the long filename
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
char* fatfs_lfn_cache_get(struct lfn_cache *lfn)
|
||||||
|
{
|
||||||
|
// Null terminate long filename
|
||||||
|
if (lfn->no_of_strings == MAX_LONGFILENAME_ENTRIES)
|
||||||
|
lfn->Null = '\0';
|
||||||
|
else if (lfn->no_of_strings)
|
||||||
|
lfn->String[lfn->no_of_strings][0] = '\0';
|
||||||
|
else
|
||||||
|
lfn->String[0][0] = '\0';
|
||||||
|
|
||||||
|
return (char*)&lfn->String[0][0];
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_entry_lfn_text: If LFN text entry found
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
int fatfs_entry_lfn_text(struct fat_dir_entry *entry)
|
||||||
|
{
|
||||||
|
if ((entry->Attr & FILE_ATTR_LFN_TEXT) == FILE_ATTR_LFN_TEXT)
|
||||||
|
return 1;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_entry_lfn_invalid: If SFN found not relating to LFN
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
int fatfs_entry_lfn_invalid(struct fat_dir_entry *entry)
|
||||||
|
{
|
||||||
|
if ( (entry->Name[0]==FILE_HEADER_BLANK) ||
|
||||||
|
(entry->Name[0]==FILE_HEADER_DELETED)||
|
||||||
|
(entry->Attr==FILE_ATTR_VOLUME_ID) ||
|
||||||
|
(entry->Attr & FILE_ATTR_SYSHID) )
|
||||||
|
return 1;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_entry_lfn_exists: If LFN exists and correlation SFN found
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
int fatfs_entry_lfn_exists(struct lfn_cache *lfn, struct fat_dir_entry *entry)
|
||||||
|
{
|
||||||
|
if ( (entry->Attr!=FILE_ATTR_LFN_TEXT) &&
|
||||||
|
(entry->Name[0]!=FILE_HEADER_BLANK) &&
|
||||||
|
(entry->Name[0]!=FILE_HEADER_DELETED) &&
|
||||||
|
(entry->Attr!=FILE_ATTR_VOLUME_ID) &&
|
||||||
|
(!(entry->Attr&FILE_ATTR_SYSHID)) &&
|
||||||
|
(lfn->no_of_strings) )
|
||||||
|
return 1;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_entry_sfn_only: If SFN only exists
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_entry_sfn_only(struct fat_dir_entry *entry)
|
||||||
|
{
|
||||||
|
if ( (entry->Attr!=FILE_ATTR_LFN_TEXT) &&
|
||||||
|
(entry->Name[0]!=FILE_HEADER_BLANK) &&
|
||||||
|
(entry->Name[0]!=FILE_HEADER_DELETED) &&
|
||||||
|
(entry->Attr!=FILE_ATTR_VOLUME_ID) &&
|
||||||
|
(!(entry->Attr&FILE_ATTR_SYSHID)) )
|
||||||
|
return 1;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
// TODO: FILE_ATTR_SYSHID ?!?!??!
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_entry_is_dir: Returns 1 if a directory
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_entry_is_dir(struct fat_dir_entry *entry)
|
||||||
|
{
|
||||||
|
if (entry->Attr & FILE_TYPE_DIR)
|
||||||
|
return 1;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_entry_is_file: Returns 1 is a file entry
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_entry_is_file(struct fat_dir_entry *entry)
|
||||||
|
{
|
||||||
|
if (entry->Attr & FILE_TYPE_FILE)
|
||||||
|
return 1;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_lfn_entries_required: Calculate number of 13 characters entries
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
int fatfs_lfn_entries_required(char *filename)
|
||||||
|
{
|
||||||
|
int length = (int)strlen(filename);
|
||||||
|
|
||||||
|
if (length)
|
||||||
|
return (length + MAX_LFN_ENTRY_LENGTH - 1) / MAX_LFN_ENTRY_LENGTH;
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_filename_to_lfn:
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
void fatfs_filename_to_lfn(char *filename, uint8 *buffer, int entry, uint8 sfnChk)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
int nameIndexes[MAX_LFN_ENTRY_LENGTH] = {1,3,5,7,9,0x0E,0x10,0x12,0x14,0x16,0x18,0x1C,0x1E};
|
||||||
|
|
||||||
|
// 13 characters entries
|
||||||
|
int length = (int)strlen(filename);
|
||||||
|
int entriesRequired = fatfs_lfn_entries_required(filename);
|
||||||
|
|
||||||
|
// Filename offset
|
||||||
|
int start = entry * MAX_LFN_ENTRY_LENGTH;
|
||||||
|
|
||||||
|
// Initialise to zeros
|
||||||
|
memset(buffer, 0x00, FAT_DIR_ENTRY_SIZE);
|
||||||
|
|
||||||
|
// LFN entry number
|
||||||
|
buffer[0] = (uint8)(((entriesRequired-1)==entry)?(0x40|(entry+1)):(entry+1));
|
||||||
|
|
||||||
|
// LFN flag
|
||||||
|
buffer[11] = 0x0F;
|
||||||
|
|
||||||
|
// Checksum of short filename
|
||||||
|
buffer[13] = sfnChk;
|
||||||
|
|
||||||
|
// Copy to buffer
|
||||||
|
for (i=0;i<MAX_LFN_ENTRY_LENGTH;i++)
|
||||||
|
{
|
||||||
|
if ( (start+i) < length )
|
||||||
|
buffer[nameIndexes[i]] = filename[start+i];
|
||||||
|
else if ( (start+i) == length )
|
||||||
|
buffer[nameIndexes[i]] = 0x00;
|
||||||
|
else
|
||||||
|
{
|
||||||
|
buffer[nameIndexes[i]] = 0xFF;
|
||||||
|
buffer[nameIndexes[i]+1] = 0xFF;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_sfn_create_entry: Create the short filename directory entry
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
void fatfs_sfn_create_entry(char *shortfilename, uint32 size, uint32 startCluster, struct fat_dir_entry *entry, int dir)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
|
||||||
|
// Copy short filename
|
||||||
|
for (i=0;i<FAT_SFN_SIZE_FULL;i++)
|
||||||
|
entry->Name[i] = shortfilename[i];
|
||||||
|
|
||||||
|
// Unless we have a RTC we might as well set these to 1980
|
||||||
|
entry->CrtTimeTenth = 0x00;
|
||||||
|
entry->CrtTime[1] = entry->CrtTime[0] = 0x00;
|
||||||
|
entry->CrtDate[1] = 0x00;
|
||||||
|
entry->CrtDate[0] = 0x20;
|
||||||
|
entry->LstAccDate[1] = 0x00;
|
||||||
|
entry->LstAccDate[0] = 0x20;
|
||||||
|
entry->WrtTime[1] = entry->WrtTime[0] = 0x00;
|
||||||
|
entry->WrtDate[1] = 0x00;
|
||||||
|
entry->WrtDate[0] = 0x20;
|
||||||
|
|
||||||
|
if (!dir)
|
||||||
|
entry->Attr = FILE_TYPE_FILE;
|
||||||
|
else
|
||||||
|
entry->Attr = FILE_TYPE_DIR;
|
||||||
|
|
||||||
|
entry->NTRes = 0x00;
|
||||||
|
|
||||||
|
entry->FstClusHI = FAT_HTONS((uint16)((startCluster>>16) & 0xFFFF));
|
||||||
|
entry->FstClusLO = FAT_HTONS((uint16)((startCluster>>0) & 0xFFFF));
|
||||||
|
entry->FileSize = FAT_HTONL(size);
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_lfn_create_sfn: Create a padded SFN
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
int fatfs_lfn_create_sfn(char *sfn_output, char *filename)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
int dotPos = -1;
|
||||||
|
char ext[3];
|
||||||
|
int pos;
|
||||||
|
int len = (int)strlen(filename);
|
||||||
|
|
||||||
|
// Invalid to start with .
|
||||||
|
if (filename[0]=='.')
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
memset(sfn_output, ' ', FAT_SFN_SIZE_FULL);
|
||||||
|
memset(ext, ' ', 3);
|
||||||
|
|
||||||
|
// Find dot seperator
|
||||||
|
for (i = 0; i< len; i++)
|
||||||
|
{
|
||||||
|
if (filename[i]=='.')
|
||||||
|
dotPos = i;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Extract extensions
|
||||||
|
if (dotPos!=-1)
|
||||||
|
{
|
||||||
|
// Copy first three chars of extension
|
||||||
|
for (i = (dotPos+1); i < (dotPos+1+3); i++)
|
||||||
|
if (i<len)
|
||||||
|
ext[i-(dotPos+1)] = filename[i];
|
||||||
|
|
||||||
|
// Shorten the length to the dot position
|
||||||
|
len = dotPos;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Add filename part
|
||||||
|
pos = 0;
|
||||||
|
for (i=0;i<len;i++)
|
||||||
|
{
|
||||||
|
if ( (filename[i]!=' ') && (filename[i]!='.') )
|
||||||
|
{
|
||||||
|
if (filename[i] >= 'a' && filename[i] <= 'z')
|
||||||
|
sfn_output[pos++] = filename[i] - 'a' + 'A';
|
||||||
|
else
|
||||||
|
sfn_output[pos++] = filename[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
// Fill upto 8 characters
|
||||||
|
if (pos==FAT_SFN_SIZE_PARTIAL)
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Add extension part
|
||||||
|
for (i=FAT_SFN_SIZE_PARTIAL;i<FAT_SFN_SIZE_FULL;i++)
|
||||||
|
{
|
||||||
|
if (ext[i-FAT_SFN_SIZE_PARTIAL] >= 'a' && ext[i-FAT_SFN_SIZE_PARTIAL] <= 'z')
|
||||||
|
sfn_output[i] = ext[i-FAT_SFN_SIZE_PARTIAL] - 'a' + 'A';
|
||||||
|
else
|
||||||
|
sfn_output[i] = ext[i-FAT_SFN_SIZE_PARTIAL];
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_itoa:
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static void fatfs_itoa(uint32 num, char *s)
|
||||||
|
{
|
||||||
|
char* cp;
|
||||||
|
char outbuf[12];
|
||||||
|
const char digits[] = "0123456789ABCDEF";
|
||||||
|
|
||||||
|
// Build string backwards
|
||||||
|
cp = outbuf;
|
||||||
|
do
|
||||||
|
{
|
||||||
|
*cp++ = digits[(int)(num % 10)];
|
||||||
|
}
|
||||||
|
while ((num /= 10) > 0);
|
||||||
|
|
||||||
|
*cp-- = 0;
|
||||||
|
|
||||||
|
// Copy in forwards
|
||||||
|
while (cp >= outbuf)
|
||||||
|
*s++ = *cp--;
|
||||||
|
|
||||||
|
*s = 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_lfn_generate_tail:
|
||||||
|
// sfn_input = Input short filename, spaced format & in upper case
|
||||||
|
// sfn_output = Output short filename with tail
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
int fatfs_lfn_generate_tail(char *sfn_output, char *sfn_input, uint32 tailNum)
|
||||||
|
{
|
||||||
|
int tail_chars;
|
||||||
|
char tail_str[12];
|
||||||
|
|
||||||
|
if (tailNum > 99999)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Convert to number
|
||||||
|
memset(tail_str, 0x00, sizeof(tail_str));
|
||||||
|
tail_str[0] = '~';
|
||||||
|
fatfs_itoa(tailNum, tail_str+1);
|
||||||
|
|
||||||
|
// Copy in base filename
|
||||||
|
memcpy(sfn_output, sfn_input, FAT_SFN_SIZE_FULL);
|
||||||
|
|
||||||
|
// Overwrite with tail
|
||||||
|
tail_chars = (int)strlen(tail_str);
|
||||||
|
memcpy(sfn_output+(FAT_SFN_SIZE_PARTIAL-tail_chars), tail_str, tail_chars);
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_convert_from_fat_time: Convert FAT time to h/m/s
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_TIME_DATE_SUPPORT
|
||||||
|
void fatfs_convert_from_fat_time(uint16 fat_time, int *hours, int *minutes, int *seconds)
|
||||||
|
{
|
||||||
|
*hours = (fat_time >> FAT_TIME_HOURS_SHIFT) & FAT_TIME_HOURS_MASK;
|
||||||
|
*minutes = (fat_time >> FAT_TIME_MINUTES_SHIFT) & FAT_TIME_MINUTES_MASK;
|
||||||
|
*seconds = (fat_time >> FAT_TIME_SECONDS_SHIFT) & FAT_TIME_SECONDS_MASK;
|
||||||
|
*seconds = *seconds * FAT_TIME_SECONDS_SCALE;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_convert_from_fat_date: Convert FAT date to d/m/y
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
void fatfs_convert_from_fat_date(uint16 fat_date, int *day, int *month, int *year)
|
||||||
|
{
|
||||||
|
*day = (fat_date >> FAT_DATE_DAY_SHIFT) & FAT_DATE_DAY_MASK;
|
||||||
|
*month = (fat_date >> FAT_DATE_MONTH_SHIFT) & FAT_DATE_MONTH_MASK;
|
||||||
|
*year = (fat_date >> FAT_DATE_YEAR_SHIFT) & FAT_DATE_YEAR_MASK;
|
||||||
|
*year = *year + FAT_DATE_YEAR_OFFSET;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_convert_to_fat_time: Convert h/m/s to FAT time
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
uint16 fatfs_convert_to_fat_time(int hours, int minutes, int seconds)
|
||||||
|
{
|
||||||
|
uint16 fat_time = 0;
|
||||||
|
|
||||||
|
// Most FAT times are to a resolution of 2 seconds
|
||||||
|
seconds /= FAT_TIME_SECONDS_SCALE;
|
||||||
|
|
||||||
|
fat_time = (hours & FAT_TIME_HOURS_MASK) << FAT_TIME_HOURS_SHIFT;
|
||||||
|
fat_time|= (minutes & FAT_TIME_MINUTES_MASK) << FAT_TIME_MINUTES_SHIFT;
|
||||||
|
fat_time|= (seconds & FAT_TIME_SECONDS_MASK) << FAT_TIME_SECONDS_SHIFT;
|
||||||
|
|
||||||
|
return fat_time;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_convert_to_fat_date: Convert d/m/y to FAT date
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
uint16 fatfs_convert_to_fat_date(int day, int month, int year)
|
||||||
|
{
|
||||||
|
uint16 fat_date = 0;
|
||||||
|
|
||||||
|
// FAT dates are relative to 1980
|
||||||
|
if (year >= FAT_DATE_YEAR_OFFSET)
|
||||||
|
year -= FAT_DATE_YEAR_OFFSET;
|
||||||
|
|
||||||
|
fat_date = (day & FAT_DATE_DAY_MASK) << FAT_DATE_DAY_SHIFT;
|
||||||
|
fat_date|= (month & FAT_DATE_MONTH_MASK) << FAT_DATE_MONTH_SHIFT;
|
||||||
|
fat_date|= (year & FAT_DATE_YEAR_MASK) << FAT_DATE_YEAR_SHIFT;
|
||||||
|
|
||||||
|
return fat_date;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_print_sector:
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#ifdef FATFS_DEBUG
|
||||||
|
void fatfs_print_sector(uint32 sector, uint8 *data)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
int j;
|
||||||
|
|
||||||
|
FAT_PRINTF(("Sector %d:\n", sector));
|
||||||
|
|
||||||
|
for (i=0;i<FAT_SECTOR_SIZE;i++)
|
||||||
|
{
|
||||||
|
if (!((i) % 16))
|
||||||
|
{
|
||||||
|
FAT_PRINTF((" %04d: ", i));
|
||||||
|
}
|
||||||
|
|
||||||
|
FAT_PRINTF(("%02x", data[i]));
|
||||||
|
if (!((i+1) % 4))
|
||||||
|
{
|
||||||
|
FAT_PRINTF((" "));
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!((i+1) % 16))
|
||||||
|
{
|
||||||
|
FAT_PRINTF((" "));
|
||||||
|
for (j=0;j<16;j++)
|
||||||
|
{
|
||||||
|
char ch = data[i-15+j];
|
||||||
|
|
||||||
|
// Is printable?
|
||||||
|
if (ch > 31 && ch < 127)
|
||||||
|
{
|
||||||
|
FAT_PRINTF(("%c", ch));
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
FAT_PRINTF(("."));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
FAT_PRINTF(("\n"));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,63 @@
|
||||||
|
#ifndef __FAT_MISC_H__
|
||||||
|
#define __FAT_MISC_H__
|
||||||
|
|
||||||
|
#include "fat_defs.h"
|
||||||
|
#include "fat_opts.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Defines
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#define MAX_LONGFILENAME_ENTRIES 20
|
||||||
|
#define MAX_LFN_ENTRY_LENGTH 13
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Macros
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#define GET_32BIT_WORD(buffer, location) ( ((uint32)buffer[location+3]<<24) + ((uint32)buffer[location+2]<<16) + ((uint32)buffer[location+1]<<8) + (uint32)buffer[location+0] )
|
||||||
|
#define GET_16BIT_WORD(buffer, location) ( ((uint16)buffer[location+1]<<8) + (uint16)buffer[location+0] )
|
||||||
|
|
||||||
|
#define SET_32BIT_WORD(buffer, location, value) { buffer[location+0] = (uint8)((value)&0xFF); \
|
||||||
|
buffer[location+1] = (uint8)((value>>8)&0xFF); \
|
||||||
|
buffer[location+2] = (uint8)((value>>16)&0xFF); \
|
||||||
|
buffer[location+3] = (uint8)((value>>24)&0xFF); }
|
||||||
|
|
||||||
|
#define SET_16BIT_WORD(buffer, location, value) { buffer[location+0] = (uint8)((value)&0xFF); \
|
||||||
|
buffer[location+1] = (uint8)((value>>8)&0xFF); }
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Structures
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
struct lfn_cache
|
||||||
|
{
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
// Long File Name Structure (max 260 LFN length)
|
||||||
|
uint8 String[MAX_LONGFILENAME_ENTRIES][MAX_LFN_ENTRY_LENGTH];
|
||||||
|
uint8 Null;
|
||||||
|
#endif
|
||||||
|
uint8 no_of_strings;
|
||||||
|
};
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Prototypes
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
void fatfs_lfn_cache_init(struct lfn_cache *lfn, int wipeTable);
|
||||||
|
void fatfs_lfn_cache_entry(struct lfn_cache *lfn, uint8 *entryBuffer);
|
||||||
|
char* fatfs_lfn_cache_get(struct lfn_cache *lfn);
|
||||||
|
int fatfs_entry_lfn_text(struct fat_dir_entry *entry);
|
||||||
|
int fatfs_entry_lfn_invalid(struct fat_dir_entry *entry);
|
||||||
|
int fatfs_entry_lfn_exists(struct lfn_cache *lfn, struct fat_dir_entry *entry);
|
||||||
|
int fatfs_entry_sfn_only(struct fat_dir_entry *entry);
|
||||||
|
int fatfs_entry_is_dir(struct fat_dir_entry *entry);
|
||||||
|
int fatfs_entry_is_file(struct fat_dir_entry *entry);
|
||||||
|
int fatfs_lfn_entries_required(char *filename);
|
||||||
|
void fatfs_filename_to_lfn(char *filename, uint8 *buffer, int entry, uint8 sfnChk);
|
||||||
|
void fatfs_sfn_create_entry(char *shortfilename, uint32 size, uint32 startCluster, struct fat_dir_entry *entry, int dir);
|
||||||
|
int fatfs_lfn_create_sfn(char *sfn_output, char *filename);
|
||||||
|
int fatfs_lfn_generate_tail(char *sfn_output, char *sfn_input, uint32 tailNum);
|
||||||
|
void fatfs_convert_from_fat_time(uint16 fat_time, int *hours, int *minutes, int *seconds);
|
||||||
|
void fatfs_convert_from_fat_date(uint16 fat_date, int *day, int *month, int *year);
|
||||||
|
uint16 fatfs_convert_to_fat_time(int hours, int minutes, int seconds);
|
||||||
|
uint16 fatfs_convert_to_fat_date(int day, int month, int year);
|
||||||
|
void fatfs_print_sector(uint32 sector, uint8 *data);
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,83 @@
|
||||||
|
#ifndef __FAT_OPTS_H__
|
||||||
|
#define __FAT_OPTS_H__
|
||||||
|
|
||||||
|
#ifdef FATFS_USE_CUSTOM_OPTS_FILE
|
||||||
|
#include "fat_custom.h"
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
// Configuration
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
|
||||||
|
// Is the processor little endian (1) or big endian (0)
|
||||||
|
#ifndef FATFS_IS_LITTLE_ENDIAN
|
||||||
|
#define FATFS_IS_LITTLE_ENDIAN 1
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Max filename Length
|
||||||
|
#ifndef FATFS_MAX_LONG_FILENAME
|
||||||
|
#define FATFS_MAX_LONG_FILENAME 260
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Max open files (reduce to lower memory requirements)
|
||||||
|
#ifndef FATFS_MAX_OPEN_FILES
|
||||||
|
#define FATFS_MAX_OPEN_FILES 2
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Number of sectors per FAT_BUFFER (min 1)
|
||||||
|
#ifndef FAT_BUFFER_SECTORS
|
||||||
|
#define FAT_BUFFER_SECTORS 1
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Max FAT sectors to buffer (min 1)
|
||||||
|
// (mem used is FAT_BUFFERS * FAT_BUFFER_SECTORS * FAT_SECTOR_SIZE)
|
||||||
|
#ifndef FAT_BUFFERS
|
||||||
|
#define FAT_BUFFERS 1
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Size of cluster chain cache (can be undefined)
|
||||||
|
// Mem used = FAT_CLUSTER_CACHE_ENTRIES * 4 * 2
|
||||||
|
// Improves access speed considerably
|
||||||
|
//#define FAT_CLUSTER_CACHE_ENTRIES 128
|
||||||
|
|
||||||
|
// Include support for writing files (1 / 0)?
|
||||||
|
#ifndef FATFS_INC_WRITE_SUPPORT
|
||||||
|
#define FATFS_INC_WRITE_SUPPORT 1
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Support long filenames (1 / 0)?
|
||||||
|
// (if not (0) only 8.3 format is supported)
|
||||||
|
#ifndef FATFS_INC_LFN_SUPPORT
|
||||||
|
#define FATFS_INC_LFN_SUPPORT 1
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Support directory listing (1 / 0)?
|
||||||
|
#ifndef FATFS_DIR_LIST_SUPPORT
|
||||||
|
#define FATFS_DIR_LIST_SUPPORT 1
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Support time/date (1 / 0)?
|
||||||
|
#ifndef FATFS_INC_TIME_DATE_SUPPORT
|
||||||
|
#define FATFS_INC_TIME_DATE_SUPPORT 0
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Include support for formatting disks (1 / 0)?
|
||||||
|
#ifndef FATFS_INC_FORMAT_SUPPORT
|
||||||
|
#define FATFS_INC_FORMAT_SUPPORT 0
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Sector size used
|
||||||
|
#define FAT_SECTOR_SIZE 512
|
||||||
|
|
||||||
|
// Printf output (directory listing / debug)
|
||||||
|
#ifndef FAT_PRINTF
|
||||||
|
void ventoy_syslog_printf(const char *Fmt, ...);
|
||||||
|
#define FAT_PRINTF(a) ventoy_syslog_printf a
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Time/Date support requires time.h
|
||||||
|
#if FATFS_INC_TIME_DATE_SUPPORT
|
||||||
|
#include <time.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,514 @@
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT16/32 File IO Library
|
||||||
|
// V2.6
|
||||||
|
// Ultra-Embedded.com
|
||||||
|
// Copyright 2003 - 2012
|
||||||
|
//
|
||||||
|
// Email: admin@ultra-embedded.com
|
||||||
|
//
|
||||||
|
// License: GPL
|
||||||
|
// If you would like a version with a more permissive license for use in
|
||||||
|
// closed source commercial applications please contact me for details.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//
|
||||||
|
// This file is part of FAT File IO Library.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 2 of the License, or
|
||||||
|
// (at your option) any later version.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 FAT File IO Library; if not, write to the Free Software
|
||||||
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#include <string.h>
|
||||||
|
#include <assert.h>
|
||||||
|
#include "fat_string.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_total_path_levels: Take a filename and path and count the sub levels
|
||||||
|
// of folders. E.g. C:\folder\file.zip = 1 level
|
||||||
|
// Acceptable input formats are:
|
||||||
|
// c:\folder\file.zip
|
||||||
|
// /dev/etc/samba.conf
|
||||||
|
// Returns: -1 = Error, 0 or more = Ok
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_total_path_levels(char *path)
|
||||||
|
{
|
||||||
|
int levels = 0;
|
||||||
|
char expectedchar;
|
||||||
|
|
||||||
|
if (!path)
|
||||||
|
return -1;
|
||||||
|
|
||||||
|
// Acceptable formats:
|
||||||
|
// c:\folder\file.zip
|
||||||
|
// /dev/etc/samba.conf
|
||||||
|
if (*path == '/')
|
||||||
|
{
|
||||||
|
expectedchar = '/';
|
||||||
|
path++;
|
||||||
|
}
|
||||||
|
else if (path[1] == ':' || path[2] == '\\')
|
||||||
|
{
|
||||||
|
expectedchar = '\\';
|
||||||
|
path += 3;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
return -1;
|
||||||
|
|
||||||
|
// Count levels in path string
|
||||||
|
while (*path)
|
||||||
|
{
|
||||||
|
// Fast forward through actual subdir text to next slash
|
||||||
|
for (; *path; )
|
||||||
|
{
|
||||||
|
// If slash detected escape from for loop
|
||||||
|
if (*path == expectedchar) { path++; break; }
|
||||||
|
path++;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Increase number of subdirs founds
|
||||||
|
levels++;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Subtract the file itself
|
||||||
|
return levels-1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_get_substring: Get a substring from 'path' which contains the folder
|
||||||
|
// (or file) at the specified level.
|
||||||
|
// E.g. C:\folder\file.zip : Level 0 = C:\folder, Level 1 = file.zip
|
||||||
|
// Returns: -1 = Error, 0 = Ok
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_get_substring(char *path, int levelreq, char *output, int max_len)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
int pathlen=0;
|
||||||
|
int levels=0;
|
||||||
|
int copypnt=0;
|
||||||
|
char expectedchar;
|
||||||
|
|
||||||
|
if (!path || max_len <= 0)
|
||||||
|
return -1;
|
||||||
|
|
||||||
|
// Acceptable formats:
|
||||||
|
// c:\folder\file.zip
|
||||||
|
// /dev/etc/samba.conf
|
||||||
|
if (*path == '/')
|
||||||
|
{
|
||||||
|
expectedchar = '/';
|
||||||
|
path++;
|
||||||
|
}
|
||||||
|
else if (path[1] == ':' || path[2] == '\\')
|
||||||
|
{
|
||||||
|
expectedchar = '\\';
|
||||||
|
path += 3;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
return -1;
|
||||||
|
|
||||||
|
// Get string length of path
|
||||||
|
pathlen = (int)strlen (path);
|
||||||
|
|
||||||
|
// Loop through the number of times as characters in 'path'
|
||||||
|
for (i = 0; i<pathlen; i++)
|
||||||
|
{
|
||||||
|
// If a '\' is found then increase level
|
||||||
|
if (*path == expectedchar) levels++;
|
||||||
|
|
||||||
|
// If correct level and the character is not a '\' or '/' then copy text to 'output'
|
||||||
|
if ( (levels == levelreq) && (*path != expectedchar) && (copypnt < (max_len-1)))
|
||||||
|
output[copypnt++] = *path;
|
||||||
|
|
||||||
|
// Increment through path string
|
||||||
|
path++;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Null Terminate
|
||||||
|
output[copypnt] = '\0';
|
||||||
|
|
||||||
|
// If a string was copied return 0 else return 1
|
||||||
|
if (output[0] != '\0')
|
||||||
|
return 0; // OK
|
||||||
|
else
|
||||||
|
return -1; // Error
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_split_path: Full path contains the passed in string.
|
||||||
|
// Returned is the path string and file Name string
|
||||||
|
// E.g. C:\folder\file.zip -> path = C:\folder filename = file.zip
|
||||||
|
// E.g. C:\file.zip -> path = [blank] filename = file.zip
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_split_path(char *full_path, char *path, int max_path, char *filename, int max_filename)
|
||||||
|
{
|
||||||
|
int strindex;
|
||||||
|
|
||||||
|
// Count the levels to the filepath
|
||||||
|
int levels = fatfs_total_path_levels(full_path);
|
||||||
|
if (levels == -1)
|
||||||
|
return -1;
|
||||||
|
|
||||||
|
// Get filename part of string
|
||||||
|
if (fatfs_get_substring(full_path, levels, filename, max_filename) != 0)
|
||||||
|
return -1;
|
||||||
|
|
||||||
|
// If root file
|
||||||
|
if (levels == 0)
|
||||||
|
path[0] = '\0';
|
||||||
|
else
|
||||||
|
{
|
||||||
|
strindex = (int)strlen(full_path) - (int)strlen(filename);
|
||||||
|
if (strindex > max_path)
|
||||||
|
strindex = max_path;
|
||||||
|
|
||||||
|
memcpy(path, full_path, strindex);
|
||||||
|
path[strindex-1] = '\0';
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FileString_StrCmpNoCase: Compare two strings case with case sensitivity
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static int FileString_StrCmpNoCase(char *s1, char *s2, int n)
|
||||||
|
{
|
||||||
|
int diff;
|
||||||
|
char a,b;
|
||||||
|
|
||||||
|
while (n--)
|
||||||
|
{
|
||||||
|
a = *s1;
|
||||||
|
b = *s2;
|
||||||
|
|
||||||
|
// Make lower case if uppercase
|
||||||
|
if ((a>='A') && (a<='Z'))
|
||||||
|
a+= 32;
|
||||||
|
if ((b>='A') && (b<='Z'))
|
||||||
|
b+= 32;
|
||||||
|
|
||||||
|
diff = a - b;
|
||||||
|
|
||||||
|
// If different
|
||||||
|
if (diff)
|
||||||
|
return diff;
|
||||||
|
|
||||||
|
// If run out of strings
|
||||||
|
if ( (*s1 == 0) || (*s2 == 0) )
|
||||||
|
break;
|
||||||
|
|
||||||
|
s1++;
|
||||||
|
s2++;
|
||||||
|
}
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FileString_GetExtension: Get index to extension within filename
|
||||||
|
// Returns -1 if not found or index otherwise
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static int FileString_GetExtension(char *str)
|
||||||
|
{
|
||||||
|
int dotPos = -1;
|
||||||
|
char *strSrc = str;
|
||||||
|
|
||||||
|
// Find last '.' in string (if at all)
|
||||||
|
while (*strSrc)
|
||||||
|
{
|
||||||
|
if (*strSrc=='.')
|
||||||
|
dotPos = (int)(strSrc-str);
|
||||||
|
|
||||||
|
strSrc++;
|
||||||
|
}
|
||||||
|
|
||||||
|
return dotPos;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FileString_TrimLength: Get length of string excluding trailing spaces
|
||||||
|
// Returns -1 if not found or index otherwise
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static int FileString_TrimLength(char *str, int strLen)
|
||||||
|
{
|
||||||
|
int length = strLen;
|
||||||
|
char *strSrc = str+strLen-1;
|
||||||
|
|
||||||
|
// Find last non white space
|
||||||
|
while (strLen != 0)
|
||||||
|
{
|
||||||
|
if (*strSrc == ' ')
|
||||||
|
length = (int)(strSrc - str);
|
||||||
|
else
|
||||||
|
break;
|
||||||
|
|
||||||
|
strSrc--;
|
||||||
|
strLen--;
|
||||||
|
}
|
||||||
|
|
||||||
|
return length;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_compare_names: Compare two filenames (without copying or changing origonals)
|
||||||
|
// Returns 1 if match, 0 if not
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_compare_names(char* strA, char* strB)
|
||||||
|
{
|
||||||
|
char *ext1 = NULL;
|
||||||
|
char *ext2 = NULL;
|
||||||
|
int ext1Pos, ext2Pos;
|
||||||
|
int file1Len, file2Len;
|
||||||
|
|
||||||
|
// Get both files extension
|
||||||
|
ext1Pos = FileString_GetExtension(strA);
|
||||||
|
ext2Pos = FileString_GetExtension(strB);
|
||||||
|
|
||||||
|
// NOTE: Extension position can be different for matching
|
||||||
|
// filename if trailing space are present before it!
|
||||||
|
// Check that if one has an extension, so does the other
|
||||||
|
if ((ext1Pos==-1) && (ext2Pos!=-1))
|
||||||
|
return 0;
|
||||||
|
if ((ext2Pos==-1) && (ext1Pos!=-1))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// If they both have extensions, compare them
|
||||||
|
if (ext1Pos!=-1)
|
||||||
|
{
|
||||||
|
// Set pointer to start of extension
|
||||||
|
ext1 = strA+ext1Pos+1;
|
||||||
|
ext2 = strB+ext2Pos+1;
|
||||||
|
|
||||||
|
// Verify that the file extension lengths match!
|
||||||
|
if (strlen(ext1) != strlen(ext2))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// If they dont match
|
||||||
|
if (FileString_StrCmpNoCase(ext1, ext2, (int)strlen(ext1))!=0)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Filelength is upto extensions
|
||||||
|
file1Len = ext1Pos;
|
||||||
|
file2Len = ext2Pos;
|
||||||
|
}
|
||||||
|
// No extensions
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Filelength is actual filelength
|
||||||
|
file1Len = (int)strlen(strA);
|
||||||
|
file2Len = (int)strlen(strB);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Find length without trailing spaces (before ext)
|
||||||
|
file1Len = FileString_TrimLength(strA, file1Len);
|
||||||
|
file2Len = FileString_TrimLength(strB, file2Len);
|
||||||
|
|
||||||
|
// Check the file lengths match
|
||||||
|
if (file1Len!=file2Len)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Compare main part of filenames
|
||||||
|
if (FileString_StrCmpNoCase(strA, strB, file1Len)!=0)
|
||||||
|
return 0;
|
||||||
|
else
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_string_ends_with_slash: Does the string end with a slash (\ or /)
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_string_ends_with_slash(char *path)
|
||||||
|
{
|
||||||
|
if (path)
|
||||||
|
{
|
||||||
|
while (*path)
|
||||||
|
{
|
||||||
|
// Last character?
|
||||||
|
if (!(*(path+1)))
|
||||||
|
{
|
||||||
|
if (*path == '\\' || *path == '/')
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
path++;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_get_sfn_display_name: Get display name for SFN entry
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_get_sfn_display_name(char* out, char* in)
|
||||||
|
{
|
||||||
|
int len = 0;
|
||||||
|
while (*in && len <= 11)
|
||||||
|
{
|
||||||
|
char a = *in++;
|
||||||
|
|
||||||
|
if (a == ' ')
|
||||||
|
continue;
|
||||||
|
// Make lower case if uppercase
|
||||||
|
else if ((a>='A') && (a<='Z'))
|
||||||
|
a+= 32;
|
||||||
|
|
||||||
|
*out++ = a;
|
||||||
|
len++;
|
||||||
|
}
|
||||||
|
|
||||||
|
*out = '\0';
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_get_extension: Get extension of filename passed in 'filename'.
|
||||||
|
// Returned extension is always lower case.
|
||||||
|
// Returns: 1 if ok, 0 if not.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_get_extension(char* filename, char* out, int maxlen)
|
||||||
|
{
|
||||||
|
int len = 0;
|
||||||
|
|
||||||
|
// Get files extension offset
|
||||||
|
int ext_pos = FileString_GetExtension(filename);
|
||||||
|
|
||||||
|
if (ext_pos > 0 && out && maxlen)
|
||||||
|
{
|
||||||
|
filename += ext_pos + 1;
|
||||||
|
|
||||||
|
while (*filename && len < (maxlen-1))
|
||||||
|
{
|
||||||
|
char a = *filename++;
|
||||||
|
|
||||||
|
// Make lowercase if uppercase
|
||||||
|
if ((a>='A') && (a<='Z'))
|
||||||
|
a+= 32;
|
||||||
|
|
||||||
|
*out++ = a;
|
||||||
|
len++;
|
||||||
|
}
|
||||||
|
|
||||||
|
*out = '\0';
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_create_path_string: Append path & filename to create file path string.
|
||||||
|
// Returns: 1 if ok, 0 if not.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_create_path_string(char* path, char *filename, char* out, int maxlen)
|
||||||
|
{
|
||||||
|
int len = 0;
|
||||||
|
char last = 0;
|
||||||
|
char seperator = '/';
|
||||||
|
|
||||||
|
if (path && filename && out && maxlen > 0)
|
||||||
|
{
|
||||||
|
while (*path && len < (maxlen-2))
|
||||||
|
{
|
||||||
|
last = *path++;
|
||||||
|
if (last == '\\')
|
||||||
|
seperator = '\\';
|
||||||
|
*out++ = last;
|
||||||
|
len++;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Add a seperator if trailing one not found
|
||||||
|
if (last != '\\' && last != '/')
|
||||||
|
*out++ = seperator;
|
||||||
|
|
||||||
|
while (*filename && len < (maxlen-1))
|
||||||
|
{
|
||||||
|
*out++ = *filename++;
|
||||||
|
len++;
|
||||||
|
}
|
||||||
|
|
||||||
|
*out = '\0';
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Test Bench
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#ifdef FAT_STRING_TESTBENCH
|
||||||
|
void main(void)
|
||||||
|
{
|
||||||
|
char output[255];
|
||||||
|
char output2[255];
|
||||||
|
|
||||||
|
assert(fatfs_total_path_levels("C:\\folder\\file.zip") == 1);
|
||||||
|
assert(fatfs_total_path_levels("C:\\file.zip") == 0);
|
||||||
|
assert(fatfs_total_path_levels("C:\\folder\\folder2\\file.zip") == 2);
|
||||||
|
assert(fatfs_total_path_levels("C:\\") == -1);
|
||||||
|
assert(fatfs_total_path_levels("") == -1);
|
||||||
|
assert(fatfs_total_path_levels("/dev/etc/file.zip") == 2);
|
||||||
|
assert(fatfs_total_path_levels("/dev/file.zip") == 1);
|
||||||
|
|
||||||
|
assert(fatfs_get_substring("C:\\folder\\file.zip", 0, output, sizeof(output)) == 0);
|
||||||
|
assert(strcmp(output, "folder") == 0);
|
||||||
|
|
||||||
|
assert(fatfs_get_substring("C:\\folder\\file.zip", 1, output, sizeof(output)) == 0);
|
||||||
|
assert(strcmp(output, "file.zip") == 0);
|
||||||
|
|
||||||
|
assert(fatfs_get_substring("/dev/etc/file.zip", 0, output, sizeof(output)) == 0);
|
||||||
|
assert(strcmp(output, "dev") == 0);
|
||||||
|
|
||||||
|
assert(fatfs_get_substring("/dev/etc/file.zip", 1, output, sizeof(output)) == 0);
|
||||||
|
assert(strcmp(output, "etc") == 0);
|
||||||
|
|
||||||
|
assert(fatfs_get_substring("/dev/etc/file.zip", 2, output, sizeof(output)) == 0);
|
||||||
|
assert(strcmp(output, "file.zip") == 0);
|
||||||
|
|
||||||
|
assert(fatfs_split_path("C:\\folder\\file.zip", output, sizeof(output), output2, sizeof(output2)) == 0);
|
||||||
|
assert(strcmp(output, "C:\\folder") == 0);
|
||||||
|
assert(strcmp(output2, "file.zip") == 0);
|
||||||
|
|
||||||
|
assert(fatfs_split_path("C:\\file.zip", output, sizeof(output), output2, sizeof(output2)) == 0);
|
||||||
|
assert(output[0] == 0);
|
||||||
|
assert(strcmp(output2, "file.zip") == 0);
|
||||||
|
|
||||||
|
assert(fatfs_split_path("/dev/etc/file.zip", output, sizeof(output), output2, sizeof(output2)) == 0);
|
||||||
|
assert(strcmp(output, "/dev/etc") == 0);
|
||||||
|
assert(strcmp(output2, "file.zip") == 0);
|
||||||
|
|
||||||
|
assert(FileString_GetExtension("C:\\file.zip") == strlen("C:\\file"));
|
||||||
|
assert(FileString_GetExtension("C:\\file.zip.ext") == strlen("C:\\file.zip"));
|
||||||
|
assert(FileString_GetExtension("C:\\file.zip.") == strlen("C:\\file.zip"));
|
||||||
|
|
||||||
|
assert(FileString_TrimLength("C:\\file.zip", strlen("C:\\file.zip")) == strlen("C:\\file.zip"));
|
||||||
|
assert(FileString_TrimLength("C:\\file.zip ", strlen("C:\\file.zip ")) == strlen("C:\\file.zip"));
|
||||||
|
assert(FileString_TrimLength(" ", strlen(" ")) == 0);
|
||||||
|
|
||||||
|
assert(fatfs_compare_names("C:\\file.ext", "C:\\file.ext") == 1);
|
||||||
|
assert(fatfs_compare_names("C:\\file2.ext", "C:\\file.ext") == 0);
|
||||||
|
assert(fatfs_compare_names("C:\\file .ext", "C:\\file.ext") == 1);
|
||||||
|
assert(fatfs_compare_names("C:\\file .ext", "C:\\file2.ext") == 0);
|
||||||
|
|
||||||
|
assert(fatfs_string_ends_with_slash("C:\\folder") == 0);
|
||||||
|
assert(fatfs_string_ends_with_slash("C:\\folder\\") == 1);
|
||||||
|
assert(fatfs_string_ends_with_slash("/path") == 0);
|
||||||
|
assert(fatfs_string_ends_with_slash("/path/a") == 0);
|
||||||
|
assert(fatfs_string_ends_with_slash("/path/") == 1);
|
||||||
|
|
||||||
|
assert(fatfs_get_extension("/mypath/file.wav", output, 4) == 1);
|
||||||
|
assert(strcmp(output, "wav") == 0);
|
||||||
|
assert(fatfs_get_extension("/mypath/file.WAV", output, 4) == 1);
|
||||||
|
assert(strcmp(output, "wav") == 0);
|
||||||
|
assert(fatfs_get_extension("/mypath/file.zip", output, 4) == 1);
|
||||||
|
assert(strcmp(output, "ext") != 0);
|
||||||
|
|
||||||
|
assert(fatfs_create_path_string("/mydir1", "myfile.txt", output, sizeof(output)) == 1);
|
||||||
|
assert(strcmp(output, "/mydir1/myfile.txt") == 0);
|
||||||
|
assert(fatfs_create_path_string("/mydir2/", "myfile2.txt", output, sizeof(output)) == 1);
|
||||||
|
assert(strcmp(output, "/mydir2/myfile2.txt") == 0);
|
||||||
|
assert(fatfs_create_path_string("C:\\mydir3", "myfile3.txt", output, sizeof(output)) == 1);
|
||||||
|
assert(strcmp(output, "C:\\mydir3\\myfile3.txt") == 0);
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,20 @@
|
||||||
|
#ifndef __FILESTRING_H__
|
||||||
|
#define __FILESTRING_H__
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Prototypes
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_total_path_levels(char *path);
|
||||||
|
int fatfs_get_substring(char *Path, int levelreq, char *output, int max_len);
|
||||||
|
int fatfs_split_path(char *FullPath, char *Path, int max_path, char *FileName, int max_filename);
|
||||||
|
int fatfs_compare_names(char* strA, char* strB);
|
||||||
|
int fatfs_string_ends_with_slash(char *path);
|
||||||
|
int fatfs_get_sfn_display_name(char* out, char* in);
|
||||||
|
int fatfs_get_extension(char* filename, char* out, int maxlen);
|
||||||
|
int fatfs_create_path_string(char* path, char *filename, char* out, int maxlen);
|
||||||
|
|
||||||
|
#ifndef NULL
|
||||||
|
#define NULL 0
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,478 @@
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT16/32 File IO Library
|
||||||
|
// V2.6
|
||||||
|
// Ultra-Embedded.com
|
||||||
|
// Copyright 2003 - 2012
|
||||||
|
//
|
||||||
|
// Email: admin@ultra-embedded.com
|
||||||
|
//
|
||||||
|
// License: GPL
|
||||||
|
// If you would like a version with a more permissive license for use in
|
||||||
|
// closed source commercial applications please contact me for details.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//
|
||||||
|
// This file is part of FAT File IO Library.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 2 of the License, or
|
||||||
|
// (at your option) any later version.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 FAT File IO Library; if not, write to the Free Software
|
||||||
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#include <string.h>
|
||||||
|
#include "fat_defs.h"
|
||||||
|
#include "fat_access.h"
|
||||||
|
#include "fat_table.h"
|
||||||
|
|
||||||
|
#ifndef FAT_BUFFERS
|
||||||
|
#define FAT_BUFFERS 1
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef FAT_BUFFER_SECTORS
|
||||||
|
#define FAT_BUFFER_SECTORS 1
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if FAT_BUFFERS < 1 || FAT_BUFFER_SECTORS < 1
|
||||||
|
#error "FAT_BUFFERS & FAT_BUFFER_SECTORS must be at least 1"
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT Sector Buffer
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#define FAT32_GET_32BIT_WORD(pbuf, location) ( GET_32BIT_WORD(pbuf->ptr, location) )
|
||||||
|
#define FAT32_SET_32BIT_WORD(pbuf, location, value) { SET_32BIT_WORD(pbuf->ptr, location, value); pbuf->dirty = 1; }
|
||||||
|
#define FAT16_GET_16BIT_WORD(pbuf, location) ( GET_16BIT_WORD(pbuf->ptr, location) )
|
||||||
|
#define FAT16_SET_16BIT_WORD(pbuf, location, value) { SET_16BIT_WORD(pbuf->ptr, location, value); pbuf->dirty = 1; }
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_fat_init:
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
void fatfs_fat_init(struct fatfs *fs)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
|
||||||
|
// FAT buffer chain head
|
||||||
|
fs->fat_buffer_head = NULL;
|
||||||
|
|
||||||
|
for (i=0;i<FAT_BUFFERS;i++)
|
||||||
|
{
|
||||||
|
// Initialise buffers to invalid
|
||||||
|
fs->fat_buffers[i].address = FAT32_INVALID_CLUSTER;
|
||||||
|
fs->fat_buffers[i].dirty = 0;
|
||||||
|
memset(fs->fat_buffers[i].sector, 0x00, sizeof(fs->fat_buffers[i].sector));
|
||||||
|
fs->fat_buffers[i].ptr = NULL;
|
||||||
|
|
||||||
|
// Add to head of queue
|
||||||
|
fs->fat_buffers[i].next = fs->fat_buffer_head;
|
||||||
|
fs->fat_buffer_head = &fs->fat_buffers[i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_fat_writeback: Writeback 'dirty' FAT sectors to disk
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static int fatfs_fat_writeback(struct fatfs *fs, struct fat_buffer *pcur)
|
||||||
|
{
|
||||||
|
if (pcur)
|
||||||
|
{
|
||||||
|
// Writeback sector if changed
|
||||||
|
if (pcur->dirty)
|
||||||
|
{
|
||||||
|
if (fs->disk_io.write_media)
|
||||||
|
{
|
||||||
|
uint32 sectors = FAT_BUFFER_SECTORS;
|
||||||
|
uint32 offset = pcur->address - fs->fat_begin_lba;
|
||||||
|
|
||||||
|
// Limit to sectors used for the FAT
|
||||||
|
if ((offset + FAT_BUFFER_SECTORS) <= fs->fat_sectors)
|
||||||
|
sectors = FAT_BUFFER_SECTORS;
|
||||||
|
else
|
||||||
|
sectors = fs->fat_sectors - offset;
|
||||||
|
|
||||||
|
if (!fs->disk_io.write_media(pcur->address, pcur->sector, sectors))
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
pcur->dirty = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_fat_read_sector: Read a FAT sector
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static struct fat_buffer *fatfs_fat_read_sector(struct fatfs *fs, uint32 sector)
|
||||||
|
{
|
||||||
|
struct fat_buffer *last = NULL;
|
||||||
|
struct fat_buffer *pcur = fs->fat_buffer_head;
|
||||||
|
|
||||||
|
// Itterate through sector buffer list
|
||||||
|
while (pcur)
|
||||||
|
{
|
||||||
|
// Sector within this buffer?
|
||||||
|
if ((sector >= pcur->address) && (sector < (pcur->address + FAT_BUFFER_SECTORS)))
|
||||||
|
break;
|
||||||
|
|
||||||
|
// End of list?
|
||||||
|
if (pcur->next == NULL)
|
||||||
|
{
|
||||||
|
// Remove buffer from list
|
||||||
|
if (last)
|
||||||
|
last->next = NULL;
|
||||||
|
// We the first and last buffer in the chain?
|
||||||
|
else
|
||||||
|
fs->fat_buffer_head = NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
last = pcur;
|
||||||
|
pcur = pcur->next;
|
||||||
|
}
|
||||||
|
|
||||||
|
// We found the sector already in FAT buffer chain
|
||||||
|
if (pcur)
|
||||||
|
{
|
||||||
|
pcur->ptr = (uint8 *)(pcur->sector + ((sector - pcur->address) * FAT_SECTOR_SIZE));
|
||||||
|
return pcur;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Else, we removed the last item from the list
|
||||||
|
pcur = last;
|
||||||
|
|
||||||
|
// Add to start of sector buffer list (now newest sector)
|
||||||
|
pcur->next = fs->fat_buffer_head;
|
||||||
|
fs->fat_buffer_head = pcur;
|
||||||
|
|
||||||
|
// Writeback sector if changed
|
||||||
|
if (pcur->dirty)
|
||||||
|
if (!fatfs_fat_writeback(fs, pcur))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Address is now new sector
|
||||||
|
pcur->address = sector;
|
||||||
|
|
||||||
|
// Read next sector
|
||||||
|
if (!fs->disk_io.read_media(pcur->address, pcur->sector, FAT_BUFFER_SECTORS))
|
||||||
|
{
|
||||||
|
// Read failed, invalidate buffer address
|
||||||
|
pcur->address = FAT32_INVALID_CLUSTER;
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
pcur->ptr = pcur->sector;
|
||||||
|
return pcur;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_fat_purge: Purge 'dirty' FAT sectors to disk
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_fat_purge(struct fatfs *fs)
|
||||||
|
{
|
||||||
|
struct fat_buffer *pcur = fs->fat_buffer_head;
|
||||||
|
|
||||||
|
// Itterate through sector buffer list
|
||||||
|
while (pcur)
|
||||||
|
{
|
||||||
|
// Writeback sector if changed
|
||||||
|
if (pcur->dirty)
|
||||||
|
if (!fatfs_fat_writeback(fs, pcur))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
pcur = pcur->next;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// General FAT Table Operations
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_find_next_cluster: Return cluster number of next cluster in chain by
|
||||||
|
// reading FAT table and traversing it. Return 0xffffffff for end of chain.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
uint32 fatfs_find_next_cluster(struct fatfs *fs, uint32 current_cluster)
|
||||||
|
{
|
||||||
|
uint32 fat_sector_offset, position;
|
||||||
|
uint32 nextcluster;
|
||||||
|
struct fat_buffer *pbuf;
|
||||||
|
|
||||||
|
// Why is '..' labelled with cluster 0 when it should be 2 ??
|
||||||
|
if (current_cluster == 0)
|
||||||
|
current_cluster = 2;
|
||||||
|
|
||||||
|
// Find which sector of FAT table to read
|
||||||
|
if (fs->fat_type == FAT_TYPE_16)
|
||||||
|
fat_sector_offset = current_cluster / 256;
|
||||||
|
else
|
||||||
|
fat_sector_offset = current_cluster / 128;
|
||||||
|
|
||||||
|
// Read FAT sector into buffer
|
||||||
|
pbuf = fatfs_fat_read_sector(fs, fs->fat_begin_lba+fat_sector_offset);
|
||||||
|
if (!pbuf)
|
||||||
|
return (FAT32_LAST_CLUSTER);
|
||||||
|
|
||||||
|
if (fs->fat_type == FAT_TYPE_16)
|
||||||
|
{
|
||||||
|
// Find 32 bit entry of current sector relating to cluster number
|
||||||
|
position = (current_cluster - (fat_sector_offset * 256)) * 2;
|
||||||
|
|
||||||
|
// Read Next Clusters value from Sector Buffer
|
||||||
|
nextcluster = FAT16_GET_16BIT_WORD(pbuf, (uint16)position);
|
||||||
|
|
||||||
|
// If end of chain found
|
||||||
|
if (nextcluster >= 0xFFF8 && nextcluster <= 0xFFFF)
|
||||||
|
return (FAT32_LAST_CLUSTER);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Find 32 bit entry of current sector relating to cluster number
|
||||||
|
position = (current_cluster - (fat_sector_offset * 128)) * 4;
|
||||||
|
|
||||||
|
// Read Next Clusters value from Sector Buffer
|
||||||
|
nextcluster = FAT32_GET_32BIT_WORD(pbuf, (uint16)position);
|
||||||
|
|
||||||
|
// Mask out MS 4 bits (its 28bit addressing)
|
||||||
|
nextcluster = nextcluster & 0x0FFFFFFF;
|
||||||
|
|
||||||
|
// If end of chain found
|
||||||
|
if (nextcluster >= 0x0FFFFFF8 && nextcluster <= 0x0FFFFFFF)
|
||||||
|
return (FAT32_LAST_CLUSTER);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Else return next cluster
|
||||||
|
return (nextcluster);
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_set_fs_info_next_free_cluster: Write the next free cluster to the FSINFO table
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
void fatfs_set_fs_info_next_free_cluster(struct fatfs *fs, uint32 newValue)
|
||||||
|
{
|
||||||
|
if (fs->fat_type == FAT_TYPE_16)
|
||||||
|
;
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Load sector to change it
|
||||||
|
struct fat_buffer *pbuf = fatfs_fat_read_sector(fs, fs->lba_begin+fs->fs_info_sector);
|
||||||
|
if (!pbuf)
|
||||||
|
return ;
|
||||||
|
|
||||||
|
// Change
|
||||||
|
FAT32_SET_32BIT_WORD(pbuf, 492, newValue);
|
||||||
|
fs->next_free_cluster = newValue;
|
||||||
|
|
||||||
|
// Write back FSINFO sector to disk
|
||||||
|
if (fs->disk_io.write_media)
|
||||||
|
fs->disk_io.write_media(pbuf->address, pbuf->sector, 1);
|
||||||
|
|
||||||
|
// Invalidate cache entry
|
||||||
|
pbuf->address = FAT32_INVALID_CLUSTER;
|
||||||
|
pbuf->dirty = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_find_blank_cluster: Find a free cluster entry by reading the FAT
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
int fatfs_find_blank_cluster(struct fatfs *fs, uint32 start_cluster, uint32 *free_cluster)
|
||||||
|
{
|
||||||
|
uint32 fat_sector_offset, position;
|
||||||
|
uint32 nextcluster;
|
||||||
|
uint32 current_cluster = start_cluster;
|
||||||
|
struct fat_buffer *pbuf;
|
||||||
|
|
||||||
|
do
|
||||||
|
{
|
||||||
|
// Find which sector of FAT table to read
|
||||||
|
if (fs->fat_type == FAT_TYPE_16)
|
||||||
|
fat_sector_offset = current_cluster / 256;
|
||||||
|
else
|
||||||
|
fat_sector_offset = current_cluster / 128;
|
||||||
|
|
||||||
|
if ( fat_sector_offset < fs->fat_sectors)
|
||||||
|
{
|
||||||
|
// Read FAT sector into buffer
|
||||||
|
pbuf = fatfs_fat_read_sector(fs, fs->fat_begin_lba+fat_sector_offset);
|
||||||
|
if (!pbuf)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
if (fs->fat_type == FAT_TYPE_16)
|
||||||
|
{
|
||||||
|
// Find 32 bit entry of current sector relating to cluster number
|
||||||
|
position = (current_cluster - (fat_sector_offset * 256)) * 2;
|
||||||
|
|
||||||
|
// Read Next Clusters value from Sector Buffer
|
||||||
|
nextcluster = FAT16_GET_16BIT_WORD(pbuf, (uint16)position);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Find 32 bit entry of current sector relating to cluster number
|
||||||
|
position = (current_cluster - (fat_sector_offset * 128)) * 4;
|
||||||
|
|
||||||
|
// Read Next Clusters value from Sector Buffer
|
||||||
|
nextcluster = FAT32_GET_32BIT_WORD(pbuf, (uint16)position);
|
||||||
|
|
||||||
|
// Mask out MS 4 bits (its 28bit addressing)
|
||||||
|
nextcluster = nextcluster & 0x0FFFFFFF;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (nextcluster !=0 )
|
||||||
|
current_cluster++;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
// Otherwise, run out of FAT sectors to check...
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
while (nextcluster != 0x0);
|
||||||
|
|
||||||
|
// Found blank entry
|
||||||
|
*free_cluster = current_cluster;
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_fat_set_cluster: Set a cluster link in the chain. NOTE: Immediate
|
||||||
|
// write (slow).
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
int fatfs_fat_set_cluster(struct fatfs *fs, uint32 cluster, uint32 next_cluster)
|
||||||
|
{
|
||||||
|
struct fat_buffer *pbuf;
|
||||||
|
uint32 fat_sector_offset, position;
|
||||||
|
|
||||||
|
// Find which sector of FAT table to read
|
||||||
|
if (fs->fat_type == FAT_TYPE_16)
|
||||||
|
fat_sector_offset = cluster / 256;
|
||||||
|
else
|
||||||
|
fat_sector_offset = cluster / 128;
|
||||||
|
|
||||||
|
// Read FAT sector into buffer
|
||||||
|
pbuf = fatfs_fat_read_sector(fs, fs->fat_begin_lba+fat_sector_offset);
|
||||||
|
if (!pbuf)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
if (fs->fat_type == FAT_TYPE_16)
|
||||||
|
{
|
||||||
|
// Find 16 bit entry of current sector relating to cluster number
|
||||||
|
position = (cluster - (fat_sector_offset * 256)) * 2;
|
||||||
|
|
||||||
|
// Write Next Clusters value to Sector Buffer
|
||||||
|
FAT16_SET_16BIT_WORD(pbuf, (uint16)position, ((uint16)next_cluster));
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Find 32 bit entry of current sector relating to cluster number
|
||||||
|
position = (cluster - (fat_sector_offset * 128)) * 4;
|
||||||
|
|
||||||
|
// Write Next Clusters value to Sector Buffer
|
||||||
|
FAT32_SET_32BIT_WORD(pbuf, (uint16)position, next_cluster);
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_free_cluster_chain: Follow a chain marking each element as free
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
int fatfs_free_cluster_chain(struct fatfs *fs, uint32 start_cluster)
|
||||||
|
{
|
||||||
|
uint32 last_cluster;
|
||||||
|
uint32 next_cluster = start_cluster;
|
||||||
|
|
||||||
|
// Loop until end of chain
|
||||||
|
while ( (next_cluster != FAT32_LAST_CLUSTER) && (next_cluster != 0x00000000) )
|
||||||
|
{
|
||||||
|
last_cluster = next_cluster;
|
||||||
|
|
||||||
|
// Find next link
|
||||||
|
next_cluster = fatfs_find_next_cluster(fs, next_cluster);
|
||||||
|
|
||||||
|
// Clear last link
|
||||||
|
fatfs_fat_set_cluster(fs, last_cluster, 0x00000000);
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_fat_add_cluster_to_chain: Follow a chain marking and then add a new entry
|
||||||
|
// to the current tail.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
int fatfs_fat_add_cluster_to_chain(struct fatfs *fs, uint32 start_cluster, uint32 newEntry)
|
||||||
|
{
|
||||||
|
uint32 last_cluster = FAT32_LAST_CLUSTER;
|
||||||
|
uint32 next_cluster = start_cluster;
|
||||||
|
|
||||||
|
if (start_cluster == FAT32_LAST_CLUSTER)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Loop until end of chain
|
||||||
|
while ( next_cluster != FAT32_LAST_CLUSTER )
|
||||||
|
{
|
||||||
|
last_cluster = next_cluster;
|
||||||
|
|
||||||
|
// Find next link
|
||||||
|
next_cluster = fatfs_find_next_cluster(fs, next_cluster);
|
||||||
|
if (!next_cluster)
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Add link in for new cluster
|
||||||
|
fatfs_fat_set_cluster(fs, last_cluster, newEntry);
|
||||||
|
|
||||||
|
// Mark new cluster as end of chain
|
||||||
|
fatfs_fat_set_cluster(fs, newEntry, FAT32_LAST_CLUSTER);
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_count_free_clusters:
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
uint32 fatfs_count_free_clusters(struct fatfs *fs)
|
||||||
|
{
|
||||||
|
uint32 i,j;
|
||||||
|
uint32 count = 0;
|
||||||
|
struct fat_buffer *pbuf;
|
||||||
|
|
||||||
|
for (i = 0; i < fs->fat_sectors; i++)
|
||||||
|
{
|
||||||
|
// Read FAT sector into buffer
|
||||||
|
pbuf = fatfs_fat_read_sector(fs, fs->fat_begin_lba + i);
|
||||||
|
if (!pbuf)
|
||||||
|
break;
|
||||||
|
|
||||||
|
for (j = 0; j < FAT_SECTOR_SIZE; )
|
||||||
|
{
|
||||||
|
if (fs->fat_type == FAT_TYPE_16)
|
||||||
|
{
|
||||||
|
if (FAT16_GET_16BIT_WORD(pbuf, (uint16)j) == 0)
|
||||||
|
count++;
|
||||||
|
|
||||||
|
j += 2;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
if (FAT32_GET_32BIT_WORD(pbuf, (uint16)j) == 0)
|
||||||
|
count++;
|
||||||
|
|
||||||
|
j += 4;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return count;
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,20 @@
|
||||||
|
#ifndef __FAT_TABLE_H__
|
||||||
|
#define __FAT_TABLE_H__
|
||||||
|
|
||||||
|
#include "fat_opts.h"
|
||||||
|
#include "fat_misc.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Prototypes
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
void fatfs_fat_init(struct fatfs *fs);
|
||||||
|
int fatfs_fat_purge(struct fatfs *fs);
|
||||||
|
uint32 fatfs_find_next_cluster(struct fatfs *fs, uint32 current_cluster);
|
||||||
|
void fatfs_set_fs_info_next_free_cluster(struct fatfs *fs, uint32 newValue);
|
||||||
|
int fatfs_find_blank_cluster(struct fatfs *fs, uint32 start_cluster, uint32 *free_cluster);
|
||||||
|
int fatfs_fat_set_cluster(struct fatfs *fs, uint32 cluster, uint32 next_cluster);
|
||||||
|
int fatfs_fat_add_cluster_to_chain(struct fatfs *fs, uint32 start_cluster, uint32 newEntry);
|
||||||
|
int fatfs_free_cluster_chain(struct fatfs *fs, uint32 start_cluster);
|
||||||
|
uint32 fatfs_count_free_clusters(struct fatfs *fs);
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,69 @@
|
||||||
|
#ifndef __FAT_TYPES_H__
|
||||||
|
#define __FAT_TYPES_H__
|
||||||
|
|
||||||
|
// Detect 64-bit compilation on GCC
|
||||||
|
#if defined(__GNUC__) && defined(__SIZEOF_LONG__)
|
||||||
|
#if __SIZEOF_LONG__ == 8
|
||||||
|
#define FATFS_DEF_UINT32_AS_INT
|
||||||
|
#endif
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
// System specific types
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
#ifndef FATFS_NO_DEF_TYPES
|
||||||
|
typedef unsigned char uint8;
|
||||||
|
typedef unsigned short uint16;
|
||||||
|
|
||||||
|
// If compiling on a 64-bit machine, use int as 32-bits
|
||||||
|
#ifdef FATFS_DEF_UINT32_AS_INT
|
||||||
|
typedef unsigned int uint32;
|
||||||
|
// Else for 32-bit machines & embedded systems, use long...
|
||||||
|
#else
|
||||||
|
typedef unsigned long uint32;
|
||||||
|
#endif
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef NULL
|
||||||
|
#define NULL 0
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
// Endian Macros
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
// FAT is little endian so big endian systems need to swap words
|
||||||
|
|
||||||
|
// Little Endian - No swap required
|
||||||
|
#if FATFS_IS_LITTLE_ENDIAN == 1
|
||||||
|
|
||||||
|
#define FAT_HTONS(n) (n)
|
||||||
|
#define FAT_HTONL(n) (n)
|
||||||
|
|
||||||
|
// Big Endian - Swap required
|
||||||
|
#else
|
||||||
|
|
||||||
|
#define FAT_HTONS(n) ((((uint16)((n) & 0xff)) << 8) | (((n) & 0xff00) >> 8))
|
||||||
|
#define FAT_HTONL(n) (((((uint32)(n) & 0xFF)) << 24) | \
|
||||||
|
((((uint32)(n) & 0xFF00)) << 8) | \
|
||||||
|
((((uint32)(n) & 0xFF0000)) >> 8) | \
|
||||||
|
((((uint32)(n) & 0xFF000000)) >> 24))
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
// Structure Packing Compile Options
|
||||||
|
//-------------------------------------------------------------
|
||||||
|
#ifdef __GNUC__
|
||||||
|
#define STRUCT_PACK
|
||||||
|
#define STRUCT_PACK_BEGIN
|
||||||
|
#define STRUCT_PACK_END
|
||||||
|
#define STRUCT_PACKED __attribute__ ((packed))
|
||||||
|
#else
|
||||||
|
// Other compilers may require other methods of packing structures
|
||||||
|
#define STRUCT_PACK
|
||||||
|
#define STRUCT_PACK_BEGIN
|
||||||
|
#define STRUCT_PACK_END
|
||||||
|
#define STRUCT_PACKED
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,373 @@
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// FAT16/32 File IO Library
|
||||||
|
// V2.6
|
||||||
|
// Ultra-Embedded.com
|
||||||
|
// Copyright 2003 - 2012
|
||||||
|
//
|
||||||
|
// Email: admin@ultra-embedded.com
|
||||||
|
//
|
||||||
|
// License: GPL
|
||||||
|
// If you would like a version with a more permissive license for use in
|
||||||
|
// closed source commercial applications please contact me for details.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//
|
||||||
|
// This file is part of FAT File IO Library.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 2 of the License, or
|
||||||
|
// (at your option) any later version.
|
||||||
|
//
|
||||||
|
// FAT File IO Library 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 FAT File IO Library; if not, write to the Free Software
|
||||||
|
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
#include <string.h>
|
||||||
|
#include "fat_defs.h"
|
||||||
|
#include "fat_access.h"
|
||||||
|
#include "fat_table.h"
|
||||||
|
#include "fat_write.h"
|
||||||
|
#include "fat_string.h"
|
||||||
|
#include "fat_misc.h"
|
||||||
|
|
||||||
|
#if FATFS_INC_WRITE_SUPPORT
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_add_free_space: Allocate another cluster of free space to the end
|
||||||
|
// of a files cluster chain.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_add_free_space(struct fatfs *fs, uint32 *startCluster, uint32 clusters)
|
||||||
|
{
|
||||||
|
uint32 i;
|
||||||
|
uint32 nextcluster;
|
||||||
|
uint32 start = *startCluster;
|
||||||
|
|
||||||
|
// Set the next free cluster hint to unknown
|
||||||
|
if (fs->next_free_cluster != FAT32_LAST_CLUSTER)
|
||||||
|
fatfs_set_fs_info_next_free_cluster(fs, FAT32_LAST_CLUSTER);
|
||||||
|
|
||||||
|
for (i=0;i<clusters;i++)
|
||||||
|
{
|
||||||
|
// Start looking for free clusters from the beginning
|
||||||
|
if (fatfs_find_blank_cluster(fs, fs->rootdir_first_cluster, &nextcluster))
|
||||||
|
{
|
||||||
|
// Point last to this
|
||||||
|
fatfs_fat_set_cluster(fs, start, nextcluster);
|
||||||
|
|
||||||
|
// Point this to end of file
|
||||||
|
fatfs_fat_set_cluster(fs, nextcluster, FAT32_LAST_CLUSTER);
|
||||||
|
|
||||||
|
// Adjust argument reference
|
||||||
|
start = nextcluster;
|
||||||
|
if (i == 0)
|
||||||
|
*startCluster = nextcluster;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_allocate_free_space: Add an ammount of free space to a file either from
|
||||||
|
// 'startCluster' if newFile = false, or allocating a new start to the chain if
|
||||||
|
// newFile = true.
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_allocate_free_space(struct fatfs *fs, int newFile, uint32 *startCluster, uint32 size)
|
||||||
|
{
|
||||||
|
uint32 clusterSize;
|
||||||
|
uint32 clusterCount;
|
||||||
|
uint32 nextcluster;
|
||||||
|
|
||||||
|
if (size==0)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Set the next free cluster hint to unknown
|
||||||
|
if (fs->next_free_cluster != FAT32_LAST_CLUSTER)
|
||||||
|
fatfs_set_fs_info_next_free_cluster(fs, FAT32_LAST_CLUSTER);
|
||||||
|
|
||||||
|
// Work out size and clusters
|
||||||
|
clusterSize = fs->sectors_per_cluster * FAT_SECTOR_SIZE;
|
||||||
|
clusterCount = (size / clusterSize);
|
||||||
|
|
||||||
|
// If any left over
|
||||||
|
if (size-(clusterSize*clusterCount))
|
||||||
|
clusterCount++;
|
||||||
|
|
||||||
|
// Allocated first link in the chain if a new file
|
||||||
|
if (newFile)
|
||||||
|
{
|
||||||
|
if (!fatfs_find_blank_cluster(fs, fs->rootdir_first_cluster, &nextcluster))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// If this is all that is needed then all done
|
||||||
|
if (clusterCount==1)
|
||||||
|
{
|
||||||
|
fatfs_fat_set_cluster(fs, nextcluster, FAT32_LAST_CLUSTER);
|
||||||
|
*startCluster = nextcluster;
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// Allocate from end of current chain (startCluster is end of chain)
|
||||||
|
else
|
||||||
|
nextcluster = *startCluster;
|
||||||
|
|
||||||
|
if (!fatfs_add_free_space(fs, &nextcluster, clusterCount))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_find_free_dir_offset: Find a free space in the directory for a new entry
|
||||||
|
// which takes up 'entryCount' blocks (or allocate some more)
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
static int fatfs_find_free_dir_offset(struct fatfs *fs, uint32 dirCluster, int entryCount, uint32 *pSector, uint8 *pOffset)
|
||||||
|
{
|
||||||
|
struct fat_dir_entry *directoryEntry;
|
||||||
|
uint8 item=0;
|
||||||
|
uint16 recordoffset = 0;
|
||||||
|
uint8 i=0;
|
||||||
|
int x=0;
|
||||||
|
int possible_spaces = 0;
|
||||||
|
int start_recorded = 0;
|
||||||
|
|
||||||
|
// No entries required?
|
||||||
|
if (entryCount == 0)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Main cluster following loop
|
||||||
|
while (1)
|
||||||
|
{
|
||||||
|
// Read sector
|
||||||
|
if (fatfs_sector_reader(fs, dirCluster, x++, 0))
|
||||||
|
{
|
||||||
|
// Analyse Sector
|
||||||
|
for (item = 0; item < FAT_DIR_ENTRIES_PER_SECTOR; item++)
|
||||||
|
{
|
||||||
|
// Create the multiplier for sector access
|
||||||
|
recordoffset = FAT_DIR_ENTRY_SIZE * item;
|
||||||
|
|
||||||
|
// Overlay directory entry over buffer
|
||||||
|
directoryEntry = (struct fat_dir_entry*)(fs->currentsector.sector+recordoffset);
|
||||||
|
|
||||||
|
// LFN Entry
|
||||||
|
if (fatfs_entry_lfn_text(directoryEntry))
|
||||||
|
{
|
||||||
|
// First entry?
|
||||||
|
if (possible_spaces == 0)
|
||||||
|
{
|
||||||
|
// Store start
|
||||||
|
*pSector = x-1;
|
||||||
|
*pOffset = item;
|
||||||
|
start_recorded = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Increment the count in-case the file turns
|
||||||
|
// out to be deleted...
|
||||||
|
possible_spaces++;
|
||||||
|
}
|
||||||
|
// SFN Entry
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Has file been deleted?
|
||||||
|
if (fs->currentsector.sector[recordoffset] == FILE_HEADER_DELETED)
|
||||||
|
{
|
||||||
|
// First entry?
|
||||||
|
if (possible_spaces == 0)
|
||||||
|
{
|
||||||
|
// Store start
|
||||||
|
*pSector = x-1;
|
||||||
|
*pOffset = item;
|
||||||
|
start_recorded = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
possible_spaces++;
|
||||||
|
|
||||||
|
// We have found enough space?
|
||||||
|
if (possible_spaces >= entryCount)
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
// Else continue counting until we find a valid entry!
|
||||||
|
}
|
||||||
|
// Is the file entry empty?
|
||||||
|
else if (fs->currentsector.sector[recordoffset] == FILE_HEADER_BLANK)
|
||||||
|
{
|
||||||
|
// First entry?
|
||||||
|
if (possible_spaces == 0)
|
||||||
|
{
|
||||||
|
// Store start
|
||||||
|
*pSector = x-1;
|
||||||
|
*pOffset = item;
|
||||||
|
start_recorded = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Increment the blank entries count
|
||||||
|
possible_spaces++;
|
||||||
|
|
||||||
|
// We have found enough space?
|
||||||
|
if (possible_spaces >= entryCount)
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
// File entry is valid
|
||||||
|
else
|
||||||
|
{
|
||||||
|
// Reset all flags
|
||||||
|
possible_spaces = 0;
|
||||||
|
start_recorded = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} // End of for
|
||||||
|
} // End of if
|
||||||
|
// Run out of free space in the directory, allocate some more
|
||||||
|
else
|
||||||
|
{
|
||||||
|
uint32 newCluster;
|
||||||
|
|
||||||
|
// Get a new cluster for directory
|
||||||
|
if (!fatfs_find_blank_cluster(fs, fs->rootdir_first_cluster, &newCluster))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Add cluster to end of directory tree
|
||||||
|
if (!fatfs_fat_add_cluster_to_chain(fs, dirCluster, newCluster))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Erase new directory cluster
|
||||||
|
memset(fs->currentsector.sector, 0x00, FAT_SECTOR_SIZE);
|
||||||
|
for (i=0;i<fs->sectors_per_cluster;i++)
|
||||||
|
{
|
||||||
|
if (!fatfs_write_sector(fs, newCluster, i, 0))
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
// If non of the name fitted on previous sectors
|
||||||
|
if (!start_recorded)
|
||||||
|
{
|
||||||
|
// Store start
|
||||||
|
*pSector = (x-1);
|
||||||
|
*pOffset = 0;
|
||||||
|
start_recorded = 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
} // End of while loop
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// fatfs_add_file_entry: Add a directory entry to a location found by FindFreeOffset
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_add_file_entry(struct fatfs *fs, uint32 dirCluster, char *filename, char *shortfilename, uint32 startCluster, uint32 size, int dir)
|
||||||
|
{
|
||||||
|
uint8 item=0;
|
||||||
|
uint16 recordoffset = 0;
|
||||||
|
uint8 i=0;
|
||||||
|
uint32 x=0;
|
||||||
|
int entryCount;
|
||||||
|
struct fat_dir_entry shortEntry;
|
||||||
|
int dirtySector = 0;
|
||||||
|
|
||||||
|
uint32 dirSector = 0;
|
||||||
|
uint8 dirOffset = 0;
|
||||||
|
int foundEnd = 0;
|
||||||
|
|
||||||
|
uint8 checksum;
|
||||||
|
uint8 *pSname;
|
||||||
|
|
||||||
|
// No write access?
|
||||||
|
if (!fs->disk_io.write_media)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
// How many LFN entries are required?
|
||||||
|
// NOTE: We always request one LFN even if it would fit in a SFN!
|
||||||
|
entryCount = fatfs_lfn_entries_required(filename);
|
||||||
|
if (!entryCount)
|
||||||
|
return 0;
|
||||||
|
#else
|
||||||
|
entryCount = 0;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
// Find space in the directory for this filename (or allocate some more)
|
||||||
|
// NOTE: We need to find space for at least the LFN + SFN (or just the SFN if LFNs not supported).
|
||||||
|
if (!fatfs_find_free_dir_offset(fs, dirCluster, entryCount + 1, &dirSector, &dirOffset))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Generate checksum of short filename
|
||||||
|
pSname = (uint8*)shortfilename;
|
||||||
|
checksum = 0;
|
||||||
|
for (i=11; i!=0; i--) checksum = ((checksum & 1) ? 0x80 : 0) + (checksum >> 1) + *pSname++;
|
||||||
|
|
||||||
|
// Start from current sector where space was found!
|
||||||
|
x = dirSector;
|
||||||
|
|
||||||
|
// Main cluster following loop
|
||||||
|
while (1)
|
||||||
|
{
|
||||||
|
// Read sector
|
||||||
|
if (fatfs_sector_reader(fs, dirCluster, x++, 0))
|
||||||
|
{
|
||||||
|
// Analyse Sector
|
||||||
|
for (item = 0; item < FAT_DIR_ENTRIES_PER_SECTOR; item++)
|
||||||
|
{
|
||||||
|
// Create the multiplier for sector access
|
||||||
|
recordoffset = FAT_DIR_ENTRY_SIZE * item;
|
||||||
|
|
||||||
|
// If the start position for the entry has been found
|
||||||
|
if (foundEnd==0)
|
||||||
|
if ( (dirSector==(x-1)) && (dirOffset==item) )
|
||||||
|
foundEnd = 1;
|
||||||
|
|
||||||
|
// Start adding filename
|
||||||
|
if (foundEnd)
|
||||||
|
{
|
||||||
|
if (entryCount==0)
|
||||||
|
{
|
||||||
|
// Short filename
|
||||||
|
fatfs_sfn_create_entry(shortfilename, size, startCluster, &shortEntry, dir);
|
||||||
|
|
||||||
|
#if FATFS_INC_TIME_DATE_SUPPORT
|
||||||
|
// Update create, access & modify time & date
|
||||||
|
fatfs_update_timestamps(&shortEntry, 1, 1, 1);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
memcpy(&fs->currentsector.sector[recordoffset], &shortEntry, sizeof(shortEntry));
|
||||||
|
|
||||||
|
// Writeback
|
||||||
|
return fs->disk_io.write_media(fs->currentsector.address, fs->currentsector.sector, 1);
|
||||||
|
}
|
||||||
|
#if FATFS_INC_LFN_SUPPORT
|
||||||
|
else
|
||||||
|
{
|
||||||
|
entryCount--;
|
||||||
|
|
||||||
|
// Copy entry to directory buffer
|
||||||
|
fatfs_filename_to_lfn(filename, &fs->currentsector.sector[recordoffset], entryCount, checksum);
|
||||||
|
dirtySector = 1;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
} // End of if
|
||||||
|
|
||||||
|
// Write back to disk before loading another sector
|
||||||
|
if (dirtySector)
|
||||||
|
{
|
||||||
|
if (!fs->disk_io.write_media(fs->currentsector.address, fs->currentsector.sector, 1))
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
dirtySector = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
|
} // End of while loop
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,14 @@
|
||||||
|
#ifndef __FAT_WRITE_H__
|
||||||
|
#define __FAT_WRITE_H__
|
||||||
|
|
||||||
|
#include "fat_defs.h"
|
||||||
|
#include "fat_opts.h"
|
||||||
|
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
// Prototypes
|
||||||
|
//-----------------------------------------------------------------------------
|
||||||
|
int fatfs_add_file_entry(struct fatfs *fs, uint32 dirCluster, char *filename, char *shortfilename, uint32 startCluster, uint32 size, int dir);
|
||||||
|
int fatfs_add_free_space(struct fatfs *fs, uint32 *startCluster, uint32 clusters);
|
||||||
|
int fatfs_allocate_free_space(struct fatfs *fs, int newFile, uint32 *startCluster, uint32 size);
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1 @@
|
||||||
|
2.6.11
|
||||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,793 @@
|
||||||
|
/* Copyright (c) 2016 the Civetweb developers
|
||||||
|
*
|
||||||
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||||
|
* of this software and associated documentation files (the "Software"), to deal
|
||||||
|
* in the Software without restriction, including without limitation the rights
|
||||||
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||||
|
* copies of the Software, and to permit persons to whom the Software is
|
||||||
|
* furnished to do so, subject to the following conditions:
|
||||||
|
*
|
||||||
|
* The above copyright notice and this permission notice shall be included in
|
||||||
|
* all copies or substantial portions of the Software.
|
||||||
|
*
|
||||||
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||||
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||||
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||||
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||||
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||||
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
||||||
|
* THE SOFTWARE.
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
static int
|
||||||
|
url_encoded_field_found(const struct mg_connection *conn,
|
||||||
|
const char *key,
|
||||||
|
size_t key_len,
|
||||||
|
const char *filename,
|
||||||
|
size_t filename_len,
|
||||||
|
char *path,
|
||||||
|
size_t path_len,
|
||||||
|
struct mg_form_data_handler *fdh)
|
||||||
|
{
|
||||||
|
char key_dec[1024];
|
||||||
|
char filename_dec[1024];
|
||||||
|
int key_dec_len;
|
||||||
|
int filename_dec_len;
|
||||||
|
int ret;
|
||||||
|
|
||||||
|
key_dec_len =
|
||||||
|
mg_url_decode(key, (int)key_len, key_dec, (int)sizeof(key_dec), 1);
|
||||||
|
|
||||||
|
if (((size_t)key_dec_len >= (size_t)sizeof(key_dec)) || (key_dec_len < 0)) {
|
||||||
|
return FORM_FIELD_STORAGE_SKIP;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (filename) {
|
||||||
|
filename_dec_len = mg_url_decode(filename,
|
||||||
|
(int)filename_len,
|
||||||
|
filename_dec,
|
||||||
|
(int)sizeof(filename_dec),
|
||||||
|
1);
|
||||||
|
|
||||||
|
if (((size_t)filename_dec_len >= (size_t)sizeof(filename_dec))
|
||||||
|
|| (filename_dec_len < 0)) {
|
||||||
|
/* Log error message and skip this field. */
|
||||||
|
mg_cry(conn, "%s: Cannot decode filename", __func__);
|
||||||
|
return FORM_FIELD_STORAGE_SKIP;
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
filename_dec[0] = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
ret =
|
||||||
|
fdh->field_found(key_dec, filename_dec, path, path_len, fdh->user_data);
|
||||||
|
|
||||||
|
if ((ret & 0xF) == FORM_FIELD_STORAGE_GET) {
|
||||||
|
if (fdh->field_get == NULL) {
|
||||||
|
mg_cry(conn, "%s: Function \"Get\" not available", __func__);
|
||||||
|
return FORM_FIELD_STORAGE_SKIP;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if ((ret & 0xF) == FORM_FIELD_STORAGE_STORE) {
|
||||||
|
if (fdh->field_store == NULL) {
|
||||||
|
mg_cry(conn, "%s: Function \"Store\" not available", __func__);
|
||||||
|
return FORM_FIELD_STORAGE_SKIP;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static int
|
||||||
|
url_encoded_field_get(const struct mg_connection *conn,
|
||||||
|
const char *key,
|
||||||
|
size_t key_len,
|
||||||
|
const char *value,
|
||||||
|
size_t value_len,
|
||||||
|
struct mg_form_data_handler *fdh)
|
||||||
|
{
|
||||||
|
char key_dec[1024];
|
||||||
|
|
||||||
|
char *value_dec = mg_malloc(value_len + 1);
|
||||||
|
int value_dec_len;
|
||||||
|
|
||||||
|
if (!value_dec) {
|
||||||
|
/* Log error message and stop parsing the form data. */
|
||||||
|
mg_cry(conn,
|
||||||
|
"%s: Not enough memory (required: %lu)",
|
||||||
|
__func__,
|
||||||
|
(unsigned long)(value_len + 1));
|
||||||
|
return FORM_FIELD_STORAGE_ABORT;
|
||||||
|
}
|
||||||
|
|
||||||
|
mg_url_decode(key, (int)key_len, key_dec, (int)sizeof(key_dec), 1);
|
||||||
|
|
||||||
|
value_dec_len =
|
||||||
|
mg_url_decode(value, (int)value_len, value_dec, (int)value_len + 1, 1);
|
||||||
|
|
||||||
|
return fdh->field_get(key_dec,
|
||||||
|
value_dec,
|
||||||
|
(size_t)value_dec_len,
|
||||||
|
fdh->user_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static int
|
||||||
|
field_stored(const struct mg_connection *conn,
|
||||||
|
const char *path,
|
||||||
|
long long file_size,
|
||||||
|
struct mg_form_data_handler *fdh)
|
||||||
|
{
|
||||||
|
/* Equivalent to "upload" callback of "mg_upload". */
|
||||||
|
|
||||||
|
(void)conn; /* we do not need mg_cry here, so conn is currently unused */
|
||||||
|
|
||||||
|
return fdh->field_store(path, file_size, fdh->user_data);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static const char *
|
||||||
|
search_boundary(const char *buf,
|
||||||
|
size_t buf_len,
|
||||||
|
const char *boundary,
|
||||||
|
size_t boundary_len)
|
||||||
|
{
|
||||||
|
/* We must do a binary search here, not a string search, since the buffer
|
||||||
|
* may contain '\x00' bytes, if binary data is transferred. */
|
||||||
|
int clen = (int)buf_len - (int)boundary_len - 4;
|
||||||
|
int i;
|
||||||
|
|
||||||
|
for (i = 0; i <= clen; i++) {
|
||||||
|
if (!memcmp(buf + i, "\r\n--", 4)) {
|
||||||
|
if (!memcmp(buf + i + 4, boundary, boundary_len)) {
|
||||||
|
return buf + i;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int
|
||||||
|
mg_handle_form_request(struct mg_connection *conn,
|
||||||
|
struct mg_form_data_handler *fdh)
|
||||||
|
{
|
||||||
|
const char *content_type;
|
||||||
|
char path[512];
|
||||||
|
char buf[1024];
|
||||||
|
int field_storage;
|
||||||
|
int buf_fill = 0;
|
||||||
|
int r;
|
||||||
|
int field_count = 0;
|
||||||
|
struct file fstore = STRUCT_FILE_INITIALIZER;
|
||||||
|
int64_t file_size = 0; /* init here, to a avoid a false positive
|
||||||
|
"uninitialized variable used" warning */
|
||||||
|
|
||||||
|
int has_body_data =
|
||||||
|
(conn->request_info.content_length > 0) || (conn->is_chunked);
|
||||||
|
|
||||||
|
/* There are three ways to encode data from a HTML form:
|
||||||
|
* 1) method: GET (default)
|
||||||
|
* The form data is in the HTTP query string.
|
||||||
|
* 2) method: POST, enctype: "application/x-www-form-urlencoded"
|
||||||
|
* The form data is in the request body.
|
||||||
|
* The body is url encoded (the default encoding for POST).
|
||||||
|
* 3) method: POST, enctype: "multipart/form-data".
|
||||||
|
* The form data is in the request body of a multipart message.
|
||||||
|
* This is the typical way to handle file upload from a form.
|
||||||
|
*/
|
||||||
|
|
||||||
|
if (!has_body_data) {
|
||||||
|
const char *data;
|
||||||
|
|
||||||
|
if (strcmp(conn->request_info.request_method, "GET")) {
|
||||||
|
/* No body data, but not a GET request.
|
||||||
|
* This is not a valid form request. */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* GET request: form data is in the query string. */
|
||||||
|
/* The entire data has already been loaded, so there is no nead to
|
||||||
|
* call mg_read. We just need to split the query string into key-value
|
||||||
|
* pairs. */
|
||||||
|
data = conn->request_info.query_string;
|
||||||
|
if (!data) {
|
||||||
|
/* No query string. */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Split data in a=1&b=xy&c=3&c=4 ... */
|
||||||
|
while (*data) {
|
||||||
|
const char *val = strchr(data, '=');
|
||||||
|
const char *next;
|
||||||
|
ptrdiff_t keylen, vallen;
|
||||||
|
|
||||||
|
if (!val) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
keylen = val - data;
|
||||||
|
|
||||||
|
/* In every "field_found" callback we ask what to do with the
|
||||||
|
* data ("field_storage"). This could be:
|
||||||
|
* FORM_FIELD_STORAGE_SKIP (0) ... ignore the value of this field
|
||||||
|
* FORM_FIELD_STORAGE_GET (1) ... read the data and call the get
|
||||||
|
* callback function
|
||||||
|
* FORM_FIELD_STORAGE_STORE (2) ... store the data in a file
|
||||||
|
* FORM_FIELD_STORAGE_READ (3) ... let the user read the data
|
||||||
|
* (for parsing long data on the fly)
|
||||||
|
* (currently not implemented)
|
||||||
|
* FORM_FIELD_STORAGE_ABORT (flag) ... stop parsing
|
||||||
|
*/
|
||||||
|
memset(path, 0, sizeof(path));
|
||||||
|
field_count++;
|
||||||
|
field_storage = url_encoded_field_found(conn,
|
||||||
|
data,
|
||||||
|
(size_t)keylen,
|
||||||
|
NULL,
|
||||||
|
0,
|
||||||
|
path,
|
||||||
|
sizeof(path) - 1,
|
||||||
|
fdh);
|
||||||
|
|
||||||
|
val++;
|
||||||
|
next = strchr(val, '&');
|
||||||
|
if (next) {
|
||||||
|
vallen = next - val;
|
||||||
|
next++;
|
||||||
|
} else {
|
||||||
|
vallen = (ptrdiff_t)strlen(val);
|
||||||
|
next = val + vallen;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (field_storage == FORM_FIELD_STORAGE_GET) {
|
||||||
|
/* Call callback */
|
||||||
|
url_encoded_field_get(
|
||||||
|
conn, data, (size_t)keylen, val, (size_t)vallen, fdh);
|
||||||
|
}
|
||||||
|
if (field_storage == FORM_FIELD_STORAGE_STORE) {
|
||||||
|
/* Store the content to a file */
|
||||||
|
if (mg_fopen(conn, path, "wb", &fstore) == 0) {
|
||||||
|
fstore.fp = NULL;
|
||||||
|
}
|
||||||
|
file_size = 0;
|
||||||
|
if (fstore.fp != NULL) {
|
||||||
|
size_t n =
|
||||||
|
(size_t)fwrite(val, 1, (size_t)vallen, fstore.fp);
|
||||||
|
if ((n != (size_t)vallen) || (ferror(fstore.fp))) {
|
||||||
|
mg_cry(conn,
|
||||||
|
"%s: Cannot write file %s",
|
||||||
|
__func__,
|
||||||
|
path);
|
||||||
|
fclose(fstore.fp);
|
||||||
|
fstore.fp = NULL;
|
||||||
|
remove_bad_file(conn, path);
|
||||||
|
}
|
||||||
|
file_size += (int64_t)n;
|
||||||
|
|
||||||
|
if (fstore.fp) {
|
||||||
|
r = fclose(fstore.fp);
|
||||||
|
if (r == 0) {
|
||||||
|
/* stored successfully */
|
||||||
|
field_stored(conn, path, file_size, fdh);
|
||||||
|
} else {
|
||||||
|
mg_cry(conn,
|
||||||
|
"%s: Error saving file %s",
|
||||||
|
__func__,
|
||||||
|
path);
|
||||||
|
remove_bad_file(conn, path);
|
||||||
|
}
|
||||||
|
fstore.fp = NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
} else {
|
||||||
|
mg_cry(conn, "%s: Cannot create file %s", __func__, path);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* if (field_storage == FORM_FIELD_STORAGE_READ) { */
|
||||||
|
/* The idea of "field_storage=read" is to let the API user read
|
||||||
|
* data chunk by chunk and to some data processing on the fly.
|
||||||
|
* This should avoid the need to store data in the server:
|
||||||
|
* It should neither be stored in memory, like
|
||||||
|
* "field_storage=get" does, nor in a file like
|
||||||
|
* "field_storage=store".
|
||||||
|
* However, for a "GET" request this does not make any much
|
||||||
|
* sense, since the data is already stored in memory, as it is
|
||||||
|
* part of the query string.
|
||||||
|
*/
|
||||||
|
/* } */
|
||||||
|
|
||||||
|
if ((field_storage & FORM_FIELD_STORAGE_ABORT)
|
||||||
|
== FORM_FIELD_STORAGE_ABORT) {
|
||||||
|
/* Stop parsing the request */
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Proceed to next entry */
|
||||||
|
data = next;
|
||||||
|
}
|
||||||
|
|
||||||
|
return field_count;
|
||||||
|
}
|
||||||
|
|
||||||
|
content_type = mg_get_header(conn, "Content-Type");
|
||||||
|
|
||||||
|
if (!content_type
|
||||||
|
|| !mg_strcasecmp(content_type, "APPLICATION/X-WWW-FORM-URLENCODED")
|
||||||
|
|| !mg_strcasecmp(content_type, "APPLICATION/WWW-FORM-URLENCODED")) {
|
||||||
|
/* The form data is in the request body data, encoded in key/value
|
||||||
|
* pairs. */
|
||||||
|
int all_data_read = 0;
|
||||||
|
|
||||||
|
/* Read body data and split it in keys and values.
|
||||||
|
* The encoding is like in the "GET" case above: a=1&b&c=3&c=4.
|
||||||
|
* Here we use "POST", and read the data from the request body.
|
||||||
|
* The data read on the fly, so it is not required to buffer the
|
||||||
|
* entire request in memory before processing it. */
|
||||||
|
for (;;) {
|
||||||
|
const char *val;
|
||||||
|
const char *next;
|
||||||
|
ptrdiff_t keylen, vallen;
|
||||||
|
ptrdiff_t used;
|
||||||
|
int end_of_key_value_pair_found = 0;
|
||||||
|
int get_block;
|
||||||
|
|
||||||
|
if ((size_t)buf_fill < (sizeof(buf) - 1)) {
|
||||||
|
|
||||||
|
size_t to_read = sizeof(buf) - 1 - (size_t)buf_fill;
|
||||||
|
r = mg_read(conn, buf + (size_t)buf_fill, to_read);
|
||||||
|
if (r < 0) {
|
||||||
|
/* read error */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
if (r != (int)to_read) {
|
||||||
|
/* TODO: Create a function to get "all_data_read" from
|
||||||
|
* the conn object. All data is read if the Content-Length
|
||||||
|
* has been reached, or if chunked encoding is used and
|
||||||
|
* the end marker has been read, or if the connection has
|
||||||
|
* been closed. */
|
||||||
|
all_data_read = 1;
|
||||||
|
}
|
||||||
|
buf_fill += r;
|
||||||
|
buf[buf_fill] = 0;
|
||||||
|
if (buf_fill < 1) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
val = strchr(buf, '=');
|
||||||
|
|
||||||
|
if (!val) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
keylen = val - buf;
|
||||||
|
val++;
|
||||||
|
|
||||||
|
/* Call callback */
|
||||||
|
memset(path, 0, sizeof(path));
|
||||||
|
field_count++;
|
||||||
|
field_storage = url_encoded_field_found(conn,
|
||||||
|
buf,
|
||||||
|
(size_t)keylen,
|
||||||
|
NULL,
|
||||||
|
0,
|
||||||
|
path,
|
||||||
|
sizeof(path) - 1,
|
||||||
|
fdh);
|
||||||
|
|
||||||
|
if ((field_storage & FORM_FIELD_STORAGE_ABORT)
|
||||||
|
== FORM_FIELD_STORAGE_ABORT) {
|
||||||
|
/* Stop parsing the request */
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (field_storage == FORM_FIELD_STORAGE_STORE) {
|
||||||
|
if (mg_fopen(conn, path, "wb", &fstore) == 0) {
|
||||||
|
fstore.fp = NULL;
|
||||||
|
}
|
||||||
|
file_size = 0;
|
||||||
|
if (!fstore.fp) {
|
||||||
|
mg_cry(conn, "%s: Cannot create file %s", __func__, path);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
get_block = 0;
|
||||||
|
/* Loop to read values larger than sizeof(buf)-keylen-2 */
|
||||||
|
do {
|
||||||
|
next = strchr(val, '&');
|
||||||
|
if (next) {
|
||||||
|
vallen = next - val;
|
||||||
|
next++;
|
||||||
|
end_of_key_value_pair_found = 1;
|
||||||
|
} else {
|
||||||
|
vallen = (ptrdiff_t)strlen(val);
|
||||||
|
next = val + vallen;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (field_storage == FORM_FIELD_STORAGE_GET) {
|
||||||
|
#if 0
|
||||||
|
if (!end_of_key_value_pair_found && !all_data_read) {
|
||||||
|
/* This callback will deliver partial contents */
|
||||||
|
}
|
||||||
|
#else
|
||||||
|
(void)all_data_read; /* avoid warning */
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Call callback */
|
||||||
|
url_encoded_field_get(conn,
|
||||||
|
((get_block > 0) ? NULL : buf),
|
||||||
|
((get_block > 0) ? 0
|
||||||
|
: (size_t)keylen),
|
||||||
|
val,
|
||||||
|
(size_t)vallen,
|
||||||
|
fdh);
|
||||||
|
get_block++;
|
||||||
|
}
|
||||||
|
if (fstore.fp) {
|
||||||
|
size_t n =
|
||||||
|
(size_t)fwrite(val, 1, (size_t)vallen, fstore.fp);
|
||||||
|
if ((n != (size_t)vallen) || (ferror(fstore.fp))) {
|
||||||
|
mg_cry(conn,
|
||||||
|
"%s: Cannot write file %s",
|
||||||
|
__func__,
|
||||||
|
path);
|
||||||
|
fclose(fstore.fp);
|
||||||
|
fstore.fp = NULL;
|
||||||
|
remove_bad_file(conn, path);
|
||||||
|
}
|
||||||
|
file_size += (int64_t)n;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!end_of_key_value_pair_found) {
|
||||||
|
used = next - buf;
|
||||||
|
memmove(buf,
|
||||||
|
buf + (size_t)used,
|
||||||
|
sizeof(buf) - (size_t)used);
|
||||||
|
buf_fill -= (int)used;
|
||||||
|
if ((size_t)buf_fill < (sizeof(buf) - 1)) {
|
||||||
|
|
||||||
|
size_t to_read = sizeof(buf) - 1 - (size_t)buf_fill;
|
||||||
|
r = mg_read(conn, buf + (size_t)buf_fill, to_read);
|
||||||
|
if (r < 0) {
|
||||||
|
/* read error */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
if (r != (int)to_read) {
|
||||||
|
/* TODO: Create a function to get "all_data_read"
|
||||||
|
* from the conn object. All data is read if the
|
||||||
|
* Content-Length has been reached, or if chunked
|
||||||
|
* encoding is used and the end marker has been
|
||||||
|
* read, or if the connection has been closed. */
|
||||||
|
all_data_read = 1;
|
||||||
|
}
|
||||||
|
buf_fill += r;
|
||||||
|
buf[buf_fill] = 0;
|
||||||
|
if (buf_fill < 1) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
val = buf;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
} while (!end_of_key_value_pair_found);
|
||||||
|
|
||||||
|
if (fstore.fp) {
|
||||||
|
r = fclose(fstore.fp);
|
||||||
|
if (r == 0) {
|
||||||
|
/* stored successfully */
|
||||||
|
field_stored(conn, path, file_size, fdh);
|
||||||
|
} else {
|
||||||
|
mg_cry(conn, "%s: Error saving file %s", __func__, path);
|
||||||
|
remove_bad_file(conn, path);
|
||||||
|
}
|
||||||
|
fstore.fp = NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Proceed to next entry */
|
||||||
|
used = next - buf;
|
||||||
|
memmove(buf, buf + (size_t)used, sizeof(buf) - (size_t)used);
|
||||||
|
buf_fill -= (int)used;
|
||||||
|
}
|
||||||
|
|
||||||
|
return field_count;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!mg_strncasecmp(content_type, "MULTIPART/FORM-DATA;", 20)) {
|
||||||
|
/* The form data is in the request body data, encoded as multipart
|
||||||
|
* content (see https://www.ietf.org/rfc/rfc1867.txt,
|
||||||
|
* https://www.ietf.org/rfc/rfc2388.txt). */
|
||||||
|
const char *boundary;
|
||||||
|
size_t bl;
|
||||||
|
ptrdiff_t used;
|
||||||
|
struct mg_request_info part_header;
|
||||||
|
char *hbuf, *hend, *fbeg, *fend, *nbeg, *nend;
|
||||||
|
const char *content_disp;
|
||||||
|
const char *next;
|
||||||
|
|
||||||
|
memset(&part_header, 0, sizeof(part_header));
|
||||||
|
|
||||||
|
/* Skip all spaces between MULTIPART/FORM-DATA; and BOUNDARY= */
|
||||||
|
bl = 20;
|
||||||
|
while (content_type[bl] == ' ') {
|
||||||
|
bl++;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* There has to be a BOUNDARY definition in the Content-Type header */
|
||||||
|
if (mg_strncasecmp(content_type + bl, "BOUNDARY=", 9)) {
|
||||||
|
/* Malformed request */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
boundary = content_type + bl + 9;
|
||||||
|
bl = strlen(boundary);
|
||||||
|
|
||||||
|
if (bl + 800 > sizeof(buf)) {
|
||||||
|
/* Sanity check: The algorithm can not work if bl >= sizeof(buf),
|
||||||
|
* and it will not work effectively, if the buf is only a few byte
|
||||||
|
* larger than bl, or it buf can not hold the multipart header
|
||||||
|
* plus the boundary.
|
||||||
|
* Check some reasonable number here, that should be fulfilled by
|
||||||
|
* any reasonable request from every browser. If it is not
|
||||||
|
* fulfilled, it might be a hand-made request, intended to
|
||||||
|
* interfere with the algorithm. */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (;;) {
|
||||||
|
size_t towrite, n;
|
||||||
|
int get_block;
|
||||||
|
|
||||||
|
r = mg_read(conn,
|
||||||
|
buf + (size_t)buf_fill,
|
||||||
|
sizeof(buf) - 1 - (size_t)buf_fill);
|
||||||
|
if (r < 0) {
|
||||||
|
/* read error */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
buf_fill += r;
|
||||||
|
buf[buf_fill] = 0;
|
||||||
|
if (buf_fill < 1) {
|
||||||
|
/* No data */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (buf[0] != '-' || buf[1] != '-') {
|
||||||
|
/* Malformed request */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
if (strncmp(buf + 2, boundary, bl)) {
|
||||||
|
/* Malformed request */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
if (buf[bl + 2] != '\r' || buf[bl + 3] != '\n') {
|
||||||
|
/* Every part must end with \r\n, if there is another part.
|
||||||
|
* The end of the request has an extra -- */
|
||||||
|
if (((size_t)buf_fill != (size_t)(bl + 6))
|
||||||
|
|| (strncmp(buf + bl + 2, "--\r\n", 4))) {
|
||||||
|
/* Malformed request */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
/* End of the request */
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Next, we need to get the part header: Read until \r\n\r\n */
|
||||||
|
hbuf = buf + bl + 4;
|
||||||
|
hend = strstr(hbuf, "\r\n\r\n");
|
||||||
|
if (!hend) {
|
||||||
|
/* Malformed request */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
parse_http_headers(&hbuf, &part_header);
|
||||||
|
if ((hend + 2) != hbuf) {
|
||||||
|
/* Malformed request */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Skip \r\n\r\n */
|
||||||
|
hend += 4;
|
||||||
|
|
||||||
|
/* According to the RFC, every part has to have a header field like:
|
||||||
|
* Content-Disposition: form-data; name="..." */
|
||||||
|
content_disp = get_header(&part_header, "Content-Disposition");
|
||||||
|
if (!content_disp) {
|
||||||
|
/* Malformed request */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Get the mandatory name="..." part of the Content-Disposition
|
||||||
|
* header. */
|
||||||
|
nbeg = strstr(content_disp, "name=\"");
|
||||||
|
if (!nbeg) {
|
||||||
|
/* Malformed request */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
nbeg += 6;
|
||||||
|
nend = strchr(nbeg, '\"');
|
||||||
|
if (!nend) {
|
||||||
|
/* Malformed request */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Get the optional filename="..." part of the Content-Disposition
|
||||||
|
* header. */
|
||||||
|
fbeg = strstr(content_disp, "filename=\"");
|
||||||
|
if (fbeg) {
|
||||||
|
fbeg += 10;
|
||||||
|
fend = strchr(fbeg, '\"');
|
||||||
|
if (!fend) {
|
||||||
|
/* Malformed request (the filename field is optional, but if
|
||||||
|
* it exists, it needs to be terminated correctly). */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* TODO: check Content-Type */
|
||||||
|
/* Content-Type: application/octet-stream */
|
||||||
|
|
||||||
|
} else {
|
||||||
|
fend = fbeg;
|
||||||
|
}
|
||||||
|
|
||||||
|
memset(path, 0, sizeof(path));
|
||||||
|
field_count++;
|
||||||
|
field_storage = url_encoded_field_found(conn,
|
||||||
|
nbeg,
|
||||||
|
(size_t)(nend - nbeg),
|
||||||
|
fbeg,
|
||||||
|
(size_t)(fend - fbeg),
|
||||||
|
path,
|
||||||
|
sizeof(path) - 1,
|
||||||
|
fdh);
|
||||||
|
|
||||||
|
/* If the boundary is already in the buffer, get the address,
|
||||||
|
* otherwise next will be NULL. */
|
||||||
|
next = search_boundary(hbuf,
|
||||||
|
(size_t)((buf - hbuf) + buf_fill),
|
||||||
|
boundary,
|
||||||
|
bl);
|
||||||
|
|
||||||
|
if (field_storage == FORM_FIELD_STORAGE_STORE) {
|
||||||
|
/* Store the content to a file */
|
||||||
|
if (mg_fopen(conn, path, "wb", &fstore) == 0) {
|
||||||
|
fstore.fp = NULL;
|
||||||
|
}
|
||||||
|
file_size = 0;
|
||||||
|
|
||||||
|
if (!fstore.fp) {
|
||||||
|
mg_cry(conn, "%s: Cannot create file %s", __func__, path);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
get_block = 0;
|
||||||
|
while (!next) {
|
||||||
|
/* Set "towrite" to the number of bytes available
|
||||||
|
* in the buffer */
|
||||||
|
towrite = (size_t)(buf - hend + buf_fill);
|
||||||
|
/* Subtract the boundary length, to deal with
|
||||||
|
* cases the boundary is only partially stored
|
||||||
|
* in the buffer. */
|
||||||
|
towrite -= bl + 4;
|
||||||
|
|
||||||
|
if (field_storage == FORM_FIELD_STORAGE_GET) {
|
||||||
|
url_encoded_field_get(conn,
|
||||||
|
((get_block > 0) ? NULL : nbeg),
|
||||||
|
((get_block > 0)
|
||||||
|
? 0
|
||||||
|
: (size_t)(nend - nbeg)),
|
||||||
|
hend,
|
||||||
|
towrite,
|
||||||
|
fdh);
|
||||||
|
get_block++;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (field_storage == FORM_FIELD_STORAGE_STORE) {
|
||||||
|
if (fstore.fp) {
|
||||||
|
|
||||||
|
/* Store the content of the buffer. */
|
||||||
|
n = (size_t)fwrite(hend, 1, towrite, fstore.fp);
|
||||||
|
if ((n != towrite) || (ferror(fstore.fp))) {
|
||||||
|
mg_cry(conn,
|
||||||
|
"%s: Cannot write file %s",
|
||||||
|
__func__,
|
||||||
|
path);
|
||||||
|
fclose(fstore.fp);
|
||||||
|
fstore.fp = NULL;
|
||||||
|
remove_bad_file(conn, path);
|
||||||
|
}
|
||||||
|
file_size += (int64_t)n;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
memmove(buf, hend + towrite, bl + 4);
|
||||||
|
buf_fill = (int)(bl + 4);
|
||||||
|
hend = buf;
|
||||||
|
|
||||||
|
/* Read new data */
|
||||||
|
r = mg_read(conn,
|
||||||
|
buf + (size_t)buf_fill,
|
||||||
|
sizeof(buf) - 1 - (size_t)buf_fill);
|
||||||
|
if (r < 0) {
|
||||||
|
/* read error */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
buf_fill += r;
|
||||||
|
buf[buf_fill] = 0;
|
||||||
|
if (buf_fill < 1) {
|
||||||
|
/* No data */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Find boundary */
|
||||||
|
next = search_boundary(buf, (size_t)buf_fill, boundary, bl);
|
||||||
|
}
|
||||||
|
|
||||||
|
towrite = (size_t)(next - hend);
|
||||||
|
|
||||||
|
if (field_storage == FORM_FIELD_STORAGE_GET) {
|
||||||
|
/* Call callback */
|
||||||
|
url_encoded_field_get(conn,
|
||||||
|
((get_block > 0) ? NULL : nbeg),
|
||||||
|
((get_block > 0) ? 0
|
||||||
|
: (size_t)(nend - nbeg)),
|
||||||
|
hend,
|
||||||
|
towrite,
|
||||||
|
fdh);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (field_storage == FORM_FIELD_STORAGE_STORE) {
|
||||||
|
|
||||||
|
if (fstore.fp) {
|
||||||
|
n = (size_t)fwrite(hend, 1, towrite, fstore.fp);
|
||||||
|
if ((n != towrite) || (ferror(fstore.fp))) {
|
||||||
|
mg_cry(conn,
|
||||||
|
"%s: Cannot write file %s",
|
||||||
|
__func__,
|
||||||
|
path);
|
||||||
|
fclose(fstore.fp);
|
||||||
|
fstore.fp = NULL;
|
||||||
|
remove_bad_file(conn, path);
|
||||||
|
}
|
||||||
|
file_size += (int64_t)n;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (field_storage == FORM_FIELD_STORAGE_STORE) {
|
||||||
|
|
||||||
|
if (fstore.fp) {
|
||||||
|
r = fclose(fstore.fp);
|
||||||
|
if (r == 0) {
|
||||||
|
/* stored successfully */
|
||||||
|
field_stored(conn, path, file_size, fdh);
|
||||||
|
} else {
|
||||||
|
mg_cry(conn,
|
||||||
|
"%s: Error saving file %s",
|
||||||
|
__func__,
|
||||||
|
path);
|
||||||
|
remove_bad_file(conn, path);
|
||||||
|
}
|
||||||
|
fstore.fp = NULL;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if ((field_storage & FORM_FIELD_STORAGE_ABORT)
|
||||||
|
== FORM_FIELD_STORAGE_ABORT) {
|
||||||
|
/* Stop parsing the request */
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Remove from the buffer */
|
||||||
|
used = next - buf + 2;
|
||||||
|
memmove(buf, buf + (size_t)used, sizeof(buf) - (size_t)used);
|
||||||
|
buf_fill -= (int)used;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* All parts handled */
|
||||||
|
return field_count;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Unknown Content-Type */
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,468 @@
|
||||||
|
/*
|
||||||
|
* This an amalgamation of md5.c and md5.h into a single file
|
||||||
|
* with all static declaration to reduce linker conflicts
|
||||||
|
* in Civetweb.
|
||||||
|
*
|
||||||
|
* The MD5_STATIC declaration was added to facilitate static
|
||||||
|
* inclusion.
|
||||||
|
* No Face Press, LLC
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* $Id: md5.h,v 1.4 2002/04/13 19:20:28 lpd Exp $ */
|
||||||
|
/*
|
||||||
|
Independent implementation of MD5 (RFC 1321).
|
||||||
|
|
||||||
|
This code implements the MD5 Algorithm defined in RFC 1321, whose
|
||||||
|
text is available at
|
||||||
|
http://www.ietf.org/rfc/rfc1321.txt
|
||||||
|
The code is derived from the text of the RFC, including the test suite
|
||||||
|
(section A.5) but excluding the rest of Appendix A. It does not include
|
||||||
|
any code or documentation that is identified in the RFC as being
|
||||||
|
copyrighted.
|
||||||
|
|
||||||
|
The original and principal author of md5.h is L. Peter Deutsch
|
||||||
|
<ghost@aladdin.com>. Other authors are noted in the change history
|
||||||
|
that follows (in reverse chronological order):
|
||||||
|
|
||||||
|
2002-04-13 lpd Removed support for non-ANSI compilers; removed
|
||||||
|
references to Ghostscript; clarified derivation from RFC 1321;
|
||||||
|
now handles byte order either statically or dynamically.
|
||||||
|
1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
|
||||||
|
1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5);
|
||||||
|
added conditionalization for C++ compilation from Martin
|
||||||
|
Purschke <purschke@bnl.gov>.
|
||||||
|
1999-05-03 lpd Original version.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef md5_INCLUDED
|
||||||
|
#define md5_INCLUDED
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This package supports both compile-time and run-time determination of CPU
|
||||||
|
* byte order. If ARCH_IS_BIG_ENDIAN is defined as 0, the code will be
|
||||||
|
* compiled to run only on little-endian CPUs; if ARCH_IS_BIG_ENDIAN is
|
||||||
|
* defined as non-zero, the code will be compiled to run only on big-endian
|
||||||
|
* CPUs; if ARCH_IS_BIG_ENDIAN is not defined, the code will be compiled to
|
||||||
|
* run on either big- or little-endian CPUs, but will run slightly less
|
||||||
|
* efficiently on either one than if ARCH_IS_BIG_ENDIAN is defined.
|
||||||
|
*/
|
||||||
|
|
||||||
|
typedef unsigned char md5_byte_t; /* 8-bit byte */
|
||||||
|
typedef unsigned int md5_word_t; /* 32-bit word */
|
||||||
|
|
||||||
|
/* Define the state of the MD5 Algorithm. */
|
||||||
|
typedef struct md5_state_s {
|
||||||
|
md5_word_t count[2]; /* message length in bits, lsw first */
|
||||||
|
md5_word_t abcd[4]; /* digest buffer */
|
||||||
|
md5_byte_t buf[64]; /* accumulate block */
|
||||||
|
} md5_state_t;
|
||||||
|
|
||||||
|
#ifdef __cplusplus
|
||||||
|
extern "C" {
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Initialize the algorithm. */
|
||||||
|
MD5_STATIC void md5_init(md5_state_t *pms);
|
||||||
|
|
||||||
|
/* Append a string to the message. */
|
||||||
|
MD5_STATIC void
|
||||||
|
md5_append(md5_state_t *pms, const md5_byte_t *data, size_t nbytes);
|
||||||
|
|
||||||
|
/* Finish the message and return the digest. */
|
||||||
|
MD5_STATIC void md5_finish(md5_state_t *pms, md5_byte_t digest[16]);
|
||||||
|
|
||||||
|
#ifdef __cplusplus
|
||||||
|
} /* end extern "C" */
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#endif /* md5_INCLUDED */
|
||||||
|
|
||||||
|
/*
|
||||||
|
Copyright (C) 1999, 2000, 2002 Aladdin Enterprises. All rights reserved.
|
||||||
|
|
||||||
|
This software is provided 'as-is', without any express or implied
|
||||||
|
warranty. In no event will the authors be held liable for any damages
|
||||||
|
arising from the use of this software.
|
||||||
|
|
||||||
|
Permission is granted to anyone to use this software for any purpose,
|
||||||
|
including commercial applications, and to alter it and redistribute it
|
||||||
|
freely, subject to the following restrictions:
|
||||||
|
|
||||||
|
1. The origin of this software must not be misrepresented; you must not
|
||||||
|
claim that you wrote the original software. If you use this software
|
||||||
|
in a product, an acknowledgment in the product documentation would be
|
||||||
|
appreciated but is not required.
|
||||||
|
2. Altered source versions must be plainly marked as such, and must not be
|
||||||
|
misrepresented as being the original software.
|
||||||
|
3. This notice may not be removed or altered from any source distribution.
|
||||||
|
|
||||||
|
L. Peter Deutsch
|
||||||
|
ghost@aladdin.com
|
||||||
|
|
||||||
|
*/
|
||||||
|
/* $Id: md5.c,v 1.6 2002/04/13 19:20:28 lpd Exp $ */
|
||||||
|
/*
|
||||||
|
Independent implementation of MD5 (RFC 1321).
|
||||||
|
|
||||||
|
This code implements the MD5 Algorithm defined in RFC 1321, whose
|
||||||
|
text is available at
|
||||||
|
http://www.ietf.org/rfc/rfc1321.txt
|
||||||
|
The code is derived from the text of the RFC, including the test suite
|
||||||
|
(section A.5) but excluding the rest of Appendix A. It does not include
|
||||||
|
any code or documentation that is identified in the RFC as being
|
||||||
|
copyrighted.
|
||||||
|
|
||||||
|
The original and principal author of md5.c is L. Peter Deutsch
|
||||||
|
<ghost@aladdin.com>. Other authors are noted in the change history
|
||||||
|
that follows (in reverse chronological order):
|
||||||
|
|
||||||
|
2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order
|
||||||
|
either statically or dynamically; added missing #include <string.h>
|
||||||
|
in library.
|
||||||
|
2002-03-11 lpd Corrected argument list for main(), and added int return
|
||||||
|
type, in test program and T value program.
|
||||||
|
2002-02-21 lpd Added missing #include <stdio.h> in test program.
|
||||||
|
2000-07-03 lpd Patched to eliminate warnings about "constant is
|
||||||
|
unsigned in ANSI C, signed in traditional"; made test program
|
||||||
|
self-checking.
|
||||||
|
1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
|
||||||
|
1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
|
||||||
|
1999-05-03 lpd Original version.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef MD5_STATIC
|
||||||
|
#include <string.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#undef BYTE_ORDER /* 1 = big-endian, -1 = little-endian, 0 = unknown */
|
||||||
|
#ifdef ARCH_IS_BIG_ENDIAN
|
||||||
|
#define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1)
|
||||||
|
#else
|
||||||
|
#define BYTE_ORDER (0)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define T_MASK ((md5_word_t)~0)
|
||||||
|
#define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
|
||||||
|
#define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
|
||||||
|
#define T3 (0x242070db)
|
||||||
|
#define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
|
||||||
|
#define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
|
||||||
|
#define T6 (0x4787c62a)
|
||||||
|
#define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
|
||||||
|
#define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
|
||||||
|
#define T9 (0x698098d8)
|
||||||
|
#define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
|
||||||
|
#define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
|
||||||
|
#define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
|
||||||
|
#define T13 (0x6b901122)
|
||||||
|
#define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
|
||||||
|
#define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
|
||||||
|
#define T16 (0x49b40821)
|
||||||
|
#define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
|
||||||
|
#define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
|
||||||
|
#define T19 (0x265e5a51)
|
||||||
|
#define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
|
||||||
|
#define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
|
||||||
|
#define T22 (0x02441453)
|
||||||
|
#define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
|
||||||
|
#define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
|
||||||
|
#define T25 (0x21e1cde6)
|
||||||
|
#define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
|
||||||
|
#define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
|
||||||
|
#define T28 (0x455a14ed)
|
||||||
|
#define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
|
||||||
|
#define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
|
||||||
|
#define T31 (0x676f02d9)
|
||||||
|
#define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
|
||||||
|
#define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
|
||||||
|
#define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
|
||||||
|
#define T35 (0x6d9d6122)
|
||||||
|
#define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
|
||||||
|
#define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
|
||||||
|
#define T38 (0x4bdecfa9)
|
||||||
|
#define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
|
||||||
|
#define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
|
||||||
|
#define T41 (0x289b7ec6)
|
||||||
|
#define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
|
||||||
|
#define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
|
||||||
|
#define T44 (0x04881d05)
|
||||||
|
#define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
|
||||||
|
#define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
|
||||||
|
#define T47 (0x1fa27cf8)
|
||||||
|
#define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
|
||||||
|
#define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
|
||||||
|
#define T50 (0x432aff97)
|
||||||
|
#define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
|
||||||
|
#define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
|
||||||
|
#define T53 (0x655b59c3)
|
||||||
|
#define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
|
||||||
|
#define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
|
||||||
|
#define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
|
||||||
|
#define T57 (0x6fa87e4f)
|
||||||
|
#define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
|
||||||
|
#define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
|
||||||
|
#define T60 (0x4e0811a1)
|
||||||
|
#define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
|
||||||
|
#define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
|
||||||
|
#define T63 (0x2ad7d2bb)
|
||||||
|
#define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
|
||||||
|
|
||||||
|
static void
|
||||||
|
md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/)
|
||||||
|
{
|
||||||
|
md5_word_t a = pms->abcd[0], b = pms->abcd[1], c = pms->abcd[2],
|
||||||
|
d = pms->abcd[3];
|
||||||
|
md5_word_t t;
|
||||||
|
#if BYTE_ORDER > 0
|
||||||
|
/* Define storage only for big-endian CPUs. */
|
||||||
|
md5_word_t X[16];
|
||||||
|
#else
|
||||||
|
/* Define storage for little-endian or both types of CPUs. */
|
||||||
|
md5_word_t xbuf[16];
|
||||||
|
const md5_word_t *X;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
{
|
||||||
|
#if BYTE_ORDER == 0
|
||||||
|
/*
|
||||||
|
* Determine dynamically whether this is a big-endian or
|
||||||
|
* little-endian machine, since we can use a more efficient
|
||||||
|
* algorithm on the latter.
|
||||||
|
*/
|
||||||
|
static const int w = 1;
|
||||||
|
|
||||||
|
if (*((const md5_byte_t *)&w)) /* dynamic little-endian */
|
||||||
|
#endif
|
||||||
|
#if BYTE_ORDER <= 0 /* little-endian */
|
||||||
|
{
|
||||||
|
/*
|
||||||
|
* On little-endian machines, we can process properly aligned
|
||||||
|
* data without copying it.
|
||||||
|
*/
|
||||||
|
if (!((data - (const md5_byte_t *)0) & 3)) {
|
||||||
|
/* data are properly aligned, a direct assignment is possible */
|
||||||
|
/* cast through a (void *) should avoid a compiler warning,
|
||||||
|
see
|
||||||
|
https://github.com/bel2125/civetweb/issues/94#issuecomment-98112861
|
||||||
|
*/
|
||||||
|
X = (const md5_word_t *)(const void *)data;
|
||||||
|
} else {
|
||||||
|
/* not aligned */
|
||||||
|
memcpy(xbuf, data, 64);
|
||||||
|
X = xbuf;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
#if BYTE_ORDER == 0
|
||||||
|
else /* dynamic big-endian */
|
||||||
|
#endif
|
||||||
|
#if BYTE_ORDER >= 0 /* big-endian */
|
||||||
|
{
|
||||||
|
/*
|
||||||
|
* On big-endian machines, we must arrange the bytes in the
|
||||||
|
* right order.
|
||||||
|
*/
|
||||||
|
const md5_byte_t *xp = data;
|
||||||
|
int i;
|
||||||
|
|
||||||
|
#if BYTE_ORDER == 0
|
||||||
|
X = xbuf; /* (dynamic only) */
|
||||||
|
#else
|
||||||
|
#define xbuf X /* (static only) */
|
||||||
|
#endif
|
||||||
|
for (i = 0; i < 16; ++i, xp += 4)
|
||||||
|
xbuf[i] = (md5_word_t)(xp[0]) + (md5_word_t)(xp[1] << 8)
|
||||||
|
+ (md5_word_t)(xp[2] << 16)
|
||||||
|
+ (md5_word_t)(xp[3] << 24);
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
|
||||||
|
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
|
||||||
|
|
||||||
|
/* Round 1. */
|
||||||
|
/* Let [abcd k s i] denote the operation
|
||||||
|
a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
|
||||||
|
#define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
|
||||||
|
#define SET(a, b, c, d, k, s, Ti) \
|
||||||
|
t = a + F(b, c, d) + X[k] + Ti; \
|
||||||
|
a = ROTATE_LEFT(t, s) + b
|
||||||
|
|
||||||
|
/* Do the following 16 operations. */
|
||||||
|
SET(a, b, c, d, 0, 7, T1);
|
||||||
|
SET(d, a, b, c, 1, 12, T2);
|
||||||
|
SET(c, d, a, b, 2, 17, T3);
|
||||||
|
SET(b, c, d, a, 3, 22, T4);
|
||||||
|
SET(a, b, c, d, 4, 7, T5);
|
||||||
|
SET(d, a, b, c, 5, 12, T6);
|
||||||
|
SET(c, d, a, b, 6, 17, T7);
|
||||||
|
SET(b, c, d, a, 7, 22, T8);
|
||||||
|
SET(a, b, c, d, 8, 7, T9);
|
||||||
|
SET(d, a, b, c, 9, 12, T10);
|
||||||
|
SET(c, d, a, b, 10, 17, T11);
|
||||||
|
SET(b, c, d, a, 11, 22, T12);
|
||||||
|
SET(a, b, c, d, 12, 7, T13);
|
||||||
|
SET(d, a, b, c, 13, 12, T14);
|
||||||
|
SET(c, d, a, b, 14, 17, T15);
|
||||||
|
SET(b, c, d, a, 15, 22, T16);
|
||||||
|
#undef SET
|
||||||
|
|
||||||
|
/* Round 2. */
|
||||||
|
/* Let [abcd k s i] denote the operation
|
||||||
|
a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
|
||||||
|
#define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
|
||||||
|
#define SET(a, b, c, d, k, s, Ti) \
|
||||||
|
t = a + G(b, c, d) + X[k] + Ti; \
|
||||||
|
a = ROTATE_LEFT(t, s) + b
|
||||||
|
|
||||||
|
/* Do the following 16 operations. */
|
||||||
|
SET(a, b, c, d, 1, 5, T17);
|
||||||
|
SET(d, a, b, c, 6, 9, T18);
|
||||||
|
SET(c, d, a, b, 11, 14, T19);
|
||||||
|
SET(b, c, d, a, 0, 20, T20);
|
||||||
|
SET(a, b, c, d, 5, 5, T21);
|
||||||
|
SET(d, a, b, c, 10, 9, T22);
|
||||||
|
SET(c, d, a, b, 15, 14, T23);
|
||||||
|
SET(b, c, d, a, 4, 20, T24);
|
||||||
|
SET(a, b, c, d, 9, 5, T25);
|
||||||
|
SET(d, a, b, c, 14, 9, T26);
|
||||||
|
SET(c, d, a, b, 3, 14, T27);
|
||||||
|
SET(b, c, d, a, 8, 20, T28);
|
||||||
|
SET(a, b, c, d, 13, 5, T29);
|
||||||
|
SET(d, a, b, c, 2, 9, T30);
|
||||||
|
SET(c, d, a, b, 7, 14, T31);
|
||||||
|
SET(b, c, d, a, 12, 20, T32);
|
||||||
|
#undef SET
|
||||||
|
|
||||||
|
/* Round 3. */
|
||||||
|
/* Let [abcd k s t] denote the operation
|
||||||
|
a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
|
||||||
|
#define H(x, y, z) ((x) ^ (y) ^ (z))
|
||||||
|
#define SET(a, b, c, d, k, s, Ti) \
|
||||||
|
t = a + H(b, c, d) + X[k] + Ti; \
|
||||||
|
a = ROTATE_LEFT(t, s) + b
|
||||||
|
|
||||||
|
/* Do the following 16 operations. */
|
||||||
|
SET(a, b, c, d, 5, 4, T33);
|
||||||
|
SET(d, a, b, c, 8, 11, T34);
|
||||||
|
SET(c, d, a, b, 11, 16, T35);
|
||||||
|
SET(b, c, d, a, 14, 23, T36);
|
||||||
|
SET(a, b, c, d, 1, 4, T37);
|
||||||
|
SET(d, a, b, c, 4, 11, T38);
|
||||||
|
SET(c, d, a, b, 7, 16, T39);
|
||||||
|
SET(b, c, d, a, 10, 23, T40);
|
||||||
|
SET(a, b, c, d, 13, 4, T41);
|
||||||
|
SET(d, a, b, c, 0, 11, T42);
|
||||||
|
SET(c, d, a, b, 3, 16, T43);
|
||||||
|
SET(b, c, d, a, 6, 23, T44);
|
||||||
|
SET(a, b, c, d, 9, 4, T45);
|
||||||
|
SET(d, a, b, c, 12, 11, T46);
|
||||||
|
SET(c, d, a, b, 15, 16, T47);
|
||||||
|
SET(b, c, d, a, 2, 23, T48);
|
||||||
|
#undef SET
|
||||||
|
|
||||||
|
/* Round 4. */
|
||||||
|
/* Let [abcd k s t] denote the operation
|
||||||
|
a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
|
||||||
|
#define I(x, y, z) ((y) ^ ((x) | ~(z)))
|
||||||
|
#define SET(a, b, c, d, k, s, Ti) \
|
||||||
|
t = a + I(b, c, d) + X[k] + Ti; \
|
||||||
|
a = ROTATE_LEFT(t, s) + b
|
||||||
|
|
||||||
|
/* Do the following 16 operations. */
|
||||||
|
SET(a, b, c, d, 0, 6, T49);
|
||||||
|
SET(d, a, b, c, 7, 10, T50);
|
||||||
|
SET(c, d, a, b, 14, 15, T51);
|
||||||
|
SET(b, c, d, a, 5, 21, T52);
|
||||||
|
SET(a, b, c, d, 12, 6, T53);
|
||||||
|
SET(d, a, b, c, 3, 10, T54);
|
||||||
|
SET(c, d, a, b, 10, 15, T55);
|
||||||
|
SET(b, c, d, a, 1, 21, T56);
|
||||||
|
SET(a, b, c, d, 8, 6, T57);
|
||||||
|
SET(d, a, b, c, 15, 10, T58);
|
||||||
|
SET(c, d, a, b, 6, 15, T59);
|
||||||
|
SET(b, c, d, a, 13, 21, T60);
|
||||||
|
SET(a, b, c, d, 4, 6, T61);
|
||||||
|
SET(d, a, b, c, 11, 10, T62);
|
||||||
|
SET(c, d, a, b, 2, 15, T63);
|
||||||
|
SET(b, c, d, a, 9, 21, T64);
|
||||||
|
#undef SET
|
||||||
|
|
||||||
|
/* Then perform the following additions. (That is increment each
|
||||||
|
of the four registers by the value it had before this block
|
||||||
|
was started.) */
|
||||||
|
pms->abcd[0] += a;
|
||||||
|
pms->abcd[1] += b;
|
||||||
|
pms->abcd[2] += c;
|
||||||
|
pms->abcd[3] += d;
|
||||||
|
}
|
||||||
|
|
||||||
|
MD5_STATIC void
|
||||||
|
md5_init(md5_state_t *pms)
|
||||||
|
{
|
||||||
|
pms->count[0] = pms->count[1] = 0;
|
||||||
|
pms->abcd[0] = 0x67452301;
|
||||||
|
pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
|
||||||
|
pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
|
||||||
|
pms->abcd[3] = 0x10325476;
|
||||||
|
}
|
||||||
|
|
||||||
|
MD5_STATIC void
|
||||||
|
md5_append(md5_state_t *pms, const md5_byte_t *data, size_t nbytes)
|
||||||
|
{
|
||||||
|
const md5_byte_t *p = data;
|
||||||
|
size_t left = nbytes;
|
||||||
|
size_t offset = (pms->count[0] >> 3) & 63;
|
||||||
|
md5_word_t nbits = (md5_word_t)(nbytes << 3);
|
||||||
|
|
||||||
|
if (nbytes <= 0)
|
||||||
|
return;
|
||||||
|
|
||||||
|
/* Update the message length. */
|
||||||
|
pms->count[1] += (md5_word_t)(nbytes >> 29);
|
||||||
|
pms->count[0] += nbits;
|
||||||
|
if (pms->count[0] < nbits)
|
||||||
|
pms->count[1]++;
|
||||||
|
|
||||||
|
/* Process an initial partial block. */
|
||||||
|
if (offset) {
|
||||||
|
size_t copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
|
||||||
|
|
||||||
|
memcpy(pms->buf + offset, p, copy);
|
||||||
|
if (offset + copy < 64)
|
||||||
|
return;
|
||||||
|
p += copy;
|
||||||
|
left -= copy;
|
||||||
|
md5_process(pms, pms->buf);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Process full blocks. */
|
||||||
|
for (; left >= 64; p += 64, left -= 64)
|
||||||
|
md5_process(pms, p);
|
||||||
|
|
||||||
|
/* Process a final partial block. */
|
||||||
|
if (left)
|
||||||
|
memcpy(pms->buf, p, left);
|
||||||
|
}
|
||||||
|
|
||||||
|
MD5_STATIC void
|
||||||
|
md5_finish(md5_state_t *pms, md5_byte_t digest[16])
|
||||||
|
{
|
||||||
|
static const md5_byte_t pad[64] = {0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||||
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||||
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||||
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||||
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
|
||||||
|
md5_byte_t data[8];
|
||||||
|
int i;
|
||||||
|
|
||||||
|
/* Save the length before padding. */
|
||||||
|
for (i = 0; i < 8; ++i)
|
||||||
|
data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));
|
||||||
|
/* Pad to 56 bytes mod 64. */
|
||||||
|
md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
|
||||||
|
/* Append the length. */
|
||||||
|
md5_append(pms, data, 8);
|
||||||
|
for (i = 0; i < 16; ++i)
|
||||||
|
digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,250 @@
|
||||||
|
/* This file is part of the CivetWeb web server.
|
||||||
|
* See https://github.com/civetweb/civetweb/
|
||||||
|
* (C) 2015 by the CivetWeb authors, MIT license.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "duktape.h"
|
||||||
|
|
||||||
|
/* TODO: the mg context should be added to duktape as well */
|
||||||
|
/* Alternative: redefine a new, clean API from scratch (instead of using mg),
|
||||||
|
* or at least do not add problematic functions. */
|
||||||
|
/* For evaluation purposes, currently only "send" is supported.
|
||||||
|
* All other ~50 functions will be added later. */
|
||||||
|
|
||||||
|
/* Note: This is only experimental support, so the API may still change. */
|
||||||
|
|
||||||
|
static const char *civetweb_conn_id = "\xFF"
|
||||||
|
"civetweb_conn";
|
||||||
|
static const char *civetweb_ctx_id = "\xFF"
|
||||||
|
"civetweb_ctx";
|
||||||
|
|
||||||
|
|
||||||
|
static void *
|
||||||
|
mg_duk_mem_alloc(void *udata, duk_size_t size)
|
||||||
|
{
|
||||||
|
return mg_malloc(size);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static void *
|
||||||
|
mg_duk_mem_realloc(void *udata, void *ptr, duk_size_t newsize)
|
||||||
|
{
|
||||||
|
return mg_realloc(ptr, newsize);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static void
|
||||||
|
mg_duk_mem_free(void *udata, void *ptr)
|
||||||
|
{
|
||||||
|
mg_free(ptr);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static void
|
||||||
|
mg_duk_fatal_handler(duk_context *ctx, duk_errcode_t code, const char *msg)
|
||||||
|
{
|
||||||
|
/* Script is called "protected" (duk_peval_file), so script errors should
|
||||||
|
* never yield in a call to this function. Maybe calls prior to executing
|
||||||
|
* the script could raise a fatal error. */
|
||||||
|
struct mg_connection *conn;
|
||||||
|
|
||||||
|
duk_push_global_stash(ctx);
|
||||||
|
duk_get_prop_string(ctx, -1, civetweb_conn_id);
|
||||||
|
conn = (struct mg_connection *)duk_to_pointer(ctx, -1);
|
||||||
|
|
||||||
|
mg_cry(conn, "%s", msg);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static duk_ret_t
|
||||||
|
duk_itf_write(duk_context *ctx)
|
||||||
|
{
|
||||||
|
struct mg_connection *conn;
|
||||||
|
duk_double_t ret;
|
||||||
|
duk_size_t len = 0;
|
||||||
|
const char *val = duk_require_lstring(ctx, -1, &len);
|
||||||
|
|
||||||
|
/*
|
||||||
|
duk_push_global_stash(ctx);
|
||||||
|
duk_get_prop_string(ctx, -1, civetweb_conn_id);
|
||||||
|
conn = (struct mg_connection *)duk_to_pointer(ctx, -1);
|
||||||
|
*/
|
||||||
|
duk_push_current_function(ctx);
|
||||||
|
duk_get_prop_string(ctx, -1, civetweb_conn_id);
|
||||||
|
conn = (struct mg_connection *)duk_to_pointer(ctx, -1);
|
||||||
|
|
||||||
|
if (!conn) {
|
||||||
|
duk_error(ctx,
|
||||||
|
DUK_ERR_INTERNAL_ERROR,
|
||||||
|
"function not available without connection object");
|
||||||
|
/* probably never reached, but satisfies static code analysis */
|
||||||
|
return DUK_RET_INTERNAL_ERROR;
|
||||||
|
}
|
||||||
|
|
||||||
|
ret = mg_write(conn, val, len);
|
||||||
|
|
||||||
|
duk_push_number(ctx, ret);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static duk_ret_t
|
||||||
|
duk_itf_read(duk_context *ctx)
|
||||||
|
{
|
||||||
|
struct mg_connection *conn;
|
||||||
|
char buf[1024];
|
||||||
|
int len;
|
||||||
|
|
||||||
|
duk_push_global_stash(ctx);
|
||||||
|
duk_get_prop_string(ctx, -1, civetweb_conn_id);
|
||||||
|
conn = (struct mg_connection *)duk_to_pointer(ctx, -1);
|
||||||
|
|
||||||
|
if (!conn) {
|
||||||
|
duk_error(ctx,
|
||||||
|
DUK_ERR_INTERNAL_ERROR,
|
||||||
|
"function not available without connection object");
|
||||||
|
/* probably never reached, but satisfies static code analysis */
|
||||||
|
return DUK_RET_INTERNAL_ERROR;
|
||||||
|
}
|
||||||
|
|
||||||
|
len = mg_read(conn, buf, sizeof(buf));
|
||||||
|
|
||||||
|
duk_push_lstring(ctx, buf, len);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static duk_ret_t
|
||||||
|
duk_itf_getoption(duk_context *ctx)
|
||||||
|
{
|
||||||
|
struct mg_context *cv_ctx;
|
||||||
|
const char *ret;
|
||||||
|
duk_size_t len = 0;
|
||||||
|
const char *val = duk_require_lstring(ctx, -1, &len);
|
||||||
|
|
||||||
|
duk_push_current_function(ctx);
|
||||||
|
duk_get_prop_string(ctx, -1, civetweb_ctx_id);
|
||||||
|
cv_ctx = (struct mg_context *)duk_to_pointer(ctx, -1);
|
||||||
|
|
||||||
|
if (!cv_ctx) {
|
||||||
|
duk_error(ctx,
|
||||||
|
DUK_ERR_INTERNAL_ERROR,
|
||||||
|
"function not available without connection object");
|
||||||
|
/* probably never reached, but satisfies static code analysis */
|
||||||
|
return DUK_RET_INTERNAL_ERROR;
|
||||||
|
}
|
||||||
|
|
||||||
|
ret = mg_get_option(cv_ctx, val);
|
||||||
|
if (ret) {
|
||||||
|
duk_push_string(ctx, ret);
|
||||||
|
} else {
|
||||||
|
duk_push_null(ctx);
|
||||||
|
}
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static void
|
||||||
|
mg_exec_duktape_script(struct mg_connection *conn, const char *script_name)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
duk_context *ctx = NULL;
|
||||||
|
|
||||||
|
conn->must_close = 1;
|
||||||
|
|
||||||
|
/* Create Duktape interpreter state */
|
||||||
|
ctx = duk_create_heap(mg_duk_mem_alloc,
|
||||||
|
mg_duk_mem_realloc,
|
||||||
|
mg_duk_mem_free,
|
||||||
|
NULL,
|
||||||
|
mg_duk_fatal_handler);
|
||||||
|
if (!ctx) {
|
||||||
|
mg_cry(conn, "Failed to create a Duktape heap.");
|
||||||
|
goto exec_duktape_finished;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Add "conn" object */
|
||||||
|
duk_push_global_object(ctx);
|
||||||
|
duk_push_object(ctx); /* create a new table/object ("conn") */
|
||||||
|
|
||||||
|
duk_push_c_function(ctx, duk_itf_write, 1 /* 1 = nargs */);
|
||||||
|
duk_push_pointer(ctx, (void *)conn);
|
||||||
|
duk_put_prop_string(ctx, -2, civetweb_conn_id);
|
||||||
|
duk_put_prop_string(ctx, -2, "write"); /* add function conn.write */
|
||||||
|
|
||||||
|
duk_push_c_function(ctx, duk_itf_read, 0 /* 0 = nargs */);
|
||||||
|
duk_push_pointer(ctx, (void *)conn);
|
||||||
|
duk_put_prop_string(ctx, -2, civetweb_conn_id);
|
||||||
|
duk_put_prop_string(ctx, -2, "read"); /* add function conn.read */
|
||||||
|
|
||||||
|
duk_push_string(ctx, conn->request_info.request_method);
|
||||||
|
duk_put_prop_string(ctx, -2, "request_method"); /* add string conn.r... */
|
||||||
|
|
||||||
|
duk_push_string(ctx, conn->request_info.request_uri);
|
||||||
|
duk_put_prop_string(ctx, -2, "request_uri");
|
||||||
|
|
||||||
|
duk_push_string(ctx, conn->request_info.local_uri);
|
||||||
|
duk_put_prop_string(ctx, -2, "uri");
|
||||||
|
|
||||||
|
duk_push_string(ctx, conn->request_info.http_version);
|
||||||
|
duk_put_prop_string(ctx, -2, "http_version");
|
||||||
|
|
||||||
|
duk_push_string(ctx, conn->request_info.query_string);
|
||||||
|
duk_put_prop_string(ctx, -2, "query_string");
|
||||||
|
|
||||||
|
duk_push_string(ctx, conn->request_info.remote_addr);
|
||||||
|
duk_put_prop_string(ctx, -2, "remote_addr");
|
||||||
|
|
||||||
|
duk_push_int(ctx, conn->request_info.remote_port);
|
||||||
|
duk_put_prop_string(ctx, -2, "remote_port");
|
||||||
|
|
||||||
|
duk_push_int(ctx, ntohs(conn->client.lsa.sin.sin_port));
|
||||||
|
duk_put_prop_string(ctx, -2, "server_port");
|
||||||
|
|
||||||
|
duk_push_object(ctx); /* subfolder "conn.http_headers" */
|
||||||
|
for (i = 0; i < conn->request_info.num_headers; i++) {
|
||||||
|
duk_push_string(ctx, conn->request_info.http_headers[i].value);
|
||||||
|
duk_put_prop_string(ctx, -2, conn->request_info.http_headers[i].name);
|
||||||
|
}
|
||||||
|
duk_put_prop_string(ctx, -2, "http_headers");
|
||||||
|
|
||||||
|
duk_put_prop_string(ctx, -2, "conn"); /* call the table "conn" */
|
||||||
|
|
||||||
|
/* Add "civetweb" object */
|
||||||
|
duk_push_global_object(ctx);
|
||||||
|
duk_push_object(ctx); /* create a new table/object ("conn") */
|
||||||
|
|
||||||
|
duk_push_string(ctx, CIVETWEB_VERSION);
|
||||||
|
duk_put_prop_string(ctx, -2, "version");
|
||||||
|
|
||||||
|
duk_push_string(ctx, script_name);
|
||||||
|
duk_put_prop_string(ctx, -2, "script_name");
|
||||||
|
|
||||||
|
if (conn->ctx != NULL) {
|
||||||
|
duk_push_c_function(ctx, duk_itf_getoption, 1 /* 1 = nargs */);
|
||||||
|
duk_push_pointer(ctx, (void *)(conn->ctx));
|
||||||
|
duk_put_prop_string(ctx, -2, civetweb_ctx_id);
|
||||||
|
duk_put_prop_string(ctx, -2, "getoption"); /* add function conn.write */
|
||||||
|
|
||||||
|
if (conn->ctx->systemName != NULL) {
|
||||||
|
duk_push_string(ctx, conn->ctx->systemName);
|
||||||
|
duk_put_prop_string(ctx, -2, "system");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
duk_put_prop_string(ctx, -2, "civetweb"); /* call the table "civetweb" */
|
||||||
|
|
||||||
|
duk_push_global_stash(ctx);
|
||||||
|
duk_push_pointer(ctx, (void *)conn);
|
||||||
|
duk_put_prop_string(ctx, -2, civetweb_conn_id);
|
||||||
|
|
||||||
|
if (duk_peval_file(ctx, script_name) != 0) {
|
||||||
|
mg_cry(conn, "%s", duk_safe_to_string(ctx, -1));
|
||||||
|
goto exec_duktape_finished;
|
||||||
|
}
|
||||||
|
duk_pop(ctx); /* ignore result */
|
||||||
|
|
||||||
|
exec_duktape_finished:
|
||||||
|
duk_destroy_heap(ctx);
|
||||||
|
}
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,150 @@
|
||||||
|
|
||||||
|
#if !defined(MAX_TIMERS)
|
||||||
|
#define MAX_TIMERS MAX_WORKER_THREADS
|
||||||
|
#endif
|
||||||
|
|
||||||
|
typedef int (*taction)(void *arg);
|
||||||
|
|
||||||
|
struct ttimer {
|
||||||
|
double time;
|
||||||
|
double period;
|
||||||
|
taction action;
|
||||||
|
void *arg;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct ttimers {
|
||||||
|
pthread_t threadid; /* Timer thread ID */
|
||||||
|
pthread_mutex_t mutex; /* Protects timer lists */
|
||||||
|
struct ttimer timers[MAX_TIMERS]; /* List of timers */
|
||||||
|
unsigned timer_count; /* Current size of timer list */
|
||||||
|
};
|
||||||
|
|
||||||
|
static int
|
||||||
|
timer_add(struct mg_context *ctx,
|
||||||
|
double next_time,
|
||||||
|
double period,
|
||||||
|
int is_relative,
|
||||||
|
taction action,
|
||||||
|
void *arg)
|
||||||
|
{
|
||||||
|
unsigned u, v;
|
||||||
|
int error = 0;
|
||||||
|
struct timespec now;
|
||||||
|
|
||||||
|
if (ctx->stop_flag) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (is_relative) {
|
||||||
|
clock_gettime(CLOCK_MONOTONIC, &now);
|
||||||
|
next_time += now.tv_sec;
|
||||||
|
next_time += now.tv_nsec * 1.0E-9;
|
||||||
|
}
|
||||||
|
|
||||||
|
pthread_mutex_lock(&ctx->timers->mutex);
|
||||||
|
if (ctx->timers->timer_count == MAX_TIMERS) {
|
||||||
|
error = 1;
|
||||||
|
} else {
|
||||||
|
for (u = 0; u < ctx->timers->timer_count; u++) {
|
||||||
|
if (ctx->timers->timers[u].time < next_time) {
|
||||||
|
for (v = ctx->timers->timer_count; v > u; v--) {
|
||||||
|
ctx->timers->timers[v] = ctx->timers->timers[v - 1];
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
ctx->timers->timers[u].time = next_time;
|
||||||
|
ctx->timers->timers[u].period = period;
|
||||||
|
ctx->timers->timers[u].action = action;
|
||||||
|
ctx->timers->timers[u].arg = arg;
|
||||||
|
ctx->timers->timer_count++;
|
||||||
|
}
|
||||||
|
pthread_mutex_unlock(&ctx->timers->mutex);
|
||||||
|
return error;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void
|
||||||
|
timer_thread_run(void *thread_func_param)
|
||||||
|
{
|
||||||
|
struct mg_context *ctx = (struct mg_context *)thread_func_param;
|
||||||
|
struct timespec now;
|
||||||
|
double d;
|
||||||
|
unsigned u;
|
||||||
|
int re_schedule;
|
||||||
|
struct ttimer t;
|
||||||
|
|
||||||
|
mg_set_thread_name("timer");
|
||||||
|
|
||||||
|
if (ctx->callbacks.init_thread) {
|
||||||
|
/* Timer thread */
|
||||||
|
ctx->callbacks.init_thread(ctx, 2);
|
||||||
|
}
|
||||||
|
|
||||||
|
#if defined(HAVE_CLOCK_NANOSLEEP) /* Linux with librt */
|
||||||
|
/* TODO */
|
||||||
|
while (clock_nanosleep(CLOCK_MONOTONIC, TIMER_ABSTIME, &request, &request)
|
||||||
|
== EINTR) { /*nop*/
|
||||||
|
;
|
||||||
|
}
|
||||||
|
#else
|
||||||
|
clock_gettime(CLOCK_MONOTONIC, &now);
|
||||||
|
d = (double)now.tv_sec + (double)now.tv_nsec * 1.0E-9;
|
||||||
|
while (ctx->stop_flag == 0) {
|
||||||
|
pthread_mutex_lock(&ctx->timers->mutex);
|
||||||
|
if (ctx->timers->timer_count > 0 && d >= ctx->timers->timers[0].time) {
|
||||||
|
t = ctx->timers->timers[0];
|
||||||
|
for (u = 1; u < ctx->timers->timer_count; u++) {
|
||||||
|
ctx->timers->timers[u - 1] = ctx->timers->timers[u];
|
||||||
|
}
|
||||||
|
ctx->timers->timer_count--;
|
||||||
|
pthread_mutex_unlock(&ctx->timers->mutex);
|
||||||
|
re_schedule = t.action(t.arg);
|
||||||
|
if (re_schedule && (t.period > 0)) {
|
||||||
|
timer_add(ctx, t.time + t.period, t.period, 0, t.action, t.arg);
|
||||||
|
}
|
||||||
|
continue;
|
||||||
|
} else {
|
||||||
|
pthread_mutex_unlock(&ctx->timers->mutex);
|
||||||
|
}
|
||||||
|
mg_sleep(1);
|
||||||
|
clock_gettime(CLOCK_MONOTONIC, &now);
|
||||||
|
d = (double)now.tv_sec + (double)now.tv_nsec * 1.0E-9;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef _WIN32
|
||||||
|
static unsigned __stdcall timer_thread(void *thread_func_param)
|
||||||
|
{
|
||||||
|
timer_thread_run(thread_func_param);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
#else
|
||||||
|
static void *
|
||||||
|
timer_thread(void *thread_func_param)
|
||||||
|
{
|
||||||
|
timer_thread_run(thread_func_param);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
#endif /* _WIN32 */
|
||||||
|
|
||||||
|
static int
|
||||||
|
timers_init(struct mg_context *ctx)
|
||||||
|
{
|
||||||
|
ctx->timers = (struct ttimers *)mg_calloc(sizeof(struct ttimers), 1);
|
||||||
|
(void)pthread_mutex_init(&ctx->timers->mutex, NULL);
|
||||||
|
|
||||||
|
/* Start timer thread */
|
||||||
|
mg_start_thread_with_id(timer_thread, ctx, &ctx->timers->threadid);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void
|
||||||
|
timers_exit(struct mg_context *ctx)
|
||||||
|
{
|
||||||
|
if (ctx->timers) {
|
||||||
|
(void)pthread_mutex_destroy(&ctx->timers->mutex);
|
||||||
|
mg_free(ctx->timers);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,10 @@
|
||||||
|
|
||||||
|
Licensing of XZ Embedded
|
||||||
|
========================
|
||||||
|
|
||||||
|
All the files in this package have been written by Lasse Collin
|
||||||
|
and/or Igor Pavlov. All these files have been put into the
|
||||||
|
public domain. You can do whatever you want with these files.
|
||||||
|
|
||||||
|
As usual, this software is provided "as is", without any warranty.
|
||||||
|
|
||||||
|
|
@ -0,0 +1,163 @@
|
||||||
|
|
||||||
|
XZ Embedded
|
||||||
|
===========
|
||||||
|
|
||||||
|
XZ Embedded is a relatively small, limited implementation of the .xz
|
||||||
|
file format. Currently only decoding is implemented.
|
||||||
|
|
||||||
|
XZ Embedded was written for use in the Linux kernel, but the code can
|
||||||
|
be easily used in other environments too, including regular userspace
|
||||||
|
applications. See userspace/xzminidec.c for an example program.
|
||||||
|
|
||||||
|
This README contains information that is useful only when the copy
|
||||||
|
of XZ Embedded isn't part of the Linux kernel tree. You should also
|
||||||
|
read linux/Documentation/xz.txt even if you aren't using XZ Embedded
|
||||||
|
as part of Linux; information in that file is not repeated in this
|
||||||
|
README.
|
||||||
|
|
||||||
|
Compiling the Linux kernel module
|
||||||
|
|
||||||
|
The xz_dec module depends on crc32 module, so make sure that you have
|
||||||
|
it enabled (CONFIG_CRC32).
|
||||||
|
|
||||||
|
Building the xz_dec and xz_dec_test modules without support for BCJ
|
||||||
|
filters:
|
||||||
|
|
||||||
|
cd linux/lib/xz
|
||||||
|
make -C /path/to/kernel/source \
|
||||||
|
KCPPFLAGS=-I"$(pwd)/../../include" M="$(pwd)" \
|
||||||
|
CONFIG_XZ_DEC=m CONFIG_XZ_DEC_TEST=m
|
||||||
|
|
||||||
|
Building the xz_dec and xz_dec_test modules with support for BCJ
|
||||||
|
filters:
|
||||||
|
|
||||||
|
cd linux/lib/xz
|
||||||
|
make -C /path/to/kernel/source \
|
||||||
|
KCPPFLAGS=-I"$(pwd)/../../include" M="$(pwd)" \
|
||||||
|
CONFIG_XZ_DEC=m CONFIG_XZ_DEC_TEST=m CONFIG_XZ_DEC_BCJ=y \
|
||||||
|
CONFIG_XZ_DEC_X86=y CONFIG_XZ_DEC_POWERPC=y \
|
||||||
|
CONFIG_XZ_DEC_IA64=y CONFIG_XZ_DEC_ARM=y \
|
||||||
|
CONFIG_XZ_DEC_ARMTHUMB=y CONFIG_XZ_DEC_SPARC=y
|
||||||
|
|
||||||
|
If you want only one or a few of the BCJ filters, omit the appropriate
|
||||||
|
variables. CONFIG_XZ_DEC_BCJ=y is always required to build the support
|
||||||
|
code shared between all BCJ filters.
|
||||||
|
|
||||||
|
Most people don't need the xz_dec_test module. You can skip building
|
||||||
|
it by omitting CONFIG_XZ_DEC_TEST=m from the make command line.
|
||||||
|
|
||||||
|
Compiler requirements
|
||||||
|
|
||||||
|
XZ Embedded should compile as either GNU-C89 (used in the Linux
|
||||||
|
kernel) or with any C99 compiler. Getting the code to compile with
|
||||||
|
non-GNU C89 compiler or a C++ compiler should be quite easy as
|
||||||
|
long as there is a data type for unsigned 64-bit integer (or the
|
||||||
|
code is modified not to support large files, which needs some more
|
||||||
|
care than just using 32-bit integer instead of 64-bit).
|
||||||
|
|
||||||
|
If you use GCC, try to use a recent version. For example, on x86-32,
|
||||||
|
xz_dec_lzma2.c compiled with GCC 3.3.6 is 15-25 % slower than when
|
||||||
|
compiled with GCC 4.3.3.
|
||||||
|
|
||||||
|
Embedding into userspace applications
|
||||||
|
|
||||||
|
To embed the XZ decoder, copy the following files into a single
|
||||||
|
directory in your source code tree:
|
||||||
|
|
||||||
|
linux/include/linux/xz.h
|
||||||
|
linux/lib/xz/xz_crc32.c
|
||||||
|
linux/lib/xz/xz_dec_lzma2.c
|
||||||
|
linux/lib/xz/xz_dec_stream.c
|
||||||
|
linux/lib/xz/xz_lzma2.h
|
||||||
|
linux/lib/xz/xz_private.h
|
||||||
|
linux/lib/xz/xz_stream.h
|
||||||
|
userspace/xz_config.h
|
||||||
|
|
||||||
|
Alternatively, xz.h may be placed into a different directory but then
|
||||||
|
that directory must be in the compiler include path when compiling
|
||||||
|
the .c files.
|
||||||
|
|
||||||
|
Your code should use only the functions declared in xz.h. The rest of
|
||||||
|
the .h files are meant only for internal use in XZ Embedded.
|
||||||
|
|
||||||
|
You may want to modify xz_config.h to be more suitable for your build
|
||||||
|
environment. Probably you should at least skim through it even if the
|
||||||
|
default file works as is.
|
||||||
|
|
||||||
|
Integrity check support
|
||||||
|
|
||||||
|
XZ Embedded always supports the integrity check types None and
|
||||||
|
CRC32. Support for CRC64 is optional. SHA-256 is currently not
|
||||||
|
supported in XZ Embedded although the .xz format does support it.
|
||||||
|
The xz tool from XZ Utils uses CRC64 by default, but CRC32 is usually
|
||||||
|
enough in embedded systems to keep the code size smaller.
|
||||||
|
|
||||||
|
If you want support for CRC64, you need to copy linux/lib/xz/xz_crc64.c
|
||||||
|
into your application, and #define XZ_USE_CRC64 in xz_config.h or in
|
||||||
|
compiler flags.
|
||||||
|
|
||||||
|
When using the internal CRC32 or CRC64, their lookup tables need to be
|
||||||
|
initialized with xz_crc32_init() and xz_crc64_init(), respectively.
|
||||||
|
See xz.h for details.
|
||||||
|
|
||||||
|
To use external CRC32 or CRC64 code instead of the code from
|
||||||
|
xz_crc32.c or xz_crc64.c, the following #defines may be used
|
||||||
|
in xz_config.h or in compiler flags:
|
||||||
|
|
||||||
|
#define XZ_INTERNAL_CRC32 0
|
||||||
|
#define XZ_INTERNAL_CRC64 0
|
||||||
|
|
||||||
|
Then it is up to you to provide compatible xz_crc32() or xz_crc64()
|
||||||
|
functions.
|
||||||
|
|
||||||
|
If the .xz file being decompressed uses an integrity check type that
|
||||||
|
isn't supported by XZ Embedded, it is treated as an error and the
|
||||||
|
file cannot be decompressed. For multi-call mode, this can be modified
|
||||||
|
by #defining XZ_DEC_ANY_CHECK. Then xz_dec_run() will return
|
||||||
|
XZ_UNSUPPORTED_CHECK when unsupported check type is detected. After
|
||||||
|
that decompression can be continued normally except that the
|
||||||
|
integrity check won't be verified. In single-call mode there's
|
||||||
|
no way to continue decoding, so XZ_DEC_ANY_CHECK is almost useless
|
||||||
|
in single-call mode.
|
||||||
|
|
||||||
|
BCJ filter support
|
||||||
|
|
||||||
|
If you want support for one or more BCJ filters, you need to copy also
|
||||||
|
linux/lib/xz/xz_dec_bcj.c into your application, and use appropriate
|
||||||
|
#defines in xz_config.h or in compiler flags. You don't need these
|
||||||
|
#defines in the code that just uses XZ Embedded via xz.h, but having
|
||||||
|
them always #defined doesn't hurt either.
|
||||||
|
|
||||||
|
#define Instruction set BCJ filter endianness
|
||||||
|
XZ_DEC_X86 x86-32 or x86-64 Little endian only
|
||||||
|
XZ_DEC_POWERPC PowerPC Big endian only
|
||||||
|
XZ_DEC_IA64 Itanium (IA-64) Big or little endian
|
||||||
|
XZ_DEC_ARM ARM Little endian only
|
||||||
|
XZ_DEC_ARMTHUMB ARM-Thumb Little endian only
|
||||||
|
XZ_DEC_SPARC SPARC Big or little endian
|
||||||
|
|
||||||
|
While some architectures are (partially) bi-endian, the endianness
|
||||||
|
setting doesn't change the endianness of the instructions on all
|
||||||
|
architectures. That's why Itanium and SPARC filters work for both big
|
||||||
|
and little endian executables (Itanium has little endian instructions
|
||||||
|
and SPARC has big endian instructions).
|
||||||
|
|
||||||
|
There currently is no filter for little endian PowerPC or big endian
|
||||||
|
ARM or ARM-Thumb. Implementing filters for them can be considered if
|
||||||
|
there is a need for such filters in real-world applications.
|
||||||
|
|
||||||
|
Notes about shared libraries
|
||||||
|
|
||||||
|
If you are including XZ Embedded into a shared library, you very
|
||||||
|
probably should rename the xz_* functions to prevent symbol
|
||||||
|
conflicts in case your library is linked against some other library
|
||||||
|
or application that also has XZ Embedded in it (which may even be
|
||||||
|
a different version of XZ Embedded). TODO: Provide an easy way
|
||||||
|
to do this.
|
||||||
|
|
||||||
|
Please don't create a shared library of XZ Embedded itself unless
|
||||||
|
it is fine to rebuild everything depending on that shared library
|
||||||
|
everytime you upgrade to a newer version of XZ Embedded. There are
|
||||||
|
no API or ABI stability guarantees between different versions of
|
||||||
|
XZ Embedded.
|
||||||
|
|
||||||
|
|
@ -0,0 +1,122 @@
|
||||||
|
|
||||||
|
XZ data compression in Linux
|
||||||
|
============================
|
||||||
|
|
||||||
|
Introduction
|
||||||
|
|
||||||
|
XZ is a general purpose data compression format with high compression
|
||||||
|
ratio and relatively fast decompression. The primary compression
|
||||||
|
algorithm (filter) is LZMA2. Additional filters can be used to improve
|
||||||
|
compression ratio even further. E.g. Branch/Call/Jump (BCJ) filters
|
||||||
|
improve compression ratio of executable data.
|
||||||
|
|
||||||
|
The XZ decompressor in Linux is called XZ Embedded. It supports
|
||||||
|
the LZMA2 filter and optionally also BCJ filters. CRC32 is supported
|
||||||
|
for integrity checking. The home page of XZ Embedded is at
|
||||||
|
<http://tukaani.org/xz/embedded.html>, where you can find the
|
||||||
|
latest version and also information about using the code outside
|
||||||
|
the Linux kernel.
|
||||||
|
|
||||||
|
For userspace, XZ Utils provide a zlib-like compression library
|
||||||
|
and a gzip-like command line tool. XZ Utils can be downloaded from
|
||||||
|
<http://tukaani.org/xz/>.
|
||||||
|
|
||||||
|
XZ related components in the kernel
|
||||||
|
|
||||||
|
The xz_dec module provides XZ decompressor with single-call (buffer
|
||||||
|
to buffer) and multi-call (stateful) APIs. The usage of the xz_dec
|
||||||
|
module is documented in include/linux/xz.h.
|
||||||
|
|
||||||
|
The xz_dec_test module is for testing xz_dec. xz_dec_test is not
|
||||||
|
useful unless you are hacking the XZ decompressor. xz_dec_test
|
||||||
|
allocates a char device major dynamically to which one can write
|
||||||
|
.xz files from userspace. The decompressed output is thrown away.
|
||||||
|
Keep an eye on dmesg to see diagnostics printed by xz_dec_test.
|
||||||
|
See the xz_dec_test source code for the details.
|
||||||
|
|
||||||
|
For decompressing the kernel image, initramfs, and initrd, there
|
||||||
|
is a wrapper function in lib/decompress_unxz.c. Its API is the
|
||||||
|
same as in other decompress_*.c files, which is defined in
|
||||||
|
include/linux/decompress/generic.h.
|
||||||
|
|
||||||
|
scripts/xz_wrap.sh is a wrapper for the xz command line tool found
|
||||||
|
from XZ Utils. The wrapper sets compression options to values suitable
|
||||||
|
for compressing the kernel image.
|
||||||
|
|
||||||
|
For kernel makefiles, two commands are provided for use with
|
||||||
|
$(call if_needed). The kernel image should be compressed with
|
||||||
|
$(call if_needed,xzkern) which will use a BCJ filter and a big LZMA2
|
||||||
|
dictionary. It will also append a four-byte trailer containing the
|
||||||
|
uncompressed size of the file, which is needed by the boot code.
|
||||||
|
Other things should be compressed with $(call if_needed,xzmisc)
|
||||||
|
which will use no BCJ filter and 1 MiB LZMA2 dictionary.
|
||||||
|
|
||||||
|
Notes on compression options
|
||||||
|
|
||||||
|
Since the XZ Embedded supports only streams with no integrity check or
|
||||||
|
CRC32, make sure that you don't use some other integrity check type
|
||||||
|
when encoding files that are supposed to be decoded by the kernel. With
|
||||||
|
liblzma, you need to use either LZMA_CHECK_NONE or LZMA_CHECK_CRC32
|
||||||
|
when encoding. With the xz command line tool, use --check=none or
|
||||||
|
--check=crc32.
|
||||||
|
|
||||||
|
Using CRC32 is strongly recommended unless there is some other layer
|
||||||
|
which will verify the integrity of the uncompressed data anyway.
|
||||||
|
Double checking the integrity would probably be waste of CPU cycles.
|
||||||
|
Note that the headers will always have a CRC32 which will be validated
|
||||||
|
by the decoder; you can only change the integrity check type (or
|
||||||
|
disable it) for the actual uncompressed data.
|
||||||
|
|
||||||
|
In userspace, LZMA2 is typically used with dictionary sizes of several
|
||||||
|
megabytes. The decoder needs to have the dictionary in RAM, thus big
|
||||||
|
dictionaries cannot be used for files that are intended to be decoded
|
||||||
|
by the kernel. 1 MiB is probably the maximum reasonable dictionary
|
||||||
|
size for in-kernel use (maybe more is OK for initramfs). The presets
|
||||||
|
in XZ Utils may not be optimal when creating files for the kernel,
|
||||||
|
so don't hesitate to use custom settings. Example:
|
||||||
|
|
||||||
|
xz --check=crc32 --lzma2=dict=512KiB inputfile
|
||||||
|
|
||||||
|
An exception to above dictionary size limitation is when the decoder
|
||||||
|
is used in single-call mode. Decompressing the kernel itself is an
|
||||||
|
example of this situation. In single-call mode, the memory usage
|
||||||
|
doesn't depend on the dictionary size, and it is perfectly fine to
|
||||||
|
use a big dictionary: for maximum compression, the dictionary should
|
||||||
|
be at least as big as the uncompressed data itself.
|
||||||
|
|
||||||
|
Future plans
|
||||||
|
|
||||||
|
Creating a limited XZ encoder may be considered if people think it is
|
||||||
|
useful. LZMA2 is slower to compress than e.g. Deflate or LZO even at
|
||||||
|
the fastest settings, so it isn't clear if LZMA2 encoder is wanted
|
||||||
|
into the kernel.
|
||||||
|
|
||||||
|
Support for limited random-access reading is planned for the
|
||||||
|
decompression code. I don't know if it could have any use in the
|
||||||
|
kernel, but I know that it would be useful in some embedded projects
|
||||||
|
outside the Linux kernel.
|
||||||
|
|
||||||
|
Conformance to the .xz file format specification
|
||||||
|
|
||||||
|
There are a couple of corner cases where things have been simplified
|
||||||
|
at expense of detecting errors as early as possible. These should not
|
||||||
|
matter in practice all, since they don't cause security issues. But
|
||||||
|
it is good to know this if testing the code e.g. with the test files
|
||||||
|
from XZ Utils.
|
||||||
|
|
||||||
|
Reporting bugs
|
||||||
|
|
||||||
|
Before reporting a bug, please check that it's not fixed already
|
||||||
|
at upstream. See <http://tukaani.org/xz/embedded.html> to get the
|
||||||
|
latest code.
|
||||||
|
|
||||||
|
Report bugs to <lasse.collin@tukaani.org> or visit #tukaani on
|
||||||
|
Freenode and talk to Larhzu. I don't actively read LKML or other
|
||||||
|
kernel-related mailing lists, so if there's something I should know,
|
||||||
|
you should email to me personally or use IRC.
|
||||||
|
|
||||||
|
Don't bother Igor Pavlov with questions about the XZ implementation
|
||||||
|
in the kernel or about XZ Utils. While these two implementations
|
||||||
|
include essential code that is directly based on Igor Pavlov's code,
|
||||||
|
these implementations aren't maintained nor supported by him.
|
||||||
|
|
||||||
|
|
@ -0,0 +1,19 @@
|
||||||
|
/*
|
||||||
|
* Wrapper for decompressing XZ-compressed kernel, initramfs, and initrd
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef DECOMPRESS_UNXZ_H
|
||||||
|
#define DECOMPRESS_UNXZ_H
|
||||||
|
|
||||||
|
int unxz(unsigned char *in, int in_size,
|
||||||
|
int (*fill)(void *dest, unsigned int size),
|
||||||
|
int (*flush)(void *src, unsigned int size),
|
||||||
|
unsigned char *out, int *in_used,
|
||||||
|
void (*error)(char *x));
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,304 @@
|
||||||
|
/*
|
||||||
|
* XZ decompressor
|
||||||
|
*
|
||||||
|
* Authors: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
* Igor Pavlov <http://7-zip.org/>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef XZ_H
|
||||||
|
#define XZ_H
|
||||||
|
|
||||||
|
#ifdef __KERNEL__
|
||||||
|
# include <linux/stddef.h>
|
||||||
|
# include <linux/types.h>
|
||||||
|
#else
|
||||||
|
# include <stddef.h>
|
||||||
|
# include <stdint.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef __cplusplus
|
||||||
|
extern "C" {
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* In Linux, this is used to make extern functions static when needed. */
|
||||||
|
#ifndef XZ_EXTERN
|
||||||
|
# define XZ_EXTERN extern
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/**
|
||||||
|
* enum xz_mode - Operation mode
|
||||||
|
*
|
||||||
|
* @XZ_SINGLE: Single-call mode. This uses less RAM than
|
||||||
|
* than multi-call modes, because the LZMA2
|
||||||
|
* dictionary doesn't need to be allocated as
|
||||||
|
* part of the decoder state. All required data
|
||||||
|
* structures are allocated at initialization,
|
||||||
|
* so xz_dec_run() cannot return XZ_MEM_ERROR.
|
||||||
|
* @XZ_PREALLOC: Multi-call mode with preallocated LZMA2
|
||||||
|
* dictionary buffer. All data structures are
|
||||||
|
* allocated at initialization, so xz_dec_run()
|
||||||
|
* cannot return XZ_MEM_ERROR.
|
||||||
|
* @XZ_DYNALLOC: Multi-call mode. The LZMA2 dictionary is
|
||||||
|
* allocated once the required size has been
|
||||||
|
* parsed from the stream headers. If the
|
||||||
|
* allocation fails, xz_dec_run() will return
|
||||||
|
* XZ_MEM_ERROR.
|
||||||
|
*
|
||||||
|
* It is possible to enable support only for a subset of the above
|
||||||
|
* modes at compile time by defining XZ_DEC_SINGLE, XZ_DEC_PREALLOC,
|
||||||
|
* or XZ_DEC_DYNALLOC. The xz_dec kernel module is always compiled
|
||||||
|
* with support for all operation modes, but the preboot code may
|
||||||
|
* be built with fewer features to minimize code size.
|
||||||
|
*/
|
||||||
|
enum xz_mode {
|
||||||
|
XZ_SINGLE,
|
||||||
|
XZ_PREALLOC,
|
||||||
|
XZ_DYNALLOC
|
||||||
|
};
|
||||||
|
|
||||||
|
/**
|
||||||
|
* enum xz_ret - Return codes
|
||||||
|
* @XZ_OK: Everything is OK so far. More input or more
|
||||||
|
* output space is required to continue. This
|
||||||
|
* return code is possible only in multi-call mode
|
||||||
|
* (XZ_PREALLOC or XZ_DYNALLOC).
|
||||||
|
* @XZ_STREAM_END: Operation finished successfully.
|
||||||
|
* @XZ_UNSUPPORTED_CHECK: Integrity check type is not supported. Decoding
|
||||||
|
* is still possible in multi-call mode by simply
|
||||||
|
* calling xz_dec_run() again.
|
||||||
|
* Note that this return value is used only if
|
||||||
|
* XZ_DEC_ANY_CHECK was defined at build time,
|
||||||
|
* which is not used in the kernel. Unsupported
|
||||||
|
* check types return XZ_OPTIONS_ERROR if
|
||||||
|
* XZ_DEC_ANY_CHECK was not defined at build time.
|
||||||
|
* @XZ_MEM_ERROR: Allocating memory failed. This return code is
|
||||||
|
* possible only if the decoder was initialized
|
||||||
|
* with XZ_DYNALLOC. The amount of memory that was
|
||||||
|
* tried to be allocated was no more than the
|
||||||
|
* dict_max argument given to xz_dec_init().
|
||||||
|
* @XZ_MEMLIMIT_ERROR: A bigger LZMA2 dictionary would be needed than
|
||||||
|
* allowed by the dict_max argument given to
|
||||||
|
* xz_dec_init(). This return value is possible
|
||||||
|
* only in multi-call mode (XZ_PREALLOC or
|
||||||
|
* XZ_DYNALLOC); the single-call mode (XZ_SINGLE)
|
||||||
|
* ignores the dict_max argument.
|
||||||
|
* @XZ_FORMAT_ERROR: File format was not recognized (wrong magic
|
||||||
|
* bytes).
|
||||||
|
* @XZ_OPTIONS_ERROR: This implementation doesn't support the requested
|
||||||
|
* compression options. In the decoder this means
|
||||||
|
* that the header CRC32 matches, but the header
|
||||||
|
* itself specifies something that we don't support.
|
||||||
|
* @XZ_DATA_ERROR: Compressed data is corrupt.
|
||||||
|
* @XZ_BUF_ERROR: Cannot make any progress. Details are slightly
|
||||||
|
* different between multi-call and single-call
|
||||||
|
* mode; more information below.
|
||||||
|
*
|
||||||
|
* In multi-call mode, XZ_BUF_ERROR is returned when two consecutive calls
|
||||||
|
* to XZ code cannot consume any input and cannot produce any new output.
|
||||||
|
* This happens when there is no new input available, or the output buffer
|
||||||
|
* is full while at least one output byte is still pending. Assuming your
|
||||||
|
* code is not buggy, you can get this error only when decoding a compressed
|
||||||
|
* stream that is truncated or otherwise corrupt.
|
||||||
|
*
|
||||||
|
* In single-call mode, XZ_BUF_ERROR is returned only when the output buffer
|
||||||
|
* is too small or the compressed input is corrupt in a way that makes the
|
||||||
|
* decoder produce more output than the caller expected. When it is
|
||||||
|
* (relatively) clear that the compressed input is truncated, XZ_DATA_ERROR
|
||||||
|
* is used instead of XZ_BUF_ERROR.
|
||||||
|
*/
|
||||||
|
enum xz_ret {
|
||||||
|
XZ_OK,
|
||||||
|
XZ_STREAM_END,
|
||||||
|
XZ_UNSUPPORTED_CHECK,
|
||||||
|
XZ_MEM_ERROR,
|
||||||
|
XZ_MEMLIMIT_ERROR,
|
||||||
|
XZ_FORMAT_ERROR,
|
||||||
|
XZ_OPTIONS_ERROR,
|
||||||
|
XZ_DATA_ERROR,
|
||||||
|
XZ_BUF_ERROR
|
||||||
|
};
|
||||||
|
|
||||||
|
/**
|
||||||
|
* struct xz_buf - Passing input and output buffers to XZ code
|
||||||
|
* @in: Beginning of the input buffer. This may be NULL if and only
|
||||||
|
* if in_pos is equal to in_size.
|
||||||
|
* @in_pos: Current position in the input buffer. This must not exceed
|
||||||
|
* in_size.
|
||||||
|
* @in_size: Size of the input buffer
|
||||||
|
* @out: Beginning of the output buffer. This may be NULL if and only
|
||||||
|
* if out_pos is equal to out_size.
|
||||||
|
* @out_pos: Current position in the output buffer. This must not exceed
|
||||||
|
* out_size.
|
||||||
|
* @out_size: Size of the output buffer
|
||||||
|
*
|
||||||
|
* Only the contents of the output buffer from out[out_pos] onward, and
|
||||||
|
* the variables in_pos and out_pos are modified by the XZ code.
|
||||||
|
*/
|
||||||
|
struct xz_buf {
|
||||||
|
const uint8_t *in;
|
||||||
|
size_t in_pos;
|
||||||
|
size_t in_size;
|
||||||
|
|
||||||
|
uint8_t *out;
|
||||||
|
size_t out_pos;
|
||||||
|
size_t out_size;
|
||||||
|
};
|
||||||
|
|
||||||
|
/**
|
||||||
|
* struct xz_dec - Opaque type to hold the XZ decoder state
|
||||||
|
*/
|
||||||
|
struct xz_dec;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* xz_dec_init() - Allocate and initialize a XZ decoder state
|
||||||
|
* @mode: Operation mode
|
||||||
|
* @dict_max: Maximum size of the LZMA2 dictionary (history buffer) for
|
||||||
|
* multi-call decoding. This is ignored in single-call mode
|
||||||
|
* (mode == XZ_SINGLE). LZMA2 dictionary is always 2^n bytes
|
||||||
|
* or 2^n + 2^(n-1) bytes (the latter sizes are less common
|
||||||
|
* in practice), so other values for dict_max don't make sense.
|
||||||
|
* In the kernel, dictionary sizes of 64 KiB, 128 KiB, 256 KiB,
|
||||||
|
* 512 KiB, and 1 MiB are probably the only reasonable values,
|
||||||
|
* except for kernel and initramfs images where a bigger
|
||||||
|
* dictionary can be fine and useful.
|
||||||
|
*
|
||||||
|
* Single-call mode (XZ_SINGLE): xz_dec_run() decodes the whole stream at
|
||||||
|
* once. The caller must provide enough output space or the decoding will
|
||||||
|
* fail. The output space is used as the dictionary buffer, which is why
|
||||||
|
* there is no need to allocate the dictionary as part of the decoder's
|
||||||
|
* internal state.
|
||||||
|
*
|
||||||
|
* Because the output buffer is used as the workspace, streams encoded using
|
||||||
|
* a big dictionary are not a problem in single-call mode. It is enough that
|
||||||
|
* the output buffer is big enough to hold the actual uncompressed data; it
|
||||||
|
* can be smaller than the dictionary size stored in the stream headers.
|
||||||
|
*
|
||||||
|
* Multi-call mode with preallocated dictionary (XZ_PREALLOC): dict_max bytes
|
||||||
|
* of memory is preallocated for the LZMA2 dictionary. This way there is no
|
||||||
|
* risk that xz_dec_run() could run out of memory, since xz_dec_run() will
|
||||||
|
* never allocate any memory. Instead, if the preallocated dictionary is too
|
||||||
|
* small for decoding the given input stream, xz_dec_run() will return
|
||||||
|
* XZ_MEMLIMIT_ERROR. Thus, it is important to know what kind of data will be
|
||||||
|
* decoded to avoid allocating excessive amount of memory for the dictionary.
|
||||||
|
*
|
||||||
|
* Multi-call mode with dynamically allocated dictionary (XZ_DYNALLOC):
|
||||||
|
* dict_max specifies the maximum allowed dictionary size that xz_dec_run()
|
||||||
|
* may allocate once it has parsed the dictionary size from the stream
|
||||||
|
* headers. This way excessive allocations can be avoided while still
|
||||||
|
* limiting the maximum memory usage to a sane value to prevent running the
|
||||||
|
* system out of memory when decompressing streams from untrusted sources.
|
||||||
|
*
|
||||||
|
* On success, xz_dec_init() returns a pointer to struct xz_dec, which is
|
||||||
|
* ready to be used with xz_dec_run(). If memory allocation fails,
|
||||||
|
* xz_dec_init() returns NULL.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN struct xz_dec *xz_dec_init(enum xz_mode mode, uint32_t dict_max);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* xz_dec_run() - Run the XZ decoder
|
||||||
|
* @s: Decoder state allocated using xz_dec_init()
|
||||||
|
* @b: Input and output buffers
|
||||||
|
*
|
||||||
|
* The possible return values depend on build options and operation mode.
|
||||||
|
* See enum xz_ret for details.
|
||||||
|
*
|
||||||
|
* Note that if an error occurs in single-call mode (return value is not
|
||||||
|
* XZ_STREAM_END), b->in_pos and b->out_pos are not modified and the
|
||||||
|
* contents of the output buffer from b->out[b->out_pos] onward are
|
||||||
|
* undefined. This is true even after XZ_BUF_ERROR, because with some filter
|
||||||
|
* chains, there may be a second pass over the output buffer, and this pass
|
||||||
|
* cannot be properly done if the output buffer is truncated. Thus, you
|
||||||
|
* cannot give the single-call decoder a too small buffer and then expect to
|
||||||
|
* get that amount valid data from the beginning of the stream. You must use
|
||||||
|
* the multi-call decoder if you don't want to uncompress the whole stream.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN enum xz_ret xz_dec_run(struct xz_dec *s, struct xz_buf *b);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* xz_dec_reset() - Reset an already allocated decoder state
|
||||||
|
* @s: Decoder state allocated using xz_dec_init()
|
||||||
|
*
|
||||||
|
* This function can be used to reset the multi-call decoder state without
|
||||||
|
* freeing and reallocating memory with xz_dec_end() and xz_dec_init().
|
||||||
|
*
|
||||||
|
* In single-call mode, xz_dec_reset() is always called in the beginning of
|
||||||
|
* xz_dec_run(). Thus, explicit call to xz_dec_reset() is useful only in
|
||||||
|
* multi-call mode.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN void xz_dec_reset(struct xz_dec *s);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* xz_dec_end() - Free the memory allocated for the decoder state
|
||||||
|
* @s: Decoder state allocated using xz_dec_init(). If s is NULL,
|
||||||
|
* this function does nothing.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN void xz_dec_end(struct xz_dec *s);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Standalone build (userspace build or in-kernel build for boot time use)
|
||||||
|
* needs a CRC32 implementation. For normal in-kernel use, kernel's own
|
||||||
|
* CRC32 module is used instead, and users of this module don't need to
|
||||||
|
* care about the functions below.
|
||||||
|
*/
|
||||||
|
#ifndef XZ_INTERNAL_CRC32
|
||||||
|
# ifdef __KERNEL__
|
||||||
|
# define XZ_INTERNAL_CRC32 0
|
||||||
|
# else
|
||||||
|
# define XZ_INTERNAL_CRC32 1
|
||||||
|
# endif
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If CRC64 support has been enabled with XZ_USE_CRC64, a CRC64
|
||||||
|
* implementation is needed too.
|
||||||
|
*/
|
||||||
|
#ifndef XZ_USE_CRC64
|
||||||
|
# undef XZ_INTERNAL_CRC64
|
||||||
|
# define XZ_INTERNAL_CRC64 0
|
||||||
|
#endif
|
||||||
|
#ifndef XZ_INTERNAL_CRC64
|
||||||
|
# ifdef __KERNEL__
|
||||||
|
# error Using CRC64 in the kernel has not been implemented.
|
||||||
|
# else
|
||||||
|
# define XZ_INTERNAL_CRC64 1
|
||||||
|
# endif
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if XZ_INTERNAL_CRC32
|
||||||
|
/*
|
||||||
|
* This must be called before any other xz_* function to initialize
|
||||||
|
* the CRC32 lookup table.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN void xz_crc32_init(void);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Update CRC32 value using the polynomial from IEEE-802.3. To start a new
|
||||||
|
* calculation, the third argument must be zero. To continue the calculation,
|
||||||
|
* the previously returned value is passed as the third argument.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN uint32_t xz_crc32(const uint8_t *buf, size_t size, uint32_t crc);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if XZ_INTERNAL_CRC64
|
||||||
|
/*
|
||||||
|
* This must be called before any other xz_* function (except xz_crc32_init())
|
||||||
|
* to initialize the CRC64 lookup table.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN void xz_crc64_init(void);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Update CRC64 value using the polynomial from ECMA-182. To start a new
|
||||||
|
* calculation, the third argument must be zero. To continue the calculation,
|
||||||
|
* the previously returned value is passed as the third argument.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN uint64_t xz_crc64(const uint8_t *buf, size_t size, uint64_t crc);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef __cplusplus
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,397 @@
|
||||||
|
/*
|
||||||
|
* Wrapper for decompressing XZ-compressed kernel, initramfs, and initrd
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Important notes about in-place decompression
|
||||||
|
*
|
||||||
|
* At least on x86, the kernel is decompressed in place: the compressed data
|
||||||
|
* is placed to the end of the output buffer, and the decompressor overwrites
|
||||||
|
* most of the compressed data. There must be enough safety margin to
|
||||||
|
* guarantee that the write position is always behind the read position.
|
||||||
|
*
|
||||||
|
* The safety margin for XZ with LZMA2 or BCJ+LZMA2 is calculated below.
|
||||||
|
* Note that the margin with XZ is bigger than with Deflate (gzip)!
|
||||||
|
*
|
||||||
|
* The worst case for in-place decompression is that the beginning of
|
||||||
|
* the file is compressed extremely well, and the rest of the file is
|
||||||
|
* uncompressible. Thus, we must look for worst-case expansion when the
|
||||||
|
* compressor is encoding uncompressible data.
|
||||||
|
*
|
||||||
|
* The structure of the .xz file in case of a compresed kernel is as follows.
|
||||||
|
* Sizes (as bytes) of the fields are in parenthesis.
|
||||||
|
*
|
||||||
|
* Stream Header (12)
|
||||||
|
* Block Header:
|
||||||
|
* Block Header (8-12)
|
||||||
|
* Compressed Data (N)
|
||||||
|
* Block Padding (0-3)
|
||||||
|
* CRC32 (4)
|
||||||
|
* Index (8-20)
|
||||||
|
* Stream Footer (12)
|
||||||
|
*
|
||||||
|
* Normally there is exactly one Block, but let's assume that there are
|
||||||
|
* 2-4 Blocks just in case. Because Stream Header and also Block Header
|
||||||
|
* of the first Block don't make the decompressor produce any uncompressed
|
||||||
|
* data, we can ignore them from our calculations. Block Headers of possible
|
||||||
|
* additional Blocks have to be taken into account still. With these
|
||||||
|
* assumptions, it is safe to assume that the total header overhead is
|
||||||
|
* less than 128 bytes.
|
||||||
|
*
|
||||||
|
* Compressed Data contains LZMA2 or BCJ+LZMA2 encoded data. Since BCJ
|
||||||
|
* doesn't change the size of the data, it is enough to calculate the
|
||||||
|
* safety margin for LZMA2.
|
||||||
|
*
|
||||||
|
* LZMA2 stores the data in chunks. Each chunk has a header whose size is
|
||||||
|
* a maximum of 6 bytes, but to get round 2^n numbers, let's assume that
|
||||||
|
* the maximum chunk header size is 8 bytes. After the chunk header, there
|
||||||
|
* may be up to 64 KiB of actual payload in the chunk. Often the payload is
|
||||||
|
* quite a bit smaller though; to be safe, let's assume that an average
|
||||||
|
* chunk has only 32 KiB of payload.
|
||||||
|
*
|
||||||
|
* The maximum uncompressed size of the payload is 2 MiB. The minimum
|
||||||
|
* uncompressed size of the payload is in practice never less than the
|
||||||
|
* payload size itself. The LZMA2 format would allow uncompressed size
|
||||||
|
* to be less than the payload size, but no sane compressor creates such
|
||||||
|
* files. LZMA2 supports storing uncompressible data in uncompressed form,
|
||||||
|
* so there's never a need to create payloads whose uncompressed size is
|
||||||
|
* smaller than the compressed size.
|
||||||
|
*
|
||||||
|
* The assumption, that the uncompressed size of the payload is never
|
||||||
|
* smaller than the payload itself, is valid only when talking about
|
||||||
|
* the payload as a whole. It is possible that the payload has parts where
|
||||||
|
* the decompressor consumes more input than it produces output. Calculating
|
||||||
|
* the worst case for this would be tricky. Instead of trying to do that,
|
||||||
|
* let's simply make sure that the decompressor never overwrites any bytes
|
||||||
|
* of the payload which it is currently reading.
|
||||||
|
*
|
||||||
|
* Now we have enough information to calculate the safety margin. We need
|
||||||
|
* - 128 bytes for the .xz file format headers;
|
||||||
|
* - 8 bytes per every 32 KiB of uncompressed size (one LZMA2 chunk header
|
||||||
|
* per chunk, each chunk having average payload size of 32 KiB); and
|
||||||
|
* - 64 KiB (biggest possible LZMA2 chunk payload size) to make sure that
|
||||||
|
* the decompressor never overwrites anything from the LZMA2 chunk
|
||||||
|
* payload it is currently reading.
|
||||||
|
*
|
||||||
|
* We get the following formula:
|
||||||
|
*
|
||||||
|
* safety_margin = 128 + uncompressed_size * 8 / 32768 + 65536
|
||||||
|
* = 128 + (uncompressed_size >> 12) + 65536
|
||||||
|
*
|
||||||
|
* For comparison, according to arch/x86/boot/compressed/misc.c, the
|
||||||
|
* equivalent formula for Deflate is this:
|
||||||
|
*
|
||||||
|
* safety_margin = 18 + (uncompressed_size >> 12) + 32768
|
||||||
|
*
|
||||||
|
* Thus, when updating Deflate-only in-place kernel decompressor to
|
||||||
|
* support XZ, the fixed overhead has to be increased from 18+32768 bytes
|
||||||
|
* to 128+65536 bytes.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* STATIC is defined to "static" if we are being built for kernel
|
||||||
|
* decompression (pre-boot code). <linux/decompress/mm.h> will define
|
||||||
|
* STATIC to empty if it wasn't already defined. Since we will need to
|
||||||
|
* know later if we are being used for kernel decompression, we define
|
||||||
|
* XZ_PREBOOT here.
|
||||||
|
*/
|
||||||
|
#ifdef STATIC
|
||||||
|
# define XZ_PREBOOT
|
||||||
|
#endif
|
||||||
|
#ifdef __KERNEL__
|
||||||
|
# include <linux/decompress/mm.h>
|
||||||
|
#endif
|
||||||
|
#define XZ_EXTERN STATIC
|
||||||
|
|
||||||
|
#ifndef XZ_PREBOOT
|
||||||
|
# include <linux/slab.h>
|
||||||
|
# include <linux/xz.h>
|
||||||
|
#else
|
||||||
|
/*
|
||||||
|
* Use the internal CRC32 code instead of kernel's CRC32 module, which
|
||||||
|
* is not available in early phase of booting.
|
||||||
|
*/
|
||||||
|
#define XZ_INTERNAL_CRC32 1
|
||||||
|
|
||||||
|
/*
|
||||||
|
* For boot time use, we enable only the BCJ filter of the current
|
||||||
|
* architecture or none if no BCJ filter is available for the architecture.
|
||||||
|
*/
|
||||||
|
#ifdef CONFIG_X86
|
||||||
|
# define XZ_DEC_X86
|
||||||
|
#endif
|
||||||
|
#ifdef CONFIG_PPC
|
||||||
|
# define XZ_DEC_POWERPC
|
||||||
|
#endif
|
||||||
|
#ifdef CONFIG_ARM
|
||||||
|
# define XZ_DEC_ARM
|
||||||
|
#endif
|
||||||
|
#ifdef CONFIG_IA64
|
||||||
|
# define XZ_DEC_IA64
|
||||||
|
#endif
|
||||||
|
#ifdef CONFIG_SPARC
|
||||||
|
# define XZ_DEC_SPARC
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This will get the basic headers so that memeq() and others
|
||||||
|
* can be defined.
|
||||||
|
*/
|
||||||
|
#include "xz/xz_private.h"
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Replace the normal allocation functions with the versions from
|
||||||
|
* <linux/decompress/mm.h>. vfree() needs to support vfree(NULL)
|
||||||
|
* when XZ_DYNALLOC is used, but the pre-boot free() doesn't support it.
|
||||||
|
* Workaround it here because the other decompressors don't need it.
|
||||||
|
*/
|
||||||
|
#undef kmalloc
|
||||||
|
#undef kfree
|
||||||
|
#undef vmalloc
|
||||||
|
#undef vfree
|
||||||
|
#define kmalloc(size, flags) malloc(size)
|
||||||
|
#define kfree(ptr) free(ptr)
|
||||||
|
#define vmalloc(size) malloc(size)
|
||||||
|
#define vfree(ptr) do { if (ptr != NULL) free(ptr); } while (0)
|
||||||
|
|
||||||
|
/*
|
||||||
|
* FIXME: Not all basic memory functions are provided in architecture-specific
|
||||||
|
* files (yet). We define our own versions here for now, but this should be
|
||||||
|
* only a temporary solution.
|
||||||
|
*
|
||||||
|
* memeq and memzero are not used much and any remotely sane implementation
|
||||||
|
* is fast enough. memcpy/memmove speed matters in multi-call mode, but
|
||||||
|
* the kernel image is decompressed in single-call mode, in which only
|
||||||
|
* memcpy speed can matter and only if there is a lot of uncompressible data
|
||||||
|
* (LZMA2 stores uncompressible chunks in uncompressed form). Thus, the
|
||||||
|
* functions below should just be kept small; it's probably not worth
|
||||||
|
* optimizing for speed.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef memeq
|
||||||
|
static bool memeq(const void *a, const void *b, size_t size)
|
||||||
|
{
|
||||||
|
const uint8_t *x = a;
|
||||||
|
const uint8_t *y = b;
|
||||||
|
size_t i;
|
||||||
|
|
||||||
|
for (i = 0; i < size; ++i)
|
||||||
|
if (x[i] != y[i])
|
||||||
|
return false;
|
||||||
|
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef memzero
|
||||||
|
static void memzero(void *buf, size_t size)
|
||||||
|
{
|
||||||
|
uint8_t *b = buf;
|
||||||
|
uint8_t *e = b + size;
|
||||||
|
|
||||||
|
while (b != e)
|
||||||
|
*b++ = '\0';
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if 0
|
||||||
|
/* Not static to avoid a conflict with the prototype in the Linux headers. */
|
||||||
|
void *memmove(void *dest, const void *src, size_t size)
|
||||||
|
{
|
||||||
|
uint8_t *d = dest;
|
||||||
|
const uint8_t *s = src;
|
||||||
|
size_t i;
|
||||||
|
|
||||||
|
if (d < s) {
|
||||||
|
for (i = 0; i < size; ++i)
|
||||||
|
d[i] = s[i];
|
||||||
|
} else if (d > s) {
|
||||||
|
i = size;
|
||||||
|
while (i-- > 0)
|
||||||
|
d[i] = s[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
return dest;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Since we need memmove anyway, would use it as memcpy too.
|
||||||
|
* Commented out for now to avoid breaking things.
|
||||||
|
*/
|
||||||
|
/*
|
||||||
|
#ifndef memcpy
|
||||||
|
# define memcpy memmove
|
||||||
|
#endif
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "xz/xz_crc32.c"
|
||||||
|
#include "xz/xz_dec_stream.c"
|
||||||
|
#include "xz/xz_dec_lzma2.c"
|
||||||
|
#include "xz/xz_dec_bcj.c"
|
||||||
|
|
||||||
|
#endif /* XZ_PREBOOT */
|
||||||
|
|
||||||
|
/* Size of the input and output buffers in multi-call mode */
|
||||||
|
#define XZ_IOBUF_SIZE 4096
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This function implements the API defined in <linux/decompress/generic.h>.
|
||||||
|
*
|
||||||
|
* This wrapper will automatically choose single-call or multi-call mode
|
||||||
|
* of the native XZ decoder API. The single-call mode can be used only when
|
||||||
|
* both input and output buffers are available as a single chunk, i.e. when
|
||||||
|
* fill() and flush() won't be used.
|
||||||
|
*/
|
||||||
|
int unxz(unsigned char *in, int in_size,
|
||||||
|
int (*fill)(void *dest, unsigned int size),
|
||||||
|
int (*flush)(void *src, unsigned int size),
|
||||||
|
unsigned char *out, int *in_used,
|
||||||
|
void (*error)(char *x))
|
||||||
|
{
|
||||||
|
struct xz_buf b;
|
||||||
|
struct xz_dec *s;
|
||||||
|
enum xz_ret ret;
|
||||||
|
bool must_free_in = false;
|
||||||
|
|
||||||
|
#if XZ_INTERNAL_CRC32
|
||||||
|
xz_crc32_init();
|
||||||
|
#endif
|
||||||
|
|
||||||
|
if (in_used != NULL)
|
||||||
|
*in_used = 0;
|
||||||
|
|
||||||
|
if (fill == NULL && flush == NULL)
|
||||||
|
s = xz_dec_init(XZ_SINGLE, 0);
|
||||||
|
else
|
||||||
|
s = xz_dec_init(XZ_DYNALLOC, (uint32_t)-1);
|
||||||
|
|
||||||
|
if (s == NULL)
|
||||||
|
goto error_alloc_state;
|
||||||
|
|
||||||
|
if (flush == NULL) {
|
||||||
|
b.out = out;
|
||||||
|
b.out_size = (size_t)-1;
|
||||||
|
} else {
|
||||||
|
b.out_size = XZ_IOBUF_SIZE;
|
||||||
|
b.out = malloc(XZ_IOBUF_SIZE);
|
||||||
|
if (b.out == NULL)
|
||||||
|
goto error_alloc_out;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (in == NULL) {
|
||||||
|
must_free_in = true;
|
||||||
|
in = malloc(XZ_IOBUF_SIZE);
|
||||||
|
if (in == NULL)
|
||||||
|
goto error_alloc_in;
|
||||||
|
}
|
||||||
|
|
||||||
|
b.in = in;
|
||||||
|
b.in_pos = 0;
|
||||||
|
b.in_size = in_size;
|
||||||
|
b.out_pos = 0;
|
||||||
|
|
||||||
|
if (fill == NULL && flush == NULL) {
|
||||||
|
ret = xz_dec_run(s, &b);
|
||||||
|
} else {
|
||||||
|
do {
|
||||||
|
if (b.in_pos == b.in_size && fill != NULL) {
|
||||||
|
if (in_used != NULL)
|
||||||
|
*in_used += b.in_pos;
|
||||||
|
|
||||||
|
b.in_pos = 0;
|
||||||
|
|
||||||
|
in_size = fill(in, XZ_IOBUF_SIZE);
|
||||||
|
if (in_size < 0) {
|
||||||
|
/*
|
||||||
|
* This isn't an optimal error code
|
||||||
|
* but it probably isn't worth making
|
||||||
|
* a new one either.
|
||||||
|
*/
|
||||||
|
ret = XZ_BUF_ERROR;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
b.in_size = in_size;
|
||||||
|
}
|
||||||
|
|
||||||
|
ret = xz_dec_run(s, &b);
|
||||||
|
|
||||||
|
if (flush != NULL && (b.out_pos == b.out_size
|
||||||
|
|| (ret != XZ_OK && b.out_pos > 0))) {
|
||||||
|
/*
|
||||||
|
* Setting ret here may hide an error
|
||||||
|
* returned by xz_dec_run(), but probably
|
||||||
|
* it's not too bad.
|
||||||
|
*/
|
||||||
|
if (flush(b.out, b.out_pos) != (int)b.out_pos)
|
||||||
|
ret = XZ_BUF_ERROR;
|
||||||
|
|
||||||
|
b.out_pos = 0;
|
||||||
|
}
|
||||||
|
} while (ret == XZ_OK);
|
||||||
|
|
||||||
|
if (must_free_in)
|
||||||
|
free(in);
|
||||||
|
|
||||||
|
if (flush != NULL)
|
||||||
|
free(b.out);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (in_used != NULL)
|
||||||
|
*in_used += b.in_pos;
|
||||||
|
|
||||||
|
xz_dec_end(s);
|
||||||
|
|
||||||
|
switch (ret) {
|
||||||
|
case XZ_STREAM_END:
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
case XZ_MEM_ERROR:
|
||||||
|
/* This can occur only in multi-call mode. */
|
||||||
|
error("XZ decompressor ran out of memory");
|
||||||
|
break;
|
||||||
|
|
||||||
|
case XZ_FORMAT_ERROR:
|
||||||
|
error("Input is not in the XZ format (wrong magic bytes)");
|
||||||
|
break;
|
||||||
|
|
||||||
|
case XZ_OPTIONS_ERROR:
|
||||||
|
error("Input was encoded with settings that are not "
|
||||||
|
"supported by this XZ decoder");
|
||||||
|
break;
|
||||||
|
|
||||||
|
case XZ_DATA_ERROR:
|
||||||
|
case XZ_BUF_ERROR:
|
||||||
|
error("XZ-compressed data is corrupt");
|
||||||
|
break;
|
||||||
|
|
||||||
|
default:
|
||||||
|
error("Bug in the XZ decompressor");
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
return -1;
|
||||||
|
|
||||||
|
error_alloc_in:
|
||||||
|
if (flush != NULL)
|
||||||
|
free(b.out);
|
||||||
|
|
||||||
|
error_alloc_out:
|
||||||
|
xz_dec_end(s);
|
||||||
|
|
||||||
|
error_alloc_state:
|
||||||
|
error("XZ decompressor ran out of memory");
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This macro is used by architecture-specific files to decompress
|
||||||
|
* the kernel image.
|
||||||
|
*/
|
||||||
|
#define decompress unxz
|
||||||
|
|
@ -0,0 +1,57 @@
|
||||||
|
config XZ_DEC
|
||||||
|
tristate "XZ decompression support"
|
||||||
|
select CRC32
|
||||||
|
help
|
||||||
|
LZMA2 compression algorithm and BCJ filters are supported using
|
||||||
|
the .xz file format as the container. For integrity checking,
|
||||||
|
CRC32 is supported. See Documentation/xz.txt for more information.
|
||||||
|
|
||||||
|
if XZ_DEC
|
||||||
|
|
||||||
|
config XZ_DEC_X86
|
||||||
|
bool "x86 BCJ filter decoder"
|
||||||
|
default y if X86
|
||||||
|
select XZ_DEC_BCJ
|
||||||
|
|
||||||
|
config XZ_DEC_POWERPC
|
||||||
|
bool "PowerPC BCJ filter decoder"
|
||||||
|
default y if PPC
|
||||||
|
select XZ_DEC_BCJ
|
||||||
|
|
||||||
|
config XZ_DEC_IA64
|
||||||
|
bool "IA-64 BCJ filter decoder"
|
||||||
|
default y if IA64
|
||||||
|
select XZ_DEC_BCJ
|
||||||
|
|
||||||
|
config XZ_DEC_ARM
|
||||||
|
bool "ARM BCJ filter decoder"
|
||||||
|
default y if ARM
|
||||||
|
select XZ_DEC_BCJ
|
||||||
|
|
||||||
|
config XZ_DEC_ARMTHUMB
|
||||||
|
bool "ARM-Thumb BCJ filter decoder"
|
||||||
|
default y if (ARM && ARM_THUMB)
|
||||||
|
select XZ_DEC_BCJ
|
||||||
|
|
||||||
|
config XZ_DEC_SPARC
|
||||||
|
bool "SPARC BCJ filter decoder"
|
||||||
|
default y if SPARC
|
||||||
|
select XZ_DEC_BCJ
|
||||||
|
|
||||||
|
endif
|
||||||
|
|
||||||
|
config XZ_DEC_BCJ
|
||||||
|
bool
|
||||||
|
default n
|
||||||
|
|
||||||
|
config XZ_DEC_TEST
|
||||||
|
tristate "XZ decompressor tester"
|
||||||
|
default n
|
||||||
|
depends on XZ_DEC
|
||||||
|
help
|
||||||
|
This allows passing .xz files to the in-kernel XZ decoder via
|
||||||
|
a character special file. It calculates CRC32 of the decompressed
|
||||||
|
data and writes diagnostics to the system log.
|
||||||
|
|
||||||
|
Unless you are developing the XZ decoder, you don't need this
|
||||||
|
and should say N.
|
||||||
|
|
@ -0,0 +1,5 @@
|
||||||
|
obj-$(CONFIG_XZ_DEC) += xz_dec.o
|
||||||
|
xz_dec-y := xz_dec_syms.o xz_dec_stream.o xz_dec_lzma2.o
|
||||||
|
xz_dec-$(CONFIG_XZ_DEC_BCJ) += xz_dec_bcj.o
|
||||||
|
|
||||||
|
obj-$(CONFIG_XZ_DEC_TEST) += xz_dec_test.o
|
||||||
|
|
@ -0,0 +1,59 @@
|
||||||
|
/*
|
||||||
|
* CRC32 using the polynomial from IEEE-802.3
|
||||||
|
*
|
||||||
|
* Authors: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
* Igor Pavlov <http://7-zip.org/>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This is not the fastest implementation, but it is pretty compact.
|
||||||
|
* The fastest versions of xz_crc32() on modern CPUs without hardware
|
||||||
|
* accelerated CRC instruction are 3-5 times as fast as this version,
|
||||||
|
* but they are bigger and use more memory for the lookup table.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "xz_private.h"
|
||||||
|
|
||||||
|
/*
|
||||||
|
* STATIC_RW_DATA is used in the pre-boot environment on some architectures.
|
||||||
|
* See <linux/decompress/mm.h> for details.
|
||||||
|
*/
|
||||||
|
#ifndef STATIC_RW_DATA
|
||||||
|
# define STATIC_RW_DATA static
|
||||||
|
#endif
|
||||||
|
|
||||||
|
STATIC_RW_DATA uint32_t xz_crc32_table[256];
|
||||||
|
|
||||||
|
XZ_EXTERN void xz_crc32_init(void)
|
||||||
|
{
|
||||||
|
const uint32_t poly = 0xEDB88320;
|
||||||
|
|
||||||
|
uint32_t i;
|
||||||
|
uint32_t j;
|
||||||
|
uint32_t r;
|
||||||
|
|
||||||
|
for (i = 0; i < 256; ++i) {
|
||||||
|
r = i;
|
||||||
|
for (j = 0; j < 8; ++j)
|
||||||
|
r = (r >> 1) ^ (poly & ~((r & 1) - 1));
|
||||||
|
|
||||||
|
xz_crc32_table[i] = r;
|
||||||
|
}
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
XZ_EXTERN uint32_t xz_crc32(const uint8_t *buf, size_t size, uint32_t crc)
|
||||||
|
{
|
||||||
|
crc = ~crc;
|
||||||
|
|
||||||
|
while (size != 0) {
|
||||||
|
crc = xz_crc32_table[*buf++ ^ (crc & 0xFF)] ^ (crc >> 8);
|
||||||
|
--size;
|
||||||
|
}
|
||||||
|
|
||||||
|
return ~crc;
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,50 @@
|
||||||
|
/*
|
||||||
|
* CRC64 using the polynomial from ECMA-182
|
||||||
|
*
|
||||||
|
* This file is similar to xz_crc32.c. See the comments there.
|
||||||
|
*
|
||||||
|
* Authors: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
* Igor Pavlov <http://7-zip.org/>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "xz_private.h"
|
||||||
|
|
||||||
|
#ifndef STATIC_RW_DATA
|
||||||
|
# define STATIC_RW_DATA static
|
||||||
|
#endif
|
||||||
|
|
||||||
|
STATIC_RW_DATA uint64_t xz_crc64_table[256];
|
||||||
|
|
||||||
|
XZ_EXTERN void xz_crc64_init(void)
|
||||||
|
{
|
||||||
|
const uint64_t poly = 0xC96C5795D7870F42;
|
||||||
|
|
||||||
|
uint32_t i;
|
||||||
|
uint32_t j;
|
||||||
|
uint64_t r;
|
||||||
|
|
||||||
|
for (i = 0; i < 256; ++i) {
|
||||||
|
r = i;
|
||||||
|
for (j = 0; j < 8; ++j)
|
||||||
|
r = (r >> 1) ^ (poly & ~((r & 1) - 1));
|
||||||
|
|
||||||
|
xz_crc64_table[i] = r;
|
||||||
|
}
|
||||||
|
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
XZ_EXTERN uint64_t xz_crc64(const uint8_t *buf, size_t size, uint64_t crc)
|
||||||
|
{
|
||||||
|
crc = ~crc;
|
||||||
|
|
||||||
|
while (size != 0) {
|
||||||
|
crc = xz_crc64_table[*buf++ ^ (crc & 0xFF)] ^ (crc >> 8);
|
||||||
|
--size;
|
||||||
|
}
|
||||||
|
|
||||||
|
return ~crc;
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,574 @@
|
||||||
|
/*
|
||||||
|
* Branch/Call/Jump (BCJ) filter decoders
|
||||||
|
*
|
||||||
|
* Authors: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
* Igor Pavlov <http://7-zip.org/>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "xz_private.h"
|
||||||
|
|
||||||
|
/*
|
||||||
|
* The rest of the file is inside this ifdef. It makes things a little more
|
||||||
|
* convenient when building without support for any BCJ filters.
|
||||||
|
*/
|
||||||
|
#ifdef XZ_DEC_BCJ
|
||||||
|
|
||||||
|
struct xz_dec_bcj {
|
||||||
|
/* Type of the BCJ filter being used */
|
||||||
|
enum {
|
||||||
|
BCJ_X86 = 4, /* x86 or x86-64 */
|
||||||
|
BCJ_POWERPC = 5, /* Big endian only */
|
||||||
|
BCJ_IA64 = 6, /* Big or little endian */
|
||||||
|
BCJ_ARM = 7, /* Little endian only */
|
||||||
|
BCJ_ARMTHUMB = 8, /* Little endian only */
|
||||||
|
BCJ_SPARC = 9 /* Big or little endian */
|
||||||
|
} type;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Return value of the next filter in the chain. We need to preserve
|
||||||
|
* this information across calls, because we must not call the next
|
||||||
|
* filter anymore once it has returned XZ_STREAM_END.
|
||||||
|
*/
|
||||||
|
enum xz_ret ret;
|
||||||
|
|
||||||
|
/* True if we are operating in single-call mode. */
|
||||||
|
bool single_call;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Absolute position relative to the beginning of the uncompressed
|
||||||
|
* data (in a single .xz Block). We care only about the lowest 32
|
||||||
|
* bits so this doesn't need to be uint64_t even with big files.
|
||||||
|
*/
|
||||||
|
uint32_t pos;
|
||||||
|
|
||||||
|
/* x86 filter state */
|
||||||
|
uint32_t x86_prev_mask;
|
||||||
|
|
||||||
|
/* Temporary space to hold the variables from struct xz_buf */
|
||||||
|
uint8_t *out;
|
||||||
|
size_t out_pos;
|
||||||
|
size_t out_size;
|
||||||
|
|
||||||
|
struct {
|
||||||
|
/* Amount of already filtered data in the beginning of buf */
|
||||||
|
size_t filtered;
|
||||||
|
|
||||||
|
/* Total amount of data currently stored in buf */
|
||||||
|
size_t size;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Buffer to hold a mix of filtered and unfiltered data. This
|
||||||
|
* needs to be big enough to hold Alignment + 2 * Look-ahead:
|
||||||
|
*
|
||||||
|
* Type Alignment Look-ahead
|
||||||
|
* x86 1 4
|
||||||
|
* PowerPC 4 0
|
||||||
|
* IA-64 16 0
|
||||||
|
* ARM 4 0
|
||||||
|
* ARM-Thumb 2 2
|
||||||
|
* SPARC 4 0
|
||||||
|
*/
|
||||||
|
uint8_t buf[16];
|
||||||
|
} temp;
|
||||||
|
};
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_X86
|
||||||
|
/*
|
||||||
|
* This is used to test the most significant byte of a memory address
|
||||||
|
* in an x86 instruction.
|
||||||
|
*/
|
||||||
|
static inline int bcj_x86_test_msbyte(uint8_t b)
|
||||||
|
{
|
||||||
|
return b == 0x00 || b == 0xFF;
|
||||||
|
}
|
||||||
|
|
||||||
|
static size_t bcj_x86(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
|
||||||
|
{
|
||||||
|
static const bool mask_to_allowed_status[8]
|
||||||
|
= { true, true, true, false, true, false, false, false };
|
||||||
|
|
||||||
|
static const uint8_t mask_to_bit_num[8] = { 0, 1, 2, 2, 3, 3, 3, 3 };
|
||||||
|
|
||||||
|
size_t i;
|
||||||
|
size_t prev_pos = (size_t)-1;
|
||||||
|
uint32_t prev_mask = s->x86_prev_mask;
|
||||||
|
uint32_t src;
|
||||||
|
uint32_t dest;
|
||||||
|
uint32_t j;
|
||||||
|
uint8_t b;
|
||||||
|
|
||||||
|
if (size <= 4)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
size -= 4;
|
||||||
|
for (i = 0; i < size; ++i) {
|
||||||
|
if ((buf[i] & 0xFE) != 0xE8)
|
||||||
|
continue;
|
||||||
|
|
||||||
|
prev_pos = i - prev_pos;
|
||||||
|
if (prev_pos > 3) {
|
||||||
|
prev_mask = 0;
|
||||||
|
} else {
|
||||||
|
prev_mask = (prev_mask << (prev_pos - 1)) & 7;
|
||||||
|
if (prev_mask != 0) {
|
||||||
|
b = buf[i + 4 - mask_to_bit_num[prev_mask]];
|
||||||
|
if (!mask_to_allowed_status[prev_mask]
|
||||||
|
|| bcj_x86_test_msbyte(b)) {
|
||||||
|
prev_pos = i;
|
||||||
|
prev_mask = (prev_mask << 1) | 1;
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
prev_pos = i;
|
||||||
|
|
||||||
|
if (bcj_x86_test_msbyte(buf[i + 4])) {
|
||||||
|
src = get_unaligned_le32(buf + i + 1);
|
||||||
|
while (true) {
|
||||||
|
dest = src - (s->pos + (uint32_t)i + 5);
|
||||||
|
if (prev_mask == 0)
|
||||||
|
break;
|
||||||
|
|
||||||
|
j = mask_to_bit_num[prev_mask] * 8;
|
||||||
|
b = (uint8_t)(dest >> (24 - j));
|
||||||
|
if (!bcj_x86_test_msbyte(b))
|
||||||
|
break;
|
||||||
|
|
||||||
|
src = dest ^ (((uint32_t)1 << (32 - j)) - 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
dest &= 0x01FFFFFF;
|
||||||
|
dest |= (uint32_t)0 - (dest & 0x01000000);
|
||||||
|
put_unaligned_le32(dest, buf + i + 1);
|
||||||
|
i += 4;
|
||||||
|
} else {
|
||||||
|
prev_mask = (prev_mask << 1) | 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
prev_pos = i - prev_pos;
|
||||||
|
s->x86_prev_mask = prev_pos > 3 ? 0 : prev_mask << (prev_pos - 1);
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_POWERPC
|
||||||
|
static size_t bcj_powerpc(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
|
||||||
|
{
|
||||||
|
size_t i;
|
||||||
|
uint32_t instr;
|
||||||
|
|
||||||
|
for (i = 0; i + 4 <= size; i += 4) {
|
||||||
|
instr = get_unaligned_be32(buf + i);
|
||||||
|
if ((instr & 0xFC000003) == 0x48000001) {
|
||||||
|
instr &= 0x03FFFFFC;
|
||||||
|
instr -= s->pos + (uint32_t)i;
|
||||||
|
instr &= 0x03FFFFFC;
|
||||||
|
instr |= 0x48000001;
|
||||||
|
put_unaligned_be32(instr, buf + i);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_IA64
|
||||||
|
static size_t bcj_ia64(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
|
||||||
|
{
|
||||||
|
static const uint8_t branch_table[32] = {
|
||||||
|
0, 0, 0, 0, 0, 0, 0, 0,
|
||||||
|
0, 0, 0, 0, 0, 0, 0, 0,
|
||||||
|
4, 4, 6, 6, 0, 0, 7, 7,
|
||||||
|
4, 4, 0, 0, 4, 4, 0, 0
|
||||||
|
};
|
||||||
|
|
||||||
|
/*
|
||||||
|
* The local variables take a little bit stack space, but it's less
|
||||||
|
* than what LZMA2 decoder takes, so it doesn't make sense to reduce
|
||||||
|
* stack usage here without doing that for the LZMA2 decoder too.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/* Loop counters */
|
||||||
|
size_t i;
|
||||||
|
size_t j;
|
||||||
|
|
||||||
|
/* Instruction slot (0, 1, or 2) in the 128-bit instruction word */
|
||||||
|
uint32_t slot;
|
||||||
|
|
||||||
|
/* Bitwise offset of the instruction indicated by slot */
|
||||||
|
uint32_t bit_pos;
|
||||||
|
|
||||||
|
/* bit_pos split into byte and bit parts */
|
||||||
|
uint32_t byte_pos;
|
||||||
|
uint32_t bit_res;
|
||||||
|
|
||||||
|
/* Address part of an instruction */
|
||||||
|
uint32_t addr;
|
||||||
|
|
||||||
|
/* Mask used to detect which instructions to convert */
|
||||||
|
uint32_t mask;
|
||||||
|
|
||||||
|
/* 41-bit instruction stored somewhere in the lowest 48 bits */
|
||||||
|
uint64_t instr;
|
||||||
|
|
||||||
|
/* Instruction normalized with bit_res for easier manipulation */
|
||||||
|
uint64_t norm;
|
||||||
|
|
||||||
|
for (i = 0; i + 16 <= size; i += 16) {
|
||||||
|
mask = branch_table[buf[i] & 0x1F];
|
||||||
|
for (slot = 0, bit_pos = 5; slot < 3; ++slot, bit_pos += 41) {
|
||||||
|
if (((mask >> slot) & 1) == 0)
|
||||||
|
continue;
|
||||||
|
|
||||||
|
byte_pos = bit_pos >> 3;
|
||||||
|
bit_res = bit_pos & 7;
|
||||||
|
instr = 0;
|
||||||
|
for (j = 0; j < 6; ++j)
|
||||||
|
instr |= (uint64_t)(buf[i + j + byte_pos])
|
||||||
|
<< (8 * j);
|
||||||
|
|
||||||
|
norm = instr >> bit_res;
|
||||||
|
|
||||||
|
if (((norm >> 37) & 0x0F) == 0x05
|
||||||
|
&& ((norm >> 9) & 0x07) == 0) {
|
||||||
|
addr = (norm >> 13) & 0x0FFFFF;
|
||||||
|
addr |= ((uint32_t)(norm >> 36) & 1) << 20;
|
||||||
|
addr <<= 4;
|
||||||
|
addr -= s->pos + (uint32_t)i;
|
||||||
|
addr >>= 4;
|
||||||
|
|
||||||
|
norm &= ~((uint64_t)0x8FFFFF << 13);
|
||||||
|
norm |= (uint64_t)(addr & 0x0FFFFF) << 13;
|
||||||
|
norm |= (uint64_t)(addr & 0x100000)
|
||||||
|
<< (36 - 20);
|
||||||
|
|
||||||
|
instr &= (1 << bit_res) - 1;
|
||||||
|
instr |= norm << bit_res;
|
||||||
|
|
||||||
|
for (j = 0; j < 6; j++)
|
||||||
|
buf[i + j + byte_pos]
|
||||||
|
= (uint8_t)(instr >> (8 * j));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_ARM
|
||||||
|
static size_t bcj_arm(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
|
||||||
|
{
|
||||||
|
size_t i;
|
||||||
|
uint32_t addr;
|
||||||
|
|
||||||
|
for (i = 0; i + 4 <= size; i += 4) {
|
||||||
|
if (buf[i + 3] == 0xEB) {
|
||||||
|
addr = (uint32_t)buf[i] | ((uint32_t)buf[i + 1] << 8)
|
||||||
|
| ((uint32_t)buf[i + 2] << 16);
|
||||||
|
addr <<= 2;
|
||||||
|
addr -= s->pos + (uint32_t)i + 8;
|
||||||
|
addr >>= 2;
|
||||||
|
buf[i] = (uint8_t)addr;
|
||||||
|
buf[i + 1] = (uint8_t)(addr >> 8);
|
||||||
|
buf[i + 2] = (uint8_t)(addr >> 16);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_ARMTHUMB
|
||||||
|
static size_t bcj_armthumb(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
|
||||||
|
{
|
||||||
|
size_t i;
|
||||||
|
uint32_t addr;
|
||||||
|
|
||||||
|
for (i = 0; i + 4 <= size; i += 2) {
|
||||||
|
if ((buf[i + 1] & 0xF8) == 0xF0
|
||||||
|
&& (buf[i + 3] & 0xF8) == 0xF8) {
|
||||||
|
addr = (((uint32_t)buf[i + 1] & 0x07) << 19)
|
||||||
|
| ((uint32_t)buf[i] << 11)
|
||||||
|
| (((uint32_t)buf[i + 3] & 0x07) << 8)
|
||||||
|
| (uint32_t)buf[i + 2];
|
||||||
|
addr <<= 1;
|
||||||
|
addr -= s->pos + (uint32_t)i + 4;
|
||||||
|
addr >>= 1;
|
||||||
|
buf[i + 1] = (uint8_t)(0xF0 | ((addr >> 19) & 0x07));
|
||||||
|
buf[i] = (uint8_t)(addr >> 11);
|
||||||
|
buf[i + 3] = (uint8_t)(0xF8 | ((addr >> 8) & 0x07));
|
||||||
|
buf[i + 2] = (uint8_t)addr;
|
||||||
|
i += 2;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_SPARC
|
||||||
|
static size_t bcj_sparc(struct xz_dec_bcj *s, uint8_t *buf, size_t size)
|
||||||
|
{
|
||||||
|
size_t i;
|
||||||
|
uint32_t instr;
|
||||||
|
|
||||||
|
for (i = 0; i + 4 <= size; i += 4) {
|
||||||
|
instr = get_unaligned_be32(buf + i);
|
||||||
|
if ((instr >> 22) == 0x100 || (instr >> 22) == 0x1FF) {
|
||||||
|
instr <<= 2;
|
||||||
|
instr -= s->pos + (uint32_t)i;
|
||||||
|
instr >>= 2;
|
||||||
|
instr = ((uint32_t)0x40000000 - (instr & 0x400000))
|
||||||
|
| 0x40000000 | (instr & 0x3FFFFF);
|
||||||
|
put_unaligned_be32(instr, buf + i);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Apply the selected BCJ filter. Update *pos and s->pos to match the amount
|
||||||
|
* of data that got filtered.
|
||||||
|
*
|
||||||
|
* NOTE: This is implemented as a switch statement to avoid using function
|
||||||
|
* pointers, which could be problematic in the kernel boot code, which must
|
||||||
|
* avoid pointers to static data (at least on x86).
|
||||||
|
*/
|
||||||
|
static void bcj_apply(struct xz_dec_bcj *s,
|
||||||
|
uint8_t *buf, size_t *pos, size_t size)
|
||||||
|
{
|
||||||
|
size_t filtered;
|
||||||
|
|
||||||
|
buf += *pos;
|
||||||
|
size -= *pos;
|
||||||
|
|
||||||
|
switch (s->type) {
|
||||||
|
#ifdef XZ_DEC_X86
|
||||||
|
case BCJ_X86:
|
||||||
|
filtered = bcj_x86(s, buf, size);
|
||||||
|
break;
|
||||||
|
#endif
|
||||||
|
#ifdef XZ_DEC_POWERPC
|
||||||
|
case BCJ_POWERPC:
|
||||||
|
filtered = bcj_powerpc(s, buf, size);
|
||||||
|
break;
|
||||||
|
#endif
|
||||||
|
#ifdef XZ_DEC_IA64
|
||||||
|
case BCJ_IA64:
|
||||||
|
filtered = bcj_ia64(s, buf, size);
|
||||||
|
break;
|
||||||
|
#endif
|
||||||
|
#ifdef XZ_DEC_ARM
|
||||||
|
case BCJ_ARM:
|
||||||
|
filtered = bcj_arm(s, buf, size);
|
||||||
|
break;
|
||||||
|
#endif
|
||||||
|
#ifdef XZ_DEC_ARMTHUMB
|
||||||
|
case BCJ_ARMTHUMB:
|
||||||
|
filtered = bcj_armthumb(s, buf, size);
|
||||||
|
break;
|
||||||
|
#endif
|
||||||
|
#ifdef XZ_DEC_SPARC
|
||||||
|
case BCJ_SPARC:
|
||||||
|
filtered = bcj_sparc(s, buf, size);
|
||||||
|
break;
|
||||||
|
#endif
|
||||||
|
default:
|
||||||
|
/* Never reached but silence compiler warnings. */
|
||||||
|
filtered = 0;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
*pos += filtered;
|
||||||
|
s->pos += filtered;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Flush pending filtered data from temp to the output buffer.
|
||||||
|
* Move the remaining mixture of possibly filtered and unfiltered
|
||||||
|
* data to the beginning of temp.
|
||||||
|
*/
|
||||||
|
static void bcj_flush(struct xz_dec_bcj *s, struct xz_buf *b)
|
||||||
|
{
|
||||||
|
size_t copy_size;
|
||||||
|
|
||||||
|
copy_size = min_t(size_t, s->temp.filtered, b->out_size - b->out_pos);
|
||||||
|
memcpy(b->out + b->out_pos, s->temp.buf, copy_size);
|
||||||
|
b->out_pos += copy_size;
|
||||||
|
|
||||||
|
s->temp.filtered -= copy_size;
|
||||||
|
s->temp.size -= copy_size;
|
||||||
|
memmove(s->temp.buf, s->temp.buf + copy_size, s->temp.size);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* The BCJ filter functions are primitive in sense that they process the
|
||||||
|
* data in chunks of 1-16 bytes. To hide this issue, this function does
|
||||||
|
* some buffering.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN enum xz_ret xz_dec_bcj_run(struct xz_dec_bcj *s,
|
||||||
|
struct xz_dec_lzma2 *lzma2,
|
||||||
|
struct xz_buf *b)
|
||||||
|
{
|
||||||
|
size_t out_start;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Flush pending already filtered data to the output buffer. Return
|
||||||
|
* immediatelly if we couldn't flush everything, or if the next
|
||||||
|
* filter in the chain had already returned XZ_STREAM_END.
|
||||||
|
*/
|
||||||
|
if (s->temp.filtered > 0) {
|
||||||
|
bcj_flush(s, b);
|
||||||
|
if (s->temp.filtered > 0)
|
||||||
|
return XZ_OK;
|
||||||
|
|
||||||
|
if (s->ret == XZ_STREAM_END)
|
||||||
|
return XZ_STREAM_END;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If we have more output space than what is currently pending in
|
||||||
|
* temp, copy the unfiltered data from temp to the output buffer
|
||||||
|
* and try to fill the output buffer by decoding more data from the
|
||||||
|
* next filter in the chain. Apply the BCJ filter on the new data
|
||||||
|
* in the output buffer. If everything cannot be filtered, copy it
|
||||||
|
* to temp and rewind the output buffer position accordingly.
|
||||||
|
*
|
||||||
|
* This needs to be always run when temp.size == 0 to handle a special
|
||||||
|
* case where the output buffer is full and the next filter has no
|
||||||
|
* more output coming but hasn't returned XZ_STREAM_END yet.
|
||||||
|
*/
|
||||||
|
if (s->temp.size < b->out_size - b->out_pos || s->temp.size == 0) {
|
||||||
|
out_start = b->out_pos;
|
||||||
|
memcpy(b->out + b->out_pos, s->temp.buf, s->temp.size);
|
||||||
|
b->out_pos += s->temp.size;
|
||||||
|
|
||||||
|
s->ret = xz_dec_lzma2_run(lzma2, b);
|
||||||
|
if (s->ret != XZ_STREAM_END
|
||||||
|
&& (s->ret != XZ_OK || s->single_call))
|
||||||
|
return s->ret;
|
||||||
|
|
||||||
|
bcj_apply(s, b->out, &out_start, b->out_pos);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* As an exception, if the next filter returned XZ_STREAM_END,
|
||||||
|
* we can do that too, since the last few bytes that remain
|
||||||
|
* unfiltered are meant to remain unfiltered.
|
||||||
|
*/
|
||||||
|
if (s->ret == XZ_STREAM_END)
|
||||||
|
return XZ_STREAM_END;
|
||||||
|
|
||||||
|
s->temp.size = b->out_pos - out_start;
|
||||||
|
b->out_pos -= s->temp.size;
|
||||||
|
memcpy(s->temp.buf, b->out + b->out_pos, s->temp.size);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If there wasn't enough input to the next filter to fill
|
||||||
|
* the output buffer with unfiltered data, there's no point
|
||||||
|
* to try decoding more data to temp.
|
||||||
|
*/
|
||||||
|
if (b->out_pos + s->temp.size < b->out_size)
|
||||||
|
return XZ_OK;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* We have unfiltered data in temp. If the output buffer isn't full
|
||||||
|
* yet, try to fill the temp buffer by decoding more data from the
|
||||||
|
* next filter. Apply the BCJ filter on temp. Then we hopefully can
|
||||||
|
* fill the actual output buffer by copying filtered data from temp.
|
||||||
|
* A mix of filtered and unfiltered data may be left in temp; it will
|
||||||
|
* be taken care on the next call to this function.
|
||||||
|
*/
|
||||||
|
if (b->out_pos < b->out_size) {
|
||||||
|
/* Make b->out{,_pos,_size} temporarily point to s->temp. */
|
||||||
|
s->out = b->out;
|
||||||
|
s->out_pos = b->out_pos;
|
||||||
|
s->out_size = b->out_size;
|
||||||
|
b->out = s->temp.buf;
|
||||||
|
b->out_pos = s->temp.size;
|
||||||
|
b->out_size = sizeof(s->temp.buf);
|
||||||
|
|
||||||
|
s->ret = xz_dec_lzma2_run(lzma2, b);
|
||||||
|
|
||||||
|
s->temp.size = b->out_pos;
|
||||||
|
b->out = s->out;
|
||||||
|
b->out_pos = s->out_pos;
|
||||||
|
b->out_size = s->out_size;
|
||||||
|
|
||||||
|
if (s->ret != XZ_OK && s->ret != XZ_STREAM_END)
|
||||||
|
return s->ret;
|
||||||
|
|
||||||
|
bcj_apply(s, s->temp.buf, &s->temp.filtered, s->temp.size);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If the next filter returned XZ_STREAM_END, we mark that
|
||||||
|
* everything is filtered, since the last unfiltered bytes
|
||||||
|
* of the stream are meant to be left as is.
|
||||||
|
*/
|
||||||
|
if (s->ret == XZ_STREAM_END)
|
||||||
|
s->temp.filtered = s->temp.size;
|
||||||
|
|
||||||
|
bcj_flush(s, b);
|
||||||
|
if (s->temp.filtered > 0)
|
||||||
|
return XZ_OK;
|
||||||
|
}
|
||||||
|
|
||||||
|
return s->ret;
|
||||||
|
}
|
||||||
|
|
||||||
|
XZ_EXTERN struct xz_dec_bcj *xz_dec_bcj_create(bool single_call)
|
||||||
|
{
|
||||||
|
struct xz_dec_bcj *s = kmalloc(sizeof(*s), GFP_KERNEL);
|
||||||
|
if (s != NULL)
|
||||||
|
s->single_call = single_call;
|
||||||
|
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
|
||||||
|
XZ_EXTERN enum xz_ret xz_dec_bcj_reset(struct xz_dec_bcj *s, uint8_t id)
|
||||||
|
{
|
||||||
|
switch (id) {
|
||||||
|
#ifdef XZ_DEC_X86
|
||||||
|
case BCJ_X86:
|
||||||
|
#endif
|
||||||
|
#ifdef XZ_DEC_POWERPC
|
||||||
|
case BCJ_POWERPC:
|
||||||
|
#endif
|
||||||
|
#ifdef XZ_DEC_IA64
|
||||||
|
case BCJ_IA64:
|
||||||
|
#endif
|
||||||
|
#ifdef XZ_DEC_ARM
|
||||||
|
case BCJ_ARM:
|
||||||
|
#endif
|
||||||
|
#ifdef XZ_DEC_ARMTHUMB
|
||||||
|
case BCJ_ARMTHUMB:
|
||||||
|
#endif
|
||||||
|
#ifdef XZ_DEC_SPARC
|
||||||
|
case BCJ_SPARC:
|
||||||
|
#endif
|
||||||
|
break;
|
||||||
|
|
||||||
|
default:
|
||||||
|
/* Unsupported Filter ID */
|
||||||
|
return XZ_OPTIONS_ERROR;
|
||||||
|
}
|
||||||
|
|
||||||
|
s->type = id;
|
||||||
|
s->ret = XZ_OK;
|
||||||
|
s->pos = 0;
|
||||||
|
s->x86_prev_mask = 0;
|
||||||
|
s->temp.filtered = 0;
|
||||||
|
s->temp.size = 0;
|
||||||
|
|
||||||
|
return XZ_OK;
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,847 @@
|
||||||
|
/*
|
||||||
|
* .xz Stream decoder
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include "xz_private.h"
|
||||||
|
#include "xz_stream.h"
|
||||||
|
|
||||||
|
#ifdef XZ_USE_CRC64
|
||||||
|
# define IS_CRC64(check_type) ((check_type) == XZ_CHECK_CRC64)
|
||||||
|
#else
|
||||||
|
# define IS_CRC64(check_type) false
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Hash used to validate the Index field */
|
||||||
|
struct xz_dec_hash {
|
||||||
|
vli_type unpadded;
|
||||||
|
vli_type uncompressed;
|
||||||
|
uint32_t crc32;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct xz_dec {
|
||||||
|
/* Position in dec_main() */
|
||||||
|
enum {
|
||||||
|
SEQ_STREAM_HEADER,
|
||||||
|
SEQ_BLOCK_START,
|
||||||
|
SEQ_BLOCK_HEADER,
|
||||||
|
SEQ_BLOCK_UNCOMPRESS,
|
||||||
|
SEQ_BLOCK_PADDING,
|
||||||
|
SEQ_BLOCK_CHECK,
|
||||||
|
SEQ_INDEX,
|
||||||
|
SEQ_INDEX_PADDING,
|
||||||
|
SEQ_INDEX_CRC32,
|
||||||
|
SEQ_STREAM_FOOTER
|
||||||
|
} sequence;
|
||||||
|
|
||||||
|
/* Position in variable-length integers and Check fields */
|
||||||
|
uint32_t pos;
|
||||||
|
|
||||||
|
/* Variable-length integer decoded by dec_vli() */
|
||||||
|
vli_type vli;
|
||||||
|
|
||||||
|
/* Saved in_pos and out_pos */
|
||||||
|
size_t in_start;
|
||||||
|
size_t out_start;
|
||||||
|
|
||||||
|
#ifdef XZ_USE_CRC64
|
||||||
|
/* CRC32 or CRC64 value in Block or CRC32 value in Index */
|
||||||
|
uint64_t crc;
|
||||||
|
#else
|
||||||
|
/* CRC32 value in Block or Index */
|
||||||
|
uint32_t crc;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Type of the integrity check calculated from uncompressed data */
|
||||||
|
enum xz_check check_type;
|
||||||
|
|
||||||
|
/* Operation mode */
|
||||||
|
enum xz_mode mode;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* True if the next call to xz_dec_run() is allowed to return
|
||||||
|
* XZ_BUF_ERROR.
|
||||||
|
*/
|
||||||
|
bool allow_buf_error;
|
||||||
|
|
||||||
|
/* Information stored in Block Header */
|
||||||
|
struct {
|
||||||
|
/*
|
||||||
|
* Value stored in the Compressed Size field, or
|
||||||
|
* VLI_UNKNOWN if Compressed Size is not present.
|
||||||
|
*/
|
||||||
|
vli_type compressed;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Value stored in the Uncompressed Size field, or
|
||||||
|
* VLI_UNKNOWN if Uncompressed Size is not present.
|
||||||
|
*/
|
||||||
|
vli_type uncompressed;
|
||||||
|
|
||||||
|
/* Size of the Block Header field */
|
||||||
|
uint32_t size;
|
||||||
|
} block_header;
|
||||||
|
|
||||||
|
/* Information collected when decoding Blocks */
|
||||||
|
struct {
|
||||||
|
/* Observed compressed size of the current Block */
|
||||||
|
vli_type compressed;
|
||||||
|
|
||||||
|
/* Observed uncompressed size of the current Block */
|
||||||
|
vli_type uncompressed;
|
||||||
|
|
||||||
|
/* Number of Blocks decoded so far */
|
||||||
|
vli_type count;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Hash calculated from the Block sizes. This is used to
|
||||||
|
* validate the Index field.
|
||||||
|
*/
|
||||||
|
struct xz_dec_hash hash;
|
||||||
|
} block;
|
||||||
|
|
||||||
|
/* Variables needed when verifying the Index field */
|
||||||
|
struct {
|
||||||
|
/* Position in dec_index() */
|
||||||
|
enum {
|
||||||
|
SEQ_INDEX_COUNT,
|
||||||
|
SEQ_INDEX_UNPADDED,
|
||||||
|
SEQ_INDEX_UNCOMPRESSED
|
||||||
|
} sequence;
|
||||||
|
|
||||||
|
/* Size of the Index in bytes */
|
||||||
|
vli_type size;
|
||||||
|
|
||||||
|
/* Number of Records (matches block.count in valid files) */
|
||||||
|
vli_type count;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Hash calculated from the Records (matches block.hash in
|
||||||
|
* valid files).
|
||||||
|
*/
|
||||||
|
struct xz_dec_hash hash;
|
||||||
|
} index;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Temporary buffer needed to hold Stream Header, Block Header,
|
||||||
|
* and Stream Footer. The Block Header is the biggest (1 KiB)
|
||||||
|
* so we reserve space according to that. buf[] has to be aligned
|
||||||
|
* to a multiple of four bytes; the size_t variables before it
|
||||||
|
* should guarantee this.
|
||||||
|
*/
|
||||||
|
struct {
|
||||||
|
size_t pos;
|
||||||
|
size_t size;
|
||||||
|
uint8_t buf[1024];
|
||||||
|
} temp;
|
||||||
|
|
||||||
|
struct xz_dec_lzma2 *lzma2;
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_BCJ
|
||||||
|
struct xz_dec_bcj *bcj;
|
||||||
|
bool bcj_active;
|
||||||
|
#endif
|
||||||
|
};
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_ANY_CHECK
|
||||||
|
/* Sizes of the Check field with different Check IDs */
|
||||||
|
static const uint8_t check_sizes[16] = {
|
||||||
|
0,
|
||||||
|
4, 4, 4,
|
||||||
|
8, 8, 8,
|
||||||
|
16, 16, 16,
|
||||||
|
32, 32, 32,
|
||||||
|
64, 64, 64
|
||||||
|
};
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Fill s->temp by copying data starting from b->in[b->in_pos]. Caller
|
||||||
|
* must have set s->temp.pos to indicate how much data we are supposed
|
||||||
|
* to copy into s->temp.buf. Return true once s->temp.pos has reached
|
||||||
|
* s->temp.size.
|
||||||
|
*/
|
||||||
|
static bool fill_temp(struct xz_dec *s, struct xz_buf *b)
|
||||||
|
{
|
||||||
|
size_t copy_size = min_t(size_t,
|
||||||
|
b->in_size - b->in_pos, s->temp.size - s->temp.pos);
|
||||||
|
|
||||||
|
memcpy(s->temp.buf + s->temp.pos, b->in + b->in_pos, copy_size);
|
||||||
|
b->in_pos += copy_size;
|
||||||
|
s->temp.pos += copy_size;
|
||||||
|
|
||||||
|
if (s->temp.pos == s->temp.size) {
|
||||||
|
s->temp.pos = 0;
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Decode a variable-length integer (little-endian base-128 encoding) */
|
||||||
|
static enum xz_ret dec_vli(struct xz_dec *s, const uint8_t *in,
|
||||||
|
size_t *in_pos, size_t in_size)
|
||||||
|
{
|
||||||
|
uint8_t byte;
|
||||||
|
|
||||||
|
if (s->pos == 0)
|
||||||
|
s->vli = 0;
|
||||||
|
|
||||||
|
while (*in_pos < in_size) {
|
||||||
|
byte = in[*in_pos];
|
||||||
|
++*in_pos;
|
||||||
|
|
||||||
|
s->vli |= (vli_type)(byte & 0x7F) << s->pos;
|
||||||
|
|
||||||
|
if ((byte & 0x80) == 0) {
|
||||||
|
/* Don't allow non-minimal encodings. */
|
||||||
|
if (byte == 0 && s->pos != 0)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
s->pos = 0;
|
||||||
|
return XZ_STREAM_END;
|
||||||
|
}
|
||||||
|
|
||||||
|
s->pos += 7;
|
||||||
|
if (s->pos == 7 * VLI_BYTES_MAX)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
}
|
||||||
|
|
||||||
|
return XZ_OK;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Decode the Compressed Data field from a Block. Update and validate
|
||||||
|
* the observed compressed and uncompressed sizes of the Block so that
|
||||||
|
* they don't exceed the values possibly stored in the Block Header
|
||||||
|
* (validation assumes that no integer overflow occurs, since vli_type
|
||||||
|
* is normally uint64_t). Update the CRC32 or CRC64 value if presence of
|
||||||
|
* the CRC32 or CRC64 field was indicated in Stream Header.
|
||||||
|
*
|
||||||
|
* Once the decoding is finished, validate that the observed sizes match
|
||||||
|
* the sizes possibly stored in the Block Header. Update the hash and
|
||||||
|
* Block count, which are later used to validate the Index field.
|
||||||
|
*/
|
||||||
|
static enum xz_ret dec_block(struct xz_dec *s, struct xz_buf *b)
|
||||||
|
{
|
||||||
|
enum xz_ret ret;
|
||||||
|
|
||||||
|
s->in_start = b->in_pos;
|
||||||
|
s->out_start = b->out_pos;
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_BCJ
|
||||||
|
if (s->bcj_active)
|
||||||
|
ret = xz_dec_bcj_run(s->bcj, s->lzma2, b);
|
||||||
|
else
|
||||||
|
#endif
|
||||||
|
ret = xz_dec_lzma2_run(s->lzma2, b);
|
||||||
|
|
||||||
|
s->block.compressed += b->in_pos - s->in_start;
|
||||||
|
s->block.uncompressed += b->out_pos - s->out_start;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* There is no need to separately check for VLI_UNKNOWN, since
|
||||||
|
* the observed sizes are always smaller than VLI_UNKNOWN.
|
||||||
|
*/
|
||||||
|
if (s->block.compressed > s->block_header.compressed
|
||||||
|
|| s->block.uncompressed
|
||||||
|
> s->block_header.uncompressed)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
if (s->check_type == XZ_CHECK_CRC32)
|
||||||
|
s->crc = xz_crc32(b->out + s->out_start,
|
||||||
|
b->out_pos - s->out_start, s->crc);
|
||||||
|
#ifdef XZ_USE_CRC64
|
||||||
|
else if (s->check_type == XZ_CHECK_CRC64)
|
||||||
|
s->crc = xz_crc64(b->out + s->out_start,
|
||||||
|
b->out_pos - s->out_start, s->crc);
|
||||||
|
#endif
|
||||||
|
|
||||||
|
if (ret == XZ_STREAM_END) {
|
||||||
|
if (s->block_header.compressed != VLI_UNKNOWN
|
||||||
|
&& s->block_header.compressed
|
||||||
|
!= s->block.compressed)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
if (s->block_header.uncompressed != VLI_UNKNOWN
|
||||||
|
&& s->block_header.uncompressed
|
||||||
|
!= s->block.uncompressed)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
s->block.hash.unpadded += s->block_header.size
|
||||||
|
+ s->block.compressed;
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_ANY_CHECK
|
||||||
|
s->block.hash.unpadded += check_sizes[s->check_type];
|
||||||
|
#else
|
||||||
|
if (s->check_type == XZ_CHECK_CRC32)
|
||||||
|
s->block.hash.unpadded += 4;
|
||||||
|
else if (IS_CRC64(s->check_type))
|
||||||
|
s->block.hash.unpadded += 8;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
s->block.hash.uncompressed += s->block.uncompressed;
|
||||||
|
s->block.hash.crc32 = xz_crc32(
|
||||||
|
(const uint8_t *)&s->block.hash,
|
||||||
|
sizeof(s->block.hash), s->block.hash.crc32);
|
||||||
|
|
||||||
|
++s->block.count;
|
||||||
|
}
|
||||||
|
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Update the Index size and the CRC32 value. */
|
||||||
|
static void index_update(struct xz_dec *s, const struct xz_buf *b)
|
||||||
|
{
|
||||||
|
size_t in_used = b->in_pos - s->in_start;
|
||||||
|
s->index.size += in_used;
|
||||||
|
s->crc = xz_crc32(b->in + s->in_start, in_used, s->crc);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Decode the Number of Records, Unpadded Size, and Uncompressed Size
|
||||||
|
* fields from the Index field. That is, Index Padding and CRC32 are not
|
||||||
|
* decoded by this function.
|
||||||
|
*
|
||||||
|
* This can return XZ_OK (more input needed), XZ_STREAM_END (everything
|
||||||
|
* successfully decoded), or XZ_DATA_ERROR (input is corrupt).
|
||||||
|
*/
|
||||||
|
static enum xz_ret dec_index(struct xz_dec *s, struct xz_buf *b)
|
||||||
|
{
|
||||||
|
enum xz_ret ret;
|
||||||
|
|
||||||
|
do {
|
||||||
|
ret = dec_vli(s, b->in, &b->in_pos, b->in_size);
|
||||||
|
if (ret != XZ_STREAM_END) {
|
||||||
|
index_update(s, b);
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
|
switch (s->index.sequence) {
|
||||||
|
case SEQ_INDEX_COUNT:
|
||||||
|
s->index.count = s->vli;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Validate that the Number of Records field
|
||||||
|
* indicates the same number of Records as
|
||||||
|
* there were Blocks in the Stream.
|
||||||
|
*/
|
||||||
|
if (s->index.count != s->block.count)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
s->index.sequence = SEQ_INDEX_UNPADDED;
|
||||||
|
break;
|
||||||
|
|
||||||
|
case SEQ_INDEX_UNPADDED:
|
||||||
|
s->index.hash.unpadded += s->vli;
|
||||||
|
s->index.sequence = SEQ_INDEX_UNCOMPRESSED;
|
||||||
|
break;
|
||||||
|
|
||||||
|
case SEQ_INDEX_UNCOMPRESSED:
|
||||||
|
s->index.hash.uncompressed += s->vli;
|
||||||
|
s->index.hash.crc32 = xz_crc32(
|
||||||
|
(const uint8_t *)&s->index.hash,
|
||||||
|
sizeof(s->index.hash),
|
||||||
|
s->index.hash.crc32);
|
||||||
|
--s->index.count;
|
||||||
|
s->index.sequence = SEQ_INDEX_UNPADDED;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
} while (s->index.count > 0);
|
||||||
|
|
||||||
|
return XZ_STREAM_END;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Validate that the next four or eight input bytes match the value
|
||||||
|
* of s->crc. s->pos must be zero when starting to validate the first byte.
|
||||||
|
* The "bits" argument allows using the same code for both CRC32 and CRC64.
|
||||||
|
*/
|
||||||
|
static enum xz_ret crc_validate(struct xz_dec *s, struct xz_buf *b,
|
||||||
|
uint32_t bits)
|
||||||
|
{
|
||||||
|
do {
|
||||||
|
if (b->in_pos == b->in_size)
|
||||||
|
return XZ_OK;
|
||||||
|
|
||||||
|
if (((s->crc >> s->pos) & 0xFF) != b->in[b->in_pos++])
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
s->pos += 8;
|
||||||
|
|
||||||
|
} while (s->pos < bits);
|
||||||
|
|
||||||
|
s->crc = 0;
|
||||||
|
s->pos = 0;
|
||||||
|
|
||||||
|
return XZ_STREAM_END;
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_ANY_CHECK
|
||||||
|
/*
|
||||||
|
* Skip over the Check field when the Check ID is not supported.
|
||||||
|
* Returns true once the whole Check field has been skipped over.
|
||||||
|
*/
|
||||||
|
static bool check_skip(struct xz_dec *s, struct xz_buf *b)
|
||||||
|
{
|
||||||
|
while (s->pos < check_sizes[s->check_type]) {
|
||||||
|
if (b->in_pos == b->in_size)
|
||||||
|
return false;
|
||||||
|
|
||||||
|
++b->in_pos;
|
||||||
|
++s->pos;
|
||||||
|
}
|
||||||
|
|
||||||
|
s->pos = 0;
|
||||||
|
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Decode the Stream Header field (the first 12 bytes of the .xz Stream). */
|
||||||
|
static enum xz_ret dec_stream_header(struct xz_dec *s)
|
||||||
|
{
|
||||||
|
if (!memeq(s->temp.buf, HEADER_MAGIC, HEADER_MAGIC_SIZE))
|
||||||
|
return XZ_FORMAT_ERROR;
|
||||||
|
|
||||||
|
if (xz_crc32(s->temp.buf + HEADER_MAGIC_SIZE, 2, 0)
|
||||||
|
!= get_le32(s->temp.buf + HEADER_MAGIC_SIZE + 2))
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
if (s->temp.buf[HEADER_MAGIC_SIZE] != 0)
|
||||||
|
return XZ_OPTIONS_ERROR;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Of integrity checks, we support none (Check ID = 0),
|
||||||
|
* CRC32 (Check ID = 1), and optionally CRC64 (Check ID = 4).
|
||||||
|
* However, if XZ_DEC_ANY_CHECK is defined, we will accept other
|
||||||
|
* check types too, but then the check won't be verified and
|
||||||
|
* a warning (XZ_UNSUPPORTED_CHECK) will be given.
|
||||||
|
*/
|
||||||
|
s->check_type = s->temp.buf[HEADER_MAGIC_SIZE + 1];
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_ANY_CHECK
|
||||||
|
if (s->check_type > XZ_CHECK_MAX)
|
||||||
|
return XZ_OPTIONS_ERROR;
|
||||||
|
|
||||||
|
if (s->check_type > XZ_CHECK_CRC32 && !IS_CRC64(s->check_type))
|
||||||
|
return XZ_UNSUPPORTED_CHECK;
|
||||||
|
#else
|
||||||
|
if (s->check_type > XZ_CHECK_CRC32 && !IS_CRC64(s->check_type))
|
||||||
|
return XZ_OPTIONS_ERROR;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
return XZ_OK;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Decode the Stream Footer field (the last 12 bytes of the .xz Stream) */
|
||||||
|
static enum xz_ret dec_stream_footer(struct xz_dec *s)
|
||||||
|
{
|
||||||
|
if (!memeq(s->temp.buf + 10, FOOTER_MAGIC, FOOTER_MAGIC_SIZE))
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
if (xz_crc32(s->temp.buf + 4, 6, 0) != get_le32(s->temp.buf))
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Validate Backward Size. Note that we never added the size of the
|
||||||
|
* Index CRC32 field to s->index.size, thus we use s->index.size / 4
|
||||||
|
* instead of s->index.size / 4 - 1.
|
||||||
|
*/
|
||||||
|
if ((s->index.size >> 2) != get_le32(s->temp.buf + 4))
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
if (s->temp.buf[8] != 0 || s->temp.buf[9] != s->check_type)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Use XZ_STREAM_END instead of XZ_OK to be more convenient
|
||||||
|
* for the caller.
|
||||||
|
*/
|
||||||
|
return XZ_STREAM_END;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Decode the Block Header and initialize the filter chain. */
|
||||||
|
static enum xz_ret dec_block_header(struct xz_dec *s)
|
||||||
|
{
|
||||||
|
enum xz_ret ret;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Validate the CRC32. We know that the temp buffer is at least
|
||||||
|
* eight bytes so this is safe.
|
||||||
|
*/
|
||||||
|
s->temp.size -= 4;
|
||||||
|
if (xz_crc32(s->temp.buf, s->temp.size, 0)
|
||||||
|
!= get_le32(s->temp.buf + s->temp.size))
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
s->temp.pos = 2;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Catch unsupported Block Flags. We support only one or two filters
|
||||||
|
* in the chain, so we catch that with the same test.
|
||||||
|
*/
|
||||||
|
#ifdef XZ_DEC_BCJ
|
||||||
|
if (s->temp.buf[1] & 0x3E)
|
||||||
|
#else
|
||||||
|
if (s->temp.buf[1] & 0x3F)
|
||||||
|
#endif
|
||||||
|
return XZ_OPTIONS_ERROR;
|
||||||
|
|
||||||
|
/* Compressed Size */
|
||||||
|
if (s->temp.buf[1] & 0x40) {
|
||||||
|
if (dec_vli(s, s->temp.buf, &s->temp.pos, s->temp.size)
|
||||||
|
!= XZ_STREAM_END)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
s->block_header.compressed = s->vli;
|
||||||
|
} else {
|
||||||
|
s->block_header.compressed = VLI_UNKNOWN;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Uncompressed Size */
|
||||||
|
if (s->temp.buf[1] & 0x80) {
|
||||||
|
if (dec_vli(s, s->temp.buf, &s->temp.pos, s->temp.size)
|
||||||
|
!= XZ_STREAM_END)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
s->block_header.uncompressed = s->vli;
|
||||||
|
} else {
|
||||||
|
s->block_header.uncompressed = VLI_UNKNOWN;
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_BCJ
|
||||||
|
/* If there are two filters, the first one must be a BCJ filter. */
|
||||||
|
s->bcj_active = s->temp.buf[1] & 0x01;
|
||||||
|
if (s->bcj_active) {
|
||||||
|
if (s->temp.size - s->temp.pos < 2)
|
||||||
|
return XZ_OPTIONS_ERROR;
|
||||||
|
|
||||||
|
ret = xz_dec_bcj_reset(s->bcj, s->temp.buf[s->temp.pos++]);
|
||||||
|
if (ret != XZ_OK)
|
||||||
|
return ret;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* We don't support custom start offset,
|
||||||
|
* so Size of Properties must be zero.
|
||||||
|
*/
|
||||||
|
if (s->temp.buf[s->temp.pos++] != 0x00)
|
||||||
|
return XZ_OPTIONS_ERROR;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Valid Filter Flags always take at least two bytes. */
|
||||||
|
if (s->temp.size - s->temp.pos < 2)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
/* Filter ID = LZMA2 */
|
||||||
|
if (s->temp.buf[s->temp.pos++] != 0x21)
|
||||||
|
return XZ_OPTIONS_ERROR;
|
||||||
|
|
||||||
|
/* Size of Properties = 1-byte Filter Properties */
|
||||||
|
if (s->temp.buf[s->temp.pos++] != 0x01)
|
||||||
|
return XZ_OPTIONS_ERROR;
|
||||||
|
|
||||||
|
/* Filter Properties contains LZMA2 dictionary size. */
|
||||||
|
if (s->temp.size - s->temp.pos < 1)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
ret = xz_dec_lzma2_reset(s->lzma2, s->temp.buf[s->temp.pos++]);
|
||||||
|
if (ret != XZ_OK)
|
||||||
|
return ret;
|
||||||
|
|
||||||
|
/* The rest must be Header Padding. */
|
||||||
|
while (s->temp.pos < s->temp.size)
|
||||||
|
if (s->temp.buf[s->temp.pos++] != 0x00)
|
||||||
|
return XZ_OPTIONS_ERROR;
|
||||||
|
|
||||||
|
s->temp.pos = 0;
|
||||||
|
s->block.compressed = 0;
|
||||||
|
s->block.uncompressed = 0;
|
||||||
|
|
||||||
|
return XZ_OK;
|
||||||
|
}
|
||||||
|
|
||||||
|
static enum xz_ret dec_main(struct xz_dec *s, struct xz_buf *b)
|
||||||
|
{
|
||||||
|
enum xz_ret ret;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Store the start position for the case when we are in the middle
|
||||||
|
* of the Index field.
|
||||||
|
*/
|
||||||
|
s->in_start = b->in_pos;
|
||||||
|
|
||||||
|
while (true) {
|
||||||
|
switch (s->sequence) {
|
||||||
|
case SEQ_STREAM_HEADER:
|
||||||
|
/*
|
||||||
|
* Stream Header is copied to s->temp, and then
|
||||||
|
* decoded from there. This way if the caller
|
||||||
|
* gives us only little input at a time, we can
|
||||||
|
* still keep the Stream Header decoding code
|
||||||
|
* simple. Similar approach is used in many places
|
||||||
|
* in this file.
|
||||||
|
*/
|
||||||
|
if (!fill_temp(s, b))
|
||||||
|
return XZ_OK;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If dec_stream_header() returns
|
||||||
|
* XZ_UNSUPPORTED_CHECK, it is still possible
|
||||||
|
* to continue decoding if working in multi-call
|
||||||
|
* mode. Thus, update s->sequence before calling
|
||||||
|
* dec_stream_header().
|
||||||
|
*/
|
||||||
|
s->sequence = SEQ_BLOCK_START;
|
||||||
|
|
||||||
|
ret = dec_stream_header(s);
|
||||||
|
if (ret != XZ_OK)
|
||||||
|
return ret;
|
||||||
|
|
||||||
|
case SEQ_BLOCK_START:
|
||||||
|
/* We need one byte of input to continue. */
|
||||||
|
if (b->in_pos == b->in_size)
|
||||||
|
return XZ_OK;
|
||||||
|
|
||||||
|
/* See if this is the beginning of the Index field. */
|
||||||
|
if (b->in[b->in_pos] == 0) {
|
||||||
|
s->in_start = b->in_pos++;
|
||||||
|
s->sequence = SEQ_INDEX;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Calculate the size of the Block Header and
|
||||||
|
* prepare to decode it.
|
||||||
|
*/
|
||||||
|
s->block_header.size
|
||||||
|
= ((uint32_t)b->in[b->in_pos] + 1) * 4;
|
||||||
|
|
||||||
|
s->temp.size = s->block_header.size;
|
||||||
|
s->temp.pos = 0;
|
||||||
|
s->sequence = SEQ_BLOCK_HEADER;
|
||||||
|
|
||||||
|
case SEQ_BLOCK_HEADER:
|
||||||
|
if (!fill_temp(s, b))
|
||||||
|
return XZ_OK;
|
||||||
|
|
||||||
|
ret = dec_block_header(s);
|
||||||
|
if (ret != XZ_OK)
|
||||||
|
return ret;
|
||||||
|
|
||||||
|
s->sequence = SEQ_BLOCK_UNCOMPRESS;
|
||||||
|
|
||||||
|
case SEQ_BLOCK_UNCOMPRESS:
|
||||||
|
ret = dec_block(s, b);
|
||||||
|
if (ret != XZ_STREAM_END)
|
||||||
|
return ret;
|
||||||
|
|
||||||
|
s->sequence = SEQ_BLOCK_PADDING;
|
||||||
|
|
||||||
|
case SEQ_BLOCK_PADDING:
|
||||||
|
/*
|
||||||
|
* Size of Compressed Data + Block Padding
|
||||||
|
* must be a multiple of four. We don't need
|
||||||
|
* s->block.compressed for anything else
|
||||||
|
* anymore, so we use it here to test the size
|
||||||
|
* of the Block Padding field.
|
||||||
|
*/
|
||||||
|
while (s->block.compressed & 3) {
|
||||||
|
if (b->in_pos == b->in_size)
|
||||||
|
return XZ_OK;
|
||||||
|
|
||||||
|
if (b->in[b->in_pos++] != 0)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
++s->block.compressed;
|
||||||
|
}
|
||||||
|
|
||||||
|
s->sequence = SEQ_BLOCK_CHECK;
|
||||||
|
|
||||||
|
case SEQ_BLOCK_CHECK:
|
||||||
|
if (s->check_type == XZ_CHECK_CRC32) {
|
||||||
|
ret = crc_validate(s, b, 32);
|
||||||
|
if (ret != XZ_STREAM_END)
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
else if (IS_CRC64(s->check_type)) {
|
||||||
|
ret = crc_validate(s, b, 64);
|
||||||
|
if (ret != XZ_STREAM_END)
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
#ifdef XZ_DEC_ANY_CHECK
|
||||||
|
else if (!check_skip(s, b)) {
|
||||||
|
return XZ_OK;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
s->sequence = SEQ_BLOCK_START;
|
||||||
|
break;
|
||||||
|
|
||||||
|
case SEQ_INDEX:
|
||||||
|
ret = dec_index(s, b);
|
||||||
|
if (ret != XZ_STREAM_END)
|
||||||
|
return ret;
|
||||||
|
|
||||||
|
s->sequence = SEQ_INDEX_PADDING;
|
||||||
|
|
||||||
|
case SEQ_INDEX_PADDING:
|
||||||
|
while ((s->index.size + (b->in_pos - s->in_start))
|
||||||
|
& 3) {
|
||||||
|
if (b->in_pos == b->in_size) {
|
||||||
|
index_update(s, b);
|
||||||
|
return XZ_OK;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (b->in[b->in_pos++] != 0)
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Finish the CRC32 value and Index size. */
|
||||||
|
index_update(s, b);
|
||||||
|
|
||||||
|
/* Compare the hashes to validate the Index field. */
|
||||||
|
if (!memeq(&s->block.hash, &s->index.hash,
|
||||||
|
sizeof(s->block.hash)))
|
||||||
|
return XZ_DATA_ERROR;
|
||||||
|
|
||||||
|
s->sequence = SEQ_INDEX_CRC32;
|
||||||
|
|
||||||
|
case SEQ_INDEX_CRC32:
|
||||||
|
ret = crc_validate(s, b, 32);
|
||||||
|
if (ret != XZ_STREAM_END)
|
||||||
|
return ret;
|
||||||
|
|
||||||
|
s->temp.size = STREAM_HEADER_SIZE;
|
||||||
|
s->sequence = SEQ_STREAM_FOOTER;
|
||||||
|
|
||||||
|
case SEQ_STREAM_FOOTER:
|
||||||
|
if (!fill_temp(s, b))
|
||||||
|
return XZ_OK;
|
||||||
|
|
||||||
|
return dec_stream_footer(s);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Never reached */
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* xz_dec_run() is a wrapper for dec_main() to handle some special cases in
|
||||||
|
* multi-call and single-call decoding.
|
||||||
|
*
|
||||||
|
* In multi-call mode, we must return XZ_BUF_ERROR when it seems clear that we
|
||||||
|
* are not going to make any progress anymore. This is to prevent the caller
|
||||||
|
* from calling us infinitely when the input file is truncated or otherwise
|
||||||
|
* corrupt. Since zlib-style API allows that the caller fills the input buffer
|
||||||
|
* only when the decoder doesn't produce any new output, we have to be careful
|
||||||
|
* to avoid returning XZ_BUF_ERROR too easily: XZ_BUF_ERROR is returned only
|
||||||
|
* after the second consecutive call to xz_dec_run() that makes no progress.
|
||||||
|
*
|
||||||
|
* In single-call mode, if we couldn't decode everything and no error
|
||||||
|
* occurred, either the input is truncated or the output buffer is too small.
|
||||||
|
* Since we know that the last input byte never produces any output, we know
|
||||||
|
* that if all the input was consumed and decoding wasn't finished, the file
|
||||||
|
* must be corrupt. Otherwise the output buffer has to be too small or the
|
||||||
|
* file is corrupt in a way that decoding it produces too big output.
|
||||||
|
*
|
||||||
|
* If single-call decoding fails, we reset b->in_pos and b->out_pos back to
|
||||||
|
* their original values. This is because with some filter chains there won't
|
||||||
|
* be any valid uncompressed data in the output buffer unless the decoding
|
||||||
|
* actually succeeds (that's the price to pay of using the output buffer as
|
||||||
|
* the workspace).
|
||||||
|
*/
|
||||||
|
XZ_EXTERN enum xz_ret xz_dec_run(struct xz_dec *s, struct xz_buf *b)
|
||||||
|
{
|
||||||
|
size_t in_start;
|
||||||
|
size_t out_start;
|
||||||
|
enum xz_ret ret;
|
||||||
|
|
||||||
|
if (DEC_IS_SINGLE(s->mode))
|
||||||
|
xz_dec_reset(s);
|
||||||
|
|
||||||
|
in_start = b->in_pos;
|
||||||
|
out_start = b->out_pos;
|
||||||
|
ret = dec_main(s, b);
|
||||||
|
|
||||||
|
if (DEC_IS_SINGLE(s->mode)) {
|
||||||
|
if (ret == XZ_OK)
|
||||||
|
ret = b->in_pos == b->in_size
|
||||||
|
? XZ_DATA_ERROR : XZ_BUF_ERROR;
|
||||||
|
|
||||||
|
if (ret != XZ_STREAM_END) {
|
||||||
|
b->in_pos = in_start;
|
||||||
|
b->out_pos = out_start;
|
||||||
|
}
|
||||||
|
|
||||||
|
} else if (ret == XZ_OK && in_start == b->in_pos
|
||||||
|
&& out_start == b->out_pos) {
|
||||||
|
if (s->allow_buf_error)
|
||||||
|
ret = XZ_BUF_ERROR;
|
||||||
|
|
||||||
|
s->allow_buf_error = true;
|
||||||
|
} else {
|
||||||
|
s->allow_buf_error = false;
|
||||||
|
}
|
||||||
|
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
|
XZ_EXTERN struct xz_dec *xz_dec_init(enum xz_mode mode, uint32_t dict_max)
|
||||||
|
{
|
||||||
|
struct xz_dec *s = kmalloc(sizeof(*s), GFP_KERNEL);
|
||||||
|
if (s == NULL)
|
||||||
|
return NULL;
|
||||||
|
|
||||||
|
s->mode = mode;
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_BCJ
|
||||||
|
s->bcj = xz_dec_bcj_create(DEC_IS_SINGLE(mode));
|
||||||
|
if (s->bcj == NULL)
|
||||||
|
goto error_bcj;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
s->lzma2 = xz_dec_lzma2_create(mode, dict_max);
|
||||||
|
if (s->lzma2 == NULL)
|
||||||
|
goto error_lzma2;
|
||||||
|
|
||||||
|
xz_dec_reset(s);
|
||||||
|
return s;
|
||||||
|
|
||||||
|
error_lzma2:
|
||||||
|
#ifdef XZ_DEC_BCJ
|
||||||
|
xz_dec_bcj_end(s->bcj);
|
||||||
|
error_bcj:
|
||||||
|
#endif
|
||||||
|
kfree(s);
|
||||||
|
return NULL;
|
||||||
|
}
|
||||||
|
|
||||||
|
XZ_EXTERN void xz_dec_reset(struct xz_dec *s)
|
||||||
|
{
|
||||||
|
s->sequence = SEQ_STREAM_HEADER;
|
||||||
|
s->allow_buf_error = false;
|
||||||
|
s->pos = 0;
|
||||||
|
s->crc = 0;
|
||||||
|
memzero(&s->block, sizeof(s->block));
|
||||||
|
memzero(&s->index, sizeof(s->index));
|
||||||
|
s->temp.pos = 0;
|
||||||
|
s->temp.size = STREAM_HEADER_SIZE;
|
||||||
|
}
|
||||||
|
|
||||||
|
XZ_EXTERN void xz_dec_end(struct xz_dec *s)
|
||||||
|
{
|
||||||
|
if (s != NULL) {
|
||||||
|
xz_dec_lzma2_end(s->lzma2);
|
||||||
|
#ifdef XZ_DEC_BCJ
|
||||||
|
xz_dec_bcj_end(s->bcj);
|
||||||
|
#endif
|
||||||
|
kfree(s);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,26 @@
|
||||||
|
/*
|
||||||
|
* XZ decoder module information
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <linux/module.h>
|
||||||
|
#include <linux/xz.h>
|
||||||
|
|
||||||
|
EXPORT_SYMBOL(xz_dec_init);
|
||||||
|
EXPORT_SYMBOL(xz_dec_reset);
|
||||||
|
EXPORT_SYMBOL(xz_dec_run);
|
||||||
|
EXPORT_SYMBOL(xz_dec_end);
|
||||||
|
|
||||||
|
MODULE_DESCRIPTION("XZ decompressor");
|
||||||
|
MODULE_VERSION("1.0");
|
||||||
|
MODULE_AUTHOR("Lasse Collin <lasse.collin@tukaani.org> and Igor Pavlov");
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This code is in the public domain, but in Linux it's simplest to just
|
||||||
|
* say it's GPL and consider the authors as the copyright holders.
|
||||||
|
*/
|
||||||
|
MODULE_LICENSE("GPL");
|
||||||
|
|
@ -0,0 +1,220 @@
|
||||||
|
/*
|
||||||
|
* XZ decoder tester
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <linux/kernel.h>
|
||||||
|
#include <linux/module.h>
|
||||||
|
#include <linux/fs.h>
|
||||||
|
#include <linux/uaccess.h>
|
||||||
|
#include <linux/crc32.h>
|
||||||
|
#include <linux/xz.h>
|
||||||
|
|
||||||
|
/* Maximum supported dictionary size */
|
||||||
|
#define DICT_MAX (1 << 20)
|
||||||
|
|
||||||
|
/* Device name to pass to register_chrdev(). */
|
||||||
|
#define DEVICE_NAME "xz_dec_test"
|
||||||
|
|
||||||
|
/* Dynamically allocated device major number */
|
||||||
|
static int device_major;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* We reuse the same decoder state, and thus can decode only one
|
||||||
|
* file at a time.
|
||||||
|
*/
|
||||||
|
static bool device_is_open;
|
||||||
|
|
||||||
|
/* XZ decoder state */
|
||||||
|
static struct xz_dec *state;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Return value of xz_dec_run(). We need to avoid calling xz_dec_run() after
|
||||||
|
* it has returned XZ_STREAM_END, so we make this static.
|
||||||
|
*/
|
||||||
|
static enum xz_ret ret;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Input and output buffers. The input buffer is used as a temporary safe
|
||||||
|
* place for the data coming from the userspace.
|
||||||
|
*/
|
||||||
|
static uint8_t buffer_in[1024];
|
||||||
|
static uint8_t buffer_out[1024];
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Structure to pass the input and output buffers to the XZ decoder.
|
||||||
|
* A few of the fields are never modified so we initialize them here.
|
||||||
|
*/
|
||||||
|
static struct xz_buf buffers = {
|
||||||
|
.in = buffer_in,
|
||||||
|
.out = buffer_out,
|
||||||
|
.out_size = sizeof(buffer_out)
|
||||||
|
};
|
||||||
|
|
||||||
|
/*
|
||||||
|
* CRC32 of uncompressed data. This is used to give the user a simple way
|
||||||
|
* to check that the decoder produces correct output.
|
||||||
|
*/
|
||||||
|
static uint32_t crc;
|
||||||
|
|
||||||
|
static int xz_dec_test_open(struct inode *i, struct file *f)
|
||||||
|
{
|
||||||
|
if (device_is_open)
|
||||||
|
return -EBUSY;
|
||||||
|
|
||||||
|
device_is_open = true;
|
||||||
|
|
||||||
|
xz_dec_reset(state);
|
||||||
|
ret = XZ_OK;
|
||||||
|
crc = 0xFFFFFFFF;
|
||||||
|
|
||||||
|
buffers.in_pos = 0;
|
||||||
|
buffers.in_size = 0;
|
||||||
|
buffers.out_pos = 0;
|
||||||
|
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": opened\n");
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int xz_dec_test_release(struct inode *i, struct file *f)
|
||||||
|
{
|
||||||
|
device_is_open = false;
|
||||||
|
|
||||||
|
if (ret == XZ_OK)
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": input was truncated\n");
|
||||||
|
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": closed\n");
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Decode the data given to us from the userspace. CRC32 of the uncompressed
|
||||||
|
* data is calculated and is printed at the end of successful decoding. The
|
||||||
|
* uncompressed data isn't stored anywhere for further use.
|
||||||
|
*
|
||||||
|
* The .xz file must have exactly one Stream and no Stream Padding. The data
|
||||||
|
* after the first Stream is considered to be garbage.
|
||||||
|
*/
|
||||||
|
static ssize_t xz_dec_test_write(struct file *file, const char __user *buf,
|
||||||
|
size_t size, loff_t *pos)
|
||||||
|
{
|
||||||
|
size_t remaining;
|
||||||
|
|
||||||
|
if (ret != XZ_OK) {
|
||||||
|
if (size > 0)
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": %zu bytes of "
|
||||||
|
"garbage at the end of the file\n",
|
||||||
|
size);
|
||||||
|
|
||||||
|
return -ENOSPC;
|
||||||
|
}
|
||||||
|
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": decoding %zu bytes of input\n",
|
||||||
|
size);
|
||||||
|
|
||||||
|
remaining = size;
|
||||||
|
while ((remaining > 0 || buffers.out_pos == buffers.out_size)
|
||||||
|
&& ret == XZ_OK) {
|
||||||
|
if (buffers.in_pos == buffers.in_size) {
|
||||||
|
buffers.in_pos = 0;
|
||||||
|
buffers.in_size = min(remaining, sizeof(buffer_in));
|
||||||
|
if (copy_from_user(buffer_in, buf, buffers.in_size))
|
||||||
|
return -EFAULT;
|
||||||
|
|
||||||
|
buf += buffers.in_size;
|
||||||
|
remaining -= buffers.in_size;
|
||||||
|
}
|
||||||
|
|
||||||
|
buffers.out_pos = 0;
|
||||||
|
ret = xz_dec_run(state, &buffers);
|
||||||
|
crc = crc32(crc, buffer_out, buffers.out_pos);
|
||||||
|
}
|
||||||
|
|
||||||
|
switch (ret) {
|
||||||
|
case XZ_OK:
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": XZ_OK\n");
|
||||||
|
return size;
|
||||||
|
|
||||||
|
case XZ_STREAM_END:
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": XZ_STREAM_END, "
|
||||||
|
"CRC32 = 0x%08X\n", ~crc);
|
||||||
|
return size - remaining - (buffers.in_size - buffers.in_pos);
|
||||||
|
|
||||||
|
case XZ_MEMLIMIT_ERROR:
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": XZ_MEMLIMIT_ERROR\n");
|
||||||
|
break;
|
||||||
|
|
||||||
|
case XZ_FORMAT_ERROR:
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": XZ_FORMAT_ERROR\n");
|
||||||
|
break;
|
||||||
|
|
||||||
|
case XZ_OPTIONS_ERROR:
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": XZ_OPTIONS_ERROR\n");
|
||||||
|
break;
|
||||||
|
|
||||||
|
case XZ_DATA_ERROR:
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": XZ_DATA_ERROR\n");
|
||||||
|
break;
|
||||||
|
|
||||||
|
case XZ_BUF_ERROR:
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": XZ_BUF_ERROR\n");
|
||||||
|
break;
|
||||||
|
|
||||||
|
default:
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": Bug detected!\n");
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
return -EIO;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Allocate the XZ decoder state and register the character device. */
|
||||||
|
static int __init xz_dec_test_init(void)
|
||||||
|
{
|
||||||
|
static const struct file_operations fileops = {
|
||||||
|
.owner = THIS_MODULE,
|
||||||
|
.open = &xz_dec_test_open,
|
||||||
|
.release = &xz_dec_test_release,
|
||||||
|
.write = &xz_dec_test_write
|
||||||
|
};
|
||||||
|
|
||||||
|
state = xz_dec_init(XZ_PREALLOC, DICT_MAX);
|
||||||
|
if (state == NULL)
|
||||||
|
return -ENOMEM;
|
||||||
|
|
||||||
|
device_major = register_chrdev(0, DEVICE_NAME, &fileops);
|
||||||
|
if (device_major < 0) {
|
||||||
|
xz_dec_end(state);
|
||||||
|
return device_major;
|
||||||
|
}
|
||||||
|
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": module loaded\n");
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": Create a device node with "
|
||||||
|
"'mknod " DEVICE_NAME " c %d 0' and write .xz files "
|
||||||
|
"to it.\n", device_major);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void __exit xz_dec_test_exit(void)
|
||||||
|
{
|
||||||
|
unregister_chrdev(device_major, DEVICE_NAME);
|
||||||
|
xz_dec_end(state);
|
||||||
|
printk(KERN_INFO DEVICE_NAME ": module unloaded\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
module_init(xz_dec_test_init);
|
||||||
|
module_exit(xz_dec_test_exit);
|
||||||
|
|
||||||
|
MODULE_DESCRIPTION("XZ decompressor tester");
|
||||||
|
MODULE_VERSION("1.0");
|
||||||
|
MODULE_AUTHOR("Lasse Collin <lasse.collin@tukaani.org>");
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This code is in the public domain, but in Linux it's simplest to just
|
||||||
|
* say it's GPL and consider the authors as the copyright holders.
|
||||||
|
*/
|
||||||
|
MODULE_LICENSE("GPL");
|
||||||
|
|
@ -0,0 +1,204 @@
|
||||||
|
/*
|
||||||
|
* LZMA2 definitions
|
||||||
|
*
|
||||||
|
* Authors: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
* Igor Pavlov <http://7-zip.org/>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef XZ_LZMA2_H
|
||||||
|
#define XZ_LZMA2_H
|
||||||
|
|
||||||
|
/* Range coder constants */
|
||||||
|
#define RC_SHIFT_BITS 8
|
||||||
|
#define RC_TOP_BITS 24
|
||||||
|
#define RC_TOP_VALUE (1 << RC_TOP_BITS)
|
||||||
|
#define RC_BIT_MODEL_TOTAL_BITS 11
|
||||||
|
#define RC_BIT_MODEL_TOTAL (1 << RC_BIT_MODEL_TOTAL_BITS)
|
||||||
|
#define RC_MOVE_BITS 5
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Maximum number of position states. A position state is the lowest pb
|
||||||
|
* number of bits of the current uncompressed offset. In some places there
|
||||||
|
* are different sets of probabilities for different position states.
|
||||||
|
*/
|
||||||
|
#define POS_STATES_MAX (1 << 4)
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This enum is used to track which LZMA symbols have occurred most recently
|
||||||
|
* and in which order. This information is used to predict the next symbol.
|
||||||
|
*
|
||||||
|
* Symbols:
|
||||||
|
* - Literal: One 8-bit byte
|
||||||
|
* - Match: Repeat a chunk of data at some distance
|
||||||
|
* - Long repeat: Multi-byte match at a recently seen distance
|
||||||
|
* - Short repeat: One-byte repeat at a recently seen distance
|
||||||
|
*
|
||||||
|
* The symbol names are in from STATE_oldest_older_previous. REP means
|
||||||
|
* either short or long repeated match, and NONLIT means any non-literal.
|
||||||
|
*/
|
||||||
|
enum lzma_state {
|
||||||
|
STATE_LIT_LIT,
|
||||||
|
STATE_MATCH_LIT_LIT,
|
||||||
|
STATE_REP_LIT_LIT,
|
||||||
|
STATE_SHORTREP_LIT_LIT,
|
||||||
|
STATE_MATCH_LIT,
|
||||||
|
STATE_REP_LIT,
|
||||||
|
STATE_SHORTREP_LIT,
|
||||||
|
STATE_LIT_MATCH,
|
||||||
|
STATE_LIT_LONGREP,
|
||||||
|
STATE_LIT_SHORTREP,
|
||||||
|
STATE_NONLIT_MATCH,
|
||||||
|
STATE_NONLIT_REP
|
||||||
|
};
|
||||||
|
|
||||||
|
/* Total number of states */
|
||||||
|
#define STATES 12
|
||||||
|
|
||||||
|
/* The lowest 7 states indicate that the previous state was a literal. */
|
||||||
|
#define LIT_STATES 7
|
||||||
|
|
||||||
|
/* Indicate that the latest symbol was a literal. */
|
||||||
|
static inline void lzma_state_literal(enum lzma_state *state)
|
||||||
|
{
|
||||||
|
if (*state <= STATE_SHORTREP_LIT_LIT)
|
||||||
|
*state = STATE_LIT_LIT;
|
||||||
|
else if (*state <= STATE_LIT_SHORTREP)
|
||||||
|
*state -= 3;
|
||||||
|
else
|
||||||
|
*state -= 6;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Indicate that the latest symbol was a match. */
|
||||||
|
static inline void lzma_state_match(enum lzma_state *state)
|
||||||
|
{
|
||||||
|
*state = *state < LIT_STATES ? STATE_LIT_MATCH : STATE_NONLIT_MATCH;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Indicate that the latest state was a long repeated match. */
|
||||||
|
static inline void lzma_state_long_rep(enum lzma_state *state)
|
||||||
|
{
|
||||||
|
*state = *state < LIT_STATES ? STATE_LIT_LONGREP : STATE_NONLIT_REP;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Indicate that the latest symbol was a short match. */
|
||||||
|
static inline void lzma_state_short_rep(enum lzma_state *state)
|
||||||
|
{
|
||||||
|
*state = *state < LIT_STATES ? STATE_LIT_SHORTREP : STATE_NONLIT_REP;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Test if the previous symbol was a literal. */
|
||||||
|
static inline bool lzma_state_is_literal(enum lzma_state state)
|
||||||
|
{
|
||||||
|
return state < LIT_STATES;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Each literal coder is divided in three sections:
|
||||||
|
* - 0x001-0x0FF: Without match byte
|
||||||
|
* - 0x101-0x1FF: With match byte; match bit is 0
|
||||||
|
* - 0x201-0x2FF: With match byte; match bit is 1
|
||||||
|
*
|
||||||
|
* Match byte is used when the previous LZMA symbol was something else than
|
||||||
|
* a literal (that is, it was some kind of match).
|
||||||
|
*/
|
||||||
|
#define LITERAL_CODER_SIZE 0x300
|
||||||
|
|
||||||
|
/* Maximum number of literal coders */
|
||||||
|
#define LITERAL_CODERS_MAX (1 << 4)
|
||||||
|
|
||||||
|
/* Minimum length of a match is two bytes. */
|
||||||
|
#define MATCH_LEN_MIN 2
|
||||||
|
|
||||||
|
/* Match length is encoded with 4, 5, or 10 bits.
|
||||||
|
*
|
||||||
|
* Length Bits
|
||||||
|
* 2-9 4 = Choice=0 + 3 bits
|
||||||
|
* 10-17 5 = Choice=1 + Choice2=0 + 3 bits
|
||||||
|
* 18-273 10 = Choice=1 + Choice2=1 + 8 bits
|
||||||
|
*/
|
||||||
|
#define LEN_LOW_BITS 3
|
||||||
|
#define LEN_LOW_SYMBOLS (1 << LEN_LOW_BITS)
|
||||||
|
#define LEN_MID_BITS 3
|
||||||
|
#define LEN_MID_SYMBOLS (1 << LEN_MID_BITS)
|
||||||
|
#define LEN_HIGH_BITS 8
|
||||||
|
#define LEN_HIGH_SYMBOLS (1 << LEN_HIGH_BITS)
|
||||||
|
#define LEN_SYMBOLS (LEN_LOW_SYMBOLS + LEN_MID_SYMBOLS + LEN_HIGH_SYMBOLS)
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Maximum length of a match is 273 which is a result of the encoding
|
||||||
|
* described above.
|
||||||
|
*/
|
||||||
|
#define MATCH_LEN_MAX (MATCH_LEN_MIN + LEN_SYMBOLS - 1)
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Different sets of probabilities are used for match distances that have
|
||||||
|
* very short match length: Lengths of 2, 3, and 4 bytes have a separate
|
||||||
|
* set of probabilities for each length. The matches with longer length
|
||||||
|
* use a shared set of probabilities.
|
||||||
|
*/
|
||||||
|
#define DIST_STATES 4
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Get the index of the appropriate probability array for decoding
|
||||||
|
* the distance slot.
|
||||||
|
*/
|
||||||
|
static inline uint32_t lzma_get_dist_state(uint32_t len)
|
||||||
|
{
|
||||||
|
return len < DIST_STATES + MATCH_LEN_MIN
|
||||||
|
? len - MATCH_LEN_MIN : DIST_STATES - 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* The highest two bits of a 32-bit match distance are encoded using six bits.
|
||||||
|
* This six-bit value is called a distance slot. This way encoding a 32-bit
|
||||||
|
* value takes 6-36 bits, larger values taking more bits.
|
||||||
|
*/
|
||||||
|
#define DIST_SLOT_BITS 6
|
||||||
|
#define DIST_SLOTS (1 << DIST_SLOT_BITS)
|
||||||
|
|
||||||
|
/* Match distances up to 127 are fully encoded using probabilities. Since
|
||||||
|
* the highest two bits (distance slot) are always encoded using six bits,
|
||||||
|
* the distances 0-3 don't need any additional bits to encode, since the
|
||||||
|
* distance slot itself is the same as the actual distance. DIST_MODEL_START
|
||||||
|
* indicates the first distance slot where at least one additional bit is
|
||||||
|
* needed.
|
||||||
|
*/
|
||||||
|
#define DIST_MODEL_START 4
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Match distances greater than 127 are encoded in three pieces:
|
||||||
|
* - distance slot: the highest two bits
|
||||||
|
* - direct bits: 2-26 bits below the highest two bits
|
||||||
|
* - alignment bits: four lowest bits
|
||||||
|
*
|
||||||
|
* Direct bits don't use any probabilities.
|
||||||
|
*
|
||||||
|
* The distance slot value of 14 is for distances 128-191.
|
||||||
|
*/
|
||||||
|
#define DIST_MODEL_END 14
|
||||||
|
|
||||||
|
/* Distance slots that indicate a distance <= 127. */
|
||||||
|
#define FULL_DISTANCES_BITS (DIST_MODEL_END / 2)
|
||||||
|
#define FULL_DISTANCES (1 << FULL_DISTANCES_BITS)
|
||||||
|
|
||||||
|
/*
|
||||||
|
* For match distances greater than 127, only the highest two bits and the
|
||||||
|
* lowest four bits (alignment) is encoded using probabilities.
|
||||||
|
*/
|
||||||
|
#define ALIGN_BITS 4
|
||||||
|
#define ALIGN_SIZE (1 << ALIGN_BITS)
|
||||||
|
#define ALIGN_MASK (ALIGN_SIZE - 1)
|
||||||
|
|
||||||
|
/* Total number of all probability variables */
|
||||||
|
#define PROBS_TOTAL (1846 + LITERAL_CODERS_MAX * LITERAL_CODER_SIZE)
|
||||||
|
|
||||||
|
/*
|
||||||
|
* LZMA remembers the four most recent match distances. Reusing these
|
||||||
|
* distances tends to take less space than re-encoding the actual
|
||||||
|
* distance value.
|
||||||
|
*/
|
||||||
|
#define REPS 4
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,156 @@
|
||||||
|
/*
|
||||||
|
* Private includes and definitions
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef XZ_PRIVATE_H
|
||||||
|
#define XZ_PRIVATE_H
|
||||||
|
|
||||||
|
#ifdef __KERNEL__
|
||||||
|
# include <linux/xz.h>
|
||||||
|
# include <linux/kernel.h>
|
||||||
|
# include <asm/unaligned.h>
|
||||||
|
/* XZ_PREBOOT may be defined only via decompress_unxz.c. */
|
||||||
|
# ifndef XZ_PREBOOT
|
||||||
|
# include <linux/slab.h>
|
||||||
|
# include <linux/vmalloc.h>
|
||||||
|
# include <linux/string.h>
|
||||||
|
# ifdef CONFIG_XZ_DEC_X86
|
||||||
|
# define XZ_DEC_X86
|
||||||
|
# endif
|
||||||
|
# ifdef CONFIG_XZ_DEC_POWERPC
|
||||||
|
# define XZ_DEC_POWERPC
|
||||||
|
# endif
|
||||||
|
# ifdef CONFIG_XZ_DEC_IA64
|
||||||
|
# define XZ_DEC_IA64
|
||||||
|
# endif
|
||||||
|
# ifdef CONFIG_XZ_DEC_ARM
|
||||||
|
# define XZ_DEC_ARM
|
||||||
|
# endif
|
||||||
|
# ifdef CONFIG_XZ_DEC_ARMTHUMB
|
||||||
|
# define XZ_DEC_ARMTHUMB
|
||||||
|
# endif
|
||||||
|
# ifdef CONFIG_XZ_DEC_SPARC
|
||||||
|
# define XZ_DEC_SPARC
|
||||||
|
# endif
|
||||||
|
# define memeq(a, b, size) (memcmp(a, b, size) == 0)
|
||||||
|
# define memzero(buf, size) memset(buf, 0, size)
|
||||||
|
# endif
|
||||||
|
# define get_le32(p) le32_to_cpup((const uint32_t *)(p))
|
||||||
|
#else
|
||||||
|
/*
|
||||||
|
* For userspace builds, use a separate header to define the required
|
||||||
|
* macros and functions. This makes it easier to adapt the code into
|
||||||
|
* different environments and avoids clutter in the Linux kernel tree.
|
||||||
|
*/
|
||||||
|
# include "xz_config.h"
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* If no specific decoding mode is requested, enable support for all modes. */
|
||||||
|
#if !defined(XZ_DEC_SINGLE) && !defined(XZ_DEC_PREALLOC) \
|
||||||
|
&& !defined(XZ_DEC_DYNALLOC)
|
||||||
|
# define XZ_DEC_SINGLE
|
||||||
|
# define XZ_DEC_PREALLOC
|
||||||
|
# define XZ_DEC_DYNALLOC
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* The DEC_IS_foo(mode) macros are used in "if" statements. If only some
|
||||||
|
* of the supported modes are enabled, these macros will evaluate to true or
|
||||||
|
* false at compile time and thus allow the compiler to omit unneeded code.
|
||||||
|
*/
|
||||||
|
#ifdef XZ_DEC_SINGLE
|
||||||
|
# define DEC_IS_SINGLE(mode) ((mode) == XZ_SINGLE)
|
||||||
|
#else
|
||||||
|
# define DEC_IS_SINGLE(mode) (false)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_PREALLOC
|
||||||
|
# define DEC_IS_PREALLOC(mode) ((mode) == XZ_PREALLOC)
|
||||||
|
#else
|
||||||
|
# define DEC_IS_PREALLOC(mode) (false)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_DYNALLOC
|
||||||
|
# define DEC_IS_DYNALLOC(mode) ((mode) == XZ_DYNALLOC)
|
||||||
|
#else
|
||||||
|
# define DEC_IS_DYNALLOC(mode) (false)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if !defined(XZ_DEC_SINGLE)
|
||||||
|
# define DEC_IS_MULTI(mode) (true)
|
||||||
|
#elif defined(XZ_DEC_PREALLOC) || defined(XZ_DEC_DYNALLOC)
|
||||||
|
# define DEC_IS_MULTI(mode) ((mode) != XZ_SINGLE)
|
||||||
|
#else
|
||||||
|
# define DEC_IS_MULTI(mode) (false)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* If any of the BCJ filter decoders are wanted, define XZ_DEC_BCJ.
|
||||||
|
* XZ_DEC_BCJ is used to enable generic support for BCJ decoders.
|
||||||
|
*/
|
||||||
|
#ifndef XZ_DEC_BCJ
|
||||||
|
# if defined(XZ_DEC_X86) || defined(XZ_DEC_POWERPC) \
|
||||||
|
|| defined(XZ_DEC_IA64) || defined(XZ_DEC_ARM) \
|
||||||
|
|| defined(XZ_DEC_ARM) || defined(XZ_DEC_ARMTHUMB) \
|
||||||
|
|| defined(XZ_DEC_SPARC)
|
||||||
|
# define XZ_DEC_BCJ
|
||||||
|
# endif
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Allocate memory for LZMA2 decoder. xz_dec_lzma2_reset() must be used
|
||||||
|
* before calling xz_dec_lzma2_run().
|
||||||
|
*/
|
||||||
|
XZ_EXTERN struct xz_dec_lzma2 *xz_dec_lzma2_create(enum xz_mode mode,
|
||||||
|
uint32_t dict_max);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Decode the LZMA2 properties (one byte) and reset the decoder. Return
|
||||||
|
* XZ_OK on success, XZ_MEMLIMIT_ERROR if the preallocated dictionary is not
|
||||||
|
* big enough, and XZ_OPTIONS_ERROR if props indicates something that this
|
||||||
|
* decoder doesn't support.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN enum xz_ret xz_dec_lzma2_reset(struct xz_dec_lzma2 *s,
|
||||||
|
uint8_t props);
|
||||||
|
|
||||||
|
/* Decode raw LZMA2 stream from b->in to b->out. */
|
||||||
|
XZ_EXTERN enum xz_ret xz_dec_lzma2_run(struct xz_dec_lzma2 *s,
|
||||||
|
struct xz_buf *b);
|
||||||
|
|
||||||
|
/* Free the memory allocated for the LZMA2 decoder. */
|
||||||
|
XZ_EXTERN void xz_dec_lzma2_end(struct xz_dec_lzma2 *s);
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_BCJ
|
||||||
|
/*
|
||||||
|
* Allocate memory for BCJ decoders. xz_dec_bcj_reset() must be used before
|
||||||
|
* calling xz_dec_bcj_run().
|
||||||
|
*/
|
||||||
|
XZ_EXTERN struct xz_dec_bcj *xz_dec_bcj_create(bool single_call);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Decode the Filter ID of a BCJ filter. This implementation doesn't
|
||||||
|
* support custom start offsets, so no decoding of Filter Properties
|
||||||
|
* is needed. Returns XZ_OK if the given Filter ID is supported.
|
||||||
|
* Otherwise XZ_OPTIONS_ERROR is returned.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN enum xz_ret xz_dec_bcj_reset(struct xz_dec_bcj *s, uint8_t id);
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Decode raw BCJ + LZMA2 stream. This must be used only if there actually is
|
||||||
|
* a BCJ filter in the chain. If the chain has only LZMA2, xz_dec_lzma2_run()
|
||||||
|
* must be called directly.
|
||||||
|
*/
|
||||||
|
XZ_EXTERN enum xz_ret xz_dec_bcj_run(struct xz_dec_bcj *s,
|
||||||
|
struct xz_dec_lzma2 *lzma2,
|
||||||
|
struct xz_buf *b);
|
||||||
|
|
||||||
|
/* Free the memory allocated for the BCJ filters. */
|
||||||
|
#define xz_dec_bcj_end(s) kfree(s)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,62 @@
|
||||||
|
/*
|
||||||
|
* Definitions for handling the .xz file format
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef XZ_STREAM_H
|
||||||
|
#define XZ_STREAM_H
|
||||||
|
|
||||||
|
#if defined(__KERNEL__) && !XZ_INTERNAL_CRC32
|
||||||
|
# include <linux/crc32.h>
|
||||||
|
# undef crc32
|
||||||
|
# define xz_crc32(buf, size, crc) \
|
||||||
|
(~crc32_le(~(uint32_t)(crc), buf, size))
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* See the .xz file format specification at
|
||||||
|
* http://tukaani.org/xz/xz-file-format.txt
|
||||||
|
* to understand the container format.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#define STREAM_HEADER_SIZE 12
|
||||||
|
|
||||||
|
#define HEADER_MAGIC "\3757zXZ"
|
||||||
|
#define HEADER_MAGIC_SIZE 6
|
||||||
|
|
||||||
|
#define FOOTER_MAGIC "YZ"
|
||||||
|
#define FOOTER_MAGIC_SIZE 2
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Variable-length integer can hold a 63-bit unsigned integer or a special
|
||||||
|
* value indicating that the value is unknown.
|
||||||
|
*
|
||||||
|
* Experimental: vli_type can be defined to uint32_t to save a few bytes
|
||||||
|
* in code size (no effect on speed). Doing so limits the uncompressed and
|
||||||
|
* compressed size of the file to less than 256 MiB and may also weaken
|
||||||
|
* error detection slightly.
|
||||||
|
*/
|
||||||
|
typedef uint64_t vli_type;
|
||||||
|
|
||||||
|
#define VLI_MAX ((vli_type)-1 / 2)
|
||||||
|
#define VLI_UNKNOWN ((vli_type)-1)
|
||||||
|
|
||||||
|
/* Maximum encoded size of a VLI */
|
||||||
|
#define VLI_BYTES_MAX (sizeof(vli_type) * 8 / 7)
|
||||||
|
|
||||||
|
/* Integrity Check types */
|
||||||
|
enum xz_check {
|
||||||
|
XZ_CHECK_NONE = 0,
|
||||||
|
XZ_CHECK_CRC32 = 1,
|
||||||
|
XZ_CHECK_CRC64 = 4,
|
||||||
|
XZ_CHECK_SHA256 = 10
|
||||||
|
};
|
||||||
|
|
||||||
|
/* Maximum possible Check ID */
|
||||||
|
#define XZ_CHECK_MAX 15
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,23 @@
|
||||||
|
#!/bin/sh
|
||||||
|
#
|
||||||
|
# This is a wrapper for xz to compress the kernel image using appropriate
|
||||||
|
# compression options depending on the architecture.
|
||||||
|
#
|
||||||
|
# Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
#
|
||||||
|
# This file has been put into the public domain.
|
||||||
|
# You can do whatever you want with this file.
|
||||||
|
#
|
||||||
|
|
||||||
|
BCJ=
|
||||||
|
LZMA2OPTS=
|
||||||
|
|
||||||
|
case $SRCARCH in
|
||||||
|
x86) BCJ=--x86 ;;
|
||||||
|
powerpc) BCJ=--powerpc ;;
|
||||||
|
ia64) BCJ=--ia64; LZMA2OPTS=pb=4 ;;
|
||||||
|
arm) BCJ=--arm ;;
|
||||||
|
sparc) BCJ=--sparc ;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
exec xz --check=crc32 $BCJ --lzma2=$LZMA2OPTS,dict=32MiB
|
||||||
|
|
@ -0,0 +1,96 @@
|
||||||
|
/*
|
||||||
|
* Test application for xz_boot.c
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
|
||||||
|
#define STATIC static
|
||||||
|
#define INIT
|
||||||
|
|
||||||
|
static void error(/*const*/ char *msg)
|
||||||
|
{
|
||||||
|
fprintf(stderr, "%s\n", msg);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Disable the CRC64 support even if it was enabled in the Makefile. */
|
||||||
|
#undef XZ_USE_CRC64
|
||||||
|
|
||||||
|
#include "../linux/lib/decompress_unxz.c"
|
||||||
|
|
||||||
|
static uint8_t in[1024 * 1024];
|
||||||
|
static uint8_t out[1024 * 1024];
|
||||||
|
|
||||||
|
static int fill(void *buf, unsigned int size)
|
||||||
|
{
|
||||||
|
return fread(buf, 1, size, stdin);
|
||||||
|
}
|
||||||
|
|
||||||
|
static int flush(/*const*/ void *buf, unsigned int size)
|
||||||
|
{
|
||||||
|
return fwrite(buf, 1, size, stdout);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void test_buf_to_buf(void)
|
||||||
|
{
|
||||||
|
size_t in_size;
|
||||||
|
int ret;
|
||||||
|
in_size = fread(in, 1, sizeof(in), stdin);
|
||||||
|
ret = decompress(in, in_size, NULL, NULL, out, NULL, &error);
|
||||||
|
/* fwrite(out, 1, FIXME, stdout); */
|
||||||
|
fprintf(stderr, "ret = %d\n", ret);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void test_buf_to_cb(void)
|
||||||
|
{
|
||||||
|
size_t in_size;
|
||||||
|
int in_used;
|
||||||
|
int ret;
|
||||||
|
in_size = fread(in, 1, sizeof(in), stdin);
|
||||||
|
ret = decompress(in, in_size, NULL, &flush, NULL, &in_used, &error);
|
||||||
|
fprintf(stderr, "ret = %d; in_used = %d\n", ret, in_used);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void test_cb_to_cb(void)
|
||||||
|
{
|
||||||
|
int ret;
|
||||||
|
ret = decompress(NULL, 0, &fill, &flush, NULL, NULL, &error);
|
||||||
|
fprintf(stderr, "ret = %d\n", ret);
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Not used by Linux <= 2.6.37-rc4 and newer probably won't use it either,
|
||||||
|
* but this kind of use case is still required to be supported by the API.
|
||||||
|
*/
|
||||||
|
static void test_cb_to_buf(void)
|
||||||
|
{
|
||||||
|
int in_used;
|
||||||
|
int ret;
|
||||||
|
ret = decompress(in, 0, &fill, NULL, out, &in_used, &error);
|
||||||
|
/* fwrite(out, 1, FIXME, stdout); */
|
||||||
|
fprintf(stderr, "ret = %d; in_used = %d\n", ret, in_used);
|
||||||
|
}
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
if (argc != 2)
|
||||||
|
fprintf(stderr, "Usage: %s [bb|bc|cc|cb]\n", argv[0]);
|
||||||
|
else if (strcmp(argv[1], "bb") == 0)
|
||||||
|
test_buf_to_buf();
|
||||||
|
else if (strcmp(argv[1], "bc") == 0)
|
||||||
|
test_buf_to_cb();
|
||||||
|
else if (strcmp(argv[1], "cc") == 0)
|
||||||
|
test_cb_to_cb();
|
||||||
|
else if (strcmp(argv[1], "cb") == 0)
|
||||||
|
test_cb_to_buf();
|
||||||
|
else
|
||||||
|
fprintf(stderr, "Usage: %s [bb|bc|cc|cb]\n", argv[0]);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,48 @@
|
||||||
|
/*
|
||||||
|
* Test application to test buffer-to-buffer decoding
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdbool.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include "xz.h"
|
||||||
|
|
||||||
|
#define BUFFER_SIZE (1024 * 1024)
|
||||||
|
|
||||||
|
static uint8_t in[BUFFER_SIZE];
|
||||||
|
static uint8_t out[BUFFER_SIZE];
|
||||||
|
|
||||||
|
int main(void)
|
||||||
|
{
|
||||||
|
struct xz_buf b;
|
||||||
|
struct xz_dec *s;
|
||||||
|
enum xz_ret ret;
|
||||||
|
|
||||||
|
xz_crc32_init();
|
||||||
|
|
||||||
|
s = xz_dec_init(XZ_SINGLE, 0);
|
||||||
|
if (s == NULL) {
|
||||||
|
fputs("Initialization failed", stderr);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
b.in = in;
|
||||||
|
b.in_pos = 0;
|
||||||
|
b.in_size = fread(in, 1, sizeof(in), stdin);
|
||||||
|
b.out = out;
|
||||||
|
b.out_pos = 0;
|
||||||
|
b.out_size = sizeof(out);
|
||||||
|
|
||||||
|
ret = xz_dec_run(s, &b);
|
||||||
|
xz_dec_end(s);
|
||||||
|
|
||||||
|
fwrite(out, 1, b.out_pos, stdout);
|
||||||
|
fprintf(stderr, "%d\n", ret);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,135 @@
|
||||||
|
/*
|
||||||
|
* Lazy test for the case when the output size is known
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdbool.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include "xz.h"
|
||||||
|
|
||||||
|
static uint8_t in[1];
|
||||||
|
static uint8_t out[BUFSIZ];
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
struct xz_buf b;
|
||||||
|
struct xz_dec *s;
|
||||||
|
enum xz_ret ret;
|
||||||
|
const char *msg;
|
||||||
|
size_t uncomp_size;
|
||||||
|
|
||||||
|
if (argc != 2) {
|
||||||
|
fputs("Give uncompressed size as the argument", stderr);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
uncomp_size = atoi(argv[1]);
|
||||||
|
|
||||||
|
xz_crc32_init();
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Support up to 64 MiB dictionary. The actually needed memory
|
||||||
|
* is allocated once the headers have been parsed.
|
||||||
|
*/
|
||||||
|
s = xz_dec_init(XZ_DYNALLOC, 1 << 26);
|
||||||
|
if (s == NULL) {
|
||||||
|
msg = "Memory allocation failed\n";
|
||||||
|
goto error;
|
||||||
|
}
|
||||||
|
|
||||||
|
b.in = in;
|
||||||
|
b.in_pos = 0;
|
||||||
|
b.in_size = 0;
|
||||||
|
b.out = out;
|
||||||
|
b.out_pos = 0;
|
||||||
|
b.out_size = uncomp_size < BUFSIZ ? uncomp_size : BUFSIZ;
|
||||||
|
|
||||||
|
while (true) {
|
||||||
|
if (b.in_pos == b.in_size) {
|
||||||
|
b.in_size = fread(in, 1, sizeof(in), stdin);
|
||||||
|
b.in_pos = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
ret = xz_dec_run(s, &b);
|
||||||
|
|
||||||
|
if (b.out_pos == sizeof(out)) {
|
||||||
|
if (fwrite(out, 1, b.out_pos, stdout) != b.out_pos) {
|
||||||
|
msg = "Write error\n";
|
||||||
|
goto error;
|
||||||
|
}
|
||||||
|
|
||||||
|
uncomp_size -= b.out_pos;
|
||||||
|
b.out_pos = 0;
|
||||||
|
b.out_size = uncomp_size < BUFSIZ
|
||||||
|
? uncomp_size : BUFSIZ;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (ret == XZ_OK)
|
||||||
|
continue;
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_ANY_CHECK
|
||||||
|
if (ret == XZ_UNSUPPORTED_CHECK) {
|
||||||
|
fputs(argv[0], stderr);
|
||||||
|
fputs(": ", stderr);
|
||||||
|
fputs("Unsupported check; not verifying "
|
||||||
|
"file integrity\n", stderr);
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
if (uncomp_size != b.out_pos) {
|
||||||
|
msg = "Uncompressed size doesn't match\n";
|
||||||
|
goto error;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (fwrite(out, 1, b.out_pos, stdout) != b.out_pos
|
||||||
|
|| fclose(stdout)) {
|
||||||
|
msg = "Write error\n";
|
||||||
|
goto error;
|
||||||
|
}
|
||||||
|
|
||||||
|
switch (ret) {
|
||||||
|
case XZ_STREAM_END:
|
||||||
|
xz_dec_end(s);
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
case XZ_MEM_ERROR:
|
||||||
|
msg = "Memory allocation failed\n";
|
||||||
|
goto error;
|
||||||
|
|
||||||
|
case XZ_MEMLIMIT_ERROR:
|
||||||
|
msg = "Memory usage limit reached\n";
|
||||||
|
goto error;
|
||||||
|
|
||||||
|
case XZ_FORMAT_ERROR:
|
||||||
|
msg = "Not a .xz file\n";
|
||||||
|
goto error;
|
||||||
|
|
||||||
|
case XZ_OPTIONS_ERROR:
|
||||||
|
msg = "Unsupported options in the .xz headers\n";
|
||||||
|
goto error;
|
||||||
|
|
||||||
|
case XZ_DATA_ERROR:
|
||||||
|
case XZ_BUF_ERROR:
|
||||||
|
msg = "File is corrupt\n";
|
||||||
|
goto error;
|
||||||
|
|
||||||
|
default:
|
||||||
|
msg = "Bug!\n";
|
||||||
|
goto error;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
error:
|
||||||
|
xz_dec_end(s);
|
||||||
|
fputs(argv[0], stderr);
|
||||||
|
fputs(": ", stderr);
|
||||||
|
fputs(msg, stderr);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
@ -0,0 +1,124 @@
|
||||||
|
/*
|
||||||
|
* Private includes and definitions for userspace use of XZ Embedded
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef XZ_CONFIG_H
|
||||||
|
#define XZ_CONFIG_H
|
||||||
|
|
||||||
|
/* Uncomment to enable CRC64 support. */
|
||||||
|
/* #define XZ_USE_CRC64 */
|
||||||
|
|
||||||
|
/* Uncomment as needed to enable BCJ filter decoders. */
|
||||||
|
/* #define XZ_DEC_X86 */
|
||||||
|
/* #define XZ_DEC_POWERPC */
|
||||||
|
/* #define XZ_DEC_IA64 */
|
||||||
|
/* #define XZ_DEC_ARM */
|
||||||
|
/* #define XZ_DEC_ARMTHUMB */
|
||||||
|
/* #define XZ_DEC_SPARC */
|
||||||
|
|
||||||
|
/*
|
||||||
|
* MSVC doesn't support modern C but XZ Embedded is mostly C89
|
||||||
|
* so these are enough.
|
||||||
|
*/
|
||||||
|
#ifdef _MSC_VER
|
||||||
|
typedef unsigned char bool;
|
||||||
|
# define true 1
|
||||||
|
# define false 0
|
||||||
|
# define inline __inline
|
||||||
|
#else
|
||||||
|
# include <stdbool.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <string.h>
|
||||||
|
|
||||||
|
#include "xz.h"
|
||||||
|
|
||||||
|
#define kmalloc(size, flags) malloc(size)
|
||||||
|
#define kfree(ptr) free(ptr)
|
||||||
|
#define vmalloc(size) malloc(size)
|
||||||
|
#define vfree(ptr) free(ptr)
|
||||||
|
|
||||||
|
#define memeq(a, b, size) (memcmp(a, b, size) == 0)
|
||||||
|
#define memzero(buf, size) memset(buf, 0, size)
|
||||||
|
|
||||||
|
#ifndef min
|
||||||
|
# define min(x, y) ((x) < (y) ? (x) : (y))
|
||||||
|
#endif
|
||||||
|
#define min_t(type, x, y) min(x, y)
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Some functions have been marked with __always_inline to keep the
|
||||||
|
* performance reasonable even when the compiler is optimizing for
|
||||||
|
* small code size. You may be able to save a few bytes by #defining
|
||||||
|
* __always_inline to plain inline, but don't complain if the code
|
||||||
|
* becomes slow.
|
||||||
|
*
|
||||||
|
* NOTE: System headers on GNU/Linux may #define this macro already,
|
||||||
|
* so if you want to change it, you need to #undef it first.
|
||||||
|
*/
|
||||||
|
#ifndef __always_inline
|
||||||
|
# ifdef __GNUC__
|
||||||
|
# define __always_inline \
|
||||||
|
inline __attribute__((__always_inline__))
|
||||||
|
# else
|
||||||
|
# define __always_inline inline
|
||||||
|
# endif
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/* Inline functions to access unaligned unsigned 32-bit integers */
|
||||||
|
#ifndef get_unaligned_le32
|
||||||
|
static inline uint32_t get_unaligned_le32(const uint8_t *buf)
|
||||||
|
{
|
||||||
|
return (uint32_t)buf[0]
|
||||||
|
| ((uint32_t)buf[1] << 8)
|
||||||
|
| ((uint32_t)buf[2] << 16)
|
||||||
|
| ((uint32_t)buf[3] << 24);
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef get_unaligned_be32
|
||||||
|
static inline uint32_t get_unaligned_be32(const uint8_t *buf)
|
||||||
|
{
|
||||||
|
return (uint32_t)(buf[0] << 24)
|
||||||
|
| ((uint32_t)buf[1] << 16)
|
||||||
|
| ((uint32_t)buf[2] << 8)
|
||||||
|
| (uint32_t)buf[3];
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef put_unaligned_le32
|
||||||
|
static inline void put_unaligned_le32(uint32_t val, uint8_t *buf)
|
||||||
|
{
|
||||||
|
buf[0] = (uint8_t)val;
|
||||||
|
buf[1] = (uint8_t)(val >> 8);
|
||||||
|
buf[2] = (uint8_t)(val >> 16);
|
||||||
|
buf[3] = (uint8_t)(val >> 24);
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef put_unaligned_be32
|
||||||
|
static inline void put_unaligned_be32(uint32_t val, uint8_t *buf)
|
||||||
|
{
|
||||||
|
buf[0] = (uint8_t)(val >> 24);
|
||||||
|
buf[1] = (uint8_t)(val >> 16);
|
||||||
|
buf[2] = (uint8_t)(val >> 8);
|
||||||
|
buf[3] = (uint8_t)val;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Use get_unaligned_le32() also for aligned access for simplicity. On
|
||||||
|
* little endian systems, #define get_le32(ptr) (*(const uint32_t *)(ptr))
|
||||||
|
* could save a few bytes in code size.
|
||||||
|
*/
|
||||||
|
#ifndef get_le32
|
||||||
|
# define get_le32 get_unaligned_le32
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#endif
|
||||||
|
|
@ -0,0 +1,135 @@
|
||||||
|
/*
|
||||||
|
* Simple XZ decoder command line tool
|
||||||
|
*
|
||||||
|
* Author: Lasse Collin <lasse.collin@tukaani.org>
|
||||||
|
*
|
||||||
|
* This file has been put into the public domain.
|
||||||
|
* You can do whatever you want with this file.
|
||||||
|
*/
|
||||||
|
|
||||||
|
/*
|
||||||
|
* This is really limited: Not all filters from .xz format are supported,
|
||||||
|
* only CRC32 is supported as the integrity check, and decoding of
|
||||||
|
* concatenated .xz streams is not supported. Thus, you may want to look
|
||||||
|
* at xzdec from XZ Utils if a few KiB bigger tool is not a problem.
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdbool.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include "xz.h"
|
||||||
|
|
||||||
|
static uint8_t in[BUFSIZ];
|
||||||
|
static uint8_t out[BUFSIZ];
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
struct xz_buf b;
|
||||||
|
struct xz_dec *s;
|
||||||
|
enum xz_ret ret;
|
||||||
|
const char *msg;
|
||||||
|
|
||||||
|
if (argc >= 2 && strcmp(argv[1], "--help") == 0) {
|
||||||
|
fputs("Uncompress a .xz file from stdin to stdout.\n"
|
||||||
|
"Arguments other than `--help' are ignored.\n",
|
||||||
|
stdout);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
xz_crc32_init();
|
||||||
|
#ifdef XZ_USE_CRC64
|
||||||
|
xz_crc64_init();
|
||||||
|
#endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Support up to 64 MiB dictionary. The actually needed memory
|
||||||
|
* is allocated once the headers have been parsed.
|
||||||
|
*/
|
||||||
|
s = xz_dec_init(XZ_DYNALLOC, 1 << 26);
|
||||||
|
if (s == NULL) {
|
||||||
|
msg = "Memory allocation failed\n";
|
||||||
|
goto error;
|
||||||
|
}
|
||||||
|
|
||||||
|
b.in = in;
|
||||||
|
b.in_pos = 0;
|
||||||
|
b.in_size = 0;
|
||||||
|
b.out = out;
|
||||||
|
b.out_pos = 0;
|
||||||
|
b.out_size = BUFSIZ;
|
||||||
|
|
||||||
|
while (true) {
|
||||||
|
if (b.in_pos == b.in_size) {
|
||||||
|
b.in_size = fread(in, 1, sizeof(in), stdin);
|
||||||
|
b.in_pos = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
ret = xz_dec_run(s, &b);
|
||||||
|
|
||||||
|
if (b.out_pos == sizeof(out)) {
|
||||||
|
if (fwrite(out, 1, b.out_pos, stdout) != b.out_pos) {
|
||||||
|
msg = "Write error\n";
|
||||||
|
goto error;
|
||||||
|
}
|
||||||
|
|
||||||
|
b.out_pos = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (ret == XZ_OK)
|
||||||
|
continue;
|
||||||
|
|
||||||
|
#ifdef XZ_DEC_ANY_CHECK
|
||||||
|
if (ret == XZ_UNSUPPORTED_CHECK) {
|
||||||
|
fputs(argv[0], stderr);
|
||||||
|
fputs(": ", stderr);
|
||||||
|
fputs("Unsupported check; not verifying "
|
||||||
|
"file integrity\n", stderr);
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
if (fwrite(out, 1, b.out_pos, stdout) != b.out_pos
|
||||||
|
|| fclose(stdout)) {
|
||||||
|
msg = "Write error\n";
|
||||||
|
goto error;
|
||||||
|
}
|
||||||
|
|
||||||
|
switch (ret) {
|
||||||
|
case XZ_STREAM_END:
|
||||||
|
xz_dec_end(s);
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
case XZ_MEM_ERROR:
|
||||||
|
msg = "Memory allocation failed\n";
|
||||||
|
goto error;
|
||||||
|
|
||||||
|
case XZ_MEMLIMIT_ERROR:
|
||||||
|
msg = "Memory usage limit reached\n";
|
||||||
|
goto error;
|
||||||
|
|
||||||
|
case XZ_FORMAT_ERROR:
|
||||||
|
msg = "Not a .xz file\n";
|
||||||
|
goto error;
|
||||||
|
|
||||||
|
case XZ_OPTIONS_ERROR:
|
||||||
|
msg = "Unsupported options in the .xz headers\n";
|
||||||
|
goto error;
|
||||||
|
|
||||||
|
case XZ_DATA_ERROR:
|
||||||
|
case XZ_BUF_ERROR:
|
||||||
|
msg = "File is corrupt\n";
|
||||||
|
goto error;
|
||||||
|
|
||||||
|
default:
|
||||||
|
msg = "Bug!\n";
|
||||||
|
goto error;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
error:
|
||||||
|
xz_dec_end(s);
|
||||||
|
fputs(argv[0], stderr);
|
||||||
|
fputs(": ", stderr);
|
||||||
|
fputs(msg, stderr);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
File diff suppressed because it is too large
Load Diff
|
|
@ -0,0 +1,402 @@
|
||||||
|
/******************************************************************************
|
||||||
|
* ventoy_http.h
|
||||||
|
*
|
||||||
|
* Copyright (c) 2021, longpanda <admin@ventoy.net>
|
||||||
|
*
|
||||||
|
* 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 <http://www.gnu.org/licenses/>.
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
#ifndef __VENTOY_HTTP_H__
|
||||||
|
#define __VENTOY_HTTP_H__
|
||||||
|
|
||||||
|
#include <civetweb.h>
|
||||||
|
|
||||||
|
|
||||||
|
#define L1 " "
|
||||||
|
#define L2 " "
|
||||||
|
#define L3 " "
|
||||||
|
#define L4 " "
|
||||||
|
|
||||||
|
typedef enum bios_mode
|
||||||
|
{
|
||||||
|
bios_common = 0,
|
||||||
|
bios_legacy,
|
||||||
|
bios_uefi,
|
||||||
|
bios_ia32,
|
||||||
|
bios_aa64,
|
||||||
|
bios_mips,
|
||||||
|
|
||||||
|
bios_max
|
||||||
|
}bios_mode;
|
||||||
|
|
||||||
|
|
||||||
|
typedef struct data_control
|
||||||
|
{
|
||||||
|
int default_menu_mode;
|
||||||
|
int treeview_style;
|
||||||
|
int filter_dot_underscore;
|
||||||
|
int sort_casesensitive;
|
||||||
|
int max_search_level;
|
||||||
|
int vhd_no_warning;
|
||||||
|
int filter_iso;
|
||||||
|
int filter_wim;
|
||||||
|
int filter_efi;
|
||||||
|
int filter_img;
|
||||||
|
int filter_vhd;
|
||||||
|
int filter_vtoy;
|
||||||
|
int win11_bypass_check;
|
||||||
|
int menu_timeout;
|
||||||
|
char default_search_root[MAX_PATH];
|
||||||
|
char default_image[MAX_PATH];
|
||||||
|
char default_kbd_layout[32];
|
||||||
|
char help_text_language[32];
|
||||||
|
}data_control;
|
||||||
|
|
||||||
|
#define display_mode_gui 0
|
||||||
|
#define display_mode_cli 1
|
||||||
|
#define display_mode_serial 2
|
||||||
|
#define display_mode_ser_console 3
|
||||||
|
|
||||||
|
typedef struct path_node
|
||||||
|
{
|
||||||
|
char path[MAX_PATH];
|
||||||
|
struct path_node *next;
|
||||||
|
}path_node;
|
||||||
|
|
||||||
|
typedef struct data_theme
|
||||||
|
{
|
||||||
|
int default_file;
|
||||||
|
path_node *filelist;
|
||||||
|
int display_mode;
|
||||||
|
char gfxmode[32];
|
||||||
|
|
||||||
|
char ventoy_left[32];
|
||||||
|
char ventoy_top[32];
|
||||||
|
char ventoy_color[32];
|
||||||
|
char serial_param[256];
|
||||||
|
|
||||||
|
path_node *fontslist;
|
||||||
|
}data_theme;
|
||||||
|
|
||||||
|
#define path_type_file 0
|
||||||
|
#define path_type_dir 1
|
||||||
|
|
||||||
|
typedef struct data_alias_node
|
||||||
|
{
|
||||||
|
int type;
|
||||||
|
char path[MAX_PATH];
|
||||||
|
char alias[256];
|
||||||
|
struct data_alias_node *next;
|
||||||
|
}data_alias_node;
|
||||||
|
|
||||||
|
typedef struct data_alias
|
||||||
|
{
|
||||||
|
data_alias_node *list;
|
||||||
|
}data_alias;
|
||||||
|
|
||||||
|
|
||||||
|
typedef struct data_tip_node
|
||||||
|
{
|
||||||
|
int type;
|
||||||
|
char path[MAX_PATH];
|
||||||
|
char tip[256];
|
||||||
|
struct data_tip_node *next;
|
||||||
|
}data_tip_node;
|
||||||
|
|
||||||
|
typedef struct data_tip
|
||||||
|
{
|
||||||
|
char left[32];
|
||||||
|
char top[32];
|
||||||
|
char color[32];
|
||||||
|
data_tip_node *list;
|
||||||
|
}data_tip;
|
||||||
|
|
||||||
|
|
||||||
|
#define class_type_key 0
|
||||||
|
#define class_type_dir 1
|
||||||
|
#define class_type_parent 2
|
||||||
|
typedef struct data_class_node
|
||||||
|
{
|
||||||
|
int type;
|
||||||
|
char path[MAX_PATH];
|
||||||
|
char class[256];
|
||||||
|
struct data_class_node *next;
|
||||||
|
}data_class_node;
|
||||||
|
|
||||||
|
typedef struct data_class
|
||||||
|
{
|
||||||
|
data_class_node *list;
|
||||||
|
}data_class;
|
||||||
|
|
||||||
|
|
||||||
|
typedef struct data_auto_memdisk
|
||||||
|
{
|
||||||
|
path_node *list;
|
||||||
|
}data_auto_memdisk;
|
||||||
|
|
||||||
|
typedef struct data_image_list
|
||||||
|
{
|
||||||
|
int type;
|
||||||
|
path_node *list;
|
||||||
|
}data_image_list;
|
||||||
|
|
||||||
|
typedef struct menu_password
|
||||||
|
{
|
||||||
|
int type;
|
||||||
|
char path[MAX_PATH];
|
||||||
|
char pwd[256];
|
||||||
|
struct menu_password *next;
|
||||||
|
}menu_password;
|
||||||
|
|
||||||
|
typedef struct data_password
|
||||||
|
{
|
||||||
|
char bootpwd[256];
|
||||||
|
char isopwd[256];
|
||||||
|
char wimpwd[256];
|
||||||
|
char vhdpwd[256];
|
||||||
|
char imgpwd[256];
|
||||||
|
char efipwd[256];
|
||||||
|
char vtoypwd[256];
|
||||||
|
|
||||||
|
menu_password *list;
|
||||||
|
}data_password;
|
||||||
|
|
||||||
|
typedef struct conf_replace_node
|
||||||
|
{
|
||||||
|
int image;
|
||||||
|
char path[MAX_PATH];
|
||||||
|
char org[256];
|
||||||
|
char new[MAX_PATH];
|
||||||
|
struct conf_replace_node *next;
|
||||||
|
}conf_replace_node;
|
||||||
|
typedef struct data_conf_replace
|
||||||
|
{
|
||||||
|
conf_replace_node *list;
|
||||||
|
}data_conf_replace;
|
||||||
|
|
||||||
|
typedef struct injection_node
|
||||||
|
{
|
||||||
|
int type;
|
||||||
|
char path[MAX_PATH];
|
||||||
|
char archive[MAX_PATH];
|
||||||
|
struct injection_node *next;
|
||||||
|
}injection_node;
|
||||||
|
typedef struct data_injection
|
||||||
|
{
|
||||||
|
injection_node *list;
|
||||||
|
}data_injection;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
typedef struct dud_node
|
||||||
|
{
|
||||||
|
char path[MAX_PATH];
|
||||||
|
path_node *list;
|
||||||
|
|
||||||
|
struct dud_node *next;
|
||||||
|
}dud_node;
|
||||||
|
|
||||||
|
typedef struct data_dud
|
||||||
|
{
|
||||||
|
dud_node *list;
|
||||||
|
}data_dud;
|
||||||
|
|
||||||
|
typedef struct auto_install_node
|
||||||
|
{
|
||||||
|
int timeouten;
|
||||||
|
int timeout;
|
||||||
|
int autoselen;
|
||||||
|
int autosel;
|
||||||
|
int type;
|
||||||
|
char path[MAX_PATH];
|
||||||
|
path_node *list;
|
||||||
|
|
||||||
|
struct auto_install_node *next;
|
||||||
|
}auto_install_node;
|
||||||
|
|
||||||
|
typedef struct data_auto_install
|
||||||
|
{
|
||||||
|
auto_install_node *list;
|
||||||
|
}data_auto_install;
|
||||||
|
|
||||||
|
typedef struct persistence_node
|
||||||
|
{
|
||||||
|
int timeouten;
|
||||||
|
int timeout;
|
||||||
|
int autoselen;
|
||||||
|
int autosel;
|
||||||
|
int type;
|
||||||
|
char path[MAX_PATH];
|
||||||
|
path_node *list;
|
||||||
|
|
||||||
|
struct persistence_node *next;
|
||||||
|
}persistence_node;
|
||||||
|
|
||||||
|
typedef struct data_persistence
|
||||||
|
{
|
||||||
|
persistence_node *list;
|
||||||
|
}data_persistence;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#define ventoy_save_plug(plug) \
|
||||||
|
{\
|
||||||
|
for (i = 0; i < bios_max; i++) \
|
||||||
|
{\
|
||||||
|
scnprintf(title, sizeof(title), "%s%s", #plug, g_json_title_postfix[i]);\
|
||||||
|
if (ventoy_data_cmp_##plug(g_data_##plug + i, g_data_##plug + bios_max))\
|
||||||
|
{\
|
||||||
|
pos += ventoy_data_save_##plug(g_data_##plug + i, title, JSON_SAVE_BUFFER + pos, JSON_BUF_MAX - pos);\
|
||||||
|
}\
|
||||||
|
}\
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#define api_get_func(conn, json, name) \
|
||||||
|
{\
|
||||||
|
int i = 0; \
|
||||||
|
int pos = 0; \
|
||||||
|
\
|
||||||
|
(void)json;\
|
||||||
|
\
|
||||||
|
VTOY_JSON_FMT_BEGIN(pos, JSON_BUFFER, JSON_BUF_MAX);\
|
||||||
|
VTOY_JSON_FMT_ARY_BEGIN();\
|
||||||
|
\
|
||||||
|
for (i = 0; i <= bios_max; i++)\
|
||||||
|
{\
|
||||||
|
__uiCurPos += ventoy_data_json_##name(g_data_##name + i, JSON_BUFFER + __uiCurPos, JSON_BUF_MAX - __uiCurPos);\
|
||||||
|
VTOY_JSON_FMT_COMA();\
|
||||||
|
}\
|
||||||
|
\
|
||||||
|
VTOY_JSON_FMT_ARY_END();\
|
||||||
|
VTOY_JSON_FMT_END(pos);\
|
||||||
|
\
|
||||||
|
ventoy_json_buffer(conn, JSON_BUFFER, pos);\
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
#define vtoy_list_free(type, list) \
|
||||||
|
{\
|
||||||
|
type *__next = NULL;\
|
||||||
|
type *__node = list;\
|
||||||
|
while (__node)\
|
||||||
|
{\
|
||||||
|
__next = __node->next;\
|
||||||
|
free(__node);\
|
||||||
|
__node = __next;\
|
||||||
|
}\
|
||||||
|
}
|
||||||
|
|
||||||
|
#define vtoy_list_del(last, node, LIST, field) \
|
||||||
|
for (last = node = LIST; node; node = node->next) \
|
||||||
|
{\
|
||||||
|
if (strcmp(node->field, field) == 0)\
|
||||||
|
{\
|
||||||
|
if (node == LIST)\
|
||||||
|
{\
|
||||||
|
LIST = LIST->next;\
|
||||||
|
}\
|
||||||
|
else\
|
||||||
|
{\
|
||||||
|
last->next = node->next;\
|
||||||
|
}\
|
||||||
|
free(node);\
|
||||||
|
break;\
|
||||||
|
}\
|
||||||
|
\
|
||||||
|
last = node;\
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
#define vtoy_list_del_ex(last, node, LIST, field, cb) \
|
||||||
|
for (last = node = LIST; node; node = node->next) \
|
||||||
|
{\
|
||||||
|
if (strcmp(node->field, field) == 0)\
|
||||||
|
{\
|
||||||
|
if (node == LIST)\
|
||||||
|
{\
|
||||||
|
LIST = LIST->next;\
|
||||||
|
}\
|
||||||
|
else\
|
||||||
|
{\
|
||||||
|
last->next = node->next;\
|
||||||
|
}\
|
||||||
|
cb(node->list);\
|
||||||
|
free(node);\
|
||||||
|
break;\
|
||||||
|
}\
|
||||||
|
\
|
||||||
|
last = node;\
|
||||||
|
}
|
||||||
|
|
||||||
|
#define vtoy_list_add(LIST, cur, node) \
|
||||||
|
if (LIST)\
|
||||||
|
{\
|
||||||
|
cur = LIST;\
|
||||||
|
while (cur && cur->next)\
|
||||||
|
{\
|
||||||
|
cur = cur->next;\
|
||||||
|
}\
|
||||||
|
cur->next = node;\
|
||||||
|
}\
|
||||||
|
else\
|
||||||
|
{\
|
||||||
|
LIST = node;\
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
#define ventoy_parse_json(name) \
|
||||||
|
{\
|
||||||
|
int __loop;\
|
||||||
|
int __len = strlen(#name);\
|
||||||
|
if (strncmp(#name, node->pcName, __len) == 0)\
|
||||||
|
{\
|
||||||
|
for (__loop = 0; __loop < bios_max; __loop++)\
|
||||||
|
{\
|
||||||
|
if (strcmp(g_json_title_postfix[__loop], node->pcName + __len) == 0)\
|
||||||
|
{\
|
||||||
|
vlog("json parse <%s>\n", node->pcName);\
|
||||||
|
ventoy_parse_##name(node, g_data_##name + __loop);\
|
||||||
|
break;\
|
||||||
|
}\
|
||||||
|
}\
|
||||||
|
} \
|
||||||
|
}
|
||||||
|
|
||||||
|
#define CONTROL_PARSE_INT(node, val) \
|
||||||
|
if (node->unData.pcStrVal[0] == '1') val = 1
|
||||||
|
|
||||||
|
|
||||||
|
#define VTOY_JSON_INT(key, val) vtoy_json_get_int(json, key, &val)
|
||||||
|
#define VTOY_JSON_STR(key, buf) vtoy_json_get_string(json, key, sizeof(buf), buf)
|
||||||
|
#define VTOY_JSON_STR_EX(key) vtoy_json_get_string_ex(json, key)
|
||||||
|
|
||||||
|
typedef int (*ventoy_json_callback)(struct mg_connection *conn, VTOY_JSON *json);
|
||||||
|
typedef struct JSON_CB
|
||||||
|
{
|
||||||
|
const char *method;
|
||||||
|
ventoy_json_callback callback;
|
||||||
|
}JSON_CB;
|
||||||
|
|
||||||
|
int ventoy_http_init(void);
|
||||||
|
void ventoy_http_exit(void);
|
||||||
|
int ventoy_http_start(const char *ip, const char *port);
|
||||||
|
int ventoy_http_stop(void);
|
||||||
|
int ventoy_data_save_all(void);
|
||||||
|
|
||||||
|
#endif /* __VENTOY_HTTP_H__ */
|
||||||
|
|
||||||
|
|
@ -0,0 +1,112 @@
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <stdint.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <errno.h>
|
||||||
|
#include <ctype.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <fcntl.h>
|
||||||
|
#include <sys/stat.h>
|
||||||
|
#include <sys/wait.h>
|
||||||
|
#include <sys/types.h>
|
||||||
|
#include <linux/limits.h>
|
||||||
|
#include <ventoy_define.h>
|
||||||
|
#include <ventoy_util.h>
|
||||||
|
#include <ventoy_json.h>
|
||||||
|
#include <ventoy_disk.h>
|
||||||
|
#include <ventoy_http.h>
|
||||||
|
|
||||||
|
char g_log_file[MAX_PATH];
|
||||||
|
char g_cur_dir[MAX_PATH];
|
||||||
|
char g_ventoy_dir[MAX_PATH];
|
||||||
|
|
||||||
|
int ventoy_log_init(void);
|
||||||
|
void ventoy_log_exit(void);
|
||||||
|
|
||||||
|
void ventoy_signal_stop(int sig)
|
||||||
|
{
|
||||||
|
vlog("ventoy server exit due to signal ...\n");
|
||||||
|
printf("ventoy server exit ...\n");
|
||||||
|
|
||||||
|
ventoy_http_stop();
|
||||||
|
ventoy_http_exit();
|
||||||
|
#ifndef VENTOY_SIM
|
||||||
|
ventoy_www_exit();
|
||||||
|
#endif
|
||||||
|
ventoy_disk_exit();
|
||||||
|
ventoy_log_exit();
|
||||||
|
exit(0);
|
||||||
|
}
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
int rc;
|
||||||
|
const char *ip = "127.0.0.1";
|
||||||
|
const char *port = "24681";
|
||||||
|
|
||||||
|
if (argc != 9)
|
||||||
|
{
|
||||||
|
printf("Invalid argc %d\n", argc);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (isdigit(argv[1][0]))
|
||||||
|
{
|
||||||
|
ip = argv[1];
|
||||||
|
}
|
||||||
|
|
||||||
|
if (isdigit(argv[2][0]))
|
||||||
|
{
|
||||||
|
port = argv[2];
|
||||||
|
}
|
||||||
|
|
||||||
|
strlcpy(g_ventoy_dir, argv[3]);
|
||||||
|
scnprintf(g_log_file, sizeof(g_log_file), "%s/%s", g_ventoy_dir, LOG_FILE);
|
||||||
|
ventoy_log_init();
|
||||||
|
|
||||||
|
getcwd(g_cur_dir, MAX_PATH);
|
||||||
|
|
||||||
|
if (!ventoy_is_directory_exist("./ventoy"))
|
||||||
|
{
|
||||||
|
printf("%s/ventoy directory does not exist\n", g_cur_dir);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
ventoy_get_disk_info(argv);
|
||||||
|
|
||||||
|
vlog("===============================================\n");
|
||||||
|
vlog("===== Ventoy Plugson %s:%s =====\n", ip, port);
|
||||||
|
vlog("===============================================\n");
|
||||||
|
|
||||||
|
ventoy_disk_init();
|
||||||
|
#ifndef VENTOY_SIM
|
||||||
|
rc = ventoy_www_init();
|
||||||
|
if (rc)
|
||||||
|
{
|
||||||
|
printf("Failed to init web data, check log for details.\n");
|
||||||
|
ventoy_disk_exit();
|
||||||
|
ventoy_log_exit();
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
ventoy_http_init();
|
||||||
|
|
||||||
|
rc = ventoy_http_start(ip, port);
|
||||||
|
if (rc)
|
||||||
|
{
|
||||||
|
printf("Ventoy failed to start http server, check ./ventoy/plugson.log for detail\n");
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
signal(SIGINT, ventoy_signal_stop);
|
||||||
|
signal(SIGTSTP, ventoy_signal_stop);
|
||||||
|
signal(SIGQUIT, ventoy_signal_stop);
|
||||||
|
while (1)
|
||||||
|
{
|
||||||
|
sleep(100);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
@ -0,0 +1,527 @@
|
||||||
|
#include <Windows.h>
|
||||||
|
#include <Shlobj.h>
|
||||||
|
#include <tlhelp32.h>
|
||||||
|
#include <Psapi.h>
|
||||||
|
#include <commctrl.h>
|
||||||
|
#include <resource.h>
|
||||||
|
#include <ventoy_define.h>
|
||||||
|
#include <ventoy_util.h>
|
||||||
|
#include <ventoy_json.h>
|
||||||
|
#include <ventoy_disk.h>
|
||||||
|
#include <ventoy_http.h>
|
||||||
|
|
||||||
|
static BOOL g_running = FALSE;
|
||||||
|
static HWND g_refresh_button;
|
||||||
|
static HWND g_start_button;
|
||||||
|
static HWND g_openlink_button;
|
||||||
|
static HWND g_exit_button;
|
||||||
|
static HWND g_ComboxHwnd;
|
||||||
|
|
||||||
|
typedef enum MSGID
|
||||||
|
{
|
||||||
|
MSGID_ERROR = 0,
|
||||||
|
MSGID_INFO,
|
||||||
|
MSGID_INVALID_DIR,
|
||||||
|
MSGID_NEW_DIR_FAIL,
|
||||||
|
MSGID_RENAME_VENTOY,
|
||||||
|
MSGID_INTERNAL_ERR,
|
||||||
|
MSGID_BTN_REFRESH,
|
||||||
|
MSGID_BTN_START,
|
||||||
|
MSGID_BTN_STOP,
|
||||||
|
MSGID_BTN_LINK,
|
||||||
|
MSGID_BTN_EXIT,
|
||||||
|
|
||||||
|
MSGID_BTN_STOP_TIP,
|
||||||
|
MSGID_BTN_EXIT_TIP,
|
||||||
|
MSGID_RUNNING_TIP,
|
||||||
|
|
||||||
|
MSGID_BUTT
|
||||||
|
}MSGID;
|
||||||
|
|
||||||
|
|
||||||
|
const WCHAR *g_msg_cn[MSGID_BUTT] =
|
||||||
|
{
|
||||||
|
L"错误",
|
||||||
|
L"提醒",
|
||||||
|
L"请在 Ventoy 盘根目录下运行本程序！（存放ISO文件的位置）",
|
||||||
|
L"创建 ventoy 目录失败，无法继续！",
|
||||||
|
L"ventoy 目录存在，但是大小写不匹配，请先将其重命名！",
|
||||||
|
L"内部错误，程序即将退出！",
|
||||||
|
L"刷新",
|
||||||
|
L"启动",
|
||||||
|
L"停止",
|
||||||
|
L"链接",
|
||||||
|
L"退出",
|
||||||
|
|
||||||
|
L"停止运行后浏览器页面将会关闭，是否继续？",
|
||||||
|
L"当前服务正在运行，是否退出？",
|
||||||
|
L"请先关闭正在运行的 VentoyPlugson 程序！",
|
||||||
|
};
|
||||||
|
const WCHAR *g_msg_en[MSGID_BUTT] =
|
||||||
|
{
|
||||||
|
L"Error",
|
||||||
|
L"Info",
|
||||||
|
L"Please run me at the root of Ventoy partition.",
|
||||||
|
L"Failed to create ventoy directory!",
|
||||||
|
L"ventoy directory case mismatch, please rename it first!",
|
||||||
|
L"Internal error, the program will exit!",
|
||||||
|
L"Refresh",
|
||||||
|
L"Start",
|
||||||
|
L"Stop",
|
||||||
|
L"Link",
|
||||||
|
L"Exit",
|
||||||
|
|
||||||
|
L"The browser page will close after stop, continue?",
|
||||||
|
L"Service is running, continue?",
|
||||||
|
L"Please close another running VentoyPlugson instance!",
|
||||||
|
};
|
||||||
|
|
||||||
|
const WCHAR **g_msg_lang = NULL;
|
||||||
|
|
||||||
|
HINSTANCE g_hInst;
|
||||||
|
|
||||||
|
char g_log_file[MAX_PATH];
|
||||||
|
char g_cur_dir[MAX_PATH];
|
||||||
|
|
||||||
|
int ventoy_log_init(void);
|
||||||
|
void ventoy_log_exit(void);
|
||||||
|
|
||||||
|
static BOOL OnDestroyDialog()
|
||||||
|
{
|
||||||
|
ventoy_http_exit();
|
||||||
|
ventoy_disk_exit();
|
||||||
|
#ifndef VENTOY_SIM
|
||||||
|
ventoy_www_exit();
|
||||||
|
#endif
|
||||||
|
ventoy_log_exit();
|
||||||
|
return TRUE;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static void OpenURL(void)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
char url[128];
|
||||||
|
const static char * Browsers[] =
|
||||||
|
{
|
||||||
|
"C:\\Program Files (x86)\\Google\\Chrome\\Application\\chrome.exe",
|
||||||
|
"C:\\Program Files\\Google\\Chrome\\Application\\chrome.exe",
|
||||||
|
"C:\\Program Files (x86)\\Mozilla Firefox\\firefox.exe",
|
||||||
|
"C:\\Program Files\\Mozilla Firefox\\firefox.exe",
|
||||||
|
NULL
|
||||||
|
};
|
||||||
|
|
||||||
|
sprintf_s(url, sizeof(url), "http://%s:%s/index.html", g_sysinfo.ip, g_sysinfo.port);
|
||||||
|
|
||||||
|
for (i = 0; Browsers[i] != NULL; i++)
|
||||||
|
{
|
||||||
|
if (ventoy_is_file_exist("%s", Browsers[i]))
|
||||||
|
{
|
||||||
|
ShellExecuteA(NULL, "open", Browsers[i], url, NULL, SW_SHOW);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
ShellExecuteA(NULL, "open", url, NULL, NULL, SW_SHOW);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static void FillCombox(HWND hWnd)
|
||||||
|
{
|
||||||
|
int i = 0;
|
||||||
|
int num = 0;
|
||||||
|
const ventoy_disk *list = NULL;
|
||||||
|
CHAR DeviceName[256];
|
||||||
|
|
||||||
|
// delete all items
|
||||||
|
SendMessage(g_ComboxHwnd, CB_RESETCONTENT, 0, 0);
|
||||||
|
|
||||||
|
list = ventoy_get_disk_list(&num);
|
||||||
|
if (NULL == list || num <= 0)
|
||||||
|
{
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 0; i < num; i++)
|
||||||
|
{
|
||||||
|
sprintf_s(DeviceName, sizeof(DeviceName),
|
||||||
|
"%C: [%s] %s",
|
||||||
|
list[i].devname[0],
|
||||||
|
list[i].cur_capacity,
|
||||||
|
list[i].cur_model);
|
||||||
|
SendMessageA(g_ComboxHwnd, CB_ADDSTRING, 0, (LPARAM)DeviceName);
|
||||||
|
}
|
||||||
|
SendMessage(g_ComboxHwnd, CB_SETCURSEL, 0, 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static BOOL InitDialog(HWND hWnd, WPARAM wParam, LPARAM lParam)
|
||||||
|
{
|
||||||
|
HICON hIcon;
|
||||||
|
|
||||||
|
g_ComboxHwnd = GetDlgItem(hWnd, IDC_COMBO1);
|
||||||
|
g_refresh_button = GetDlgItem(hWnd, IDC_BUTTON1);
|
||||||
|
g_start_button = GetDlgItem(hWnd, IDC_BUTTON2);
|
||||||
|
g_openlink_button = GetDlgItem(hWnd, IDC_BUTTON3);
|
||||||
|
g_exit_button = GetDlgItem(hWnd, IDC_BUTTON4);
|
||||||
|
|
||||||
|
hIcon = LoadIcon(g_hInst, MAKEINTRESOURCE(IDI_ICON1));
|
||||||
|
SendMessage(hWnd, WM_SETICON, ICON_BIG, (LPARAM)hIcon);
|
||||||
|
SendMessage(hWnd, WM_SETICON, ICON_SMALL, (LPARAM)hIcon);
|
||||||
|
|
||||||
|
SetWindowTextW(g_refresh_button, g_msg_lang[MSGID_BTN_REFRESH]);
|
||||||
|
SetWindowTextW(g_start_button, g_msg_lang[MSGID_BTN_START]);
|
||||||
|
SetWindowTextW(g_openlink_button, g_msg_lang[MSGID_BTN_LINK]);
|
||||||
|
SetWindowTextW(g_exit_button, g_msg_lang[MSGID_BTN_EXIT]);
|
||||||
|
|
||||||
|
EnableWindow(g_openlink_button, FALSE);
|
||||||
|
|
||||||
|
FillCombox(hWnd);
|
||||||
|
|
||||||
|
return TRUE;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void VentoyStopService()
|
||||||
|
{
|
||||||
|
ventoy_http_stop();
|
||||||
|
}
|
||||||
|
|
||||||
|
static int VentoyStartService(int sel)
|
||||||
|
{
|
||||||
|
int rc;
|
||||||
|
BOOL bRet;
|
||||||
|
char Path[128];
|
||||||
|
char CurDir[MAX_PATH];
|
||||||
|
const ventoy_disk *disk = NULL;
|
||||||
|
|
||||||
|
vlog("VentoyStartService ...\n");
|
||||||
|
|
||||||
|
disk = ventoy_get_disk_node(sel);
|
||||||
|
if (disk == NULL)
|
||||||
|
{
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
vlog("Start service at %C: %s %s ...\n", disk->devname[0], disk->cur_model, disk->cur_ventoy_ver);
|
||||||
|
|
||||||
|
g_cur_dir[0] = disk->devname[0];
|
||||||
|
g_cur_dir[1] = ':';
|
||||||
|
g_cur_dir[2] = '\\';
|
||||||
|
g_cur_dir[3] = 0;
|
||||||
|
|
||||||
|
g_sysinfo.pathcase = disk->pathcase;
|
||||||
|
g_sysinfo.cur_secureboot = disk->cur_secureboot;
|
||||||
|
g_sysinfo.cur_part_style = disk->cur_part_style;
|
||||||
|
strlcpy(g_sysinfo.cur_fsname, disk->cur_fsname);
|
||||||
|
strlcpy(g_sysinfo.cur_capacity, disk->cur_capacity);
|
||||||
|
strlcpy(g_sysinfo.cur_model, disk->cur_model);
|
||||||
|
strlcpy(g_sysinfo.cur_ventoy_ver, disk->cur_ventoy_ver);
|
||||||
|
|
||||||
|
bRet = SetCurrentDirectoryA(g_cur_dir);
|
||||||
|
vlog("SetCurrentDirectoryA %u <%s>\n", bRet, g_cur_dir);
|
||||||
|
|
||||||
|
CurDir[0] = 0;
|
||||||
|
GetCurrentDirectoryA(sizeof(CurDir), CurDir);
|
||||||
|
vlog("CurDir=<%s>\n", CurDir);
|
||||||
|
|
||||||
|
if (strcmp(g_cur_dir, CurDir))
|
||||||
|
{
|
||||||
|
vlog("Failed to change current directory.");
|
||||||
|
}
|
||||||
|
|
||||||
|
g_cur_dir[2] = 0;
|
||||||
|
|
||||||
|
if (ventoy_is_directory_exist("ventoy"))
|
||||||
|
{
|
||||||
|
if (g_sysinfo.pathcase)
|
||||||
|
{
|
||||||
|
vlog("ventoy directory already exist, check case sensitive.\n");
|
||||||
|
strlcpy(Path, "ventoy");
|
||||||
|
|
||||||
|
rc = ventoy_path_case(Path, 0);
|
||||||
|
vlog("ventoy_path_case actual path is <%s> <count:%d>\n", Path, rc);
|
||||||
|
|
||||||
|
if (rc)
|
||||||
|
{
|
||||||
|
vlog("ventoy directory case mismatch, rename<%s>--><%s>\n", Path, "ventoy");
|
||||||
|
if (MoveFileA(Path, "ventoy"))
|
||||||
|
{
|
||||||
|
vlog("Rename <%s>--><%s> success\n", Path, "ventoy");
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vlog("Rename <%s>--><%s> failed %u\n", Path, "ventoy", LASTERR);
|
||||||
|
MessageBoxW(NULL, g_msg_lang[MSGID_RENAME_VENTOY], g_msg_lang[MSGID_ERROR], MB_OK | MB_ICONERROR);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vlog("ventoy directory already exist, no need to check case sensitive.\n");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
if (CreateDirectoryA("ventoy", NULL))
|
||||||
|
{
|
||||||
|
vlog("Create ventoy directory success.\n");
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vlog("Create ventoy directory failed %u.\n", LASTERR);
|
||||||
|
MessageBoxW(NULL, g_msg_lang[MSGID_NEW_DIR_FAIL], g_msg_lang[MSGID_ERROR], MB_OK | MB_ICONERROR);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return ventoy_http_start(g_sysinfo.ip, g_sysinfo.port);
|
||||||
|
}
|
||||||
|
|
||||||
|
INT_PTR CALLBACK DialogProc(HWND hWnd, UINT Message, WPARAM wParam, LPARAM lParam)
|
||||||
|
{
|
||||||
|
int rc;
|
||||||
|
int nCurSel;
|
||||||
|
WORD NotifyCode;
|
||||||
|
WORD CtrlID;
|
||||||
|
|
||||||
|
switch (Message)
|
||||||
|
{
|
||||||
|
case WM_NOTIFY:
|
||||||
|
{
|
||||||
|
UINT code = 0;
|
||||||
|
UINT_PTR idFrom = 0;
|
||||||
|
|
||||||
|
if (lParam)
|
||||||
|
{
|
||||||
|
code = ((LPNMHDR)lParam)->code;
|
||||||
|
idFrom = ((LPNMHDR)lParam)->idFrom;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (idFrom == IDC_SYSLINK1 && (NM_CLICK == code || NM_RETURN == code))
|
||||||
|
{
|
||||||
|
OpenURL();
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case WM_COMMAND:
|
||||||
|
{
|
||||||
|
NotifyCode = HIWORD(wParam);
|
||||||
|
CtrlID = LOWORD(wParam);
|
||||||
|
|
||||||
|
if (NotifyCode == BN_CLICKED)
|
||||||
|
{
|
||||||
|
if (CtrlID == IDC_BUTTON1)
|
||||||
|
{
|
||||||
|
if (!g_running)
|
||||||
|
{
|
||||||
|
//refresh
|
||||||
|
ventoy_disk_exit();
|
||||||
|
ventoy_disk_init();
|
||||||
|
FillCombox(hWnd);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else if (CtrlID == IDC_BUTTON2)
|
||||||
|
{
|
||||||
|
if (g_running)
|
||||||
|
{
|
||||||
|
if (IDYES == MessageBoxW(NULL, g_msg_lang[MSGID_BTN_STOP_TIP], g_msg_lang[MSGID_INFO], MB_YESNO | MB_ICONINFORMATION))
|
||||||
|
{
|
||||||
|
VentoyStopService();
|
||||||
|
|
||||||
|
g_running = FALSE;
|
||||||
|
SetWindowTextW(g_start_button, g_msg_lang[MSGID_BTN_START]);
|
||||||
|
EnableWindow(g_ComboxHwnd, TRUE);
|
||||||
|
EnableWindow(g_refresh_button, TRUE);
|
||||||
|
EnableWindow(g_openlink_button, FALSE);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
nCurSel = (int)SendMessage(g_ComboxHwnd, CB_GETCURSEL, 0, 0);
|
||||||
|
if (CB_ERR != nCurSel)
|
||||||
|
{
|
||||||
|
rc = VentoyStartService(nCurSel);
|
||||||
|
if (rc)
|
||||||
|
{
|
||||||
|
vlog("Ventoy failed to start http server, check %s for detail\n", g_log_file);
|
||||||
|
MessageBoxW(NULL, g_msg_lang[MSGID_INTERNAL_ERR], g_msg_lang[MSGID_ERROR], MB_OK | MB_ICONERROR);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
g_running = TRUE;
|
||||||
|
SetWindowTextW(g_start_button, g_msg_lang[MSGID_BTN_STOP]);
|
||||||
|
|
||||||
|
EnableWindow(g_ComboxHwnd, FALSE);
|
||||||
|
EnableWindow(g_refresh_button, FALSE);
|
||||||
|
EnableWindow(g_openlink_button, TRUE);
|
||||||
|
|
||||||
|
OpenURL();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else if (CtrlID == IDC_BUTTON3)
|
||||||
|
{
|
||||||
|
if (g_running)
|
||||||
|
{
|
||||||
|
OpenURL();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else if (CtrlID == IDC_BUTTON4)
|
||||||
|
{
|
||||||
|
if (g_running)
|
||||||
|
{
|
||||||
|
if (IDYES != MessageBoxW(NULL, g_msg_lang[MSGID_BTN_EXIT_TIP], g_msg_lang[MSGID_INFO], MB_YESNO | MB_ICONINFORMATION))
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
ventoy_http_stop();
|
||||||
|
}
|
||||||
|
|
||||||
|
OnDestroyDialog();
|
||||||
|
EndDialog(hWnd, 0);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case WM_INITDIALOG:
|
||||||
|
{
|
||||||
|
InitDialog(hWnd, wParam, lParam);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
case WM_CLOSE:
|
||||||
|
{
|
||||||
|
if (g_running)
|
||||||
|
{
|
||||||
|
if (IDYES != MessageBoxW(NULL, g_msg_lang[MSGID_BTN_EXIT_TIP], g_msg_lang[MSGID_INFO], MB_YESNO | MB_ICONINFORMATION))
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
VentoyStopService();
|
||||||
|
}
|
||||||
|
|
||||||
|
OnDestroyDialog();
|
||||||
|
EndDialog(hWnd, 0);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
static int ParseCmdLine(LPSTR lpCmdLine, char *ip, char *port)
|
||||||
|
{
|
||||||
|
int portnum;
|
||||||
|
char *ipstart = ip;
|
||||||
|
char *pos;
|
||||||
|
|
||||||
|
|
||||||
|
if (!lpCmdLine)
|
||||||
|
{
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
pos = strstr(lpCmdLine, "-H");
|
||||||
|
if (!pos)
|
||||||
|
{
|
||||||
|
pos = strstr(lpCmdLine, "-h");
|
||||||
|
}
|
||||||
|
|
||||||
|
if (pos)
|
||||||
|
{
|
||||||
|
pos += 2;
|
||||||
|
while (*pos == ' ' || *pos == '\t')
|
||||||
|
{
|
||||||
|
pos++;
|
||||||
|
}
|
||||||
|
|
||||||
|
while (isdigit(*pos) || *pos == '.')
|
||||||
|
{
|
||||||
|
*ipstart++ = *pos++;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
pos = strstr(lpCmdLine, "-P");
|
||||||
|
if (!pos)
|
||||||
|
{
|
||||||
|
pos = strstr(lpCmdLine, "-p");
|
||||||
|
}
|
||||||
|
|
||||||
|
if (pos)
|
||||||
|
{
|
||||||
|
portnum = (int)strtol(pos + 3, NULL, 10);
|
||||||
|
sprintf_s(port, 16, "%d", portnum);
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
int APIENTRY WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, INT nCmdShow)
|
||||||
|
{
|
||||||
|
int rc;
|
||||||
|
HANDLE hMutex;
|
||||||
|
|
||||||
|
UNREFERENCED_PARAMETER(hPrevInstance);
|
||||||
|
|
||||||
|
if (GetUserDefaultUILanguage() == 0x0804)
|
||||||
|
{
|
||||||
|
g_sysinfo.language = LANGUAGE_CN;
|
||||||
|
g_msg_lang = g_msg_cn;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
g_sysinfo.language = LANGUAGE_EN;
|
||||||
|
g_msg_lang = g_msg_en;
|
||||||
|
}
|
||||||
|
|
||||||
|
hMutex = CreateMutexA(NULL, TRUE, "PlugsonMUTEX");
|
||||||
|
if ((hMutex != NULL) && (GetLastError() == ERROR_ALREADY_EXISTS))
|
||||||
|
{
|
||||||
|
MessageBoxW(NULL, g_msg_lang[MSGID_RUNNING_TIP], g_msg_lang[MSGID_ERROR], MB_OK | MB_ICONERROR);
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
GetCurrentDirectoryA(MAX_PATH, g_cur_dir);
|
||||||
|
sprintf_s(g_log_file, sizeof(g_log_file), "%s\\%s", g_cur_dir, LOG_FILE);
|
||||||
|
ventoy_log_init();
|
||||||
|
|
||||||
|
|
||||||
|
ParseCmdLine(lpCmdLine, g_sysinfo.ip, g_sysinfo.port);
|
||||||
|
if (g_sysinfo.ip[0] == 0)
|
||||||
|
{
|
||||||
|
strlcpy(g_sysinfo.ip, "127.0.0.1");
|
||||||
|
}
|
||||||
|
if (g_sysinfo.port[0] == 0)
|
||||||
|
{
|
||||||
|
strlcpy(g_sysinfo.port, "24681");
|
||||||
|
}
|
||||||
|
|
||||||
|
vlog("===============================================\n");
|
||||||
|
vlog("===== Ventoy Plugson %s:%s =====\n", g_sysinfo.ip, g_sysinfo.port);
|
||||||
|
vlog("===============================================\n");
|
||||||
|
|
||||||
|
|
||||||
|
ventoy_disk_init();
|
||||||
|
#ifndef VENTOY_SIM
|
||||||
|
rc = ventoy_www_init();
|
||||||
|
if (rc)
|
||||||
|
{
|
||||||
|
vlog("Failed to init www\n");
|
||||||
|
MessageBoxW(NULL, g_msg_lang[MSGID_INTERNAL_ERR], g_msg_lang[MSGID_ERROR], MB_OK | MB_ICONERROR);
|
||||||
|
|
||||||
|
ventoy_disk_exit();
|
||||||
|
ventoy_log_exit();
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
ventoy_http_init();
|
||||||
|
|
||||||
|
g_hInst = hInstance;
|
||||||
|
DialogBoxA(hInstance, MAKEINTRESOURCE(IDD_DIALOG1), NULL, DialogProc);
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
Binary file not shown.
|
|
@ -0,0 +1,22 @@
|
||||||
|
|
||||||
|
Microsoft Visual Studio Solution File, Format Version 12.00
|
||||||
|
# Visual Studio 2013
|
||||||
|
VisualStudioVersion = 12.0.21005.1
|
||||||
|
MinimumVisualStudioVersion = 10.0.40219.1
|
||||||
|
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "VentoyPlugson", "VentoyPlugson\VentoyPlugson.vcxproj", "{321D6EE2-2AB3-4103-9F05-EC4EC67A75E1}"
|
||||||
|
EndProject
|
||||||
|
Global
|
||||||
|
GlobalSection(SolutionConfigurationPlatforms) = preSolution
|
||||||
|
Debug|Win32 = Debug|Win32
|
||||||
|
Release|Win32 = Release|Win32
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ProjectConfigurationPlatforms) = postSolution
|
||||||
|
{321D6EE2-2AB3-4103-9F05-EC4EC67A75E1}.Debug|Win32.ActiveCfg = Debug|Win32
|
||||||
|
{321D6EE2-2AB3-4103-9F05-EC4EC67A75E1}.Debug|Win32.Build.0 = Debug|Win32
|
||||||
|
{321D6EE2-2AB3-4103-9F05-EC4EC67A75E1}.Release|Win32.ActiveCfg = Release|Win32
|
||||||
|
{321D6EE2-2AB3-4103-9F05-EC4EC67A75E1}.Release|Win32.Build.0 = Release|Win32
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(SolutionProperties) = preSolution
|
||||||
|
HideSolutionNode = FALSE
|
||||||
|
EndGlobalSection
|
||||||
|
EndGlobal
|
||||||
|
|
@ -0,0 +1,37 @@
|
||||||
|
<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
|
||||||
|
<assembly xmlns="urn:schemas-microsoft-com:asm.v1" manifestVersion="1.0">
|
||||||
|
<dependency>
|
||||||
|
<dependentAssembly>
|
||||||
|
<assemblyIdentity
|
||||||
|
type="win32"
|
||||||
|
name="Microsoft.Windows.Common-Controls"
|
||||||
|
version="6.0.0.0"
|
||||||
|
processorArchitecture="x86"
|
||||||
|
publicKeyToken="6595b64144ccf1df"
|
||||||
|
language="*"
|
||||||
|
/>
|
||||||
|
</dependentAssembly>
|
||||||
|
</dependency>
|
||||||
|
|
||||||
|
<compatibility xmlns="urn:schemas-microsoft-com:compatibility.v1">
|
||||||
|
<application>
|
||||||
|
<!-- Windows 10 -->
|
||||||
|
<supportedOS Id="{8e0f7a12-bfb3-4fe8-b9a5-48fd50a15a9a}"/>
|
||||||
|
<!-- Windows 8.1 -->
|
||||||
|
<supportedOS Id="{1f676c76-80e1-4239-95bb-83d0f6d0da78}"/>
|
||||||
|
<!-- Windows 8 -->
|
||||||
|
<supportedOS Id="{4a2f28e3-53b9-4441-ba9c-d69d4a4a6e38}"/>
|
||||||
|
<!-- Windows 7 -->
|
||||||
|
<supportedOS Id="{35138b9a-5d96-4fbd-8e2d-a2440225f93a}"/>
|
||||||
|
<!-- Windows Vista -->
|
||||||
|
<supportedOS Id="{e2011457-1546-43c5-a5fe-008deee3d3f0}"/>
|
||||||
|
</application>
|
||||||
|
</compatibility>
|
||||||
|
<trustInfo xmlns="urn:schemas-microsoft-com:asm.v3">
|
||||||
|
<security>
|
||||||
|
<requestedPrivileges>
|
||||||
|
<requestedExecutionLevel level="requireAdministrator" uiAccess="false"></requestedExecutionLevel>
|
||||||
|
</requestedPrivileges>
|
||||||
|
</security>
|
||||||
|
</trustInfo>
|
||||||
|
</assembly>
|
||||||
|
|
@ -0,0 +1,31 @@
|
||||||
|
<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
|
||||||
|
<assembly xmlns="urn:schemas-microsoft-com:asm.v1" manifestVersion="1.0">
|
||||||
|
<dependency>
|
||||||
|
<dependentAssembly>
|
||||||
|
<assemblyIdentity
|
||||||
|
type="win32"
|
||||||
|
name="Microsoft.Windows.Common-Controls"
|
||||||
|
version="6.0.0.0"
|
||||||
|
processorArchitecture="amd64"
|
||||||
|
publicKeyToken="6595b64144ccf1df"
|
||||||
|
language="*"
|
||||||
|
/>
|
||||||
|
</dependentAssembly>
|
||||||
|
</dependency>
|
||||||
|
|
||||||
|
<compatibility xmlns="urn:schemas-microsoft-com:compatibility.v1">
|
||||||
|
<application>
|
||||||
|
<!-- Windows 10 -->
|
||||||
|
<supportedOS Id="{8e0f7a12-bfb3-4fe8-b9a5-48fd50a15a9a}"/>
|
||||||
|
<!-- Windows 8.1 -->
|
||||||
|
<supportedOS Id="{1f676c76-80e1-4239-95bb-83d0f6d0da78}"/>
|
||||||
|
<!-- Windows 8 -->
|
||||||
|
<supportedOS Id="{4a2f28e3-53b9-4441-ba9c-d69d4a4a6e38}"/>
|
||||||
|
<!-- Windows 7 -->
|
||||||
|
<supportedOS Id="{35138b9a-5d96-4fbd-8e2d-a2440225f93a}"/>
|
||||||
|
<!-- Windows Vista -->
|
||||||
|
<supportedOS Id="{e2011457-1546-43c5-a5fe-008deee3d3f0}"/>
|
||||||
|
</application>
|
||||||
|
</compatibility>
|
||||||
|
|
||||||
|
</assembly>
|
||||||
|
|
@ -0,0 +1,31 @@
|
||||||
|
<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
|
||||||
|
<assembly xmlns="urn:schemas-microsoft-com:asm.v1" manifestVersion="1.0">
|
||||||
|
<dependency>
|
||||||
|
<dependentAssembly>
|
||||||
|
<assemblyIdentity
|
||||||
|
type="win32"
|
||||||
|
name="Microsoft.Windows.Common-Controls"
|
||||||
|
version="6.0.0.0"
|
||||||
|
processorArchitecture="arm"
|
||||||
|
publicKeyToken="6595b64144ccf1df"
|
||||||
|
language="*"
|
||||||
|
/>
|
||||||
|
</dependentAssembly>
|
||||||
|
</dependency>
|
||||||
|
|
||||||
|
<compatibility xmlns="urn:schemas-microsoft-com:compatibility.v1">
|
||||||
|
<application>
|
||||||
|
<!-- Windows 10 -->
|
||||||
|
<supportedOS Id="{8e0f7a12-bfb3-4fe8-b9a5-48fd50a15a9a}"/>
|
||||||
|
<!-- Windows 8.1 -->
|
||||||
|
<supportedOS Id="{1f676c76-80e1-4239-95bb-83d0f6d0da78}"/>
|
||||||
|
<!-- Windows 8 -->
|
||||||
|
<supportedOS Id="{4a2f28e3-53b9-4441-ba9c-d69d4a4a6e38}"/>
|
||||||
|
<!-- Windows 7 -->
|
||||||
|
<supportedOS Id="{35138b9a-5d96-4fbd-8e2d-a2440225f93a}"/>
|
||||||
|
<!-- Windows Vista -->
|
||||||
|
<supportedOS Id="{e2011457-1546-43c5-a5fe-008deee3d3f0}"/>
|
||||||
|
</application>
|
||||||
|
</compatibility>
|
||||||
|
|
||||||
|
</assembly>
|
||||||
|
|
@ -0,0 +1,31 @@
|
||||||
|
<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
|
||||||
|
<assembly xmlns="urn:schemas-microsoft-com:asm.v1" manifestVersion="1.0">
|
||||||
|
<dependency>
|
||||||
|
<dependentAssembly>
|
||||||
|
<assemblyIdentity
|
||||||
|
type="win32"
|
||||||
|
name="Microsoft.Windows.Common-Controls"
|
||||||
|
version="6.0.0.0"
|
||||||
|
processorArchitecture="arm64"
|
||||||
|
publicKeyToken="6595b64144ccf1df"
|
||||||
|
language="*"
|
||||||
|
/>
|
||||||
|
</dependentAssembly>
|
||||||
|
</dependency>
|
||||||
|
|
||||||
|
<compatibility xmlns="urn:schemas-microsoft-com:compatibility.v1">
|
||||||
|
<application>
|
||||||
|
<!-- Windows 10 -->
|
||||||
|
<supportedOS Id="{8e0f7a12-bfb3-4fe8-b9a5-48fd50a15a9a}"/>
|
||||||
|
<!-- Windows 8.1 -->
|
||||||
|
<supportedOS Id="{1f676c76-80e1-4239-95bb-83d0f6d0da78}"/>
|
||||||
|
<!-- Windows 8 -->
|
||||||
|
<supportedOS Id="{4a2f28e3-53b9-4441-ba9c-d69d4a4a6e38}"/>
|
||||||
|
<!-- Windows 7 -->
|
||||||
|
<supportedOS Id="{35138b9a-5d96-4fbd-8e2d-a2440225f93a}"/>
|
||||||
|
<!-- Windows Vista -->
|
||||||
|
<supportedOS Id="{e2011457-1546-43c5-a5fe-008deee3d3f0}"/>
|
||||||
|
</application>
|
||||||
|
</compatibility>
|
||||||
|
|
||||||
|
</assembly>
|
||||||
Binary file not shown.
|
After Width: | Height: | Size: 17 KiB |
Binary file not shown.
|
|
@ -0,0 +1,160 @@
|
||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project DefaultTargets="Build" ToolsVersion="12.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup Label="ProjectConfigurations">
|
||||||
|
<ProjectConfiguration Include="Debug|Win32">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|Win32">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
</ItemGroup>
|
||||||
|
<PropertyGroup Label="Globals">
|
||||||
|
<ProjectGuid>{321D6EE2-2AB3-4103-9F05-EC4EC67A75E1}</ProjectGuid>
|
||||||
|
<Keyword>Win32Proj</Keyword>
|
||||||
|
<RootNamespace>VentoyPlugson</RootNamespace>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v120</PlatformToolset>
|
||||||
|
<CharacterSet>MultiByte</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v120</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>MultiByte</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
|
||||||
|
<ImportGroup Label="ExtensionSettings">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<PropertyGroup Label="UserMacros" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
<IncludePath>..\..\..\src\Core;..\..\..\src\Web;..\..\..\src\Include;..\..\..\src\Lib\xz-embedded\linux\include;..\..\..\src\Lib\xz-embedded\linux\include\linux;..\..\..\src\Lib\xz-embedded\userspace;..\..\..\src\Lib\fat_io_lib;..\..\..\src\Lib\libhttp\include;$(ProjectDir);$(IncludePath)</IncludePath>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
<IncludePath>..\..\..\src\Core;..\..\..\src\Web;..\..\..\src\Include;..\..\..\src\Lib\xz-embedded\linux\include;..\..\..\src\Lib\xz-embedded\linux\include\linux;..\..\..\src\Lib\xz-embedded\userspace;..\..\..\src\Lib\fat_io_lib;..\..\..\src\Lib\libhttp\include;$(ProjectDir);$(IncludePath);$(VC_IncludePath);$(WindowsSDK_IncludePath)</IncludePath>
|
||||||
|
</PropertyGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<PrecompiledHeader>
|
||||||
|
</PrecompiledHeader>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<Optimization>Disabled</Optimization>
|
||||||
|
<PreprocessorDefinitions>WIN32;_DEBUG;_WINDOWS;INIT;STATIC=static;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<RuntimeLibrary>MultiThreadedDebug</RuntimeLibrary>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Windows</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
<UACExecutionLevel>RequireAdministrator</UACExecutionLevel>
|
||||||
|
</Link>
|
||||||
|
<Manifest>
|
||||||
|
<AdditionalManifestFiles>$(ProjectDir)\Res\Plugson32.manifest %(AdditionalManifestFiles)</AdditionalManifestFiles>
|
||||||
|
</Manifest>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<PrecompiledHeader>
|
||||||
|
</PrecompiledHeader>
|
||||||
|
<Optimization>MaxSpeed</Optimization>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<PreprocessorDefinitions>WIN32;NDEBUG;_WINDOWS;INIT;STATIC=static;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<RuntimeLibrary>MultiThreaded</RuntimeLibrary>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Windows</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<UACExecutionLevel>RequireAdministrator</UACExecutionLevel>
|
||||||
|
</Link>
|
||||||
|
<Manifest>
|
||||||
|
<AdditionalManifestFiles>$(ProjectDir)\Res\Plugson32.manifest %(AdditionalManifestFiles)</AdditionalManifestFiles>
|
||||||
|
</Manifest>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_crc32.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_disk.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_disk_windows.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_json.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_log.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_md5.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_util.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_util_windows.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_access.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_cache.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_filelib.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_format.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_misc.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_string.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_table.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_write.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\libhttp\include\civetweb.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\xz-embedded\linux\lib\decompress_unxz.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\main_windows.c" />
|
||||||
|
<ClCompile Include="..\..\..\src\Web\ventoy_http.c" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClInclude Include="..\..\..\src\Core\ventoy_define.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Core\ventoy_disk.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Core\ventoy_json.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Core\ventoy_util.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_access.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_cache.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_defs.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_filelib.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_format.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_list.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_misc.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_opts.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_string.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_table.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_types.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_write.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\libhttp\include\civetweb.h" />
|
||||||
|
<ClInclude Include="..\..\..\src\Web\ventoy_http.h" />
|
||||||
|
<ClInclude Include="resource.h" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\API.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\Configuration.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\COPYRIGHT.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\History.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\License.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\Media Access API.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\version.txt" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<None Include="..\..\..\src\Lib\libhttp\include\handle_form.inl" />
|
||||||
|
<None Include="..\..\..\src\Lib\libhttp\include\md5.inl" />
|
||||||
|
<None Include="..\..\..\src\Lib\libhttp\include\mod_duktape.inl" />
|
||||||
|
<None Include="..\..\..\src\Lib\libhttp\include\mod_lua.inl" />
|
||||||
|
<None Include="..\..\..\src\Lib\libhttp\include\timer.inl" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ResourceCompile Include="VentoyPlugson.rc" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Image Include="Res\plugson.ico" />
|
||||||
|
</ItemGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
|
||||||
|
<ImportGroup Label="ExtensionTargets">
|
||||||
|
</ImportGroup>
|
||||||
|
</Project>
|
||||||
|
|
@ -0,0 +1,174 @@
|
||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup>
|
||||||
|
<Filter Include="源文件">
|
||||||
|
<UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
|
||||||
|
<Extensions>cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="头文件">
|
||||||
|
<UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
|
||||||
|
<Extensions>h;hh;hpp;hxx;hm;inl;inc;xsd</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="资源文件">
|
||||||
|
<UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
|
||||||
|
<Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
|
||||||
|
</Filter>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_crc32.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_disk.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_disk_windows.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_json.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_log.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_md5.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_util.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Core\ventoy_util_windows.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_access.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_cache.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_filelib.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_format.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_misc.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_string.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_table.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\fat_io_lib\fat_write.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\libhttp\include\civetweb.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Web\ventoy_http.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\Lib\xz-embedded\linux\lib\decompress_unxz.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
<ClCompile Include="..\..\..\src\main_windows.c">
|
||||||
|
<Filter>源文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClInclude Include="..\..\..\src\Core\ventoy_define.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Core\ventoy_disk.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Core\ventoy_json.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Core\ventoy_util.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_access.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_cache.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_defs.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_filelib.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_format.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_list.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_misc.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_opts.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_string.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_table.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_types.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\fat_io_lib\fat_write.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Lib\libhttp\include\civetweb.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="..\..\..\src\Web\ventoy_http.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="resource.h">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\API.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\Configuration.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\COPYRIGHT.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\History.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\License.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\Media Access API.txt" />
|
||||||
|
<Text Include="..\..\..\src\Lib\fat_io_lib\version.txt" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<None Include="..\..\..\src\Lib\libhttp\include\handle_form.inl">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</None>
|
||||||
|
<None Include="..\..\..\src\Lib\libhttp\include\md5.inl">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</None>
|
||||||
|
<None Include="..\..\..\src\Lib\libhttp\include\mod_duktape.inl">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</None>
|
||||||
|
<None Include="..\..\..\src\Lib\libhttp\include\mod_lua.inl">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</None>
|
||||||
|
<None Include="..\..\..\src\Lib\libhttp\include\timer.inl">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</None>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ResourceCompile Include="VentoyPlugson.rc">
|
||||||
|
<Filter>资源文件</Filter>
|
||||||
|
</ResourceCompile>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Image Include="Res\refresh.ico">
|
||||||
|
<Filter>资源文件</Filter>
|
||||||
|
</Image>
|
||||||
|
</ItemGroup>
|
||||||
|
</Project>
|
||||||
|
|
@ -0,0 +1,13 @@
|
||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="12.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<LocalDebuggerWorkingDirectory>E:\</LocalDebuggerWorkingDirectory>
|
||||||
|
<DebuggerFlavor>WindowsLocalDebugger</DebuggerFlavor>
|
||||||
|
<LocalDebuggerCommandArguments>
|
||||||
|
</LocalDebuggerCommandArguments>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<LocalDebuggerWorkingDirectory>E:\</LocalDebuggerWorkingDirectory>
|
||||||
|
<DebuggerFlavor>WindowsLocalDebugger</DebuggerFlavor>
|
||||||
|
</PropertyGroup>
|
||||||
|
</Project>
|
||||||
Binary file not shown.
|
|
@ -0,0 +1 @@
|
||||||
|
20211201 20:08:18
|
||||||
Binary file not shown.
|
After Width: | Height: | Size: 9.4 KiB |
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue