129 lines
2.9 KiB
C
129 lines
2.9 KiB
C
|
#include <stdbool.h>
|
||
|
|
#include "scheduler.h"
|
||
|
|
#include "doubly_linked_list.h"
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Checks whether a run_queue is empty
|
||
|
|
*
|
||
|
|
* \param rq Pointer to the run_queue
|
||
|
|
*
|
||
|
|
* \returns `true` iff the run_queue is empty
|
||
|
|
*/
|
||
|
|
bool stud_rq_empty(struct run_queue const *rq) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Creates a task
|
||
|
|
*
|
||
|
|
* \param pid The pid of the new task
|
||
|
|
* \param state Default state of the task
|
||
|
|
*
|
||
|
|
* \return A pointer to the new task, `NULL` if failed
|
||
|
|
*/
|
||
|
|
|
||
|
|
struct task *stud_task_create(int pid, enum states state) {
|
||
|
|
return NULL;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Frees/destroys a task This function assumes the task has already been
|
||
|
|
* removed from any run queue. It does not handle linked list operations
|
||
|
|
* or modifications to the run queue.
|
||
|
|
*
|
||
|
|
* \param task Pointer to the task to-be-destroyed
|
||
|
|
*/
|
||
|
|
void stud_task_free(struct task *task) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Frees all the elements of the `run_queue` and empties it.
|
||
|
|
* `rq` itself should NOT be freed. After calling this function,
|
||
|
|
* `rq` must simply be an empty `run_queue`.
|
||
|
|
*
|
||
|
|
* \param rq Pointer to the run_queue to-be-destroyed
|
||
|
|
*/
|
||
|
|
void stud_rq_destroy(struct run_queue *rq) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Tries to find a task in a run_queue by its PID
|
||
|
|
*
|
||
|
|
* \param rq Pointer to the run_queue
|
||
|
|
* \param pid PID of the wanted task
|
||
|
|
*
|
||
|
|
* \returns Pointer to the task, `NULL` if failed
|
||
|
|
*/
|
||
|
|
struct task *stud_rq_find(struct run_queue *rq, int pid) {
|
||
|
|
return NULL;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Returns the head of the `run_queue`.
|
||
|
|
*
|
||
|
|
* \param rq Pointer to the run_queue
|
||
|
|
*/
|
||
|
|
struct task *stud_rq_head(struct run_queue *rq) {
|
||
|
|
return NULL;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Returns the tail of the `run_queue`.
|
||
|
|
*
|
||
|
|
* \param rq Pointer to the run_queue
|
||
|
|
*/
|
||
|
|
struct task *stud_rq_tail(struct run_queue *rq) {
|
||
|
|
return NULL;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Enqueues a task on the given run_queue. The head stays where it is
|
||
|
|
* and the new task is put at the END of the list.
|
||
|
|
*
|
||
|
|
* \param rq Pointer to the run_queue
|
||
|
|
* \param task The task to-be-enqueued
|
||
|
|
*
|
||
|
|
* \returns `true` iff successful
|
||
|
|
*/
|
||
|
|
bool stud_rq_enqueue(struct run_queue *rq, struct task *task) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Enqueues a task into the run_queue sorted by ascending runtime.
|
||
|
|
*
|
||
|
|
* \param rq Pointer to the run_queue
|
||
|
|
* \param task The task to be inserted
|
||
|
|
*
|
||
|
|
* \returns `true` if successful
|
||
|
|
*/
|
||
|
|
bool stud_rq_enqueue_sorted(struct run_queue* rq, struct task* task){
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Prepends a task on the given run_queue. The head of the list MUST be
|
||
|
|
* moved to the new task!
|
||
|
|
*
|
||
|
|
* \param rq Pointer the run_queue
|
||
|
|
* \param task The task to-be-prepended
|
||
|
|
*
|
||
|
|
* \returns `true` iff successful
|
||
|
|
*/
|
||
|
|
bool stud_rq_prepend(struct run_queue *rq, struct task *task) {
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* \brief Computes the length of a `run_queue`
|
||
|
|
*
|
||
|
|
* \param rq The run_queue
|
||
|
|
*
|
||
|
|
* \return The length of `rq`
|
||
|
|
*/
|
||
|
|
size_t stud_rq_length(struct run_queue *rq) {
|
||
|
|
return false;
|
||
|
|
}
|