1 /* `alloca' standard 4.2 subroutine for 68000's and 16000's and others.
2 Also has _setjmp and _longjmp for pyramids.
3 Copyright (C) 1985, 1986, 1988 Free Software Foundation, Inc.
5 This file is part of XEmacs.
7 XEmacs is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by the
9 Free Software Foundation; either version 2, or (at your option) any
12 XEmacs is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with XEmacs; see the file COPYING. If not, write to
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
22 /* Synched up with: FSF 19.30. */
24 /* Both 68000 systems I have run this on have had broken versions of alloca.
25 Also, I am told that non-berkeley systems do not have it at all.
26 So replace whatever system-provided alloca there may be
27 on all 68000 systems. */
36 #ifndef HAVE_ALLOCA /* define this to use system's alloca */
59 #endif /* hp9000s300 */
63 #ifdef OLD_HP_ASSEMBLER
68 move.l (sp)+,a0 ; pop return addr from top of stack
69 move.l (sp)+,d0 ; pop size in bytes from top of stack
70 add.l #ROUND,d0 ; round size up to long word
71 and.l #MASK,d0 ; mask out lower two bits of size
72 sub.l d0,sp ; allocate by moving stack pointer
73 tst.b PROBE(sp) ; stack probe to allocate pages
74 move.l sp,d0 ; return pointer
75 add.l #-4,sp ; new top of stack
76 jmp (a0) ; not a normal return
77 MASK equ -4 ; Longword alignment
79 PROBE equ -128 ; safety buffer for C compiler scratch
81 #else /* new hp assembler syntax */
83 The new compiler does "move.m <registers> (%sp)" to save registers,
84 so we must copy the saved registers when we mung the sp.
85 The old compiler did "move.m <register> <offset>(%a6)", which
89 set PROBE,-128 # safety for C frame temporaries
90 set MAXREG,22 # d2-d7, a2-a5, fp2-fp7 may have been saved
93 mov.l (%sp)+,%a0 # return address
94 mov.l (%sp)+,%d0 # number of bytes to allocate
95 mov.l %sp,%a1 # save old sp for register copy
96 mov.l %sp,%d1 # compute new sp
97 sub.l %d0,%d1 # space requested
98 and.l &-4,%d1 # round down to longword
99 sub.l &MAXREG*4,%d1 # space for saving registers
100 mov.l %d1,%sp # save new value of sp
101 tst.b PROBE(%sp) # create pages (sigh)
102 mov.l %a2,%d1 # save reg a2
105 copy_regs_loop: /* save caller's saved registers */
107 dbra %d0,copy_regs_loop
108 mov.l %a2,%d0 # return value
109 mov.l %d1,%a2 # restore a2
110 add.l &-4,%sp # adjust tos
112 #endif /* new hp assembler */
114 #ifdef m68k /* SGS assembler totally different */
118 #ifdef MOTOROLA_DELTA
119 /* slightly modified version of alloca to motorola sysV/68 pcc - based
121 this compiler saves used registers relative to %sp instead of %fp.
122 alright, just make new copy of saved register set whenever we allocate
123 new space from stack..
124 this is true at last until SVR3V7 . bug has reported to Motorola. */
125 set MAXREG,10 # max no of registers to save (d2-d7, a2-a5)
126 mov.l (%sp)+,%a1 # pop return addr from top of stack
127 mov.l (%sp)+,%d0 # pop size in bytes from top of stack
128 mov.l %sp,%a0 # save stack pointer for register copy
129 addq.l &3,%d0 # round size up to long word
130 andi.l &-4,%d0 # mask out lower two bits of size
131 mov.l %sp,%d1 # compute new value of sp to d1
132 sub.l %d0,%d1 # pseudo-allocate by moving stack pointer
133 sub.l &MAXREG*4,%d1 # allocate more space for saved regs.
134 mov.l %d1,%sp # actual allocation.
135 move.w &MAXREG-1,%d0 # d0 counts saved regs.
136 mov.l %a2,%d1 # preserve a2.
137 mov.l %sp,%a2 # make pointer to new reg save area.
138 copy_regs_loop: # copy stuff from old save area.
139 mov.l (%a0)+,(%a2)+ # save saved register
140 dbra %d0,copy_regs_loop
141 mov.l %a2,%a0 # now a2 is start of allocated space.
142 mov.l %a2,%d0 # return it in both a0 and d0 to play safe.
143 mov.l %d1,%a2 # restore a2.
144 subq.l &4,%sp # new top of stack
145 jmp (%a1) # far below normal return
146 #else /* not MOTOROLA_DELTA */
147 mov.l (%sp)+,%a1 # pop return addr from top of stack
148 mov.l (%sp)+,%d0 # pop size in bytes from top of stack
149 add.l &R%1,%d0 # round size up to long word
150 and.l &-4,%d0 # mask out lower two bits of size
151 sub.l %d0,%sp # allocate by moving stack pointer
152 tst.b P%1(%sp) # stack probe to allocate pages
153 mov.l %sp,%a0 # return pointer as pointer
154 mov.l %sp,%d0 # return pointer as int to avoid disaster
155 add.l &-4,%sp # new top of stack
156 jmp (%a1) # not a normal return
157 set S%1,64 # safety factor for C compiler scratch
158 set R%1,3+S%1 # add to size for rounding
159 set P%1,-132 # probe this far below current top of stack
160 #endif /* not MOTOROLA_DELTA */
168 * Registers are saved after the corresponding link so we have to explicitly
169 * move them to the top of the stack where they are expected to be.
170 * Since we do not know how many registers were saved in the calling function
171 * we must assume the maximum possible (d2-d7,a2-a5). Hence, we end up
172 * wasting some space on the stack.
174 * The large probe (tst.b) attempts to make up for the fact that we have
175 * potentially used up the space that the caller probed for its own needs.
184 move.l (sp)+,a1 ; pop return address
185 move.l (sp)+,d0 ; pop allocation size
186 move.l sp,d1 ; get current SP value
187 sub.l d0,d1 ; adjust to reflect required size...
188 sub.l #MAXREG*4,d1 ; ...and space needed for registers
189 and.l #-4,d1 ; backup to longword boundary
190 move.l sp,a0 ; save old SP value for register copy
191 move.l d1,sp ; set the new SP value
192 tst.b -4096(sp) ; grab an extra page (to cover caller)
193 move.l a2,d1 ; save callers register
195 move.w #MAXREG-1,d0 ; # of longwords to copy
196 loop: move.l (a0)+,(a2)+ ; copy registers...
197 dbra d0,loop ; ...til there are no more
198 move.l a2,d0 ; end of register area is addr for new space
199 move.l d1,a2 ; restore saved a2.
200 addq.l #4,sp ; caller will increment sp by 4 after return.
201 move.l d0,a0 ; return value in both a0 and d0.
206 /* Some systems want the _, some do not. Win with both kinds. */
216 tstb sp@(0) /* Make stack pages exist */
217 /* Needed on certain systems
218 that lack true demand paging */
222 #endif /* not WICAT */
224 #endif /* not m68k */
225 #endif /* not hp9000s300 */
227 #if defined (ns16000) || defined (ns32000)
231 /* Some systems want the _, some do not. Win with both kinds. */
237 /* Two different assembler syntaxes are used for the same code
238 on different systems. */
242 #define REGISTER(x) x
244 #ifdef NS5 /* ns SysV assembler */
246 #define REGISTER(x) x
249 #define REGISTER(x) 0(x)
254 * The ns16000 is a little more difficult, need to copy regs.
255 * Also the code assumes direct linkage call sequence (no mod table crap).
256 * We have to copy registers, and therefore waste 32 bytes.
264 * old sp -> regs (orig)
269 movd tos,r1 /* pop return addr */
270 negd tos,r0 /* pop amount to allocate */
273 bicb IM/**/3,r0 /* 4-byte align */
275 adjspb IM/**/36 /* space for regs, +4 for caller to pop */
276 movmd 0(r2),4(sp),IM/**/4 /* copy regs */
277 movmd 0x10(r2),0x14(sp),IM/**/4
278 jump REGISTER(r1) /* funky return */
279 #endif /* ns16000 or ns32000 */
285 _alloca: addw $3,pr0 # add 3 (dec) to first argument
286 bicw $3,pr0 # then clear its last 2 bits
287 subw pr0,sp # subtract from SP the val in PR0
288 andw $-32,sp # keep sp aligned on multiple of 32.
289 movw sp,pr0 # ret. current SP
292 #ifdef PYRAMID_OLD /* This isn't needed in system version 4. */
298 __longjmp: jump _longjmp
299 __setjmp: jump _setjmp
312 movw 0(%r8), %r1 /* pc */
315 addw2 %r0, %sp /* make room */
316 movw %sp, %r0 /* return value */
317 jmp (%r1) /* continue... */
325 _TEXT segment dword use32 public 'CODE'
328 ;-------------------------------------------------------------------------
333 pop ecx ; return address
334 pop eax ; amount to alloc
335 add eax,3 ; round it to 32-bit boundary
337 mov edx,esp ; current sp in edx
338 sub edx,eax ; lower the stack
339 xchg esp,edx ; start of allocation in esp, old sp in edx
340 mov eax,esp ; return ptr to base in eax
341 push [edx+8] ; save poss. stored reg. values (esi,edi,ebx)
342 push [edx+4] ; on lowered stack
344 sub esp,4 ; allow for 'add esp, 4'
345 jmp ecx ; jump to return address
355 #endif /* not HAVE_ALLOCA */