Subversion Repositories HelenOS

Rev

Rev 1868 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

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