flow.c (make_edges): Fix insn iteration.

* flow.c (make_edges): Fix insn iteration.
	(find_basic_blocks): Assign NULL_RTX, not 0, to rtx.
	(find_basic_blocks_1): Fix spelling mistake.

From-SVN: r29818
This commit is contained in:
Anthony Green 1999-10-05 03:44:26 +00:00 committed by Anthony Green
parent 1fef02f64a
commit 7a3b7acb7c
2 changed files with 9 additions and 3 deletions

View File

@ -1,3 +1,9 @@
Mon Oct 4 20:25:13 1999 Anthony Green <green@cygnus.com>
* flow.c (make_edges): Fix insn iteration.
(find_basic_blocks): Assign NULL_RTX, not 0, to rtx.
(find_basic_blocks_1): Fix spelling mistake.
Mon Oct 4 16:56:11 1999 Richard Henderson <rth@cygnus.com>
* tree.c (build1): Set TREE_SIDE_EFFECTS for expressions that

View File

@ -435,7 +435,7 @@ find_basic_blocks (f, nregs, file, do_cleanup)
calculate_loop_depth (f);
/* Kill the data we won't maintain. */
label_value_list = 0;
label_value_list = NULL_RTX;
#ifdef ENABLE_CHECKING
verify_flow_info ();
@ -633,7 +633,7 @@ find_basic_blocks_1 (f)
else
{
/* ??? Make a special check for table jumps. The way this
happens is truely and amazingly gross. We are about to
happens is truly and amazingly gross. We are about to
create a basic block that contains just a code label and
an addr*vec jump insn. Worse, an addr_diff_vec creates
its own natural loop.
@ -985,7 +985,7 @@ make_edges (label_value_list)
if (bb->eh_beg >= 0)
make_eh_edge (eh_nest_info, bb, NULL_RTX, bb->eh_beg);
for (x = bb->head; x != bb->end; x = PREV_INSN (x))
for (x = bb->head; x != bb->end; x = NEXT_INSN (x))
if (GET_CODE (x) == NOTE
&& (NOTE_LINE_NUMBER (x) == NOTE_INSN_EH_REGION_BEG
|| NOTE_LINE_NUMBER (x) == NOTE_INSN_EH_REGION_END))