forked from 16priyesh/DME-algorithm
-
Notifications
You must be signed in to change notification settings - Fork 1
/
main.cpp
52 lines (43 loc) · 1.42 KB
/
main.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <iostream>
#include <fstream>
#include <cstdio>
#include <stdlib.h>
#include <fstream>
#include "Node.cpp"
using namespace std;
extern ofstream out_file, log_file; // output and log files
int main(int argc, char* argv[])
{
// input format validation
if(argc!=3){
printf("Usage: ./main <inputfile> nodeCount\n");
return 0;
}
// local variables
int i;
out_file.open("output.txt");
log_file.open("log.txt");
// creating Nodes
int nodeCount = atoi(argv[2]);
Node* Node_Array[nodeCount];
// create tree structure from nodes
Node_Array[0] = new Node(0, NULL);
Node_Array[0]->HANDLE_EVENT("privilege", NULL);
for(i=1; i<nodeCount-1; i+=2){
Node_Array[i] = new Node(i, Node_Array[i/2]);
Node_Array[i+1] = new Node(i+1, Node_Array[i/2]);
}
if((nodeCount&1)==0) Node_Array[i] = new Node(i, Node_Array[i/2]);
//input processing from text file
ifstream file(argv[1]); // pass file name as argument
int linebuffer; // input integer node number
while(file>>linebuffer){
/* input checking and error handling*/
if(linebuffer >= 0 && linebuffer < nodeCount){
log_file<<"Node "<<linebuffer<<" wants to enter critical section"<<endl;
Node_Array[linebuffer]->HANDLE_EVENT("enter critical section", NULL);
}
}
out_file.close();
log_file.close();
}