/* * Ouroboros - Copyright (C) 2016 - 2017 * * SDU scheduler component * * Dimitri Staessens <dimitri.staessens@ugent.be> * Sander Vrijders <sander.vrijders@ugent.be> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., http://www.fsf.org/about/contact/. */ #define _POSIX_C_SOURCE 199309L #include "config.h" #define OUROBOROS_PREFIX "sdu-scheduler" #include <ouroboros/logs.h> #include <ouroboros/errno.h> #include "sdu_sched.h" #include <stdbool.h> #include <assert.h> #include <stdlib.h> #define FD_UPDATE_TIMEOUT 10000 /* nanoseconds */ struct sdu_sched { fset_t * set[QOS_CUBE_MAX]; next_sdu_fn_t callback; pthread_t sdu_readers[IPCP_SCHED_THREADS]; }; static void cleanup_reader(void * o) { int i; fqueue_t ** fqs = (fqueue_t **) o; for (i = 0; i < QOS_CUBE_MAX; ++i) fqueue_destroy(fqs[i]); } static void * sdu_reader(void * o) { struct sdu_sched * sched; struct shm_du_buff * sdb; struct timespec timeout = {0, FD_UPDATE_TIMEOUT}; int fd; int i = 0; int ret; fqueue_t * fqs[QOS_CUBE_MAX]; sched = (struct sdu_sched *) o; for (i = 0; i < QOS_CUBE_MAX; ++i) { fqs[i] = fqueue_create(); if (fqs[i] == NULL) { int j; for (j = 0; j < i; ++j) fqueue_destroy(fqs[j]); return (void *) -1; } } pthread_cleanup_push(cleanup_reader, fqs); while (true) { /* FIXME: replace with scheduling policy call */ i = (i + 1) % QOS_CUBE_MAX; ret = fevent(sched->set[i], fqs[i], &timeout); if (ret == -ETIMEDOUT) continue; if (ret < 0) { log_warn("Event error: %d.", ret); continue; } while ((fd = fqueue_next(fqs[i])) >= 0) { if (ipcp_flow_read(fd, &sdb)) { log_warn("Failed to read SDU from fd %d.", fd); continue; } sched->callback(fd, i, sdb); } } pthread_cleanup_pop(true); return (void *) 0; } struct sdu_sched * sdu_sched_create(next_sdu_fn_t callback) { struct sdu_sched * sdu_sched; int i; int j; sdu_sched = malloc(sizeof(*sdu_sched)); if (sdu_sched == NULL) goto fail_malloc; assert(callback); sdu_sched->callback = callback; for (i = 0; i < QOS_CUBE_MAX; ++i) { sdu_sched->set[i] = fset_create(); if (sdu_sched->set[i] == NULL) { for (j = 0; j < i; ++j) fset_destroy(sdu_sched->set[j]); goto fail_flow_set; } } for (i = 0; i < IPCP_SCHED_THREADS; ++i) { if (pthread_create(&sdu_sched->sdu_readers[i], NULL, sdu_reader, sdu_sched)) { int j; for (j = 0; j < i; ++j) { pthread_cancel(sdu_sched->sdu_readers[j]); pthread_join(sdu_sched->sdu_readers[j], NULL); } goto fail_flow_set; } } return sdu_sched; fail_flow_set: free(sdu_sched); fail_malloc: return NULL; } void sdu_sched_destroy(struct sdu_sched * sdu_sched) { int i; assert(sdu_sched); for (i = 0; i < IPCP_SCHED_THREADS; ++i) { pthread_cancel(sdu_sched->sdu_readers[i]); pthread_join(sdu_sched->sdu_readers[i], NULL); } for (i = 0; i < QOS_CUBE_MAX; ++i) fset_destroy(sdu_sched->set[i]); free(sdu_sched); } void sdu_sched_add(struct sdu_sched * sdu_sched, int fd) { qoscube_t qc; assert(sdu_sched); ipcp_flow_get_qoscube(fd, &qc); fset_add(sdu_sched->set[qc], fd); } void sdu_sched_del(struct sdu_sched * sdu_sched, int fd) { qoscube_t qc; assert(sdu_sched); ipcp_flow_get_qoscube(fd, &qc); fset_del(sdu_sched->set[qc], fd); }