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