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

[Enhancement]generate new range faster #55627

Merged
merged 3 commits into from
Feb 8, 2025
Merged

Conversation

zombee0
Copy link
Contributor

@zombee0 zombee0 commented Feb 6, 2025

Why I'm doing:

I checked assembly code, complier can't generate branch-less code,
and it's not critical part in cpu usage, so just use simple way

What I'm doing:

Fixes #issue

What type of PR is this:

  • BugFix
  • Feature
  • Enhancement
  • Refactor
  • UT
  • Doc
  • Tool

Does this PR entail a change in behavior?

  • Yes, this PR will result in a change in behavior.
  • No, this PR will not result in a change in behavior.

If yes, please specify the type of change:

  • Interface/UI changes: syntax, type conversion, expression evaluation, display information
  • Parameter changes: default values, similar parameters but with different default values
  • Policy changes: use new policy to replace old one, functionality automatically enabled
  • Feature removed
  • Miscellaneous: upgrade & downgrade compatibility, etc.

Checklist:

  • I have added test cases for my bug fix or my new feature
  • This pr needs user documentation (for new or modified features or behaviors)
    • I have added documentation for my new feature or new function
  • This is a backport pr

Bugfix cherry-pick branch check:

  • I have checked the version labels which the pr will be auto-backported to the target branch
    • 3.4
    • 3.3
    • 3.2
    • 3.1
    • 3.0

@zombee0 zombee0 requested a review from a team as a code owner February 6, 2025 12:31
@mergify mergify bot assigned zombee0 Feb 6, 2025
Signed-off-by: zombee0 <ewang2027@gmail.com>
start = start > i && filter->data()[i] == 1 ? i : start;
end = end < i && filter->data()[i] == 1 ? i : end;
int32_t tail_index = filter->size() - 1 - i;
end = end < tail_index && filter->data()[tail_index] == 1 ? tail_index : end;
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

What is this function used for? I couldn't understand its meaning just by looking at the code. Is it for finding the upper and lower bounds? Why not just write two loops—one for finding the start and one for finding the end?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Yes, it's used to find upper and lower bounds, i think less loop, less branch, we also use ?: to reduce branch.

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

? is also one branch?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

i think it can be optimized as cmov

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I checked assembly code
complier cann't generate branch-less code, and it's not critical part in cpu usage,
so just use simple way

Signed-off-by: zombee0 <ewang2027@gmail.com>
trueeyu
trueeyu previously approved these changes Feb 7, 2025
dirtysalt
dirtysalt previously approved these changes Feb 7, 2025
complier cann't generate branch-less code,
and it's not critical part in cpu usage,
so just use simple way

Signed-off-by: zombee0 <ewang2027@gmail.com>
Copy link

github-actions bot commented Feb 7, 2025

[Java-Extensions Incremental Coverage Report]

pass : 0 / 0 (0%)

Copy link

github-actions bot commented Feb 7, 2025

[FE Incremental Coverage Report]

pass : 0 / 0 (0%)

Copy link

github-actions bot commented Feb 7, 2025

[BE Incremental Coverage Report]

pass : 6 / 6 (100.00%)

file detail

path covered_line new_line coverage not_covered_line_detail
🔵 be/src/storage/range.h 6 6 100.00% []

@wyb wyb merged commit 712fc09 into StarRocks:main Feb 8, 2025
66 checks passed
Copy link

github-actions bot commented Feb 8, 2025

@Mergifyio backport branch-3.4

@github-actions github-actions bot removed the 3.4 label Feb 8, 2025
Copy link

github-actions bot commented Feb 8, 2025

@Mergifyio backport branch-3.3

@github-actions github-actions bot removed the 3.3 label Feb 8, 2025
Copy link
Contributor

mergify bot commented Feb 8, 2025

backport branch-3.4

✅ Backports have been created

Copy link
Contributor

mergify bot commented Feb 8, 2025

backport branch-3.3

✅ Backports have been created

mergify bot pushed a commit that referenced this pull request Feb 8, 2025
Signed-off-by: zombee0 <ewang2027@gmail.com>
(cherry picked from commit 712fc09)
mergify bot pushed a commit that referenced this pull request Feb 8, 2025
Signed-off-by: zombee0 <ewang2027@gmail.com>
(cherry picked from commit 712fc09)

# Conflicts:
#	be/src/storage/range.h
@github-actions github-actions bot added the 3.4 label Feb 8, 2025
wanpengfei-git pushed a commit that referenced this pull request Feb 17, 2025
Co-authored-by: zombee0 <ewang2027@gmail.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

5 participants