Lines Matching defs:blocks

172 	     blocks) we can delete a label that's a target of the vector
363 to post-process the stream to remove empty blocks, loops, ranges, etc. */
564 /* Detect basic blocks with nothing but a label. This can happen
573 /* Delete the basic block note and handle blocks containing just that
619 hanging out between the two blocks. */
644 /* If we are partitioning hot/cold basic blocks, we don't want to
649 be optimizable (or blocks that appear to be mergeable), but which really
657 /* There must be exactly one edge in between the blocks. */
704 /* If we are partitioning hot/cold basic blocks, we don't want to
709 be optimizable (or blocks that appear to be mergeable), but which really
961 expense of adding new instructions or reordering basic blocks.
1202 blocks by nopping out blocks, leaving multiple BARRIERs between here
1293 /* If this is a fall through edge to the exit block, the blocks might be
1334 /* Queue instructions for insertion on an edge between two basic blocks.
1335 The new instructions and basic blocks (if any) will not appear in the
1508 sbitmap blocks;
1531 blocks = sbitmap_alloc (last_basic_block);
1532 sbitmap_zero (blocks);
1536 SET_BIT (blocks, bb->index);
1542 find_many_sub_basic_blocks (blocks);
1543 sbitmap_free (blocks);
1554 sbitmap blocks;
1577 blocks = sbitmap_alloc (last_basic_block);
1578 sbitmap_zero (blocks);
1582 SET_BIT (blocks, bb->index);
1588 find_many_sub_basic_blocks (blocks);
1589 sbitmap_free (blocks);
1677 fprintf (outf, ";; Insn is in multiple basic blocks\n");
1750 - overlapping of basic blocks
1751 - headers of basic blocks (the NOTE_INSN_BASIC_BLOCK note)
1752 - tails of basic blocks (ensure that boundary is necessary)
1758 (reachability of basic blocks, life information, etc. etc.). */
1804 error ("insn %d is in multiple basic blocks (%d and %d)",
1824 /* Now check the basic blocks (boundaries etc.) */
1965 /* Do checks for empty blocks here. */
1998 - check that all insns are in the basic blocks
2001 - check that all fallthru edge points to the adjacent blocks. */
2050 ("verify_flow_info: Incorrect blocks for fallthru %i->%i",
2078 internal_error ("basic blocks not laid down consecutively");
2342 /* Search all basic blocks for potentially dead edges and purge them. Return
2552 /* Return true when blocks A and B can be safely merged. */
2556 /* If we are partitioning hot/cold basic blocks, we don't want to
2561 be optimizable (or blocks that appear to be mergeable), but which really
2569 /* There must be exactly one edge in between the blocks. */
2584 /* Merge block A and B. The blocks must be mergeable. */
2619 /* In the case basic blocks are not adjacent, move them around. */
2670 fprintf (dump_file, "Merged blocks %d and %d.\n",
2756 calls, volatile inline assembly in the bitmap of blocks specified by
2757 BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks
2764 rtl_flow_call_edges_add (sbitmap blocks)
2774 if (! blocks)
2777 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
2827 if (blocks && !TEST_BIT (blocks, i))
2859 and renumber the existing basic blocks. */