Compare commits
9 Commits
fe9d9e3836
...
gbowne1-fi
Author | SHA1 | Date | |
---|---|---|---|
bb185366a6 | |||
f341253aa8 | |||
3305ef401c | |||
f83a00f4d5 | |||
af512c99b6 | |||
7ebc328b5a | |||
0e2633db9d | |||
9594b76202 | |||
103277bf63 |
5
.idea/vcs.xml
generated
5
.idea/vcs.xml
generated
@@ -1,5 +1,10 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<project version="4">
|
||||
<component name="GitSharedSettings">
|
||||
<option name="FORCE_PUSH_PROHIBITED_PATTERNS">
|
||||
<list />
|
||||
</option>
|
||||
</component>
|
||||
<component name="VcsDirectoryMappings">
|
||||
<mapping directory="" vcs="Git" />
|
||||
</component>
|
||||
|
69
main.c
69
main.c
@@ -2,6 +2,7 @@
|
||||
#include <stdio.h>
|
||||
#include <unistd.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#define ALIGN16(s) (((s) + 15) & ~0x0F)
|
||||
#define BLOCK_SIZE sizeof(struct block)
|
||||
@@ -24,29 +25,26 @@ struct block *last = NULL;
|
||||
/// @returns The new memory block.
|
||||
struct block *extend_heap(size_t s)
|
||||
{
|
||||
// Ensure the allocated size is at least the minimum block size
|
||||
if (s < MINIMUM_BLOCK_SIZE)
|
||||
s = MINIMUM_BLOCK_SIZE;
|
||||
// Ensure the allocated size is at least the minimum block size
|
||||
if (s < MINIMUM_BLOCK_SIZE)
|
||||
s = MINIMUM_BLOCK_SIZE;
|
||||
|
||||
struct block *b = (struct block *)sbrk(0); // Get the current break
|
||||
struct block *b = (struct block *)sbrk(0); // Get the current break
|
||||
|
||||
// Add the size of the block header to the requested size
|
||||
s += BLOCK_SIZE;
|
||||
if (sbrk(BLOCK_SIZE + s) == (void *)-1) // Extend the break by s bytes
|
||||
return NULL;
|
||||
|
||||
if (sbrk(s) == (void *)-1) // Extend the break by s bytes
|
||||
return NULL;
|
||||
b->size = s; // Corrected from b->size to b->size
|
||||
b->prev = last;
|
||||
b->next = NULL;
|
||||
b->free = 0;
|
||||
|
||||
b->size = s;
|
||||
b->prev = last;
|
||||
b->next = NULL;
|
||||
b->free = 0;
|
||||
if (last)
|
||||
last->next = b;
|
||||
|
||||
if (last)
|
||||
last->next = b;
|
||||
last = b;
|
||||
|
||||
last = b;
|
||||
|
||||
return b;
|
||||
return b;
|
||||
}
|
||||
|
||||
/// Finds the first block that will fit the given size.
|
||||
@@ -259,21 +257,36 @@ void my_custom_free(void *ptr)
|
||||
}
|
||||
}
|
||||
|
||||
size_t get_heap_size()
|
||||
{
|
||||
size_t total_size = 0;
|
||||
struct block *current = first;
|
||||
|
||||
while (current != NULL)
|
||||
{
|
||||
total_size += current->size;
|
||||
current = current->next;
|
||||
}
|
||||
|
||||
return total_size;
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
int *a = (int *)malloc(sizeof(int));
|
||||
int *b = (int *)malloc(sizeof(int));
|
||||
int *a = (int *)malloc(sizeof(int));
|
||||
int *b = (int *)malloc(sizeof(int));
|
||||
int *c = (int *)malloc(sizeof(int)); // Allocate memory for c
|
||||
|
||||
*a = 5;
|
||||
*b = 12;
|
||||
*a = 5;
|
||||
*b = 12;
|
||||
|
||||
printf("Test 1: %i\n", *a);
|
||||
printf("Test 2: %i\n", *b);
|
||||
printf("Test 1: %i\n", *a);
|
||||
printf("Test 2: %i\n", *b);
|
||||
printf("Heap Size: %zu Bytes\n", get_heap_size()); // Assuming get_heap_size is implemented
|
||||
|
||||
free(a);
|
||||
free(b);
|
||||
free(a); // Free memory for a
|
||||
free(b); // Free memory for b
|
||||
free(c); // Free memory for c
|
||||
|
||||
int *c = (int *)malloc(sizeof(int));
|
||||
|
||||
return 0;
|
||||
return 0;
|
||||
}
|
Reference in New Issue
Block a user