parallel installability for libguile*.h
[bpt/guile.git] / doc / ref / api-control.texi
CommitLineData
07d83abe
MV
1@c -*-texinfo-*-
2@c This is part of the GNU Guile Reference Manual.
e10cf6b9 3@c Copyright (C) 1996, 1997, 2000, 2001, 2002, 2003, 2004, 2009, 2010
07d83abe
MV
4@c Free Software Foundation, Inc.
5@c See the file guile.texi for copying conditions.
6
7@page
8@node Control Mechanisms
9@section Controlling the Flow of Program Execution
10
11See @ref{Control Flow} for a discussion of how the more general control
12flow of Scheme affects C code.
13
14@menu
15* begin:: Evaluating a sequence of expressions.
16* if cond case:: Simple conditional evaluation.
17* and or:: Conditional evaluation of a sequence.
18* while do:: Iteration mechanisms.
19* Continuations:: Continuations.
20* Multiple Values:: Returning and accepting multiple values.
21* Exceptions:: Throwing and catching exceptions.
22* Error Reporting:: Procedures for signaling errors.
661ae7ab 23* Dynamic Wind:: Dealing with non-local entrance/exit.
07d83abe 24* Handling Errors:: How to handle errors in C code.
ce2612cd 25* Continuation Barriers:: Protection from non-local control flow.
07d83abe
MV
26@end menu
27
28@node begin
29@subsection Evaluating a Sequence of Expressions
30
31@cindex begin
32@cindex sequencing
33@cindex expression sequencing
34
35The @code{begin} syntax is used for grouping several expressions
36together so that they are treated as if they were one expression.
37This is particularly important when syntactic expressions are used
38which only allow one expression, but the programmer wants to use more
39than one expression in that place. As an example, consider the
40conditional expression below:
41
42@lisp
43(if (> x 0)
44 (begin (display "greater") (newline)))
45@end lisp
46
47If the two calls to @code{display} and @code{newline} were not embedded
48in a @code{begin}-statement, the call to @code{newline} would get
49misinterpreted as the else-branch of the @code{if}-expression.
50
51@deffn syntax begin expr1 expr2 @dots{}
52The expression(s) are evaluated in left-to-right order and the value
53of the last expression is returned as the value of the
54@code{begin}-expression. This expression type is used when the
55expressions before the last one are evaluated for their side effects.
56
57Guile also allows the expression @code{(begin)}, a @code{begin} with no
58sub-expressions. Such an expression returns the `unspecified' value.
59@end deffn
60
61@node if cond case
62@subsection Simple Conditional Evaluation
63
64@cindex conditional evaluation
65@cindex if
66@cindex case
67@cindex cond
68
69Guile provides three syntactic constructs for conditional evaluation.
70@code{if} is the normal if-then-else expression (with an optional else
71branch), @code{cond} is a conditional expression with multiple branches
72and @code{case} branches if an expression has one of a set of constant
73values.
74
75@deffn syntax if test consequent [alternate]
76All arguments may be arbitrary expressions. First, @var{test} is
77evaluated. If it returns a true value, the expression @var{consequent}
78is evaluated and @var{alternate} is ignored. If @var{test} evaluates to
79@code{#f}, @var{alternate} is evaluated instead. The value of the
80evaluated branch (@var{consequent} or @var{alternate}) is returned as
81the value of the @code{if} expression.
82
83When @var{alternate} is omitted and the @var{test} evaluates to
84@code{#f}, the value of the expression is not specified.
85@end deffn
86
87@deffn syntax cond clause1 clause2 @dots{}
88Each @code{cond}-clause must look like this:
89
90@lisp
91(@var{test} @var{expression} @dots{})
92@end lisp
93
94where @var{test} and @var{expression} are arbitrary expression, or like
95this
96
97@lisp
98(@var{test} => @var{expression})
99@end lisp
100
101where @var{expression} must evaluate to a procedure.
102
103The @var{test}s of the clauses are evaluated in order and as soon as one
104of them evaluates to a true values, the corresponding @var{expression}s
105are evaluated in order and the last value is returned as the value of
106the @code{cond}-expression. For the @code{=>} clause type,
107@var{expression} is evaluated and the resulting procedure is applied to
108the value of @var{test}. The result of this procedure application is
109then the result of the @code{cond}-expression.
110
43ed3b69
MV
111@cindex SRFI-61
112@cindex general cond clause
113@cindex multiple values and cond
114One additional @code{cond}-clause is available as an extension to
115standard Scheme:
116
117@lisp
118(@var{test} @var{guard} => @var{expression})
119@end lisp
120
121where @var{guard} and @var{expression} must evaluate to procedures.
122For this clause type, @var{test} may return multiple values, and
123@code{cond} ignores its boolean state; instead, @code{cond} evaluates
124@var{guard} and applies the resulting procedure to the value(s) of
125@var{test}, as if @var{guard} were the @var{consumer} argument of
126@code{call-with-values}. Iff the result of that procedure call is a
127true value, it evaluates @var{expression} and applies the resulting
128procedure to the value(s) of @var{test}, in the same manner as the
129@var{guard} was called.
130
07d83abe
MV
131The @var{test} of the last @var{clause} may be the symbol @code{else}.
132Then, if none of the preceding @var{test}s is true, the
133@var{expression}s following the @code{else} are evaluated to produce the
134result of the @code{cond}-expression.
135@end deffn
136
137@deffn syntax case key clause1 clause2 @dots{}
138@var{key} may be any expression, the @var{clause}s must have the form
139
140@lisp
141((@var{datum1} @dots{}) @var{expr1} @var{expr2} @dots{})
142@end lisp
143
144and the last @var{clause} may have the form
145
146@lisp
147(else @var{expr1} @var{expr2} @dots{})
148@end lisp
149
150All @var{datum}s must be distinct. First, @var{key} is evaluated. The
151the result of this evaluation is compared against all @var{datum}s using
152@code{eqv?}. When this comparison succeeds, the expression(s) following
153the @var{datum} are evaluated from left to right, returning the value of
154the last expression as the result of the @code{case} expression.
155
156If the @var{key} matches no @var{datum} and there is an
157@code{else}-clause, the expressions following the @code{else} are
158evaluated. If there is no such clause, the result of the expression is
159unspecified.
160@end deffn
161
162
163@node and or
164@subsection Conditional Evaluation of a Sequence of Expressions
165
166@code{and} and @code{or} evaluate all their arguments in order, similar
167to @code{begin}, but evaluation stops as soon as one of the expressions
168evaluates to false or true, respectively.
169
170@deffn syntax and expr @dots{}
171Evaluate the @var{expr}s from left to right and stop evaluation as soon
172as one expression evaluates to @code{#f}; the remaining expressions are
173not evaluated. The value of the last evaluated expression is returned.
174If no expression evaluates to @code{#f}, the value of the last
175expression is returned.
176
177If used without expressions, @code{#t} is returned.
178@end deffn
179
180@deffn syntax or expr @dots{}
181Evaluate the @var{expr}s from left to right and stop evaluation as soon
182as one expression evaluates to a true value (that is, a value different
183from @code{#f}); the remaining expressions are not evaluated. The value
184of the last evaluated expression is returned. If all expressions
185evaluate to @code{#f}, @code{#f} is returned.
186
187If used without expressions, @code{#f} is returned.
188@end deffn
189
190
191@node while do
192@subsection Iteration mechanisms
193
194@cindex iteration
195@cindex looping
196@cindex named let
197
198Scheme has only few iteration mechanisms, mainly because iteration in
199Scheme programs is normally expressed using recursion. Nevertheless,
200R5RS defines a construct for programming loops, calling @code{do}. In
201addition, Guile has an explicit looping syntax called @code{while}.
202
203@deffn syntax do ((variable init [step]) @dots{}) (test [expr @dots{}]) body @dots{}
204Bind @var{variable}s and evaluate @var{body} until @var{test} is true.
205The return value is the last @var{expr} after @var{test}, if given. A
206simple example will illustrate the basic form,
207
208@example
209(do ((i 1 (1+ i)))
210 ((> i 4))
211 (display i))
212@print{} 1234
213@end example
214
215@noindent
216Or with two variables and a final return value,
217
218@example
219(do ((i 1 (1+ i))
220 (p 3 (* 3 p)))
221 ((> i 4)
222 p)
223 (format #t "3**~s is ~s\n" i p))
224@print{}
2253**1 is 3
2263**2 is 9
2273**3 is 27
2283**4 is 81
229@result{}
230789
231@end example
232
233The @var{variable} bindings are established like a @code{let}, in that
234the expressions are all evaluated and then all bindings made. When
235iterating, the optional @var{step} expressions are evaluated with the
236previous bindings in scope, then new bindings all made.
237
238The @var{test} expression is a termination condition. Looping stops
239when the @var{test} is true. It's evaluated before running the
240@var{body} each time, so if it's true the first time then @var{body}
241is not run at all.
242
243The optional @var{expr}s after the @var{test} are evaluated at the end
244of looping, with the final @var{variable} bindings available. The
245last @var{expr} gives the return value, or if there are no @var{expr}s
246the return value is unspecified.
247
248Each iteration establishes bindings to fresh locations for the
249@var{variable}s, like a new @code{let} for each iteration. This is
250done for @var{variable}s without @var{step} expressions too. The
251following illustrates this, showing how a new @code{i} is captured by
252the @code{lambda} in each iteration (@pxref{About Closure,, The
253Concept of Closure}).
254
255@example
256(define lst '())
257(do ((i 1 (1+ i)))
258 ((> i 4))
259 (set! lst (cons (lambda () i) lst)))
260(map (lambda (proc) (proc)) lst)
261@result{}
262(4 3 2 1)
263@end example
264@end deffn
265
266@deffn syntax while cond body @dots{}
267Run a loop executing the @var{body} forms while @var{cond} is true.
268@var{cond} is tested at the start of each iteration, so if it's
269@code{#f} the first time then @var{body} is not executed at all. The
270return value is unspecified.
271
272Within @code{while}, two extra bindings are provided, they can be used
273from both @var{cond} and @var{body}.
274
275@deffn {Scheme Procedure} break
276Break out of the @code{while} form.
277@end deffn
278
279@deffn {Scheme Procedure} continue
280Abandon the current iteration, go back to the start and test
281@var{cond} again, etc.
282@end deffn
283
284Each @code{while} form gets its own @code{break} and @code{continue}
285procedures, operating on that @code{while}. This means when loops are
286nested the outer @code{break} can be used to escape all the way out.
287For example,
288
289@example
290(while (test1)
291 (let ((outer-break break))
292 (while (test2)
293 (if (something)
294 (outer-break #f))
295 ...)))
296@end example
297
298Note that each @code{break} and @code{continue} procedure can only be
299used within the dynamic extent of its @code{while}. Outside the
300@code{while} their behaviour is unspecified.
301@end deffn
302
303@cindex named let
304Another very common way of expressing iteration in Scheme programs is
305the use of the so-called @dfn{named let}.
306
307Named let is a variant of @code{let} which creates a procedure and calls
308it in one step. Because of the newly created procedure, named let is
309more powerful than @code{do}--it can be used for iteration, but also
310for arbitrary recursion.
311
312@deffn syntax let variable bindings body
313For the definition of @var{bindings} see the documentation about
314@code{let} (@pxref{Local Bindings}).
315
316Named @code{let} works as follows:
317
318@itemize @bullet
319@item
320A new procedure which accepts as many arguments as are in @var{bindings}
321is created and bound locally (using @code{let}) to @var{variable}. The
322new procedure's formal argument names are the name of the
323@var{variables}.
324
325@item
326The @var{body} expressions are inserted into the newly created procedure.
327
328@item
329The procedure is called with the @var{init} expressions as the formal
330arguments.
331@end itemize
332
333The next example implements a loop which iterates (by recursion) 1000
334times.
335
336@lisp
337(let lp ((x 1000))
338 (if (positive? x)
339 (lp (- x 1))
340 x))
341@result{}
3420
343@end lisp
344@end deffn
345
346
347@node Continuations
348@subsection Continuations
349@cindex continuations
350
351A ``continuation'' is the code that will execute when a given function
352or expression returns. For example, consider
353
354@example
355(define (foo)
356 (display "hello\n")
357 (display (bar)) (newline)
358 (exit))
359@end example
360
361The continuation from the call to @code{bar} comprises a
362@code{display} of the value returned, a @code{newline} and an
363@code{exit}. This can be expressed as a function of one argument.
364
365@example
366(lambda (r)
367 (display r) (newline)
368 (exit))
369@end example
370
371In Scheme, continuations are represented as special procedures just
372like this. The special property is that when a continuation is called
373it abandons the current program location and jumps directly to that
374represented by the continuation.
375
376A continuation is like a dynamic label, capturing at run-time a point
377in program execution, including all the nested calls that have lead to
378it (or rather the code that will execute when those calls return).
379
380Continuations are created with the following functions.
381
382@deffn {Scheme Procedure} call-with-current-continuation proc
383@deffnx {Scheme Procedure} call/cc proc
384@rnindex call-with-current-continuation
385Capture the current continuation and call @code{(@var{proc}
386@var{cont})} with it. The return value is the value returned by
387@var{proc}, or when @code{(@var{cont} @var{value})} is later invoked,
388the return is the @var{value} passed.
389
390Normally @var{cont} should be called with one argument, but when the
391location resumed is expecting multiple values (@pxref{Multiple
392Values}) then they should be passed as multiple arguments, for
393instance @code{(@var{cont} @var{x} @var{y} @var{z})}.
394
b4fddbbe
MV
395@var{cont} may only be used from the same side of a continuation
396barrier as it was created (@pxref{Continuation Barriers}), and in a
397multi-threaded program only from the thread in which it was created.
07d83abe
MV
398
399The call to @var{proc} is not part of the continuation captured, it runs
400only when the continuation is created. Often a program will want to
401store @var{cont} somewhere for later use; this can be done in
402@var{proc}.
403
404The @code{call} in the name @code{call-with-current-continuation}
405refers to the way a call to @var{proc} gives the newly created
406continuation. It's not related to the way a call is used later to
407invoke that continuation.
408
409@code{call/cc} is an alias for @code{call-with-current-continuation}.
410This is in common use since the latter is rather long.
411@end deffn
412
07d83abe
MV
413@sp 1
414@noindent
415Here is a simple example,
416
417@example
418(define kont #f)
419(format #t "the return is ~a\n"
420 (call/cc (lambda (k)
421 (set! kont k)
422 1)))
423@result{} the return is 1
424
425(kont 2)
426@result{} the return is 2
427@end example
428
429@code{call/cc} captures a continuation in which the value returned is
430going to be displayed by @code{format}. The @code{lambda} stores this
431in @code{kont} and gives an initial return @code{1} which is
432displayed. The later invocation of @code{kont} resumes the captured
433point, but this time returning @code{2}, which is displayed.
434
435When Guile is run interactively, a call to @code{format} like this has
436an implicit return back to the read-eval-print loop. @code{call/cc}
437captures that like any other return, which is why interactively
438@code{kont} will come back to read more input.
439
440@sp 1
441C programmers may note that @code{call/cc} is like @code{setjmp} in
442the way it records at runtime a point in program execution. A call to
443a continuation is like a @code{longjmp} in that it abandons the
444present location and goes to the recorded one. Like @code{longjmp},
445the value passed to the continuation is the value returned by
446@code{call/cc} on resuming there. However @code{longjmp} can only go
447up the program stack, but the continuation mechanism can go anywhere.
448
449When a continuation is invoked, @code{call/cc} and subsequent code
450effectively ``returns'' a second time. It can be confusing to imagine
451a function returning more times than it was called. It may help
452instead to think of it being stealthily re-entered and then program
453flow going on as normal.
454
455@code{dynamic-wind} (@pxref{Dynamic Wind}) can be used to ensure setup
456and cleanup code is run when a program locus is resumed or abandoned
661ae7ab 457through the continuation mechanism.
07d83abe
MV
458
459@sp 1
460Continuations are a powerful mechanism, and can be used to implement
461almost any sort of control structure, such as loops, coroutines, or
462exception handlers.
463
464However the implementation of continuations in Guile is not as
465efficient as one might hope, because Guile is designed to cooperate
466with programs written in other languages, such as C, which do not know
467about continuations. Basically continuations are captured by a block
468copy of the stack, and resumed by copying back.
469
470For this reason, generally continuations should be used only when
471there is no other simple way to achieve the desired result, or when
472the elegance of the continuation mechanism outweighs the need for
473performance.
474
475Escapes upwards from loops or nested functions are generally best
476handled with exceptions (@pxref{Exceptions}). Coroutines can be
477efficiently implemented with cooperating threads (a thread holds a
478full program stack but doesn't copy it around the way continuations
479do).
480
481
482@node Multiple Values
483@subsection Returning and Accepting Multiple Values
484
485@cindex multiple values
486@cindex receive
487
488Scheme allows a procedure to return more than one value to its caller.
489This is quite different to other languages which only allow
490single-value returns. Returning multiple values is different from
491returning a list (or pair or vector) of values to the caller, because
492conceptually not @emph{one} compound object is returned, but several
493distinct values.
494
495The primitive procedures for handling multiple values are @code{values}
496and @code{call-with-values}. @code{values} is used for returning
497multiple values from a procedure. This is done by placing a call to
498@code{values} with zero or more arguments in tail position in a
499procedure body. @code{call-with-values} combines a procedure returning
500multiple values with a procedure which accepts these values as
501parameters.
502
503@rnindex values
504@deffn {Scheme Procedure} values arg1 @dots{} argN
505@deffnx {C Function} scm_values (args)
506Delivers all of its arguments to its continuation. Except for
507continuations created by the @code{call-with-values} procedure,
508all continuations take exactly one value. The effect of
509passing no value or more than one value to continuations that
510were not created by @code{call-with-values} is unspecified.
511
512For @code{scm_values}, @var{args} is a list of arguments and the
513return is a multiple-values object which the caller can return. In
514the current implementation that object shares structure with
515@var{args}, so @var{args} should not be modified subsequently.
516@end deffn
517
518@rnindex call-with-values
519@deffn {Scheme Procedure} call-with-values producer consumer
520Calls its @var{producer} argument with no values and a
521continuation that, when passed some values, calls the
522@var{consumer} procedure with those values as arguments. The
523continuation for the call to @var{consumer} is the continuation
524of the call to @code{call-with-values}.
525
526@example
527(call-with-values (lambda () (values 4 5))
528 (lambda (a b) b))
529@result{} 5
530
531@end example
532@example
533(call-with-values * -)
534@result{} -1
535@end example
536@end deffn
537
538In addition to the fundamental procedures described above, Guile has a
23f2b9a3
KR
539module which exports a syntax called @code{receive}, which is much
540more convenient. This is in the @code{(ice-9 receive)} and is the
541same as specified by SRFI-8 (@pxref{SRFI-8}).
07d83abe
MV
542
543@lisp
544(use-modules (ice-9 receive))
545@end lisp
546
547@deffn {library syntax} receive formals expr body @dots{}
23f2b9a3
KR
548Evaluate the expression @var{expr}, and bind the result values (zero
549or more) to the formal arguments in @var{formals}. @var{formals} is a
550list of symbols, like the argument list in a @code{lambda}
551(@pxref{Lambda}). After binding the variables, the expressions in
552@var{body} @dots{} are evaluated in order, the return value is the
553result from the last expression.
554
555For example getting results from @code{partition} in SRFI-1
556(@pxref{SRFI-1}),
557
558@example
559(receive (odds evens)
560 (partition odd? '(7 4 2 8 3))
561 (display odds)
562 (display " and ")
563 (display evens))
564@print{} (7 3) and (4 2 8)
565@end example
566
07d83abe
MV
567@end deffn
568
569
570@node Exceptions
571@subsection Exceptions
572@cindex error handling
573@cindex exception handling
574
575A common requirement in applications is to want to jump
576@dfn{non-locally} from the depths of a computation back to, say, the
577application's main processing loop. Usually, the place that is the
578target of the jump is somewhere in the calling stack of procedures that
579called the procedure that wants to jump back. For example, typical
580logic for a key press driven application might look something like this:
581
582@example
583main-loop:
584 read the next key press and call dispatch-key
585
586dispatch-key:
587 lookup the key in a keymap and call an appropriate procedure,
588 say find-file
589
590find-file:
591 interactively read the required file name, then call
592 find-specified-file
593
594find-specified-file:
595 check whether file exists; if not, jump back to main-loop
596 @dots{}
597@end example
598
599The jump back to @code{main-loop} could be achieved by returning through
600the stack one procedure at a time, using the return value of each
601procedure to indicate the error condition, but Guile (like most modern
602programming languages) provides an additional mechanism called
603@dfn{exception handling} that can be used to implement such jumps much
604more conveniently.
605
606@menu
607* Exception Terminology:: Different ways to say the same thing.
608* Catch:: Setting up to catch exceptions.
e10cf6b9 609* Throw Handlers:: Handling exceptions before unwinding the stack.
7b4c914e 610* Throw:: Throwing an exception.
07d83abe
MV
611* Exception Implementation:: How Guile implements exceptions.
612@end menu
613
614
615@node Exception Terminology
616@subsubsection Exception Terminology
617
618There are several variations on the terminology for dealing with
619non-local jumps. It is useful to be aware of them, and to realize
620that they all refer to the same basic mechanism.
621
622@itemize @bullet
623@item
624Actually making a non-local jump may be called @dfn{raising an
625exception}, @dfn{raising a signal}, @dfn{throwing an exception} or
626@dfn{doing a long jump}. When the jump indicates an error condition,
627people may talk about @dfn{signalling}, @dfn{raising} or @dfn{throwing}
628@dfn{an error}.
629
630@item
631Handling the jump at its target may be referred to as @dfn{catching} or
632@dfn{handling} the @dfn{exception}, @dfn{signal} or, where an error
633condition is involved, @dfn{error}.
634@end itemize
635
636Where @dfn{signal} and @dfn{signalling} are used, special care is needed
637to avoid the risk of confusion with POSIX signals.
638
639This manual prefers to speak of throwing and catching exceptions, since
640this terminology matches the corresponding Guile primitives.
641
642
643@node Catch
644@subsubsection Catching Exceptions
645
646@code{catch} is used to set up a target for a possible non-local jump.
647The arguments of a @code{catch} expression are a @dfn{key}, which
648restricts the set of exceptions to which this @code{catch} applies, a
7b4c914e
NJ
649thunk that specifies the code to execute and one or two @dfn{handler}
650procedures that say what to do if an exception is thrown while executing
651the code. If the execution thunk executes @dfn{normally}, which means
652without throwing any exceptions, the handler procedures are not called
653at all.
07d83abe
MV
654
655When an exception is thrown using the @code{throw} function, the first
656argument of the @code{throw} is a symbol that indicates the type of the
657exception. For example, Guile throws an exception using the symbol
658@code{numerical-overflow} to indicate numerical overflow errors such as
659division by zero:
660
661@lisp
662(/ 1 0)
663@result{}
664ABORT: (numerical-overflow)
665@end lisp
666
667The @var{key} argument in a @code{catch} expression corresponds to this
668symbol. @var{key} may be a specific symbol, such as
669@code{numerical-overflow}, in which case the @code{catch} applies
670specifically to exceptions of that type; or it may be @code{#t}, which
671means that the @code{catch} applies to all exceptions, irrespective of
672their type.
673
674The second argument of a @code{catch} expression should be a thunk
675(i.e. a procedure that accepts no arguments) that specifies the normal
676case code. The @code{catch} is active for the execution of this thunk,
677including any code called directly or indirectly by the thunk's body.
678Evaluation of the @code{catch} expression activates the catch and then
679calls this thunk.
680
681The third argument of a @code{catch} expression is a handler procedure.
682If an exception is thrown, this procedure is called with exactly the
683arguments specified by the @code{throw}. Therefore, the handler
684procedure must be designed to accept a number of arguments that
685corresponds to the number of arguments in all @code{throw} expressions
686that can be caught by this @code{catch}.
687
7b4c914e
NJ
688The fourth, optional argument of a @code{catch} expression is another
689handler procedure, called the @dfn{pre-unwind} handler. It differs from
690the third argument in that if an exception is thrown, it is called,
691@emph{before} the third argument handler, in exactly the dynamic context
692of the @code{throw} expression that threw the exception. This means
693that it is useful for capturing or displaying the stack at the point of
694the @code{throw}, or for examining other aspects of the dynamic context,
695such as fluid values, before the context is unwound back to that of the
696prevailing @code{catch}.
697
698@deffn {Scheme Procedure} catch key thunk handler [pre-unwind-handler]
699@deffnx {C Function} scm_catch_with_pre_unwind_handler (key, thunk, handler, pre_unwind_handler)
07d83abe
MV
700@deffnx {C Function} scm_catch (key, thunk, handler)
701Invoke @var{thunk} in the dynamic context of @var{handler} for
702exceptions matching @var{key}. If thunk throws to the symbol
703@var{key}, then @var{handler} is invoked this way:
704@lisp
705(handler key args ...)
706@end lisp
707
708@var{key} is a symbol or @code{#t}.
709
710@var{thunk} takes no arguments. If @var{thunk} returns
711normally, that is the return value of @code{catch}.
712
713Handler is invoked outside the scope of its own @code{catch}.
714If @var{handler} again throws to the same key, a new handler
715from further up the call chain is invoked.
716
717If the key is @code{#t}, then a throw to @emph{any} symbol will
718match this call to @code{catch}.
7b4c914e
NJ
719
720If a @var{pre-unwind-handler} is given and @var{thunk} throws
721an exception that matches @var{key}, Guile calls the
722@var{pre-unwind-handler} before unwinding the dynamic state and
723invoking the main @var{handler}. @var{pre-unwind-handler} should
724be a procedure with the same signature as @var{handler}, that
725is @code{(lambda (key . args))}. It is typically used to save
726the stack at the point where the exception occurred, but can also
727query other parts of the dynamic state at that point, such as
728fluid values.
729
730A @var{pre-unwind-handler} can exit either normally or non-locally.
731If it exits normally, Guile unwinds the stack and dynamic context
732and then calls the normal (third argument) handler. If it exits
733non-locally, that exit determines the continuation.
07d83abe
MV
734@end deffn
735
7b4c914e 736If a handler procedure needs to match a variety of @code{throw}
07d83abe
MV
737expressions with varying numbers of arguments, you should write it like
738this:
739
740@lisp
741(lambda (key . args)
742 @dots{})
743@end lisp
744
745@noindent
746The @var{key} argument is guaranteed always to be present, because a
747@code{throw} without a @var{key} is not valid. The number and
748interpretation of the @var{args} varies from one type of exception to
749another, but should be specified by the documentation for each exception
750type.
751
7b4c914e
NJ
752Note that, once the normal (post-unwind) handler procedure is invoked,
753the catch that led to the handler procedure being called is no longer
754active. Therefore, if the handler procedure itself throws an exception,
755that exception can only be caught by another active catch higher up the
756call stack, if there is one.
07d83abe
MV
757
758@sp 1
7b4c914e
NJ
759@deftypefn {C Function} SCM scm_c_catch (SCM tag, scm_t_catch_body body, void *body_data, scm_t_catch_handler handler, void *handler_data, scm_t_catch_handler pre_unwind_handler, void *pre_unwind_handler_data)
760@deftypefnx {C Function} SCM scm_internal_catch (SCM tag, scm_t_catch_body body, void *body_data, scm_t_catch_handler handler, void *handler_data)
761The above @code{scm_catch_with_pre_unwind_handler} and @code{scm_catch}
762take Scheme procedures as body and handler arguments.
763@code{scm_c_catch} and @code{scm_internal_catch} are equivalents taking
764C functions.
765
766@var{body} is called as @code{@var{body} (@var{body_data})} with a catch
767on exceptions of the given @var{tag} type. If an exception is caught,
768@var{pre_unwind_handler} and @var{handler} are called as
769@code{@var{handler} (@var{handler_data}, @var{key}, @var{args})}.
770@var{key} and @var{args} are the @code{SCM} key and argument list from
771the @code{throw}.
07d83abe
MV
772
773@tpindex scm_t_catch_body
774@tpindex scm_t_catch_handler
775@var{body} and @var{handler} should have the following prototypes.
776@code{scm_t_catch_body} and @code{scm_t_catch_handler} are pointer
777typedefs for these.
778
779@example
780SCM body (void *data);
781SCM handler (void *data, SCM key, SCM args);
782@end example
783
784The @var{body_data} and @var{handler_data} parameters are passed to
785the respective calls so an application can communicate extra
786information to those functions.
787
788If the data consists of an @code{SCM} object, care should be taken
789that it isn't garbage collected while still required. If the
790@code{SCM} is a local C variable, one way to protect it is to pass a
791pointer to that variable as the data parameter, since the C compiler
792will then know the value must be held on the stack. Another way is to
793use @code{scm_remember_upto_here_1} (@pxref{Remembering During
794Operations}).
795@end deftypefn
796
797
7b4c914e
NJ
798@node Throw Handlers
799@subsubsection Throw Handlers
07d83abe 800
7b4c914e 801It's sometimes useful to be able to intercept an exception that is being
e10cf6b9
AW
802thrown before the stack is unwound. This could be to clean up some
803related state, to print a backtrace, or to pass information about the
804exception to a debugger, for example. The @code{with-throw-handler}
805procedure provides a way to do this.
07d83abe 806
7b4c914e
NJ
807@deffn {Scheme Procedure} with-throw-handler key thunk handler
808@deffnx {C Function} scm_with_throw_handler (key, thunk, handler)
809Add @var{handler} to the dynamic context as a throw handler
810for key @var{key}, then invoke @var{thunk}.
e10cf6b9
AW
811
812This behaves exactly like @code{catch}, except that it does not unwind
813the stack before invoking @var{handler}. If the @var{handler} procedure
814returns normally, Guile rethrows the same exception again to the next
815innermost catch or throw handler. @var{handler} may exit nonlocally, of
816course, via an explicit throw or via invoking a continuation.
07d83abe
MV
817@end deffn
818
e10cf6b9
AW
819Typically @var{handler} is used to display a backtrace of the stack at
820the point where the corresponding @code{throw} occurred, or to save off
821this information for possible display later.
822
823Not unwinding the stack means that throwing an exception that is handled
824via a throw handler is equivalent to calling the throw handler handler
825inline instead of each @code{throw}, and then omitting the surrounding
826@code{with-throw-handler}. In other words,
827
828@lisp
829(with-throw-handler 'key
830 (lambda () @dots{} (throw 'key args @dots{}) @dots{})
831 handler)
832@end lisp
833
834@noindent
835is mostly equivalent to
836
837@lisp
838((lambda () @dots{} (handler 'key args @dots{}) @dots{}))
839@end lisp
840
841In particular, the dynamic context when @var{handler} is invoked is that
842of the site where @code{throw} is called. The examples are not quite
843equivalent, because the body of a @code{with-throw-handler} is not in
844tail position with respect to the @code{with-throw-handler}, and if
845@var{handler} exits normally, Guile arranges to rethrow the error, but
846hopefully the intention is clear. (For an introduction to what is meant
847by dynamic context, @xref{Dynamic Wind}.)
848
7b4c914e
NJ
849@deftypefn {C Function} SCM scm_c_with_throw_handler (SCM tag, scm_t_catch_body body, void *body_data, scm_t_catch_handler handler, void *handler_data, int lazy_catch_p)
850The above @code{scm_with_throw_handler} takes Scheme procedures as body
851(thunk) and handler arguments. @code{scm_c_with_throw_handler} is an
852equivalent taking C functions. See @code{scm_c_catch} (@pxref{Catch})
853for a description of the parameters, the behaviour however of course
854follows @code{with-throw-handler}.
855@end deftypefn
07d83abe 856
7b4c914e
NJ
857If @var{thunk} throws an exception, Guile handles that exception by
858invoking the innermost @code{catch} or throw handler whose key matches
859that of the exception. When the innermost thing is a throw handler,
860Guile calls the specified handler procedure using @code{(apply
861@var{handler} key args)}. The handler procedure may either return
862normally or exit non-locally. If it returns normally, Guile passes the
863exception on to the next innermost @code{catch} or throw handler. If it
864exits non-locally, that exit determines the continuation.
865
866The behaviour of a throw handler is very similar to that of a
867@code{catch} expression's optional pre-unwind handler. In particular, a
868throw handler's handler procedure is invoked in the exact dynamic
869context of the @code{throw} expression, just as a pre-unwind handler is.
870@code{with-throw-handler} may be seen as a half-@code{catch}: it does
871everything that a @code{catch} would do until the point where
872@code{catch} would start unwinding the stack and dynamic context, but
873then it rethrows to the next innermost @code{catch} or throw handler
874instead.
07d83abe 875
e10cf6b9
AW
876Note also that since the dynamic context is not unwound, if a
877@code{with-throw-handler} handler throws to a key that does not match
878the @code{with-throw-handler} expression's @var{key}, the new throw may
879be handled by a @code{catch} or throw handler that is @emph{closer} to
880the throw than the first @code{with-throw-handler}.
07d83abe 881
e10cf6b9 882Here is an example to illustrate this behavior:
7b4c914e
NJ
883
884@lisp
885(catch 'a
886 (lambda ()
887 (with-throw-handler 'b
888 (lambda ()
889 (catch 'a
890 (lambda ()
891 (throw 'b))
892 inner-handler))
893 (lambda (key . args)
894 (throw 'a))))
895 outer-handler)
896@end lisp
897
898@noindent
899This code will call @code{inner-handler} and then continue with the
e10cf6b9 900continuation of the inner @code{catch}.
7b4c914e
NJ
901
902
903@node Throw
904@subsubsection Throwing Exceptions
905
906The @code{throw} primitive is used to throw an exception. One argument,
907the @var{key}, is mandatory, and must be a symbol; it indicates the type
908of exception that is being thrown. Following the @var{key},
909@code{throw} accepts any number of additional arguments, whose meaning
910depends on the exception type. The documentation for each possible type
911of exception should specify the additional arguments that are expected
912for that kind of exception.
913
914@deffn {Scheme Procedure} throw key . args
915@deffnx {C Function} scm_throw (key, args)
916Invoke the catch form matching @var{key}, passing @var{args} to the
917@var{handler}.
918
919@var{key} is a symbol. It will match catches of the same symbol or of
920@code{#t}.
921
922If there is no handler at all, Guile prints an error and then exits.
923@end deffn
924
925When an exception is thrown, it will be caught by the innermost
926@code{catch} or throw handler that applies to the type of the thrown
927exception; in other words, whose @var{key} is either @code{#t} or the
928same symbol as that used in the @code{throw} expression. Once Guile has
929identified the appropriate @code{catch} or throw handler, it handles the
930exception by applying the relevant handler procedure(s) to the arguments
931of the @code{throw}.
932
933If there is no appropriate @code{catch} or throw handler for a thrown
934exception, Guile prints an error to the current error port indicating an
935uncaught exception, and then exits. In practice, it is quite difficult
936to observe this behaviour, because Guile when used interactively
937installs a top level @code{catch} handler that will catch all exceptions
938and print an appropriate error message @emph{without} exiting. For
939example, this is what happens if you try to throw an unhandled exception
940in the standard Guile REPL; note that Guile's command loop continues
941after the error message:
942
943@lisp
944guile> (throw 'badex)
945<unnamed port>:3:1: In procedure gsubr-apply @dots{}
946<unnamed port>:3:1: unhandled-exception: badex
947ABORT: (misc-error)
948guile>
949@end lisp
950
951The default uncaught exception behaviour can be observed by evaluating a
952@code{throw} expression from the shell command line:
953
954@example
955$ guile -c "(begin (throw 'badex) (display \"here\\n\"))"
956guile: uncaught throw to badex: ()
957$
958@end example
959
960@noindent
961That Guile exits immediately following the uncaught exception
962is shown by the absence of any output from the @code{display}
963expression, because Guile never gets to the point of evaluating that
964expression.
965
07d83abe
MV
966
967@node Exception Implementation
968@subsubsection How Guile Implements Exceptions
969
970It is traditional in Scheme to implement exception systems using
971@code{call-with-current-continuation}. Continuations
972(@pxref{Continuations}) are such a powerful concept that any other
973control mechanism --- including @code{catch} and @code{throw} --- can be
974implemented in terms of them.
975
976Guile does not implement @code{catch} and @code{throw} like this,
977though. Why not? Because Guile is specifically designed to be easy to
978integrate with applications written in C. In a mixed Scheme/C
979environment, the concept of @dfn{continuation} must logically include
980``what happens next'' in the C parts of the application as well as the
981Scheme parts, and it turns out that the only reasonable way of
982implementing continuations like this is to save and restore the complete
983C stack.
984
985So Guile's implementation of @code{call-with-current-continuation} is a
986stack copying one. This allows it to interact well with ordinary C
987code, but means that creating and calling a continuation is slowed down
988by the time that it takes to copy the C stack.
989
990The more targeted mechanism provided by @code{catch} and @code{throw}
991does not need to save and restore the C stack because the @code{throw}
992always jumps to a location higher up the stack of the code that executes
993the @code{throw}. Therefore Guile implements the @code{catch} and
994@code{throw} primitives independently of
995@code{call-with-current-continuation}, in a way that takes advantage of
996this @emph{upwards only} nature of exceptions.
997
998
999@node Error Reporting
1000@subsection Procedures for Signaling Errors
1001
1002Guile provides a set of convenience procedures for signaling error
1003conditions that are implemented on top of the exception primitives just
1004described.
1005
1006@deffn {Scheme Procedure} error msg args @dots{}
1007Raise an error with key @code{misc-error} and a message constructed by
1008displaying @var{msg} and writing @var{args}.
1009@end deffn
1010
1011@deffn {Scheme Procedure} scm-error key subr message args data
1012@deffnx {C Function} scm_error_scm (key, subr, message, args, data)
1013Raise an error with key @var{key}. @var{subr} can be a string
1014naming the procedure associated with the error, or @code{#f}.
1015@var{message} is the error message string, possibly containing
1016@code{~S} and @code{~A} escapes. When an error is reported,
1017these are replaced by formatting the corresponding members of
1018@var{args}: @code{~A} (was @code{%s} in older versions of
1019Guile) formats using @code{display} and @code{~S} (was
1020@code{%S}) formats using @code{write}. @var{data} is a list or
1021@code{#f} depending on @var{key}: if @var{key} is
1022@code{system-error} then it should be a list containing the
1023Unix @code{errno} value; If @var{key} is @code{signal} then it
7cd44c6d
MV
1024should be a list containing the Unix signal number; If
1025@var{key} is @code{out-of-range} or @code{wrong-type-arg},
1026it is a list containing the bad value; otherwise
07d83abe
MV
1027it will usually be @code{#f}.
1028@end deffn
1029
1030@deffn {Scheme Procedure} strerror err
1031@deffnx {C Function} scm_strerror (err)
44ba562e
KR
1032Return the Unix error message corresponding to @var{err}, an integer
1033@code{errno} value.
1034
1035When @code{setlocale} has been called (@pxref{Locales}), the message
1036is in the language and charset of @code{LC_MESSAGES}. (This is done
1037by the C library.)
07d83abe
MV
1038@end deffn
1039
1040@c begin (scm-doc-string "boot-9.scm" "false-if-exception")
1041@deffn syntax false-if-exception expr
1042Returns the result of evaluating its argument; however
1043if an exception occurs then @code{#f} is returned instead.
1044@end deffn
1045@c end
1046
1047
1048@node Dynamic Wind
1049@subsection Dynamic Wind
1050
661ae7ab
MV
1051For Scheme code, the fundamental procedure to react to non-local entry
1052and exits of dynamic contexts is @code{dynamic-wind}. C code could
1053use @code{scm_internal_dynamic_wind}, but since C does not allow the
1054convenient construction of anonymous procedures that close over
1055lexical variables, this will be, well, inconvenient.
1056
1057Therefore, Guile offers the functions @code{scm_dynwind_begin} and
1058@code{scm_dynwind_end} to delimit a dynamic extent. Within this
a1ef7406 1059dynamic extent, which is called a @dfn{dynwind context}, you can
661ae7ab
MV
1060perform various @dfn{dynwind actions} that control what happens when
1061the dynwind context is entered or left. For example, you can register
1062a cleanup routine with @code{scm_dynwind_unwind_handler} that is
1063executed when the context is left. There are several other more
1064specialized dynwind actions as well, for example to temporarily block
1065the execution of asyncs or to temporarily change the current output
1066port. They are described elsewhere in this manual.
1067
1068Here is an example that shows how to prevent memory leaks.
1069
1070@example
1071
1072/* Suppose there is a function called FOO in some library that you
1073 would like to make available to Scheme code (or to C code that
1074 follows the Scheme conventions).
1075
1076 FOO takes two C strings and returns a new string. When an error has
1077 occurred in FOO, it returns NULL.
1078*/
1079
1080char *foo (char *s1, char *s2);
1081
1082/* SCM_FOO interfaces the C function FOO to the Scheme way of life.
1083 It takes care to free up all temporary strings in the case of
1084 non-local exits.
1085 */
1086
1087SCM
1088scm_foo (SCM s1, SCM s2)
1089@{
1090 char *c_s1, *c_s2, *c_res;
1091
1092 scm_dynwind_begin (0);
1093
1094 c_s1 = scm_to_locale_string (s1);
1095
1096 /* Call 'free (c_s1)' when the dynwind context is left.
1097 */
1098 scm_dynwind_unwind_handler (free, c_s1, SCM_F_WIND_EXPLICITLY);
1099
1100 c_s2 = scm_to_locale_string (s2);
1101
1102 /* Same as above, but more concisely.
1103 */
1104 scm_dynwind_free (c_s2);
1105
1106 c_res = foo (c_s1, c_s2);
1107 if (c_res == NULL)
1108 scm_memory_error ("foo");
1109
1110 scm_dynwind_end ();
1111
1112 return scm_take_locale_string (res);
1113@}
1114@end example
1115
07d83abe
MV
1116@rnindex dynamic-wind
1117@deffn {Scheme Procedure} dynamic-wind in_guard thunk out_guard
1118@deffnx {C Function} scm_dynamic_wind (in_guard, thunk, out_guard)
1119All three arguments must be 0-argument procedures.
1120@var{in_guard} is called, then @var{thunk}, then
1121@var{out_guard}.
1122
1123If, any time during the execution of @var{thunk}, the
1124dynamic extent of the @code{dynamic-wind} expression is escaped
1125non-locally, @var{out_guard} is called. If the dynamic extent of
1126the dynamic-wind is re-entered, @var{in_guard} is called. Thus
1127@var{in_guard} and @var{out_guard} may be called any number of
1128times.
40296bab 1129
07d83abe
MV
1130@lisp
1131(define x 'normal-binding)
1132@result{} x
40296bab
KR
1133(define a-cont
1134 (call-with-current-continuation
1135 (lambda (escape)
1136 (let ((old-x x))
1137 (dynamic-wind
1138 ;; in-guard:
1139 ;;
1140 (lambda () (set! x 'special-binding))
1141
1142 ;; thunk
1143 ;;
1144 (lambda () (display x) (newline)
1145 (call-with-current-continuation escape)
1146 (display x) (newline)
1147 x)
1148
1149 ;; out-guard:
1150 ;;
1151 (lambda () (set! x old-x)))))))
07d83abe
MV
1152;; Prints:
1153special-binding
1154;; Evaluates to:
1155@result{} a-cont
1156x
1157@result{} normal-binding
1158(a-cont #f)
1159;; Prints:
1160special-binding
1161;; Evaluates to:
1162@result{} a-cont ;; the value of the (define a-cont...)
1163x
1164@result{} normal-binding
1165a-cont
1166@result{} special-binding
1167@end lisp
1168@end deffn
1169
98241dc5
NJ
1170@deftp {C Type} scm_t_dynwind_flags
1171This is an enumeration of several flags that modify the behavior of
1172@code{scm_dynwind_begin}. The flags are listed in the following
1173table.
1174
1175@table @code
1176@item SCM_F_DYNWIND_REWINDABLE
1177The dynamic context is @dfn{rewindable}. This means that it can be
72b3aa56 1178reentered non-locally (via the invocation of a continuation). The
98241dc5
NJ
1179default is that a dynwind context can not be reentered non-locally.
1180@end table
1181
1182@end deftp
1183
1184@deftypefn {C Function} void scm_dynwind_begin (scm_t_dynwind_flags flags)
661ae7ab
MV
1185The function @code{scm_dynwind_begin} starts a new dynamic context and
1186makes it the `current' one.
07d83abe 1187
661ae7ab
MV
1188The @var{flags} argument determines the default behavior of the
1189context. Normally, use 0. This will result in a context that can not
1190be reentered with a captured continuation. When you are prepared to
1191handle reentries, include @code{SCM_F_DYNWIND_REWINDABLE} in
1192@var{flags}.
07d83abe
MV
1193
1194Being prepared for reentry means that the effects of unwind handlers
1195can be undone on reentry. In the example above, we want to prevent a
1196memory leak on non-local exit and thus register an unwind handler that
1197frees the memory. But once the memory is freed, we can not get it
1198back on reentry. Thus reentry can not be allowed.
1199
1200The consequence is that continuations become less useful when
661ae7ab
MV
1201non-reenterable contexts are captured, but you don't need to worry
1202about that too much.
1203
1204The context is ended either implicitly when a non-local exit happens,
1205or explicitly with @code{scm_dynwind_end}. You must make sure that a
1206dynwind context is indeed ended properly. If you fail to call
1207@code{scm_dynwind_end} for each @code{scm_dynwind_begin}, the behavior
1208is undefined.
07d83abe
MV
1209@end deftypefn
1210
661ae7ab
MV
1211@deftypefn {C Function} void scm_dynwind_end ()
1212End the current dynamic context explicitly and make the previous one
1213current.
07d83abe
MV
1214@end deftypefn
1215
98241dc5
NJ
1216@deftp {C Type} scm_t_wind_flags
1217This is an enumeration of several flags that modify the behavior of
1218@code{scm_dynwind_unwind_handler} and
1219@code{scm_dynwind_rewind_handler}. The flags are listed in the
1220following table.
1221
1222@table @code
1223@item SCM_F_WIND_EXPLICITLY
1224@vindex SCM_F_WIND_EXPLICITLY
1225The registered action is also carried out when the dynwind context is
1226entered or left locally.
1227@end table
1228@end deftp
1229
1230@deftypefn {C Function} void scm_dynwind_unwind_handler (void (*func)(void *), void *data, scm_t_wind_flags flags)
1231@deftypefnx {C Function} void scm_dynwind_unwind_handler_with_scm (void (*func)(SCM), SCM data, scm_t_wind_flags flags)
07d83abe 1232Arranges for @var{func} to be called with @var{data} as its arguments
661ae7ab
MV
1233when the current context ends implicitly. If @var{flags} contains
1234@code{SCM_F_WIND_EXPLICITLY}, @var{func} is also called when the
1235context ends explicitly with @code{scm_dynwind_end}.
07d83abe 1236
661ae7ab 1237The function @code{scm_dynwind_unwind_handler_with_scm} takes care that
07d83abe
MV
1238@var{data} is protected from garbage collection.
1239@end deftypefn
1240
98241dc5
NJ
1241@deftypefn {C Function} void scm_dynwind_rewind_handler (void (*func)(void *), void *data, scm_t_wind_flags flags)
1242@deftypefnx {C Function} void scm_dynwind_rewind_handler_with_scm (void (*func)(SCM), SCM data, scm_t_wind_flags flags)
07d83abe 1243Arrange for @var{func} to be called with @var{data} as its argument when
661ae7ab 1244the current context is restarted by rewinding the stack. When @var{flags}
07d83abe
MV
1245contains @code{SCM_F_WIND_EXPLICITLY}, @var{func} is called immediately
1246as well.
1247
661ae7ab 1248The function @code{scm_dynwind_rewind_handler_with_scm} takes care that
07d83abe
MV
1249@var{data} is protected from garbage collection.
1250@end deftypefn
1251
9f1ba6a9
NJ
1252@deftypefn {C Function} void scm_dynwind_free (void *mem)
1253Arrange for @var{mem} to be freed automatically whenever the current
1254context is exited, whether normally or non-locally.
1255@code{scm_dynwind_free (mem)} is an equivalent shorthand for
1256@code{scm_dynwind_unwind_handler (free, mem, SCM_F_WIND_EXPLICITLY)}.
1257@end deftypefn
1258
07d83abe
MV
1259
1260@node Handling Errors
1261@subsection How to Handle Errors
1262
1263Error handling is based on @code{catch} and @code{throw}. Errors are
1264always thrown with a @var{key} and four arguments:
1265
1266@itemize @bullet
1267@item
1268@var{key}: a symbol which indicates the type of error. The symbols used
1269by libguile are listed below.
1270
1271@item
1272@var{subr}: the name of the procedure from which the error is thrown, or
1273@code{#f}.
1274
1275@item
1276@var{message}: a string (possibly language and system dependent)
1277describing the error. The tokens @code{~A} and @code{~S} can be
1278embedded within the message: they will be replaced with members of the
1279@var{args} list when the message is printed. @code{~A} indicates an
1280argument printed using @code{display}, while @code{~S} indicates an
1281argument printed using @code{write}. @var{message} can also be
1282@code{#f}, to allow it to be derived from the @var{key} by the error
1283handler (may be useful if the @var{key} is to be thrown from both C and
1284Scheme).
1285
1286@item
1287@var{args}: a list of arguments to be used to expand @code{~A} and
1288@code{~S} tokens in @var{message}. Can also be @code{#f} if no
1289arguments are required.
1290
1291@item
1292@var{rest}: a list of any additional objects required. e.g., when the
1293key is @code{'system-error}, this contains the C errno value. Can also
1294be @code{#f} if no additional objects are required.
1295@end itemize
1296
1297In addition to @code{catch} and @code{throw}, the following Scheme
1298facilities are available:
1299
1300@deffn {Scheme Procedure} display-error stack port subr message args rest
1301@deffnx {C Function} scm_display_error (stack, port, subr, message, args, rest)
1302Display an error message to the output port @var{port}.
1303@var{stack} is the saved stack for the error, @var{subr} is
1304the name of the procedure in which the error occurred and
1305@var{message} is the actual error message, which may contain
1306formatting instructions. These will format the arguments in
1307the list @var{args} accordingly. @var{rest} is currently
1308ignored.
1309@end deffn
1310
1311The following are the error keys defined by libguile and the situations
1312in which they are used:
1313
1314@itemize @bullet
1315@item
1316@cindex @code{error-signal}
1317@code{error-signal}: thrown after receiving an unhandled fatal signal
1318such as SIGSEGV, SIGBUS, SIGFPE etc. The @var{rest} argument in the throw
1319contains the coded signal number (at present this is not the same as the
1320usual Unix signal number).
1321
1322@item
1323@cindex @code{system-error}
1324@code{system-error}: thrown after the operating system indicates an
1325error condition. The @var{rest} argument in the throw contains the
1326errno value.
1327
1328@item
1329@cindex @code{numerical-overflow}
1330@code{numerical-overflow}: numerical overflow.
1331
1332@item
1333@cindex @code{out-of-range}
1334@code{out-of-range}: the arguments to a procedure do not fall within the
1335accepted domain.
1336
1337@item
1338@cindex @code{wrong-type-arg}
1339@code{wrong-type-arg}: an argument to a procedure has the wrong type.
1340
1341@item
1342@cindex @code{wrong-number-of-args}
1343@code{wrong-number-of-args}: a procedure was called with the wrong number
1344of arguments.
1345
1346@item
1347@cindex @code{memory-allocation-error}
1348@code{memory-allocation-error}: memory allocation error.
1349
1350@item
1351@cindex @code{stack-overflow}
1352@code{stack-overflow}: stack overflow error.
1353
1354@item
1355@cindex @code{regular-expression-syntax}
1356@code{regular-expression-syntax}: errors generated by the regular
1357expression library.
1358
1359@item
1360@cindex @code{misc-error}
1361@code{misc-error}: other errors.
1362@end itemize
1363
1364
1365@subsubsection C Support
1366
1367In the following C functions, @var{SUBR} and @var{MESSAGE} parameters
1368can be @code{NULL} to give the effect of @code{#f} described above.
1369
1370@deftypefn {C Function} SCM scm_error (SCM @var{key}, char *@var{subr}, char *@var{message}, SCM @var{args}, SCM @var{rest})
9a18d8d4 1371Throw an error, as per @code{scm-error} (@pxref{Error Reporting}).
07d83abe
MV
1372@end deftypefn
1373
1374@deftypefn {C Function} void scm_syserror (char *@var{subr})
1375@deftypefnx {C Function} void scm_syserror_msg (char *@var{subr}, char *@var{message}, SCM @var{args})
1376Throw an error with key @code{system-error} and supply @code{errno} in
1377the @var{rest} argument. For @code{scm_syserror} the message is
1378generated using @code{strerror}.
1379
1380Care should be taken that any code in between the failing operation
1381and the call to these routines doesn't change @code{errno}.
1382@end deftypefn
1383
1384@deftypefn {C Function} void scm_num_overflow (char *@var{subr})
1385@deftypefnx {C Function} void scm_out_of_range (char *@var{subr}, SCM @var{bad_value})
1386@deftypefnx {C Function} void scm_wrong_num_args (SCM @var{proc})
1387@deftypefnx {C Function} void scm_wrong_type_arg (char *@var{subr}, int @var{argnum}, SCM @var{bad_value})
1388@deftypefnx {C Function} void scm_memory_error (char *@var{subr})
1389Throw an error with the various keys described above.
1390
1391For @code{scm_wrong_num_args}, @var{proc} should be a Scheme symbol
1392which is the name of the procedure incorrectly invoked.
1393@end deftypefn
1394
1395
0f7e6c56
AW
1396@subsubsection Signalling Type Errors
1397
1398Every function visible at the Scheme level should aggressively check the
1399types of its arguments, to avoid misinterpreting a value, and perhaps
1400causing a segmentation fault. Guile provides some macros to make this
1401easier.
1402
1403@deftypefn Macro void SCM_ASSERT (int @var{test}, SCM @var{obj}, unsigned int @var{position}, const char *@var{subr})
1404If @var{test} is zero, signal a ``wrong type argument'' error,
1405attributed to the subroutine named @var{subr}, operating on the value
1406@var{obj}, which is the @var{position}'th argument of @var{subr}.
1407@end deftypefn
1408
1409@deftypefn Macro int SCM_ARG1
1410@deftypefnx Macro int SCM_ARG2
1411@deftypefnx Macro int SCM_ARG3
1412@deftypefnx Macro int SCM_ARG4
1413@deftypefnx Macro int SCM_ARG5
1414@deftypefnx Macro int SCM_ARG6
1415@deftypefnx Macro int SCM_ARG7
1416One of the above values can be used for @var{position} to indicate the
1417number of the argument of @var{subr} which is being checked.
1418Alternatively, a positive integer number can be used, which allows to
1419check arguments after the seventh. However, for parameter numbers up to
1420seven it is preferable to use @code{SCM_ARGN} instead of the
1421corresponding raw number, since it will make the code easier to
1422understand.
1423@end deftypefn
1424
1425@deftypefn Macro int SCM_ARGn
1426Passing a value of zero or @code{SCM_ARGn} for @var{position} allows to
1427leave it unspecified which argument's type is incorrect. Again,
1428@code{SCM_ARGn} should be preferred over a raw zero constant.
1429@end deftypefn
1430
1431
ce2612cd
NJ
1432@node Continuation Barriers
1433@subsection Continuation Barriers
1434
1435The non-local flow of control caused by continuations might sometimes
56664c08
AW
1436not be wanted. You can use @code{with-continuation-barrier} to erect
1437fences that continuations can not pass.
ce2612cd
NJ
1438
1439@deffn {Scheme Procedure} with-continuation-barrier proc
1440@deffnx {C Function} scm_with_continuation_barrier (proc)
1441Call @var{proc} and return its result. Do not allow the invocation of
1442continuations that would leave or enter the dynamic extent of the call
1443to @code{with-continuation-barrier}. Such an attempt causes an error
1444to be signaled.
1445
1446Throws (such as errors) that are not caught from within @var{proc} are
1447caught by @code{with-continuation-barrier}. In that case, a short
1448message is printed to the current error port and @code{#f} is returned.
1449
1450Thus, @code{with-continuation-barrier} returns exactly once.
1451@end deffn
1452
1453@deftypefn {C Function} {void *} scm_c_with_continuation_barrier (void *(*func) (void *), void *data)
1454Like @code{scm_with_continuation_barrier} but call @var{func} on
1455@var{data}. When an error is caught, @code{NULL} is returned.
1456@end deftypefn
1457
1458
07d83abe
MV
1459@c Local Variables:
1460@c TeX-master: "guile.texi"
1461@c End: