1f52e50aeSRandall Stewart /*- 252467047SWarner Losh * Copyright (c) 2015 Netflix, Inc. 3f52e50aeSRandall Stewart * 4f52e50aeSRandall Stewart * Redistribution and use in source and binary forms, with or without 5f52e50aeSRandall Stewart * modification, are permitted provided that the following conditions 6f52e50aeSRandall Stewart * are met: 7f52e50aeSRandall Stewart * 1. Redistributions of source code must retain the above copyright 8f52e50aeSRandall Stewart * notice, this list of conditions and the following disclaimer. 9f52e50aeSRandall Stewart * 2. Redistributions in binary form must reproduce the above copyright 10f52e50aeSRandall Stewart * notice, this list of conditions and the following disclaimer in the 11f52e50aeSRandall Stewart * documentation and/or other materials provided with the distribution. 12f52e50aeSRandall Stewart * 13f52e50aeSRandall Stewart * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 14f52e50aeSRandall Stewart * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 15f52e50aeSRandall Stewart * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 16f52e50aeSRandall Stewart * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 17f52e50aeSRandall Stewart * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 18f52e50aeSRandall Stewart * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 19f52e50aeSRandall Stewart * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 20f52e50aeSRandall Stewart * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 21f52e50aeSRandall Stewart * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 22f52e50aeSRandall Stewart * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 23f52e50aeSRandall Stewart * SUCH DAMAGE. 24f52e50aeSRandall Stewart * 25f52e50aeSRandall Stewart */ 26*fdafd315SWarner Losh 27f52e50aeSRandall Stewart #include <sys/param.h> 28f52e50aeSRandall Stewart #include <sys/systm.h> 29f52e50aeSRandall Stewart #include <sys/bus.h> 30f52e50aeSRandall Stewart #include <sys/callout.h> 31f52e50aeSRandall Stewart #include <sys/kernel.h> 32f52e50aeSRandall Stewart #include <sys/ktr.h> 33f52e50aeSRandall Stewart #include <sys/lock.h> 34f52e50aeSRandall Stewart #include <sys/malloc.h> 3555c61f2aSEnji Cooper #include <sys/module.h> 36f52e50aeSRandall Stewart #include <sys/mutex.h> 37f52e50aeSRandall Stewart #include <sys/sdt.h> 3855c61f2aSEnji Cooper #include <sys/smp.h> 39f52e50aeSRandall Stewart #include <sys/sysctl.h> 40f52e50aeSRandall Stewart #include <sys/taskqueue.h> 41f52e50aeSRandall Stewart #include <sys/queue.h> 42f52e50aeSRandall Stewart #include <tests/kern_testfrwk.h> 43f52e50aeSRandall Stewart #ifdef SMP 44f52e50aeSRandall Stewart #include <machine/cpu.h> 45f52e50aeSRandall Stewart #endif 46f52e50aeSRandall Stewart 47f52e50aeSRandall Stewart struct kern_test_list { 48f52e50aeSRandall Stewart TAILQ_ENTRY(kern_test_list) next; 49f52e50aeSRandall Stewart char name[TEST_NAME_LEN]; 50f52e50aeSRandall Stewart kerntfunc func; 51f52e50aeSRandall Stewart }; 52f52e50aeSRandall Stewart 53f52e50aeSRandall Stewart TAILQ_HEAD(ktestlist, kern_test_list); 54f52e50aeSRandall Stewart 55f52e50aeSRandall Stewart struct kern_test_entry { 56f52e50aeSRandall Stewart TAILQ_ENTRY(kern_test_entry) next; 57f52e50aeSRandall Stewart struct kern_test_list *kt_e; 58f52e50aeSRandall Stewart struct kern_test kt_data; 59f52e50aeSRandall Stewart }; 606541c039SRandall Stewart 61f52e50aeSRandall Stewart TAILQ_HEAD(ktestqueue, kern_test_entry); 62f52e50aeSRandall Stewart 63f52e50aeSRandall Stewart MALLOC_DEFINE(M_KTFRWK, "kern_tfrwk", "Kernel Test Framework"); 64f52e50aeSRandall Stewart struct kern_totfrwk { 65f52e50aeSRandall Stewart struct taskqueue *kfrwk_tq; 66f52e50aeSRandall Stewart struct task kfrwk_que; 67f52e50aeSRandall Stewart struct ktestlist kfrwk_testlist; 68f52e50aeSRandall Stewart struct ktestqueue kfrwk_testq; 69f52e50aeSRandall Stewart struct mtx kfrwk_mtx; 70f52e50aeSRandall Stewart int kfrwk_waiting; 71f52e50aeSRandall Stewart }; 72f52e50aeSRandall Stewart 73f52e50aeSRandall Stewart struct kern_totfrwk kfrwk; 74f52e50aeSRandall Stewart static int ktest_frwk_inited = 0; 75f52e50aeSRandall Stewart 76f52e50aeSRandall Stewart #define KTFRWK_MUTEX_INIT() mtx_init(&kfrwk.kfrwk_mtx, "kern_test_frwk", "tfrwk", MTX_DEF) 77f52e50aeSRandall Stewart 78f52e50aeSRandall Stewart #define KTFRWK_DESTROY() mtx_destroy(&kfrwk.kfrwk_mtx) 79f52e50aeSRandall Stewart 80f52e50aeSRandall Stewart #define KTFRWK_LOCK() mtx_lock(&kfrwk.kfrwk_mtx) 81f52e50aeSRandall Stewart 82f52e50aeSRandall Stewart #define KTFRWK_UNLOCK() mtx_unlock(&kfrwk.kfrwk_mtx) 83f52e50aeSRandall Stewart 84f52e50aeSRandall Stewart static void 85f52e50aeSRandall Stewart kfrwk_task(void *context, int pending) 86f52e50aeSRandall Stewart { 87f52e50aeSRandall Stewart struct kern_totfrwk *tf; 88f52e50aeSRandall Stewart struct kern_test_entry *wk; 89f52e50aeSRandall Stewart int free_mem = 0; 90f52e50aeSRandall Stewart struct kern_test kt_data; 91f52e50aeSRandall Stewart kerntfunc ktf; 92f52e50aeSRandall Stewart 93f52e50aeSRandall Stewart memset(&kt_data, 0, sizeof(kt_data)); 94f52e50aeSRandall Stewart ktf = NULL; 95f52e50aeSRandall Stewart tf = (struct kern_totfrwk *)context; 96f52e50aeSRandall Stewart KTFRWK_LOCK(); 97f52e50aeSRandall Stewart wk = TAILQ_FIRST(&tf->kfrwk_testq); 98f52e50aeSRandall Stewart if (wk) { 99f52e50aeSRandall Stewart wk->kt_data.tot_threads_running--; 100f52e50aeSRandall Stewart tf->kfrwk_waiting--; 101f52e50aeSRandall Stewart memcpy(&kt_data, &wk->kt_data, sizeof(kt_data)); 102f52e50aeSRandall Stewart if (wk->kt_data.tot_threads_running == 0) { 103f52e50aeSRandall Stewart TAILQ_REMOVE(&tf->kfrwk_testq, wk, next); 104f52e50aeSRandall Stewart free_mem = 1; 105f52e50aeSRandall Stewart } else { 106f52e50aeSRandall Stewart /* Wake one of my colleages up to help too */ 107f52e50aeSRandall Stewart taskqueue_enqueue(tf->kfrwk_tq, &tf->kfrwk_que); 108f52e50aeSRandall Stewart } 109f52e50aeSRandall Stewart if (wk->kt_e) { 110f52e50aeSRandall Stewart ktf = wk->kt_e->func; 111f52e50aeSRandall Stewart } 112f52e50aeSRandall Stewart } 113f52e50aeSRandall Stewart KTFRWK_UNLOCK(); 114f52e50aeSRandall Stewart if (wk && free_mem) { 115f52e50aeSRandall Stewart free(wk, M_KTFRWK); 116f52e50aeSRandall Stewart } 117f52e50aeSRandall Stewart /* Execute the test */ 118f52e50aeSRandall Stewart if (ktf) { 119f52e50aeSRandall Stewart (*ktf) (&kt_data); 120f52e50aeSRandall Stewart } 121f52e50aeSRandall Stewart /* We are done */ 122f52e50aeSRandall Stewart atomic_add_int(&tf->kfrwk_waiting, 1); 123f52e50aeSRandall Stewart } 124f52e50aeSRandall Stewart 125f52e50aeSRandall Stewart static int 126f52e50aeSRandall Stewart kerntest_frwk_init(void) 127f52e50aeSRandall Stewart { 128f52e50aeSRandall Stewart u_int ncpus = mp_ncpus ? mp_ncpus : MAXCPU; 129f52e50aeSRandall Stewart 130f52e50aeSRandall Stewart KTFRWK_MUTEX_INIT(); 131f52e50aeSRandall Stewart TAILQ_INIT(&kfrwk.kfrwk_testq); 132f52e50aeSRandall Stewart TAILQ_INIT(&kfrwk.kfrwk_testlist); 133f52e50aeSRandall Stewart /* Now lets start up a number of tasks to do the work */ 134f52e50aeSRandall Stewart TASK_INIT(&kfrwk.kfrwk_que, 0, kfrwk_task, &kfrwk); 135f52e50aeSRandall Stewart kfrwk.kfrwk_tq = taskqueue_create_fast("sbtls_task", M_NOWAIT, 136f52e50aeSRandall Stewart taskqueue_thread_enqueue, &kfrwk.kfrwk_tq); 137f52e50aeSRandall Stewart if (kfrwk.kfrwk_tq == NULL) { 138f52e50aeSRandall Stewart printf("Can't start taskqueue for Kernel Test Framework\n"); 139f52e50aeSRandall Stewart panic("Taskqueue init fails for kfrwk"); 140f52e50aeSRandall Stewart } 141f52e50aeSRandall Stewart taskqueue_start_threads(&kfrwk.kfrwk_tq, ncpus, PI_NET, "[kt_frwk task]"); 142f52e50aeSRandall Stewart kfrwk.kfrwk_waiting = ncpus; 143f52e50aeSRandall Stewart ktest_frwk_inited = 1; 144f52e50aeSRandall Stewart return (0); 145f52e50aeSRandall Stewart } 146f52e50aeSRandall Stewart 147f52e50aeSRandall Stewart static int 148f52e50aeSRandall Stewart kerntest_frwk_fini(void) 149f52e50aeSRandall Stewart { 150f52e50aeSRandall Stewart KTFRWK_LOCK(); 151f52e50aeSRandall Stewart if (!TAILQ_EMPTY(&kfrwk.kfrwk_testlist)) { 152f52e50aeSRandall Stewart /* Still modules registered */ 153f52e50aeSRandall Stewart KTFRWK_UNLOCK(); 154f52e50aeSRandall Stewart return (EBUSY); 155f52e50aeSRandall Stewart } 156f52e50aeSRandall Stewart ktest_frwk_inited = 0; 157f52e50aeSRandall Stewart KTFRWK_UNLOCK(); 158f52e50aeSRandall Stewart taskqueue_free(kfrwk.kfrwk_tq); 159f52e50aeSRandall Stewart /* Ok lets destroy the mutex on the way outs */ 160f52e50aeSRandall Stewart KTFRWK_DESTROY(); 161f52e50aeSRandall Stewart return (0); 162f52e50aeSRandall Stewart } 163f52e50aeSRandall Stewart 164f52e50aeSRandall Stewart 165f52e50aeSRandall Stewart static int kerntest_execute(SYSCTL_HANDLER_ARGS); 166f52e50aeSRandall Stewart 1677029da5cSPawel Biernacki SYSCTL_NODE(_kern, OID_AUTO, testfrwk, CTLFLAG_RW | CTLFLAG_MPSAFE, 0, 1687029da5cSPawel Biernacki "Kernel Test Framework"); 1697029da5cSPawel Biernacki SYSCTL_PROC(_kern_testfrwk, OID_AUTO, runtest, 1707029da5cSPawel Biernacki CTLTYPE_STRUCT | CTLFLAG_RW | CTLFLAG_NEEDGIANT, 1717029da5cSPawel Biernacki 0, 0, kerntest_execute, "IU", 1727029da5cSPawel Biernacki "Execute a kernel test"); 173f52e50aeSRandall Stewart 174f52e50aeSRandall Stewart int 175f52e50aeSRandall Stewart kerntest_execute(SYSCTL_HANDLER_ARGS) 176f52e50aeSRandall Stewart { 177f52e50aeSRandall Stewart struct kern_test kt; 178f52e50aeSRandall Stewart struct kern_test_list *li, *te = NULL; 179f52e50aeSRandall Stewart struct kern_test_entry *kte = NULL; 180f52e50aeSRandall Stewart int error = 0; 181f52e50aeSRandall Stewart 182f52e50aeSRandall Stewart if (ktest_frwk_inited == 0) { 183f52e50aeSRandall Stewart return (ENOENT); 184f52e50aeSRandall Stewart } 185f52e50aeSRandall Stewart /* Find the entry if possible */ 186f52e50aeSRandall Stewart error = SYSCTL_IN(req, &kt, sizeof(struct kern_test)); 187f52e50aeSRandall Stewart if (error) { 188f52e50aeSRandall Stewart return (error); 189f52e50aeSRandall Stewart } 190f52e50aeSRandall Stewart if (kt.num_threads <= 0) { 191f52e50aeSRandall Stewart return (EINVAL); 192f52e50aeSRandall Stewart } 193f52e50aeSRandall Stewart /* Grab some memory */ 194f52e50aeSRandall Stewart kte = malloc(sizeof(struct kern_test_entry), M_KTFRWK, M_WAITOK); 195f52e50aeSRandall Stewart KTFRWK_LOCK(); 196f52e50aeSRandall Stewart TAILQ_FOREACH(li, &kfrwk.kfrwk_testlist, next) { 197f52e50aeSRandall Stewart if (strcmp(li->name, kt.name) == 0) { 198f52e50aeSRandall Stewart te = li; 199f52e50aeSRandall Stewart break; 200f52e50aeSRandall Stewart } 201f52e50aeSRandall Stewart } 202f52e50aeSRandall Stewart if (te == NULL) { 203f52e50aeSRandall Stewart printf("Can't find the test %s\n", kt.name); 204f52e50aeSRandall Stewart error = ENOENT; 205f52e50aeSRandall Stewart free(kte, M_KTFRWK); 206f52e50aeSRandall Stewart goto out; 207f52e50aeSRandall Stewart } 208f52e50aeSRandall Stewart /* Ok we have a test item to run, can we? */ 209f52e50aeSRandall Stewart if (!TAILQ_EMPTY(&kfrwk.kfrwk_testq)) { 210f52e50aeSRandall Stewart /* We don't know if there is enough threads */ 211f52e50aeSRandall Stewart error = EAGAIN; 212f52e50aeSRandall Stewart free(kte, M_KTFRWK); 213f52e50aeSRandall Stewart goto out; 214f52e50aeSRandall Stewart } 215f52e50aeSRandall Stewart if (kfrwk.kfrwk_waiting < kt.num_threads) { 216f52e50aeSRandall Stewart error = E2BIG; 217f52e50aeSRandall Stewart free(kte, M_KTFRWK); 218f52e50aeSRandall Stewart goto out; 219f52e50aeSRandall Stewart } 220f52e50aeSRandall Stewart kt.tot_threads_running = kt.num_threads; 221f52e50aeSRandall Stewart /* Ok it looks like we can do it, lets get an entry */ 222f52e50aeSRandall Stewart kte->kt_e = li; 223f52e50aeSRandall Stewart memcpy(&kte->kt_data, &kt, sizeof(kt)); 224f52e50aeSRandall Stewart TAILQ_INSERT_TAIL(&kfrwk.kfrwk_testq, kte, next); 225f52e50aeSRandall Stewart taskqueue_enqueue(kfrwk.kfrwk_tq, &kfrwk.kfrwk_que); 226f52e50aeSRandall Stewart out: 227f52e50aeSRandall Stewart KTFRWK_UNLOCK(); 228f52e50aeSRandall Stewart return (error); 229f52e50aeSRandall Stewart } 230f52e50aeSRandall Stewart 231f52e50aeSRandall Stewart int 232f52e50aeSRandall Stewart kern_testframework_register(const char *name, kerntfunc func) 233f52e50aeSRandall Stewart { 234f52e50aeSRandall Stewart int error = 0; 235f52e50aeSRandall Stewart struct kern_test_list *li, *te = NULL; 236f52e50aeSRandall Stewart int len; 237f52e50aeSRandall Stewart 238f52e50aeSRandall Stewart len = strlen(name); 239f52e50aeSRandall Stewart if (len >= TEST_NAME_LEN) { 240f52e50aeSRandall Stewart return (E2BIG); 241f52e50aeSRandall Stewart } 242f52e50aeSRandall Stewart te = malloc(sizeof(struct kern_test_list), M_KTFRWK, M_WAITOK); 243f52e50aeSRandall Stewart KTFRWK_LOCK(); 244f52e50aeSRandall Stewart /* First does it already exist? */ 245f52e50aeSRandall Stewart TAILQ_FOREACH(li, &kfrwk.kfrwk_testlist, next) { 246f52e50aeSRandall Stewart if (strcmp(li->name, name) == 0) { 247f52e50aeSRandall Stewart error = EALREADY; 248f52e50aeSRandall Stewart free(te, M_KTFRWK); 249f52e50aeSRandall Stewart goto out; 250f52e50aeSRandall Stewart } 251f52e50aeSRandall Stewart } 252f52e50aeSRandall Stewart /* Ok we can do it, lets add it to the list */ 253f52e50aeSRandall Stewart te->func = func; 254f52e50aeSRandall Stewart strcpy(te->name, name); 255f52e50aeSRandall Stewart TAILQ_INSERT_TAIL(&kfrwk.kfrwk_testlist, te, next); 256f52e50aeSRandall Stewart out: 257f52e50aeSRandall Stewart KTFRWK_UNLOCK(); 258f52e50aeSRandall Stewart return (error); 259f52e50aeSRandall Stewart } 260f52e50aeSRandall Stewart 261f52e50aeSRandall Stewart int 262f52e50aeSRandall Stewart kern_testframework_deregister(const char *name) 263f52e50aeSRandall Stewart { 264f52e50aeSRandall Stewart struct kern_test_list *li, *te = NULL; 265f52e50aeSRandall Stewart u_int ncpus = mp_ncpus ? mp_ncpus : MAXCPU; 266f52e50aeSRandall Stewart int error = 0; 267f52e50aeSRandall Stewart 268f52e50aeSRandall Stewart KTFRWK_LOCK(); 269f52e50aeSRandall Stewart /* First does it already exist? */ 270f52e50aeSRandall Stewart TAILQ_FOREACH(li, &kfrwk.kfrwk_testlist, next) { 271f52e50aeSRandall Stewart if (strcmp(li->name, name) == 0) { 272f52e50aeSRandall Stewart te = li; 273f52e50aeSRandall Stewart break; 274f52e50aeSRandall Stewart } 275f52e50aeSRandall Stewart } 276f52e50aeSRandall Stewart if (te == NULL) { 277f52e50aeSRandall Stewart /* It is not registered so no problem */ 278f52e50aeSRandall Stewart goto out; 279f52e50aeSRandall Stewart } 280f52e50aeSRandall Stewart if (ncpus != kfrwk.kfrwk_waiting) { 281f52e50aeSRandall Stewart /* We are busy executing something -- can't unload */ 282f52e50aeSRandall Stewart error = EBUSY; 283f52e50aeSRandall Stewart goto out; 284f52e50aeSRandall Stewart } 285f52e50aeSRandall Stewart if (!TAILQ_EMPTY(&kfrwk.kfrwk_testq)) { 286f52e50aeSRandall Stewart /* Something still to execute */ 287f52e50aeSRandall Stewart error = EBUSY; 288f52e50aeSRandall Stewart goto out; 289f52e50aeSRandall Stewart } 290f52e50aeSRandall Stewart /* Ok we can remove the dude safely */ 291f52e50aeSRandall Stewart TAILQ_REMOVE(&kfrwk.kfrwk_testlist, te, next); 292f52e50aeSRandall Stewart memset(te, 0, sizeof(struct kern_test_list)); 293f52e50aeSRandall Stewart free(te, M_KTFRWK); 294f52e50aeSRandall Stewart out: 295f52e50aeSRandall Stewart KTFRWK_UNLOCK(); 296f52e50aeSRandall Stewart return (error); 297f52e50aeSRandall Stewart } 298f52e50aeSRandall Stewart 299f52e50aeSRandall Stewart static int 300f52e50aeSRandall Stewart kerntest_mod_init(module_t mod, int type, void *data) 301f52e50aeSRandall Stewart { 302f52e50aeSRandall Stewart int err; 303f52e50aeSRandall Stewart 304f52e50aeSRandall Stewart switch (type) { 305f52e50aeSRandall Stewart case MOD_LOAD: 306f52e50aeSRandall Stewart err = kerntest_frwk_init(); 307f52e50aeSRandall Stewart break; 308f52e50aeSRandall Stewart case MOD_QUIESCE: 309f52e50aeSRandall Stewart KTFRWK_LOCK(); 310f52e50aeSRandall Stewart if (TAILQ_EMPTY(&kfrwk.kfrwk_testlist)) { 311f52e50aeSRandall Stewart err = 0; 312f52e50aeSRandall Stewart } else { 313f52e50aeSRandall Stewart err = EBUSY; 314f52e50aeSRandall Stewart } 315f52e50aeSRandall Stewart KTFRWK_UNLOCK(); 316f52e50aeSRandall Stewart break; 317f52e50aeSRandall Stewart case MOD_UNLOAD: 318f52e50aeSRandall Stewart err = kerntest_frwk_fini(); 319f52e50aeSRandall Stewart break; 320f52e50aeSRandall Stewart default: 321f52e50aeSRandall Stewart return (EOPNOTSUPP); 322f52e50aeSRandall Stewart } 323f52e50aeSRandall Stewart return (err); 324f52e50aeSRandall Stewart } 325f52e50aeSRandall Stewart 326f52e50aeSRandall Stewart static moduledata_t kern_test_framework = { 327f52e50aeSRandall Stewart .name = "kernel_testfrwk", 328f52e50aeSRandall Stewart .evhand = kerntest_mod_init, 329f52e50aeSRandall Stewart .priv = 0 330f52e50aeSRandall Stewart }; 331f52e50aeSRandall Stewart 332f52e50aeSRandall Stewart MODULE_VERSION(kern_testframework, 1); 333f52e50aeSRandall Stewart DECLARE_MODULE(kern_testframework, kern_test_framework, SI_SUB_PSEUDO, SI_ORDER_ANY); 334