ref: 8884a77c06867dd9af091afdc1e3d66d4c98dfe1
src/libs/mynewt-nimble/nimble/host/test/src/ble_store_test.c
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 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 |
/* * Licensed to the Apache Software Foundation (ASF) under one * or more contributor license agreements. See the NOTICE file * distributed with this work for additional information * regarding copyright ownership. The ASF licenses this file * to you 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 "testutil/testutil.h" #include "ble_hs_test.h" #include "ble_hs_test_util.h" static struct ble_store_status_event ble_store_test_status_event; static void ble_store_test_util_verify_peer_deleted(const ble_addr_t *addr) { union ble_store_value value; union ble_store_key key; ble_addr_t addrs[64]; int num_addrs; int rc; int i; memset(&key, 0, sizeof key); key.sec.peer_addr = *addr; rc = ble_store_read(BLE_STORE_OBJ_TYPE_OUR_SEC, &key, &value); TEST_ASSERT(rc == BLE_HS_ENOENT); rc = ble_store_read(BLE_STORE_OBJ_TYPE_PEER_SEC, &key, &value); TEST_ASSERT(rc == BLE_HS_ENOENT); memset(&key, 0, sizeof key); key.cccd.peer_addr = *addr; rc = ble_store_read(BLE_STORE_OBJ_TYPE_CCCD, &key, &value); TEST_ASSERT(rc == BLE_HS_ENOENT); rc = ble_store_util_bonded_peers(addrs, &num_addrs, sizeof addrs / sizeof addrs[0]); TEST_ASSERT_FATAL(rc == 0); for (i = 0; i < num_addrs; i++) { TEST_ASSERT(ble_addr_cmp(addr, addrs + i) != 0); } } static int ble_store_test_util_status_overflow(struct ble_store_status_event *event, void *arg) { int *status; status = arg; ble_store_test_status_event = *event; return *status; } static void ble_store_test_util_overflow_sec(int is_our_sec) { union ble_store_value val; int obj_type; int status; int rc; int i; ble_hs_test_util_init(); ble_hs_cfg.store_status_cb = ble_store_test_util_status_overflow; ble_hs_cfg.store_status_arg = &status; if (is_our_sec) { obj_type = BLE_STORE_OBJ_TYPE_OUR_SEC; } else { obj_type = BLE_STORE_OBJ_TYPE_PEER_SEC; } memset(&ble_store_test_status_event, 0, sizeof ble_store_test_status_event); memset(&val, 0, sizeof val); val.sec.peer_addr = (ble_addr_t){ BLE_ADDR_PUBLIC, { 1, 2, 3, 4, 5, 6 } }; val.sec.ltk_present = 1, status = BLE_HS_ESTORE_CAP; for (i = 0; ; i++) { rc = ble_store_write(obj_type, &val); if (i < MYNEWT_VAL(BLE_STORE_MAX_BONDS)) { TEST_ASSERT_FATAL(rc == 0); } else { /* This record should have caused an overflow. */ TEST_ASSERT(rc == BLE_HS_ESTORE_CAP); TEST_ASSERT(ble_store_test_status_event.event_code == BLE_STORE_EVENT_OVERFLOW); TEST_ASSERT(ble_store_test_status_event.overflow.obj_type == obj_type); TEST_ASSERT(ble_store_test_status_event.overflow.value == &val); break; } val.sec.peer_addr.val[0]++; } } static int ble_store_test_util_count(int obj_type) { int count; int rc; rc = ble_store_util_count(obj_type, &count); TEST_ASSERT_FATAL(rc == 0); return count; } TEST_CASE_SELF(ble_store_test_peers) { struct ble_store_value_sec secs[3] = { { .peer_addr = { BLE_ADDR_PUBLIC, { 1, 2, 3, 4, 5, 6 } }, .ltk_present = 1, }, { /* Address value is a duplicate of above, but type differs. */ .peer_addr = { BLE_ADDR_RANDOM, { 1, 2, 3, 4, 5, 6 } }, .ltk_present = 1, }, { .peer_addr = { BLE_ADDR_PUBLIC, { 2, 3, 4, 5, 6, 7 } }, .ltk_present = 1, }, }; ble_addr_t peer_addrs[3]; int num_addrs; int rc; int i; ble_hs_test_util_init(); for (i = 0; i < sizeof secs / sizeof secs[0]; i++) { rc = ble_store_write_our_sec(secs + i); TEST_ASSERT_FATAL(rc == 0); rc = ble_store_write_peer_sec(secs + i); TEST_ASSERT_FATAL(rc == 0); } rc = ble_store_util_bonded_peers(peer_addrs, &num_addrs, sizeof peer_addrs / sizeof peer_addrs[0]); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(num_addrs == sizeof secs / sizeof secs[0]); for (i = 0; i < num_addrs; i++) { TEST_ASSERT(ble_addr_cmp(&peer_addrs[i], &secs[i].peer_addr) == 0); } ble_hs_test_util_assert_mbufs_freed(NULL); } TEST_CASE_SELF(ble_store_test_delete_peer) { struct ble_store_value_sec secs[2] = { { .peer_addr = { BLE_ADDR_PUBLIC, { 1, 2, 3, 4, 5, 6 } }, .ltk_present = 1, }, { /* Address value is a duplicate of above, but type differs. */ .peer_addr = { BLE_ADDR_RANDOM, { 1, 2, 3, 4, 5, 6 } }, .ltk_present = 1, }, }; struct ble_store_value_cccd cccds[3] = { /* First two belong to first peer. */ { .peer_addr = secs[0].peer_addr, .chr_val_handle = 5, }, { .peer_addr = secs[0].peer_addr, .chr_val_handle = 8, }, /* Last belongs to second peer. */ { .peer_addr = secs[1].peer_addr, .chr_val_handle = 5, }, }; union ble_store_value value; union ble_store_key key; int count; int rc; int i; ble_hs_test_util_init(); for (i = 0; i < sizeof secs / sizeof secs[0]; i++) { rc = ble_store_write_our_sec(secs + i); TEST_ASSERT_FATAL(rc == 0); rc = ble_store_write_peer_sec(secs + i); TEST_ASSERT_FATAL(rc == 0); } for (i = 0; i < sizeof cccds / sizeof cccds[0]; i++) { rc = ble_store_write_cccd(cccds + i); TEST_ASSERT_FATAL(rc == 0); } /* Delete first peer. */ rc = ble_store_util_delete_peer(&secs[0].peer_addr); TEST_ASSERT_FATAL(rc == 0); /* Ensure all traces of first peer have been removed. */ ble_store_test_util_verify_peer_deleted(&secs[0].peer_addr); /* Ensure second peer data is still intact. */ ble_store_key_from_value_sec(&key.sec, secs + 1); rc = ble_store_util_count(BLE_STORE_OBJ_TYPE_OUR_SEC, &count); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(count == 1); rc = ble_store_read_our_sec(&key.sec, &value.sec); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(memcmp(&value.sec, secs + 1, sizeof value.sec) == 0); rc = ble_store_util_count(BLE_STORE_OBJ_TYPE_PEER_SEC, &count); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(count == 1); rc = ble_store_read_peer_sec(&key.sec, &value.sec); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(memcmp(&value.sec, secs + 1, sizeof value.sec) == 0); ble_store_key_from_value_cccd(&key.cccd, cccds + 2); rc = ble_store_util_count(BLE_STORE_OBJ_TYPE_CCCD, &count); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(count == 1); rc = ble_store_read_cccd(&key.cccd, &value.cccd); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(memcmp(&value.cccd, cccds + 2, sizeof value.cccd) == 0); /* Delete second peer. */ rc = ble_store_util_delete_peer(&secs[1].peer_addr); TEST_ASSERT_FATAL(rc == 0); /* Ensure all traces of first peer have been removed. */ ble_store_test_util_verify_peer_deleted(&secs[1].peer_addr); ble_hs_test_util_assert_mbufs_freed(NULL); } TEST_CASE_SELF(ble_store_test_count) { struct ble_store_value_sec secs[4] = { { .peer_addr = { BLE_ADDR_PUBLIC, { 1, 2, 3, 4, 5, 6 } }, .ltk_present = 1, }, { .peer_addr = { BLE_ADDR_RANDOM, { 1, 2, 3, 4, 5, 6 } }, .ltk_present = 1, }, { .peer_addr = { BLE_ADDR_PUBLIC, { 2, 3, 4, 5, 6, 7 } }, .ltk_present = 1, }, { .peer_addr = { BLE_ADDR_RANDOM, { 3, 4, 5, 6, 7, 8 } }, .ltk_present = 1, }, }; struct ble_store_value_cccd cccds[2] = { { .peer_addr = secs[0].peer_addr, .chr_val_handle = 5, }, { .peer_addr = secs[0].peer_addr, .chr_val_handle = 8, }, }; int count; int rc; int i; ble_hs_test_util_init(); /*** Verify initial counts are 0. */ rc = ble_store_util_count(BLE_STORE_OBJ_TYPE_OUR_SEC, &count); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(count == 0); rc = ble_store_util_count(BLE_STORE_OBJ_TYPE_PEER_SEC, &count); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(count == 0); rc = ble_store_util_count(BLE_STORE_OBJ_TYPE_CCCD, &count); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(count == 0); /* Write some test data. */ for (i = 0; i < 3; i++) { rc = ble_store_write_our_sec(secs + i); TEST_ASSERT_FATAL(rc == 0); } for (i = 0; i < 2; i++) { rc = ble_store_write_peer_sec(secs + i); TEST_ASSERT_FATAL(rc == 0); } for (i = 0; i < 1; i++) { rc = ble_store_write_cccd(cccds + i); TEST_ASSERT_FATAL(rc == 0); } /*** Verify counts after populating store. */ rc = ble_store_util_count(BLE_STORE_OBJ_TYPE_OUR_SEC, &count); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(count == 3); rc = ble_store_util_count(BLE_STORE_OBJ_TYPE_PEER_SEC, &count); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(count == 2); rc = ble_store_util_count(BLE_STORE_OBJ_TYPE_CCCD, &count); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(count == 1); ble_hs_test_util_assert_mbufs_freed(NULL); } TEST_CASE_SELF(ble_store_test_overflow) { ble_store_test_util_overflow_sec(0); ble_store_test_util_overflow_sec(1); ble_hs_test_util_assert_mbufs_freed(NULL); } TEST_CASE_SELF(ble_store_test_clear) { const struct ble_store_value_sec secs[2] = { { .peer_addr = { BLE_ADDR_PUBLIC, { 1, 2, 3, 4, 5, 6 } }, .ltk_present = 1, }, { /* Address value is a duplicate of above, but type differs. */ .peer_addr = { BLE_ADDR_RANDOM, { 1, 2, 3, 4, 5, 6 } }, .ltk_present = 1, }, }; const struct ble_store_value_cccd cccds[3] = { /* First two belong to first peer. */ { .peer_addr = secs[0].peer_addr, .chr_val_handle = 5, }, { .peer_addr = secs[0].peer_addr, .chr_val_handle = 8, }, /* Last belongs to second peer. */ { .peer_addr = secs[1].peer_addr, .chr_val_handle = 5, }, }; int rc; int i; ble_hs_test_util_init(); for (i = 0; i < sizeof secs / sizeof secs[0]; i++) { rc = ble_store_write_our_sec(secs + i); TEST_ASSERT_FATAL(rc == 0); rc = ble_store_write_peer_sec(secs + i); TEST_ASSERT_FATAL(rc == 0); } for (i = 0; i < sizeof cccds / sizeof cccds[0]; i++) { rc = ble_store_write_cccd(cccds + i); TEST_ASSERT_FATAL(rc == 0); } /* Sanity check. */ TEST_ASSERT_FATAL( ble_store_test_util_count(BLE_STORE_OBJ_TYPE_OUR_SEC) == 2); TEST_ASSERT_FATAL( ble_store_test_util_count(BLE_STORE_OBJ_TYPE_PEER_SEC) == 2); TEST_ASSERT_FATAL( ble_store_test_util_count(BLE_STORE_OBJ_TYPE_CCCD) == 3); /* Ensure store is empty after clear gets called. */ rc = ble_store_clear(); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(ble_store_test_util_count(BLE_STORE_OBJ_TYPE_OUR_SEC) == 0); TEST_ASSERT(ble_store_test_util_count(BLE_STORE_OBJ_TYPE_PEER_SEC) == 0); TEST_ASSERT(ble_store_test_util_count(BLE_STORE_OBJ_TYPE_CCCD) == 0); /* Ensure second clear succeeds with no effect. */ rc = ble_store_clear(); TEST_ASSERT_FATAL(rc == 0); TEST_ASSERT(ble_store_test_util_count(BLE_STORE_OBJ_TYPE_OUR_SEC) == 0); TEST_ASSERT(ble_store_test_util_count(BLE_STORE_OBJ_TYPE_PEER_SEC) == 0); TEST_ASSERT(ble_store_test_util_count(BLE_STORE_OBJ_TYPE_CCCD) == 0); ble_hs_test_util_assert_mbufs_freed(NULL); } TEST_SUITE(ble_store_suite) { ble_store_test_peers(); ble_store_test_delete_peer(); ble_store_test_count(); ble_store_test_overflow(); ble_store_test_clear(); } |