[8a64e81e] | 1 | /*
|
---|
| 2 | * Copyright (c) 2012 Adam Hraska
|
---|
| 3 | * All rights reserved.
|
---|
| 4 | *
|
---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
---|
| 6 | * modification, are permitted provided that the following conditions
|
---|
| 7 | * are met:
|
---|
| 8 | *
|
---|
| 9 | * - Redistributions of source code must retain the above copyright
|
---|
| 10 | * notice, this list of conditions and the following disclaimer.
|
---|
| 11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
| 12 | * notice, this list of conditions and the following disclaimer in the
|
---|
| 13 | * documentation and/or other materials provided with the distribution.
|
---|
| 14 | * - The name of the author may not be used to endorse or promote products
|
---|
| 15 | * derived from this software without specific prior written permission.
|
---|
| 16 | *
|
---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
| 27 | */
|
---|
| 28 |
|
---|
| 29 | #include <test.h>
|
---|
| 30 | #include <arch.h>
|
---|
| 31 | #include <print.h>
|
---|
| 32 | #include <memstr.h>
|
---|
| 33 | #include <synch/workqueue.h>
|
---|
| 34 |
|
---|
| 35 |
|
---|
| 36 | #define WAVES 10
|
---|
| 37 | #define COUNT_POW 12
|
---|
| 38 | #define COUNT ((1 << COUNT_POW) - 1)
|
---|
| 39 | #define WAVE_SLEEP_MS 100
|
---|
| 40 | #define MAIN_POLL_SLEEP_MS 100
|
---|
| 41 | #define MAIN_MAX_SLEEP_SEC 40
|
---|
| 42 |
|
---|
| 43 | /*
|
---|
| 44 | * Include the test implementation.
|
---|
| 45 | */
|
---|
| 46 | #include "workq-test-core.h"
|
---|
| 47 |
|
---|
| 48 |
|
---|
[9f8745c5] | 49 | /*-------------------------------------------------------------------*/
|
---|
| 50 |
|
---|
| 51 | static work_t basic_work;
|
---|
| 52 | static int basic_done = 0;
|
---|
| 53 |
|
---|
| 54 | static void basic_test_work(work_t *work_item)
|
---|
| 55 | {
|
---|
| 56 | basic_done = 1;
|
---|
| 57 | TPRINTF("basic_test_work()");
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 |
|
---|
| 61 | static void basic_test(void)
|
---|
| 62 | {
|
---|
| 63 | TPRINTF("Issue a single work item.\n");
|
---|
| 64 | basic_done = 0;
|
---|
| 65 | workq_global_enqueue(&basic_work, basic_test_work);
|
---|
| 66 |
|
---|
| 67 | while (!basic_done) {
|
---|
| 68 | TPRINTF(".");
|
---|
| 69 | thread_sleep(1);
|
---|
| 70 | }
|
---|
| 71 |
|
---|
| 72 | TPRINTF("\nBasic test done\n");
|
---|
| 73 | }
|
---|
| 74 |
|
---|
| 75 | /*-------------------------------------------------------------------*/
|
---|
| 76 |
|
---|
| 77 |
|
---|
[8a64e81e] | 78 | struct work_queue *workq = NULL;
|
---|
| 79 |
|
---|
| 80 | static int core_workq_enqueue(work_t *work_item, work_func_t func)
|
---|
| 81 | {
|
---|
| 82 | return workq_enqueue(workq, work_item, func);
|
---|
| 83 | }
|
---|
[9f8745c5] | 84 | /*-------------------------------------------------------------------*/
|
---|
[8a64e81e] | 85 |
|
---|
| 86 |
|
---|
[9f8745c5] | 87 | static const char *test_custom_workq_impl(bool stop, const char *qname)
|
---|
[8a64e81e] | 88 | {
|
---|
[9f8745c5] | 89 | workq = workq_create(qname);
|
---|
[8a64e81e] | 90 |
|
---|
| 91 | if (!workq) {
|
---|
[9f8745c5] | 92 | return "Failed to create a work queue.\n";
|
---|
[8a64e81e] | 93 | }
|
---|
| 94 |
|
---|
[9f8745c5] | 95 | const char *ret = run_workq_core(stop);
|
---|
[8a64e81e] | 96 |
|
---|
| 97 | TPRINTF("Stopping work queue...\n");
|
---|
| 98 | workq_stop(workq);
|
---|
| 99 |
|
---|
| 100 | TPRINTF("Destroying work queue...\n");
|
---|
| 101 | workq_destroy(workq);
|
---|
| 102 | return ret;
|
---|
| 103 | }
|
---|
| 104 |
|
---|
[9f8745c5] | 105 | static const char *test_custom_workq(void)
|
---|
| 106 | {
|
---|
| 107 | TPRINTF("Stress testing a custom queue.\n");
|
---|
| 108 | return test_custom_workq_impl(false, "test-workq");
|
---|
| 109 | }
|
---|
| 110 |
|
---|
[8a64e81e] | 111 |
|
---|
[9f8745c5] | 112 | static const char *test_custom_workq_stop(void)
|
---|
[8a64e81e] | 113 | {
|
---|
[9f8745c5] | 114 | TPRINTF("Stress testing a custom queue. Stops prematurely. "
|
---|
| 115 | "Errors are expected.\n");
|
---|
| 116 | test_custom_workq_impl(true, "test-workq-stop");
|
---|
| 117 | /* Errors are expected. */
|
---|
[205832b] | 118 | return NULL;
|
---|
[9f8745c5] | 119 | }
|
---|
| 120 |
|
---|
| 121 |
|
---|
| 122 | const char *test_workqueue_all(void)
|
---|
| 123 | {
|
---|
[205832b] | 124 | const char *err = NULL;
|
---|
[9f8745c5] | 125 | const char *res;
|
---|
[8a64e81e] | 126 |
|
---|
[9f8745c5] | 127 | basic_test();
|
---|
[8a64e81e] | 128 |
|
---|
[9f8745c5] | 129 | res = test_custom_workq();
|
---|
| 130 | if (res) {
|
---|
| 131 | TPRINTF(res);
|
---|
| 132 | err = res;
|
---|
| 133 | }
|
---|
[8a64e81e] | 134 |
|
---|
[9f8745c5] | 135 | res = test_custom_workq_stop();
|
---|
| 136 | if (res) {
|
---|
| 137 | TPRINTF(res);
|
---|
| 138 | err = res;
|
---|
| 139 | }
|
---|
[8a64e81e] | 140 |
|
---|
[9f8745c5] | 141 | res = test_workqueue3();
|
---|
| 142 | if (res) {
|
---|
| 143 | TPRINTF(res);
|
---|
| 144 | err = res;
|
---|
| 145 | }
|
---|
[8a64e81e] | 146 |
|
---|
[9f8745c5] | 147 | return err;
|
---|
[8a64e81e] | 148 | }
|
---|