URL
https://opencores.org/ocsvn/or1k/or1k/trunk
Subversion Repositories or1k
[/] [or1k/] [trunk/] [insight/] [tcl/] [doc/] [SetRecLmt.3] - Rev 1765
Compare with Previous | Blame | View Log
'\"'\" Copyright (c) 1989-1993 The Regents of the University of California.'\" Copyright (c) 1994-1996 Sun Microsystems, Inc.'\"'\" See the file "license.terms" for information on usage and redistribution'\" of this file, and for a DISCLAIMER OF ALL WARRANTIES.'\"'\" RCS: @(#) $Id: SetRecLmt.3,v 1.1.1.1 2002-01-16 10:25:24 markom Exp $'\".so man.macros.TH Tcl_SetRecursionLimit 3 7.0 Tcl "Tcl Library Procedures".BS.SH NAMETcl_SetRecursionLimit \- set maximum allowable nesting depth in interpreter.SH SYNOPSIS.nf\fB#include <tcl.h>\fR.spint\fBTcl_SetRecursionLimit\fR(\fIinterp, depth\fR).SH ARGUMENTS.AS Tcl_Interp *interp.AP Tcl_Interp *interp inInterpreter whose recursion limit is to be set.Must be greater than zero..AP int depth inNew limit for nested calls to \fBTcl_Eval\fR for \fIinterp\fR..BE.SH DESCRIPTION.PPAt any given time Tcl enforces a limit on the number of recursivecalls that may be active for \fBTcl_Eval\fR and related proceduressuch as \fBTcl_GlobalEval\fR.Any call to \fBTcl_Eval\fR that exceeds this depth is aborted withan error.By default the recursion limit is 1000..PP\fBTcl_SetRecursionLimit\fR may be used to change the maximumallowable nesting depth for an interpreter.The \fIdepth\fR argument specifies a new limit for \fIinterp\fR,and \fBTcl_SetRecursionLimit\fR returns the old limit.To read out the old limit without modifying it, invoke\fBTcl_SetRecursionDepth\fR with \fIdepth\fR equal to 0..PPThe \fBTcl_SetRecursionLimit\fR only sets the size of the Tclcall stack: it cannot by itself prevent stack overflows on theC stack being used by the application. If your machine has alimit on the size of the C stack, you may get stack overflowsbefore reaching the limit set by \fBTcl_SetRecursionLimit\fR.If this happens, see if there is a mechanism in your system forincreasing the maximum size of the C stack..SH KEYWORDSnesting depth, recursion
