Lines Matching refs:cases
288 /* This function performs a depth-first search of the cases and puts them
313 list_add(&cse->node.link, &swtch->cases);
320 struct list_head cases;
321 list_replace(&swtch->cases, &cases);
322 list_inithead(&swtch->cases);
323 while (!list_is_empty(&cases)) {
325 list_first_entry(&cases, struct vtn_case, node.link);
371 /* When it comes to handling switch cases, we can break calls to
372 * vtn_handle_branch into two cases: calls from within a case construct
600 /* The two cases where we can get early exits from a construct that
602 * switch fall-throughs. In these cases, we need to break out of the
656 * handle this loop goes to the cases below and gets handled as a
772 list_inithead(&swtch->cases);
786 /* First, we go through and record all of the cases. */
787 vtn_parse_switch(b, swtch, block->branch, &swtch->cases);
790 vtn_foreach_cf_node(case_node, &swtch->cases) {
796 /* This is a "real" cases which has stuff in it */
988 vtn_foreach_cf_node(other_node, &swtch->cases) {
1181 /* Before we can emit anything, we need to sort the list of cases in
1196 /* Now we can walk the list of cases and actually emit code */
1197 vtn_foreach_cf_node(case_node, &vtn_switch->cases) {
1306 struct list_head cases;
1307 list_inithead(&cases);
1308 vtn_parse_switch(b, NULL, block->branch, &cases);
1313 vtn_foreach_cf_node(case_node, &cases) {
1337 /* now that all cases are handled, branch into the default block */
1395 * There are some cases where we need to repair SSA to insert