/
queueTest.c
150 lines (119 loc) · 4.18 KB
/
queueTest.c
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
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "queue.h"
void main()
{
queue* myQueue = list_new();
assert(myQueue);
assert(myQueue->head->num == 0);
assert(myQueue->tail->num == 0);
printf("test no queue passed in\n");
int ret = list_remove_element(NULL, 9);
assert (ret == ULT_INVALID);
/*
printf("\ntest empty list\n");
ret = list_remove_element(myQueue, 12);
assert (ret == ULT_NONE);
*/
printf("\ntest add to invalid queue\n");
ret = list_add_element(NULL);
assert (ret == ULT_FAILED);
printf("\ntest add 1 element\n");
ret = list_add_element(myQueue);
printf("first element after tid 0: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
printf("\ntest add another element\n");
ret = list_add_element(myQueue);
printf("second element after tid 0: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
//TESTS FOR LIST_REMOVE_HEAD
printf("\ntest remove first element 3 times\n");
ret = list_remove_head(myQueue);
printf("element's tid: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
ret = list_remove_head(myQueue);
printf("element's tid: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
ret = list_remove_head(myQueue);
printf("element's tid: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
printf("\ntest add another element after emptying queue\n");
ret = list_add_element(myQueue);
printf("element: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
/*
//TESTS FOR LIST_REMOVE_ELEMENT
printf("\ntest remove third element\n");
ret = list_remove_element(myQueue, 2);
printf("element's tid: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
printf("\ntest remove second element\n");
ret = list_remove_element(myQueue, 1);
printf("element's tid: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
printf("\ntest remove first element\n");
ret = list_remove_element(myQueue, 0);
printf("element's tid: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
printf("\ntest remove no more elements\n");
ret = list_remove_element(myQueue, 1);
printf("element's tid: %d\n", ret);
assert (ret == ULT_INVALID);
printf("\ntest add another element after emptying list\n");
ret = list_add_element(myQueue);
printf("element: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
printf("\ntest add 2nd element after emptying list\n");
ret = list_add_element(myQueue);
printf("element: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
printf("\ntest add 3rd element after emptying list\n");
ret = list_add_element(myQueue);
printf("element: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
printf("\ntest remove second element AGAIN\n");
ret = list_remove_element(myQueue, 1);
printf("element's tid: %d\n", ret);
assert (ULT_isOKRet(ret));
printf("\ninside queue, %d elements\n", myQueue->numTCB);
list_print(myQueue);
list_print_backwards(myQueue);
*/
}