]> git.ipfire.org Git - thirdparty/gcc.git/blame - gcc/except.h
cpphash.c (collect_formal_parameters): strncmp returns 0 for match.
[thirdparty/gcc.git] / gcc / except.h
CommitLineData
4956d07c 1/* Exception Handling interface routines.
ef58a523 2 Copyright (C) 1996, 1997, 1998, 1999, 2000 Free Software Foundation, Inc.
4956d07c
MS
3 Contributed by Mike Stump <mrs@cygnus.com>.
4
5This file is part of GNU CC.
6
7GNU CC is free software; you can redistribute it and/or modify
8it under the terms of the GNU General Public License as published by
9the Free Software Foundation; either version 2, or (at your option)
10any later version.
11
12GNU CC is distributed in the hope that it will be useful,
13but WITHOUT ANY WARRANTY; without even the implied warranty of
14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15GNU General Public License for more details.
16
17You should have received a copy of the GNU General Public License
18along with GNU CC; see the file COPYING. If not, write to
19the Free Software Foundation, 59 Temple Place - Suite 330,
20Boston, MA 02111-1307, USA. */
21
d05a5492
MM
22#if !defined(NULL_RTX) && !defined(rtx)
23typedef struct rtx_def *_except_rtx;
24#define rtx _except_rtx
4956d07c
MS
25#endif
26
27#ifdef TREE_CODE
28
911fdd58
RK
29/* A stack of labels. CHAIN points to the next entry in the stack. */
30
4956d07c
MS
31struct label_node {
32 union {
33 rtx rlabel;
34 tree tlabel;
35 } u;
36 struct label_node *chain;
37};
38
911fdd58
RK
39/* An eh_entry is used to describe one exception handling region.
40
478b0752 41 OUTER_CONTEXT is the label used for rethrowing into the outer context.
911fdd58
RK
42
43 EXCEPTION_HANDLER_LABEL is the label corresponding to the handler
44 for this region.
45
9a0d1e1b
AM
46 LABEL_USED indicates whether a CATCH block has already used this
47 label or not. New ones are needed for additional catch blocks if
48 it has.
49
bf71cd2e
AM
50 FALSE_LABEL is used when either setjmp/longjmp exceptions are in
51 use, or old style table exceptions. It contains the label for
52 branching to the next runtime type check as handlers are processed.
53
911fdd58
RK
54 FINALIZATION is the tree codes for the handler, or is NULL_TREE if
55 one hasn't been generated yet, or is integer_zero_node to mark the
56 end of a group of try blocks. */
57
4956d07c 58struct eh_entry {
478b0752 59 rtx outer_context;
4956d07c 60 rtx exception_handler_label;
4956d07c 61 tree finalization;
9a0d1e1b 62 int label_used;
bf71cd2e 63 rtx false_label;
e6cfb550 64 rtx rethrow_label;
1e4ceb6f
MM
65 /* If non-zero, this entry is for a handler created when we left an
66 exception-region via goto. */
67 unsigned goto_entry_p : 1;
4956d07c 68};
b384405b
BS
69#else
70struct label_node;
71struct eh_entry;
72#endif
4956d07c 73
911fdd58
RK
74/* A list of EH_ENTRYs. ENTRY is the entry; CHAIN points to the next
75 entry in the list, or is NULL if this is the last entry. */
76
4956d07c
MS
77struct eh_node {
78 struct eh_entry *entry;
79 struct eh_node *chain;
80};
81
911fdd58
RK
82/* A stack of EH_ENTRYs. TOP is the topmost entry on the stack. TOP is
83 NULL if the stack is empty. */
84
4956d07c
MS
85struct eh_stack {
86 struct eh_node *top;
87};
88
911fdd58
RK
89/* A queue of EH_ENTRYs. HEAD is the front of the queue; TAIL is the
90 end (the latest entry). HEAD and TAIL are NULL if the queue is
91 empty. */
92
4956d07c
MS
93struct eh_queue {
94 struct eh_node *head;
95 struct eh_node *tail;
f54a7f6f 96 struct eh_queue *next;
4956d07c
MS
97};
98
b384405b
BS
99/* Used to save exception handling status for each function. */
100struct eh_status
101{
102 /* A stack used for keeping track of the currently active exception
103 handling region. As each exception region is started, an entry
104 describing the region is pushed onto this stack. The current
105 region can be found by looking at the top of the stack, and as we
106 exit regions, the corresponding entries are popped.
107
108 Entries cannot overlap; they can be nested. So there is only one
109 entry at most that corresponds to the current instruction, and that
110 is the entry on the top of the stack. */
111 struct eh_stack x_ehstack;
112 /* This stack is used to represent what the current eh region is
113 for the catch blocks beings processed */
114 struct eh_stack x_catchstack;
1e4ceb6f 115 /* A queue used for tracking which exception regions have closed.
b384405b 116 As we exit a region, we enqueue a new entry. The entries are then
1e4ceb6f
MM
117 dequeued during expand_leftover_cleanups and
118 expand_start_all_catch. */
f54a7f6f 119 struct eh_queue *x_ehqueue;
b384405b
BS
120 /* Insns for all of the exception handlers for the current function.
121 They are currently emitted by the frontend code. */
122 rtx x_catch_clauses;
123 /* A random data area for the front end's own use. */
124 struct label_node *x_false_label_stack;
125 /* Keeps track of the label to resume to should one want to resume
126 normal control flow out of a handler (instead of, say, returning to
127 the caller of the current function or exiting the program). */
128 struct label_node *x_caught_return_label_stack;
76fc91c7
MM
129 /* A stack (TREE_LIST) of lists of handlers. The TREE_VALUE of each
130 node is itself a TREE_CHAINed list of handlers for regions that
131 are not yet closed. The TREE_VALUE of each entry contains the
132 handler for the corresponding entry on the ehstack. */
b384405b
BS
133 union tree_node *x_protect_list;
134 /* The EH context. Nonzero if the function has already
135 fetched a pointer to the EH context for exception handling. */
136 rtx ehc;
137 /* The label generated by expand_builtin_eh_return. */
138 rtx x_eh_return_stub_label;
139};
140
01d939e8
BS
141#define ehstack (cfun->eh->x_ehstack)
142#define catchstack (cfun->eh->x_catchstack)
143#define ehqueue (cfun->eh->x_ehqueue)
144#define catch_clauses (cfun->eh->x_catch_clauses)
145#define false_label_stack (cfun->eh->x_false_label_stack)
146#define caught_return_label_stack (cfun->eh->x_caught_return_label_stack)
147#define protect_list (cfun->eh->x_protect_list)
148#define current_function_ehc (cfun->eh->ehc)
149#define eh_return_stub_label (cfun->eh->x_eh_return_stub_label)
b384405b
BS
150
151#ifdef TREE_CODE
e976b8b2
MS
152/* Start an exception handling region. All instructions emitted after
153 this point are considered to be part of the region until
154 expand_eh_region_end () is invoked. */
155
711d877c 156extern void expand_eh_region_start PARAMS ((void));
911fdd58 157
4c581243
MS
158/* Just like expand_eh_region_start, except if a cleanup action is
159 entered on the cleanup chain, the TREE_PURPOSE of the element put
160 on the chain is DECL. DECL should be the associated VAR_DECL, if
161 any, otherwise it should be NULL_TREE. */
162
711d877c 163extern void expand_eh_region_start_for_decl PARAMS ((tree));
4c581243 164
e976b8b2
MS
165/* Start an exception handling region for the given cleanup action.
166 All instructions emitted after this point are considered to be part
167 of the region until expand_eh_region_end () is invoked. CLEANUP is
168 the cleanup action to perform. The return value is true if the
169 exception region was optimized away. If that case,
170 expand_eh_region_end does not need to be called for this cleanup,
171 nor should it be.
172
173 This routine notices one particular common case in C++ code
174 generation, and optimizes it so as to not need the exception
175 region. */
176
711d877c 177extern int expand_eh_region_start_tree PARAMS ((tree, tree));
e976b8b2
MS
178
179/* End an exception handling region. The information about the region
180 is found on the top of ehstack.
181
182 HANDLER is either the cleanup for the exception region, or if we're
183 marking the end of a try block, HANDLER is integer_zero_node.
184
185 HANDLER will be transformed to rtl when expand_leftover_cleanups ()
186 is invoked. */
187
711d877c 188extern void expand_eh_region_end PARAMS ((tree));
911fdd58
RK
189
190/* Push RLABEL or TLABEL onto LABELSTACK. Only one of RLABEL or TLABEL
191 should be set; the other must be NULL. */
192
711d877c
KG
193extern void push_label_entry PARAMS ((struct label_node **labelstack,
194 rtx rlabel, tree tlabel));
911fdd58
RK
195
196/* Pop the topmost entry from LABELSTACK and return its value as an
197 rtx node. If LABELSTACK is empty, return NULL. */
198
711d877c 199extern rtx pop_label_entry PARAMS ((struct label_node **labelstack));
911fdd58
RK
200
201/* Return the topmost entry of LABELSTACK as a tree node, or return
202 NULL_TREE if LABELSTACK is empty. */
203
711d877c 204extern tree top_label_entry PARAMS ((struct label_node **labelstack));
4956d07c 205
4956d07c
MS
206#endif
207
d6f4ec51
KG
208/* Test: is exception handling turned on? */
209
711d877c 210extern int doing_eh PARAMS ((int));
d6f4ec51 211
911fdd58
RK
212/* Toplevel initialization for EH. */
213
711d877c
KG
214void set_exception_lang_code PARAMS ((int));
215void set_exception_version_code PARAMS ((int));
9a0d1e1b 216
9a0d1e1b
AM
217/* A list of handlers asocciated with an exception region. HANDLER_LABEL
218 is the the label that control should be transfered to if the data
219 in TYPE_INFO matches an exception. a value of NULL_TREE for TYPE_INFO
220 means This is a cleanup, and must always be called. A value of
221 CATCH_ALL_TYPE works like a cleanup, but a call to the runtime matcher
222 is still performed to avoid being caught by a different language
223 exception. NEXT is a pointer to the next handler for this region.
224 NULL means there are no more. */
225
9a0d1e1b
AM
226typedef struct handler_info
227{
0177de87
AM
228 rtx handler_label;
229 int handler_number;
9a0d1e1b
AM
230 void *type_info;
231 struct handler_info *next;
232} handler_info;
233
234
9a0d1e1b
AM
235/* Add new handler information to an exception range. The first parameter
236 specifies the range number (returned from new_eh_entry()). The second
237 parameter specifies the handler. By default the handler is inserted at
238 the end of the list. A handler list may contain only ONE NULL_TREE
239 typeinfo entry. Regardless where it is positioned, a NULL_TREE entry
240 is always output as the LAST handler in the exception table for a region. */
241
711d877c 242void add_new_handler PARAMS ((int, struct handler_info *));
9a0d1e1b 243
9f8e6243
AM
244/* Remove a handler label. The handler label is being deleted, so all
245 regions which reference this handler should have it removed from their
246 list of possible handlers. Any region which has the final handler
247 removed can be deleted. */
248
711d877c 249void remove_handler PARAMS ((rtx));
9f8e6243 250
9a0d1e1b
AM
251/* Create a new handler structure initialized with the handler label and
252 typeinfo fields passed in. */
253
711d877c 254struct handler_info *get_new_handler PARAMS ((rtx, void *));
9a0d1e1b
AM
255
256/* Make a duplicate of an exception region by copying all the handlers
257 for an exception region. Return the new handler index. */
258
711d877c 259int duplicate_eh_handlers PARAMS ((int, int, rtx (*)(rtx)));
e6cfb550
AM
260
261/* map symbol refs for rethrow */
262
711d877c 263rtx rethrow_symbol_map PARAMS ((rtx, rtx (*)(rtx)));
e6cfb550
AM
264
265/* Is the rethrow label for a region used? */
266
711d877c 267int rethrow_used PARAMS ((int));
e6cfb550 268
1ef1bf06
AM
269/* Update the rethrow references to reflect rethrows which have been
270 optimized away. */
271
711d877c 272void update_rethrow_references PARAMS ((void));
1ef1bf06 273
9a0d1e1b
AM
274/* Get a pointer to the first handler in an exception region's list. */
275
711d877c 276struct handler_info *get_first_handler PARAMS ((int));
9a0d1e1b 277
9c606f69
AM
278/* Find all the runtime handlers type matches currently referenced */
279
711d877c 280int find_all_handler_type_matches PARAMS ((void ***));
9a0d1e1b 281
1ef1bf06
AM
282/* The eh_nesting_info structure is used to find a list of valid handlers
283 for any arbitrary exception region. When init_eh_nesting_info is called,
284 the information is all pre-calculated and entered in this structure.
285 REGION_INDEX is a vector over all possible region numbers. Since the
286 number of regions is typically much smaller than the range of block
287 numbers, this is a sparse vector and the other data structures are
288 represented as dense vectors. Indexed with an exception region number, this
289 returns the index to use in the other data structures to retreive the
290 correct information.
291 HANDLERS is an array of vectors which point to handler_info structures.
292 when indexed, it gives the list of all possible handlers which can
293 be reached by a throw from this exception region.
294 NUM_HANDLERS is the equivilent array indicating how many handler
295 pointers there are in the HANDLERS vector.
296 OUTER_INDEX indicates which index represents the information for the
297 outer block. 0 indicates there is no outer context.
298 REGION_COUNT is the number of regions. */
299
300typedef struct eh_nesting
301{
302 int *region_index;
303 handler_info ***handlers;
304 int *num_handlers;
305 int *outer_index;
306 int region_count;
307} eh_nesting_info;
308
309/* Initialize the eh_nesting_info structure. */
310
711d877c 311eh_nesting_info *init_eh_nesting_info PARAMS ((void));
1ef1bf06
AM
312
313/* Get a list of handlers reachable from a an exception region/insn. */
314
711d877c
KG
315int reachable_handlers PARAMS ((int, eh_nesting_info *, rtx,
316 handler_info ***handlers));
1ef1bf06
AM
317
318/* Free the eh_nesting_info structure. */
319
711d877c 320void free_eh_nesting_info PARAMS ((eh_nesting_info *));
1ef1bf06 321
711d877c 322extern void init_eh PARAMS ((void));
911fdd58
RK
323
324/* Initialization for the per-function EH data. */
325
711d877c 326extern void init_eh_for_function PARAMS ((void));
911fdd58 327
9a0d1e1b
AM
328/* Generate an exception label. Use instead of gen_label_rtx */
329
711d877c 330extern rtx gen_exception_label PARAMS ((void));
9a0d1e1b 331
911fdd58
RK
332/* Adds an EH table entry for EH entry number N. Called from
333 final_scan_insn for NOTE_INSN_EH_REGION_BEG. */
334
711d877c 335extern void add_eh_table_entry PARAMS ((int n));
911fdd58 336
9a0d1e1b
AM
337/* Start a catch clause, triggered by runtime value paramter. */
338
339#ifdef TREE_CODE
711d877c 340extern void start_catch_handler PARAMS ((tree));
9a0d1e1b
AM
341#endif
342
bf71cd2e
AM
343/* End an individual catch clause. */
344
711d877c 345extern void end_catch_handler PARAMS ((void));
bf71cd2e 346
911fdd58
RK
347/* Returns a non-zero value if we need to output an exception table. */
348
711d877c 349extern int exception_table_p PARAMS ((void));
911fdd58
RK
350
351/* Outputs the exception table if we have one. */
352
711d877c 353extern void output_exception_table PARAMS ((void));
911fdd58
RK
354
355/* Given a return address in ADDR, determine the address we should use
356 to find the corresponding EH region. */
357
711d877c 358extern rtx eh_outer_context PARAMS ((rtx addr));
911fdd58
RK
359
360/* Called at the start of a block of try statements for which there is
361 a supplied catch handler. */
362
711d877c 363extern void expand_start_try_stmts PARAMS ((void));
911fdd58
RK
364
365/* Called at the start of a block of catch statements. It terminates the
366 previous set of try statements. */
367
711d877c 368extern void expand_start_all_catch PARAMS ((void));
911fdd58
RK
369
370/* Called at the end of a block of catch statements. */
371
711d877c 372extern void expand_end_all_catch PARAMS ((void));
911fdd58 373
76fc91c7
MM
374/* Begin a region that will contain entries created with
375 add_partial_entry. */
376
711d877c 377extern void begin_protect_partials PARAMS ((void));
76fc91c7 378
911fdd58
RK
379#ifdef TREE_CODE
380/* Create a new exception region and add the handler for the region
381 onto a list. These regions will be ended (and their handlers
382 emitted) when end_protect_partials is invoked. */
383
711d877c 384extern void add_partial_entry PARAMS ((tree handler));
911fdd58
RK
385#endif
386
387/* End all of the pending exception regions that have handlers added with
388 push_protect_entry (). */
389
711d877c 390extern void end_protect_partials PARAMS ((void));
911fdd58 391
e701eb4d 392/* An internal throw. */
911fdd58 393
711d877c 394extern void expand_internal_throw PARAMS ((void));
911fdd58
RK
395
396/* Called from expand_exception_blocks and expand_end_catch_block to
397 expand and pending handlers. */
398
711d877c 399extern void expand_leftover_cleanups PARAMS ((void));
911fdd58 400
154bba13
TT
401/* If necessary, emit insns to get EH context for the current
402 function. */
403
711d877c 404extern void emit_eh_context PARAMS ((void));
154bba13 405
911fdd58
RK
406/* Builds a list of handler labels and puts them in the global
407 variable exception_handler_labels. */
408
711d877c 409extern void find_exception_handler_labels PARAMS ((void));
911fdd58 410
9a0d1e1b
AM
411/* Determine if an arbitrary label is an exception label */
412
711d877c 413extern int is_exception_handler_label PARAMS ((int));
9a0d1e1b 414
911fdd58
RK
415/* Performs sanity checking on the check_exception_handler_labels
416 list. */
417
711d877c 418extern void check_exception_handler_labels PARAMS ((void));
911fdd58 419
956d6950
JL
420/* Keeps track of the label used as the context of a throw to rethrow an
421 exception to the outer exception region. */
422
423extern struct label_node *outer_context_label_stack;
424
911fdd58
RK
425/* A list of labels used for exception handlers. It is created by
426 find_exception_handler_labels for the optimization passes. */
427
4956d07c
MS
428extern rtx exception_handler_labels;
429
911fdd58
RK
430/* Performs optimizations for exception handling, such as removing
431 unnecessary exception regions. Invoked from jump_optimize (). */
432
711d877c 433extern void exception_optimize PARAMS ((void));
e976b8b2 434
01eb7f9a 435/* Return EH context (and set it up once per fn). */
711d877c 436extern rtx get_eh_context PARAMS ((void));
154bba13 437
e976b8b2 438/* Get the dynamic handler chain. */
711d877c 439extern rtx get_dynamic_handler_chain PARAMS ((void));
e976b8b2
MS
440
441/* Get the dynamic cleanup chain. */
711d877c 442extern rtx get_dynamic_cleanup_chain PARAMS ((void));
e976b8b2
MS
443
444/* Throw an exception. */
445
711d877c 446extern void emit_throw PARAMS ((void));
e976b8b2 447
f54a7f6f 448/* Save away the current ehqueue. */
711d877c 449extern void push_ehqueue PARAMS ((void));
f54a7f6f
MM
450
451/* Restore a previously pushed ehqueue. */
711d877c 452extern void pop_ehqueue PARAMS ((void));
f54a7f6f 453
e976b8b2
MS
454/* One to use setjmp/longjmp method of generating code. */
455
456extern int exceptions_via_longjmp;
457
458/* One to enable asynchronous exception support. */
459
460extern int asynchronous_exceptions;
461
462/* One to protect cleanup actions with a handler that calls
463 __terminate, zero otherwise. */
464
465extern int protect_cleanup_actions_with_terminate;
466
467#ifdef TREE_CODE
711d877c 468extern tree protect_with_terminate PARAMS ((tree));
e976b8b2 469#endif
0021b564 470
711d877c 471extern void expand_fixup_region_start PARAMS ((void));
487a6e06 472#ifdef TREE_CODE
711d877c 473extern void expand_fixup_region_end PARAMS ((tree));
487a6e06
KG
474#endif
475
0021b564
JM
476/* Various hooks for the DWARF 2 __throw routine. */
477
711d877c
KG
478void expand_builtin_unwind_init PARAMS ((void));
479rtx expand_builtin_dwarf_fp_regnum PARAMS ((void));
0021b564 480#ifdef TREE_CODE
711d877c
KG
481rtx expand_builtin_frob_return_addr PARAMS ((tree));
482rtx expand_builtin_extract_return_addr PARAMS ((tree));
483void expand_builtin_init_dwarf_reg_sizes PARAMS ((tree));
484void expand_builtin_eh_return PARAMS ((tree, tree, tree));
0021b564 485#endif
711d877c 486void expand_eh_return PARAMS ((void));
5aa55043
AM
487
488
489/* Checking whether 2 instructions are within the same exception region. */
490
711d877c
KG
491int in_same_eh_region PARAMS ((rtx, rtx));
492void free_insn_eh_region PARAMS ((void));
493void init_insn_eh_region PARAMS ((rtx, int));
d05a5492
MM
494
495#ifdef rtx
496#undef rtx
497#endif