contrib/gcc/tree-cfg.c

76   /* The case labels associated with this edge.  We link these up via
139   /* Build a mapping of labels to their associated blocks.  */
194   /* To speed up statement iterator walks, we first purge dead labels.  */
198      We do this after cleaning up dead labels because otherwise we miss
687 /* Start recording information mapping edges to case labels.  */
700 /* Return nonzero if we are recording information for case labels.  */
708 /* Stop recording information mapping edges to case labels and
907 /* Cleanup useless labels in basic blocks.  This is something we wish
908    to do early because it allows us to group case labels before creating
927       /* ??? After optimizing, there may be EH regions with labels
950 /* Cleanup redundant labels.  This is a three-step process:
952      2) Redirect all references to labels to the leading labels.
953      3) Cleanup all useless labels.  */
977 	     remember this one and see if there are more labels.  */
1027 	    /* Replace all destination labels.  */
1055   /* Finally, purge dead labels.  All user-defined labels, labels that
1056      can be the target of non-local gotos, labels which have their
1057      address taken and labels which have attributes or alignment are
1109 	  tree labels = SWITCH_LABELS (stmt);
1110 	  int old_size = TREE_VEC_LENGTH (labels);
1112 	  tree default_case = TREE_VEC_ELT (labels, old_size - 1);
1126 	      base_case = TREE_VEC_ELT (labels, i);
1135 		  TREE_VEC_ELT (labels, i) = NULL_TREE;
1144 	      /* Try to merge case labels.  Break out when we reach the end
1149 		  tree merge_case = TREE_VEC_ELT (labels, i);
1162 		      TREE_VEC_ELT (labels, i) = NULL_TREE;
1171 	  /* Compress the case labels in the label vector, and adjust the
1175 	      while (! TREE_VEC_ELT (labels, j))
1177 	      TREE_VEC_ELT (labels, i) = TREE_VEC_ELT (labels, j++);
1179 	  TREE_VEC_LENGTH (labels) = new_size;
1233   /* Do not remove user labels.  */
1366   /* Remove labels from B and set bb_for_stmt to A for other statements.  */
1793   /* ??? Add something here to delete unused labels.  */
2206    We can make optimal use here of the fact that the case labels are
2501 	 function has nonlocal labels.  */
2560    wasn't a label.  Otherwise, sequence of labels would generate
2775       /* If the statement is a label, add the label to block-to-labels map
3008       /* Make sure we insert after any leading labels.  */
3710       /* Skip labels on the start of basic block.  */
3724 	      fprintf (stderr, " is not first in a sequence of labels in bb %d",
3858 	      /* FIXME.  We should double check that the labels in the
3909 	    /* Verify that the case labels are sorted.  */
3922 		    error ("case labels not sorted: ");
4216    labels).  If STMT is NULL, BB is split just after the labels.  */