Subversion Repositories HelenOS-historic

Rev

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

Rev 1501 Rev 1505
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
#include <stdlib.h>
-
 
30
#include <unistd.h>
-
 
31
#include <string.h>
-
 
32
#include <ddi.h>
-
 
33
#include <sysinfo.h>
-
 
34
#include <align.h>
-
 
35
#include <as.h>
-
 
36
#include <ipc/fb.h>
-
 
37
#include <ipc/ipc.h>
-
 
38
#include <ipc/ns.h>
-
 
39
#include <ipc/services.h>
-
 
40
#include <kernel/errno.h>
-
 
41
 
-
 
42
 
-
 
43
#include <as.h>
29
#include <as.h>
44
#include <libc.h>
30
#include <libc.h>
45
#include <unistd.h>
31
#include <unistd.h>
46
#include <align.h>
32
#include <align.h>
47
 
33
 
48
/** Create address space area.
34
/** Create address space area.
49
 *
35
 *
50
 * @param address Virtual address where to place new address space area.
36
 * @param address Virtual address where to place new address space area.
51
 * @param size Size of the area.
37
 * @param size Size of the area.
52
 * @param flags Flags describing type of the area.
38
 * @param flags Flags describing type of the area.
53
 *
39
 *
54
 * @return address on success, (void *) -1 otherwise.
40
 * @return address on success, (void *) -1 otherwise.
55
 */
41
 */
