]>
Commit | Line | Data |
---|---|---|
12670d88 | 1 | /* Implements exception handling. |
e9a25f70 | 2 | Copyright (C) 1989, 92-96, 1997 Free Software Foundation, Inc. |
4956d07c MS |
3 | Contributed by Mike Stump <mrs@cygnus.com>. |
4 | ||
5 | This file is part of GNU CC. | |
6 | ||
7 | GNU CC 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) | |
10 | any later version. | |
11 | ||
12 | GNU CC 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. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GNU CC; see the file COPYING. If not, write to | |
19 | the Free Software Foundation, 59 Temple Place - Suite 330, | |
20 | Boston, MA 02111-1307, USA. */ | |
21 | ||
22 | ||
12670d88 RK |
23 | /* An exception is an event that can be signaled from within a |
24 | function. This event can then be "caught" or "trapped" by the | |
25 | callers of this function. This potentially allows program flow to | |
956d6950 | 26 | be transferred to any arbitrary code associated with a function call |
12670d88 RK |
27 | several levels up the stack. |
28 | ||
29 | The intended use for this mechanism is for signaling "exceptional | |
30 | events" in an out-of-band fashion, hence its name. The C++ language | |
31 | (and many other OO-styled or functional languages) practically | |
32 | requires such a mechanism, as otherwise it becomes very difficult | |
33 | or even impossible to signal failure conditions in complex | |
34 | situations. The traditional C++ example is when an error occurs in | |
35 | the process of constructing an object; without such a mechanism, it | |
36 | is impossible to signal that the error occurs without adding global | |
37 | state variables and error checks around every object construction. | |
38 | ||
39 | The act of causing this event to occur is referred to as "throwing | |
40 | an exception". (Alternate terms include "raising an exception" or | |
41 | "signaling an exception".) The term "throw" is used because control | |
42 | is returned to the callers of the function that is signaling the | |
43 | exception, and thus there is the concept of "throwing" the | |
44 | exception up the call stack. | |
45 | ||
27a36778 MS |
46 | There are two major codegen options for exception handling. The |
47 | flag -fsjlj-exceptions can be used to select the setjmp/longjmp | |
e9a25f70 | 48 | approach, which is the default. -fno-sjlj-exceptions can be used to |
27a36778 MS |
49 | get the PC range table approach. While this is a compile time |
50 | flag, an entire application must be compiled with the same codegen | |
51 | option. The first is a PC range table approach, the second is a | |
52 | setjmp/longjmp based scheme. We will first discuss the PC range | |
53 | table approach, after that, we will discuss the setjmp/longjmp | |
54 | based approach. | |
55 | ||
12670d88 RK |
56 | It is appropriate to speak of the "context of a throw". This |
57 | context refers to the address where the exception is thrown from, | |
58 | and is used to determine which exception region will handle the | |
59 | exception. | |
60 | ||
61 | Regions of code within a function can be marked such that if it | |
62 | contains the context of a throw, control will be passed to a | |
63 | designated "exception handler". These areas are known as "exception | |
64 | regions". Exception regions cannot overlap, but they can be nested | |
65 | to any arbitrary depth. Also, exception regions cannot cross | |
66 | function boundaries. | |
67 | ||
2ed18e63 MS |
68 | Exception handlers can either be specified by the user (which we |
69 | will call a "user-defined handler") or generated by the compiler | |
70 | (which we will designate as a "cleanup"). Cleanups are used to | |
71 | perform tasks such as destruction of objects allocated on the | |
72 | stack. | |
73 | ||
956d6950 | 74 | In the current implementation, cleanups are handled by allocating an |
2ed18e63 MS |
75 | exception region for the area that the cleanup is designated for, |
76 | and the handler for the region performs the cleanup and then | |
77 | rethrows the exception to the outer exception region. From the | |
78 | standpoint of the current implementation, there is little | |
79 | distinction made between a cleanup and a user-defined handler, and | |
80 | the phrase "exception handler" can be used to refer to either one | |
81 | equally well. (The section "Future Directions" below discusses how | |
82 | this will change). | |
83 | ||
84 | Each object file that is compiled with exception handling contains | |
85 | a static array of exception handlers named __EXCEPTION_TABLE__. | |
86 | Each entry contains the starting and ending addresses of the | |
87 | exception region, and the address of the handler designated for | |
88 | that region. | |
12670d88 | 89 | |
ca55abae JM |
90 | If the target does not use the DWARF 2 frame unwind information, at |
91 | program startup each object file invokes a function named | |
12670d88 | 92 | __register_exceptions with the address of its local |
ca55abae JM |
93 | __EXCEPTION_TABLE__. __register_exceptions is defined in libgcc2.c, and |
94 | is responsible for recording all of the exception regions into one list | |
95 | (which is kept in a static variable named exception_table_list). | |
96 | ||
97 | On targets that support crtstuff.c, the unwind information | |
98 | is stored in a section named .eh_frame and the information for the | |
99 | entire shared object or program is registered with a call to | |
6d8ccdbb | 100 | __register_frame_info. On other targets, the information for each |
d1485032 | 101 | translation unit is registered from the file generated by collect2. |
6d8ccdbb | 102 | __register_frame_info is defined in frame.c, and is responsible for |
ca55abae JM |
103 | recording all of the unwind regions into one list (which is kept in a |
104 | static variable named unwind_table_list). | |
12670d88 | 105 | |
27a36778 | 106 | The function __throw is actually responsible for doing the |
ca55abae JM |
107 | throw. On machines that have unwind info support, __throw is generated |
108 | by code in libgcc2.c, otherwise __throw is generated on a | |
12670d88 | 109 | per-object-file basis for each source file compiled with |
ca55abae JM |
110 | -fexceptions by the the C++ frontend. Before __throw is invoked, |
111 | the current context of the throw needs to be placed in the global | |
112 | variable __eh_pc. | |
12670d88 | 113 | |
27a36778 | 114 | __throw attempts to find the appropriate exception handler for the |
12670d88 | 115 | PC value stored in __eh_pc by calling __find_first_exception_table_match |
2ed18e63 | 116 | (which is defined in libgcc2.c). If __find_first_exception_table_match |
ca55abae JM |
117 | finds a relevant handler, __throw transfers control directly to it. |
118 | ||
119 | If a handler for the context being thrown from can't be found, __throw | |
120 | walks (see Walking the stack below) the stack up the dynamic call chain to | |
121 | continue searching for an appropriate exception handler based upon the | |
122 | caller of the function it last sought a exception handler for. It stops | |
123 | then either an exception handler is found, or when the top of the | |
124 | call chain is reached. | |
125 | ||
126 | If no handler is found, an external library function named | |
127 | __terminate is called. If a handler is found, then we restart | |
128 | our search for a handler at the end of the call chain, and repeat | |
129 | the search process, but instead of just walking up the call chain, | |
130 | we unwind the call chain as we walk up it. | |
12670d88 RK |
131 | |
132 | Internal implementation details: | |
133 | ||
12670d88 | 134 | To associate a user-defined handler with a block of statements, the |
27a36778 | 135 | function expand_start_try_stmts is used to mark the start of the |
12670d88 | 136 | block of statements with which the handler is to be associated |
2ed18e63 MS |
137 | (which is known as a "try block"). All statements that appear |
138 | afterwards will be associated with the try block. | |
139 | ||
27a36778 | 140 | A call to expand_start_all_catch marks the end of the try block, |
2ed18e63 MS |
141 | and also marks the start of the "catch block" (the user-defined |
142 | handler) associated with the try block. | |
143 | ||
144 | This user-defined handler will be invoked for *every* exception | |
145 | thrown with the context of the try block. It is up to the handler | |
146 | to decide whether or not it wishes to handle any given exception, | |
147 | as there is currently no mechanism in this implementation for doing | |
148 | this. (There are plans for conditionally processing an exception | |
149 | based on its "type", which will provide a language-independent | |
150 | mechanism). | |
151 | ||
152 | If the handler chooses not to process the exception (perhaps by | |
153 | looking at an "exception type" or some other additional data | |
154 | supplied with the exception), it can fall through to the end of the | |
27a36778 | 155 | handler. expand_end_all_catch and expand_leftover_cleanups |
2ed18e63 MS |
156 | add additional code to the end of each handler to take care of |
157 | rethrowing to the outer exception handler. | |
158 | ||
159 | The handler also has the option to continue with "normal flow of | |
160 | code", or in other words to resume executing at the statement | |
161 | immediately after the end of the exception region. The variable | |
162 | caught_return_label_stack contains a stack of labels, and jumping | |
27a36778 | 163 | to the topmost entry's label via expand_goto will resume normal |
2ed18e63 MS |
164 | flow to the statement immediately after the end of the exception |
165 | region. If the handler falls through to the end, the exception will | |
166 | be rethrown to the outer exception region. | |
167 | ||
168 | The instructions for the catch block are kept as a separate | |
169 | sequence, and will be emitted at the end of the function along with | |
27a36778 MS |
170 | the handlers specified via expand_eh_region_end. The end of the |
171 | catch block is marked with expand_end_all_catch. | |
12670d88 RK |
172 | |
173 | Any data associated with the exception must currently be handled by | |
174 | some external mechanism maintained in the frontend. For example, | |
175 | the C++ exception mechanism passes an arbitrary value along with | |
176 | the exception, and this is handled in the C++ frontend by using a | |
2ed18e63 MS |
177 | global variable to hold the value. (This will be changing in the |
178 | future.) | |
179 | ||
180 | The mechanism in C++ for handling data associated with the | |
181 | exception is clearly not thread-safe. For a thread-based | |
182 | environment, another mechanism must be used (possibly using a | |
183 | per-thread allocation mechanism if the size of the area that needs | |
184 | to be allocated isn't known at compile time.) | |
185 | ||
186 | Internally-generated exception regions (cleanups) are marked by | |
27a36778 | 187 | calling expand_eh_region_start to mark the start of the region, |
2ed18e63 MS |
188 | and expand_eh_region_end (handler) is used to both designate the |
189 | end of the region and to associate a specified handler/cleanup with | |
190 | the region. The rtl code in HANDLER will be invoked whenever an | |
191 | exception occurs in the region between the calls to | |
192 | expand_eh_region_start and expand_eh_region_end. After HANDLER is | |
193 | executed, additional code is emitted to handle rethrowing the | |
194 | exception to the outer exception handler. The code for HANDLER will | |
195 | be emitted at the end of the function. | |
12670d88 RK |
196 | |
197 | TARGET_EXPRs can also be used to designate exception regions. A | |
198 | TARGET_EXPR gives an unwind-protect style interface commonly used | |
199 | in functional languages such as LISP. The associated expression is | |
2ed18e63 MS |
200 | evaluated, and whether or not it (or any of the functions that it |
201 | calls) throws an exception, the protect expression is always | |
202 | invoked. This implementation takes care of the details of | |
203 | associating an exception table entry with the expression and | |
204 | generating the necessary code (it actually emits the protect | |
205 | expression twice, once for normal flow and once for the exception | |
206 | case). As for the other handlers, the code for the exception case | |
207 | will be emitted at the end of the function. | |
208 | ||
209 | Cleanups can also be specified by using add_partial_entry (handler) | |
27a36778 | 210 | and end_protect_partials. add_partial_entry creates the start of |
2ed18e63 MS |
211 | a new exception region; HANDLER will be invoked if an exception is |
212 | thrown with the context of the region between the calls to | |
213 | add_partial_entry and end_protect_partials. end_protect_partials is | |
214 | used to mark the end of these regions. add_partial_entry can be | |
215 | called as many times as needed before calling end_protect_partials. | |
216 | However, end_protect_partials should only be invoked once for each | |
27a36778 | 217 | group of calls to add_partial_entry as the entries are queued |
2ed18e63 MS |
218 | and all of the outstanding entries are processed simultaneously |
219 | when end_protect_partials is invoked. Similarly to the other | |
220 | handlers, the code for HANDLER will be emitted at the end of the | |
221 | function. | |
12670d88 RK |
222 | |
223 | The generated RTL for an exception region includes | |
224 | NOTE_INSN_EH_REGION_BEG and NOTE_INSN_EH_REGION_END notes that mark | |
225 | the start and end of the exception region. A unique label is also | |
2ed18e63 MS |
226 | generated at the start of the exception region, which is available |
227 | by looking at the ehstack variable. The topmost entry corresponds | |
228 | to the current region. | |
12670d88 RK |
229 | |
230 | In the current implementation, an exception can only be thrown from | |
231 | a function call (since the mechanism used to actually throw an | |
232 | exception involves calling __throw). If an exception region is | |
233 | created but no function calls occur within that region, the region | |
2ed18e63 | 234 | can be safely optimized away (along with its exception handlers) |
27a36778 MS |
235 | since no exceptions can ever be caught in that region. This |
236 | optimization is performed unless -fasynchronous-exceptions is | |
237 | given. If the user wishes to throw from a signal handler, or other | |
238 | asynchronous place, -fasynchronous-exceptions should be used when | |
239 | compiling for maximally correct code, at the cost of additional | |
240 | exception regions. Using -fasynchronous-exceptions only produces | |
241 | code that is reasonably safe in such situations, but a correct | |
242 | program cannot rely upon this working. It can be used in failsafe | |
243 | code, where trying to continue on, and proceeding with potentially | |
244 | incorrect results is better than halting the program. | |
245 | ||
12670d88 | 246 | |
ca55abae | 247 | Walking the stack: |
12670d88 | 248 | |
ca55abae JM |
249 | The stack is walked by starting with a pointer to the current |
250 | frame, and finding the pointer to the callers frame. The unwind info | |
251 | tells __throw how to find it. | |
12670d88 | 252 | |
ca55abae | 253 | Unwinding the stack: |
12670d88 | 254 | |
ca55abae JM |
255 | When we use the term unwinding the stack, we mean undoing the |
256 | effects of the function prologue in a controlled fashion so that we | |
257 | still have the flow of control. Otherwise, we could just return | |
258 | (jump to the normal end of function epilogue). | |
259 | ||
260 | This is done in __throw in libgcc2.c when we know that a handler exists | |
261 | in a frame higher up the call stack than its immediate caller. | |
262 | ||
263 | To unwind, we find the unwind data associated with the frame, if any. | |
264 | If we don't find any, we call the library routine __terminate. If we do | |
265 | find it, we use the information to copy the saved register values from | |
266 | that frame into the register save area in the frame for __throw, return | |
267 | into a stub which updates the stack pointer, and jump to the handler. | |
268 | The normal function epilogue for __throw handles restoring the saved | |
269 | values into registers. | |
270 | ||
271 | When unwinding, we use this method if we know it will | |
272 | work (if DWARF2_UNWIND_INFO is defined). Otherwise, we know that | |
273 | an inline unwinder will have been emitted for any function that | |
274 | __unwind_function cannot unwind. The inline unwinder appears as a | |
275 | normal exception handler for the entire function, for any function | |
276 | that we know cannot be unwound by __unwind_function. We inform the | |
277 | compiler of whether a function can be unwound with | |
278 | __unwind_function by having DOESNT_NEED_UNWINDER evaluate to true | |
279 | when the unwinder isn't needed. __unwind_function is used as an | |
280 | action of last resort. If no other method can be used for | |
281 | unwinding, __unwind_function is used. If it cannot unwind, it | |
956d6950 | 282 | should call __terminate. |
ca55abae JM |
283 | |
284 | By default, if the target-specific backend doesn't supply a definition | |
285 | for __unwind_function and doesn't support DWARF2_UNWIND_INFO, inlined | |
286 | unwinders will be used instead. The main tradeoff here is in text space | |
287 | utilization. Obviously, if inline unwinders have to be generated | |
288 | repeatedly, this uses much more space than if a single routine is used. | |
2ed18e63 MS |
289 | |
290 | However, it is simply not possible on some platforms to write a | |
291 | generalized routine for doing stack unwinding without having some | |
ca55abae JM |
292 | form of additional data associated with each function. The current |
293 | implementation can encode this data in the form of additional | |
294 | machine instructions or as static data in tabular form. The later | |
295 | is called the unwind data. | |
12670d88 | 296 | |
ca55abae JM |
297 | The backend macro DOESNT_NEED_UNWINDER is used to conditionalize whether |
298 | or not per-function unwinders are needed. If DOESNT_NEED_UNWINDER is | |
299 | defined and has a non-zero value, a per-function unwinder is not emitted | |
300 | for the current function. If the static unwind data is supported, then | |
301 | a per-function unwinder is not emitted. | |
12670d88 | 302 | |
27a36778 | 303 | On some platforms it is possible that neither __unwind_function |
12670d88 | 304 | nor inlined unwinders are available. For these platforms it is not |
27a36778 | 305 | possible to throw through a function call, and abort will be |
2ed18e63 MS |
306 | invoked instead of performing the throw. |
307 | ||
ca55abae JM |
308 | The reason the unwind data may be needed is that on some platforms |
309 | the order and types of data stored on the stack can vary depending | |
310 | on the type of function, its arguments and returned values, and the | |
311 | compilation options used (optimization versus non-optimization, | |
312 | -fomit-frame-pointer, processor variations, etc). | |
313 | ||
314 | Unfortunately, this also means that throwing through functions that | |
315 | aren't compiled with exception handling support will still not be | |
316 | possible on some platforms. This problem is currently being | |
317 | investigated, but no solutions have been found that do not imply | |
318 | some unacceptable performance penalties. | |
319 | ||
2ed18e63 MS |
320 | Future directions: |
321 | ||
27a36778 | 322 | Currently __throw makes no differentiation between cleanups and |
2ed18e63 MS |
323 | user-defined exception regions. While this makes the implementation |
324 | simple, it also implies that it is impossible to determine if a | |
325 | user-defined exception handler exists for a given exception without | |
326 | completely unwinding the stack in the process. This is undesirable | |
327 | from the standpoint of debugging, as ideally it would be possible | |
328 | to trap unhandled exceptions in the debugger before the process of | |
329 | unwinding has even started. | |
330 | ||
331 | This problem can be solved by marking user-defined handlers in a | |
332 | special way (probably by adding additional bits to exception_table_list). | |
27a36778 | 333 | A two-pass scheme could then be used by __throw to iterate |
2ed18e63 MS |
334 | through the table. The first pass would search for a relevant |
335 | user-defined handler for the current context of the throw, and if | |
336 | one is found, the second pass would then invoke all needed cleanups | |
337 | before jumping to the user-defined handler. | |
338 | ||
339 | Many languages (including C++ and Ada) make execution of a | |
340 | user-defined handler conditional on the "type" of the exception | |
341 | thrown. (The type of the exception is actually the type of the data | |
342 | that is thrown with the exception.) It will thus be necessary for | |
27a36778 | 343 | __throw to be able to determine if a given user-defined |
2ed18e63 MS |
344 | exception handler will actually be executed, given the type of |
345 | exception. | |
346 | ||
347 | One scheme is to add additional information to exception_table_list | |
27a36778 | 348 | as to the types of exceptions accepted by each handler. __throw |
2ed18e63 MS |
349 | can do the type comparisons and then determine if the handler is |
350 | actually going to be executed. | |
351 | ||
352 | There is currently no significant level of debugging support | |
27a36778 | 353 | available, other than to place a breakpoint on __throw. While |
2ed18e63 MS |
354 | this is sufficient in most cases, it would be helpful to be able to |
355 | know where a given exception was going to be thrown to before it is | |
356 | actually thrown, and to be able to choose between stopping before | |
357 | every exception region (including cleanups), or just user-defined | |
358 | exception regions. This should be possible to do in the two-pass | |
27a36778 | 359 | scheme by adding additional labels to __throw for appropriate |
2ed18e63 MS |
360 | breakpoints, and additional debugger commands could be added to |
361 | query various state variables to determine what actions are to be | |
362 | performed next. | |
363 | ||
ca55abae JM |
364 | Another major problem that is being worked on is the issue with stack |
365 | unwinding on various platforms. Currently the only platforms that have | |
366 | support for the generation of a generic unwinder are the SPARC and MIPS. | |
367 | All other ports require per-function unwinders, which produce large | |
368 | amounts of code bloat. | |
27a36778 MS |
369 | |
370 | For setjmp/longjmp based exception handling, some of the details | |
371 | are as above, but there are some additional details. This section | |
372 | discusses the details. | |
373 | ||
374 | We don't use NOTE_INSN_EH_REGION_{BEG,END} pairs. We don't | |
375 | optimize EH regions yet. We don't have to worry about machine | |
376 | specific issues with unwinding the stack, as we rely upon longjmp | |
377 | for all the machine specific details. There is no variable context | |
378 | of a throw, just the one implied by the dynamic handler stack | |
379 | pointed to by the dynamic handler chain. There is no exception | |
956d6950 | 380 | table, and no calls to __register_exceptions. __sjthrow is used |
27a36778 MS |
381 | instead of __throw, and it works by using the dynamic handler |
382 | chain, and longjmp. -fasynchronous-exceptions has no effect, as | |
383 | the elimination of trivial exception regions is not yet performed. | |
384 | ||
385 | A frontend can set protect_cleanup_actions_with_terminate when all | |
386 | the cleanup actions should be protected with an EH region that | |
387 | calls terminate when an unhandled exception is throw. C++ does | |
388 | this, Ada does not. */ | |
4956d07c MS |
389 | |
390 | ||
391 | #include "config.h" | |
ca55abae | 392 | #include "defaults.h" |
4956d07c MS |
393 | #include <stdio.h> |
394 | #include "rtl.h" | |
395 | #include "tree.h" | |
396 | #include "flags.h" | |
397 | #include "except.h" | |
398 | #include "function.h" | |
399 | #include "insn-flags.h" | |
400 | #include "expr.h" | |
401 | #include "insn-codes.h" | |
402 | #include "regs.h" | |
403 | #include "hard-reg-set.h" | |
404 | #include "insn-config.h" | |
405 | #include "recog.h" | |
406 | #include "output.h" | |
407 | ||
ccd043a9 RL |
408 | #ifdef HAVE_STDLIB_H |
409 | #include <stdlib.h> | |
410 | #endif | |
411 | ||
27a36778 MS |
412 | /* One to use setjmp/longjmp method of generating code for exception |
413 | handling. */ | |
414 | ||
d1485032 | 415 | int exceptions_via_longjmp = 2; |
27a36778 MS |
416 | |
417 | /* One to enable asynchronous exception support. */ | |
418 | ||
419 | int asynchronous_exceptions = 0; | |
420 | ||
421 | /* One to protect cleanup actions with a handler that calls | |
422 | __terminate, zero otherwise. */ | |
423 | ||
e701eb4d | 424 | int protect_cleanup_actions_with_terminate; |
27a36778 | 425 | |
12670d88 | 426 | /* A list of labels used for exception handlers. Created by |
4956d07c MS |
427 | find_exception_handler_labels for the optimization passes. */ |
428 | ||
429 | rtx exception_handler_labels; | |
430 | ||
154bba13 TT |
431 | /* The EH context. Nonzero if the function has already |
432 | fetched a pointer to the EH context for exception handling. */ | |
27a36778 | 433 | |
154bba13 | 434 | rtx current_function_ehc; |
27a36778 | 435 | |
956d6950 | 436 | /* A stack used for keeping track of the currently active exception |
12670d88 | 437 | handling region. As each exception region is started, an entry |
4956d07c MS |
438 | describing the region is pushed onto this stack. The current |
439 | region can be found by looking at the top of the stack, and as we | |
12670d88 RK |
440 | exit regions, the corresponding entries are popped. |
441 | ||
27a36778 | 442 | Entries cannot overlap; they can be nested. So there is only one |
12670d88 RK |
443 | entry at most that corresponds to the current instruction, and that |
444 | is the entry on the top of the stack. */ | |
4956d07c | 445 | |
27a36778 | 446 | static struct eh_stack ehstack; |
4956d07c | 447 | |
12670d88 RK |
448 | /* A queue used for tracking which exception regions have closed but |
449 | whose handlers have not yet been expanded. Regions are emitted in | |
450 | groups in an attempt to improve paging performance. | |
451 | ||
452 | As we exit a region, we enqueue a new entry. The entries are then | |
27a36778 | 453 | dequeued during expand_leftover_cleanups and expand_start_all_catch, |
12670d88 RK |
454 | |
455 | We should redo things so that we either take RTL for the handler, | |
456 | or we expand the handler expressed as a tree immediately at region | |
457 | end time. */ | |
4956d07c | 458 | |
27a36778 | 459 | static struct eh_queue ehqueue; |
4956d07c | 460 | |
12670d88 | 461 | /* Insns for all of the exception handlers for the current function. |
abeeec2a | 462 | They are currently emitted by the frontend code. */ |
4956d07c MS |
463 | |
464 | rtx catch_clauses; | |
465 | ||
12670d88 RK |
466 | /* A TREE_CHAINed list of handlers for regions that are not yet |
467 | closed. The TREE_VALUE of each entry contains the handler for the | |
abeeec2a | 468 | corresponding entry on the ehstack. */ |
4956d07c | 469 | |
12670d88 | 470 | static tree protect_list; |
4956d07c MS |
471 | |
472 | /* Stacks to keep track of various labels. */ | |
473 | ||
12670d88 RK |
474 | /* Keeps track of the label to resume to should one want to resume |
475 | normal control flow out of a handler (instead of, say, returning to | |
1418bb67 | 476 | the caller of the current function or exiting the program). */ |
4956d07c MS |
477 | |
478 | struct label_node *caught_return_label_stack = NULL; | |
479 | ||
956d6950 JL |
480 | /* Keeps track of the label used as the context of a throw to rethrow an |
481 | exception to the outer exception region. */ | |
482 | ||
483 | struct label_node *outer_context_label_stack = NULL; | |
484 | ||
12670d88 | 485 | /* A random data area for the front end's own use. */ |
4956d07c MS |
486 | |
487 | struct label_node *false_label_stack = NULL; | |
488 | ||
4956d07c | 489 | rtx expand_builtin_return_addr PROTO((enum built_in_function, int, rtx)); |
e701eb4d JM |
490 | static void expand_rethrow PROTO((rtx)); |
491 | ||
4956d07c MS |
492 | \f |
493 | /* Various support routines to manipulate the various data structures | |
494 | used by the exception handling code. */ | |
495 | ||
496 | /* Push a label entry onto the given STACK. */ | |
497 | ||
498 | void | |
499 | push_label_entry (stack, rlabel, tlabel) | |
500 | struct label_node **stack; | |
501 | rtx rlabel; | |
502 | tree tlabel; | |
503 | { | |
504 | struct label_node *newnode | |
505 | = (struct label_node *) xmalloc (sizeof (struct label_node)); | |
506 | ||
507 | if (rlabel) | |
508 | newnode->u.rlabel = rlabel; | |
509 | else | |
510 | newnode->u.tlabel = tlabel; | |
511 | newnode->chain = *stack; | |
512 | *stack = newnode; | |
513 | } | |
514 | ||
515 | /* Pop a label entry from the given STACK. */ | |
516 | ||
517 | rtx | |
518 | pop_label_entry (stack) | |
519 | struct label_node **stack; | |
520 | { | |
521 | rtx label; | |
522 | struct label_node *tempnode; | |
523 | ||
524 | if (! *stack) | |
525 | return NULL_RTX; | |
526 | ||
527 | tempnode = *stack; | |
528 | label = tempnode->u.rlabel; | |
529 | *stack = (*stack)->chain; | |
530 | free (tempnode); | |
531 | ||
532 | return label; | |
533 | } | |
534 | ||
535 | /* Return the top element of the given STACK. */ | |
536 | ||
537 | tree | |
538 | top_label_entry (stack) | |
539 | struct label_node **stack; | |
540 | { | |
541 | if (! *stack) | |
542 | return NULL_TREE; | |
543 | ||
544 | return (*stack)->u.tlabel; | |
545 | } | |
546 | ||
478b0752 | 547 | /* Push a new eh_node entry onto STACK. */ |
4956d07c | 548 | |
478b0752 | 549 | static void |
4956d07c MS |
550 | push_eh_entry (stack) |
551 | struct eh_stack *stack; | |
552 | { | |
553 | struct eh_node *node = (struct eh_node *) xmalloc (sizeof (struct eh_node)); | |
554 | struct eh_entry *entry = (struct eh_entry *) xmalloc (sizeof (struct eh_entry)); | |
555 | ||
478b0752 | 556 | entry->outer_context = gen_label_rtx (); |
4956d07c MS |
557 | entry->exception_handler_label = gen_label_rtx (); |
558 | entry->finalization = NULL_TREE; | |
559 | ||
560 | node->entry = entry; | |
561 | node->chain = stack->top; | |
562 | stack->top = node; | |
4956d07c MS |
563 | } |
564 | ||
565 | /* Pop an entry from the given STACK. */ | |
566 | ||
567 | static struct eh_entry * | |
568 | pop_eh_entry (stack) | |
569 | struct eh_stack *stack; | |
570 | { | |
571 | struct eh_node *tempnode; | |
572 | struct eh_entry *tempentry; | |
573 | ||
574 | tempnode = stack->top; | |
575 | tempentry = tempnode->entry; | |
576 | stack->top = stack->top->chain; | |
577 | free (tempnode); | |
578 | ||
579 | return tempentry; | |
580 | } | |
581 | ||
582 | /* Enqueue an ENTRY onto the given QUEUE. */ | |
583 | ||
584 | static void | |
585 | enqueue_eh_entry (queue, entry) | |
586 | struct eh_queue *queue; | |
587 | struct eh_entry *entry; | |
588 | { | |
589 | struct eh_node *node = (struct eh_node *) xmalloc (sizeof (struct eh_node)); | |
590 | ||
591 | node->entry = entry; | |
592 | node->chain = NULL; | |
593 | ||
594 | if (queue->head == NULL) | |
595 | { | |
596 | queue->head = node; | |
597 | } | |
598 | else | |
599 | { | |
600 | queue->tail->chain = node; | |
601 | } | |
602 | queue->tail = node; | |
603 | } | |
604 | ||
605 | /* Dequeue an entry from the given QUEUE. */ | |
606 | ||
607 | static struct eh_entry * | |
608 | dequeue_eh_entry (queue) | |
609 | struct eh_queue *queue; | |
610 | { | |
611 | struct eh_node *tempnode; | |
612 | struct eh_entry *tempentry; | |
613 | ||
614 | if (queue->head == NULL) | |
615 | return NULL; | |
616 | ||
617 | tempnode = queue->head; | |
618 | queue->head = queue->head->chain; | |
619 | ||
620 | tempentry = tempnode->entry; | |
621 | free (tempnode); | |
622 | ||
623 | return tempentry; | |
624 | } | |
625 | \f | |
626 | /* Routine to see if exception exception handling is turned on. | |
627 | DO_WARN is non-zero if we want to inform the user that exception | |
12670d88 RK |
628 | handling is turned off. |
629 | ||
630 | This is used to ensure that -fexceptions has been specified if the | |
abeeec2a | 631 | compiler tries to use any exception-specific functions. */ |
4956d07c MS |
632 | |
633 | int | |
634 | doing_eh (do_warn) | |
635 | int do_warn; | |
636 | { | |
637 | if (! flag_exceptions) | |
638 | { | |
639 | static int warned = 0; | |
640 | if (! warned && do_warn) | |
641 | { | |
642 | error ("exception handling disabled, use -fexceptions to enable"); | |
643 | warned = 1; | |
644 | } | |
645 | return 0; | |
646 | } | |
647 | return 1; | |
648 | } | |
649 | ||
12670d88 | 650 | /* Given a return address in ADDR, determine the address we should use |
abeeec2a | 651 | to find the corresponding EH region. */ |
4956d07c MS |
652 | |
653 | rtx | |
654 | eh_outer_context (addr) | |
655 | rtx addr; | |
656 | { | |
657 | /* First mask out any unwanted bits. */ | |
658 | #ifdef MASK_RETURN_ADDR | |
ca55abae | 659 | expand_and (addr, MASK_RETURN_ADDR, addr); |
4956d07c MS |
660 | #endif |
661 | ||
ca55abae JM |
662 | /* Then adjust to find the real return address. */ |
663 | #if defined (RETURN_ADDR_OFFSET) | |
664 | addr = plus_constant (addr, RETURN_ADDR_OFFSET); | |
4956d07c MS |
665 | #endif |
666 | ||
667 | return addr; | |
668 | } | |
669 | ||
27a36778 MS |
670 | /* Start a new exception region for a region of code that has a |
671 | cleanup action and push the HANDLER for the region onto | |
672 | protect_list. All of the regions created with add_partial_entry | |
673 | will be ended when end_protect_partials is invoked. */ | |
12670d88 RK |
674 | |
675 | void | |
676 | add_partial_entry (handler) | |
677 | tree handler; | |
678 | { | |
679 | expand_eh_region_start (); | |
680 | ||
abeeec2a | 681 | /* Make sure the entry is on the correct obstack. */ |
12670d88 RK |
682 | push_obstacks_nochange (); |
683 | resume_temporary_allocation (); | |
27a36778 MS |
684 | |
685 | /* Because this is a cleanup action, we may have to protect the handler | |
686 | with __terminate. */ | |
687 | handler = protect_with_terminate (handler); | |
688 | ||
12670d88 RK |
689 | protect_list = tree_cons (NULL_TREE, handler, protect_list); |
690 | pop_obstacks (); | |
691 | } | |
692 | ||
100d81d4 | 693 | /* Emit code to get EH context to current function. */ |
27a36778 | 694 | |
154bba13 | 695 | static rtx |
01eb7f9a | 696 | call_get_eh_context () |
27a36778 | 697 | { |
bb727b5a JM |
698 | static tree fn; |
699 | tree expr; | |
700 | ||
701 | if (fn == NULL_TREE) | |
702 | { | |
703 | tree fntype; | |
154bba13 | 704 | fn = get_identifier ("__get_eh_context"); |
bb727b5a JM |
705 | push_obstacks_nochange (); |
706 | end_temporary_allocation (); | |
707 | fntype = build_pointer_type (build_pointer_type | |
708 | (build_pointer_type (void_type_node))); | |
709 | fntype = build_function_type (fntype, NULL_TREE); | |
710 | fn = build_decl (FUNCTION_DECL, fn, fntype); | |
711 | DECL_EXTERNAL (fn) = 1; | |
712 | TREE_PUBLIC (fn) = 1; | |
713 | DECL_ARTIFICIAL (fn) = 1; | |
714 | TREE_READONLY (fn) = 1; | |
715 | make_decl_rtl (fn, NULL_PTR, 1); | |
716 | assemble_external (fn); | |
717 | pop_obstacks (); | |
718 | } | |
719 | ||
720 | expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn); | |
721 | expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)), | |
722 | expr, NULL_TREE, NULL_TREE); | |
723 | TREE_SIDE_EFFECTS (expr) = 1; | |
bb727b5a | 724 | |
100d81d4 | 725 | return copy_to_reg (expand_expr (expr, NULL_RTX, VOIDmode, 0)); |
154bba13 TT |
726 | } |
727 | ||
728 | /* Get a reference to the EH context. | |
729 | We will only generate a register for the current function EH context here, | |
730 | and emit a USE insn to mark that this is a EH context register. | |
731 | ||
732 | Later, emit_eh_context will emit needed call to __get_eh_context | |
733 | in libgcc2, and copy the value to the register we have generated. */ | |
734 | ||
735 | rtx | |
01eb7f9a | 736 | get_eh_context () |
154bba13 TT |
737 | { |
738 | if (current_function_ehc == 0) | |
739 | { | |
740 | rtx insn; | |
741 | ||
742 | current_function_ehc = gen_reg_rtx (Pmode); | |
743 | ||
38a448ca RH |
744 | insn = gen_rtx_USE (GET_MODE (current_function_ehc), |
745 | current_function_ehc); | |
154bba13 TT |
746 | insn = emit_insn_before (insn, get_first_nonparm_insn ()); |
747 | ||
748 | REG_NOTES (insn) | |
38a448ca RH |
749 | = gen_rtx_EXPR_LIST (REG_EH_CONTEXT, current_function_ehc, |
750 | REG_NOTES (insn)); | |
154bba13 TT |
751 | } |
752 | return current_function_ehc; | |
753 | } | |
754 | ||
154bba13 TT |
755 | /* Get a reference to the dynamic handler chain. It points to the |
756 | pointer to the next element in the dynamic handler chain. It ends | |
757 | when there are no more elements in the dynamic handler chain, when | |
758 | the value is &top_elt from libgcc2.c. Immediately after the | |
759 | pointer, is an area suitable for setjmp/longjmp when | |
760 | DONT_USE_BUILTIN_SETJMP is defined, and an area suitable for | |
761 | __builtin_setjmp/__builtin_longjmp when DONT_USE_BUILTIN_SETJMP | |
762 | isn't defined. */ | |
763 | ||
764 | rtx | |
765 | get_dynamic_handler_chain () | |
766 | { | |
767 | rtx ehc, dhc, result; | |
768 | ||
01eb7f9a | 769 | ehc = get_eh_context (); |
154bba13 TT |
770 | dhc = ehc; |
771 | ||
772 | result = copy_to_reg (dhc); | |
773 | ||
774 | /* We don't want a copy of the dcc, but rather, the single dcc. */ | |
38a448ca | 775 | return gen_rtx_MEM (Pmode, result); |
27a36778 MS |
776 | } |
777 | ||
778 | /* Get a reference to the dynamic cleanup chain. It points to the | |
779 | pointer to the next element in the dynamic cleanup chain. | |
780 | Immediately after the pointer, are two Pmode variables, one for a | |
781 | pointer to a function that performs the cleanup action, and the | |
782 | second, the argument to pass to that function. */ | |
783 | ||
784 | rtx | |
785 | get_dynamic_cleanup_chain () | |
786 | { | |
154bba13 | 787 | rtx dhc, dcc, result; |
27a36778 MS |
788 | |
789 | dhc = get_dynamic_handler_chain (); | |
790 | dcc = plus_constant (dhc, GET_MODE_SIZE (Pmode)); | |
791 | ||
154bba13 | 792 | result = copy_to_reg (dcc); |
27a36778 MS |
793 | |
794 | /* We don't want a copy of the dcc, but rather, the single dcc. */ | |
38a448ca | 795 | return gen_rtx_MEM (Pmode, result); |
154bba13 TT |
796 | } |
797 | ||
27a36778 MS |
798 | /* Generate code to evaluate X and jump to LABEL if the value is nonzero. |
799 | LABEL is an rtx of code CODE_LABEL, in this function. */ | |
800 | ||
801 | void | |
802 | jumpif_rtx (x, label) | |
803 | rtx x; | |
804 | rtx label; | |
805 | { | |
806 | jumpif (make_tree (type_for_mode (GET_MODE (x), 0), x), label); | |
807 | } | |
808 | ||
809 | /* Generate code to evaluate X and jump to LABEL if the value is zero. | |
810 | LABEL is an rtx of code CODE_LABEL, in this function. */ | |
811 | ||
812 | void | |
813 | jumpifnot_rtx (x, label) | |
814 | rtx x; | |
815 | rtx label; | |
816 | { | |
817 | jumpifnot (make_tree (type_for_mode (GET_MODE (x), 0), x), label); | |
818 | } | |
819 | ||
820 | /* Start a dynamic cleanup on the EH runtime dynamic cleanup stack. | |
821 | We just need to create an element for the cleanup list, and push it | |
822 | into the chain. | |
823 | ||
824 | A dynamic cleanup is a cleanup action implied by the presence of an | |
825 | element on the EH runtime dynamic cleanup stack that is to be | |
826 | performed when an exception is thrown. The cleanup action is | |
827 | performed by __sjthrow when an exception is thrown. Only certain | |
828 | actions can be optimized into dynamic cleanup actions. For the | |
829 | restrictions on what actions can be performed using this routine, | |
830 | see expand_eh_region_start_tree. */ | |
831 | ||
832 | static void | |
833 | start_dynamic_cleanup (func, arg) | |
834 | tree func; | |
835 | tree arg; | |
836 | { | |
381127e8 | 837 | rtx dcc; |
27a36778 MS |
838 | rtx new_func, new_arg; |
839 | rtx x, buf; | |
840 | int size; | |
841 | ||
842 | /* We allocate enough room for a pointer to the function, and | |
843 | one argument. */ | |
844 | size = 2; | |
845 | ||
846 | /* XXX, FIXME: The stack space allocated this way is too long lived, | |
847 | but there is no allocation routine that allocates at the level of | |
848 | the last binding contour. */ | |
849 | buf = assign_stack_local (BLKmode, | |
850 | GET_MODE_SIZE (Pmode)*(size+1), | |
851 | 0); | |
852 | ||
853 | buf = change_address (buf, Pmode, NULL_RTX); | |
854 | ||
855 | /* Store dcc into the first word of the newly allocated buffer. */ | |
856 | ||
857 | dcc = get_dynamic_cleanup_chain (); | |
858 | emit_move_insn (buf, dcc); | |
859 | ||
860 | /* Store func and arg into the cleanup list element. */ | |
861 | ||
38a448ca RH |
862 | new_func = gen_rtx_MEM (Pmode, plus_constant (XEXP (buf, 0), |
863 | GET_MODE_SIZE (Pmode))); | |
864 | new_arg = gen_rtx_MEM (Pmode, plus_constant (XEXP (buf, 0), | |
865 | GET_MODE_SIZE (Pmode)*2)); | |
27a36778 MS |
866 | x = expand_expr (func, new_func, Pmode, 0); |
867 | if (x != new_func) | |
868 | emit_move_insn (new_func, x); | |
869 | ||
870 | x = expand_expr (arg, new_arg, Pmode, 0); | |
871 | if (x != new_arg) | |
872 | emit_move_insn (new_arg, x); | |
873 | ||
874 | /* Update the cleanup chain. */ | |
875 | ||
876 | emit_move_insn (dcc, XEXP (buf, 0)); | |
877 | } | |
878 | ||
879 | /* Emit RTL to start a dynamic handler on the EH runtime dynamic | |
880 | handler stack. This should only be used by expand_eh_region_start | |
881 | or expand_eh_region_start_tree. */ | |
882 | ||
883 | static void | |
884 | start_dynamic_handler () | |
885 | { | |
886 | rtx dhc, dcc; | |
6e6a07d2 | 887 | rtx x, arg, buf; |
27a36778 MS |
888 | int size; |
889 | ||
6e6a07d2 | 890 | #ifndef DONT_USE_BUILTIN_SETJMP |
27a36778 MS |
891 | /* The number of Pmode words for the setjmp buffer, when using the |
892 | builtin setjmp/longjmp, see expand_builtin, case | |
893 | BUILT_IN_LONGJMP. */ | |
894 | size = 5; | |
895 | #else | |
896 | #ifdef JMP_BUF_SIZE | |
897 | size = JMP_BUF_SIZE; | |
898 | #else | |
899 | /* Should be large enough for most systems, if it is not, | |
900 | JMP_BUF_SIZE should be defined with the proper value. It will | |
901 | also tend to be larger than necessary for most systems, a more | |
902 | optimal port will define JMP_BUF_SIZE. */ | |
903 | size = FIRST_PSEUDO_REGISTER+2; | |
904 | #endif | |
905 | #endif | |
906 | /* XXX, FIXME: The stack space allocated this way is too long lived, | |
907 | but there is no allocation routine that allocates at the level of | |
908 | the last binding contour. */ | |
909 | arg = assign_stack_local (BLKmode, | |
910 | GET_MODE_SIZE (Pmode)*(size+1), | |
911 | 0); | |
912 | ||
913 | arg = change_address (arg, Pmode, NULL_RTX); | |
914 | ||
915 | /* Store dhc into the first word of the newly allocated buffer. */ | |
916 | ||
917 | dhc = get_dynamic_handler_chain (); | |
38a448ca RH |
918 | dcc = gen_rtx_MEM (Pmode, plus_constant (XEXP (arg, 0), |
919 | GET_MODE_SIZE (Pmode))); | |
27a36778 MS |
920 | emit_move_insn (arg, dhc); |
921 | ||
922 | /* Zero out the start of the cleanup chain. */ | |
923 | emit_move_insn (dcc, const0_rtx); | |
924 | ||
925 | /* The jmpbuf starts two words into the area allocated. */ | |
6e6a07d2 | 926 | buf = plus_constant (XEXP (arg, 0), GET_MODE_SIZE (Pmode)*2); |
27a36778 | 927 | |
6e6a07d2 | 928 | #ifdef DONT_USE_BUILTIN_SETJMP |
27a36778 | 929 | x = emit_library_call_value (setjmp_libfunc, NULL_RTX, 1, SImode, 1, |
6e6a07d2 | 930 | buf, Pmode); |
6fd1c67b RH |
931 | /* If we come back here for a catch, transfer control to the handler. */ |
932 | jumpif_rtx (x, ehstack.top->entry->exception_handler_label); | |
6e6a07d2 | 933 | #else |
6fd1c67b RH |
934 | { |
935 | /* A label to continue execution for the no exception case. */ | |
936 | rtx noex = gen_label_rtx(); | |
937 | x = expand_builtin_setjmp (buf, NULL_RTX, noex, | |
938 | ehstack.top->entry->exception_handler_label); | |
939 | emit_label (noex); | |
940 | } | |
6e6a07d2 | 941 | #endif |
27a36778 | 942 | |
27a36778 MS |
943 | /* We are committed to this, so update the handler chain. */ |
944 | ||
945 | emit_move_insn (dhc, XEXP (arg, 0)); | |
946 | } | |
947 | ||
948 | /* Start an exception handling region for the given cleanup action. | |
12670d88 | 949 | All instructions emitted after this point are considered to be part |
27a36778 MS |
950 | of the region until expand_eh_region_end is invoked. CLEANUP is |
951 | the cleanup action to perform. The return value is true if the | |
952 | exception region was optimized away. If that case, | |
953 | expand_eh_region_end does not need to be called for this cleanup, | |
954 | nor should it be. | |
955 | ||
956 | This routine notices one particular common case in C++ code | |
957 | generation, and optimizes it so as to not need the exception | |
958 | region. It works by creating a dynamic cleanup action, instead of | |
959 | of a using an exception region. */ | |
960 | ||
961 | int | |
4c581243 MS |
962 | expand_eh_region_start_tree (decl, cleanup) |
963 | tree decl; | |
27a36778 MS |
964 | tree cleanup; |
965 | { | |
27a36778 MS |
966 | /* This is the old code. */ |
967 | if (! doing_eh (0)) | |
968 | return 0; | |
969 | ||
970 | /* The optimization only applies to actions protected with | |
971 | terminate, and only applies if we are using the setjmp/longjmp | |
972 | codegen method. */ | |
973 | if (exceptions_via_longjmp | |
974 | && protect_cleanup_actions_with_terminate) | |
975 | { | |
976 | tree func, arg; | |
977 | tree args; | |
978 | ||
979 | /* Ignore any UNSAVE_EXPR. */ | |
980 | if (TREE_CODE (cleanup) == UNSAVE_EXPR) | |
981 | cleanup = TREE_OPERAND (cleanup, 0); | |
982 | ||
983 | /* Further, it only applies if the action is a call, if there | |
984 | are 2 arguments, and if the second argument is 2. */ | |
985 | ||
986 | if (TREE_CODE (cleanup) == CALL_EXPR | |
987 | && (args = TREE_OPERAND (cleanup, 1)) | |
988 | && (func = TREE_OPERAND (cleanup, 0)) | |
989 | && (arg = TREE_VALUE (args)) | |
990 | && (args = TREE_CHAIN (args)) | |
991 | ||
992 | /* is the second argument 2? */ | |
993 | && TREE_CODE (TREE_VALUE (args)) == INTEGER_CST | |
994 | && TREE_INT_CST_LOW (TREE_VALUE (args)) == 2 | |
995 | && TREE_INT_CST_HIGH (TREE_VALUE (args)) == 0 | |
996 | ||
997 | /* Make sure there are no other arguments. */ | |
998 | && TREE_CHAIN (args) == NULL_TREE) | |
999 | { | |
1000 | /* Arrange for returns and gotos to pop the entry we make on the | |
1001 | dynamic cleanup stack. */ | |
4c581243 | 1002 | expand_dcc_cleanup (decl); |
27a36778 MS |
1003 | start_dynamic_cleanup (func, arg); |
1004 | return 1; | |
1005 | } | |
1006 | } | |
1007 | ||
4c581243 | 1008 | expand_eh_region_start_for_decl (decl); |
9762d48d | 1009 | ehstack.top->entry->finalization = cleanup; |
27a36778 MS |
1010 | |
1011 | return 0; | |
1012 | } | |
1013 | ||
4c581243 MS |
1014 | /* Just like expand_eh_region_start, except if a cleanup action is |
1015 | entered on the cleanup chain, the TREE_PURPOSE of the element put | |
1016 | on the chain is DECL. DECL should be the associated VAR_DECL, if | |
1017 | any, otherwise it should be NULL_TREE. */ | |
4956d07c MS |
1018 | |
1019 | void | |
4c581243 MS |
1020 | expand_eh_region_start_for_decl (decl) |
1021 | tree decl; | |
4956d07c MS |
1022 | { |
1023 | rtx note; | |
1024 | ||
1025 | /* This is the old code. */ | |
1026 | if (! doing_eh (0)) | |
1027 | return; | |
1028 | ||
27a36778 MS |
1029 | if (exceptions_via_longjmp) |
1030 | { | |
1031 | /* We need a new block to record the start and end of the | |
1032 | dynamic handler chain. We could always do this, but we | |
1033 | really want to permit jumping into such a block, and we want | |
1034 | to avoid any errors or performance impact in the SJ EH code | |
1035 | for now. */ | |
1036 | expand_start_bindings (0); | |
1037 | ||
1038 | /* But we don't need or want a new temporary level. */ | |
1039 | pop_temp_slots (); | |
1040 | ||
1041 | /* Mark this block as created by expand_eh_region_start. This | |
1042 | is so that we can pop the block with expand_end_bindings | |
1043 | automatically. */ | |
1044 | mark_block_as_eh_region (); | |
1045 | ||
1046 | /* Arrange for returns and gotos to pop the entry we make on the | |
1047 | dynamic handler stack. */ | |
4c581243 | 1048 | expand_dhc_cleanup (decl); |
27a36778 | 1049 | } |
4956d07c | 1050 | |
478b0752 | 1051 | push_eh_entry (&ehstack); |
9ad8a5f0 MS |
1052 | note = emit_note (NULL_PTR, NOTE_INSN_EH_REGION_BEG); |
1053 | NOTE_BLOCK_NUMBER (note) | |
1054 | = CODE_LABEL_NUMBER (ehstack.top->entry->exception_handler_label); | |
27a36778 MS |
1055 | if (exceptions_via_longjmp) |
1056 | start_dynamic_handler (); | |
4956d07c MS |
1057 | } |
1058 | ||
4c581243 MS |
1059 | /* Start an exception handling region. All instructions emitted after |
1060 | this point are considered to be part of the region until | |
1061 | expand_eh_region_end is invoked. */ | |
1062 | ||
1063 | void | |
1064 | expand_eh_region_start () | |
1065 | { | |
1066 | expand_eh_region_start_for_decl (NULL_TREE); | |
1067 | } | |
1068 | ||
27a36778 MS |
1069 | /* End an exception handling region. The information about the region |
1070 | is found on the top of ehstack. | |
12670d88 RK |
1071 | |
1072 | HANDLER is either the cleanup for the exception region, or if we're | |
1073 | marking the end of a try block, HANDLER is integer_zero_node. | |
1074 | ||
27a36778 | 1075 | HANDLER will be transformed to rtl when expand_leftover_cleanups |
abeeec2a | 1076 | is invoked. */ |
4956d07c MS |
1077 | |
1078 | void | |
1079 | expand_eh_region_end (handler) | |
1080 | tree handler; | |
1081 | { | |
4956d07c | 1082 | struct eh_entry *entry; |
9ad8a5f0 | 1083 | rtx note; |
4956d07c MS |
1084 | |
1085 | if (! doing_eh (0)) | |
1086 | return; | |
1087 | ||
1088 | entry = pop_eh_entry (&ehstack); | |
1089 | ||
9ad8a5f0 MS |
1090 | note = emit_note (NULL_PTR, NOTE_INSN_EH_REGION_END); |
1091 | NOTE_BLOCK_NUMBER (note) | |
1092 | = CODE_LABEL_NUMBER (entry->exception_handler_label); | |
e701eb4d JM |
1093 | if (exceptions_via_longjmp == 0 |
1094 | /* We share outer_context between regions; only emit it once. */ | |
1095 | && INSN_UID (entry->outer_context) == 0) | |
27a36778 | 1096 | { |
478b0752 | 1097 | rtx label; |
4956d07c | 1098 | |
478b0752 MS |
1099 | label = gen_label_rtx (); |
1100 | emit_jump (label); | |
1101 | ||
1102 | /* Emit a label marking the end of this exception region that | |
1103 | is used for rethrowing into the outer context. */ | |
1104 | emit_label (entry->outer_context); | |
e701eb4d | 1105 | expand_internal_throw (); |
4956d07c | 1106 | |
478b0752 | 1107 | emit_label (label); |
27a36778 | 1108 | } |
4956d07c MS |
1109 | |
1110 | entry->finalization = handler; | |
1111 | ||
1112 | enqueue_eh_entry (&ehqueue, entry); | |
1113 | ||
27a36778 MS |
1114 | /* If we have already started ending the bindings, don't recurse. |
1115 | This only happens when exceptions_via_longjmp is true. */ | |
1116 | if (is_eh_region ()) | |
1117 | { | |
1118 | /* Because we don't need or want a new temporary level and | |
1119 | because we didn't create one in expand_eh_region_start, | |
1120 | create a fake one now to avoid removing one in | |
1121 | expand_end_bindings. */ | |
1122 | push_temp_slots (); | |
1123 | ||
1124 | mark_block_as_not_eh_region (); | |
1125 | ||
1126 | /* Maybe do this to prevent jumping in and so on... */ | |
1127 | expand_end_bindings (NULL_TREE, 0, 0); | |
1128 | } | |
4956d07c MS |
1129 | } |
1130 | ||
9762d48d JM |
1131 | /* End the EH region for a goto fixup. We only need them in the region-based |
1132 | EH scheme. */ | |
1133 | ||
1134 | void | |
1135 | expand_fixup_region_start () | |
1136 | { | |
1137 | if (! doing_eh (0) || exceptions_via_longjmp) | |
1138 | return; | |
1139 | ||
1140 | expand_eh_region_start (); | |
1141 | } | |
1142 | ||
1143 | /* End the EH region for a goto fixup. CLEANUP is the cleanup we just | |
1144 | expanded; to avoid running it twice if it throws, we look through the | |
1145 | ehqueue for a matching region and rethrow from its outer_context. */ | |
1146 | ||
1147 | void | |
1148 | expand_fixup_region_end (cleanup) | |
1149 | tree cleanup; | |
1150 | { | |
9762d48d | 1151 | struct eh_node *node; |
9762d48d JM |
1152 | |
1153 | if (! doing_eh (0) || exceptions_via_longjmp) | |
1154 | return; | |
1155 | ||
1156 | for (node = ehstack.top; node && node->entry->finalization != cleanup; ) | |
1157 | node = node->chain; | |
1158 | if (node == 0) | |
1159 | for (node = ehqueue.head; node && node->entry->finalization != cleanup; ) | |
1160 | node = node->chain; | |
1161 | if (node == 0) | |
1162 | abort (); | |
1163 | ||
e701eb4d | 1164 | ehstack.top->entry->outer_context = node->entry->outer_context; |
9762d48d | 1165 | |
e701eb4d JM |
1166 | /* Just rethrow. size_zero_node is just a NOP. */ |
1167 | expand_eh_region_end (size_zero_node); | |
9762d48d JM |
1168 | } |
1169 | ||
27a36778 MS |
1170 | /* If we are using the setjmp/longjmp EH codegen method, we emit a |
1171 | call to __sjthrow. | |
1172 | ||
1173 | Otherwise, we emit a call to __throw and note that we threw | |
1174 | something, so we know we need to generate the necessary code for | |
1175 | __throw. | |
12670d88 RK |
1176 | |
1177 | Before invoking throw, the __eh_pc variable must have been set up | |
1178 | to contain the PC being thrown from. This address is used by | |
27a36778 | 1179 | __throw to determine which exception region (if any) is |
abeeec2a | 1180 | responsible for handling the exception. */ |
4956d07c | 1181 | |
27a36778 | 1182 | void |
4956d07c MS |
1183 | emit_throw () |
1184 | { | |
27a36778 MS |
1185 | if (exceptions_via_longjmp) |
1186 | { | |
1187 | emit_library_call (sjthrow_libfunc, 0, VOIDmode, 0); | |
1188 | } | |
1189 | else | |
1190 | { | |
4956d07c | 1191 | #ifdef JUMP_TO_THROW |
27a36778 | 1192 | emit_indirect_jump (throw_libfunc); |
4956d07c | 1193 | #else |
27a36778 | 1194 | emit_library_call (throw_libfunc, 0, VOIDmode, 0); |
4956d07c | 1195 | #endif |
27a36778 | 1196 | } |
4956d07c MS |
1197 | emit_barrier (); |
1198 | } | |
1199 | ||
e701eb4d JM |
1200 | /* Throw the current exception. If appropriate, this is done by jumping |
1201 | to the next handler. */ | |
4956d07c MS |
1202 | |
1203 | void | |
e701eb4d | 1204 | expand_internal_throw () |
4956d07c | 1205 | { |
e701eb4d | 1206 | emit_throw (); |
4956d07c MS |
1207 | } |
1208 | ||
1209 | /* Called from expand_exception_blocks and expand_end_catch_block to | |
27a36778 | 1210 | emit any pending handlers/cleanups queued from expand_eh_region_end. */ |
4956d07c MS |
1211 | |
1212 | void | |
1213 | expand_leftover_cleanups () | |
1214 | { | |
1215 | struct eh_entry *entry; | |
1216 | ||
1217 | while ((entry = dequeue_eh_entry (&ehqueue)) != 0) | |
1218 | { | |
1219 | rtx prev; | |
1220 | ||
12670d88 RK |
1221 | /* A leftover try block. Shouldn't be one here. */ |
1222 | if (entry->finalization == integer_zero_node) | |
1223 | abort (); | |
1224 | ||
abeeec2a | 1225 | /* Output the label for the start of the exception handler. */ |
4956d07c MS |
1226 | emit_label (entry->exception_handler_label); |
1227 | ||
f51430ed MS |
1228 | #ifdef HAVE_exception_receiver |
1229 | if (! exceptions_via_longjmp) | |
1230 | if (HAVE_exception_receiver) | |
1231 | emit_insn (gen_exception_receiver ()); | |
1232 | #endif | |
1233 | ||
05f5b2cd MS |
1234 | #ifdef HAVE_nonlocal_goto_receiver |
1235 | if (! exceptions_via_longjmp) | |
1236 | if (HAVE_nonlocal_goto_receiver) | |
1237 | emit_insn (gen_nonlocal_goto_receiver ()); | |
1238 | #endif | |
1239 | ||
abeeec2a | 1240 | /* And now generate the insns for the handler. */ |
4956d07c MS |
1241 | expand_expr (entry->finalization, const0_rtx, VOIDmode, 0); |
1242 | ||
1243 | prev = get_last_insn (); | |
27a36778 | 1244 | if (prev == NULL || GET_CODE (prev) != BARRIER) |
e701eb4d JM |
1245 | /* Emit code to throw to the outer context if we fall off |
1246 | the end of the handler. */ | |
1247 | expand_rethrow (entry->outer_context); | |
4956d07c | 1248 | |
c7ae64f2 | 1249 | do_pending_stack_adjust (); |
4956d07c MS |
1250 | free (entry); |
1251 | } | |
1252 | } | |
1253 | ||
abeeec2a | 1254 | /* Called at the start of a block of try statements. */ |
12670d88 RK |
1255 | void |
1256 | expand_start_try_stmts () | |
1257 | { | |
1258 | if (! doing_eh (1)) | |
1259 | return; | |
1260 | ||
1261 | expand_eh_region_start (); | |
1262 | } | |
1263 | ||
1264 | /* Generate RTL for the start of a group of catch clauses. | |
1265 | ||
1266 | It is responsible for starting a new instruction sequence for the | |
1267 | instructions in the catch block, and expanding the handlers for the | |
1268 | internally-generated exception regions nested within the try block | |
abeeec2a | 1269 | corresponding to this catch block. */ |
4956d07c MS |
1270 | |
1271 | void | |
1272 | expand_start_all_catch () | |
1273 | { | |
1274 | struct eh_entry *entry; | |
1275 | tree label; | |
e701eb4d | 1276 | rtx outer_context; |
4956d07c MS |
1277 | |
1278 | if (! doing_eh (1)) | |
1279 | return; | |
1280 | ||
e701eb4d | 1281 | outer_context = ehstack.top->entry->outer_context; |
1418bb67 | 1282 | |
abeeec2a | 1283 | /* End the try block. */ |
12670d88 RK |
1284 | expand_eh_region_end (integer_zero_node); |
1285 | ||
4956d07c MS |
1286 | emit_line_note (input_filename, lineno); |
1287 | label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); | |
1288 | ||
12670d88 | 1289 | /* The label for the exception handling block that we will save. |
956d6950 | 1290 | This is Lresume in the documentation. */ |
4956d07c MS |
1291 | expand_label (label); |
1292 | ||
12670d88 | 1293 | /* Push the label that points to where normal flow is resumed onto |
abeeec2a | 1294 | the top of the label stack. */ |
4956d07c MS |
1295 | push_label_entry (&caught_return_label_stack, NULL_RTX, label); |
1296 | ||
1297 | /* Start a new sequence for all the catch blocks. We will add this | |
12670d88 | 1298 | to the global sequence catch_clauses when we have completed all |
4956d07c MS |
1299 | the handlers in this handler-seq. */ |
1300 | start_sequence (); | |
1301 | ||
1302 | while (1) | |
1303 | { | |
1304 | rtx prev; | |
1305 | ||
1306 | entry = dequeue_eh_entry (&ehqueue); | |
12670d88 RK |
1307 | /* Emit the label for the exception handler for this region, and |
1308 | expand the code for the handler. | |
1309 | ||
1310 | Note that a catch region is handled as a side-effect here; | |
1311 | for a try block, entry->finalization will contain | |
1312 | integer_zero_node, so no code will be generated in the | |
1313 | expand_expr call below. But, the label for the handler will | |
1314 | still be emitted, so any code emitted after this point will | |
abeeec2a | 1315 | end up being the handler. */ |
4956d07c | 1316 | emit_label (entry->exception_handler_label); |
4956d07c | 1317 | |
f51430ed MS |
1318 | #ifdef HAVE_exception_receiver |
1319 | if (! exceptions_via_longjmp) | |
1320 | if (HAVE_exception_receiver) | |
1321 | emit_insn (gen_exception_receiver ()); | |
1322 | #endif | |
1323 | ||
05f5b2cd MS |
1324 | #ifdef HAVE_nonlocal_goto_receiver |
1325 | if (! exceptions_via_longjmp) | |
1326 | if (HAVE_nonlocal_goto_receiver) | |
1327 | emit_insn (gen_nonlocal_goto_receiver ()); | |
1328 | #endif | |
1329 | ||
12670d88 | 1330 | /* When we get down to the matching entry for this try block, stop. */ |
4956d07c | 1331 | if (entry->finalization == integer_zero_node) |
12670d88 | 1332 | { |
abeeec2a | 1333 | /* Don't forget to free this entry. */ |
12670d88 RK |
1334 | free (entry); |
1335 | break; | |
1336 | } | |
4956d07c | 1337 | |
27a36778 MS |
1338 | /* And now generate the insns for the handler. */ |
1339 | expand_expr (entry->finalization, const0_rtx, VOIDmode, 0); | |
1340 | ||
4956d07c | 1341 | prev = get_last_insn (); |
12670d88 | 1342 | if (prev == NULL || GET_CODE (prev) != BARRIER) |
e701eb4d JM |
1343 | /* Code to throw out to outer context when we fall off end |
1344 | of the handler. We can't do this here for catch blocks, | |
1345 | so it's done in expand_end_all_catch instead. */ | |
1346 | expand_rethrow (entry->outer_context); | |
12670d88 | 1347 | |
f45ebe47 | 1348 | do_pending_stack_adjust (); |
4956d07c MS |
1349 | free (entry); |
1350 | } | |
e701eb4d JM |
1351 | |
1352 | /* If we are not doing setjmp/longjmp EH, because we are reordered | |
1353 | out of line, we arrange to rethrow in the outer context. We need to | |
1354 | do this because we are not physically within the region, if any, that | |
1355 | logically contains this catch block. */ | |
1356 | if (! exceptions_via_longjmp) | |
1357 | { | |
1358 | expand_eh_region_start (); | |
1359 | ehstack.top->entry->outer_context = outer_context; | |
1360 | } | |
4956d07c MS |
1361 | } |
1362 | ||
12670d88 RK |
1363 | /* Finish up the catch block. At this point all the insns for the |
1364 | catch clauses have already been generated, so we only have to add | |
1365 | them to the catch_clauses list. We also want to make sure that if | |
1366 | we fall off the end of the catch clauses that we rethrow to the | |
abeeec2a | 1367 | outer EH region. */ |
4956d07c MS |
1368 | |
1369 | void | |
1370 | expand_end_all_catch () | |
1371 | { | |
5dfa7520 | 1372 | rtx new_catch_clause, outer_context = NULL_RTX; |
4956d07c MS |
1373 | |
1374 | if (! doing_eh (1)) | |
1375 | return; | |
1376 | ||
e701eb4d | 1377 | if (! exceptions_via_longjmp) |
5dfa7520 JM |
1378 | { |
1379 | outer_context = ehstack.top->entry->outer_context; | |
1380 | ||
1381 | /* Finish the rethrow region. size_zero_node is just a NOP. */ | |
1382 | expand_eh_region_end (size_zero_node); | |
1383 | } | |
1384 | ||
e701eb4d JM |
1385 | /* Code to throw out to outer context, if we fall off end of catch |
1386 | handlers. This is rethrow (Lresume, same id, same obj) in the | |
1387 | documentation. We use Lresume because we know that it will throw | |
1388 | to the correct context. | |
12670d88 | 1389 | |
e701eb4d JM |
1390 | In other words, if the catch handler doesn't exit or return, we |
1391 | do a "throw" (using the address of Lresume as the point being | |
1392 | thrown from) so that the outer EH region can then try to process | |
1393 | the exception. */ | |
1394 | expand_rethrow (outer_context); | |
4956d07c MS |
1395 | |
1396 | /* Now we have the complete catch sequence. */ | |
1397 | new_catch_clause = get_insns (); | |
1398 | end_sequence (); | |
1399 | ||
1400 | /* This level of catch blocks is done, so set up the successful | |
1401 | catch jump label for the next layer of catch blocks. */ | |
1402 | pop_label_entry (&caught_return_label_stack); | |
956d6950 | 1403 | pop_label_entry (&outer_context_label_stack); |
4956d07c MS |
1404 | |
1405 | /* Add the new sequence of catches to the main one for this function. */ | |
1406 | push_to_sequence (catch_clauses); | |
1407 | emit_insns (new_catch_clause); | |
1408 | catch_clauses = get_insns (); | |
1409 | end_sequence (); | |
1410 | ||
1411 | /* Here we fall through into the continuation code. */ | |
1412 | } | |
1413 | ||
e701eb4d JM |
1414 | /* Rethrow from the outer context LABEL. */ |
1415 | ||
1416 | static void | |
1417 | expand_rethrow (label) | |
1418 | rtx label; | |
1419 | { | |
1420 | if (exceptions_via_longjmp) | |
1421 | emit_throw (); | |
1422 | else | |
1423 | emit_jump (label); | |
1424 | } | |
1425 | ||
12670d88 | 1426 | /* End all the pending exception regions on protect_list. The handlers |
27a36778 | 1427 | will be emitted when expand_leftover_cleanups is invoked. */ |
4956d07c MS |
1428 | |
1429 | void | |
1430 | end_protect_partials () | |
1431 | { | |
1432 | while (protect_list) | |
1433 | { | |
1434 | expand_eh_region_end (TREE_VALUE (protect_list)); | |
1435 | protect_list = TREE_CHAIN (protect_list); | |
1436 | } | |
1437 | } | |
27a36778 MS |
1438 | |
1439 | /* Arrange for __terminate to be called if there is an unhandled throw | |
1440 | from within E. */ | |
1441 | ||
1442 | tree | |
1443 | protect_with_terminate (e) | |
1444 | tree e; | |
1445 | { | |
1446 | /* We only need to do this when using setjmp/longjmp EH and the | |
1447 | language requires it, as otherwise we protect all of the handlers | |
1448 | at once, if we need to. */ | |
1449 | if (exceptions_via_longjmp && protect_cleanup_actions_with_terminate) | |
1450 | { | |
1451 | tree handler, result; | |
1452 | ||
1453 | /* All cleanups must be on the function_obstack. */ | |
1454 | push_obstacks_nochange (); | |
1455 | resume_temporary_allocation (); | |
1456 | ||
1457 | handler = make_node (RTL_EXPR); | |
1458 | TREE_TYPE (handler) = void_type_node; | |
1459 | RTL_EXPR_RTL (handler) = const0_rtx; | |
1460 | TREE_SIDE_EFFECTS (handler) = 1; | |
1461 | start_sequence_for_rtl_expr (handler); | |
1462 | ||
1463 | emit_library_call (terminate_libfunc, 0, VOIDmode, 0); | |
1464 | emit_barrier (); | |
1465 | ||
1466 | RTL_EXPR_SEQUENCE (handler) = get_insns (); | |
1467 | end_sequence (); | |
1468 | ||
1469 | result = build (TRY_CATCH_EXPR, TREE_TYPE (e), e, handler); | |
1470 | TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e); | |
1471 | TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e); | |
1472 | TREE_READONLY (result) = TREE_READONLY (e); | |
1473 | ||
1474 | pop_obstacks (); | |
1475 | ||
1476 | e = result; | |
1477 | } | |
1478 | ||
1479 | return e; | |
1480 | } | |
4956d07c MS |
1481 | \f |
1482 | /* The exception table that we build that is used for looking up and | |
12670d88 RK |
1483 | dispatching exceptions, the current number of entries, and its |
1484 | maximum size before we have to extend it. | |
1485 | ||
1486 | The number in eh_table is the code label number of the exception | |
27a36778 MS |
1487 | handler for the region. This is added by add_eh_table_entry and |
1488 | used by output_exception_table_entry. */ | |
12670d88 | 1489 | |
4956d07c MS |
1490 | static int *eh_table; |
1491 | static int eh_table_size; | |
1492 | static int eh_table_max_size; | |
1493 | ||
1494 | /* Note the need for an exception table entry for region N. If we | |
12670d88 RK |
1495 | don't need to output an explicit exception table, avoid all of the |
1496 | extra work. | |
1497 | ||
1498 | Called from final_scan_insn when a NOTE_INSN_EH_REGION_BEG is seen. | |
1499 | N is the NOTE_BLOCK_NUMBER of the note, which comes from the code | |
abeeec2a | 1500 | label number of the exception handler for the region. */ |
4956d07c MS |
1501 | |
1502 | void | |
1503 | add_eh_table_entry (n) | |
1504 | int n; | |
1505 | { | |
1506 | #ifndef OMIT_EH_TABLE | |
1507 | if (eh_table_size >= eh_table_max_size) | |
1508 | { | |
1509 | if (eh_table) | |
1510 | { | |
1511 | eh_table_max_size += eh_table_max_size>>1; | |
1512 | ||
1513 | if (eh_table_max_size < 0) | |
1514 | abort (); | |
1515 | ||
ca55abae JM |
1516 | eh_table = (int *) xrealloc (eh_table, |
1517 | eh_table_max_size * sizeof (int)); | |
4956d07c MS |
1518 | } |
1519 | else | |
1520 | { | |
1521 | eh_table_max_size = 252; | |
1522 | eh_table = (int *) xmalloc (eh_table_max_size * sizeof (int)); | |
1523 | } | |
1524 | } | |
1525 | eh_table[eh_table_size++] = n; | |
1526 | #endif | |
1527 | } | |
1528 | ||
12670d88 RK |
1529 | /* Return a non-zero value if we need to output an exception table. |
1530 | ||
1531 | On some platforms, we don't have to output a table explicitly. | |
1532 | This routine doesn't mean we don't have one. */ | |
4956d07c MS |
1533 | |
1534 | int | |
1535 | exception_table_p () | |
1536 | { | |
1537 | if (eh_table) | |
1538 | return 1; | |
1539 | ||
1540 | return 0; | |
1541 | } | |
1542 | ||
12670d88 RK |
1543 | /* Output the entry of the exception table corresponding to to the |
1544 | exception region numbered N to file FILE. | |
1545 | ||
1546 | N is the code label number corresponding to the handler of the | |
abeeec2a | 1547 | region. */ |
4956d07c MS |
1548 | |
1549 | static void | |
1550 | output_exception_table_entry (file, n) | |
1551 | FILE *file; | |
1552 | int n; | |
1553 | { | |
1554 | char buf[256]; | |
1555 | rtx sym; | |
1556 | ||
1557 | ASM_GENERATE_INTERNAL_LABEL (buf, "LEHB", n); | |
38a448ca | 1558 | sym = gen_rtx_SYMBOL_REF (Pmode, buf); |
4956d07c MS |
1559 | assemble_integer (sym, POINTER_SIZE / BITS_PER_UNIT, 1); |
1560 | ||
1561 | ASM_GENERATE_INTERNAL_LABEL (buf, "LEHE", n); | |
38a448ca | 1562 | sym = gen_rtx_SYMBOL_REF (Pmode, buf); |
4956d07c MS |
1563 | assemble_integer (sym, POINTER_SIZE / BITS_PER_UNIT, 1); |
1564 | ||
1565 | ASM_GENERATE_INTERNAL_LABEL (buf, "L", n); | |
38a448ca | 1566 | sym = gen_rtx_SYMBOL_REF (Pmode, buf); |
4956d07c MS |
1567 | assemble_integer (sym, POINTER_SIZE / BITS_PER_UNIT, 1); |
1568 | ||
1569 | putc ('\n', file); /* blank line */ | |
1570 | } | |
1571 | ||
abeeec2a | 1572 | /* Output the exception table if we have and need one. */ |
4956d07c MS |
1573 | |
1574 | void | |
1575 | output_exception_table () | |
1576 | { | |
1577 | int i; | |
1578 | extern FILE *asm_out_file; | |
1579 | ||
ca55abae | 1580 | if (! doing_eh (0) || ! eh_table) |
4956d07c MS |
1581 | return; |
1582 | ||
1583 | exception_section (); | |
1584 | ||
1585 | /* Beginning marker for table. */ | |
1586 | assemble_align (GET_MODE_ALIGNMENT (ptr_mode)); | |
1587 | assemble_label ("__EXCEPTION_TABLE__"); | |
1588 | ||
4956d07c MS |
1589 | for (i = 0; i < eh_table_size; ++i) |
1590 | output_exception_table_entry (asm_out_file, eh_table[i]); | |
1591 | ||
1592 | free (eh_table); | |
1593 | ||
1594 | /* Ending marker for table. */ | |
4956d07c MS |
1595 | assemble_integer (constm1_rtx, POINTER_SIZE / BITS_PER_UNIT, 1); |
1596 | assemble_integer (constm1_rtx, POINTER_SIZE / BITS_PER_UNIT, 1); | |
1597 | assemble_integer (constm1_rtx, POINTER_SIZE / BITS_PER_UNIT, 1); | |
1598 | putc ('\n', asm_out_file); /* blank line */ | |
1599 | } | |
4956d07c | 1600 | \f |
154bba13 TT |
1601 | /* Emit code to get EH context. |
1602 | ||
1603 | We have to scan thru the code to find possible EH context registers. | |
1604 | Inlined functions may use it too, and thus we'll have to be able | |
1605 | to change them too. | |
1606 | ||
1607 | This is done only if using exceptions_via_longjmp. */ | |
1608 | ||
1609 | void | |
1610 | emit_eh_context () | |
1611 | { | |
1612 | rtx insn; | |
1613 | rtx ehc = 0; | |
1614 | ||
1615 | if (! doing_eh (0)) | |
1616 | return; | |
1617 | ||
1618 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
1619 | if (GET_CODE (insn) == INSN | |
1620 | && GET_CODE (PATTERN (insn)) == USE) | |
1621 | { | |
1622 | rtx reg = find_reg_note (insn, REG_EH_CONTEXT, 0); | |
1623 | if (reg) | |
1624 | { | |
1625 | rtx insns; | |
1626 | ||
100d81d4 JM |
1627 | start_sequence (); |
1628 | ||
d9c92f32 JM |
1629 | /* If this is the first use insn, emit the call here. This |
1630 | will always be at the top of our function, because if | |
1631 | expand_inline_function notices a REG_EH_CONTEXT note, it | |
1632 | adds a use insn to this function as well. */ | |
154bba13 | 1633 | if (ehc == 0) |
01eb7f9a | 1634 | ehc = call_get_eh_context (); |
154bba13 | 1635 | |
154bba13 TT |
1636 | emit_move_insn (XEXP (reg, 0), ehc); |
1637 | insns = get_insns (); | |
1638 | end_sequence (); | |
1639 | ||
1640 | emit_insns_before (insns, insn); | |
1641 | } | |
1642 | } | |
1643 | } | |
1644 | ||
12670d88 RK |
1645 | /* Scan the current insns and build a list of handler labels. The |
1646 | resulting list is placed in the global variable exception_handler_labels. | |
1647 | ||
1648 | It is called after the last exception handling region is added to | |
1649 | the current function (when the rtl is almost all built for the | |
1650 | current function) and before the jump optimization pass. */ | |
4956d07c MS |
1651 | |
1652 | void | |
1653 | find_exception_handler_labels () | |
1654 | { | |
1655 | rtx insn; | |
1656 | int max_labelno = max_label_num (); | |
1657 | int min_labelno = get_first_label_num (); | |
1658 | rtx *labels; | |
1659 | ||
1660 | exception_handler_labels = NULL_RTX; | |
1661 | ||
1662 | /* If we aren't doing exception handling, there isn't much to check. */ | |
1663 | if (! doing_eh (0)) | |
1664 | return; | |
1665 | ||
12670d88 | 1666 | /* Generate a handy reference to each label. */ |
4956d07c | 1667 | |
1d77fa53 BK |
1668 | /* We call xmalloc here instead of alloca; we did the latter in the past, |
1669 | but found that it can sometimes end up being asked to allocate space | |
1670 | for more than 1 million labels. */ | |
1671 | labels = (rtx *) xmalloc ((max_labelno - min_labelno) * sizeof (rtx)); | |
abeeec2a | 1672 | bzero ((char *) labels, (max_labelno - min_labelno) * sizeof (rtx)); |
12670d88 | 1673 | |
abeeec2a | 1674 | /* Arrange for labels to be indexed directly by CODE_LABEL_NUMBER. */ |
4956d07c MS |
1675 | labels -= min_labelno; |
1676 | ||
1677 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
1678 | { | |
1679 | if (GET_CODE (insn) == CODE_LABEL) | |
1680 | if (CODE_LABEL_NUMBER (insn) >= min_labelno | |
1681 | && CODE_LABEL_NUMBER (insn) < max_labelno) | |
1682 | labels[CODE_LABEL_NUMBER (insn)] = insn; | |
1683 | } | |
1684 | ||
12670d88 RK |
1685 | /* For each start of a region, add its label to the list. */ |
1686 | ||
4956d07c MS |
1687 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) |
1688 | { | |
1689 | if (GET_CODE (insn) == NOTE | |
1690 | && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG) | |
1691 | { | |
1692 | rtx label = NULL_RTX; | |
1693 | ||
1694 | if (NOTE_BLOCK_NUMBER (insn) >= min_labelno | |
1695 | && NOTE_BLOCK_NUMBER (insn) < max_labelno) | |
1696 | { | |
1697 | label = labels[NOTE_BLOCK_NUMBER (insn)]; | |
1698 | ||
1699 | if (label) | |
1700 | exception_handler_labels | |
38a448ca RH |
1701 | = gen_rtx_EXPR_LIST (VOIDmode, |
1702 | label, exception_handler_labels); | |
4956d07c MS |
1703 | else |
1704 | warning ("didn't find handler for EH region %d", | |
1705 | NOTE_BLOCK_NUMBER (insn)); | |
1706 | } | |
1707 | else | |
1708 | warning ("mismatched EH region %d", NOTE_BLOCK_NUMBER (insn)); | |
1709 | } | |
1710 | } | |
988cea7d | 1711 | |
3f34faec | 1712 | free (labels + min_labelno); |
4956d07c MS |
1713 | } |
1714 | ||
12670d88 RK |
1715 | /* Perform sanity checking on the exception_handler_labels list. |
1716 | ||
1717 | Can be called after find_exception_handler_labels is called to | |
1718 | build the list of exception handlers for the current function and | |
1719 | before we finish processing the current function. */ | |
4956d07c MS |
1720 | |
1721 | void | |
1722 | check_exception_handler_labels () | |
1723 | { | |
1724 | rtx insn, handler; | |
1725 | ||
1726 | /* If we aren't doing exception handling, there isn't much to check. */ | |
1727 | if (! doing_eh (0)) | |
1728 | return; | |
1729 | ||
12670d88 RK |
1730 | /* Ensure that the CODE_LABEL_NUMBER for the CODE_LABEL entry point |
1731 | in each handler corresponds to the CODE_LABEL_NUMBER of the | |
abeeec2a | 1732 | handler. */ |
12670d88 | 1733 | |
4956d07c MS |
1734 | for (handler = exception_handler_labels; |
1735 | handler; | |
1736 | handler = XEXP (handler, 1)) | |
1737 | { | |
1738 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
1739 | { | |
1740 | if (GET_CODE (insn) == CODE_LABEL) | |
1741 | { | |
1742 | if (CODE_LABEL_NUMBER (insn) | |
1743 | == CODE_LABEL_NUMBER (XEXP (handler, 0))) | |
1744 | { | |
1745 | if (insn != XEXP (handler, 0)) | |
1746 | warning ("mismatched handler %d", | |
1747 | CODE_LABEL_NUMBER (insn)); | |
1748 | break; | |
1749 | } | |
1750 | } | |
1751 | } | |
1752 | if (insn == NULL_RTX) | |
1753 | warning ("handler not found %d", | |
1754 | CODE_LABEL_NUMBER (XEXP (handler, 0))); | |
1755 | } | |
1756 | ||
12670d88 RK |
1757 | /* Now go through and make sure that for each region there is a |
1758 | corresponding label. */ | |
4956d07c MS |
1759 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) |
1760 | { | |
1761 | if (GET_CODE (insn) == NOTE | |
27a36778 MS |
1762 | && (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG |
1763 | || NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END)) | |
4956d07c MS |
1764 | { |
1765 | for (handler = exception_handler_labels; | |
1766 | handler; | |
1767 | handler = XEXP (handler, 1)) | |
1768 | { | |
1769 | if (CODE_LABEL_NUMBER (XEXP (handler, 0)) | |
1770 | == NOTE_BLOCK_NUMBER (insn)) | |
1771 | break; | |
1772 | } | |
ec2be682 | 1773 | if (handler == NULL_RTX && !flag_syntax_only) |
4956d07c MS |
1774 | warning ("region exists, no handler %d", |
1775 | NOTE_BLOCK_NUMBER (insn)); | |
1776 | } | |
1777 | } | |
1778 | } | |
1779 | \f | |
1780 | /* This group of functions initializes the exception handling data | |
1781 | structures at the start of the compilation, initializes the data | |
12670d88 | 1782 | structures at the start of a function, and saves and restores the |
4956d07c MS |
1783 | exception handling data structures for the start/end of a nested |
1784 | function. */ | |
1785 | ||
1786 | /* Toplevel initialization for EH things. */ | |
1787 | ||
1788 | void | |
1789 | init_eh () | |
1790 | { | |
4956d07c MS |
1791 | } |
1792 | ||
abeeec2a | 1793 | /* Initialize the per-function EH information. */ |
4956d07c MS |
1794 | |
1795 | void | |
1796 | init_eh_for_function () | |
1797 | { | |
1798 | ehstack.top = 0; | |
1799 | ehqueue.head = ehqueue.tail = 0; | |
1800 | catch_clauses = NULL_RTX; | |
1801 | false_label_stack = 0; | |
1802 | caught_return_label_stack = 0; | |
1803 | protect_list = NULL_TREE; | |
154bba13 | 1804 | current_function_ehc = NULL_RTX; |
4956d07c MS |
1805 | } |
1806 | ||
12670d88 RK |
1807 | /* Save some of the per-function EH info into the save area denoted by |
1808 | P. | |
1809 | ||
27a36778 | 1810 | This is currently called from save_stmt_status. */ |
4956d07c MS |
1811 | |
1812 | void | |
1813 | save_eh_status (p) | |
1814 | struct function *p; | |
1815 | { | |
3a88cbd1 JL |
1816 | if (p == NULL) |
1817 | abort (); | |
12670d88 | 1818 | |
4956d07c MS |
1819 | p->ehstack = ehstack; |
1820 | p->ehqueue = ehqueue; | |
1821 | p->catch_clauses = catch_clauses; | |
1822 | p->false_label_stack = false_label_stack; | |
1823 | p->caught_return_label_stack = caught_return_label_stack; | |
1824 | p->protect_list = protect_list; | |
154bba13 | 1825 | p->ehc = current_function_ehc; |
4956d07c | 1826 | |
6e1f1f93 | 1827 | init_eh_for_function (); |
4956d07c MS |
1828 | } |
1829 | ||
12670d88 RK |
1830 | /* Restore the per-function EH info saved into the area denoted by P. |
1831 | ||
abeeec2a | 1832 | This is currently called from restore_stmt_status. */ |
4956d07c MS |
1833 | |
1834 | void | |
1835 | restore_eh_status (p) | |
1836 | struct function *p; | |
1837 | { | |
3a88cbd1 JL |
1838 | if (p == NULL) |
1839 | abort (); | |
12670d88 | 1840 | |
4956d07c MS |
1841 | protect_list = p->protect_list; |
1842 | caught_return_label_stack = p->caught_return_label_stack; | |
1843 | false_label_stack = p->false_label_stack; | |
1844 | catch_clauses = p->catch_clauses; | |
1845 | ehqueue = p->ehqueue; | |
1846 | ehstack = p->ehstack; | |
154bba13 | 1847 | current_function_ehc = p->ehc; |
4956d07c MS |
1848 | } |
1849 | \f | |
1850 | /* This section is for the exception handling specific optimization | |
1851 | pass. First are the internal routines, and then the main | |
1852 | optimization pass. */ | |
1853 | ||
1854 | /* Determine if the given INSN can throw an exception. */ | |
1855 | ||
1856 | static int | |
1857 | can_throw (insn) | |
1858 | rtx insn; | |
1859 | { | |
abeeec2a | 1860 | /* Calls can always potentially throw exceptions. */ |
4956d07c MS |
1861 | if (GET_CODE (insn) == CALL_INSN) |
1862 | return 1; | |
1863 | ||
27a36778 MS |
1864 | if (asynchronous_exceptions) |
1865 | { | |
1866 | /* If we wanted asynchronous exceptions, then everything but NOTEs | |
1867 | and CODE_LABELs could throw. */ | |
1868 | if (GET_CODE (insn) != NOTE && GET_CODE (insn) != CODE_LABEL) | |
1869 | return 1; | |
1870 | } | |
4956d07c MS |
1871 | |
1872 | return 0; | |
1873 | } | |
1874 | ||
12670d88 RK |
1875 | /* Scan a exception region looking for the matching end and then |
1876 | remove it if possible. INSN is the start of the region, N is the | |
1877 | region number, and DELETE_OUTER is to note if anything in this | |
1878 | region can throw. | |
1879 | ||
1880 | Regions are removed if they cannot possibly catch an exception. | |
27a36778 | 1881 | This is determined by invoking can_throw on each insn within the |
12670d88 RK |
1882 | region; if can_throw returns true for any of the instructions, the |
1883 | region can catch an exception, since there is an insn within the | |
1884 | region that is capable of throwing an exception. | |
1885 | ||
1886 | Returns the NOTE_INSN_EH_REGION_END corresponding to this region, or | |
27a36778 | 1887 | calls abort if it can't find one. |
12670d88 RK |
1888 | |
1889 | Can abort if INSN is not a NOTE_INSN_EH_REGION_BEGIN, or if N doesn't | |
abeeec2a | 1890 | correspond to the region number, or if DELETE_OUTER is NULL. */ |
4956d07c MS |
1891 | |
1892 | static rtx | |
1893 | scan_region (insn, n, delete_outer) | |
1894 | rtx insn; | |
1895 | int n; | |
1896 | int *delete_outer; | |
1897 | { | |
1898 | rtx start = insn; | |
1899 | ||
1900 | /* Assume we can delete the region. */ | |
1901 | int delete = 1; | |
1902 | ||
3a88cbd1 JL |
1903 | if (insn == NULL_RTX |
1904 | || GET_CODE (insn) != NOTE | |
1905 | || NOTE_LINE_NUMBER (insn) != NOTE_INSN_EH_REGION_BEG | |
1906 | || NOTE_BLOCK_NUMBER (insn) != n | |
1907 | || delete_outer == NULL) | |
1908 | abort (); | |
12670d88 | 1909 | |
4956d07c MS |
1910 | insn = NEXT_INSN (insn); |
1911 | ||
1912 | /* Look for the matching end. */ | |
1913 | while (! (GET_CODE (insn) == NOTE | |
1914 | && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END)) | |
1915 | { | |
1916 | /* If anything can throw, we can't remove the region. */ | |
1917 | if (delete && can_throw (insn)) | |
1918 | { | |
1919 | delete = 0; | |
1920 | } | |
1921 | ||
1922 | /* Watch out for and handle nested regions. */ | |
1923 | if (GET_CODE (insn) == NOTE | |
1924 | && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG) | |
1925 | { | |
1926 | insn = scan_region (insn, NOTE_BLOCK_NUMBER (insn), &delete); | |
1927 | } | |
1928 | ||
1929 | insn = NEXT_INSN (insn); | |
1930 | } | |
1931 | ||
1932 | /* The _BEG/_END NOTEs must match and nest. */ | |
1933 | if (NOTE_BLOCK_NUMBER (insn) != n) | |
1934 | abort (); | |
1935 | ||
12670d88 | 1936 | /* If anything in this exception region can throw, we can throw. */ |
4956d07c MS |
1937 | if (! delete) |
1938 | *delete_outer = 0; | |
1939 | else | |
1940 | { | |
1941 | /* Delete the start and end of the region. */ | |
1942 | delete_insn (start); | |
1943 | delete_insn (insn); | |
1944 | ||
1945 | /* Only do this part if we have built the exception handler | |
1946 | labels. */ | |
1947 | if (exception_handler_labels) | |
1948 | { | |
1949 | rtx x, *prev = &exception_handler_labels; | |
1950 | ||
1951 | /* Find it in the list of handlers. */ | |
1952 | for (x = exception_handler_labels; x; x = XEXP (x, 1)) | |
1953 | { | |
1954 | rtx label = XEXP (x, 0); | |
1955 | if (CODE_LABEL_NUMBER (label) == n) | |
1956 | { | |
1957 | /* If we are the last reference to the handler, | |
1958 | delete it. */ | |
1959 | if (--LABEL_NUSES (label) == 0) | |
1960 | delete_insn (label); | |
1961 | ||
1962 | if (optimize) | |
1963 | { | |
1964 | /* Remove it from the list of exception handler | |
1965 | labels, if we are optimizing. If we are not, then | |
1966 | leave it in the list, as we are not really going to | |
1967 | remove the region. */ | |
1968 | *prev = XEXP (x, 1); | |
1969 | XEXP (x, 1) = 0; | |
1970 | XEXP (x, 0) = 0; | |
1971 | } | |
1972 | ||
1973 | break; | |
1974 | } | |
1975 | prev = &XEXP (x, 1); | |
1976 | } | |
1977 | } | |
1978 | } | |
1979 | return insn; | |
1980 | } | |
1981 | ||
1982 | /* Perform various interesting optimizations for exception handling | |
1983 | code. | |
1984 | ||
12670d88 RK |
1985 | We look for empty exception regions and make them go (away). The |
1986 | jump optimization code will remove the handler if nothing else uses | |
abeeec2a | 1987 | it. */ |
4956d07c MS |
1988 | |
1989 | void | |
1990 | exception_optimize () | |
1991 | { | |
381127e8 | 1992 | rtx insn; |
4956d07c MS |
1993 | int n; |
1994 | ||
12670d88 | 1995 | /* Remove empty regions. */ |
4956d07c MS |
1996 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) |
1997 | { | |
1998 | if (GET_CODE (insn) == NOTE | |
1999 | && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG) | |
2000 | { | |
27a36778 | 2001 | /* Since scan_region will return the NOTE_INSN_EH_REGION_END |
12670d88 RK |
2002 | insn, we will indirectly skip through all the insns |
2003 | inbetween. We are also guaranteed that the value of insn | |
27a36778 | 2004 | returned will be valid, as otherwise scan_region won't |
abeeec2a | 2005 | return. */ |
4956d07c MS |
2006 | insn = scan_region (insn, NOTE_BLOCK_NUMBER (insn), &n); |
2007 | } | |
2008 | } | |
2009 | } | |
ca55abae JM |
2010 | \f |
2011 | /* Various hooks for the DWARF 2 __throw routine. */ | |
2012 | ||
2013 | /* Do any necessary initialization to access arbitrary stack frames. | |
2014 | On the SPARC, this means flushing the register windows. */ | |
2015 | ||
2016 | void | |
2017 | expand_builtin_unwind_init () | |
2018 | { | |
2019 | /* Set this so all the registers get saved in our frame; we need to be | |
2020 | able to copy the saved values for any registers from frames we unwind. */ | |
2021 | current_function_has_nonlocal_label = 1; | |
2022 | ||
2023 | #ifdef SETUP_FRAME_ADDRESSES | |
2024 | SETUP_FRAME_ADDRESSES (); | |
2025 | #endif | |
2026 | } | |
2027 | ||
2028 | /* Given a value extracted from the return address register or stack slot, | |
2029 | return the actual address encoded in that value. */ | |
2030 | ||
2031 | rtx | |
2032 | expand_builtin_extract_return_addr (addr_tree) | |
2033 | tree addr_tree; | |
2034 | { | |
2035 | rtx addr = expand_expr (addr_tree, NULL_RTX, Pmode, 0); | |
2036 | return eh_outer_context (addr); | |
2037 | } | |
2038 | ||
2039 | /* Given an actual address in addr_tree, do any necessary encoding | |
2040 | and return the value to be stored in the return address register or | |
2041 | stack slot so the epilogue will return to that address. */ | |
2042 | ||
2043 | rtx | |
2044 | expand_builtin_frob_return_addr (addr_tree) | |
2045 | tree addr_tree; | |
2046 | { | |
2047 | rtx addr = expand_expr (addr_tree, NULL_RTX, Pmode, 0); | |
2048 | #ifdef RETURN_ADDR_OFFSET | |
2049 | addr = plus_constant (addr, -RETURN_ADDR_OFFSET); | |
2050 | #endif | |
2051 | return addr; | |
2052 | } | |
2053 | ||
2054 | /* Given an actual address in addr_tree, set the return address register up | |
2055 | so the epilogue will return to that address. If the return address is | |
2056 | not in a register, do nothing. */ | |
2057 | ||
2058 | void | |
2059 | expand_builtin_set_return_addr_reg (addr_tree) | |
2060 | tree addr_tree; | |
2061 | { | |
4f870c04 | 2062 | rtx tmp; |
ca55abae JM |
2063 | rtx ra = expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS, |
2064 | 0, hard_frame_pointer_rtx); | |
2065 | ||
2066 | if (GET_CODE (ra) != REG || REGNO (ra) >= FIRST_PSEUDO_REGISTER) | |
2067 | return; | |
2068 | ||
4f870c04 JM |
2069 | tmp = force_operand (expand_builtin_frob_return_addr (addr_tree), ra); |
2070 | if (tmp != ra) | |
2071 | emit_move_insn (ra, tmp); | |
ca55abae JM |
2072 | } |
2073 | ||
2074 | /* Choose two registers for communication between the main body of | |
2075 | __throw and the stub for adjusting the stack pointer. The first register | |
2076 | is used to pass the address of the exception handler; the second register | |
2077 | is used to pass the stack pointer offset. | |
2078 | ||
2079 | For register 1 we use the return value register for a void *. | |
2080 | For register 2 we use the static chain register if it exists and is | |
2081 | different from register 1, otherwise some arbitrary call-clobbered | |
2082 | register. */ | |
2083 | ||
2084 | static void | |
2085 | eh_regs (r1, r2, outgoing) | |
2086 | rtx *r1, *r2; | |
2087 | int outgoing; | |
2088 | { | |
2089 | rtx reg1, reg2; | |
2090 | ||
2091 | #ifdef FUNCTION_OUTGOING_VALUE | |
2092 | if (outgoing) | |
2093 | reg1 = FUNCTION_OUTGOING_VALUE (build_pointer_type (void_type_node), | |
2094 | current_function_decl); | |
2095 | else | |
2096 | #endif | |
2097 | reg1 = FUNCTION_VALUE (build_pointer_type (void_type_node), | |
2098 | current_function_decl); | |
2099 | ||
2100 | #ifdef STATIC_CHAIN_REGNUM | |
2101 | if (outgoing) | |
2102 | reg2 = static_chain_incoming_rtx; | |
2103 | else | |
2104 | reg2 = static_chain_rtx; | |
2105 | if (REGNO (reg2) == REGNO (reg1)) | |
2106 | #endif /* STATIC_CHAIN_REGNUM */ | |
2107 | reg2 = NULL_RTX; | |
2108 | ||
2109 | if (reg2 == NULL_RTX) | |
2110 | { | |
2111 | int i; | |
2112 | for (i = 0; i < FIRST_PSEUDO_REGISTER; ++i) | |
2113 | if (call_used_regs[i] && ! fixed_regs[i] && i != REGNO (reg1)) | |
2114 | { | |
38a448ca | 2115 | reg2 = gen_rtx_REG (Pmode, i); |
ca55abae JM |
2116 | break; |
2117 | } | |
2118 | ||
2119 | if (reg2 == NULL_RTX) | |
2120 | abort (); | |
2121 | } | |
2122 | ||
2123 | *r1 = reg1; | |
2124 | *r2 = reg2; | |
2125 | } | |
2126 | ||
2127 | /* Emit inside of __throw a stub which adjusts the stack pointer and jumps | |
2128 | to the exception handler. __throw will set up the necessary values | |
2129 | and then return to the stub. */ | |
2130 | ||
2131 | rtx | |
2132 | expand_builtin_eh_stub () | |
2133 | { | |
2134 | rtx stub_start = gen_label_rtx (); | |
2135 | rtx after_stub = gen_label_rtx (); | |
381127e8 | 2136 | rtx handler, offset; |
ca55abae JM |
2137 | |
2138 | emit_jump (after_stub); | |
2139 | emit_label (stub_start); | |
2140 | ||
2141 | eh_regs (&handler, &offset, 0); | |
2142 | ||
2143 | adjust_stack (offset); | |
2144 | emit_indirect_jump (handler); | |
2145 | ||
2146 | emit_label (after_stub); | |
38a448ca | 2147 | return gen_rtx_LABEL_REF (Pmode, stub_start); |
ca55abae JM |
2148 | } |
2149 | ||
2150 | /* Set up the registers for passing the handler address and stack offset | |
2151 | to the stub above. */ | |
2152 | ||
2153 | void | |
2154 | expand_builtin_set_eh_regs (handler, offset) | |
2155 | tree handler, offset; | |
2156 | { | |
2157 | rtx reg1, reg2; | |
2158 | ||
2159 | eh_regs (®1, ®2, 1); | |
2160 | ||
2161 | store_expr (offset, reg2, 0); | |
2162 | store_expr (handler, reg1, 0); | |
2163 | ||
2164 | /* These will be used by the stub. */ | |
38a448ca RH |
2165 | emit_insn (gen_rtx_USE (VOIDmode, reg1)); |
2166 | emit_insn (gen_rtx_USE (VOIDmode, reg2)); | |
ca55abae | 2167 | } |
77d33a84 AM |
2168 | |
2169 | \f | |
2170 | ||
2171 | /* This contains the code required to verify whether arbitrary instructions | |
2172 | are in the same exception region. */ | |
2173 | ||
2174 | static int *insn_eh_region = (int *)0; | |
2175 | static int maximum_uid; | |
2176 | ||
2177 | static void set_insn_eh_region (first, region_num) | |
2178 | rtx *first; | |
2179 | int region_num; | |
2180 | { | |
2181 | rtx insn; | |
2182 | int rnum; | |
2183 | ||
2184 | for (insn = *first; insn; insn = NEXT_INSN (insn)) | |
2185 | { | |
2186 | if ((GET_CODE (insn) == NOTE) && | |
2187 | (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG)) | |
2188 | { | |
2189 | rnum = NOTE_BLOCK_NUMBER (insn); | |
2190 | insn_eh_region[INSN_UID (insn)] = rnum; | |
2191 | insn = NEXT_INSN (insn); | |
2192 | set_insn_eh_region (&insn, rnum); | |
2193 | /* Upon return, insn points to the EH_REGION_END of nested region */ | |
2194 | continue; | |
2195 | } | |
2196 | insn_eh_region[INSN_UID (insn)] = region_num; | |
2197 | if ((GET_CODE (insn) == NOTE) && | |
2198 | (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END)) | |
2199 | break; | |
2200 | } | |
2201 | *first = insn; | |
2202 | } | |
2203 | ||
2204 | /* Free the insn table, an make sure it cannot be used again. */ | |
2205 | ||
2206 | void free_insn_eh_region () | |
2207 | { | |
2208 | if (!doing_eh (0)) | |
2209 | return; | |
2210 | ||
2211 | if (insn_eh_region) | |
2212 | { | |
2213 | free (insn_eh_region); | |
2214 | insn_eh_region = (int *)0; | |
2215 | } | |
2216 | } | |
2217 | ||
2218 | /* Initialize the table. max_uid must be calculated and handed into | |
2219 | this routine. If it is unavailable, passing a value of 0 will | |
2220 | cause this routine to calculate it as well. */ | |
2221 | ||
2222 | void init_insn_eh_region (first, max_uid) | |
2223 | rtx first; | |
2224 | int max_uid; | |
2225 | { | |
2226 | rtx insn; | |
2227 | ||
2228 | if (!doing_eh (0)) | |
2229 | return; | |
2230 | ||
2231 | if (insn_eh_region) | |
2232 | free_insn_eh_region(); | |
2233 | ||
2234 | if (max_uid == 0) | |
2235 | for (insn = first; insn; insn = NEXT_INSN (insn)) | |
2236 | if (INSN_UID (insn) > max_uid) /* find largest UID */ | |
2237 | max_uid = INSN_UID (insn); | |
2238 | ||
2239 | maximum_uid = max_uid; | |
2240 | insn_eh_region = (int *) malloc ((max_uid + 1) * sizeof (int)); | |
2241 | insn = first; | |
2242 | set_insn_eh_region (&insn, 0); | |
2243 | } | |
2244 | ||
2245 | ||
2246 | /* Check whether 2 instructions are within the same region. */ | |
2247 | ||
2248 | int in_same_eh_region(insn1, insn2) | |
2249 | rtx insn1,insn2; | |
2250 | { | |
2251 | int ret, uid1, uid2; | |
2252 | ||
2253 | /* If no exceptions, instructions are always in same region. */ | |
2254 | if (!doing_eh (0)) | |
2255 | return 1; | |
2256 | ||
2257 | /* If the table isn't allocated, assume the worst. */ | |
2258 | if (!insn_eh_region) | |
2259 | return 0; | |
2260 | ||
2261 | uid1 = INSN_UID (insn1); | |
2262 | uid2 = INSN_UID (insn2); | |
2263 | ||
2264 | /* if instructions have been allocated beyond the end, either | |
2265 | the table is out of date, or this is a late addition, or | |
2266 | something... Assume the worst. */ | |
2267 | if (uid1 > maximum_uid || uid2 > maximum_uid) | |
2268 | return 0; | |
2269 | ||
2270 | ret = (insn_eh_region[uid1] == insn_eh_region[uid2]); | |
2271 | return ret; | |
2272 | } | |
2273 |