1*84e872a0SLloyd Pique /*
2*84e872a0SLloyd Pique * Copyright © 2012 Intel Corporation
3*84e872a0SLloyd Pique *
4*84e872a0SLloyd Pique * Permission is hereby granted, free of charge, to any person obtaining
5*84e872a0SLloyd Pique * a copy of this software and associated documentation files (the
6*84e872a0SLloyd Pique * "Software"), to deal in the Software without restriction, including
7*84e872a0SLloyd Pique * without limitation the rights to use, copy, modify, merge, publish,
8*84e872a0SLloyd Pique * distribute, sublicense, and/or sell copies of the Software, and to
9*84e872a0SLloyd Pique * permit persons to whom the Software is furnished to do so, subject to
10*84e872a0SLloyd Pique * the following conditions:
11*84e872a0SLloyd Pique *
12*84e872a0SLloyd Pique * The above copyright notice and this permission notice (including the
13*84e872a0SLloyd Pique * next paragraph) shall be included in all copies or substantial
14*84e872a0SLloyd Pique * portions of the Software.
15*84e872a0SLloyd Pique *
16*84e872a0SLloyd Pique * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
17*84e872a0SLloyd Pique * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
18*84e872a0SLloyd Pique * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
19*84e872a0SLloyd Pique * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
20*84e872a0SLloyd Pique * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
21*84e872a0SLloyd Pique * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
22*84e872a0SLloyd Pique * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
23*84e872a0SLloyd Pique * SOFTWARE.
24*84e872a0SLloyd Pique */
25*84e872a0SLloyd Pique
26*84e872a0SLloyd Pique #include <stdlib.h>
27*84e872a0SLloyd Pique #include <assert.h>
28*84e872a0SLloyd Pique #include <string.h>
29*84e872a0SLloyd Pique #include "wayland-util.h"
30*84e872a0SLloyd Pique #include "wayland-private.h"
31*84e872a0SLloyd Pique #include "test-runner.h"
32*84e872a0SLloyd Pique
TEST(array_init)33*84e872a0SLloyd Pique TEST(array_init)
34*84e872a0SLloyd Pique {
35*84e872a0SLloyd Pique struct wl_array array;
36*84e872a0SLloyd Pique
37*84e872a0SLloyd Pique /* fill with garbage to emulate uninitialized memory */
38*84e872a0SLloyd Pique memset(&array, 0x57, sizeof array);
39*84e872a0SLloyd Pique
40*84e872a0SLloyd Pique wl_array_init(&array);
41*84e872a0SLloyd Pique assert(array.size == 0);
42*84e872a0SLloyd Pique assert(array.alloc == 0);
43*84e872a0SLloyd Pique assert(array.data == 0);
44*84e872a0SLloyd Pique }
45*84e872a0SLloyd Pique
TEST(array_release)46*84e872a0SLloyd Pique TEST(array_release)
47*84e872a0SLloyd Pique {
48*84e872a0SLloyd Pique struct wl_array array;
49*84e872a0SLloyd Pique void *ptr;
50*84e872a0SLloyd Pique
51*84e872a0SLloyd Pique wl_array_init(&array);
52*84e872a0SLloyd Pique ptr = wl_array_add(&array, 1);
53*84e872a0SLloyd Pique assert(ptr != NULL);
54*84e872a0SLloyd Pique assert(array.data != NULL);
55*84e872a0SLloyd Pique
56*84e872a0SLloyd Pique wl_array_release(&array);
57*84e872a0SLloyd Pique assert(array.data == WL_ARRAY_POISON_PTR);
58*84e872a0SLloyd Pique }
59*84e872a0SLloyd Pique
TEST(array_add)60*84e872a0SLloyd Pique TEST(array_add)
61*84e872a0SLloyd Pique {
62*84e872a0SLloyd Pique struct mydata {
63*84e872a0SLloyd Pique unsigned int a;
64*84e872a0SLloyd Pique unsigned int b;
65*84e872a0SLloyd Pique double c;
66*84e872a0SLloyd Pique double d;
67*84e872a0SLloyd Pique };
68*84e872a0SLloyd Pique
69*84e872a0SLloyd Pique const unsigned int iterations = 1321; /* this is arbitrary */
70*84e872a0SLloyd Pique const int datasize = sizeof(struct mydata);
71*84e872a0SLloyd Pique struct wl_array array;
72*84e872a0SLloyd Pique size_t i;
73*84e872a0SLloyd Pique
74*84e872a0SLloyd Pique wl_array_init(&array);
75*84e872a0SLloyd Pique
76*84e872a0SLloyd Pique /* add some data */
77*84e872a0SLloyd Pique for (i = 0; i < iterations; i++) {
78*84e872a0SLloyd Pique struct mydata* ptr = wl_array_add(&array, datasize);
79*84e872a0SLloyd Pique assert(ptr);
80*84e872a0SLloyd Pique assert((i + 1) * datasize == array.size);
81*84e872a0SLloyd Pique
82*84e872a0SLloyd Pique ptr->a = i * 3;
83*84e872a0SLloyd Pique ptr->b = 20000 - i;
84*84e872a0SLloyd Pique ptr->c = (double)(i);
85*84e872a0SLloyd Pique ptr->d = (double)(i / 2.);
86*84e872a0SLloyd Pique }
87*84e872a0SLloyd Pique
88*84e872a0SLloyd Pique /* verify the data */
89*84e872a0SLloyd Pique for (i = 0; i < iterations; ++i) {
90*84e872a0SLloyd Pique struct mydata* check = (struct mydata*)array.data + i;
91*84e872a0SLloyd Pique
92*84e872a0SLloyd Pique assert(check->a == i * 3);
93*84e872a0SLloyd Pique assert(check->b == 20000 - i);
94*84e872a0SLloyd Pique assert(check->c == (double)(i));
95*84e872a0SLloyd Pique assert(check->d == (double)(i/2.));
96*84e872a0SLloyd Pique }
97*84e872a0SLloyd Pique
98*84e872a0SLloyd Pique wl_array_release(&array);
99*84e872a0SLloyd Pique }
100*84e872a0SLloyd Pique
TEST(array_copy)101*84e872a0SLloyd Pique TEST(array_copy)
102*84e872a0SLloyd Pique {
103*84e872a0SLloyd Pique const int iterations = 1529; /* this is arbitrary */
104*84e872a0SLloyd Pique struct wl_array source;
105*84e872a0SLloyd Pique struct wl_array copy;
106*84e872a0SLloyd Pique int i;
107*84e872a0SLloyd Pique
108*84e872a0SLloyd Pique wl_array_init(&source);
109*84e872a0SLloyd Pique
110*84e872a0SLloyd Pique /* add some data */
111*84e872a0SLloyd Pique for (i = 0; i < iterations; i++) {
112*84e872a0SLloyd Pique int *p = wl_array_add(&source, sizeof(int));
113*84e872a0SLloyd Pique assert(p);
114*84e872a0SLloyd Pique *p = i * 2 + i;
115*84e872a0SLloyd Pique }
116*84e872a0SLloyd Pique
117*84e872a0SLloyd Pique /* copy the array */
118*84e872a0SLloyd Pique wl_array_init(©);
119*84e872a0SLloyd Pique wl_array_copy(©, &source);
120*84e872a0SLloyd Pique
121*84e872a0SLloyd Pique /* check the copy */
122*84e872a0SLloyd Pique for (i = 0; i < iterations; i++) {
123*84e872a0SLloyd Pique int *s = (int *)source.data + i;
124*84e872a0SLloyd Pique int *c = (int *)copy.data + i;
125*84e872a0SLloyd Pique
126*84e872a0SLloyd Pique assert(*s == *c); /* verify the values are the same */
127*84e872a0SLloyd Pique assert(s != c); /* ensure the addresses aren't the same */
128*84e872a0SLloyd Pique assert(*s == i * 2 + i); /* sanity check */
129*84e872a0SLloyd Pique }
130*84e872a0SLloyd Pique
131*84e872a0SLloyd Pique wl_array_release(&source);
132*84e872a0SLloyd Pique wl_array_release(©);
133*84e872a0SLloyd Pique }
134*84e872a0SLloyd Pique
TEST(array_for_each)135*84e872a0SLloyd Pique TEST(array_for_each)
136*84e872a0SLloyd Pique {
137*84e872a0SLloyd Pique static const int elements[] = { 77, 12, 45192, 53280, 334455 };
138*84e872a0SLloyd Pique struct wl_array array;
139*84e872a0SLloyd Pique int *p;
140*84e872a0SLloyd Pique int i;
141*84e872a0SLloyd Pique
142*84e872a0SLloyd Pique wl_array_init(&array);
143*84e872a0SLloyd Pique for (i = 0; i < 5; i++) {
144*84e872a0SLloyd Pique p = wl_array_add(&array, sizeof *p);
145*84e872a0SLloyd Pique assert(p);
146*84e872a0SLloyd Pique *p = elements[i];
147*84e872a0SLloyd Pique }
148*84e872a0SLloyd Pique
149*84e872a0SLloyd Pique i = 0;
150*84e872a0SLloyd Pique wl_array_for_each(p, &array) {
151*84e872a0SLloyd Pique assert(*p == elements[i]);
152*84e872a0SLloyd Pique i++;
153*84e872a0SLloyd Pique }
154*84e872a0SLloyd Pique assert(i == 5);
155*84e872a0SLloyd Pique
156*84e872a0SLloyd Pique wl_array_release(&array);
157*84e872a0SLloyd Pique }
158