simpletest/queue.c at master · owenhuyn/simpletest · 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
#ifndef QUEUE
#define QUEUE

#include <stdio.h>

typedef int bool;

#ifndef false
    #define false 0
#endif

#ifndef true
    #define true 1
#endif

#ifndef empty
    #define empty 0xBADE4EA4
#endif

struct queue
{
    pid_t *pid;
    int *numberOfIterations;
    int *jobNumber;
    struct queue *previous;
};

struct queue *emptyFrame;

void createQueue(struct queue *queueToBe)
{
    queueToBe -> pid = empty;
    queueToBe -> previous = NULL;
}

struct queue *addToEnd(struct queue *currentQueue, pid_t newID, int runNumb, int jobNum)
{
    if(currentQueue -> previous == NULL)
    {
        struct queue *newQueue;
        newQueue = (struct queue*)malloc(sizeof(struct queue));
        newQueue -> pid = newID;
        newQueue -> previous = NULL;
        newQueue -> numberOfIterations = runNumb;

        newQueue -> jobNumber = jobNum;

        currentQueue -> previous = newQueue;
    }
    else if(currentQueue -> previous != NULL)
        currentQueue = addToEnd(currentQueue -> previous, newID, runNumb, jobNum);
    return currentQueue;
}

void updateIterations(struct queue *currentQueue)
{
    if(currentQueue -> pid != empty)
    {
        int temp = currentQueue -> numberOfIterations;
        temp = temp + 1;
        currentQueue -> numberOfIterations = temp;
    }
}

void enqueue(struct queue *currentQueue, pid_t newID, int runNumb, int jobNum)
{
    if(currentQueue -> pid == empty)
    {
        currentQueue -> pid = newID;
        currentQueue -> numberOfIterations = runNumb;
        currentQueue -> jobNumber = jobNum;
    }
    else
    {
        if(currentQueue -> previous == NULL)
        {
            struct queue *newQueue;
            newQueue = (struct queue*)malloc(sizeof(struct queue));
            newQueue -> previous = NULL;
            newQueue -> pid = newID;
            newQueue -> numberOfIterations = runNumb;
            newQueue -> jobNumber = jobNum;

            currentQueue -> previous = newQueue;
        }
        else if(currentQueue -> previous != NULL)
            currentQueue = addToEnd(currentQueue -> previous, newID, runNumb, jobNum);
    }

}

int getSize(struct queue *currentQueue)
{
    int count = 0;
    struct queue* tempQueue;
    tempQueue = (struct queue*)malloc(sizeof(struct queue));
    tempQueue = currentQueue;
    while(tempQueue != NULL)
    {
        tempQueue = tempQueue -> previous;
        count++;
    }
    return count;
}

void clearIterations(struct queue *currentQueue) {currentQueue -> numberOfIterations = 0;}
int peekIterations(struct queue currentQueue) {return currentQueue.numberOfIterations;}
pid_t peek(struct queue currentQueue) {return currentQueue.pid;}
int peekJob(struct queue currentQueue) {return currentQueue.jobNumber;}

pid_t dequeue(struct queue *currentQueue)
{
    pid_t temp;
    struct queue *tempQueue;
    if(currentQueue -> pid == empty) return empty;
    else if(currentQueue -> previous == NULL)
    {
        temp = currentQueue -> pid;
        currentQueue -> pid = empty;
    }
    else
    {
        temp = currentQueue -> pid;
        currentQueue -> pid = currentQueue -> previous -> pid;
        currentQueue -> jobNumber = currentQueue -> previous -> jobNumber;
        currentQueue -> numberOfIterations = currentQueue -> previous -> numberOfIterations;
        tempQueue = currentQueue -> previous -> previous;
        free(currentQueue -> previous);
        currentQueue -> previous = tempQueue;
    }
    return temp;
}

bool checkEmpty(struct queue *currentQueue)
{
    if(currentQueue -> pid == empty) return true;
    return false;
}

void viewEntire(struct queue *viewQueue)
{
    struct queue* tempQueue;
    tempQueue = (struct queue*)malloc(sizeof(struct queue));
    tempQueue = viewQueue;
    while(tempQueue != NULL)
    {
        printf("%i \n", tempQueue -> pid);
        tempQueue = tempQueue -> previous;
    }
}