56
void *as_area_create(void *address, size_t size, int flags)
42
void *as_area_create(void *address, size_t size, int flags)
57
{
43
{
58
    return (void *) __SYSCALL3(SYS_AS_AREA_CREATE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
44
    return (void *) __SYSCALL3(SYS_AS_AREA_CREATE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
59
}
45
}
60
 
46
 
61
/** Resize address space area.
47
/** Resize address space area.
62
 *
48
 *
63
 * @param address Virtual address pointing into already existing address space area.
49
 * @param address Virtual address pointing into already existing address space area.
64
 * @param size New requested size of the area.
50
 * @param size New requested size of the area.
65
 * @param flags Currently unused.
51
 * @param flags Currently unused.
66
 *
52
 *
67
 * @return Zero on success or a code from @ref errno.h on failure.
53
 * @return Zero on success or a code from @ref errno.h on failure.
68
 */
54
 */
69
int as_area_resize(void *address, size_t size, int flags)
55
int as_area_resize(void *address, size_t size, int flags)
70
{
56
{
71
    return __SYSCALL3(SYS_AS_AREA_RESIZE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
57
    return __SYSCALL3(SYS_AS_AREA_RESIZE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
72
}
58
}
73
 
59
 
74
/** Destroy address space area.
60
/** Destroy address space area.
75
 *
61
 *
76
 * @param address Virtual address pointing into the address space area being destroyed.
62
 * @param address Virtual address pointing into the address space area being destroyed.
77
 *
63
 *
78
 * @return Zero on success or a code from @ref errno.h on failure.
64
 * @return Zero on success or a code from @ref errno.h on failure.
79
 */
65
 */
80
int as_area_destroy(void *address)
66
int as_area_destroy(void *address)
81
{
67
{
82
    return __SYSCALL1(SYS_AS_AREA_DESTROY, (sysarg_t ) address);
68
    return __SYSCALL1(SYS_AS_AREA_DESTROY, (sysarg_t ) address);
83
}
69
}
84
 
70
 
85
static size_t heapsize = 0;
71
static size_t heapsize = 0;
86
static size_t maxheapsize = (size_t)(-1);
72
static size_t maxheapsize = (size_t)(-1);
87
 
73
 
88
static void * last_allocated = 0;
74
static void * last_allocated = 0;
89
 
75
 
90
/* Start of heap linker symbol */
76
/* Start of heap linker symbol */
91
extern char _heap;
77
extern char _heap;
92
 
78
 
93
/** Sbrk emulation
79
/** Sbrk emulation
94
 *
80
 *
95
 * @param size New area that should be allocated or negative,
81
 * @param size New area that should be allocated or negative,
96
               if it should be shrinked
82
               if it should be shrinked
97
 * @return Pointer to newly allocated area
83
 * @return Pointer to newly allocated area
98
 */
84
 */
99
void *sbrk(ssize_t incr)
85
void *sbrk(ssize_t incr)
100
{
86
{
101
    int rc;
87
    int rc;
102
    void *res;
88
    void *res;
103
    /* Check for invalid values */
89
    /* Check for invalid values */
104
    if (incr < 0 && -incr > heapsize)
90
    if (incr < 0 && -incr > heapsize)
105
        return NULL;
91
        return NULL;
106
    /* Check for too large value */
92
    /* Check for too large value */
107
    if (incr > 0 && incr+heapsize < heapsize)
93
    if (incr > 0 && incr+heapsize < heapsize)
108
        return NULL;
94
        return NULL;
109
    /* Check for too small values */
95
    /* Check for too small values */
110
    if (incr < 0 && incr+heapsize > heapsize)
96
    if (incr < 0 && incr+heapsize > heapsize)
111
        return NULL;
97
        return NULL;
112
    /* Check for user limit */
98
    /* Check for user limit */
113
    if ((maxheapsize!=(size_t)(-1)) && (heapsize + incr)>maxheapsize) return NULL;
99
    if ((maxheapsize!=(size_t)(-1)) && (heapsize + incr)>maxheapsize) return NULL;
114
 
100
 
115
    rc = as_area_resize(&_heap, heapsize + incr,0);
101
    rc = as_area_resize(&_heap, heapsize + incr,0);
116
    if (rc != 0)
102
    if (rc != 0)
117
        return NULL;
103
        return NULL;
118
   
104
   
119
    /* Compute start of new area */
105
    /* Compute start of new area */
120
    res = (void *)&_heap + heapsize;
106
    res = (void *)&_heap + heapsize;
121
 
107
 
122
    heapsize += incr;
108
    heapsize += incr;
123
 
109
 
124
    return res;
110
    return res;
125
}
111
}
126
 
112
 
127
/** Set maximum heap size and return pointer just after the heap */
113
/** Set maximum heap size and return pointer just after the heap */
128
void *set_maxheapsize(size_t mhs)
114
void *set_maxheapsize(size_t mhs)
129
{
115
{
130
    maxheapsize=mhs;
116
    maxheapsize=mhs;
131
    /* Return pointer to area not managed by sbrk */
117
    /* Return pointer to area not managed by sbrk */
132
    return (void *)&_heap + maxheapsize;
118
    return (void *)&_heap + maxheapsize;
133
 
119
 
134
}
120
}
135
 
121
 
-
 
122
/* TODO: make this type defined somewhere else */
-
 
123
typedef sysarg_t __address;
-
 
124
 
136
/** Return pointer to some unmapped area, where fits new as_area
125
/** Return pointer to some unmapped area, where fits new as_area
137
 *
126
 *
138
 * TODO: make some first_fit/... algorithm, we are now just incrementing
127
 * TODO: make some first_fit/... algorithm, we are now just incrementing
139
 *       the pointer to last area
128
 *       the pointer to last area
140
 */
129
 */
141
void * as_get_mappable_page(size_t sz)
130
void * as_get_mappable_page(size_t sz)
142
{
131
{
143
    void *res;
132
    void *res;
144
 
133
 
145
    /* Set heapsize to some meaningful value */
134
    /* Set heapsize to some meaningful value */
146
    if (maxheapsize == -1)
135
    if (maxheapsize == -1)
147
        set_maxheapsize(ALIGN_UP(USER_ADDRESS_SPACE_SIZE_ARCH>>1,PAGE_SIZE));
136
        set_maxheapsize(ALIGN_UP(USER_ADDRESS_SPACE_SIZE_ARCH>>1,PAGE_SIZE));
148
    if (!last_allocated)
137
    if (!last_allocated)
149
        last_allocated = ALIGN_UP((void *)&_heap + maxheapsize, PAGE_SIZE);
138
        last_allocated = ALIGN_UP((void *)&_heap + maxheapsize, PAGE_SIZE);
150
   
139
   
151
    sz = ALIGN_UP(sz, PAGE_SIZE);
140
    sz = ALIGN_UP(sz, PAGE_SIZE);
152
    res = last_allocated;
141
    res = last_allocated;
153
    last_allocated += sz;
142
    last_allocated += sz;
154
 
143
 
155
    return res;
144
    return res;
156
}
145
}
157
 
146