//=-------------------------------------------------------------------------=// // 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 . // //=-------------------------------------------------------------------------=// #include #include #include #include "types.h" #include "server.h" #include "scheduler.h" #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; IntArray_t *transitionTree = NULL; 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; printf("globalPreemptionSpace: %p, size: %d\n", globalPreemptionSpace, globalDrawingSpace->size); printf("globalDrawingSpace: %p, size: %d\n", globalDrawingSpace, globalDrawingSpace->size); printf("arrowList: %p, size: %d\n", arrowList, arrowList->size); }