Subversion Repositories HelenOS-historic

Rev

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

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