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 | /* * Copyright (c) 2016 Intel Corporation * * SPDX-License-Identifier: Apache-2.0 */ #include <stdbool.h> #include <zephyr.h> #include <ztest.h> #include <tc_util.h> #include <misc/util.h> #define NUM_TEST_ITEMS 6 /* Each work item takes 100ms */ #define WORK_ITEM_WAIT 100 /* * Wait 50ms between work submissions, to ensure co-op and prempt * preempt thread submit alternatively. */ #define SUBMIT_WAIT 50 #define STACK_SIZE 1024 struct test_item { int key; struct k_delayed_work work; }; static K_THREAD_STACK_DEFINE(co_op_stack, STACK_SIZE); static struct k_thread co_op_data; static struct test_item tests[NUM_TEST_ITEMS]; static int results[NUM_TEST_ITEMS]; static int num_results; static void work_handler(struct k_work *work) { struct test_item *ti = CONTAINER_OF(work, struct test_item, work); TC_PRINT(" - Running test item %d\n", ti->key); k_sleep(WORK_ITEM_WAIT); results[num_results++] = ti->key; } /** * @ingroup workqueue_thread_tests * @see k_work_init() */ static void test_items_init(void) { int i; for (i = 0; i < NUM_TEST_ITEMS; i++) { tests[i].key = i + 1; k_work_init(&tests[i].work.work, work_handler); } } static void reset_results(void) { int i; for (i = 0; i < NUM_TEST_ITEMS; i++) results[i] = 0; num_results = 0; } static void coop_work_main(int arg1, int arg2) { int i; ARG_UNUSED(arg1); ARG_UNUSED(arg2); /* Let the preempt thread submit the first work item. */ k_sleep(SUBMIT_WAIT / 2); for (i = 1; i < NUM_TEST_ITEMS; i += 2) { TC_PRINT(" - Submitting work %d from coop thread\n", i + 1); k_work_submit(&tests[i].work.work); k_sleep(SUBMIT_WAIT); } } /** * @ingroup workqueue_thread_tests * @see k_work_submit() */ static void test_items_submit(void) { int i; k_thread_create(&co_op_data, co_op_stack, STACK_SIZE, (k_thread_entry_t)coop_work_main, NULL, NULL, NULL, K_PRIO_COOP(10), 0, 0); for (i = 0; i < NUM_TEST_ITEMS; i += 2) { TC_PRINT(" - Submitting work %d from preempt thread\n", i + 1); k_work_submit(&tests[i].work.work); k_sleep(SUBMIT_WAIT); } } static void check_results(int num_tests) { int i; zassert_equal(num_results, num_tests, "*** work items finished: %d (expected: %d)\n", num_results, num_tests); for (i = 0; i < num_tests; i++) { zassert_equal(results[i], i + 1, "*** got result %d in position %d" " (expected %d)\n", results[i], i, i + 1); } } /** * @ingroup workqueue_thread_tests * @see k_work_init(), k_work_submit() */ static void test_sequence(void) { TC_PRINT(" - Initializing test items\n"); test_items_init(); TC_PRINT(" - Submitting test items\n"); test_items_submit(); TC_PRINT(" - Waiting for work to finish\n"); k_sleep((NUM_TEST_ITEMS + 1) * WORK_ITEM_WAIT); check_results(NUM_TEST_ITEMS); reset_results(); } static void resubmit_work_handler(struct k_work *work) { struct test_item *ti = CONTAINER_OF(work, struct test_item, work); k_sleep(WORK_ITEM_WAIT); results[num_results++] = ti->key; if (ti->key < NUM_TEST_ITEMS) { ti->key++; TC_PRINT(" - Resubmitting work\n"); k_work_submit(work); } } /** * @ingroup workqueue_thread_tests * @see k_work_submit() */ static void test_resubmit(void) { TC_PRINT("Starting resubmit test\n"); tests[0].key = 1; tests[0].work.work.handler = resubmit_work_handler; TC_PRINT(" - Submitting work\n"); k_work_submit(&tests[0].work.work); TC_PRINT(" - Waiting for work to finish\n"); k_sleep((NUM_TEST_ITEMS + 1) * WORK_ITEM_WAIT); TC_PRINT(" - Checking results\n"); check_results(NUM_TEST_ITEMS); reset_results(); } static void delayed_work_handler(struct k_work *work) { struct test_item *ti = CONTAINER_OF(work, struct test_item, work); TC_PRINT(" - Running delayed test item %d\n", ti->key); results[num_results++] = ti->key; } /** * @ingroup workqueue_thread_tests * @see k_delayed_work_init() */ static void test_delayed_init(void) { int i; for (i = 0; i < NUM_TEST_ITEMS; i++) { tests[i].key = i + 1; k_delayed_work_init(&tests[i].work, delayed_work_handler); } } static void coop_delayed_work_main(int arg1, int arg2) { int i; ARG_UNUSED(arg1); ARG_UNUSED(arg2); /* Let the preempt thread submit the first work item. */ k_sleep(SUBMIT_WAIT / 2); for (i = 1; i < NUM_TEST_ITEMS; i += 2) { TC_PRINT(" - Submitting delayed work %d from" " coop thread\n", i + 1); k_delayed_work_submit(&tests[i].work, (i + 1) * WORK_ITEM_WAIT); } } /** * @ingroup workqueue_thread_tests * @see k_delayed_work_init(), k_delayed_work_submit() */ static void test_delayed_submit(void) { int i; k_thread_create(&co_op_data, co_op_stack, STACK_SIZE, (k_thread_entry_t)coop_delayed_work_main, NULL, NULL, NULL, K_PRIO_COOP(10), 0, 0); for (i = 0; i < NUM_TEST_ITEMS; i += 2) { TC_PRINT(" - Submitting delayed work %d from" " preempt thread\n", i + 1); zassert_true(k_delayed_work_submit(&tests[i].work, (i + 1) * WORK_ITEM_WAIT) == 0, NULL); } } static void coop_delayed_work_cancel_main(int arg1, int arg2) { ARG_UNUSED(arg1); ARG_UNUSED(arg2); k_delayed_work_submit(&tests[1].work, WORK_ITEM_WAIT); TC_PRINT(" - Cancel delayed work from coop thread\n"); k_delayed_work_cancel(&tests[1].work); #if defined(CONFIG_POLL) k_delayed_work_submit(&tests[2].work, 0 /* Submit immeditelly */); TC_PRINT(" - Cancel pending delayed work from coop thread\n"); k_delayed_work_cancel(&tests[2].work); #endif } /** * @ingroup workqueue_thread_tests * @see k_delayed_work_init(), k_delayed_work_submit(), k_delayed_work_cancel() */ static void test_delayed_cancel(void) { TC_PRINT("Starting delayed cancel test\n"); k_delayed_work_submit(&tests[0].work, WORK_ITEM_WAIT); TC_PRINT(" - Cancel delayed work from preempt thread\n"); k_delayed_work_cancel(&tests[0].work); k_thread_create(&co_op_data, co_op_stack, STACK_SIZE, (k_thread_entry_t)coop_delayed_work_cancel_main, NULL, NULL, NULL, K_HIGHEST_THREAD_PRIO, 0, 0); TC_PRINT(" - Waiting for work to finish\n"); k_sleep(2 * WORK_ITEM_WAIT); TC_PRINT(" - Checking results\n"); check_results(0); } /** * @ingroup workqueue_thread_tests * @see k_delayed_work_init(), k_delayed_work_submit() */ static void delayed_resubmit_work_handler(struct k_work *work) { struct test_item *ti = CONTAINER_OF(work, struct test_item, work); results[num_results++] = ti->key; if (ti->key < NUM_TEST_ITEMS) { ti->key++; TC_PRINT(" - Resubmitting delayed work\n"); k_delayed_work_submit(&ti->work, WORK_ITEM_WAIT); } } /** * @ingroup workqueue_thread_tests * @see k_delayed_work_init(), k_delayed_work_submit() */ static void test_delayed_resubmit(void) { TC_PRINT("Starting delayed resubmit test\n"); tests[0].key = 1; k_delayed_work_init(&tests[0].work, delayed_resubmit_work_handler); TC_PRINT(" - Submitting delayed work\n"); k_delayed_work_submit(&tests[0].work, WORK_ITEM_WAIT); TC_PRINT(" - Waiting for work to finish\n"); k_sleep((NUM_TEST_ITEMS + 1) * WORK_ITEM_WAIT); TC_PRINT(" - Checking results\n"); check_results(NUM_TEST_ITEMS); reset_results(); } static void coop_delayed_work_resubmit(void) { int i; for (i = 0; i < NUM_TEST_ITEMS; i++) { TC_PRINT(" - Resubmitting delayed work with 1 ms\n"); k_delayed_work_submit(&tests[0].work, 1); /* Busy wait 1 ms to force a clash with workqueue */ #if defined(CONFIG_ARCH_POSIX) k_busy_wait(1000); #else volatile u32_t uptime; uptime = k_uptime_get_32(); while (k_uptime_get_32() == uptime) { } #endif } } /** * @ingroup workqueue_thread_tests * @see k_delayed_work_init() */ static void test_delayed_resubmit_thread(void) { TC_PRINT("Starting delayed resubmit from coop thread test\n"); tests[0].key = 1; k_delayed_work_init(&tests[0].work, delayed_work_handler); k_thread_create(&co_op_data, co_op_stack, STACK_SIZE, (k_thread_entry_t)coop_delayed_work_resubmit, NULL, NULL, NULL, K_PRIO_COOP(10), 0, 0); TC_PRINT(" - Waiting for work to finish\n"); k_sleep(WORK_ITEM_WAIT); TC_PRINT(" - Checking results\n"); check_results(1); reset_results(); } /** * @ingroup workqueue_thread_tests * @see k_delayed_work_init(), k_delayed_work_submit() */ static void test_delayed(void) { TC_PRINT("Starting delayed test\n"); TC_PRINT(" - Initializing delayed test items\n"); test_delayed_init(); TC_PRINT(" - Submitting delayed test items\n"); test_delayed_submit(); TC_PRINT(" - Waiting for delayed work to finish\n"); k_sleep((NUM_TEST_ITEMS + 2) * WORK_ITEM_WAIT); TC_PRINT(" - Checking results\n"); check_results(NUM_TEST_ITEMS); reset_results(); } /*test case main entry*/ void test_main(void) { k_thread_priority_set(k_current_get(), 0); ztest_test_suite(workqueue, ztest_unit_test(test_sequence), ztest_unit_test(test_resubmit), ztest_unit_test(test_delayed), ztest_unit_test(test_delayed_resubmit), ztest_unit_test(test_delayed_resubmit_thread), ztest_unit_test(test_delayed_cancel) ); ztest_run_test_suite(workqueue); } |