contrib/gcc/tree-cfg.c

266      Examine the last statement in each basic block to see if the block
272       tree last;
276       last = bsi_stmt (bsi);
280       if (last == factored_computed_goto)
283       /* If the last statement is a computed goto, factor it.  */
284       if (computed_goto_p (last))
318 			       var, GOTO_DESTINATION (last));
322 	  GOTO_DESTINATION (last) = factored_label_decl;
469       tree last = last_stmt (bb);
472       if (last)
474 	  enum tree_code code = TREE_CODE (last);
494 	      make_eh_edges (last);
502 	      if (tree_can_make_abnormal_goto (last))
507 	      make_eh_edges (last);
510 	      fallthru = !(call_expr_flags (last) & ECF_NORETURN);
514 	      if (is_ctrl_altering_stmt (last))
519 		  if (tree_can_make_abnormal_goto (last))
522 		  make_eh_edges (last);
584 	      gcc_assert (!stmt_ends_bb_p (last));
881   block_stmt_iterator last = bsi_last (bb);
882   tree goto_t = bsi_stmt (last);
894       bsi_remove (&last, true);
1115 	  /* The default label is always the last case in a switch
1120 	     Ignore the last element of the label vector because it
1318   tree_stmt_iterator last;
1394   last = tsi_last (a->stmt_list);
1395   tsi_link_after (&last, b->stmt_list, TSI_NEW_STMT);
1770   /* Record the last goto expr, so that we can delete it if unnecessary.  */
2094      loop above, so the last statement we process is the first statement
2309       fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2423       tree last = last_stmt (bb);
2434       if (last)
2436 	  end_code = TREE_CODE (last);
2438 	  end_line = get_lineno (last);
2611   block_stmt_iterator last;
2618       last = bsi_last (bb);
2652 	      bsi_remove (&last, true);
2658       /* There can be no fallthru edge if the last statement is a control
2680       bsi_insert_after (&last, stmt, BSI_NEW_STMT);
2704 /* Return the last statement in basic block BB.  */
2714 /* Return a pointer to the last statement in block BB.  */
2719   block_stmt_iterator last = bsi_last (bb);
2720   return !bsi_end_p (last) ? bsi_stmt_ptr (last) : NULL;
2724 /* Return the last statement of an otherwise empty block.  Return NULL
2732   tree last, prev;
2737   last = bsi_stmt (i);
2740     return last;
2751     return last;
2931   block_stmt_iterator last = bsi_last (bb);
2934   if (!bsi_end_p (last) && is_ctrl_stmt (bsi_stmt (last)))
2935     bsi_move_before (from, &last);
2937     bsi_move_after (from, &last);
3028      the last statement does not end a basic block, insert there.
4145 	    tree last, first;
4150 		last = cases;
4161 		TREE_CHAIN (last) = TREE_CHAIN (cases2);
4955       /* No need to update edge counts on the last block.  It has
5316   /* In the last basic block, before epilogue generation, there will be
5317      a fallthru edge to EXIT.  Special care is required if the last insn
5318      of the last basic block is a call because make_edge folds duplicate
5327      Handle this by adding a dummy instruction in a new last basic block.  */
5752   tree last;
5767 	  last = last_stmt (e->src);
5768 	  if (TREE_CODE (last) == RETURN_EXPR
5770 	      && (location = EXPR_LOCATION (last)) != UNKNOWN_LOCATION)
5772 	      && (locus = EXPR_LOCUS (last)) != NULL)
5796 	  tree last = last_stmt (e->src);
5797 	  if (TREE_CODE (last) == RETURN_EXPR
5798 	      && TREE_OPERAND (last, 0) == NULL
5799 	      && !TREE_NO_WARNING (last))
5802 	      location = EXPR_LOCATION (last);
5807 	      locus = EXPR_LOCUS (last);