static void emit_case_nodes PROTO((rtx, case_node_ptr, rtx, tree));
static int add_case_node PROTO((tree, tree, tree, tree *));
static struct case_node *case_tree2list PROTO((case_node *, case_node *));
-
+static void mark_seen_cases PROTO((tree, unsigned char *,
+ long, int));
\f
void
using_eh_for_cleanups ()
The time needed is proportional to COUNT, unless
SPARSENESS is 2, in which case quadratic time is needed. */
-void
+static void
mark_seen_cases (type, cases_seen, count, sparseness)
tree type;
unsigned char *cases_seen;