aboutsummaryrefslogtreecommitdiff
path: root/arclib/stdlib.c
blob: 1377ff002f4e4a0a1c6f0254e365f2becaf9f75c (plain)
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
/*
 * Copyright 1999 Silicon Graphics, Inc.
 */
#include "stdlib.h"
#include "string.h"
#include "arc.h"


typedef struct _Node {
	size_t size;
	struct _Node *next;
} Node;

static Node *freeList = NULL;


void *malloc(size_t size)
{
	Node **free, *mem;

	size +=
	    /* header */ sizeof(Node) + /* round up */ (sizeof(Node) - 1);
	size -= size % sizeof(Node);

	free = &freeList;
	while ((*free != NULL) && ((*free)->size < size))
		free = &((*free)->next);

	mem = *free;
	if (mem != NULL) {
		if (mem->size > size) {
			Node *split = mem + (size / sizeof(Node));

			split->size = mem->size - size;
			split->next = mem->next;
			mem->size = size;
			mem->next = split;
		}
		*free = mem->next;
		mem += 1;
	}

	return ((void *) mem);
}


void free(void *ptr)
{
	if (ptr != NULL) {
		Node *mem = ((Node *) ptr) - 1;
		Node **free = &freeList;

		while ((*free != NULL) && (*free < mem)) {
			if (mem ==
			    (*free + ((*free)->size / sizeof(Node)))) {
				(*free)->size += mem->size;
				mem = *free;
				break;
			}
			free = &((*free)->next);
		}

		if (mem != *free) {
			mem->next = *free;
			*free = mem;
		}

		if (mem->next == (mem + (mem->size / sizeof(Node)))) {
			mem->size += mem->next->size;
			mem->next = mem->next->next;
		}
	}
}


void *realloc(void *ptr, size_t size)
{
	if (ptr == NULL) {
		ptr = malloc(size);
	} else {
		Node *mem = ((Node *) ptr) - 1;

		size +=
		    /* header */ sizeof(Node) +
		/* round up */ (sizeof(Node) - 1);
		size -= size % sizeof(Node);

		if (size > mem->size) {
			/* Should try to grow */
			void *optr = ptr;

			ptr = malloc(size);
			if (ptr != NULL) {
				memcpy(ptr, optr,
				       mem->size - sizeof(Node));
				free(optr);
			}
		} else if (size < mem->size) {
			Node *split = mem + (size / sizeof(Node));

			split->size = mem->size - size;
			split->next = mem->next;
			mem->size = size;
			free((void *) (split + 1));
		}
	}

	return ptr;
}


void arclib_malloc_add(ULONG start, ULONG size)
{
	Node *node = (Node *) start;

	node->size = size - (size % sizeof(Node));
	free((void *) (node + 1));
}