Loading...
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 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 | /* pool.c - test microkernel memory pool APIs */ /* * Copyright (c) 2012-2014 Wind River Systems, Inc. * * 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. */ /* DESCRIPTION This modules tests the following memory pool routines: task_mem_pool_alloc(), task_mem_pool_free() */ #include <zephyr.h> #include <tc_util.h> #include <misc/util.h> #define ONE_SECOND (sys_clock_ticks_per_sec) #define TENTH_SECOND (sys_clock_ticks_per_sec / 10) #define NUM_BLOCKS 64 #define DEFRAG_BLK_TEST 2222 typedef struct { struct k_block *block; /* pointer to block data */ kmemory_pool_t poolId; /* pool ID */ int size; /* request size in bytes */ int32_t timeout; /* # of ticks to wait */ int rcode; /* expected return code */ } TEST_CASE; typedef int (*poolBlockGetFunc_t)(struct k_block *, kmemory_pool_t, int, int32_t); typedef int (*poolMoveBlockFunc_t)(struct k_block *, kmemory_pool_t); static volatile int evidence = 0; static struct k_block blockList[NUM_BLOCKS]; static struct k_block helperBlock; static TEST_CASE getSet[] = { {&blockList[0], POOL_ID, 0, 0, RC_OK}, {&blockList[1], POOL_ID, 1, 0, RC_OK}, {&blockList[2], POOL_ID, 32, 0, RC_OK}, {&blockList[3], POOL_ID, 64, 0, RC_OK}, {&blockList[4], POOL_ID, 128, 0, RC_OK}, {&blockList[5], POOL_ID, 256, 0, RC_OK}, {&blockList[6], POOL_ID, 512, 0, RC_OK}, {&blockList[7], POOL_ID, 1024, 0, RC_OK}, {&blockList[8], POOL_ID, 2048, 0, RC_FAIL}, {&blockList[9], POOL_ID, 4096, 0, RC_FAIL} }; static TEST_CASE getSet2[] = { {&blockList[0], POOL_ID, 4096, 0, RC_OK}, {&blockList[1], POOL_ID, 2048, 0, RC_FAIL}, {&blockList[2], POOL_ID, 1024, 0, RC_FAIL}, {&blockList[3], POOL_ID, 512, 0, RC_FAIL}, {&blockList[4], POOL_ID, 256, 0, RC_FAIL} }; static TEST_CASE getwtSet[] = { {&blockList[0], POOL_ID, 4096, TENTH_SECOND, RC_OK}, {&blockList[1], POOL_ID, 2048, TENTH_SECOND, RC_TIME}, {&blockList[2], POOL_ID, 1024, TENTH_SECOND, RC_TIME}, {&blockList[3], POOL_ID, 512, TENTH_SECOND, RC_TIME}, {&blockList[4], POOL_ID, 256, TENTH_SECOND, RC_TIME} }; static TEST_CASE defrag[] = { {&blockList[0], POOL_ID, 64, 0, RC_OK}, {&blockList[1], POOL_ID, 64, 0, RC_OK}, {&blockList[2], POOL_ID, 64, 0, RC_OK}, {&blockList[3], POOL_ID, 64, 0, RC_OK}, {&blockList[4], POOL_ID, 256, 0, RC_OK}, {&blockList[5], POOL_ID, 256, 0, RC_OK}, {&blockList[6], POOL_ID, 256, 0, RC_OK}, {&blockList[7], POOL_ID, 1024, 0, RC_OK}, {&blockList[8], POOL_ID, 1024, 0, RC_OK}, {&blockList[9], POOL_ID, 1024, 0, RC_OK} }; /** * * @brief Compare the two blocks * * @return 0 if the same, non-zero if not the same */ int blockCompare(struct k_block *b1, struct k_block *b2) { char *p1 = (char *) b1; char *p2 = (char *) b2; int i; int diff; for (i = 0; i < sizeof(struct k_block); i++) { diff = p2[i] - p1[i]; if (diff != 0) { break; } } return diff; } /** * * @brief Wrapper for task_mem_pool_alloc() * * @return task_mem_pool_alloc() return value */ int poolBlockGetFunc(struct k_block *block, kmemory_pool_t pool, int size, int32_t unused) { ARG_UNUSED(unused); return task_mem_pool_alloc(block, pool, size, TICKS_NONE); } /** * * @brief Wrapper for task_mem_pool_alloc(TICKS_UNLIMITED) * * @return task_mem_pool_alloc() return value */ int poolBlockGetWFunc(struct k_block *block, kmemory_pool_t pool, int size, int32_t unused) { ARG_UNUSED(unused); return task_mem_pool_alloc(block, pool, size, TICKS_UNLIMITED); } /** * * @brief Wrapper for task_mem_pool_alloc(timeout) * * @return task_mem_pool_alloc(timeout) return value */ int poolBlockGetWTFunc(struct k_block *block, kmemory_pool_t pool, int size, int32_t timeout) { return task_mem_pool_alloc(block, pool, size, timeout); } /** * * @brief Free any blocks allocated in the test set * * @return N/A */ void freeBlocks(TEST_CASE *tests, int nTests) { int i; for (i = 0; i < nTests; i++) { if (tests[i].rcode == RC_OK) { task_mem_pool_free(tests[i].block); } } } /** * * @brief Perform the work of getting blocks * * @return TC_PASS on success, TC_FAIL on failure */ int poolBlockGetWork(char *string, poolBlockGetFunc_t func, TEST_CASE *tests, int nTests) { int i; int rv; for (i = 0; i < nTests; i++) { rv = func(tests[i].block, tests[i].poolId, tests[i].size, tests[i].timeout); if (rv != tests[i].rcode) { TC_ERROR("%s() expected %d, got %d\n" "size: %d, timeout: %d\n", string, tests[i].rcode, rv, tests[i].size, tests[i].timeout); return TC_FAIL; } } return TC_PASS; } /** * * @brief Test the task_mem_pool_alloc(TICKS_NONE) API * * The pool is 4 kB in size. * * @return TC_PASS on success, TC_FAIL on failure */ int poolBlockGetTest(void) { int rv; /* return value from task_mem_pool_alloc() */ int j; /* loop counter */ for (j = 0; j < 8; j++) { rv = poolBlockGetWork("task_mem_pool_alloc", poolBlockGetFunc, getSet, ARRAY_SIZE(getSet)); if (rv != TC_PASS) { return TC_FAIL; } freeBlocks(getSet, ARRAY_SIZE(getSet)); rv = poolBlockGetWork("task_mem_pool_alloc", poolBlockGetFunc, getSet2, ARRAY_SIZE(getSet2)); if (rv != TC_PASS) { return TC_FAIL; } freeBlocks(getSet2, ARRAY_SIZE(getSet2)); } return TC_PASS; } /** * * @brief Helper task to poolBlockGetTimeoutTest() * * @return N/A */ void HelperTask(void) { task_sem_take(HELPER_SEM, TICKS_UNLIMITED); task_sem_give(REGRESS_SEM); task_mem_pool_free(&helperBlock); } /** * * @brief Test task_mem_pool_alloc(timeout) * * @return TC_PASS on success, TC_FAIL on failure */ int poolBlockGetTimeoutTest(void) { struct k_block block; int rv; /* return value from task_mem_pool_alloc() */ int j; /* loop counter */ for (j = 0; j < 8; j++) { rv = poolBlockGetWork("task_mem_pool_alloc", poolBlockGetWTFunc, getwtSet, ARRAY_SIZE(getwtSet)); if (rv != TC_PASS) { return TC_FAIL; } freeBlocks(getwtSet, ARRAY_SIZE(getwtSet)); } rv = task_mem_pool_alloc(&helperBlock, POOL_ID, 3148, 5); if (rv != RC_OK) { TC_ERROR("Failed to get size 3148 byte block from POOL_ID\n"); return TC_FAIL; } rv = task_mem_pool_alloc(&block, POOL_ID, 3148, TICKS_NONE); if (rv != RC_FAIL) { TC_ERROR("Unexpectedly got size 3148 byte block from POOL_ID\n"); return TC_FAIL; } task_sem_give(HELPER_SEM); /* Activate HelperTask */ rv = task_mem_pool_alloc(&block, POOL_ID, 3148, 20); if (rv != RC_OK) { TC_ERROR("Failed to get size 3148 byte block from POOL_ID\n"); return TC_FAIL; } rv = task_sem_take(REGRESS_SEM, TICKS_NONE); if (rv != RC_OK) { TC_ERROR("Failed to get size 3148 byte block within 20 ticks\n"); return TC_FAIL; } task_mem_pool_free(&block); return TC_PASS; } /** * * poolBlockGetWaitTest - * * @return TC_PASS on success, TC_FAIL on failure */ int poolBlockGetWaitTest(void) { int rv; rv = task_mem_pool_alloc(&blockList[0], POOL_ID, 3000, TICKS_UNLIMITED); if (rv != RC_OK) { TC_ERROR("task_mem_pool_alloc(3000) expected %d, got %d\n", RC_OK, rv); return TC_FAIL; } task_sem_give(ALTERNATE_SEM); /* Wake AlternateTask */ evidence = 0; rv = task_mem_pool_alloc(&blockList[1], POOL_ID, 128, TICKS_UNLIMITED); if (rv != RC_OK) { TC_ERROR("task_mem_pool_alloc(128) expected %d, got %d\n", RC_OK, rv); return TC_FAIL; } switch (evidence) { case 0: TC_ERROR("task_mem_pool_alloc(128) did not block!\n"); return TC_FAIL; case 1: break; case 2: default: TC_ERROR("Rescheduling did not occur after task_mem_pool_free()\n"); return TC_FAIL; } task_mem_pool_free(&blockList[1]); return TC_PASS; } /** * * @brief Task responsible for defragmenting the pool POOL_ID * * @return N/A */ void DefragTask(void) { task_sem_take(DEFRAG_SEM, TICKS_UNLIMITED); /* Wait to be activated */ task_mem_pool_defragment(POOL_ID); task_sem_give(REGRESS_SEM); /* DefragTask is finished */ } /** * * poolDefragTest - * * @return TC_PASS on success, TC_FAIL on failure */ int poolDefragTest(void) { int rv; struct k_block newBlock; /* Get a bunch of blocks */ rv = poolBlockGetWork("task_mem_pool_alloc", poolBlockGetFunc, defrag, ARRAY_SIZE(defrag)); if (rv != TC_PASS) { return TC_FAIL; } task_sem_give(DEFRAG_SEM); /* Activate DefragTask */ /* * Block on getting another block from the pool. * This will allow DefragTask to execute so that we can get some * better code coverage. 50 ticks is expected to more than sufficient * time for DefragTask to finish. */ rv = task_mem_pool_alloc(&newBlock, POOL_ID, DEFRAG_BLK_TEST, 50); if (rv != RC_TIME) { TC_ERROR("task_mem_pool_alloc() returned %d, not %d\n", rv, RC_TIME); return TC_FAIL; } rv = task_sem_take(REGRESS_SEM, TICKS_NONE); if (rv != RC_OK) { TC_ERROR("DefragTask did not finish in allotted time!\n"); return TC_FAIL; } /* Free the allocated blocks */ freeBlocks(defrag, ARRAY_SIZE(defrag)); return TC_PASS; } /** * * @brief Alternate task in the test suite * * This routine runs at a lower priority than RegressionTask(). * * @return N/A */ void AlternateTask(void) { task_sem_take(ALTERNATE_SEM, TICKS_UNLIMITED); evidence = 1; task_mem_pool_free(&blockList[0]); evidence = 2; } /** * * @brief Main task in the test suite * * This is the entry point to the memory pool test suite. * * @return N/A */ void RegressionTask(void) { int tcRC; /* test case return code */ TC_START("Test Microkernel Memory Pools"); TC_PRINT("Testing task_mem_pool_alloc(TICKS_NONE) ...\n"); tcRC = poolBlockGetTest(); if (tcRC != TC_PASS) { goto doneTests; } TC_PRINT("Testing task_mem_pool_alloc(timeout) ...\n"); tcRC = poolBlockGetTimeoutTest(); if (tcRC != TC_PASS) { goto doneTests; } TC_PRINT("Testing task_mem_pool_alloc(TICKS_UNLIMITED) ...\n"); tcRC = poolBlockGetWaitTest(); if (tcRC != TC_PASS) { goto doneTests; } TC_PRINT("Testing task_mem_pool_defragment() ...\n"); tcRC = poolDefragTest(); if (tcRC != TC_PASS) { goto doneTests; } doneTests: TC_END_RESULT(tcRC); TC_END_REPORT(tcRC); } |