3 # Copyright (C) 2009 Red Hat, Inc.
5 # This program is free software; you can redistribute it and/or modify
6 # it under the terms of the GNU General Public License as published by
7 # the Free Software Foundation; either version 2 of the License, or
8 # (at your option) any later version.
10 # This program is distributed in the hope that it will be useful,
11 # but WITHOUT ANY WARRANTY; without even the implied warranty of
12 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 # GNU General Public License for more details.
15 # You should have received a copy of the GNU General Public License
16 # along with this program; if not, write to the Free Software
17 # Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
21 function do_is_allocated
() {
23 local size
=$
(( $2 / 512))
27 for i
in `seq 1 $count`; do
28 echo alloc $
(( start
+ i
* step
)) $size
32 function is_allocated
() {
33 do_is_allocated
"$@" |
$QEMU_IO $TEST_IMG | _filter_qemu_io
44 echo === IO
: pattern
$pattern >&2
45 for i
in `seq 1 $count`; do
46 echo $op -P $pattern $
(( start
+ i
* step
)) $size
50 function io_pattern
() {
51 do_io $@ |
$QEMU_IO $TEST_IMG | _filter_qemu_io
56 local pattern
=$
(( (start
>> 9) % 256 ))
58 do_io $@
$pattern |
$QEMU_IO $TEST_IMG | _filter_qemu_io
62 do_io $@
0 |
$QEMU_IO $TEST_IMG | _filter_qemu_io
69 # Complete clusters (size = 4k)
70 io
$op $offset 4096 4096 256
71 offset
=$
((offset
+ 256 * 4096))
73 # From somewhere in the middle to the end of a cluster
74 io
$op $
((offset
+ 2048)) 2048 4096 256
75 offset
=$
((offset
+ 256 * 4096))
77 # From the start to somewhere in the middle of a cluster
78 io
$op $offset 2048 4096 256
79 offset
=$
((offset
+ 256 * 4096))
81 # Completely misaligned (and small)
82 io
$op $
((offset
+ 1024)) 2048 4096 256
83 offset
=$
((offset
+ 256 * 4096))
85 # Spanning multiple clusters
86 io
$op $
((offset
+ 2048)) 8192 12288 64
87 offset
=$
((offset
+ 64 * 12288))
89 # Spanning multiple L2 tables
90 # L2 table size: 512 clusters of 4k = 2M
91 io
$op $
((offset
+ 2048)) 4194304 4999680 8
92 offset
=$
((offset
+ 8 * 4999680))
102 # Pattern (repeat after 9 clusters):
103 # used - used - free - used - compressed - compressed - free - free - compressed
105 # Write the clusters to be compressed
106 echo === Clusters to be compressed
[1]
107 io_pattern writev $
((offset
+ 4 * 4096)) 4096 $
((9 * 4096)) 256 165
108 echo === Clusters to be compressed
[2]
109 io_pattern writev $
((offset
+ 5 * 4096)) 4096 $
((9 * 4096)) 256 165
110 echo === Clusters to be compressed
[3]
111 io_pattern writev $
((offset
+ 8 * 4096)) 4096 $
((9 * 4096)) 256 165
113 mv $TEST_IMG $TEST_IMG.orig
114 $QEMU_IMG convert
-f $IMGFMT -O $IMGFMT -c $TEST_IMG.orig
$TEST_IMG
116 # Write the used clusters
117 echo === Used clusters
[1]
118 io_pattern writev $
((offset
+ 0 * 4096)) 4096 $
((9 * 4096)) 256 165
119 echo === Used clusters
[2]
120 io_pattern writev $
((offset
+ 1 * 4096)) 4096 $
((9 * 4096)) 256 165
121 echo === Used clusters
[3]
122 io_pattern writev $
((offset
+ 3 * 4096)) 4096 $
((9 * 4096)) 256 165
125 echo === Read used
/compressed clusters
126 io_pattern readv $
((offset
+ 0 * 4096)) $
((2 * 4096)) $
((9 * 4096)) 256 165
127 io_pattern readv $
((offset
+ 3 * 4096)) $
((3 * 4096)) $
((9 * 4096)) 256 165
128 io_pattern readv $
((offset
+ 8 * 4096)) $
((1 * 4096)) $
((9 * 4096)) 256 165
131 io_zero readv $
((offset
+ 2 * 4096)) $
((1 * 4096)) $
((9 * 4096)) 256
132 io_zero readv $
((offset
+ 6 * 4096)) $
((2 * 4096)) $
((9 * 4096)) 256