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
|
/*
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License").
* You may not use this file except in compliance with the License.
* A copy of the License is located at
*
* http://aws.amazon.com/apache2.0
*
* or in the "license" file accompanying this file. This file 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 "utils/s2n_map.h"
#include <string.h>
#include "api/s2n.h"
#include "s2n_test.h"
#define TEST_VALUE_COUNT 8192
int main(int argc, char **argv)
{
char keystr[sizeof("ffff")];
char valstr[sizeof("16384")];
uint32_t size = 0;
struct s2n_map *empty, *map;
struct s2n_blob key = { 0 };
struct s2n_blob val = { 0 };
bool key_found;
BEGIN_TEST();
EXPECT_SUCCESS(s2n_disable_tls13_in_test());
EXPECT_NOT_NULL(empty = s2n_map_new());
EXPECT_OK(s2n_map_size(empty, &size));
EXPECT_EQUAL(size, 0);
/* Try a lookup on an empty map. Expect an error because the map is still mutable. */
EXPECT_SUCCESS(snprintf(keystr, sizeof(keystr), "%04x", 1234));
key.data = (void *) keystr;
key.size = strlen(keystr) + 1;
EXPECT_ERROR(s2n_map_lookup(empty, &key, &val, &key_found));
EXPECT_SUCCESS(snprintf(valstr, sizeof(valstr), "%05d", 1234));
val.data = (void *) valstr;
val.size = strlen(valstr) + 1;
/* Try to add/put key with zero-size data. Expect failures */
key.size = 0;
EXPECT_ERROR(s2n_map_add(empty, &key, &val));
EXPECT_ERROR(s2n_map_put(empty, &key, &val));
key.size = strlen(keystr) + 1;
/* Make the empty map complete */
EXPECT_OK(s2n_map_complete(empty));
/* Lookup and expect no result */
EXPECT_OK(s2n_map_lookup(empty, &key, &val, &key_found));
EXPECT_EQUAL(key_found, false);
/* Done with the empty map */
EXPECT_OK(s2n_map_free(empty));
/* Expect failure since initial map size is zero */
EXPECT_NULL(map = s2n_map_new_with_initial_capacity(0));
/* Create map with the smallest initial size */
EXPECT_NOT_NULL(map = s2n_map_new_with_initial_capacity(1));
/* Insert 8k key value pairs of the form hex(i) -> dec(i) */
for (int i = 0; i < TEST_VALUE_COUNT; i++) {
EXPECT_SUCCESS(snprintf(keystr, sizeof(keystr), "%04x", i));
EXPECT_SUCCESS(snprintf(valstr, sizeof(valstr), "%05d", i));
key.data = (void *) keystr;
key.size = strlen(keystr) + 1;
val.data = (void *) valstr;
val.size = strlen(valstr) + 1;
EXPECT_OK(s2n_map_add(map, &key, &val));
}
EXPECT_OK(s2n_map_size(map, &size));
EXPECT_EQUAL(size, TEST_VALUE_COUNT);
/* Try adding some duplicates */
for (int i = 0; i < 10; i++) {
EXPECT_SUCCESS(snprintf(keystr, sizeof(keystr), "%04x", i));
EXPECT_SUCCESS(snprintf(valstr, sizeof(valstr), "%05d", i));
key.data = (void *) keystr;
key.size = strlen(keystr) + 1;
val.data = (void *) valstr;
val.size = strlen(valstr) + 1;
EXPECT_ERROR(s2n_map_add(map, &key, &val));
}
EXPECT_OK(s2n_map_size(map, &size));
EXPECT_EQUAL(size, TEST_VALUE_COUNT);
/* Try replacing some entries */
for (int i = 0; i < 10; i++) {
EXPECT_SUCCESS(snprintf(keystr, sizeof(keystr), "%04x", i));
EXPECT_SUCCESS(snprintf(valstr, sizeof(valstr), "%05d", i + 1));
key.data = (void *) keystr;
key.size = strlen(keystr) + 1;
val.data = (void *) valstr;
val.size = strlen(valstr) + 1;
EXPECT_OK(s2n_map_put(map, &key, &val));
}
/* Try a lookup before the map is complete: should fail */
EXPECT_SUCCESS(snprintf(keystr, sizeof(keystr), "%04x", 1));
EXPECT_ERROR(s2n_map_lookup(map, &key, &val, &key_found));
/* Make the map complete */
EXPECT_OK(s2n_map_complete(map));
/* Make sure that add-after-complete fails */
EXPECT_SUCCESS(snprintf(keystr, sizeof(keystr), "%04x", TEST_VALUE_COUNT + 1));
EXPECT_SUCCESS(snprintf(valstr, sizeof(valstr), "%05d", TEST_VALUE_COUNT + 1));
key.data = (void *) keystr;
key.size = strlen(keystr) + 1;
val.data = (void *) valstr;
val.size = strlen(valstr) + 1;
EXPECT_ERROR(s2n_map_add(map, &key, &val));
/* Check for equivalence */
for (int i = 0; i < TEST_VALUE_COUNT; i++) {
if (i >= 10) {
EXPECT_SUCCESS(snprintf(keystr, sizeof(keystr), "%04x", i));
EXPECT_SUCCESS(snprintf(valstr, sizeof(valstr), "%05d", i));
} else {
/* The first 10 entries were overwritten with i+1 */
EXPECT_SUCCESS(snprintf(keystr, sizeof(keystr), "%04x", i));
EXPECT_SUCCESS(snprintf(valstr, sizeof(valstr), "%05d", i + 1));
}
key.data = (void *) keystr;
key.size = strlen(keystr) + 1;
EXPECT_OK(s2n_map_lookup(map, &key, &val, &key_found));
EXPECT_EQUAL(key_found, true);
EXPECT_SUCCESS(memcmp(val.data, valstr, strlen(valstr) + 1));
}
/* Check for a key that shouldn't be there */
EXPECT_SUCCESS(snprintf(keystr, sizeof(keystr), "%04x", TEST_VALUE_COUNT + 1));
key.data = (void *) keystr;
key.size = strlen(keystr) + 1;
EXPECT_OK(s2n_map_lookup(map, &key, &val, &key_found));
EXPECT_EQUAL(key_found, false);
/* Make the map mutable */
EXPECT_OK(s2n_map_unlock(map));
/* Make sure that add-after-unlock succeeds */
EXPECT_SUCCESS(snprintf(keystr, sizeof(keystr), "%04x", TEST_VALUE_COUNT + 1));
EXPECT_SUCCESS(snprintf(valstr, sizeof(valstr), "%05d", TEST_VALUE_COUNT + 1));
key.data = (void *) keystr;
key.size = strlen(keystr) + 1;
val.data = (void *) valstr;
val.size = strlen(valstr) + 1;
EXPECT_OK(s2n_map_add(map, &key, &val));
/* Complete the map again */
EXPECT_OK(s2n_map_complete(map));
/* Check the element added after map unlock */
EXPECT_OK(s2n_map_lookup(map, &key, &val, &key_found));
EXPECT_EQUAL(key_found, true);
EXPECT_SUCCESS(memcmp(val.data, valstr, strlen(valstr) + 1));
EXPECT_OK(s2n_map_free(map));
END_TEST();
}
|