Searched refs:case_list (Results 1 - 9 of 9) sorted by relevance
/haiku-buildtools/gcc/gcc/fortran/ |
H A D | st.c | 139 if (p->ext.block.case_list) 140 gfc_free_case_list (p->ext.block.case_list);
|
H A D | class.c | 1992 block->ext.block.case_list = gfc_get_case (); 1993 block->ext.block.case_list->where = gfc_current_locus; 1995 block->ext.block.case_list->low 1999 block->ext.block.case_list->low 2001 block->ext.block.case_list->high 2002 = gfc_copy_expr (block->ext.block.case_list->low); 2034 block->ext.block.case_list = gfc_get_case ();
|
H A D | match.c | 3503 tail->ext.block.case_list = cp; 4395 c->ext.block.case_list = new_case; 5631 new_st.ext.block.case_list = c; 5663 new_st.ext.block.case_list = head; 5712 new_st.ext.block.case_list = c; 5762 new_st.ext.block.case_list = c; 5798 new_st.ext.block.case_list = c;
|
H A D | resolve.c | 7724 for (cp = body->ext.block.case_list; cp; cp = cp->next) 7752 for (cp = body->ext.block.case_list; cp; cp = cp->next) 7789 for (cp = body->ext.block.case_list; cp; cp = cp->next) 7891 while (body->ext.block.case_list != NULL 7892 && body->ext.block.case_list->unreachable) 7894 gfc_case *n = body->ext.block.case_list; 7895 body->ext.block.case_list = body->ext.block.case_list->next; 7901 if (body->ext.block.case_list) 7903 for (cp = body->ext.block.case_list; c [all...] |
H A D | trans-stmt.c | 2375 for (cp = c->ext.block.case_list; cp; cp = cp->next) 2487 for (cp = c->ext.block.case_list; cp; cp = cp->next) 2586 cp = code->block->ext.block.case_list; 2655 for (cp = c->ext.block.case_list; cp; cp = cp->next) 2784 for (d = c->ext.block.case_list; d; d = d->next)
|
H A D | gfortran.h | 2406 gfc_case *case_list; member in struct:gfc_code::__anon138::__anon140
|
H A D | frontend-passes.c | 2140 for (cp = b->ext.block.case_list; cp; cp = cp->next)
|
/haiku-buildtools/gcc/gcc/ |
H A D | stmt.c | 738 /* Do the insertion of a case label into case_list. The labels are 894 struct case_node *case_list, rtx default_label, 922 balance_case_nodes (&case_list, NULL); 928 dump_case_nodes (dump_file, case_list, indent_step, 0); 931 emit_case_nodes (index, case_list, default_label, default_prob, index_type); 985 struct case_node *case_list, rtx default_label, 992 rtx fallback_label = label_rtx (case_list->code_label); 1027 for (n = case_list; n; n = n->right) 1164 struct case_node *case_list = 0; 1248 case_list 884 emit_case_decision_tree(tree index_expr, tree index_type, struct case_node *case_list, rtx default_label, int default_prob) argument 975 emit_case_dispatch_table(tree index_expr, tree index_type, struct case_node *case_list, rtx default_label, tree minval, tree maxval, tree range, basic_block stmt_bb) argument 1155 struct case_node *case_list = 0; local 1336 struct case_node *case_list = 0; local [all...] |
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | stmt.c | 263 struct case_node *case_list; 4190 thiscase->data.case_stmt.case_list = 0; 4229 thiscase->data.case_stmt.case_list = 0; 4435 into case_stack->data.case_stmt.case_list. Use an AVL tree to avoid 4446 q = &case_stack->data.case_stmt.case_list; 4528 case_stack->data.case_stmt.case_list = r; 4564 case_stack->data.case_stmt.case_list = t; 4607 case_stack->data.case_stmt.case_list = r; 4645 case_stack->data.case_stmt.case_list = t; 4771 register struct case_node *n, *root = case_stack->data.case_stmt.case_list; 261 struct case_node *case_list; member in struct:nesting::__anon3445::__anon3449 [all...] |
Completed in 218 milliseconds