2012-03-03 07:03:16 +08:00
|
|
|
/*
|
|
|
|
* Copyright © 2012 Intel Corporation
|
|
|
|
*
|
2015-06-10 17:57:59 +08:00
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining
|
|
|
|
* a copy of this software and associated documentation files (the
|
|
|
|
* "Software"), to deal in the Software without restriction, including
|
|
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
|
|
* distribute, sublicense, and/or sell copies of the Software, and to
|
|
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
|
|
* the following conditions:
|
2012-03-03 07:03:16 +08:00
|
|
|
*
|
2015-06-10 17:57:59 +08:00
|
|
|
* The above copyright notice and this permission notice (including the
|
|
|
|
* next paragraph) shall be included in all copies or substantial
|
|
|
|
* portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
|
|
|
|
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
|
|
|
|
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
|
|
|
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
* SOFTWARE.
|
2012-03-03 07:03:16 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <assert.h>
|
2016-09-28 02:03:50 +08:00
|
|
|
#include <string.h>
|
|
|
|
#include "wayland-util.h"
|
2012-06-16 06:44:28 +08:00
|
|
|
#include "wayland-private.h"
|
2012-03-03 07:03:16 +08:00
|
|
|
#include "test-runner.h"
|
|
|
|
|
|
|
|
TEST(array_init)
|
|
|
|
{
|
2016-09-28 02:03:50 +08:00
|
|
|
struct wl_array array;
|
2012-03-03 07:03:16 +08:00
|
|
|
|
2016-09-28 02:03:50 +08:00
|
|
|
/* fill with garbage to emulate uninitialized memory */
|
|
|
|
memset(&array, 0x57, sizeof array);
|
2012-03-03 07:03:16 +08:00
|
|
|
|
2016-09-28 02:03:50 +08:00
|
|
|
wl_array_init(&array);
|
|
|
|
assert(array.size == 0);
|
|
|
|
assert(array.alloc == 0);
|
|
|
|
assert(array.data == 0);
|
2012-03-03 07:03:16 +08:00
|
|
|
}
|
|
|
|
|
2016-09-28 02:03:49 +08:00
|
|
|
TEST(array_release)
|
|
|
|
{
|
|
|
|
struct wl_array array;
|
|
|
|
void *ptr;
|
|
|
|
|
|
|
|
wl_array_init(&array);
|
|
|
|
ptr = wl_array_add(&array, 1);
|
|
|
|
assert(ptr != NULL);
|
|
|
|
assert(array.data != NULL);
|
|
|
|
|
|
|
|
wl_array_release(&array);
|
|
|
|
assert(array.data == WL_ARRAY_POISON_PTR);
|
|
|
|
}
|
|
|
|
|
2012-03-03 07:03:16 +08:00
|
|
|
TEST(array_add)
|
|
|
|
{
|
|
|
|
struct mydata {
|
2012-04-13 22:11:11 +08:00
|
|
|
unsigned int a;
|
|
|
|
unsigned int b;
|
2012-03-03 07:03:16 +08:00
|
|
|
double c;
|
|
|
|
double d;
|
|
|
|
};
|
|
|
|
|
2012-04-13 22:11:11 +08:00
|
|
|
const unsigned int iterations = 1321; /* this is arbitrary */
|
2012-03-03 07:03:16 +08:00
|
|
|
const int datasize = sizeof(struct mydata);
|
|
|
|
struct wl_array array;
|
2012-04-13 22:11:11 +08:00
|
|
|
size_t i;
|
2012-03-03 07:03:16 +08:00
|
|
|
|
|
|
|
wl_array_init(&array);
|
|
|
|
|
|
|
|
/* add some data */
|
|
|
|
for (i = 0; i < iterations; i++) {
|
|
|
|
struct mydata* ptr = wl_array_add(&array, datasize);
|
2014-01-11 04:17:24 +08:00
|
|
|
assert(ptr);
|
2012-03-03 07:03:16 +08:00
|
|
|
assert((i + 1) * datasize == array.size);
|
|
|
|
|
|
|
|
ptr->a = i * 3;
|
2012-04-13 22:11:11 +08:00
|
|
|
ptr->b = 20000 - i;
|
2012-03-03 07:03:16 +08:00
|
|
|
ptr->c = (double)(i);
|
|
|
|
ptr->d = (double)(i / 2.);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* verify the data */
|
|
|
|
for (i = 0; i < iterations; ++i) {
|
2019-06-02 06:01:23 +08:00
|
|
|
struct mydata* check = (struct mydata*)array.data + i;
|
2012-03-03 07:03:16 +08:00
|
|
|
|
|
|
|
assert(check->a == i * 3);
|
2012-04-13 22:11:11 +08:00
|
|
|
assert(check->b == 20000 - i);
|
2012-03-03 07:03:16 +08:00
|
|
|
assert(check->c == (double)(i));
|
|
|
|
assert(check->d == (double)(i/2.));
|
|
|
|
}
|
|
|
|
|
|
|
|
wl_array_release(&array);
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(array_copy)
|
|
|
|
{
|
|
|
|
const int iterations = 1529; /* this is arbitrary */
|
|
|
|
struct wl_array source;
|
|
|
|
struct wl_array copy;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
wl_array_init(&source);
|
|
|
|
|
|
|
|
/* add some data */
|
|
|
|
for (i = 0; i < iterations; i++) {
|
|
|
|
int *p = wl_array_add(&source, sizeof(int));
|
2014-01-11 04:17:24 +08:00
|
|
|
assert(p);
|
2012-03-03 07:03:16 +08:00
|
|
|
*p = i * 2 + i;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* copy the array */
|
|
|
|
wl_array_init(©);
|
|
|
|
wl_array_copy(©, &source);
|
|
|
|
|
|
|
|
/* check the copy */
|
|
|
|
for (i = 0; i < iterations; i++) {
|
2019-06-02 06:01:23 +08:00
|
|
|
int *s = (int *)source.data + i;
|
|
|
|
int *c = (int *)copy.data + i;
|
2012-03-03 07:03:16 +08:00
|
|
|
|
|
|
|
assert(*s == *c); /* verify the values are the same */
|
|
|
|
assert(s != c); /* ensure the addresses aren't the same */
|
|
|
|
assert(*s == i * 2 + i); /* sanity check */
|
|
|
|
}
|
|
|
|
|
|
|
|
wl_array_release(&source);
|
|
|
|
wl_array_release(©);
|
|
|
|
}
|
2012-03-05 02:40:49 +08:00
|
|
|
|
|
|
|
TEST(array_for_each)
|
|
|
|
{
|
|
|
|
static const int elements[] = { 77, 12, 45192, 53280, 334455 };
|
|
|
|
struct wl_array array;
|
2015-06-20 06:58:01 +08:00
|
|
|
int *p;
|
|
|
|
int i;
|
2012-03-05 02:40:49 +08:00
|
|
|
|
|
|
|
wl_array_init(&array);
|
|
|
|
for (i = 0; i < 5; i++) {
|
|
|
|
p = wl_array_add(&array, sizeof *p);
|
2014-01-11 04:17:24 +08:00
|
|
|
assert(p);
|
2012-03-05 02:40:49 +08:00
|
|
|
*p = elements[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
i = 0;
|
2015-06-20 06:58:01 +08:00
|
|
|
wl_array_for_each(p, &array) {
|
|
|
|
assert(*p == elements[i]);
|
|
|
|
i++;
|
|
|
|
}
|
2012-03-05 02:40:49 +08:00
|
|
|
assert(i == 5);
|
2012-03-24 01:01:23 +08:00
|
|
|
|
|
|
|
wl_array_release(&array);
|
2012-03-05 02:40:49 +08:00
|
|
|
}
|