Sommaire

2

1) L'algorithme                                                         3

2) malloc()                                                                 4

3) free()                                                                      5

4) realloc()                                                                 6

1) L'algorithme

3

Best fit (meilleur choix) - recherche du plus petit bloc qui soit suffisament grand pour allouer la quantitée de mémoire voulue.

typedef struct         block_s
{
  size_t                size_limit;
  size_t                size_alloc;
  struct block_s        *next_elem;
  struct block_s        *prev_elem;
  struct block_s        *next_free;
  struct block_s        *prev_free;
  char                  free;
}                      block_t;

typedef struct list_s
{
  block_t       *first;
  block_t       *last;
}               list_t;

list_t          glist_elem;
list_t          glist_free;
void            *begin_memory;
void            *brk_memory;
void            *last_address;

2) malloc()

4

3) free()

5

4) realloc()

6