brk.S revision 1.10 1 1.10 matt /* $NetBSD: brk.S,v 1.10 2013/08/01 05:32:33 matt Exp $ */
2 1.1 bjh21
3 1.1 bjh21 /*-
4 1.1 bjh21 * Copyright (c) 1990 The Regents of the University of California.
5 1.1 bjh21 * All rights reserved.
6 1.1 bjh21 *
7 1.1 bjh21 * Redistribution and use in source and binary forms, with or without
8 1.1 bjh21 * modification, are permitted provided that the following conditions
9 1.1 bjh21 * are met:
10 1.1 bjh21 * 1. Redistributions of source code must retain the above copyright
11 1.1 bjh21 * notice, this list of conditions and the following disclaimer.
12 1.1 bjh21 * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 bjh21 * notice, this list of conditions and the following disclaimer in the
14 1.1 bjh21 * documentation and/or other materials provided with the distribution.
15 1.6 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 bjh21 * may be used to endorse or promote products derived from this software
17 1.1 bjh21 * without specific prior written permission.
18 1.1 bjh21 *
19 1.1 bjh21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 bjh21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 bjh21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 bjh21 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 bjh21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 bjh21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 bjh21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 bjh21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 bjh21 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 bjh21 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 bjh21 * SUCH DAMAGE.
30 1.1 bjh21 *
31 1.1 bjh21 * from: @(#)brk.s 5.2 (Berkeley) 12/17/90
32 1.1 bjh21 */
33 1.1 bjh21
34 1.1 bjh21 #include "SYS.h"
35 1.1 bjh21
36 1.9 nonaka .globl _C_LABEL(_end)
37 1.10 matt .globl _C_LABEL(__curbrk)
38 1.1 bjh21
39 1.1 bjh21 #ifdef WEAK_ALIAS
40 1.1 bjh21 WEAK_ALIAS(brk, _brk)
41 1.1 bjh21 #endif
42 1.1 bjh21
43 1.1 bjh21 .data
44 1.1 bjh21 .align 0
45 1.1 bjh21 .globl _C_LABEL(__minbrk)
46 1.10 matt .hidden _C_LABEL(__minbrk)
47 1.1 bjh21 .type _C_LABEL(__minbrk),#object
48 1.1 bjh21 _C_LABEL(__minbrk):
49 1.9 nonaka .word _C_LABEL(_end)
50 1.1 bjh21
51 1.1 bjh21 /*
52 1.1 bjh21 * Change the data segment size
53 1.1 bjh21 */
54 1.1 bjh21 ENTRY(_brk)
55 1.1 bjh21 #ifdef PIC
56 1.1 bjh21 /* Setup the GOT */
57 1.4 thorpej ldr r3, .Lgot
58 1.1 bjh21 add r3, pc, r3
59 1.3 matt .L1:
60 1.4 thorpej ldr r1, .Lminbrk
61 1.10 matt add r1, r3, r1
62 1.1 bjh21 #else
63 1.4 thorpej ldr r1, .Lminbrk
64 1.1 bjh21 #endif
65 1.1 bjh21 /* Get the minimum allowable brk address */
66 1.1 bjh21 ldr r1, [r1]
67 1.1 bjh21
68 1.1 bjh21 /*
69 1.1 bjh21 * Valid the address specified and set to the minimum
70 1.1 bjh21 * if the address is below minbrk.
71 1.1 bjh21 */
72 1.1 bjh21 cmp r0, r1
73 1.7 martin movcc r0, r1
74 1.1 bjh21 mov r2, r0
75 1.2 bjh21 SYSTRAP(break)
76 1.3 matt bcs PIC_SYM(CERROR, PLT)
77 1.1 bjh21
78 1.1 bjh21 #ifdef PIC
79 1.4 thorpej ldr r1, .Lcurbrk
80 1.10 matt add r1, r3, r1
81 1.1 bjh21 #else
82 1.4 thorpej ldr r1, .Lcurbrk
83 1.1 bjh21 #endif
84 1.1 bjh21 /* Store the new address in curbrk */
85 1.1 bjh21 str r2, [r1]
86 1.1 bjh21
87 1.1 bjh21 /* Return 0 for success */
88 1.1 bjh21 mov r0, #0x00000000
89 1.8 rearnsha RET
90 1.1 bjh21
91 1.3 matt .align 2
92 1.1 bjh21 #ifdef PIC
93 1.4 thorpej .Lgot:
94 1.3 matt .word _C_LABEL(_GLOBAL_OFFSET_TABLE_) + (. - (.L1+4))
95 1.1 bjh21 #endif
96 1.4 thorpej .Lminbrk:
97 1.10 matt .word PIC_SYM(_C_LABEL(__minbrk), GOTOFF)
98 1.4 thorpej .Lcurbrk:
99 1.10 matt .word PIC_SYM(_C_LABEL(__curbrk), GOTOFF)
100