5 /* Copyright (C) 1995, 1996, 1998, 1999, 2000 Free Software Foundation, Inc.
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2, or (at your option)
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with this software; 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 * As a special exception, the Free Software Foundation gives permission
23 * for additional uses of the text contained in its release of GUILE.
25 * The exception is that, if you link the GUILE library with other files
26 * to produce an executable, this does not by itself cause the
27 * resulting executable to be covered by the GNU General Public License.
28 * Your use of that executable is in no way restricted on account of
29 * linking the GUILE library code into it.
31 * This exception does not however invalidate any other reasons why
32 * the executable file might be covered by the GNU General Public License.
34 * This exception applies only to the code released by the
35 * Free Software Foundation under the name GUILE. If you copy
36 * code from other Free Software Foundation releases into a copy of
37 * GUILE, as the General Public License permits, the exception does
38 * not apply to the code that you add in this way. To avoid misleading
39 * anyone as to the status of such modified files, you must delete
40 * this exception notice from them.
42 * If you write modifications of your own for GUILE, it is your choice
43 * whether to permit this exception to apply to your modifications.
44 * If you do not wish that, delete this exception notice. */
46 /* {Supported Options}
48 * These may be defined or undefined.
51 /* #define GUILE_DEBUG_FREELIST */
53 /* If the compile FLAG `SCM_CAUTIOUS' is #defined then the number of
54 * arguments is always checked for application of closures. If the
55 * compile FLAG `SCM_RECKLESS' is #defined then they are not checked.
56 * Otherwise, number of argument checks for closures are made only when
57 * the function position (whose value is the closure) of a combination is
58 * not an ILOC or GLOC. When the function position of a combination is a
59 * symbol it will be checked only the first time it is evaluated because
60 * it will then be replaced with an ILOC or GLOC.
65 /* After looking up a local for the first time, rewrite the
66 * code graph, caching its position.
68 #define MEMOIZE_LOCALS
70 /* All the number support there is.
74 /* GC should relinquish empty cons-pair arenas.
76 #define GC_FREE_SEGMENTS
78 /* Provide a scheme-accessible count-down timer that
79 * generates a pseudo-interrupt.
84 /* Use engineering notation when converting numbers strings?
88 #undef SCM_CAREFUL_INTS
90 /* {Unsupported Options}
92 * These must be defined as given here.
98 /* Guile Scheme supports the #f/() distinction; Guile Lisp won't. We
99 have horrible plans for their unification. */
104 /* Random options (not yet supported or in final form). */
106 #define STACK_CHECKING
107 #undef NO_CEVAL_STACK_CHECKING
110 /* What did the configure script discover about the outside world? */
111 #include "libguile/scmconfig.h"
113 #ifdef HAVE_LONG_LONGS
115 /* Some auto-generated .h files contain unused prototypes
116 * that need these typedefs.
118 typedef long long long_long
;
119 typedef unsigned long long ulong_long
;
121 #endif /* HAVE_LONG_LONGS */
127 * SCM_CHAR_CODE_LIMIT == UCHAR_MAX + 1
128 * SCM_MOST_POSITIVE_FIXNUM (LONG_MAX>>2)
129 * SCM_MOST_NEGATIVE_FIXNUM == SCM_SRS((long)LONG_MIN, 2)
135 # define SCM_CHAR_CODE_LIMIT (UCHAR_MAX+1L)
137 # define SCM_CHAR_CODE_LIMIT 256L
138 # endif /* def UCHAR_MAX */
139 # define SCM_MOST_POSITIVE_FIXNUM (LONG_MAX>>2)
140 # ifdef _UNICOS /* Stupid cray bug */
141 # define SCM_MOST_NEGATIVE_FIXNUM ((long)LONG_MIN/4)
143 # define SCM_MOST_NEGATIVE_FIXNUM SCM_SRS((long)LONG_MIN, 2)
146 # define SCM_CHAR_CODE_LIMIT 256L
147 # define SCM_MOST_POSITIVE_FIXNUM ((long)((unsigned long)~0L>>3))
149 # define SCM_MOST_NEGATIVE_FIXNUM (-SCM_MOST_POSITIVE_FIXNUM-1)
151 # define SCM_MOST_NEGATIVE_FIXNUM (-SCM_MOST_POSITIVE_FIXNUM)
152 # endif /* (0 != ~0) */
153 #endif /* def HAVE_LIMITS_H */
160 # endif /* def AMIGA */
161 # define scm_sizet size_t
164 # define scm_sizet size_t
166 # define scm_sizet unsigned int
167 # endif /* def _SIZE_T */
168 #endif /* def STDC_HEADERS */
172 #include "libguile/tags.h"
176 # ifndef CHEAP_CONTINUATIONS
177 typedef int jmp_buf[17];
178 extern int setjump(jmp_buf env
);
179 extern int longjump(jmp_buf env
, int ret
);
180 # define setjmp setjump
181 # define longjmp longjump
187 typedef int jmp_buf[112];
188 extern int setjump(jmp_buf env
);
189 extern int longjump(jmp_buf env
, int ret
);
190 # define setjmp setjump
191 # define longjmp longjump
192 # else /* ndef _CRAY1 */
194 # endif /* ndef _CRAY1 */
195 #endif /* ndef vms */
197 /* James Clark came up with this neat one instruction fix for
198 * continuations on the SPARC. It flushes the register windows so
199 * that all the state of the process is contained in the stack.
203 # define SCM_FLUSH_REGISTER_WINDOWS asm("ta 3")
205 # define SCM_FLUSH_REGISTER_WINDOWS /* empty */
208 /* If stack is not longword aligned then
211 /* #define SHORT_ALIGN */
223 typedef short SCM_STACKITEM
;
225 typedef long SCM_STACKITEM
;
230 #define SCM_THREAD_DEFER
231 #define SCM_THREAD_ALLOW
232 #define SCM_THREAD_REDEFER
233 #define SCM_THREAD_SWITCHING_CODE
236 extern unsigned int scm_async_clock
;
238 #define SCM_ASYNC_TICK \
240 if (0 == --scm_async_clock) \
241 scm_async_click (); \
244 #ifdef SCM_CAREFUL_INTS
245 #define SCM_CHECK_NOT_DISABLED \
246 if (scm_ints_disabled) \
247 fputs("ints already disabled\n", stderr); \
249 #define SCM_CHECK_NOT_ENABLED \
250 if (!scm_ints_disabled) \
251 fputs("ints already enabled\n", stderr); \
254 #define SCM_CHECK_NOT_DISABLED
255 #define SCM_CHECK_NOT_ENABLED
259 /* Anthony Green writes:
260 When the compiler sees...
264 ...it doesn't actually promise to keep the critical code within the
265 boundries of the DEFER/ALLOW_INTS instructions. It may very well
266 schedule it outside of the magic defined in those macros.
268 However, GCC's volatile asm feature forms a barrier over which code is
269 never moved. So if you add...
271 ...to each of the DEFER_INTS and ALLOW_INTS macros, the critical
272 code will always remain in place. asm's without inputs or outputs
273 are implicitly volatile. */
275 #define SCM_FENCE asm /* volatile */ ("")
280 #define SCM_DEFER_INTS \
283 SCM_CHECK_NOT_DISABLED; \
286 scm_ints_disabled = 1; \
291 #define SCM_ALLOW_INTS_ONLY \
294 scm_ints_disabled = 0; \
298 #define SCM_ALLOW_INTS \
301 SCM_CHECK_NOT_ENABLED; \
302 SCM_THREAD_SWITCHING_CODE; \
304 scm_ints_disabled = 0; \
311 #define SCM_REDEFER_INTS \
314 SCM_THREAD_REDEFER; \
315 ++scm_ints_disabled; \
320 #define SCM_REALLOW_INTS \
323 SCM_THREAD_SWITCHING_CODE; \
325 --scm_ints_disabled; \
339 /* Classification of critical sections
341 * When Guile moves to POSIX threads, it won't be possible to prevent
342 * context switching. In fact, the whole idea of context switching is
343 * bogus if threads are run by different processors. Therefore, we
344 * must ultimately eliminate all critical sections or enforce them by
347 * All instances of SCM_DEFER_INTS and SCM_ALLOW_INTS should therefore
348 * be classified and replaced by one of the delimiters below. If you
349 * understand what this is all about, I'd like to encourage you to
350 * help with this task. The set of classes below must of course be
351 * incrementally augmented.
353 * MDJ 980419 <djurfeldt@nada.kth.se>
358 * Allocation of a cell with type tag in the CAR.
360 * With POSIX threads, each thread will have a private pool of free
361 * cells. Therefore, this type of section can be removed. But! It
362 * is important that the CDR is initialized first (with the CAR still
363 * indicating a free cell) so that we can guarantee a consistent heap
367 #ifdef SCM_POSIX_THREADS
368 #define SCM_ENTER_A_SECTION
369 #define SCM_EXIT_A_SECTION
371 #define SCM_ENTER_A_SECTION SCM_DEFER_INTS
372 #define SCM_EXIT_A_SECTION SCM_ALLOW_INTS
383 #define SCM_ASSERT(_cond, _arg, _pos, _subr)
384 #define SCM_ASSERT_TYPE(_cond, _arg, _pos, _subr)
385 #define SCM_ASRTGO(_cond, _label)
387 #define SCM_ASSERT(_cond, _arg, _pos, _subr) \
389 scm_wta(_arg, (char *)(_pos), _subr)
390 #define SCM_ASSERT_TYPE(_cond, _arg, _pos, _subr, _msg) \
392 scm_wrong_type_arg_msg(_subr, _pos, _arg, _msg)
393 #define SCM_ASRTGO(_cond, _label) \
402 extern SCM
scm_call_generic_0 (SCM gf
);
404 #define SCM_WTA_DISPATCH_0(gf, arg, pos, subr) \
406 ? scm_call_generic_0 ((gf)) \
407 : scm_wta ((arg), (char *) (pos), (subr)))
408 #define SCM_GASSERT0(cond, gf, arg, pos, subr) \
409 if (!(cond)) SCM_WTA_DISPATCH_0((gf), (arg), (pos), (subr))
411 extern SCM
scm_call_generic_1 (SCM gf
, SCM a1
);
413 #define SCM_WTA_DISPATCH_1(gf, a1, pos, subr) \
415 ? scm_call_generic_1 ((gf), (a1)) \
416 : scm_wta ((a1), (char *) (pos), (subr)))
417 #define SCM_GASSERT1(cond, gf, a1, pos, subr) \
418 if (!(cond)) SCM_WTA_DISPATCH_1((gf), (a1), (pos), (subr))
420 extern SCM
scm_call_generic_2 (SCM gf
, SCM a1
, SCM a2
);
422 #define SCM_WTA_DISPATCH_2(gf, a1, a2, pos, subr) \
424 ? scm_call_generic_2 ((gf), (a1), (a2)) \
425 : scm_wta ((pos) == SCM_ARG1 ? (a1) : (a2), (char *) (pos), (subr)))
426 #define SCM_GASSERT2(cond, gf, a1, a2, pos, subr) \
427 if (!(cond)) SCM_WTA_DISPATCH_2((gf), (a1), (a2), (pos), (subr))
429 extern SCM
scm_apply_generic (SCM gf
, SCM args
);
431 #define SCM_WTA_DISPATCH_n(gf, args, pos, subr) \
433 ? scm_apply_generic ((gf), (args)) \
434 : scm_wta (scm_list_ref ((args), SCM_MAKINUM ((pos) - 1)), \
437 #define SCM_GASSERTn(cond, gf, args, pos, subr) \
438 if (!(cond)) SCM_WTA_DISPATCH_n((gf), (args), (pos), (subr))
440 #ifndef SCM_MAGIC_SNARFER
441 /* Let these macros pass through if
442 we are snarfing; thus we can tell the
443 difference between the use of an actual
444 number vs. the use of one of these macros --
445 actual numbers in SCM_VALIDATE_* and SCM_ASSERT
446 constructs must match the formal argument name,
447 but using SCM_ARG* avoids the test */
457 /* #define SCM_ARGERR(X) ((X) < SCM_WNA \
459 : "wrong type argument")
462 /* Following must match entry indexes in scm_errmsgs[].
463 * Also, SCM_WNA must follow the last SCM_ARGn in sequence.
466 /* #define SCM_OVSCM_FLOW 9 */
467 #define SCM_OUTOFRANGE 10
468 #define SCM_NALLOC 11
469 /* #define SCM_STACK_OVFLOW 12 */
470 /* #define SCM_EXIT 13 */
472 #endif /* SCM_MAGIC_SNARFER */
474 /* (...still matching scm_errmsgs) These
475 * are signals. Signals may become errors
476 * but are distinguished because they first
477 * try to invoke a handler that can resume
478 * the interrupted routine.
480 #define SCM_HUP_SIGNAL 14
481 #define SCM_INT_SIGNAL 15
482 #define SCM_FPE_SIGNAL 16
483 #define SCM_BUS_SIGNAL 17
484 #define SCM_SEGV_SIGNAL 18
485 #define SCM_ALRM_SIGNAL 19
486 #define SCM_GC_SIGNAL 20
487 #define SCM_TICK_SIGNAL 21
489 #define SCM_SIG_ORD(X) ((X) - SCM_HUP_SIGNAL)
490 #define SCM_ORD_SIG(X) ((X) + SCM_HUP_SIGNAL)
491 #define SCM_NUM_SIGS (SCM_SIG_ORD (SCM_TICK_SIGNAL) + 1)
502 extern struct errdesc scm_errmsgs
[];
507 /* SCM_EXIT_SUCCESS is the default code to return from SCM if no errors
508 * were encountered. SCM_EXIT_FAILURE is the default code to return from
509 * SCM if errors were encountered. The return code can be explicitly
510 * specified in a SCM program with (scm_quit <n>).
513 #ifndef SCM_EXIT_SUCCESS
515 #define SCM_EXIT_SUCCESS 1
517 #define SCM_EXIT_SUCCESS 0
519 #endif /* ndef SCM_EXIT_SUCCESS */
520 #ifndef SCM_EXIT_FAILURE
522 #define SCM_EXIT_FAILURE 2
524 #define SCM_EXIT_FAILURE 1
526 #endif /* ndef SCM_EXIT_FAILURE */