OSC-Course-Project/osc_queue.c at master · ZilinSONG/OSC-Course-Project · 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
145
146
147
148
149
150
151
152
153
154
// 16522063 zy22063 Zilin SONG
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <sys/time.h>

struct element
{
	int pid;
	int pid_time;
	int pid_priority;

	struct timeval created_time;
};

struct queue
{
	struct element *e;
	int max;
	int count;
};

int addFirst(struct queue *my_arr, struct element *new_e)
{
	if (my_arr -> max == my_arr -> count)
	{
		printf("The queue is full.\n");
		return 1;
	}
	my_arr -> count = my_arr -> count + 1;
	for (int i = my_arr -> count-1; i >=0; i--)
	{
		if (i == 0)
		{
			my_arr -> e[0] = *new_e;
		}
		else
		{
		    my_arr -> e[i] = my_arr -> e[i-1];
		}
	}
	return 0;
}


int addHere(struct queue *my_arr, struct element *new_e, int index)
{
	if (my_arr -> max == my_arr -> count)
	{
		printf("The queue is full.\n");
		return 1;
	}
    my_arr -> count = my_arr -> count + 1;
	for (int i = my_arr -> count-1; i >=0; i--)
	{
		if (my_arr -> count == 1)
        {
    	    my_arr -> e[0] = *new_e;
        }
		else if (i == index-1)
		{
			my_arr -> e[i] = *new_e;
			break;
		}
		else
		{
		    my_arr -> e[i] = my_arr -> e[i-1];
		}
	}
	return 0;
}


int addLast(struct queue *my_arr, struct element *new_e)
{
	if (my_arr -> max == my_arr -> count)
	{
		printf("The queue is full.\n");
		return 1;
	}
	my_arr -> count = my_arr -> count + 1;
	my_arr -> e[my_arr -> count - 1] = *new_e;
	return 0;
}


void freeAll(struct queue *my_arr)
{
	free(my_arr -> e);
	my_arr -> e = NULL;
	free(my_arr);
    my_arr = NULL;
}

int getCount(struct queue *my_arr)
{
	return my_arr -> count;
}


int init(struct queue *my_arr, int arr_size)
{
	printf("Initialising ...\n");
	if (my_arr == NULL)
	{
		printf("Failed to allocate memory to queue\n");
		return 1;
	}
	my_arr -> count = 0;
	my_arr -> max = arr_size;
	my_arr -> e = (struct element*)malloc(sizeof(struct element)*arr_size);
	if (my_arr -> e == NULL)
	{
		printf("Failed to allocate memory to element\n");
		free(my_arr);
		return 1;
	}
	for (int i = 0; i < arr_size; i++)
	{
		my_arr -> e[i].pid = 0;
		my_arr -> e[i].pid_time = 0;
		my_arr -> e[i].pid_priority = 0;
		my_arr -> e[i].created_time.tv_sec = 0;
		my_arr -> e[i].created_time.tv_usec = 0;
	}
	printf("Init: successfully malloc element with size of %d ...\n", arr_size);
	return 0;
}


void printAll(struct queue *my_arr)
{
	printf("There are %d elements in total\n", my_arr -> count);
	for (int i = 0; i < my_arr -> max; i++)
	{
		printf("#[%d]: %d running-time %d created-time %ld sec %d usec %d priority\n", i, my_arr -> e[i].pid, my_arr -> e[i].pid_time, my_arr -> e[i].created_time.tv_sec, my_arr -> e[i].created_time.tv_usec, my_arr -> e[i].pid_priority  );
	}

}


void removeLast(struct queue *my_arr)
{
	if (my_arr -> count == 0)
	{
		printf("The queue is empty.\n");
	}
	my_arr -> count = my_arr -> count -1;
	my_arr -> e[my_arr -> count].pid = 0;
	my_arr -> e[my_arr -> count].pid_time = 0;
	my_arr -> e[my_arr -> count].pid_priority = 0;
	my_arr -> e[my_arr -> count].created_time.tv_sec = 0;
	my_arr -> e[my_arr -> count].created_time.tv_usec = 0;
}