- test for scheduler implemented

This commit is contained in:
Martin Willi 2005-11-07 15:55:00 +00:00
parent ab4f404e72
commit f784ea8562
2 changed files with 123 additions and 0 deletions

View File

@ -0,0 +1,88 @@
/**
* @file scheduler_test.c
*
* @brief Tests to test the Scheduler (type scheduler_t)
*
*/
/*
* Copyright (C) 2005 Jan Hutter, Martin Willi
* Hochschule fuer Technik Rapperswil
*
* 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 2 of the License, or (at your
* option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
*
* 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.
*/
#include <string.h>
#include <unistd.h>
#include "scheduler_test.h"
#include "../globals.h"
#include "../scheduler.h"
#include "../event_queue.h"
#include "../job_queue.h"
/**
* @brief implementation of a scheduler test
*
* This one uses relative time events, which are not that exact.
* Test may fail on too slow machines.
*/
void test_scheduler(tester_t *tester)
{
int job_count = 5;
int job_queue_size;
int event_queue_size;
job_t *jobs[job_count];
int current;
scheduler_t *scheduler = scheduler_create();
/* schedule 5 jobs */
for (current = 0; current < job_count; current++)
{
jobs[current] = job_create(INCOMING_PACKET, (void*)current);
global_event_queue->add_relative(global_event_queue, jobs[current], (current+1) * 500);
}
for (current = 0; current < job_count; current++)
{
jobs[current] = NULL;
}
usleep(50 * 1000);
/* check if times are correct */
for (current = 0; current < job_count; current++)
{
usleep(400 * 1000);
global_event_queue->get_count(global_event_queue, &event_queue_size);
global_job_queue->get_count(global_job_queue, &job_queue_size);
tester->assert_true(tester, (job_queue_size == current ), "job-queue size before event");
tester->assert_true(tester, (event_queue_size == job_count - current), "event-queue size before event");
usleep(100 * 1000);
global_event_queue->get_count(global_event_queue, &event_queue_size);
global_job_queue->get_count(global_job_queue, &job_queue_size);
tester->assert_true(tester, (job_queue_size == current + 1), "job-queue size after event");
tester->assert_true(tester, (event_queue_size == job_count - current - 1), "event-queue size after event");
}
/* check job order */
for (current = 0; current < job_count; current++)
{
global_job_queue->get(global_job_queue, &(jobs[current]));
tester->assert_true(tester, ((int)jobs[current]->assigned_data == current), "job order");
jobs[current]->destroy(jobs[current]);
}
/* destruction test */
tester->assert_true(tester, (scheduler->destroy(scheduler) == SUCCESS), "destroy call check");
}

View File

@ -0,0 +1,35 @@
/**
* @file scheduler_test.h
*
* @brief Tests to test the scheduler (type scheduler_t)
*
*/
/*
* Copyright (C) 2005 Jan Hutter, Martin Willi
* Hochschule fuer Technik Rapperswil
*
* 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 2 of the License, or (at your
* option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
*
* 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.
*/
#ifndef SCHEDULER_TEST_H_
#define SCHEDULER_TEST_H_
#include "../tester.h"
/**
* @brief Test function for the type scheduler_t
*
* @param tester tester object
*/
void test_scheduler(tester_t *tester);
#endif /*SCHEDULER_TEST_H_*/