operatingSystemKernel/Test4.cpp at main · brkagithub/operatingSystemKernel · GitHub

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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
/*#include "kernel.h"
#include "Thread.h"
#include "PCB.h"
#include <iostream.h>
#include "SortedLi.h"
#include "KrnlSem.h"

// 	 Test: razlicita vremena izvrsavanja i velicine steka

volatile Time ts;

void tick()
{
	lock
	cout << "timeSlice=" << ts << endl;
	unlock
}

class TestThread : public Thread
{
private:
	Time myTimeSlice;
public:

	TestThread(StackSize stackSize, Time timeSlice): Thread(stackSize,timeSlice), myTimeSlice(timeSlice) {};
	~TestThread()
	{
		waitToComplete();
	}
protected:

	void run();

};

void TestThread::run()
{
	for(unsigned i=0;i<32000;i++)
	{
		for(unsigned int j=0;j<32000;j++)
		{
			ts = myTimeSlice;
		}
	}
}


int userMain(int argc, char** argv)
{
	lock
	cout << "Test starts.\n";
	unlock

	TestThread t1(64,0), t2(4096,32), t3(1024,16), t4(4096,0);
	t1.start();
	t2.start();
	t3.start();
	t4.start();
	t1.waitToComplete();
	t2.waitToComplete();
	t3.waitToComplete();
	t4.waitToComplete();
	lock
	cout << "Test ends.\n";
	unlock

	LList<int> lista;

	int aa = 1;
	int bb = 2;
	int cc = 3;
	int dd = 4;
	int ee = 5;
	int ff = 6;

	int * a = &aa;
	int * b = &bb;
	int * c = &cc;
	int * d = &dd;
	int * e = &ee;
	int * f = &ff;

	lista.add(a);
	lista.add(b);
	lista.add(c);
	lista.add(d);

	for(lista.toHead(); lista.hasCurr(); lista.toNext()){
		cout << *(lista.curr->tt) << endl;
	}

	cout << endl;

	lista.remove();
	lista.remove();

	for(lista.toHead(); lista.hasCurr(); lista.toNext()){
			cout << *(lista.curr->tt)  << endl;
	}

	cout << endl;

	lista.add(e);
	lista.remove();
	lista.add(f);

	for(lista.toHead(); lista.hasCurr(); lista.toNext()){
		cout << *(lista.curr->tt)  << endl;
	}


	SortedList<timePCB> lista;

	int aa = 1;
	int bb = 2;
	int cc = 3;
	int dd = 4;
	int ee = 5;
	int ff = 6;

	timePCB* a = new timePCB(0, 1);
	timePCB* b = new timePCB(0, 2);
	timePCB* c = new timePCB(0, 3);
	timePCB* d = new timePCB(0, 4);
	timePCB* e = new timePCB(0, 5);
	timePCB* f = new timePCB(0, 6);

	lista.add(f);
	lista.add(c);
	lista.add(e);
	lista.add(b);
	//lista.remove();
	lista.add(d);
	lista.add(b);
	lista.add(a);
	lista.add(f);
	for(lista.toHead(); lista.hasCurr(); lista.toNext()){
			cout << *(lista.curr->tt) << endl;
	}

	return 0;
}
*/