]>
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 | |
26 | be transferred to any arbitrary code assocated with a function call | |
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 | ||
74 | In the current implementaion, cleanups are handled by allocating an | |
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 | |
100 | __register_frame. On other targets, the information for each | |
d1485032 | 101 | translation unit is registered from the file generated by collect2. |
ca55abae JM |
102 | __register_frame is defined in frame.c, and is responsible for |
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 | |
282 | should call __teminate. | |
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 | |
380 | table, and no calls to __register_excetpions. __sjthrow is used | |
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 | ||
27a36778 MS |
408 | /* One to use setjmp/longjmp method of generating code for exception |
409 | handling. */ | |
410 | ||
d1485032 | 411 | int exceptions_via_longjmp = 2; |
27a36778 MS |
412 | |
413 | /* One to enable asynchronous exception support. */ | |
414 | ||
415 | int asynchronous_exceptions = 0; | |
416 | ||
417 | /* One to protect cleanup actions with a handler that calls | |
418 | __terminate, zero otherwise. */ | |
419 | ||
420 | int protect_cleanup_actions_with_terminate = 0; | |
421 | ||
12670d88 | 422 | /* A list of labels used for exception handlers. Created by |
4956d07c MS |
423 | find_exception_handler_labels for the optimization passes. */ |
424 | ||
425 | rtx exception_handler_labels; | |
426 | ||
12670d88 RK |
427 | /* Nonzero means that __throw was invoked. |
428 | ||
429 | This is used by the C++ frontend to know if code needs to be emitted | |
430 | for __throw or not. */ | |
4956d07c MS |
431 | |
432 | int throw_used; | |
433 | ||
27a36778 MS |
434 | /* The dynamic handler chain. Nonzero if the function has already |
435 | fetched a pointer to the dynamic handler chain for exception | |
436 | handling. */ | |
437 | ||
438 | rtx current_function_dhc; | |
439 | ||
440 | /* The dynamic cleanup chain. Nonzero if the function has already | |
441 | fetched a pointer to the dynamic cleanup chain for exception | |
442 | handling. */ | |
443 | ||
444 | rtx current_function_dcc; | |
445 | ||
4956d07c | 446 | /* A stack used for keeping track of the currectly active exception |
12670d88 | 447 | handling region. As each exception region is started, an entry |
4956d07c MS |
448 | describing the region is pushed onto this stack. The current |
449 | region can be found by looking at the top of the stack, and as we | |
12670d88 RK |
450 | exit regions, the corresponding entries are popped. |
451 | ||
27a36778 | 452 | Entries cannot overlap; they can be nested. So there is only one |
12670d88 RK |
453 | entry at most that corresponds to the current instruction, and that |
454 | is the entry on the top of the stack. */ | |
4956d07c | 455 | |
27a36778 | 456 | static struct eh_stack ehstack; |
4956d07c | 457 | |
12670d88 RK |
458 | /* A queue used for tracking which exception regions have closed but |
459 | whose handlers have not yet been expanded. Regions are emitted in | |
460 | groups in an attempt to improve paging performance. | |
461 | ||
462 | As we exit a region, we enqueue a new entry. The entries are then | |
27a36778 | 463 | dequeued during expand_leftover_cleanups and expand_start_all_catch, |
12670d88 RK |
464 | |
465 | We should redo things so that we either take RTL for the handler, | |
466 | or we expand the handler expressed as a tree immediately at region | |
467 | end time. */ | |
4956d07c | 468 | |
27a36778 | 469 | static struct eh_queue ehqueue; |
4956d07c | 470 | |
12670d88 | 471 | /* Insns for all of the exception handlers for the current function. |
abeeec2a | 472 | They are currently emitted by the frontend code. */ |
4956d07c MS |
473 | |
474 | rtx catch_clauses; | |
475 | ||
12670d88 RK |
476 | /* A TREE_CHAINed list of handlers for regions that are not yet |
477 | closed. The TREE_VALUE of each entry contains the handler for the | |
abeeec2a | 478 | corresponding entry on the ehstack. */ |
4956d07c | 479 | |
12670d88 | 480 | static tree protect_list; |
4956d07c MS |
481 | |
482 | /* Stacks to keep track of various labels. */ | |
483 | ||
12670d88 RK |
484 | /* Keeps track of the label to resume to should one want to resume |
485 | normal control flow out of a handler (instead of, say, returning to | |
1418bb67 | 486 | the caller of the current function or exiting the program). */ |
4956d07c MS |
487 | |
488 | struct label_node *caught_return_label_stack = NULL; | |
489 | ||
1418bb67 JM |
490 | /* Keeps track of the label used as the context of a throw to rethrow an |
491 | exception to the outer exception region. */ | |
492 | ||
493 | struct label_node *outer_context_label_stack = NULL; | |
494 | ||
12670d88 | 495 | /* A random data area for the front end's own use. */ |
4956d07c MS |
496 | |
497 | struct label_node *false_label_stack = NULL; | |
498 | ||
843e8335 | 499 | /* The rtx and the tree for the saved PC value. */ |
4956d07c MS |
500 | |
501 | rtx eh_saved_pc_rtx; | |
843e8335 | 502 | tree eh_saved_pc; |
4956d07c MS |
503 | |
504 | rtx expand_builtin_return_addr PROTO((enum built_in_function, int, rtx)); | |
505 | \f | |
506 | /* Various support routines to manipulate the various data structures | |
507 | used by the exception handling code. */ | |
508 | ||
509 | /* Push a label entry onto the given STACK. */ | |
510 | ||
511 | void | |
512 | push_label_entry (stack, rlabel, tlabel) | |
513 | struct label_node **stack; | |
514 | rtx rlabel; | |
515 | tree tlabel; | |
516 | { | |
517 | struct label_node *newnode | |
518 | = (struct label_node *) xmalloc (sizeof (struct label_node)); | |
519 | ||
520 | if (rlabel) | |
521 | newnode->u.rlabel = rlabel; | |
522 | else | |
523 | newnode->u.tlabel = tlabel; | |
524 | newnode->chain = *stack; | |
525 | *stack = newnode; | |
526 | } | |
527 | ||
528 | /* Pop a label entry from the given STACK. */ | |
529 | ||
530 | rtx | |
531 | pop_label_entry (stack) | |
532 | struct label_node **stack; | |
533 | { | |
534 | rtx label; | |
535 | struct label_node *tempnode; | |
536 | ||
537 | if (! *stack) | |
538 | return NULL_RTX; | |
539 | ||
540 | tempnode = *stack; | |
541 | label = tempnode->u.rlabel; | |
542 | *stack = (*stack)->chain; | |
543 | free (tempnode); | |
544 | ||
545 | return label; | |
546 | } | |
547 | ||
548 | /* Return the top element of the given STACK. */ | |
549 | ||
550 | tree | |
551 | top_label_entry (stack) | |
552 | struct label_node **stack; | |
553 | { | |
554 | if (! *stack) | |
555 | return NULL_TREE; | |
556 | ||
557 | return (*stack)->u.tlabel; | |
558 | } | |
559 | ||
12670d88 | 560 | /* Make a copy of ENTRY using xmalloc to allocate the space. */ |
4956d07c MS |
561 | |
562 | static struct eh_entry * | |
563 | copy_eh_entry (entry) | |
564 | struct eh_entry *entry; | |
565 | { | |
566 | struct eh_entry *newentry; | |
567 | ||
568 | newentry = (struct eh_entry *) xmalloc (sizeof (struct eh_entry)); | |
569 | bcopy ((char *) entry, (char *) newentry, sizeof (struct eh_entry)); | |
570 | ||
571 | return newentry; | |
572 | } | |
573 | ||
478b0752 | 574 | /* Push a new eh_node entry onto STACK. */ |
4956d07c | 575 | |
478b0752 | 576 | static void |
4956d07c MS |
577 | push_eh_entry (stack) |
578 | struct eh_stack *stack; | |
579 | { | |
580 | struct eh_node *node = (struct eh_node *) xmalloc (sizeof (struct eh_node)); | |
581 | struct eh_entry *entry = (struct eh_entry *) xmalloc (sizeof (struct eh_entry)); | |
582 | ||
478b0752 | 583 | entry->outer_context = gen_label_rtx (); |
4956d07c MS |
584 | entry->exception_handler_label = gen_label_rtx (); |
585 | entry->finalization = NULL_TREE; | |
586 | ||
587 | node->entry = entry; | |
588 | node->chain = stack->top; | |
589 | stack->top = node; | |
4956d07c MS |
590 | } |
591 | ||
592 | /* Pop an entry from the given STACK. */ | |
593 | ||
594 | static struct eh_entry * | |
595 | pop_eh_entry (stack) | |
596 | struct eh_stack *stack; | |
597 | { | |
598 | struct eh_node *tempnode; | |
599 | struct eh_entry *tempentry; | |
600 | ||
601 | tempnode = stack->top; | |
602 | tempentry = tempnode->entry; | |
603 | stack->top = stack->top->chain; | |
604 | free (tempnode); | |
605 | ||
606 | return tempentry; | |
607 | } | |
608 | ||
609 | /* Enqueue an ENTRY onto the given QUEUE. */ | |
610 | ||
611 | static void | |
612 | enqueue_eh_entry (queue, entry) | |
613 | struct eh_queue *queue; | |
614 | struct eh_entry *entry; | |
615 | { | |
616 | struct eh_node *node = (struct eh_node *) xmalloc (sizeof (struct eh_node)); | |
617 | ||
618 | node->entry = entry; | |
619 | node->chain = NULL; | |
620 | ||
621 | if (queue->head == NULL) | |
622 | { | |
623 | queue->head = node; | |
624 | } | |
625 | else | |
626 | { | |
627 | queue->tail->chain = node; | |
628 | } | |
629 | queue->tail = node; | |
630 | } | |
631 | ||
632 | /* Dequeue an entry from the given QUEUE. */ | |
633 | ||
634 | static struct eh_entry * | |
635 | dequeue_eh_entry (queue) | |
636 | struct eh_queue *queue; | |
637 | { | |
638 | struct eh_node *tempnode; | |
639 | struct eh_entry *tempentry; | |
640 | ||
641 | if (queue->head == NULL) | |
642 | return NULL; | |
643 | ||
644 | tempnode = queue->head; | |
645 | queue->head = queue->head->chain; | |
646 | ||
647 | tempentry = tempnode->entry; | |
648 | free (tempnode); | |
649 | ||
650 | return tempentry; | |
651 | } | |
652 | \f | |
653 | /* Routine to see if exception exception handling is turned on. | |
654 | DO_WARN is non-zero if we want to inform the user that exception | |
12670d88 RK |
655 | handling is turned off. |
656 | ||
657 | This is used to ensure that -fexceptions has been specified if the | |
abeeec2a | 658 | compiler tries to use any exception-specific functions. */ |
4956d07c MS |
659 | |
660 | int | |
661 | doing_eh (do_warn) | |
662 | int do_warn; | |
663 | { | |
664 | if (! flag_exceptions) | |
665 | { | |
666 | static int warned = 0; | |
667 | if (! warned && do_warn) | |
668 | { | |
669 | error ("exception handling disabled, use -fexceptions to enable"); | |
670 | warned = 1; | |
671 | } | |
672 | return 0; | |
673 | } | |
674 | return 1; | |
675 | } | |
676 | ||
12670d88 | 677 | /* Given a return address in ADDR, determine the address we should use |
abeeec2a | 678 | to find the corresponding EH region. */ |
4956d07c MS |
679 | |
680 | rtx | |
681 | eh_outer_context (addr) | |
682 | rtx addr; | |
683 | { | |
684 | /* First mask out any unwanted bits. */ | |
685 | #ifdef MASK_RETURN_ADDR | |
ca55abae | 686 | expand_and (addr, MASK_RETURN_ADDR, addr); |
4956d07c MS |
687 | #endif |
688 | ||
ca55abae JM |
689 | /* Then adjust to find the real return address. */ |
690 | #if defined (RETURN_ADDR_OFFSET) | |
691 | addr = plus_constant (addr, RETURN_ADDR_OFFSET); | |
4956d07c MS |
692 | #endif |
693 | ||
694 | return addr; | |
695 | } | |
696 | ||
27a36778 MS |
697 | /* Start a new exception region for a region of code that has a |
698 | cleanup action and push the HANDLER for the region onto | |
699 | protect_list. All of the regions created with add_partial_entry | |
700 | will be ended when end_protect_partials is invoked. */ | |
12670d88 RK |
701 | |
702 | void | |
703 | add_partial_entry (handler) | |
704 | tree handler; | |
705 | { | |
706 | expand_eh_region_start (); | |
707 | ||
abeeec2a | 708 | /* Make sure the entry is on the correct obstack. */ |
12670d88 RK |
709 | push_obstacks_nochange (); |
710 | resume_temporary_allocation (); | |
27a36778 MS |
711 | |
712 | /* Because this is a cleanup action, we may have to protect the handler | |
713 | with __terminate. */ | |
714 | handler = protect_with_terminate (handler); | |
715 | ||
12670d88 RK |
716 | protect_list = tree_cons (NULL_TREE, handler, protect_list); |
717 | pop_obstacks (); | |
718 | } | |
719 | ||
27a36778 MS |
720 | /* Get a reference to the dynamic handler chain. It points to the |
721 | pointer to the next element in the dynamic handler chain. It ends | |
722 | when there are no more elements in the dynamic handler chain, when | |
723 | the value is &top_elt from libgcc2.c. Immediately after the | |
724 | pointer, is an area suitable for setjmp/longjmp when | |
6e6a07d2 MS |
725 | DONT_USE_BUILTIN_SETJMP is defined, and an area suitable for |
726 | __builtin_setjmp/__builtin_longjmp when DONT_USE_BUILTIN_SETJMP | |
727 | isn't defined. | |
27a36778 MS |
728 | |
729 | This routine is here to facilitate the porting of this code to | |
730 | systems with threads. One can either replace the routine we emit a | |
731 | call for here in libgcc2.c, or one can modify this routine to work | |
732 | with their thread system. */ | |
733 | ||
734 | rtx | |
735 | get_dynamic_handler_chain () | |
736 | { | |
737 | #if 0 | |
738 | /* Do this once we figure out how to get this to the front of the | |
739 | function, and we really only want one per real function, not one | |
740 | per inlined function. */ | |
741 | if (current_function_dhc == 0) | |
742 | { | |
743 | rtx dhc, insns; | |
744 | start_sequence (); | |
745 | ||
bb727b5a | 746 | /* ... */ |
27a36778 MS |
747 | insns = get_insns (); |
748 | end_sequence (); | |
749 | emit_insns_before (insns, get_first_nonparm_insn ()); | |
750 | } | |
27a36778 MS |
751 | /* We don't want a copy of the dhc, but rather, the single dhc. */ |
752 | return gen_rtx (MEM, Pmode, current_function_dhc); | |
bb727b5a JM |
753 | #endif |
754 | ||
755 | static tree fn; | |
756 | tree expr; | |
757 | ||
758 | if (fn == NULL_TREE) | |
759 | { | |
760 | tree fntype; | |
761 | fn = get_identifier ("__get_dynamic_handler_chain"); | |
762 | push_obstacks_nochange (); | |
763 | end_temporary_allocation (); | |
764 | fntype = build_pointer_type (build_pointer_type | |
765 | (build_pointer_type (void_type_node))); | |
766 | fntype = build_function_type (fntype, NULL_TREE); | |
767 | fn = build_decl (FUNCTION_DECL, fn, fntype); | |
768 | DECL_EXTERNAL (fn) = 1; | |
769 | TREE_PUBLIC (fn) = 1; | |
770 | DECL_ARTIFICIAL (fn) = 1; | |
771 | TREE_READONLY (fn) = 1; | |
772 | make_decl_rtl (fn, NULL_PTR, 1); | |
773 | assemble_external (fn); | |
774 | pop_obstacks (); | |
775 | } | |
776 | ||
777 | expr = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (fn)), fn); | |
778 | expr = build (CALL_EXPR, TREE_TYPE (TREE_TYPE (fn)), | |
779 | expr, NULL_TREE, NULL_TREE); | |
780 | TREE_SIDE_EFFECTS (expr) = 1; | |
781 | expr = build1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (expr)), expr); | |
782 | ||
783 | return expand_expr (expr, NULL_RTX, VOIDmode, 0); | |
27a36778 MS |
784 | } |
785 | ||
786 | /* Get a reference to the dynamic cleanup chain. It points to the | |
787 | pointer to the next element in the dynamic cleanup chain. | |
788 | Immediately after the pointer, are two Pmode variables, one for a | |
789 | pointer to a function that performs the cleanup action, and the | |
790 | second, the argument to pass to that function. */ | |
791 | ||
792 | rtx | |
793 | get_dynamic_cleanup_chain () | |
794 | { | |
795 | rtx dhc, dcc; | |
796 | ||
797 | dhc = get_dynamic_handler_chain (); | |
798 | dcc = plus_constant (dhc, GET_MODE_SIZE (Pmode)); | |
799 | ||
800 | current_function_dcc = copy_to_reg (dcc); | |
801 | ||
802 | /* We don't want a copy of the dcc, but rather, the single dcc. */ | |
803 | return gen_rtx (MEM, Pmode, current_function_dcc); | |
804 | } | |
805 | ||
806 | /* Generate code to evaluate X and jump to LABEL if the value is nonzero. | |
807 | LABEL is an rtx of code CODE_LABEL, in this function. */ | |
808 | ||
809 | void | |
810 | jumpif_rtx (x, label) | |
811 | rtx x; | |
812 | rtx label; | |
813 | { | |
814 | jumpif (make_tree (type_for_mode (GET_MODE (x), 0), x), label); | |
815 | } | |
816 | ||
817 | /* Generate code to evaluate X and jump to LABEL if the value is zero. | |
818 | LABEL is an rtx of code CODE_LABEL, in this function. */ | |
819 | ||
820 | void | |
821 | jumpifnot_rtx (x, label) | |
822 | rtx x; | |
823 | rtx label; | |
824 | { | |
825 | jumpifnot (make_tree (type_for_mode (GET_MODE (x), 0), x), label); | |
826 | } | |
827 | ||
828 | /* Start a dynamic cleanup on the EH runtime dynamic cleanup stack. | |
829 | We just need to create an element for the cleanup list, and push it | |
830 | into the chain. | |
831 | ||
832 | A dynamic cleanup is a cleanup action implied by the presence of an | |
833 | element on the EH runtime dynamic cleanup stack that is to be | |
834 | performed when an exception is thrown. The cleanup action is | |
835 | performed by __sjthrow when an exception is thrown. Only certain | |
836 | actions can be optimized into dynamic cleanup actions. For the | |
837 | restrictions on what actions can be performed using this routine, | |
838 | see expand_eh_region_start_tree. */ | |
839 | ||
840 | static void | |
841 | start_dynamic_cleanup (func, arg) | |
842 | tree func; | |
843 | tree arg; | |
844 | { | |
845 | rtx dhc, dcc; | |
846 | rtx new_func, new_arg; | |
847 | rtx x, buf; | |
848 | int size; | |
849 | ||
850 | /* We allocate enough room for a pointer to the function, and | |
851 | one argument. */ | |
852 | size = 2; | |
853 | ||
854 | /* XXX, FIXME: The stack space allocated this way is too long lived, | |
855 | but there is no allocation routine that allocates at the level of | |
856 | the last binding contour. */ | |
857 | buf = assign_stack_local (BLKmode, | |
858 | GET_MODE_SIZE (Pmode)*(size+1), | |
859 | 0); | |
860 | ||
861 | buf = change_address (buf, Pmode, NULL_RTX); | |
862 | ||
863 | /* Store dcc into the first word of the newly allocated buffer. */ | |
864 | ||
865 | dcc = get_dynamic_cleanup_chain (); | |
866 | emit_move_insn (buf, dcc); | |
867 | ||
868 | /* Store func and arg into the cleanup list element. */ | |
869 | ||
870 | new_func = gen_rtx (MEM, Pmode, plus_constant (XEXP (buf, 0), | |
871 | GET_MODE_SIZE (Pmode))); | |
872 | new_arg = gen_rtx (MEM, Pmode, plus_constant (XEXP (buf, 0), | |
873 | GET_MODE_SIZE (Pmode)*2)); | |
874 | x = expand_expr (func, new_func, Pmode, 0); | |
875 | if (x != new_func) | |
876 | emit_move_insn (new_func, x); | |
877 | ||
878 | x = expand_expr (arg, new_arg, Pmode, 0); | |
879 | if (x != new_arg) | |
880 | emit_move_insn (new_arg, x); | |
881 | ||
882 | /* Update the cleanup chain. */ | |
883 | ||
884 | emit_move_insn (dcc, XEXP (buf, 0)); | |
885 | } | |
886 | ||
887 | /* Emit RTL to start a dynamic handler on the EH runtime dynamic | |
888 | handler stack. This should only be used by expand_eh_region_start | |
889 | or expand_eh_region_start_tree. */ | |
890 | ||
891 | static void | |
892 | start_dynamic_handler () | |
893 | { | |
894 | rtx dhc, dcc; | |
6e6a07d2 | 895 | rtx x, arg, buf; |
27a36778 MS |
896 | int size; |
897 | ||
6e6a07d2 | 898 | #ifndef DONT_USE_BUILTIN_SETJMP |
27a36778 MS |
899 | /* The number of Pmode words for the setjmp buffer, when using the |
900 | builtin setjmp/longjmp, see expand_builtin, case | |
901 | BUILT_IN_LONGJMP. */ | |
902 | size = 5; | |
903 | #else | |
904 | #ifdef JMP_BUF_SIZE | |
905 | size = JMP_BUF_SIZE; | |
906 | #else | |
907 | /* Should be large enough for most systems, if it is not, | |
908 | JMP_BUF_SIZE should be defined with the proper value. It will | |
909 | also tend to be larger than necessary for most systems, a more | |
910 | optimal port will define JMP_BUF_SIZE. */ | |
911 | size = FIRST_PSEUDO_REGISTER+2; | |
912 | #endif | |
913 | #endif | |
914 | /* XXX, FIXME: The stack space allocated this way is too long lived, | |
915 | but there is no allocation routine that allocates at the level of | |
916 | the last binding contour. */ | |
917 | arg = assign_stack_local (BLKmode, | |
918 | GET_MODE_SIZE (Pmode)*(size+1), | |
919 | 0); | |
920 | ||
921 | arg = change_address (arg, Pmode, NULL_RTX); | |
922 | ||
923 | /* Store dhc into the first word of the newly allocated buffer. */ | |
924 | ||
925 | dhc = get_dynamic_handler_chain (); | |
926 | dcc = gen_rtx (MEM, Pmode, plus_constant (XEXP (arg, 0), | |
927 | GET_MODE_SIZE (Pmode))); | |
928 | emit_move_insn (arg, dhc); | |
929 | ||
930 | /* Zero out the start of the cleanup chain. */ | |
931 | emit_move_insn (dcc, const0_rtx); | |
932 | ||
933 | /* The jmpbuf starts two words into the area allocated. */ | |
6e6a07d2 | 934 | buf = plus_constant (XEXP (arg, 0), GET_MODE_SIZE (Pmode)*2); |
27a36778 | 935 | |
6e6a07d2 | 936 | #ifdef DONT_USE_BUILTIN_SETJMP |
27a36778 | 937 | x = emit_library_call_value (setjmp_libfunc, NULL_RTX, 1, SImode, 1, |
6e6a07d2 MS |
938 | buf, Pmode); |
939 | #else | |
940 | x = expand_builtin_setjmp (buf, NULL_RTX); | |
941 | #endif | |
27a36778 MS |
942 | |
943 | /* If we come back here for a catch, transfer control to the | |
944 | handler. */ | |
945 | ||
946 | jumpif_rtx (x, ehstack.top->entry->exception_handler_label); | |
947 | ||
948 | /* We are committed to this, so update the handler chain. */ | |
949 | ||
950 | emit_move_insn (dhc, XEXP (arg, 0)); | |
951 | } | |
952 | ||
953 | /* Start an exception handling region for the given cleanup action. | |
12670d88 | 954 | All instructions emitted after this point are considered to be part |
27a36778 MS |
955 | of the region until expand_eh_region_end is invoked. CLEANUP is |
956 | the cleanup action to perform. The return value is true if the | |
957 | exception region was optimized away. If that case, | |
958 | expand_eh_region_end does not need to be called for this cleanup, | |
959 | nor should it be. | |
960 | ||
961 | This routine notices one particular common case in C++ code | |
962 | generation, and optimizes it so as to not need the exception | |
963 | region. It works by creating a dynamic cleanup action, instead of | |
964 | of a using an exception region. */ | |
965 | ||
966 | int | |
4c581243 MS |
967 | expand_eh_region_start_tree (decl, cleanup) |
968 | tree decl; | |
27a36778 MS |
969 | tree cleanup; |
970 | { | |
971 | rtx note; | |
972 | ||
973 | /* This is the old code. */ | |
974 | if (! doing_eh (0)) | |
975 | return 0; | |
976 | ||
977 | /* The optimization only applies to actions protected with | |
978 | terminate, and only applies if we are using the setjmp/longjmp | |
979 | codegen method. */ | |
980 | if (exceptions_via_longjmp | |
981 | && protect_cleanup_actions_with_terminate) | |
982 | { | |
983 | tree func, arg; | |
984 | tree args; | |
985 | ||
986 | /* Ignore any UNSAVE_EXPR. */ | |
987 | if (TREE_CODE (cleanup) == UNSAVE_EXPR) | |
988 | cleanup = TREE_OPERAND (cleanup, 0); | |
989 | ||
990 | /* Further, it only applies if the action is a call, if there | |
991 | are 2 arguments, and if the second argument is 2. */ | |
992 | ||
993 | if (TREE_CODE (cleanup) == CALL_EXPR | |
994 | && (args = TREE_OPERAND (cleanup, 1)) | |
995 | && (func = TREE_OPERAND (cleanup, 0)) | |
996 | && (arg = TREE_VALUE (args)) | |
997 | && (args = TREE_CHAIN (args)) | |
998 | ||
999 | /* is the second argument 2? */ | |
1000 | && TREE_CODE (TREE_VALUE (args)) == INTEGER_CST | |
1001 | && TREE_INT_CST_LOW (TREE_VALUE (args)) == 2 | |
1002 | && TREE_INT_CST_HIGH (TREE_VALUE (args)) == 0 | |
1003 | ||
1004 | /* Make sure there are no other arguments. */ | |
1005 | && TREE_CHAIN (args) == NULL_TREE) | |
1006 | { | |
1007 | /* Arrange for returns and gotos to pop the entry we make on the | |
1008 | dynamic cleanup stack. */ | |
4c581243 | 1009 | expand_dcc_cleanup (decl); |
27a36778 MS |
1010 | start_dynamic_cleanup (func, arg); |
1011 | return 1; | |
1012 | } | |
1013 | } | |
1014 | ||
4c581243 | 1015 | expand_eh_region_start_for_decl (decl); |
9762d48d | 1016 | ehstack.top->entry->finalization = cleanup; |
27a36778 MS |
1017 | |
1018 | return 0; | |
1019 | } | |
1020 | ||
4c581243 MS |
1021 | /* Just like expand_eh_region_start, except if a cleanup action is |
1022 | entered on the cleanup chain, the TREE_PURPOSE of the element put | |
1023 | on the chain is DECL. DECL should be the associated VAR_DECL, if | |
1024 | any, otherwise it should be NULL_TREE. */ | |
4956d07c MS |
1025 | |
1026 | void | |
4c581243 MS |
1027 | expand_eh_region_start_for_decl (decl) |
1028 | tree decl; | |
4956d07c MS |
1029 | { |
1030 | rtx note; | |
1031 | ||
1032 | /* This is the old code. */ | |
1033 | if (! doing_eh (0)) | |
1034 | return; | |
1035 | ||
27a36778 MS |
1036 | if (exceptions_via_longjmp) |
1037 | { | |
1038 | /* We need a new block to record the start and end of the | |
1039 | dynamic handler chain. We could always do this, but we | |
1040 | really want to permit jumping into such a block, and we want | |
1041 | to avoid any errors or performance impact in the SJ EH code | |
1042 | for now. */ | |
1043 | expand_start_bindings (0); | |
1044 | ||
1045 | /* But we don't need or want a new temporary level. */ | |
1046 | pop_temp_slots (); | |
1047 | ||
1048 | /* Mark this block as created by expand_eh_region_start. This | |
1049 | is so that we can pop the block with expand_end_bindings | |
1050 | automatically. */ | |
1051 | mark_block_as_eh_region (); | |
1052 | ||
1053 | /* Arrange for returns and gotos to pop the entry we make on the | |
1054 | dynamic handler stack. */ | |
4c581243 | 1055 | expand_dhc_cleanup (decl); |
27a36778 | 1056 | } |
4956d07c | 1057 | |
478b0752 | 1058 | push_eh_entry (&ehstack); |
9ad8a5f0 MS |
1059 | note = emit_note (NULL_PTR, NOTE_INSN_EH_REGION_BEG); |
1060 | NOTE_BLOCK_NUMBER (note) | |
1061 | = CODE_LABEL_NUMBER (ehstack.top->entry->exception_handler_label); | |
27a36778 MS |
1062 | if (exceptions_via_longjmp) |
1063 | start_dynamic_handler (); | |
4956d07c MS |
1064 | } |
1065 | ||
4c581243 MS |
1066 | /* Start an exception handling region. All instructions emitted after |
1067 | this point are considered to be part of the region until | |
1068 | expand_eh_region_end is invoked. */ | |
1069 | ||
1070 | void | |
1071 | expand_eh_region_start () | |
1072 | { | |
1073 | expand_eh_region_start_for_decl (NULL_TREE); | |
1074 | } | |
1075 | ||
27a36778 MS |
1076 | /* End an exception handling region. The information about the region |
1077 | is found on the top of ehstack. | |
12670d88 RK |
1078 | |
1079 | HANDLER is either the cleanup for the exception region, or if we're | |
1080 | marking the end of a try block, HANDLER is integer_zero_node. | |
1081 | ||
27a36778 | 1082 | HANDLER will be transformed to rtl when expand_leftover_cleanups |
abeeec2a | 1083 | is invoked. */ |
4956d07c MS |
1084 | |
1085 | void | |
1086 | expand_eh_region_end (handler) | |
1087 | tree handler; | |
1088 | { | |
4956d07c | 1089 | struct eh_entry *entry; |
9ad8a5f0 | 1090 | rtx note; |
4956d07c MS |
1091 | |
1092 | if (! doing_eh (0)) | |
1093 | return; | |
1094 | ||
1095 | entry = pop_eh_entry (&ehstack); | |
1096 | ||
9ad8a5f0 MS |
1097 | note = emit_note (NULL_PTR, NOTE_INSN_EH_REGION_END); |
1098 | NOTE_BLOCK_NUMBER (note) | |
1099 | = CODE_LABEL_NUMBER (entry->exception_handler_label); | |
27a36778 MS |
1100 | if (exceptions_via_longjmp == 0) |
1101 | { | |
478b0752 | 1102 | rtx label; |
4956d07c | 1103 | |
478b0752 MS |
1104 | label = gen_label_rtx (); |
1105 | emit_jump (label); | |
1106 | ||
1107 | /* Emit a label marking the end of this exception region that | |
1108 | is used for rethrowing into the outer context. */ | |
1109 | emit_label (entry->outer_context); | |
4956d07c | 1110 | |
27a36778 MS |
1111 | /* Put in something that takes up space, as otherwise the end |
1112 | address for this EH region could have the exact same address as | |
1113 | its outer region. This would cause us to miss the fact that | |
1114 | resuming exception handling with this PC value would be inside | |
1115 | the outer region. */ | |
1116 | emit_insn (gen_nop ()); | |
478b0752 MS |
1117 | emit_barrier (); |
1118 | emit_label (label); | |
27a36778 | 1119 | } |
4956d07c MS |
1120 | |
1121 | entry->finalization = handler; | |
1122 | ||
1123 | enqueue_eh_entry (&ehqueue, entry); | |
1124 | ||
27a36778 MS |
1125 | /* If we have already started ending the bindings, don't recurse. |
1126 | This only happens when exceptions_via_longjmp is true. */ | |
1127 | if (is_eh_region ()) | |
1128 | { | |
1129 | /* Because we don't need or want a new temporary level and | |
1130 | because we didn't create one in expand_eh_region_start, | |
1131 | create a fake one now to avoid removing one in | |
1132 | expand_end_bindings. */ | |
1133 | push_temp_slots (); | |
1134 | ||
1135 | mark_block_as_not_eh_region (); | |
1136 | ||
1137 | /* Maybe do this to prevent jumping in and so on... */ | |
1138 | expand_end_bindings (NULL_TREE, 0, 0); | |
1139 | } | |
4956d07c MS |
1140 | } |
1141 | ||
9762d48d JM |
1142 | /* End the EH region for a goto fixup. We only need them in the region-based |
1143 | EH scheme. */ | |
1144 | ||
1145 | void | |
1146 | expand_fixup_region_start () | |
1147 | { | |
1148 | if (! doing_eh (0) || exceptions_via_longjmp) | |
1149 | return; | |
1150 | ||
1151 | expand_eh_region_start (); | |
1152 | } | |
1153 | ||
1154 | /* End the EH region for a goto fixup. CLEANUP is the cleanup we just | |
1155 | expanded; to avoid running it twice if it throws, we look through the | |
1156 | ehqueue for a matching region and rethrow from its outer_context. */ | |
1157 | ||
1158 | void | |
1159 | expand_fixup_region_end (cleanup) | |
1160 | tree cleanup; | |
1161 | { | |
1162 | tree t; | |
1163 | struct eh_node *node; | |
1164 | int yes; | |
1165 | ||
1166 | if (! doing_eh (0) || exceptions_via_longjmp) | |
1167 | return; | |
1168 | ||
1169 | for (node = ehstack.top; node && node->entry->finalization != cleanup; ) | |
1170 | node = node->chain; | |
1171 | if (node == 0) | |
1172 | for (node = ehqueue.head; node && node->entry->finalization != cleanup; ) | |
1173 | node = node->chain; | |
1174 | if (node == 0) | |
1175 | abort (); | |
1176 | ||
1177 | yes = suspend_momentary (); | |
1178 | ||
1179 | t = build (RTL_EXPR, void_type_node, NULL_RTX, const0_rtx); | |
1180 | TREE_SIDE_EFFECTS (t) = 1; | |
1181 | do_pending_stack_adjust (); | |
1182 | start_sequence_for_rtl_expr (t); | |
1183 | expand_internal_throw (node->entry->outer_context); | |
1184 | do_pending_stack_adjust (); | |
1185 | RTL_EXPR_SEQUENCE (t) = get_insns (); | |
1186 | end_sequence (); | |
1187 | ||
1188 | resume_momentary (yes); | |
1189 | ||
1190 | expand_eh_region_end (t); | |
1191 | } | |
1192 | ||
27a36778 MS |
1193 | /* If we are using the setjmp/longjmp EH codegen method, we emit a |
1194 | call to __sjthrow. | |
1195 | ||
1196 | Otherwise, we emit a call to __throw and note that we threw | |
1197 | something, so we know we need to generate the necessary code for | |
1198 | __throw. | |
12670d88 RK |
1199 | |
1200 | Before invoking throw, the __eh_pc variable must have been set up | |
1201 | to contain the PC being thrown from. This address is used by | |
27a36778 | 1202 | __throw to determine which exception region (if any) is |
abeeec2a | 1203 | responsible for handling the exception. */ |
4956d07c | 1204 | |
27a36778 | 1205 | void |
4956d07c MS |
1206 | emit_throw () |
1207 | { | |
27a36778 MS |
1208 | if (exceptions_via_longjmp) |
1209 | { | |
1210 | emit_library_call (sjthrow_libfunc, 0, VOIDmode, 0); | |
1211 | } | |
1212 | else | |
1213 | { | |
4956d07c | 1214 | #ifdef JUMP_TO_THROW |
27a36778 | 1215 | emit_indirect_jump (throw_libfunc); |
4956d07c | 1216 | #else |
ca55abae JM |
1217 | #ifndef DWARF2_UNWIND_INFO |
1218 | /* Prevent assemble_external from doing anything with this symbol. */ | |
27a36778 | 1219 | SYMBOL_REF_USED (throw_libfunc) = 1; |
ca55abae | 1220 | #endif |
27a36778 | 1221 | emit_library_call (throw_libfunc, 0, VOIDmode, 0); |
4956d07c | 1222 | #endif |
27a36778 MS |
1223 | throw_used = 1; |
1224 | } | |
4956d07c MS |
1225 | emit_barrier (); |
1226 | } | |
1227 | ||
12670d88 | 1228 | /* An internal throw with an indirect CONTEXT we want to throw from. |
abeeec2a | 1229 | CONTEXT evaluates to the context of the throw. */ |
4956d07c | 1230 | |
12670d88 | 1231 | static void |
4956d07c MS |
1232 | expand_internal_throw_indirect (context) |
1233 | rtx context; | |
1234 | { | |
843e8335 | 1235 | assemble_external (eh_saved_pc); |
4956d07c MS |
1236 | emit_move_insn (eh_saved_pc_rtx, context); |
1237 | emit_throw (); | |
1238 | } | |
1239 | ||
12670d88 RK |
1240 | /* An internal throw with a direct CONTEXT we want to throw from. |
1241 | CONTEXT must be a label; its address will be used as the context of | |
abeeec2a | 1242 | the throw. */ |
4956d07c MS |
1243 | |
1244 | void | |
1245 | expand_internal_throw (context) | |
1246 | rtx context; | |
1247 | { | |
1248 | expand_internal_throw_indirect (gen_rtx (LABEL_REF, Pmode, context)); | |
1249 | } | |
1250 | ||
1251 | /* Called from expand_exception_blocks and expand_end_catch_block to | |
27a36778 | 1252 | emit any pending handlers/cleanups queued from expand_eh_region_end. */ |
4956d07c MS |
1253 | |
1254 | void | |
1255 | expand_leftover_cleanups () | |
1256 | { | |
1257 | struct eh_entry *entry; | |
1258 | ||
1259 | while ((entry = dequeue_eh_entry (&ehqueue)) != 0) | |
1260 | { | |
1261 | rtx prev; | |
1262 | ||
12670d88 RK |
1263 | /* A leftover try block. Shouldn't be one here. */ |
1264 | if (entry->finalization == integer_zero_node) | |
1265 | abort (); | |
1266 | ||
abeeec2a | 1267 | /* Output the label for the start of the exception handler. */ |
4956d07c MS |
1268 | emit_label (entry->exception_handler_label); |
1269 | ||
f51430ed MS |
1270 | #ifdef HAVE_exception_receiver |
1271 | if (! exceptions_via_longjmp) | |
1272 | if (HAVE_exception_receiver) | |
1273 | emit_insn (gen_exception_receiver ()); | |
1274 | #endif | |
1275 | ||
05f5b2cd MS |
1276 | #ifdef HAVE_nonlocal_goto_receiver |
1277 | if (! exceptions_via_longjmp) | |
1278 | if (HAVE_nonlocal_goto_receiver) | |
1279 | emit_insn (gen_nonlocal_goto_receiver ()); | |
1280 | #endif | |
1281 | ||
abeeec2a | 1282 | /* And now generate the insns for the handler. */ |
4956d07c MS |
1283 | expand_expr (entry->finalization, const0_rtx, VOIDmode, 0); |
1284 | ||
1285 | prev = get_last_insn (); | |
27a36778 | 1286 | if (prev == NULL || GET_CODE (prev) != BARRIER) |
4956d07c | 1287 | { |
27a36778 MS |
1288 | if (exceptions_via_longjmp) |
1289 | emit_throw (); | |
1290 | else | |
1291 | { | |
478b0752 MS |
1292 | /* The below can be optimized away, and we could just |
1293 | fall into the next EH handler, if we are certain they | |
1294 | are nested. */ | |
27a36778 MS |
1295 | /* Emit code to throw to the outer context if we fall off |
1296 | the end of the handler. */ | |
478b0752 | 1297 | expand_internal_throw (entry->outer_context); |
27a36778 | 1298 | } |
4956d07c MS |
1299 | } |
1300 | ||
c7ae64f2 | 1301 | do_pending_stack_adjust (); |
4956d07c MS |
1302 | free (entry); |
1303 | } | |
1304 | } | |
1305 | ||
abeeec2a | 1306 | /* Called at the start of a block of try statements. */ |
12670d88 RK |
1307 | void |
1308 | expand_start_try_stmts () | |
1309 | { | |
1310 | if (! doing_eh (1)) | |
1311 | return; | |
1312 | ||
1313 | expand_eh_region_start (); | |
1314 | } | |
1315 | ||
1316 | /* Generate RTL for the start of a group of catch clauses. | |
1317 | ||
1318 | It is responsible for starting a new instruction sequence for the | |
1319 | instructions in the catch block, and expanding the handlers for the | |
1320 | internally-generated exception regions nested within the try block | |
abeeec2a | 1321 | corresponding to this catch block. */ |
4956d07c MS |
1322 | |
1323 | void | |
1324 | expand_start_all_catch () | |
1325 | { | |
1326 | struct eh_entry *entry; | |
1327 | tree label; | |
1328 | ||
1329 | if (! doing_eh (1)) | |
1330 | return; | |
1331 | ||
1418bb67 JM |
1332 | push_label_entry (&outer_context_label_stack, |
1333 | ehstack.top->entry->outer_context, NULL_TREE); | |
1334 | ||
abeeec2a | 1335 | /* End the try block. */ |
12670d88 RK |
1336 | expand_eh_region_end (integer_zero_node); |
1337 | ||
4956d07c MS |
1338 | emit_line_note (input_filename, lineno); |
1339 | label = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); | |
1340 | ||
12670d88 RK |
1341 | /* The label for the exception handling block that we will save. |
1342 | This is Lresume in the documention. */ | |
4956d07c MS |
1343 | expand_label (label); |
1344 | ||
27a36778 MS |
1345 | if (exceptions_via_longjmp == 0) |
1346 | { | |
1347 | /* Put in something that takes up space, as otherwise the end | |
1348 | address for the EH region could have the exact same address as | |
1349 | the outer region, causing us to miss the fact that resuming | |
1350 | exception handling with this PC value would be inside the outer | |
1351 | region. */ | |
1352 | emit_insn (gen_nop ()); | |
1353 | } | |
4956d07c | 1354 | |
12670d88 | 1355 | /* Push the label that points to where normal flow is resumed onto |
abeeec2a | 1356 | the top of the label stack. */ |
4956d07c MS |
1357 | push_label_entry (&caught_return_label_stack, NULL_RTX, label); |
1358 | ||
1359 | /* Start a new sequence for all the catch blocks. We will add this | |
12670d88 | 1360 | to the global sequence catch_clauses when we have completed all |
4956d07c MS |
1361 | the handlers in this handler-seq. */ |
1362 | start_sequence (); | |
1363 | ||
1364 | while (1) | |
1365 | { | |
1366 | rtx prev; | |
1367 | ||
1368 | entry = dequeue_eh_entry (&ehqueue); | |
12670d88 RK |
1369 | /* Emit the label for the exception handler for this region, and |
1370 | expand the code for the handler. | |
1371 | ||
1372 | Note that a catch region is handled as a side-effect here; | |
1373 | for a try block, entry->finalization will contain | |
1374 | integer_zero_node, so no code will be generated in the | |
1375 | expand_expr call below. But, the label for the handler will | |
1376 | still be emitted, so any code emitted after this point will | |
abeeec2a | 1377 | end up being the handler. */ |
4956d07c | 1378 | emit_label (entry->exception_handler_label); |
4956d07c | 1379 | |
f51430ed MS |
1380 | #ifdef HAVE_exception_receiver |
1381 | if (! exceptions_via_longjmp) | |
1382 | if (HAVE_exception_receiver) | |
1383 | emit_insn (gen_exception_receiver ()); | |
1384 | #endif | |
1385 | ||
05f5b2cd MS |
1386 | #ifdef HAVE_nonlocal_goto_receiver |
1387 | if (! exceptions_via_longjmp) | |
1388 | if (HAVE_nonlocal_goto_receiver) | |
1389 | emit_insn (gen_nonlocal_goto_receiver ()); | |
1390 | #endif | |
1391 | ||
12670d88 | 1392 | /* When we get down to the matching entry for this try block, stop. */ |
4956d07c | 1393 | if (entry->finalization == integer_zero_node) |
12670d88 | 1394 | { |
abeeec2a | 1395 | /* Don't forget to free this entry. */ |
12670d88 RK |
1396 | free (entry); |
1397 | break; | |
1398 | } | |
4956d07c | 1399 | |
27a36778 MS |
1400 | /* And now generate the insns for the handler. */ |
1401 | expand_expr (entry->finalization, const0_rtx, VOIDmode, 0); | |
1402 | ||
4956d07c | 1403 | prev = get_last_insn (); |
12670d88 | 1404 | if (prev == NULL || GET_CODE (prev) != BARRIER) |
4956d07c | 1405 | { |
27a36778 MS |
1406 | if (exceptions_via_longjmp) |
1407 | emit_throw (); | |
1408 | else | |
1409 | { | |
1410 | /* Code to throw out to outer context when we fall off end | |
1411 | of the handler. We can't do this here for catch blocks, | |
1412 | so it's done in expand_end_all_catch instead. | |
12670d88 | 1413 | |
27a36778 MS |
1414 | The below can be optimized away (and we could just fall |
1415 | into the next EH handler) if we are certain they are | |
1416 | nested. */ | |
12670d88 | 1417 | |
478b0752 | 1418 | expand_internal_throw (entry->outer_context); |
27a36778 | 1419 | } |
4956d07c | 1420 | } |
f45ebe47 | 1421 | do_pending_stack_adjust (); |
4956d07c MS |
1422 | free (entry); |
1423 | } | |
1424 | } | |
1425 | ||
12670d88 RK |
1426 | /* Finish up the catch block. At this point all the insns for the |
1427 | catch clauses have already been generated, so we only have to add | |
1428 | them to the catch_clauses list. We also want to make sure that if | |
1429 | we fall off the end of the catch clauses that we rethrow to the | |
abeeec2a | 1430 | outer EH region. */ |
4956d07c MS |
1431 | |
1432 | void | |
1433 | expand_end_all_catch () | |
1434 | { | |
1435 | rtx new_catch_clause; | |
1436 | ||
1437 | if (! doing_eh (1)) | |
1438 | return; | |
1439 | ||
27a36778 MS |
1440 | if (exceptions_via_longjmp) |
1441 | emit_throw (); | |
1442 | else | |
1443 | { | |
1444 | /* Code to throw out to outer context, if we fall off end of catch | |
1445 | handlers. This is rethrow (Lresume, same id, same obj) in the | |
1446 | documentation. We use Lresume because we know that it will throw | |
1447 | to the correct context. | |
12670d88 | 1448 | |
27a36778 MS |
1449 | In other words, if the catch handler doesn't exit or return, we |
1450 | do a "throw" (using the address of Lresume as the point being | |
1451 | thrown from) so that the outer EH region can then try to process | |
1452 | the exception. */ | |
12670d88 | 1453 | |
1418bb67 | 1454 | expand_internal_throw (outer_context_label_stack->u.rlabel); |
27a36778 | 1455 | } |
4956d07c MS |
1456 | |
1457 | /* Now we have the complete catch sequence. */ | |
1458 | new_catch_clause = get_insns (); | |
1459 | end_sequence (); | |
1460 | ||
1461 | /* This level of catch blocks is done, so set up the successful | |
1462 | catch jump label for the next layer of catch blocks. */ | |
1463 | pop_label_entry (&caught_return_label_stack); | |
1418bb67 | 1464 | pop_label_entry (&outer_context_label_stack); |
4956d07c MS |
1465 | |
1466 | /* Add the new sequence of catches to the main one for this function. */ | |
1467 | push_to_sequence (catch_clauses); | |
1468 | emit_insns (new_catch_clause); | |
1469 | catch_clauses = get_insns (); | |
1470 | end_sequence (); | |
1471 | ||
1472 | /* Here we fall through into the continuation code. */ | |
1473 | } | |
1474 | ||
12670d88 | 1475 | /* End all the pending exception regions on protect_list. The handlers |
27a36778 | 1476 | will be emitted when expand_leftover_cleanups is invoked. */ |
4956d07c MS |
1477 | |
1478 | void | |
1479 | end_protect_partials () | |
1480 | { | |
1481 | while (protect_list) | |
1482 | { | |
1483 | expand_eh_region_end (TREE_VALUE (protect_list)); | |
1484 | protect_list = TREE_CHAIN (protect_list); | |
1485 | } | |
1486 | } | |
27a36778 MS |
1487 | |
1488 | /* Arrange for __terminate to be called if there is an unhandled throw | |
1489 | from within E. */ | |
1490 | ||
1491 | tree | |
1492 | protect_with_terminate (e) | |
1493 | tree e; | |
1494 | { | |
1495 | /* We only need to do this when using setjmp/longjmp EH and the | |
1496 | language requires it, as otherwise we protect all of the handlers | |
1497 | at once, if we need to. */ | |
1498 | if (exceptions_via_longjmp && protect_cleanup_actions_with_terminate) | |
1499 | { | |
1500 | tree handler, result; | |
1501 | ||
1502 | /* All cleanups must be on the function_obstack. */ | |
1503 | push_obstacks_nochange (); | |
1504 | resume_temporary_allocation (); | |
1505 | ||
1506 | handler = make_node (RTL_EXPR); | |
1507 | TREE_TYPE (handler) = void_type_node; | |
1508 | RTL_EXPR_RTL (handler) = const0_rtx; | |
1509 | TREE_SIDE_EFFECTS (handler) = 1; | |
1510 | start_sequence_for_rtl_expr (handler); | |
1511 | ||
1512 | emit_library_call (terminate_libfunc, 0, VOIDmode, 0); | |
1513 | emit_barrier (); | |
1514 | ||
1515 | RTL_EXPR_SEQUENCE (handler) = get_insns (); | |
1516 | end_sequence (); | |
1517 | ||
1518 | result = build (TRY_CATCH_EXPR, TREE_TYPE (e), e, handler); | |
1519 | TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (e); | |
1520 | TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (e); | |
1521 | TREE_READONLY (result) = TREE_READONLY (e); | |
1522 | ||
1523 | pop_obstacks (); | |
1524 | ||
1525 | e = result; | |
1526 | } | |
1527 | ||
1528 | return e; | |
1529 | } | |
4956d07c MS |
1530 | \f |
1531 | /* The exception table that we build that is used for looking up and | |
12670d88 RK |
1532 | dispatching exceptions, the current number of entries, and its |
1533 | maximum size before we have to extend it. | |
1534 | ||
1535 | The number in eh_table is the code label number of the exception | |
27a36778 MS |
1536 | handler for the region. This is added by add_eh_table_entry and |
1537 | used by output_exception_table_entry. */ | |
12670d88 | 1538 | |
4956d07c MS |
1539 | static int *eh_table; |
1540 | static int eh_table_size; | |
1541 | static int eh_table_max_size; | |
1542 | ||
1543 | /* Note the need for an exception table entry for region N. If we | |
12670d88 RK |
1544 | don't need to output an explicit exception table, avoid all of the |
1545 | extra work. | |
1546 | ||
1547 | Called from final_scan_insn when a NOTE_INSN_EH_REGION_BEG is seen. | |
1548 | N is the NOTE_BLOCK_NUMBER of the note, which comes from the code | |
abeeec2a | 1549 | label number of the exception handler for the region. */ |
4956d07c MS |
1550 | |
1551 | void | |
1552 | add_eh_table_entry (n) | |
1553 | int n; | |
1554 | { | |
1555 | #ifndef OMIT_EH_TABLE | |
1556 | if (eh_table_size >= eh_table_max_size) | |
1557 | { | |
1558 | if (eh_table) | |
1559 | { | |
1560 | eh_table_max_size += eh_table_max_size>>1; | |
1561 | ||
1562 | if (eh_table_max_size < 0) | |
1563 | abort (); | |
1564 | ||
ca55abae JM |
1565 | eh_table = (int *) xrealloc (eh_table, |
1566 | eh_table_max_size * sizeof (int)); | |
4956d07c MS |
1567 | } |
1568 | else | |
1569 | { | |
1570 | eh_table_max_size = 252; | |
1571 | eh_table = (int *) xmalloc (eh_table_max_size * sizeof (int)); | |
1572 | } | |
1573 | } | |
1574 | eh_table[eh_table_size++] = n; | |
1575 | #endif | |
1576 | } | |
1577 | ||
12670d88 RK |
1578 | /* Return a non-zero value if we need to output an exception table. |
1579 | ||
1580 | On some platforms, we don't have to output a table explicitly. | |
1581 | This routine doesn't mean we don't have one. */ | |
4956d07c MS |
1582 | |
1583 | int | |
1584 | exception_table_p () | |
1585 | { | |
1586 | if (eh_table) | |
1587 | return 1; | |
1588 | ||
1589 | return 0; | |
1590 | } | |
1591 | ||
ca55abae JM |
1592 | /* 1 if we need a static constructor to register EH table info. */ |
1593 | ||
1594 | int | |
1595 | register_exception_table_p () | |
1596 | { | |
1597 | #if defined (DWARF2_UNWIND_INFO) | |
1598 | return 0; | |
1599 | #endif | |
1600 | ||
1601 | return exception_table_p (); | |
1602 | } | |
1603 | ||
12670d88 RK |
1604 | /* Output the entry of the exception table corresponding to to the |
1605 | exception region numbered N to file FILE. | |
1606 | ||
1607 | N is the code label number corresponding to the handler of the | |
abeeec2a | 1608 | region. */ |
4956d07c MS |
1609 | |
1610 | static void | |
1611 | output_exception_table_entry (file, n) | |
1612 | FILE *file; | |
1613 | int n; | |
1614 | { | |
1615 | char buf[256]; | |
1616 | rtx sym; | |
1617 | ||
1618 | ASM_GENERATE_INTERNAL_LABEL (buf, "LEHB", n); | |
1619 | sym = gen_rtx (SYMBOL_REF, Pmode, buf); | |
1620 | assemble_integer (sym, POINTER_SIZE / BITS_PER_UNIT, 1); | |
1621 | ||
1622 | ASM_GENERATE_INTERNAL_LABEL (buf, "LEHE", n); | |
1623 | sym = gen_rtx (SYMBOL_REF, Pmode, buf); | |
1624 | assemble_integer (sym, POINTER_SIZE / BITS_PER_UNIT, 1); | |
1625 | ||
1626 | ASM_GENERATE_INTERNAL_LABEL (buf, "L", n); | |
1627 | sym = gen_rtx (SYMBOL_REF, Pmode, buf); | |
1628 | assemble_integer (sym, POINTER_SIZE / BITS_PER_UNIT, 1); | |
1629 | ||
1630 | putc ('\n', file); /* blank line */ | |
1631 | } | |
1632 | ||
abeeec2a | 1633 | /* Output the exception table if we have and need one. */ |
4956d07c MS |
1634 | |
1635 | void | |
1636 | output_exception_table () | |
1637 | { | |
1638 | int i; | |
1639 | extern FILE *asm_out_file; | |
1640 | ||
ca55abae | 1641 | if (! doing_eh (0) || ! eh_table) |
4956d07c MS |
1642 | return; |
1643 | ||
1644 | exception_section (); | |
1645 | ||
1646 | /* Beginning marker for table. */ | |
1647 | assemble_align (GET_MODE_ALIGNMENT (ptr_mode)); | |
1648 | assemble_label ("__EXCEPTION_TABLE__"); | |
1649 | ||
4956d07c MS |
1650 | for (i = 0; i < eh_table_size; ++i) |
1651 | output_exception_table_entry (asm_out_file, eh_table[i]); | |
1652 | ||
1653 | free (eh_table); | |
1654 | ||
1655 | /* Ending marker for table. */ | |
4956d07c MS |
1656 | assemble_integer (constm1_rtx, POINTER_SIZE / BITS_PER_UNIT, 1); |
1657 | assemble_integer (constm1_rtx, POINTER_SIZE / BITS_PER_UNIT, 1); | |
1658 | assemble_integer (constm1_rtx, POINTER_SIZE / BITS_PER_UNIT, 1); | |
1659 | putc ('\n', asm_out_file); /* blank line */ | |
1660 | } | |
1661 | ||
1662 | /* Generate code to initialize the exception table at program startup | |
1663 | time. */ | |
1664 | ||
1665 | void | |
1666 | register_exception_table () | |
1667 | { | |
1668 | emit_library_call (gen_rtx (SYMBOL_REF, Pmode, "__register_exceptions"), 0, | |
1669 | VOIDmode, 1, | |
1670 | gen_rtx (SYMBOL_REF, Pmode, "__EXCEPTION_TABLE__"), | |
1671 | Pmode); | |
1672 | } | |
1673 | \f | |
12670d88 | 1674 | /* Emit the RTL for the start of the per-function unwinder for the |
27a36778 | 1675 | current function. See emit_unwinder for further information. |
12670d88 RK |
1676 | |
1677 | DOESNT_NEED_UNWINDER is a target-specific macro that determines if | |
1678 | the current function actually needs a per-function unwinder or not. | |
abeeec2a | 1679 | By default, all functions need one. */ |
4956d07c MS |
1680 | |
1681 | void | |
1682 | start_eh_unwinder () | |
1683 | { | |
1684 | #ifdef DOESNT_NEED_UNWINDER | |
1685 | if (DOESNT_NEED_UNWINDER) | |
1686 | return; | |
1687 | #endif | |
1688 | ||
27a36778 MS |
1689 | /* If we are using the setjmp/longjmp implementation, we don't need a |
1690 | per function unwinder. */ | |
1691 | ||
1692 | if (exceptions_via_longjmp) | |
1693 | return; | |
1694 | ||
ca55abae JM |
1695 | #ifdef DWARF2_UNWIND_INFO |
1696 | return; | |
1697 | #endif | |
1698 | ||
4956d07c MS |
1699 | expand_eh_region_start (); |
1700 | } | |
1701 | ||
12670d88 | 1702 | /* Emit insns for the end of the per-function unwinder for the |
4956d07c MS |
1703 | current function. */ |
1704 | ||
1705 | void | |
1706 | end_eh_unwinder () | |
1707 | { | |
1708 | tree expr; | |
1709 | rtx return_val_rtx, ret_val, label, end, insns; | |
1710 | ||
1711 | if (! doing_eh (0)) | |
1712 | return; | |
1713 | ||
1714 | #ifdef DOESNT_NEED_UNWINDER | |
1715 | if (DOESNT_NEED_UNWINDER) | |
1716 | return; | |
1717 | #endif | |
1718 | ||
27a36778 MS |
1719 | /* If we are using the setjmp/longjmp implementation, we don't need a |
1720 | per function unwinder. */ | |
1721 | ||
1722 | if (exceptions_via_longjmp) | |
1723 | return; | |
1724 | ||
ca55abae JM |
1725 | #ifdef DWARF2_UNWIND_INFO |
1726 | return; | |
1727 | #else /* DWARF2_UNWIND_INFO */ | |
1728 | ||
843e8335 MS |
1729 | assemble_external (eh_saved_pc); |
1730 | ||
4956d07c MS |
1731 | expr = make_node (RTL_EXPR); |
1732 | TREE_TYPE (expr) = void_type_node; | |
1733 | RTL_EXPR_RTL (expr) = const0_rtx; | |
1734 | TREE_SIDE_EFFECTS (expr) = 1; | |
1735 | start_sequence_for_rtl_expr (expr); | |
1736 | ||
12670d88 | 1737 | /* ret_val will contain the address of the code where the call |
abeeec2a | 1738 | to the current function occurred. */ |
4956d07c MS |
1739 | ret_val = expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS, |
1740 | 0, hard_frame_pointer_rtx); | |
1741 | return_val_rtx = copy_to_reg (ret_val); | |
1742 | ||
12670d88 | 1743 | /* Get the address we need to use to determine what exception |
abeeec2a | 1744 | handler should be invoked, and store it in __eh_pc. */ |
4956d07c | 1745 | return_val_rtx = eh_outer_context (return_val_rtx); |
6020d360 JM |
1746 | return_val_rtx = expand_binop (Pmode, sub_optab, return_val_rtx, GEN_INT (1), |
1747 | NULL_RTX, 0, OPTAB_LIB_WIDEN); | |
4956d07c MS |
1748 | emit_move_insn (eh_saved_pc_rtx, return_val_rtx); |
1749 | ||
12670d88 | 1750 | /* Either set things up so we do a return directly to __throw, or |
abeeec2a | 1751 | we return here instead. */ |
4956d07c MS |
1752 | #ifdef JUMP_TO_THROW |
1753 | emit_move_insn (ret_val, throw_libfunc); | |
1754 | #else | |
1755 | label = gen_label_rtx (); | |
1756 | emit_move_insn (ret_val, gen_rtx (LABEL_REF, Pmode, label)); | |
1757 | #endif | |
1758 | ||
1759 | #ifdef RETURN_ADDR_OFFSET | |
1760 | return_val_rtx = plus_constant (ret_val, -RETURN_ADDR_OFFSET); | |
1761 | if (return_val_rtx != ret_val) | |
1762 | emit_move_insn (ret_val, return_val_rtx); | |
1763 | #endif | |
1764 | ||
1765 | end = gen_label_rtx (); | |
1766 | emit_jump (end); | |
1767 | ||
1768 | RTL_EXPR_SEQUENCE (expr) = get_insns (); | |
1769 | end_sequence (); | |
27a36778 | 1770 | |
4956d07c MS |
1771 | expand_eh_region_end (expr); |
1772 | ||
1773 | emit_jump (end); | |
1774 | ||
1775 | #ifndef JUMP_TO_THROW | |
1776 | emit_label (label); | |
1777 | emit_throw (); | |
1778 | #endif | |
1779 | ||
1780 | expand_leftover_cleanups (); | |
1781 | ||
1782 | emit_label (end); | |
16c81040 MS |
1783 | |
1784 | #ifdef HAVE_return | |
1785 | if (HAVE_return) | |
1786 | { | |
1787 | emit_jump_insn (gen_return ()); | |
1788 | emit_barrier (); | |
1789 | } | |
1790 | #endif | |
ca55abae | 1791 | #endif /* DWARF2_UNWIND_INFO */ |
4956d07c MS |
1792 | } |
1793 | ||
12670d88 RK |
1794 | /* If necessary, emit insns for the per function unwinder for the |
1795 | current function. Called after all the code that needs unwind | |
1796 | protection is output. | |
1797 | ||
1798 | The unwinder takes care of catching any exceptions that have not | |
1799 | been previously caught within the function, unwinding the stack to | |
1800 | the next frame, and rethrowing using the address of the current | |
1801 | function's caller as the context of the throw. | |
1802 | ||
1803 | On some platforms __throw can do this by itself (or with the help | |
1804 | of __unwind_function) so the per-function unwinder is | |
1805 | unnecessary. | |
1806 | ||
1807 | We cannot place the unwinder into the function until after we know | |
1808 | we are done inlining, as we don't want to have more than one | |
1809 | unwinder per non-inlined function. */ | |
4956d07c MS |
1810 | |
1811 | void | |
1812 | emit_unwinder () | |
1813 | { | |
12670d88 | 1814 | rtx insns, insn; |
4956d07c MS |
1815 | |
1816 | start_sequence (); | |
1817 | start_eh_unwinder (); | |
1818 | insns = get_insns (); | |
1819 | end_sequence (); | |
1820 | ||
12670d88 RK |
1821 | /* We place the start of the exception region associated with the |
1822 | per function unwinder at the top of the function. */ | |
4956d07c MS |
1823 | if (insns) |
1824 | emit_insns_after (insns, get_insns ()); | |
1825 | ||
12670d88 | 1826 | start_sequence (); |
4956d07c | 1827 | end_eh_unwinder (); |
12670d88 RK |
1828 | insns = get_insns (); |
1829 | end_sequence (); | |
1830 | ||
1831 | /* And we place the end of the exception region before the USE and | |
1832 | CLOBBER insns that may come at the end of the function. */ | |
1833 | if (insns == 0) | |
1834 | return; | |
1835 | ||
1836 | insn = get_last_insn (); | |
1837 | while (GET_CODE (insn) == NOTE | |
1838 | || (GET_CODE (insn) == INSN | |
1839 | && (GET_CODE (PATTERN (insn)) == USE | |
1840 | || GET_CODE (PATTERN (insn)) == CLOBBER))) | |
1841 | insn = PREV_INSN (insn); | |
1842 | ||
1843 | if (GET_CODE (insn) == CODE_LABEL | |
1844 | && GET_CODE (PREV_INSN (insn)) == BARRIER) | |
1845 | { | |
1846 | insn = PREV_INSN (insn); | |
1847 | } | |
1848 | else | |
1849 | { | |
1850 | rtx label = gen_label_rtx (); | |
1851 | emit_label_after (label, insn); | |
1852 | insn = emit_jump_insn_after (gen_jump (label), insn); | |
1853 | insn = emit_barrier_after (insn); | |
1854 | } | |
1855 | ||
1856 | emit_insns_after (insns, insn); | |
4956d07c MS |
1857 | } |
1858 | ||
12670d88 RK |
1859 | /* Scan the current insns and build a list of handler labels. The |
1860 | resulting list is placed in the global variable exception_handler_labels. | |
1861 | ||
1862 | It is called after the last exception handling region is added to | |
1863 | the current function (when the rtl is almost all built for the | |
1864 | current function) and before the jump optimization pass. */ | |
4956d07c MS |
1865 | |
1866 | void | |
1867 | find_exception_handler_labels () | |
1868 | { | |
1869 | rtx insn; | |
1870 | int max_labelno = max_label_num (); | |
1871 | int min_labelno = get_first_label_num (); | |
1872 | rtx *labels; | |
1873 | ||
1874 | exception_handler_labels = NULL_RTX; | |
1875 | ||
1876 | /* If we aren't doing exception handling, there isn't much to check. */ | |
1877 | if (! doing_eh (0)) | |
1878 | return; | |
1879 | ||
12670d88 | 1880 | /* Generate a handy reference to each label. */ |
4956d07c | 1881 | |
1d77fa53 BK |
1882 | /* We call xmalloc here instead of alloca; we did the latter in the past, |
1883 | but found that it can sometimes end up being asked to allocate space | |
1884 | for more than 1 million labels. */ | |
1885 | labels = (rtx *) xmalloc ((max_labelno - min_labelno) * sizeof (rtx)); | |
abeeec2a | 1886 | bzero ((char *) labels, (max_labelno - min_labelno) * sizeof (rtx)); |
12670d88 | 1887 | |
abeeec2a | 1888 | /* Arrange for labels to be indexed directly by CODE_LABEL_NUMBER. */ |
4956d07c MS |
1889 | labels -= min_labelno; |
1890 | ||
1891 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
1892 | { | |
1893 | if (GET_CODE (insn) == CODE_LABEL) | |
1894 | if (CODE_LABEL_NUMBER (insn) >= min_labelno | |
1895 | && CODE_LABEL_NUMBER (insn) < max_labelno) | |
1896 | labels[CODE_LABEL_NUMBER (insn)] = insn; | |
1897 | } | |
1898 | ||
12670d88 RK |
1899 | /* For each start of a region, add its label to the list. */ |
1900 | ||
4956d07c MS |
1901 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) |
1902 | { | |
1903 | if (GET_CODE (insn) == NOTE | |
1904 | && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG) | |
1905 | { | |
1906 | rtx label = NULL_RTX; | |
1907 | ||
1908 | if (NOTE_BLOCK_NUMBER (insn) >= min_labelno | |
1909 | && NOTE_BLOCK_NUMBER (insn) < max_labelno) | |
1910 | { | |
1911 | label = labels[NOTE_BLOCK_NUMBER (insn)]; | |
1912 | ||
1913 | if (label) | |
1914 | exception_handler_labels | |
1915 | = gen_rtx (EXPR_LIST, VOIDmode, | |
1916 | label, exception_handler_labels); | |
1917 | else | |
1918 | warning ("didn't find handler for EH region %d", | |
1919 | NOTE_BLOCK_NUMBER (insn)); | |
1920 | } | |
1921 | else | |
1922 | warning ("mismatched EH region %d", NOTE_BLOCK_NUMBER (insn)); | |
1923 | } | |
1924 | } | |
988cea7d | 1925 | |
3f34faec | 1926 | free (labels + min_labelno); |
4956d07c MS |
1927 | } |
1928 | ||
12670d88 RK |
1929 | /* Perform sanity checking on the exception_handler_labels list. |
1930 | ||
1931 | Can be called after find_exception_handler_labels is called to | |
1932 | build the list of exception handlers for the current function and | |
1933 | before we finish processing the current function. */ | |
4956d07c MS |
1934 | |
1935 | void | |
1936 | check_exception_handler_labels () | |
1937 | { | |
1938 | rtx insn, handler; | |
1939 | ||
1940 | /* If we aren't doing exception handling, there isn't much to check. */ | |
1941 | if (! doing_eh (0)) | |
1942 | return; | |
1943 | ||
12670d88 RK |
1944 | /* Ensure that the CODE_LABEL_NUMBER for the CODE_LABEL entry point |
1945 | in each handler corresponds to the CODE_LABEL_NUMBER of the | |
abeeec2a | 1946 | handler. */ |
12670d88 | 1947 | |
4956d07c MS |
1948 | for (handler = exception_handler_labels; |
1949 | handler; | |
1950 | handler = XEXP (handler, 1)) | |
1951 | { | |
1952 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) | |
1953 | { | |
1954 | if (GET_CODE (insn) == CODE_LABEL) | |
1955 | { | |
1956 | if (CODE_LABEL_NUMBER (insn) | |
1957 | == CODE_LABEL_NUMBER (XEXP (handler, 0))) | |
1958 | { | |
1959 | if (insn != XEXP (handler, 0)) | |
1960 | warning ("mismatched handler %d", | |
1961 | CODE_LABEL_NUMBER (insn)); | |
1962 | break; | |
1963 | } | |
1964 | } | |
1965 | } | |
1966 | if (insn == NULL_RTX) | |
1967 | warning ("handler not found %d", | |
1968 | CODE_LABEL_NUMBER (XEXP (handler, 0))); | |
1969 | } | |
1970 | ||
12670d88 RK |
1971 | /* Now go through and make sure that for each region there is a |
1972 | corresponding label. */ | |
4956d07c MS |
1973 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) |
1974 | { | |
1975 | if (GET_CODE (insn) == NOTE | |
27a36778 MS |
1976 | && (NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG |
1977 | || NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END)) | |
4956d07c MS |
1978 | { |
1979 | for (handler = exception_handler_labels; | |
1980 | handler; | |
1981 | handler = XEXP (handler, 1)) | |
1982 | { | |
1983 | if (CODE_LABEL_NUMBER (XEXP (handler, 0)) | |
1984 | == NOTE_BLOCK_NUMBER (insn)) | |
1985 | break; | |
1986 | } | |
1987 | if (handler == NULL_RTX) | |
1988 | warning ("region exists, no handler %d", | |
1989 | NOTE_BLOCK_NUMBER (insn)); | |
1990 | } | |
1991 | } | |
1992 | } | |
1993 | \f | |
1994 | /* This group of functions initializes the exception handling data | |
1995 | structures at the start of the compilation, initializes the data | |
12670d88 | 1996 | structures at the start of a function, and saves and restores the |
4956d07c MS |
1997 | exception handling data structures for the start/end of a nested |
1998 | function. */ | |
1999 | ||
2000 | /* Toplevel initialization for EH things. */ | |
2001 | ||
2002 | void | |
2003 | init_eh () | |
2004 | { | |
12670d88 | 2005 | /* Generate rtl to reference the variable in which the PC of the |
abeeec2a | 2006 | current context is saved. */ |
843e8335 MS |
2007 | tree type = build_pointer_type (make_node (VOID_TYPE)); |
2008 | ||
2009 | eh_saved_pc = build_decl (VAR_DECL, get_identifier ("__eh_pc"), type); | |
2010 | DECL_EXTERNAL (eh_saved_pc) = 1; | |
2011 | TREE_PUBLIC (eh_saved_pc) = 1; | |
2012 | make_decl_rtl (eh_saved_pc, NULL_PTR, 1); | |
2013 | eh_saved_pc_rtx = DECL_RTL (eh_saved_pc); | |
4956d07c MS |
2014 | } |
2015 | ||
abeeec2a | 2016 | /* Initialize the per-function EH information. */ |
4956d07c MS |
2017 | |
2018 | void | |
2019 | init_eh_for_function () | |
2020 | { | |
2021 | ehstack.top = 0; | |
2022 | ehqueue.head = ehqueue.tail = 0; | |
2023 | catch_clauses = NULL_RTX; | |
2024 | false_label_stack = 0; | |
2025 | caught_return_label_stack = 0; | |
2026 | protect_list = NULL_TREE; | |
27a36778 MS |
2027 | current_function_dhc = NULL_RTX; |
2028 | current_function_dcc = NULL_RTX; | |
4956d07c MS |
2029 | } |
2030 | ||
12670d88 RK |
2031 | /* Save some of the per-function EH info into the save area denoted by |
2032 | P. | |
2033 | ||
27a36778 | 2034 | This is currently called from save_stmt_status. */ |
4956d07c MS |
2035 | |
2036 | void | |
2037 | save_eh_status (p) | |
2038 | struct function *p; | |
2039 | { | |
3a88cbd1 JL |
2040 | if (p == NULL) |
2041 | abort (); | |
12670d88 | 2042 | |
4956d07c MS |
2043 | p->ehstack = ehstack; |
2044 | p->ehqueue = ehqueue; | |
2045 | p->catch_clauses = catch_clauses; | |
2046 | p->false_label_stack = false_label_stack; | |
2047 | p->caught_return_label_stack = caught_return_label_stack; | |
2048 | p->protect_list = protect_list; | |
27a36778 MS |
2049 | p->dhc = current_function_dhc; |
2050 | p->dcc = current_function_dcc; | |
4956d07c MS |
2051 | |
2052 | init_eh (); | |
2053 | } | |
2054 | ||
12670d88 RK |
2055 | /* Restore the per-function EH info saved into the area denoted by P. |
2056 | ||
abeeec2a | 2057 | This is currently called from restore_stmt_status. */ |
4956d07c MS |
2058 | |
2059 | void | |
2060 | restore_eh_status (p) | |
2061 | struct function *p; | |
2062 | { | |
3a88cbd1 JL |
2063 | if (p == NULL) |
2064 | abort (); | |
12670d88 | 2065 | |
4956d07c MS |
2066 | protect_list = p->protect_list; |
2067 | caught_return_label_stack = p->caught_return_label_stack; | |
2068 | false_label_stack = p->false_label_stack; | |
2069 | catch_clauses = p->catch_clauses; | |
2070 | ehqueue = p->ehqueue; | |
2071 | ehstack = p->ehstack; | |
27a36778 MS |
2072 | current_function_dhc = p->dhc; |
2073 | current_function_dcc = p->dcc; | |
4956d07c MS |
2074 | } |
2075 | \f | |
2076 | /* This section is for the exception handling specific optimization | |
2077 | pass. First are the internal routines, and then the main | |
2078 | optimization pass. */ | |
2079 | ||
2080 | /* Determine if the given INSN can throw an exception. */ | |
2081 | ||
2082 | static int | |
2083 | can_throw (insn) | |
2084 | rtx insn; | |
2085 | { | |
abeeec2a | 2086 | /* Calls can always potentially throw exceptions. */ |
4956d07c MS |
2087 | if (GET_CODE (insn) == CALL_INSN) |
2088 | return 1; | |
2089 | ||
27a36778 MS |
2090 | if (asynchronous_exceptions) |
2091 | { | |
2092 | /* If we wanted asynchronous exceptions, then everything but NOTEs | |
2093 | and CODE_LABELs could throw. */ | |
2094 | if (GET_CODE (insn) != NOTE && GET_CODE (insn) != CODE_LABEL) | |
2095 | return 1; | |
2096 | } | |
4956d07c MS |
2097 | |
2098 | return 0; | |
2099 | } | |
2100 | ||
12670d88 RK |
2101 | /* Scan a exception region looking for the matching end and then |
2102 | remove it if possible. INSN is the start of the region, N is the | |
2103 | region number, and DELETE_OUTER is to note if anything in this | |
2104 | region can throw. | |
2105 | ||
2106 | Regions are removed if they cannot possibly catch an exception. | |
27a36778 | 2107 | This is determined by invoking can_throw on each insn within the |
12670d88 RK |
2108 | region; if can_throw returns true for any of the instructions, the |
2109 | region can catch an exception, since there is an insn within the | |
2110 | region that is capable of throwing an exception. | |
2111 | ||
2112 | Returns the NOTE_INSN_EH_REGION_END corresponding to this region, or | |
27a36778 | 2113 | calls abort if it can't find one. |
12670d88 RK |
2114 | |
2115 | Can abort if INSN is not a NOTE_INSN_EH_REGION_BEGIN, or if N doesn't | |
abeeec2a | 2116 | correspond to the region number, or if DELETE_OUTER is NULL. */ |
4956d07c MS |
2117 | |
2118 | static rtx | |
2119 | scan_region (insn, n, delete_outer) | |
2120 | rtx insn; | |
2121 | int n; | |
2122 | int *delete_outer; | |
2123 | { | |
2124 | rtx start = insn; | |
2125 | ||
2126 | /* Assume we can delete the region. */ | |
2127 | int delete = 1; | |
2128 | ||
3a88cbd1 JL |
2129 | if (insn == NULL_RTX |
2130 | || GET_CODE (insn) != NOTE | |
2131 | || NOTE_LINE_NUMBER (insn) != NOTE_INSN_EH_REGION_BEG | |
2132 | || NOTE_BLOCK_NUMBER (insn) != n | |
2133 | || delete_outer == NULL) | |
2134 | abort (); | |
12670d88 | 2135 | |
4956d07c MS |
2136 | insn = NEXT_INSN (insn); |
2137 | ||
2138 | /* Look for the matching end. */ | |
2139 | while (! (GET_CODE (insn) == NOTE | |
2140 | && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_END)) | |
2141 | { | |
2142 | /* If anything can throw, we can't remove the region. */ | |
2143 | if (delete && can_throw (insn)) | |
2144 | { | |
2145 | delete = 0; | |
2146 | } | |
2147 | ||
2148 | /* Watch out for and handle nested regions. */ | |
2149 | if (GET_CODE (insn) == NOTE | |
2150 | && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG) | |
2151 | { | |
2152 | insn = scan_region (insn, NOTE_BLOCK_NUMBER (insn), &delete); | |
2153 | } | |
2154 | ||
2155 | insn = NEXT_INSN (insn); | |
2156 | } | |
2157 | ||
2158 | /* The _BEG/_END NOTEs must match and nest. */ | |
2159 | if (NOTE_BLOCK_NUMBER (insn) != n) | |
2160 | abort (); | |
2161 | ||
12670d88 | 2162 | /* If anything in this exception region can throw, we can throw. */ |
4956d07c MS |
2163 | if (! delete) |
2164 | *delete_outer = 0; | |
2165 | else | |
2166 | { | |
2167 | /* Delete the start and end of the region. */ | |
2168 | delete_insn (start); | |
2169 | delete_insn (insn); | |
2170 | ||
2171 | /* Only do this part if we have built the exception handler | |
2172 | labels. */ | |
2173 | if (exception_handler_labels) | |
2174 | { | |
2175 | rtx x, *prev = &exception_handler_labels; | |
2176 | ||
2177 | /* Find it in the list of handlers. */ | |
2178 | for (x = exception_handler_labels; x; x = XEXP (x, 1)) | |
2179 | { | |
2180 | rtx label = XEXP (x, 0); | |
2181 | if (CODE_LABEL_NUMBER (label) == n) | |
2182 | { | |
2183 | /* If we are the last reference to the handler, | |
2184 | delete it. */ | |
2185 | if (--LABEL_NUSES (label) == 0) | |
2186 | delete_insn (label); | |
2187 | ||
2188 | if (optimize) | |
2189 | { | |
2190 | /* Remove it from the list of exception handler | |
2191 | labels, if we are optimizing. If we are not, then | |
2192 | leave it in the list, as we are not really going to | |
2193 | remove the region. */ | |
2194 | *prev = XEXP (x, 1); | |
2195 | XEXP (x, 1) = 0; | |
2196 | XEXP (x, 0) = 0; | |
2197 | } | |
2198 | ||
2199 | break; | |
2200 | } | |
2201 | prev = &XEXP (x, 1); | |
2202 | } | |
2203 | } | |
2204 | } | |
2205 | return insn; | |
2206 | } | |
2207 | ||
2208 | /* Perform various interesting optimizations for exception handling | |
2209 | code. | |
2210 | ||
12670d88 RK |
2211 | We look for empty exception regions and make them go (away). The |
2212 | jump optimization code will remove the handler if nothing else uses | |
abeeec2a | 2213 | it. */ |
4956d07c MS |
2214 | |
2215 | void | |
2216 | exception_optimize () | |
2217 | { | |
2218 | rtx insn, regions = NULL_RTX; | |
2219 | int n; | |
2220 | ||
12670d88 | 2221 | /* Remove empty regions. */ |
4956d07c MS |
2222 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) |
2223 | { | |
2224 | if (GET_CODE (insn) == NOTE | |
2225 | && NOTE_LINE_NUMBER (insn) == NOTE_INSN_EH_REGION_BEG) | |
2226 | { | |
27a36778 | 2227 | /* Since scan_region will return the NOTE_INSN_EH_REGION_END |
12670d88 RK |
2228 | insn, we will indirectly skip through all the insns |
2229 | inbetween. We are also guaranteed that the value of insn | |
27a36778 | 2230 | returned will be valid, as otherwise scan_region won't |
abeeec2a | 2231 | return. */ |
4956d07c MS |
2232 | insn = scan_region (insn, NOTE_BLOCK_NUMBER (insn), &n); |
2233 | } | |
2234 | } | |
2235 | } | |
ca55abae JM |
2236 | \f |
2237 | /* Various hooks for the DWARF 2 __throw routine. */ | |
2238 | ||
2239 | /* Do any necessary initialization to access arbitrary stack frames. | |
2240 | On the SPARC, this means flushing the register windows. */ | |
2241 | ||
2242 | void | |
2243 | expand_builtin_unwind_init () | |
2244 | { | |
2245 | /* Set this so all the registers get saved in our frame; we need to be | |
2246 | able to copy the saved values for any registers from frames we unwind. */ | |
2247 | current_function_has_nonlocal_label = 1; | |
2248 | ||
2249 | #ifdef SETUP_FRAME_ADDRESSES | |
2250 | SETUP_FRAME_ADDRESSES (); | |
2251 | #endif | |
2252 | } | |
2253 | ||
2254 | /* Given a value extracted from the return address register or stack slot, | |
2255 | return the actual address encoded in that value. */ | |
2256 | ||
2257 | rtx | |
2258 | expand_builtin_extract_return_addr (addr_tree) | |
2259 | tree addr_tree; | |
2260 | { | |
2261 | rtx addr = expand_expr (addr_tree, NULL_RTX, Pmode, 0); | |
2262 | return eh_outer_context (addr); | |
2263 | } | |
2264 | ||
2265 | /* Given an actual address in addr_tree, do any necessary encoding | |
2266 | and return the value to be stored in the return address register or | |
2267 | stack slot so the epilogue will return to that address. */ | |
2268 | ||
2269 | rtx | |
2270 | expand_builtin_frob_return_addr (addr_tree) | |
2271 | tree addr_tree; | |
2272 | { | |
2273 | rtx addr = expand_expr (addr_tree, NULL_RTX, Pmode, 0); | |
2274 | #ifdef RETURN_ADDR_OFFSET | |
2275 | addr = plus_constant (addr, -RETURN_ADDR_OFFSET); | |
2276 | #endif | |
2277 | return addr; | |
2278 | } | |
2279 | ||
2280 | /* Given an actual address in addr_tree, set the return address register up | |
2281 | so the epilogue will return to that address. If the return address is | |
2282 | not in a register, do nothing. */ | |
2283 | ||
2284 | void | |
2285 | expand_builtin_set_return_addr_reg (addr_tree) | |
2286 | tree addr_tree; | |
2287 | { | |
4f870c04 | 2288 | rtx tmp; |
ca55abae JM |
2289 | rtx ra = expand_builtin_return_addr (BUILT_IN_RETURN_ADDRESS, |
2290 | 0, hard_frame_pointer_rtx); | |
2291 | ||
2292 | if (GET_CODE (ra) != REG || REGNO (ra) >= FIRST_PSEUDO_REGISTER) | |
2293 | return; | |
2294 | ||
4f870c04 JM |
2295 | tmp = force_operand (expand_builtin_frob_return_addr (addr_tree), ra); |
2296 | if (tmp != ra) | |
2297 | emit_move_insn (ra, tmp); | |
ca55abae JM |
2298 | } |
2299 | ||
2300 | /* Choose two registers for communication between the main body of | |
2301 | __throw and the stub for adjusting the stack pointer. The first register | |
2302 | is used to pass the address of the exception handler; the second register | |
2303 | is used to pass the stack pointer offset. | |
2304 | ||
2305 | For register 1 we use the return value register for a void *. | |
2306 | For register 2 we use the static chain register if it exists and is | |
2307 | different from register 1, otherwise some arbitrary call-clobbered | |
2308 | register. */ | |
2309 | ||
2310 | static void | |
2311 | eh_regs (r1, r2, outgoing) | |
2312 | rtx *r1, *r2; | |
2313 | int outgoing; | |
2314 | { | |
2315 | rtx reg1, reg2; | |
2316 | ||
2317 | #ifdef FUNCTION_OUTGOING_VALUE | |
2318 | if (outgoing) | |
2319 | reg1 = FUNCTION_OUTGOING_VALUE (build_pointer_type (void_type_node), | |
2320 | current_function_decl); | |
2321 | else | |
2322 | #endif | |
2323 | reg1 = FUNCTION_VALUE (build_pointer_type (void_type_node), | |
2324 | current_function_decl); | |
2325 | ||
2326 | #ifdef STATIC_CHAIN_REGNUM | |
2327 | if (outgoing) | |
2328 | reg2 = static_chain_incoming_rtx; | |
2329 | else | |
2330 | reg2 = static_chain_rtx; | |
2331 | if (REGNO (reg2) == REGNO (reg1)) | |
2332 | #endif /* STATIC_CHAIN_REGNUM */ | |
2333 | reg2 = NULL_RTX; | |
2334 | ||
2335 | if (reg2 == NULL_RTX) | |
2336 | { | |
2337 | int i; | |
2338 | for (i = 0; i < FIRST_PSEUDO_REGISTER; ++i) | |
2339 | if (call_used_regs[i] && ! fixed_regs[i] && i != REGNO (reg1)) | |
2340 | { | |
2341 | reg2 = gen_rtx (REG, Pmode, i); | |
2342 | break; | |
2343 | } | |
2344 | ||
2345 | if (reg2 == NULL_RTX) | |
2346 | abort (); | |
2347 | } | |
2348 | ||
2349 | *r1 = reg1; | |
2350 | *r2 = reg2; | |
2351 | } | |
2352 | ||
2353 | /* Emit inside of __throw a stub which adjusts the stack pointer and jumps | |
2354 | to the exception handler. __throw will set up the necessary values | |
2355 | and then return to the stub. */ | |
2356 | ||
2357 | rtx | |
2358 | expand_builtin_eh_stub () | |
2359 | { | |
2360 | rtx stub_start = gen_label_rtx (); | |
2361 | rtx after_stub = gen_label_rtx (); | |
2362 | rtx handler, offset, temp; | |
2363 | ||
2364 | emit_jump (after_stub); | |
2365 | emit_label (stub_start); | |
2366 | ||
2367 | eh_regs (&handler, &offset, 0); | |
2368 | ||
2369 | adjust_stack (offset); | |
2370 | emit_indirect_jump (handler); | |
2371 | ||
2372 | emit_label (after_stub); | |
2373 | return gen_rtx (LABEL_REF, Pmode, stub_start); | |
2374 | } | |
2375 | ||
2376 | /* Set up the registers for passing the handler address and stack offset | |
2377 | to the stub above. */ | |
2378 | ||
2379 | void | |
2380 | expand_builtin_set_eh_regs (handler, offset) | |
2381 | tree handler, offset; | |
2382 | { | |
2383 | rtx reg1, reg2; | |
2384 | ||
2385 | eh_regs (®1, ®2, 1); | |
2386 | ||
2387 | store_expr (offset, reg2, 0); | |
2388 | store_expr (handler, reg1, 0); | |
2389 | ||
2390 | /* These will be used by the stub. */ | |
2391 | emit_insn (gen_rtx (USE, VOIDmode, reg1)); | |
2392 | emit_insn (gen_rtx (USE, VOIDmode, reg2)); | |
2393 | } |