scheduler/queue.c at main · dkvhr/scheduler · 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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
#include "types.h"
#include <stdio.h>
#include <stdlib.h>

/* Aqui implementei uma queue usando linked list*/

ProcessNode *create_process_node(Process *proc) {
  ProcessNode *node;
  if ((node = (ProcessNode *)malloc(sizeof(ProcessNode))) == NULL) {
    fprintf(stderr, "Nao foi possivel alocar memoria");
    exit(EXIT_FAILURE);
  }

  node->proc = proc;
  node->next_node = NULL;

  return node;
}

NodeHead *create_node_head(int max_size, int priority) {
  NodeHead *head;
  if ((head = (NodeHead *)malloc(sizeof(NodeHead))) == NULL) {
    fprintf(stderr, "Nao foi possivel alocar memoria");
    exit(EXIT_FAILURE);
  }

  head->front = NULL;
  head->rear = NULL;
  head->full_size = max_size;
  head->priority = priority;
  head->size = 0;

  return head;
}

NodeIOHead *create_node_IO_head(int max_size, int priority) {
  NodeIOHead *IOhead;
  if ((IOhead = (NodeIOHead *)malloc(sizeof(NodeIOHead))) == NULL) {
    fprintf(stderr, "Nao foi possivel alocar memoria");
    exit(EXIT_FAILURE);
  }

  IOhead->front = NULL;
  IOhead->rear = NULL;
  IOhead->full_size = max_size;
  IOhead->priority = priority;
  IOhead->size = 0;

  return IOhead;
}

int queue_is_empty(NodeHead *queue) { return queue->size == 0; }

int io_queue_is_empty(NodeIOHead *queue) { return queue->size == 0; }

int IOqueue_is_empty(NodeIOHead *queue) { return queue->size == 0; }

int node_head_enqueue(NodeHead *queue, Process *proc) {
  ProcessNode *tmp;
  if ((tmp = (ProcessNode *)malloc(sizeof(ProcessNode))) == NULL) {
    fprintf(stderr, "Nao foi possivel alocar memoria");
    exit(EXIT_FAILURE);
  }

  tmp->proc = proc;
  tmp->next_node = NULL;
  if (queue_is_empty(queue)) {
    queue->front = tmp;
    queue->rear = tmp;
  }

  else {
    queue->rear->next_node = tmp;
    queue->rear = tmp;
  }
  queue->size++;
  return 0;
}

int node_IO_head_enqueue(NodeIOHead *IO_queue, ProcessIO *proc_io) {
  ProcessIONode *tmp;
  if ((tmp = (ProcessIONode *)malloc(sizeof(ProcessIONode *))) == NULL) {
    fprintf(stderr, "Nao foi possivel alocar memoria");
    exit(EXIT_FAILURE);
  }

  tmp->procIO = proc_io;
  tmp->next_node = NULL;
  if (IOqueue_is_empty(IO_queue)) {
    IO_queue->front = tmp;
    IO_queue->rear = tmp;
  }

  else {
    IO_queue->rear->next_node = tmp;
    IO_queue->rear = tmp;
  }
  IO_queue->size++;
  return 0;
}

Process *node_head_dequeue(NodeHead *queue) {
  // remove o primeiro elemento da fila e retorna como Process
  if (queue_is_empty(queue)) {
    queue->front = queue->rear = NULL;
    return NULL;
  }

  ProcessNode *tmp;
  tmp = queue->front;
  queue->front = tmp->next_node;
  Process *tmpp = tmp->proc;
  free(tmp);
  if (queue->size == 1)
    queue->rear = NULL;
  queue->size--;
  if (queue_is_empty(queue)) {
    queue->front = queue->rear = NULL;
    return tmpp;
  }

  return tmpp;
}

// Process *remove_from_queue(NodeHead *queue) {
//   if (queue_is_empty(queue)) {
//     queue->front = queue->rear = NULL;
//     return NULL;
//   }

//   ProcessNode *r = queue->rear;
//   ProcessNode *f = queue->front;
//   r->next_node=f;
//   queue->front = NULL;
//   queue->rear = NULL;
//   return queue;
//   queue->front = tmp->next_node;
//   Process *tmpp = tmp->proc;
//   free(tmp);
//   if (queue->size == 1)
//     queue->rear = NULL;
//   queue->size--;
//   if (queue_is_empty(queue)) {
//     queue->front = queue->rear = NULL;
//     return tmpp;
//   }

//   return tmpp;
// }

ProcessIO *IO_node_head_dequeue(NodeIOHead *queue) {
  // remove o primeiro elemento da fila e retorna como Process
  if (IOqueue_is_empty(queue)) {
    queue->front = queue->rear = NULL;
    return NULL;
  }

  ProcessIONode *tmp;
  tmp = queue->front;
  queue->front = tmp->next_node;
  ProcessIO *tmpp = tmp->procIO;
  free(tmp);
  if (queue->size == 1)
    queue->rear = NULL;
  queue->size--;
  if (IOqueue_is_empty(queue)) {
    queue->front = queue->rear = NULL;
    return tmpp;
  }

  return tmpp;
}