Home
last modified time | relevance | path

Searched refs:case_list (Results 1 – 6 of 6) sorted by relevance

/openbsd/src/usr.bin/rpcgen/
Drpc_parse.h101 struct case_list { struct
105 struct case_list *next; argument
107 typedef struct case_list case_list; typedef
111 case_list *cases;
Drpc_parse.c292 case_list *cases;
293 case_list **tailp;
309 cases = malloc(sizeof(case_list));
320 cases = malloc(sizeof(case_list));
327 cases = malloc(sizeof(case_list));
Drpc_hout.c193 case_list *l;
Drpc_cout.c341 case_list *cl;
/openbsd/src/gnu/usr.bin/gcc/gcc/
Dstmt.c238 struct case_node *case_list; member
4452 thiscase->data.case_stmt.case_list = 0;
4491 thiscase->data.case_stmt.case_list = 0; in expand_start_case_dummy()
4713 q = &case_stack->data.case_stmt.case_list;
4789 case_stack->data.case_stmt.case_list = r;
4825 case_stack->data.case_stmt.case_list = t;
4868 case_stack->data.case_stmt.case_list = r;
4906 case_stack->data.case_stmt.case_list = t;
5018 struct case_node *n, *root = case_stack->data.case_stmt.case_list;
5063 case_stack->data.case_stmt.case_list = root = case_tree2list (root, 0);
[all …]
/openbsd/src/gnu/gcc/gcc/
Dstmt.c2330 struct case_node *case_list = 0; in expand_case() local
2371 case_list = add_case_node (case_list, index_type, low, high, in expand_case()
2384 for (n = case_list; n; n = n->right) in expand_case()
2451 case_list, default_label); in expand_case()
2514 && estimate_case_costs (case_list)); in expand_case()
2515 balance_case_nodes (&case_list, NULL); in expand_case()
2516 emit_case_nodes (index, case_list, default_label, index_type); in expand_case()
2548 for (n = case_list; n; n = n->right) in expand_case()