event_dispatcher_start.c 2.43 KB
/**
 * \file
 *
 * \author	Georg Hopp
 *
 * \copyright
 * Copyright © 2014 Georg Hopp
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * 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, see <http://www.gnu.org/licenses/>.
 */

#include <time.h>

#include "trbase.h"
#include "trdata.h"
#include "trhash.h"

#include "tr/event.h"
#include "tr/event_subject.h"
#include "tr/event_dispatcher.h"

void
TR_eventDispatcherStart(TR_EventDispatcher this)
{
	this->running = 1;

	while (this->running || (! TR_queueEmpty(this->events))) {
		struct timespec tp;
		int             now; // milliseconds
		TR_Event        current = NULL;

		clock_gettime(CLOCK_REALTIME, &tp);
		now = tp.tv_sec * 1000 + tp.tv_nsec / 1000000;

		if (this->nextbeat && this->nextbeat <= now) {
			this->nextbeat += this->heartbeat;
			TR_eventDispatcherEnqueueEvent(
					this, 
					TR_eventSubjectEmit(
						(TR_EventSubject)this,
						TR_DISPATCHER_EVENT_HEARTBEAT,
						NULL));
		}

		if (TR_queueEmpty(this->events)) {
			if (TR_EVD_CLIENT == this->mode) {
				current = TR_eventSubjectEmit(
						(TR_EventSubject)this,
						TR_DISPATCHER_EVENT_USER_WAIT,
						NULL);
			} else {
				current = TR_eventSubjectEmit(
						(TR_EventSubject)this,
						TR_DISPATCHER_EVENT_DATA_WAIT,
						NULL);
			}
		} else {
			current = TR_queueGet(this->events);
		}

		if (current) {
			TR_Queue     handler_queue;
			TR_HashValue handler_queue_hv = TR_hashGetByVal(
					this->handler,
					TR_sdbm(
						(unsigned char *)&(current->id),
						sizeof(current->id)));

			handler_queue = handler_queue_hv
				? *(TR_Queue *)handler_queue_hv->value
				: NULL;

			if (handler_queue && ! TR_queueEmpty(handler_queue)) {
				TR_Queue queue_node = handler_queue->first;

				while (queue_node) {
					TR_EventHandler handler = queue_node->msg;
					if (TR_eventHandlerHandleEvent(handler, current)) break;
					queue_node = queue_node->next;
				}
			}

			TR_delete(current);
		}
	}
}

// vim: set ts=4 sw=4: