[79522a7] | 1 | /*
|
---|
| 2 | * Copyright (C) 2006 Jakub 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.
|
---|
| 27 | */
|
---|
| 28 |
|
---|
[5a4c754] | 29 | #include <as.h>
|
---|
[79522a7] | 30 | #include <libc.h>
|
---|
| 31 | #include <unistd.h>
|
---|
[11fa83a] | 32 | #include <task.h>
|
---|
[79522a7] | 33 |
|
---|
[d3b8c1f] | 34 | /** Create address space area.
|
---|
[585819d] | 35 | *
|
---|
| 36 | * @param address Virtual address where to place new address space area.
|
---|
| 37 | * @param size Size of the area.
|
---|
| 38 | * @param flags Flags describing type of the area.
|
---|
| 39 | *
|
---|
| 40 | * @return address on success, (void *) -1 otherwise.
|
---|
| 41 | */
|
---|
[d3b8c1f] | 42 | void *as_area_create(void *address, size_t size, int flags)
|
---|
[79522a7] | 43 | {
|
---|
[d3b8c1f] | 44 | return (void *) __SYSCALL3(SYS_AS_AREA_CREATE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
|
---|
[79522a7] | 45 | }
|
---|
[7ad3c2f] | 46 |
|
---|
[d3b8c1f] | 47 | /** Resize address space area.
|
---|
[585819d] | 48 | *
|
---|
| 49 | * @param address Virtual address pointing into already existing address space area.
|
---|
| 50 | * @param size New requested size of the area.
|
---|
| 51 | * @param flags Currently unused.
|
---|
| 52 | *
|
---|
[46ec2c06] | 53 | * @return Zero on success or a code from @ref errno.h on failure.
|
---|
| 54 | */
|
---|
| 55 | int as_area_resize(void *address, size_t size, int flags)
|
---|
| 56 | {
|
---|
| 57 | return __SYSCALL3(SYS_AS_AREA_RESIZE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | /** Destroy address space area.
|
---|
| 61 | *
|
---|
| 62 | * @param address Virtual address pointing into the address space area being destroyed.
|
---|
| 63 | *
|
---|
| 64 | * @return Zero on success or a code from @ref errno.h on failure.
|
---|
[585819d] | 65 | */
|
---|
[46ec2c06] | 66 | int as_area_destroy(void *address)
|
---|
[585819d] | 67 | {
|
---|
[46ec2c06] | 68 | return __SYSCALL1(SYS_AS_AREA_DESTROY, (sysarg_t ) address);
|
---|
[585819d] | 69 | }
|
---|
[7ad3c2f] | 70 |
|
---|
| 71 | static size_t heapsize = 0;
|
---|
[afa6e74] | 72 | static size_t maxheapsize = (size_t)(-1);
|
---|
[7ad3c2f] | 73 | /* Start of heap linker symbol */
|
---|
| 74 | extern char _heap;
|
---|
| 75 |
|
---|
| 76 | /** Sbrk emulation
|
---|
| 77 | *
|
---|
| 78 | * @param size New area that should be allocated or negative,
|
---|
| 79 | if it should be shrinked
|
---|
| 80 | * @return Pointer to newly allocated area
|
---|
| 81 | */
|
---|
| 82 | void *sbrk(ssize_t incr)
|
---|
| 83 | {
|
---|
[46ec2c06] | 84 | int rc;
|
---|
[7ad3c2f] | 85 | void *res;
|
---|
| 86 | /* Check for invalid values */
|
---|
| 87 | if (incr < 0 && -incr > heapsize)
|
---|
| 88 | return NULL;
|
---|
| 89 | /* Check for too large value */
|
---|
| 90 | if (incr > 0 && incr+heapsize < heapsize)
|
---|
| 91 | return NULL;
|
---|
| 92 | /* Check for too small values */
|
---|
| 93 | if (incr < 0 && incr+heapsize > heapsize)
|
---|
| 94 | return NULL;
|
---|
[afa6e74] | 95 | /* Check for user limit */
|
---|
| 96 | if ((maxheapsize!=(size_t)(-1)) && (heapsize + incr)>maxheapsize) return NULL;
|
---|
[7ad3c2f] | 97 |
|
---|
[46ec2c06] | 98 | rc = as_area_resize(&_heap, heapsize + incr,0);
|
---|
| 99 | if (rc != 0)
|
---|
[7ad3c2f] | 100 | return NULL;
|
---|
[936351c1] | 101 |
|
---|
| 102 | /* Compute start of new area */
|
---|
| 103 | res = (void *)&_heap + heapsize;
|
---|
| 104 |
|
---|
[7ad3c2f] | 105 | heapsize += incr;
|
---|
[936351c1] | 106 |
|
---|
[7ad3c2f] | 107 | return res;
|
---|
| 108 | }
|
---|
[afa6e74] | 109 |
|
---|
| 110 | void *set_maxheapsize(size_t mhs)
|
---|
| 111 | {
|
---|
| 112 | maxheapsize=mhs;
|
---|
| 113 | /* Return pointer to area not managed by sbrk */
|
---|
| 114 | return (void *)&_heap + maxheapsize;
|
---|
| 115 |
|
---|
| 116 | }
|
---|