Rev 1501 | Rev 1509 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1501 | Rev 1505 | ||
---|---|---|---|
Line 24... | Line 24... | ||
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 | ||
Line 131... | Line 117... | ||
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 | */ |