1 | The following changes since commit 248b23735645f7cbb503d9be6f5bf825f2a603ab: | 1 | The following changes since commit ba29883206d92a29ad5a466e679ccfc2ee6132ef: |
---|---|---|---|
2 | 2 | ||
3 | Update version for v2.10.0-rc4 release (2017-08-24 17:34:26 +0100) | 3 | Merge remote-tracking branch 'remotes/borntraeger/tags/s390x-20200310' into staging (2020-03-10 16:50:28 +0000) |
4 | 4 | ||
5 | are available in the git repository at: | 5 | are available in the Git repository at: |
6 | 6 | ||
7 | git://github.com/stefanha/qemu.git tags/block-pull-request | 7 | https://github.com/XanClic/qemu.git tags/pull-block-2020-03-11 |
8 | 8 | ||
9 | for you to fetch changes up to 3e4c705212abfe8c9882a00beb2d1466a8a53cec: | 9 | for you to fetch changes up to 397f4e9d83e9c0000905f0a988ba1aeda162571c: |
10 | 10 | ||
11 | qcow2: allocate cluster_cache/cluster_data on demand (2017-08-30 18:02:10 +0100) | 11 | block/block-copy: hide structure definitions (2020-03-11 12:42:30 +0100) |
12 | 12 | ||
13 | ---------------------------------------------------------------- | 13 | ---------------------------------------------------------------- |
14 | Block patches for the 5.0 softfreeze: | ||
15 | - qemu-img measure for LUKS | ||
16 | - Improve block-copy's performance by reducing inter-request | ||
17 | dependencies | ||
18 | - Make curl's detection of accept-ranges more robust | ||
19 | - Memleak fixes | ||
20 | - iotest fix | ||
14 | 21 | ||
15 | ---------------------------------------------------------------- | 22 | ---------------------------------------------------------------- |
23 | David Edmondson (2): | ||
24 | block/curl: HTTP header fields allow whitespace around values | ||
25 | block/curl: HTTP header field names are case insensitive | ||
16 | 26 | ||
17 | Alberto Garcia (8): | 27 | Eric Blake (1): |
18 | throttle: Fix wrong variable name in the header documentation | 28 | iotests: Fix nonportable use of od --endian |
19 | throttle: Update the throttle_fix_bucket() documentation | ||
20 | throttle: Make throttle_is_valid() a bit less verbose | ||
21 | throttle: Remove throttle_fix_bucket() / throttle_unfix_bucket() | ||
22 | throttle: Make LeakyBucket.avg and LeakyBucket.max integer types | ||
23 | throttle: Make burst_length 64bit and add range checks | ||
24 | throttle: Test the valid range of config values | ||
25 | misc: Remove unused Error variables | ||
26 | 29 | ||
27 | Dan Aloni (1): | 30 | Pan Nengyuan (2): |
28 | nvme: Fix get/set number of queues feature, again | 31 | block/qcow2: do free crypto_opts in qcow2_close() |
29 | 32 | qemu-img: free memory before re-assign | |
30 | Eduardo Habkost (1): | ||
31 | oslib-posix: Print errors before aborting on qemu_alloc_stack() | ||
32 | |||
33 | Fred Rolland (1): | ||
34 | qemu-doc: Add UUID support in initiator name | ||
35 | 33 | ||
36 | Stefan Hajnoczi (4): | 34 | Stefan Hajnoczi (4): |
37 | scripts: add argparse module for Python 2.6 compatibility | 35 | luks: extract qcrypto_block_calculate_payload_offset() |
38 | docker.py: Python 2.6 argparse compatibility | 36 | luks: implement .bdrv_measure() |
39 | tests: migration/guestperf Python 2.6 argparse compatibility | 37 | qemu-img: allow qemu-img measure --object without a filename |
40 | qcow2: allocate cluster_cache/cluster_data on demand | 38 | iotests: add 288 luks qemu-img measure test |
41 | 39 | ||
42 | include/qemu/throttle.h | 8 +- | 40 | Vladimir Sementsov-Ogievskiy (10): |
43 | block/qcow.c | 12 +- | 41 | block/qcow2-threads: fix qcow2_decompress |
44 | block/qcow2-cluster.c | 17 + | 42 | job: refactor progress to separate object |
45 | block/qcow2.c | 20 +- | 43 | block/block-copy: fix progress calculation |
46 | dump.c | 4 +- | 44 | block/block-copy: specialcase first copy_range request |
47 | hw/block/nvme.c | 4 +- | 45 | block/block-copy: use block_status |
48 | tests/test-throttle.c | 80 +- | 46 | block/block-copy: factor out find_conflicting_inflight_req |
49 | util/oslib-posix.c | 2 + | 47 | block/block-copy: refactor interfaces to use bytes instead of end |
50 | util/throttle.c | 86 +- | 48 | block/block-copy: rename start to offset in interfaces |
51 | COPYING.PYTHON | 270 ++++ | 49 | block/block-copy: reduce intersecting request lock |
52 | qemu-doc.texi | 5 +- | 50 | block/block-copy: hide structure definitions |
53 | scripts/argparse.py | 2406 ++++++++++++++++++++++++++++++++++++ | 51 | |
54 | tests/docker/docker.py | 4 +- | 52 | block/backup-top.c | 6 +- |
55 | tests/migration/guestperf/shell.py | 8 +- | 53 | block/backup.c | 38 ++- |
56 | 14 files changed, 2831 insertions(+), 95 deletions(-) | 54 | block/block-copy.c | 405 ++++++++++++++++++++++++------- |
57 | create mode 100644 COPYING.PYTHON | 55 | block/crypto.c | 62 +++++ |
58 | create mode 100644 scripts/argparse.py | 56 | block/curl.c | 32 ++- |
57 | block/qcow2-threads.c | 12 +- | ||
58 | block/qcow2.c | 75 ++---- | ||
59 | block/trace-events | 1 + | ||
60 | blockjob.c | 16 +- | ||
61 | crypto/block.c | 36 +++ | ||
62 | include/block/block-copy.h | 65 +---- | ||
63 | include/crypto/block.h | 22 ++ | ||
64 | include/qemu/job.h | 11 +- | ||
65 | include/qemu/progress_meter.h | 58 +++++ | ||
66 | job-qmp.c | 4 +- | ||
67 | job.c | 6 +- | ||
68 | qemu-img.c | 14 +- | ||
69 | tests/qemu-iotests/178 | 2 +- | ||
70 | tests/qemu-iotests/178.out.qcow2 | 8 +- | ||
71 | tests/qemu-iotests/178.out.raw | 8 +- | ||
72 | tests/qemu-iotests/288 | 93 +++++++ | ||
73 | tests/qemu-iotests/288.out | 30 +++ | ||
74 | tests/qemu-iotests/common.rc | 22 +- | ||
75 | tests/qemu-iotests/group | 1 + | ||
76 | 24 files changed, 749 insertions(+), 278 deletions(-) | ||
77 | create mode 100644 include/qemu/progress_meter.h | ||
78 | create mode 100755 tests/qemu-iotests/288 | ||
79 | create mode 100644 tests/qemu-iotests/288.out | ||
59 | 80 | ||
60 | -- | 81 | -- |
61 | 2.13.5 | 82 | 2.24.1 |
62 | 83 | ||
63 | 84 | diff view generated by jsdifflib |
1 | Most qcow2 files are uncompressed so it is wasteful to allocate (32 + 1) | 1 | From: Stefan Hajnoczi <stefanha@redhat.com> |
---|---|---|---|
2 | * cluster_size + 512 bytes upfront. Allocate s->cluster_cache and | 2 | |
3 | s->cluster_data when the first read operation is performance on a | 3 | The qcow2 .bdrv_measure() code calculates the crypto payload offset. |
4 | compressed cluster. | 4 | This logic really belongs in crypto/block.c where it can be reused by |
5 | 5 | other image formats. | |
6 | The buffers are freed in .bdrv_close(). .bdrv_open() no longer has any | 6 | |
7 | code paths that can allocate these buffers, so remove the free functions | 7 | The "luks" block driver will need this same logic in order to implement |
8 | in the error code path. | 8 | .bdrv_measure(), so extract the qcrypto_block_calculate_payload_offset() |
9 | 9 | function now. | |
10 | This patch can result in significant memory savings when many qcow2 | 10 | |
11 | disks are attached or backing file chains are long: | ||
12 | |||
13 | Before 12.81% (1,023,193,088B) | ||
14 | After 5.36% (393,893,888B) | ||
15 | |||
16 | Reported-by: Alexey Kardashevskiy <aik@ozlabs.ru> | ||
17 | Tested-by: Alexey Kardashevskiy <aik@ozlabs.ru> | ||
18 | Reviewed-by: Eric Blake <eblake@redhat.com> | ||
19 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 11 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> |
20 | Message-id: 20170821135530.32344-1-stefanha@redhat.com | 12 | Reviewed-by: Max Reitz <mreitz@redhat.com> |
21 | Cc: Kevin Wolf <kwolf@redhat.com> | 13 | Message-Id: <20200221112522.1497712-2-stefanha@redhat.com> |
22 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 14 | Signed-off-by: Max Reitz <mreitz@redhat.com> |
23 | --- | 15 | --- |
24 | block/qcow2-cluster.c | 17 +++++++++++++++++ | 16 | block/qcow2.c | 74 +++++++++++------------------------------- |
25 | block/qcow2.c | 12 ------------ | 17 | crypto/block.c | 36 ++++++++++++++++++++ |
26 | 2 files changed, 17 insertions(+), 12 deletions(-) | 18 | include/crypto/block.h | 22 +++++++++++++ |
27 | 19 | 3 files changed, 77 insertions(+), 55 deletions(-) | |
28 | diff --git a/block/qcow2-cluster.c b/block/qcow2-cluster.c | 20 | |
29 | index XXXXXXX..XXXXXXX 100644 | ||
30 | --- a/block/qcow2-cluster.c | ||
31 | +++ b/block/qcow2-cluster.c | ||
32 | @@ -XXX,XX +XXX,XX @@ int qcow2_decompress_cluster(BlockDriverState *bs, uint64_t cluster_offset) | ||
33 | nb_csectors = ((cluster_offset >> s->csize_shift) & s->csize_mask) + 1; | ||
34 | sector_offset = coffset & 511; | ||
35 | csize = nb_csectors * 512 - sector_offset; | ||
36 | + | ||
37 | + /* Allocate buffers on first decompress operation, most images are | ||
38 | + * uncompressed and the memory overhead can be avoided. The buffers | ||
39 | + * are freed in .bdrv_close(). | ||
40 | + */ | ||
41 | + if (!s->cluster_data) { | ||
42 | + /* one more sector for decompressed data alignment */ | ||
43 | + s->cluster_data = qemu_try_blockalign(bs->file->bs, | ||
44 | + QCOW_MAX_CRYPT_CLUSTERS * s->cluster_size + 512); | ||
45 | + if (!s->cluster_data) { | ||
46 | + return -ENOMEM; | ||
47 | + } | ||
48 | + } | ||
49 | + if (!s->cluster_cache) { | ||
50 | + s->cluster_cache = g_malloc(s->cluster_size); | ||
51 | + } | ||
52 | + | ||
53 | BLKDBG_EVENT(bs->file, BLKDBG_READ_COMPRESSED); | ||
54 | ret = bdrv_read(bs->file, coffset >> 9, s->cluster_data, | ||
55 | nb_csectors); | ||
56 | diff --git a/block/qcow2.c b/block/qcow2.c | 21 | diff --git a/block/qcow2.c b/block/qcow2.c |
57 | index XXXXXXX..XXXXXXX 100644 | 22 | index XXXXXXX..XXXXXXX 100644 |
58 | --- a/block/qcow2.c | 23 | --- a/block/qcow2.c |
59 | +++ b/block/qcow2.c | 24 | +++ b/block/qcow2.c |
60 | @@ -XXX,XX +XXX,XX @@ static int qcow2_do_open(BlockDriverState *bs, QDict *options, int flags, | 25 | @@ -XXX,XX +XXX,XX @@ static coroutine_fn int qcow2_co_flush_to_os(BlockDriverState *bs) |
61 | goto fail; | 26 | return ret; |
62 | } | 27 | } |
63 | 28 | ||
64 | - s->cluster_cache = g_malloc(s->cluster_size); | 29 | -static ssize_t qcow2_measure_crypto_hdr_init_func(QCryptoBlock *block, |
65 | - /* one more sector for decompressed data alignment */ | 30 | - size_t headerlen, void *opaque, Error **errp) |
66 | - s->cluster_data = qemu_try_blockalign(bs->file->bs, QCOW_MAX_CRYPT_CLUSTERS | 31 | -{ |
67 | - * s->cluster_size + 512); | 32 | - size_t *headerlenp = opaque; |
68 | - if (s->cluster_data == NULL) { | 33 | - |
69 | - error_setg(errp, "Could not allocate temporary cluster buffer"); | 34 | - /* Stash away the payload size */ |
70 | - ret = -ENOMEM; | 35 | - *headerlenp = headerlen; |
71 | - goto fail; | 36 | - return 0; |
37 | -} | ||
38 | - | ||
39 | -static ssize_t qcow2_measure_crypto_hdr_write_func(QCryptoBlock *block, | ||
40 | - size_t offset, const uint8_t *buf, size_t buflen, | ||
41 | - void *opaque, Error **errp) | ||
42 | -{ | ||
43 | - /* Discard the bytes, we're not actually writing to an image */ | ||
44 | - return buflen; | ||
45 | -} | ||
46 | - | ||
47 | -/* Determine the number of bytes for the LUKS payload */ | ||
48 | -static bool qcow2_measure_luks_headerlen(QemuOpts *opts, size_t *len, | ||
49 | - Error **errp) | ||
50 | -{ | ||
51 | - QDict *opts_qdict; | ||
52 | - QDict *cryptoopts_qdict; | ||
53 | - QCryptoBlockCreateOptions *cryptoopts; | ||
54 | - QCryptoBlock *crypto; | ||
55 | - | ||
56 | - /* Extract "encrypt." options into a qdict */ | ||
57 | - opts_qdict = qemu_opts_to_qdict(opts, NULL); | ||
58 | - qdict_extract_subqdict(opts_qdict, &cryptoopts_qdict, "encrypt."); | ||
59 | - qobject_unref(opts_qdict); | ||
60 | - | ||
61 | - /* Build QCryptoBlockCreateOptions object from qdict */ | ||
62 | - qdict_put_str(cryptoopts_qdict, "format", "luks"); | ||
63 | - cryptoopts = block_crypto_create_opts_init(cryptoopts_qdict, errp); | ||
64 | - qobject_unref(cryptoopts_qdict); | ||
65 | - if (!cryptoopts) { | ||
66 | - return false; | ||
72 | - } | 67 | - } |
73 | - | 68 | - |
74 | s->cluster_cache_offset = -1; | 69 | - /* Fake LUKS creation in order to determine the payload size */ |
75 | s->flags = flags; | 70 | - crypto = qcrypto_block_create(cryptoopts, "encrypt.", |
76 | 71 | - qcow2_measure_crypto_hdr_init_func, | |
77 | @@ -XXX,XX +XXX,XX @@ static int qcow2_do_open(BlockDriverState *bs, QDict *options, int flags, | 72 | - qcow2_measure_crypto_hdr_write_func, |
78 | if (s->refcount_block_cache) { | 73 | - len, errp); |
79 | qcow2_cache_destroy(bs, s->refcount_block_cache); | 74 | - qapi_free_QCryptoBlockCreateOptions(cryptoopts); |
80 | } | 75 | - if (!crypto) { |
81 | - g_free(s->cluster_cache); | 76 | - return false; |
82 | - qemu_vfree(s->cluster_data); | 77 | - } |
83 | qcrypto_block_free(s->crypto); | 78 | - |
84 | qapi_free_QCryptoBlockOpenOptions(s->crypto_opts); | 79 | - qcrypto_block_free(crypto); |
85 | return ret; | 80 | - return true; |
81 | -} | ||
82 | - | ||
83 | static BlockMeasureInfo *qcow2_measure(QemuOpts *opts, BlockDriverState *in_bs, | ||
84 | Error **errp) | ||
85 | { | ||
86 | @@ -XXX,XX +XXX,XX @@ static BlockMeasureInfo *qcow2_measure(QemuOpts *opts, BlockDriverState *in_bs, | ||
87 | g_free(optstr); | ||
88 | |||
89 | if (has_luks) { | ||
90 | + g_autoptr(QCryptoBlockCreateOptions) create_opts = NULL; | ||
91 | + QDict *opts_qdict; | ||
92 | + QDict *cryptoopts; | ||
93 | size_t headerlen; | ||
94 | |||
95 | - if (!qcow2_measure_luks_headerlen(opts, &headerlen, &local_err)) { | ||
96 | + opts_qdict = qemu_opts_to_qdict(opts, NULL); | ||
97 | + qdict_extract_subqdict(opts_qdict, &cryptoopts, "encrypt."); | ||
98 | + qobject_unref(opts_qdict); | ||
99 | + | ||
100 | + qdict_put_str(cryptoopts, "format", "luks"); | ||
101 | + | ||
102 | + create_opts = block_crypto_create_opts_init(cryptoopts, errp); | ||
103 | + qobject_unref(cryptoopts); | ||
104 | + if (!create_opts) { | ||
105 | + goto err; | ||
106 | + } | ||
107 | + | ||
108 | + if (!qcrypto_block_calculate_payload_offset(create_opts, | ||
109 | + "encrypt.", | ||
110 | + &headerlen, | ||
111 | + &local_err)) { | ||
112 | goto err; | ||
113 | } | ||
114 | |||
115 | diff --git a/crypto/block.c b/crypto/block.c | ||
116 | index XXXXXXX..XXXXXXX 100644 | ||
117 | --- a/crypto/block.c | ||
118 | +++ b/crypto/block.c | ||
119 | @@ -XXX,XX +XXX,XX @@ QCryptoBlock *qcrypto_block_create(QCryptoBlockCreateOptions *options, | ||
120 | } | ||
121 | |||
122 | |||
123 | +static ssize_t qcrypto_block_headerlen_hdr_init_func(QCryptoBlock *block, | ||
124 | + size_t headerlen, void *opaque, Error **errp) | ||
125 | +{ | ||
126 | + size_t *headerlenp = opaque; | ||
127 | + | ||
128 | + /* Stash away the payload size */ | ||
129 | + *headerlenp = headerlen; | ||
130 | + return 0; | ||
131 | +} | ||
132 | + | ||
133 | + | ||
134 | +static ssize_t qcrypto_block_headerlen_hdr_write_func(QCryptoBlock *block, | ||
135 | + size_t offset, const uint8_t *buf, size_t buflen, | ||
136 | + void *opaque, Error **errp) | ||
137 | +{ | ||
138 | + /* Discard the bytes, we're not actually writing to an image */ | ||
139 | + return buflen; | ||
140 | +} | ||
141 | + | ||
142 | + | ||
143 | +bool | ||
144 | +qcrypto_block_calculate_payload_offset(QCryptoBlockCreateOptions *create_opts, | ||
145 | + const char *optprefix, | ||
146 | + size_t *len, | ||
147 | + Error **errp) | ||
148 | +{ | ||
149 | + /* Fake LUKS creation in order to determine the payload size */ | ||
150 | + g_autoptr(QCryptoBlock) crypto = | ||
151 | + qcrypto_block_create(create_opts, optprefix, | ||
152 | + qcrypto_block_headerlen_hdr_init_func, | ||
153 | + qcrypto_block_headerlen_hdr_write_func, | ||
154 | + len, errp); | ||
155 | + return crypto != NULL; | ||
156 | +} | ||
157 | + | ||
158 | + | ||
159 | QCryptoBlockInfo *qcrypto_block_get_info(QCryptoBlock *block, | ||
160 | Error **errp) | ||
161 | { | ||
162 | diff --git a/include/crypto/block.h b/include/crypto/block.h | ||
163 | index XXXXXXX..XXXXXXX 100644 | ||
164 | --- a/include/crypto/block.h | ||
165 | +++ b/include/crypto/block.h | ||
166 | @@ -XXX,XX +XXX,XX @@ QCryptoBlock *qcrypto_block_create(QCryptoBlockCreateOptions *options, | ||
167 | Error **errp); | ||
168 | |||
169 | |||
170 | +/** | ||
171 | + * qcrypto_block_calculate_payload_offset: | ||
172 | + * @create_opts: the encryption options | ||
173 | + * @optprefix: name prefix for options | ||
174 | + * @len: output for number of header bytes before payload | ||
175 | + * @errp: pointer to a NULL-initialized error object | ||
176 | + * | ||
177 | + * Calculate the number of header bytes before the payload in an encrypted | ||
178 | + * storage volume. The header is an area before the payload that is reserved | ||
179 | + * for encryption metadata. | ||
180 | + * | ||
181 | + * Returns: true on success, false on error | ||
182 | + */ | ||
183 | +bool | ||
184 | +qcrypto_block_calculate_payload_offset(QCryptoBlockCreateOptions *create_opts, | ||
185 | + const char *optprefix, | ||
186 | + size_t *len, | ||
187 | + Error **errp); | ||
188 | + | ||
189 | + | ||
190 | /** | ||
191 | * qcrypto_block_get_info: | ||
192 | * @block: the block encryption object | ||
193 | @@ -XXX,XX +XXX,XX @@ uint64_t qcrypto_block_get_sector_size(QCryptoBlock *block); | ||
194 | void qcrypto_block_free(QCryptoBlock *block); | ||
195 | |||
196 | G_DEFINE_AUTOPTR_CLEANUP_FUNC(QCryptoBlock, qcrypto_block_free) | ||
197 | +G_DEFINE_AUTOPTR_CLEANUP_FUNC(QCryptoBlockCreateOptions, | ||
198 | + qapi_free_QCryptoBlockCreateOptions) | ||
199 | |||
200 | #endif /* QCRYPTO_BLOCK_H */ | ||
86 | -- | 201 | -- |
87 | 2.13.5 | 202 | 2.24.1 |
88 | 203 | ||
89 | 204 | diff view generated by jsdifflib |
1 | Add the scripts/ directory to sys.path so Python 2.6 will be able to | 1 | From: Stefan Hajnoczi <stefanha@redhat.com> |
---|---|---|---|
2 | import argparse. | ||
3 | 2 | ||
4 | Cc: Daniel P. Berrange <berrange@redhat.com> | 3 | Add qemu-img measure support in the "luks" block driver. |
4 | |||
5 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 5 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> |
6 | Acked-by: John Snow <jsnow@redhat.com> | 6 | Reviewed-by: Max Reitz <mreitz@redhat.com> |
7 | Acked-by: Fam Zheng <famz@redhat.com> | 7 | Message-Id: <20200221112522.1497712-3-stefanha@redhat.com> |
8 | Message-id: 20170825155732.15665-4-stefanha@redhat.com | 8 | Signed-off-by: Max Reitz <mreitz@redhat.com> |
9 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | ||
10 | --- | 9 | --- |
11 | tests/migration/guestperf/shell.py | 8 +++++--- | 10 | block/crypto.c | 62 ++++++++++++++++++++++++++++++++++++++++++++++++++ |
12 | 1 file changed, 5 insertions(+), 3 deletions(-) | 11 | 1 file changed, 62 insertions(+) |
13 | 12 | ||
14 | diff --git a/tests/migration/guestperf/shell.py b/tests/migration/guestperf/shell.py | 13 | diff --git a/block/crypto.c b/block/crypto.c |
15 | index XXXXXXX..XXXXXXX 100644 | 14 | index XXXXXXX..XXXXXXX 100644 |
16 | --- a/tests/migration/guestperf/shell.py | 15 | --- a/block/crypto.c |
17 | +++ b/tests/migration/guestperf/shell.py | 16 | +++ b/block/crypto.c |
18 | @@ -XXX,XX +XXX,XX @@ | 17 | @@ -XXX,XX +XXX,XX @@ static int64_t block_crypto_getlength(BlockDriverState *bs) |
19 | # | 18 | } |
20 | 19 | ||
21 | 20 | ||
22 | -import argparse | 21 | +static BlockMeasureInfo *block_crypto_measure(QemuOpts *opts, |
23 | -import fnmatch | 22 | + BlockDriverState *in_bs, |
24 | import os | 23 | + Error **errp) |
25 | import os.path | 24 | +{ |
26 | -import platform | 25 | + g_autoptr(QCryptoBlockCreateOptions) create_opts = NULL; |
27 | import sys | 26 | + Error *local_err = NULL; |
28 | +sys.path.append(os.path.join(os.path.dirname(__file__), | 27 | + BlockMeasureInfo *info; |
29 | + '..', '..', '..', 'scripts')) | 28 | + uint64_t size; |
30 | +import argparse | 29 | + size_t luks_payload_size; |
31 | +import fnmatch | 30 | + QDict *cryptoopts; |
32 | +import platform | 31 | + |
33 | 32 | + /* | |
34 | from guestperf.hardware import Hardware | 33 | + * Preallocation mode doesn't affect size requirements but we must consume |
35 | from guestperf.engine import Engine | 34 | + * the option. |
35 | + */ | ||
36 | + g_free(qemu_opt_get_del(opts, BLOCK_OPT_PREALLOC)); | ||
37 | + | ||
38 | + size = qemu_opt_get_size_del(opts, BLOCK_OPT_SIZE, 0); | ||
39 | + | ||
40 | + if (in_bs) { | ||
41 | + int64_t ssize = bdrv_getlength(in_bs); | ||
42 | + | ||
43 | + if (ssize < 0) { | ||
44 | + error_setg_errno(&local_err, -ssize, | ||
45 | + "Unable to get image virtual_size"); | ||
46 | + goto err; | ||
47 | + } | ||
48 | + | ||
49 | + size = ssize; | ||
50 | + } | ||
51 | + | ||
52 | + cryptoopts = qemu_opts_to_qdict_filtered(opts, NULL, | ||
53 | + &block_crypto_create_opts_luks, true); | ||
54 | + qdict_put_str(cryptoopts, "format", "luks"); | ||
55 | + create_opts = block_crypto_create_opts_init(cryptoopts, &local_err); | ||
56 | + qobject_unref(cryptoopts); | ||
57 | + if (!create_opts) { | ||
58 | + goto err; | ||
59 | + } | ||
60 | + | ||
61 | + if (!qcrypto_block_calculate_payload_offset(create_opts, NULL, | ||
62 | + &luks_payload_size, | ||
63 | + &local_err)) { | ||
64 | + goto err; | ||
65 | + } | ||
66 | + | ||
67 | + /* | ||
68 | + * Unallocated blocks are still encrypted so allocation status makes no | ||
69 | + * difference to the file size. | ||
70 | + */ | ||
71 | + info = g_new(BlockMeasureInfo, 1); | ||
72 | + info->fully_allocated = luks_payload_size + size; | ||
73 | + info->required = luks_payload_size + size; | ||
74 | + return info; | ||
75 | + | ||
76 | +err: | ||
77 | + error_propagate(errp, local_err); | ||
78 | + return NULL; | ||
79 | +} | ||
80 | + | ||
81 | + | ||
82 | static int block_crypto_probe_luks(const uint8_t *buf, | ||
83 | int buf_size, | ||
84 | const char *filename) { | ||
85 | @@ -XXX,XX +XXX,XX @@ static BlockDriver bdrv_crypto_luks = { | ||
86 | .bdrv_co_preadv = block_crypto_co_preadv, | ||
87 | .bdrv_co_pwritev = block_crypto_co_pwritev, | ||
88 | .bdrv_getlength = block_crypto_getlength, | ||
89 | + .bdrv_measure = block_crypto_measure, | ||
90 | .bdrv_get_info = block_crypto_get_info_luks, | ||
91 | .bdrv_get_specific_info = block_crypto_get_specific_info_luks, | ||
92 | |||
36 | -- | 93 | -- |
37 | 2.13.5 | 94 | 2.24.1 |
38 | 95 | ||
39 | 96 | diff view generated by jsdifflib |
1 | Add the scripts/ directory to sys.path so Python 2.6 will be able to | 1 | From: Stefan Hajnoczi <stefanha@redhat.com> |
---|---|---|---|
2 | import argparse. | ||
3 | 2 | ||
4 | Cc: Fam Zheng <famz@redhat.com> | 3 | In most qemu-img sub-commands the --object option only makes sense when |
4 | there is a filename. qemu-img measure is an exception because objects | ||
5 | may be referenced from the image creation options instead of an existing | ||
6 | image file. Allow --object without a filename. | ||
7 | |||
5 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 8 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> |
6 | Acked-by: John Snow <jsnow@redhat.com> | 9 | Reviewed-by: Max Reitz <mreitz@redhat.com> |
7 | Acked-by: Fam Zheng <famz@redhat.com> | 10 | Message-Id: <20200221112522.1497712-4-stefanha@redhat.com> |
8 | Message-id: 20170825155732.15665-3-stefanha@redhat.com | 11 | Signed-off-by: Max Reitz <mreitz@redhat.com> |
9 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | ||
10 | --- | 12 | --- |
11 | tests/docker/docker.py | 4 +++- | 13 | qemu-img.c | 6 ++---- |
12 | 1 file changed, 3 insertions(+), 1 deletion(-) | 14 | tests/qemu-iotests/178 | 2 +- |
15 | tests/qemu-iotests/178.out.qcow2 | 8 ++++---- | ||
16 | tests/qemu-iotests/178.out.raw | 8 ++++---- | ||
17 | 4 files changed, 11 insertions(+), 13 deletions(-) | ||
13 | 18 | ||
14 | diff --git a/tests/docker/docker.py b/tests/docker/docker.py | 19 | diff --git a/qemu-img.c b/qemu-img.c |
20 | index XXXXXXX..XXXXXXX 100644 | ||
21 | --- a/qemu-img.c | ||
22 | +++ b/qemu-img.c | ||
23 | @@ -XXX,XX +XXX,XX @@ static int img_measure(int argc, char **argv) | ||
24 | filename = argv[optind]; | ||
25 | } | ||
26 | |||
27 | - if (!filename && | ||
28 | - (object_opts || image_opts || fmt || snapshot_name || sn_opts)) { | ||
29 | - error_report("--object, --image-opts, -f, and -l " | ||
30 | - "require a filename argument."); | ||
31 | + if (!filename && (image_opts || fmt || snapshot_name || sn_opts)) { | ||
32 | + error_report("--image-opts, -f, and -l require a filename argument."); | ||
33 | goto out; | ||
34 | } | ||
35 | if (filename && img_size != UINT64_MAX) { | ||
36 | diff --git a/tests/qemu-iotests/178 b/tests/qemu-iotests/178 | ||
15 | index XXXXXXX..XXXXXXX 100755 | 37 | index XXXXXXX..XXXXXXX 100755 |
16 | --- a/tests/docker/docker.py | 38 | --- a/tests/qemu-iotests/178 |
17 | +++ b/tests/docker/docker.py | 39 | +++ b/tests/qemu-iotests/178 |
18 | @@ -XXX,XX +XXX,XX @@ | 40 | @@ -XXX,XX +XXX,XX @@ _make_test_img 1G |
19 | 41 | $QEMU_IMG measure # missing arguments | |
20 | import os | 42 | $QEMU_IMG measure --size 2G "$TEST_IMG" # only one allowed |
21 | import sys | 43 | $QEMU_IMG measure "$TEST_IMG" a # only one filename allowed |
22 | +sys.path.append(os.path.join(os.path.dirname(__file__), | 44 | -$QEMU_IMG measure --object secret,id=sec0,data=MTIzNDU2,format=base64 # missing filename |
23 | + '..', '..', 'scripts')) | 45 | +$QEMU_IMG measure --object secret,id=sec0,data=MTIzNDU2,format=base64 # size or filename needed |
24 | +import argparse | 46 | $QEMU_IMG measure --image-opts # missing filename |
25 | import subprocess | 47 | $QEMU_IMG measure -f qcow2 # missing filename |
26 | import json | 48 | $QEMU_IMG measure -l snap1 # missing filename |
27 | import hashlib | 49 | diff --git a/tests/qemu-iotests/178.out.qcow2 b/tests/qemu-iotests/178.out.qcow2 |
28 | import atexit | 50 | index XXXXXXX..XXXXXXX 100644 |
29 | import uuid | 51 | --- a/tests/qemu-iotests/178.out.qcow2 |
30 | -import argparse | 52 | +++ b/tests/qemu-iotests/178.out.qcow2 |
31 | import tempfile | 53 | @@ -XXX,XX +XXX,XX @@ Formatting 'TEST_DIR/t.IMGFMT', fmt=IMGFMT size=1073741824 |
32 | import re | 54 | qemu-img: Either --size N or one filename must be specified. |
33 | import signal | 55 | qemu-img: --size N cannot be used together with a filename. |
56 | qemu-img: At most one filename argument is allowed. | ||
57 | -qemu-img: --object, --image-opts, -f, and -l require a filename argument. | ||
58 | -qemu-img: --object, --image-opts, -f, and -l require a filename argument. | ||
59 | -qemu-img: --object, --image-opts, -f, and -l require a filename argument. | ||
60 | -qemu-img: --object, --image-opts, -f, and -l require a filename argument. | ||
61 | +qemu-img: Either --size N or one filename must be specified. | ||
62 | +qemu-img: --image-opts, -f, and -l require a filename argument. | ||
63 | +qemu-img: --image-opts, -f, and -l require a filename argument. | ||
64 | +qemu-img: --image-opts, -f, and -l require a filename argument. | ||
65 | qemu-img: Invalid option list: , | ||
66 | qemu-img: Invalid parameter 'snapshot.foo' | ||
67 | qemu-img: Failed in parsing snapshot param 'snapshot.foo' | ||
68 | diff --git a/tests/qemu-iotests/178.out.raw b/tests/qemu-iotests/178.out.raw | ||
69 | index XXXXXXX..XXXXXXX 100644 | ||
70 | --- a/tests/qemu-iotests/178.out.raw | ||
71 | +++ b/tests/qemu-iotests/178.out.raw | ||
72 | @@ -XXX,XX +XXX,XX @@ Formatting 'TEST_DIR/t.IMGFMT', fmt=IMGFMT size=1073741824 | ||
73 | qemu-img: Either --size N or one filename must be specified. | ||
74 | qemu-img: --size N cannot be used together with a filename. | ||
75 | qemu-img: At most one filename argument is allowed. | ||
76 | -qemu-img: --object, --image-opts, -f, and -l require a filename argument. | ||
77 | -qemu-img: --object, --image-opts, -f, and -l require a filename argument. | ||
78 | -qemu-img: --object, --image-opts, -f, and -l require a filename argument. | ||
79 | -qemu-img: --object, --image-opts, -f, and -l require a filename argument. | ||
80 | +qemu-img: Either --size N or one filename must be specified. | ||
81 | +qemu-img: --image-opts, -f, and -l require a filename argument. | ||
82 | +qemu-img: --image-opts, -f, and -l require a filename argument. | ||
83 | +qemu-img: --image-opts, -f, and -l require a filename argument. | ||
84 | qemu-img: Invalid option list: , | ||
85 | qemu-img: Invalid parameter 'snapshot.foo' | ||
86 | qemu-img: Failed in parsing snapshot param 'snapshot.foo' | ||
34 | -- | 87 | -- |
35 | 2.13.5 | 88 | 2.24.1 |
36 | 89 | ||
37 | 90 | diff view generated by jsdifflib |
1 | The minimum Python version supported by QEMU is 2.6. The argparse | 1 | From: Stefan Hajnoczi <stefanha@redhat.com> |
---|---|---|---|
2 | standard library module was only added in Python 2.7. Many scripts | ||
3 | would like to use argparse because it supports command-line | ||
4 | sub-commands. | ||
5 | 2 | ||
6 | This patch adds argparse. See the top of argparse.py for details. | 3 | This test exercises the block/crypto.c "luks" block driver |
4 | .bdrv_measure() code. | ||
7 | 5 | ||
8 | Suggested-by: Daniel P. Berrange <berrange@redhat.com> | ||
9 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 6 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> |
10 | Acked-by: John Snow <jsnow@redhat.com> | 7 | Reviewed-by: Max Reitz <mreitz@redhat.com> |
11 | Message-id: 20170825155732.15665-2-stefanha@redhat.com | 8 | Message-Id: <20200221112522.1497712-5-stefanha@redhat.com> |
12 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 9 | [mreitz: Renamed test from 282 to 288] |
10 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
13 | --- | 11 | --- |
14 | COPYING.PYTHON | 270 ++++++ | 12 | tests/qemu-iotests/288 | 93 ++++++++++++++++++++++++++++++++++++++ |
15 | scripts/argparse.py | 2406 +++++++++++++++++++++++++++++++++++++++++++++++++++ | 13 | tests/qemu-iotests/288.out | 30 ++++++++++++ |
16 | 2 files changed, 2676 insertions(+) | 14 | tests/qemu-iotests/group | 1 + |
17 | create mode 100644 COPYING.PYTHON | 15 | 3 files changed, 124 insertions(+) |
18 | create mode 100644 scripts/argparse.py | 16 | create mode 100755 tests/qemu-iotests/288 |
17 | create mode 100644 tests/qemu-iotests/288.out | ||
19 | 18 | ||
20 | diff --git a/COPYING.PYTHON b/COPYING.PYTHON | 19 | diff --git a/tests/qemu-iotests/288 b/tests/qemu-iotests/288 |
20 | new file mode 100755 | ||
21 | index XXXXXXX..XXXXXXX | ||
22 | --- /dev/null | ||
23 | +++ b/tests/qemu-iotests/288 | ||
24 | @@ -XXX,XX +XXX,XX @@ | ||
25 | +#!/usr/bin/env bash | ||
26 | +# | ||
27 | +# qemu-img measure tests for LUKS images | ||
28 | +# | ||
29 | +# Copyright (C) 2020 Red Hat, Inc. | ||
30 | +# | ||
31 | +# This program is free software; you can redistribute it and/or modify | ||
32 | +# it under the terms of the GNU General Public License as published by | ||
33 | +# the Free Software Foundation; either version 2 of the License, or | ||
34 | +# (at your option) any later version. | ||
35 | +# | ||
36 | +# This program is distributed in the hope that it will be useful, | ||
37 | +# but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
38 | +# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
39 | +# GNU General Public License for more details. | ||
40 | +# | ||
41 | +# You should have received a copy of the GNU General Public License | ||
42 | +# along with this program. If not, see <http://www.gnu.org/licenses/>. | ||
43 | +# | ||
44 | + | ||
45 | +# creator | ||
46 | +owner=stefanha@redhat.com | ||
47 | + | ||
48 | +seq=`basename $0` | ||
49 | +echo "QA output created by $seq" | ||
50 | + | ||
51 | +status=1 # failure is the default! | ||
52 | + | ||
53 | +_cleanup() | ||
54 | +{ | ||
55 | + _cleanup_test_img | ||
56 | + rm -f "$TEST_IMG.converted" | ||
57 | +} | ||
58 | +trap "_cleanup; exit \$status" 0 1 2 3 15 | ||
59 | + | ||
60 | +# get standard environment, filters and checks | ||
61 | +. ./common.rc | ||
62 | +. ./common.filter | ||
63 | +. ./common.pattern | ||
64 | + | ||
65 | +_supported_fmt luks | ||
66 | +_supported_proto file | ||
67 | +_supported_os Linux | ||
68 | + | ||
69 | +SECRET=secret,id=sec0,data=passphrase | ||
70 | + | ||
71 | +echo "== measure 1G image file ==" | ||
72 | +echo | ||
73 | + | ||
74 | +$QEMU_IMG measure --object "$SECRET" \ | ||
75 | + -O "$IMGFMT" \ | ||
76 | + -o key-secret=sec0,iter-time=10 \ | ||
77 | + --size 1G | ||
78 | + | ||
79 | +echo | ||
80 | +echo "== create 1G image file (size should be no greater than measured) ==" | ||
81 | +echo | ||
82 | + | ||
83 | +_make_test_img 1G | ||
84 | +stat -c "image file size in bytes: %s" "$TEST_IMG_FILE" | ||
85 | + | ||
86 | +echo | ||
87 | +echo "== modified 1G image file (size should be no greater than measured) ==" | ||
88 | +echo | ||
89 | + | ||
90 | +$QEMU_IO --object "$SECRET" --image-opts "$TEST_IMG" -c "write -P 0x51 0x10000 0x400" | _filter_qemu_io | _filter_testdir | ||
91 | +stat -c "image file size in bytes: %s" "$TEST_IMG_FILE" | ||
92 | + | ||
93 | +echo | ||
94 | +echo "== measure preallocation=falloc 1G image file ==" | ||
95 | +echo | ||
96 | + | ||
97 | +$QEMU_IMG measure --object "$SECRET" \ | ||
98 | + -O "$IMGFMT" \ | ||
99 | + -o key-secret=sec0,iter-time=10,preallocation=falloc \ | ||
100 | + --size 1G | ||
101 | + | ||
102 | +echo | ||
103 | +echo "== measure with input image file ==" | ||
104 | +echo | ||
105 | + | ||
106 | +IMGFMT=raw IMGKEYSECRET= IMGOPTS= _make_test_img 1G | _filter_imgfmt | ||
107 | +QEMU_IO_OPTIONS= IMGOPTSSYNTAX= $QEMU_IO -f raw -c "write -P 0x51 0x10000 0x400" "$TEST_IMG_FILE" | _filter_qemu_io | _filter_testdir | ||
108 | +$QEMU_IMG measure --object "$SECRET" \ | ||
109 | + -O "$IMGFMT" \ | ||
110 | + -o key-secret=sec0,iter-time=10 \ | ||
111 | + -f raw \ | ||
112 | + "$TEST_IMG_FILE" | ||
113 | + | ||
114 | +# success, all done | ||
115 | +echo "*** done" | ||
116 | +rm -f $seq.full | ||
117 | +status=0 | ||
118 | diff --git a/tests/qemu-iotests/288.out b/tests/qemu-iotests/288.out | ||
21 | new file mode 100644 | 119 | new file mode 100644 |
22 | index XXXXXXX..XXXXXXX | 120 | index XXXXXXX..XXXXXXX |
23 | --- /dev/null | 121 | --- /dev/null |
24 | +++ b/COPYING.PYTHON | 122 | +++ b/tests/qemu-iotests/288.out |
25 | @@ -XXX,XX +XXX,XX @@ | 123 | @@ -XXX,XX +XXX,XX @@ |
26 | +A. HISTORY OF THE SOFTWARE | 124 | +QA output created by 288 |
27 | +========================== | 125 | +== measure 1G image file == |
28 | + | 126 | + |
29 | +Python was created in the early 1990s by Guido van Rossum at Stichting | 127 | +required size: 1075810304 |
30 | +Mathematisch Centrum (CWI, see http://www.cwi.nl) in the Netherlands | 128 | +fully allocated size: 1075810304 |
31 | +as a successor of a language called ABC. Guido remains Python's | ||
32 | +principal author, although it includes many contributions from others. | ||
33 | + | 129 | + |
34 | +In 1995, Guido continued his work on Python at the Corporation for | 130 | +== create 1G image file (size should be no greater than measured) == |
35 | +National Research Initiatives (CNRI, see http://www.cnri.reston.va.us) | ||
36 | +in Reston, Virginia where he released several versions of the | ||
37 | +software. | ||
38 | + | 131 | + |
39 | +In May 2000, Guido and the Python core development team moved to | 132 | +Formatting 'TEST_DIR/t.IMGFMT', fmt=IMGFMT size=1073741824 |
40 | +BeOpen.com to form the BeOpen PythonLabs team. In October of the same | 133 | +image file size in bytes: 1075810304 |
41 | +year, the PythonLabs team moved to Digital Creations (now Zope | ||
42 | +Corporation, see http://www.zope.com). In 2001, the Python Software | ||
43 | +Foundation (PSF, see http://www.python.org/psf/) was formed, a | ||
44 | +non-profit organization created specifically to own Python-related | ||
45 | +Intellectual Property. Zope Corporation is a sponsoring member of | ||
46 | +the PSF. | ||
47 | + | 134 | + |
48 | +All Python releases are Open Source (see http://www.opensource.org for | 135 | +== modified 1G image file (size should be no greater than measured) == |
49 | +the Open Source Definition). Historically, most, but not all, Python | ||
50 | +releases have also been GPL-compatible; the table below summarizes | ||
51 | +the various releases. | ||
52 | + | 136 | + |
53 | + Release Derived Year Owner GPL- | 137 | +wrote 1024/1024 bytes at offset 65536 |
54 | + from compatible? (1) | 138 | +1 KiB, X ops; XX:XX:XX.X (XXX YYY/sec and XXX ops/sec) |
139 | +image file size in bytes: 1075810304 | ||
55 | + | 140 | + |
56 | + 0.9.0 thru 1.2 1991-1995 CWI yes | 141 | +== measure preallocation=falloc 1G image file == |
57 | + 1.3 thru 1.5.2 1.2 1995-1999 CNRI yes | ||
58 | + 1.6 1.5.2 2000 CNRI no | ||
59 | + 2.0 1.6 2000 BeOpen.com no | ||
60 | + 1.6.1 1.6 2001 CNRI yes (2) | ||
61 | + 2.1 2.0+1.6.1 2001 PSF no | ||
62 | + 2.0.1 2.0+1.6.1 2001 PSF yes | ||
63 | + 2.1.1 2.1+2.0.1 2001 PSF yes | ||
64 | + 2.2 2.1.1 2001 PSF yes | ||
65 | + 2.1.2 2.1.1 2002 PSF yes | ||
66 | + 2.1.3 2.1.2 2002 PSF yes | ||
67 | + 2.2.1 2.2 2002 PSF yes | ||
68 | + 2.2.2 2.2.1 2002 PSF yes | ||
69 | + 2.2.3 2.2.2 2003 PSF yes | ||
70 | + 2.3 2.2.2 2002-2003 PSF yes | ||
71 | + 2.3.1 2.3 2002-2003 PSF yes | ||
72 | + 2.3.2 2.3.1 2002-2003 PSF yes | ||
73 | + 2.3.3 2.3.2 2002-2003 PSF yes | ||
74 | + 2.3.4 2.3.3 2004 PSF yes | ||
75 | + 2.3.5 2.3.4 2005 PSF yes | ||
76 | + 2.4 2.3 2004 PSF yes | ||
77 | + 2.4.1 2.4 2005 PSF yes | ||
78 | + 2.4.2 2.4.1 2005 PSF yes | ||
79 | + 2.4.3 2.4.2 2006 PSF yes | ||
80 | + 2.5 2.4 2006 PSF yes | ||
81 | + 2.7 2.6 2010 PSF yes | ||
82 | + | 142 | + |
83 | +Footnotes: | 143 | +required size: 1075810304 |
144 | +fully allocated size: 1075810304 | ||
84 | + | 145 | + |
85 | +(1) GPL-compatible doesn't mean that we're distributing Python under | 146 | +== measure with input image file == |
86 | + the GPL. All Python licenses, unlike the GPL, let you distribute | ||
87 | + a modified version without making your changes open source. The | ||
88 | + GPL-compatible licenses make it possible to combine Python with | ||
89 | + other software that is released under the GPL; the others don't. | ||
90 | + | 147 | + |
91 | +(2) According to Richard Stallman, 1.6.1 is not GPL-compatible, | 148 | +Formatting 'TEST_DIR/t.IMGFMT', fmt=IMGFMT size=1073741824 |
92 | + because its license has a choice of law clause. According to | 149 | +wrote 1024/1024 bytes at offset 65536 |
93 | + CNRI, however, Stallman's lawyer has told CNRI's lawyer that 1.6.1 | 150 | +1 KiB, X ops; XX:XX:XX.X (XXX YYY/sec and XXX ops/sec) |
94 | + is "not incompatible" with the GPL. | 151 | +required size: 1075810304 |
95 | + | 152 | +fully allocated size: 1075810304 |
96 | +Thanks to the many outside volunteers who have worked under Guido's | 153 | +*** done |
97 | +direction to make these releases possible. | 154 | diff --git a/tests/qemu-iotests/group b/tests/qemu-iotests/group |
98 | + | 155 | index XXXXXXX..XXXXXXX 100644 |
99 | + | 156 | --- a/tests/qemu-iotests/group |
100 | +B. TERMS AND CONDITIONS FOR ACCESSING OR OTHERWISE USING PYTHON | 157 | +++ b/tests/qemu-iotests/group |
101 | +=============================================================== | ||
102 | + | ||
103 | +PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2 | ||
104 | +-------------------------------------------- | ||
105 | + | ||
106 | +1. This LICENSE AGREEMENT is between the Python Software Foundation | ||
107 | +("PSF"), and the Individual or Organization ("Licensee") accessing and | ||
108 | +otherwise using this software ("Python") in source or binary form and | ||
109 | +its associated documentation. | ||
110 | + | ||
111 | +2. Subject to the terms and conditions of this License Agreement, PSF | ||
112 | +hereby grants Licensee a nonexclusive, royalty-free, world-wide | ||
113 | +license to reproduce, analyze, test, perform and/or display publicly, | ||
114 | +prepare derivative works, distribute, and otherwise use Python | ||
115 | +alone or in any derivative version, provided, however, that PSF's | ||
116 | +License Agreement and PSF's notice of copyright, i.e., "Copyright (c) | ||
117 | +2001, 2002, 2003, 2004, 2005, 2006 Python Software Foundation; All Rights | ||
118 | +Reserved" are retained in Python alone or in any derivative version | ||
119 | +prepared by Licensee. | ||
120 | + | ||
121 | +3. In the event Licensee prepares a derivative work that is based on | ||
122 | +or incorporates Python or any part thereof, and wants to make | ||
123 | +the derivative work available to others as provided herein, then | ||
124 | +Licensee hereby agrees to include in any such work a brief summary of | ||
125 | +the changes made to Python. | ||
126 | + | ||
127 | +4. PSF is making Python available to Licensee on an "AS IS" | ||
128 | +basis. PSF MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR | ||
129 | +IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, PSF MAKES NO AND | ||
130 | +DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS | ||
131 | +FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON WILL NOT | ||
132 | +INFRINGE ANY THIRD PARTY RIGHTS. | ||
133 | + | ||
134 | +5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON | ||
135 | +FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS | ||
136 | +A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON, | ||
137 | +OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. | ||
138 | + | ||
139 | +6. This License Agreement will automatically terminate upon a material | ||
140 | +breach of its terms and conditions. | ||
141 | + | ||
142 | +7. Nothing in this License Agreement shall be deemed to create any | ||
143 | +relationship of agency, partnership, or joint venture between PSF and | ||
144 | +Licensee. This License Agreement does not grant permission to use PSF | ||
145 | +trademarks or trade name in a trademark sense to endorse or promote | ||
146 | +products or services of Licensee, or any third party. | ||
147 | + | ||
148 | +8. By copying, installing or otherwise using Python, Licensee | ||
149 | +agrees to be bound by the terms and conditions of this License | ||
150 | +Agreement. | ||
151 | + | ||
152 | + | ||
153 | +BEOPEN.COM LICENSE AGREEMENT FOR PYTHON 2.0 | ||
154 | +------------------------------------------- | ||
155 | + | ||
156 | +BEOPEN PYTHON OPEN SOURCE LICENSE AGREEMENT VERSION 1 | ||
157 | + | ||
158 | +1. This LICENSE AGREEMENT is between BeOpen.com ("BeOpen"), having an | ||
159 | +office at 160 Saratoga Avenue, Santa Clara, CA 95051, and the | ||
160 | +Individual or Organization ("Licensee") accessing and otherwise using | ||
161 | +this software in source or binary form and its associated | ||
162 | +documentation ("the Software"). | ||
163 | + | ||
164 | +2. Subject to the terms and conditions of this BeOpen Python License | ||
165 | +Agreement, BeOpen hereby grants Licensee a non-exclusive, | ||
166 | +royalty-free, world-wide license to reproduce, analyze, test, perform | ||
167 | +and/or display publicly, prepare derivative works, distribute, and | ||
168 | +otherwise use the Software alone or in any derivative version, | ||
169 | +provided, however, that the BeOpen Python License is retained in the | ||
170 | +Software, alone or in any derivative version prepared by Licensee. | ||
171 | + | ||
172 | +3. BeOpen is making the Software available to Licensee on an "AS IS" | ||
173 | +basis. BEOPEN MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR | ||
174 | +IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, BEOPEN MAKES NO AND | ||
175 | +DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS | ||
176 | +FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF THE SOFTWARE WILL NOT | ||
177 | +INFRINGE ANY THIRD PARTY RIGHTS. | ||
178 | + | ||
179 | +4. BEOPEN SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF THE | ||
180 | +SOFTWARE FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS | ||
181 | +AS A RESULT OF USING, MODIFYING OR DISTRIBUTING THE SOFTWARE, OR ANY | ||
182 | +DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. | ||
183 | + | ||
184 | +5. This License Agreement will automatically terminate upon a material | ||
185 | +breach of its terms and conditions. | ||
186 | + | ||
187 | +6. This License Agreement shall be governed by and interpreted in all | ||
188 | +respects by the law of the State of California, excluding conflict of | ||
189 | +law provisions. Nothing in this License Agreement shall be deemed to | ||
190 | +create any relationship of agency, partnership, or joint venture | ||
191 | +between BeOpen and Licensee. This License Agreement does not grant | ||
192 | +permission to use BeOpen trademarks or trade names in a trademark | ||
193 | +sense to endorse or promote products or services of Licensee, or any | ||
194 | +third party. As an exception, the "BeOpen Python" logos available at | ||
195 | +http://www.pythonlabs.com/logos.html may be used according to the | ||
196 | +permissions granted on that web page. | ||
197 | + | ||
198 | +7. By copying, installing or otherwise using the software, Licensee | ||
199 | +agrees to be bound by the terms and conditions of this License | ||
200 | +Agreement. | ||
201 | + | ||
202 | + | ||
203 | +CNRI LICENSE AGREEMENT FOR PYTHON 1.6.1 | ||
204 | +--------------------------------------- | ||
205 | + | ||
206 | +1. This LICENSE AGREEMENT is between the Corporation for National | ||
207 | +Research Initiatives, having an office at 1895 Preston White Drive, | ||
208 | +Reston, VA 20191 ("CNRI"), and the Individual or Organization | ||
209 | +("Licensee") accessing and otherwise using Python 1.6.1 software in | ||
210 | +source or binary form and its associated documentation. | ||
211 | + | ||
212 | +2. Subject to the terms and conditions of this License Agreement, CNRI | ||
213 | +hereby grants Licensee a nonexclusive, royalty-free, world-wide | ||
214 | +license to reproduce, analyze, test, perform and/or display publicly, | ||
215 | +prepare derivative works, distribute, and otherwise use Python 1.6.1 | ||
216 | +alone or in any derivative version, provided, however, that CNRI's | ||
217 | +License Agreement and CNRI's notice of copyright, i.e., "Copyright (c) | ||
218 | +1995-2001 Corporation for National Research Initiatives; All Rights | ||
219 | +Reserved" are retained in Python 1.6.1 alone or in any derivative | ||
220 | +version prepared by Licensee. Alternately, in lieu of CNRI's License | ||
221 | +Agreement, Licensee may substitute the following text (omitting the | ||
222 | +quotes): "Python 1.6.1 is made available subject to the terms and | ||
223 | +conditions in CNRI's License Agreement. This Agreement together with | ||
224 | +Python 1.6.1 may be located on the Internet using the following | ||
225 | +unique, persistent identifier (known as a handle): 1895.22/1013. This | ||
226 | +Agreement may also be obtained from a proxy server on the Internet | ||
227 | +using the following URL: http://hdl.handle.net/1895.22/1013". | ||
228 | + | ||
229 | +3. In the event Licensee prepares a derivative work that is based on | ||
230 | +or incorporates Python 1.6.1 or any part thereof, and wants to make | ||
231 | +the derivative work available to others as provided herein, then | ||
232 | +Licensee hereby agrees to include in any such work a brief summary of | ||
233 | +the changes made to Python 1.6.1. | ||
234 | + | ||
235 | +4. CNRI is making Python 1.6.1 available to Licensee on an "AS IS" | ||
236 | +basis. CNRI MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR | ||
237 | +IMPLIED. BY WAY OF EXAMPLE, BUT NOT LIMITATION, CNRI MAKES NO AND | ||
238 | +DISCLAIMS ANY REPRESENTATION OR WARRANTY OF MERCHANTABILITY OR FITNESS | ||
239 | +FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF PYTHON 1.6.1 WILL NOT | ||
240 | +INFRINGE ANY THIRD PARTY RIGHTS. | ||
241 | + | ||
242 | +5. CNRI SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON | ||
243 | +1.6.1 FOR ANY INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS | ||
244 | +A RESULT OF MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON 1.6.1, | ||
245 | +OR ANY DERIVATIVE THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF. | ||
246 | + | ||
247 | +6. This License Agreement will automatically terminate upon a material | ||
248 | +breach of its terms and conditions. | ||
249 | + | ||
250 | +7. This License Agreement shall be governed by the federal | ||
251 | +intellectual property law of the United States, including without | ||
252 | +limitation the federal copyright law, and, to the extent such | ||
253 | +U.S. federal law does not apply, by the law of the Commonwealth of | ||
254 | +Virginia, excluding Virginia's conflict of law provisions. | ||
255 | +Notwithstanding the foregoing, with regard to derivative works based | ||
256 | +on Python 1.6.1 that incorporate non-separable material that was | ||
257 | +previously distributed under the GNU General Public License (GPL), the | ||
258 | +law of the Commonwealth of Virginia shall govern this License | ||
259 | +Agreement only as to issues arising under or with respect to | ||
260 | +Paragraphs 4, 5, and 7 of this License Agreement. Nothing in this | ||
261 | +License Agreement shall be deemed to create any relationship of | ||
262 | +agency, partnership, or joint venture between CNRI and Licensee. This | ||
263 | +License Agreement does not grant permission to use CNRI trademarks or | ||
264 | +trade name in a trademark sense to endorse or promote products or | ||
265 | +services of Licensee, or any third party. | ||
266 | + | ||
267 | +8. By clicking on the "ACCEPT" button where indicated, or by copying, | ||
268 | +installing or otherwise using Python 1.6.1, Licensee agrees to be | ||
269 | +bound by the terms and conditions of this License Agreement. | ||
270 | + | ||
271 | + ACCEPT | ||
272 | + | ||
273 | + | ||
274 | +CWI LICENSE AGREEMENT FOR PYTHON 0.9.0 THROUGH 1.2 | ||
275 | +-------------------------------------------------- | ||
276 | + | ||
277 | +Copyright (c) 1991 - 1995, Stichting Mathematisch Centrum Amsterdam, | ||
278 | +The Netherlands. All rights reserved. | ||
279 | + | ||
280 | +Permission to use, copy, modify, and distribute this software and its | ||
281 | +documentation for any purpose and without fee is hereby granted, | ||
282 | +provided that the above copyright notice appear in all copies and that | ||
283 | +both that copyright notice and this permission notice appear in | ||
284 | +supporting documentation, and that the name of Stichting Mathematisch | ||
285 | +Centrum or CWI not be used in advertising or publicity pertaining to | ||
286 | +distribution of the software without specific, written prior | ||
287 | +permission. | ||
288 | + | ||
289 | +STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO | ||
290 | +THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND | ||
291 | +FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE | ||
292 | +FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES | ||
293 | +WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN | ||
294 | +ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT | ||
295 | +OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. | ||
296 | diff --git a/scripts/argparse.py b/scripts/argparse.py | ||
297 | new file mode 100644 | ||
298 | index XXXXXXX..XXXXXXX | ||
299 | --- /dev/null | ||
300 | +++ b/scripts/argparse.py | ||
301 | @@ -XXX,XX +XXX,XX @@ | 158 | @@ -XXX,XX +XXX,XX @@ |
302 | +# This is a local copy of the standard library argparse module taken from PyPI. | 159 | 283 auto quick |
303 | +# It is licensed under the Python Software Foundation License. This is a | 160 | 284 rw |
304 | +# fallback for Python 2.6 which does not include this module. Python 2.7+ and | 161 | 286 rw quick |
305 | +# 3+ will never load this module because built-in modules are loaded before | 162 | +288 quick |
306 | +# anything in sys.path. | ||
307 | +# | ||
308 | +# If your script is not located in the same directory as this file, import it | ||
309 | +# like this: | ||
310 | +# | ||
311 | +# import os | ||
312 | +# import sys | ||
313 | +# sys.path.append(os.path.join(os.path.dirname(__file__), ..., 'scripts')) | ||
314 | +# import argparse | ||
315 | + | ||
316 | +# Author: Steven J. Bethard <steven.bethard@gmail.com>. | ||
317 | +# Maintainer: Thomas Waldmann <tw@waldmann-edv.de> | ||
318 | + | ||
319 | +"""Command-line parsing library | ||
320 | + | ||
321 | +This module is an optparse-inspired command-line parsing library that: | ||
322 | + | ||
323 | + - handles both optional and positional arguments | ||
324 | + - produces highly informative usage messages | ||
325 | + - supports parsers that dispatch to sub-parsers | ||
326 | + | ||
327 | +The following is a simple usage example that sums integers from the | ||
328 | +command-line and writes the result to a file:: | ||
329 | + | ||
330 | + parser = argparse.ArgumentParser( | ||
331 | + description='sum the integers at the command line') | ||
332 | + parser.add_argument( | ||
333 | + 'integers', metavar='int', nargs='+', type=int, | ||
334 | + help='an integer to be summed') | ||
335 | + parser.add_argument( | ||
336 | + '--log', default=sys.stdout, type=argparse.FileType('w'), | ||
337 | + help='the file where the sum should be written') | ||
338 | + args = parser.parse_args() | ||
339 | + args.log.write('%s' % sum(args.integers)) | ||
340 | + args.log.close() | ||
341 | + | ||
342 | +The module contains the following public classes: | ||
343 | + | ||
344 | + - ArgumentParser -- The main entry point for command-line parsing. As the | ||
345 | + example above shows, the add_argument() method is used to populate | ||
346 | + the parser with actions for optional and positional arguments. Then | ||
347 | + the parse_args() method is invoked to convert the args at the | ||
348 | + command-line into an object with attributes. | ||
349 | + | ||
350 | + - ArgumentError -- The exception raised by ArgumentParser objects when | ||
351 | + there are errors with the parser's actions. Errors raised while | ||
352 | + parsing the command-line are caught by ArgumentParser and emitted | ||
353 | + as command-line messages. | ||
354 | + | ||
355 | + - FileType -- A factory for defining types of files to be created. As the | ||
356 | + example above shows, instances of FileType are typically passed as | ||
357 | + the type= argument of add_argument() calls. | ||
358 | + | ||
359 | + - Action -- The base class for parser actions. Typically actions are | ||
360 | + selected by passing strings like 'store_true' or 'append_const' to | ||
361 | + the action= argument of add_argument(). However, for greater | ||
362 | + customization of ArgumentParser actions, subclasses of Action may | ||
363 | + be defined and passed as the action= argument. | ||
364 | + | ||
365 | + - HelpFormatter, RawDescriptionHelpFormatter, RawTextHelpFormatter, | ||
366 | + ArgumentDefaultsHelpFormatter -- Formatter classes which | ||
367 | + may be passed as the formatter_class= argument to the | ||
368 | + ArgumentParser constructor. HelpFormatter is the default, | ||
369 | + RawDescriptionHelpFormatter and RawTextHelpFormatter tell the parser | ||
370 | + not to change the formatting for help text, and | ||
371 | + ArgumentDefaultsHelpFormatter adds information about argument defaults | ||
372 | + to the help. | ||
373 | + | ||
374 | +All other classes in this module are considered implementation details. | ||
375 | +(Also note that HelpFormatter and RawDescriptionHelpFormatter are only | ||
376 | +considered public as object names -- the API of the formatter objects is | ||
377 | +still considered an implementation detail.) | ||
378 | +""" | ||
379 | + | ||
380 | +__version__ = '1.4.0' # we use our own version number independant of the | ||
381 | + # one in stdlib and we release this on pypi. | ||
382 | + | ||
383 | +__external_lib__ = True # to make sure the tests really test THIS lib, | ||
384 | + # not the builtin one in Python stdlib | ||
385 | + | ||
386 | +__all__ = [ | ||
387 | + 'ArgumentParser', | ||
388 | + 'ArgumentError', | ||
389 | + 'ArgumentTypeError', | ||
390 | + 'FileType', | ||
391 | + 'HelpFormatter', | ||
392 | + 'ArgumentDefaultsHelpFormatter', | ||
393 | + 'RawDescriptionHelpFormatter', | ||
394 | + 'RawTextHelpFormatter', | ||
395 | + 'Namespace', | ||
396 | + 'Action', | ||
397 | + 'ONE_OR_MORE', | ||
398 | + 'OPTIONAL', | ||
399 | + 'PARSER', | ||
400 | + 'REMAINDER', | ||
401 | + 'SUPPRESS', | ||
402 | + 'ZERO_OR_MORE', | ||
403 | +] | ||
404 | + | ||
405 | + | ||
406 | +import copy as _copy | ||
407 | +import os as _os | ||
408 | +import re as _re | ||
409 | +import sys as _sys | ||
410 | +import textwrap as _textwrap | ||
411 | + | ||
412 | +from gettext import gettext as _ | ||
413 | + | ||
414 | +try: | ||
415 | + set | ||
416 | +except NameError: | ||
417 | + # for python < 2.4 compatibility (sets module is there since 2.3): | ||
418 | + from sets import Set as set | ||
419 | + | ||
420 | +try: | ||
421 | + basestring | ||
422 | +except NameError: | ||
423 | + basestring = str | ||
424 | + | ||
425 | +try: | ||
426 | + sorted | ||
427 | +except NameError: | ||
428 | + # for python < 2.4 compatibility: | ||
429 | + def sorted(iterable, reverse=False): | ||
430 | + result = list(iterable) | ||
431 | + result.sort() | ||
432 | + if reverse: | ||
433 | + result.reverse() | ||
434 | + return result | ||
435 | + | ||
436 | + | ||
437 | +def _callable(obj): | ||
438 | + return hasattr(obj, '__call__') or hasattr(obj, '__bases__') | ||
439 | + | ||
440 | + | ||
441 | +SUPPRESS = '==SUPPRESS==' | ||
442 | + | ||
443 | +OPTIONAL = '?' | ||
444 | +ZERO_OR_MORE = '*' | ||
445 | +ONE_OR_MORE = '+' | ||
446 | +PARSER = 'A...' | ||
447 | +REMAINDER = '...' | ||
448 | +_UNRECOGNIZED_ARGS_ATTR = '_unrecognized_args' | ||
449 | + | ||
450 | +# ============================= | ||
451 | +# Utility functions and classes | ||
452 | +# ============================= | ||
453 | + | ||
454 | +class _AttributeHolder(object): | ||
455 | + """Abstract base class that provides __repr__. | ||
456 | + | ||
457 | + The __repr__ method returns a string in the format:: | ||
458 | + ClassName(attr=name, attr=name, ...) | ||
459 | + The attributes are determined either by a class-level attribute, | ||
460 | + '_kwarg_names', or by inspecting the instance __dict__. | ||
461 | + """ | ||
462 | + | ||
463 | + def __repr__(self): | ||
464 | + type_name = type(self).__name__ | ||
465 | + arg_strings = [] | ||
466 | + for arg in self._get_args(): | ||
467 | + arg_strings.append(repr(arg)) | ||
468 | + for name, value in self._get_kwargs(): | ||
469 | + arg_strings.append('%s=%r' % (name, value)) | ||
470 | + return '%s(%s)' % (type_name, ', '.join(arg_strings)) | ||
471 | + | ||
472 | + def _get_kwargs(self): | ||
473 | + return sorted(self.__dict__.items()) | ||
474 | + | ||
475 | + def _get_args(self): | ||
476 | + return [] | ||
477 | + | ||
478 | + | ||
479 | +def _ensure_value(namespace, name, value): | ||
480 | + if getattr(namespace, name, None) is None: | ||
481 | + setattr(namespace, name, value) | ||
482 | + return getattr(namespace, name) | ||
483 | + | ||
484 | + | ||
485 | +# =============== | ||
486 | +# Formatting Help | ||
487 | +# =============== | ||
488 | + | ||
489 | +class HelpFormatter(object): | ||
490 | + """Formatter for generating usage messages and argument help strings. | ||
491 | + | ||
492 | + Only the name of this class is considered a public API. All the methods | ||
493 | + provided by the class are considered an implementation detail. | ||
494 | + """ | ||
495 | + | ||
496 | + def __init__(self, | ||
497 | + prog, | ||
498 | + indent_increment=2, | ||
499 | + max_help_position=24, | ||
500 | + width=None): | ||
501 | + | ||
502 | + # default setting for width | ||
503 | + if width is None: | ||
504 | + try: | ||
505 | + width = int(_os.environ['COLUMNS']) | ||
506 | + except (KeyError, ValueError): | ||
507 | + width = 80 | ||
508 | + width -= 2 | ||
509 | + | ||
510 | + self._prog = prog | ||
511 | + self._indent_increment = indent_increment | ||
512 | + self._max_help_position = max_help_position | ||
513 | + self._width = width | ||
514 | + | ||
515 | + self._current_indent = 0 | ||
516 | + self._level = 0 | ||
517 | + self._action_max_length = 0 | ||
518 | + | ||
519 | + self._root_section = self._Section(self, None) | ||
520 | + self._current_section = self._root_section | ||
521 | + | ||
522 | + self._whitespace_matcher = _re.compile(r'\s+') | ||
523 | + self._long_break_matcher = _re.compile(r'\n\n\n+') | ||
524 | + | ||
525 | + # =============================== | ||
526 | + # Section and indentation methods | ||
527 | + # =============================== | ||
528 | + def _indent(self): | ||
529 | + self._current_indent += self._indent_increment | ||
530 | + self._level += 1 | ||
531 | + | ||
532 | + def _dedent(self): | ||
533 | + self._current_indent -= self._indent_increment | ||
534 | + assert self._current_indent >= 0, 'Indent decreased below 0.' | ||
535 | + self._level -= 1 | ||
536 | + | ||
537 | + class _Section(object): | ||
538 | + | ||
539 | + def __init__(self, formatter, parent, heading=None): | ||
540 | + self.formatter = formatter | ||
541 | + self.parent = parent | ||
542 | + self.heading = heading | ||
543 | + self.items = [] | ||
544 | + | ||
545 | + def format_help(self): | ||
546 | + # format the indented section | ||
547 | + if self.parent is not None: | ||
548 | + self.formatter._indent() | ||
549 | + join = self.formatter._join_parts | ||
550 | + for func, args in self.items: | ||
551 | + func(*args) | ||
552 | + item_help = join([func(*args) for func, args in self.items]) | ||
553 | + if self.parent is not None: | ||
554 | + self.formatter._dedent() | ||
555 | + | ||
556 | + # return nothing if the section was empty | ||
557 | + if not item_help: | ||
558 | + return '' | ||
559 | + | ||
560 | + # add the heading if the section was non-empty | ||
561 | + if self.heading is not SUPPRESS and self.heading is not None: | ||
562 | + current_indent = self.formatter._current_indent | ||
563 | + heading = '%*s%s:\n' % (current_indent, '', self.heading) | ||
564 | + else: | ||
565 | + heading = '' | ||
566 | + | ||
567 | + # join the section-initial newline, the heading and the help | ||
568 | + return join(['\n', heading, item_help, '\n']) | ||
569 | + | ||
570 | + def _add_item(self, func, args): | ||
571 | + self._current_section.items.append((func, args)) | ||
572 | + | ||
573 | + # ======================== | ||
574 | + # Message building methods | ||
575 | + # ======================== | ||
576 | + def start_section(self, heading): | ||
577 | + self._indent() | ||
578 | + section = self._Section(self, self._current_section, heading) | ||
579 | + self._add_item(section.format_help, []) | ||
580 | + self._current_section = section | ||
581 | + | ||
582 | + def end_section(self): | ||
583 | + self._current_section = self._current_section.parent | ||
584 | + self._dedent() | ||
585 | + | ||
586 | + def add_text(self, text): | ||
587 | + if text is not SUPPRESS and text is not None: | ||
588 | + self._add_item(self._format_text, [text]) | ||
589 | + | ||
590 | + def add_usage(self, usage, actions, groups, prefix=None): | ||
591 | + if usage is not SUPPRESS: | ||
592 | + args = usage, actions, groups, prefix | ||
593 | + self._add_item(self._format_usage, args) | ||
594 | + | ||
595 | + def add_argument(self, action): | ||
596 | + if action.help is not SUPPRESS: | ||
597 | + | ||
598 | + # find all invocations | ||
599 | + get_invocation = self._format_action_invocation | ||
600 | + invocations = [get_invocation(action)] | ||
601 | + for subaction in self._iter_indented_subactions(action): | ||
602 | + invocations.append(get_invocation(subaction)) | ||
603 | + | ||
604 | + # update the maximum item length | ||
605 | + invocation_length = max([len(s) for s in invocations]) | ||
606 | + action_length = invocation_length + self._current_indent | ||
607 | + self._action_max_length = max(self._action_max_length, | ||
608 | + action_length) | ||
609 | + | ||
610 | + # add the item to the list | ||
611 | + self._add_item(self._format_action, [action]) | ||
612 | + | ||
613 | + def add_arguments(self, actions): | ||
614 | + for action in actions: | ||
615 | + self.add_argument(action) | ||
616 | + | ||
617 | + # ======================= | ||
618 | + # Help-formatting methods | ||
619 | + # ======================= | ||
620 | + def format_help(self): | ||
621 | + help = self._root_section.format_help() | ||
622 | + if help: | ||
623 | + help = self._long_break_matcher.sub('\n\n', help) | ||
624 | + help = help.strip('\n') + '\n' | ||
625 | + return help | ||
626 | + | ||
627 | + def _join_parts(self, part_strings): | ||
628 | + return ''.join([part | ||
629 | + for part in part_strings | ||
630 | + if part and part is not SUPPRESS]) | ||
631 | + | ||
632 | + def _format_usage(self, usage, actions, groups, prefix): | ||
633 | + if prefix is None: | ||
634 | + prefix = _('usage: ') | ||
635 | + | ||
636 | + # if usage is specified, use that | ||
637 | + if usage is not None: | ||
638 | + usage = usage % dict(prog=self._prog) | ||
639 | + | ||
640 | + # if no optionals or positionals are available, usage is just prog | ||
641 | + elif usage is None and not actions: | ||
642 | + usage = '%(prog)s' % dict(prog=self._prog) | ||
643 | + | ||
644 | + # if optionals and positionals are available, calculate usage | ||
645 | + elif usage is None: | ||
646 | + prog = '%(prog)s' % dict(prog=self._prog) | ||
647 | + | ||
648 | + # split optionals from positionals | ||
649 | + optionals = [] | ||
650 | + positionals = [] | ||
651 | + for action in actions: | ||
652 | + if action.option_strings: | ||
653 | + optionals.append(action) | ||
654 | + else: | ||
655 | + positionals.append(action) | ||
656 | + | ||
657 | + # build full usage string | ||
658 | + format = self._format_actions_usage | ||
659 | + action_usage = format(optionals + positionals, groups) | ||
660 | + usage = ' '.join([s for s in [prog, action_usage] if s]) | ||
661 | + | ||
662 | + # wrap the usage parts if it's too long | ||
663 | + text_width = self._width - self._current_indent | ||
664 | + if len(prefix) + len(usage) > text_width: | ||
665 | + | ||
666 | + # break usage into wrappable parts | ||
667 | + part_regexp = r'\(.*?\)+|\[.*?\]+|\S+' | ||
668 | + opt_usage = format(optionals, groups) | ||
669 | + pos_usage = format(positionals, groups) | ||
670 | + opt_parts = _re.findall(part_regexp, opt_usage) | ||
671 | + pos_parts = _re.findall(part_regexp, pos_usage) | ||
672 | + assert ' '.join(opt_parts) == opt_usage | ||
673 | + assert ' '.join(pos_parts) == pos_usage | ||
674 | + | ||
675 | + # helper for wrapping lines | ||
676 | + def get_lines(parts, indent, prefix=None): | ||
677 | + lines = [] | ||
678 | + line = [] | ||
679 | + if prefix is not None: | ||
680 | + line_len = len(prefix) - 1 | ||
681 | + else: | ||
682 | + line_len = len(indent) - 1 | ||
683 | + for part in parts: | ||
684 | + if line_len + 1 + len(part) > text_width: | ||
685 | + lines.append(indent + ' '.join(line)) | ||
686 | + line = [] | ||
687 | + line_len = len(indent) - 1 | ||
688 | + line.append(part) | ||
689 | + line_len += len(part) + 1 | ||
690 | + if line: | ||
691 | + lines.append(indent + ' '.join(line)) | ||
692 | + if prefix is not None: | ||
693 | + lines[0] = lines[0][len(indent):] | ||
694 | + return lines | ||
695 | + | ||
696 | + # if prog is short, follow it with optionals or positionals | ||
697 | + if len(prefix) + len(prog) <= 0.75 * text_width: | ||
698 | + indent = ' ' * (len(prefix) + len(prog) + 1) | ||
699 | + if opt_parts: | ||
700 | + lines = get_lines([prog] + opt_parts, indent, prefix) | ||
701 | + lines.extend(get_lines(pos_parts, indent)) | ||
702 | + elif pos_parts: | ||
703 | + lines = get_lines([prog] + pos_parts, indent, prefix) | ||
704 | + else: | ||
705 | + lines = [prog] | ||
706 | + | ||
707 | + # if prog is long, put it on its own line | ||
708 | + else: | ||
709 | + indent = ' ' * len(prefix) | ||
710 | + parts = opt_parts + pos_parts | ||
711 | + lines = get_lines(parts, indent) | ||
712 | + if len(lines) > 1: | ||
713 | + lines = [] | ||
714 | + lines.extend(get_lines(opt_parts, indent)) | ||
715 | + lines.extend(get_lines(pos_parts, indent)) | ||
716 | + lines = [prog] + lines | ||
717 | + | ||
718 | + # join lines into usage | ||
719 | + usage = '\n'.join(lines) | ||
720 | + | ||
721 | + # prefix with 'usage:' | ||
722 | + return '%s%s\n\n' % (prefix, usage) | ||
723 | + | ||
724 | + def _format_actions_usage(self, actions, groups): | ||
725 | + # find group indices and identify actions in groups | ||
726 | + group_actions = set() | ||
727 | + inserts = {} | ||
728 | + for group in groups: | ||
729 | + try: | ||
730 | + start = actions.index(group._group_actions[0]) | ||
731 | + except ValueError: | ||
732 | + continue | ||
733 | + else: | ||
734 | + end = start + len(group._group_actions) | ||
735 | + if actions[start:end] == group._group_actions: | ||
736 | + for action in group._group_actions: | ||
737 | + group_actions.add(action) | ||
738 | + if not group.required: | ||
739 | + if start in inserts: | ||
740 | + inserts[start] += ' [' | ||
741 | + else: | ||
742 | + inserts[start] = '[' | ||
743 | + inserts[end] = ']' | ||
744 | + else: | ||
745 | + if start in inserts: | ||
746 | + inserts[start] += ' (' | ||
747 | + else: | ||
748 | + inserts[start] = '(' | ||
749 | + inserts[end] = ')' | ||
750 | + for i in range(start + 1, end): | ||
751 | + inserts[i] = '|' | ||
752 | + | ||
753 | + # collect all actions format strings | ||
754 | + parts = [] | ||
755 | + for i, action in enumerate(actions): | ||
756 | + | ||
757 | + # suppressed arguments are marked with None | ||
758 | + # remove | separators for suppressed arguments | ||
759 | + if action.help is SUPPRESS: | ||
760 | + parts.append(None) | ||
761 | + if inserts.get(i) == '|': | ||
762 | + inserts.pop(i) | ||
763 | + elif inserts.get(i + 1) == '|': | ||
764 | + inserts.pop(i + 1) | ||
765 | + | ||
766 | + # produce all arg strings | ||
767 | + elif not action.option_strings: | ||
768 | + part = self._format_args(action, action.dest) | ||
769 | + | ||
770 | + # if it's in a group, strip the outer [] | ||
771 | + if action in group_actions: | ||
772 | + if part[0] == '[' and part[-1] == ']': | ||
773 | + part = part[1:-1] | ||
774 | + | ||
775 | + # add the action string to the list | ||
776 | + parts.append(part) | ||
777 | + | ||
778 | + # produce the first way to invoke the option in brackets | ||
779 | + else: | ||
780 | + option_string = action.option_strings[0] | ||
781 | + | ||
782 | + # if the Optional doesn't take a value, format is: | ||
783 | + # -s or --long | ||
784 | + if action.nargs == 0: | ||
785 | + part = '%s' % option_string | ||
786 | + | ||
787 | + # if the Optional takes a value, format is: | ||
788 | + # -s ARGS or --long ARGS | ||
789 | + else: | ||
790 | + default = action.dest.upper() | ||
791 | + args_string = self._format_args(action, default) | ||
792 | + part = '%s %s' % (option_string, args_string) | ||
793 | + | ||
794 | + # make it look optional if it's not required or in a group | ||
795 | + if not action.required and action not in group_actions: | ||
796 | + part = '[%s]' % part | ||
797 | + | ||
798 | + # add the action string to the list | ||
799 | + parts.append(part) | ||
800 | + | ||
801 | + # insert things at the necessary indices | ||
802 | + for i in sorted(inserts, reverse=True): | ||
803 | + parts[i:i] = [inserts[i]] | ||
804 | + | ||
805 | + # join all the action items with spaces | ||
806 | + text = ' '.join([item for item in parts if item is not None]) | ||
807 | + | ||
808 | + # clean up separators for mutually exclusive groups | ||
809 | + open = r'[\[(]' | ||
810 | + close = r'[\])]' | ||
811 | + text = _re.sub(r'(%s) ' % open, r'\1', text) | ||
812 | + text = _re.sub(r' (%s)' % close, r'\1', text) | ||
813 | + text = _re.sub(r'%s *%s' % (open, close), r'', text) | ||
814 | + text = _re.sub(r'\(([^|]*)\)', r'\1', text) | ||
815 | + text = text.strip() | ||
816 | + | ||
817 | + # return the text | ||
818 | + return text | ||
819 | + | ||
820 | + def _format_text(self, text): | ||
821 | + if '%(prog)' in text: | ||
822 | + text = text % dict(prog=self._prog) | ||
823 | + text_width = self._width - self._current_indent | ||
824 | + indent = ' ' * self._current_indent | ||
825 | + return self._fill_text(text, text_width, indent) + '\n\n' | ||
826 | + | ||
827 | + def _format_action(self, action): | ||
828 | + # determine the required width and the entry label | ||
829 | + help_position = min(self._action_max_length + 2, | ||
830 | + self._max_help_position) | ||
831 | + help_width = self._width - help_position | ||
832 | + action_width = help_position - self._current_indent - 2 | ||
833 | + action_header = self._format_action_invocation(action) | ||
834 | + | ||
835 | + # ho nelp; start on same line and add a final newline | ||
836 | + if not action.help: | ||
837 | + tup = self._current_indent, '', action_header | ||
838 | + action_header = '%*s%s\n' % tup | ||
839 | + | ||
840 | + # short action name; start on the same line and pad two spaces | ||
841 | + elif len(action_header) <= action_width: | ||
842 | + tup = self._current_indent, '', action_width, action_header | ||
843 | + action_header = '%*s%-*s ' % tup | ||
844 | + indent_first = 0 | ||
845 | + | ||
846 | + # long action name; start on the next line | ||
847 | + else: | ||
848 | + tup = self._current_indent, '', action_header | ||
849 | + action_header = '%*s%s\n' % tup | ||
850 | + indent_first = help_position | ||
851 | + | ||
852 | + # collect the pieces of the action help | ||
853 | + parts = [action_header] | ||
854 | + | ||
855 | + # if there was help for the action, add lines of help text | ||
856 | + if action.help: | ||
857 | + help_text = self._expand_help(action) | ||
858 | + help_lines = self._split_lines(help_text, help_width) | ||
859 | + parts.append('%*s%s\n' % (indent_first, '', help_lines[0])) | ||
860 | + for line in help_lines[1:]: | ||
861 | + parts.append('%*s%s\n' % (help_position, '', line)) | ||
862 | + | ||
863 | + # or add a newline if the description doesn't end with one | ||
864 | + elif not action_header.endswith('\n'): | ||
865 | + parts.append('\n') | ||
866 | + | ||
867 | + # if there are any sub-actions, add their help as well | ||
868 | + for subaction in self._iter_indented_subactions(action): | ||
869 | + parts.append(self._format_action(subaction)) | ||
870 | + | ||
871 | + # return a single string | ||
872 | + return self._join_parts(parts) | ||
873 | + | ||
874 | + def _format_action_invocation(self, action): | ||
875 | + if not action.option_strings: | ||
876 | + metavar, = self._metavar_formatter(action, action.dest)(1) | ||
877 | + return metavar | ||
878 | + | ||
879 | + else: | ||
880 | + parts = [] | ||
881 | + | ||
882 | + # if the Optional doesn't take a value, format is: | ||
883 | + # -s, --long | ||
884 | + if action.nargs == 0: | ||
885 | + parts.extend(action.option_strings) | ||
886 | + | ||
887 | + # if the Optional takes a value, format is: | ||
888 | + # -s ARGS, --long ARGS | ||
889 | + else: | ||
890 | + default = action.dest.upper() | ||
891 | + args_string = self._format_args(action, default) | ||
892 | + for option_string in action.option_strings: | ||
893 | + parts.append('%s %s' % (option_string, args_string)) | ||
894 | + | ||
895 | + return ', '.join(parts) | ||
896 | + | ||
897 | + def _metavar_formatter(self, action, default_metavar): | ||
898 | + if action.metavar is not None: | ||
899 | + result = action.metavar | ||
900 | + elif action.choices is not None: | ||
901 | + choice_strs = [str(choice) for choice in action.choices] | ||
902 | + result = '{%s}' % ','.join(choice_strs) | ||
903 | + else: | ||
904 | + result = default_metavar | ||
905 | + | ||
906 | + def format(tuple_size): | ||
907 | + if isinstance(result, tuple): | ||
908 | + return result | ||
909 | + else: | ||
910 | + return (result, ) * tuple_size | ||
911 | + return format | ||
912 | + | ||
913 | + def _format_args(self, action, default_metavar): | ||
914 | + get_metavar = self._metavar_formatter(action, default_metavar) | ||
915 | + if action.nargs is None: | ||
916 | + result = '%s' % get_metavar(1) | ||
917 | + elif action.nargs == OPTIONAL: | ||
918 | + result = '[%s]' % get_metavar(1) | ||
919 | + elif action.nargs == ZERO_OR_MORE: | ||
920 | + result = '[%s [%s ...]]' % get_metavar(2) | ||
921 | + elif action.nargs == ONE_OR_MORE: | ||
922 | + result = '%s [%s ...]' % get_metavar(2) | ||
923 | + elif action.nargs == REMAINDER: | ||
924 | + result = '...' | ||
925 | + elif action.nargs == PARSER: | ||
926 | + result = '%s ...' % get_metavar(1) | ||
927 | + else: | ||
928 | + formats = ['%s' for _ in range(action.nargs)] | ||
929 | + result = ' '.join(formats) % get_metavar(action.nargs) | ||
930 | + return result | ||
931 | + | ||
932 | + def _expand_help(self, action): | ||
933 | + params = dict(vars(action), prog=self._prog) | ||
934 | + for name in list(params): | ||
935 | + if params[name] is SUPPRESS: | ||
936 | + del params[name] | ||
937 | + for name in list(params): | ||
938 | + if hasattr(params[name], '__name__'): | ||
939 | + params[name] = params[name].__name__ | ||
940 | + if params.get('choices') is not None: | ||
941 | + choices_str = ', '.join([str(c) for c in params['choices']]) | ||
942 | + params['choices'] = choices_str | ||
943 | + return self._get_help_string(action) % params | ||
944 | + | ||
945 | + def _iter_indented_subactions(self, action): | ||
946 | + try: | ||
947 | + get_subactions = action._get_subactions | ||
948 | + except AttributeError: | ||
949 | + pass | ||
950 | + else: | ||
951 | + self._indent() | ||
952 | + for subaction in get_subactions(): | ||
953 | + yield subaction | ||
954 | + self._dedent() | ||
955 | + | ||
956 | + def _split_lines(self, text, width): | ||
957 | + text = self._whitespace_matcher.sub(' ', text).strip() | ||
958 | + return _textwrap.wrap(text, width) | ||
959 | + | ||
960 | + def _fill_text(self, text, width, indent): | ||
961 | + text = self._whitespace_matcher.sub(' ', text).strip() | ||
962 | + return _textwrap.fill(text, width, initial_indent=indent, | ||
963 | + subsequent_indent=indent) | ||
964 | + | ||
965 | + def _get_help_string(self, action): | ||
966 | + return action.help | ||
967 | + | ||
968 | + | ||
969 | +class RawDescriptionHelpFormatter(HelpFormatter): | ||
970 | + """Help message formatter which retains any formatting in descriptions. | ||
971 | + | ||
972 | + Only the name of this class is considered a public API. All the methods | ||
973 | + provided by the class are considered an implementation detail. | ||
974 | + """ | ||
975 | + | ||
976 | + def _fill_text(self, text, width, indent): | ||
977 | + return ''.join([indent + line for line in text.splitlines(True)]) | ||
978 | + | ||
979 | + | ||
980 | +class RawTextHelpFormatter(RawDescriptionHelpFormatter): | ||
981 | + """Help message formatter which retains formatting of all help text. | ||
982 | + | ||
983 | + Only the name of this class is considered a public API. All the methods | ||
984 | + provided by the class are considered an implementation detail. | ||
985 | + """ | ||
986 | + | ||
987 | + def _split_lines(self, text, width): | ||
988 | + return text.splitlines() | ||
989 | + | ||
990 | + | ||
991 | +class ArgumentDefaultsHelpFormatter(HelpFormatter): | ||
992 | + """Help message formatter which adds default values to argument help. | ||
993 | + | ||
994 | + Only the name of this class is considered a public API. All the methods | ||
995 | + provided by the class are considered an implementation detail. | ||
996 | + """ | ||
997 | + | ||
998 | + def _get_help_string(self, action): | ||
999 | + help = action.help | ||
1000 | + if '%(default)' not in action.help: | ||
1001 | + if action.default is not SUPPRESS: | ||
1002 | + defaulting_nargs = [OPTIONAL, ZERO_OR_MORE] | ||
1003 | + if action.option_strings or action.nargs in defaulting_nargs: | ||
1004 | + help += ' (default: %(default)s)' | ||
1005 | + return help | ||
1006 | + | ||
1007 | + | ||
1008 | +# ===================== | ||
1009 | +# Options and Arguments | ||
1010 | +# ===================== | ||
1011 | + | ||
1012 | +def _get_action_name(argument): | ||
1013 | + if argument is None: | ||
1014 | + return None | ||
1015 | + elif argument.option_strings: | ||
1016 | + return '/'.join(argument.option_strings) | ||
1017 | + elif argument.metavar not in (None, SUPPRESS): | ||
1018 | + return argument.metavar | ||
1019 | + elif argument.dest not in (None, SUPPRESS): | ||
1020 | + return argument.dest | ||
1021 | + else: | ||
1022 | + return None | ||
1023 | + | ||
1024 | + | ||
1025 | +class ArgumentError(Exception): | ||
1026 | + """An error from creating or using an argument (optional or positional). | ||
1027 | + | ||
1028 | + The string value of this exception is the message, augmented with | ||
1029 | + information about the argument that caused it. | ||
1030 | + """ | ||
1031 | + | ||
1032 | + def __init__(self, argument, message): | ||
1033 | + self.argument_name = _get_action_name(argument) | ||
1034 | + self.message = message | ||
1035 | + | ||
1036 | + def __str__(self): | ||
1037 | + if self.argument_name is None: | ||
1038 | + format = '%(message)s' | ||
1039 | + else: | ||
1040 | + format = 'argument %(argument_name)s: %(message)s' | ||
1041 | + return format % dict(message=self.message, | ||
1042 | + argument_name=self.argument_name) | ||
1043 | + | ||
1044 | + | ||
1045 | +class ArgumentTypeError(Exception): | ||
1046 | + """An error from trying to convert a command line string to a type.""" | ||
1047 | + pass | ||
1048 | + | ||
1049 | + | ||
1050 | +# ============== | ||
1051 | +# Action classes | ||
1052 | +# ============== | ||
1053 | + | ||
1054 | +class Action(_AttributeHolder): | ||
1055 | + """Information about how to convert command line strings to Python objects. | ||
1056 | + | ||
1057 | + Action objects are used by an ArgumentParser to represent the information | ||
1058 | + needed to parse a single argument from one or more strings from the | ||
1059 | + command line. The keyword arguments to the Action constructor are also | ||
1060 | + all attributes of Action instances. | ||
1061 | + | ||
1062 | + Keyword Arguments: | ||
1063 | + | ||
1064 | + - option_strings -- A list of command-line option strings which | ||
1065 | + should be associated with this action. | ||
1066 | + | ||
1067 | + - dest -- The name of the attribute to hold the created object(s) | ||
1068 | + | ||
1069 | + - nargs -- The number of command-line arguments that should be | ||
1070 | + consumed. By default, one argument will be consumed and a single | ||
1071 | + value will be produced. Other values include: | ||
1072 | + - N (an integer) consumes N arguments (and produces a list) | ||
1073 | + - '?' consumes zero or one arguments | ||
1074 | + - '*' consumes zero or more arguments (and produces a list) | ||
1075 | + - '+' consumes one or more arguments (and produces a list) | ||
1076 | + Note that the difference between the default and nargs=1 is that | ||
1077 | + with the default, a single value will be produced, while with | ||
1078 | + nargs=1, a list containing a single value will be produced. | ||
1079 | + | ||
1080 | + - const -- The value to be produced if the option is specified and the | ||
1081 | + option uses an action that takes no values. | ||
1082 | + | ||
1083 | + - default -- The value to be produced if the option is not specified. | ||
1084 | + | ||
1085 | + - type -- The type which the command-line arguments should be converted | ||
1086 | + to, should be one of 'string', 'int', 'float', 'complex' or a | ||
1087 | + callable object that accepts a single string argument. If None, | ||
1088 | + 'string' is assumed. | ||
1089 | + | ||
1090 | + - choices -- A container of values that should be allowed. If not None, | ||
1091 | + after a command-line argument has been converted to the appropriate | ||
1092 | + type, an exception will be raised if it is not a member of this | ||
1093 | + collection. | ||
1094 | + | ||
1095 | + - required -- True if the action must always be specified at the | ||
1096 | + command line. This is only meaningful for optional command-line | ||
1097 | + arguments. | ||
1098 | + | ||
1099 | + - help -- The help string describing the argument. | ||
1100 | + | ||
1101 | + - metavar -- The name to be used for the option's argument with the | ||
1102 | + help string. If None, the 'dest' value will be used as the name. | ||
1103 | + """ | ||
1104 | + | ||
1105 | + def __init__(self, | ||
1106 | + option_strings, | ||
1107 | + dest, | ||
1108 | + nargs=None, | ||
1109 | + const=None, | ||
1110 | + default=None, | ||
1111 | + type=None, | ||
1112 | + choices=None, | ||
1113 | + required=False, | ||
1114 | + help=None, | ||
1115 | + metavar=None): | ||
1116 | + self.option_strings = option_strings | ||
1117 | + self.dest = dest | ||
1118 | + self.nargs = nargs | ||
1119 | + self.const = const | ||
1120 | + self.default = default | ||
1121 | + self.type = type | ||
1122 | + self.choices = choices | ||
1123 | + self.required = required | ||
1124 | + self.help = help | ||
1125 | + self.metavar = metavar | ||
1126 | + | ||
1127 | + def _get_kwargs(self): | ||
1128 | + names = [ | ||
1129 | + 'option_strings', | ||
1130 | + 'dest', | ||
1131 | + 'nargs', | ||
1132 | + 'const', | ||
1133 | + 'default', | ||
1134 | + 'type', | ||
1135 | + 'choices', | ||
1136 | + 'help', | ||
1137 | + 'metavar', | ||
1138 | + ] | ||
1139 | + return [(name, getattr(self, name)) for name in names] | ||
1140 | + | ||
1141 | + def __call__(self, parser, namespace, values, option_string=None): | ||
1142 | + raise NotImplementedError(_('.__call__() not defined')) | ||
1143 | + | ||
1144 | + | ||
1145 | +class _StoreAction(Action): | ||
1146 | + | ||
1147 | + def __init__(self, | ||
1148 | + option_strings, | ||
1149 | + dest, | ||
1150 | + nargs=None, | ||
1151 | + const=None, | ||
1152 | + default=None, | ||
1153 | + type=None, | ||
1154 | + choices=None, | ||
1155 | + required=False, | ||
1156 | + help=None, | ||
1157 | + metavar=None): | ||
1158 | + if nargs == 0: | ||
1159 | + raise ValueError('nargs for store actions must be > 0; if you ' | ||
1160 | + 'have nothing to store, actions such as store ' | ||
1161 | + 'true or store const may be more appropriate') | ||
1162 | + if const is not None and nargs != OPTIONAL: | ||
1163 | + raise ValueError('nargs must be %r to supply const' % OPTIONAL) | ||
1164 | + super(_StoreAction, self).__init__( | ||
1165 | + option_strings=option_strings, | ||
1166 | + dest=dest, | ||
1167 | + nargs=nargs, | ||
1168 | + const=const, | ||
1169 | + default=default, | ||
1170 | + type=type, | ||
1171 | + choices=choices, | ||
1172 | + required=required, | ||
1173 | + help=help, | ||
1174 | + metavar=metavar) | ||
1175 | + | ||
1176 | + def __call__(self, parser, namespace, values, option_string=None): | ||
1177 | + setattr(namespace, self.dest, values) | ||
1178 | + | ||
1179 | + | ||
1180 | +class _StoreConstAction(Action): | ||
1181 | + | ||
1182 | + def __init__(self, | ||
1183 | + option_strings, | ||
1184 | + dest, | ||
1185 | + const, | ||
1186 | + default=None, | ||
1187 | + required=False, | ||
1188 | + help=None, | ||
1189 | + metavar=None): | ||
1190 | + super(_StoreConstAction, self).__init__( | ||
1191 | + option_strings=option_strings, | ||
1192 | + dest=dest, | ||
1193 | + nargs=0, | ||
1194 | + const=const, | ||
1195 | + default=default, | ||
1196 | + required=required, | ||
1197 | + help=help) | ||
1198 | + | ||
1199 | + def __call__(self, parser, namespace, values, option_string=None): | ||
1200 | + setattr(namespace, self.dest, self.const) | ||
1201 | + | ||
1202 | + | ||
1203 | +class _StoreTrueAction(_StoreConstAction): | ||
1204 | + | ||
1205 | + def __init__(self, | ||
1206 | + option_strings, | ||
1207 | + dest, | ||
1208 | + default=False, | ||
1209 | + required=False, | ||
1210 | + help=None): | ||
1211 | + super(_StoreTrueAction, self).__init__( | ||
1212 | + option_strings=option_strings, | ||
1213 | + dest=dest, | ||
1214 | + const=True, | ||
1215 | + default=default, | ||
1216 | + required=required, | ||
1217 | + help=help) | ||
1218 | + | ||
1219 | + | ||
1220 | +class _StoreFalseAction(_StoreConstAction): | ||
1221 | + | ||
1222 | + def __init__(self, | ||
1223 | + option_strings, | ||
1224 | + dest, | ||
1225 | + default=True, | ||
1226 | + required=False, | ||
1227 | + help=None): | ||
1228 | + super(_StoreFalseAction, self).__init__( | ||
1229 | + option_strings=option_strings, | ||
1230 | + dest=dest, | ||
1231 | + const=False, | ||
1232 | + default=default, | ||
1233 | + required=required, | ||
1234 | + help=help) | ||
1235 | + | ||
1236 | + | ||
1237 | +class _AppendAction(Action): | ||
1238 | + | ||
1239 | + def __init__(self, | ||
1240 | + option_strings, | ||
1241 | + dest, | ||
1242 | + nargs=None, | ||
1243 | + const=None, | ||
1244 | + default=None, | ||
1245 | + type=None, | ||
1246 | + choices=None, | ||
1247 | + required=False, | ||
1248 | + help=None, | ||
1249 | + metavar=None): | ||
1250 | + if nargs == 0: | ||
1251 | + raise ValueError('nargs for append actions must be > 0; if arg ' | ||
1252 | + 'strings are not supplying the value to append, ' | ||
1253 | + 'the append const action may be more appropriate') | ||
1254 | + if const is not None and nargs != OPTIONAL: | ||
1255 | + raise ValueError('nargs must be %r to supply const' % OPTIONAL) | ||
1256 | + super(_AppendAction, self).__init__( | ||
1257 | + option_strings=option_strings, | ||
1258 | + dest=dest, | ||
1259 | + nargs=nargs, | ||
1260 | + const=const, | ||
1261 | + default=default, | ||
1262 | + type=type, | ||
1263 | + choices=choices, | ||
1264 | + required=required, | ||
1265 | + help=help, | ||
1266 | + metavar=metavar) | ||
1267 | + | ||
1268 | + def __call__(self, parser, namespace, values, option_string=None): | ||
1269 | + items = _copy.copy(_ensure_value(namespace, self.dest, [])) | ||
1270 | + items.append(values) | ||
1271 | + setattr(namespace, self.dest, items) | ||
1272 | + | ||
1273 | + | ||
1274 | +class _AppendConstAction(Action): | ||
1275 | + | ||
1276 | + def __init__(self, | ||
1277 | + option_strings, | ||
1278 | + dest, | ||
1279 | + const, | ||
1280 | + default=None, | ||
1281 | + required=False, | ||
1282 | + help=None, | ||
1283 | + metavar=None): | ||
1284 | + super(_AppendConstAction, self).__init__( | ||
1285 | + option_strings=option_strings, | ||
1286 | + dest=dest, | ||
1287 | + nargs=0, | ||
1288 | + const=const, | ||
1289 | + default=default, | ||
1290 | + required=required, | ||
1291 | + help=help, | ||
1292 | + metavar=metavar) | ||
1293 | + | ||
1294 | + def __call__(self, parser, namespace, values, option_string=None): | ||
1295 | + items = _copy.copy(_ensure_value(namespace, self.dest, [])) | ||
1296 | + items.append(self.const) | ||
1297 | + setattr(namespace, self.dest, items) | ||
1298 | + | ||
1299 | + | ||
1300 | +class _CountAction(Action): | ||
1301 | + | ||
1302 | + def __init__(self, | ||
1303 | + option_strings, | ||
1304 | + dest, | ||
1305 | + default=None, | ||
1306 | + required=False, | ||
1307 | + help=None): | ||
1308 | + super(_CountAction, self).__init__( | ||
1309 | + option_strings=option_strings, | ||
1310 | + dest=dest, | ||
1311 | + nargs=0, | ||
1312 | + default=default, | ||
1313 | + required=required, | ||
1314 | + help=help) | ||
1315 | + | ||
1316 | + def __call__(self, parser, namespace, values, option_string=None): | ||
1317 | + new_count = _ensure_value(namespace, self.dest, 0) + 1 | ||
1318 | + setattr(namespace, self.dest, new_count) | ||
1319 | + | ||
1320 | + | ||
1321 | +class _HelpAction(Action): | ||
1322 | + | ||
1323 | + def __init__(self, | ||
1324 | + option_strings, | ||
1325 | + dest=SUPPRESS, | ||
1326 | + default=SUPPRESS, | ||
1327 | + help=None): | ||
1328 | + super(_HelpAction, self).__init__( | ||
1329 | + option_strings=option_strings, | ||
1330 | + dest=dest, | ||
1331 | + default=default, | ||
1332 | + nargs=0, | ||
1333 | + help=help) | ||
1334 | + | ||
1335 | + def __call__(self, parser, namespace, values, option_string=None): | ||
1336 | + parser.print_help() | ||
1337 | + parser.exit() | ||
1338 | + | ||
1339 | + | ||
1340 | +class _VersionAction(Action): | ||
1341 | + | ||
1342 | + def __init__(self, | ||
1343 | + option_strings, | ||
1344 | + version=None, | ||
1345 | + dest=SUPPRESS, | ||
1346 | + default=SUPPRESS, | ||
1347 | + help="show program's version number and exit"): | ||
1348 | + super(_VersionAction, self).__init__( | ||
1349 | + option_strings=option_strings, | ||
1350 | + dest=dest, | ||
1351 | + default=default, | ||
1352 | + nargs=0, | ||
1353 | + help=help) | ||
1354 | + self.version = version | ||
1355 | + | ||
1356 | + def __call__(self, parser, namespace, values, option_string=None): | ||
1357 | + version = self.version | ||
1358 | + if version is None: | ||
1359 | + version = parser.version | ||
1360 | + formatter = parser._get_formatter() | ||
1361 | + formatter.add_text(version) | ||
1362 | + parser.exit(message=formatter.format_help()) | ||
1363 | + | ||
1364 | + | ||
1365 | +class _SubParsersAction(Action): | ||
1366 | + | ||
1367 | + class _ChoicesPseudoAction(Action): | ||
1368 | + | ||
1369 | + def __init__(self, name, aliases, help): | ||
1370 | + metavar = dest = name | ||
1371 | + if aliases: | ||
1372 | + metavar += ' (%s)' % ', '.join(aliases) | ||
1373 | + sup = super(_SubParsersAction._ChoicesPseudoAction, self) | ||
1374 | + sup.__init__(option_strings=[], dest=dest, help=help, | ||
1375 | + metavar=metavar) | ||
1376 | + | ||
1377 | + def __init__(self, | ||
1378 | + option_strings, | ||
1379 | + prog, | ||
1380 | + parser_class, | ||
1381 | + dest=SUPPRESS, | ||
1382 | + help=None, | ||
1383 | + metavar=None): | ||
1384 | + | ||
1385 | + self._prog_prefix = prog | ||
1386 | + self._parser_class = parser_class | ||
1387 | + self._name_parser_map = {} | ||
1388 | + self._choices_actions = [] | ||
1389 | + | ||
1390 | + super(_SubParsersAction, self).__init__( | ||
1391 | + option_strings=option_strings, | ||
1392 | + dest=dest, | ||
1393 | + nargs=PARSER, | ||
1394 | + choices=self._name_parser_map, | ||
1395 | + help=help, | ||
1396 | + metavar=metavar) | ||
1397 | + | ||
1398 | + def add_parser(self, name, **kwargs): | ||
1399 | + # set prog from the existing prefix | ||
1400 | + if kwargs.get('prog') is None: | ||
1401 | + kwargs['prog'] = '%s %s' % (self._prog_prefix, name) | ||
1402 | + | ||
1403 | + aliases = kwargs.pop('aliases', ()) | ||
1404 | + | ||
1405 | + # create a pseudo-action to hold the choice help | ||
1406 | + if 'help' in kwargs: | ||
1407 | + help = kwargs.pop('help') | ||
1408 | + choice_action = self._ChoicesPseudoAction(name, aliases, help) | ||
1409 | + self._choices_actions.append(choice_action) | ||
1410 | + | ||
1411 | + # create the parser and add it to the map | ||
1412 | + parser = self._parser_class(**kwargs) | ||
1413 | + self._name_parser_map[name] = parser | ||
1414 | + | ||
1415 | + # make parser available under aliases also | ||
1416 | + for alias in aliases: | ||
1417 | + self._name_parser_map[alias] = parser | ||
1418 | + | ||
1419 | + return parser | ||
1420 | + | ||
1421 | + def _get_subactions(self): | ||
1422 | + return self._choices_actions | ||
1423 | + | ||
1424 | + def __call__(self, parser, namespace, values, option_string=None): | ||
1425 | + parser_name = values[0] | ||
1426 | + arg_strings = values[1:] | ||
1427 | + | ||
1428 | + # set the parser name if requested | ||
1429 | + if self.dest is not SUPPRESS: | ||
1430 | + setattr(namespace, self.dest, parser_name) | ||
1431 | + | ||
1432 | + # select the parser | ||
1433 | + try: | ||
1434 | + parser = self._name_parser_map[parser_name] | ||
1435 | + except KeyError: | ||
1436 | + tup = parser_name, ', '.join(self._name_parser_map) | ||
1437 | + msg = _('unknown parser %r (choices: %s)' % tup) | ||
1438 | + raise ArgumentError(self, msg) | ||
1439 | + | ||
1440 | + # parse all the remaining options into the namespace | ||
1441 | + # store any unrecognized options on the object, so that the top | ||
1442 | + # level parser can decide what to do with them | ||
1443 | + namespace, arg_strings = parser.parse_known_args(arg_strings, namespace) | ||
1444 | + if arg_strings: | ||
1445 | + vars(namespace).setdefault(_UNRECOGNIZED_ARGS_ATTR, []) | ||
1446 | + getattr(namespace, _UNRECOGNIZED_ARGS_ATTR).extend(arg_strings) | ||
1447 | + | ||
1448 | + | ||
1449 | +# ============== | ||
1450 | +# Type classes | ||
1451 | +# ============== | ||
1452 | + | ||
1453 | +class FileType(object): | ||
1454 | + """Factory for creating file object types | ||
1455 | + | ||
1456 | + Instances of FileType are typically passed as type= arguments to the | ||
1457 | + ArgumentParser add_argument() method. | ||
1458 | + | ||
1459 | + Keyword Arguments: | ||
1460 | + - mode -- A string indicating how the file is to be opened. Accepts the | ||
1461 | + same values as the builtin open() function. | ||
1462 | + - bufsize -- The file's desired buffer size. Accepts the same values as | ||
1463 | + the builtin open() function. | ||
1464 | + """ | ||
1465 | + | ||
1466 | + def __init__(self, mode='r', bufsize=None): | ||
1467 | + self._mode = mode | ||
1468 | + self._bufsize = bufsize | ||
1469 | + | ||
1470 | + def __call__(self, string): | ||
1471 | + # the special argument "-" means sys.std{in,out} | ||
1472 | + if string == '-': | ||
1473 | + if 'r' in self._mode: | ||
1474 | + return _sys.stdin | ||
1475 | + elif 'w' in self._mode: | ||
1476 | + return _sys.stdout | ||
1477 | + else: | ||
1478 | + msg = _('argument "-" with mode %r' % self._mode) | ||
1479 | + raise ValueError(msg) | ||
1480 | + | ||
1481 | + try: | ||
1482 | + # all other arguments are used as file names | ||
1483 | + if self._bufsize: | ||
1484 | + return open(string, self._mode, self._bufsize) | ||
1485 | + else: | ||
1486 | + return open(string, self._mode) | ||
1487 | + except IOError: | ||
1488 | + err = _sys.exc_info()[1] | ||
1489 | + message = _("can't open '%s': %s") | ||
1490 | + raise ArgumentTypeError(message % (string, err)) | ||
1491 | + | ||
1492 | + def __repr__(self): | ||
1493 | + args = [self._mode, self._bufsize] | ||
1494 | + args_str = ', '.join([repr(arg) for arg in args if arg is not None]) | ||
1495 | + return '%s(%s)' % (type(self).__name__, args_str) | ||
1496 | + | ||
1497 | +# =========================== | ||
1498 | +# Optional and Positional Parsing | ||
1499 | +# =========================== | ||
1500 | + | ||
1501 | +class Namespace(_AttributeHolder): | ||
1502 | + """Simple object for storing attributes. | ||
1503 | + | ||
1504 | + Implements equality by attribute names and values, and provides a simple | ||
1505 | + string representation. | ||
1506 | + """ | ||
1507 | + | ||
1508 | + def __init__(self, **kwargs): | ||
1509 | + for name in kwargs: | ||
1510 | + setattr(self, name, kwargs[name]) | ||
1511 | + | ||
1512 | + __hash__ = None | ||
1513 | + | ||
1514 | + def __eq__(self, other): | ||
1515 | + return vars(self) == vars(other) | ||
1516 | + | ||
1517 | + def __ne__(self, other): | ||
1518 | + return not (self == other) | ||
1519 | + | ||
1520 | + def __contains__(self, key): | ||
1521 | + return key in self.__dict__ | ||
1522 | + | ||
1523 | + | ||
1524 | +class _ActionsContainer(object): | ||
1525 | + | ||
1526 | + def __init__(self, | ||
1527 | + description, | ||
1528 | + prefix_chars, | ||
1529 | + argument_default, | ||
1530 | + conflict_handler): | ||
1531 | + super(_ActionsContainer, self).__init__() | ||
1532 | + | ||
1533 | + self.description = description | ||
1534 | + self.argument_default = argument_default | ||
1535 | + self.prefix_chars = prefix_chars | ||
1536 | + self.conflict_handler = conflict_handler | ||
1537 | + | ||
1538 | + # set up registries | ||
1539 | + self._registries = {} | ||
1540 | + | ||
1541 | + # register actions | ||
1542 | + self.register('action', None, _StoreAction) | ||
1543 | + self.register('action', 'store', _StoreAction) | ||
1544 | + self.register('action', 'store_const', _StoreConstAction) | ||
1545 | + self.register('action', 'store_true', _StoreTrueAction) | ||
1546 | + self.register('action', 'store_false', _StoreFalseAction) | ||
1547 | + self.register('action', 'append', _AppendAction) | ||
1548 | + self.register('action', 'append_const', _AppendConstAction) | ||
1549 | + self.register('action', 'count', _CountAction) | ||
1550 | + self.register('action', 'help', _HelpAction) | ||
1551 | + self.register('action', 'version', _VersionAction) | ||
1552 | + self.register('action', 'parsers', _SubParsersAction) | ||
1553 | + | ||
1554 | + # raise an exception if the conflict handler is invalid | ||
1555 | + self._get_handler() | ||
1556 | + | ||
1557 | + # action storage | ||
1558 | + self._actions = [] | ||
1559 | + self._option_string_actions = {} | ||
1560 | + | ||
1561 | + # groups | ||
1562 | + self._action_groups = [] | ||
1563 | + self._mutually_exclusive_groups = [] | ||
1564 | + | ||
1565 | + # defaults storage | ||
1566 | + self._defaults = {} | ||
1567 | + | ||
1568 | + # determines whether an "option" looks like a negative number | ||
1569 | + self._negative_number_matcher = _re.compile(r'^-\d+$|^-\d*\.\d+$') | ||
1570 | + | ||
1571 | + # whether or not there are any optionals that look like negative | ||
1572 | + # numbers -- uses a list so it can be shared and edited | ||
1573 | + self._has_negative_number_optionals = [] | ||
1574 | + | ||
1575 | + # ==================== | ||
1576 | + # Registration methods | ||
1577 | + # ==================== | ||
1578 | + def register(self, registry_name, value, object): | ||
1579 | + registry = self._registries.setdefault(registry_name, {}) | ||
1580 | + registry[value] = object | ||
1581 | + | ||
1582 | + def _registry_get(self, registry_name, value, default=None): | ||
1583 | + return self._registries[registry_name].get(value, default) | ||
1584 | + | ||
1585 | + # ================================== | ||
1586 | + # Namespace default accessor methods | ||
1587 | + # ================================== | ||
1588 | + def set_defaults(self, **kwargs): | ||
1589 | + self._defaults.update(kwargs) | ||
1590 | + | ||
1591 | + # if these defaults match any existing arguments, replace | ||
1592 | + # the previous default on the object with the new one | ||
1593 | + for action in self._actions: | ||
1594 | + if action.dest in kwargs: | ||
1595 | + action.default = kwargs[action.dest] | ||
1596 | + | ||
1597 | + def get_default(self, dest): | ||
1598 | + for action in self._actions: | ||
1599 | + if action.dest == dest and action.default is not None: | ||
1600 | + return action.default | ||
1601 | + return self._defaults.get(dest, None) | ||
1602 | + | ||
1603 | + | ||
1604 | + # ======================= | ||
1605 | + # Adding argument actions | ||
1606 | + # ======================= | ||
1607 | + def add_argument(self, *args, **kwargs): | ||
1608 | + """ | ||
1609 | + add_argument(dest, ..., name=value, ...) | ||
1610 | + add_argument(option_string, option_string, ..., name=value, ...) | ||
1611 | + """ | ||
1612 | + | ||
1613 | + # if no positional args are supplied or only one is supplied and | ||
1614 | + # it doesn't look like an option string, parse a positional | ||
1615 | + # argument | ||
1616 | + chars = self.prefix_chars | ||
1617 | + if not args or len(args) == 1 and args[0][0] not in chars: | ||
1618 | + if args and 'dest' in kwargs: | ||
1619 | + raise ValueError('dest supplied twice for positional argument') | ||
1620 | + kwargs = self._get_positional_kwargs(*args, **kwargs) | ||
1621 | + | ||
1622 | + # otherwise, we're adding an optional argument | ||
1623 | + else: | ||
1624 | + kwargs = self._get_optional_kwargs(*args, **kwargs) | ||
1625 | + | ||
1626 | + # if no default was supplied, use the parser-level default | ||
1627 | + if 'default' not in kwargs: | ||
1628 | + dest = kwargs['dest'] | ||
1629 | + if dest in self._defaults: | ||
1630 | + kwargs['default'] = self._defaults[dest] | ||
1631 | + elif self.argument_default is not None: | ||
1632 | + kwargs['default'] = self.argument_default | ||
1633 | + | ||
1634 | + # create the action object, and add it to the parser | ||
1635 | + action_class = self._pop_action_class(kwargs) | ||
1636 | + if not _callable(action_class): | ||
1637 | + raise ValueError('unknown action "%s"' % action_class) | ||
1638 | + action = action_class(**kwargs) | ||
1639 | + | ||
1640 | + # raise an error if the action type is not callable | ||
1641 | + type_func = self._registry_get('type', action.type, action.type) | ||
1642 | + if not _callable(type_func): | ||
1643 | + raise ValueError('%r is not callable' % type_func) | ||
1644 | + | ||
1645 | + return self._add_action(action) | ||
1646 | + | ||
1647 | + def add_argument_group(self, *args, **kwargs): | ||
1648 | + group = _ArgumentGroup(self, *args, **kwargs) | ||
1649 | + self._action_groups.append(group) | ||
1650 | + return group | ||
1651 | + | ||
1652 | + def add_mutually_exclusive_group(self, **kwargs): | ||
1653 | + group = _MutuallyExclusiveGroup(self, **kwargs) | ||
1654 | + self._mutually_exclusive_groups.append(group) | ||
1655 | + return group | ||
1656 | + | ||
1657 | + def _add_action(self, action): | ||
1658 | + # resolve any conflicts | ||
1659 | + self._check_conflict(action) | ||
1660 | + | ||
1661 | + # add to actions list | ||
1662 | + self._actions.append(action) | ||
1663 | + action.container = self | ||
1664 | + | ||
1665 | + # index the action by any option strings it has | ||
1666 | + for option_string in action.option_strings: | ||
1667 | + self._option_string_actions[option_string] = action | ||
1668 | + | ||
1669 | + # set the flag if any option strings look like negative numbers | ||
1670 | + for option_string in action.option_strings: | ||
1671 | + if self._negative_number_matcher.match(option_string): | ||
1672 | + if not self._has_negative_number_optionals: | ||
1673 | + self._has_negative_number_optionals.append(True) | ||
1674 | + | ||
1675 | + # return the created action | ||
1676 | + return action | ||
1677 | + | ||
1678 | + def _remove_action(self, action): | ||
1679 | + self._actions.remove(action) | ||
1680 | + | ||
1681 | + def _add_container_actions(self, container): | ||
1682 | + # collect groups by titles | ||
1683 | + title_group_map = {} | ||
1684 | + for group in self._action_groups: | ||
1685 | + if group.title in title_group_map: | ||
1686 | + msg = _('cannot merge actions - two groups are named %r') | ||
1687 | + raise ValueError(msg % (group.title)) | ||
1688 | + title_group_map[group.title] = group | ||
1689 | + | ||
1690 | + # map each action to its group | ||
1691 | + group_map = {} | ||
1692 | + for group in container._action_groups: | ||
1693 | + | ||
1694 | + # if a group with the title exists, use that, otherwise | ||
1695 | + # create a new group matching the container's group | ||
1696 | + if group.title not in title_group_map: | ||
1697 | + title_group_map[group.title] = self.add_argument_group( | ||
1698 | + title=group.title, | ||
1699 | + description=group.description, | ||
1700 | + conflict_handler=group.conflict_handler) | ||
1701 | + | ||
1702 | + # map the actions to their new group | ||
1703 | + for action in group._group_actions: | ||
1704 | + group_map[action] = title_group_map[group.title] | ||
1705 | + | ||
1706 | + # add container's mutually exclusive groups | ||
1707 | + # NOTE: if add_mutually_exclusive_group ever gains title= and | ||
1708 | + # description= then this code will need to be expanded as above | ||
1709 | + for group in container._mutually_exclusive_groups: | ||
1710 | + mutex_group = self.add_mutually_exclusive_group( | ||
1711 | + required=group.required) | ||
1712 | + | ||
1713 | + # map the actions to their new mutex group | ||
1714 | + for action in group._group_actions: | ||
1715 | + group_map[action] = mutex_group | ||
1716 | + | ||
1717 | + # add all actions to this container or their group | ||
1718 | + for action in container._actions: | ||
1719 | + group_map.get(action, self)._add_action(action) | ||
1720 | + | ||
1721 | + def _get_positional_kwargs(self, dest, **kwargs): | ||
1722 | + # make sure required is not specified | ||
1723 | + if 'required' in kwargs: | ||
1724 | + msg = _("'required' is an invalid argument for positionals") | ||
1725 | + raise TypeError(msg) | ||
1726 | + | ||
1727 | + # mark positional arguments as required if at least one is | ||
1728 | + # always required | ||
1729 | + if kwargs.get('nargs') not in [OPTIONAL, ZERO_OR_MORE]: | ||
1730 | + kwargs['required'] = True | ||
1731 | + if kwargs.get('nargs') == ZERO_OR_MORE and 'default' not in kwargs: | ||
1732 | + kwargs['required'] = True | ||
1733 | + | ||
1734 | + # return the keyword arguments with no option strings | ||
1735 | + return dict(kwargs, dest=dest, option_strings=[]) | ||
1736 | + | ||
1737 | + def _get_optional_kwargs(self, *args, **kwargs): | ||
1738 | + # determine short and long option strings | ||
1739 | + option_strings = [] | ||
1740 | + long_option_strings = [] | ||
1741 | + for option_string in args: | ||
1742 | + # error on strings that don't start with an appropriate prefix | ||
1743 | + if not option_string[0] in self.prefix_chars: | ||
1744 | + msg = _('invalid option string %r: ' | ||
1745 | + 'must start with a character %r') | ||
1746 | + tup = option_string, self.prefix_chars | ||
1747 | + raise ValueError(msg % tup) | ||
1748 | + | ||
1749 | + # strings starting with two prefix characters are long options | ||
1750 | + option_strings.append(option_string) | ||
1751 | + if option_string[0] in self.prefix_chars: | ||
1752 | + if len(option_string) > 1: | ||
1753 | + if option_string[1] in self.prefix_chars: | ||
1754 | + long_option_strings.append(option_string) | ||
1755 | + | ||
1756 | + # infer destination, '--foo-bar' -> 'foo_bar' and '-x' -> 'x' | ||
1757 | + dest = kwargs.pop('dest', None) | ||
1758 | + if dest is None: | ||
1759 | + if long_option_strings: | ||
1760 | + dest_option_string = long_option_strings[0] | ||
1761 | + else: | ||
1762 | + dest_option_string = option_strings[0] | ||
1763 | + dest = dest_option_string.lstrip(self.prefix_chars) | ||
1764 | + if not dest: | ||
1765 | + msg = _('dest= is required for options like %r') | ||
1766 | + raise ValueError(msg % option_string) | ||
1767 | + dest = dest.replace('-', '_') | ||
1768 | + | ||
1769 | + # return the updated keyword arguments | ||
1770 | + return dict(kwargs, dest=dest, option_strings=option_strings) | ||
1771 | + | ||
1772 | + def _pop_action_class(self, kwargs, default=None): | ||
1773 | + action = kwargs.pop('action', default) | ||
1774 | + return self._registry_get('action', action, action) | ||
1775 | + | ||
1776 | + def _get_handler(self): | ||
1777 | + # determine function from conflict handler string | ||
1778 | + handler_func_name = '_handle_conflict_%s' % self.conflict_handler | ||
1779 | + try: | ||
1780 | + return getattr(self, handler_func_name) | ||
1781 | + except AttributeError: | ||
1782 | + msg = _('invalid conflict_resolution value: %r') | ||
1783 | + raise ValueError(msg % self.conflict_handler) | ||
1784 | + | ||
1785 | + def _check_conflict(self, action): | ||
1786 | + | ||
1787 | + # find all options that conflict with this option | ||
1788 | + confl_optionals = [] | ||
1789 | + for option_string in action.option_strings: | ||
1790 | + if option_string in self._option_string_actions: | ||
1791 | + confl_optional = self._option_string_actions[option_string] | ||
1792 | + confl_optionals.append((option_string, confl_optional)) | ||
1793 | + | ||
1794 | + # resolve any conflicts | ||
1795 | + if confl_optionals: | ||
1796 | + conflict_handler = self._get_handler() | ||
1797 | + conflict_handler(action, confl_optionals) | ||
1798 | + | ||
1799 | + def _handle_conflict_error(self, action, conflicting_actions): | ||
1800 | + message = _('conflicting option string(s): %s') | ||
1801 | + conflict_string = ', '.join([option_string | ||
1802 | + for option_string, action | ||
1803 | + in conflicting_actions]) | ||
1804 | + raise ArgumentError(action, message % conflict_string) | ||
1805 | + | ||
1806 | + def _handle_conflict_resolve(self, action, conflicting_actions): | ||
1807 | + | ||
1808 | + # remove all conflicting options | ||
1809 | + for option_string, action in conflicting_actions: | ||
1810 | + | ||
1811 | + # remove the conflicting option | ||
1812 | + action.option_strings.remove(option_string) | ||
1813 | + self._option_string_actions.pop(option_string, None) | ||
1814 | + | ||
1815 | + # if the option now has no option string, remove it from the | ||
1816 | + # container holding it | ||
1817 | + if not action.option_strings: | ||
1818 | + action.container._remove_action(action) | ||
1819 | + | ||
1820 | + | ||
1821 | +class _ArgumentGroup(_ActionsContainer): | ||
1822 | + | ||
1823 | + def __init__(self, container, title=None, description=None, **kwargs): | ||
1824 | + # add any missing keyword arguments by checking the container | ||
1825 | + update = kwargs.setdefault | ||
1826 | + update('conflict_handler', container.conflict_handler) | ||
1827 | + update('prefix_chars', container.prefix_chars) | ||
1828 | + update('argument_default', container.argument_default) | ||
1829 | + super_init = super(_ArgumentGroup, self).__init__ | ||
1830 | + super_init(description=description, **kwargs) | ||
1831 | + | ||
1832 | + # group attributes | ||
1833 | + self.title = title | ||
1834 | + self._group_actions = [] | ||
1835 | + | ||
1836 | + # share most attributes with the container | ||
1837 | + self._registries = container._registries | ||
1838 | + self._actions = container._actions | ||
1839 | + self._option_string_actions = container._option_string_actions | ||
1840 | + self._defaults = container._defaults | ||
1841 | + self._has_negative_number_optionals = \ | ||
1842 | + container._has_negative_number_optionals | ||
1843 | + | ||
1844 | + def _add_action(self, action): | ||
1845 | + action = super(_ArgumentGroup, self)._add_action(action) | ||
1846 | + self._group_actions.append(action) | ||
1847 | + return action | ||
1848 | + | ||
1849 | + def _remove_action(self, action): | ||
1850 | + super(_ArgumentGroup, self)._remove_action(action) | ||
1851 | + self._group_actions.remove(action) | ||
1852 | + | ||
1853 | + | ||
1854 | +class _MutuallyExclusiveGroup(_ArgumentGroup): | ||
1855 | + | ||
1856 | + def __init__(self, container, required=False): | ||
1857 | + super(_MutuallyExclusiveGroup, self).__init__(container) | ||
1858 | + self.required = required | ||
1859 | + self._container = container | ||
1860 | + | ||
1861 | + def _add_action(self, action): | ||
1862 | + if action.required: | ||
1863 | + msg = _('mutually exclusive arguments must be optional') | ||
1864 | + raise ValueError(msg) | ||
1865 | + action = self._container._add_action(action) | ||
1866 | + self._group_actions.append(action) | ||
1867 | + return action | ||
1868 | + | ||
1869 | + def _remove_action(self, action): | ||
1870 | + self._container._remove_action(action) | ||
1871 | + self._group_actions.remove(action) | ||
1872 | + | ||
1873 | + | ||
1874 | +class ArgumentParser(_AttributeHolder, _ActionsContainer): | ||
1875 | + """Object for parsing command line strings into Python objects. | ||
1876 | + | ||
1877 | + Keyword Arguments: | ||
1878 | + - prog -- The name of the program (default: sys.argv[0]) | ||
1879 | + - usage -- A usage message (default: auto-generated from arguments) | ||
1880 | + - description -- A description of what the program does | ||
1881 | + - epilog -- Text following the argument descriptions | ||
1882 | + - parents -- Parsers whose arguments should be copied into this one | ||
1883 | + - formatter_class -- HelpFormatter class for printing help messages | ||
1884 | + - prefix_chars -- Characters that prefix optional arguments | ||
1885 | + - fromfile_prefix_chars -- Characters that prefix files containing | ||
1886 | + additional arguments | ||
1887 | + - argument_default -- The default value for all arguments | ||
1888 | + - conflict_handler -- String indicating how to handle conflicts | ||
1889 | + - add_help -- Add a -h/-help option | ||
1890 | + """ | ||
1891 | + | ||
1892 | + def __init__(self, | ||
1893 | + prog=None, | ||
1894 | + usage=None, | ||
1895 | + description=None, | ||
1896 | + epilog=None, | ||
1897 | + version=None, | ||
1898 | + parents=[], | ||
1899 | + formatter_class=HelpFormatter, | ||
1900 | + prefix_chars='-', | ||
1901 | + fromfile_prefix_chars=None, | ||
1902 | + argument_default=None, | ||
1903 | + conflict_handler='error', | ||
1904 | + add_help=True): | ||
1905 | + | ||
1906 | + if version is not None: | ||
1907 | + import warnings | ||
1908 | + warnings.warn( | ||
1909 | + """The "version" argument to ArgumentParser is deprecated. """ | ||
1910 | + """Please use """ | ||
1911 | + """"add_argument(..., action='version', version="N", ...)" """ | ||
1912 | + """instead""", DeprecationWarning) | ||
1913 | + | ||
1914 | + superinit = super(ArgumentParser, self).__init__ | ||
1915 | + superinit(description=description, | ||
1916 | + prefix_chars=prefix_chars, | ||
1917 | + argument_default=argument_default, | ||
1918 | + conflict_handler=conflict_handler) | ||
1919 | + | ||
1920 | + # default setting for prog | ||
1921 | + if prog is None: | ||
1922 | + prog = _os.path.basename(_sys.argv[0]) | ||
1923 | + | ||
1924 | + self.prog = prog | ||
1925 | + self.usage = usage | ||
1926 | + self.epilog = epilog | ||
1927 | + self.version = version | ||
1928 | + self.formatter_class = formatter_class | ||
1929 | + self.fromfile_prefix_chars = fromfile_prefix_chars | ||
1930 | + self.add_help = add_help | ||
1931 | + | ||
1932 | + add_group = self.add_argument_group | ||
1933 | + self._positionals = add_group(_('positional arguments')) | ||
1934 | + self._optionals = add_group(_('optional arguments')) | ||
1935 | + self._subparsers = None | ||
1936 | + | ||
1937 | + # register types | ||
1938 | + def identity(string): | ||
1939 | + return string | ||
1940 | + self.register('type', None, identity) | ||
1941 | + | ||
1942 | + # add help and version arguments if necessary | ||
1943 | + # (using explicit default to override global argument_default) | ||
1944 | + if '-' in prefix_chars: | ||
1945 | + default_prefix = '-' | ||
1946 | + else: | ||
1947 | + default_prefix = prefix_chars[0] | ||
1948 | + if self.add_help: | ||
1949 | + self.add_argument( | ||
1950 | + default_prefix+'h', default_prefix*2+'help', | ||
1951 | + action='help', default=SUPPRESS, | ||
1952 | + help=_('show this help message and exit')) | ||
1953 | + if self.version: | ||
1954 | + self.add_argument( | ||
1955 | + default_prefix+'v', default_prefix*2+'version', | ||
1956 | + action='version', default=SUPPRESS, | ||
1957 | + version=self.version, | ||
1958 | + help=_("show program's version number and exit")) | ||
1959 | + | ||
1960 | + # add parent arguments and defaults | ||
1961 | + for parent in parents: | ||
1962 | + self._add_container_actions(parent) | ||
1963 | + try: | ||
1964 | + defaults = parent._defaults | ||
1965 | + except AttributeError: | ||
1966 | + pass | ||
1967 | + else: | ||
1968 | + self._defaults.update(defaults) | ||
1969 | + | ||
1970 | + # ======================= | ||
1971 | + # Pretty __repr__ methods | ||
1972 | + # ======================= | ||
1973 | + def _get_kwargs(self): | ||
1974 | + names = [ | ||
1975 | + 'prog', | ||
1976 | + 'usage', | ||
1977 | + 'description', | ||
1978 | + 'version', | ||
1979 | + 'formatter_class', | ||
1980 | + 'conflict_handler', | ||
1981 | + 'add_help', | ||
1982 | + ] | ||
1983 | + return [(name, getattr(self, name)) for name in names] | ||
1984 | + | ||
1985 | + # ================================== | ||
1986 | + # Optional/Positional adding methods | ||
1987 | + # ================================== | ||
1988 | + def add_subparsers(self, **kwargs): | ||
1989 | + if self._subparsers is not None: | ||
1990 | + self.error(_('cannot have multiple subparser arguments')) | ||
1991 | + | ||
1992 | + # add the parser class to the arguments if it's not present | ||
1993 | + kwargs.setdefault('parser_class', type(self)) | ||
1994 | + | ||
1995 | + if 'title' in kwargs or 'description' in kwargs: | ||
1996 | + title = _(kwargs.pop('title', 'subcommands')) | ||
1997 | + description = _(kwargs.pop('description', None)) | ||
1998 | + self._subparsers = self.add_argument_group(title, description) | ||
1999 | + else: | ||
2000 | + self._subparsers = self._positionals | ||
2001 | + | ||
2002 | + # prog defaults to the usage message of this parser, skipping | ||
2003 | + # optional arguments and with no "usage:" prefix | ||
2004 | + if kwargs.get('prog') is None: | ||
2005 | + formatter = self._get_formatter() | ||
2006 | + positionals = self._get_positional_actions() | ||
2007 | + groups = self._mutually_exclusive_groups | ||
2008 | + formatter.add_usage(self.usage, positionals, groups, '') | ||
2009 | + kwargs['prog'] = formatter.format_help().strip() | ||
2010 | + | ||
2011 | + # create the parsers action and add it to the positionals list | ||
2012 | + parsers_class = self._pop_action_class(kwargs, 'parsers') | ||
2013 | + action = parsers_class(option_strings=[], **kwargs) | ||
2014 | + self._subparsers._add_action(action) | ||
2015 | + | ||
2016 | + # return the created parsers action | ||
2017 | + return action | ||
2018 | + | ||
2019 | + def _add_action(self, action): | ||
2020 | + if action.option_strings: | ||
2021 | + self._optionals._add_action(action) | ||
2022 | + else: | ||
2023 | + self._positionals._add_action(action) | ||
2024 | + return action | ||
2025 | + | ||
2026 | + def _get_optional_actions(self): | ||
2027 | + return [action | ||
2028 | + for action in self._actions | ||
2029 | + if action.option_strings] | ||
2030 | + | ||
2031 | + def _get_positional_actions(self): | ||
2032 | + return [action | ||
2033 | + for action in self._actions | ||
2034 | + if not action.option_strings] | ||
2035 | + | ||
2036 | + # ===================================== | ||
2037 | + # Command line argument parsing methods | ||
2038 | + # ===================================== | ||
2039 | + def parse_args(self, args=None, namespace=None): | ||
2040 | + args, argv = self.parse_known_args(args, namespace) | ||
2041 | + if argv: | ||
2042 | + msg = _('unrecognized arguments: %s') | ||
2043 | + self.error(msg % ' '.join(argv)) | ||
2044 | + return args | ||
2045 | + | ||
2046 | + def parse_known_args(self, args=None, namespace=None): | ||
2047 | + # args default to the system args | ||
2048 | + if args is None: | ||
2049 | + args = _sys.argv[1:] | ||
2050 | + | ||
2051 | + # default Namespace built from parser defaults | ||
2052 | + if namespace is None: | ||
2053 | + namespace = Namespace() | ||
2054 | + | ||
2055 | + # add any action defaults that aren't present | ||
2056 | + for action in self._actions: | ||
2057 | + if action.dest is not SUPPRESS: | ||
2058 | + if not hasattr(namespace, action.dest): | ||
2059 | + if action.default is not SUPPRESS: | ||
2060 | + setattr(namespace, action.dest, action.default) | ||
2061 | + | ||
2062 | + # add any parser defaults that aren't present | ||
2063 | + for dest in self._defaults: | ||
2064 | + if not hasattr(namespace, dest): | ||
2065 | + setattr(namespace, dest, self._defaults[dest]) | ||
2066 | + | ||
2067 | + # parse the arguments and exit if there are any errors | ||
2068 | + try: | ||
2069 | + namespace, args = self._parse_known_args(args, namespace) | ||
2070 | + if hasattr(namespace, _UNRECOGNIZED_ARGS_ATTR): | ||
2071 | + args.extend(getattr(namespace, _UNRECOGNIZED_ARGS_ATTR)) | ||
2072 | + delattr(namespace, _UNRECOGNIZED_ARGS_ATTR) | ||
2073 | + return namespace, args | ||
2074 | + except ArgumentError: | ||
2075 | + err = _sys.exc_info()[1] | ||
2076 | + self.error(str(err)) | ||
2077 | + | ||
2078 | + def _parse_known_args(self, arg_strings, namespace): | ||
2079 | + # replace arg strings that are file references | ||
2080 | + if self.fromfile_prefix_chars is not None: | ||
2081 | + arg_strings = self._read_args_from_files(arg_strings) | ||
2082 | + | ||
2083 | + # map all mutually exclusive arguments to the other arguments | ||
2084 | + # they can't occur with | ||
2085 | + action_conflicts = {} | ||
2086 | + for mutex_group in self._mutually_exclusive_groups: | ||
2087 | + group_actions = mutex_group._group_actions | ||
2088 | + for i, mutex_action in enumerate(mutex_group._group_actions): | ||
2089 | + conflicts = action_conflicts.setdefault(mutex_action, []) | ||
2090 | + conflicts.extend(group_actions[:i]) | ||
2091 | + conflicts.extend(group_actions[i + 1:]) | ||
2092 | + | ||
2093 | + # find all option indices, and determine the arg_string_pattern | ||
2094 | + # which has an 'O' if there is an option at an index, | ||
2095 | + # an 'A' if there is an argument, or a '-' if there is a '--' | ||
2096 | + option_string_indices = {} | ||
2097 | + arg_string_pattern_parts = [] | ||
2098 | + arg_strings_iter = iter(arg_strings) | ||
2099 | + for i, arg_string in enumerate(arg_strings_iter): | ||
2100 | + | ||
2101 | + # all args after -- are non-options | ||
2102 | + if arg_string == '--': | ||
2103 | + arg_string_pattern_parts.append('-') | ||
2104 | + for arg_string in arg_strings_iter: | ||
2105 | + arg_string_pattern_parts.append('A') | ||
2106 | + | ||
2107 | + # otherwise, add the arg to the arg strings | ||
2108 | + # and note the index if it was an option | ||
2109 | + else: | ||
2110 | + option_tuple = self._parse_optional(arg_string) | ||
2111 | + if option_tuple is None: | ||
2112 | + pattern = 'A' | ||
2113 | + else: | ||
2114 | + option_string_indices[i] = option_tuple | ||
2115 | + pattern = 'O' | ||
2116 | + arg_string_pattern_parts.append(pattern) | ||
2117 | + | ||
2118 | + # join the pieces together to form the pattern | ||
2119 | + arg_strings_pattern = ''.join(arg_string_pattern_parts) | ||
2120 | + | ||
2121 | + # converts arg strings to the appropriate and then takes the action | ||
2122 | + seen_actions = set() | ||
2123 | + seen_non_default_actions = set() | ||
2124 | + | ||
2125 | + def take_action(action, argument_strings, option_string=None): | ||
2126 | + seen_actions.add(action) | ||
2127 | + argument_values = self._get_values(action, argument_strings) | ||
2128 | + | ||
2129 | + # error if this argument is not allowed with other previously | ||
2130 | + # seen arguments, assuming that actions that use the default | ||
2131 | + # value don't really count as "present" | ||
2132 | + if argument_values is not action.default: | ||
2133 | + seen_non_default_actions.add(action) | ||
2134 | + for conflict_action in action_conflicts.get(action, []): | ||
2135 | + if conflict_action in seen_non_default_actions: | ||
2136 | + msg = _('not allowed with argument %s') | ||
2137 | + action_name = _get_action_name(conflict_action) | ||
2138 | + raise ArgumentError(action, msg % action_name) | ||
2139 | + | ||
2140 | + # take the action if we didn't receive a SUPPRESS value | ||
2141 | + # (e.g. from a default) | ||
2142 | + if argument_values is not SUPPRESS: | ||
2143 | + action(self, namespace, argument_values, option_string) | ||
2144 | + | ||
2145 | + # function to convert arg_strings into an optional action | ||
2146 | + def consume_optional(start_index): | ||
2147 | + | ||
2148 | + # get the optional identified at this index | ||
2149 | + option_tuple = option_string_indices[start_index] | ||
2150 | + action, option_string, explicit_arg = option_tuple | ||
2151 | + | ||
2152 | + # identify additional optionals in the same arg string | ||
2153 | + # (e.g. -xyz is the same as -x -y -z if no args are required) | ||
2154 | + match_argument = self._match_argument | ||
2155 | + action_tuples = [] | ||
2156 | + while True: | ||
2157 | + | ||
2158 | + # if we found no optional action, skip it | ||
2159 | + if action is None: | ||
2160 | + extras.append(arg_strings[start_index]) | ||
2161 | + return start_index + 1 | ||
2162 | + | ||
2163 | + # if there is an explicit argument, try to match the | ||
2164 | + # optional's string arguments to only this | ||
2165 | + if explicit_arg is not None: | ||
2166 | + arg_count = match_argument(action, 'A') | ||
2167 | + | ||
2168 | + # if the action is a single-dash option and takes no | ||
2169 | + # arguments, try to parse more single-dash options out | ||
2170 | + # of the tail of the option string | ||
2171 | + chars = self.prefix_chars | ||
2172 | + if arg_count == 0 and option_string[1] not in chars: | ||
2173 | + action_tuples.append((action, [], option_string)) | ||
2174 | + char = option_string[0] | ||
2175 | + option_string = char + explicit_arg[0] | ||
2176 | + new_explicit_arg = explicit_arg[1:] or None | ||
2177 | + optionals_map = self._option_string_actions | ||
2178 | + if option_string in optionals_map: | ||
2179 | + action = optionals_map[option_string] | ||
2180 | + explicit_arg = new_explicit_arg | ||
2181 | + else: | ||
2182 | + msg = _('ignored explicit argument %r') | ||
2183 | + raise ArgumentError(action, msg % explicit_arg) | ||
2184 | + | ||
2185 | + # if the action expect exactly one argument, we've | ||
2186 | + # successfully matched the option; exit the loop | ||
2187 | + elif arg_count == 1: | ||
2188 | + stop = start_index + 1 | ||
2189 | + args = [explicit_arg] | ||
2190 | + action_tuples.append((action, args, option_string)) | ||
2191 | + break | ||
2192 | + | ||
2193 | + # error if a double-dash option did not use the | ||
2194 | + # explicit argument | ||
2195 | + else: | ||
2196 | + msg = _('ignored explicit argument %r') | ||
2197 | + raise ArgumentError(action, msg % explicit_arg) | ||
2198 | + | ||
2199 | + # if there is no explicit argument, try to match the | ||
2200 | + # optional's string arguments with the following strings | ||
2201 | + # if successful, exit the loop | ||
2202 | + else: | ||
2203 | + start = start_index + 1 | ||
2204 | + selected_patterns = arg_strings_pattern[start:] | ||
2205 | + arg_count = match_argument(action, selected_patterns) | ||
2206 | + stop = start + arg_count | ||
2207 | + args = arg_strings[start:stop] | ||
2208 | + action_tuples.append((action, args, option_string)) | ||
2209 | + break | ||
2210 | + | ||
2211 | + # add the Optional to the list and return the index at which | ||
2212 | + # the Optional's string args stopped | ||
2213 | + assert action_tuples | ||
2214 | + for action, args, option_string in action_tuples: | ||
2215 | + take_action(action, args, option_string) | ||
2216 | + return stop | ||
2217 | + | ||
2218 | + # the list of Positionals left to be parsed; this is modified | ||
2219 | + # by consume_positionals() | ||
2220 | + positionals = self._get_positional_actions() | ||
2221 | + | ||
2222 | + # function to convert arg_strings into positional actions | ||
2223 | + def consume_positionals(start_index): | ||
2224 | + # match as many Positionals as possible | ||
2225 | + match_partial = self._match_arguments_partial | ||
2226 | + selected_pattern = arg_strings_pattern[start_index:] | ||
2227 | + arg_counts = match_partial(positionals, selected_pattern) | ||
2228 | + | ||
2229 | + # slice off the appropriate arg strings for each Positional | ||
2230 | + # and add the Positional and its args to the list | ||
2231 | + for action, arg_count in zip(positionals, arg_counts): | ||
2232 | + args = arg_strings[start_index: start_index + arg_count] | ||
2233 | + start_index += arg_count | ||
2234 | + take_action(action, args) | ||
2235 | + | ||
2236 | + # slice off the Positionals that we just parsed and return the | ||
2237 | + # index at which the Positionals' string args stopped | ||
2238 | + positionals[:] = positionals[len(arg_counts):] | ||
2239 | + return start_index | ||
2240 | + | ||
2241 | + # consume Positionals and Optionals alternately, until we have | ||
2242 | + # passed the last option string | ||
2243 | + extras = [] | ||
2244 | + start_index = 0 | ||
2245 | + if option_string_indices: | ||
2246 | + max_option_string_index = max(option_string_indices) | ||
2247 | + else: | ||
2248 | + max_option_string_index = -1 | ||
2249 | + while start_index <= max_option_string_index: | ||
2250 | + | ||
2251 | + # consume any Positionals preceding the next option | ||
2252 | + next_option_string_index = min([ | ||
2253 | + index | ||
2254 | + for index in option_string_indices | ||
2255 | + if index >= start_index]) | ||
2256 | + if start_index != next_option_string_index: | ||
2257 | + positionals_end_index = consume_positionals(start_index) | ||
2258 | + | ||
2259 | + # only try to parse the next optional if we didn't consume | ||
2260 | + # the option string during the positionals parsing | ||
2261 | + if positionals_end_index > start_index: | ||
2262 | + start_index = positionals_end_index | ||
2263 | + continue | ||
2264 | + else: | ||
2265 | + start_index = positionals_end_index | ||
2266 | + | ||
2267 | + # if we consumed all the positionals we could and we're not | ||
2268 | + # at the index of an option string, there were extra arguments | ||
2269 | + if start_index not in option_string_indices: | ||
2270 | + strings = arg_strings[start_index:next_option_string_index] | ||
2271 | + extras.extend(strings) | ||
2272 | + start_index = next_option_string_index | ||
2273 | + | ||
2274 | + # consume the next optional and any arguments for it | ||
2275 | + start_index = consume_optional(start_index) | ||
2276 | + | ||
2277 | + # consume any positionals following the last Optional | ||
2278 | + stop_index = consume_positionals(start_index) | ||
2279 | + | ||
2280 | + # if we didn't consume all the argument strings, there were extras | ||
2281 | + extras.extend(arg_strings[stop_index:]) | ||
2282 | + | ||
2283 | + # if we didn't use all the Positional objects, there were too few | ||
2284 | + # arg strings supplied. | ||
2285 | + if positionals: | ||
2286 | + self.error(_('too few arguments')) | ||
2287 | + | ||
2288 | + # make sure all required actions were present, and convert defaults. | ||
2289 | + for action in self._actions: | ||
2290 | + if action not in seen_actions: | ||
2291 | + if action.required: | ||
2292 | + name = _get_action_name(action) | ||
2293 | + self.error(_('argument %s is required') % name) | ||
2294 | + else: | ||
2295 | + # Convert action default now instead of doing it before | ||
2296 | + # parsing arguments to avoid calling convert functions | ||
2297 | + # twice (which may fail) if the argument was given, but | ||
2298 | + # only if it was defined already in the namespace | ||
2299 | + if (action.default is not None and | ||
2300 | + isinstance(action.default, basestring) and | ||
2301 | + hasattr(namespace, action.dest) and | ||
2302 | + action.default is getattr(namespace, action.dest)): | ||
2303 | + setattr(namespace, action.dest, | ||
2304 | + self._get_value(action, action.default)) | ||
2305 | + | ||
2306 | + # make sure all required groups had one option present | ||
2307 | + for group in self._mutually_exclusive_groups: | ||
2308 | + if group.required: | ||
2309 | + for action in group._group_actions: | ||
2310 | + if action in seen_non_default_actions: | ||
2311 | + break | ||
2312 | + | ||
2313 | + # if no actions were used, report the error | ||
2314 | + else: | ||
2315 | + names = [_get_action_name(action) | ||
2316 | + for action in group._group_actions | ||
2317 | + if action.help is not SUPPRESS] | ||
2318 | + msg = _('one of the arguments %s is required') | ||
2319 | + self.error(msg % ' '.join(names)) | ||
2320 | + | ||
2321 | + # return the updated namespace and the extra arguments | ||
2322 | + return namespace, extras | ||
2323 | + | ||
2324 | + def _read_args_from_files(self, arg_strings): | ||
2325 | + # expand arguments referencing files | ||
2326 | + new_arg_strings = [] | ||
2327 | + for arg_string in arg_strings: | ||
2328 | + | ||
2329 | + # for regular arguments, just add them back into the list | ||
2330 | + if arg_string[0] not in self.fromfile_prefix_chars: | ||
2331 | + new_arg_strings.append(arg_string) | ||
2332 | + | ||
2333 | + # replace arguments referencing files with the file content | ||
2334 | + else: | ||
2335 | + try: | ||
2336 | + args_file = open(arg_string[1:]) | ||
2337 | + try: | ||
2338 | + arg_strings = [] | ||
2339 | + for arg_line in args_file.read().splitlines(): | ||
2340 | + for arg in self.convert_arg_line_to_args(arg_line): | ||
2341 | + arg_strings.append(arg) | ||
2342 | + arg_strings = self._read_args_from_files(arg_strings) | ||
2343 | + new_arg_strings.extend(arg_strings) | ||
2344 | + finally: | ||
2345 | + args_file.close() | ||
2346 | + except IOError: | ||
2347 | + err = _sys.exc_info()[1] | ||
2348 | + self.error(str(err)) | ||
2349 | + | ||
2350 | + # return the modified argument list | ||
2351 | + return new_arg_strings | ||
2352 | + | ||
2353 | + def convert_arg_line_to_args(self, arg_line): | ||
2354 | + return [arg_line] | ||
2355 | + | ||
2356 | + def _match_argument(self, action, arg_strings_pattern): | ||
2357 | + # match the pattern for this action to the arg strings | ||
2358 | + nargs_pattern = self._get_nargs_pattern(action) | ||
2359 | + match = _re.match(nargs_pattern, arg_strings_pattern) | ||
2360 | + | ||
2361 | + # raise an exception if we weren't able to find a match | ||
2362 | + if match is None: | ||
2363 | + nargs_errors = { | ||
2364 | + None: _('expected one argument'), | ||
2365 | + OPTIONAL: _('expected at most one argument'), | ||
2366 | + ONE_OR_MORE: _('expected at least one argument'), | ||
2367 | + } | ||
2368 | + default = _('expected %s argument(s)') % action.nargs | ||
2369 | + msg = nargs_errors.get(action.nargs, default) | ||
2370 | + raise ArgumentError(action, msg) | ||
2371 | + | ||
2372 | + # return the number of arguments matched | ||
2373 | + return len(match.group(1)) | ||
2374 | + | ||
2375 | + def _match_arguments_partial(self, actions, arg_strings_pattern): | ||
2376 | + # progressively shorten the actions list by slicing off the | ||
2377 | + # final actions until we find a match | ||
2378 | + result = [] | ||
2379 | + for i in range(len(actions), 0, -1): | ||
2380 | + actions_slice = actions[:i] | ||
2381 | + pattern = ''.join([self._get_nargs_pattern(action) | ||
2382 | + for action in actions_slice]) | ||
2383 | + match = _re.match(pattern, arg_strings_pattern) | ||
2384 | + if match is not None: | ||
2385 | + result.extend([len(string) for string in match.groups()]) | ||
2386 | + break | ||
2387 | + | ||
2388 | + # return the list of arg string counts | ||
2389 | + return result | ||
2390 | + | ||
2391 | + def _parse_optional(self, arg_string): | ||
2392 | + # if it's an empty string, it was meant to be a positional | ||
2393 | + if not arg_string: | ||
2394 | + return None | ||
2395 | + | ||
2396 | + # if it doesn't start with a prefix, it was meant to be positional | ||
2397 | + if not arg_string[0] in self.prefix_chars: | ||
2398 | + return None | ||
2399 | + | ||
2400 | + # if the option string is present in the parser, return the action | ||
2401 | + if arg_string in self._option_string_actions: | ||
2402 | + action = self._option_string_actions[arg_string] | ||
2403 | + return action, arg_string, None | ||
2404 | + | ||
2405 | + # if it's just a single character, it was meant to be positional | ||
2406 | + if len(arg_string) == 1: | ||
2407 | + return None | ||
2408 | + | ||
2409 | + # if the option string before the "=" is present, return the action | ||
2410 | + if '=' in arg_string: | ||
2411 | + option_string, explicit_arg = arg_string.split('=', 1) | ||
2412 | + if option_string in self._option_string_actions: | ||
2413 | + action = self._option_string_actions[option_string] | ||
2414 | + return action, option_string, explicit_arg | ||
2415 | + | ||
2416 | + # search through all possible prefixes of the option string | ||
2417 | + # and all actions in the parser for possible interpretations | ||
2418 | + option_tuples = self._get_option_tuples(arg_string) | ||
2419 | + | ||
2420 | + # if multiple actions match, the option string was ambiguous | ||
2421 | + if len(option_tuples) > 1: | ||
2422 | + options = ', '.join([option_string | ||
2423 | + for action, option_string, explicit_arg in option_tuples]) | ||
2424 | + tup = arg_string, options | ||
2425 | + self.error(_('ambiguous option: %s could match %s') % tup) | ||
2426 | + | ||
2427 | + # if exactly one action matched, this segmentation is good, | ||
2428 | + # so return the parsed action | ||
2429 | + elif len(option_tuples) == 1: | ||
2430 | + option_tuple, = option_tuples | ||
2431 | + return option_tuple | ||
2432 | + | ||
2433 | + # if it was not found as an option, but it looks like a negative | ||
2434 | + # number, it was meant to be positional | ||
2435 | + # unless there are negative-number-like options | ||
2436 | + if self._negative_number_matcher.match(arg_string): | ||
2437 | + if not self._has_negative_number_optionals: | ||
2438 | + return None | ||
2439 | + | ||
2440 | + # if it contains a space, it was meant to be a positional | ||
2441 | + if ' ' in arg_string: | ||
2442 | + return None | ||
2443 | + | ||
2444 | + # it was meant to be an optional but there is no such option | ||
2445 | + # in this parser (though it might be a valid option in a subparser) | ||
2446 | + return None, arg_string, None | ||
2447 | + | ||
2448 | + def _get_option_tuples(self, option_string): | ||
2449 | + result = [] | ||
2450 | + | ||
2451 | + # option strings starting with two prefix characters are only | ||
2452 | + # split at the '=' | ||
2453 | + chars = self.prefix_chars | ||
2454 | + if option_string[0] in chars and option_string[1] in chars: | ||
2455 | + if '=' in option_string: | ||
2456 | + option_prefix, explicit_arg = option_string.split('=', 1) | ||
2457 | + else: | ||
2458 | + option_prefix = option_string | ||
2459 | + explicit_arg = None | ||
2460 | + for option_string in self._option_string_actions: | ||
2461 | + if option_string.startswith(option_prefix): | ||
2462 | + action = self._option_string_actions[option_string] | ||
2463 | + tup = action, option_string, explicit_arg | ||
2464 | + result.append(tup) | ||
2465 | + | ||
2466 | + # single character options can be concatenated with their arguments | ||
2467 | + # but multiple character options always have to have their argument | ||
2468 | + # separate | ||
2469 | + elif option_string[0] in chars and option_string[1] not in chars: | ||
2470 | + option_prefix = option_string | ||
2471 | + explicit_arg = None | ||
2472 | + short_option_prefix = option_string[:2] | ||
2473 | + short_explicit_arg = option_string[2:] | ||
2474 | + | ||
2475 | + for option_string in self._option_string_actions: | ||
2476 | + if option_string == short_option_prefix: | ||
2477 | + action = self._option_string_actions[option_string] | ||
2478 | + tup = action, option_string, short_explicit_arg | ||
2479 | + result.append(tup) | ||
2480 | + elif option_string.startswith(option_prefix): | ||
2481 | + action = self._option_string_actions[option_string] | ||
2482 | + tup = action, option_string, explicit_arg | ||
2483 | + result.append(tup) | ||
2484 | + | ||
2485 | + # shouldn't ever get here | ||
2486 | + else: | ||
2487 | + self.error(_('unexpected option string: %s') % option_string) | ||
2488 | + | ||
2489 | + # return the collected option tuples | ||
2490 | + return result | ||
2491 | + | ||
2492 | + def _get_nargs_pattern(self, action): | ||
2493 | + # in all examples below, we have to allow for '--' args | ||
2494 | + # which are represented as '-' in the pattern | ||
2495 | + nargs = action.nargs | ||
2496 | + | ||
2497 | + # the default (None) is assumed to be a single argument | ||
2498 | + if nargs is None: | ||
2499 | + nargs_pattern = '(-*A-*)' | ||
2500 | + | ||
2501 | + # allow zero or one arguments | ||
2502 | + elif nargs == OPTIONAL: | ||
2503 | + nargs_pattern = '(-*A?-*)' | ||
2504 | + | ||
2505 | + # allow zero or more arguments | ||
2506 | + elif nargs == ZERO_OR_MORE: | ||
2507 | + nargs_pattern = '(-*[A-]*)' | ||
2508 | + | ||
2509 | + # allow one or more arguments | ||
2510 | + elif nargs == ONE_OR_MORE: | ||
2511 | + nargs_pattern = '(-*A[A-]*)' | ||
2512 | + | ||
2513 | + # allow any number of options or arguments | ||
2514 | + elif nargs == REMAINDER: | ||
2515 | + nargs_pattern = '([-AO]*)' | ||
2516 | + | ||
2517 | + # allow one argument followed by any number of options or arguments | ||
2518 | + elif nargs == PARSER: | ||
2519 | + nargs_pattern = '(-*A[-AO]*)' | ||
2520 | + | ||
2521 | + # all others should be integers | ||
2522 | + else: | ||
2523 | + nargs_pattern = '(-*%s-*)' % '-*'.join('A' * nargs) | ||
2524 | + | ||
2525 | + # if this is an optional action, -- is not allowed | ||
2526 | + if action.option_strings: | ||
2527 | + nargs_pattern = nargs_pattern.replace('-*', '') | ||
2528 | + nargs_pattern = nargs_pattern.replace('-', '') | ||
2529 | + | ||
2530 | + # return the pattern | ||
2531 | + return nargs_pattern | ||
2532 | + | ||
2533 | + # ======================== | ||
2534 | + # Value conversion methods | ||
2535 | + # ======================== | ||
2536 | + def _get_values(self, action, arg_strings): | ||
2537 | + # for everything but PARSER args, strip out '--' | ||
2538 | + if action.nargs not in [PARSER, REMAINDER]: | ||
2539 | + arg_strings = [s for s in arg_strings if s != '--'] | ||
2540 | + | ||
2541 | + # optional argument produces a default when not present | ||
2542 | + if not arg_strings and action.nargs == OPTIONAL: | ||
2543 | + if action.option_strings: | ||
2544 | + value = action.const | ||
2545 | + else: | ||
2546 | + value = action.default | ||
2547 | + if isinstance(value, basestring): | ||
2548 | + value = self._get_value(action, value) | ||
2549 | + self._check_value(action, value) | ||
2550 | + | ||
2551 | + # when nargs='*' on a positional, if there were no command-line | ||
2552 | + # args, use the default if it is anything other than None | ||
2553 | + elif (not arg_strings and action.nargs == ZERO_OR_MORE and | ||
2554 | + not action.option_strings): | ||
2555 | + if action.default is not None: | ||
2556 | + value = action.default | ||
2557 | + else: | ||
2558 | + value = arg_strings | ||
2559 | + self._check_value(action, value) | ||
2560 | + | ||
2561 | + # single argument or optional argument produces a single value | ||
2562 | + elif len(arg_strings) == 1 and action.nargs in [None, OPTIONAL]: | ||
2563 | + arg_string, = arg_strings | ||
2564 | + value = self._get_value(action, arg_string) | ||
2565 | + self._check_value(action, value) | ||
2566 | + | ||
2567 | + # REMAINDER arguments convert all values, checking none | ||
2568 | + elif action.nargs == REMAINDER: | ||
2569 | + value = [self._get_value(action, v) for v in arg_strings] | ||
2570 | + | ||
2571 | + # PARSER arguments convert all values, but check only the first | ||
2572 | + elif action.nargs == PARSER: | ||
2573 | + value = [self._get_value(action, v) for v in arg_strings] | ||
2574 | + self._check_value(action, value[0]) | ||
2575 | + | ||
2576 | + # all other types of nargs produce a list | ||
2577 | + else: | ||
2578 | + value = [self._get_value(action, v) for v in arg_strings] | ||
2579 | + for v in value: | ||
2580 | + self._check_value(action, v) | ||
2581 | + | ||
2582 | + # return the converted value | ||
2583 | + return value | ||
2584 | + | ||
2585 | + def _get_value(self, action, arg_string): | ||
2586 | + type_func = self._registry_get('type', action.type, action.type) | ||
2587 | + if not _callable(type_func): | ||
2588 | + msg = _('%r is not callable') | ||
2589 | + raise ArgumentError(action, msg % type_func) | ||
2590 | + | ||
2591 | + # convert the value to the appropriate type | ||
2592 | + try: | ||
2593 | + result = type_func(arg_string) | ||
2594 | + | ||
2595 | + # ArgumentTypeErrors indicate errors | ||
2596 | + except ArgumentTypeError: | ||
2597 | + name = getattr(action.type, '__name__', repr(action.type)) | ||
2598 | + msg = str(_sys.exc_info()[1]) | ||
2599 | + raise ArgumentError(action, msg) | ||
2600 | + | ||
2601 | + # TypeErrors or ValueErrors also indicate errors | ||
2602 | + except (TypeError, ValueError): | ||
2603 | + name = getattr(action.type, '__name__', repr(action.type)) | ||
2604 | + msg = _('invalid %s value: %r') | ||
2605 | + raise ArgumentError(action, msg % (name, arg_string)) | ||
2606 | + | ||
2607 | + # return the converted value | ||
2608 | + return result | ||
2609 | + | ||
2610 | + def _check_value(self, action, value): | ||
2611 | + # converted value must be one of the choices (if specified) | ||
2612 | + if action.choices is not None and value not in action.choices: | ||
2613 | + tup = value, ', '.join(map(repr, action.choices)) | ||
2614 | + msg = _('invalid choice: %r (choose from %s)') % tup | ||
2615 | + raise ArgumentError(action, msg) | ||
2616 | + | ||
2617 | + # ======================= | ||
2618 | + # Help-formatting methods | ||
2619 | + # ======================= | ||
2620 | + def format_usage(self): | ||
2621 | + formatter = self._get_formatter() | ||
2622 | + formatter.add_usage(self.usage, self._actions, | ||
2623 | + self._mutually_exclusive_groups) | ||
2624 | + return formatter.format_help() | ||
2625 | + | ||
2626 | + def format_help(self): | ||
2627 | + formatter = self._get_formatter() | ||
2628 | + | ||
2629 | + # usage | ||
2630 | + formatter.add_usage(self.usage, self._actions, | ||
2631 | + self._mutually_exclusive_groups) | ||
2632 | + | ||
2633 | + # description | ||
2634 | + formatter.add_text(self.description) | ||
2635 | + | ||
2636 | + # positionals, optionals and user-defined groups | ||
2637 | + for action_group in self._action_groups: | ||
2638 | + formatter.start_section(action_group.title) | ||
2639 | + formatter.add_text(action_group.description) | ||
2640 | + formatter.add_arguments(action_group._group_actions) | ||
2641 | + formatter.end_section() | ||
2642 | + | ||
2643 | + # epilog | ||
2644 | + formatter.add_text(self.epilog) | ||
2645 | + | ||
2646 | + # determine help from format above | ||
2647 | + return formatter.format_help() | ||
2648 | + | ||
2649 | + def format_version(self): | ||
2650 | + import warnings | ||
2651 | + warnings.warn( | ||
2652 | + 'The format_version method is deprecated -- the "version" ' | ||
2653 | + 'argument to ArgumentParser is no longer supported.', | ||
2654 | + DeprecationWarning) | ||
2655 | + formatter = self._get_formatter() | ||
2656 | + formatter.add_text(self.version) | ||
2657 | + return formatter.format_help() | ||
2658 | + | ||
2659 | + def _get_formatter(self): | ||
2660 | + return self.formatter_class(prog=self.prog) | ||
2661 | + | ||
2662 | + # ===================== | ||
2663 | + # Help-printing methods | ||
2664 | + # ===================== | ||
2665 | + def print_usage(self, file=None): | ||
2666 | + if file is None: | ||
2667 | + file = _sys.stdout | ||
2668 | + self._print_message(self.format_usage(), file) | ||
2669 | + | ||
2670 | + def print_help(self, file=None): | ||
2671 | + if file is None: | ||
2672 | + file = _sys.stdout | ||
2673 | + self._print_message(self.format_help(), file) | ||
2674 | + | ||
2675 | + def print_version(self, file=None): | ||
2676 | + import warnings | ||
2677 | + warnings.warn( | ||
2678 | + 'The print_version method is deprecated -- the "version" ' | ||
2679 | + 'argument to ArgumentParser is no longer supported.', | ||
2680 | + DeprecationWarning) | ||
2681 | + self._print_message(self.format_version(), file) | ||
2682 | + | ||
2683 | + def _print_message(self, message, file=None): | ||
2684 | + if message: | ||
2685 | + if file is None: | ||
2686 | + file = _sys.stderr | ||
2687 | + file.write(message) | ||
2688 | + | ||
2689 | + # =============== | ||
2690 | + # Exiting methods | ||
2691 | + # =============== | ||
2692 | + def exit(self, status=0, message=None): | ||
2693 | + if message: | ||
2694 | + self._print_message(message, _sys.stderr) | ||
2695 | + _sys.exit(status) | ||
2696 | + | ||
2697 | + def error(self, message): | ||
2698 | + """error(message: string) | ||
2699 | + | ||
2700 | + Prints a usage message incorporating the message to stderr and | ||
2701 | + exits. | ||
2702 | + | ||
2703 | + If you override this in a subclass, it should not return -- it | ||
2704 | + should either exit or raise an exception. | ||
2705 | + """ | ||
2706 | + self.print_usage(_sys.stderr) | ||
2707 | + self.exit(2, _('%s: error: %s\n') % (self.prog, message)) | ||
2708 | -- | 163 | -- |
2709 | 2.13.5 | 164 | 2.24.1 |
2710 | 165 | ||
2711 | 166 | diff view generated by jsdifflib |
1 | From: Alberto Garcia <berto@igalia.com> | 1 | From: David Edmondson <david.edmondson@oracle.com> |
---|---|---|---|
2 | 2 | ||
3 | LeakyBucket.burst_length is defined as an unsigned integer but the | 3 | RFC 7230 section 3.2 indicates that whitespace is permitted between |
4 | code never checks for overflows and it only makes sure that the value | 4 | the field name and field value and after the field value. |
5 | is not 0. | ||
6 | 5 | ||
7 | In practice this means that the user can set something like | 6 | Signed-off-by: David Edmondson <david.edmondson@oracle.com> |
8 | throttling.iops-total-max-length=4294967300 despite being larger than | 7 | Message-Id: <20200224101310.101169-2-david.edmondson@oracle.com> |
9 | UINT_MAX and the final value after casting to unsigned int will be 4. | 8 | Reviewed-by: Max Reitz <mreitz@redhat.com> |
9 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
10 | --- | ||
11 | block/curl.c | 31 +++++++++++++++++++++++++++---- | ||
12 | 1 file changed, 27 insertions(+), 4 deletions(-) | ||
10 | 13 | ||
11 | This patch changes the data type to uint64_t. This does not increase | 14 | diff --git a/block/curl.c b/block/curl.c |
12 | the storage size of LeakyBucket, and allows us to assign the value | ||
13 | directly from qemu_opt_get_number() or BlockIOThrottle and then do the | ||
14 | checks directly in throttle_is_valid(). | ||
15 | |||
16 | The value of burst_length does not have a specific upper limit, | ||
17 | but since the bucket size is defined by max * burst_length we have | ||
18 | to prevent overflows. Instead of going for UINT64_MAX or something | ||
19 | similar this patch reuses THROTTLE_VALUE_MAX, which allows I/O bursts | ||
20 | of 1 GiB/s for 10 days in a row. | ||
21 | |||
22 | Signed-off-by: Alberto Garcia <berto@igalia.com> | ||
23 | Message-id: 1b2e3049803f71cafb2e1fa1be4fb47147a0d398.1503580370.git.berto@igalia.com | ||
24 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | ||
25 | --- | ||
26 | include/qemu/throttle.h | 2 +- | ||
27 | util/throttle.c | 5 +++++ | ||
28 | 2 files changed, 6 insertions(+), 1 deletion(-) | ||
29 | |||
30 | diff --git a/include/qemu/throttle.h b/include/qemu/throttle.h | ||
31 | index XXXXXXX..XXXXXXX 100644 | 15 | index XXXXXXX..XXXXXXX 100644 |
32 | --- a/include/qemu/throttle.h | 16 | --- a/block/curl.c |
33 | +++ b/include/qemu/throttle.h | 17 | +++ b/block/curl.c |
34 | @@ -XXX,XX +XXX,XX @@ typedef struct LeakyBucket { | 18 | @@ -XXX,XX +XXX,XX @@ static size_t curl_header_cb(void *ptr, size_t size, size_t nmemb, void *opaque) |
35 | uint64_t max; /* leaky bucket max burst in units */ | 19 | { |
36 | double level; /* bucket level in units */ | 20 | BDRVCURLState *s = opaque; |
37 | double burst_level; /* bucket level in units (for computing bursts) */ | 21 | size_t realsize = size * nmemb; |
38 | - unsigned burst_length; /* max length of the burst period, in seconds */ | 22 | - const char *accept_line = "Accept-Ranges: bytes"; |
39 | + uint64_t burst_length; /* max length of the burst period, in seconds */ | 23 | + const char *header = (char *)ptr; |
40 | } LeakyBucket; | 24 | + const char *end = header + realsize; |
41 | 25 | + const char *accept_ranges = "Accept-Ranges:"; | |
42 | /* The following structure is used to configure a ThrottleState | 26 | + const char *bytes = "bytes"; |
43 | diff --git a/util/throttle.c b/util/throttle.c | 27 | |
44 | index XXXXXXX..XXXXXXX 100644 | 28 | - if (realsize >= strlen(accept_line) |
45 | --- a/util/throttle.c | 29 | - && strncmp((char *)ptr, accept_line, strlen(accept_line)) == 0) { |
46 | +++ b/util/throttle.c | 30 | - s->accept_range = true; |
47 | @@ -XXX,XX +XXX,XX @@ bool throttle_is_valid(ThrottleConfig *cfg, Error **errp) | 31 | + if (realsize >= strlen(accept_ranges) |
48 | return false; | 32 | + && strncmp(header, accept_ranges, strlen(accept_ranges)) == 0) { |
49 | } | 33 | + |
50 | 34 | + char *p = strchr(header, ':') + 1; | |
51 | + if (bkt->max && bkt->burst_length > THROTTLE_VALUE_MAX / bkt->max) { | 35 | + |
52 | + error_setg(errp, "burst length too high for this burst rate"); | 36 | + /* Skip whitespace between the header name and value. */ |
53 | + return false; | 37 | + while (p < end && *p && g_ascii_isspace(*p)) { |
38 | + p++; | ||
54 | + } | 39 | + } |
55 | + | 40 | + |
56 | if (bkt->max && !bkt->avg) { | 41 | + if (end - p >= strlen(bytes) |
57 | error_setg(errp, "bps_max/iops_max require corresponding" | 42 | + && strncmp(p, bytes, strlen(bytes)) == 0) { |
58 | " bps/iops values"); | 43 | + |
44 | + /* Check that there is nothing but whitespace after the value. */ | ||
45 | + p += strlen(bytes); | ||
46 | + while (p < end && *p && g_ascii_isspace(*p)) { | ||
47 | + p++; | ||
48 | + } | ||
49 | + | ||
50 | + if (p == end || !*p) { | ||
51 | + s->accept_range = true; | ||
52 | + } | ||
53 | + } | ||
54 | } | ||
55 | |||
56 | return realsize; | ||
59 | -- | 57 | -- |
60 | 2.13.5 | 58 | 2.24.1 |
61 | 59 | ||
62 | 60 | diff view generated by jsdifflib |
1 | From: Fred Rolland <rollandf@gmail.com> | 1 | From: David Edmondson <david.edmondson@oracle.com> |
---|---|---|---|
2 | 2 | ||
3 | Update doc with the usage of UUID for initiator name. | 3 | RFC 7230 section 3.2 indicates that HTTP header field names are case |
4 | insensitive. | ||
4 | 5 | ||
5 | Related-To: https://bugzilla.redhat.com/1006468 | 6 | Signed-off-by: David Edmondson <david.edmondson@oracle.com> |
6 | Signed-off-by: Fred Rolland <frolland@redhat.com> | 7 | Message-Id: <20200224101310.101169-3-david.edmondson@oracle.com> |
7 | Message-id: 20170823084830.30500-1-frolland@redhat.com | 8 | Reviewed-by: Max Reitz <mreitz@redhat.com> |
8 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 9 | Signed-off-by: Max Reitz <mreitz@redhat.com> |
9 | --- | 10 | --- |
10 | qemu-doc.texi | 5 +++-- | 11 | block/curl.c | 5 +++-- |
11 | 1 file changed, 3 insertions(+), 2 deletions(-) | 12 | 1 file changed, 3 insertions(+), 2 deletions(-) |
12 | 13 | ||
13 | diff --git a/qemu-doc.texi b/qemu-doc.texi | 14 | diff --git a/block/curl.c b/block/curl.c |
14 | index XXXXXXX..XXXXXXX 100644 | 15 | index XXXXXXX..XXXXXXX 100644 |
15 | --- a/qemu-doc.texi | 16 | --- a/block/curl.c |
16 | +++ b/qemu-doc.texi | 17 | +++ b/block/curl.c |
17 | @@ -XXX,XX +XXX,XX @@ in a configuration file provided via '-readconfig' or directly on the | 18 | @@ -XXX,XX +XXX,XX @@ static size_t curl_header_cb(void *ptr, size_t size, size_t nmemb, void *opaque) |
18 | command line. | 19 | size_t realsize = size * nmemb; |
19 | 20 | const char *header = (char *)ptr; | |
20 | If the initiator-name is not specified qemu will use a default name | 21 | const char *end = header + realsize; |
21 | -of 'iqn.2008-11.org.linux-kvm[:<name>'] where <name> is the name of the | 22 | - const char *accept_ranges = "Accept-Ranges:"; |
22 | +of 'iqn.2008-11.org.linux-kvm[:<uuid>'] where <uuid> is the UUID of the | 23 | + const char *accept_ranges = "accept-ranges:"; |
23 | +virtual machine. If the UUID is not specified qemu will use | 24 | const char *bytes = "bytes"; |
24 | +'iqn.2008-11.org.linux-kvm[:<name>'] where <name> is the name of the | 25 | |
25 | virtual machine. | 26 | if (realsize >= strlen(accept_ranges) |
26 | 27 | - && strncmp(header, accept_ranges, strlen(accept_ranges)) == 0) { | |
27 | - | 28 | + && g_ascii_strncasecmp(header, accept_ranges, |
28 | @example | 29 | + strlen(accept_ranges)) == 0) { |
29 | Setting a specific initiator name to use when logging in to the target | 30 | |
30 | -iscsi initiator-name=iqn.qemu.test:my-initiator | 31 | char *p = strchr(header, ':') + 1; |
32 | |||
31 | -- | 33 | -- |
32 | 2.13.5 | 34 | 2.24.1 |
33 | 35 | ||
34 | 36 | diff view generated by jsdifflib |
1 | From: Alberto Garcia <berto@igalia.com> | 1 | From: Eric Blake <eblake@redhat.com> |
---|---|---|---|
2 | 2 | ||
3 | The way the throttling algorithm works is that requests start being | 3 | Tests 261 and 272 fail on RHEL 7 with coreutils 8.22, since od |
4 | throttled once the bucket level exceeds the burst limit. When we get | 4 | --endian was not added until coreutils 8.23. Fix this by manually |
5 | there the bucket leaks at the level set by the user (bkt->avg), and | 5 | constructing the final value one byte at a time. |
6 | that leak rate is what prevents guest I/O from exceeding the desired | ||
7 | limit. | ||
8 | 6 | ||
9 | If we don't allow bursts (i.e. bkt->max == 0) then we can start | 7 | Fixes: fc8ba423 |
10 | throttling requests immediately. The problem with keeping the | 8 | Reported-by: Andrey Shinkevich <andrey.shinkevich@virtuozzo.com> |
11 | threshold at 0 is that it only allows one request at a time, and as | 9 | Signed-off-by: Eric Blake <eblake@redhat.com> |
12 | soon as there's a bit of I/O from the guest every other request will | 10 | Reviewed-by: Max Reitz <mreitz@redhat.com> |
13 | be throttled and performance will suffer considerably. That can even | 11 | Message-Id: <20200226125424.481840-1-eblake@redhat.com> |
14 | make the guest unable to reach the throttle limit if that limit is | 12 | Signed-off-by: Max Reitz <mreitz@redhat.com> |
15 | high enough, and that happens regardless of the block scheduler used | 13 | --- |
16 | by the guest. | 14 | tests/qemu-iotests/common.rc | 22 +++++++++++++++++----- |
15 | 1 file changed, 17 insertions(+), 5 deletions(-) | ||
17 | 16 | ||
18 | Increasing that threshold gives flexibility to the guest, allowing it | 17 | diff --git a/tests/qemu-iotests/common.rc b/tests/qemu-iotests/common.rc |
19 | to perform short bursts of I/O before being throttled. Increasing the | ||
20 | threshold too much does not make a difference in the long run (because | ||
21 | it's the leak rate what defines the actual throughput) but it does | ||
22 | allow the guest to perform longer initial bursts and exceed the | ||
23 | throttle limit for a short while. | ||
24 | |||
25 | A burst value of bkt->avg / 10 allows the guest to perform 100ms' | ||
26 | worth of I/O at the target rate without being throttled. | ||
27 | |||
28 | Signed-off-by: Alberto Garcia <berto@igalia.com> | ||
29 | Message-id: 31aae6645f0d1fbf3860fb2b528b757236f0c0a7.1503580370.git.berto@igalia.com | ||
30 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | ||
31 | --- | ||
32 | util/throttle.c | 11 +++-------- | ||
33 | 1 file changed, 3 insertions(+), 8 deletions(-) | ||
34 | |||
35 | diff --git a/util/throttle.c b/util/throttle.c | ||
36 | index XXXXXXX..XXXXXXX 100644 | 18 | index XXXXXXX..XXXXXXX 100644 |
37 | --- a/util/throttle.c | 19 | --- a/tests/qemu-iotests/common.rc |
38 | +++ b/util/throttle.c | 20 | +++ b/tests/qemu-iotests/common.rc |
39 | @@ -XXX,XX +XXX,XX @@ static void throttle_fix_bucket(LeakyBucket *bkt) | 21 | @@ -XXX,XX +XXX,XX @@ poke_file() |
40 | /* zero bucket level */ | 22 | # peek_file_le 'test.img' 512 2 => 65534 |
41 | bkt->level = bkt->burst_level = 0; | 23 | peek_file_le() |
42 | 24 | { | |
43 | - /* The following is done to cope with the Linux CFQ block scheduler | 25 | - # Wrap in echo $() to strip spaces |
44 | - * which regroup reads and writes by block of 100ms in the guest. | 26 | - echo $(od -j"$2" -N"$3" --endian=little -An -vtu"$3" "$1") |
45 | - * When they are two process one making reads and one making writes cfq | 27 | + local val=0 shift=0 byte |
46 | - * make a pattern looking like the following: | 28 | + |
47 | - * WWWWWWWWWWWRRRRRRRRRRRRRRWWWWWWWWWWWWWwRRRRRRRRRRRRRRRRR | 29 | + # coreutils' od --endian is not portable, so manually assemble bytes. |
48 | - * Having a max burst value of 100ms of the average will help smooth the | 30 | + for byte in $(od -j"$2" -N"$3" -An -v -tu1 "$1"); do |
49 | - * throttling | 31 | + val=$(( val | (byte << shift) )) |
50 | - */ | 32 | + shift=$((shift + 8)) |
51 | + /* If bkt->max is 0 we still want to allow short bursts of I/O | 33 | + done |
52 | + * from the guest, otherwise every other request will be throttled | 34 | + printf %llu $val |
53 | + * and performance will suffer considerably. */ | 35 | } |
54 | min = bkt->avg / 10; | 36 | |
55 | if (bkt->avg && !bkt->max) { | 37 | # peek_file_be 'test.img' 512 2 => 65279 |
56 | bkt->max = min; | 38 | peek_file_be() |
39 | { | ||
40 | - # Wrap in echo $() to strip spaces | ||
41 | - echo $(od -j"$2" -N"$3" --endian=big -An -vtu"$3" "$1") | ||
42 | + local val=0 byte | ||
43 | + | ||
44 | + # coreutils' od --endian is not portable, so manually assemble bytes. | ||
45 | + for byte in $(od -j"$2" -N"$3" -An -v -tu1 "$1"); do | ||
46 | + val=$(( (val << 8) | byte )) | ||
47 | + done | ||
48 | + printf %llu $val | ||
49 | } | ||
50 | |||
51 | -# peek_file_raw 'test.img' 512 2 => '\xff\xfe' | ||
52 | +# peek_file_raw 'test.img' 512 2 => '\xff\xfe'. Do not use if the raw data | ||
53 | +# is likely to contain \0 or trailing \n. | ||
54 | peek_file_raw() | ||
55 | { | ||
56 | dd if="$1" bs=1 skip="$2" count="$3" status=none | ||
57 | -- | 57 | -- |
58 | 2.13.5 | 58 | 2.24.1 |
59 | 59 | ||
60 | 60 | diff view generated by jsdifflib |
1 | From: Alberto Garcia <berto@igalia.com> | 1 | From: Pan Nengyuan <pannengyuan@huawei.com> |
---|---|---|---|
2 | 2 | ||
3 | There's a few cases which we're passing an Error pointer to a function | 3 | 'crypto_opts' forgot to free in qcow2_close(), this patch fix the bellow leak stack: |
4 | only to discard it immediately afterwards without checking it. In | ||
5 | these cases we can simply remove the variable and pass NULL instead. | ||
6 | 4 | ||
7 | Signed-off-by: Alberto Garcia <berto@igalia.com> | 5 | Direct leak of 24 byte(s) in 1 object(s) allocated from: |
8 | Reviewed-by: Philippe Mathieu-Daudé <f4bug@amsat.org> | 6 | #0 0x7f0edd81f970 in __interceptor_calloc (/lib64/libasan.so.5+0xef970) |
9 | Reviewed-by: Eric Blake <eblake@redhat.com> | 7 | #1 0x7f0edc6d149d in g_malloc0 (/lib64/libglib-2.0.so.0+0x5249d) |
10 | Message-id: 20170829120836.16091-1-berto@igalia.com | 8 | #2 0x55d7eaede63d in qobject_input_start_struct /mnt/sdb/qemu-new/qemu_test/qemu/qapi/qobject-input-visitor.c:295 |
11 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 9 | #3 0x55d7eaed78b8 in visit_start_struct /mnt/sdb/qemu-new/qemu_test/qemu/qapi/qapi-visit-core.c:49 |
10 | #4 0x55d7eaf5140b in visit_type_QCryptoBlockOpenOptions qapi/qapi-visit-crypto.c:290 | ||
11 | #5 0x55d7eae43af3 in block_crypto_open_opts_init /mnt/sdb/qemu-new/qemu_test/qemu/block/crypto.c:163 | ||
12 | #6 0x55d7eacd2924 in qcow2_update_options_prepare /mnt/sdb/qemu-new/qemu_test/qemu/block/qcow2.c:1148 | ||
13 | #7 0x55d7eacd33f7 in qcow2_update_options /mnt/sdb/qemu-new/qemu_test/qemu/block/qcow2.c:1232 | ||
14 | #8 0x55d7eacd9680 in qcow2_do_open /mnt/sdb/qemu-new/qemu_test/qemu/block/qcow2.c:1512 | ||
15 | #9 0x55d7eacdc55e in qcow2_open_entry /mnt/sdb/qemu-new/qemu_test/qemu/block/qcow2.c:1792 | ||
16 | #10 0x55d7eacdc8fe in qcow2_open /mnt/sdb/qemu-new/qemu_test/qemu/block/qcow2.c:1819 | ||
17 | #11 0x55d7eac3742d in bdrv_open_driver /mnt/sdb/qemu-new/qemu_test/qemu/block.c:1317 | ||
18 | #12 0x55d7eac3e990 in bdrv_open_common /mnt/sdb/qemu-new/qemu_test/qemu/block.c:1575 | ||
19 | #13 0x55d7eac4442c in bdrv_open_inherit /mnt/sdb/qemu-new/qemu_test/qemu/block.c:3126 | ||
20 | #14 0x55d7eac45c3f in bdrv_open /mnt/sdb/qemu-new/qemu_test/qemu/block.c:3219 | ||
21 | #15 0x55d7ead8e8a4 in blk_new_open /mnt/sdb/qemu-new/qemu_test/qemu/block/block-backend.c:397 | ||
22 | #16 0x55d7eacde74c in qcow2_co_create /mnt/sdb/qemu-new/qemu_test/qemu/block/qcow2.c:3534 | ||
23 | #17 0x55d7eacdfa6d in qcow2_co_create_opts /mnt/sdb/qemu-new/qemu_test/qemu/block/qcow2.c:3668 | ||
24 | #18 0x55d7eac1c678 in bdrv_create_co_entry /mnt/sdb/qemu-new/qemu_test/qemu/block.c:485 | ||
25 | #19 0x55d7eb0024d2 in coroutine_trampoline /mnt/sdb/qemu-new/qemu_test/qemu/util/coroutine-ucontext.c:115 | ||
26 | |||
27 | Reported-by: Euler Robot <euler.robot@huawei.com> | ||
28 | Signed-off-by: Pan Nengyuan <pannengyuan@huawei.com> | ||
29 | Reviewed-by: Max Reitz <mreitz@redhat.com> | ||
30 | Message-Id: <20200227012950.12256-2-pannengyuan@huawei.com> | ||
31 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
12 | --- | 32 | --- |
13 | block/qcow.c | 12 +++--------- | 33 | block/qcow2.c | 1 + |
14 | block/qcow2.c | 8 ++------ | 34 | 1 file changed, 1 insertion(+) |
15 | dump.c | 4 +--- | ||
16 | 3 files changed, 6 insertions(+), 18 deletions(-) | ||
17 | 35 | ||
18 | diff --git a/block/qcow.c b/block/qcow.c | ||
19 | index XXXXXXX..XXXXXXX 100644 | ||
20 | --- a/block/qcow.c | ||
21 | +++ b/block/qcow.c | ||
22 | @@ -XXX,XX +XXX,XX @@ static uint64_t get_cluster_offset(BlockDriverState *bs, | ||
23 | start_sect = (offset & ~(s->cluster_size - 1)) >> 9; | ||
24 | for(i = 0; i < s->cluster_sectors; i++) { | ||
25 | if (i < n_start || i >= n_end) { | ||
26 | - Error *err = NULL; | ||
27 | memset(s->cluster_data, 0x00, 512); | ||
28 | if (qcrypto_block_encrypt(s->crypto, start_sect + i, | ||
29 | s->cluster_data, | ||
30 | BDRV_SECTOR_SIZE, | ||
31 | - &err) < 0) { | ||
32 | - error_free(err); | ||
33 | + NULL) < 0) { | ||
34 | errno = EIO; | ||
35 | return -1; | ||
36 | } | ||
37 | @@ -XXX,XX +XXX,XX @@ static coroutine_fn int qcow_co_readv(BlockDriverState *bs, int64_t sector_num, | ||
38 | QEMUIOVector hd_qiov; | ||
39 | uint8_t *buf; | ||
40 | void *orig_buf; | ||
41 | - Error *err = NULL; | ||
42 | |||
43 | if (qiov->niov > 1) { | ||
44 | buf = orig_buf = qemu_try_blockalign(bs, qiov->size); | ||
45 | @@ -XXX,XX +XXX,XX @@ static coroutine_fn int qcow_co_readv(BlockDriverState *bs, int64_t sector_num, | ||
46 | if (bs->encrypted) { | ||
47 | assert(s->crypto); | ||
48 | if (qcrypto_block_decrypt(s->crypto, sector_num, buf, | ||
49 | - n * BDRV_SECTOR_SIZE, &err) < 0) { | ||
50 | + n * BDRV_SECTOR_SIZE, NULL) < 0) { | ||
51 | goto fail; | ||
52 | } | ||
53 | } | ||
54 | @@ -XXX,XX +XXX,XX @@ done: | ||
55 | return ret; | ||
56 | |||
57 | fail: | ||
58 | - error_free(err); | ||
59 | ret = -EIO; | ||
60 | goto done; | ||
61 | } | ||
62 | @@ -XXX,XX +XXX,XX @@ static coroutine_fn int qcow_co_writev(BlockDriverState *bs, int64_t sector_num, | ||
63 | break; | ||
64 | } | ||
65 | if (bs->encrypted) { | ||
66 | - Error *err = NULL; | ||
67 | assert(s->crypto); | ||
68 | if (qcrypto_block_encrypt(s->crypto, sector_num, buf, | ||
69 | - n * BDRV_SECTOR_SIZE, &err) < 0) { | ||
70 | - error_free(err); | ||
71 | + n * BDRV_SECTOR_SIZE, NULL) < 0) { | ||
72 | ret = -EIO; | ||
73 | break; | ||
74 | } | ||
75 | diff --git a/block/qcow2.c b/block/qcow2.c | 36 | diff --git a/block/qcow2.c b/block/qcow2.c |
76 | index XXXXXXX..XXXXXXX 100644 | 37 | index XXXXXXX..XXXXXXX 100644 |
77 | --- a/block/qcow2.c | 38 | --- a/block/qcow2.c |
78 | +++ b/block/qcow2.c | 39 | +++ b/block/qcow2.c |
79 | @@ -XXX,XX +XXX,XX @@ static coroutine_fn int qcow2_co_preadv(BlockDriverState *bs, uint64_t offset, | 40 | @@ -XXX,XX +XXX,XX @@ static void qcow2_close(BlockDriverState *bs) |
80 | assert(s->crypto); | 41 | |
81 | assert((offset & (BDRV_SECTOR_SIZE - 1)) == 0); | 42 | qcrypto_block_free(s->crypto); |
82 | assert((cur_bytes & (BDRV_SECTOR_SIZE - 1)) == 0); | 43 | s->crypto = NULL; |
83 | - Error *err = NULL; | 44 | + qapi_free_QCryptoBlockOpenOptions(s->crypto_opts); |
84 | if (qcrypto_block_decrypt(s->crypto, | 45 | |
85 | (s->crypt_physical_offset ? | 46 | g_free(s->unknown_header_fields); |
86 | cluster_offset + offset_in_cluster : | 47 | cleanup_unknown_header_ext(bs); |
87 | offset) >> BDRV_SECTOR_BITS, | ||
88 | cluster_data, | ||
89 | cur_bytes, | ||
90 | - &err) < 0) { | ||
91 | - error_free(err); | ||
92 | + NULL) < 0) { | ||
93 | ret = -EIO; | ||
94 | goto fail; | ||
95 | } | ||
96 | @@ -XXX,XX +XXX,XX @@ static coroutine_fn int qcow2_co_pwritev(BlockDriverState *bs, uint64_t offset, | ||
97 | qemu_iovec_concat(&hd_qiov, qiov, bytes_done, cur_bytes); | ||
98 | |||
99 | if (bs->encrypted) { | ||
100 | - Error *err = NULL; | ||
101 | assert(s->crypto); | ||
102 | if (!cluster_data) { | ||
103 | cluster_data = qemu_try_blockalign(bs->file->bs, | ||
104 | @@ -XXX,XX +XXX,XX @@ static coroutine_fn int qcow2_co_pwritev(BlockDriverState *bs, uint64_t offset, | ||
105 | cluster_offset + offset_in_cluster : | ||
106 | offset) >> BDRV_SECTOR_BITS, | ||
107 | cluster_data, | ||
108 | - cur_bytes, &err) < 0) { | ||
109 | - error_free(err); | ||
110 | + cur_bytes, NULL) < 0) { | ||
111 | ret = -EIO; | ||
112 | goto fail; | ||
113 | } | ||
114 | diff --git a/dump.c b/dump.c | ||
115 | index XXXXXXX..XXXXXXX 100644 | ||
116 | --- a/dump.c | ||
117 | +++ b/dump.c | ||
118 | @@ -XXX,XX +XXX,XX @@ static void dump_process(DumpState *s, Error **errp) | ||
119 | |||
120 | static void *dump_thread(void *data) | ||
121 | { | ||
122 | - Error *err = NULL; | ||
123 | DumpState *s = (DumpState *)data; | ||
124 | - dump_process(s, &err); | ||
125 | - error_free(err); | ||
126 | + dump_process(s, NULL); | ||
127 | return NULL; | ||
128 | } | ||
129 | |||
130 | -- | 48 | -- |
131 | 2.13.5 | 49 | 2.24.1 |
132 | 50 | ||
133 | 51 | diff view generated by jsdifflib |
1 | From: Alberto Garcia <berto@igalia.com> | 1 | From: Pan Nengyuan <pannengyuan@huawei.com> |
---|---|---|---|
2 | 2 | ||
3 | The level of the burst bucket is stored in bkt.burst_level, not | 3 | collect_image_check() is called twice in img_check(), the filename/format will be alloced without free the original memory. |
4 | bkt.burst_length. | 4 | It is not a big deal since the process will exit anyway, but seems like a clean code and it will remove the warning spotted by asan. |
5 | 5 | ||
6 | Signed-off-by: Alberto Garcia <berto@igalia.com> | 6 | Reported-by: Euler Robot <euler.robot@huawei.com> |
7 | Reviewed-by: Manos Pitsidianakis <el13635@mail.ntua.gr> | 7 | Signed-off-by: Pan Nengyuan <pannengyuan@huawei.com> |
8 | Message-id: 49aab2711d02f285567f3b3b13a113847af33812.1503580370.git.berto@igalia.com | 8 | Message-Id: <20200227012950.12256-3-pannengyuan@huawei.com> |
9 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 9 | Signed-off-by: Max Reitz <mreitz@redhat.com> |
10 | --- | 10 | --- |
11 | include/qemu/throttle.h | 2 +- | 11 | qemu-img.c | 2 ++ |
12 | 1 file changed, 1 insertion(+), 1 deletion(-) | 12 | 1 file changed, 2 insertions(+) |
13 | 13 | ||
14 | diff --git a/include/qemu/throttle.h b/include/qemu/throttle.h | 14 | diff --git a/qemu-img.c b/qemu-img.c |
15 | index XXXXXXX..XXXXXXX 100644 | 15 | index XXXXXXX..XXXXXXX 100644 |
16 | --- a/include/qemu/throttle.h | 16 | --- a/qemu-img.c |
17 | +++ b/include/qemu/throttle.h | 17 | +++ b/qemu-img.c |
18 | @@ -XXX,XX +XXX,XX @@ typedef enum { | 18 | @@ -XXX,XX +XXX,XX @@ static int img_check(int argc, char **argv) |
19 | * - The bkt.avg rate does not apply until the bucket is full, | 19 | check->corruptions_fixed); |
20 | * allowing the user to do bursts until then. The I/O limit during | 20 | } |
21 | * bursts is bkt.max. To enforce this limit we keep an additional | 21 | |
22 | - * bucket in bkt.burst_length that leaks at a rate of bkt.max units | 22 | + qapi_free_ImageCheck(check); |
23 | + * bucket in bkt.burst_level that leaks at a rate of bkt.max units | 23 | + check = g_new0(ImageCheck, 1); |
24 | * per second. | 24 | ret = collect_image_check(bs, check, filename, fmt, 0); |
25 | * | 25 | |
26 | * - Because of all of the above, the user can perform I/O at a | 26 | check->leaks_fixed = leaks_fixed; |
27 | -- | 27 | -- |
28 | 2.13.5 | 28 | 2.24.1 |
29 | 29 | ||
30 | 30 | diff view generated by jsdifflib |
1 | From: Eduardo Habkost <ehabkost@redhat.com> | 1 | From: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> |
---|---|---|---|
2 | 2 | ||
3 | If QEMU is running on a system that's out of memory and mmap() | 3 | On success path we return what inflate() returns instead of 0. And it |
4 | fails, QEMU aborts with no error message at all, making it hard | 4 | most probably works for Z_STREAM_END as it is positive, but is |
5 | to debug the reason for the failure. | 5 | definitely broken for Z_BUF_ERROR. |
6 | 6 | ||
7 | Add perror() calls that will print error information before | 7 | While being here, switch to errno return code, to be closer to |
8 | aborting. | 8 | qcow2_compress API (and usual expectations). |
9 | 9 | ||
10 | Signed-off-by: Eduardo Habkost <ehabkost@redhat.com> | 10 | Revert condition in if to be more positive. Drop dead initialization of |
11 | Reviewed-by: Philippe Mathieu-Daudé <f4bug@amsat.org> | 11 | ret. |
12 | Tested-by: Philippe Mathieu-Daudé <f4bug@amsat.org> | 12 | |
13 | Message-id: 20170829212053.6003-1-ehabkost@redhat.com | 13 | Cc: qemu-stable@nongnu.org # v4.0 |
14 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 14 | Fixes: 341926ab83e2b |
15 | Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | ||
16 | Message-Id: <20200302150930.16218-1-vsementsov@virtuozzo.com> | ||
17 | Reviewed-by: Alberto Garcia <berto@igalia.com> | ||
18 | Reviewed-by: Ján Tomko <jtomko@redhat.com> | ||
19 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
15 | --- | 20 | --- |
16 | util/oslib-posix.c | 2 ++ | 21 | block/qcow2-threads.c | 12 +++++++----- |
17 | 1 file changed, 2 insertions(+) | 22 | 1 file changed, 7 insertions(+), 5 deletions(-) |
18 | 23 | ||
19 | diff --git a/util/oslib-posix.c b/util/oslib-posix.c | 24 | diff --git a/block/qcow2-threads.c b/block/qcow2-threads.c |
20 | index XXXXXXX..XXXXXXX 100644 | 25 | index XXXXXXX..XXXXXXX 100644 |
21 | --- a/util/oslib-posix.c | 26 | --- a/block/qcow2-threads.c |
22 | +++ b/util/oslib-posix.c | 27 | +++ b/block/qcow2-threads.c |
23 | @@ -XXX,XX +XXX,XX @@ void *qemu_alloc_stack(size_t *sz) | 28 | @@ -XXX,XX +XXX,XX @@ static ssize_t qcow2_compress(void *dest, size_t dest_size, |
24 | ptr = mmap(NULL, *sz, PROT_READ | PROT_WRITE, | 29 | * @src - source buffer, @src_size bytes |
25 | MAP_PRIVATE | MAP_ANONYMOUS, -1, 0); | 30 | * |
26 | if (ptr == MAP_FAILED) { | 31 | * Returns: 0 on success |
27 | + perror("failed to allocate memory for stack"); | 32 | - * -1 on fail |
28 | abort(); | 33 | + * -EIO on fail |
34 | */ | ||
35 | static ssize_t qcow2_decompress(void *dest, size_t dest_size, | ||
36 | const void *src, size_t src_size) | ||
37 | { | ||
38 | - int ret = 0; | ||
39 | + int ret; | ||
40 | z_stream strm; | ||
41 | |||
42 | memset(&strm, 0, sizeof(strm)); | ||
43 | @@ -XXX,XX +XXX,XX @@ static ssize_t qcow2_decompress(void *dest, size_t dest_size, | ||
44 | |||
45 | ret = inflateInit2(&strm, -12); | ||
46 | if (ret != Z_OK) { | ||
47 | - return -1; | ||
48 | + return -EIO; | ||
29 | } | 49 | } |
30 | 50 | ||
31 | @@ -XXX,XX +XXX,XX @@ void *qemu_alloc_stack(size_t *sz) | 51 | ret = inflate(&strm, Z_FINISH); |
32 | guardpage = ptr; | 52 | - if ((ret != Z_STREAM_END && ret != Z_BUF_ERROR) || strm.avail_out != 0) { |
33 | #endif | 53 | + if ((ret == Z_STREAM_END || ret == Z_BUF_ERROR) && strm.avail_out == 0) { |
34 | if (mprotect(guardpage, pagesz, PROT_NONE) != 0) { | 54 | /* |
35 | + perror("failed to set up stack guard page"); | 55 | * We approve Z_BUF_ERROR because we need @dest buffer to be filled, but |
36 | abort(); | 56 | * @src buffer may be processed partly (because in qcow2 we know size of |
57 | * compressed data with precision of one sector) | ||
58 | */ | ||
59 | - ret = -1; | ||
60 | + ret = 0; | ||
61 | + } else { | ||
62 | + ret = -EIO; | ||
37 | } | 63 | } |
38 | 64 | ||
65 | inflateEnd(&strm); | ||
39 | -- | 66 | -- |
40 | 2.13.5 | 67 | 2.24.1 |
41 | 68 | ||
42 | 69 | diff view generated by jsdifflib |
New patch | |||
---|---|---|---|
1 | 1 | From: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | |
2 | |||
3 | We need it in separate to pass to the block-copy object in the next | ||
4 | commit. | ||
5 | |||
6 | Cc: qemu-stable@nongnu.org | ||
7 | Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | ||
8 | Reviewed-by: Andrey Shinkevich <andrey.shinkevich@virtuozzo.com> | ||
9 | Reviewed-by: Max Reitz <mreitz@redhat.com> | ||
10 | Message-Id: <20200311103004.7649-2-vsementsov@virtuozzo.com> | ||
11 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
12 | --- | ||
13 | blockjob.c | 16 +++++----- | ||
14 | include/qemu/job.h | 11 ++----- | ||
15 | include/qemu/progress_meter.h | 58 +++++++++++++++++++++++++++++++++++ | ||
16 | job-qmp.c | 4 +-- | ||
17 | job.c | 6 ++-- | ||
18 | qemu-img.c | 6 ++-- | ||
19 | 6 files changed, 76 insertions(+), 25 deletions(-) | ||
20 | create mode 100644 include/qemu/progress_meter.h | ||
21 | |||
22 | diff --git a/blockjob.c b/blockjob.c | ||
23 | index XXXXXXX..XXXXXXX 100644 | ||
24 | --- a/blockjob.c | ||
25 | +++ b/blockjob.c | ||
26 | @@ -XXX,XX +XXX,XX @@ BlockJobInfo *block_job_query(BlockJob *job, Error **errp) | ||
27 | info->device = g_strdup(job->job.id); | ||
28 | info->busy = atomic_read(&job->job.busy); | ||
29 | info->paused = job->job.pause_count > 0; | ||
30 | - info->offset = job->job.progress_current; | ||
31 | - info->len = job->job.progress_total; | ||
32 | + info->offset = job->job.progress.current; | ||
33 | + info->len = job->job.progress.total; | ||
34 | info->speed = job->speed; | ||
35 | info->io_status = job->iostatus; | ||
36 | info->ready = job_is_ready(&job->job), | ||
37 | @@ -XXX,XX +XXX,XX @@ static void block_job_event_cancelled(Notifier *n, void *opaque) | ||
38 | |||
39 | qapi_event_send_block_job_cancelled(job_type(&job->job), | ||
40 | job->job.id, | ||
41 | - job->job.progress_total, | ||
42 | - job->job.progress_current, | ||
43 | + job->job.progress.total, | ||
44 | + job->job.progress.current, | ||
45 | job->speed); | ||
46 | } | ||
47 | |||
48 | @@ -XXX,XX +XXX,XX @@ static void block_job_event_completed(Notifier *n, void *opaque) | ||
49 | |||
50 | qapi_event_send_block_job_completed(job_type(&job->job), | ||
51 | job->job.id, | ||
52 | - job->job.progress_total, | ||
53 | - job->job.progress_current, | ||
54 | + job->job.progress.total, | ||
55 | + job->job.progress.current, | ||
56 | job->speed, | ||
57 | !!msg, | ||
58 | msg); | ||
59 | @@ -XXX,XX +XXX,XX @@ static void block_job_event_ready(Notifier *n, void *opaque) | ||
60 | |||
61 | qapi_event_send_block_job_ready(job_type(&job->job), | ||
62 | job->job.id, | ||
63 | - job->job.progress_total, | ||
64 | - job->job.progress_current, | ||
65 | + job->job.progress.total, | ||
66 | + job->job.progress.current, | ||
67 | job->speed); | ||
68 | } | ||
69 | |||
70 | diff --git a/include/qemu/job.h b/include/qemu/job.h | ||
71 | index XXXXXXX..XXXXXXX 100644 | ||
72 | --- a/include/qemu/job.h | ||
73 | +++ b/include/qemu/job.h | ||
74 | @@ -XXX,XX +XXX,XX @@ | ||
75 | |||
76 | #include "qapi/qapi-types-job.h" | ||
77 | #include "qemu/queue.h" | ||
78 | +#include "qemu/progress_meter.h" | ||
79 | #include "qemu/coroutine.h" | ||
80 | #include "block/aio.h" | ||
81 | |||
82 | @@ -XXX,XX +XXX,XX @@ typedef struct Job { | ||
83 | /** True if this job should automatically dismiss itself */ | ||
84 | bool auto_dismiss; | ||
85 | |||
86 | - /** | ||
87 | - * Current progress. The unit is arbitrary as long as the ratio between | ||
88 | - * progress_current and progress_total represents the estimated percentage | ||
89 | - * of work already done. | ||
90 | - */ | ||
91 | - int64_t progress_current; | ||
92 | - | ||
93 | - /** Estimated progress_current value at the completion of the job */ | ||
94 | - int64_t progress_total; | ||
95 | + ProgressMeter progress; | ||
96 | |||
97 | /** | ||
98 | * Return code from @run and/or @prepare callback(s). | ||
99 | diff --git a/include/qemu/progress_meter.h b/include/qemu/progress_meter.h | ||
100 | new file mode 100644 | ||
101 | index XXXXXXX..XXXXXXX | ||
102 | --- /dev/null | ||
103 | +++ b/include/qemu/progress_meter.h | ||
104 | @@ -XXX,XX +XXX,XX @@ | ||
105 | +/* | ||
106 | + * Helper functionality for some process progress tracking. | ||
107 | + * | ||
108 | + * Copyright (c) 2011 IBM Corp. | ||
109 | + * Copyright (c) 2012, 2018 Red Hat, Inc. | ||
110 | + * Copyright (c) 2020 Virtuozzo International GmbH | ||
111 | + * | ||
112 | + * Permission is hereby granted, free of charge, to any person obtaining a copy | ||
113 | + * of this software and associated documentation files (the "Software"), to deal | ||
114 | + * in the Software without restriction, including without limitation the rights | ||
115 | + * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | ||
116 | + * copies of the Software, and to permit persons to whom the Software is | ||
117 | + * furnished to do so, subject to the following conditions: | ||
118 | + * | ||
119 | + * The above copyright notice and this permission notice shall be included in | ||
120 | + * all copies or substantial portions of the Software. | ||
121 | + * | ||
122 | + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | ||
123 | + * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | ||
124 | + * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL | ||
125 | + * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | ||
126 | + * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | ||
127 | + * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN | ||
128 | + * THE SOFTWARE. | ||
129 | + */ | ||
130 | + | ||
131 | +#ifndef QEMU_PROGRESS_METER_H | ||
132 | +#define QEMU_PROGRESS_METER_H | ||
133 | + | ||
134 | +typedef struct ProgressMeter { | ||
135 | + /** | ||
136 | + * Current progress. The unit is arbitrary as long as the ratio between | ||
137 | + * current and total represents the estimated percentage | ||
138 | + * of work already done. | ||
139 | + */ | ||
140 | + uint64_t current; | ||
141 | + | ||
142 | + /** Estimated current value at the completion of the process */ | ||
143 | + uint64_t total; | ||
144 | +} ProgressMeter; | ||
145 | + | ||
146 | +static inline void progress_work_done(ProgressMeter *pm, uint64_t done) | ||
147 | +{ | ||
148 | + pm->current += done; | ||
149 | +} | ||
150 | + | ||
151 | +static inline void progress_set_remaining(ProgressMeter *pm, uint64_t remaining) | ||
152 | +{ | ||
153 | + pm->total = pm->current + remaining; | ||
154 | +} | ||
155 | + | ||
156 | +static inline void progress_increase_remaining(ProgressMeter *pm, | ||
157 | + uint64_t delta) | ||
158 | +{ | ||
159 | + pm->total += delta; | ||
160 | +} | ||
161 | + | ||
162 | +#endif /* QEMU_PROGRESS_METER_H */ | ||
163 | diff --git a/job-qmp.c b/job-qmp.c | ||
164 | index XXXXXXX..XXXXXXX 100644 | ||
165 | --- a/job-qmp.c | ||
166 | +++ b/job-qmp.c | ||
167 | @@ -XXX,XX +XXX,XX @@ static JobInfo *job_query_single(Job *job, Error **errp) | ||
168 | .id = g_strdup(job->id), | ||
169 | .type = job_type(job), | ||
170 | .status = job->status, | ||
171 | - .current_progress = job->progress_current, | ||
172 | - .total_progress = job->progress_total, | ||
173 | + .current_progress = job->progress.current, | ||
174 | + .total_progress = job->progress.total, | ||
175 | .has_error = !!job->err, | ||
176 | .error = job->err ? \ | ||
177 | g_strdup(error_get_pretty(job->err)) : NULL, | ||
178 | diff --git a/job.c b/job.c | ||
179 | index XXXXXXX..XXXXXXX 100644 | ||
180 | --- a/job.c | ||
181 | +++ b/job.c | ||
182 | @@ -XXX,XX +XXX,XX @@ void job_unref(Job *job) | ||
183 | |||
184 | void job_progress_update(Job *job, uint64_t done) | ||
185 | { | ||
186 | - job->progress_current += done; | ||
187 | + progress_work_done(&job->progress, done); | ||
188 | } | ||
189 | |||
190 | void job_progress_set_remaining(Job *job, uint64_t remaining) | ||
191 | { | ||
192 | - job->progress_total = job->progress_current + remaining; | ||
193 | + progress_set_remaining(&job->progress, remaining); | ||
194 | } | ||
195 | |||
196 | void job_progress_increase_remaining(Job *job, uint64_t delta) | ||
197 | { | ||
198 | - job->progress_total += delta; | ||
199 | + progress_increase_remaining(&job->progress, delta); | ||
200 | } | ||
201 | |||
202 | void job_event_cancelled(Job *job) | ||
203 | diff --git a/qemu-img.c b/qemu-img.c | ||
204 | index XXXXXXX..XXXXXXX 100644 | ||
205 | --- a/qemu-img.c | ||
206 | +++ b/qemu-img.c | ||
207 | @@ -XXX,XX +XXX,XX @@ static void run_block_job(BlockJob *job, Error **errp) | ||
208 | do { | ||
209 | float progress = 0.0f; | ||
210 | aio_poll(aio_context, true); | ||
211 | - if (job->job.progress_total) { | ||
212 | - progress = (float)job->job.progress_current / | ||
213 | - job->job.progress_total * 100.f; | ||
214 | + if (job->job.progress.total) { | ||
215 | + progress = (float)job->job.progress.current / | ||
216 | + job->job.progress.total * 100.f; | ||
217 | } | ||
218 | qemu_progress_print(progress, 0); | ||
219 | } while (!job_is_ready(&job->job) && !job_is_completed(&job->job)); | ||
220 | -- | ||
221 | 2.24.1 | ||
222 | |||
223 | diff view generated by jsdifflib |
1 | From: Dan Aloni <dan@kernelim.com> | 1 | From: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> |
---|---|---|---|
2 | 2 | ||
3 | The number of queues that should be return by the admin command should: | 3 | Assume we have two regions, A and B, and region B is in-flight now, |
4 | region A is not yet touched, but it is unallocated and should be | ||
5 | skipped. | ||
4 | 6 | ||
5 | 1) Only mention the number of non-admin queues. | 7 | Correspondingly, as progress we have |
6 | 2) It is zero-based, meaning that '0 == one non-admin queue', | ||
7 | '1 == two non-admin queues', and so forth. | ||
8 | 8 | ||
9 | Because our `num_queues` means the number of queues _plus_ the admin | 9 | total = A + B |
10 | queue, then the right calculation for the number returned from the admin | 10 | current = 0 |
11 | command is `num_queues - 2`, combining the two requirements mentioned. | ||
12 | 11 | ||
13 | The issue was discovered by reducing num_queues from 64 to 8 and running | 12 | If we reset unallocated region A and call progress_reset_callback, |
14 | a Linux VM with an SMP parameter larger than that (e.g. 22). It tries to | 13 | it will calculate 0 bytes dirty in the bitmap and call |
15 | utilize all queues, and therefore fails with an invalid queue number | 14 | job_progress_set_remaining, which will set |
16 | when trying to queue I/Os on the last queue. | ||
17 | 15 | ||
18 | Signed-off-by: Dan Aloni <dan@kernelim.com> | 16 | total = current + 0 = 0 + 0 = 0 |
19 | CC: Alex Friedman <alex@e8storage.com> | 17 | |
20 | CC: Keith Busch <keith.busch@intel.com> | 18 | So, B bytes are actually removed from total accounting. When job |
21 | CC: Stefan Hajnoczi <stefanha@redhat.com> | 19 | finishes we'll have |
22 | Reviewed-by: Keith Busch <keith.busch@intel.com> | 20 | |
23 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 21 | total = 0 |
22 | current = B | ||
23 | |||
24 | , which doesn't sound good. | ||
25 | |||
26 | This is because we didn't considered in-flight bytes, actually when | ||
27 | calculating remaining, we should have set (in_flight + dirty_bytes) | ||
28 | as remaining, not only dirty_bytes. | ||
29 | |||
30 | To fix it, let's refactor progress calculation, moving it to block-copy | ||
31 | itself instead of fixing callback. And, of course, track in_flight | ||
32 | bytes count. | ||
33 | |||
34 | We still have to keep one callback, to maintain backup job bytes_read | ||
35 | calculation, but it will go on soon, when we turn the whole backup | ||
36 | process into one block_copy call. | ||
37 | |||
38 | Cc: qemu-stable@nongnu.org | ||
39 | Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | ||
40 | Reviewed-by: Andrey Shinkevich <andrey.shinkevich@virtuozzo.com> | ||
41 | Message-Id: <20200311103004.7649-3-vsementsov@virtuozzo.com> | ||
42 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
24 | --- | 43 | --- |
25 | hw/block/nvme.c | 4 ++-- | 44 | block/backup.c | 13 ++----------- |
26 | 1 file changed, 2 insertions(+), 2 deletions(-) | 45 | block/block-copy.c | 16 ++++++++++++---- |
46 | include/block/block-copy.h | 15 +++++---------- | ||
47 | 3 files changed, 19 insertions(+), 25 deletions(-) | ||
27 | 48 | ||
28 | diff --git a/hw/block/nvme.c b/hw/block/nvme.c | 49 | diff --git a/block/backup.c b/block/backup.c |
29 | index XXXXXXX..XXXXXXX 100644 | 50 | index XXXXXXX..XXXXXXX 100644 |
30 | --- a/hw/block/nvme.c | 51 | --- a/block/backup.c |
31 | +++ b/hw/block/nvme.c | 52 | +++ b/block/backup.c |
32 | @@ -XXX,XX +XXX,XX @@ static uint16_t nvme_get_feature(NvmeCtrl *n, NvmeCmd *cmd, NvmeRequest *req) | 53 | @@ -XXX,XX +XXX,XX @@ static void backup_progress_bytes_callback(int64_t bytes, void *opaque) |
33 | result = blk_enable_write_cache(n->conf.blk); | 54 | BackupBlockJob *s = opaque; |
34 | break; | 55 | |
35 | case NVME_NUMBER_OF_QUEUES: | 56 | s->bytes_read += bytes; |
36 | - result = cpu_to_le32((n->num_queues - 1) | ((n->num_queues - 1) << 16)); | 57 | - job_progress_update(&s->common.job, bytes); |
37 | + result = cpu_to_le32((n->num_queues - 2) | ((n->num_queues - 2) << 16)); | 58 | -} |
38 | break; | 59 | - |
39 | default: | 60 | -static void backup_progress_reset_callback(void *opaque) |
40 | return NVME_INVALID_FIELD | NVME_DNR; | 61 | -{ |
41 | @@ -XXX,XX +XXX,XX @@ static uint16_t nvme_set_feature(NvmeCtrl *n, NvmeCmd *cmd, NvmeRequest *req) | 62 | - BackupBlockJob *s = opaque; |
42 | break; | 63 | - uint64_t estimate = bdrv_get_dirty_count(s->bcs->copy_bitmap); |
43 | case NVME_NUMBER_OF_QUEUES: | 64 | - |
44 | req->cqe.result = | 65 | - job_progress_set_remaining(&s->common.job, estimate); |
45 | - cpu_to_le32((n->num_queues - 1) | ((n->num_queues - 1) << 16)); | 66 | } |
46 | + cpu_to_le32((n->num_queues - 2) | ((n->num_queues - 2) << 16)); | 67 | |
47 | break; | 68 | static int coroutine_fn backup_do_cow(BackupBlockJob *job, |
48 | default: | 69 | @@ -XXX,XX +XXX,XX @@ BlockJob *backup_job_create(const char *job_id, BlockDriverState *bs, |
49 | return NVME_INVALID_FIELD | NVME_DNR; | 70 | job->cluster_size = cluster_size; |
71 | job->len = len; | ||
72 | |||
73 | - block_copy_set_callbacks(bcs, backup_progress_bytes_callback, | ||
74 | - backup_progress_reset_callback, job); | ||
75 | + block_copy_set_progress_callback(bcs, backup_progress_bytes_callback, job); | ||
76 | + block_copy_set_progress_meter(bcs, &job->common.job.progress); | ||
77 | |||
78 | /* Required permissions are already taken by backup-top target */ | ||
79 | block_job_add_bdrv(&job->common, "target", target, 0, BLK_PERM_ALL, | ||
80 | diff --git a/block/block-copy.c b/block/block-copy.c | ||
81 | index XXXXXXX..XXXXXXX 100644 | ||
82 | --- a/block/block-copy.c | ||
83 | +++ b/block/block-copy.c | ||
84 | @@ -XXX,XX +XXX,XX @@ BlockCopyState *block_copy_state_new(BdrvChild *source, BdrvChild *target, | ||
85 | return s; | ||
86 | } | ||
87 | |||
88 | -void block_copy_set_callbacks( | ||
89 | +void block_copy_set_progress_callback( | ||
90 | BlockCopyState *s, | ||
91 | ProgressBytesCallbackFunc progress_bytes_callback, | ||
92 | - ProgressResetCallbackFunc progress_reset_callback, | ||
93 | void *progress_opaque) | ||
94 | { | ||
95 | s->progress_bytes_callback = progress_bytes_callback; | ||
96 | - s->progress_reset_callback = progress_reset_callback; | ||
97 | s->progress_opaque = progress_opaque; | ||
98 | } | ||
99 | |||
100 | +void block_copy_set_progress_meter(BlockCopyState *s, ProgressMeter *pm) | ||
101 | +{ | ||
102 | + s->progress = pm; | ||
103 | +} | ||
104 | + | ||
105 | /* | ||
106 | * block_copy_do_copy | ||
107 | * | ||
108 | @@ -XXX,XX +XXX,XX @@ int64_t block_copy_reset_unallocated(BlockCopyState *s, | ||
109 | |||
110 | if (!ret) { | ||
111 | bdrv_reset_dirty_bitmap(s->copy_bitmap, offset, bytes); | ||
112 | - s->progress_reset_callback(s->progress_opaque); | ||
113 | + progress_set_remaining(s->progress, | ||
114 | + bdrv_get_dirty_count(s->copy_bitmap) + | ||
115 | + s->in_flight_bytes); | ||
116 | } | ||
117 | |||
118 | *count = bytes; | ||
119 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
120 | trace_block_copy_process(s, start); | ||
121 | |||
122 | bdrv_reset_dirty_bitmap(s->copy_bitmap, start, chunk_end - start); | ||
123 | + s->in_flight_bytes += chunk_end - start; | ||
124 | |||
125 | co_get_from_shres(s->mem, chunk_end - start); | ||
126 | ret = block_copy_do_copy(s, start, chunk_end, error_is_read); | ||
127 | co_put_to_shres(s->mem, chunk_end - start); | ||
128 | + s->in_flight_bytes -= chunk_end - start; | ||
129 | if (ret < 0) { | ||
130 | bdrv_set_dirty_bitmap(s->copy_bitmap, start, chunk_end - start); | ||
131 | break; | ||
132 | } | ||
133 | |||
134 | + progress_work_done(s->progress, chunk_end - start); | ||
135 | s->progress_bytes_callback(chunk_end - start, s->progress_opaque); | ||
136 | start = chunk_end; | ||
137 | ret = 0; | ||
138 | diff --git a/include/block/block-copy.h b/include/block/block-copy.h | ||
139 | index XXXXXXX..XXXXXXX 100644 | ||
140 | --- a/include/block/block-copy.h | ||
141 | +++ b/include/block/block-copy.h | ||
142 | @@ -XXX,XX +XXX,XX @@ typedef struct BlockCopyInFlightReq { | ||
143 | } BlockCopyInFlightReq; | ||
144 | |||
145 | typedef void (*ProgressBytesCallbackFunc)(int64_t bytes, void *opaque); | ||
146 | -typedef void (*ProgressResetCallbackFunc)(void *opaque); | ||
147 | typedef struct BlockCopyState { | ||
148 | /* | ||
149 | * BdrvChild objects are not owned or managed by block-copy. They are | ||
150 | @@ -XXX,XX +XXX,XX @@ typedef struct BlockCopyState { | ||
151 | BdrvChild *source; | ||
152 | BdrvChild *target; | ||
153 | BdrvDirtyBitmap *copy_bitmap; | ||
154 | + int64_t in_flight_bytes; | ||
155 | int64_t cluster_size; | ||
156 | bool use_copy_range; | ||
157 | int64_t copy_size; | ||
158 | @@ -XXX,XX +XXX,XX @@ typedef struct BlockCopyState { | ||
159 | */ | ||
160 | bool skip_unallocated; | ||
161 | |||
162 | + ProgressMeter *progress; | ||
163 | /* progress_bytes_callback: called when some copying progress is done. */ | ||
164 | ProgressBytesCallbackFunc progress_bytes_callback; | ||
165 | - | ||
166 | - /* | ||
167 | - * progress_reset_callback: called when some bytes reset from copy_bitmap | ||
168 | - * (see @skip_unallocated above). The callee is assumed to recalculate how | ||
169 | - * many bytes remain based on the dirty bit count of copy_bitmap. | ||
170 | - */ | ||
171 | - ProgressResetCallbackFunc progress_reset_callback; | ||
172 | void *progress_opaque; | ||
173 | |||
174 | SharedResource *mem; | ||
175 | @@ -XXX,XX +XXX,XX @@ BlockCopyState *block_copy_state_new(BdrvChild *source, BdrvChild *target, | ||
176 | BdrvRequestFlags write_flags, | ||
177 | Error **errp); | ||
178 | |||
179 | -void block_copy_set_callbacks( | ||
180 | +void block_copy_set_progress_callback( | ||
181 | BlockCopyState *s, | ||
182 | ProgressBytesCallbackFunc progress_bytes_callback, | ||
183 | - ProgressResetCallbackFunc progress_reset_callback, | ||
184 | void *progress_opaque); | ||
185 | |||
186 | +void block_copy_set_progress_meter(BlockCopyState *s, ProgressMeter *pm); | ||
187 | + | ||
188 | void block_copy_state_free(BlockCopyState *s); | ||
189 | |||
190 | int64_t block_copy_reset_unallocated(BlockCopyState *s, | ||
50 | -- | 191 | -- |
51 | 2.13.5 | 192 | 2.24.1 |
52 | 193 | ||
53 | 194 | diff view generated by jsdifflib |
1 | From: Alberto Garcia <berto@igalia.com> | 1 | From: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> |
---|---|---|---|
2 | 2 | ||
3 | Signed-off-by: Alberto Garcia <berto@igalia.com> | 3 | In block_copy_do_copy we fallback to read+write if copy_range failed. |
4 | Message-id: a57dd6274e1b6dc9c28769fec4c7ea543be5c5e3.1503580370.git.berto@igalia.com | 4 | In this case copy_size is larger than defined for buffered IO, and |
5 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 5 | there is corresponding commit. Still, backup copies data cluster by |
6 | cluster, and most of requests are limited to one cluster anyway, so the | ||
7 | only source of this one bad-limited request is copy-before-write | ||
8 | operation. | ||
9 | |||
10 | Further patch will move backup to use block_copy directly, than for | ||
11 | cases where copy_range is not supported, first request will be | ||
12 | oversized in each backup. It's not good, let's change it now. | ||
13 | |||
14 | Fix is simple: just limit first copy_range request like buffer-based | ||
15 | request. If it succeed, set larger copy_range limit. | ||
16 | |||
17 | Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | ||
18 | Reviewed-by: Andrey Shinkevich <andrey.shinkevich@virtuozzo.com> | ||
19 | Reviewed-by: Max Reitz <mreitz@redhat.com> | ||
20 | Message-Id: <20200311103004.7649-4-vsementsov@virtuozzo.com> | ||
21 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
6 | --- | 22 | --- |
7 | tests/test-throttle.c | 77 +++++++++++++++++++++++++++++++++++++++++++++++++++ | 23 | block/block-copy.c | 41 +++++++++++++++++++++++++++++++---------- |
8 | 1 file changed, 77 insertions(+) | 24 | 1 file changed, 31 insertions(+), 10 deletions(-) |
9 | 25 | ||
10 | diff --git a/tests/test-throttle.c b/tests/test-throttle.c | 26 | diff --git a/block/block-copy.c b/block/block-copy.c |
11 | index XXXXXXX..XXXXXXX 100644 | 27 | index XXXXXXX..XXXXXXX 100644 |
12 | --- a/tests/test-throttle.c | 28 | --- a/block/block-copy.c |
13 | +++ b/tests/test-throttle.c | 29 | +++ b/block/block-copy.c |
14 | @@ -XXX,XX +XXX,XX @@ static void test_is_valid(void) | 30 | @@ -XXX,XX +XXX,XX @@ void block_copy_state_free(BlockCopyState *s) |
15 | test_is_valid_for_value(1, true); | 31 | g_free(s); |
16 | } | 32 | } |
17 | 33 | ||
18 | +static void test_ranges(void) | 34 | +static uint32_t block_copy_max_transfer(BdrvChild *source, BdrvChild *target) |
19 | +{ | 35 | +{ |
20 | + int i; | 36 | + return MIN_NON_ZERO(INT_MAX, |
21 | + | 37 | + MIN_NON_ZERO(source->bs->bl.max_transfer, |
22 | + for (i = 0; i < BUCKETS_COUNT; i++) { | 38 | + target->bs->bl.max_transfer)); |
23 | + LeakyBucket *b = &cfg.buckets[i]; | ||
24 | + throttle_config_init(&cfg); | ||
25 | + | ||
26 | + /* avg = 0 means throttling is disabled, but the config is valid */ | ||
27 | + b->avg = 0; | ||
28 | + g_assert(throttle_is_valid(&cfg, NULL)); | ||
29 | + g_assert(!throttle_enabled(&cfg)); | ||
30 | + | ||
31 | + /* These are valid configurations (values <= THROTTLE_VALUE_MAX) */ | ||
32 | + b->avg = 1; | ||
33 | + g_assert(throttle_is_valid(&cfg, NULL)); | ||
34 | + | ||
35 | + b->avg = THROTTLE_VALUE_MAX; | ||
36 | + g_assert(throttle_is_valid(&cfg, NULL)); | ||
37 | + | ||
38 | + b->avg = THROTTLE_VALUE_MAX; | ||
39 | + b->max = THROTTLE_VALUE_MAX; | ||
40 | + g_assert(throttle_is_valid(&cfg, NULL)); | ||
41 | + | ||
42 | + /* Values over THROTTLE_VALUE_MAX are not allowed */ | ||
43 | + b->avg = THROTTLE_VALUE_MAX + 1; | ||
44 | + g_assert(!throttle_is_valid(&cfg, NULL)); | ||
45 | + | ||
46 | + b->avg = THROTTLE_VALUE_MAX; | ||
47 | + b->max = THROTTLE_VALUE_MAX + 1; | ||
48 | + g_assert(!throttle_is_valid(&cfg, NULL)); | ||
49 | + | ||
50 | + /* burst_length must be between 1 and THROTTLE_VALUE_MAX */ | ||
51 | + b->avg = 1; | ||
52 | + b->max = 1; | ||
53 | + b->burst_length = 0; | ||
54 | + g_assert(!throttle_is_valid(&cfg, NULL)); | ||
55 | + | ||
56 | + b->avg = 1; | ||
57 | + b->max = 1; | ||
58 | + b->burst_length = 1; | ||
59 | + g_assert(throttle_is_valid(&cfg, NULL)); | ||
60 | + | ||
61 | + b->avg = 1; | ||
62 | + b->max = 1; | ||
63 | + b->burst_length = THROTTLE_VALUE_MAX; | ||
64 | + g_assert(throttle_is_valid(&cfg, NULL)); | ||
65 | + | ||
66 | + b->avg = 1; | ||
67 | + b->max = 1; | ||
68 | + b->burst_length = THROTTLE_VALUE_MAX + 1; | ||
69 | + g_assert(!throttle_is_valid(&cfg, NULL)); | ||
70 | + | ||
71 | + /* burst_length * max cannot exceed THROTTLE_VALUE_MAX */ | ||
72 | + b->avg = 1; | ||
73 | + b->max = 2; | ||
74 | + b->burst_length = THROTTLE_VALUE_MAX / 2; | ||
75 | + g_assert(throttle_is_valid(&cfg, NULL)); | ||
76 | + | ||
77 | + b->avg = 1; | ||
78 | + b->max = 3; | ||
79 | + b->burst_length = THROTTLE_VALUE_MAX / 2; | ||
80 | + g_assert(!throttle_is_valid(&cfg, NULL)); | ||
81 | + | ||
82 | + b->avg = 1; | ||
83 | + b->max = THROTTLE_VALUE_MAX; | ||
84 | + b->burst_length = 1; | ||
85 | + g_assert(throttle_is_valid(&cfg, NULL)); | ||
86 | + | ||
87 | + b->avg = 1; | ||
88 | + b->max = THROTTLE_VALUE_MAX; | ||
89 | + b->burst_length = 2; | ||
90 | + g_assert(!throttle_is_valid(&cfg, NULL)); | ||
91 | + } | ||
92 | +} | 39 | +} |
93 | + | 40 | + |
94 | static void test_max_is_missing_limit(void) | 41 | BlockCopyState *block_copy_state_new(BdrvChild *source, BdrvChild *target, |
42 | int64_t cluster_size, | ||
43 | BdrvRequestFlags write_flags, Error **errp) | ||
95 | { | 44 | { |
96 | int i; | 45 | BlockCopyState *s; |
97 | @@ -XXX,XX +XXX,XX @@ int main(int argc, char **argv) | 46 | BdrvDirtyBitmap *copy_bitmap; |
98 | g_test_add_func("/throttle/config/enabled", test_enabled); | 47 | - uint32_t max_transfer = |
99 | g_test_add_func("/throttle/config/conflicting", test_conflicting_config); | 48 | - MIN_NON_ZERO(INT_MAX, |
100 | g_test_add_func("/throttle/config/is_valid", test_is_valid); | 49 | - MIN_NON_ZERO(source->bs->bl.max_transfer, |
101 | + g_test_add_func("/throttle/config/ranges", test_ranges); | 50 | - target->bs->bl.max_transfer)); |
102 | g_test_add_func("/throttle/config/max", test_max_is_missing_limit); | 51 | |
103 | g_test_add_func("/throttle/config/iops_size", | 52 | copy_bitmap = bdrv_create_dirty_bitmap(source->bs, cluster_size, NULL, |
104 | test_iops_size_is_missing_limit); | 53 | errp); |
54 | @@ -XXX,XX +XXX,XX @@ BlockCopyState *block_copy_state_new(BdrvChild *source, BdrvChild *target, | ||
55 | .mem = shres_create(BLOCK_COPY_MAX_MEM), | ||
56 | }; | ||
57 | |||
58 | - if (max_transfer < cluster_size) { | ||
59 | + if (block_copy_max_transfer(source, target) < cluster_size) { | ||
60 | /* | ||
61 | * copy_range does not respect max_transfer. We don't want to bother | ||
62 | * with requests smaller than block-copy cluster size, so fallback to | ||
63 | @@ -XXX,XX +XXX,XX @@ BlockCopyState *block_copy_state_new(BdrvChild *source, BdrvChild *target, | ||
64 | s->copy_size = cluster_size; | ||
65 | } else { | ||
66 | /* | ||
67 | - * copy_range does not respect max_transfer (it's a TODO), so we factor | ||
68 | - * that in here. | ||
69 | + * We enable copy-range, but keep small copy_size, until first | ||
70 | + * successful copy_range (look at block_copy_do_copy). | ||
71 | */ | ||
72 | s->use_copy_range = true; | ||
73 | - s->copy_size = MIN(MAX(cluster_size, BLOCK_COPY_MAX_COPY_RANGE), | ||
74 | - QEMU_ALIGN_DOWN(max_transfer, cluster_size)); | ||
75 | + s->copy_size = MAX(s->cluster_size, BLOCK_COPY_MAX_BUFFER); | ||
76 | } | ||
77 | |||
78 | QLIST_INIT(&s->inflight_reqs); | ||
79 | @@ -XXX,XX +XXX,XX @@ static int coroutine_fn block_copy_do_copy(BlockCopyState *s, | ||
80 | s->copy_size = MAX(s->cluster_size, BLOCK_COPY_MAX_BUFFER); | ||
81 | /* Fallback to read+write with allocated buffer */ | ||
82 | } else { | ||
83 | + if (s->use_copy_range) { | ||
84 | + /* | ||
85 | + * Successful copy-range. Now increase copy_size. copy_range | ||
86 | + * does not respect max_transfer (it's a TODO), so we factor | ||
87 | + * that in here. | ||
88 | + * | ||
89 | + * Note: we double-check s->use_copy_range for the case when | ||
90 | + * parallel block-copy request unsets it during previous | ||
91 | + * bdrv_co_copy_range call. | ||
92 | + */ | ||
93 | + s->copy_size = | ||
94 | + MIN(MAX(s->cluster_size, BLOCK_COPY_MAX_COPY_RANGE), | ||
95 | + QEMU_ALIGN_DOWN(block_copy_max_transfer(s->source, | ||
96 | + s->target), | ||
97 | + s->cluster_size)); | ||
98 | + } | ||
99 | goto out; | ||
100 | } | ||
101 | } | ||
102 | @@ -XXX,XX +XXX,XX @@ static int coroutine_fn block_copy_do_copy(BlockCopyState *s, | ||
103 | /* | ||
104 | * In case of failed copy_range request above, we may proceed with buffered | ||
105 | * request larger than BLOCK_COPY_MAX_BUFFER. Still, further requests will | ||
106 | - * be properly limited, so don't care too much. | ||
107 | + * be properly limited, so don't care too much. Moreover the most likely | ||
108 | + * case (copy_range is unsupported for the configuration, so the very first | ||
109 | + * copy_range request fails) is handled by setting large copy_size only | ||
110 | + * after first successful copy_range. | ||
111 | */ | ||
112 | |||
113 | bounce_buffer = qemu_blockalign(s->source->bs, nbytes); | ||
105 | -- | 114 | -- |
106 | 2.13.5 | 115 | 2.24.1 |
107 | 116 | ||
108 | 117 | diff view generated by jsdifflib |
1 | From: Alberto Garcia <berto@igalia.com> | 1 | From: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> |
---|---|---|---|
2 | 2 | ||
3 | Use a pointer to the bucket instead of repeating cfg->buckets[i] all | 3 | Use bdrv_block_status_above to chose effective chunk size and to handle |
4 | the time. This makes the code more concise and will help us expand the | 4 | zeroes effectively. |
5 | checks later and save a few line breaks. | ||
6 | 5 | ||
7 | Signed-off-by: Alberto Garcia <berto@igalia.com> | 6 | This substitutes checking for just being allocated or not, and drops |
8 | Message-id: 763ffc40a26b17d54cf93f5a999e4656049fcf0c.1503580370.git.berto@igalia.com | 7 | old code path for it. Assistance by backup job is dropped too, as |
9 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 8 | caching block-status information is more difficult than just caching |
9 | is-allocated information in our dirty bitmap, and backup job is not | ||
10 | good place for this caching anyway. | ||
11 | |||
12 | Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | ||
13 | Reviewed-by: Andrey Shinkevich <andrey.shinkevich@virtuozzo.com> | ||
14 | Reviewed-by: Max Reitz <mreitz@redhat.com> | ||
15 | Message-Id: <20200311103004.7649-5-vsementsov@virtuozzo.com> | ||
16 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
10 | --- | 17 | --- |
11 | util/throttle.c | 15 +++++++-------- | 18 | block/block-copy.c | 73 +++++++++++++++++++++++++++++++++++++--------- |
12 | 1 file changed, 7 insertions(+), 8 deletions(-) | 19 | block/trace-events | 1 + |
20 | 2 files changed, 61 insertions(+), 13 deletions(-) | ||
13 | 21 | ||
14 | diff --git a/util/throttle.c b/util/throttle.c | 22 | diff --git a/block/block-copy.c b/block/block-copy.c |
15 | index XXXXXXX..XXXXXXX 100644 | 23 | index XXXXXXX..XXXXXXX 100644 |
16 | --- a/util/throttle.c | 24 | --- a/block/block-copy.c |
17 | +++ b/util/throttle.c | 25 | +++ b/block/block-copy.c |
18 | @@ -XXX,XX +XXX,XX @@ bool throttle_is_valid(ThrottleConfig *cfg, Error **errp) | 26 | @@ -XXX,XX +XXX,XX @@ void block_copy_set_progress_meter(BlockCopyState *s, ProgressMeter *pm) |
19 | } | 27 | */ |
20 | 28 | static int coroutine_fn block_copy_do_copy(BlockCopyState *s, | |
21 | for (i = 0; i < BUCKETS_COUNT; i++) { | 29 | int64_t start, int64_t end, |
22 | - if (cfg->buckets[i].avg < 0 || | 30 | - bool *error_is_read) |
23 | - cfg->buckets[i].max < 0 || | 31 | + bool zeroes, bool *error_is_read) |
24 | - cfg->buckets[i].avg > THROTTLE_VALUE_MAX || | 32 | { |
25 | - cfg->buckets[i].max > THROTTLE_VALUE_MAX) { | 33 | int ret; |
26 | + LeakyBucket *bkt = &cfg->buckets[i]; | 34 | int nbytes = MIN(end, s->len) - start; |
27 | + if (bkt->avg < 0 || bkt->max < 0 || | 35 | @@ -XXX,XX +XXX,XX @@ static int coroutine_fn block_copy_do_copy(BlockCopyState *s, |
28 | + bkt->avg > THROTTLE_VALUE_MAX || bkt->max > THROTTLE_VALUE_MAX) { | 36 | assert(QEMU_IS_ALIGNED(end, s->cluster_size)); |
29 | error_setg(errp, "bps/iops/max values must be within [0, %lld]", | 37 | assert(end < s->len || end == QEMU_ALIGN_UP(s->len, s->cluster_size)); |
30 | THROTTLE_VALUE_MAX); | 38 | |
31 | return false; | 39 | + if (zeroes) { |
40 | + ret = bdrv_co_pwrite_zeroes(s->target, start, nbytes, s->write_flags & | ||
41 | + ~BDRV_REQ_WRITE_COMPRESSED); | ||
42 | + if (ret < 0) { | ||
43 | + trace_block_copy_write_zeroes_fail(s, start, ret); | ||
44 | + if (error_is_read) { | ||
45 | + *error_is_read = false; | ||
46 | + } | ||
47 | + } | ||
48 | + return ret; | ||
49 | + } | ||
50 | + | ||
51 | if (s->use_copy_range) { | ||
52 | ret = bdrv_co_copy_range(s->source, start, s->target, start, nbytes, | ||
53 | 0, s->write_flags); | ||
54 | @@ -XXX,XX +XXX,XX @@ out: | ||
55 | return ret; | ||
56 | } | ||
57 | |||
58 | +static int block_copy_block_status(BlockCopyState *s, int64_t offset, | ||
59 | + int64_t bytes, int64_t *pnum) | ||
60 | +{ | ||
61 | + int64_t num; | ||
62 | + BlockDriverState *base; | ||
63 | + int ret; | ||
64 | + | ||
65 | + if (s->skip_unallocated && s->source->bs->backing) { | ||
66 | + base = s->source->bs->backing->bs; | ||
67 | + } else { | ||
68 | + base = NULL; | ||
69 | + } | ||
70 | + | ||
71 | + ret = bdrv_block_status_above(s->source->bs, base, offset, bytes, &num, | ||
72 | + NULL, NULL); | ||
73 | + if (ret < 0 || num < s->cluster_size) { | ||
74 | + /* | ||
75 | + * On error or if failed to obtain large enough chunk just fallback to | ||
76 | + * copy one cluster. | ||
77 | + */ | ||
78 | + num = s->cluster_size; | ||
79 | + ret = BDRV_BLOCK_ALLOCATED | BDRV_BLOCK_DATA; | ||
80 | + } else if (offset + num == s->len) { | ||
81 | + num = QEMU_ALIGN_UP(num, s->cluster_size); | ||
82 | + } else { | ||
83 | + num = QEMU_ALIGN_DOWN(num, s->cluster_size); | ||
84 | + } | ||
85 | + | ||
86 | + *pnum = num; | ||
87 | + return ret; | ||
88 | +} | ||
89 | + | ||
90 | /* | ||
91 | * Check if the cluster starting at offset is allocated or not. | ||
92 | * return via pnum the number of contiguous clusters sharing this allocation. | ||
93 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
94 | { | ||
95 | int ret = 0; | ||
96 | int64_t end = bytes + start; /* bytes */ | ||
97 | - int64_t status_bytes; | ||
98 | BlockCopyInFlightReq req; | ||
99 | |||
100 | /* | ||
101 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
102 | block_copy_inflight_req_begin(s, &req, start, end); | ||
103 | |||
104 | while (start < end) { | ||
105 | - int64_t next_zero, chunk_end; | ||
106 | + int64_t next_zero, chunk_end, status_bytes; | ||
107 | |||
108 | if (!bdrv_dirty_bitmap_get(s->copy_bitmap, start)) { | ||
109 | trace_block_copy_skip(s, start); | ||
110 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
111 | chunk_end = next_zero; | ||
32 | } | 112 | } |
33 | 113 | ||
34 | - if (!cfg->buckets[i].burst_length) { | 114 | - if (s->skip_unallocated) { |
35 | + if (!bkt->burst_length) { | 115 | - ret = block_copy_reset_unallocated(s, start, &status_bytes); |
36 | error_setg(errp, "the burst length cannot be 0"); | 116 | - if (ret == 0) { |
37 | return false; | 117 | - trace_block_copy_skip_range(s, start, status_bytes); |
118 | - start += status_bytes; | ||
119 | - continue; | ||
120 | - } | ||
121 | - /* Clamp to known allocated region */ | ||
122 | - chunk_end = MIN(chunk_end, start + status_bytes); | ||
123 | + ret = block_copy_block_status(s, start, chunk_end - start, | ||
124 | + &status_bytes); | ||
125 | + if (s->skip_unallocated && !(ret & BDRV_BLOCK_ALLOCATED)) { | ||
126 | + bdrv_reset_dirty_bitmap(s->copy_bitmap, start, status_bytes); | ||
127 | + progress_set_remaining(s->progress, | ||
128 | + bdrv_get_dirty_count(s->copy_bitmap) + | ||
129 | + s->in_flight_bytes); | ||
130 | + trace_block_copy_skip_range(s, start, status_bytes); | ||
131 | + start += status_bytes; | ||
132 | + continue; | ||
38 | } | 133 | } |
39 | 134 | ||
40 | - if (cfg->buckets[i].burst_length > 1 && !cfg->buckets[i].max) { | 135 | + chunk_end = MIN(chunk_end, start + status_bytes); |
41 | + if (bkt->burst_length > 1 && !bkt->max) { | 136 | + |
42 | error_setg(errp, "burst length set without burst rate"); | 137 | trace_block_copy_process(s, start); |
43 | return false; | 138 | |
44 | } | 139 | bdrv_reset_dirty_bitmap(s->copy_bitmap, start, chunk_end - start); |
45 | 140 | s->in_flight_bytes += chunk_end - start; | |
46 | - if (cfg->buckets[i].max && !cfg->buckets[i].avg) { | 141 | |
47 | + if (bkt->max && !bkt->avg) { | 142 | co_get_from_shres(s->mem, chunk_end - start); |
48 | error_setg(errp, "bps_max/iops_max require corresponding" | 143 | - ret = block_copy_do_copy(s, start, chunk_end, error_is_read); |
49 | " bps/iops values"); | 144 | + ret = block_copy_do_copy(s, start, chunk_end, ret & BDRV_BLOCK_ZERO, |
50 | return false; | 145 | + error_is_read); |
51 | } | 146 | co_put_to_shres(s->mem, chunk_end - start); |
52 | 147 | s->in_flight_bytes -= chunk_end - start; | |
53 | - if (cfg->buckets[i].max && cfg->buckets[i].max < cfg->buckets[i].avg) { | 148 | if (ret < 0) { |
54 | + if (bkt->max && bkt->max < bkt->avg) { | 149 | diff --git a/block/trace-events b/block/trace-events |
55 | error_setg(errp, "bps_max/iops_max cannot be lower than bps/iops"); | 150 | index XXXXXXX..XXXXXXX 100644 |
56 | return false; | 151 | --- a/block/trace-events |
57 | } | 152 | +++ b/block/trace-events |
153 | @@ -XXX,XX +XXX,XX @@ block_copy_process(void *bcs, int64_t start) "bcs %p start %"PRId64 | ||
154 | block_copy_copy_range_fail(void *bcs, int64_t start, int ret) "bcs %p start %"PRId64" ret %d" | ||
155 | block_copy_read_fail(void *bcs, int64_t start, int ret) "bcs %p start %"PRId64" ret %d" | ||
156 | block_copy_write_fail(void *bcs, int64_t start, int ret) "bcs %p start %"PRId64" ret %d" | ||
157 | +block_copy_write_zeroes_fail(void *bcs, int64_t start, int ret) "bcs %p start %"PRId64" ret %d" | ||
158 | |||
159 | # ../blockdev.c | ||
160 | qmp_block_job_cancel(void *job) "job %p" | ||
58 | -- | 161 | -- |
59 | 2.13.5 | 162 | 2.24.1 |
60 | 163 | ||
61 | 164 | diff view generated by jsdifflib |
1 | From: Alberto Garcia <berto@igalia.com> | 1 | From: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> |
---|---|---|---|
2 | 2 | ||
3 | The throttling code can change internally the value of bkt->max if it | 3 | Split find_conflicting_inflight_req to be used separately. |
4 | hasn't been set by the user. The problem with this is that if we want | ||
5 | to retrieve the original value we have to undo this change first. This | ||
6 | is ugly and unnecessary: this patch removes the throttle_fix_bucket() | ||
7 | and throttle_unfix_bucket() functions completely and moves the logic | ||
8 | to throttle_compute_wait(). | ||
9 | 4 | ||
10 | Signed-off-by: Alberto Garcia <berto@igalia.com> | 5 | Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> |
11 | Reviewed-by: Manos Pitsidianakis <el13635@mail.ntua.gr> | 6 | Reviewed-by: Andrey Shinkevich <andrey.shinkevich@virtuozzo.com> |
12 | Message-id: 5b0b9e1ac6eb208d709eddc7b09e7669a523bff3.1503580370.git.berto@igalia.com | 7 | Reviewed-by: Max Reitz <mreitz@redhat.com> |
13 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | 8 | Message-Id: <20200311103004.7649-6-vsementsov@virtuozzo.com> |
9 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
14 | --- | 10 | --- |
15 | util/throttle.c | 62 +++++++++++++++++++++------------------------------------ | 11 | block/block-copy.c | 31 +++++++++++++++++++------------ |
16 | 1 file changed, 23 insertions(+), 39 deletions(-) | 12 | 1 file changed, 19 insertions(+), 12 deletions(-) |
17 | 13 | ||
18 | diff --git a/util/throttle.c b/util/throttle.c | 14 | diff --git a/block/block-copy.c b/block/block-copy.c |
19 | index XXXXXXX..XXXXXXX 100644 | 15 | index XXXXXXX..XXXXXXX 100644 |
20 | --- a/util/throttle.c | 16 | --- a/block/block-copy.c |
21 | +++ b/util/throttle.c | 17 | +++ b/block/block-copy.c |
22 | @@ -XXX,XX +XXX,XX @@ static int64_t throttle_do_compute_wait(double limit, double extra) | 18 | @@ -XXX,XX +XXX,XX @@ |
23 | int64_t throttle_compute_wait(LeakyBucket *bkt) | 19 | #define BLOCK_COPY_MAX_BUFFER (1 * MiB) |
24 | { | 20 | #define BLOCK_COPY_MAX_MEM (128 * MiB) |
25 | double extra; /* the number of extra units blocking the io */ | 21 | |
26 | + double bucket_size; /* I/O before throttling to bkt->avg */ | 22 | +static BlockCopyInFlightReq *find_conflicting_inflight_req(BlockCopyState *s, |
27 | + double burst_bucket_size; /* Before throttling to bkt->max */ | 23 | + int64_t start, |
28 | 24 | + int64_t end) | |
29 | if (!bkt->avg) { | 25 | +{ |
30 | return 0; | 26 | + BlockCopyInFlightReq *req; |
31 | } | 27 | + |
32 | 28 | + QLIST_FOREACH(req, &s->inflight_reqs, list) { | |
33 | - /* If the bucket is full then we have to wait */ | 29 | + if (end > req->start_byte && start < req->end_byte) { |
34 | - extra = bkt->level - bkt->max * bkt->burst_length; | 30 | + return req; |
35 | + if (!bkt->max) { | 31 | + } |
36 | + /* If bkt->max is 0 we still want to allow short bursts of I/O | ||
37 | + * from the guest, otherwise every other request will be throttled | ||
38 | + * and performance will suffer considerably. */ | ||
39 | + bucket_size = bkt->avg / 10; | ||
40 | + burst_bucket_size = 0; | ||
41 | + } else { | ||
42 | + /* If we have a burst limit then we have to wait until all I/O | ||
43 | + * at burst rate has finished before throttling to bkt->avg */ | ||
44 | + bucket_size = bkt->max * bkt->burst_length; | ||
45 | + burst_bucket_size = bkt->max / 10; | ||
46 | + } | 32 | + } |
47 | + | 33 | + |
48 | + /* If the main bucket is full then we have to wait */ | 34 | + return NULL; |
49 | + extra = bkt->level - bucket_size; | 35 | +} |
50 | if (extra > 0) { | 36 | + |
51 | return throttle_do_compute_wait(bkt->avg, extra); | 37 | static void coroutine_fn block_copy_wait_inflight_reqs(BlockCopyState *s, |
52 | } | 38 | int64_t start, |
53 | 39 | int64_t end) | |
54 | - /* If the bucket is not full yet we have to make sure that we | 40 | { |
55 | - * fulfill the goal of bkt->max units per second. */ | 41 | BlockCopyInFlightReq *req; |
56 | + /* If the main bucket is not full yet we still have to check the | 42 | - bool waited; |
57 | + * burst bucket in order to enforce the burst limit */ | 43 | - |
58 | if (bkt->burst_length > 1) { | 44 | - do { |
59 | - /* We use 1/10 of the max value to smooth the throttling. | 45 | - waited = false; |
60 | - * See throttle_fix_bucket() for more details. */ | 46 | - QLIST_FOREACH(req, &s->inflight_reqs, list) { |
61 | - extra = bkt->burst_level - bkt->max / 10; | 47 | - if (end > req->start_byte && start < req->end_byte) { |
62 | + extra = bkt->burst_level - burst_bucket_size; | 48 | - qemu_co_queue_wait(&req->wait_queue, NULL); |
63 | if (extra > 0) { | 49 | - waited = true; |
64 | return throttle_do_compute_wait(bkt->max, extra); | 50 | - break; |
65 | } | 51 | - } |
66 | @@ -XXX,XX +XXX,XX @@ bool throttle_is_valid(ThrottleConfig *cfg, Error **errp) | 52 | - } |
67 | return true; | 53 | - } while (waited); |
54 | + | ||
55 | + while ((req = find_conflicting_inflight_req(s, start, end))) { | ||
56 | + qemu_co_queue_wait(&req->wait_queue, NULL); | ||
57 | + } | ||
68 | } | 58 | } |
69 | 59 | ||
70 | -/* fix bucket parameters */ | 60 | static void block_copy_inflight_req_begin(BlockCopyState *s, |
71 | -static void throttle_fix_bucket(LeakyBucket *bkt) | ||
72 | -{ | ||
73 | - double min; | ||
74 | - | ||
75 | - /* zero bucket level */ | ||
76 | - bkt->level = bkt->burst_level = 0; | ||
77 | - | ||
78 | - /* If bkt->max is 0 we still want to allow short bursts of I/O | ||
79 | - * from the guest, otherwise every other request will be throttled | ||
80 | - * and performance will suffer considerably. */ | ||
81 | - min = bkt->avg / 10; | ||
82 | - if (bkt->avg && !bkt->max) { | ||
83 | - bkt->max = min; | ||
84 | - } | ||
85 | -} | ||
86 | - | ||
87 | -/* undo internal bucket parameter changes (see throttle_fix_bucket()) */ | ||
88 | -static void throttle_unfix_bucket(LeakyBucket *bkt) | ||
89 | -{ | ||
90 | - if (bkt->max < bkt->avg) { | ||
91 | - bkt->max = 0; | ||
92 | - } | ||
93 | -} | ||
94 | - | ||
95 | /* Used to configure the throttle | ||
96 | * | ||
97 | * @ts: the throttle state we are working on | ||
98 | @@ -XXX,XX +XXX,XX @@ void throttle_config(ThrottleState *ts, | ||
99 | |||
100 | ts->cfg = *cfg; | ||
101 | |||
102 | + /* Zero bucket level */ | ||
103 | for (i = 0; i < BUCKETS_COUNT; i++) { | ||
104 | - throttle_fix_bucket(&ts->cfg.buckets[i]); | ||
105 | + ts->cfg.buckets[i].level = 0; | ||
106 | + ts->cfg.buckets[i].burst_level = 0; | ||
107 | } | ||
108 | |||
109 | ts->previous_leak = qemu_clock_get_ns(clock_type); | ||
110 | @@ -XXX,XX +XXX,XX @@ void throttle_config(ThrottleState *ts, | ||
111 | */ | ||
112 | void throttle_get_config(ThrottleState *ts, ThrottleConfig *cfg) | ||
113 | { | ||
114 | - int i; | ||
115 | - | ||
116 | *cfg = ts->cfg; | ||
117 | - | ||
118 | - for (i = 0; i < BUCKETS_COUNT; i++) { | ||
119 | - throttle_unfix_bucket(&cfg->buckets[i]); | ||
120 | - } | ||
121 | } | ||
122 | |||
123 | |||
124 | -- | 61 | -- |
125 | 2.13.5 | 62 | 2.24.1 |
126 | 63 | ||
127 | 64 | diff view generated by jsdifflib |
1 | From: Alberto Garcia <berto@igalia.com> | 1 | From: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> |
---|---|---|---|
2 | 2 | ||
3 | Both the throttling limits set with the throttling.iops-* and | 3 | We have a lot of "chunk_end - start" invocations, let's switch to |
4 | throttling.bps-* options and their QMP equivalents defined in the | 4 | bytes/cur_bytes scheme instead. |
5 | BlockIOThrottle struct are integer values. | 5 | |
6 | 6 | While being here, improve check on block_copy_do_copy parameters to not | |
7 | Those limits are also reported in the BlockDeviceInfo struct and they | 7 | overflow when calculating nbytes and use int64_t for bytes in |
8 | are integers there as well. | 8 | block_copy for consistency. |
9 | 9 | ||
10 | Therefore there's no reason to store them internally as double and do | 10 | Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> |
11 | the conversion everytime we're setting or querying them, so this patch | 11 | Reviewed-by: Andrey Shinkevich <andrey.shinkevich@virtuozzo.com> |
12 | uses uint64_t for those types. Let's also use an unsigned type because | 12 | Reviewed-by: Max Reitz <mreitz@redhat.com> |
13 | we don't allow negative values anyway. | 13 | Message-Id: <20200311103004.7649-7-vsementsov@virtuozzo.com> |
14 | 14 | Signed-off-by: Max Reitz <mreitz@redhat.com> | |
15 | LeakyBucket.level and LeakyBucket.burst_level do however remain double | ||
16 | because their value changes depending on the fraction of time elapsed | ||
17 | since the previous I/O operation. | ||
18 | |||
19 | Signed-off-by: Alberto Garcia <berto@igalia.com> | ||
20 | Message-id: f29b840422767b5be2c41c2dfdbbbf6c5f8fedf8.1503580370.git.berto@igalia.com | ||
21 | Signed-off-by: Stefan Hajnoczi <stefanha@redhat.com> | ||
22 | --- | 15 | --- |
23 | include/qemu/throttle.h | 4 ++-- | 16 | block/block-copy.c | 78 ++++++++++++++++++++------------------ |
24 | tests/test-throttle.c | 3 ++- | 17 | include/block/block-copy.h | 6 +-- |
25 | util/throttle.c | 7 +++---- | 18 | 2 files changed, 44 insertions(+), 40 deletions(-) |
26 | 3 files changed, 7 insertions(+), 7 deletions(-) | 19 | |
27 | 20 | diff --git a/block/block-copy.c b/block/block-copy.c | |
28 | diff --git a/include/qemu/throttle.h b/include/qemu/throttle.h | ||
29 | index XXXXXXX..XXXXXXX 100644 | 21 | index XXXXXXX..XXXXXXX 100644 |
30 | --- a/include/qemu/throttle.h | 22 | --- a/block/block-copy.c |
31 | +++ b/include/qemu/throttle.h | 23 | +++ b/block/block-copy.c |
32 | @@ -XXX,XX +XXX,XX @@ typedef enum { | 24 | @@ -XXX,XX +XXX,XX @@ |
33 | */ | 25 | |
34 | 26 | static BlockCopyInFlightReq *find_conflicting_inflight_req(BlockCopyState *s, | |
35 | typedef struct LeakyBucket { | 27 | int64_t start, |
36 | - double avg; /* average goal in units per second */ | 28 | - int64_t end) |
37 | - double max; /* leaky bucket max burst in units */ | 29 | + int64_t bytes) |
38 | + uint64_t avg; /* average goal in units per second */ | 30 | { |
39 | + uint64_t max; /* leaky bucket max burst in units */ | 31 | BlockCopyInFlightReq *req; |
40 | double level; /* bucket level in units */ | 32 | |
41 | double burst_level; /* bucket level in units (for computing bursts) */ | 33 | QLIST_FOREACH(req, &s->inflight_reqs, list) { |
42 | unsigned burst_length; /* max length of the burst period, in seconds */ | 34 | - if (end > req->start_byte && start < req->end_byte) { |
43 | diff --git a/tests/test-throttle.c b/tests/test-throttle.c | 35 | + if (start + bytes > req->start && start < req->start + req->bytes) { |
44 | index XXXXXXX..XXXXXXX 100644 | 36 | return req; |
45 | --- a/tests/test-throttle.c | 37 | } |
46 | +++ b/tests/test-throttle.c | ||
47 | @@ -XXX,XX +XXX,XX @@ static void test_enabled(void) | ||
48 | for (i = 0; i < BUCKETS_COUNT; i++) { | ||
49 | throttle_config_init(&cfg); | ||
50 | set_cfg_value(false, i, 150); | ||
51 | + g_assert(throttle_is_valid(&cfg, NULL)); | ||
52 | g_assert(throttle_enabled(&cfg)); | ||
53 | } | 38 | } |
54 | 39 | @@ -XXX,XX +XXX,XX @@ static BlockCopyInFlightReq *find_conflicting_inflight_req(BlockCopyState *s, | |
55 | for (i = 0; i < BUCKETS_COUNT; i++) { | 40 | |
56 | throttle_config_init(&cfg); | 41 | static void coroutine_fn block_copy_wait_inflight_reqs(BlockCopyState *s, |
57 | set_cfg_value(false, i, -150); | 42 | int64_t start, |
58 | - g_assert(!throttle_enabled(&cfg)); | 43 | - int64_t end) |
59 | + g_assert(!throttle_is_valid(&cfg, NULL)); | 44 | + int64_t bytes) |
45 | { | ||
46 | BlockCopyInFlightReq *req; | ||
47 | |||
48 | - while ((req = find_conflicting_inflight_req(s, start, end))) { | ||
49 | + while ((req = find_conflicting_inflight_req(s, start, bytes))) { | ||
50 | qemu_co_queue_wait(&req->wait_queue, NULL); | ||
60 | } | 51 | } |
61 | } | 52 | } |
62 | 53 | ||
63 | diff --git a/util/throttle.c b/util/throttle.c | 54 | static void block_copy_inflight_req_begin(BlockCopyState *s, |
55 | BlockCopyInFlightReq *req, | ||
56 | - int64_t start, int64_t end) | ||
57 | + int64_t start, int64_t bytes) | ||
58 | { | ||
59 | - req->start_byte = start; | ||
60 | - req->end_byte = end; | ||
61 | + req->start = start; | ||
62 | + req->bytes = bytes; | ||
63 | qemu_co_queue_init(&req->wait_queue); | ||
64 | QLIST_INSERT_HEAD(&s->inflight_reqs, req, list); | ||
65 | } | ||
66 | @@ -XXX,XX +XXX,XX @@ void block_copy_set_progress_meter(BlockCopyState *s, ProgressMeter *pm) | ||
67 | /* | ||
68 | * block_copy_do_copy | ||
69 | * | ||
70 | - * Do copy of cluser-aligned chunk. @end is allowed to exceed s->len only to | ||
71 | - * cover last cluster when s->len is not aligned to clusters. | ||
72 | + * Do copy of cluster-aligned chunk. Requested region is allowed to exceed | ||
73 | + * s->len only to cover last cluster when s->len is not aligned to clusters. | ||
74 | * | ||
75 | * No sync here: nor bitmap neighter intersecting requests handling, only copy. | ||
76 | * | ||
77 | * Returns 0 on success. | ||
78 | */ | ||
79 | static int coroutine_fn block_copy_do_copy(BlockCopyState *s, | ||
80 | - int64_t start, int64_t end, | ||
81 | + int64_t start, int64_t bytes, | ||
82 | bool zeroes, bool *error_is_read) | ||
83 | { | ||
84 | int ret; | ||
85 | - int nbytes = MIN(end, s->len) - start; | ||
86 | + int64_t nbytes = MIN(start + bytes, s->len) - start; | ||
87 | void *bounce_buffer = NULL; | ||
88 | |||
89 | + assert(start >= 0 && bytes > 0 && INT64_MAX - start >= bytes); | ||
90 | assert(QEMU_IS_ALIGNED(start, s->cluster_size)); | ||
91 | - assert(QEMU_IS_ALIGNED(end, s->cluster_size)); | ||
92 | - assert(end < s->len || end == QEMU_ALIGN_UP(s->len, s->cluster_size)); | ||
93 | + assert(QEMU_IS_ALIGNED(bytes, s->cluster_size)); | ||
94 | + assert(start < s->len); | ||
95 | + assert(start + bytes <= s->len || | ||
96 | + start + bytes == QEMU_ALIGN_UP(s->len, s->cluster_size)); | ||
97 | + assert(nbytes < INT_MAX); | ||
98 | |||
99 | if (zeroes) { | ||
100 | ret = bdrv_co_pwrite_zeroes(s->target, start, nbytes, s->write_flags & | ||
101 | @@ -XXX,XX +XXX,XX @@ int64_t block_copy_reset_unallocated(BlockCopyState *s, | ||
102 | } | ||
103 | |||
104 | int coroutine_fn block_copy(BlockCopyState *s, | ||
105 | - int64_t start, uint64_t bytes, | ||
106 | + int64_t start, int64_t bytes, | ||
107 | bool *error_is_read) | ||
108 | { | ||
109 | int ret = 0; | ||
110 | - int64_t end = bytes + start; /* bytes */ | ||
111 | BlockCopyInFlightReq req; | ||
112 | |||
113 | /* | ||
114 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
115 | bdrv_get_aio_context(s->target->bs)); | ||
116 | |||
117 | assert(QEMU_IS_ALIGNED(start, s->cluster_size)); | ||
118 | - assert(QEMU_IS_ALIGNED(end, s->cluster_size)); | ||
119 | + assert(QEMU_IS_ALIGNED(bytes, s->cluster_size)); | ||
120 | |||
121 | block_copy_wait_inflight_reqs(s, start, bytes); | ||
122 | - block_copy_inflight_req_begin(s, &req, start, end); | ||
123 | + block_copy_inflight_req_begin(s, &req, start, bytes); | ||
124 | |||
125 | - while (start < end) { | ||
126 | - int64_t next_zero, chunk_end, status_bytes; | ||
127 | + while (bytes) { | ||
128 | + int64_t next_zero, cur_bytes, status_bytes; | ||
129 | |||
130 | if (!bdrv_dirty_bitmap_get(s->copy_bitmap, start)) { | ||
131 | trace_block_copy_skip(s, start); | ||
132 | start += s->cluster_size; | ||
133 | + bytes -= s->cluster_size; | ||
134 | continue; /* already copied */ | ||
135 | } | ||
136 | |||
137 | - chunk_end = MIN(end, start + s->copy_size); | ||
138 | + cur_bytes = MIN(bytes, s->copy_size); | ||
139 | |||
140 | next_zero = bdrv_dirty_bitmap_next_zero(s->copy_bitmap, start, | ||
141 | - chunk_end - start); | ||
142 | + cur_bytes); | ||
143 | if (next_zero >= 0) { | ||
144 | assert(next_zero > start); /* start is dirty */ | ||
145 | - assert(next_zero < chunk_end); /* no need to do MIN() */ | ||
146 | - chunk_end = next_zero; | ||
147 | + assert(next_zero < start + cur_bytes); /* no need to do MIN() */ | ||
148 | + cur_bytes = next_zero - start; | ||
149 | } | ||
150 | |||
151 | - ret = block_copy_block_status(s, start, chunk_end - start, | ||
152 | - &status_bytes); | ||
153 | + ret = block_copy_block_status(s, start, cur_bytes, &status_bytes); | ||
154 | if (s->skip_unallocated && !(ret & BDRV_BLOCK_ALLOCATED)) { | ||
155 | bdrv_reset_dirty_bitmap(s->copy_bitmap, start, status_bytes); | ||
156 | progress_set_remaining(s->progress, | ||
157 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
158 | s->in_flight_bytes); | ||
159 | trace_block_copy_skip_range(s, start, status_bytes); | ||
160 | start += status_bytes; | ||
161 | + bytes -= status_bytes; | ||
162 | continue; | ||
163 | } | ||
164 | |||
165 | - chunk_end = MIN(chunk_end, start + status_bytes); | ||
166 | + cur_bytes = MIN(cur_bytes, status_bytes); | ||
167 | |||
168 | trace_block_copy_process(s, start); | ||
169 | |||
170 | - bdrv_reset_dirty_bitmap(s->copy_bitmap, start, chunk_end - start); | ||
171 | - s->in_flight_bytes += chunk_end - start; | ||
172 | + bdrv_reset_dirty_bitmap(s->copy_bitmap, start, cur_bytes); | ||
173 | + s->in_flight_bytes += cur_bytes; | ||
174 | |||
175 | - co_get_from_shres(s->mem, chunk_end - start); | ||
176 | - ret = block_copy_do_copy(s, start, chunk_end, ret & BDRV_BLOCK_ZERO, | ||
177 | + co_get_from_shres(s->mem, cur_bytes); | ||
178 | + ret = block_copy_do_copy(s, start, cur_bytes, ret & BDRV_BLOCK_ZERO, | ||
179 | error_is_read); | ||
180 | - co_put_to_shres(s->mem, chunk_end - start); | ||
181 | - s->in_flight_bytes -= chunk_end - start; | ||
182 | + co_put_to_shres(s->mem, cur_bytes); | ||
183 | + s->in_flight_bytes -= cur_bytes; | ||
184 | if (ret < 0) { | ||
185 | - bdrv_set_dirty_bitmap(s->copy_bitmap, start, chunk_end - start); | ||
186 | + bdrv_set_dirty_bitmap(s->copy_bitmap, start, cur_bytes); | ||
187 | break; | ||
188 | } | ||
189 | |||
190 | - progress_work_done(s->progress, chunk_end - start); | ||
191 | - s->progress_bytes_callback(chunk_end - start, s->progress_opaque); | ||
192 | - start = chunk_end; | ||
193 | - ret = 0; | ||
194 | + progress_work_done(s->progress, cur_bytes); | ||
195 | + s->progress_bytes_callback(cur_bytes, s->progress_opaque); | ||
196 | + start += cur_bytes; | ||
197 | + bytes -= cur_bytes; | ||
198 | } | ||
199 | |||
200 | block_copy_inflight_req_end(&req); | ||
201 | diff --git a/include/block/block-copy.h b/include/block/block-copy.h | ||
64 | index XXXXXXX..XXXXXXX 100644 | 202 | index XXXXXXX..XXXXXXX 100644 |
65 | --- a/util/throttle.c | 203 | --- a/include/block/block-copy.h |
66 | +++ b/util/throttle.c | 204 | +++ b/include/block/block-copy.h |
67 | @@ -XXX,XX +XXX,XX @@ int64_t throttle_compute_wait(LeakyBucket *bkt) | 205 | @@ -XXX,XX +XXX,XX @@ |
68 | /* If bkt->max is 0 we still want to allow short bursts of I/O | 206 | #include "qemu/co-shared-resource.h" |
69 | * from the guest, otherwise every other request will be throttled | 207 | |
70 | * and performance will suffer considerably. */ | 208 | typedef struct BlockCopyInFlightReq { |
71 | - bucket_size = bkt->avg / 10; | 209 | - int64_t start_byte; |
72 | + bucket_size = (double) bkt->avg / 10; | 210 | - int64_t end_byte; |
73 | burst_bucket_size = 0; | 211 | + int64_t start; |
74 | } else { | 212 | + int64_t bytes; |
75 | /* If we have a burst limit then we have to wait until all I/O | 213 | QLIST_ENTRY(BlockCopyInFlightReq) list; |
76 | * at burst rate has finished before throttling to bkt->avg */ | 214 | CoQueue wait_queue; /* coroutines blocked on this request */ |
77 | bucket_size = bkt->max * bkt->burst_length; | 215 | } BlockCopyInFlightReq; |
78 | - burst_bucket_size = bkt->max / 10; | 216 | @@ -XXX,XX +XXX,XX @@ void block_copy_state_free(BlockCopyState *s); |
79 | + burst_bucket_size = (double) bkt->max / 10; | 217 | int64_t block_copy_reset_unallocated(BlockCopyState *s, |
80 | } | 218 | int64_t offset, int64_t *count); |
81 | 219 | ||
82 | /* If the main bucket is full then we have to wait */ | 220 | -int coroutine_fn block_copy(BlockCopyState *s, int64_t start, uint64_t bytes, |
83 | @@ -XXX,XX +XXX,XX @@ bool throttle_is_valid(ThrottleConfig *cfg, Error **errp) | 221 | +int coroutine_fn block_copy(BlockCopyState *s, int64_t start, int64_t bytes, |
84 | 222 | bool *error_is_read); | |
85 | for (i = 0; i < BUCKETS_COUNT; i++) { | 223 | |
86 | LeakyBucket *bkt = &cfg->buckets[i]; | 224 | #endif /* BLOCK_COPY_H */ |
87 | - if (bkt->avg < 0 || bkt->max < 0 || | ||
88 | - bkt->avg > THROTTLE_VALUE_MAX || bkt->max > THROTTLE_VALUE_MAX) { | ||
89 | + if (bkt->avg > THROTTLE_VALUE_MAX || bkt->max > THROTTLE_VALUE_MAX) { | ||
90 | error_setg(errp, "bps/iops/max values must be within [0, %lld]", | ||
91 | THROTTLE_VALUE_MAX); | ||
92 | return false; | ||
93 | -- | 225 | -- |
94 | 2.13.5 | 226 | 2.24.1 |
95 | 227 | ||
96 | 228 | diff view generated by jsdifflib |
New patch | |||
---|---|---|---|
1 | 1 | From: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | |
2 | |||
3 | offset/bytes pair is more usual naming in block layer, let's use it. | ||
4 | |||
5 | Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | ||
6 | Reviewed-by: Andrey Shinkevich <andrey.shinkevich@virtuozzo.com> | ||
7 | Reviewed-by: Max Reitz <mreitz@redhat.com> | ||
8 | Message-Id: <20200311103004.7649-8-vsementsov@virtuozzo.com> | ||
9 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
10 | --- | ||
11 | block/block-copy.c | 82 +++++++++++++++++++------------------- | ||
12 | include/block/block-copy.h | 4 +- | ||
13 | 2 files changed, 43 insertions(+), 43 deletions(-) | ||
14 | |||
15 | diff --git a/block/block-copy.c b/block/block-copy.c | ||
16 | index XXXXXXX..XXXXXXX 100644 | ||
17 | --- a/block/block-copy.c | ||
18 | +++ b/block/block-copy.c | ||
19 | @@ -XXX,XX +XXX,XX @@ | ||
20 | #define BLOCK_COPY_MAX_MEM (128 * MiB) | ||
21 | |||
22 | static BlockCopyInFlightReq *find_conflicting_inflight_req(BlockCopyState *s, | ||
23 | - int64_t start, | ||
24 | + int64_t offset, | ||
25 | int64_t bytes) | ||
26 | { | ||
27 | BlockCopyInFlightReq *req; | ||
28 | |||
29 | QLIST_FOREACH(req, &s->inflight_reqs, list) { | ||
30 | - if (start + bytes > req->start && start < req->start + req->bytes) { | ||
31 | + if (offset + bytes > req->offset && offset < req->offset + req->bytes) { | ||
32 | return req; | ||
33 | } | ||
34 | } | ||
35 | @@ -XXX,XX +XXX,XX @@ static BlockCopyInFlightReq *find_conflicting_inflight_req(BlockCopyState *s, | ||
36 | } | ||
37 | |||
38 | static void coroutine_fn block_copy_wait_inflight_reqs(BlockCopyState *s, | ||
39 | - int64_t start, | ||
40 | + int64_t offset, | ||
41 | int64_t bytes) | ||
42 | { | ||
43 | BlockCopyInFlightReq *req; | ||
44 | |||
45 | - while ((req = find_conflicting_inflight_req(s, start, bytes))) { | ||
46 | + while ((req = find_conflicting_inflight_req(s, offset, bytes))) { | ||
47 | qemu_co_queue_wait(&req->wait_queue, NULL); | ||
48 | } | ||
49 | } | ||
50 | |||
51 | static void block_copy_inflight_req_begin(BlockCopyState *s, | ||
52 | BlockCopyInFlightReq *req, | ||
53 | - int64_t start, int64_t bytes) | ||
54 | + int64_t offset, int64_t bytes) | ||
55 | { | ||
56 | - req->start = start; | ||
57 | + req->offset = offset; | ||
58 | req->bytes = bytes; | ||
59 | qemu_co_queue_init(&req->wait_queue); | ||
60 | QLIST_INSERT_HEAD(&s->inflight_reqs, req, list); | ||
61 | @@ -XXX,XX +XXX,XX @@ void block_copy_set_progress_meter(BlockCopyState *s, ProgressMeter *pm) | ||
62 | * Returns 0 on success. | ||
63 | */ | ||
64 | static int coroutine_fn block_copy_do_copy(BlockCopyState *s, | ||
65 | - int64_t start, int64_t bytes, | ||
66 | + int64_t offset, int64_t bytes, | ||
67 | bool zeroes, bool *error_is_read) | ||
68 | { | ||
69 | int ret; | ||
70 | - int64_t nbytes = MIN(start + bytes, s->len) - start; | ||
71 | + int64_t nbytes = MIN(offset + bytes, s->len) - offset; | ||
72 | void *bounce_buffer = NULL; | ||
73 | |||
74 | - assert(start >= 0 && bytes > 0 && INT64_MAX - start >= bytes); | ||
75 | - assert(QEMU_IS_ALIGNED(start, s->cluster_size)); | ||
76 | + assert(offset >= 0 && bytes > 0 && INT64_MAX - offset >= bytes); | ||
77 | + assert(QEMU_IS_ALIGNED(offset, s->cluster_size)); | ||
78 | assert(QEMU_IS_ALIGNED(bytes, s->cluster_size)); | ||
79 | - assert(start < s->len); | ||
80 | - assert(start + bytes <= s->len || | ||
81 | - start + bytes == QEMU_ALIGN_UP(s->len, s->cluster_size)); | ||
82 | + assert(offset < s->len); | ||
83 | + assert(offset + bytes <= s->len || | ||
84 | + offset + bytes == QEMU_ALIGN_UP(s->len, s->cluster_size)); | ||
85 | assert(nbytes < INT_MAX); | ||
86 | |||
87 | if (zeroes) { | ||
88 | - ret = bdrv_co_pwrite_zeroes(s->target, start, nbytes, s->write_flags & | ||
89 | + ret = bdrv_co_pwrite_zeroes(s->target, offset, nbytes, s->write_flags & | ||
90 | ~BDRV_REQ_WRITE_COMPRESSED); | ||
91 | if (ret < 0) { | ||
92 | - trace_block_copy_write_zeroes_fail(s, start, ret); | ||
93 | + trace_block_copy_write_zeroes_fail(s, offset, ret); | ||
94 | if (error_is_read) { | ||
95 | *error_is_read = false; | ||
96 | } | ||
97 | @@ -XXX,XX +XXX,XX @@ static int coroutine_fn block_copy_do_copy(BlockCopyState *s, | ||
98 | } | ||
99 | |||
100 | if (s->use_copy_range) { | ||
101 | - ret = bdrv_co_copy_range(s->source, start, s->target, start, nbytes, | ||
102 | + ret = bdrv_co_copy_range(s->source, offset, s->target, offset, nbytes, | ||
103 | 0, s->write_flags); | ||
104 | if (ret < 0) { | ||
105 | - trace_block_copy_copy_range_fail(s, start, ret); | ||
106 | + trace_block_copy_copy_range_fail(s, offset, ret); | ||
107 | s->use_copy_range = false; | ||
108 | s->copy_size = MAX(s->cluster_size, BLOCK_COPY_MAX_BUFFER); | ||
109 | /* Fallback to read+write with allocated buffer */ | ||
110 | @@ -XXX,XX +XXX,XX @@ static int coroutine_fn block_copy_do_copy(BlockCopyState *s, | ||
111 | |||
112 | bounce_buffer = qemu_blockalign(s->source->bs, nbytes); | ||
113 | |||
114 | - ret = bdrv_co_pread(s->source, start, nbytes, bounce_buffer, 0); | ||
115 | + ret = bdrv_co_pread(s->source, offset, nbytes, bounce_buffer, 0); | ||
116 | if (ret < 0) { | ||
117 | - trace_block_copy_read_fail(s, start, ret); | ||
118 | + trace_block_copy_read_fail(s, offset, ret); | ||
119 | if (error_is_read) { | ||
120 | *error_is_read = true; | ||
121 | } | ||
122 | goto out; | ||
123 | } | ||
124 | |||
125 | - ret = bdrv_co_pwrite(s->target, start, nbytes, bounce_buffer, | ||
126 | + ret = bdrv_co_pwrite(s->target, offset, nbytes, bounce_buffer, | ||
127 | s->write_flags); | ||
128 | if (ret < 0) { | ||
129 | - trace_block_copy_write_fail(s, start, ret); | ||
130 | + trace_block_copy_write_fail(s, offset, ret); | ||
131 | if (error_is_read) { | ||
132 | *error_is_read = false; | ||
133 | } | ||
134 | @@ -XXX,XX +XXX,XX @@ int64_t block_copy_reset_unallocated(BlockCopyState *s, | ||
135 | } | ||
136 | |||
137 | int coroutine_fn block_copy(BlockCopyState *s, | ||
138 | - int64_t start, int64_t bytes, | ||
139 | + int64_t offset, int64_t bytes, | ||
140 | bool *error_is_read) | ||
141 | { | ||
142 | int ret = 0; | ||
143 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
144 | assert(bdrv_get_aio_context(s->source->bs) == | ||
145 | bdrv_get_aio_context(s->target->bs)); | ||
146 | |||
147 | - assert(QEMU_IS_ALIGNED(start, s->cluster_size)); | ||
148 | + assert(QEMU_IS_ALIGNED(offset, s->cluster_size)); | ||
149 | assert(QEMU_IS_ALIGNED(bytes, s->cluster_size)); | ||
150 | |||
151 | - block_copy_wait_inflight_reqs(s, start, bytes); | ||
152 | - block_copy_inflight_req_begin(s, &req, start, bytes); | ||
153 | + block_copy_wait_inflight_reqs(s, offset, bytes); | ||
154 | + block_copy_inflight_req_begin(s, &req, offset, bytes); | ||
155 | |||
156 | while (bytes) { | ||
157 | int64_t next_zero, cur_bytes, status_bytes; | ||
158 | |||
159 | - if (!bdrv_dirty_bitmap_get(s->copy_bitmap, start)) { | ||
160 | - trace_block_copy_skip(s, start); | ||
161 | - start += s->cluster_size; | ||
162 | + if (!bdrv_dirty_bitmap_get(s->copy_bitmap, offset)) { | ||
163 | + trace_block_copy_skip(s, offset); | ||
164 | + offset += s->cluster_size; | ||
165 | bytes -= s->cluster_size; | ||
166 | continue; /* already copied */ | ||
167 | } | ||
168 | |||
169 | cur_bytes = MIN(bytes, s->copy_size); | ||
170 | |||
171 | - next_zero = bdrv_dirty_bitmap_next_zero(s->copy_bitmap, start, | ||
172 | + next_zero = bdrv_dirty_bitmap_next_zero(s->copy_bitmap, offset, | ||
173 | cur_bytes); | ||
174 | if (next_zero >= 0) { | ||
175 | - assert(next_zero > start); /* start is dirty */ | ||
176 | - assert(next_zero < start + cur_bytes); /* no need to do MIN() */ | ||
177 | - cur_bytes = next_zero - start; | ||
178 | + assert(next_zero > offset); /* offset is dirty */ | ||
179 | + assert(next_zero < offset + cur_bytes); /* no need to do MIN() */ | ||
180 | + cur_bytes = next_zero - offset; | ||
181 | } | ||
182 | |||
183 | - ret = block_copy_block_status(s, start, cur_bytes, &status_bytes); | ||
184 | + ret = block_copy_block_status(s, offset, cur_bytes, &status_bytes); | ||
185 | if (s->skip_unallocated && !(ret & BDRV_BLOCK_ALLOCATED)) { | ||
186 | - bdrv_reset_dirty_bitmap(s->copy_bitmap, start, status_bytes); | ||
187 | + bdrv_reset_dirty_bitmap(s->copy_bitmap, offset, status_bytes); | ||
188 | progress_set_remaining(s->progress, | ||
189 | bdrv_get_dirty_count(s->copy_bitmap) + | ||
190 | s->in_flight_bytes); | ||
191 | - trace_block_copy_skip_range(s, start, status_bytes); | ||
192 | - start += status_bytes; | ||
193 | + trace_block_copy_skip_range(s, offset, status_bytes); | ||
194 | + offset += status_bytes; | ||
195 | bytes -= status_bytes; | ||
196 | continue; | ||
197 | } | ||
198 | |||
199 | cur_bytes = MIN(cur_bytes, status_bytes); | ||
200 | |||
201 | - trace_block_copy_process(s, start); | ||
202 | + trace_block_copy_process(s, offset); | ||
203 | |||
204 | - bdrv_reset_dirty_bitmap(s->copy_bitmap, start, cur_bytes); | ||
205 | + bdrv_reset_dirty_bitmap(s->copy_bitmap, offset, cur_bytes); | ||
206 | s->in_flight_bytes += cur_bytes; | ||
207 | |||
208 | co_get_from_shres(s->mem, cur_bytes); | ||
209 | - ret = block_copy_do_copy(s, start, cur_bytes, ret & BDRV_BLOCK_ZERO, | ||
210 | + ret = block_copy_do_copy(s, offset, cur_bytes, ret & BDRV_BLOCK_ZERO, | ||
211 | error_is_read); | ||
212 | co_put_to_shres(s->mem, cur_bytes); | ||
213 | s->in_flight_bytes -= cur_bytes; | ||
214 | if (ret < 0) { | ||
215 | - bdrv_set_dirty_bitmap(s->copy_bitmap, start, cur_bytes); | ||
216 | + bdrv_set_dirty_bitmap(s->copy_bitmap, offset, cur_bytes); | ||
217 | break; | ||
218 | } | ||
219 | |||
220 | progress_work_done(s->progress, cur_bytes); | ||
221 | s->progress_bytes_callback(cur_bytes, s->progress_opaque); | ||
222 | - start += cur_bytes; | ||
223 | + offset += cur_bytes; | ||
224 | bytes -= cur_bytes; | ||
225 | } | ||
226 | |||
227 | diff --git a/include/block/block-copy.h b/include/block/block-copy.h | ||
228 | index XXXXXXX..XXXXXXX 100644 | ||
229 | --- a/include/block/block-copy.h | ||
230 | +++ b/include/block/block-copy.h | ||
231 | @@ -XXX,XX +XXX,XX @@ | ||
232 | #include "qemu/co-shared-resource.h" | ||
233 | |||
234 | typedef struct BlockCopyInFlightReq { | ||
235 | - int64_t start; | ||
236 | + int64_t offset; | ||
237 | int64_t bytes; | ||
238 | QLIST_ENTRY(BlockCopyInFlightReq) list; | ||
239 | CoQueue wait_queue; /* coroutines blocked on this request */ | ||
240 | @@ -XXX,XX +XXX,XX @@ void block_copy_state_free(BlockCopyState *s); | ||
241 | int64_t block_copy_reset_unallocated(BlockCopyState *s, | ||
242 | int64_t offset, int64_t *count); | ||
243 | |||
244 | -int coroutine_fn block_copy(BlockCopyState *s, int64_t start, int64_t bytes, | ||
245 | +int coroutine_fn block_copy(BlockCopyState *s, int64_t offset, int64_t bytes, | ||
246 | bool *error_is_read); | ||
247 | |||
248 | #endif /* BLOCK_COPY_H */ | ||
249 | -- | ||
250 | 2.24.1 | ||
251 | |||
252 | diff view generated by jsdifflib |
New patch | |||
---|---|---|---|
1 | 1 | From: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | |
2 | |||
3 | Currently, block_copy operation lock the whole requested region. But | ||
4 | there is no reason to lock clusters, which are already copied, it will | ||
5 | disturb other parallel block_copy requests for no reason. | ||
6 | |||
7 | Let's instead do the following: | ||
8 | |||
9 | Lock only sub-region, which we are going to operate on. Then, after | ||
10 | copying all dirty sub-regions, we should wait for intersecting | ||
11 | requests block-copy, if they failed, we should retry these new dirty | ||
12 | clusters. | ||
13 | |||
14 | Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | ||
15 | Reviewed-by: Andrey Shinkevich <andrey.shinkevich@virtuozzo.com> | ||
16 | Message-Id: <20200311103004.7649-9-vsementsov@virtuozzo.com> | ||
17 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
18 | --- | ||
19 | block/block-copy.c | 129 ++++++++++++++++++++++++++++++++++++--------- | ||
20 | 1 file changed, 105 insertions(+), 24 deletions(-) | ||
21 | |||
22 | diff --git a/block/block-copy.c b/block/block-copy.c | ||
23 | index XXXXXXX..XXXXXXX 100644 | ||
24 | --- a/block/block-copy.c | ||
25 | +++ b/block/block-copy.c | ||
26 | @@ -XXX,XX +XXX,XX @@ static BlockCopyInFlightReq *find_conflicting_inflight_req(BlockCopyState *s, | ||
27 | return NULL; | ||
28 | } | ||
29 | |||
30 | -static void coroutine_fn block_copy_wait_inflight_reqs(BlockCopyState *s, | ||
31 | - int64_t offset, | ||
32 | - int64_t bytes) | ||
33 | +/* | ||
34 | + * If there are no intersecting requests return false. Otherwise, wait for the | ||
35 | + * first found intersecting request to finish and return true. | ||
36 | + */ | ||
37 | +static bool coroutine_fn block_copy_wait_one(BlockCopyState *s, int64_t offset, | ||
38 | + int64_t bytes) | ||
39 | { | ||
40 | - BlockCopyInFlightReq *req; | ||
41 | + BlockCopyInFlightReq *req = find_conflicting_inflight_req(s, offset, bytes); | ||
42 | |||
43 | - while ((req = find_conflicting_inflight_req(s, offset, bytes))) { | ||
44 | - qemu_co_queue_wait(&req->wait_queue, NULL); | ||
45 | + if (!req) { | ||
46 | + return false; | ||
47 | } | ||
48 | + | ||
49 | + qemu_co_queue_wait(&req->wait_queue, NULL); | ||
50 | + | ||
51 | + return true; | ||
52 | } | ||
53 | |||
54 | +/* Called only on full-dirty region */ | ||
55 | static void block_copy_inflight_req_begin(BlockCopyState *s, | ||
56 | BlockCopyInFlightReq *req, | ||
57 | int64_t offset, int64_t bytes) | ||
58 | { | ||
59 | + assert(!find_conflicting_inflight_req(s, offset, bytes)); | ||
60 | + | ||
61 | + bdrv_reset_dirty_bitmap(s->copy_bitmap, offset, bytes); | ||
62 | + s->in_flight_bytes += bytes; | ||
63 | + | ||
64 | req->offset = offset; | ||
65 | req->bytes = bytes; | ||
66 | qemu_co_queue_init(&req->wait_queue); | ||
67 | QLIST_INSERT_HEAD(&s->inflight_reqs, req, list); | ||
68 | } | ||
69 | |||
70 | -static void coroutine_fn block_copy_inflight_req_end(BlockCopyInFlightReq *req) | ||
71 | +/* | ||
72 | + * block_copy_inflight_req_shrink | ||
73 | + * | ||
74 | + * Drop the tail of the request to be handled later. Set dirty bits back and | ||
75 | + * wake up all requests waiting for us (may be some of them are not intersecting | ||
76 | + * with shrunk request) | ||
77 | + */ | ||
78 | +static void coroutine_fn block_copy_inflight_req_shrink(BlockCopyState *s, | ||
79 | + BlockCopyInFlightReq *req, int64_t new_bytes) | ||
80 | { | ||
81 | + if (new_bytes == req->bytes) { | ||
82 | + return; | ||
83 | + } | ||
84 | + | ||
85 | + assert(new_bytes > 0 && new_bytes < req->bytes); | ||
86 | + | ||
87 | + s->in_flight_bytes -= req->bytes - new_bytes; | ||
88 | + bdrv_set_dirty_bitmap(s->copy_bitmap, | ||
89 | + req->offset + new_bytes, req->bytes - new_bytes); | ||
90 | + | ||
91 | + req->bytes = new_bytes; | ||
92 | + qemu_co_queue_restart_all(&req->wait_queue); | ||
93 | +} | ||
94 | + | ||
95 | +static void coroutine_fn block_copy_inflight_req_end(BlockCopyState *s, | ||
96 | + BlockCopyInFlightReq *req, | ||
97 | + int ret) | ||
98 | +{ | ||
99 | + s->in_flight_bytes -= req->bytes; | ||
100 | + if (ret < 0) { | ||
101 | + bdrv_set_dirty_bitmap(s->copy_bitmap, req->offset, req->bytes); | ||
102 | + } | ||
103 | QLIST_REMOVE(req, list); | ||
104 | qemu_co_queue_restart_all(&req->wait_queue); | ||
105 | } | ||
106 | @@ -XXX,XX +XXX,XX @@ int64_t block_copy_reset_unallocated(BlockCopyState *s, | ||
107 | return ret; | ||
108 | } | ||
109 | |||
110 | -int coroutine_fn block_copy(BlockCopyState *s, | ||
111 | - int64_t offset, int64_t bytes, | ||
112 | - bool *error_is_read) | ||
113 | +/* | ||
114 | + * block_copy_dirty_clusters | ||
115 | + * | ||
116 | + * Copy dirty clusters in @offset/@bytes range. | ||
117 | + * Returns 1 if dirty clusters found and successfully copied, 0 if no dirty | ||
118 | + * clusters found and -errno on failure. | ||
119 | + */ | ||
120 | +static int coroutine_fn block_copy_dirty_clusters(BlockCopyState *s, | ||
121 | + int64_t offset, int64_t bytes, | ||
122 | + bool *error_is_read) | ||
123 | { | ||
124 | int ret = 0; | ||
125 | - BlockCopyInFlightReq req; | ||
126 | + bool found_dirty = false; | ||
127 | |||
128 | /* | ||
129 | * block_copy() user is responsible for keeping source and target in same | ||
130 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
131 | assert(QEMU_IS_ALIGNED(offset, s->cluster_size)); | ||
132 | assert(QEMU_IS_ALIGNED(bytes, s->cluster_size)); | ||
133 | |||
134 | - block_copy_wait_inflight_reqs(s, offset, bytes); | ||
135 | - block_copy_inflight_req_begin(s, &req, offset, bytes); | ||
136 | - | ||
137 | while (bytes) { | ||
138 | + BlockCopyInFlightReq req; | ||
139 | int64_t next_zero, cur_bytes, status_bytes; | ||
140 | |||
141 | if (!bdrv_dirty_bitmap_get(s->copy_bitmap, offset)) { | ||
142 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
143 | continue; /* already copied */ | ||
144 | } | ||
145 | |||
146 | + found_dirty = true; | ||
147 | + | ||
148 | cur_bytes = MIN(bytes, s->copy_size); | ||
149 | |||
150 | next_zero = bdrv_dirty_bitmap_next_zero(s->copy_bitmap, offset, | ||
151 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
152 | assert(next_zero < offset + cur_bytes); /* no need to do MIN() */ | ||
153 | cur_bytes = next_zero - offset; | ||
154 | } | ||
155 | + block_copy_inflight_req_begin(s, &req, offset, cur_bytes); | ||
156 | |||
157 | ret = block_copy_block_status(s, offset, cur_bytes, &status_bytes); | ||
158 | + assert(ret >= 0); /* never fail */ | ||
159 | + cur_bytes = MIN(cur_bytes, status_bytes); | ||
160 | + block_copy_inflight_req_shrink(s, &req, cur_bytes); | ||
161 | if (s->skip_unallocated && !(ret & BDRV_BLOCK_ALLOCATED)) { | ||
162 | - bdrv_reset_dirty_bitmap(s->copy_bitmap, offset, status_bytes); | ||
163 | + block_copy_inflight_req_end(s, &req, 0); | ||
164 | progress_set_remaining(s->progress, | ||
165 | bdrv_get_dirty_count(s->copy_bitmap) + | ||
166 | s->in_flight_bytes); | ||
167 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
168 | continue; | ||
169 | } | ||
170 | |||
171 | - cur_bytes = MIN(cur_bytes, status_bytes); | ||
172 | - | ||
173 | trace_block_copy_process(s, offset); | ||
174 | |||
175 | - bdrv_reset_dirty_bitmap(s->copy_bitmap, offset, cur_bytes); | ||
176 | - s->in_flight_bytes += cur_bytes; | ||
177 | - | ||
178 | co_get_from_shres(s->mem, cur_bytes); | ||
179 | ret = block_copy_do_copy(s, offset, cur_bytes, ret & BDRV_BLOCK_ZERO, | ||
180 | error_is_read); | ||
181 | co_put_to_shres(s->mem, cur_bytes); | ||
182 | - s->in_flight_bytes -= cur_bytes; | ||
183 | + block_copy_inflight_req_end(s, &req, ret); | ||
184 | if (ret < 0) { | ||
185 | - bdrv_set_dirty_bitmap(s->copy_bitmap, offset, cur_bytes); | ||
186 | - break; | ||
187 | + return ret; | ||
188 | } | ||
189 | |||
190 | progress_work_done(s->progress, cur_bytes); | ||
191 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, | ||
192 | bytes -= cur_bytes; | ||
193 | } | ||
194 | |||
195 | - block_copy_inflight_req_end(&req); | ||
196 | + return found_dirty; | ||
197 | +} | ||
198 | + | ||
199 | +/* | ||
200 | + * block_copy | ||
201 | + * | ||
202 | + * Copy requested region, accordingly to dirty bitmap. | ||
203 | + * Collaborate with parallel block_copy requests: if they succeed it will help | ||
204 | + * us. If they fail, we will retry not-copied regions. So, if we return error, | ||
205 | + * it means that some I/O operation failed in context of _this_ block_copy call, | ||
206 | + * not some parallel operation. | ||
207 | + */ | ||
208 | +int coroutine_fn block_copy(BlockCopyState *s, int64_t offset, int64_t bytes, | ||
209 | + bool *error_is_read) | ||
210 | +{ | ||
211 | + int ret; | ||
212 | + | ||
213 | + do { | ||
214 | + ret = block_copy_dirty_clusters(s, offset, bytes, error_is_read); | ||
215 | + | ||
216 | + if (ret == 0) { | ||
217 | + ret = block_copy_wait_one(s, offset, bytes); | ||
218 | + } | ||
219 | + | ||
220 | + /* | ||
221 | + * We retry in two cases: | ||
222 | + * 1. Some progress done | ||
223 | + * Something was copied, which means that there were yield points | ||
224 | + * and some new dirty bits may have appeared (due to failed parallel | ||
225 | + * block-copy requests). | ||
226 | + * 2. We have waited for some intersecting block-copy request | ||
227 | + * It may have failed and produced new dirty bits. | ||
228 | + */ | ||
229 | + } while (ret > 0); | ||
230 | |||
231 | return ret; | ||
232 | } | ||
233 | -- | ||
234 | 2.24.1 | ||
235 | |||
236 | diff view generated by jsdifflib |
New patch | |||
---|---|---|---|
1 | 1 | From: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | |
2 | |||
3 | Hide structure definitions and add explicit API instead, to keep an | ||
4 | eye on the scope of the shared fields. | ||
5 | |||
6 | Signed-off-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> | ||
7 | Reviewed-by: Andrey Shinkevich <andrey.shinkevich@virtuozzo.com> | ||
8 | Reviewed-by: Max Reitz <mreitz@redhat.com> | ||
9 | Message-Id: <20200311103004.7649-10-vsementsov@virtuozzo.com> | ||
10 | Signed-off-by: Max Reitz <mreitz@redhat.com> | ||
11 | --- | ||
12 | block/backup-top.c | 6 ++-- | ||
13 | block/backup.c | 25 ++++++++-------- | ||
14 | block/block-copy.c | 59 ++++++++++++++++++++++++++++++++++++++ | ||
15 | include/block/block-copy.h | 52 +++------------------------------ | ||
16 | 4 files changed, 80 insertions(+), 62 deletions(-) | ||
17 | |||
18 | diff --git a/block/backup-top.c b/block/backup-top.c | ||
19 | index XXXXXXX..XXXXXXX 100644 | ||
20 | --- a/block/backup-top.c | ||
21 | +++ b/block/backup-top.c | ||
22 | @@ -XXX,XX +XXX,XX @@ typedef struct BDRVBackupTopState { | ||
23 | BlockCopyState *bcs; | ||
24 | BdrvChild *target; | ||
25 | bool active; | ||
26 | + int64_t cluster_size; | ||
27 | } BDRVBackupTopState; | ||
28 | |||
29 | static coroutine_fn int backup_top_co_preadv( | ||
30 | @@ -XXX,XX +XXX,XX @@ static coroutine_fn int backup_top_cbw(BlockDriverState *bs, uint64_t offset, | ||
31 | return 0; | ||
32 | } | ||
33 | |||
34 | - off = QEMU_ALIGN_DOWN(offset, s->bcs->cluster_size); | ||
35 | - end = QEMU_ALIGN_UP(offset + bytes, s->bcs->cluster_size); | ||
36 | + off = QEMU_ALIGN_DOWN(offset, s->cluster_size); | ||
37 | + end = QEMU_ALIGN_UP(offset + bytes, s->cluster_size); | ||
38 | |||
39 | return block_copy(s->bcs, off, end - off, NULL); | ||
40 | } | ||
41 | @@ -XXX,XX +XXX,XX @@ BlockDriverState *bdrv_backup_top_append(BlockDriverState *source, | ||
42 | goto fail; | ||
43 | } | ||
44 | |||
45 | + state->cluster_size = cluster_size; | ||
46 | state->bcs = block_copy_state_new(top->backing, state->target, | ||
47 | cluster_size, write_flags, &local_err); | ||
48 | if (local_err) { | ||
49 | diff --git a/block/backup.c b/block/backup.c | ||
50 | index XXXXXXX..XXXXXXX 100644 | ||
51 | --- a/block/backup.c | ||
52 | +++ b/block/backup.c | ||
53 | @@ -XXX,XX +XXX,XX @@ static void backup_cleanup_sync_bitmap(BackupBlockJob *job, int ret) | ||
54 | |||
55 | if (ret < 0 && job->bitmap_mode == BITMAP_SYNC_MODE_ALWAYS) { | ||
56 | /* If we failed and synced, merge in the bits we didn't copy: */ | ||
57 | - bdrv_dirty_bitmap_merge_internal(bm, job->bcs->copy_bitmap, | ||
58 | + bdrv_dirty_bitmap_merge_internal(bm, block_copy_dirty_bitmap(job->bcs), | ||
59 | NULL, true); | ||
60 | } | ||
61 | } | ||
62 | @@ -XXX,XX +XXX,XX @@ void backup_do_checkpoint(BlockJob *job, Error **errp) | ||
63 | return; | ||
64 | } | ||
65 | |||
66 | - bdrv_set_dirty_bitmap(backup_job->bcs->copy_bitmap, 0, backup_job->len); | ||
67 | + bdrv_set_dirty_bitmap(block_copy_dirty_bitmap(backup_job->bcs), 0, | ||
68 | + backup_job->len); | ||
69 | } | ||
70 | |||
71 | static BlockErrorAction backup_error_action(BackupBlockJob *job, | ||
72 | @@ -XXX,XX +XXX,XX @@ static int coroutine_fn backup_loop(BackupBlockJob *job) | ||
73 | BdrvDirtyBitmapIter *bdbi; | ||
74 | int ret = 0; | ||
75 | |||
76 | - bdbi = bdrv_dirty_iter_new(job->bcs->copy_bitmap); | ||
77 | + bdbi = bdrv_dirty_iter_new(block_copy_dirty_bitmap(job->bcs)); | ||
78 | while ((offset = bdrv_dirty_iter_next(bdbi)) != -1) { | ||
79 | do { | ||
80 | if (yield_and_check(job)) { | ||
81 | @@ -XXX,XX +XXX,XX @@ static int coroutine_fn backup_loop(BackupBlockJob *job) | ||
82 | return ret; | ||
83 | } | ||
84 | |||
85 | -static void backup_init_copy_bitmap(BackupBlockJob *job) | ||
86 | +static void backup_init_bcs_bitmap(BackupBlockJob *job) | ||
87 | { | ||
88 | bool ret; | ||
89 | uint64_t estimate; | ||
90 | + BdrvDirtyBitmap *bcs_bitmap = block_copy_dirty_bitmap(job->bcs); | ||
91 | |||
92 | if (job->sync_mode == MIRROR_SYNC_MODE_BITMAP) { | ||
93 | - ret = bdrv_dirty_bitmap_merge_internal(job->bcs->copy_bitmap, | ||
94 | - job->sync_bitmap, | ||
95 | + ret = bdrv_dirty_bitmap_merge_internal(bcs_bitmap, job->sync_bitmap, | ||
96 | NULL, true); | ||
97 | assert(ret); | ||
98 | } else { | ||
99 | @@ -XXX,XX +XXX,XX @@ static void backup_init_copy_bitmap(BackupBlockJob *job) | ||
100 | * We can't hog the coroutine to initialize this thoroughly. | ||
101 | * Set a flag and resume work when we are able to yield safely. | ||
102 | */ | ||
103 | - job->bcs->skip_unallocated = true; | ||
104 | + block_copy_set_skip_unallocated(job->bcs, true); | ||
105 | } | ||
106 | - bdrv_set_dirty_bitmap(job->bcs->copy_bitmap, 0, job->len); | ||
107 | + bdrv_set_dirty_bitmap(bcs_bitmap, 0, job->len); | ||
108 | } | ||
109 | |||
110 | - estimate = bdrv_get_dirty_count(job->bcs->copy_bitmap); | ||
111 | + estimate = bdrv_get_dirty_count(bcs_bitmap); | ||
112 | job_progress_set_remaining(&job->common.job, estimate); | ||
113 | } | ||
114 | |||
115 | @@ -XXX,XX +XXX,XX @@ static int coroutine_fn backup_run(Job *job, Error **errp) | ||
116 | BackupBlockJob *s = container_of(job, BackupBlockJob, common.job); | ||
117 | int ret = 0; | ||
118 | |||
119 | - backup_init_copy_bitmap(s); | ||
120 | + backup_init_bcs_bitmap(s); | ||
121 | |||
122 | if (s->sync_mode == MIRROR_SYNC_MODE_TOP) { | ||
123 | int64_t offset = 0; | ||
124 | @@ -XXX,XX +XXX,XX @@ static int coroutine_fn backup_run(Job *job, Error **errp) | ||
125 | |||
126 | offset += count; | ||
127 | } | ||
128 | - s->bcs->skip_unallocated = false; | ||
129 | + block_copy_set_skip_unallocated(s->bcs, false); | ||
130 | } | ||
131 | |||
132 | if (s->sync_mode == MIRROR_SYNC_MODE_NONE) { | ||
133 | /* | ||
134 | - * All bits are set in copy_bitmap to allow any cluster to be copied. | ||
135 | + * All bits are set in bcs bitmap to allow any cluster to be copied. | ||
136 | * This does not actually require them to be copied. | ||
137 | */ | ||
138 | while (!job_is_cancelled(job)) { | ||
139 | diff --git a/block/block-copy.c b/block/block-copy.c | ||
140 | index XXXXXXX..XXXXXXX 100644 | ||
141 | --- a/block/block-copy.c | ||
142 | +++ b/block/block-copy.c | ||
143 | @@ -XXX,XX +XXX,XX @@ | ||
144 | #define BLOCK_COPY_MAX_BUFFER (1 * MiB) | ||
145 | #define BLOCK_COPY_MAX_MEM (128 * MiB) | ||
146 | |||
147 | +typedef struct BlockCopyInFlightReq { | ||
148 | + int64_t offset; | ||
149 | + int64_t bytes; | ||
150 | + QLIST_ENTRY(BlockCopyInFlightReq) list; | ||
151 | + CoQueue wait_queue; /* coroutines blocked on this request */ | ||
152 | +} BlockCopyInFlightReq; | ||
153 | + | ||
154 | +typedef struct BlockCopyState { | ||
155 | + /* | ||
156 | + * BdrvChild objects are not owned or managed by block-copy. They are | ||
157 | + * provided by block-copy user and user is responsible for appropriate | ||
158 | + * permissions on these children. | ||
159 | + */ | ||
160 | + BdrvChild *source; | ||
161 | + BdrvChild *target; | ||
162 | + BdrvDirtyBitmap *copy_bitmap; | ||
163 | + int64_t in_flight_bytes; | ||
164 | + int64_t cluster_size; | ||
165 | + bool use_copy_range; | ||
166 | + int64_t copy_size; | ||
167 | + uint64_t len; | ||
168 | + QLIST_HEAD(, BlockCopyInFlightReq) inflight_reqs; | ||
169 | + | ||
170 | + BdrvRequestFlags write_flags; | ||
171 | + | ||
172 | + /* | ||
173 | + * skip_unallocated: | ||
174 | + * | ||
175 | + * Used by sync=top jobs, which first scan the source node for unallocated | ||
176 | + * areas and clear them in the copy_bitmap. During this process, the bitmap | ||
177 | + * is thus not fully initialized: It may still have bits set for areas that | ||
178 | + * are unallocated and should actually not be copied. | ||
179 | + * | ||
180 | + * This is indicated by skip_unallocated. | ||
181 | + * | ||
182 | + * In this case, block_copy() will query the source’s allocation status, | ||
183 | + * skip unallocated regions, clear them in the copy_bitmap, and invoke | ||
184 | + * block_copy_reset_unallocated() every time it does. | ||
185 | + */ | ||
186 | + bool skip_unallocated; | ||
187 | + | ||
188 | + ProgressMeter *progress; | ||
189 | + /* progress_bytes_callback: called when some copying progress is done. */ | ||
190 | + ProgressBytesCallbackFunc progress_bytes_callback; | ||
191 | + void *progress_opaque; | ||
192 | + | ||
193 | + SharedResource *mem; | ||
194 | +} BlockCopyState; | ||
195 | + | ||
196 | static BlockCopyInFlightReq *find_conflicting_inflight_req(BlockCopyState *s, | ||
197 | int64_t offset, | ||
198 | int64_t bytes) | ||
199 | @@ -XXX,XX +XXX,XX @@ int coroutine_fn block_copy(BlockCopyState *s, int64_t offset, int64_t bytes, | ||
200 | |||
201 | return ret; | ||
202 | } | ||
203 | + | ||
204 | +BdrvDirtyBitmap *block_copy_dirty_bitmap(BlockCopyState *s) | ||
205 | +{ | ||
206 | + return s->copy_bitmap; | ||
207 | +} | ||
208 | + | ||
209 | +void block_copy_set_skip_unallocated(BlockCopyState *s, bool skip) | ||
210 | +{ | ||
211 | + s->skip_unallocated = skip; | ||
212 | +} | ||
213 | diff --git a/include/block/block-copy.h b/include/block/block-copy.h | ||
214 | index XXXXXXX..XXXXXXX 100644 | ||
215 | --- a/include/block/block-copy.h | ||
216 | +++ b/include/block/block-copy.h | ||
217 | @@ -XXX,XX +XXX,XX @@ | ||
218 | #include "block/block.h" | ||
219 | #include "qemu/co-shared-resource.h" | ||
220 | |||
221 | -typedef struct BlockCopyInFlightReq { | ||
222 | - int64_t offset; | ||
223 | - int64_t bytes; | ||
224 | - QLIST_ENTRY(BlockCopyInFlightReq) list; | ||
225 | - CoQueue wait_queue; /* coroutines blocked on this request */ | ||
226 | -} BlockCopyInFlightReq; | ||
227 | - | ||
228 | typedef void (*ProgressBytesCallbackFunc)(int64_t bytes, void *opaque); | ||
229 | -typedef struct BlockCopyState { | ||
230 | - /* | ||
231 | - * BdrvChild objects are not owned or managed by block-copy. They are | ||
232 | - * provided by block-copy user and user is responsible for appropriate | ||
233 | - * permissions on these children. | ||
234 | - */ | ||
235 | - BdrvChild *source; | ||
236 | - BdrvChild *target; | ||
237 | - BdrvDirtyBitmap *copy_bitmap; | ||
238 | - int64_t in_flight_bytes; | ||
239 | - int64_t cluster_size; | ||
240 | - bool use_copy_range; | ||
241 | - int64_t copy_size; | ||
242 | - uint64_t len; | ||
243 | - QLIST_HEAD(, BlockCopyInFlightReq) inflight_reqs; | ||
244 | - | ||
245 | - BdrvRequestFlags write_flags; | ||
246 | - | ||
247 | - /* | ||
248 | - * skip_unallocated: | ||
249 | - * | ||
250 | - * Used by sync=top jobs, which first scan the source node for unallocated | ||
251 | - * areas and clear them in the copy_bitmap. During this process, the bitmap | ||
252 | - * is thus not fully initialized: It may still have bits set for areas that | ||
253 | - * are unallocated and should actually not be copied. | ||
254 | - * | ||
255 | - * This is indicated by skip_unallocated. | ||
256 | - * | ||
257 | - * In this case, block_copy() will query the source’s allocation status, | ||
258 | - * skip unallocated regions, clear them in the copy_bitmap, and invoke | ||
259 | - * block_copy_reset_unallocated() every time it does. | ||
260 | - */ | ||
261 | - bool skip_unallocated; | ||
262 | - | ||
263 | - ProgressMeter *progress; | ||
264 | - /* progress_bytes_callback: called when some copying progress is done. */ | ||
265 | - ProgressBytesCallbackFunc progress_bytes_callback; | ||
266 | - void *progress_opaque; | ||
267 | - | ||
268 | - SharedResource *mem; | ||
269 | -} BlockCopyState; | ||
270 | +typedef struct BlockCopyState BlockCopyState; | ||
271 | |||
272 | BlockCopyState *block_copy_state_new(BdrvChild *source, BdrvChild *target, | ||
273 | int64_t cluster_size, | ||
274 | @@ -XXX,XX +XXX,XX @@ int64_t block_copy_reset_unallocated(BlockCopyState *s, | ||
275 | int coroutine_fn block_copy(BlockCopyState *s, int64_t offset, int64_t bytes, | ||
276 | bool *error_is_read); | ||
277 | |||
278 | +BdrvDirtyBitmap *block_copy_dirty_bitmap(BlockCopyState *s); | ||
279 | +void block_copy_set_skip_unallocated(BlockCopyState *s, bool skip); | ||
280 | + | ||
281 | #endif /* BLOCK_COPY_H */ | ||
282 | -- | ||
283 | 2.24.1 | ||
284 | |||
285 | diff view generated by jsdifflib |