1 /* alloca.c -- allocate automatically reclaimed memory
2 This file is in the public domain. */
4 /* (Mostly) portable implementation -- D A Gwyn
6 This implementation of the PWB library alloca function,
7 which is used to allocate space off the run-time stack so
8 that it is automatically reclaimed upon procedure exit,
9 was inspired by discussions with J. Q. Johnson of Cornell.
10 J.Otto Tennant <jot@cray.com> contributed the Cray support.
12 There are some preprocessor constants that can
13 be defined when compiling for your specific system, for
14 improved efficiency; however, the defaults should be okay.
16 The general concept of this implementation is to keep
17 track of all alloca-allocated blocks, and reclaim any
18 that are found to be deeper in the stack than the current
19 invocation. This heuristic does not reclaim storage as
20 soon as it becomes invalid, but it will do so eventually.
22 As a special case, alloca(0) reclaims storage without
23 allocating any. It is a good idea to use alloca(0) in
24 your main control loop, etc. to force garbage collection. */
35 # include "blockinput.h"
38 # define free EMACS_FREE
41 # define memory_full() abort ()
44 /* If compiling with GCC or clang, this file is not needed. */
45 #if !(defined __GNUC__ || defined __clang__)
47 /* If someone has defined alloca as a macro,
48 there must be some other way alloca is supposed to work. */
53 /* actually, only want this if static is defined as ""
54 -- this is for usg, in which emacs must undefine static
55 in order to make unexec workable
57 # ifndef STACK_DIRECTION
60 -- must know STACK_DIRECTION at compile
-time
61 /* Using #error here is not wise since this file should work for
62 old and obscure compilers. */
63 # endif /* STACK_DIRECTION undefined */
67 /* Define STACK_DIRECTION if you know the direction of stack
68 growth for your system; otherwise it will be automatically
71 STACK_DIRECTION > 0 => grows toward higher addresses
72 STACK_DIRECTION < 0 => grows toward lower addresses
73 STACK_DIRECTION = 0 => direction of growth unknown */
75 # ifndef STACK_DIRECTION
76 # define STACK_DIRECTION 0 /* Direction unknown. */
79 # if STACK_DIRECTION != 0
81 # define STACK_DIR STACK_DIRECTION /* Known at compile-time. */
83 # else /* STACK_DIRECTION == 0; need run-time code. */
85 static int stack_dir
; /* 1 or -1 once known. */
86 # define STACK_DIR stack_dir
89 find_stack_direction (int *addr
, int depth
)
94 *addr
= addr
< &dummy
? 1 : addr
== &dummy
? 0 : -1;
95 dir
= depth
? find_stack_direction (addr
, depth
- 1) : 0;
99 # endif /* STACK_DIRECTION == 0 */
101 /* An "alloca header" is used to:
102 (a) chain together all alloca'ed blocks;
103 (b) keep track of stack depth.
105 It is very important that sizeof(header) agree with malloc
106 alignment chunk size. The following default should work okay. */
109 # define ALIGN_SIZE sizeof(double)
114 char align
[ALIGN_SIZE
]; /* To force sizeof(header). */
117 union hdr
*next
; /* For chaining headers. */
118 char *deep
; /* For stack depth measure. */
122 static header
*last_alloca_header
= NULL
; /* -> last alloca header. */
124 /* Return a pointer to at least SIZE bytes of storage,
125 which will be automatically reclaimed upon exit from
126 the procedure that called alloca. Originally, this space
127 was supposed to be taken from the current stack frame of the
128 caller, but that method cannot be made to work for some
129 implementations of C, for example under Gould's UTX/32. */
134 auto char probe
; /* Probes stack depth: */
135 register char *depth
= &probe
;
137 # if STACK_DIRECTION == 0
138 if (STACK_DIR
== 0) /* Unknown growth direction. */
139 STACK_DIR
= find_stack_direction (NULL
, (size
& 1) + 20);
142 /* Reclaim garbage, defined as all alloca'd storage that
143 was allocated from deeper in the stack than currently. */
146 register header
*hp
; /* Traverses linked list. */
152 for (hp
= last_alloca_header
; hp
!= NULL
;)
153 if ((STACK_DIR
> 0 && hp
->h
.deep
> depth
)
154 || (STACK_DIR
< 0 && hp
->h
.deep
< depth
))
156 register header
*np
= hp
->h
.next
;
158 free (hp
); /* Collect garbage. */
160 hp
= np
; /* -> next header. */
163 break; /* Rest are not deeper. */
165 last_alloca_header
= hp
; /* -> last valid storage. */
173 return NULL
; /* No allocation required. */
175 /* Allocate combined header + user data storage. */
178 /* Address of header. */
179 register header
*new;
181 size_t combined_size
= sizeof (header
) + size
;
182 if (combined_size
< sizeof (header
))
185 new = malloc (combined_size
);
190 new->h
.next
= last_alloca_header
;
193 last_alloca_header
= new;
195 /* User storage begins just after header. */
197 return (void *) (new + 1);
201 # endif /* no alloca */
202 #endif /* not GCC || clang */