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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/* Copyright (C) 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 2006 Free Software Foundation, Inc.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this program. If not, see
* <http://www.gnu.org/licenses/>.
*/
/* "continue.h" Scheme Continuations for C.
Author: Aubrey Jaffer. */
/* If stack is not longword aligned then */
/* #define SHORT_ALIGN */
#ifdef THINK_C
# define SHORT_ALIGN
#endif
#ifdef __MWERKS__
# ifdef __MC68K__
# define SHORT_ALIGN
# endif
#endif
#ifdef MSDOS
# ifndef _M_ARM
/* arm processors need DWORD aligned data access */
# define SHORT_ALIGN
# endif
#endif
#ifdef atarist
# define SHORT_ALIGN
#endif
#ifdef SHORT_ALIGN
typedef short STACKITEM;
#else
typedef long STACKITEM;
#endif
/* If stacks grow up then */
/* #define STACK_GROWS_UP */
#ifdef hp9000s800
# define STACK_GROWS_UP
#endif
#ifdef pyr
# define STACK_GROWS_UP
#endif
#ifdef nosve
# define STACK_GROWS_UP
#endif
#ifdef _UNICOS
# define STACK_GROWS_UP
#endif
/* James Clark came up with this neat one instruction fix for
continuations on the SPARC. It flushes the register windows so
that all the state of the process is contained in the stack. */
#ifdef sparc
# define FLUSH_REGISTER_WINDOWS asm("ta 3")
#else
# define FLUSH_REGISTER_WINDOWS /* empty */
#endif
#ifdef vax
# ifndef CHEAP_CONTINUATIONS
typedef int jump_buf[17];
extern int setjump(jump_buf env);
extern int longjump(jump_buf env, int ret);
# else
# include <setjmp.h>
# define jump_buf jmp_buf
# define setjump setjmp
# define longjump longjmp
# endif
#else /* ndef vax */
# ifdef _CRAY1
typedef int jump_buf[112];
extern int setjump(jump_buf env);
extern int longjump(jump_buf env, int ret);
# else /* ndef _CRAY1 */
# ifndef PLAN9
# include <setjmp.h>
# include <signal.h>
# endif
# ifdef SIG_UNBLOCK
# define jump_buf sigjmp_buf
# define setjump(buf) sigsetjmp((buf), !0)
# define longjump siglongjmp
# else
# define jump_buf jmp_buf
# define setjump setjmp
# define longjump longjmp
# endif /* ndef SIG_UNBLOCK */
# endif /* ndef _CRAY1 */
#endif /* ndef vax */
/* `other' is a CONTINUATION slot for miscellaneous data of type
CONTINUATION_OTHER. */
#ifndef CONTINUATION_OTHER
# define CONTINUATION_OTHER int
#endif
struct Continuation {jump_buf jmpbuf;
long thrwval;
long length;
STACKITEM *stkbse;
#ifdef __ia64__
long *bspbse;
long bsplength;
long rnat;
#endif
CONTINUATION_OTHER other;
struct Continuation *parent;
};
typedef struct Continuation CONTINUATION;
#ifndef P
# ifdef USE_ANSI_PROTOTYPES
# define P(s) s
# else
# define P(s) ()
# endif
#endif
extern long thrown_value;
long stack_size P((STACKITEM *start));
CONTINUATION *make_root_continuation P((STACKITEM *stack_base));
CONTINUATION *make_continuation P((CONTINUATION *parent_cont));
void free_continuation P((CONTINUATION *cont));
void dynthrow P((long *a));
void grow_throw P((long *a));
void throw_to_continuation P((CONTINUATION *cont, long val,
CONTINUATION *root_cont));
/* how to get the local definition for malloc */
#ifndef STDC_HEADERS
# ifndef malloc
char *malloc P((sizet size));
# endif
char *realloc P((char *ptr, sizet size));
#endif
/* PTR_LT defines how to compare two addresses (which may not be in
the same array). */
#if defined(__TURBOC__) && !defined(__TOS__)
# ifdef PROT386
# define PTR_LT(x, y) (((long)(x)) < ((long)(y)))
# else
# define PTR_LT(x, y) ((x) < (y))
# endif
#else /* not __TURBOC__ */
# ifdef nosve
# define PTR_MASK 0xffffffffffff
# define PTR_LT(x, y) (((int)(x)&PTR_MASK) < ((int)(y)&PTR_MASK))
# else
# define PTR_LT(x, y) ((x) < (y))
# endif
#endif
#define PTR_GT(x, y) PTR_LT(y, x)
#define PTR_LE(x, y) (!PTR_GT(x, y))
#define PTR_GE(x, y) (!PTR_LT(x, y))
|
