| 1 |
207 |
jeremybenn |
/* sbrk.c. Implementation of the _sbrk syscall for newlib
|
| 2 |
|
|
|
| 3 |
|
|
Copyright (C) 2004, Jacob Bower
|
| 4 |
|
|
Copyright (C) 2010, Embecosm Limited <info@embecosm.com>
|
| 5 |
|
|
|
| 6 |
|
|
Contributor Jeremy Bennett <jeremy.bennett@embecosm.com>
|
| 7 |
|
|
|
| 8 |
|
|
This file is part of Newlib.
|
| 9 |
|
|
|
| 10 |
|
|
The original work by Jacob Bower is provided as-is without any kind of
|
| 11 |
|
|
warranty. Use it at your own risk!
|
| 12 |
|
|
|
| 13 |
|
|
All subsequent work is bound by version 3 of the GPL as follows.
|
| 14 |
|
|
|
| 15 |
|
|
This program is free software; you can redistribute it and/or modify it
|
| 16 |
|
|
under the terms of the GNU General Public License as published by the Free
|
| 17 |
|
|
Software Foundation; either version 3 of the License, or (at your option)
|
| 18 |
|
|
any later version.
|
| 19 |
|
|
|
| 20 |
|
|
This program is distributed in the hope that it will be useful, but WITHOUT
|
| 21 |
|
|
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
| 22 |
|
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
|
| 23 |
|
|
more details.
|
| 24 |
|
|
|
| 25 |
|
|
You should have received a copy of the GNU General Public License along
|
| 26 |
|
|
with this program. If not, see <http:#www.gnu.org/licenses/>. */
|
| 27 |
|
|
/* -------------------------------------------------------------------------- */
|
| 28 |
|
|
/* This program is commented throughout in a fashion suitable for processing
|
| 29 |
|
|
with Doxygen. */
|
| 30 |
|
|
/* -------------------------------------------------------------------------- */
|
| 31 |
|
|
|
| 32 |
|
|
#include <errno.h>
|
| 33 |
|
|
|
| 34 |
|
|
|
| 35 |
|
|
#undef errno
|
| 36 |
|
|
extern int errno;
|
| 37 |
|
|
|
| 38 |
|
|
#define STACK_BUFFER 65536 /*!< Reserved stack space in bytes. */
|
| 39 |
|
|
|
| 40 |
|
|
|
| 41 |
|
|
/* -------------------------------------------------------------------------- */
|
| 42 |
|
|
/*!Extend the heap
|
| 43 |
|
|
|
| 44 |
|
|
We just increment a pointer in what's left of memory on the board.
|
| 45 |
|
|
|
| 46 |
|
|
While the heap grows upwards, the stack grows downwards. Eventually these
|
| 47 |
|
|
two things may colide and sbrk() won't even be able to return properly.
|
| 48 |
|
|
|
| 49 |
|
|
To mitigate this we reserve upto STACK_BUFFER _words_ at the top of memory.
|
| 50 |
|
|
Note this doesn't actually solve the problem, it just provides an error
|
| 51 |
|
|
margin. The real solution is to use an OS with a proper virtual memory
|
| 52 |
|
|
manager.
|
| 53 |
|
|
|
| 54 |
|
|
Remember that this function is *not* reentrant, so no static state should
|
| 55 |
|
|
be held.
|
| 56 |
|
|
|
| 57 |
|
|
@todo We break this rule with heap_ptr. This needs to be clean, so that a
|
| 58 |
|
|
re-entrant call to sbrk (e.g. in an ISR) is certain to work.
|
| 59 |
|
|
|
| 60 |
|
|
@param[in] nbytes The number of bytes to be allocated.
|
| 61 |
|
|
|
| 62 |
|
|
@return The previous heap end on success, -1 on failure with an error
|
| 63 |
|
|
code in errno. */
|
| 64 |
|
|
/* -------------------------------------------------------------------------- */
|
| 65 |
|
|
void *
|
| 66 |
|
|
_sbrk (int nbytes)
|
| 67 |
|
|
{
|
| 68 |
|
|
/* Symbol defined by linker map */
|
| 69 |
|
|
extern int end; /* start of free memory (as symbol) */
|
| 70 |
|
|
|
| 71 |
|
|
/* Value set by crt0.S */
|
| 72 |
|
|
extern void *stack; /* end of free memory */
|
| 73 |
|
|
|
| 74 |
|
|
/* The statically held previous end of the heap, with its initialization. */
|
| 75 |
|
|
static void *heap_ptr = (void *)&end; /* Previous end */
|
| 76 |
|
|
|
| 77 |
|
|
if ((stack - (heap_ptr + nbytes)) > STACK_BUFFER )
|
| 78 |
|
|
{
|
| 79 |
|
|
void *base = heap_ptr;
|
| 80 |
|
|
heap_ptr += nbytes;
|
| 81 |
|
|
|
| 82 |
|
|
return base;
|
| 83 |
|
|
}
|
| 84 |
|
|
else
|
| 85 |
|
|
{
|
| 86 |
|
|
errno = ENOMEM;
|
| 87 |
|
|
return (void *) -1;
|
| 88 |
|
|
}
|
| 89 |
|
|
} /* _sbrk () */
|
