1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
|
/*
*
* Copyright 2014, Google Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
#include <grpc/support/slice.h>
#include <string.h>
#include <grpc/support/log.h>
#include "test/core/util/test_config.h"
#define LOG_TEST_NAME() gpr_log(GPR_INFO, "%s", __FUNCTION__);
static void test_slice_malloc_returns_something_sensible() {
/* Calls gpr_slice_create for various lengths and verifies the internals for
consistency. */
size_t length;
size_t i;
gpr_slice slice;
LOG_TEST_NAME();
for (length = 0; length <= 1024; length++) {
slice = gpr_slice_malloc(length);
/* If there is a length, slice.data must be non-NULL. If length is zero
we don't care. */
if (length) {
GPR_ASSERT(GPR_SLICE_START_PTR(slice));
}
/* Returned slice length must be what was requested. */
GPR_ASSERT(GPR_SLICE_LENGTH(slice) == length);
/* If the slice has a refcount, it must be destroyable. */
if (slice.refcount) {
GPR_ASSERT(slice.refcount->ref != NULL);
GPR_ASSERT(slice.refcount->unref != NULL);
}
/* We must be able to write to every byte of the data */
for (i = 0; i < length; i++) {
GPR_SLICE_START_PTR(slice)[i] = (char)i;
}
/* And finally we must succeed in destroying the slice */
gpr_slice_unref(slice);
}
}
static void do_nothing(void *ignored) {}
static void test_slice_new_returns_something_sensible() {
gpr_uint8 x;
gpr_slice slice = gpr_slice_new(&x, 1, do_nothing);
GPR_ASSERT(slice.refcount);
GPR_ASSERT(slice.data.refcounted.bytes == &x);
GPR_ASSERT(slice.data.refcounted.length == 1);
gpr_slice_unref(slice);
}
static int do_nothing_with_len_1_calls = 0;
static void do_nothing_with_len_1(void *ignored, size_t len) {
GPR_ASSERT(len == 1);
do_nothing_with_len_1_calls++;
}
static void test_slice_new_with_len_returns_something_sensible() {
gpr_uint8 x;
gpr_slice slice = gpr_slice_new_with_len(&x, 1, do_nothing_with_len_1);
GPR_ASSERT(slice.refcount);
GPR_ASSERT(slice.data.refcounted.bytes == &x);
GPR_ASSERT(slice.data.refcounted.length == 1);
GPR_ASSERT(do_nothing_with_len_1_calls == 0);
gpr_slice_unref(slice);
GPR_ASSERT(do_nothing_with_len_1_calls == 1);
}
static void test_slice_sub_works(int length) {
gpr_slice slice;
gpr_slice sub;
int i, j, k;
LOG_TEST_NAME();
gpr_log(GPR_INFO, "length=%d", length);
/* Create a slice in which each byte is equal to the distance from it to the
beginning of the slice. */
slice = gpr_slice_malloc(length);
for (i = 0; i < length; i++) {
GPR_SLICE_START_PTR(slice)[i] = i;
}
/* Ensure that for all subsets length is correct and that we start on the
correct byte. Additionally check that no copies were made. */
for (i = 0; i < length; i++) {
for (j = i; j < length; j++) {
sub = gpr_slice_sub(slice, i, j);
GPR_ASSERT(GPR_SLICE_LENGTH(sub) == j - i);
for (k = 0; k < j - i; k++) {
GPR_ASSERT(GPR_SLICE_START_PTR(sub)[k] == (gpr_uint8)(i + k));
}
gpr_slice_unref(sub);
}
}
gpr_slice_unref(slice);
}
static void check_head_tail(gpr_slice slice, gpr_slice head, gpr_slice tail) {
GPR_ASSERT(GPR_SLICE_LENGTH(slice) ==
GPR_SLICE_LENGTH(head) + GPR_SLICE_LENGTH(tail));
GPR_ASSERT(0 == memcmp(GPR_SLICE_START_PTR(slice), GPR_SLICE_START_PTR(head),
GPR_SLICE_LENGTH(head)));
GPR_ASSERT(0 == memcmp(GPR_SLICE_START_PTR(slice) + GPR_SLICE_LENGTH(head),
GPR_SLICE_START_PTR(tail), GPR_SLICE_LENGTH(tail)));
}
static void test_slice_split_head_works(int length) {
gpr_slice slice;
gpr_slice head, tail;
int i;
LOG_TEST_NAME();
gpr_log(GPR_INFO, "length=%d", length);
/* Create a slice in which each byte is equal to the distance from it to the
beginning of the slice. */
slice = gpr_slice_malloc(length);
for (i = 0; i < length; i++) {
GPR_SLICE_START_PTR(slice)[i] = i;
}
/* Ensure that for all subsets length is correct and that we start on the
correct byte. Additionally check that no copies were made. */
for (i = 0; i < length; i++) {
tail = gpr_slice_ref(slice);
head = gpr_slice_split_head(&tail, i);
check_head_tail(slice, head, tail);
gpr_slice_unref(tail);
gpr_slice_unref(head);
}
gpr_slice_unref(slice);
}
static void test_slice_split_tail_works(int length) {
gpr_slice slice;
gpr_slice head, tail;
int i;
LOG_TEST_NAME();
gpr_log(GPR_INFO, "length=%d", length);
/* Create a slice in which each byte is equal to the distance from it to the
beginning of the slice. */
slice = gpr_slice_malloc(length);
for (i = 0; i < length; i++) {
GPR_SLICE_START_PTR(slice)[i] = i;
}
/* Ensure that for all subsets length is correct and that we start on the
correct byte. Additionally check that no copies were made. */
for (i = 0; i < length; i++) {
head = gpr_slice_ref(slice);
tail = gpr_slice_split_tail(&head, i);
check_head_tail(slice, head, tail);
gpr_slice_unref(tail);
gpr_slice_unref(head);
}
gpr_slice_unref(slice);
}
static void test_slice_from_copied_string_works() {
static const char *text = "HELLO WORLD!";
gpr_slice slice;
LOG_TEST_NAME();
slice = gpr_slice_from_copied_string(text);
GPR_ASSERT(strlen(text) == GPR_SLICE_LENGTH(slice));
GPR_ASSERT(0 ==
memcmp(text, GPR_SLICE_START_PTR(slice), GPR_SLICE_LENGTH(slice)));
gpr_slice_unref(slice);
}
int main(int argc, char **argv) {
int length;
grpc_test_init(argc, argv);
test_slice_malloc_returns_something_sensible();
test_slice_new_returns_something_sensible();
test_slice_new_with_len_returns_something_sensible();
for (length = 0; length < 128; length++) {
test_slice_sub_works(length);
test_slice_split_head_works(length);
test_slice_split_tail_works(length);
}
test_slice_from_copied_string_works();
return 0;
}
|
