5    which is used to allocate space off the run-time stack so
16    that are found to be deeper in the stack than the current
57 /* If your stack is a linked list of frames, you have to
87 /* Define STACK_DIRECTION if you know the direction of stack
112   auto char dummy;		/* To get stack address.  */  in find_stack_direction()
124 	stack_dir = 1;		/* Stack grew upward.  */  in find_stack_direction()
126 	stack_dir = -1;		/* Stack grew downward.  */  in find_stack_direction()
134    (b) keep track of stack depth.
149       char *deep;		/* For stack depth measure.  */
158    was supposed to be taken from the current stack frame of the
166   auto char probe;		/* Probes stack depth: */
175      was allocated from deeper in the stack than currently. */
233 /* Stack structures for CRAY-1, CRAY X-MP, and CRAY Y-MP */
236     long shgrow:32;		/* Number of times stack has grown.  */
237     long shaseg:32;		/* Size of increments to stack.  */
238     long shhwm:32;		/* High water mark of stack.  */
239     long shsize:32;		/* Current size of stack (all segments).  */
242 /* The stack segment linkage control information occurs at
243    the high-address end of a stack segment.  (The stack
245    part of the stack segment linkage control information is
247    for the routine which overflows the stack.  */
253     long ssbase:32;		/* Offset to stack base.  */
256 				   segment of stack.  */
289     long now;			/* Current total stack size.  */
292 				   stack demand to date.  */
293     long high_water;		/* Stack high-water mark.  */
294     long overflows;		/* Number of stack overflow ($STKOFEN) calls.  */
298     long underflows;		/* Number of stack underflow calls ($STKRETN).  */
301     long segments;		/* Current number of stack segments.  */
302     long maxs;			/* Maximum number of stack segments so far.  */
303     long pad_size;		/* Stack pad size.  */
304     long current_address;	/* Current stack segment address.  */
305     long current_size;		/* Current stack segment size.  This
313    any stack segment.  I think that the description in 'asdef' is
341 /* Determine a "stack measure" for an arbitrary ADDRESS.
353      step is to get the stack status structure.  We could do this  in i00afunc()
365   /* There must be at least one stack segment.  Therefore it is  in i00afunc()
412 /* Stack address function for a CRAY-1, CRAY X-MP, or CRAY Y-MP.
413    Determine the number of the cell within the stack,
415    routine is to linearize, in some sense, stack addresses
423   long size, pseg, this_segment, stack;  in i00afunc()  local
429      current stack segment.  If you (as a subprogram) store  in i00afunc()
430      your registers on the stack and find that you are past  in i00afunc()
433      B67 also points to the stack segment linkage control  in i00afunc()
451      a stack overflow.  Discard stack segments which do not  in i00afunc()
470   /* If you subtract pseg from the current end of the stack,  in i00afunc()
471      you get the address of the previous stack segment's end.  in i00afunc()