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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
#include "pso/THeap.h"
#include <stdlib.h>
#include <string.h>
#include <global_types.h>
#undef MATCHING
#define MATCHING
THeap *obj_heap;
THeap *alt_heap;
void heap_xfree(void *ptr) {
}
void *heap_xmalloc(size_t size) {
return NULL;
}
void xfree(void *ptr) {
}
void *xmalloc(size_t size) {
return NULL;
}
void THeap::heap_free(void *ptr) {
#define heap_ptr &ptr_u8[-sizeof(heap_node)]
#define ptr_heap ((heap_node *)heap_ptr)
const u8 *ptr_u8 = (u8 *)ptr;
if (ptr == NULL) {
return;
} else {
heap_node *prev_node = heap_nodes;
heap_node *node;
for (; node = prev_node->next, node < ptr_heap; prev_node = node);
if (((u8 *)&ptr_heap->next + ptr_heap->remaining_size) == (u8 *)&node->next) {
ptr_heap->next = node->next;
ptr_heap->remaining_size += node->remaining_size;
} else {
ptr_heap->next = node;
}
if (((u8 *)&prev_node->next + prev_node->remaining_size) == heap_ptr) {
prev_node->next = ptr_heap->next;
prev_node->remaining_size += ptr_heap->remaining_size;
} else {
prev_node->next = ptr_heap;
}
}
#undef ptr_heap
#undef heap_ptr
}
void *THeap::heap_zalloc(size_t size) {
void *ptr = heap_alloc(size);
if (ptr != NULL) {
memset(ptr, 0, size);
}
return ptr;
}
#ifndef MATCHING
void *THeap::heap_alloc(size_t size) {
heap_node *prev_node = heap_nodes;
heap_node *node;
u32 size_align = (sizeof(heap_node) - 1) + align + size;
u32 aligned_size = size_align & -align;
goto start;
cond:
if (node->remaining_size < aligned_size) {
goto loop_body;
}
top:
if (aligned_size == node->remaining_size) {
prev_node->heap = node->heap;
} else {
u8 *next_u8 = (u8 *)&node->next;
heap_node *tmp = &next_u8[aligned_size];
tmp->next = node->next;
tmp->remaining_size = node->remaining_size - aligned_size;
node->remaining_size = aligned_size;
prev_node->next = tmp;
}
return node + 1;
loop_body:
prev_node = node;
start:
if (node = prev_node->next, node == NULL) {
return NULL;
}
goto cond;
}
#else
asm void *THeap::heap_alloc(size_t size) {
nofralloc
lwz r0, 8(r3)
lwz r3, 0(r3)
add r6, r0, r4
neg r0, r0
addi r6, r6, 0x7
and r6, r6, r0
b lbl_80141090
lbl_80141044:
lwz r0, 4(r4)
cmplw r0, r6
blt- lbl_8014108c
cmplw r6, r0
bne- lbl_80141064
lwz r0, 0(r4)
stw r0, 0(r3)
b lbl_80141084
lbl_80141064:
lwz r0, 0(r4)
add r5, r4, r6
stw r0, 0(r5)
lwz r0, 4(r4)
subf r0, r6, r0
stw r0, 4(r5)
stw r6, 4(r4)
stw r5, 0(r3)
lbl_80141084:
addi r3, r4, 0x8
blr
lbl_8014108c:
mr r3, r4
lbl_80141090:
lwz r4, 0(r3)
cmplwi r4, 0
bne+ lbl_80141044
li r3, 0x0
blr
}
#endif
THeap::~THeap() {
xfree(heap_nodes);
}
THeap::THeap(size_t size, int alignment) {
mbr_0x0C = 0;
mbr_0x10 = 0;
align = alignment;
heap_nodes = (heap_node *)xmalloc(size);
if (heap_nodes != NULL) {
heap_node *tmp_node;
heap_node *next_tmp_node;
memset(heap_nodes, 0, size);
tmp_node = heap_nodes;
next_tmp_node = &tmp_node[1];
tmp_node->next = next_tmp_node;
heap_nodes->remaining_size = 0;
next_tmp_node->next = NULL;
next_tmp_node->remaining_size = size - sizeof(heap_node);
}
}
|
