cfs_simulator/CFS_RQ.cpp at master · ahidalgob/cfs_simulator · 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

#include "CFS_RQ.h"
#include "limits.h"

#include <algorithm>

CFS_RQ::CFS_RQ()
{
	pthread_mutex_init(&mutex, NULL);
}


void CFS_RQ::lock()
{
	pthread_mutex_lock(&mutex);
}


void CFS_RQ::unlock()
{
	pthread_mutex_unlock(&mutex);
}


bool CFS_RQ::empty()
{
	return rb_tree.empty();
}


int CFS_RQ::size()
{
	return rb_tree.size();
}

void CFS_RQ::insert(TASK tsk)
{
	rb_tree.insert(tsk);
}


TASK CFS_RQ::pop_min()
{
	TASK tsk;
	tsk.nice = 100;
	if(!rb_tree.empty())
	{
		tsk = *(rb_tree.begin());
		rb_tree.erase(rb_tree.begin());
	}
	return tsk;
}


long long int CFS_RQ::get_min_v_runtime()
{
	long long ret=LLONG_MAX;
	if(!rb_tree.empty())
	{
		ret = rb_tree.begin()->v_runtime;
	}
	return ret;
}

int CFS_RQ::get_id()
{
	int ret=0;
	if(!rb_tree.empty())
	{
		ret = rb_tree.begin()->id;
	}
	return ret;
}

int CFS_RQ::get_v_runtime()
{
	int ret=0;
	if(!rb_tree.empty())
	{
		ret = rb_tree.begin()->v_runtime;
	}
	return ret;
}

int CFS_RQ::get_2id()
{
	int ret=0;
	if(rb_tree.size()>1)
	{
		ret = (++rb_tree.begin())->id;
	}
	return ret;
}

int CFS_RQ::get_2v_runtime()
{
	int ret=0;
	if(rb_tree.size()>1)
	{
		ret = (++rb_tree.begin())->v_runtime;
	}
	return ret;
}

int CFS_RQ::get_3id()
{
	int ret=0;
	if(rb_tree.size()>2)
	{
		ret = (++(++rb_tree.begin()))->id;
	}
	return ret;
}

int CFS_RQ::get_3v_runtime()
{
	int ret=0;
	if(rb_tree.size()>2)
	{
		ret = (++(++rb_tree.begin()))->v_runtime;
	}
	return ret;
}
vector<TASK> CFS_RQ::rq_list()
{
    vector<TASK> list;
    for(multiset<TASK, task_compare>::iterator it=rb_tree.begin(); it!=rb_tree.end(); it++){
        list.push_back(*it);
    }
    reverse(list.begin(), list.end());
    return list;
}