rewrite iov_* functions
This changes implementations of all iov_* functions, completing the previous step. All iov_* functions now ensure that this offset argument is within the iovec (using assertion), but lets to specify `bytes' value larger than actual length of the iovec - in this case they stops at the actual end of iovec. It is also suggested to use convinient `-1' value as `bytes' to mean just this -- "up to the end". There's one very minor semantic change here: new requiriment is that `offset' points to inside of iovec. This is checked just at the end of functions (assert()), it does not actually need to be enforced, but using any of these functions with offset pointing past the end of iovec is wrong anyway. Note: the new code in iov.c uses arithmetic with void pointers. I thought this is not supported everywhere and is a GCC extension (indeed, the C standard does not define void arithmetic). However, the original code already use void arith in iov_from_buf() function: (memcpy(..., buf + buf_off,...) which apparently works well so far (it is this way in qemu 1.0). So I left it this way and used it in other places. While at it, add a unit-test file test-iov.c, to check various corner cases with iov_from_buf(), iov_to_buf() and iov_memset(). Signed-off-by: Michael Tokarev <mjt@tls.msk.ru>
This commit is contained in:
parent
dcf6f5e15e
commit
2278a69e70
91
iov.c
91
iov.c
@ -7,6 +7,7 @@
|
|||||||
* Author(s):
|
* Author(s):
|
||||||
* Anthony Liguori <aliguori@us.ibm.com>
|
* Anthony Liguori <aliguori@us.ibm.com>
|
||||||
* Amit Shah <amit.shah@redhat.com>
|
* Amit Shah <amit.shah@redhat.com>
|
||||||
|
* Michael Tokarev <mjt@tls.msk.ru>
|
||||||
*
|
*
|
||||||
* This work is licensed under the terms of the GNU GPL, version 2. See
|
* This work is licensed under the terms of the GNU GPL, version 2. See
|
||||||
* the COPYING file in the top-level directory.
|
* the COPYING file in the top-level directory.
|
||||||
@ -17,75 +18,61 @@
|
|||||||
|
|
||||||
#include "iov.h"
|
#include "iov.h"
|
||||||
|
|
||||||
size_t iov_from_buf(struct iovec *iov, unsigned int iov_cnt, size_t iov_off,
|
size_t iov_from_buf(struct iovec *iov, unsigned int iov_cnt,
|
||||||
const void *buf, size_t size)
|
size_t offset, const void *buf, size_t bytes)
|
||||||
{
|
{
|
||||||
size_t iovec_off, buf_off;
|
size_t done;
|
||||||
unsigned int i;
|
unsigned int i;
|
||||||
|
for (i = 0, done = 0; (offset || done < bytes) && i < iov_cnt; i++) {
|
||||||
iovec_off = 0;
|
if (offset < iov[i].iov_len) {
|
||||||
buf_off = 0;
|
size_t len = MIN(iov[i].iov_len - offset, bytes - done);
|
||||||
for (i = 0; i < iov_cnt && size; i++) {
|
memcpy(iov[i].iov_base + offset, buf + done, len);
|
||||||
if (iov_off < (iovec_off + iov[i].iov_len)) {
|
done += len;
|
||||||
size_t len = MIN((iovec_off + iov[i].iov_len) - iov_off, size);
|
offset = 0;
|
||||||
|
} else {
|
||||||
memcpy(iov[i].iov_base + (iov_off - iovec_off), buf + buf_off, len);
|
offset -= iov[i].iov_len;
|
||||||
|
|
||||||
buf_off += len;
|
|
||||||
iov_off += len;
|
|
||||||
size -= len;
|
|
||||||
}
|
}
|
||||||
iovec_off += iov[i].iov_len;
|
|
||||||
}
|
}
|
||||||
return buf_off;
|
assert(offset == 0);
|
||||||
|
return done;
|
||||||
}
|
}
|
||||||
|
|
||||||
size_t iov_to_buf(const struct iovec *iov, const unsigned int iov_cnt, size_t iov_off,
|
size_t iov_to_buf(const struct iovec *iov, const unsigned int iov_cnt,
|
||||||
void *buf, size_t size)
|
size_t offset, void *buf, size_t bytes)
|
||||||
{
|
{
|
||||||
uint8_t *ptr;
|
size_t done;
|
||||||
size_t iovec_off, buf_off;
|
|
||||||
unsigned int i;
|
unsigned int i;
|
||||||
|
for (i = 0, done = 0; (offset || done < bytes) && i < iov_cnt; i++) {
|
||||||
ptr = buf;
|
if (offset < iov[i].iov_len) {
|
||||||
iovec_off = 0;
|
size_t len = MIN(iov[i].iov_len - offset, bytes - done);
|
||||||
buf_off = 0;
|
memcpy(buf + done, iov[i].iov_base + offset, len);
|
||||||
for (i = 0; i < iov_cnt && size; i++) {
|
done += len;
|
||||||
if (iov_off < (iovec_off + iov[i].iov_len)) {
|
offset = 0;
|
||||||
size_t len = MIN((iovec_off + iov[i].iov_len) - iov_off , size);
|
} else {
|
||||||
|
offset -= iov[i].iov_len;
|
||||||
memcpy(ptr + buf_off, iov[i].iov_base + (iov_off - iovec_off), len);
|
|
||||||
|
|
||||||
buf_off += len;
|
|
||||||
iov_off += len;
|
|
||||||
size -= len;
|
|
||||||
}
|
}
|
||||||
iovec_off += iov[i].iov_len;
|
|
||||||
}
|
}
|
||||||
return buf_off;
|
assert(offset == 0);
|
||||||
|
return done;
|
||||||
}
|
}
|
||||||
|
|
||||||
size_t iov_memset(const struct iovec *iov, const unsigned int iov_cnt,
|
size_t iov_memset(const struct iovec *iov, const unsigned int iov_cnt,
|
||||||
size_t iov_off, int fillc, size_t size)
|
size_t offset, int fillc, size_t bytes)
|
||||||
{
|
{
|
||||||
size_t iovec_off, buf_off;
|
size_t done;
|
||||||
unsigned int i;
|
unsigned int i;
|
||||||
|
for (i = 0, done = 0; (offset || done < bytes) && i < iov_cnt; i++) {
|
||||||
iovec_off = 0;
|
if (offset < iov[i].iov_len) {
|
||||||
buf_off = 0;
|
size_t len = MIN(iov[i].iov_len - offset, bytes - done);
|
||||||
for (i = 0; i < iov_cnt && size; i++) {
|
memset(iov[i].iov_base + offset, fillc, len);
|
||||||
if (iov_off < (iovec_off + iov[i].iov_len)) {
|
done += len;
|
||||||
size_t len = MIN((iovec_off + iov[i].iov_len) - iov_off , size);
|
offset = 0;
|
||||||
|
} else {
|
||||||
memset(iov[i].iov_base + (iov_off - iovec_off), fillc, len);
|
offset -= iov[i].iov_len;
|
||||||
|
|
||||||
buf_off += len;
|
|
||||||
iov_off += len;
|
|
||||||
size -= len;
|
|
||||||
}
|
}
|
||||||
iovec_off += iov[i].iov_len;
|
|
||||||
}
|
}
|
||||||
return buf_off;
|
assert(offset == 0);
|
||||||
|
return done;
|
||||||
}
|
}
|
||||||
|
|
||||||
size_t iov_size(const struct iovec *iov, const unsigned int iov_cnt)
|
size_t iov_size(const struct iovec *iov, const unsigned int iov_cnt)
|
||||||
|
12
iov.h
12
iov.h
@ -1,10 +1,11 @@
|
|||||||
/*
|
/*
|
||||||
* Helpers for getting linearized buffers from iov / filling buffers into iovs
|
* Helpers for using (partial) iovecs.
|
||||||
*
|
*
|
||||||
* Copyright (C) 2010 Red Hat, Inc.
|
* Copyright (C) 2010 Red Hat, Inc.
|
||||||
*
|
*
|
||||||
* Author(s):
|
* Author(s):
|
||||||
* Amit Shah <amit.shah@redhat.com>
|
* Amit Shah <amit.shah@redhat.com>
|
||||||
|
* Michael Tokarev <mjt@tls.msk.ru>
|
||||||
*
|
*
|
||||||
* This work is licensed under the terms of the GNU GPL, version 2. See
|
* This work is licensed under the terms of the GNU GPL, version 2. See
|
||||||
* the COPYING file in the top-level directory.
|
* the COPYING file in the top-level directory.
|
||||||
@ -28,6 +29,12 @@ size_t iov_size(const struct iovec *iov, const unsigned int iov_cnt);
|
|||||||
* only part of data will be copied, up to the end of the iovec.
|
* only part of data will be copied, up to the end of the iovec.
|
||||||
* Number of bytes actually copied will be returned, which is
|
* Number of bytes actually copied will be returned, which is
|
||||||
* min(bytes, iov_size(iov)-offset)
|
* min(bytes, iov_size(iov)-offset)
|
||||||
|
* `Offset' must point to the inside of iovec.
|
||||||
|
* It is okay to use very large value for `bytes' since we're
|
||||||
|
* limited by the size of the iovec anyway, provided that the
|
||||||
|
* buffer pointed to by buf has enough space. One possible
|
||||||
|
* such "large" value is -1 (sinice size_t is unsigned),
|
||||||
|
* so specifying `-1' as `bytes' means 'up to the end of iovec'.
|
||||||
*/
|
*/
|
||||||
size_t iov_from_buf(struct iovec *iov, unsigned int iov_cnt,
|
size_t iov_from_buf(struct iovec *iov, unsigned int iov_cnt,
|
||||||
size_t offset, const void *buf, size_t bytes);
|
size_t offset, const void *buf, size_t bytes);
|
||||||
@ -37,11 +44,12 @@ size_t iov_to_buf(const struct iovec *iov, const unsigned int iov_cnt,
|
|||||||
/**
|
/**
|
||||||
* Set data bytes pointed out by iovec `iov' of size `iov_cnt' elements,
|
* Set data bytes pointed out by iovec `iov' of size `iov_cnt' elements,
|
||||||
* starting at byte offset `start', to value `fillc', repeating it
|
* starting at byte offset `start', to value `fillc', repeating it
|
||||||
* `bytes' number of times.
|
* `bytes' number of times. `Offset' must point to the inside of iovec.
|
||||||
* If `bytes' is large enough, only last bytes portion of iovec,
|
* If `bytes' is large enough, only last bytes portion of iovec,
|
||||||
* up to the end of it, will be filled with the specified value.
|
* up to the end of it, will be filled with the specified value.
|
||||||
* Function return actual number of bytes processed, which is
|
* Function return actual number of bytes processed, which is
|
||||||
* min(size, iov_size(iov) - offset).
|
* min(size, iov_size(iov) - offset).
|
||||||
|
* Again, it is okay to use large value for `bytes' to mean "up to the end".
|
||||||
*/
|
*/
|
||||||
size_t iov_memset(const struct iovec *iov, const unsigned int iov_cnt,
|
size_t iov_memset(const struct iovec *iov, const unsigned int iov_cnt,
|
||||||
size_t offset, int fillc, size_t bytes);
|
size_t offset, int fillc, size_t bytes);
|
||||||
|
@ -13,6 +13,7 @@ check-unit-y += tests/test-qmp-commands$(EXESUF)
|
|||||||
check-unit-y += tests/test-string-input-visitor$(EXESUF)
|
check-unit-y += tests/test-string-input-visitor$(EXESUF)
|
||||||
check-unit-y += tests/test-string-output-visitor$(EXESUF)
|
check-unit-y += tests/test-string-output-visitor$(EXESUF)
|
||||||
check-unit-y += tests/test-coroutine$(EXESUF)
|
check-unit-y += tests/test-coroutine$(EXESUF)
|
||||||
|
check-unit-y += tests/test-iov$(EXESUF)
|
||||||
|
|
||||||
check-block-$(CONFIG_POSIX) += tests/qemu-iotests-quick.sh
|
check-block-$(CONFIG_POSIX) += tests/qemu-iotests-quick.sh
|
||||||
|
|
||||||
@ -47,6 +48,7 @@ tests/check-qlist$(EXESUF): tests/check-qlist.o qlist.o qint.o $(tools-obj-y)
|
|||||||
tests/check-qfloat$(EXESUF): tests/check-qfloat.o qfloat.o $(tools-obj-y)
|
tests/check-qfloat$(EXESUF): tests/check-qfloat.o qfloat.o $(tools-obj-y)
|
||||||
tests/check-qjson$(EXESUF): tests/check-qjson.o $(qobject-obj-y) $(tools-obj-y)
|
tests/check-qjson$(EXESUF): tests/check-qjson.o $(qobject-obj-y) $(tools-obj-y)
|
||||||
tests/test-coroutine$(EXESUF): tests/test-coroutine.o $(coroutine-obj-y) $(tools-obj-y)
|
tests/test-coroutine$(EXESUF): tests/test-coroutine.o $(coroutine-obj-y) $(tools-obj-y)
|
||||||
|
tests/test-iov$(EXESUF): tests/test-iov.o iov.o
|
||||||
|
|
||||||
tests/test-qapi-types.c tests/test-qapi-types.h :\
|
tests/test-qapi-types.c tests/test-qapi-types.h :\
|
||||||
$(SRC_PATH)/qapi-schema-test.json $(SRC_PATH)/scripts/qapi-types.py
|
$(SRC_PATH)/qapi-schema-test.json $(SRC_PATH)/scripts/qapi-types.py
|
||||||
|
153
tests/test-iov.c
Normal file
153
tests/test-iov.c
Normal file
@ -0,0 +1,153 @@
|
|||||||
|
#include <glib.h>
|
||||||
|
#include "qemu-common.h"
|
||||||
|
#include "iov.h"
|
||||||
|
|
||||||
|
/* create a randomly-sized iovec with random vectors */
|
||||||
|
static void iov_random(struct iovec **iovp, unsigned *iov_cntp)
|
||||||
|
{
|
||||||
|
unsigned niov = g_test_rand_int_range(3,8);
|
||||||
|
struct iovec *iov = g_malloc(niov * sizeof(*iov));
|
||||||
|
unsigned i;
|
||||||
|
for (i = 0; i < niov; ++i) {
|
||||||
|
iov[i].iov_len = g_test_rand_int_range(5,20);
|
||||||
|
iov[i].iov_base = g_malloc(iov[i].iov_len);
|
||||||
|
}
|
||||||
|
*iovp = iov;
|
||||||
|
*iov_cntp = niov;
|
||||||
|
}
|
||||||
|
|
||||||
|
static void iov_free(struct iovec *iov, unsigned niov)
|
||||||
|
{
|
||||||
|
unsigned i;
|
||||||
|
for (i = 0; i < niov; ++i) {
|
||||||
|
g_free(iov[i].iov_base);
|
||||||
|
}
|
||||||
|
g_free(iov);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void test_iov_bytes(struct iovec *iov, unsigned niov,
|
||||||
|
size_t offset, size_t bytes)
|
||||||
|
{
|
||||||
|
unsigned i;
|
||||||
|
size_t j, o;
|
||||||
|
unsigned char *b;
|
||||||
|
o = 0;
|
||||||
|
|
||||||
|
/* we walk over all elements, */
|
||||||
|
for (i = 0; i < niov; ++i) {
|
||||||
|
b = iov[i].iov_base;
|
||||||
|
/* over each char of each element, */
|
||||||
|
for (j = 0; j < iov[i].iov_len; ++j) {
|
||||||
|
/* counting each of them and
|
||||||
|
* verifying that the ones within [offset,offset+bytes)
|
||||||
|
* range are equal to the position number (o) */
|
||||||
|
if (o >= offset && o < offset + bytes) {
|
||||||
|
g_assert(b[j] == (o & 255));
|
||||||
|
} else {
|
||||||
|
g_assert(b[j] == 0xff);
|
||||||
|
}
|
||||||
|
++o;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static void test_to_from_buf_1(void)
|
||||||
|
{
|
||||||
|
unsigned niov;
|
||||||
|
struct iovec *iov;
|
||||||
|
size_t sz;
|
||||||
|
unsigned char *ibuf, *obuf;
|
||||||
|
unsigned i, j, n;
|
||||||
|
|
||||||
|
iov_random(&iov, &niov);
|
||||||
|
|
||||||
|
sz = iov_size(iov, niov);
|
||||||
|
|
||||||
|
ibuf = g_malloc(sz + 8) + 4;
|
||||||
|
memcpy(ibuf-4, "aaaa", 4); memcpy(ibuf + sz, "bbbb", 4);
|
||||||
|
obuf = g_malloc(sz + 8) + 4;
|
||||||
|
memcpy(obuf-4, "xxxx", 4); memcpy(obuf + sz, "yyyy", 4);
|
||||||
|
|
||||||
|
/* fill in ibuf with 0123456... */
|
||||||
|
for (i = 0; i < sz; ++i) {
|
||||||
|
ibuf[i] = i & 255;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 0; i <= sz; ++i) {
|
||||||
|
|
||||||
|
/* Test from/to buf for offset(i) in [0..sz] up to the end of buffer.
|
||||||
|
* For last iteration with offset == sz, the procedure should
|
||||||
|
* skip whole vector and process exactly 0 bytes */
|
||||||
|
|
||||||
|
/* first set bytes [i..sz) to some "random" value */
|
||||||
|
n = iov_memset(iov, niov, 0, 0xff, -1);
|
||||||
|
g_assert(n == sz);
|
||||||
|
|
||||||
|
/* next copy bytes [i..sz) from ibuf to iovec */
|
||||||
|
n = iov_from_buf(iov, niov, i, ibuf + i, -1);
|
||||||
|
g_assert(n == sz - i);
|
||||||
|
|
||||||
|
/* clear part of obuf */
|
||||||
|
memset(obuf + i, 0, sz - i);
|
||||||
|
/* and set this part of obuf to values from iovec */
|
||||||
|
n = iov_to_buf(iov, niov, i, obuf + i, -1);
|
||||||
|
g_assert(n == sz - i);
|
||||||
|
|
||||||
|
/* now compare resulting buffers */
|
||||||
|
g_assert(memcmp(ibuf, obuf, sz) == 0);
|
||||||
|
|
||||||
|
/* test just one char */
|
||||||
|
n = iov_to_buf(iov, niov, i, obuf + i, 1);
|
||||||
|
g_assert(n == (i < sz));
|
||||||
|
if (n) {
|
||||||
|
g_assert(obuf[i] == (i & 255));
|
||||||
|
}
|
||||||
|
|
||||||
|
for (j = i; j <= sz; ++j) {
|
||||||
|
/* now test num of bytes cap up to byte no. j,
|
||||||
|
* with j in [i..sz]. */
|
||||||
|
|
||||||
|
/* clear iovec */
|
||||||
|
n = iov_memset(iov, niov, 0, 0xff, -1);
|
||||||
|
g_assert(n == sz);
|
||||||
|
|
||||||
|
/* copy bytes [i..j) from ibuf to iovec */
|
||||||
|
n = iov_from_buf(iov, niov, i, ibuf + i, j - i);
|
||||||
|
g_assert(n == j - i);
|
||||||
|
|
||||||
|
/* clear part of obuf */
|
||||||
|
memset(obuf + i, 0, j - i);
|
||||||
|
|
||||||
|
/* copy bytes [i..j) from iovec to obuf */
|
||||||
|
n = iov_to_buf(iov, niov, i, obuf + i, j - i);
|
||||||
|
g_assert(n == j - i);
|
||||||
|
|
||||||
|
/* verify result */
|
||||||
|
g_assert(memcmp(ibuf, obuf, sz) == 0);
|
||||||
|
|
||||||
|
/* now actually check if the iovec contains the right data */
|
||||||
|
test_iov_bytes(iov, niov, i, j - i);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
g_assert(!memcmp(ibuf-4, "aaaa", 4) && !memcmp(ibuf+sz, "bbbb", 4));
|
||||||
|
g_free(ibuf-4);
|
||||||
|
g_assert(!memcmp(obuf-4, "xxxx", 4) && !memcmp(obuf+sz, "yyyy", 4));
|
||||||
|
g_free(obuf-4);
|
||||||
|
iov_free(iov, niov);
|
||||||
|
}
|
||||||
|
|
||||||
|
static void test_to_from_buf(void)
|
||||||
|
{
|
||||||
|
int x;
|
||||||
|
for (x = 0; x < 4; ++x) {
|
||||||
|
test_to_from_buf_1();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int main(int argc, char **argv)
|
||||||
|
{
|
||||||
|
g_test_init(&argc, &argv, NULL);
|
||||||
|
g_test_rand_int();
|
||||||
|
g_test_add_func("/basic/iov/from-to-buf", test_to_from_buf);
|
||||||
|
return g_test_run();
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user