106 lines
2.7 KiB
C
106 lines
2.7 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* malloc.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: tomoron <tomoron@student.42angouleme.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2024/11/23 17:19:59 by tomoron #+# #+# */
|
|
/* Updated: 2024/12/05 17:01:08 by tomoron ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "includes/malloc.h"
|
|
|
|
t_allocations g_allocs;
|
|
pthread_mutex_t g_mallock = PTHREAD_MUTEX_INITIALIZER;
|
|
|
|
t_alloc *get_suitable_addr_in_chunk(t_mem_chunk *chunk, size_t size);
|
|
t_mem_chunk *create_new_chunk(int is_small, t_mem_chunk **chunk, \
|
|
t_mem_chunk *prev);
|
|
|
|
void *get_memory(size_t size, int no_write)
|
|
{
|
|
t_mem_chunk *chunk;
|
|
|
|
chunk = mmap(0, size, PROT_WRITE | PROT_READ, MAP_ANONYMOUS | MAP_PRIVATE,
|
|
-1, 0);
|
|
if (chunk == MAP_FAILED)
|
|
return (0);
|
|
if (no_write)
|
|
return (chunk);
|
|
chunk->space_left = size - sizeof(t_mem_chunk);
|
|
chunk->next = 0;
|
|
return (chunk);
|
|
}
|
|
|
|
t_alloc *reserve_addr(t_alloc *addr, size_t size, t_alloc *prev,
|
|
t_mem_chunk *chunk)
|
|
{
|
|
t_alloc *tmp;
|
|
|
|
if ((t_ul)addr % 16)
|
|
addr = (t_alloc *)((char *)addr + (16 - ((t_ul)addr % 16)));
|
|
addr->size = size;
|
|
chunk->space_left -= (size + sizeof(t_alloc));
|
|
if (prev)
|
|
{
|
|
tmp = prev->next;
|
|
prev->next = addr;
|
|
addr->next = tmp;
|
|
}
|
|
else
|
|
addr->next = 0;
|
|
return (addr + 1);
|
|
}
|
|
|
|
static void *pre_allocated(size_t size, t_mem_chunk **chunk, int is_small)
|
|
{
|
|
t_mem_chunk *tmp;
|
|
t_mem_chunk *prev;
|
|
t_alloc *res;
|
|
|
|
tmp = *chunk;
|
|
prev = *chunk;
|
|
res = 0;
|
|
while (tmp)
|
|
{
|
|
if (tmp->space_left >= size)
|
|
{
|
|
res = get_suitable_addr_in_chunk(tmp, size);
|
|
if (res)
|
|
return (res);
|
|
}
|
|
prev = tmp;
|
|
tmp = tmp->next;
|
|
}
|
|
tmp = create_new_chunk(is_small, chunk, prev);
|
|
if (!tmp)
|
|
return (0);
|
|
return (reserve_addr((void *)tmp + sizeof(t_mem_chunk), size, 0, tmp));
|
|
}
|
|
|
|
void *malloc(size_t size)
|
|
{
|
|
t_alloc *res;
|
|
|
|
pthread_mutex_lock(&g_mallock);
|
|
if (size <= TINY_MALLOC)
|
|
res = pre_allocated(size, &(g_allocs.tiny), 0);
|
|
else if (size <= SMALL_MALLOC)
|
|
res = pre_allocated(size, &(g_allocs.small), 1);
|
|
else
|
|
{
|
|
res = get_memory(size + sizeof(t_alloc), 1);
|
|
if (res)
|
|
{
|
|
res->size = size;
|
|
res->next = g_allocs.large;
|
|
g_allocs.large = res;
|
|
res++;
|
|
}
|
|
}
|
|
pthread_mutex_unlock(&g_mallock);
|
|
return (res);
|
|
}
|