codexion/queue_utils.c at main · memosprojects/codexion · 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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   queue_utils.c                                      :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: mehdemir <mehdemir@student.42berlin.d      +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2026/04/20 13:25:11 by mehdemir          #+#    #+#             */
/*   Updated: 2026/04/20 13:25:13 by mehdemir         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "codexion.h"

// EDF için deadline hesapla (son derleme başlangıcı + burnout süresi)
long long	get_deadline(t_coder *coder)
{
	long long	deadline;

	pthread_mutex_lock(&coder->state_mutex);
	deadline = coder->last_compile_start + coder->env->time_to_burnout;
	pthread_mutex_unlock(&coder->state_mutex);
	return (deadline);
}

// Kuyruğa yeni bir node ekler (FIFO veya EDF'ye göre)
void	add_to_queue(t_dongle *dongle, t_coder *coder)
{
	t_node	*new_node;
	t_node	**curr;

	new_node = malloc(sizeof(t_node));
	if (!new_node)
		return ;
	new_node->coder_id = coder->id;
	new_node->deadline = get_deadline(coder);
	new_node->next = NULL;
	curr = (t_node **)&dongle->wait_queue;
	if (coder->env->scheduler == FIFO)
	{
		while (*curr)
			curr = &((*curr)->next);
		*curr = new_node;
	}
	else if (coder->env->scheduler == EDF)
	{
		while (*curr && (*curr)->deadline <= new_node->deadline)
			curr = &((*curr)->next);
		new_node->next = *curr;
		*curr = new_node;
	}
}

// Kuyruğun başındaki coder mı kontrol eder
int	is_my_turn(t_dongle *dongle, t_coder *coder)
{
	t_node	*head;

	head = (t_node *)dongle->wait_queue;
	if (head && head->coder_id == coder->id)
		return (1);
	return (0);
}

// İşlem bittiğinde coder'ı kuyruktan çıkarır
void	remove_from_queue(t_dongle *dongle, int coder_id)
{
	t_node	**curr;
	t_node	*temp;

	curr = (t_node **)&dongle->wait_queue;
	while (*curr)
	{
		if ((*curr)->coder_id == coder_id)
		{
			temp = *curr;
			*curr = (*curr)->next;
			free(temp);
			return ;
		}
		curr = &((*curr)->next);
	}
}

void	clear_wait_queue(t_dongle *dongle)
{
	t_node	*curr;
	t_node	*next;

	if (!dongle || !dongle->wait_queue)
		return ;
	curr = (t_node *)dongle->wait_queue;
	while (curr)
	{
		next = curr->next;
		free(curr);
		curr = next;
	}
	dongle->wait_queue = NULL;
}