blob: b7cf9245518ed754f46ff1d849ee5f175800f0a0 (
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
|
// IBM_PROLOG_BEGIN_TAG
// This is an automatically generated prolog.
//
// $Source: src/lib/stdlib.C $
//
// IBM CONFIDENTIAL
//
// COPYRIGHT International Business Machines Corp. 2010 - 2011
//
// p1
//
// Object Code Only (OCO) source materials
// Licensed Internal Code Source Materials
// IBM HostBoot Licensed Internal Code
//
// The source code for this program is not published or other-
// wise divested of its trade secrets, irrespective of what has
// been deposited with the U.S. Copyright Office.
//
// Origin: 30
//
// IBM_PROLOG_END
#include <limits.h>
#include <stdlib.h>
#include <string.h>
#include <kernel/heapmgr.H>
#include <kernel/pagemgr.H>
void* malloc(size_t s)
{
if (s > HeapManager::MAX_ALLOC_SIZE)
{
size_t pages = (s + 8 + (PAGESIZE - 1))
/ PAGESIZE;
void* v = PageManager::allocatePage(pages);
size_t* len = (size_t*)v;
*len = pages << 8;
len++;
return len;
}
else
return HeapManager::allocate(s);
}
void free(void* p)
{
if (NULL == p) return;
size_t* len = (size_t*)p;
len--;
if ((*len) > 0xff)
{
PageManager::freePage(len, (*len) >> 8);
}
else
{
HeapManager::free(p);
}
}
void* realloc(void* p, size_t s)
{
if (NULL == p) return malloc(s);
size_t* len = (size_t*)p;
len--;
size_t cur_size;
if ((*len) > 0xff)
{
cur_size = ((*len) >> 8) * PAGESIZE - 8;
}
else
{
cur_size = (1 << (*len + 4)) - 8;
}
if (s <= cur_size)
return p;
void* new_p = malloc(s);
memcpy(new_p, p, cur_size);
free(p);
return new_p;
}
|
