Subversion Repositories HelenOS

Rev

Rev 2131 | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
978 jermar 1
/*
2071 jermar 2
 * Copyright (c) 2006 Jakub Jermar
978 jermar 3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
13
 *   documentation and/or other materials provided with the distribution.
14
 * - The name of the author may not be used to endorse or promote products
15
 *   derived from this software without specific prior written permission.
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
1653 cejka 27
 */
28
 
1719 decky 29
/** @addtogroup libc
1653 cejka 30
 * @{
31
 */
32
/** @file
978 jermar 33
 */
34
 
1250 jermar 35
#include <as.h>
978 jermar 36
#include <libc.h>
37
#include <unistd.h>
1501 palkovsky 38
#include <align.h>
1868 jermar 39
#include <types.h>
2015 jermar 40
#include <bitops.h>
978 jermar 41
 
1868 jermar 42
/**
43
 * Either 4*256M on 32-bit architecures or 16*256M on 64-bit architectures.
44
 */
45
#define MAX_HEAP_SIZE   (sizeof(uintptr_t)<<28)
46
 
1228 jermar 47
/** Create address space area.
1033 jermar 48
 *
49
 * @param address Virtual address where to place new address space area.
50
 * @param size Size of the area.
51
 * @param flags Flags describing type of the area.
52
 *
53
 * @return address on success, (void *) -1 otherwise.
54
 */
1228 jermar 55
void *as_area_create(void *address, size_t size, int flags)
978 jermar 56
{
2015 jermar 57
    return (void *) __SYSCALL3(SYS_AS_AREA_CREATE, (sysarg_t ) address,
2292 hudecek 58
        (sysarg_t) size, (sysarg_t) flags);
1033 jermar 59
}
60
 
1228 jermar 61
/** Resize address space area.
1033 jermar 62
 *
2015 jermar 63
 * @param address Virtual address pointing into already existing address space
64
 *  area.
1033 jermar 65
 * @param size New requested size of the area.
66
 * @param flags Currently unused.
67
 *
1307 jermar 68
 * @return Zero on success or a code from @ref errno.h on failure.
1033 jermar 69
 */
1307 jermar 70
int as_area_resize(void *address, size_t size, int flags)
1033 jermar 71
{
2292 hudecek 72
    return __SYSCALL3(SYS_AS_AREA_RESIZE, (sysarg_t ) address,
73
        (sysarg_t) size, (sysarg_t) flags);
978 jermar 74
}
985 palkovsky 75
 
1307 jermar 76
/** Destroy address space area.
77
 *
2015 jermar 78
 * @param address Virtual address pointing into the address space area being
79
 *  destroyed.
1307 jermar 80
 *
81
 * @return Zero on success or a code from @ref errno.h on failure.
82
 */
83
int as_area_destroy(void *address)
84
{
85
    return __SYSCALL1(SYS_AS_AREA_DESTROY, (sysarg_t ) address);
86
}
87
 
985 palkovsky 88
static size_t heapsize = 0;
1719 decky 89
static size_t maxheapsize = (size_t) (-1);
1501 palkovsky 90
 
91
static void * last_allocated = 0;
92
 
985 palkovsky 93
/* Start of heap linker symbol */
94
extern char _heap;
95
 
96
/** Sbrk emulation
97
 *
1653 cejka 98
 * @param incr New area that should be allocated or negative,
985 palkovsky 99
               if it should be shrinked
100
 * @return Pointer to newly allocated area
101
 */
102
void *sbrk(ssize_t incr)
103
{
1307 jermar 104
    int rc;
985 palkovsky 105
    void *res;
1719 decky 106
 
985 palkovsky 107
    /* Check for invalid values */
108
    if (incr < 0 && -incr > heapsize)
109
        return NULL;
1719 decky 110
 
985 palkovsky 111
    /* Check for too large value */
112
    if (incr > 0 && incr+heapsize < heapsize)
113
        return NULL;
1719 decky 114
 
985 palkovsky 115
    /* Check for too small values */
116
    if (incr < 0 && incr+heapsize > heapsize)
117
        return NULL;
1719 decky 118
 
1363 vana 119
    /* Check for user limit */
1719 decky 120
    if ((maxheapsize != (size_t) (-1)) && (heapsize + incr) > maxheapsize)
121
        return NULL;
122
 
123
    rc = as_area_resize(&_heap, heapsize + incr, 0);
1307 jermar 124
    if (rc != 0)
985 palkovsky 125
        return NULL;
999 palkovsky 126
 
127
    /* Compute start of new area */
1719 decky 128
    res = (void *) &_heap + heapsize;
999 palkovsky 129
 
985 palkovsky 130
    heapsize += incr;
999 palkovsky 131
 
985 palkovsky 132
    return res;
133
}
1363 vana 134
 
1501 palkovsky 135
/** Set maximum heap size and return pointer just after the heap */
1363 vana 136
void *set_maxheapsize(size_t mhs)
137
{
1719 decky 138
    maxheapsize = mhs;
1363 vana 139
    /* Return pointer to area not managed by sbrk */
1719 decky 140
    return ((void *) &_heap + maxheapsize);
1363 vana 141
}
1501 palkovsky 142
 
143
/** Return pointer to some unmapped area, where fits new as_area
144
 *
2015 jermar 145
 * @param sz Requested size of the allocation.
146
 *
147
 * @return Pointer to the beginning
148
 *
1501 palkovsky 149
 * TODO: make some first_fit/... algorithm, we are now just incrementing
150
 *       the pointer to last area
151
 */
2292 hudecek 152
void *as_get_mappable_page(size_t sz)
1501 palkovsky 153
{
154
    void *res;
2015 jermar 155
    uint64_t asz;
156
    int i;
157
 
158
    if (!sz)
159
        return NULL;   
1501 palkovsky 160
 
2015 jermar 161
    asz = 1 << (fnzb64(sz - 1) + 1);
162
 
1501 palkovsky 163
    /* Set heapsize to some meaningful value */
164
    if (maxheapsize == -1)
1868 jermar 165
        set_maxheapsize(MAX_HEAP_SIZE);
1719 decky 166
 
2015 jermar 167
    /*
2292 hudecek 168
     * Make sure we allocate from naturally aligned address.
2015 jermar 169
     */
170
    i = 0;
2292 hudecek 171
    if (!last_allocated) {
172
        last_allocated = (void *) ALIGN_UP((void *) &_heap +
173
            maxheapsize, asz);
174
    } else {
175
        last_allocated = (void *) ALIGN_UP(((uintptr_t)
176
            last_allocated) + (int) (i > 0), asz);
177
    }
2015 jermar 178
 
1501 palkovsky 179
    res = last_allocated;
2015 jermar 180
    last_allocated += ALIGN_UP(sz, PAGE_SIZE);
1501 palkovsky 181
 
182
    return res;
183
}
1653 cejka 184
 
1719 decky 185
/** @}
1653 cejka 186
 */