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

RISC-V: Remove redundant functions

Browse source 
I just finished V2 version of LMUL cost model.
Turns out we don't these redundant functions.

Remove them.

gcc/ChangeLog:

	* config/riscv/riscv-protos.h (get_all_predecessors): Remove.
	(get_all_successors): Ditto.
	* config/riscv/riscv-v.cc (get_all_predecessors): Ditto.
	(get_all_successors): Ditto.
This commit is contained in:
Juzhe-Zhong 2023-09-11 17:19:30 +08:00 • committed by Pan Li
parent 6f7f728746
commit 48d4ab6980
2 changed files with 0 additions and 50 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
gcc/config/riscv/riscv-protos.h
View file

@ -498,8 +498,6 @@ enum floating_point_rounding_mode get_frm_mode (rtx);
opt_machine_mode vectorize_related_mode (machine_mode, scalar_mode,
poly_uint64);
unsigned int autovectorize_vector_modes (vec<machine_mode> *, bool);
hash_set<basic_block> get_all_predecessors (basic_block);
hash_set<basic_block> get_all_successors (basic_block);
bool cmp_lmul_le_one (machine_mode);
bool cmp_lmul_gt_one (machine_mode);
}

48
gcc/config/riscv/riscv-v.cc
View file

@ -3388,54 +3388,6 @@ expand_fold_extract_last (rtx *ops)
emit_label (end_label);
}
hash_set<basic_block>
get_all_predecessors (basic_block bb)
{
hash_set<basic_block> blocks;
auto_vec<basic_block> work_list;
hash_set<basic_block> visited_list;
work_list.safe_push (bb);
while (!work_list.is_empty ())
{
basic_block new_bb = work_list.pop ();
visited_list.add (new_bb);
edge e;
edge_iterator ei;
FOR_EACH_EDGE (e, ei, new_bb->preds)
{
if (!visited_list.contains (e->src))
work_list.safe_push (e->src);
blocks.add (e->src);
}
}
return blocks;
}
hash_set<basic_block>
get_all_successors (basic_block bb)
{
hash_set<basic_block> blocks;
auto_vec<basic_block> work_list;
hash_set<basic_block> visited_list;
work_list.safe_push (bb);
while (!work_list.is_empty ())
{
basic_block new_bb = work_list.pop ();
visited_list.add (new_bb);
edge e;
edge_iterator ei;
FOR_EACH_EDGE (e, ei, new_bb->succs)
{
if (!visited_list.contains (e->dest))
work_list.safe_push (e->dest);
blocks.add (e->dest);
}
}
return blocks;
}
/* Return true if the LMUL of comparison less than or equal to one. */
bool
cmp_lmul_le_one (machine_mode mode)