Compare commits
63 Commits
dev
...
05e7ecb5e1
| Author | SHA1 | Date | |
|---|---|---|---|
| 05e7ecb5e1 | |||
| 54e9308268 | |||
| 5ef543f760 | |||
| 7a8b6cdc73 | |||
| f4f6bd06d1 | |||
| 9d71467182 | |||
| d6eccb2caa | |||
| 97aea8ddf2 | |||
| fab41ccc2e | |||
| 124192efbf | |||
| bda4253cc1 | |||
| 71ea8e5881 | |||
| f55e565aac | |||
| 607c9495d7 | |||
| 94b48bbfef | |||
| 909f4bb2ca | |||
| 8dad65dd90 | |||
| 6df830554d | |||
| 28780ef13c | |||
| 9ea7e38759 | |||
| fec8a1e844 | |||
| f8c150f2a3 | |||
| b040a772e7 | |||
| 3387c26a22 | |||
| 6dbcf82f0b | |||
| a08903e55e | |||
| 92d1be28af | |||
| 6cea21099d | |||
| f623bfe80c | |||
| 159e70d654 | |||
| 5a93fe6b47 | |||
| 3699e9f9eb | |||
| 1b818570c2 | |||
| 1f6a506af4 | |||
| 38dd2d87ed | |||
| bda790702f | |||
| 93f7075275 | |||
| 546d4afeaf | |||
| f8dc759b6a | |||
| 045787a135 | |||
| 7071dc5725 | |||
| 52cf521da4 | |||
| 1b648d6db2 | |||
| b5aa787fb4 | |||
| a248db691c | |||
| eae78e0422 | |||
| 22185486b6 | |||
| 98a6d550a8 | |||
| 504f8546d0 | |||
| 2aadd7bc51 | |||
| 78dc9f765f | |||
| 55f93efa75 | |||
| 9b9e22c426 | |||
| ab789d8ba7 | |||
| 294e6dbbcb | |||
| f8a13b807e | |||
| 76a6a81d69 | |||
| 78d76a1add | |||
| 14f4304b94 | |||
| 2ec32cbecf | |||
| 443e3e3702 | |||
| 7c23bd43b7 | |||
| a773e61b56 |
9
.gitignore
vendored
Normal file
9
.gitignore
vendored
Normal file
@@ -0,0 +1,9 @@
|
||||
/.ccls-cache/
|
||||
/*.c
|
||||
/*.sh
|
||||
/COPYING.*
|
||||
/license-*
|
||||
/test/
|
||||
/todo/
|
||||
/c/lib/
|
||||
/c/obj/
|
||||
1047
bash/COPYING
1047
bash/COPYING
File diff suppressed because it is too large
Load Diff
@@ -1,15 +1,15 @@
|
||||
#!/bin/bash
|
||||
#!/usr/bin/env bash
|
||||
#
|
||||
# dup-live-disk.sh - duplicate (possibly live) system partitions
|
||||
#
|
||||
# (C) Bruno Raoult ("br"), 2007-2021
|
||||
# Licensed under the Mozilla Public License (MPL) version 2.0.
|
||||
# (C) Bruno Raoult ("br"), 2007-2022
|
||||
# Licensed under the GNU General Public License v3.0 or later.
|
||||
# Some rights reserved. See COPYING.
|
||||
#
|
||||
# You should have received a copy of the Mozilla Public License along with this
|
||||
# program. If not, see <https://www.mozilla.org/en-US/MPL>
|
||||
# You should have received a copy of the GNU General Public License along with this
|
||||
# program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
#
|
||||
# SPDX-License-Identifier: MPL-2.0 <https://spdx.org/licenses/MPL-2.0.html>
|
||||
# SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
#
|
||||
#%MAN_BEGIN%
|
||||
# NAME
|
||||
@@ -37,16 +37,27 @@
|
||||
#
|
||||
# -c, --copy=ACTION
|
||||
# ACTION can be 'yes' (all eligible partitions will be copied), 'no'
|
||||
# (no partition will be copied), or 'ask' (will ask for all eligible
|
||||
# partitions). Default is 'no'.
|
||||
# (no partition will be copied), or 'ask'. Default is 'Ask'.
|
||||
# See ACTIONS below.
|
||||
#
|
||||
# -d, --dry-run
|
||||
# Dry-run: nothing will be really be done.
|
||||
# Dry-run: nothing will be really be written to disk. This option
|
||||
# 0verrides any of '--yes', '--copy', '--fstab', '--grub', and
|
||||
# '--mariadb' options.
|
||||
#
|
||||
# -g, --grub
|
||||
# Install grub on destination disk.
|
||||
# Warning: Only works if root partition contains all necessary for
|
||||
# grub: /boot, /usr, etc...
|
||||
# -f, --fstab=ACTION
|
||||
# ACTION ('yes', 'no', or 'ask') defines whether fstab should be
|
||||
# adjusted on destination root partition. Default is 'ask'.
|
||||
# /etc/fstab/LABEL must exist on source root partition. LABEL is the
|
||||
# partition LABEL of destination root disk.
|
||||
# See ACTIONS below.
|
||||
#
|
||||
# -g, --grub=ACTION
|
||||
# ACTION ('yes', 'no', 'ask') defines if grub should be installed on
|
||||
# destination disk). Default is 'ask'.
|
||||
# Warning: Only works if root partition contains all necessary files
|
||||
# for grub: /boot, /usr, etc...
|
||||
# See ACTIONS below.
|
||||
#
|
||||
# -h, --help
|
||||
# Display short help and exit.
|
||||
@@ -54,20 +65,75 @@
|
||||
# -m, --man
|
||||
# Display a "man-like" description and exit.
|
||||
#
|
||||
# --mariadb
|
||||
# Stop mysql/mariadb before effective copies, restart after.
|
||||
# -M, --mariadb=ACTION
|
||||
# ACTION may be 'yes', 'no', or 'ask', which indicates whether mysql
|
||||
# or mariadb should be stopped before effective partition copies, and
|
||||
# restarted after.
|
||||
# See ACTIONS below.
|
||||
#
|
||||
# -n, --no
|
||||
# Will answer 'no' to any question asked to user.
|
||||
#
|
||||
# -r, --root=PARTNUM
|
||||
# Mandatory if SRC is provided, forbidden otherwise.
|
||||
# PARTNUM is root partition number on SRC disk.
|
||||
#
|
||||
# -y, --yes
|
||||
# Will answer 'yes' to any question asked to user.
|
||||
#
|
||||
# ACTIONS
|
||||
# Before writing anything, of if something unexpected happens, the
|
||||
# program may ask to proceed. User may answer 'yes', 'no', or 'quit'.
|
||||
# Options --yes, and --no will default respectively to 'yes' and 'no',
|
||||
# default is to ask.
|
||||
# Options '--copy', '--fstab', and '--grub' (which can take the values
|
||||
# 'yes', 'no', and 'ask') can override the specific action for copying
|
||||
# partitions, adjusting destination fstab file, and
|
||||
# installing grub on destination disk.
|
||||
#
|
||||
# EXAMPLES
|
||||
# Copy sda to sdb, root partition is partition (sda1/sdb1)
|
||||
# Copy sda to sdb, root partition is partition 1 (sda1/sdb1) on both
|
||||
# disks. The user will be asked for any action (partition copy, grub,
|
||||
# etc...)
|
||||
# $ sudo dup-live-disk.sh --root 1 sda sdb
|
||||
#
|
||||
# Copy live system (where / is mounted) to sdb
|
||||
# Copy live disk (all partitions of current / partition disk) to sdb.
|
||||
# The user will be asked for any action (partition copy, grub, etc...)
|
||||
# $ sudo dup-live-disk.sh sdb
|
||||
#
|
||||
# Copy live disk (all partitions of current / partition disk) to sdb.
|
||||
# All valid partitions will be copied, and grub installed on sdb.
|
||||
# $ sudo dup-live-disk.sh --yes sdb
|
||||
#
|
||||
# Do not copy partitions, only install grub on sdb.
|
||||
# $ sudo ./dup-live-disk.sh --copy=no --grub=yes sdb
|
||||
# or
|
||||
# $ sudo ./dup-live-disk.sh --no --grub=yes sdb
|
||||
#
|
||||
# AUTOFS
|
||||
# This script relies on autofs to mount partitions according to partitions
|
||||
# LABELS. See autofs(5) and auto.master(5) for more details.
|
||||
# For example, the following will mount partitions withs LABELS 'root1',
|
||||
# 'root2' in /mnt/hd/root1 and /mnt/hd/root2, simply when we try to access
|
||||
# the directories (for example with 'ls /mnt/hd/root1') :
|
||||
#
|
||||
# # in file /etc/auto.master
|
||||
# /mnt/hd /etc/auto.hd --timeout 60 --ghost
|
||||
#
|
||||
# # in file /etc/auto.hd
|
||||
# * -fstype=auto,defaults :LABEL=&
|
||||
#
|
||||
# This script uses /mnt as default autofs directory. In fact, /mnt contains
|
||||
# symbolic links to different disk labels :
|
||||
#
|
||||
# $ ls -l /mnt/root?
|
||||
# lrwxrwxrwx 1 root root 8 Oct 10 2020 /mnt/root1 -> hd/root1/
|
||||
# lrwxrwxrwx 1 root root 8 May 25 2018 /mnt/root2 -> hd/root2/
|
||||
#
|
||||
# It means that accessing /mnt/root1 will automagically mount /mnt/hd/root1.
|
||||
# With the maps above, and without the /mnt symlinks, it is possible to
|
||||
# use '--autofs=/mnt/hd' to directly use the automounter map.
|
||||
#
|
||||
# BUGS
|
||||
# * Cannot generate grub with a separate /boot partition.
|
||||
# * This script will not work for all situations, I strongly suggest you
|
||||
@@ -75,7 +141,6 @@
|
||||
# * Extended attributes are not preserved (easy fix, but I cannot test)
|
||||
#
|
||||
# TODO
|
||||
# * Write about autofs configuration.
|
||||
# * Log levels
|
||||
#%MAN_END%
|
||||
|
||||
@@ -87,51 +152,37 @@ CMD="${0##*/}"
|
||||
# shellcheck disable=2034
|
||||
VALIDFS=(ext3 ext4 btrfs vfat reiserfs xfs zfs)
|
||||
|
||||
function man {
|
||||
sed -n '/^#%MAN_BEGIN%/,/^#%MAN_END%$/{//!s/^#[ ]\{0,1\}//p}' "$SCRIPT"
|
||||
man() {
|
||||
sed -n '/^#%MAN_BEGIN%/,/^#%MAN_END%$/{//!s/^#[ ]\{0,1\}//p}' "$SCRIPT" | more
|
||||
}
|
||||
|
||||
function usage {
|
||||
usage() {
|
||||
cat <<_EOF
|
||||
Usage: $CMD [OPTIONS] [SRC] DST
|
||||
Duplicate SRC (or live system) disk partitions to DST disk partitions.
|
||||
|
||||
Options:
|
||||
-a, --autofs=DIR autofs "LABEL-based" directory. Default is '/mnt'.
|
||||
-c, --copy=ACTION do partitions copies ('yes'), do not copy then ('no')
|
||||
or ask for each of them ('ask'). Default is 'no'.
|
||||
-a, --autofs=DIR autofs 'LABEL-based' directory. Default is '/mnt'.
|
||||
-c, --copy=ACTION do partitions copies (ACTION='yes', 'no', 'ask).
|
||||
Default is 'ask'
|
||||
-d, --dry-run dry-run: nothing will be written to disk
|
||||
-g, --grub install grub on destination disk
|
||||
-f, --fstab=ACTION adjust fstab on destination disk ('yes', 'no',
|
||||
'ask'). Default is 'ask'
|
||||
-g, --grub=ACTION install grub on destination disk ('yes', 'no',
|
||||
'ask'). Default is 'ask'
|
||||
-h, --help this help
|
||||
-m, --man display a "man-like" page and exit
|
||||
--mariadb stop and restart mysql/mariadb server before and
|
||||
after copies
|
||||
-M, --mariadb=ACTION stop and restart mysql/mariadb server before and
|
||||
after copies ('yes', 'no', 'ask'). Default is 'ask'
|
||||
-n, --no Will answer 'no' to any question
|
||||
-r, --root=PARTNUM root partition number on SRC device
|
||||
mandatory if and only if SRC is provided
|
||||
-y, --yes Will answer 'yes' to any question
|
||||
|
||||
SRC and DST have strong constraints on partitions schemes and naming.
|
||||
Type '$CMD --man" for more details"
|
||||
Type '$CMD --man' for more details
|
||||
_EOF
|
||||
exit 0
|
||||
}
|
||||
|
||||
# mariadb start/stop
|
||||
function mariadb_maybe_stop {
|
||||
if [[ $MARIADB == yes ]] && systemctl is-active --quiet mysql; then
|
||||
#log -n "stopping mariadb/mysql... "
|
||||
echorun systemctl stop mariadb
|
||||
# bug if script stops here
|
||||
MARIADBSTOPPED=yes
|
||||
#log "done."
|
||||
fi
|
||||
}
|
||||
function mariadb_maybe_start {
|
||||
if [[ $MARIADB == yes && $MARIADBSTOPPED == yes ]]; then
|
||||
#log -n "restarting mariadb/mysql... "
|
||||
echorun systemctl start mariadb
|
||||
MARIADBSTOPPED=no
|
||||
#log "done."
|
||||
fi
|
||||
return 0
|
||||
}
|
||||
|
||||
# log function
|
||||
@@ -139,7 +190,7 @@ function mariadb_maybe_start {
|
||||
# -l, -s: long, or short prefix (default: none). Last one is used.
|
||||
# -t: timestamp
|
||||
# -n: no newline
|
||||
function log {
|
||||
log() {
|
||||
local timestr="" prefix="" opt=y newline=y
|
||||
while [[ $opt = y ]]; do
|
||||
case $1 in
|
||||
@@ -159,24 +210,81 @@ function log {
|
||||
return 0
|
||||
}
|
||||
|
||||
# prints out and run a command.
|
||||
function echorun {
|
||||
# prints out and run (maybe) a command.
|
||||
echorun_maybe() {
|
||||
if [[ "$DRYRUN" == 'yes' ]]; then
|
||||
log "%s " "dry-run: " "$@"
|
||||
log "dry-run: %s" "$*"
|
||||
else
|
||||
log "%s " "$@"
|
||||
log "%s" "$*"
|
||||
"$@"
|
||||
fi
|
||||
}
|
||||
|
||||
function error_handler {
|
||||
yesno() {
|
||||
local reason answer
|
||||
|
||||
# shellcheck disable=SC2059
|
||||
printf -v reason "*** $1 [y/n/q] ? " "${@:2}"
|
||||
|
||||
while true; do
|
||||
if [[ $YESNO =~ ^(yes|no)$ ]]; then
|
||||
answer="$YESNO"
|
||||
# shellcheck disable=SC2059
|
||||
printf "$reason%s\n" "$answer"
|
||||
else
|
||||
read -p "$reason" -r answer
|
||||
fi
|
||||
case "${answer,,}" in
|
||||
y|yes) return 0
|
||||
;;
|
||||
n|no) return 1
|
||||
;;
|
||||
q|quit) printf "Aborting...\n"
|
||||
exit 1
|
||||
esac
|
||||
done
|
||||
}
|
||||
|
||||
# mariadb start/stop
|
||||
mariadb_maybe_stop() {
|
||||
[[ $MARIADBSTOPPED == yes ]] && return 0
|
||||
if systemctl is-active --quiet mysql; then
|
||||
if [[ $MARIADB == ask ]]; then
|
||||
if yesno "Stop MariaDB/MySQL"; then
|
||||
MARIADB=yes
|
||||
else
|
||||
MARIADB=no
|
||||
fi
|
||||
fi
|
||||
if [[ $MARIADB == no ]]; then
|
||||
log "Warning: MariaDB/MySQL is running, database corruption possible on DEST disk."
|
||||
return 0
|
||||
fi
|
||||
echorun_maybe systemctl stop mariadb
|
||||
# bug if script stops here
|
||||
MARIADBSTOPPED=yes
|
||||
else
|
||||
log "MariaDB/MySQL is inactive."
|
||||
fi
|
||||
}
|
||||
|
||||
mariadb_maybe_start() {
|
||||
if [[ $MARIADB == yes && $MARIADBSTOPPED == yes ]]; then
|
||||
#log -n "restarting mariadb/mysql... "
|
||||
echorun_maybe systemctl start mariadb
|
||||
MARIADBSTOPPED=no
|
||||
#log "done."
|
||||
fi
|
||||
}
|
||||
|
||||
error_handler() {
|
||||
local ERROR=$2
|
||||
log "FATAL: Error line $1, exit code $2. Aborting."
|
||||
exit "$ERROR"
|
||||
}
|
||||
trap 'error_handler $LINENO $?' ERR SIGHUP SIGINT SIGTERM
|
||||
|
||||
function exit_handler {
|
||||
exit_handler() {
|
||||
local mnt
|
||||
|
||||
# log "exit handler (at line $1)"
|
||||
@@ -184,15 +292,21 @@ function exit_handler {
|
||||
if [[ -n "$DSTMNT" ]] && mountpoint -q "$DSTMNT"; then
|
||||
for mnt in "$DSTMNT"/{dev,proc,sys}; do
|
||||
if mountpoint -q "$mnt"; then
|
||||
echorun umount "$mnt"
|
||||
# https://unix.stackexchange.com/questions/693346
|
||||
if ! echorun_maybe umount "$mnt"; then
|
||||
echorun_maybe umount --lazy "$mnt"
|
||||
fi
|
||||
fi
|
||||
done
|
||||
fi
|
||||
}
|
||||
|
||||
trap 'exit_handler $LINENO' EXIT
|
||||
|
||||
function check_block_device {
|
||||
# check_block_device - check a file system device
|
||||
# $1: device description
|
||||
# $2: more ('w' for writable)
|
||||
# $3: device
|
||||
check_block_device() {
|
||||
local devtype="$1"
|
||||
local mode="$2"
|
||||
local dev="$3"
|
||||
@@ -212,27 +326,37 @@ function check_block_device {
|
||||
return 0
|
||||
}
|
||||
|
||||
# check that /etc/fstab.XXX exists in SRCR
|
||||
function check_fstab {
|
||||
local fstab
|
||||
for f in "$SRCROOTLABEL" "$DSTROOTLABEL"; do
|
||||
fstab="${AUTOFS_DIR}/$SRCROOTLABEL/etc/fstab.$f"
|
||||
#log -n "======= check %s=%s " "$fstab" "$f"
|
||||
if [[ ! -f "$fstab" ]]; then
|
||||
log "Fatal: source or destination fstab (%s) not found" "$fstab"
|
||||
return 1
|
||||
fi
|
||||
done
|
||||
# check that /etc/fstab.DESTLABEL exists in SRC disk.
|
||||
check_fstab() {
|
||||
local etc="${AUTOFS_DIR}/$SRCROOTLABEL/etc"
|
||||
local fstab="fstab.$DSTROOTLABEL"
|
||||
#if [[ "$FSTAB" != no ]]; then
|
||||
if [[ ! -f "$etc/$fstab" ]]; then
|
||||
FSTAB=no
|
||||
log "Warning: No target fstab (%s) on SRC disk" "$etc/$fstab"
|
||||
else
|
||||
log "Info: Found target fstab (%s) in SRC root partition (%s)." "$fstab" "$etc"
|
||||
fi
|
||||
return 0
|
||||
}
|
||||
|
||||
function fix_fstab {
|
||||
fix_fstab() {
|
||||
local fstab="${AUTOFS_DIR}/$DSTROOTLABEL/etc/fstab"
|
||||
echorun ln -f "$fstab.$DSTROOTLABEL" "$fstab"
|
||||
|
||||
#[[ ! -f "$fstab" ]] && log "Warning: DST fstab will be wrong !" && FSTAB=no
|
||||
if [[ "$FSTAB" == ask ]]; then
|
||||
yesno "Link %s to %s" "$fstab.$DSTROOTLABEL" "$fstab" && FSTAB=yes || FSTAB=no
|
||||
fi
|
||||
if [[ "$FSTAB" == no ]]; then
|
||||
log "Warning: DST fstab will be *wrong*, boot is compromised"
|
||||
else
|
||||
echorun_maybe ln -f "$fstab.$DSTROOTLABEL" "$fstab"
|
||||
fi
|
||||
return 0
|
||||
}
|
||||
|
||||
# check if $1 is in array $2 ($2 is by reference)
|
||||
function in_array {
|
||||
in_array() {
|
||||
local elt=$1 i
|
||||
local -n arr=$2
|
||||
for ((i=0; i<${#arr[@]}; ++i)); do
|
||||
@@ -241,45 +365,25 @@ function in_array {
|
||||
return 1
|
||||
}
|
||||
|
||||
# get y/n/q user input
|
||||
function yesno {
|
||||
local input
|
||||
while true; do
|
||||
printf "%s " "$1"
|
||||
read -r input
|
||||
case "$input" in
|
||||
y|Y)
|
||||
return 0
|
||||
;;
|
||||
q|Q)
|
||||
log "aborting..."
|
||||
exit 0
|
||||
;;
|
||||
n|N)
|
||||
return 1
|
||||
;;
|
||||
*)
|
||||
printf "invalid answer. "
|
||||
esac
|
||||
done
|
||||
}
|
||||
|
||||
# source and destination devices, root partition
|
||||
SRC=""
|
||||
DST=""
|
||||
SRCROOT=""
|
||||
ROOTPARTNUM=""
|
||||
SRCROOTPARTNUM=""
|
||||
AUTOFS_DIR=/mnt
|
||||
|
||||
DRYRUN=no # dry-run
|
||||
GRUB=no # install grub
|
||||
COPY=no # do FS copies
|
||||
MARIADB=no # stop/start mysql/mariadb
|
||||
FSTAB=ask # adjust fstab
|
||||
GRUB=ask # install grub
|
||||
COPY=ask # do FS copies
|
||||
MARIADB=ask # stop/start mysql/mariadb
|
||||
MARIADBSTOPPED=no # mysql stopped ?
|
||||
YESNO= # default answer
|
||||
ROOTCOPIED=no # was root partition copied ?
|
||||
|
||||
# short and long options
|
||||
SOPTS="a:c:dghmr:"
|
||||
LOPTS="autofs:,copy:,dry-run,grub,help,man,mariadb,root:"
|
||||
SOPTS="a:c:df:g:hmM:nr:y"
|
||||
LOPTS="autofs:,copy:,dry-run,fstab:,grub:,help,man,mariadb:,no,root:,yes"
|
||||
|
||||
if ! TMP=$(getopt -o "$SOPTS" -l "$LOPTS" -n "$CMD" -- "$@"); then
|
||||
log "Use '$CMD --help' or '$CMD --man' for help."
|
||||
@@ -296,7 +400,7 @@ while true; do
|
||||
shift
|
||||
;;
|
||||
'-c'|'--copy')
|
||||
case "$2" in
|
||||
case "${2,,}" in
|
||||
"no") COPY=no;;
|
||||
"yes") COPY=yes;;
|
||||
"ask") COPY=ask;;
|
||||
@@ -309,8 +413,27 @@ while true; do
|
||||
'-d'|'--dry-run')
|
||||
DRYRUN=yes
|
||||
;;
|
||||
'-f'|'--fstab')
|
||||
case "${2,,}" in
|
||||
"no") FSTAB=no;;
|
||||
"yes") FSTAB=yes;;
|
||||
"ask") FSTAB=ask;;
|
||||
*) log "invalid '$2' --fstab flag"
|
||||
usage
|
||||
exit 1
|
||||
esac
|
||||
shift
|
||||
;;
|
||||
'-g'|'--grub')
|
||||
GRUB=yes
|
||||
case "${2,,}" in
|
||||
"no") GRUB=no;;
|
||||
"yes") GRUB=yes;;
|
||||
"ask") GRUB=ask;;
|
||||
*) log "invalid '$2' --grub flag"
|
||||
usage
|
||||
exit 1
|
||||
esac
|
||||
shift
|
||||
;;
|
||||
'-h'|'--help')
|
||||
usage
|
||||
@@ -320,13 +443,24 @@ while true; do
|
||||
man
|
||||
exit 0
|
||||
;;
|
||||
'--mariadb')
|
||||
MARIADB=yes
|
||||
'-n'|'--no')
|
||||
YESNO=no
|
||||
;;
|
||||
'-M'|'--mariadb')
|
||||
case "${2,,}" in
|
||||
"no") MARIADB=no;;
|
||||
"yes") MARIADB=yes;;
|
||||
"ask") MARIADB=ask;;
|
||||
*) log "invalid '$2' --mariadb flag"
|
||||
usage
|
||||
exit 1
|
||||
esac
|
||||
shift
|
||||
;;
|
||||
'-r'|'--root')
|
||||
ROOTPARTNUM="$2"
|
||||
if ! [[ "$ROOTPARTNUM" =~ ^[[:digit:]]+$ ]]; then
|
||||
log "$CMD: $ROOTPARTNUM must be a partition number."
|
||||
SRCROOTPARTNUM="$2"
|
||||
if ! [[ "$SRCROOTPARTNUM" =~ ^[[:digit:]]+$ ]]; then
|
||||
log "$CMD: $SRCROOTPARTNUM must be a partition number."
|
||||
exit 1
|
||||
fi
|
||||
shift
|
||||
@@ -335,6 +469,9 @@ while true; do
|
||||
shift
|
||||
break
|
||||
;;
|
||||
'-y'|'--yes')
|
||||
YESNO=yes
|
||||
;;
|
||||
*)
|
||||
usage
|
||||
log 'Internal error!'
|
||||
@@ -344,29 +481,40 @@ while true; do
|
||||
shift
|
||||
done
|
||||
|
||||
# check if current user is root
|
||||
if (( EUID != 0 )); then
|
||||
log "This script must be run as root... Aborting."
|
||||
exit 1
|
||||
fi
|
||||
|
||||
case "$#" in
|
||||
1)
|
||||
if [[ -n "$ROOTPARTNUM" ]]; then
|
||||
if [[ -n "$SRCROOTPARTNUM" ]]; then
|
||||
log "$CMD: cannot have --root option for live system."
|
||||
log "Use '$CMD --help' or '$CMD --man' for help."
|
||||
exit 1
|
||||
fi
|
||||
# guess root partition disk name
|
||||
SRCROOT=$(findmnt -no SOURCE -M /)
|
||||
ROOTPARTNUM=${SRCROOT: -1}
|
||||
SRCROOTPARTNUM=${SRCROOT: -1}
|
||||
SRC="/dev/"$(lsblk -no pkname "$SRCROOT")
|
||||
DST="/dev/$1"
|
||||
;;
|
||||
2)
|
||||
if [[ -z "$ROOTPARTNUM" ]]; then
|
||||
if [[ -z "$SRCROOTPARTNUM" ]]; then
|
||||
log "$CMD: missing --root option for non live system."
|
||||
log "Use '$CMD --help' or '$CMD --man' for help."
|
||||
exit 1
|
||||
fi
|
||||
SRC="/dev/$1"
|
||||
SRCROOT="$SRC$ROOTPARTNUM"
|
||||
SRCROOT="$SRC$SRCROOTPARTNUM"
|
||||
DST="/dev/$2"
|
||||
;;
|
||||
0)
|
||||
log "Missing destination disk."
|
||||
usage
|
||||
exit 1
|
||||
;;
|
||||
*)
|
||||
usage
|
||||
exit 1
|
||||
@@ -374,7 +522,7 @@ esac
|
||||
|
||||
# check SRC and DST are different, find out their characteristics
|
||||
if [[ "$SRC" = "$DST" ]]; then
|
||||
log "%s: Fatal: destination disk (%s) cannot be source.\n" "$CMD" "$SRC"
|
||||
log "Fatal: destination and source disk are identical (%s)" "$SRC"
|
||||
log "Use '%s --help' or '%s --man' for help." "$CMD" "$CMD"
|
||||
exit 1
|
||||
fi
|
||||
@@ -383,8 +531,8 @@ check_block_device "destination disk" w "$DST"
|
||||
check_block_device "source root partition" r "$SRCROOT"
|
||||
|
||||
SRCROOTLABEL=$(lsblk -no label "$SRCROOT")
|
||||
SRCCHAR=${SRCROOTLABEL: -1}
|
||||
ROOTLABEL=${SRCROOTLABEL:0:-1}
|
||||
# strip out last character
|
||||
ROOTLABEL=${SRCROOTLABEL%%?}
|
||||
|
||||
# find out all partitions labels on SRC disk...
|
||||
# shellcheck disable=SC2207
|
||||
@@ -394,9 +542,9 @@ declare -a LABELS=(${SRCLABELS[@]%?})
|
||||
|
||||
# ... and corresponding partition device and fstype
|
||||
declare -a SRCDEVS SRCFS SRC_VALID_FS
|
||||
for ((i=0; i<${#LABELS[@]}; ++i)); do
|
||||
TMP="${LABELS[$i]}$SRCCHAR"
|
||||
for ((i=0; i<${#SRCLABELS[@]}; ++i)); do
|
||||
TMP="${SRCLABELS[$i]}"
|
||||
#log "TMP=%s" "$TMP"
|
||||
TMPDEV=$(findfs LABEL="$TMP")
|
||||
TMPFS=$(lsblk -no fstype "$TMPDEV")
|
||||
log "found LABEL=$TMP DEV=$TMPDEV FSTYPE=$TMPFS"
|
||||
@@ -407,28 +555,33 @@ for ((i=0; i<${#LABELS[@]}; ++i)); do
|
||||
unset TMP TMPDEV TMPFS
|
||||
done
|
||||
|
||||
DSTROOT="$DST$ROOTPARTNUM"
|
||||
check_block_device "destination root partition" w "$DSTROOT"
|
||||
DSTROOTLABEL=$(lsblk -no label "$DSTROOT")
|
||||
DSTCHAR=${DSTROOTLABEL: -1}
|
||||
# find out DST root partition
|
||||
# shellcheck disable=SC2207
|
||||
declare -a TMP_DSTLABELS=($(lsblk -lno LABEL "$DST"))
|
||||
|
||||
# check DSTROOTLABEL is compatible with ROOTLABEL
|
||||
if [[ "$DSTROOTLABEL" != "$ROOTLABEL$DSTCHAR" ]]; then
|
||||
log "%s: Fatal: %s != %s%s." "$CMD" "$DSTROOTLABEL" "$ROOTLABEL" "$DSTCHAR"
|
||||
exit 1
|
||||
fi
|
||||
for maybe_root in "${TMP_DSTLABELS[@]}"; do
|
||||
log "rootlabel=%s maybe=%s" "$ROOTLABEL" "$maybe_root"
|
||||
if [[ $maybe_root =~ ^${ROOTLABEL}.$ ]]; then
|
||||
log "Found destination root label: $maybe_root"
|
||||
DSTROOTLABEL=$maybe_root
|
||||
DSTCHAR=${DSTROOTLABEL: -1}
|
||||
DSTROOT=$(findfs LABEL="$DSTROOTLABEL")
|
||||
check_block_device "destination root partition" w "$DSTROOT"
|
||||
break
|
||||
fi
|
||||
done
|
||||
|
||||
declare -a DSTLABELS DSTDEVS DSTFS DST_VALID_FS
|
||||
# Do the same for corresponding DST partitions labels, device, and fstype
|
||||
for ((i=0; i<${#LABELS[@]}; ++i)); do
|
||||
TMP="${LABELS[$i]}$DSTCHAR"
|
||||
log -n "Looking for [%s] label... " "$TMP"
|
||||
log -n "Looking for [%s] label : " "$TMP"
|
||||
if ! TMPDEV=$(findfs LABEL="$TMP"); then
|
||||
log "not found."
|
||||
exit 1
|
||||
fi
|
||||
TMPDISK=${TMPDEV%?}
|
||||
log -n "DEV=%s... DISK=%s..." "$TMPDEV" "$TMPDISK"
|
||||
log -n "DEV=%s DISK=%s " "$TMPDEV" "$TMPDISK"
|
||||
if [[ "$TMPDISK" != "$DST" ]]; then
|
||||
log "wrong disk (%s != %s)" "$TMPDISK" "$DST"
|
||||
exit 1
|
||||
@@ -443,56 +596,80 @@ for ((i=0; i<${#LABELS[@]}; ++i)); do
|
||||
unset TMP TMPDEV TMPFS
|
||||
done
|
||||
|
||||
for ((i=0; i<${#LABELS[@]}; ++i)); do
|
||||
log -n "%s %s " "${SRCDEVS[$i]}" "${DSTDEVS[$i]}"
|
||||
log -n "%s %s " "${SRCLABELS[$i]}" "${DSTLABELS[$i]}"
|
||||
log -n "%s %s " "${SRCFS[$i]}" "${DSTFS[$i]}"
|
||||
log -n "%s %s " "${SRC_VALID_FS[$i]}" "${DST_VALID_FS[$i]}"
|
||||
[[ "$DSTROOTLABEL" == "${DSTLABELS[$i]}" ]] && log "*"
|
||||
echo
|
||||
done | column -N DEV1,DEV2,LABEL1,LABEL2,FS1,FS2,SVALID\?,DVALID\?,ROOT -t -o " | "
|
||||
{
|
||||
printf "DEV1 DEV2 LABEL1 LABEL2 FS1 FS2 SVALID\? DVALID\? ROOT\n"
|
||||
for ((i=0; i<${#LABELS[@]}; ++i)); do
|
||||
log -n "%s %s " "${SRCDEVS[$i]}" "${DSTDEVS[$i]}"
|
||||
log -n "%s %s " "${SRCLABELS[$i]}" "${DSTLABELS[$i]}"
|
||||
log -n "%s %s " "${SRCFS[$i]}" "${DSTFS[$i]}"
|
||||
log -n "%s %s " "${SRC_VALID_FS[$i]}" "${DST_VALID_FS[$i]}"
|
||||
[[ "$DSTROOTLABEL" == "${DSTLABELS[$i]}" ]] && log "*"
|
||||
echo
|
||||
done
|
||||
} | column -t
|
||||
|
||||
check_fstab || exit 1
|
||||
|
||||
RSYNCOPTS="-axH --delete --delete-excluded"
|
||||
FILTER=--filter="dir-merge .rsync-disk-copy"
|
||||
declare -a RSYNCOPTS=(-axH "$FILTER" --delete --delete-excluded)
|
||||
# copy loop
|
||||
for ((i=0; i<${#LABELS[@]}; ++i)); do
|
||||
if [[ "${SRC_VALID_FS[$i]}" != y ]] || [[ "${DST_VALID_FS[$i]}" != y ]]; then
|
||||
log "skipping label %s" "${LABELS[$i]}"
|
||||
continue
|
||||
fi
|
||||
SRCPART="${AUTOFS_DIR}/${SRCLABELS[$i]}/"
|
||||
SRCPART="$AUTOFS_DIR/${SRCLABELS[$i]}/"
|
||||
DSTPART="$AUTOFS_DIR/${DSTLABELS[$i]}"
|
||||
|
||||
#log -n "%s -> %s : " "$SRCPART" "$DSTPART"
|
||||
#log "\t%s %s %s %s %s" rsync "${RSYNCOPTS}" "$FILTER" "$SRCPART" "$DSTPART"
|
||||
copy="$COPY"
|
||||
if [[ "$COPY" == 'ask' ]]; then
|
||||
yesno "Copy $SRCPART to $DSTPART ? [y/n/q]" && copy=yes || copy=no
|
||||
yesno "Copy $SRCPART to $DSTPART" && copy=yes || copy=no
|
||||
fi
|
||||
if [[ "$copy" == yes ]]; then
|
||||
mariadb_maybe_stop
|
||||
status=0
|
||||
# shellcheck disable=SC2086
|
||||
echorun rsync "$FILTER" ${RSYNCOPTS} "$SRCPART" "$DSTPART"
|
||||
echorun_maybe rsync "${RSYNCOPTS[@]}" "$SRCPART" "$DSTPART" || status=$?
|
||||
log -s "rsync status=%s\n" "$status"
|
||||
if (( status != 24 && status != 0 )); then
|
||||
log -s "rsync error %d" "$status"
|
||||
exit 1
|
||||
fi
|
||||
|
||||
if [[ "$DSTROOTLABEL" == "${DSTLABELS[$i]}" ]]; then
|
||||
ROOTCOPIED=yes
|
||||
fix_fstab
|
||||
fi
|
||||
fi
|
||||
#log ""
|
||||
done
|
||||
mariadb_maybe_start
|
||||
|
||||
# grub install
|
||||
if [[ "$GRUB" == yes ]]; then
|
||||
if [[ $GRUB == ask ]]; then
|
||||
if ! yesno "install grub on %s (root label: %s)" "$DST" "$DSTROOTLABEL"; then
|
||||
GRUB=no
|
||||
fi
|
||||
fi
|
||||
if [[ $GRUB == no ]]; then
|
||||
if [[ $ROOTCOPIED == yes ]]; then
|
||||
log "Warning: root filesystem changed, and skipping grub install on %s, boot will probably fail." "$DST"
|
||||
else
|
||||
log "Warning: Skipping grub install on %s." "$DST"
|
||||
fi
|
||||
else
|
||||
log "installing grub on $DST..."
|
||||
|
||||
DSTMNT="$AUTOFS_DIR/$DSTROOTLABEL"
|
||||
# mount virtual devices
|
||||
echorun mount -o bind /sys "$DSTMNT/sys"
|
||||
echorun mount -o bind /proc "$DSTMNT/proc"
|
||||
echorun mount -o bind /dev "$DSTMNT/dev"
|
||||
echorun_maybe mount -o bind /sys "$DSTMNT/sys"
|
||||
echorun_maybe mount -o bind /proc "$DSTMNT/proc"
|
||||
echorun_maybe mount -o bind /dev "$DSTMNT/dev"
|
||||
|
||||
echorun chroot "$DSTMNT" update-grub
|
||||
echorun chroot "$DSTMNT" grub-install "$DST"
|
||||
echorun_maybe chroot "$DSTMNT" update-grub
|
||||
echorun_maybe chroot "$DSTMNT" grub-install "$DST"
|
||||
fi
|
||||
|
||||
exit 0
|
||||
|
||||
@@ -1,73 +1,89 @@
|
||||
#!/bin/bash
|
||||
#!/usr/bin/env bash
|
||||
#
|
||||
# sync-conf-example.sh - a "sync.sh" configuration file example.
|
||||
#
|
||||
# (C) Bruno Raoult ("br"), 2007-2021
|
||||
# Licensed under the Mozilla Public License (MPL) version 2.0.
|
||||
# (C) Bruno Raoult ("br"), 2007-2022
|
||||
# Licensed under the GNU General Public License v3.0 or later.
|
||||
# Some rights reserved. See COPYING.
|
||||
#
|
||||
# You should have received a copy of the Mozilla Public License along with this
|
||||
# program. If not, see <https://www.mozilla.org/en-US/MPL>
|
||||
# You should have received a copy of the GNU General Public License along with this
|
||||
# program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
#
|
||||
# SPDX-License-Identifier: MPL-2.0 <https://spdx.org/licenses/MPL-2.0.html>
|
||||
# SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
#
|
||||
# USAGE:
|
||||
# sync.sh -rfu /path/to/sync-conf-example.sh
|
||||
|
||||
# full source path
|
||||
SOURCEDIR=/example-srcdir
|
||||
# server name. Could also be user@hostname
|
||||
SERVER=backuphost
|
||||
# full destination path on target machine (or relative to home directory)
|
||||
DESTDIR=/mnt/array3+4/example-destdir
|
||||
# below, default values are just below the lines starting with '######'.
|
||||
# The only mandatory ones are SOURCEDIR, SERVER, and DESTDIR.
|
||||
|
||||
# backups to keep
|
||||
NYEARS=2
|
||||
NMONTHS=12
|
||||
NWEEKS=4
|
||||
NDAYS=7
|
||||
###### source directory full path, destination server and path.
|
||||
###### SERVER could user@host, or "local" if local machine
|
||||
# SOURCEDIR=""
|
||||
# SERVER=""
|
||||
# DESTDIR=""
|
||||
export SOURCEDIR=/example-srcdir
|
||||
export SERVER=root@backuphost
|
||||
export DESTDIR=/mnt/nas1/example-destdir
|
||||
|
||||
# FILTER can be used to filter directories to include/exclude. See rsync(1) for
|
||||
# details.
|
||||
FILTER=--filter="dir-merge .rsync-filter-br"
|
||||
###### backups to keep
|
||||
# NYEARS=3
|
||||
# NMONTHS=12
|
||||
# NWEEKS=6
|
||||
# NDAYS=10
|
||||
|
||||
# other rsync options
|
||||
RSYNCOPTS=""
|
||||
###### other rsync options. It must be an array.
|
||||
# RSYNCOPTS=()
|
||||
FILTERNAME=".rsync-filter-system"
|
||||
FILTER=--filter="dir-merge ${FILTERNAME}"
|
||||
RSYNCOPTS+=("$FILTER")
|
||||
|
||||
# functions run just before and after the rsync. Could be useful to create
|
||||
# database dumps, etc...
|
||||
# Warning: avoid using "cd", or be sure to come back to current dir
|
||||
# before returning from functions
|
||||
###### functions run immediately before and after the rsync. Can be used
|
||||
###### to create database dumps, etc...
|
||||
###### Warning: avoid using "cd", or be sure to come back to current dir
|
||||
###### before returning from functions
|
||||
# beforesync() { log "calling default beforesync..."; }
|
||||
# aftersync() { log "calling default aftersync..."; }
|
||||
|
||||
# example below will create a dump
|
||||
function beforesync() {
|
||||
# next line may be removed if you do something. bash does not like empty
|
||||
# functions
|
||||
:
|
||||
# example below will create a mysql/mariadb dump. At same time we create
|
||||
# a FILTERNAME file in database data directory to exclude databases directories
|
||||
# themselves.
|
||||
beforesync() {
|
||||
local -a databases
|
||||
local datadir
|
||||
|
||||
# log is a sync.sh function.
|
||||
log -s -t "calling user beforesync: mysql databases dumps..."
|
||||
|
||||
datadir=$(mysql -sN -u root -e 'select @@datadir')
|
||||
# log "mysql datadir=${datadir}"
|
||||
if ! datadir="$(mysql -sN -u root -e 'select @@datadir')"; then
|
||||
log -s "cannot get maria databases directory"
|
||||
exit 1
|
||||
fi
|
||||
rm -f "$datadir/$FILTERNAME"
|
||||
databases=($(mysql -sN -u root -e "SHOW DATABASES;"))
|
||||
# shellcheck disable=2207
|
||||
if ! databases=( $(mysql -sN -u root -e "SHOW DATABASES;") ); then
|
||||
log -s "cannot get maria databases list"
|
||||
exit 1
|
||||
fi
|
||||
|
||||
for db in "${databases[@]}"
|
||||
do
|
||||
# exclude database directory itself
|
||||
echo "- /${db}/*" >> "$datadir/$FILTERNAME"
|
||||
for db in "${databases[@]}"; do
|
||||
# do not backup database contents itself
|
||||
printf -- "- /%s/*\n" "$db" >> "$datadir/$FILTERNAME"
|
||||
|
||||
log -n "${db}... "
|
||||
log -n "$db... "
|
||||
case "$db" in
|
||||
information_schema|performance_schema)
|
||||
log "skipped."
|
||||
;;
|
||||
*)
|
||||
log -n "dumping to ${datadir}${db}.sql... "
|
||||
mysqldump --user=root --routines "$db" > "$datadir/$db.sql"
|
||||
# log -n "compressing... "
|
||||
gzip "$datadir/$db.sql"
|
||||
log -n "dumping to $datadir$db.sql... "
|
||||
if ! mysqldump --user=root --single-transaction --routines \
|
||||
"$db" > "$datadir/$db.sql"; then
|
||||
log -s "mysqldump error"
|
||||
exit 1
|
||||
fi
|
||||
log -n "compressing... "
|
||||
gzip -f "$datadir/$db.sql"
|
||||
log "done."
|
||||
esac
|
||||
done
|
||||
@@ -75,10 +91,12 @@ function beforesync() {
|
||||
# cat ${datadir}/${FILTERNAME}
|
||||
}
|
||||
|
||||
function aftersync() {
|
||||
# next line may be removed if you do something. bash does not like empty
|
||||
# functions
|
||||
:
|
||||
aftersync() {
|
||||
# we may remove the dump here...
|
||||
log -s -t "calling user aftersync"
|
||||
}
|
||||
|
||||
# For Emacs, shell-script-mode:
|
||||
# Local Variables:
|
||||
# mode: shell-script
|
||||
# End:
|
||||
|
||||
727
bash/sync.sh
727
bash/sync.sh
@@ -1,63 +1,81 @@
|
||||
#!/bin/bash
|
||||
#!/usr/bin/env bash
|
||||
#
|
||||
# sync.sh - a backup utility using ssh/rsync facilities.
|
||||
#
|
||||
# (C) Bruno Raoult ("br"), 2007-2021
|
||||
# Licensed under the Mozilla Public License (MPL) version 2.0.
|
||||
# (C) Bruno Raoult ("br"), 2007-2022
|
||||
# Licensed under the GNU General Public License v3.0 or later.
|
||||
# Some rights reserved. See COPYING.
|
||||
#
|
||||
# You should have received a copy of the Mozilla Public License along with this
|
||||
# program. If not, see <https://www.mozilla.org/en-US/MPL>
|
||||
# You should have received a copy of the GNU General Public License along with this
|
||||
# program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
#
|
||||
# SPDX-License-Identifier: MPL-2.0 <https://spdx.org/licenses/MPL-2.0.html>
|
||||
# SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
#
|
||||
#%MAN_BEGIN%
|
||||
# NAME
|
||||
# sync.sh - a backup utility using ssh/rsync facilities.
|
||||
#
|
||||
# SYNOPSIS
|
||||
# sync.sh [-ymwdznt] CONFIG
|
||||
# sync.sh [-a PERIOD][-DflmnruvzZ] CONFIG
|
||||
#
|
||||
# DESCRIPTION
|
||||
# Performs a backup to a local or remote destination, keeping different
|
||||
# Perform a backup to a local or remote destination, keeping different
|
||||
# versions (daily, weekly, monthly, yearly). All options can be set in
|
||||
# CONFIG file, which is mandatory.
|
||||
# The synchronization is make with rsync(1), and only files changed or
|
||||
# modified are actually copied; files which are identical with previous
|
||||
# backup are hard-linked to previous one.
|
||||
#
|
||||
# OPTIONS
|
||||
# -y, -m, -w, -d
|
||||
# yearly/monthly/weekly/daily backup. If none of these options is set,
|
||||
# and none of the corresponding variables set to "y" in configuration
|
||||
# -a PERIOD
|
||||
# Indicate which backup(s) should be done. PERIOD is a string composed
|
||||
# of one or more of 'y', 'm', 'w', and 'd', indicating respectively
|
||||
# yearly, monthly, weekly and daily backups.
|
||||
# Multiple -a may appear. For example, if we wish to perform a daily,
|
||||
# monthly, and yearly backup, we can use syntax like :
|
||||
# -a m -a y -a d
|
||||
# -adm -ay
|
||||
# -a ymd
|
||||
# If this option is not used, and none of the equivalent variables
|
||||
# (YEARLY, MONTHY, WEEKLY, DAILY) is set to "y" in configuration
|
||||
# file, the script will determine itself what should be done,
|
||||
# depending on the current day or date: daily backup every day,
|
||||
# weekly every sunday, monthly every first day of month, and yearly
|
||||
# every Jan 1st.
|
||||
# -n
|
||||
# do not send mail report (which is the default if MAILTO environment
|
||||
# is set). Practically, this option only unsets MAILTO.
|
||||
# -f
|
||||
# filter some rsync output, such as hard and soft links, dirs, etc.
|
||||
# -r
|
||||
# resume an interrupted transfer (rsync --partial option). It should
|
||||
# be safe to use this option, as it has no effect in usual case.
|
||||
# -z
|
||||
# enable rsync compression. Should be used when the transport is more
|
||||
# expensive than CPU (typically slow connections).
|
||||
# -u
|
||||
# will use numeric IDs (uid and gid) instead of usernames/groupnames.
|
||||
# This could be preferable in case of backup, to avoid any issue when
|
||||
# getting back the file (for instance via a mount).
|
||||
# -v
|
||||
# adds sub-tasks information, with timestamps.
|
||||
# -D
|
||||
# by default, this script will re-route all outputs (stdout and stderr)
|
||||
# By default, this script re-routes all outputs (stdout and stderr)
|
||||
# to a temporary file after basic initialization (mainly options
|
||||
# checks and configuration file evaluation), so that we can format
|
||||
# the output before displaying or mailing it.
|
||||
# This option disables this redirection. It is useful (together with
|
||||
# bash's -x option) when some errors are difficult to track.
|
||||
# -f
|
||||
# Filter some rsync output, such as hard and soft links, dirs, etc.
|
||||
# -l
|
||||
# Keep log file (usually /tmp/sync-log-PID).
|
||||
# -m
|
||||
# Display a "man-like" description and exit.
|
||||
# -n
|
||||
# Do not send mail report (which is the default if MAILTO environment
|
||||
# is set). Practically, this option only unsets MAILTO.
|
||||
# -r
|
||||
# Resume an interrupted transfer (rsync --partial option). It should
|
||||
# be safe to use this option, as it has no effect in usual case.
|
||||
# -u
|
||||
# Use numeric IDs (UID and GID) instead of usernames/groupnames. This
|
||||
# could be preferable in case of backup, to avoid any issue when
|
||||
# getting back the file (for instance via a mount).
|
||||
# -v
|
||||
# Add sub-tasks information, with timestamps. This option is currently
|
||||
# not implemented.
|
||||
# -z
|
||||
# Enable rsync compression. Should be used when the transport is more
|
||||
# expensive than CPU (typically slow connections).
|
||||
# -Z
|
||||
# By default, if gzip utility is available, the email log attachment
|
||||
# is compressed. This option will prevent any compression.
|
||||
#
|
||||
# GENERAL
|
||||
# Ensure your ssh setup is correct: You must be able to ssh the target
|
||||
# machine without password.
|
||||
# You should avoid modifying variables in this script.
|
||||
# Instead, use the configuration file, whenever possible.
|
||||
#
|
||||
@@ -67,9 +85,31 @@
|
||||
# By default, the output is displayed (or mailed) when the script exits.
|
||||
# The -D option allows to get real-time output.
|
||||
#
|
||||
# PREREQUISITES
|
||||
# The following must be installed, configured, and within your PATH :
|
||||
# ssh
|
||||
# Ensure your ssh setup is correct: You must be able to ssh the target
|
||||
# machine without password.
|
||||
# sendmail/postfix (or any MTA providing the sendmail command)
|
||||
# Your MTA must be properly configured to send emails. For example
|
||||
# you should receive an email with the following command :
|
||||
# echo "Subject: sendmail test" | sendmail -v youremail@example.com
|
||||
#
|
||||
# Additionnaly, you will also need the "base64" and "gzip" utilities.
|
||||
#
|
||||
# NOTE: If you run this script via cron(8), please remember that PATH is
|
||||
# different. For example, on some systems, cron's default PATH is
|
||||
# "/usr/bin:/bin". Should sendmail binary be in /usr/sbin on your system,
|
||||
# you will have to change PATH in your crontab.
|
||||
#
|
||||
# CONFIGURATION FILE
|
||||
# TODO: Write documentation. See example (sync-conf-example.sh).
|
||||
#
|
||||
# AUTHOR
|
||||
# Bruno Raoult.
|
||||
#
|
||||
#%MAN_END%
|
||||
#
|
||||
# BUGS
|
||||
# Many.
|
||||
# This was written for a "terastation" NAS server, which is a kind of
|
||||
@@ -87,7 +127,6 @@
|
||||
# - replace y/n values with empty/not-empty. A step to avoid config file
|
||||
# - set default compress value on local/non-local. Step to avoid config
|
||||
# file
|
||||
# - replace y/m/w/d with numerical values ? Step to avoid config file
|
||||
# - manage more errors (instead of relying on traps)
|
||||
# - the deletion of oldest backup directories takes ages. This could be
|
||||
# avoided (for example we could move them to a temp dir and remove it
|
||||
@@ -100,23 +139,21 @@
|
||||
# destination from the previous backup, and perform a usual backup
|
||||
# on this new directory. This should be easy, but my guess is that
|
||||
# it could be slower (1 first pass on server is added before the
|
||||
# normal backup.
|
||||
# - replace getopts(1) to have a better options parsing. GNU's getopt(1)
|
||||
# could be an option, but not available everywhere (for example on
|
||||
# MacOS). Likely impossible to keep this script portable.
|
||||
#
|
||||
# AUTHOR
|
||||
# Bruno Raoult.
|
||||
#
|
||||
# normal backup).
|
||||
# - replace bash's getopts for a better options parsing tool, such as
|
||||
# GNU's getopt(1) could be an option, but not available everywhere
|
||||
# (for example on MacOS). Likely impossible to keep this script portable.
|
||||
#
|
||||
|
||||
######################### options default values.
|
||||
# These ones can be set by command-line.
|
||||
# They can also be overwritten in configuration file (prefered option).
|
||||
YEARLY=n # (-y) yearly backup (y/n)
|
||||
MONTHLY=n # (-m) monthly backup (y/n)
|
||||
WEEKLY=n # (-w) weekly backup (y/n)
|
||||
DAILY=n # (-d) daily backup (y/n)
|
||||
###############################################################################
|
||||
######################### options default values
|
||||
###############################################################################
|
||||
# These ones can be set by command-line and in configuration file.
|
||||
# priority is given to configuration file.
|
||||
YEARLY=n # (-ay) yearly backup (y/n)
|
||||
MONTHLY=n # (-am) monthly backup (y/n)
|
||||
WEEKLY=n # (-aw) weekly backup (y/n)
|
||||
DAILY=n # (-ad) daily backup (y/n)
|
||||
FILTERLNK=n # (-f) rsync logs filter: links, dirs... (y/n)
|
||||
RESUME=n # (-r) resume backup (y/n)
|
||||
COMPRESS="" # (-z) rsync compression
|
||||
@@ -124,129 +161,174 @@ NUMID="" # (-u) use numeric IDs
|
||||
#VERBOSE=0 # TODO: (-v) logs level (0/1)
|
||||
DEBUG=n # (-D) debug: no I/O redirect (y/n)
|
||||
MAILTO=${MAILTO:-""} # (-n) mail recipient. -n sets it to ""
|
||||
ZIPMAIL="gzip" # (-Z) zip mail attachment
|
||||
KEEPLOGFILE=n # (-l) keep log file
|
||||
|
||||
# options not available on command line, but settable in config file.
|
||||
# options only settable in config file.
|
||||
NYEARS=3 # keep # years (int)
|
||||
NMONTHS=12 # keep # months (int)
|
||||
NWEEKS=4 # keep # weeks (int)
|
||||
NDAYS=7 # keep # days (int)
|
||||
RSYNCOPTS="" # other rsync options
|
||||
SOURCEDIR="." # source dir
|
||||
DESTDIR="." # destination dir
|
||||
NWEEKS=6 # keep # weeks (int)
|
||||
NDAYS=10 # keep # days (int)
|
||||
declare -a RSYNCOPTS=() # other rsync options
|
||||
SOURCEDIR="" # source dir
|
||||
SERVER="" # backup server
|
||||
DESTDIR="" # destination dir
|
||||
MODIFYWINDOW=1 # accuracy for mod time comparison
|
||||
|
||||
# these 2 functions can be overwritten in data file, to run specific actions
|
||||
# just before and after the actual sync
|
||||
function beforesync () {
|
||||
log calling default beforesync...
|
||||
beforesync() {
|
||||
log "calling default beforesync..."
|
||||
}
|
||||
function aftersync () {
|
||||
log calling default aftersync...
|
||||
aftersync() {
|
||||
log "calling default aftersync..."
|
||||
}
|
||||
|
||||
# internal variables, cannot (and *should not*) be changed unless you
|
||||
# understand exactly what you do.
|
||||
# Some variables were moved into the code (example: in the log() function),
|
||||
# for practical reasons, the absence of associative arrays being one of them.
|
||||
SCRIPT="$0" # full path to script
|
||||
CMDNAME=${0##*/} # script name
|
||||
PID=$$ # current pricess PID
|
||||
LOCKED=n # indicates if we created lock file.
|
||||
SUBJECT="${0##*/} ${*##*/}" # mail subject (removes paths)
|
||||
ERROR=0 # set by error_handler when called
|
||||
STARTTIME=$(date +%s) # time since epoch in seconds
|
||||
HOSTNAME="$(hostname)"
|
||||
declare -A ERROR_STR=( # error strings
|
||||
[0]="ok"
|
||||
[1]="error"
|
||||
[2]="missing command"
|
||||
[3]="source directory error"
|
||||
[4]="could not create lock file"
|
||||
[5]="could not rotate backup directories"
|
||||
[6]="partial backup detected"
|
||||
[7]="rsync error"
|
||||
[8]="invalid command line"
|
||||
[9]="missing configuration file"
|
||||
[10]="missing destination directory"
|
||||
[11]="cannot acquire lock"
|
||||
[12]="cannot determine PID of locked directory"
|
||||
[13]="error in rotation"
|
||||
[14]="could not set modification time on target"
|
||||
[15]="error on non-daily tree copy"
|
||||
)
|
||||
|
||||
usage () {
|
||||
echo "usage: ${0##*/} [-ymwdnfrzuD]" config-file
|
||||
exit 1
|
||||
###############################################################################
|
||||
######################### helper functions
|
||||
###############################################################################
|
||||
man() {
|
||||
sed -n '/^#%MAN_BEGIN%/,/^#%MAN_END%$/{//!s/^#[ ]\{0,1\}//p}' "$SCRIPT" | more
|
||||
}
|
||||
|
||||
# command-line options parsing.
|
||||
OPTIND=1
|
||||
while getopts ymwdfrnzuD todo
|
||||
do
|
||||
case "${todo}" in
|
||||
y) YEARLY=y;;
|
||||
m) MONTHLY=y;;
|
||||
w) WEEKLY=y;;
|
||||
d) DAILY=y;;
|
||||
f) FILTERLNK=y;;
|
||||
r) RESUME=y;;
|
||||
n) MAILTO="";;
|
||||
z) COMPRESS=-y;; # rsync compression. Depends on net/CPU perfs
|
||||
u) NUMID="--numeric-ids";;
|
||||
D) DEBUG=y;;
|
||||
*) usage;;
|
||||
esac
|
||||
done
|
||||
# Now check remaining argument (configuration file), which should be unique,
|
||||
# and read the file.
|
||||
shift $((OPTIND - 1))
|
||||
(( $# != 1 )) && usage
|
||||
CONFIG="$1"
|
||||
if [[ ! -f "$CONFIG" ]]; then
|
||||
echo "No $CONFIG file."
|
||||
usage
|
||||
fi
|
||||
source "$CONFIG"
|
||||
|
||||
# we set backups to be done if none has been set yet (i.e. none is "y").
|
||||
# Note: we use the form +%-d to avoid zero padding.
|
||||
# for bash, starting with 0 => octal => 08 is invalid
|
||||
if ! [[ "${DAILY}${WEEKLY}${MONTHLY}${YEARLY}" =~ .*y.* ]]; then
|
||||
(( $(date +%u) == 7 )) && WEEKLY=y
|
||||
(( $(date +%-d) == 1 )) && MONTHLY=y
|
||||
(( $(date +%-d) == 1 && $(date +%-m) == 1 )) && YEARLY=y
|
||||
DAILY=y
|
||||
fi
|
||||
|
||||
# set final variables values
|
||||
LOCKFILE=".sync-${SERVER}-${CONFIG##*/}.lock"
|
||||
usage() {
|
||||
printf "usage: %s [-a PERIOD][-DflmnruvzZ] config-file\n" "$CMDNAME"
|
||||
exit 8
|
||||
}
|
||||
|
||||
# log function
|
||||
# parameters:
|
||||
# -l, -s: long, or short prefix (default: none). Last one is used.
|
||||
# -t: timestamp
|
||||
# -n: no newline
|
||||
# This function accepts either a string, either a format string followed
|
||||
# by arguments :
|
||||
# log -s "%s" "foo"
|
||||
# log -s "foo"
|
||||
log() {
|
||||
timestr=""
|
||||
prefix=""
|
||||
opt=y
|
||||
newline=y
|
||||
while [[ $opt = y ]]; do
|
||||
case $1 in
|
||||
-l) prefix=$(printf "*%.s" {1..30});;
|
||||
-s) prefix=$(printf "*%.s" {1..5});;
|
||||
-n) newline=n;;
|
||||
-t) timestr=$(date "+%F %T%z - ");;
|
||||
*) opt=n;;
|
||||
local timestr="" prefix="" newline=y todo OPTIND
|
||||
while getopts lsnt todo; do
|
||||
case $todo in
|
||||
l) prefix=$(printf "*%.s" {1..30})
|
||||
;;
|
||||
s) prefix=$(printf "*%.s" {1..5})
|
||||
;;
|
||||
n) newline=n
|
||||
;;
|
||||
t) timestr=$(date "+%F %T%z ")
|
||||
;;
|
||||
*) ;;
|
||||
esac
|
||||
[[ $opt = y ]] && shift
|
||||
done
|
||||
shift $((OPTIND - 1))
|
||||
[[ $prefix != "" ]] && printf "%s " "$prefix"
|
||||
printf "%s%s" "$timestr" "$*"
|
||||
[[ $newline = y ]] && echo
|
||||
[[ $timestr != "" ]] && printf "%s" "$timestr"
|
||||
# shellcheck disable=SC2059
|
||||
printf "$@"
|
||||
[[ $newline = y ]] && printf "\n"
|
||||
return 0
|
||||
}
|
||||
|
||||
# After these basic initializations, errors will be managed by the
|
||||
# following handler. It is better to do this before the redirections below.
|
||||
error_handler() {
|
||||
ERROR=$2
|
||||
echo "FATAL: Error line $1, exit code $2. Aborting."
|
||||
exit "$ERROR"
|
||||
# prints out and run a command. Used mainly for rsync debug.
|
||||
echorun () {
|
||||
log "%s" "$*"
|
||||
"$@"
|
||||
return $?
|
||||
}
|
||||
|
||||
trap 'error_handler $LINENO $?' ERR SIGHUP SIGINT SIGTERM
|
||||
# lock system
|
||||
lock_lock() {
|
||||
local opid pidfile="$LOCKDIR/pid"
|
||||
#log -n "Setting lock: "
|
||||
log "Acquire lock (%s), pid=%d" "$LOCKDIR" "$PID"
|
||||
if [[ -d "$LOCKDIR" ]]; then
|
||||
if [[ -r "$pidfile" ]]; then
|
||||
read -r opid < "$pidfile"
|
||||
if ps -p "$opid" &> /dev/null; then
|
||||
log "PID %d (in %s) still active. Exiting." "$opid" "$pidfile"
|
||||
exit 11
|
||||
fi
|
||||
log "Stale lock file found (pid=%d), forcing unlock... " "$opid"
|
||||
lock_unlock -f
|
||||
log "Re-Acquire lock (%s), pid=%d" "$LOCKDIR" "$PID"
|
||||
else
|
||||
log "lockdir exists with unknown PID"
|
||||
exit 12
|
||||
fi
|
||||
fi
|
||||
if ! mkdir "$LOCKDIR"; then
|
||||
log "Cannot create lock file. Exiting."
|
||||
exit 4
|
||||
fi
|
||||
printf "%d\n" "$PID" >> "$pidfile"
|
||||
LOCKED=y
|
||||
return 0
|
||||
}
|
||||
|
||||
lock_unlock() {
|
||||
local force=n
|
||||
[[ $# == 1 && $1 == -f ]] && force=y
|
||||
if [[ "$force" = y || "$LOCKED" = y ]]; then
|
||||
if [[ "$force" = y ]]; then
|
||||
log "Forced lock release (%s)" "$LOCKDIR"
|
||||
else
|
||||
log "Release lock (%s)" "$LOCKDIR"
|
||||
fi
|
||||
rm -vrf "$LOCKDIR"
|
||||
else
|
||||
log "Nothing to unlock (%s)" "$LOCKDIR"
|
||||
fi
|
||||
return 0
|
||||
}
|
||||
|
||||
# Error handler.After these basic initializations, errors will be managed by the
|
||||
# following handler. It is better to do this before the redirections below.
|
||||
error_handler() {
|
||||
local line="$1" err="$2"
|
||||
printf "FATAL: Error line %s, exit code %s. Aborting.\n" "$line" "$err"
|
||||
exit "$err"
|
||||
}
|
||||
|
||||
exit_handler() {
|
||||
local -i status="$?"
|
||||
local error="${ERROR_STR[$status]}"
|
||||
local subject="$CMDNAME: $SOURCEDIR on $HOSTNAME"
|
||||
# we dont need lock file anymore (another backup could start from now).
|
||||
log "exit_handler LOCKED=$LOCKED"
|
||||
#if [[ "$LOCKED" = y ]]; then
|
||||
rm --dir --verbose "${LOCKFILE}"
|
||||
#fi
|
||||
lock_unlock
|
||||
|
||||
if (( ERROR == 0 )); then
|
||||
SUBJECT="Successful $SUBJECT"
|
||||
if (( status == 0 )); then
|
||||
subject="$subject (Success)"
|
||||
else
|
||||
SUBJECT="Failure in $SUBJECT"
|
||||
subject="$subject (Failure: $error)"
|
||||
fi
|
||||
|
||||
log -l -t "Ending backup."
|
||||
@@ -255,149 +337,345 @@ exit_handler() {
|
||||
# restore stdout (not necessary), set temp file as stdin, close fd 3.
|
||||
# remove temp file (as still opened by stdin, will still be readable).
|
||||
exec 1<&3 3>&- 0<"$TMPFILE"
|
||||
rm -f "$TMPFILE"
|
||||
[[ $KEEPLOGFILE = n ]] && rm -f "$TMPFILE"
|
||||
else
|
||||
echo 222
|
||||
exec 0<<<"" # force empty input for the following
|
||||
fi
|
||||
|
||||
# Warning: no logs allowed here (before next braces), as stdout is no
|
||||
# more handled the final way.
|
||||
SECS=$(( $(date +%s) - STARTTIME ))
|
||||
|
||||
# Warning: no logs allowed here (before next braces), as stdout will not
|
||||
# be handled/filtered.
|
||||
{
|
||||
SECS=$(($(date +%s)-STARTTIME))
|
||||
|
||||
# we write these logs here so that they are on top if no DEBUG.
|
||||
log "Exit code: $ERROR"
|
||||
log "$(printf "Elapsed time: $SECS seconds (%d:%02d:%02d)\n\n" \
|
||||
$((SECS/3600)) $((SECS%3600/60)) $((SECS%60)))"
|
||||
printf "%s: Exit code: %d (%s) " "$CMDNAME" "$status" \
|
||||
"${ERROR_STR[$status]}"
|
||||
|
||||
printf "in %d seconds (%d:%02d:%02d)\n" \
|
||||
$((SECS)) $((SECS/3600)) $((SECS%3600/60)) $((SECS%60))
|
||||
|
||||
[[ $KEEPLOGFILE = y ]] && printf "log file kept at: %s\n" "$TMPFILE"
|
||||
printf "\n"
|
||||
if [[ -n $FILTERLNK ]]; then
|
||||
grep -vE "^(hf|cd|cL)[ \+]" ;
|
||||
grep -vE "^(hf|cd|cL)[ \+]"
|
||||
else
|
||||
cat ;
|
||||
cat
|
||||
fi
|
||||
} |
|
||||
{
|
||||
if [[ -n $MAILTO ]]; then
|
||||
mail -s "${SUBJECT}" "${MAILTO}";
|
||||
{
|
||||
MIMESTR="FEDCBA_0987654321"
|
||||
|
||||
# email header
|
||||
printf "To: %s\n" "$MAILTO"
|
||||
#printf "From: %s" "$MAILTO"
|
||||
printf "Subject: %s\n" "$subject"
|
||||
printf "MIME-Version: 1.0\n"
|
||||
printf 'Content-Type: multipart/mixed; boundary="%s"\n' "$MIMESTR"
|
||||
printf "\n"
|
||||
|
||||
# We write a short information in email's body
|
||||
printf "\n--%s\n" "$MIMESTR"
|
||||
printf 'Content-Type: text/plain; charset=UTF-8\n'
|
||||
printf '\n'
|
||||
|
||||
# send first lines in message body (until the mark line or EOF)
|
||||
has_mark_line=0
|
||||
while read -r line; do
|
||||
if [[ $line =~ ^\*+\ Mark$ ]]; then
|
||||
has_mark_line=1
|
||||
break
|
||||
fi
|
||||
printf "%s\n" "$line"
|
||||
done
|
||||
|
||||
# we prepare attachment only if a mark line was found
|
||||
if (( has_mark_line == 1 )); then
|
||||
printf "\n--%s\n" "$MIMESTR"
|
||||
if [[ "$ZIPMAIL" == cat ]]; then
|
||||
printf 'Content-Type: text/plain; charset=UTF-8\n'
|
||||
printf 'Content-Disposition: attachment; filename="sync-log.txt"\n'
|
||||
else
|
||||
printf "Content-Type: application/gzip\n"
|
||||
printf 'Content-Disposition: attachment; filename="sync-log.txt.gz"\n'
|
||||
fi
|
||||
printf "Content-Transfer-Encoding: base64\n"
|
||||
printf '\n'
|
||||
$ZIPMAIL | base64
|
||||
fi
|
||||
printf "\n--%s--\n" "$MIMESTR"
|
||||
} | sendmail -it
|
||||
else
|
||||
cat;
|
||||
grep -vE "^\*+\ Mark$"
|
||||
fi
|
||||
}
|
||||
}
|
||||
|
||||
###############################################################################
|
||||
######################### Options/Environment setup
|
||||
###############################################################################
|
||||
# command-line parsing / configuration file read.
|
||||
parse_opts() {
|
||||
OPTIND=0
|
||||
shopt -s extglob # to parse "-a" option
|
||||
while getopts a:DflmnruvzZ todo; do
|
||||
case "$todo" in
|
||||
a)
|
||||
# we use US (Unit Separator, 0x1F, control-_) as separator
|
||||
# next line will add US before each char (including 1st one)
|
||||
IFS=$'\x1F' read -ra periods <<< "${OPTARG//?()/$'\x1F'}"
|
||||
# we skip 1st (empty) ellement of array
|
||||
for period in "${periods[@]:1}"; do
|
||||
case "$period" in
|
||||
d) DAILY=y;;
|
||||
w) WEEKLY=y;;
|
||||
m) MONTHLY=y;;
|
||||
y) YEARLY=y;;
|
||||
*) printf '%s: unknown period "%s"\n' "$CMDNAME" "$period"
|
||||
usage
|
||||
esac
|
||||
done
|
||||
;;
|
||||
f)
|
||||
FILTERLNK=y
|
||||
;;
|
||||
r)
|
||||
RESUME=y
|
||||
;;
|
||||
l)
|
||||
KEEPLOGFILE=y
|
||||
;;
|
||||
m)
|
||||
man
|
||||
exit 0
|
||||
;;
|
||||
n)
|
||||
MAILTO=""
|
||||
;;
|
||||
z)
|
||||
COMPRESS=-y # rsync compression. Depends on net/CPU perfs
|
||||
;;
|
||||
u)
|
||||
NUMID="--numeric-ids"
|
||||
;;
|
||||
D)
|
||||
DEBUG=y
|
||||
;;
|
||||
Z)
|
||||
ZIPMAIL="cat"
|
||||
;;
|
||||
*)
|
||||
usage
|
||||
;;
|
||||
esac
|
||||
done
|
||||
# Now check remaining argument (configuration file), which should be unique,
|
||||
# and read the file.
|
||||
shift $((OPTIND - 1))
|
||||
(( $# != 1 )) && usage
|
||||
CONFIG="$1"
|
||||
|
||||
if [[ ! -r "$CONFIG" ]]; then
|
||||
printf "%s: Cannot open $CONFIG file. Exiting.\n" "$CMDNAME"
|
||||
exit 9
|
||||
fi
|
||||
# shellcheck source=sync-conf-example.sh
|
||||
source "$CONFIG"
|
||||
|
||||
LOCKDIR="/tmp/$CMDNAME-$HOSTNAME-${CONFIG##*/}.lock"
|
||||
}
|
||||
|
||||
parse_opts "$@"
|
||||
|
||||
# we set backups to be done if none has been set yet (i.e. none is "y").
|
||||
# Note: we use the form +%-d to avoid zero padding :
|
||||
# for bash, starting with 0 => octal => 08 is invalid
|
||||
adjust_targets() {
|
||||
if ! [[ "$DAILY$WEEKLY$MONTHLY$YEARLY" =~ .*y.* ]]; then
|
||||
(( $(date +%u) == 7 )) && WEEKLY=y
|
||||
(( $(date +%-d) == 1 )) && MONTHLY=y
|
||||
(( $(date +%-d) == 1 && $(date +%-m) == 1 )) && YEARLY=y
|
||||
DAILY=y
|
||||
fi
|
||||
}
|
||||
|
||||
adjust_targets
|
||||
|
||||
# After these basic initializations, errors will be managed by the
|
||||
# following handler. It is better to do this before the redirections below.
|
||||
trap 'error_handler $LINENO $?' ERR SIGHUP SIGINT SIGTERM
|
||||
trap 'exit_handler' EXIT
|
||||
|
||||
# activate exit on error
|
||||
# set -o errexit errtrace nounset pipefail
|
||||
|
||||
# standard descriptors redirection.
|
||||
# if not DEBUG, save stdout as fd 3, and redirect stdout to temp file.
|
||||
# in case of DEBUG, we could close stdin, but there could be side effects,
|
||||
# such as ^C handling, etc... So we keep the keyboard available.
|
||||
if [[ $DEBUG = n ]]; then
|
||||
TMPFILE=$(mktemp /tmp/sync-log.XXXXXX)
|
||||
exec 3<&1 >"${TMPFILE}" # no more output on screen from now.
|
||||
TMPFILE=$(mktemp /tmp/sync-XXXXXXXX.log)
|
||||
exec 3<&1 >"$TMPFILE" # no more output on screen from now.
|
||||
fi
|
||||
exec 2>&1
|
||||
if [[ ! -d $SOURCEDIR ]]; then
|
||||
log -s "Source directory (\"${SOURCEDIR}\") is not a valid directory."
|
||||
error_handler $LINENO 1
|
||||
fi
|
||||
cd ${SOURCEDIR}
|
||||
|
||||
# prepare list of backups, such as "daily 7 weekly 4", etc...
|
||||
# the order is important.
|
||||
TODO=()
|
||||
[[ $DAILY = y && $NDAYS -gt 0 ]] && TODO+=(daily "$NDAYS")
|
||||
[[ $WEEKLY = y && $NWEEKS -gt 0 ]] && TODO+=(weekly "$NWEEKS")
|
||||
[[ $MONTHLY = y && $NMONTHS -gt 0 ]] && TODO+=(monthly "$NMONTHS")
|
||||
[[ $YEARLY = y && $NYEARS -gt 0 ]] && TODO+=(yearly "$NYEARS")
|
||||
[[ $DAILY = y ]] && (( NDAYS > 0 )) && TODO+=(daily "$NDAYS")
|
||||
[[ $WEEKLY = y ]] && (( NWEEKS > 0 )) && TODO+=(weekly "$NWEEKS")
|
||||
[[ $MONTHLY = y ]] && (( NMONTHS > 0 )) && TODO+=(monthly "$NMONTHS")
|
||||
[[ $YEARLY = y ]] && (( NYEARS > 0 )) && TODO+=(yearly "$NYEARS")
|
||||
|
||||
log -l -t "Starting %s" "$CMDNAME"
|
||||
log "Bash version: %s.%s.%s" \
|
||||
"${BASH_VERSINFO[0]}" "${BASH_VERSINFO[1]}" "${BASH_VERSINFO[2]}"
|
||||
log "Hostname: %s" "$HOSTNAME"
|
||||
log "Operating System: %s on %s" "$(uname -sr)" "$(uname -m)"
|
||||
log "Config : %s\n" "$CONFIG"
|
||||
log "Src dir: %s" "$SOURCEDIR"
|
||||
log "Dst dir: %s" "$SERVER:$DESTDIR"
|
||||
log "Actions: %s" "${TODO[*]}"
|
||||
if (( ${#RSYNCOPTS[@]} )); then
|
||||
log -n "Rsync additional options (%d): " "${#RSYNCOPTS[@]}"
|
||||
for opt in "${RSYNCOPTS[@]}"; do
|
||||
log -n '\"%s\" ' "$opt"
|
||||
done
|
||||
log ""
|
||||
else
|
||||
log "Rsync additional options : None."
|
||||
fi
|
||||
|
||||
log -n "Mail recipient: "
|
||||
# shellcheck disable=SC2015
|
||||
[[ -n "$MAILTO" ]] && log "$MAILTO" || log "<unset>"
|
||||
# shellcheck disable=SC2015
|
||||
log -n "Compression: " && [[ $ZIPMAIL = gzip ]] && log "gzip" || log "none"
|
||||
|
||||
# check availability of necessary commands
|
||||
declare -a cmdavail=()
|
||||
declare error=0
|
||||
log -n "Checking for commands : "
|
||||
for cmd in rsync base64 sendmail gzip; do
|
||||
log -n "%s..." "$cmd"
|
||||
if type -P "$cmd" > /dev/null; then
|
||||
log -n "ok "
|
||||
else
|
||||
(( error++ ))
|
||||
log -n "NOK "
|
||||
case "$cmd" in
|
||||
gzip)
|
||||
log -n "(compression disabled) "
|
||||
ZIPMAIL="cat"
|
||||
(( error-- )) # Not an error
|
||||
;;
|
||||
sendmail)
|
||||
MAILTO="" # to get some output in cron
|
||||
;;
|
||||
esac
|
||||
cmdavail+=("$cmd")
|
||||
fi
|
||||
done
|
||||
log ""
|
||||
(( ${#cmdavail[@]} )) && log -s "Please install the following programs: %s." \
|
||||
"${cmdavail[*]}"
|
||||
(( error > 0 )) && exit 2
|
||||
unset cmdavail
|
||||
unset error
|
||||
|
||||
# all logs from this point will be in email attachment
|
||||
log -s "Mark" # to separate email body
|
||||
|
||||
log -l -t "Starting backup"
|
||||
# create lock file
|
||||
lock_lock
|
||||
|
||||
log -l -t "Starting backup."
|
||||
log "Config : ${CONFIG}"
|
||||
log "Src dir: ${SOURCEDIR}"
|
||||
log "Dst dir: ${SERVER}:${DESTDIR}"
|
||||
log "Actions: ${TODO[@]}"
|
||||
|
||||
# select handling depending on local or networked target (ssh or not).
|
||||
if [[ $SERVER = local ]]; then # local backup
|
||||
DOIT=""
|
||||
DEST=${DESTDIR}
|
||||
DEST="$DESTDIR"
|
||||
else # remote backup
|
||||
DOIT="ssh ${SERVER}"
|
||||
DEST="${SERVER}:${DESTDIR}"
|
||||
DOIT="ssh $SERVER"
|
||||
DEST="$SERVER:$DESTDIR"
|
||||
fi
|
||||
|
||||
# commands and specific variables.
|
||||
EXIST="${DOIT} test -e"
|
||||
MOVE="${DOIT} mv"
|
||||
REMOVE="${DOIT} rm -rf"
|
||||
COPYHARD="${DOIT} rsync -ar"
|
||||
|
||||
# prints out and run a command. Used mainly for rsync debug.
|
||||
echorun () {
|
||||
log "$@"
|
||||
"$@"
|
||||
return $?
|
||||
}
|
||||
EXIST="$DOIT test -e"
|
||||
MOVE="$DOIT mv"
|
||||
REMOVE="$DOIT rm -rf"
|
||||
COPYHARD="$DOIT rsync -ar"
|
||||
TOUCH="$DOIT touch"
|
||||
|
||||
# rotate files. arguments are a string and a number. For instance $1=weekly,
|
||||
# $2=3.
|
||||
# we first build a list from $2 to zero, with 2 padded digits: 03 02 01 00
|
||||
# then we remove $1-03, and move $1-02 to $1-03, $1-01 to $1-02, etc...
|
||||
rotate-files () {
|
||||
files=( $(seq -f "${DESTDIR}/${1}-%02g" "${2}" -1 0) )
|
||||
log -s -t -n "${files[0]##*/} deletion... "
|
||||
status=0
|
||||
${REMOVE} "${files[0]}" || status=$?
|
||||
if (( status != 0 )); then
|
||||
rotate-files() {
|
||||
# shellcheck disable=SC2207
|
||||
local -a files=( $(seq -f "$DESTDIR/$1-%02g" "$2" -1 0) )
|
||||
log -s -t -n "deleting %s... " "${files[0]##*/}"
|
||||
if ! $REMOVE "${files[0]}"; then
|
||||
# this should never happen.
|
||||
# But I saw this event in case of a file system corruption. Better
|
||||
# is to stop immediately instead of accepting strange side effects.
|
||||
if ${EXIST} "${files[0]}" ; then
|
||||
log -s "Could not remove ${files[0]}. This SHOULD NOT happen."
|
||||
error_handler $LINENO ${status}
|
||||
if $EXIST "${files[0]}" ; then
|
||||
log -s "Could not remove %s. This SHOULD NOT happen." "${files[0]}"
|
||||
exit 5
|
||||
fi
|
||||
fi
|
||||
log "done."
|
||||
|
||||
log -s -t -n "${1} rotation... "
|
||||
while (( ${#files[@]} > 1 ))
|
||||
do
|
||||
if ${EXIST} "${files[1]}" ; then
|
||||
[[ $DEBUG = y ]] && log -n "${files[1]:(-2)} "
|
||||
${MOVE} "${files[1]}" "${files[0]}"
|
||||
log -s -t -n "rotating " "$1"
|
||||
while (( ${#files[@]} > 1 )); do
|
||||
if $EXIST "${files[1]}" ; then
|
||||
log -n "%s... " "${files[1]##*/}"
|
||||
if ! $MOVE "${files[1]}" "${files[0]}"; then
|
||||
log "error"
|
||||
exit 13
|
||||
fi
|
||||
|
||||
fi
|
||||
unset files[0] # shift and pack array
|
||||
unset "files[0]" # shift and pack array
|
||||
files=( "${files[@]}" )
|
||||
done
|
||||
log "done."
|
||||
return 0
|
||||
}
|
||||
|
||||
# create lock file
|
||||
if ! mkdir "${LOCKFILE}"; then
|
||||
log -s "Cannot create lock file. Exiting."
|
||||
error_handler $LINENO 1
|
||||
if [[ ! -d "$SOURCEDIR" ]]; then
|
||||
log -s "Invalid source directory (%s)." "$SOURCEDIR"
|
||||
exit 3
|
||||
fi
|
||||
if ! cd "$SOURCEDIR"; then
|
||||
log -s "Cannot cd to %s." "$SOURCEDIR"
|
||||
exit 3
|
||||
fi
|
||||
if ! $EXIST "$DESTDIR"; then
|
||||
log -s 'destination directory (%s) missing.' "$DESTDIR"
|
||||
exit 10
|
||||
fi
|
||||
LOCKED=y
|
||||
|
||||
# main loop.
|
||||
while [[ ${TODO[0]} != "" ]]
|
||||
do
|
||||
while [[ ${TODO[0]} != "" ]]; do
|
||||
# these variables to make the script easier to read.
|
||||
todo="${TODO[0]}" # daily, weekly, etc...
|
||||
keep="${TODO[1]}" # # of versions to keep for $todo set
|
||||
todop="${DESTDIR}/${todo}" # prefix for backup (e.g. "destdir/daily")
|
||||
tdest="${todop}-00" # target full path (e.g. "destdir/daily-00")
|
||||
ldest="${DESTDIR}/daily-01" # link-dest dir (always daily-01)
|
||||
todop="$DESTDIR/$todo" # prefix for backup (e.g. "destdir/daily")
|
||||
tdest="$todop-00" # target full path (e.g. "destdir/daily-00")
|
||||
ldest="$DESTDIR/daily-01" # link-dest dir (always daily-01)
|
||||
|
||||
log -l -t "${todo} backup..."
|
||||
log -l -t "%s backup..." "$todo"
|
||||
|
||||
# check if target (XX-00) directory exists. If yes, we must have the
|
||||
# resume option to go on.
|
||||
if ${EXIST} "${tdest}"; then
|
||||
if $EXIST "$tdest"; then
|
||||
if [[ $RESUME = n ]]; then
|
||||
log -s "${tdest} already exists, and no \"resume\" option."
|
||||
error_handler $LINENO 1
|
||||
log -s '%s already exists, and no "resume" option.' "$tdest"
|
||||
exit 6
|
||||
fi
|
||||
log -s "Warning: Resuming ${todo} partial backup.".
|
||||
log -s "Warning: Resuming %s partial backup." "$todo"
|
||||
fi
|
||||
|
||||
# daily backup.
|
||||
@@ -413,34 +691,41 @@ do
|
||||
status=0
|
||||
echorun rsync \
|
||||
-aHixv \
|
||||
"${FILTER}" \
|
||||
${RSYNCOPTS} \
|
||||
${COMPRESS} \
|
||||
${NUMID} \
|
||||
"${RSYNCOPTS[@]}" \
|
||||
$COMPRESS \
|
||||
$NUMID \
|
||||
--delete \
|
||||
--delete-during \
|
||||
--delete-excluded \
|
||||
--modify-window=${MODIFYWINDOW} \
|
||||
--modify-window=$MODIFYWINDOW \
|
||||
--partial \
|
||||
--link-dest="${ldest}" \
|
||||
--link-dest="$ldest" \
|
||||
. \
|
||||
"${DEST}/daily-00" || status=$?
|
||||
"$DEST/daily-00" || status=$?
|
||||
# error 24 is "vanished source file", and should be ignored.
|
||||
if (( status != 24 && status != 0)); then
|
||||
error_handler $LINENO $status
|
||||
log -s "rsync error %d" "$status"
|
||||
exit 7
|
||||
fi
|
||||
if ! $TOUCH "$tdest"; then
|
||||
log -s "cannot change %s modification time (error %d)" \
|
||||
"$DEST/daily-00" "$status"
|
||||
exit 14
|
||||
fi
|
||||
aftersync # script to run after the sync
|
||||
else # non-daily case.
|
||||
status=0
|
||||
${EXIST} "${ldest}" || status=$?
|
||||
if ((status == 0 )); then
|
||||
log -s -t "${tdest} update..."
|
||||
${COPYHARD} --link-dest="${ldest}" "${ldest}/" "${tdest}"
|
||||
else # non-daily case
|
||||
if $EXIST "$ldest"; then
|
||||
# if ((status == 0 )); then
|
||||
log -s -t "%s update..." "$tdest"
|
||||
if ! $COPYHARD --link-dest="$ldest" "$ldest/" "$tdest"; then
|
||||
log -s "copyhard error %d" "$status"
|
||||
exit 15
|
||||
fi
|
||||
else
|
||||
log "No ${ldest} directory. Skipping ${todo} backup."
|
||||
log "No %s directory. Skipping %s backup." "$ldest" "$todo"
|
||||
fi
|
||||
fi
|
||||
rotate-files "${todo}" "${keep}"
|
||||
rotate-files "$todo" "$keep"
|
||||
|
||||
# shift and pack TODO array
|
||||
unset 'TODO[0]' 'TODO[1]'
|
||||
|
||||
@@ -2,14 +2,14 @@
|
||||
#
|
||||
# trans.sh - Translate words using linguee.com.
|
||||
#
|
||||
# (C) Bruno Raoult ("br"), 2021
|
||||
# Licensed under the Mozilla Public License (MPL) version 2.0.
|
||||
# (C) Bruno Raoult ("br"), 2021-2022
|
||||
# Licensed under the GNU General Public License v3.0 or later.
|
||||
# Some rights reserved. See COPYING.
|
||||
#
|
||||
# You should have received a copy of the Mozilla Public License along with this
|
||||
# program. If not, see <https://www.mozilla.org/en-US/MPL>
|
||||
# You should have received a copy of the GNU General Public License along with this
|
||||
# program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
#
|
||||
# SPDX-License-Identifier: MPL-2.0 <https://spdx.org/licenses/MPL-2.0.html>
|
||||
# SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
#
|
||||
# Options: See usage function in code below.
|
||||
|
||||
|
||||
674
c/COPYING
Normal file
674
c/COPYING
Normal file
@@ -0,0 +1,674 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. 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
|
||||
them 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 prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. 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.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey 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;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If 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 convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU 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 that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
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.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
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.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
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
|
||||
state 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 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 <https://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program 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, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<https://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU 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 Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
||||
87
c/Makefile
Normal file
87
c/Makefile
Normal file
@@ -0,0 +1,87 @@
|
||||
# Tools Makefile
|
||||
#
|
||||
# Copyright (C) 2022 Bruno Raoult ("br")
|
||||
# Licensed under the GNU General Public License v3.0 or later.
|
||||
# Some rights reserved. See COPYING.
|
||||
#
|
||||
# You should have received a copy of the GNU General Public License along with this
|
||||
# program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
#
|
||||
# SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
#
|
||||
|
||||
SHELL := /bin/bash
|
||||
CC := gcc
|
||||
|
||||
CFLAGS += -std=gnu99
|
||||
CFLAGS += -O2
|
||||
CFLAGS += -g
|
||||
CFLAGS += -Wall
|
||||
CFLAGS += -Wextra
|
||||
CFLAGS += -march=native
|
||||
CFLAGS += -Wmissing-declarations
|
||||
CFLAGS += -Wno-unused-result
|
||||
|
||||
# for gprof
|
||||
#CFLAGS += -pg
|
||||
|
||||
# Next one may be useful for valgrind (some invalid instructions)
|
||||
# CFLAGS += -mno-tbm
|
||||
|
||||
CFLAGS += -DDEBUG_DEBUG # activate general debug (debug.c)
|
||||
CFLAGS += -DDEBUG_POOL # memory pools management
|
||||
|
||||
INCDIR := ./include
|
||||
LIBDIR := ./lib
|
||||
OBJDIR := ./obj
|
||||
|
||||
LIBNAME := br_$(shell uname -m)
|
||||
LIB := lib$(LIBNAME)
|
||||
SLIB := $(LIBDIR)/$(LIB).a
|
||||
DLIB := $(LIBDIR)/$(LIB).so
|
||||
LIBSRC := $(wildcard *.c)
|
||||
LIBOBJ := $(addprefix $(OBJDIR)/,$(patsubst %.c,%.o,$(LIBSRC)))
|
||||
LDFLAGS := -L$(LIBDIR)
|
||||
LDLIB := -l$(LIB)
|
||||
|
||||
export LD_LIBRARY_PATH = $(LIBDIR)
|
||||
#export PATH := .:$(PATH)
|
||||
|
||||
.PHONY: all libs clean dirs
|
||||
|
||||
all: libs
|
||||
|
||||
libs: dirs $(DLIB) $(SLIB)
|
||||
|
||||
dirs: $(LIBDIR) $(OBJDIR)
|
||||
|
||||
$(LIBDIR) $(OBJDIR):
|
||||
@echo creating $@ directory.
|
||||
@mkdir $@
|
||||
|
||||
clean:
|
||||
@echo deleting $(OBJDIR) and $(LIBDIR) directories.
|
||||
@$(RM) -rf $(LIBDIR) $(OBJDIR)
|
||||
|
||||
$(SLIB): $(LIBOBJ)
|
||||
@echo building $@ static library.
|
||||
@$(AR) $(ARFLAGS) -o $@ $^
|
||||
|
||||
$(DLIB): CFLAGS += -fPIC
|
||||
$(DLIB): LDFLAGS += -shared
|
||||
$(DLIB): $(LIBOBJ)
|
||||
@echo building $@ shared library.
|
||||
@$(CC) $(LDFLAGS) $^ -o $@
|
||||
|
||||
.c:
|
||||
@echo compiling $<
|
||||
@$(CC) $(CFLAGS) $(LDFLAGS) -I $(INCDIR) $< $(LDLIB) -o $@
|
||||
|
||||
#.c.o:
|
||||
$(OBJDIR)/%.o: %.c
|
||||
@echo compiling $<.
|
||||
@$(CC) -c $(CFLAGS) $(LDFLAGS) -I $(INCDIR) -o $@ $<
|
||||
|
||||
.c.s:
|
||||
@echo generating $@
|
||||
@$(CC) -S -fverbose-asm $(CFLAGS) -I $(INCDIR) $< -o $@
|
||||
111
c/debug.c
Normal file
111
c/debug.c
Normal file
@@ -0,0 +1,111 @@
|
||||
/* debug.c - debug/log management
|
||||
*
|
||||
* Copyright (C) 2021 Bruno Raoult ("br")
|
||||
* Licensed under the GNU General Public License v3.0 or later.
|
||||
* Some rights reserved. See COPYING.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with this
|
||||
* program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
*
|
||||
* SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <time.h>
|
||||
|
||||
#ifndef DEBUG_DEBUG
|
||||
#define DEBUG_DEBUG
|
||||
#endif
|
||||
|
||||
#include "debug.h"
|
||||
|
||||
#define NANOSEC 1000000000 /* nano sec in sec */
|
||||
#define MILLISEC 1000000 /* milli sec in sec */
|
||||
|
||||
static s64 timer_start; /* in nanosecond */
|
||||
static u32 debug_level=0;
|
||||
|
||||
void debug_level_set(u32 level)
|
||||
{
|
||||
debug_level = level;
|
||||
|
||||
log(1, "debug level set to %u\n", level);
|
||||
}
|
||||
|
||||
void debug_init(u32 level)
|
||||
{
|
||||
struct timespec timer;
|
||||
|
||||
debug_level_set(level);
|
||||
if (!clock_gettime(CLOCK_MONOTONIC, &timer)) {
|
||||
timer_start = timer.tv_sec * NANOSEC + timer.tv_nsec;
|
||||
}
|
||||
else {
|
||||
timer_start = 0;
|
||||
}
|
||||
log(0, "timer started.\n");
|
||||
}
|
||||
|
||||
inline static s64 timer_elapsed()
|
||||
{
|
||||
struct timespec timer;
|
||||
|
||||
clock_gettime(CLOCK_MONOTONIC, &timer);
|
||||
return (timer.tv_sec * NANOSEC + timer.tv_nsec) - timer_start;
|
||||
}
|
||||
|
||||
|
||||
/* void debug - log function
|
||||
* @timestamp : boolean
|
||||
* @indent : indent level (2 spaces each)
|
||||
* @src : source file/func name (or NULL)
|
||||
* @line : line number
|
||||
*/
|
||||
void debug(u32 level, bool timestamp, u32 indent, const char *src,
|
||||
u32 line, const char *fmt, ...)
|
||||
{
|
||||
if (level > debug_level)
|
||||
return;
|
||||
|
||||
va_list ap;
|
||||
|
||||
if (indent)
|
||||
printf("%*s", 2*(indent-1), "");
|
||||
|
||||
if (timestamp) {
|
||||
s64 diff = timer_elapsed();
|
||||
printf("%ld.%03ld ", diff/NANOSEC, (diff/1000000)%1000);
|
||||
printf("%010ld ", diff);
|
||||
}
|
||||
|
||||
if (src) {
|
||||
if (line)
|
||||
printf("[%s:%u] ", src, line);
|
||||
else
|
||||
printf("[%s] ", src);
|
||||
}
|
||||
va_start(ap, fmt);
|
||||
vprintf(fmt, ap);
|
||||
va_end(ap);
|
||||
}
|
||||
|
||||
#ifdef BIN_debug
|
||||
#include <unistd.h>
|
||||
|
||||
int main()
|
||||
{
|
||||
int foo=1;
|
||||
debug_init(5);
|
||||
|
||||
log(0, "log0=%d\n", foo++);
|
||||
log(1, "log1=%d\n", foo++);
|
||||
log(2, "log2=%d\n", foo++);
|
||||
log_i(2, "log_i 2=%d\n", foo++);
|
||||
log_i(5, "log_i 5=%d\n", foo++);
|
||||
log_i(6, "log_i 6=%d\n", foo++);
|
||||
log_it(4, "log_it 4=%d\n", foo++);
|
||||
log_f(1, "log_f 5=%d\n", foo++);
|
||||
}
|
||||
#endif
|
||||
277
c/include/bits.h
Normal file
277
c/include/bits.h
Normal file
@@ -0,0 +1,277 @@
|
||||
/* bits.h - bits functions.
|
||||
*
|
||||
* Copyright (C) 2021-2022 Bruno Raoult ("br")
|
||||
* Licensed under the GNU General Public License v3.0 or later.
|
||||
* Some rights reserved. See COPYING.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with this
|
||||
* program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
*
|
||||
* SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
*
|
||||
*/
|
||||
#ifndef BITS_H
|
||||
#define BITS_H
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
/* next include will define __WORDSIZE: 32 or 64
|
||||
*/
|
||||
#include <bits/wordsize.h>
|
||||
|
||||
#ifndef __has_builtin
|
||||
#define __has_builtin(x) 0
|
||||
#endif
|
||||
|
||||
/* no plan to support 32bits for now...
|
||||
*/
|
||||
#if __WORDSIZE != 64
|
||||
#error "Only 64 bits word size supported."
|
||||
#endif
|
||||
|
||||
/* fixed-size types
|
||||
*/
|
||||
typedef int64_t s64;
|
||||
typedef int32_t s32;
|
||||
typedef int16_t s16;
|
||||
typedef int8_t s8;
|
||||
|
||||
typedef uint64_t u64;
|
||||
typedef uint32_t u32;
|
||||
typedef uint16_t u16;
|
||||
typedef uint8_t u8;
|
||||
|
||||
/* convenience types
|
||||
*/
|
||||
typedef unsigned long int ulong;
|
||||
typedef unsigned int uint;
|
||||
typedef unsigned short ushort;
|
||||
typedef unsigned char uchar;
|
||||
|
||||
/* char is a special case, as it can be signed or unsigned
|
||||
*/
|
||||
typedef signed char schar;
|
||||
|
||||
/* count trailing zeroes : 00101000 -> 3
|
||||
* ^^^
|
||||
*/
|
||||
static inline int ctz64(u64 n)
|
||||
{
|
||||
# if __has_builtin(__builtin_ctzl)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin ctzl.\n");
|
||||
# endif
|
||||
return __builtin_ctzl(n);
|
||||
|
||||
# elif __has_builtin(__builtin_clzl)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin clzl.\n");
|
||||
# endif
|
||||
return __WORDSIZE - (__builtin_clzl(n & -n) + 1);
|
||||
|
||||
# else
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "emulated.\n");
|
||||
# endif
|
||||
return popcount64((n & −n) − 1);
|
||||
# endif
|
||||
}
|
||||
|
||||
static inline int ctz32(u32 n)
|
||||
{
|
||||
# if __has_builtin(__builtin_ctz)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin ctz.\n");
|
||||
# endif
|
||||
return __builtin_ctzl(n);
|
||||
|
||||
# elif __has_builtin(__builtin_clz)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin clz.\n");
|
||||
# endif
|
||||
return __WORDSIZE - (__builtin_clz(n & -n) + 1);
|
||||
|
||||
# else
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "emulated.\n");
|
||||
# endif
|
||||
return popcount32((n & −n) − 1);
|
||||
# endif
|
||||
}
|
||||
|
||||
/* count leading zeroes : 00101000 -> 2
|
||||
* ^^
|
||||
*/
|
||||
static inline int clz64(u64 n)
|
||||
{
|
||||
# if __has_builtin(__builtin_clzl)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin.\n");
|
||||
# endif
|
||||
return __builtin_clzl(n);
|
||||
|
||||
# else
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "emulated.\n");
|
||||
# endif
|
||||
u64 r, q;
|
||||
|
||||
r = (n > 0xFFFFFFFF) << 5; n >>= r;
|
||||
q = (n > 0xFFFF) << 4; n >>= q; r |= q;
|
||||
q = (n > 0xFF ) << 3; n >>= q; r |= q;
|
||||
q = (n > 0xF ) << 2; n >>= q; r |= q;
|
||||
q = (n > 0x3 ) << 1; n >>= q; r |= q;
|
||||
r |= (n >> 1);
|
||||
return 64 - r - 1;
|
||||
# endif
|
||||
}
|
||||
|
||||
static inline int clz32(u32 n)
|
||||
{
|
||||
# if __has_builtin(__builtin_clz)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin.\n");
|
||||
# endif
|
||||
return __builtin_clz(n);
|
||||
|
||||
# else
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "emulated.\n");
|
||||
# endif
|
||||
u32 r, q;
|
||||
|
||||
r = (n > 0xFFFF) << 4; n >>= r;
|
||||
q = (n > 0xFF ) << 3; n >>= q; r |= q;
|
||||
q = (n > 0xF ) << 2; n >>= q; r |= q;
|
||||
q = (n > 0x3 ) << 1; n >>= q; r |= q;
|
||||
r |= (n >> 1);
|
||||
return 32 - r - 1;
|
||||
# endif
|
||||
}
|
||||
|
||||
/* find first set : 00101000 -> 4
|
||||
* ^
|
||||
*/
|
||||
static inline uint ffs64(u64 n)
|
||||
{
|
||||
# if __has_builtin(__builtin_ffsl)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin ffsl.\n");
|
||||
# endif
|
||||
return __builtin_ffsl(n);
|
||||
|
||||
# elif __has_builtin(__builtin_ctzl)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin ctzl.\n");
|
||||
# endif
|
||||
if (n == 0)
|
||||
return (0);
|
||||
return __builtin_ctzl(n) + 1;
|
||||
|
||||
# else
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "emulated.\n");
|
||||
# endif
|
||||
return popcount64(n ^ ~-n);
|
||||
# endif
|
||||
}
|
||||
|
||||
static inline uint ffs32(u32 n)
|
||||
{
|
||||
# if __has_builtin(__builtin_ffs)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin ffs.\n");
|
||||
# endif
|
||||
return __builtin_ffs(n);
|
||||
|
||||
# elif __has_builtin(__builtin_ctz)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin ctz.\n");
|
||||
# endif
|
||||
if (n == 0)
|
||||
return (0);
|
||||
return __builtin_ctz(n) + 1;
|
||||
|
||||
# else
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "emulated.\n");
|
||||
# endif
|
||||
return popcount32(n ^ ~-n);
|
||||
# endif
|
||||
}
|
||||
|
||||
/* count set bits: 10101000 -> 3
|
||||
* ^ ^ ^
|
||||
*/
|
||||
static inline int popcount64(u64 n)
|
||||
{
|
||||
# if __has_builtin(__builtin_popcountl)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin.\n");
|
||||
# endif
|
||||
return __builtin_popcountl(n);
|
||||
|
||||
# else
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "emulated.\n");
|
||||
# endif
|
||||
int count = 0;
|
||||
while (n) {
|
||||
count++;
|
||||
n &= (n - 1);
|
||||
}
|
||||
return count;
|
||||
# endif
|
||||
}
|
||||
|
||||
static inline int popcount32(u32 n)
|
||||
{
|
||||
# if __has_builtin(__builtin_popcount)
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "builtin.\n");
|
||||
# endif
|
||||
return __builtin_popcount(n);
|
||||
|
||||
# else
|
||||
# ifdef DEBUG_BITS
|
||||
log_f(1, "emulated.\n");
|
||||
# endif
|
||||
int count = 0;
|
||||
while (n) {
|
||||
count++;
|
||||
n &= (n - 1);
|
||||
}
|
||||
return count;
|
||||
# endif
|
||||
}
|
||||
|
||||
/** bit_for_each - iterate over an u64/u32 bits
|
||||
* @pos: an int used as current bit
|
||||
* @tmp: a temp u64/u32 used as temporary storage
|
||||
* @ul: the u64/u32 to loop over
|
||||
*
|
||||
* Usage:
|
||||
* u64 u=139, _t; // u=b10001011
|
||||
* int cur;
|
||||
* bit_for_each64(cur, _t, u) {
|
||||
* printf("%d\n", cur);
|
||||
* }
|
||||
* This will display the position of each bit set in ul: 1, 2, 4, 8
|
||||
*
|
||||
* I should probably re-think the implementation...
|
||||
*/
|
||||
#define bit_for_each64(pos, tmp, ul) \
|
||||
for (tmp = ul, pos = ffs64(tmp); tmp; tmp &= (tmp - 1), pos = ffs64(tmp))
|
||||
|
||||
#define bit_for_each32(pos, tmp, ul) \
|
||||
for (tmp = ul, pos = ffs32(tmp); tmp; tmp &= (tmp - 1), pos = ffs32(tmp))
|
||||
|
||||
/** or would it be more useful (counting bits from zero instead of 1) ?
|
||||
*/
|
||||
#define bit_for_each64_2(pos, tmp, ul) \
|
||||
for (tmp = ul, pos = ctz64(tmp); tmp; tmp ^= 1UL << pos, pos = ctz64(tmp))
|
||||
|
||||
#define bit_for_each32_2(pos, tmp, ul) \
|
||||
for (tmp = ul, pos = ctz32(tmp); tmp; tmp ^= 1U << pos, pos = ctz32(tmp))
|
||||
|
||||
#endif /* BITS_H */
|
||||
84
c/include/debug.h
Normal file
84
c/include/debug.h
Normal file
@@ -0,0 +1,84 @@
|
||||
/* debug.h - debug/log management.
|
||||
*
|
||||
* Copyright (C) 2021-2022 Bruno Raoult ("br")
|
||||
* Licensed under the GNU General Public License v3.0 or later.
|
||||
* Some rights reserved. See COPYING.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with this
|
||||
* program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
*
|
||||
* SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
*
|
||||
*/
|
||||
|
||||
#ifndef DEBUG_H
|
||||
#define DEBUG_H
|
||||
|
||||
#include <stdbool.h>
|
||||
#include <stdint.h>
|
||||
|
||||
#include "bits.h"
|
||||
|
||||
#define _unused __attribute__((__unused__))
|
||||
#define _printf __attribute__ ((format (printf, 6, 7)))
|
||||
#ifdef DEBUG_DEBUG
|
||||
void debug_init(u32 level);
|
||||
void debug_level_set(u32 level);
|
||||
void _printf debug(u32 level, bool timestamp,
|
||||
u32 indent, const char *src,
|
||||
u32 line, const char *, ...);
|
||||
#else /* DEBUG_DEBUG */
|
||||
static inline void debug_init(_unused u32 level) {}
|
||||
static inline void debug_level_set(_unused u32 level) {}
|
||||
static inline void _printf debug(_unused u32 level, _unused bool timestamp,
|
||||
_unused u32 indent, _unused const char *src,
|
||||
_unused u32 line, const char *, ...) {}
|
||||
#endif /* DEBUG_DEBUG */
|
||||
#undef _unused
|
||||
#undef _printf
|
||||
|
||||
/* format: only printf
|
||||
*/
|
||||
#define log(level, fmt, args...) \
|
||||
debug((level), false, 0, NULL, 0, fmt, ##args)
|
||||
|
||||
/* format : indent, no func name, no timestamp
|
||||
* >>>>val=2
|
||||
*/
|
||||
#define log_i(level, fmt, args...) \
|
||||
debug((level), false, (level), NULL, 0, fmt, ##args)
|
||||
|
||||
/* format : func name, no indent, no timestamp
|
||||
* [foo] val=2
|
||||
*/
|
||||
#define log_f(level, fmt, args...) \
|
||||
debug((level), false, 0, __func__, 0, fmt, ##args)
|
||||
|
||||
/* format : func name, no indent, no timestamp
|
||||
* >>>> [foo:15] val=2
|
||||
*/
|
||||
#define log_if(level, fmt, args...) \
|
||||
debug((level), false, (level), __func__, __LINE__, fmt, ##args)
|
||||
|
||||
/* format : func name, indent, timestamp
|
||||
* >>>>foo:15 val=2
|
||||
*/
|
||||
#define log_it(level, fmt, args...) \
|
||||
debug((level), true, (level), __func__, __LINE__, fmt, ##args)
|
||||
|
||||
/* format: file name, no indent, no timestamp
|
||||
* foo:15 val=2
|
||||
*
|
||||
* #define log_f(level, fmt, args...) \
|
||||
* debug((level), false, 0, __FILE__, __LINE__, fmt, args)
|
||||
*/
|
||||
|
||||
#else
|
||||
#define log(level, fmt, args...)
|
||||
#define log_i(...)
|
||||
#define log_f(...)
|
||||
#define log_if(...)
|
||||
#define log_it(...)
|
||||
#define log_f(...)
|
||||
|
||||
#endif /* DEBUG_H */
|
||||
@@ -4,11 +4,13 @@
|
||||
* Main change is that I don't use READ_ONCE and WRITE_ONCE
|
||||
* See https://www.kernel.org/doc/Documentation/memory-barriers.txt
|
||||
*/
|
||||
|
||||
#ifndef __BR_LIST_H
|
||||
#define __BR_LIST_H
|
||||
|
||||
#include <stddef.h>
|
||||
#include <stdbool.h>
|
||||
#include "rwonce.h"
|
||||
|
||||
/************ originally in <include/linux/types.h> */
|
||||
struct list_head {
|
||||
@@ -23,12 +25,18 @@ struct hlist_node {
|
||||
};
|
||||
|
||||
/************ originally in <include/linux/poison.h> */
|
||||
#define LIST_POISON1 ((void *) 0x100)
|
||||
#define LIST_POISON2 ((void *) 0x122)
|
||||
# define POISON_POINTER_DELTA 0
|
||||
/* These are non-NULL pointers that will result in page faults
|
||||
* under normal circumstances, used to verify that nobody uses
|
||||
* non-initialized list entries.
|
||||
*/
|
||||
#define LIST_POISON1 ((void *) 0x100 + POISON_POINTER_DELTA)
|
||||
#define LIST_POISON2 ((void *) 0x200 + POISON_POINTER_DELTA)
|
||||
|
||||
/************ originally in <include/linux/kernel.h> */
|
||||
#define container_of(ptr, type, member) \
|
||||
((type *)((char *)(ptr) - offsetof(type, member)))
|
||||
#define container_of(ptr, type, member) ({ \
|
||||
void *__mptr = (void *)(ptr); \
|
||||
((type *)(__mptr - offsetof(type, member))); })
|
||||
|
||||
/*
|
||||
* Circular doubly linked list implementation.
|
||||
@@ -54,7 +62,7 @@ struct hlist_node {
|
||||
*/
|
||||
static inline void INIT_LIST_HEAD(struct list_head *list)
|
||||
{
|
||||
list->next = list;
|
||||
WRITE_ONCE(list->next, list);
|
||||
list->prev = list;
|
||||
}
|
||||
|
||||
@@ -71,7 +79,7 @@ static inline void __list_add(struct list_head *new,
|
||||
next->prev = new;
|
||||
new->next = next;
|
||||
new->prev = prev;
|
||||
prev->next = new;
|
||||
WRITE_ONCE(prev->next, new);
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -111,7 +119,7 @@ static inline void list_add_tail(struct list_head *new, struct list_head *head)
|
||||
static inline void __list_del(struct list_head * prev, struct list_head * next)
|
||||
{
|
||||
next->prev = prev;
|
||||
prev->next = next;
|
||||
WRITE_ONCE(prev->next, next);
|
||||
}
|
||||
|
||||
/*
|
||||
@@ -277,7 +285,7 @@ static inline int list_is_last(const struct list_head *list,
|
||||
*/
|
||||
static inline int list_empty(const struct list_head *head)
|
||||
{
|
||||
return head->next == head;
|
||||
return READ_ONCE(head->next) == head;
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -503,7 +511,7 @@ static inline void list_splice_tail_init(struct list_head *list,
|
||||
*/
|
||||
#define list_first_entry_or_null(ptr, type, member) ({ \
|
||||
struct list_head *head__ = (ptr); \
|
||||
struct list_head *pos__ = head__->next; \
|
||||
struct list_head *pos__ = READ_ONCE(head__->next); \
|
||||
pos__ != head__ ? list_entry(pos__, type, member) : NULL; \
|
||||
})
|
||||
|
||||
@@ -779,7 +787,7 @@ static inline int hlist_unhashed(const struct hlist_node *h)
|
||||
*/
|
||||
static inline int hlist_unhashed_lockless(const struct hlist_node *h)
|
||||
{
|
||||
return !h->pprev;
|
||||
return !READ_ONCE(h->pprev);
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -788,7 +796,7 @@ static inline int hlist_unhashed_lockless(const struct hlist_node *h)
|
||||
*/
|
||||
static inline int hlist_empty(const struct hlist_head *h)
|
||||
{
|
||||
return !h->first;
|
||||
return !READ_ONCE(h->first);
|
||||
}
|
||||
|
||||
static inline void __hlist_del(struct hlist_node *n)
|
||||
@@ -796,9 +804,9 @@ static inline void __hlist_del(struct hlist_node *n)
|
||||
struct hlist_node *next = n->next;
|
||||
struct hlist_node **pprev = n->pprev;
|
||||
|
||||
*pprev = next;
|
||||
WRITE_ONCE(*pprev, next);
|
||||
if (next)
|
||||
next->pprev = pprev;
|
||||
WRITE_ONCE(next->pprev, pprev);
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -840,11 +848,11 @@ static inline void hlist_del_init(struct hlist_node *n)
|
||||
static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)
|
||||
{
|
||||
struct hlist_node *first = h->first;
|
||||
n->next = first;
|
||||
WRITE_ONCE(n->next, first);
|
||||
if (first)
|
||||
first->pprev = &n->next;
|
||||
h->first = n;
|
||||
n->pprev = &h->first;
|
||||
WRITE_ONCE(first->pprev, &n->next);
|
||||
WRITE_ONCE(h->first, n);
|
||||
WRITE_ONCE(n->pprev, &h->first);
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -855,10 +863,10 @@ static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)
|
||||
static inline void hlist_add_before(struct hlist_node *n,
|
||||
struct hlist_node *next)
|
||||
{
|
||||
n->pprev = next->pprev;
|
||||
n->next = next;
|
||||
next->pprev = &n->next;
|
||||
*(n->pprev) = n;
|
||||
WRITE_ONCE(n->pprev, next->pprev);
|
||||
WRITE_ONCE(n->next, next);
|
||||
WRITE_ONCE(next->pprev, &n->next);
|
||||
WRITE_ONCE(*(n->pprev), n);
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -869,12 +877,12 @@ static inline void hlist_add_before(struct hlist_node *n,
|
||||
static inline void hlist_add_behind(struct hlist_node *n,
|
||||
struct hlist_node *prev)
|
||||
{
|
||||
n->next = prev->next;
|
||||
prev->next = n;
|
||||
n->pprev = &prev->next;
|
||||
WRITE_ONCE(n->next, prev->next);
|
||||
WRITE_ONCE(prev->next, n);
|
||||
WRITE_ONCE(n->pprev, &prev->next);
|
||||
|
||||
if (n->next)
|
||||
n->next->pprev = &n->next;
|
||||
WRITE_ONCE(n->next->pprev, &n->next);
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -953,7 +961,7 @@ static inline void hlist_move_list(struct hlist_head *old,
|
||||
#define hlist_for_each_entry(pos, head, member) \
|
||||
for (pos = hlist_entry_safe((head)->first, __typeof__(*(pos)), member); \
|
||||
pos; \
|
||||
pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
|
||||
pos = hlist_entry_safe((pos)->member.next, __typeof__(*(pos)), member))
|
||||
|
||||
/**
|
||||
* hlist_for_each_entry_continue - iterate over a hlist continuing after current point
|
||||
@@ -961,9 +969,9 @@ static inline void hlist_move_list(struct hlist_head *old,
|
||||
* @member: the name of the hlist_node within the struct.
|
||||
*/
|
||||
#define hlist_for_each_entry_continue(pos, member) \
|
||||
for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
|
||||
for (pos = hlist_entry_safe((pos)->member.next, __typeof__(*(pos)), member); \
|
||||
pos; \
|
||||
pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
|
||||
pos = hlist_entry_safe((pos)->member.next, __typeof__(*(pos)), member))
|
||||
|
||||
/**
|
||||
* hlist_for_each_entry_from - iterate over a hlist continuing from current point
|
||||
@@ -972,7 +980,7 @@ static inline void hlist_move_list(struct hlist_head *old,
|
||||
*/
|
||||
#define hlist_for_each_entry_from(pos, member) \
|
||||
for (; pos; \
|
||||
pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
|
||||
pos = hlist_entry_safe((pos)->member.next, __typeof__(*(pos)), member))
|
||||
|
||||
/**
|
||||
* hlist_for_each_entry_safe - iterate over list of given type safe against removal of list entry
|
||||
@@ -982,8 +990,8 @@ static inline void hlist_move_list(struct hlist_head *old,
|
||||
* @member: the name of the hlist_node within the struct.
|
||||
*/
|
||||
#define hlist_for_each_entry_safe(pos, n, head, member) \
|
||||
for (pos = hlist_entry_safe((head)->first, typeof(*pos), member); \
|
||||
for (pos = hlist_entry_safe((head)->first, __typeof__(*pos), member); \
|
||||
pos && ({ n = pos->member.next; 1; }); \
|
||||
pos = hlist_entry_safe(n, typeof(*pos), member))
|
||||
pos = hlist_entry_safe(n, __typeof__(*pos), member))
|
||||
|
||||
#endif
|
||||
#endif /* __BR_LIST_H */
|
||||
77
c/include/pool.h
Normal file
77
c/include/pool.h
Normal file
@@ -0,0 +1,77 @@
|
||||
/* pool.h - A simple memory pool manager.
|
||||
*
|
||||
* Copyright (C) 2021 Bruno Raoult ("br")
|
||||
* Licensed under the GNU General Public License v3.0 or later.
|
||||
* Some rights reserved. See COPYING.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with this
|
||||
* program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
*
|
||||
* SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
*
|
||||
*/
|
||||
|
||||
#ifndef POOL_H
|
||||
#define POOL_H
|
||||
|
||||
#include <stdint.h>
|
||||
#include <stddef.h>
|
||||
#include "list.h"
|
||||
#include "bits.h"
|
||||
|
||||
#define POOL_NAME_LENGTH (16) /* max name length including trailing \0 */
|
||||
|
||||
typedef struct {
|
||||
struct list_head list_blocks; /* list of allocated blocks in pool */
|
||||
char data[]; /* objects block */
|
||||
} block_t;
|
||||
|
||||
typedef struct {
|
||||
char name[POOL_NAME_LENGTH]; /* pool name */
|
||||
u32 available; /* current available elements */
|
||||
u32 allocated; /* total objects allocated */
|
||||
u32 growsize; /* number of objects per block allocated */
|
||||
size_t eltsize; /* object size */
|
||||
u32 nblocks; /* number of blocks allocated */
|
||||
struct list_head list_available; /* available nodes */
|
||||
struct list_head list_blocks; /* allocated blocks */
|
||||
} pool_t;
|
||||
|
||||
/**
|
||||
* pool_stats - display some pool statistics
|
||||
* @pool: the pool address.
|
||||
*/
|
||||
void pool_stats(pool_t *pool);
|
||||
|
||||
/**
|
||||
* pool_create - create a new memory pool
|
||||
* @name: the name to give to the pool.
|
||||
* @grow: the number of elements to add when no more available.
|
||||
* @size: the size of an element in pool.
|
||||
*/
|
||||
pool_t *pool_create(const char *name, u32 grow, size_t size);
|
||||
|
||||
/**
|
||||
* pool_get - get an element from a pool
|
||||
* @pool: the pool address.
|
||||
*/
|
||||
void *pool_get(pool_t *pool);
|
||||
|
||||
/**
|
||||
* pool_add - add (release) an element to a pool
|
||||
* @pool: the pool address.
|
||||
* @elt: the address of the object to add to the pool.
|
||||
*/
|
||||
u32 pool_add(pool_t *pool, void *elt);
|
||||
|
||||
/**
|
||||
* pool_destroy - destroy a pool.
|
||||
* @pool: the pool address.
|
||||
*
|
||||
* Attention: All memory is freed, but no check is done whether all pool
|
||||
* elements has been released. Referencing any pool object after this call
|
||||
* is strongly discouraged.
|
||||
*/
|
||||
void pool_destroy(pool_t *pool);
|
||||
|
||||
#endif
|
||||
128
c/include/rwonce.h
Normal file
128
c/include/rwonce.h
Normal file
@@ -0,0 +1,128 @@
|
||||
/* SPDX-License-Identifier: GPL-2.0 */
|
||||
|
||||
/* adaptation of kernel's <asm-generic/rwonce.h>
|
||||
* See https://www.kernel.org/doc/Documentation/memory-barriers.txt
|
||||
*/
|
||||
/*
|
||||
* Prevent the compiler from merging or refetching reads or writes. The
|
||||
* compiler is also forbidden from reordering successive instances of
|
||||
* READ_ONCE and WRITE_ONCE, but only when the compiler is aware of some
|
||||
* particular ordering. One way to make the compiler aware of ordering is to
|
||||
* put the two invocations of READ_ONCE or WRITE_ONCE in different C
|
||||
* statements.
|
||||
*
|
||||
* These two macros will also work on aggregate data types like structs or
|
||||
* unions.
|
||||
*
|
||||
* Their two major use cases are: (1) Mediating communication between
|
||||
* process-level code and irq/NMI handlers, all running on the same CPU,
|
||||
* and (2) Ensuring that the compiler does not fold, spindle, or otherwise
|
||||
* mutilate accesses that either do not require ordering or that interact
|
||||
* with an explicit memory barrier or atomic instruction that provides the
|
||||
* required ordering.
|
||||
*/
|
||||
#ifndef __BR_RWONCE_H
|
||||
#define __BR_RWONCE_H
|
||||
|
||||
/************ originally in <include/linux/compiler_attributes.h> */
|
||||
#if __has_attribute(__error__)
|
||||
# define __compiletime_error(msg) __attribute__((__error__(msg)))
|
||||
#else
|
||||
# define __compiletime_error(msg)
|
||||
#endif
|
||||
|
||||
/************ originally in <include/linux/compiler_types.h> */
|
||||
/*
|
||||
* __unqual_scalar_typeof(x) - Declare an unqualified scalar type, leaving
|
||||
* non-scalar types unchanged.
|
||||
*/
|
||||
/*
|
||||
* Prefer C11 _Generic for better compile-times and simpler code. Note: 'char'
|
||||
* is not type-compatible with 'signed char', and we define a separate case.
|
||||
*/
|
||||
#define __scalar_type_to_expr_cases(type) \
|
||||
unsigned type: (unsigned type)0, \
|
||||
signed type: (signed type)0
|
||||
|
||||
#define __unqual_scalar_typeof(x) \
|
||||
typeof(_Generic((x), \
|
||||
char: (char)0, \
|
||||
__scalar_type_to_expr_cases(char), \
|
||||
__scalar_type_to_expr_cases(short), \
|
||||
__scalar_type_to_expr_cases(int), \
|
||||
__scalar_type_to_expr_cases(long), \
|
||||
__scalar_type_to_expr_cases(long long), \
|
||||
default: (x)))
|
||||
|
||||
/* Is this type a native word size -- useful for atomic operations */
|
||||
#define __native_word(t) \
|
||||
(sizeof(t) == sizeof(char) || sizeof(t) == sizeof(short) || \
|
||||
sizeof(t) == sizeof(int) || sizeof(t) == sizeof(long))
|
||||
|
||||
#ifdef __OPTIMIZE__
|
||||
# define __compiletime_assert(condition, msg, prefix, suffix) \
|
||||
do { \
|
||||
extern void prefix ## suffix(void) __compiletime_error(msg); \
|
||||
if (!(condition)) \
|
||||
prefix ## suffix(); \
|
||||
} while (0)
|
||||
#else
|
||||
# define __compiletime_assert(condition, msg, prefix, suffix) do { } while (0)
|
||||
#endif
|
||||
|
||||
#define _compiletime_assert(condition, msg, prefix, suffix) \
|
||||
__compiletime_assert(condition, msg, prefix, suffix)
|
||||
|
||||
/**
|
||||
* compiletime_assert - break build and emit msg if condition is false
|
||||
* @condition: a compile-time constant condition to check
|
||||
* @msg: a message to emit if condition is false
|
||||
*
|
||||
* In tradition of POSIX assert, this macro will break the build if the
|
||||
* supplied condition is *false*, emitting the supplied error message if the
|
||||
* compiler has support to do so.
|
||||
*/
|
||||
#define compiletime_assert(condition, msg) \
|
||||
_compiletime_assert(condition, msg, __compiletime_assert_, __COUNTER__)
|
||||
|
||||
#define compiletime_assert_atomic_type(t) \
|
||||
compiletime_assert(__native_word(t), \
|
||||
"Need native word sized stores/loads for atomicity.")
|
||||
|
||||
/************ originally in <asm-generic/rwonce.h> */
|
||||
/*
|
||||
* Yes, this permits 64-bit accesses on 32-bit architectures. These will
|
||||
* actually be atomic in some cases (namely Armv7 + LPAE), but for others we
|
||||
* rely on the access being split into 2x32-bit accesses for a 32-bit quantity
|
||||
* (e.g. a virtual address) and a strong prevailing wind.
|
||||
*/
|
||||
#define compiletime_assert_rwonce_type(t) \
|
||||
compiletime_assert(__native_word(t) || sizeof(t) == sizeof(long long), \
|
||||
"Unsupported access size for {READ,WRITE}_ONCE().")
|
||||
|
||||
/*
|
||||
* Use __READ_ONCE() instead of READ_ONCE() if you do not require any
|
||||
* atomicity. Note that this may result in tears!
|
||||
*/
|
||||
#ifndef __READ_ONCE
|
||||
#define __READ_ONCE(x) (*(const volatile __unqual_scalar_typeof(x) *)&(x))
|
||||
#endif
|
||||
|
||||
#define READ_ONCE(x) \
|
||||
({ \
|
||||
compiletime_assert_rwonce_type(x); \
|
||||
__READ_ONCE(x); \
|
||||
})
|
||||
|
||||
#define __WRITE_ONCE(x, val) \
|
||||
do { \
|
||||
*(volatile typeof(x) *)&(x) = (val); \
|
||||
} while (0)
|
||||
|
||||
#define WRITE_ONCE(x, val) \
|
||||
do { \
|
||||
compiletime_assert_rwonce_type(x); \
|
||||
__WRITE_ONCE(x, val); \
|
||||
} while (0)
|
||||
|
||||
#endif /* __BR_RWONCE_H */
|
||||
225
c/pool.c
Normal file
225
c/pool.c
Normal file
@@ -0,0 +1,225 @@
|
||||
/* pool.c - A simple pool manager.
|
||||
*
|
||||
* Copyright (C) 2021 Bruno Raoult ("br")
|
||||
* Licensed under the GNU General Public License v3.0 or later.
|
||||
* Some rights reserved. See COPYING.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with this
|
||||
* program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
*
|
||||
* SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stddef.h>
|
||||
#include <malloc.h>
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <errno.h>
|
||||
|
||||
#include "list.h"
|
||||
#include "pool.h"
|
||||
#include "debug.h"
|
||||
#include "bits.h"
|
||||
|
||||
void pool_stats(pool_t *pool)
|
||||
{
|
||||
if (pool) {
|
||||
# ifdef DEBUG_POOL
|
||||
block_t *block;
|
||||
|
||||
log_f(1, "[%s] pool [%p]: blocks:%u avail:%u alloc:%u grow:%u eltsize:%lu\n",
|
||||
pool->name, (void *)pool, pool->nblocks, pool->available, pool->allocated,
|
||||
pool->growsize, pool->eltsize);
|
||||
log(5, "\tblocks: ");
|
||||
list_for_each_entry(block, &pool->list_blocks, list_blocks) {
|
||||
log(5, "%p ", block);
|
||||
}
|
||||
log(5, "\n");
|
||||
# endif
|
||||
}
|
||||
}
|
||||
|
||||
pool_t *pool_create(const char *name, u32 growsize, size_t eltsize)
|
||||
{
|
||||
pool_t *pool;
|
||||
|
||||
# ifdef DEBUG_POOL
|
||||
log_f(1, "name=[%s] growsize=%u eltsize=%lu\n",
|
||||
name, growsize, eltsize);
|
||||
# endif
|
||||
/* we need at least sizeof(struct list_head) space in pool elements
|
||||
*/
|
||||
if (eltsize < sizeof (struct list_head)) {
|
||||
# ifdef DEBUG_POOL
|
||||
log_f(1, "[%s]: structure size too small (%lu < %lu), adjusting to %lu.\n",
|
||||
name, eltsize, sizeof(struct list_head), sizeof(struct list_head));
|
||||
# endif
|
||||
eltsize = sizeof(struct list_head);
|
||||
}
|
||||
if ((pool = malloc(sizeof (*pool)))) {
|
||||
strncpy(pool->name, name, POOL_NAME_LENGTH - 1);
|
||||
pool->name[POOL_NAME_LENGTH - 1] = 0;
|
||||
pool->growsize = growsize;
|
||||
pool->eltsize = eltsize;
|
||||
pool->available = 0;
|
||||
pool->allocated = 0;
|
||||
pool->nblocks = 0;
|
||||
INIT_LIST_HEAD(&pool->list_available);
|
||||
INIT_LIST_HEAD(&pool->list_blocks);
|
||||
}
|
||||
return pool;
|
||||
}
|
||||
|
||||
static u32 _pool_add(pool_t *pool, struct list_head *elt)
|
||||
{
|
||||
# ifdef DEBUG_POOL
|
||||
log_f(6, "pool=%p &head=%p elt=%p off1=%lu off2=%lu\n",
|
||||
(void *)pool,
|
||||
(void *)&pool->list_available,
|
||||
(void *)elt,
|
||||
(void *)&pool->list_available-(void *)pool,
|
||||
offsetof(pool_t, list_available));
|
||||
# endif
|
||||
|
||||
list_add(elt, &pool->list_available);
|
||||
return ++pool->available;
|
||||
}
|
||||
|
||||
u32 pool_add(pool_t *pool, void *elt)
|
||||
{
|
||||
return _pool_add(pool, elt);
|
||||
}
|
||||
|
||||
static struct list_head *_pool_get(pool_t *pool)
|
||||
{
|
||||
struct list_head *res = pool->list_available.next;
|
||||
pool->available--;
|
||||
list_del(res);
|
||||
return res;
|
||||
}
|
||||
|
||||
void *pool_get(pool_t *pool)
|
||||
{
|
||||
if (!pool)
|
||||
return NULL;
|
||||
if (!pool->available) {
|
||||
block_t *block = malloc(sizeof(block_t) + pool->eltsize * pool->growsize);
|
||||
void *cur;
|
||||
u32 i;
|
||||
|
||||
if (!block) {
|
||||
# ifdef DEBUG_POOL
|
||||
log_f(1, "[%s]: failed block allocation\n", pool->name);
|
||||
# endif
|
||||
errno = ENOMEM;
|
||||
return NULL;
|
||||
}
|
||||
|
||||
/* maintain list of allocated blocks
|
||||
*/
|
||||
list_add(&block->list_blocks, &pool->list_blocks);
|
||||
pool->nblocks++;
|
||||
|
||||
# ifdef DEBUG_POOL
|
||||
log_f(1, "[%s]: growing pool from %u to %u elements. block=%p nblocks=%u\n",
|
||||
pool->name,
|
||||
pool->allocated,
|
||||
pool->allocated + pool->growsize,
|
||||
block,
|
||||
pool->nblocks);
|
||||
# endif
|
||||
|
||||
pool->allocated += pool->growsize;
|
||||
for (i = 0; i < pool->growsize; ++i) {
|
||||
cur = block->data + i * pool->eltsize;
|
||||
# ifdef DEBUG_POOL
|
||||
log_f(7, "alloc=%p cur=%p\n", block, cur);
|
||||
# endif
|
||||
_pool_add(pool, (struct list_head *)cur);
|
||||
}
|
||||
//pool_stats(pool);
|
||||
}
|
||||
/* this is the effective address if the object (and also the
|
||||
* pool list_head address)
|
||||
*/
|
||||
return _pool_get(pool);
|
||||
}
|
||||
|
||||
void pool_destroy(pool_t *pool)
|
||||
{
|
||||
block_t *block, *tmp;
|
||||
if (!pool)
|
||||
return;
|
||||
/* release memory blocks */
|
||||
# ifdef DEBUG_POOL
|
||||
log_f(1, "[%s]: releasing %d blocks and main structure\n", pool->name, pool->nblocks);
|
||||
log(5, "blocks:");
|
||||
# endif
|
||||
list_for_each_entry_safe(block, tmp, &pool->list_blocks, list_blocks) {
|
||||
list_del(&block->list_blocks);
|
||||
free(block);
|
||||
# ifdef DEBUG_POOL
|
||||
log(5, " %p", block);
|
||||
# endif
|
||||
}
|
||||
# ifdef DEBUG_POOL
|
||||
log(5, "\n");
|
||||
# endif
|
||||
free(pool);
|
||||
}
|
||||
|
||||
#ifdef BIN_pool
|
||||
struct d {
|
||||
u16 data1;
|
||||
char c;
|
||||
struct list_head list;
|
||||
};
|
||||
|
||||
static LIST_HEAD (head);
|
||||
|
||||
int main(int ac, char**av)
|
||||
{
|
||||
pool_t *pool;
|
||||
int total;
|
||||
int action=0;
|
||||
u16 icur=0;
|
||||
char ccur='z';
|
||||
struct d *elt;
|
||||
|
||||
debug_init(3);
|
||||
log_f(1, "%s: sizeof(d)=%lu sizeof(*d)=%lu off=%lu\n", *av, sizeof(elt),
|
||||
sizeof(*elt), offsetof(struct d, list));
|
||||
|
||||
if ((pool = pool_create("dummy", 3, sizeof(*elt)))) {
|
||||
pool_stats(pool);
|
||||
for (int cur=1; cur<ac; ++cur) {
|
||||
total = atoi(av[cur]);
|
||||
if (action == 0) { /* add elt to list */
|
||||
log_f(2, "adding %d elements\n", total);
|
||||
for (int i = 0; i < total; ++i) {
|
||||
elt = pool_get(pool);
|
||||
elt->data1 = icur++;
|
||||
elt->c = ccur--;
|
||||
list_add(&elt->list, &head);
|
||||
}
|
||||
pool_stats(pool);
|
||||
action = 1;
|
||||
} else { /* remove one elt from list */
|
||||
log_f(2, "deleting %d elements\n", total);
|
||||
for (int i = 0; i < total; ++i) {
|
||||
if (!list_empty(&head)) {
|
||||
elt = list_last_entry(&head, struct d, list);
|
||||
printf("elt=[%d, %c]\n", elt->data1, elt->c);
|
||||
list_del(&elt->list);
|
||||
pool_add(pool, elt);
|
||||
}
|
||||
}
|
||||
pool_stats(pool);
|
||||
action = 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
pool_stats(pool);
|
||||
}
|
||||
#endif
|
||||
Reference in New Issue
Block a user