1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
/* $arla: process.vax.S,v 1.1 2000/01/02 02:11:20 lha Exp $ */
/*
****************************************************************************
* Copyright IBM Corporation 1988, 1989 - All Rights Reserved *
* *
* Permission to use, copy, modify, and distribute this software and its *
* documentation for any purpose and without fee is hereby granted, *
* provided that the above copyright notice appear in all copies and *
* that both that copyright notice and this permission notice appear in *
* supporting documentation, and that the name of IBM not be used in *
* advertising or publicity pertaining to distribution of the software *
* without specific, written prior permission. *
* *
* IBM DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL *
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL IBM *
* BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY *
* DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER *
* IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING *
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. *
****************************************************************************
*/
#include <config.h>
#include <machine/asm.h>
#undef RCSID
/*
#
# Information Technology Center
# Carnegie-Mellon University
#
#
*/
/*
#
# Transcribed for Vaxen by M. Satyanarayanan, September 1985
# Algorithm: "Monkey see, monkey do"
#
*/
/*
#
# struct savearea {
# char *topstack;
# }
#
*/
.set topstack,0
/* Stuff to allow saving/restoring registers */
/*
# savecontext(f, area1, newsp)
# int (*f)(); struct savearea *area1; char *newsp;
*/
/* Stack offsets of arguments */
.set f,4
.set area1,8
.set newsp,12
ENTRY(savecontext, R2|R3|R4|R5|R6|R7|R8|R9|R10|R11)
movl $1,_C_LABEL(PRE_Block) # Critical section for preemption code
pushl ap # save old ap
pushl fp # save old fp
movl area1(ap),r0 # r0 = base of savearea
movl sp,topstack(r0) # area->topstack = sp
movl newsp(ap),r0 # Get new sp
beql L1 # if new sp is 0, dont change stacks
movl r0,sp # else switch to new stack
L1:
movl f(ap),r1 # r1 = f
calls $0,0(r1) # f()
/* It is impossible to be here, so abort() */
calls $0,_C_LABEL(abort)
/*
# returnto(area2)
# struct savearea *area2;
*/
/* Stack offset of argument */
.set area2,4
ENTRY(returnto, 0)
movl area2(ap),r0 # r0 = address of area2
movl topstack(r0),sp # Restore sp
movl (sp)+,fp # Restore fp
movl (sp)+,ap # ,,,,
clrl _C_LABEL(PRE_Block) # End of preemption critical section
ret
pushl $1234 # I will gloat, Kazar
calls $0,_C_LABEL(abort)
|
