2021-06-09 11:35:47 +02:00
|
|
|
//=-------------------------------------------------------------------------=//
|
|
|
|
// Main //
|
|
|
|
// //
|
|
|
|
// Copyright © 2021 The Gem-graph Project //
|
|
|
|
// //
|
|
|
|
// This file is part of gem-graph. //
|
|
|
|
// //
|
|
|
|
// This program is free software: you can redistribute it and/or modify //
|
|
|
|
// it under the terms of the GNU Affero 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 Affero General Public License for more details. //
|
|
|
|
// //
|
|
|
|
// You should have received a copy of the GNU Affero General Public License //
|
|
|
|
// along with this program. If not, see <https://www.gnu.org/licenses/>. //
|
|
|
|
//=-------------------------------------------------------------------------=//
|
|
|
|
|
2021-06-09 14:40:23 +02:00
|
|
|
#include "../include/base.h"
|
2021-06-09 11:54:58 +02:00
|
|
|
#include "../include/server.h"
|
|
|
|
#include "../include/scheduler.h"
|
2021-06-09 11:35:47 +02:00
|
|
|
|
|
|
|
|
|
|
|
#define ARROW_NUMBER 150
|
|
|
|
#define MAX_CYCLES 40000
|
|
|
|
#define SPACE_SIZE 10000
|
|
|
|
#define MAX_THREAD 0
|
|
|
|
|
|
|
|
|
|
|
|
int main(int argc, char **argv)
|
|
|
|
{
|
|
|
|
BoolArray_t *globalPreemptionSpace = NULL;
|
|
|
|
IntArray_t *globalDrawingSpace = NULL;
|
|
|
|
IntArray_t *arrowList = NULL;
|
2021-06-09 14:40:23 +02:00
|
|
|
IntArray_t *transitionsTree = NULL;
|
2021-06-09 11:35:47 +02:00
|
|
|
|
|
|
|
globalPreemptionSpace = (BoolArray_t*) malloc(sizeof(BoolArray_t));
|
|
|
|
globalPreemptionSpace->space = (bool*) malloc(sizeof(bool)*SPACE_SIZE);
|
|
|
|
globalPreemptionSpace->size = SPACE_SIZE;
|
|
|
|
|
|
|
|
globalDrawingSpace = (IntArray_t*) malloc(sizeof(IntArray_t));
|
|
|
|
globalDrawingSpace->space = (int*) malloc(sizeof(int)*SPACE_SIZE);
|
|
|
|
globalDrawingSpace->size = SPACE_SIZE;
|
|
|
|
|
|
|
|
arrowList = (IntArray_t*) malloc(sizeof(IntArray_t));
|
|
|
|
arrowList->space = (int*) malloc(sizeof(int)*ARROW_NUMBER);
|
|
|
|
arrowList->size = ARROW_NUMBER;
|
|
|
|
|
2021-06-09 14:40:23 +02:00
|
|
|
printf("globalPreemptionSpace: %p, size: %lu\n", globalPreemptionSpace,
|
|
|
|
globalDrawingSpace->size);
|
|
|
|
printf("globalDrawingSpace: %p, size: %lu\n", globalDrawingSpace,
|
|
|
|
globalDrawingSpace->size);
|
2021-06-09 12:16:27 +02:00
|
|
|
printf("arrowList: %p, size: %lu\n", arrowList, arrowList->size);
|
|
|
|
|
2021-06-09 14:40:23 +02:00
|
|
|
//
|
|
|
|
// Calling the scheduler !
|
|
|
|
//
|
|
|
|
pthread_t *schedThread = SchedInit(globalPreemptionSpace, transitionsTree, arrowList, MAX_THREAD,
|
|
|
|
MAX_CYCLES);
|
|
|
|
|
2021-06-09 23:56:42 +02:00
|
|
|
SchedWait(schedThread);
|
|
|
|
|
|
|
|
SchedDestroy(schedThread);
|
2021-06-09 14:40:23 +02:00
|
|
|
|
2021-06-09 12:23:42 +02:00
|
|
|
free(globalDrawingSpace->space);
|
|
|
|
free(globalDrawingSpace);
|
2021-06-09 14:40:23 +02:00
|
|
|
|
2021-06-09 12:23:42 +02:00
|
|
|
free(globalPreemptionSpace->space);
|
|
|
|
free(globalPreemptionSpace);
|
2021-06-09 14:40:23 +02:00
|
|
|
|
2021-06-09 12:23:42 +02:00
|
|
|
free(arrowList->space);
|
|
|
|
free(arrowList);
|
|
|
|
|
2021-06-09 23:56:42 +02:00
|
|
|
return 0;
|
2021-06-09 11:35:47 +02:00
|
|
|
}
|