procyberian/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

RISC-V: Remove redundant full available computation [NFC]

Browse source 
Notice full available is computed evey round of earliest fusion which is redundant.
Actually we only need to compute it once in phase 3.

It's NFC patch and tested no regression. Committed.

gcc/ChangeLog:

	* config/riscv/riscv-vsetvl.cc (pre_vsetvl::compute_vsetvl_def_data): Remove
	redundant full available computation.
	(pre_vsetvl::pre_global_vsetvl_info): Ditto.
This commit is contained in:
Juzhe-Zhong 2024-01-25 16:24:26 +08:00 • committed by Pan Li
parent e7d7c9e889
commit 5ee45f5e28
1 changed files with 23 additions and 34 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

57
gcc/config/riscv/riscv-vsetvl.cc
View file

@ -1256,9 +1256,7 @@ public:
vsetvl_info global_info;
bb_info *bb;
bool full_available;
vsetvl_block_info () : bb (nullptr), full_available (false)
vsetvl_block_info () : bb (nullptr)
{
local_infos.safe_grow_cleared (0);
global_info.set_empty ();
@ -2489,34 +2487,6 @@ pre_vsetvl::compute_vsetvl_def_data ()
}
}
for (const bb_info *bb : crtl->ssa->bbs ())
{
vsetvl_block_info &block_info = get_block_info (bb);
if (block_info.empty_p ())
continue;
vsetvl_info &curr_info = block_info.get_entry_info ();
if (!curr_info.valid_p ())
continue;
unsigned int expr_index;
sbitmap_iterator sbi;
gcc_assert (
!bitmap_empty_p (m_vsetvl_def_in[curr_info.get_bb ()->index ()]));
bool full_available = true;
EXECUTE_IF_SET_IN_BITMAP (m_vsetvl_def_in[bb->index ()], 0, expr_index,
sbi)
{
vsetvl_info &prev_info = *m_vsetvl_def_exprs[expr_index];
if (!prev_info.valid_p ()
|| !m_dem.available_p (prev_info, curr_info))
{
full_available = false;
break;
}
}
block_info.full_available = full_available;
}
sbitmap_vector_free (def_loc);
sbitmap_vector_free (m_kill);
}
@ -3178,11 +3148,30 @@ pre_vsetvl::pre_global_vsetvl_info ()
for (const bb_info *bb : crtl->ssa->bbs ())
{
vsetvl_block_info &block_info = get_block_info (bb);
if (block_info.empty_p () || !block_info.full_available)
if (block_info.empty_p ())
continue;
vsetvl_info &curr_info = block_info.get_entry_info ();
if (!curr_info.valid_p ())
continue;
vsetvl_info &info = block_info.get_entry_info ();
info.set_delete ();
unsigned int expr_index;
sbitmap_iterator sbi;
gcc_assert (
!bitmap_empty_p (m_vsetvl_def_in[curr_info.get_bb ()->index ()]));
bool full_available = true;
EXECUTE_IF_SET_IN_BITMAP (m_vsetvl_def_in[bb->index ()], 0, expr_index,
sbi)
{
vsetvl_info &prev_info = *m_vsetvl_def_exprs[expr_index];
if (!prev_info.valid_p ()
|| !m_dem.available_p (prev_info, curr_info))
{
full_available = false;
break;
}
}
if (full_available)
curr_info.set_delete ();
}
for (const bb_info *bb : crtl->ssa->bbs ())