-/* A list of EH_ENTRYs. ENTRY is the entry; CHAIN points to the next
- entry in the list, or is NULL if this is the last entry. */
-
-struct eh_node {
- struct eh_entry *entry;
- struct eh_node *chain;
-};
-
-/* A stack of EH_ENTRYs. TOP is the topmost entry on the stack. TOP is
- NULL if the stack is empty. */
-
-struct eh_stack {
- struct eh_node *top;
-};
-
-/* A queue of EH_ENTRYs. HEAD is the front of the queue; TAIL is the
- end (the latest entry). HEAD and TAIL are NULL if the queue is
- empty. */
-
-struct eh_queue {
- struct eh_node *head;
- struct eh_node *tail;
- struct eh_queue *next;
-};
-
-/* Used to save exception handling status for each function. */
-struct eh_status
-{
- /* A stack used for keeping track of the currently active exception
- handling region. As each exception region is started, an entry
- describing the region is pushed onto this stack. The current
- region can be found by looking at the top of the stack, and as we
- exit regions, the corresponding entries are popped.
-
- Entries cannot overlap; they can be nested. So there is only one
- entry at most that corresponds to the current instruction, and that
- is the entry on the top of the stack. */
- struct eh_stack x_ehstack;
- /* This stack is used to represent what the current eh region is
- for the catch blocks beings processed */
- struct eh_stack x_catchstack;
- /* A queue used for tracking which exception regions have closed.
- As we exit a region, we enqueue a new entry. The entries are then
- dequeued during expand_leftover_cleanups and
- expand_start_all_catch. */
- struct eh_queue *x_ehqueue;
- /* Insns for all of the exception handlers for the current function.
- They are currently emitted by the frontend code. */
- rtx x_catch_clauses;
- /* A random data area for the front end's own use. */
- struct label_node *x_false_label_stack;
- /* Keeps track of the label to resume to should one want to resume
- normal control flow out of a handler (instead of, say, returning to
- the caller of the current function or exiting the program). */
- struct label_node *x_caught_return_label_stack;
- /* A stack (TREE_LIST) of lists of handlers. The TREE_VALUE of each
- node is itself a TREE_CHAINed list of handlers for regions that
- are not yet closed. The TREE_VALUE of each entry contains the
- handler for the corresponding entry on the ehstack. */
- union tree_node *x_protect_list;
- /* The EH context. Nonzero if the function has already
- fetched a pointer to the EH context for exception handling. */
- rtx ehc;
- /* The label generated by expand_builtin_eh_return. */
- rtx x_eh_return_stub_label;
-};
-
-#define ehstack (cfun->eh->x_ehstack)
-#define catchstack (cfun->eh->x_catchstack)
-#define ehqueue (cfun->eh->x_ehqueue)
-#define catch_clauses (cfun->eh->x_catch_clauses)
-#define false_label_stack (cfun->eh->x_false_label_stack)
-#define caught_return_label_stack (cfun->eh->x_caught_return_label_stack)
-#define protect_list (cfun->eh->x_protect_list)
-#define current_function_ehc (cfun->eh->ehc)
-#define eh_return_stub_label (cfun->eh->x_eh_return_stub_label)
-
-#ifdef TREE_CODE
-/* Start an exception handling region. All instructions emitted after
- this point are considered to be part of the region until
- expand_eh_region_end () is invoked. */
-
-extern void expand_eh_region_start PARAMS ((void));
-
-/* Just like expand_eh_region_start, except if a cleanup action is
- entered on the cleanup chain, the TREE_PURPOSE of the element put
- on the chain is DECL. DECL should be the associated VAR_DECL, if
- any, otherwise it should be NULL_TREE. */
-
-extern void expand_eh_region_start_for_decl PARAMS ((tree));
-
-/* Start an exception handling region for the given cleanup action.
- All instructions emitted after this point are considered to be part
- of the region until expand_eh_region_end () is invoked. CLEANUP is
- the cleanup action to perform. The return value is true if the
- exception region was optimized away. If that case,
- expand_eh_region_end does not need to be called for this cleanup,
- nor should it be.
-
- This routine notices one particular common case in C++ code
- generation, and optimizes it so as to not need the exception
- region. */
-
-extern int expand_eh_region_start_tree PARAMS ((tree, tree));
-
-/* End an exception handling region. The information about the region
- is found on the top of ehstack.
-
- HANDLER is either the cleanup for the exception region, or if we're
- marking the end of a try block, HANDLER is integer_zero_node.
-
- HANDLER will be transformed to rtl when expand_leftover_cleanups ()
- is invoked. */
-
-extern void expand_eh_region_end PARAMS ((tree));
-
-/* Push RLABEL or TLABEL onto LABELSTACK. Only one of RLABEL or TLABEL
- should be set; the other must be NULL. */
-
-extern void push_label_entry PARAMS ((struct label_node **labelstack,
- rtx rlabel, tree tlabel));
-
-/* Pop the topmost entry from LABELSTACK and return its value as an
- rtx node. If LABELSTACK is empty, return NULL. */
-
-extern rtx pop_label_entry PARAMS ((struct label_node **labelstack));
-
-/* Return the topmost entry of LABELSTACK as a tree node, or return
- NULL_TREE if LABELSTACK is empty. */
-
-extern tree top_label_entry PARAMS ((struct label_node **labelstack));
-