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
|
/*
* Copyright (c) 2021 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <gtest/gtest.h>
#include <gmock/gmock.h>
extern "C"
{
#include <hicn/interest_manifest.h>
}
static constexpr hicn_uword WORD_SIZE = WORD_WIDTH;
class InterestManifestTest : public ::testing::Test
{
protected:
static constexpr u32 n_suffixes = 0x00000014 + 1;
static constexpr u32 padding = 0x21232425;
static constexpr hicn_uword bitmap_word = ~0ULL;
static inline std::vector<uint32_t> values = { 10, 22, 23, 43, 54, 65, 66,
4, 33, 2, 44, 99, 87, 67,
78, 98, 76, 1, 7, 123 };
InterestManifestTest () {}
virtual ~InterestManifestTest () {}
uint8_t buffer[512];
hicn_uword bitmap_saved[BITMAP_SIZE];
};
TEST_F (InterestManifestTest, OneWordBitmapUpdate)
{
hicn_uword initial_bitmap[1];
hicn_uword curr_bitmap[1] = { 0 };
initial_bitmap[0] =
0x0000000000000b07; // ...000000000000000000000101100000111
// Consume first 4 'one' bits (i.e. suffixes), reaching position 9
size_t pos = 0, max_suffixes = 4;
pos = interest_manifest_update_bitmap (initial_bitmap, curr_bitmap, pos,
WORD_SIZE, max_suffixes);
EXPECT_EQ (pos, std::size_t (9));
EXPECT_EQ (curr_bitmap[0], hicn_uword (0x0000000000000107));
// Consume the remaining 2 'one' bits, reaching end of bitmap
hicn_uword curr_bitmap2[1] = { 0 };
pos = interest_manifest_update_bitmap (initial_bitmap, curr_bitmap2, pos,
WORD_SIZE, max_suffixes);
EXPECT_EQ (pos, WORD_SIZE);
EXPECT_EQ (curr_bitmap2[0], hicn_uword (0x00000a00));
// Consume all suffixes at once
hicn_uword curr_bitmap3[1] = { 0 };
max_suffixes = 16;
pos = interest_manifest_update_bitmap (initial_bitmap, curr_bitmap3, 0,
WORD_SIZE, max_suffixes);
EXPECT_EQ (pos, WORD_SIZE);
EXPECT_EQ (curr_bitmap3[0], initial_bitmap[0]);
}
TEST_F (InterestManifestTest, TwoWordBitmapUpdate)
{
hicn_uword initial_bitmap[2];
initial_bitmap[0] = 0x0000000000000b07;
initial_bitmap[1] = 0x0000000000000b07;
// -> 0000000000000000000010110000011100000000000000000000101100000111
int expected_pos[] = { WORD_SIZE + 2, 2 * WORD_SIZE };
u32 expected_bitmap[][2] = { { 0x00000b07, 0x00000003 },
{ 0x0, 0x00000b04 } };
// Loop to consume all suffixes
int pos = 0, max_suffixes = 8, i = 0, len = WORD_SIZE * 2;
while (pos != len)
{
hicn_uword curr_bitmap[2] = { 0 };
pos = interest_manifest_update_bitmap (initial_bitmap, curr_bitmap, pos,
len, max_suffixes);
EXPECT_EQ (pos, expected_pos[i]);
EXPECT_EQ (curr_bitmap[0], expected_bitmap[i][0]);
EXPECT_EQ (curr_bitmap[1], expected_bitmap[i][1]);
i++;
}
}
TEST_F (InterestManifestTest, SerializeDeserialize)
{
#if hicn_uword_bits == 64
#define F(x) hicn_host_to_net_64 (x)
#elif hicn_uword_bits == 32
#define F(x) hicn_host_to_net_32 (x)
#else
#error "Unrecognized architecture"
#endif
auto header = reinterpret_cast<interest_manifest_header_t *> (buffer);
interest_manifest_init (header, 0);
for (const auto &v : values)
{
interest_manifest_add_suffix (header, v);
}
EXPECT_EQ (header->n_suffixes, n_suffixes);
// Save bitmap
memcpy (bitmap_saved, header->request_bitmap, sizeof (bitmap_saved));
// Serialize manifest
interest_manifest_serialize (header);
// If architecture is little endian, bytes should be now swapped
EXPECT_THAT (header->n_suffixes, ::testing::Eq (hicn_host_to_net_32 (
n_suffixes) /* 0x14000000 */));
for (unsigned i = 0; i < BITMAP_SIZE; i++)
{
EXPECT_THAT (header->request_bitmap[i],
::testing::Eq (F (bitmap_saved[i])));
}
hicn_name_suffix_t *suffix = (hicn_name_suffix_t *) (header + 1);
for (unsigned i = 0; i < n_suffixes; i++)
{
if (i == 0)
{
EXPECT_THAT (*(suffix + i), ::testing::Eq (hicn_name_suffix_t (0)));
}
else
{
EXPECT_THAT (*(suffix + i),
::testing::Eq (hicn_host_to_net_32 (values[i - 1])));
}
}
// Deserialize manifest
interest_manifest_deserialize (header);
// Bytes should now be as before
EXPECT_THAT (header->n_suffixes, ::testing::Eq (n_suffixes));
int i = 0;
int pos;
interest_manifest_foreach_suffix (header, suffix, pos)
{
if (pos == 0)
{
EXPECT_THAT (*suffix, ::testing::Eq (hicn_name_suffix_t (0)));
}
else
{
EXPECT_THAT (*suffix, ::testing::Eq (values[i]));
i++;
}
}
}
TEST_F (InterestManifestTest, ForEach)
{
int pos;
hicn_name_suffix_t *suffix = nullptr;
auto header = reinterpret_cast<interest_manifest_header_t *> (buffer);
interest_manifest_init (header, 0);
for (const auto &v : values)
{
interest_manifest_add_suffix (header, v);
}
// Iterate over interest manifest. bBbitmap should be all 1, we should be
// able to iterate over all suffixes.
interest_manifest_foreach_suffix (header, suffix, pos)
{
if (pos == 0)
{
EXPECT_EQ (*suffix, hicn_name_suffix_t (0));
}
else
{
EXPECT_EQ (*suffix, values[pos - 1]);
}
}
std::set<uint32_t> set_values (values.begin (), values.end ());
// Unset few bitmap positions
interest_manifest_del_suffix (header, 5 + 1);
set_values.erase (values[5]);
interest_manifest_del_suffix (header, 6 + 1);
set_values.erase (values[6]);
interest_manifest_del_suffix (header, 12 + 1);
set_values.erase (values[12]);
interest_manifest_del_suffix (header, 17 + 1);
set_values.erase (values[17]);
// Iterate over interest manifest and remove elements in manifest from set.
// The set should be empty at the end.
interest_manifest_foreach_suffix (header, suffix, pos)
{
if (pos > 0)
{
EXPECT_TRUE (set_values.find (*suffix) != set_values.end ())
<< "The value was " << *suffix;
set_values.erase (*suffix);
}
}
EXPECT_TRUE (set_values.empty ());
}
|
