2017-01-16 14:42:25 +02:00
|
|
|
#! /bin/bash
|
|
|
|
|
# FS QA Test 021
|
|
|
|
|
#
|
|
|
|
|
# Test concurrent copy up
|
|
|
|
|
#
|
|
|
|
|
#-----------------------------------------------------------------------
|
|
|
|
|
# Copyright (C) 2016 CTERA Networks. All Rights Reserved.
|
|
|
|
|
# Author: Amir Goldstein <amir73il@gmail.com>
|
|
|
|
|
#
|
|
|
|
|
# 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.
|
|
|
|
|
#
|
|
|
|
|
# This program is distributed in the hope that it would be useful,
|
|
|
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
# GNU General Public License for more details.
|
|
|
|
|
#
|
|
|
|
|
# You should have received a copy of the GNU General Public License
|
|
|
|
|
# along with this program; if not, write the Free Software Foundation,
|
|
|
|
|
# Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
|
#-----------------------------------------------------------------------
|
|
|
|
|
#
|
|
|
|
|
|
|
|
|
|
seq=`basename $0`
|
|
|
|
|
seqres=$RESULT_DIR/$seq
|
|
|
|
|
echo "QA output created by $seq"
|
|
|
|
|
|
|
|
|
|
here=`pwd`
|
|
|
|
|
tmp=/tmp/$$
|
|
|
|
|
status=1 # failure is the default!
|
|
|
|
|
trap "_cleanup; exit \$status" 0 1 2 3 15
|
|
|
|
|
|
|
|
|
|
_cleanup()
|
|
|
|
|
{
|
|
|
|
|
cd /
|
|
|
|
|
rm -f $tmp.*
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
# get standard environment, filters and checks
|
|
|
|
|
. ./common/rc
|
|
|
|
|
. ./common/filter
|
|
|
|
|
|
|
|
|
|
# remove previous $seqres.full before test
|
|
|
|
|
rm -f $seqres.full
|
|
|
|
|
|
|
|
|
|
# real QA test starts here
|
|
|
|
|
_supported_fs overlay
|
|
|
|
|
_supported_os Linux
|
|
|
|
|
_require_scratch
|
|
|
|
|
|
|
|
|
|
# Remove all files from previous tests
|
|
|
|
|
_scratch_mkfs
|
|
|
|
|
|
|
|
|
|
# overlay copy_up doesn't deal with sparse file well, holes will be filled by
|
|
|
|
|
# zeros, so for the worst case of hitting all the copy up bomb files, we need
|
|
|
|
|
# (64*(16+32+64+128)M) free space on $SCRATCH_DEV.
|
|
|
|
|
# However, triggering more than a total of 16 copy up bombs would require
|
|
|
|
|
# really fast data copy (clone up doesn't take up space at all), so let's be
|
|
|
|
|
# conservative and reserve space for 16 data copy ups per directory.
|
|
|
|
|
_require_fs_space $SCRATCH_DEV $((16*(16+32+64+128)*1024))
|
|
|
|
|
|
2017-02-28 14:18:34 +02:00
|
|
|
lowerdir=$SCRATCH_DEV/$OVL_LOWER
|
2017-01-16 14:42:25 +02:00
|
|
|
mkdir -p $lowerdir
|
|
|
|
|
|
|
|
|
|
testdir=arena
|
|
|
|
|
d_low=$lowerdir/$testdir
|
|
|
|
|
mkdir -p $d_low
|
|
|
|
|
|
|
|
|
|
# Create 4K empty files in 4 directories
|
|
|
|
|
echo $FSSTRESS_PROG -d $d_low -p 4 -z -f creat=1 -n 1024 -v >> $seqres.full
|
|
|
|
|
$FSSTRESS_PROG -d $d_low -p 4 -z -f creat=1 -n 1024 -v >> $seqres.full 2>&1
|
|
|
|
|
echo "--------------------------------------" >> $seqres.full
|
|
|
|
|
echo "Created 1K files in lower directory. " >> $seqres.full
|
|
|
|
|
|
|
|
|
|
# Plant 64 copy up bombs in each directory
|
|
|
|
|
for f in $d_low/p0/*0; do $XFS_IO_PROG -c "truncate 128m" $f ;done
|
|
|
|
|
for f in $d_low/p1/*4; do $XFS_IO_PROG -c "truncate 64m" $f ;done
|
|
|
|
|
for f in $d_low/p2/*8; do $XFS_IO_PROG -c "truncate 32m" $f ;done
|
|
|
|
|
for f in $d_low/p3/*b; do $XFS_IO_PROG -c "truncate 16m" $f ;done
|
|
|
|
|
echo "Created 64*4 copy up bombs. " >> $seqres.full
|
|
|
|
|
echo "--------------------------------------" >> $seqres.full
|
|
|
|
|
|
|
|
|
|
_scratch_mount
|
|
|
|
|
|
|
|
|
|
d_top=$SCRATCH_MNT/$testdir
|
|
|
|
|
|
|
|
|
|
#
|
|
|
|
|
# Run 2 process teams - 4 pairs of rival processes
|
|
|
|
|
# Each process pair competing on copy up of 1K files in 1 directory.
|
|
|
|
|
# Team 'touch' players touch all files in readdir order.
|
|
|
|
|
# Team 'truncate' players truncates all files in numeric (name) order.
|
|
|
|
|
#
|
|
|
|
|
# If player from team 'touch' reaches a copy up bomb before player
|
|
|
|
|
# from team 'truncate' does, the copy up of (sparse) data will delay
|
|
|
|
|
# the end of the process pair match.
|
|
|
|
|
#
|
|
|
|
|
# If copy up of bomb is not concurrent with other copy ups, then
|
|
|
|
|
# 'touch' player p0 with the largest copy up bombs will delay players
|
|
|
|
|
# of both teams and all matches will take longer.
|
|
|
|
|
#
|
|
|
|
|
# If copy up is concurrent with copy ups in different directories,
|
|
|
|
|
# process pair 3 match will be over first and process pair 0 match
|
|
|
|
|
# will be over last.
|
|
|
|
|
#
|
|
|
|
|
# If copy up of data is concurrent with other copy ups on the same directory,
|
|
|
|
|
# then all the 'touch' team players will finish far behind their 'truncate'
|
|
|
|
|
# opponenets.
|
|
|
|
|
#
|
|
|
|
|
# This test doesn't verify any of those conditions, it will only fail
|
|
|
|
|
# on unexpected errors of any of the touch/truncate operations.
|
|
|
|
|
# The test full output should demonstrate the expected game results,
|
|
|
|
|
# as described above and depending on concurrent copy up support in kernel.
|
|
|
|
|
#
|
|
|
|
|
cd $d_top
|
|
|
|
|
echo "--------------------------------------" >> $seqres.full
|
|
|
|
|
echo "Go team touch!! " >> $seqres.full
|
|
|
|
|
find p0 -type f -print -exec touch {} \; >> $seqres.full &
|
|
|
|
|
find p1 -type f -print -exec touch {} \; >> $seqres.full &
|
|
|
|
|
find p2 -type f -print -exec touch {} \; >> $seqres.full &
|
|
|
|
|
find p3 -type f -print -exec touch {} \; >> $seqres.full &
|
|
|
|
|
cd - > /dev/null
|
|
|
|
|
|
|
|
|
|
echo "--------------------------------------" >> $seqres.full
|
|
|
|
|
echo "Go team truncate!! " >> $seqres.full
|
|
|
|
|
# Give team 'touch' a 1 second head start.
|
|
|
|
|
# Team 'truncate' players should catch up after few copy up bombs.
|
|
|
|
|
sleep 1
|
|
|
|
|
$FSSTRESS_PROG -d $d_top -p 4 -z -f creat=1 -n 1024 -v >> $seqres.full &
|
|
|
|
|
|
|
|
|
|
wait %1 %2 %3 %4 %5
|
|
|
|
|
|
|
|
|
|
echo "Silence is golden"
|
|
|
|
|
status=0
|
|
|
|
|
exit
|