Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

8325541: C2 SuperWord: refactor filter / split #17785

Closed
wants to merge 7 commits into from
Closed
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 1 addition & 3 deletions src/hotspot/share/opto/superword.cpp
Original file line number Diff line number Diff line change
@@ -519,10 +519,8 @@ bool SuperWord::SLP_extract() {

extend_packset_with_more_pairs_by_following_use_and_def();

// Combine pairs to longer packs
combine_pairs_to_longer_packs();

// Split packs if they are too long
split_packs_longer_than_max_vector_size();

// Now we only remove packs:
@@ -1701,7 +1699,7 @@ void SuperWord::filter_packs_for_alignment() {
int mem_ops_rejected = 0;

filter_packs("SuperWord::filter_packs_for_alignment",
"rejected by AlignVector (strinct alignment requirement)",
"rejected by AlignVector (strict alignment requirement)",
[&](const Node_List* pack) {
// Only memops need to be aligned.
if (!pack->at(0)->is_Load() &&
1 change: 0 additions & 1 deletion src/hotspot/share/opto/superword.hpp
Original file line number Diff line number Diff line change
@@ -488,7 +488,6 @@ class SuperWord : public ResourceObj {
// Combine packs A and B with A.last == B.first into A.first..,A.last,B.second,..B.last
void combine_pairs_to_longer_packs();

// Split packs that are too long
void split_packs_longer_than_max_vector_size();

// Filter out packs with various filter predicates