Иван Скрябин · @malevrovich · a830e113 · Andrey Zhdanov
--- a/src/mem.c
+++ b/src/mem.c
 extern inline bool region_is_invalid( const struct region* r );


-
 static void* map_pages(void const* addr, size_t length, int additional_flags) {
  return mmap( (void*) addr, length, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS | additional_flags , -1, 0 );
 }

 /*  аллоцировать регион памяти и инициализировать его блоком */
-static struct region alloc_region  ( void const * addr, size_t query ) {
-  /*  ??? */
+static struct region alloc_region( void* addr, size_t query ) {
--- a/src/mem.c
+++ b/src/mem.c
+
+static struct block_search_result find_good_or_last  ( struct block_header* restrict block, size_t query){
+  if(!block) return (struct block_search_result) {BSR_CORRUPTED};
+
+  while(try_merge_with_next(block));
+
+  while(block->next && !is_block_good(block, query)){
+    block = block->next;
+    while(try_merge_with_next(block));
+  }

-static struct block_search_result find_good_or_last  ( struct block_header* restrict block, size_t sz )    {
-  /*??? */
+  if(block->next == NULL && !is_block_good(block, query)) return (struct block_search_result){BSR_REACHED_END_NOT_FOUND, block};
+  return (struct block_search_result){BSR_FOUND_GOOD_BLOCK, block};
 }
--- a/src/mem.c
+++ b/src/mem.c
+  
+  return last->next;
 }

 /*  Реализует основную логику malloc и возвращает заголовок выделенного блока */
 static struct block_header* memalloc( size_t query, struct block_header* heap_start) {
+  query = size_max(query, BLOCK_MIN_CAPACITY);

-  /*  ??? */
-
+  struct block_search_result res = find_good_or_last(heap_start, query);
+  
+  if(res.type == BSR_FOUND_GOOD_BLOCK) {
+    split_if_too_big(res.block, query);
+    res.block->is_free = false;
+    return res.block;
--- a/src/tests.c
+++ b/src/tests.c
+#include <sys/mman.h>
+
+#define HEAP_SIZE (capacity_from_size((block_size) {REGION_MIN_SIZE}).bytes)
+
+void test_success() {
+    heap_init(HEAP_SIZE);
+    void *pointer = _malloc(HEAP_SIZE / 8);
+
+    assert(pointer != NULL);
+
+    for(int i = 0; i < HEAP_SIZE / 8; i++) ((char *) pointer)[i] = '0';
+
+    munmap(HEAP_START, size_from_capacity((block_capacity) { HEAP_SIZE }).bytes);
+}
+
+void test_one_free() {