/* $OpenBSD: kern_sensors.c,v 1.8 2006/03/12 13:48:32 dlg Exp $ */ /* * Copyright (c) 2005 David Gwynne * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */ #include #include #include #include #include #include #include #include #include int sensors_count = 0; SLIST_HEAD(, sensor) sensors_list = SLIST_HEAD_INITIALIZER(&sensors_list); struct sensor_task { void *arg; void (*func)(void *); int period; time_t nextrun; volatile int running; TAILQ_ENTRY(sensor_task) entry; }; void sensor_task_create(void *); void sensor_task_thread(void *); void sensor_task_schedule(struct sensor_task *); TAILQ_HEAD(, sensor_task) tasklist = TAILQ_HEAD_INITIALIZER(tasklist); void sensor_add(struct sensor *sens) { struct sensor *v, *nv; int s; s = splhigh(); if (sensors_count == 0) { sens->num = 0; SLIST_INSERT_HEAD(&sensors_list, sens, list); } else { for (v = SLIST_FIRST(&sensors_list); (nv = SLIST_NEXT(v, list)) != NULL; v = nv) if (nv->num - v->num > 1) break; sens->num = v->num + 1; SLIST_INSERT_AFTER(v, sens, list); } sensors_count++; splx(s); } void sensor_del(struct sensor *sens) { int s; s = splhigh(); sensors_count--; SLIST_REMOVE(&sensors_list, sens, sensor, list); splx(s); } struct sensor * sensor_get(int num) { struct sensor *s; SLIST_FOREACH(s, &sensors_list, list) { if (s->num == num) return (s); } return (NULL); } int sensor_task_register(void *arg, void (*func)(void *), int period) { struct sensor_task *st; st = malloc(sizeof(struct sensor_task), M_DEVBUF, M_NOWAIT); if (st == NULL) return (1); st->arg = arg; st->func = func; st->period = period; st->running = 1; if (TAILQ_EMPTY(&tasklist)) kthread_create_deferred(sensor_task_create, NULL); sensor_task_schedule(st); wakeup(&tasklist); return (0); } void sensor_task_unregister(void *arg) { struct sensor_task *st; TAILQ_FOREACH(st, &tasklist, entry) { if (st->arg == arg) st->running = 0; } } void sensor_task_create(void *arg) { if (kthread_create(sensor_task_thread, NULL, NULL, "sensors") != 0) panic("sensors kthread"); } void sensor_task_thread(void *arg) { struct sensor_task *st, *nst; time_t now; while (!TAILQ_EMPTY(&tasklist)) { while ((nst = TAILQ_FIRST(&tasklist))->nextrun > (now = time_uptime)) tsleep(&tasklist, PWAIT, "timeout", (nst->nextrun - now) * hz); while ((st = nst) != NULL) { nst = TAILQ_NEXT(st, entry); if (st->nextrun > now) break; /* take it out while we work on it */ TAILQ_REMOVE(&tasklist, st, entry); if (!st->running) { free(st, M_DEVBUF); continue; } /* run the task */ st->func(st->arg); /* stick it back in the tasklist */ sensor_task_schedule(st); } } kthread_exit(0); } void sensor_task_schedule(struct sensor_task *st) { struct sensor_task *cst; st->nextrun = time_uptime + st->period; TAILQ_FOREACH(cst, &tasklist, entry) { if (cst->nextrun > st->nextrun) { TAILQ_INSERT_BEFORE(cst, st, entry); return; } } /* must be an empty list, or at the end of the list */ TAILQ_INSERT_TAIL(&tasklist, st, entry); }