1 |
148 |
jeremybenn |
/*
|
2 |
|
|
(C) Copyright IBM Corp. 2005, 2006
|
3 |
|
|
|
4 |
|
|
All rights reserved.
|
5 |
|
|
|
6 |
|
|
Redistribution and use in source and binary forms, with or without
|
7 |
|
|
modification, are permitted provided that the following conditions are met:
|
8 |
|
|
|
9 |
|
|
* Redistributions of source code must retain the above copyright notice,
|
10 |
|
|
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 |
|
|
* Neither the name of IBM nor the names of its contributors may be
|
15 |
|
|
used to endorse or promote products derived from this software without
|
16 |
|
|
specific prior written permission.
|
17 |
|
|
|
18 |
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
19 |
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
20 |
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
21 |
|
|
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
22 |
|
|
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
23 |
|
|
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
24 |
|
|
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
25 |
|
|
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
26 |
|
|
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
27 |
|
|
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
28 |
|
|
POSSIBILITY OF SUCH DAMAGE.
|
29 |
|
|
|
30 |
|
|
Author: Andreas Neukoetter (ti95neuk@de.ibm.com)
|
31 |
|
|
*/
|
32 |
|
|
|
33 |
|
|
#include <sys/types.h>
|
34 |
|
|
#include <errno.h>
|
35 |
|
|
#include <spu_intrinsics.h>
|
36 |
|
|
|
37 |
|
|
extern caddr_t _end;
|
38 |
|
|
#define STACKSIZE 4096
|
39 |
|
|
|
40 |
|
|
void *
|
41 |
|
|
sbrk (ptrdiff_t increment)
|
42 |
|
|
{
|
43 |
|
|
static caddr_t heap_ptr = NULL;
|
44 |
|
|
caddr_t base;
|
45 |
|
|
vector unsigned int sp_reg, sp_delta;
|
46 |
|
|
vector unsigned int *sp_ptr;
|
47 |
|
|
caddr_t sps;
|
48 |
|
|
|
49 |
|
|
/* The stack pointer register. */
|
50 |
|
|
volatile register vector unsigned int sp_r1 __asm__("1");
|
51 |
|
|
|
52 |
|
|
if (heap_ptr == NULL)
|
53 |
|
|
heap_ptr = (caddr_t) & _end;
|
54 |
|
|
|
55 |
|
|
sps = (caddr_t) spu_extract (sp_r1, 0);
|
56 |
|
|
if (((int) sps - STACKSIZE - (int) heap_ptr) >= increment)
|
57 |
|
|
{
|
58 |
|
|
base = heap_ptr;
|
59 |
|
|
heap_ptr += increment;
|
60 |
|
|
|
61 |
|
|
sp_delta = (vector unsigned int) spu_insert (increment, spu_splats (0), 1);
|
62 |
|
|
|
63 |
|
|
/* Subtract sp_delta from the SP limit (word 1). */
|
64 |
|
|
sp_r1 = spu_sub (sp_r1, sp_delta);
|
65 |
|
|
|
66 |
|
|
/* Fix-up backchain. */
|
67 |
|
|
sp_ptr = (vector unsigned int *) spu_extract (sp_r1, 0);
|
68 |
|
|
do
|
69 |
|
|
{
|
70 |
|
|
sp_reg = *sp_ptr;
|
71 |
|
|
*sp_ptr = (vector unsigned int) spu_sub (sp_reg, sp_delta);
|
72 |
|
|
}
|
73 |
|
|
while ((sp_ptr = (vector unsigned int *) spu_extract (sp_reg, 0)));
|
74 |
|
|
|
75 |
|
|
return (base);
|
76 |
|
|
}
|
77 |
|
|
else
|
78 |
|
|
{
|
79 |
|
|
errno = ENOMEM;
|
80 |
|
|
return ((void *) -1);
|
81 |
|
|
}
|
82 |
|
|
}
|