-
Notifications
You must be signed in to change notification settings - Fork 1
/
improved_malloc.c
100 lines (89 loc) · 2.29 KB
/
improved_malloc.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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* improved_malloc.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: aabda <aabda@student.s19.be> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/08/03 00:41:38 by aabda #+# #+# */
/* Updated: 2023/08/03 11:47:14 by aabda ### ########.fr */
/* */
/* ************************************************************************** */
#include "./improved_malloc.h"
static t_malloc_lst *lst_last_node(t_malloc_lst *lst)
{
t_malloc_lst *tmp;
tmp = lst;
if (!lst)
return (NULL);
while (tmp && tmp->next)
tmp = tmp->next;
return (tmp);
}
static void lst_create_node(t_malloc_lst **lst, void *elem)
{
t_malloc_lst *current;
t_malloc_lst *last;
t_malloc_lst *new;
new = malloc(sizeof(t_malloc_lst));
if (!new)
return ;
current = *lst;
new->address = elem;
new->next = NULL;
if (current)
{
last = lst_last_node(current);
last->next = new;
new->prev = last;
}
else
{
*lst = new;
new->prev = NULL;
}
}
void *improved_malloc(t_malloc_lst **lst, size_t len)
{
void *elem;
elem = malloc(len);
if (elem)
lst_create_node(lst, elem);
return (elem);
}
static void remove_and_place_node(t_malloc_lst **lst, t_malloc_lst *current)
{
t_malloc_lst *tmp_l;
t_malloc_lst *tmp_r;
tmp_l = current->prev;
tmp_r = current->next;
if (tmp_l && tmp_r)
{
tmp_l->next = tmp_r;
tmp_r->prev = tmp_l;
}
else if (tmp_l && !tmp_r)
tmp_l->next = NULL;
else if (!tmp_l && tmp_r)
{
tmp_r->prev = NULL;
*lst = tmp_r;
}
free(current->address);
current->address = NULL;
free(current);
current = NULL;
}
void lst_free_bloc(t_malloc_lst **lst, void *elem)
{
t_malloc_lst *current;
current = *lst;
if (!current)
return ;
while (current->address != elem)
current = current->next;
if (current)
remove_and_place_node(lst, current);
else
return ;
}